{"meta":{"query_hash":"eb5e94b1e0e5","filters":{"venue":"Information and Control Systems"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/eb5e94b1e0e5","api":"https://metacan.xera.ac/api/v1/cohort?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,"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; 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","score_opus":0.0037901574161050867,"score_gpt":0.17382873416527453,"score_spread":0.17003857674916945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749014923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076149076,0.00079822855,0.79895866,0.00082527625,0.0006494623,0.00019947454,0.00025129045,0.0006841859,0.121484414],"genre_scores_gemma":[0.5318733,0.00087788625,0.43456656,0.00054150086,0.00019889657,0.00032673535,0.0004059603,0.0003577302,0.030851437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999273,0.000216546,0.000027697672,0.00010633126,0.0002822515,0.000094219016],"domain_scores_gemma":[0.99941516,0.00015274934,0.00005462103,0.00018654282,0.0001278726,0.00006319338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063338614,0.00060045026,0.0005066509,0.0013611614,0.0012106149,0.001457077,0.0009772517,0.0008100317,0.006232514],"category_scores_gemma":[0.0016438358,0.00053916755,0.0007077557,0.000590885,0.0016041716,0.0016538595,0.0015760252,0.0018433636,0.0019108607],"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.00001585228,0.00001388146,0.000082958286,0.00004868501,0.0000055493524,0.000081945196,0.000115765535,0.0016836728,0.006319861,0.9810364,0.0011283859,0.009466989],"study_design_scores_gemma":[0.00003308829,0.00009127061,0.00014007319,0.000051385563,0.000009687397,0.00043970434,0.0001167312,0.03530494,0.028569384,0.9029293,0.032259453,0.000054968754],"about_ca_topic_score_codex":0.00026331865,"about_ca_topic_score_gemma":0.000376959,"teacher_disagreement_score":0.006232514,"about_ca_system_score_codex":0.0005886876,"about_ca_system_score_gemma":0.0006805767,"threshold_uncertainty_score":0.020849764},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.002750279093694454,"score_gpt":0.1635226526549562,"score_spread":0.16077237356126173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963006461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5967661,0.0008703309,0.36184683,0.00045496412,0.00017404676,0.00016394789,0.00079317874,0.00032579148,0.038604658],"genre_scores_gemma":[0.85558736,0.00027167282,0.13478415,0.00008279976,0.000041188738,0.000074229574,0.0005975836,0.00005269652,0.008508337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996111,0.00008663559,0.000020309895,0.00006646288,0.00015179304,0.00006374908],"domain_scores_gemma":[0.99885845,0.00047049808,0.0001732087,0.00020383975,0.00021648836,0.00007751655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547403,0.00048802016,0.00033929356,0.00073820027,0.00057426596,0.00046633772,0.00036723193,0.00033343353,0.006000697],"category_scores_gemma":[0.0021053797,0.0002057791,0.00045143452,0.00050833117,0.0008964741,0.0008257893,0.0002979664,0.0006516864,0.0010943058],"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.0007382175,0.00014432709,0.004398052,0.00037782604,0.000039351493,0.0010503414,0.0004620753,0.04210987,0.091657504,0.75620013,0.004204045,0.0986183],"study_design_scores_gemma":[0.0001922998,0.0011329429,0.003886084,0.00011476205,0.00006942697,0.0032084468,0.0004285767,0.18419844,0.22138031,0.5321005,0.05307435,0.0002138941],"about_ca_topic_score_codex":0.000549465,"about_ca_topic_score_gemma":0.0007217327,"teacher_disagreement_score":0.006000697,"about_ca_system_score_codex":0.000469165,"about_ca_system_score_gemma":0.0005664091,"threshold_uncertainty_score":0.020074308},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.002459892335687036,"score_gpt":0.14795452638362047,"score_spread":0.14549463404793345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982082459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7911472,0.00032808553,0.17573993,0.0002584229,0.00010090092,0.00008985447,0.00017978359,0.0002243678,0.0319314],"genre_scores_gemma":[0.94018805,0.00014720489,0.05220313,0.00007810101,0.00003664737,0.000089784226,0.0002985877,0.00005530823,0.0069032055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.0001099551,0.000024390312,0.000060663937,0.00019968009,0.00008001563],"domain_scores_gemma":[0.9995091,0.00015361777,0.00009380056,0.00010159627,0.00008284055,0.000059066995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004355135,0.0004352157,0.00032531176,0.000946847,0.00086746505,0.000597803,0.00050785556,0.0005488591,0.00300778],"category_scores_gemma":[0.0012647894,0.00027968784,0.0007246314,0.00040172492,0.0010608217,0.00083384785,0.0006788724,0.0008163319,0.000526155],"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.00022603583,0.000057939462,0.0016484496,0.00012326024,0.000023661403,0.0008255378,0.0005463295,0.01117222,0.030251078,0.92887634,0.0011805051,0.025068741],"study_design_scores_gemma":[0.00014165754,0.00044847222,0.0030368252,0.00006819833,0.0000321436,0.0019914617,0.0003979004,0.09683112,0.07779728,0.79670376,0.022454679,0.00009652736],"about_ca_topic_score_codex":0.0006344577,"about_ca_topic_score_gemma":0.0005720112,"teacher_disagreement_score":0.00300778,"about_ca_system_score_codex":0.00077797665,"about_ca_system_score_gemma":0.0004176893,"threshold_uncertainty_score":0.010061979},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006935592973951402,"score_gpt":0.1591168324270149,"score_spread":0.1521812394530635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081345703","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32357532,0.0025411276,0.32723287,0.0015336914,0.0019106037,0.0003245852,0.0008743436,0.00082773174,0.3411797],"genre_scores_gemma":[0.8918874,0.0009232882,0.056946978,0.00074189674,0.0007901495,0.00022527452,0.00071461196,0.0002571004,0.04751313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931157,0.00014493694,0.000039029906,0.0001336515,0.00024573365,0.00012503298],"domain_scores_gemma":[0.99929106,0.00015296464,0.0001193662,0.00010434525,0.00020015142,0.00013209182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039283675,0.00057276955,0.0003395571,0.0012857278,0.0010238864,0.0020051836,0.00052771,0.0007552944,0.013961906],"category_scores_gemma":[0.0015726269,0.00020892192,0.0004997198,0.00074645464,0.0012255266,0.0017000791,0.0012266921,0.0013845079,0.0022047174],"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.00003307046,0.000011168505,0.0001243912,0.00004800572,0.000003563818,0.00009347494,0.00013306149,0.00076203386,0.0024160375,0.98494315,0.002309048,0.0091229435],"study_design_scores_gemma":[0.000021740898,0.000096928525,0.0004394093,0.00004500611,0.000006614961,0.00076867687,0.00015930856,0.009882486,0.0073586646,0.9387544,0.042422194,0.000044561297],"about_ca_topic_score_codex":0.00037490836,"about_ca_topic_score_gemma":0.00033218818,"teacher_disagreement_score":0.013961906,"about_ca_system_score_codex":0.0008640795,"about_ca_system_score_gemma":0.0004761016,"threshold_uncertainty_score":0.046707273},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Legendre polynomials; Mathematics; Circulant matrix; Combinatorics; Hadamard transform; Mathematical analysis","score_opus":0.006628157526751887,"score_gpt":0.17936101659321846,"score_spread":0.17273285906646657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135767204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66509223,0.00090862805,0.24040698,0.0005932567,0.00046630402,0.00027808963,0.00049661164,0.0008416726,0.09091628],"genre_scores_gemma":[0.8576235,0.0003246975,0.12718914,0.00026266085,0.000104386636,0.0002162304,0.0006389696,0.00023312663,0.013407217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.00012317128,0.000044796965,0.000118872056,0.00021523758,0.00012860676],"domain_scores_gemma":[0.998629,0.0004283121,0.00025977567,0.0002941651,0.00020114992,0.00018763723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047127993,0.0005796214,0.00036521084,0.00072461826,0.001008284,0.0010417342,0.0004993934,0.0008474761,0.008536675],"category_scores_gemma":[0.0022145188,0.0003408283,0.00077719084,0.0004527399,0.0014155364,0.0013769809,0.0013510153,0.0014875642,0.0013036043],"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.000413284,0.00014504409,0.0034242654,0.00026700803,0.000021829283,0.00068798405,0.0005869638,0.0060715773,0.03974345,0.8853256,0.0036409767,0.059672054],"study_design_scores_gemma":[0.00012556794,0.0012914964,0.0039178776,0.0002267371,0.00006983478,0.0032332137,0.0005605427,0.033353515,0.1338749,0.7364729,0.08665719,0.0002162538],"about_ca_topic_score_codex":0.00018397937,"about_ca_topic_score_gemma":0.0002856339,"teacher_disagreement_score":0.008536675,"about_ca_system_score_codex":0.0007298632,"about_ca_system_score_gemma":0.0006132904,"threshold_uncertainty_score":0.028558016},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0037249913874403484,"score_gpt":0.16035350967793838,"score_spread":0.15662851829049804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280580529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80319136,0.0011520142,0.13638864,0.00064802903,0.00026971058,0.00011666263,0.00049708673,0.0004009747,0.057335455],"genre_scores_gemma":[0.92846215,0.00033884987,0.059153505,0.00014704074,0.00007346826,0.00007020427,0.00043291846,0.00004323934,0.011278625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.000094787305,0.000024648816,0.000083560044,0.00018332028,0.000070276496],"domain_scores_gemma":[0.9993637,0.00020219065,0.0001015844,0.00012691003,0.000110810564,0.000094812945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034523002,0.00040119025,0.00032761303,0.0008508632,0.00094466907,0.00089498225,0.00048730752,0.0006827595,0.0048671425],"category_scores_gemma":[0.0011336991,0.00032411743,0.0005190421,0.000475779,0.0009415236,0.0012093494,0.0008551763,0.0008022797,0.0006737499],"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.00027706331,0.00008254062,0.0027868939,0.00022347135,0.000030471372,0.0013688157,0.0007270369,0.00850573,0.03899666,0.9042468,0.0027028676,0.04005161],"study_design_scores_gemma":[0.00016110968,0.00068930996,0.0039518583,0.0001220713,0.000064913795,0.0056690793,0.00059426937,0.102720656,0.13803998,0.6713305,0.076472275,0.00018395566],"about_ca_topic_score_codex":0.00029072684,"about_ca_topic_score_gemma":0.00031472827,"teacher_disagreement_score":0.0048671425,"about_ca_system_score_codex":0.00067491084,"about_ca_system_score_gemma":0.0004277289,"threshold_uncertainty_score":0.0162822},"labels":[],"label_agreement":null}]}