{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002367943,0.00007087366,0.0001691766,0.0001455672,0.0001214663,0.0001823201,0.00009551891,0.00005810685,0.00000363297],"category_scores_gemma":[0.00002701469,0.00006228469,0.00003058805,0.0000502125,0.0000410398,0.0008483557,0.000006424808,0.00004128975,0.0000202784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009070524,"about_ca_system_score_gemma":0.000004843223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007100563,"about_ca_topic_score_gemma":0.000001339707,"domain_scores_codex":[0.9994383,0.00001731353,0.0003257879,0.00003191353,0.0001037015,0.00008298433],"domain_scores_gemma":[0.9995015,0.00002608432,0.0002027995,0.0001758418,0.0000569298,0.00003685895],"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.000112667,0.00001597006,0.03952627,0.003453172,0.0004583352,0.000001945722,0.001388393,0.008154144,0.001619638,0.7949002,0.001099777,0.1492694],"study_design_scores_gemma":[0.009815249,0.0002165815,0.0785137,0.0007473131,0.0002025313,0.0003255638,0.006177995,0.7301126,0.001419138,0.00249812,0.1689088,0.001062408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.862455,0.003160927,0.02217049,0.00005407031,0.003912261,0.0007597691,0.00008863136,0.0002976442,0.1071012],"genre_scores_gemma":[0.9998267,0.00006772278,0.00001484253,0.000006420795,0.00004357589,0.0000174359,0.000002533345,0.00000331751,0.00001746053],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7924021,"threshold_uncertainty_score":0.2539896,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003181862,0.0001027,0.0002145482,0.0002417606,0.00006206187,0.00009080448,0.00005962334,0.00007385544,0.000006735553],"category_scores_gemma":[0.00002115551,0.00008753032,0.00002645561,0.000233091,0.00005129137,0.0005155468,0.000007553152,0.00004621827,0.00003024041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009401209,"about_ca_system_score_gemma":0.00000642343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001129261,"about_ca_topic_score_gemma":0.000004619827,"domain_scores_codex":[0.9992688,0.00003117564,0.0003966267,0.00005007859,0.0001252339,0.000128123],"domain_scores_gemma":[0.9995865,0.0000548168,0.0001065615,0.0001017906,0.00008999299,0.00006039511],"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.000781515,0.0001062103,0.04106118,0.01653968,0.002295332,0.000009109767,0.02254512,0.009866393,0.009451389,0.6362112,0.01681744,0.2443155],"study_design_scores_gemma":[0.008732447,0.000587057,0.0132556,0.000569704,0.0001776018,0.0002110298,0.007683675,0.6826611,0.0007496868,0.0007120662,0.2836394,0.001020572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9155145,0.00673337,0.02030975,0.00004762329,0.001724156,0.0008653665,0.00006396619,0.0003270338,0.05441428],"genre_scores_gemma":[0.9997448,0.0000816848,0.000008739165,0.00003771971,0.000071363,0.00001960723,0.00000348434,0.000005720743,0.00002692556],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6727948,"threshold_uncertainty_score":0.3569383,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008359426,0.0001011159,0.0001747003,0.00003486206,0.00004488464,0.0001834928,0.00008314081,0.00006213582,0.00003311681],"category_scores_gemma":[0.000008091342,0.00009043066,0.00002885671,0.00007484528,0.00001269178,0.0006415921,0.000006161521,0.00006913644,0.0002367679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007417348,"about_ca_system_score_gemma":0.00000656928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006269087,"about_ca_topic_score_gemma":0.000002125512,"domain_scores_codex":[0.9993906,0.00002955076,0.0003087124,0.00005381258,0.0001083655,0.0001089306],"domain_scores_gemma":[0.9996958,0.00003094873,0.00005788607,0.00007568337,0.00003517053,0.0001045193],"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.0007679955,0.00005111125,0.01941754,0.007437031,0.002281297,0.0000403523,0.1040252,0.2307687,0.02197267,0.4475857,0.05292145,0.112731],"study_design_scores_gemma":[0.001512397,0.0000400648,0.0007435381,0.00007135331,0.0000275048,0.000008968304,0.005554597,0.8373767,0.0001457158,0.0001178094,0.1541262,0.0002752389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5650984,0.01093417,0.3249488,0.000937716,0.003362053,0.001785902,0.0007788765,0.002502266,0.08965181],"genre_scores_gemma":[0.999561,0.0000403612,0.000006593519,0.0002105946,0.0001149342,0.00002907076,0.00002173902,0.000005363721,0.00001032932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6066079,"threshold_uncertainty_score":0.3687655,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001608491,0.0001593885,0.0002872477,0.000105605,0.0000475212,0.0002011359,0.00009340897,0.00008666459,0.00001068794],"category_scores_gemma":[0.000006275222,0.0001174602,0.00003024341,0.0001224185,0.00001727176,0.0005136403,0.000007473157,0.00008728156,0.0001538444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001730947,"about_ca_system_score_gemma":0.000009387765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003796061,"about_ca_topic_score_gemma":0.00001257244,"domain_scores_codex":[0.9991352,0.00004489629,0.0003943448,0.0000850999,0.0001795844,0.0001608769],"domain_scores_gemma":[0.9994826,0.00008093584,0.0001099638,0.0001986646,0.00006321913,0.00006456323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002101525,0.0001129484,0.4665325,0.00835786,0.004109357,0.000036143,0.04093515,0.3452524,0.0399831,0.04269236,0.004145881,0.04574078],"study_design_scores_gemma":[0.008944361,0.0002966177,0.05253829,0.001125791,0.0001480571,0.0001306091,0.01722171,0.865921,0.0005424913,0.0002013721,0.05170137,0.001228313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873484,0.0009925636,0.00250684,0.00001660866,0.0004193768,0.0005387413,0.00007534696,0.0003107875,0.007791303],"genre_scores_gemma":[0.9995837,0.00004872464,0.000009030837,0.00005717746,0.00003721884,0.00006012764,0.00002341737,0.000009374228,0.0001712349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5206686,"threshold_uncertainty_score":0.4789889,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001857092,0.0001099749,0.0001931607,0.00005324004,0.0000733561,0.0001552008,0.00005634336,0.00008304054,0.00001206819],"category_scores_gemma":[0.00002120442,0.0001037404,0.00006367132,0.00007936407,0.000008511789,0.0004988845,0.000005052282,0.00005593484,0.00005237133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001659802,"about_ca_system_score_gemma":0.00002440163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002888413,"about_ca_topic_score_gemma":0.00002958649,"domain_scores_codex":[0.9993116,0.00001656272,0.0003530146,0.00006037674,0.00009501069,0.0001634956],"domain_scores_gemma":[0.999593,0.00006071068,0.00005136748,0.0001409119,0.0000623177,0.00009173967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002034084,0.00003707395,0.002778018,0.004411392,0.001109651,0.00001144528,0.006698112,0.07612282,0.006573439,0.658406,0.07020313,0.1734456],"study_design_scores_gemma":[0.00399636,0.00004789794,0.0007710383,0.000131812,0.00004837608,0.0001064026,0.002559776,0.2788771,0.0004804887,0.001206826,0.7113963,0.0003776129],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0409679,0.008746282,0.9146019,0.0003116877,0.004029456,0.001494067,0.0001567077,0.0007741252,0.0289179],"genre_scores_gemma":[0.9993705,0.00002577468,0.00002449665,0.00009652986,0.0001851541,0.00008876267,0.00003057467,0.000009435597,0.0001688006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9584026,"threshold_uncertainty_score":0.4230412,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312689,0.00009972681,0.0001695253,0.0002776074,0.0001607613,0.0001474071,0.0001067831,0.00003309734,0.00002809179],"category_scores_gemma":[0.000008122498,0.00009621277,0.00004041706,0.0002800848,0.000006711603,0.0007309782,0.00001677359,0.0001057072,0.00007337016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004251326,"about_ca_system_score_gemma":0.00001461288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009864257,"about_ca_topic_score_gemma":6.502694e-7,"domain_scores_codex":[0.9991847,0.00005160903,0.0003495904,0.0000503351,0.0002116386,0.0001521191],"domain_scores_gemma":[0.999665,0.000043108,0.00007605626,0.0001133913,0.00001718553,0.00008526213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001301516,0.00002646451,0.00194124,0.001099779,0.0004184683,0.000008276174,0.00386279,0.2926726,0.0005031892,0.5971774,0.05032592,0.05183368],"study_design_scores_gemma":[0.002106221,0.00007725894,0.0006337665,0.00002040859,0.00002920631,0.000102613,0.0025336,0.2424397,0.00001435056,0.0007042169,0.7510434,0.0002951926],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6207408,0.1495242,0.05913981,0.001043774,0.0297831,0.006142115,0.000692077,0.005418507,0.1275157],"genre_scores_gemma":[0.9992828,0.00005764887,0.000003278229,0.0001405104,0.0001571092,0.00009565308,0.00001280692,0.000007498129,0.0002426404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7007175,"threshold_uncertainty_score":0.3923443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}