{"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":"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.862455,0.0031609267,0.022170488,0.000054070315,0.0039122608,0.0007597691,0.000088631365,0.00029764418,0.10710118],"genre_scores_gemma":[0.99982667,0.00006772278,0.0000148425315,0.0000064207948,0.000043575892,0.000017435903,0.0000025333452,0.0000033175102,0.000017460528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994383,0.000017313527,0.00032578793,0.00003191353,0.00010370145,0.00008298433],"domain_scores_gemma":[0.99950147,0.000026084319,0.00020279948,0.00017584184,0.000056929795,0.000036858954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023679425,0.00007087366,0.00016917658,0.00014556717,0.00012146628,0.00018232007,0.00009551891,0.000058106853,0.0000036329695],"category_scores_gemma":[0.000027014688,0.000062284686,0.000030588053,0.000050212504,0.000041039802,0.0008483557,0.000006424808,0.000041289746,0.000020278396],"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.00011266695,0.000015970061,0.039526265,0.0034531723,0.00045833515,0.0000019457218,0.001388393,0.008154144,0.0016196384,0.79490024,0.0010997768,0.14926945],"study_design_scores_gemma":[0.009815249,0.0002165815,0.0785137,0.00074731314,0.00020253133,0.00032556383,0.006177995,0.73011255,0.0014191377,0.0024981203,0.16890883,0.0010624082],"about_ca_topic_score_codex":0.00007100563,"about_ca_topic_score_gemma":0.0000013397067,"teacher_disagreement_score":0.79240215,"about_ca_system_score_codex":0.000009070524,"about_ca_system_score_gemma":0.0000048432235,"threshold_uncertainty_score":0.25398958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91551447,0.00673337,0.02030975,0.000047623285,0.0017241562,0.0008653665,0.00006396619,0.00032703378,0.05441428],"genre_scores_gemma":[0.9997448,0.000081684804,0.000008739165,0.000037719714,0.000071363,0.000019607227,0.0000034843397,0.0000057207426,0.000026925563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992688,0.000031175638,0.00039662668,0.000050078594,0.00012523393,0.00012812304],"domain_scores_gemma":[0.99958646,0.000054816795,0.00010656148,0.00010179065,0.00008999299,0.000060395112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031818618,0.00010269998,0.00021454817,0.00024176059,0.00006206187,0.00009080448,0.000059623337,0.000073855444,0.0000067355527],"category_scores_gemma":[0.000021155505,0.000087530316,0.000026455611,0.00023309102,0.00005129137,0.0005155468,0.0000075531516,0.000046218272,0.000030240406],"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.000781515,0.00010621028,0.041061178,0.016539684,0.0022953316,0.000009109767,0.022545116,0.009866393,0.009451389,0.63621116,0.016817441,0.24431549],"study_design_scores_gemma":[0.008732447,0.000587057,0.013255602,0.000569704,0.00017760176,0.00021102975,0.0076836753,0.6826611,0.0007496868,0.00071206625,0.28363943,0.0010205719],"about_ca_topic_score_codex":0.00011292608,"about_ca_topic_score_gemma":0.0000046198275,"teacher_disagreement_score":0.67279476,"about_ca_system_score_codex":0.000009401209,"about_ca_system_score_gemma":0.0000064234296,"threshold_uncertainty_score":0.35693827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98734844,0.0009925636,0.00250684,0.000016608656,0.00041937677,0.0005387413,0.000075346965,0.00031078747,0.007791303],"genre_scores_gemma":[0.9995837,0.00004872464,0.000009030837,0.00005717746,0.000037218844,0.000060127637,0.000023417366,0.000009374228,0.00017123492],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.000044896286,0.00039434477,0.0000850999,0.00017958439,0.00016087685],"domain_scores_gemma":[0.99948263,0.00008093584,0.00010996377,0.00019866461,0.00006321913,0.00006456323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016084913,0.00015938847,0.0002872477,0.000105605,0.0000475212,0.0002011359,0.00009340897,0.000086664586,0.000010687943],"category_scores_gemma":[0.000006275222,0.00011746022,0.00003024341,0.00012241848,0.000017271763,0.00051364035,0.0000074731565,0.00008728156,0.00015384436],"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.0021015254,0.000112948415,0.4665325,0.00835786,0.0041093575,0.000036142996,0.040935148,0.3452524,0.039983105,0.04269236,0.004145881,0.04574078],"study_design_scores_gemma":[0.008944361,0.0002966177,0.052538294,0.0011257909,0.00014805714,0.00013060906,0.017221712,0.865921,0.0005424913,0.00020137212,0.051701374,0.001228313],"about_ca_topic_score_codex":0.00037960612,"about_ca_topic_score_gemma":0.000012572439,"teacher_disagreement_score":0.5206686,"about_ca_system_score_codex":0.000017309469,"about_ca_system_score_gemma":0.000009387765,"threshold_uncertainty_score":0.4789889},"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":"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.5650984,0.010934169,0.3249488,0.00093771605,0.0033620533,0.0017859016,0.00077887654,0.0025022656,0.08965181],"genre_scores_gemma":[0.999561,0.000040361203,0.0000065935187,0.00021059463,0.00011493417,0.000029070758,0.000021739024,0.0000053637214,0.000010329324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993906,0.000029550758,0.00030871245,0.000053812582,0.00010836554,0.00010893062],"domain_scores_gemma":[0.9996958,0.000030948726,0.000057886075,0.00007568337,0.000035170528,0.00010451932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083594256,0.000101115875,0.0001747003,0.00003486206,0.000044884644,0.00018349281,0.00008314081,0.00006213582,0.00003311681],"category_scores_gemma":[0.000008091342,0.00009043066,0.000028856708,0.00007484528,0.00001269178,0.00064159214,0.0000061615215,0.00006913644,0.00023676788],"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.00076799555,0.000051111252,0.019417545,0.0074370313,0.0022812968,0.000040352297,0.104025155,0.23076874,0.021972671,0.4475857,0.052921448,0.11273095],"study_design_scores_gemma":[0.0015123973,0.000040064802,0.00074353814,0.00007135331,0.000027504804,0.0000089683035,0.0055545974,0.83737665,0.00014571584,0.00011780943,0.15412617,0.00027523888],"about_ca_topic_score_codex":0.000062690866,"about_ca_topic_score_gemma":0.0000021255116,"teacher_disagreement_score":0.6066079,"about_ca_system_score_codex":0.000007417348,"about_ca_system_score_gemma":0.00000656928,"threshold_uncertainty_score":0.3687655},"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":"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.040967897,0.008746282,0.91460186,0.0003116877,0.0040294556,0.0014940667,0.00015670765,0.00077412516,0.028917897],"genre_scores_gemma":[0.99937046,0.000025774683,0.000024496649,0.00009652986,0.00018515407,0.000088762674,0.000030574665,0.000009435597,0.00016880056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931157,0.000016562719,0.0003530146,0.000060376737,0.00009501069,0.0001634956],"domain_scores_gemma":[0.99959296,0.00006071068,0.000051367482,0.00014091194,0.0000623177,0.00009173967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018570918,0.0001099749,0.00019316065,0.00005324004,0.0000733561,0.00015520077,0.000056343357,0.00008304054,0.000012068189],"category_scores_gemma":[0.000021204422,0.000103740436,0.00006367132,0.00007936407,0.000008511789,0.00049888453,0.000005052282,0.000055934845,0.000052371328],"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.00020340845,0.000037073947,0.0027780181,0.004411392,0.0011096507,0.000011445284,0.006698112,0.07612282,0.0065734386,0.65840596,0.070203125,0.17344557],"study_design_scores_gemma":[0.0039963597,0.000047897942,0.0007710383,0.00013181203,0.000048376078,0.00010640258,0.0025597762,0.2788771,0.00048048873,0.0012068256,0.7113963,0.00037761286],"about_ca_topic_score_codex":0.000028884126,"about_ca_topic_score_gemma":0.000029586492,"teacher_disagreement_score":0.9584026,"about_ca_system_score_codex":0.000016598024,"about_ca_system_score_gemma":0.00002440163,"threshold_uncertainty_score":0.42304122},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6207408,0.14952415,0.059139814,0.0010437738,0.0297831,0.006142115,0.000692077,0.005418507,0.12751572],"genre_scores_gemma":[0.99928284,0.000057648867,0.0000032782289,0.00014051041,0.00015710916,0.00009565308,0.000012806918,0.0000074981294,0.00024264037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991847,0.00005160903,0.00034959038,0.000050335104,0.00021163857,0.00015211912],"domain_scores_gemma":[0.999665,0.000043108,0.00007605626,0.00011339132,0.000017185528,0.00008526213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312689,0.00009972681,0.00016952534,0.0002776074,0.00016076134,0.00014740709,0.0001067831,0.00003309734,0.00002809179],"category_scores_gemma":[0.000008122498,0.000096212774,0.000040417057,0.00028008482,0.000006711603,0.00073097815,0.00001677359,0.00010570716,0.00007337016],"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.00013015162,0.000026464506,0.0019412398,0.0010997789,0.00041846826,0.0000082761735,0.0038627898,0.29267257,0.00050318916,0.59717745,0.050325915,0.051833678],"study_design_scores_gemma":[0.0021062214,0.00007725894,0.0006337665,0.000020408592,0.000029206309,0.000102613005,0.0025336,0.24243973,0.000014350556,0.00070421695,0.75104344,0.00029519256],"about_ca_topic_score_codex":0.00009864257,"about_ca_topic_score_gemma":6.5026944e-7,"teacher_disagreement_score":0.7007175,"about_ca_system_score_codex":0.000042513257,"about_ca_system_score_gemma":0.0000146128805,"threshold_uncertainty_score":0.39234433},"labels":[],"label_agreement":null}]}