{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":162,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":162,"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":"fec8933506cf","filters":{"venue":"Journal of Combinatorial Designs"}},"results":[{"id":"W1541637185","doi":"10.1002/jcd.1027","title":"Cycle decompositions III: Complete graphs and fixed length cycles","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Capilano University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Order (exchange); Decomposition; Discrete mathematics","authors":[{"name":"Mateja Šajna","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01793181826664051,"gpt":0.2281622899208836,"spread":0.2102304716542431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006471657,0.0006683714,0.0006295303,0.001816448,0.0009229124,0.002171819,0.0006086943,0.0008472439,0.007126549],"category_scores_gemma":[0.00306374,0.0006177754,0.0009120856,0.001228822,0.001618009,0.00219461,0.001213854,0.00133981,0.0007654914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009048834,"about_ca_system_score_gemma":0.001038231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001638305,"about_ca_topic_score_gemma":0.002276832,"domain_scores_codex":[0.9990953,0.0001285926,0.00005254889,0.0002133253,0.0002497777,0.0002604612],"domain_scores_gemma":[0.9979247,0.0006538413,0.0003566059,0.0002802891,0.0004861036,0.0002984781],"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.0003594854,0.00009176625,0.002039591,0.0003255547,0.00005508105,0.0006163046,0.0005007309,0.01930824,0.0216021,0.9117623,0.006830346,0.03650852],"study_design_scores_gemma":[0.0001223274,0.0001177756,0.001526465,0.0002260343,0.00005215635,0.0007826337,0.0005218831,0.04479635,0.01370962,0.9149693,0.02312278,0.00005262836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4773253,0.002832816,0.4219384,0.001049029,0.0002688102,0.0005093674,0.002342536,0.0004908129,0.09324285],"genre_scores_gemma":[0.8981766,0.001573838,0.08224562,0.000435409,0.000151134,0.0003949416,0.003073193,0.0001633709,0.01378589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007126549,"threshold_uncertainty_score":0.02384067,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154750111","doi":"10.1002/jcd.20105","title":"Small latin squares, quasigroups, and loops","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":159,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Latin square; Combinatorics; Order (exchange); Quasigroup; Orthogonal array; Discrete mathematics; Statistics","authors":[{"name":"Brendan D. McKay","is_ca":false},{"name":"Alison Meynert","is_ca":true},{"name":"Wendy Myrvold","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01644457004630602,"gpt":0.190534576478463,"spread":0.174090006432157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539102,0.0003860879,0.0003221437,0.001901796,0.0009568457,0.00191658,0.00037172,0.000465182,0.01041734],"category_scores_gemma":[0.002342865,0.0001997091,0.0003965797,0.0007691372,0.00307317,0.002511854,0.00111495,0.0006234682,0.0007719785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006699382,"about_ca_system_score_gemma":0.0003609001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003693383,"about_ca_topic_score_gemma":0.0004745328,"domain_scores_codex":[0.9992647,0.0001457781,0.0000434502,0.0001644786,0.0002102065,0.0001713805],"domain_scores_gemma":[0.997032,0.001525779,0.0005349634,0.0004014817,0.0002114093,0.0002942481],"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.0006860673,0.0001325032,0.01373479,0.0002486933,0.00002863063,0.0005983318,0.0008482035,0.003671046,0.02375107,0.852577,0.002864875,0.1008589],"study_design_scores_gemma":[0.00007942194,0.0004119081,0.009295457,0.0001065379,0.00004914172,0.002094397,0.0007950048,0.009524113,0.02740618,0.9082442,0.0419327,0.00006105395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.907395,0.001429279,0.02960781,0.0005050432,0.0001655044,0.00005547872,0.00023739,0.0002529132,0.06035165],"genre_scores_gemma":[0.985709,0.0004230704,0.007353215,0.00007368809,0.0000989242,0.00003063153,0.0001672151,0.00002350875,0.006120805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01041734,"threshold_uncertainty_score":0.03484946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997203758","doi":"10.1002/jcd.10002","title":"On the state of strength‐three covering arrays","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":130,"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":"University of Waterloo; Michigan Technological University","keywords":"Mathematics; Combinatorics; Constructive; Product (mathematics); Column (typography); Order (exchange); Discrete mathematics; Computer science; Geometry","authors":[{"name":"M. Chateauneuf","is_ca":true},{"name":"Donald L. Kreher","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02112653195116119,"gpt":0.1988343033484486,"spread":0.1777077713972875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001755859,0.0004607148,0.0005958618,0.00119715,0.001248323,0.004165886,0.0009402757,0.001294431,0.00630576],"category_scores_gemma":[0.01289483,0.0007101538,0.0006267076,0.001532323,0.002162111,0.004456928,0.001819224,0.001611456,0.001051165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237309,"about_ca_system_score_gemma":0.0005828342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004869472,"about_ca_topic_score_gemma":0.0003154336,"domain_scores_codex":[0.9977317,0.0006954221,0.0001709884,0.0003484995,0.000642554,0.0004107943],"domain_scores_gemma":[0.9820164,0.01282983,0.001333459,0.002003818,0.001297717,0.0005187321],"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.000433398,0.0001020654,0.002053345,0.0002659399,0.00005060955,0.0002821409,0.0005605803,0.04694649,0.01447011,0.8606915,0.005336037,0.06880771],"study_design_scores_gemma":[0.00006422491,0.0002517682,0.0008119731,0.0001169811,0.00006238186,0.000541223,0.0002956151,0.1974272,0.02849227,0.7493546,0.02248842,0.00009333473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5173348,0.003697738,0.394106,0.004064031,0.0004325155,0.0001129227,0.0009406265,0.001173033,0.0781384],"genre_scores_gemma":[0.9539322,0.001024043,0.03968774,0.0004381921,0.0002016057,0.0001042767,0.0004798604,0.00008526521,0.004046863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00630576,"threshold_uncertainty_score":0.02109486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170886510","doi":"10.1002/jcd.21323","title":"Hadamard Matrices of Order 32","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Institute for Research in Fundamental Sciences; University of Lethbridge","keywords":"Mathematics; Hadamard transform; Combinatorics; Hadamard matrix; Complex Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Equivalence (formal languages); Sequence (biology); Order (exchange); Discrete mathematics; Mathematical analysis","authors":[{"name":"Hadi Kharaghani","is_ca":true},{"name":"B. Tayfeh‐Rezaie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01570326075954689,"gpt":0.2239582354616199,"spread":0.208254974702073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000686092,0.0006837917,0.0006914295,0.001741136,0.001118107,0.001849055,0.0004204307,0.0008919584,0.01030231],"category_scores_gemma":[0.002656357,0.0002360309,0.0004557908,0.00107153,0.001595238,0.001609969,0.0007056245,0.001052052,0.001129705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005642363,"about_ca_system_score_gemma":0.0005690671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005745813,"about_ca_topic_score_gemma":0.0004063222,"domain_scores_codex":[0.9981009,0.000336271,0.0001635823,0.0003379663,0.000681591,0.000379762],"domain_scores_gemma":[0.998384,0.0003914012,0.0003360105,0.0003055328,0.0004503574,0.000132713],"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.0004405491,0.00009186452,0.001813692,0.0001246076,0.00002069604,0.000710635,0.0003899155,0.00490714,0.01893141,0.9191825,0.003431875,0.0499551],"study_design_scores_gemma":[0.00006162361,0.0002878129,0.001725129,0.00007035698,0.0000143461,0.001138779,0.000200506,0.01389939,0.01098666,0.9466504,0.02488601,0.00007913361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7356071,0.002022314,0.1264121,0.001158777,0.0007712735,0.0002291322,0.001059105,0.0004045591,0.1323358],"genre_scores_gemma":[0.9617454,0.0002612737,0.02803862,0.0001584558,0.0001926188,0.00005713355,0.0004142791,0.00003020009,0.009102009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01030231,"threshold_uncertainty_score":0.03446466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081479998","doi":"10.1002/jcd.10059","title":"Covering arrays with mixed alphabet sizes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Statistics Canada; University of Ottawa","funders":"","keywords":"Alphabet; Combinatorics; Row; Mathematics; Type (biology); Column (typography); Row and column spaces; Geometry; Computer science; Connection (principal bundle)","authors":[{"name":"Lucia Moura","is_ca":true},{"name":"John Stardom","is_ca":true},{"name":"Brett Stevens","is_ca":true},{"name":"Alan Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02449294922199977,"gpt":0.230801669306003,"spread":0.2063087200840032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007734483,0.0005290529,0.000526297,0.001080305,0.0006651594,0.001376003,0.0006881527,0.0005589171,0.004571223],"category_scores_gemma":[0.00537529,0.0004049614,0.0004407119,0.001292552,0.0006613967,0.002095084,0.001234235,0.0006607292,0.0008988497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004763101,"about_ca_system_score_gemma":0.0003087057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001638919,"about_ca_topic_score_gemma":0.0002667021,"domain_scores_codex":[0.9979668,0.0006127593,0.000213756,0.0003312528,0.0005676939,0.0003078116],"domain_scores_gemma":[0.9926051,0.003644862,0.001004136,0.001415603,0.00089316,0.0004371729],"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.00150641,0.0001723889,0.009925456,0.0004741564,0.000123515,0.001660142,0.0006495559,0.09766234,0.1589009,0.4205428,0.009918951,0.2984634],"study_design_scores_gemma":[0.0001523389,0.0009398113,0.00423072,0.0001668361,0.0001392605,0.004065576,0.000397522,0.3965662,0.1543714,0.378444,0.06036628,0.0001601034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4502081,0.0007530196,0.509109,0.0005423342,0.0002346591,0.0001582966,0.0007591204,0.001936476,0.03629919],"genre_scores_gemma":[0.8329303,0.0001962338,0.1615169,0.0002195818,0.00009704083,0.000218216,0.0005369205,0.000131097,0.004153602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004571223,"threshold_uncertainty_score":0.01529229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043080690","doi":"10.1002/jcd.20035","title":"Group construction of covering arrays","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Group (periodic table); Extension (predicate logic); Column (typography); Set (abstract data type); Algebraic number; Geometry; Physics; Computer science; Connection (principal bundle); Mathematical analysis","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0227440757569816,"gpt":0.2350932994631618,"spread":0.2123492237061801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310869,0.0004024992,0.0004240389,0.001132471,0.0007959191,0.001108051,0.0004965175,0.0004667186,0.004915149],"category_scores_gemma":[0.001717866,0.0002927813,0.0006153769,0.0009674688,0.001162101,0.0009860368,0.001839491,0.0008848289,0.0009840024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005343963,"about_ca_system_score_gemma":0.0004883885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004754671,"about_ca_topic_score_gemma":0.000428933,"domain_scores_codex":[0.9988084,0.0003029981,0.00005878941,0.0002039575,0.0003396986,0.0002861872],"domain_scores_gemma":[0.9986029,0.00041258,0.0002046525,0.0003887239,0.0002219733,0.0001691003],"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.0004312245,0.0001240461,0.002398228,0.0002157257,0.0000527386,0.0007902978,0.00117336,0.02749309,0.07223331,0.7571414,0.00790001,0.1300466],"study_design_scores_gemma":[0.0001577768,0.00076319,0.002045784,0.00008744832,0.00009069222,0.001549557,0.0004976114,0.1192805,0.1262014,0.6302014,0.1190308,0.00009385782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4355928,0.0004168365,0.4717995,0.0005256929,0.0004513288,0.000247126,0.0002953142,0.001530243,0.08914122],"genre_scores_gemma":[0.8876497,0.0001730098,0.1024549,0.0001823104,0.00009631678,0.0001469193,0.000313779,0.000159214,0.008823908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004915149,"threshold_uncertainty_score":0.01644284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043898581","doi":"10.1002/jcd.20219","title":"The Hamilton–Waterloo problem for cycle sizes 3 and 4","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Università di Catania; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Hamiltonian path; Graph; Resolution (logic); Class (philosophy); Complete graph; Decomposition; Computer science; Artificial intelligence","authors":[{"name":"Peter Danziger","is_ca":true},{"name":"Gaetano Quattrocchi","is_ca":false},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00926922698022215,"gpt":0.2136291923050667,"spread":0.2043599653248446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696222,0.0004257855,0.0005823378,0.00077396,0.00117101,0.001593692,0.001219864,0.001384086,0.01007234],"category_scores_gemma":[0.004588642,0.0004670419,0.0008683702,0.0006920363,0.001129844,0.002076159,0.001039303,0.001330162,0.0006219486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000879439,"about_ca_system_score_gemma":0.001310744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005614826,"about_ca_topic_score_gemma":0.00737522,"domain_scores_codex":[0.9989297,0.0002988975,0.00005038698,0.0001970658,0.0002186107,0.0003053668],"domain_scores_gemma":[0.9968659,0.002111671,0.000300184,0.0003537963,0.0001748309,0.0001936472],"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.0006270531,0.0001773008,0.001905758,0.000289362,0.0001132353,0.0004973849,0.0006094099,0.0811877,0.009339434,0.7920896,0.0133627,0.09980112],"study_design_scores_gemma":[0.0002241449,0.0001050208,0.0006918974,0.00006679116,0.0000479183,0.0002894718,0.00040123,0.1337573,0.007307251,0.8429133,0.0141402,0.00005546225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5462817,0.00100323,0.3596862,0.002288569,0.00011202,0.0004074415,0.001000172,0.0003624048,0.08885828],"genre_scores_gemma":[0.8813098,0.0004752278,0.09726671,0.0003799602,0.00008981453,0.0002036183,0.0007000819,0.0001023401,0.01947251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01007234,"threshold_uncertainty_score":0.03369534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986793172","doi":"10.1002/jcd.998","title":"Existence of (q, 7, 1) difference families with q a prime power","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Prime power; Combinatorics; Prime (order theory); Character (mathematics); Discrete mathematics; Arithmetic; Geometry","authors":[{"name":"K. Chen","is_ca":false},{"name":"Ruizhong Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01760372635639863,"gpt":0.1915206267496352,"spread":0.1739169003932365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001513303,0.0002692044,0.0005312109,0.0008953072,0.001957685,0.001359607,0.0005614065,0.0008562225,0.004515615],"category_scores_gemma":[0.005047746,0.0004146018,0.0005107596,0.0005065205,0.001326562,0.001829696,0.001485422,0.001047061,0.0007057919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008339658,"about_ca_system_score_gemma":0.0004849367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000140469,"about_ca_topic_score_gemma":0.0001076001,"domain_scores_codex":[0.9985532,0.0003719229,0.00009923822,0.0002635789,0.0003648472,0.0003471168],"domain_scores_gemma":[0.9959893,0.002156186,0.0005289621,0.0004133902,0.000540371,0.0003718571],"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.00180923,0.000270586,0.02010929,0.0002443446,0.00007059654,0.002182359,0.001992519,0.005962589,0.05993128,0.8297517,0.003764146,0.07391129],"study_design_scores_gemma":[0.0006102812,0.00117169,0.007394596,0.000169091,0.0001128519,0.008385408,0.001341038,0.03335319,0.103208,0.8039669,0.04009126,0.0001956597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9318594,0.0003080012,0.05026654,0.0006752945,0.00008275506,0.00006795169,0.0002423942,0.0001508021,0.01634676],"genre_scores_gemma":[0.9846392,0.00009820347,0.01242864,0.0001152106,0.00003882576,0.0000675611,0.0002111262,0.00001904597,0.002382135],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004515615,"threshold_uncertainty_score":0.01510626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131599704","doi":"10.1002/jcd.20245","title":"On the classification of Hadamard matrices of order 32","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"School of Mathematics, Institute for Research in Fundamental Sciences; University of Lethbridge","keywords":"Hadamard transform; Complex Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Hadamard matrix; Hadamard's inequality; Combinatorics; Equivalence (formal languages); Hadamard product; Order (exchange); Hadamard three-lines theorem; Type (biology); Discrete mathematics; Mathematical analysis","authors":[{"name":"Hadi Kharaghani","is_ca":true},{"name":"B. Tayfeh‐Rezaie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01717917542251244,"gpt":0.2250459578724909,"spread":0.2078667824499785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453602,0.0006171912,0.0007880557,0.004163626,0.001357823,0.002112213,0.0005427297,0.0009798448,0.005849068],"category_scores_gemma":[0.008508909,0.0003178586,0.0004673527,0.001976744,0.001925617,0.002055902,0.0009362538,0.00121215,0.0006966594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000849986,"about_ca_system_score_gemma":0.0005626544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008959608,"about_ca_topic_score_gemma":0.0005639529,"domain_scores_codex":[0.9978023,0.0004247661,0.0001675942,0.0003235871,0.0008724866,0.0004092455],"domain_scores_gemma":[0.9932582,0.00308838,0.001134871,0.001039846,0.0009636498,0.0005148876],"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.001228717,0.0003061772,0.0176391,0.0002071833,0.00004517651,0.0009294396,0.001674936,0.0180271,0.04061517,0.780453,0.006473499,0.1324005],"study_design_scores_gemma":[0.0001534333,0.0005207052,0.009964576,0.0001092173,0.00002248924,0.002335959,0.0005449647,0.07529471,0.01540377,0.8734367,0.0221011,0.0001122858],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8966674,0.0009578763,0.07203365,0.0006898956,0.0001755144,0.0001404934,0.0004429418,0.0001983215,0.0286939],"genre_scores_gemma":[0.9768034,0.0002111298,0.01883441,0.0001016823,0.0001133812,0.00005062555,0.0004881369,0.00002664044,0.003370466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005849068,"threshold_uncertainty_score":0.01956707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008647334","doi":"10.1002/jcd.20171","title":"Super‐simple holey Steiner pentagon systems and related designs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Saint Vincent University","funders":"Beijing Institute For Brain Disorders","keywords":"Pentagon; Simple (philosophy); Mathematics; Combinatorics; Type (biology); Geometry","authors":[{"name":"R. Julian R. Abel","is_ca":false},{"name":"F.E. Bennett","is_ca":true},{"name":"Gennian Ge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01786100687697741,"gpt":0.2316456012462305,"spread":0.2137845943692531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140961,0.0001915025,0.0002811548,0.0007531486,0.0005189421,0.0006565721,0.0002931262,0.0003140215,0.004051341],"category_scores_gemma":[0.001160819,0.0002285576,0.0002307046,0.0008117696,0.0006177388,0.0007033595,0.0009217827,0.0003012777,0.0003208875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003673827,"about_ca_system_score_gemma":0.0002201078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000283829,"about_ca_topic_score_gemma":0.0005319065,"domain_scores_codex":[0.9996328,0.00009780447,0.00002727425,0.00006144196,0.0001128246,0.00006772295],"domain_scores_gemma":[0.9990269,0.0002261654,0.0003243957,0.0001438272,0.0001512442,0.0001274498],"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.0003554728,0.00007533772,0.005390616,0.0002281329,0.00005172491,0.000965404,0.0004633223,0.05350405,0.014233,0.8757335,0.002746513,0.04625292],"study_design_scores_gemma":[0.0001571498,0.0004286254,0.004447227,0.00006110047,0.00004770005,0.001818855,0.0005790989,0.1654434,0.006524321,0.8034357,0.01700629,0.00005046477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.824471,0.0005429513,0.1304489,0.0002378865,0.00009906037,0.0001140465,0.0002509991,0.00009441757,0.04374082],"genre_scores_gemma":[0.977358,0.0001272366,0.01943131,0.00003426019,0.00002716143,0.00003266628,0.00009494311,0.000005522495,0.002888826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004051341,"threshold_uncertainty_score":0.01355302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1821740204","doi":"10.1002/jcd.21331","title":"Cops and Robbers on Graphs Based on Designs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Trapezoid graph; Indifference graph; Chromatic scale; Discrete mathematics; Pathwidth; Intersection (aeronautics); 1-planar graph; Graph; Line graph","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Andrea C. Burgess","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02185449247666798,"gpt":0.2247920596820965,"spread":0.2029375672054285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767434,0.000588843,0.0007910011,0.002830411,0.00161713,0.001977243,0.0007092066,0.0009930946,0.006494771],"category_scores_gemma":[0.006944913,0.0006588192,0.0005578538,0.001157872,0.001914569,0.002370058,0.001152722,0.0009313697,0.0004179621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327657,"about_ca_system_score_gemma":0.0003834237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007163023,"about_ca_topic_score_gemma":0.000830519,"domain_scores_codex":[0.9988287,0.0003392212,0.00004601423,0.0002596423,0.0002984352,0.0002281245],"domain_scores_gemma":[0.9944187,0.003088443,0.001171764,0.0005122278,0.0003646374,0.0004441747],"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.0003713613,0.00009879088,0.008255937,0.0002320744,0.00006695588,0.0006621638,0.0006840705,0.05086504,0.0157756,0.8962697,0.003147847,0.02357024],"study_design_scores_gemma":[0.00007250032,0.000281659,0.008613113,0.000182165,0.00008825186,0.001773595,0.0008512329,0.2287258,0.02104595,0.7246128,0.01366939,0.00008346423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.884111,0.0003624145,0.08603442,0.0004188928,0.00003839847,0.00007011095,0.0003208804,0.0002017319,0.02844225],"genre_scores_gemma":[0.9781719,0.0001927885,0.01788881,0.00006116964,0.00002270009,0.00007846829,0.0001613866,0.00005385245,0.003368786],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006494771,"threshold_uncertainty_score":0.02172714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4246412311","doi":"10.1002/jcd.21602","title":"Variable strength covering arrays","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Variable (mathematics); Homomorphism; Combinatorics; Order (exchange); Discrete mathematics; Mathematical analysis","authors":[{"name":"Sebastian Raaphorst","is_ca":false},{"name":"Lucia Moura","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02761422325529419,"gpt":0.268460903534927,"spread":0.2408466802796328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007844361,0.0005358878,0.0004233989,0.001219603,0.0006014818,0.001543563,0.0008410076,0.0006168619,0.005432137],"category_scores_gemma":[0.004115697,0.0004395774,0.0005226322,0.001562602,0.001094435,0.002338884,0.001484628,0.0008691786,0.001216023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000439392,"about_ca_system_score_gemma":0.0003055464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002095795,"about_ca_topic_score_gemma":0.0001936732,"domain_scores_codex":[0.9983233,0.0005464694,0.0001039811,0.0003107678,0.0004919531,0.0002235235],"domain_scores_gemma":[0.9944712,0.002527531,0.0006223689,0.001270294,0.0008247856,0.0002838712],"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.0002377742,0.00007903734,0.003936458,0.0002258086,0.00006802622,0.0006621692,0.0004379711,0.042473,0.0450778,0.7686029,0.004489309,0.1337097],"study_design_scores_gemma":[0.0000524569,0.0003757461,0.001918851,0.0001112083,0.00009507128,0.002030203,0.0003653095,0.1699622,0.06600229,0.7103176,0.04867535,0.00009379428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.177131,0.0003840554,0.788734,0.0002833522,0.0001371572,0.00008240154,0.0003995136,0.001097684,0.03175095],"genre_scores_gemma":[0.8158117,0.0003530261,0.1735324,0.0002946504,0.0001262024,0.0001920373,0.0005092258,0.0003703714,0.008810375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005432137,"threshold_uncertainty_score":0.01817226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993163310","doi":"10.1002/jcd.20086","title":"Common intersection designs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"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":"Intersection (aeronautics); Disjoint sets; Mathematics; Combinatorial design; Block (permutation group theory); Set (abstract data type); Block design; Combinatorics; Function (biology); Discrete mathematics; Computer science; Engineering","authors":[{"name":"Joo‐Young Lee","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01986937936305682,"gpt":0.2351832499957762,"spread":0.2153138706327194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003657721,0.0009571034,0.001133905,0.002233193,0.001783228,0.003281715,0.001966248,0.001364489,0.01229337],"category_scores_gemma":[0.008085837,0.0008795396,0.001086976,0.002527338,0.002748777,0.003711879,0.0034187,0.001683273,0.001805132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001990143,"about_ca_system_score_gemma":0.001269698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005698039,"about_ca_topic_score_gemma":0.0007008163,"domain_scores_codex":[0.9914213,0.002787764,0.0005810682,0.001887114,0.002349323,0.0009733284],"domain_scores_gemma":[0.9881054,0.003112872,0.001677368,0.003482427,0.002920569,0.0007014013],"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.0004712745,0.0001436645,0.001753729,0.0002050811,0.000138886,0.0001581904,0.0003552085,0.04718795,0.01042712,0.8331797,0.004128428,0.1018509],"study_design_scores_gemma":[0.0002396643,0.0009851984,0.00077883,0.0001448977,0.0001538749,0.001080977,0.0003082573,0.182551,0.02603818,0.7189423,0.06865964,0.0001170677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07854868,0.0006426089,0.869819,0.0003624843,0.0001720004,0.0003618114,0.0003778999,0.0004497833,0.04926582],"genre_scores_gemma":[0.6850637,0.0003435189,0.3014688,0.0002742123,0.0001669594,0.0005194089,0.0004255776,0.0001476363,0.01159029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01229337,"threshold_uncertainty_score":0.04112542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966120745","doi":"10.1002/jcd.20149","title":"Mixed covering arrays on graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Alphabet; Graph; Row; Discrete mathematics; Computer science","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Lucia Moura","is_ca":true},{"name":"Latifa Zekaoui","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04613618521940243,"gpt":0.2600137370509261,"spread":0.2138775518315236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005031082,0.0005604484,0.0005330184,0.001155809,0.0005435839,0.001280269,0.0005674898,0.0004860986,0.003832695],"category_scores_gemma":[0.003933931,0.0003628119,0.0004728477,0.001515335,0.000790784,0.002195609,0.001092537,0.0005859039,0.0005330085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005729839,"about_ca_system_score_gemma":0.0002826858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003085663,"about_ca_topic_score_gemma":0.0003206246,"domain_scores_codex":[0.9986993,0.0003319166,0.0000973332,0.00027846,0.0003984261,0.0001943982],"domain_scores_gemma":[0.9957994,0.001982586,0.0006491432,0.000851323,0.0004879919,0.0002296621],"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.0005156738,0.0001236185,0.00506594,0.0002974506,0.00009178273,0.0005885208,0.0005218002,0.1532763,0.0647342,0.5676101,0.005560161,0.2016145],"study_design_scores_gemma":[0.0000443324,0.0003603822,0.002121583,0.00006015622,0.0000598127,0.001044339,0.0003025896,0.4286436,0.04977334,0.4944789,0.02305558,0.00005537841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4297296,0.0004202739,0.5469096,0.0003152468,0.00007599041,0.0000972648,0.0005413873,0.001166608,0.02074396],"genre_scores_gemma":[0.8531784,0.000190175,0.1421377,0.0001493739,0.00008187348,0.0001706644,0.0005512023,0.0001544768,0.003386171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003832695,"threshold_uncertainty_score":0.01282167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1566220351","doi":"10.1002/jcd.21312","title":"On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Complete bipartite graph; Hamiltonian path; Graph; Discrete mathematics","authors":[{"name":"Darryn Bryant","is_ca":false},{"name":"Peter Danziger","is_ca":true},{"name":"Matthew Dean","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02960879203051143,"gpt":0.2273490084058673,"spread":0.1977402163753559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001112106,0.0006131618,0.000747433,0.0006462563,0.001337966,0.001443192,0.0009810046,0.001353205,0.01455541],"category_scores_gemma":[0.00446623,0.000492378,0.0008209645,0.0009540742,0.001623694,0.004481867,0.001324689,0.001256304,0.0009028673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001862522,"about_ca_system_score_gemma":0.001588305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01212431,"about_ca_topic_score_gemma":0.01457494,"domain_scores_codex":[0.9988092,0.0003866301,0.0000440795,0.0002295009,0.0001948532,0.0003358319],"domain_scores_gemma":[0.996987,0.002169463,0.0002015846,0.0002903896,0.0001884296,0.0001631319],"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.0005183685,0.0002660582,0.001204371,0.0003580195,0.00005959154,0.0004291555,0.000618785,0.06314137,0.005159191,0.8545773,0.02026131,0.05340628],"study_design_scores_gemma":[0.0001578884,0.0001017836,0.0003463574,0.0000641427,0.0000266734,0.0001527236,0.0003662375,0.1413196,0.002566856,0.8424328,0.01242444,0.00004039905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3710374,0.001306987,0.5331441,0.003262687,0.0001889041,0.0006015187,0.001525693,0.0004619524,0.08847069],"genre_scores_gemma":[0.8266492,0.001198697,0.1396848,0.0007823418,0.0002248207,0.0003627819,0.001483221,0.0001999405,0.02941424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01455541,"threshold_uncertainty_score":0.04869276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964093181","doi":"10.1002/jcd.21552","title":"On the Hamilton–Waterloo Problem with Odd Orders","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Mathematics; Combinatorics; Factorization; Graph; Generality; Order (exchange); Product (mathematics); Discrete mathematics; Algorithm","authors":[{"name":"Andrea C. Burgess","is_ca":true},{"name":"Peter Danziger","is_ca":true},{"name":"Tommaso Traetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01069518822555812,"gpt":0.1830554972722707,"spread":0.1723603090467126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529726,0.0005336681,0.0006994028,0.0006556651,0.001322036,0.00175188,0.0008806185,0.001204844,0.01059727],"category_scores_gemma":[0.004303487,0.0003842948,0.0005332921,0.0009838782,0.001456298,0.0040876,0.001197177,0.00148263,0.0007669104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001438076,"about_ca_system_score_gemma":0.001590421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01134018,"about_ca_topic_score_gemma":0.01116752,"domain_scores_codex":[0.9990678,0.0002667356,0.00003609932,0.0001625704,0.0001492359,0.0003176142],"domain_scores_gemma":[0.9977086,0.001516822,0.0002098288,0.0002189373,0.0001565636,0.0001893876],"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.000427529,0.0001520337,0.001065028,0.0002411279,0.00003864195,0.0004707504,0.0004470144,0.04558597,0.002942067,0.88538,0.01965402,0.04359596],"study_design_scores_gemma":[0.0001011206,0.00005723186,0.0003093078,0.00006208385,0.0000176425,0.0001429237,0.0003085036,0.1013109,0.001406057,0.8862817,0.009972559,0.00002994995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4628449,0.001800801,0.4054599,0.005502874,0.0003640594,0.0003780884,0.001434071,0.0003854869,0.1218299],"genre_scores_gemma":[0.8719782,0.001347863,0.09748498,0.0006806016,0.0002542306,0.000180155,0.001122736,0.0001161336,0.02683512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01134018,"threshold_uncertainty_score":0.03545135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502829000","doi":"10.1002/jcd.21379","title":"Complex Spherical Designs and Codes","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Projective test; Mathematics; Contrast (vision); Association scheme; Unit sphere; Scheme (mathematics); Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis; Artificial intelligence","authors":[{"name":"Aidan Roy","is_ca":true},{"name":"Sho Suda","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1175981721119456,"gpt":0.3310637144322862,"spread":0.2134655423203406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002532847,0.000613931,0.000467502,0.001557297,0.001186784,0.002582906,0.0006390912,0.0009086863,0.007016329],"category_scores_gemma":[0.007068797,0.0003272125,0.0006406069,0.001282482,0.004501454,0.001997975,0.002764308,0.001562517,0.001417504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001166649,"about_ca_system_score_gemma":0.0008283155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007425584,"about_ca_topic_score_gemma":0.00049848,"domain_scores_codex":[0.9969053,0.001100889,0.0002013396,0.0004799564,0.0009571087,0.0003554227],"domain_scores_gemma":[0.9935914,0.001802776,0.001264426,0.001366767,0.001466194,0.0005084247],"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.00002251779,0.000005557308,0.0001455082,0.00001530702,0.000003608765,0.00002044916,0.00007221723,0.00176309,0.0005842818,0.9916045,0.0003990432,0.005364009],"study_design_scores_gemma":[0.00002934945,0.00009131414,0.0002849329,0.00003594784,0.000009610177,0.0002218353,0.000126076,0.01552034,0.00203847,0.9638343,0.01777332,0.00003434422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2785221,0.001145733,0.6065385,0.001615819,0.0005614849,0.0001748074,0.000399771,0.0003291093,0.1107126],"genre_scores_gemma":[0.8896403,0.00071115,0.09026986,0.0004549641,0.0003076281,0.0001799336,0.0002459504,0.00006684718,0.01812339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007016329,"threshold_uncertainty_score":0.02347195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060964556","doi":"10.1002/1520-6610(2001)9:1<72::aid-jcd6>3.0.co;2-m","title":"Bush-type Hadamard matrices and symmetric designs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hadamard transform; Combinatorics; Integer (computer science); Hadamard matrix; Block (permutation group theory); Class (philosophy); Type (biology); Matrix (chemical analysis); Order (exchange); Point (geometry); Discrete mathematics; Computer science; Mathematical analysis; Geometry","authors":[{"name":"Zvonimir Janko","is_ca":true},{"name":"Hadi Kharaghani","is_ca":true},{"name":"Vladimir D. Tonchev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02292058797049345,"gpt":0.2298834087029573,"spread":0.2069628207324638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142999,0.0005313792,0.0003785358,0.0007263983,0.0004775328,0.0009491818,0.0004249782,0.0007138865,0.004164527],"category_scores_gemma":[0.003830039,0.0003593478,0.0004491416,0.0006330138,0.001381923,0.001234843,0.0006450355,0.0008951959,0.0007672485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000712933,"about_ca_system_score_gemma":0.0006051374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003879566,"about_ca_topic_score_gemma":0.0006819951,"domain_scores_codex":[0.9985051,0.0005688054,0.000101086,0.0002542385,0.0004147381,0.0001561136],"domain_scores_gemma":[0.996913,0.001069879,0.0006216235,0.0007240832,0.000494943,0.0001764277],"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.0003953518,0.0000684453,0.0009633179,0.0001221211,0.00003048992,0.0002259077,0.0002149175,0.02998294,0.03090826,0.8603284,0.001568197,0.07519168],"study_design_scores_gemma":[0.0001950242,0.0009190908,0.0008610312,0.00006428896,0.00003656237,0.001066004,0.0001248028,0.1607126,0.03847121,0.7750486,0.0224197,0.00008098353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.129465,0.0003469641,0.8469614,0.000202656,0.00009068076,0.000134224,0.0001405233,0.0002678644,0.02239072],"genre_scores_gemma":[0.6569799,0.0002826834,0.3331334,0.0001959298,0.00007721118,0.0002789284,0.0002111453,0.00004862562,0.008792209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004164527,"threshold_uncertainty_score":0.01393169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052666099","doi":"10.1002/jcd.20109","title":"Constructions of 2‐cover‐free families and related separating hash families","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Manitoba","funders":"","keywords":"Cover (algebra); Mathematics; Construct (python library); Combinatorics; Hash function; Discrete mathematics; Computer science","authors":[{"name":"P. C. Li","is_ca":true},{"name":"Glynda Rees","is_ca":true},{"name":"Ruizhong Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007049594916190552,"gpt":0.1967822776036927,"spread":0.1897326826875021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001010389,0.0004513571,0.0003919949,0.0009079791,0.001508107,0.001007838,0.0006539383,0.0008260203,0.007427702],"category_scores_gemma":[0.004416904,0.0005564719,0.0006342681,0.001053018,0.00102381,0.002448886,0.001548537,0.001012271,0.0006002772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074103,"about_ca_system_score_gemma":0.0005105041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005228432,"about_ca_topic_score_gemma":0.0005468013,"domain_scores_codex":[0.9991387,0.0002274594,0.00004476993,0.0001247465,0.000275354,0.0001889508],"domain_scores_gemma":[0.9954759,0.002691548,0.0005089547,0.0007309773,0.0003715379,0.0002210532],"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.0007319864,0.000213554,0.006294694,0.000290712,0.00008141986,0.0007161201,0.001307995,0.06572625,0.02663747,0.7886557,0.006696789,0.1026474],"study_design_scores_gemma":[0.0001339586,0.0003695989,0.004446423,0.0001060347,0.00008260382,0.002264597,0.0007702743,0.2018047,0.05113012,0.7085007,0.03023644,0.0001544358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6224979,0.0004875412,0.3474394,0.0005600984,0.0000594692,0.0001849839,0.0008124118,0.0004171644,0.02754108],"genre_scores_gemma":[0.8958158,0.0003465241,0.09685615,0.000125831,0.00003976508,0.0002171396,0.0007529447,0.00008467455,0.005761285],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007427702,"threshold_uncertainty_score":0.0248481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2562106824","doi":"10.1002/jcd.21553","title":"Asymptotic Size of Covering Arrays: An Application of Entropy Compression","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"CARE Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Alphabet; Row; Lemma (botany); Entropy (arrow of time); Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis","authors":[{"name":"Nevena Francetić","is_ca":false},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03057987468056145,"gpt":0.2832562542856378,"spread":0.2526763796050764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563775,0.0007079513,0.0008679442,0.002037815,0.0006399354,0.001790436,0.001532669,0.001255416,0.003877995],"category_scores_gemma":[0.03600643,0.0005491912,0.0005087856,0.001473619,0.002094433,0.004341273,0.002635457,0.001938037,0.0003760083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001533102,"about_ca_system_score_gemma":0.0007909694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004033989,"about_ca_topic_score_gemma":0.0004038895,"domain_scores_codex":[0.9981,0.0005921963,0.00006973164,0.0002732725,0.0007154575,0.0002493778],"domain_scores_gemma":[0.9600228,0.03412741,0.001473694,0.002284043,0.001442161,0.0006500185],"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.0006137821,0.0001828924,0.01031564,0.000413897,0.0001004581,0.0007145584,0.0003873721,0.3850655,0.02387824,0.4973931,0.006813021,0.07412142],"study_design_scores_gemma":[0.00001966116,0.0001102909,0.001361665,0.00006662069,0.0000304279,0.000459966,0.00004967449,0.8050611,0.009017863,0.1819831,0.001808642,0.00003102993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2452562,0.003336294,0.7077196,0.003147184,0.000222657,0.0001228009,0.0005412451,0.001138352,0.03851564],"genre_scores_gemma":[0.9449989,0.00119591,0.04951154,0.0004318734,0.0004049483,0.0001479282,0.0003876057,0.0002356739,0.002685525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003877995,"threshold_uncertainty_score":0.01355869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999801607","doi":"10.1002/jcd.20222","title":"A construction of binary Golay sequence pairs from odd‐length Barker sequences","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Mathematics; Combinatorics; Complementary sequences; Sequence (biology); Binary number; Pseudorandom binary sequence; Arithmetic; Statistics; Biology; Genetics","authors":[{"name":"Jonathan Jedwab","is_ca":true},{"name":"Matthew G. Parker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01975698066111388,"gpt":0.2289022324656349,"spread":0.209145251804521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005473885,0.000520362,0.0003913592,0.0009141681,0.0008902369,0.0005731016,0.0005076542,0.0004654308,0.004744709],"category_scores_gemma":[0.001437354,0.0003854478,0.0003829777,0.0006199249,0.0006366992,0.0009188571,0.001154157,0.0005870862,0.001112964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004423503,"about_ca_system_score_gemma":0.0005525443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000211851,"about_ca_topic_score_gemma":0.0003383571,"domain_scores_codex":[0.9994292,0.0001826481,0.00004303605,0.0001097476,0.0001332163,0.0001022193],"domain_scores_gemma":[0.9991561,0.0002392365,0.0001853956,0.0001747385,0.000140456,0.0001039933],"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.001178267,0.0003248625,0.003976423,0.0005228866,0.00006393165,0.001666521,0.00118732,0.01045516,0.1902264,0.5584361,0.007312094,0.2246501],"study_design_scores_gemma":[0.0004790369,0.003173749,0.005363499,0.0002178114,0.0001750336,0.003696349,0.000432304,0.06676835,0.445026,0.3396539,0.1347531,0.0002608366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5620844,0.0006666232,0.3994065,0.0004957026,0.0004298479,0.0003823901,0.0003865938,0.0009732311,0.03517468],"genre_scores_gemma":[0.7659399,0.0002073424,0.2255726,0.0001729653,0.00005708583,0.0002146861,0.0003522447,0.00009847212,0.00738473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004744709,"threshold_uncertainty_score":0.01587266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949680615","doi":"10.1002/jcd.21358","title":"Some New Orders of Hadamard and Skew‐Hadamard Matrices","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; Google (Canada); University of Waterloo","funders":"","keywords":"Hadamard transform; Hadamard matrix; Complex Hadamard matrix; Hadamard's inequality; Matching (statistics); Order (exchange); Hadamard's maximal determinant problem","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01005234824516583,"gpt":0.1987547014477264,"spread":0.1887023532025605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007880665,0.0004710987,0.0003624002,0.0009019408,0.0006883712,0.001443157,0.0004597097,0.0004985777,0.00424196],"category_scores_gemma":[0.001848432,0.0003992395,0.000485071,0.0005484753,0.0009580723,0.001344096,0.0009473658,0.001007408,0.0006223554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005279786,"about_ca_system_score_gemma":0.0004923693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002479602,"about_ca_topic_score_gemma":0.0002686124,"domain_scores_codex":[0.9991435,0.0002051429,0.00006942215,0.0001007102,0.0003733567,0.0001077897],"domain_scores_gemma":[0.9987111,0.0003081126,0.0001825911,0.0002758089,0.00032889,0.0001935535],"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.0001837729,0.00005882345,0.0007109827,0.00007806543,0.00002136874,0.0003856105,0.0003061616,0.008338263,0.02602014,0.9316749,0.001946292,0.03027562],"study_design_scores_gemma":[0.0001313377,0.0005018956,0.00130088,0.00006077358,0.00004271211,0.001984634,0.0003238383,0.1281986,0.07732999,0.7452608,0.04471163,0.0001529012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.401903,0.001124009,0.5385673,0.000927343,0.0008377658,0.0001611986,0.0002711014,0.0004610657,0.05574714],"genre_scores_gemma":[0.8475327,0.0003594277,0.1376995,0.0003107634,0.0002060161,0.00008567611,0.0001830232,0.00007963776,0.0135433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00424196,"threshold_uncertainty_score":0.01419079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003363815","doi":"10.1002/jcd.20097","title":"Resolvable modified group divisible designs with block size three","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Block size; Combinatorics; Block (permutation group theory); Group (periodic table); Block design; Discrete mathematics; Arithmetic; Computer science","authors":[{"name":"Chengmin Wang","is_ca":false},{"name":"Yu Tang","is_ca":false},{"name":"Peter Danziger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01960852151754365,"gpt":0.2118349938554026,"spread":0.192226472337859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218816,0.0004136519,0.0004546811,0.0004830251,0.000364662,0.0007982224,0.0007424594,0.0005575346,0.003566062],"category_scores_gemma":[0.001955392,0.0002763085,0.000410949,0.0004533492,0.0006286351,0.0008683301,0.0006531168,0.0005913002,0.0005294477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004891896,"about_ca_system_score_gemma":0.0004546042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002147347,"about_ca_topic_score_gemma":0.0004399218,"domain_scores_codex":[0.9990421,0.000277295,0.00008094068,0.0001969007,0.0002720506,0.0001307381],"domain_scores_gemma":[0.9965183,0.0009720427,0.0008025867,0.00122445,0.0003604997,0.0001221008],"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.003035027,0.0002688753,0.004406924,0.0006122308,0.0002077527,0.001537009,0.0005435213,0.1338409,0.2704711,0.3913182,0.003458476,0.1903],"study_design_scores_gemma":[0.000782131,0.00197576,0.001935212,0.0001547587,0.0002068113,0.002446094,0.0001664921,0.4222834,0.2153647,0.3126923,0.04186978,0.0001225823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5841646,0.0005929166,0.3945116,0.0004333612,0.00009188156,0.0001758642,0.0003522183,0.0008306738,0.01884693],"genre_scores_gemma":[0.9165671,0.00009302676,0.08051565,0.00009322926,0.0000292281,0.00008544272,0.0001406438,0.00002942392,0.002446207],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003566062,"threshold_uncertainty_score":0.01192963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984385881","doi":"10.1002/jcd.20001","title":"On partitions of {1,…,2<i>m</i>+ 1}\\{<i>k</i>} into differences<i>d</i>,…,<i>d</i>+<i>m</i>− 1: Extended Langford sequences of large defect","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Mod","authors":[{"name":"Václav Linek","is_ca":true},{"name":"Shai Mor","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06391543511405508,"gpt":0.3568091950535579,"spread":0.2928937599395028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008562678,0.0005759183,0.000545503,0.001943927,0.001326076,0.001424816,0.0006180427,0.0005795592,0.003533955],"category_scores_gemma":[0.003148947,0.0002833561,0.0004882933,0.0008814142,0.002198654,0.001810439,0.00139622,0.0009764225,0.0004967118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00153722,"about_ca_system_score_gemma":0.0004040716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007696929,"about_ca_topic_score_gemma":0.001104757,"domain_scores_codex":[0.9992734,0.0001649084,0.00006188047,0.0000910721,0.0001859766,0.0002229434],"domain_scores_gemma":[0.9977804,0.0009414187,0.0003681385,0.0002375961,0.0002316437,0.0004408984],"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.0005774742,0.0001066342,0.001901206,0.00008430123,0.00001240473,0.0006252777,0.001262209,0.0110093,0.01048582,0.9566385,0.00155925,0.01573771],"study_design_scores_gemma":[0.0001385065,0.0002383589,0.001977386,0.00008492927,0.00001253593,0.0003162898,0.0004518718,0.04358206,0.005831779,0.9414685,0.005844676,0.00005303639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9493786,0.000226469,0.03298293,0.000186863,0.0001183182,0.00003929812,0.0001115601,0.00008769854,0.01686845],"genre_scores_gemma":[0.9861277,0.0001252778,0.007880569,0.00007134923,0.00006676031,0.00007729021,0.0001958067,0.00005850731,0.005396627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003533955,"threshold_uncertainty_score":0.01182228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2761333931","doi":"10.1002/jcd.21586","title":"On the Hamilton–Waterloo problem with odd cycle lengths","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Lexicographical order; Graph; Graph factorization; Complete graph; Factorization; Hamiltonian path; Discrete mathematics; Line graph; Graph power; Algorithm","authors":[{"name":"Andrea C. Burgess","is_ca":true},{"name":"Peter Danziger","is_ca":true},{"name":"Tommaso Traetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01419316015051537,"gpt":0.2110433987292366,"spread":0.1968502385787212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009345285,0.0007295499,0.00086571,0.0007365065,0.001313795,0.00181803,0.001148284,0.001475911,0.01131953],"category_scores_gemma":[0.005830382,0.00053316,0.0005944477,0.001007444,0.001318002,0.004267904,0.001440306,0.001327796,0.0009385782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445971,"about_ca_system_score_gemma":0.001395043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006544964,"about_ca_topic_score_gemma":0.006838325,"domain_scores_codex":[0.9990963,0.0002927135,0.00003999276,0.0001694622,0.0001301256,0.0002713238],"domain_scores_gemma":[0.9967532,0.002240461,0.0002909473,0.000244051,0.0002104065,0.0002608925],"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.0008165,0.0002704848,0.00160751,0.0005029711,0.00007481476,0.0006506782,0.0006301125,0.113391,0.00565664,0.7770193,0.02787993,0.07150008],"study_design_scores_gemma":[0.000150731,0.0001068015,0.0004175612,0.00008776747,0.00002931479,0.0002158829,0.0003556373,0.1608251,0.00196784,0.8263129,0.0094818,0.00004867951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5677091,0.001885866,0.3340388,0.004884493,0.0002957281,0.000486858,0.001985575,0.0004458356,0.08826768],"genre_scores_gemma":[0.8574541,0.001577017,0.117927,0.0007847427,0.0002949743,0.0003051466,0.001561966,0.0001646653,0.01993026],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01131953,"threshold_uncertainty_score":0.03786755,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166664532","doi":"10.1002/jcd.10054","title":"Some New uniform frames with block size four and index one or three","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Index (typography); Combinatorics; Computer science","authors":[{"name":"Gennian Ge","is_ca":false},{"name":"Clement Lam","is_ca":true},{"name":"Alan C. H. Ling","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01984744733663742,"gpt":0.2075589500617135,"spread":0.1877115027250761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004071234,0.0004796665,0.0005236519,0.00088697,0.0009731997,0.0005987552,0.0004482299,0.0004468846,0.003030685],"category_scores_gemma":[0.001312068,0.0002675621,0.0004252059,0.0006953461,0.0005792105,0.00116395,0.0006787844,0.0005553897,0.0003445028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005000462,"about_ca_system_score_gemma":0.0003220703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008124448,"about_ca_topic_score_gemma":0.00125203,"domain_scores_codex":[0.9997137,0.00005499083,0.00002447694,0.00005687624,0.00006687122,0.00008311559],"domain_scores_gemma":[0.9995217,0.0001161505,0.00009138135,0.00007234929,0.0001286281,0.00006970276],"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.001868766,0.0001821356,0.003306787,0.0005969265,0.0001016353,0.002669229,0.001153131,0.01877159,0.131073,0.5570132,0.009839655,0.2734239],"study_design_scores_gemma":[0.0005936267,0.001833573,0.007334195,0.000278134,0.0004483013,0.00529753,0.001076354,0.2596599,0.2252324,0.3634591,0.1343879,0.000398848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5828961,0.002649162,0.3792634,0.0003488194,0.0005309494,0.0001405871,0.000364822,0.0004392628,0.03336708],"genre_scores_gemma":[0.8484858,0.001149154,0.1353322,0.0002103062,0.0001959879,0.0001377374,0.0005816385,0.00008796868,0.01381905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003030685,"threshold_uncertainty_score":0.01013863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162400339","doi":"10.1002/jcd.20180","title":"Skew‐Hadamard matrices of orders 436, 580, and 988 exist","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"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","keywords":"Hadamard transform; Mathematics; Skew; Combinatorics; Construct (python library); Order (exchange); Mathematical analysis; Computer science; Telecommunications","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01754244048535547,"gpt":0.2082764729562079,"spread":0.1907340324708524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554681,0.0004003877,0.0002844922,0.0006672413,0.0007242634,0.0005436492,0.0002741869,0.0003332066,0.005227525],"category_scores_gemma":[0.001126239,0.000237764,0.000334335,0.0003513006,0.0005862097,0.000643593,0.000350542,0.0005363293,0.0007346439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002913192,"about_ca_system_score_gemma":0.0003251998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002283211,"about_ca_topic_score_gemma":0.0002340932,"domain_scores_codex":[0.9996127,0.00006082207,0.00002002963,0.00007248676,0.0001597436,0.0000741374],"domain_scores_gemma":[0.9992053,0.0002347753,0.0001816332,0.000125354,0.0001596454,0.00009335225],"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.000804549,0.0001690516,0.006864568,0.0001289356,0.00004133077,0.0007867763,0.0008109412,0.01025346,0.1431229,0.7236352,0.002922795,0.1104595],"study_design_scores_gemma":[0.0002393777,0.001390002,0.00920378,0.00008250164,0.00007758283,0.003245163,0.0008463327,0.06407327,0.2653198,0.5892934,0.06603645,0.0001923498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8665338,0.0002242021,0.09338816,0.0001978097,0.0001608065,0.00005058771,0.0002278724,0.000155945,0.03906084],"genre_scores_gemma":[0.9641932,0.0001117183,0.0308726,0.00006667301,0.00003745578,0.00004196841,0.0002229144,0.00001916908,0.004434294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005227525,"threshold_uncertainty_score":0.01748782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970963182","doi":"10.1002/jcd.10060","title":"Super‐simple resolvable balanced incomplete block designs with block size 4 and index 3","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Simple (philosophy); Block size; Block design; Index (typography); Discrete mathematics; Computer science; Key (lock)","authors":[{"name":"Gennian Ge","is_ca":false},{"name":"Clement Lam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01375803456992017,"gpt":0.2069027847097385,"spread":0.1931447501398183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000811536,0.0005985147,0.0007364239,0.0007004958,0.0004390244,0.0009903305,0.0007941463,0.0006031076,0.005506756],"category_scores_gemma":[0.0021832,0.0004581109,0.0004918543,0.000615183,0.0004860439,0.001064962,0.0008826043,0.0005328265,0.001299663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000468586,"about_ca_system_score_gemma":0.0007233456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004277572,"about_ca_topic_score_gemma":0.001248022,"domain_scores_codex":[0.9990298,0.0002825426,0.0000842482,0.0001195518,0.0003191822,0.0001647869],"domain_scores_gemma":[0.9972651,0.0006455353,0.0008045425,0.0007009983,0.0004134128,0.0001705339],"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.003107686,0.0002601099,0.003409012,0.0005453414,0.000266148,0.0006504081,0.0002483607,0.1092785,0.3025534,0.410036,0.003402113,0.1662429],"study_design_scores_gemma":[0.001204497,0.002605886,0.002774412,0.0001834247,0.0002455814,0.001467592,0.0001495066,0.4675781,0.204743,0.2901536,0.02872967,0.0001647245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4213934,0.0003046654,0.5449189,0.0002249648,0.00006946181,0.0002331416,0.0006633717,0.0005056219,0.03168653],"genre_scores_gemma":[0.8365688,0.0002066945,0.1566425,0.00009742561,0.00004438129,0.0002205882,0.0005644981,0.00004375894,0.005611354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005506756,"threshold_uncertainty_score":0.01842195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069219864","doi":"10.1002/jcd.10033","title":"Slope packings and coverings, and generic algorithms for the discrete logarithm problem","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"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":"Mathematics; Logarithm; Prime (order theory); Affine transformation; Order (exchange); Combinatorics; Discrete logarithm; Point (geometry); Set (abstract data type); Plane (geometry); Algorithm; Discrete mathematics; Geometry; Computer science; Mathematical analysis","authors":[{"name":"M. Chateauneuf","is_ca":true},{"name":"Alan C. H. Ling","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02666075942693018,"gpt":0.2184677121974994,"spread":0.1918069527705693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559905,0.0007079891,0.0009982641,0.001092025,0.001465362,0.003386104,0.00146823,0.001361331,0.003752697],"category_scores_gemma":[0.009602647,0.0004942159,0.001114445,0.002733411,0.001453798,0.006440726,0.002510953,0.001184386,0.000511157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001607376,"about_ca_system_score_gemma":0.0007712499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004108881,"about_ca_topic_score_gemma":0.0005127232,"domain_scores_codex":[0.9983469,0.0005412247,0.0001643207,0.0004062318,0.0003081333,0.0002331829],"domain_scores_gemma":[0.9952198,0.002334929,0.0007212166,0.001286648,0.0001820277,0.0002554328],"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.001011198,0.0004439352,0.0125408,0.0006114004,0.0001738007,0.0004687441,0.001749783,0.1157542,0.01207668,0.5749098,0.007902175,0.2723574],"study_design_scores_gemma":[0.0001867276,0.000242994,0.001847454,0.00006702395,0.00008904806,0.001196186,0.0004989202,0.3273187,0.009101906,0.6501999,0.009206605,0.00004452308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5575461,0.0009000095,0.4226584,0.001104508,0.00005388574,0.0003095992,0.0006060458,0.0009020624,0.01591944],"genre_scores_gemma":[0.7994784,0.0006039986,0.195278,0.0001392067,0.00006887754,0.0002108949,0.001147531,0.000110805,0.002962238],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003752697,"threshold_uncertainty_score":0.01255405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074300802","doi":"10.1002/jcd.1017","title":"Bounds on the number of Hadamard designs of even order","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Upper and lower bounds; Order (exchange); Hadamard matrix; Hadamard's maximal determinant problem; Prime (order theory); Hadamard's inequality; Discrete mathematics","authors":[{"name":"Clement Lam","is_ca":true},{"name":"Sigmund Lam","is_ca":true},{"name":"Vladimir D. Tonchev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02602588023385388,"gpt":0.2473306858712236,"spread":0.2213048056373697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003684246,0.001450207,0.001797539,0.002050525,0.002045129,0.003689337,0.002157536,0.001928871,0.01298554],"category_scores_gemma":[0.01767875,0.001099999,0.001308527,0.001271515,0.002514299,0.005489225,0.002352118,0.002517446,0.002177052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002755441,"about_ca_system_score_gemma":0.001608277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006051605,"about_ca_topic_score_gemma":0.0008162126,"domain_scores_codex":[0.9930372,0.001576771,0.0004968363,0.0009953537,0.002708571,0.001185385],"domain_scores_gemma":[0.974151,0.01499207,0.002347077,0.004497875,0.002443182,0.001568751],"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.005611225,0.00068946,0.0141504,0.001323701,0.0003317037,0.001203773,0.0007612952,0.1238898,0.08493713,0.5649953,0.01807607,0.1840302],"study_design_scores_gemma":[0.0006890023,0.001159937,0.004016452,0.0002643382,0.0002384635,0.002431045,0.0002427844,0.2118942,0.08279665,0.6613714,0.03466693,0.0002287999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5867232,0.005021601,0.3192247,0.003524711,0.0007804665,0.0002970558,0.001424812,0.001357405,0.081646],"genre_scores_gemma":[0.8987388,0.001374441,0.08084381,0.0004563718,0.0004447456,0.0004577623,0.00106644,0.0001752679,0.01644235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01298554,"threshold_uncertainty_score":0.04344094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053450537","doi":"10.1002/jcd.20046","title":"Orthogonal designs, self‐dual codes, and the Leech lattice","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Dual (grammatical number); Orthogonal array; Circulant matrix; Lattice (music); Hadamard transform; Ternary operation; Hadamard matrix; Combinatorial design; Binary number; Combinatorics; Construct (python library); Discrete mathematics; Arithmetic; Computer science; Physics","authors":[{"name":"Masaaki Harada","is_ca":false},{"name":"Hadi Kharaghani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02016573371690598,"gpt":0.2476006265078046,"spread":0.2274348927908987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204524,0.0002645943,0.0002826648,0.0007991293,0.0006633356,0.0008547312,0.0002583895,0.0003709483,0.001700661],"category_scores_gemma":[0.001376194,0.0002390529,0.0002578805,0.0005144915,0.001557333,0.0009288546,0.0008370257,0.0006990413,0.0002997809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005862084,"about_ca_system_score_gemma":0.0006467051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003177398,"about_ca_topic_score_gemma":0.0005121927,"domain_scores_codex":[0.9994401,0.0002036143,0.00003347743,0.00006013141,0.000167983,0.00009458952],"domain_scores_gemma":[0.9990646,0.0002748752,0.0002017034,0.0001844772,0.0001635059,0.0001107856],"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.0002213695,0.00006517785,0.0008783902,0.00005161138,0.00001177541,0.0001531211,0.0001874459,0.009348811,0.01187929,0.9422922,0.001003944,0.03390693],"study_design_scores_gemma":[0.00009618229,0.0003176237,0.0005032786,0.00004205677,0.00001502097,0.0005116738,0.0001558488,0.05590621,0.02913602,0.8994088,0.01385228,0.00005507888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6319934,0.001117381,0.3186478,0.0008853297,0.0002625828,0.00009259953,0.0001430718,0.00026464,0.04659326],"genre_scores_gemma":[0.9303219,0.0004331226,0.06085805,0.0002297206,0.00008990772,0.00006727878,0.00006696946,0.00003095938,0.007902065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001700661,"threshold_uncertainty_score":0.005689323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047891102","doi":"10.1002/jcd.1010","title":"Balanced incomplete block designs with block size 8","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Value (mathematics); Construct (python library); Basis (linear algebra); Type (biology); Block design; Degree (music); Statistics; Discrete mathematics; Computer science; Geometry","authors":[{"name":"R. Julian R. Abel","is_ca":false},{"name":"Iliya Bluskov","is_ca":true},{"name":"Malcolm Greig","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01703019996916811,"gpt":0.2151809329329913,"spread":0.1981507329638232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357771,0.0003901093,0.0007618676,0.0005964069,0.0004638391,0.000763309,0.0004744618,0.0003656456,0.006212125],"category_scores_gemma":[0.003563088,0.0002876461,0.000300719,0.0005789956,0.0005414129,0.001039845,0.0008240491,0.0005357134,0.001318839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006926298,"about_ca_system_score_gemma":0.0006855502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005260836,"about_ca_topic_score_gemma":0.0008373217,"domain_scores_codex":[0.9988837,0.0003504072,0.0001158165,0.0001354927,0.0002962599,0.0002183431],"domain_scores_gemma":[0.9977306,0.0005335414,0.0004808498,0.0004903651,0.0005855107,0.0001791129],"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.003166255,0.0002163929,0.004656589,0.0004385055,0.0001011767,0.0004196025,0.0004168882,0.06312986,0.08098871,0.5900583,0.005844114,0.2505637],"study_design_scores_gemma":[0.001297899,0.004248157,0.003817811,0.0003645403,0.0001808201,0.0008848176,0.0003390887,0.3455279,0.1199495,0.4203686,0.1028761,0.0001446894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2754203,0.0004126518,0.6905537,0.0002656064,0.0001414082,0.0002528897,0.0007646213,0.000579667,0.03160921],"genre_scores_gemma":[0.8051003,0.0002134564,0.1845822,0.0001378963,0.0000811783,0.0003960271,0.000589574,0.00006067682,0.008838695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006212125,"threshold_uncertainty_score":0.02078158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964395996","doi":"10.1002/jcd.20112","title":"Commuting decompositions of complete graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Prime power; Graph; Discrete mathematics; Adjacency list; Multigraph; Prime (order theory)","authors":[{"name":"Saieed Akbari","is_ca":false},{"name":"Allen Herman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01477671401703002,"gpt":0.2146045965877301,"spread":0.1998278825707001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716333,0.0003196915,0.0003708316,0.001315437,0.0006409932,0.001124412,0.0004031711,0.0003657195,0.005284767],"category_scores_gemma":[0.001781915,0.0003055691,0.0004451713,0.0005784484,0.001073646,0.001775492,0.0008637959,0.0006347455,0.0003640745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000437428,"about_ca_system_score_gemma":0.0003276049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004917134,"about_ca_topic_score_gemma":0.0006513946,"domain_scores_codex":[0.9992386,0.0001542469,0.00006070567,0.00020601,0.0002013925,0.0001389092],"domain_scores_gemma":[0.9984717,0.0003483812,0.0002926047,0.0003012487,0.0002810216,0.0003050556],"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.0001392861,0.00008177961,0.001583335,0.00007697048,0.0000296137,0.0004232933,0.0007793742,0.005790505,0.009446666,0.9593065,0.001451581,0.02089106],"study_design_scores_gemma":[0.00003760068,0.00007213311,0.001108867,0.00003107582,0.00002441785,0.0003201695,0.000336813,0.02657733,0.004579473,0.9597422,0.007150702,0.0000193265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7650141,0.0003377724,0.2021843,0.0001905259,0.0000867282,0.0001687277,0.000442303,0.0002296624,0.03134593],"genre_scores_gemma":[0.9661582,0.0001788405,0.02777329,0.00008837026,0.00005297836,0.0001121708,0.0004670803,0.00004352208,0.005125599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005284767,"threshold_uncertainty_score":0.01767927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998402533","doi":"10.1002/jcd.20036","title":"Quintessential PBDs and PBDs with prime power block sizes ≥ 8","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Prime (order theory); Prime power; Combinatorics; Mathematics; Pairwise comparison; Set (abstract data type); Block (permutation group theory); Coprime integers; Discrete mathematics; Statistics; Computer science","authors":[{"name":"R. Julian R. Abel","is_ca":false},{"name":"F.E. Bennett","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005941501822332705,"gpt":0.1928235469604287,"spread":0.186882045138096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002426175,0.0006214139,0.0006938937,0.001039804,0.0009037792,0.0015878,0.0008373054,0.0007216866,0.007753086],"category_scores_gemma":[0.01050848,0.0005171539,0.0006031825,0.0007427227,0.001321882,0.002796815,0.001326567,0.001195268,0.001182587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007230435,"about_ca_system_score_gemma":0.000882793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003773381,"about_ca_topic_score_gemma":0.0006178118,"domain_scores_codex":[0.9981228,0.0005757993,0.0001689674,0.0003533,0.0004907844,0.0002883254],"domain_scores_gemma":[0.9913304,0.005109912,0.001031007,0.001481169,0.0007750287,0.000272511],"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.001757634,0.0002426773,0.004151317,0.0006798449,0.000116132,0.0004708993,0.0005154122,0.06817537,0.0232114,0.7068428,0.004360422,0.1894762],"study_design_scores_gemma":[0.0008254557,0.001551502,0.001197846,0.0003392152,0.0001620569,0.001628436,0.0003338395,0.1805915,0.05571312,0.711509,0.04605335,0.00009456855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4264534,0.001781042,0.5196824,0.00122763,0.0002237408,0.0003703958,0.0006153526,0.000513631,0.04913246],"genre_scores_gemma":[0.775802,0.001011876,0.2112335,0.0003917737,0.0001556023,0.0004671189,0.0006483158,0.00009566388,0.01019419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007753086,"threshold_uncertainty_score":0.0259366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086211490","doi":"10.1002/1520-6610(2001)9:2<79::aid-jcd1000>3.0.co;2-b","title":"Class-uniformly resolvable designs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Class (philosophy); Block (permutation group theory); Block size; Resolution (logic); Discrete mathematics; Block design; Computer science; Key (lock)","authors":[{"name":"Peter Danziger","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02536208899568449,"gpt":0.2295272784901336,"spread":0.2041651894944491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721615,0.0004849961,0.0006257658,0.001165565,0.001069539,0.001416615,0.001246455,0.00107533,0.006093122],"category_scores_gemma":[0.009018362,0.0003657974,0.0007165283,0.0009748446,0.001176551,0.001769544,0.000999614,0.001293754,0.0008150665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009005119,"about_ca_system_score_gemma":0.0007247936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003254818,"about_ca_topic_score_gemma":0.000545082,"domain_scores_codex":[0.9978288,0.0005866287,0.0001012871,0.0004302375,0.0005708109,0.0004820954],"domain_scores_gemma":[0.9900777,0.005176901,0.001417576,0.002287646,0.000756412,0.0002836021],"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.0004374778,0.0001421006,0.003259262,0.0002494155,0.00007383403,0.0002904531,0.0002663502,0.04997207,0.02064418,0.8240342,0.002456155,0.09817448],"study_design_scores_gemma":[0.0001765089,0.0005406566,0.001983761,0.0001380886,0.00008823073,0.00263553,0.0002955166,0.2563835,0.07087731,0.6378356,0.02892286,0.0001223665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4775088,0.001113583,0.4641774,0.0003735373,0.00008033922,0.000209532,0.0006035323,0.0004631975,0.05547003],"genre_scores_gemma":[0.9028491,0.0003576099,0.09128314,0.0001496372,0.00004695735,0.0001519223,0.0004273989,0.0000526836,0.00468157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.006093122,"threshold_uncertainty_score":0.02038348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1939767867","doi":"10.1002/jcd.21315","title":"The Asymptotic Existence of Resolvable Group Divisible Designs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Corollary; Block (permutation group theory); Group (periodic table); Graph; Discrete mathematics","authors":[{"name":"Justin H.C. Chan","is_ca":true},{"name":"Peter J. Dukes","is_ca":true},{"name":"E. R. Lamken","is_ca":false},{"name":"Alan C. H. Ling","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02720300328062038,"gpt":0.2330703016902766,"spread":0.2058672984096562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001746865,0.0003270161,0.0005776164,0.0009340722,0.0007246993,0.001292412,0.0008146348,0.0009073006,0.003558784],"category_scores_gemma":[0.01565864,0.0007246566,0.0005548317,0.000742998,0.00118577,0.00158813,0.001169092,0.001222405,0.0005570414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008137526,"about_ca_system_score_gemma":0.0005818493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002222438,"about_ca_topic_score_gemma":0.0003560837,"domain_scores_codex":[0.998327,0.0005651911,0.0001062324,0.0003563619,0.0004304621,0.0002147231],"domain_scores_gemma":[0.9829906,0.01077143,0.001713057,0.002589846,0.001462454,0.0004726553],"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.0008113046,0.0001743389,0.00676288,0.0004128851,0.0001044186,0.0005841231,0.0007335651,0.08640117,0.04825522,0.789911,0.003030298,0.06281879],"study_design_scores_gemma":[0.0001611903,0.0004319638,0.001690042,0.0001208286,0.00007326782,0.001425336,0.0002839211,0.2478236,0.02863161,0.7098166,0.009487833,0.0000538567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5169814,0.000468275,0.4604529,0.0004493588,0.00004285688,0.00009517904,0.0004354131,0.0004167233,0.02065793],"genre_scores_gemma":[0.9085893,0.0001765156,0.08807495,0.0001181764,0.0000377062,0.000131816,0.0002912464,0.00004841457,0.002531896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003558784,"threshold_uncertainty_score":0.01190531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1800155867","doi":"10.1002/jcd.10019","title":"Decomposition of the complete graph plus a 1‐factor into cycles of equal length","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","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 Regina","funders":"","keywords":"Mathematics; Combinatorics; Graph; Decomposition; Factor (programming language); Order (exchange); Discrete mathematics; Computer science; Chemistry","authors":[{"name":"Mateja Šajna","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02309675830683337,"gpt":0.2451734210967549,"spread":0.2220766627899215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926005,0.0007165665,0.000594737,0.001220154,0.0007967265,0.001473471,0.0004245758,0.0004953192,0.006030337],"category_scores_gemma":[0.00227745,0.0004936852,0.0006746211,0.0005600525,0.0009087555,0.001861542,0.0008435007,0.000774444,0.0007613199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005729077,"about_ca_system_score_gemma":0.0007363443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521952,"about_ca_topic_score_gemma":0.002845811,"domain_scores_codex":[0.9992216,0.0001343452,0.00004450311,0.0002144146,0.0001462137,0.0002390114],"domain_scores_gemma":[0.9973692,0.0007953058,0.0005724151,0.0003820813,0.0004424412,0.0004385921],"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.002212779,0.0004878446,0.01041103,0.0009799168,0.0002457502,0.002207742,0.001197638,0.08350175,0.1326115,0.6222969,0.01071707,0.1331301],"study_design_scores_gemma":[0.0003554675,0.0009876477,0.00778336,0.000341091,0.0003070816,0.002378461,0.001175086,0.1653453,0.0641797,0.7142209,0.04278209,0.0001438531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.742185,0.0005280467,0.2279532,0.0003496954,0.00009793113,0.0002863687,0.001177852,0.0002369485,0.02718494],"genre_scores_gemma":[0.8865744,0.0004221381,0.09996545,0.0002128709,0.00006343334,0.0002237315,0.00155674,0.00009438128,0.01088681],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006030337,"threshold_uncertainty_score":0.02017355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973315577","doi":"10.1002/jcd.10040","title":"On DRC‐covering of K<sub>n</sub> by cycles","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Advanced Optical Network Technologies","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 the Fraser Valley","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Path (computing); Enhanced Data Rates for GSM Evolution; Graph; Set (abstract data type); Discrete mathematics; Computer science; Computer network; Telecommunications","authors":[{"name":"Jean‐Claude Bermond","is_ca":false},{"name":"David Coudert","is_ca":false},{"name":"Min‐Li Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01033811752690011,"gpt":0.2172518668555552,"spread":0.2069137493286551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436779,0.0005139271,0.0007337421,0.0007044174,0.0005325531,0.0008932069,0.0004728707,0.0005186541,0.002776446],"category_scores_gemma":[0.002368598,0.0003277286,0.0004304732,0.001122572,0.0006079407,0.001070205,0.0009760491,0.0002809739,0.0002969891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007791804,"about_ca_system_score_gemma":0.000503391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002277377,"about_ca_topic_score_gemma":0.001425945,"domain_scores_codex":[0.9993604,0.000231047,0.0000263134,0.0001183643,0.0001084086,0.000155451],"domain_scores_gemma":[0.9985883,0.0007622166,0.0002152146,0.0001813722,0.0001228958,0.0001300175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004272011,0.0001060694,0.002886603,0.0003227246,0.00009174549,0.0005071059,0.0002847056,0.7891433,0.0153683,0.09319779,0.005118258,0.0925462],"study_design_scores_gemma":[0.00004177769,0.0001676055,0.001277072,0.00004624351,0.00003638179,0.0004315517,0.0001686571,0.8953989,0.008923623,0.08477216,0.008713583,0.0000224549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7477599,0.0007999985,0.2322818,0.0003266976,0.00003548603,0.000145608,0.0005625463,0.000218962,0.01786909],"genre_scores_gemma":[0.9113242,0.0006199675,0.08232828,0.0001116799,0.00004299895,0.0001355105,0.0008176464,0.000121923,0.004497841],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002776446,"threshold_uncertainty_score":0.009288132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2973469729","doi":"10.1002/jcd.21523","title":"A Complete Solution to the Existence of ‐Cycle Frames of Type","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Consiglio Nazionale delle Ricerche; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Mathematics; Type (biology); Combinatorics; Frame (networking); Computer science","authors":[{"name":"Marco Buratti","is_ca":false},{"name":"H. Cao","is_ca":false},{"name":"Dan Dai","is_ca":false},{"name":"Tommaso Traetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0280049455761916,"gpt":0.2356361332812353,"spread":0.2076311877050437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007084635,0.0006545597,0.0009303733,0.0008544999,0.001361222,0.001990242,0.001147444,0.002115525,0.01090327],"category_scores_gemma":[0.003104807,0.0005461336,0.0008550289,0.0007388263,0.001034881,0.002233298,0.002039033,0.002313864,0.000913824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008126512,"about_ca_system_score_gemma":0.0009820281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008789954,"about_ca_topic_score_gemma":0.0006785092,"domain_scores_codex":[0.999552,0.00007859575,0.00002389836,0.0001180815,0.00008737164,0.0001400594],"domain_scores_gemma":[0.9992525,0.0003263748,0.00007173723,0.00008128234,0.0001686282,0.00009947985],"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.00006000765,0.00003685354,0.0001562992,0.0001230651,0.00001335837,0.00009756704,0.0001680017,0.006627154,0.002375236,0.9660443,0.004819911,0.01947827],"study_design_scores_gemma":[0.00004398125,0.00007015207,0.0001521981,0.00007045914,0.00001688802,0.0001572389,0.000306018,0.03867525,0.002198037,0.9442983,0.01398752,0.00002384526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1863801,0.0006404193,0.7148589,0.001971191,0.000491773,0.0001889953,0.000671985,0.0002532592,0.09454332],"genre_scores_gemma":[0.6781949,0.0007918808,0.2814375,0.0004850985,0.0003974995,0.0004105764,0.0008241104,0.0001616373,0.03729681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01090327,"threshold_uncertainty_score":0.03647506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079936473","doi":"10.1002/jcd.20215","title":"On list coloring Steiner triple systems","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"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","keywords":"Combinatorics; Mathematics; Chromatic scale; Steiner system; Integer (computer science); Discrete mathematics; Computer science","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Martin Pei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01561863609801577,"gpt":0.2201453753034336,"spread":0.2045267392054178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004820863,0.0003508548,0.0003599977,0.001331942,0.001393049,0.001444574,0.0005118123,0.0006859994,0.007216238],"category_scores_gemma":[0.002403881,0.0003035716,0.0003509443,0.001974582,0.00109587,0.001908932,0.001015553,0.0007324688,0.0005178978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001767835,"about_ca_system_score_gemma":0.0006036023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00229695,"about_ca_topic_score_gemma":0.00282559,"domain_scores_codex":[0.9993809,0.000149096,0.00002270309,0.00009101167,0.0001604013,0.0001958255],"domain_scores_gemma":[0.9981037,0.00091645,0.0002715011,0.0001866186,0.0003024697,0.0002191482],"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.0005650959,0.00007356038,0.004250581,0.0002153218,0.00004680734,0.0005777331,0.00070962,0.1080399,0.0222327,0.8203203,0.00691192,0.03605637],"study_design_scores_gemma":[0.00009101645,0.0002550402,0.002627072,0.00008809654,0.000045213,0.0009536837,0.0007755642,0.3807476,0.0153793,0.5831919,0.01576945,0.00007610992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8032504,0.0005990993,0.1493292,0.0005125709,0.0001199289,0.00006845409,0.0004379811,0.0002177594,0.04546465],"genre_scores_gemma":[0.9723915,0.000308094,0.02139508,0.00007743928,0.0000475157,0.00004388264,0.0002646662,0.0000537923,0.005417913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007216238,"threshold_uncertainty_score":0.02414072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075668496","doi":"10.1002/jcd.20108","title":"Orthogonal designs via computational algebra","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Orthogonal array; Hadamard matrix; Quaternion; Hadamard transform; Order (exchange); Orthogonal matrix; Combinatorics; Matrix (chemical analysis); Complex Hadamard matrix; Clifford algebra; Algebra over a field; Quaternion algebra; Analogy; Pure mathematics; Orthogonal basis; Division algebra; Geometry; Algebra representation; Mathematical analysis; Taguchi methods","authors":[{"name":"Ilias Kotsireas","is_ca":true},{"name":"Christos Koukouvinos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01213506156045652,"gpt":0.2092555400238357,"spread":0.1971204784633792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451868,0.0006847826,0.0006502985,0.001678751,0.001579554,0.003085361,0.0009873775,0.0007239356,0.01473634],"category_scores_gemma":[0.005186046,0.0004578149,0.001279781,0.001581915,0.003628372,0.004409276,0.00283689,0.001931921,0.002490191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360335,"about_ca_system_score_gemma":0.001155934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005437261,"about_ca_topic_score_gemma":0.0008421748,"domain_scores_codex":[0.9969574,0.001115735,0.0002012761,0.0004684232,0.0008799086,0.0003772037],"domain_scores_gemma":[0.9975811,0.001082419,0.0002239633,0.0005824048,0.0003996532,0.0001304366],"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.00001520278,0.0000139577,0.00004560883,0.00002468841,0.000003647515,0.00001446912,0.00005314506,0.001607609,0.0003564041,0.9866263,0.0006401485,0.01059868],"study_design_scores_gemma":[0.00001400656,0.00003210334,0.00003337974,0.00001833313,0.000005783019,0.00004086995,0.0000273539,0.008209935,0.001071423,0.9806194,0.009914228,0.00001313828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06751943,0.0007840339,0.8028424,0.001048145,0.0003837956,0.000271292,0.0003129522,0.0003669807,0.1264709],"genre_scores_gemma":[0.6027462,0.0009564959,0.3642452,0.0006493512,0.0005792913,0.0006145395,0.0005711223,0.0001668286,0.029471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01473634,"threshold_uncertainty_score":0.04929793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983867705","doi":"10.1002/jcd.20062","title":"Fault tolerant forwarding and optical indexes: A design theory approach","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Fault tolerance; Mathematics; Fault (geology); Arc (geometry); Network planning and design; Combinatorics; Computer science; Discrete mathematics; Distributed computing; Computer network; Graph","authors":[{"name":"Arvind Gupta","is_ca":true},{"name":"Ján Maňuch","is_ca":true},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03096560694727978,"gpt":0.2514559348853198,"spread":0.22049032793804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712012,0.0005958342,0.0005420374,0.001319021,0.0006430844,0.001762355,0.0008896179,0.001060514,0.002462378],"category_scores_gemma":[0.003806244,0.0004610425,0.0004942981,0.0009544234,0.001484741,0.002366245,0.0008442872,0.0008549992,0.000259493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001954197,"about_ca_system_score_gemma":0.0008491465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005292993,"about_ca_topic_score_gemma":0.0005530034,"domain_scores_codex":[0.999065,0.0003103795,0.00003641025,0.0000862279,0.0003976782,0.0001042911],"domain_scores_gemma":[0.9984002,0.0009645466,0.0001872532,0.000174177,0.000229702,0.00004418482],"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.00005583397,0.00005712975,0.0003239258,0.0001213264,0.00002617105,0.00005183445,0.00007773114,0.2178059,0.004802785,0.7271701,0.001572452,0.04793495],"study_design_scores_gemma":[0.00002874329,0.0001027198,0.000146544,0.00003920956,0.000023886,0.00009880531,0.00005743187,0.4788679,0.004888299,0.5089658,0.006763228,0.00001744771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02207833,0.0005855357,0.9656076,0.0005091724,0.00006148015,0.00004472353,0.00004143413,0.00008820862,0.01098349],"genre_scores_gemma":[0.7028679,0.001449022,0.287894,0.0004414674,0.0001976384,0.0002462856,0.000130477,0.00007082406,0.006702384],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002462378,"threshold_uncertainty_score":0.01417875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018363124","doi":"10.1002/jcd.20204","title":"Almost resolvable cycle systems—an analogue of Hanani triple systems","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"C.C. Lindner","is_ca":false},{"name":"Mariusz Meszka","is_ca":false},{"name":"A. Rosa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01651078187888355,"gpt":0.2267145336467825,"spread":0.210203751767899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004090928,0.0002360861,0.0003183611,0.0007433061,0.001133547,0.001253625,0.0005884941,0.0008822864,0.008998644],"category_scores_gemma":[0.001592157,0.0002769589,0.0003590972,0.0005483759,0.001038899,0.001582468,0.001314386,0.001287883,0.0005838252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004988458,"about_ca_system_score_gemma":0.0004572865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005552907,"about_ca_topic_score_gemma":0.0009972284,"domain_scores_codex":[0.9993969,0.0001431621,0.00003066344,0.0001005114,0.0001967733,0.0001319593],"domain_scores_gemma":[0.9990207,0.0003546019,0.0001710634,0.0001662463,0.0001844638,0.0001029791],"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.00005680393,0.00002315824,0.0002913646,0.00004704377,0.000009914555,0.0001835343,0.0002886853,0.00508308,0.006351318,0.9763179,0.0006256084,0.01072164],"study_design_scores_gemma":[0.00002765837,0.00008493801,0.0003274519,0.00002541745,0.000007290894,0.0003105668,0.0002794652,0.03679229,0.005394573,0.9476227,0.009102018,0.0000255867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6561029,0.0005967114,0.236554,0.001009292,0.0002009253,0.0001898455,0.000282184,0.0002175269,0.1048466],"genre_scores_gemma":[0.9512439,0.0001687097,0.034804,0.0001878965,0.00005862108,0.00007869273,0.0001563506,0.0000265259,0.0132753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008998644,"threshold_uncertainty_score":0.03010345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592616259","doi":"10.1002/jcd.21330","title":"Sperner Partition Systems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Manitoba","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Class (philosophy); Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science","authors":[{"name":"P. C. Li","is_ca":true},{"name":"Karen Meagher","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07791015228074148,"gpt":0.3212382987943097,"spread":0.2433281465135682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001871904,0.0007626449,0.001127981,0.002042157,0.001880828,0.002730662,0.00154964,0.001035146,0.01496563],"category_scores_gemma":[0.009057601,0.0006999302,0.0006737377,0.001343226,0.002708798,0.005171358,0.002975099,0.001702464,0.001529078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765383,"about_ca_system_score_gemma":0.000812674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008524488,"about_ca_topic_score_gemma":0.00103617,"domain_scores_codex":[0.9977407,0.0004598794,0.0001505643,0.0006746915,0.0006045266,0.0003695256],"domain_scores_gemma":[0.9894503,0.00553634,0.0012777,0.001895712,0.001171085,0.0006688831],"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.0003323342,0.00007433518,0.001488215,0.0002244504,0.00005025637,0.0002163922,0.0004006224,0.03339286,0.01126104,0.9180818,0.00635039,0.02812734],"study_design_scores_gemma":[0.0000701558,0.0001738126,0.001096263,0.00006610948,0.0000440511,0.000553487,0.0002060602,0.1204977,0.01093796,0.8485633,0.01773958,0.00005149741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4583566,0.001508165,0.4512109,0.001106916,0.0002065864,0.0004156668,0.001387423,0.001319573,0.08448808],"genre_scores_gemma":[0.8996024,0.0003673733,0.08236586,0.0002424293,0.0001773399,0.0002829921,0.0007916613,0.0001472887,0.01602254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01496563,"threshold_uncertainty_score":0.05006498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982048527","doi":"10.1002/jcd.20288","title":"Generalized covering designs and clique coverings","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Toronto Metropolitan University; University of Regina","funders":"","keywords":"Mathematics; Generalization; Clique; Combinatorics; Class (philosophy); Combinatorial design; Discrete mathematics; Computer science; Artificial intelligence","authors":[{"name":"R. A. Bailey","is_ca":true},{"name":"Andrea C. Burgess","is_ca":true},{"name":"Michael Cavers","is_ca":true},{"name":"Karen Meagher","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0352675518526096,"gpt":0.2189030182884409,"spread":0.1836354664358313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417667,0.0007150651,0.0005409631,0.0009594986,0.0006584561,0.001271652,0.0006464133,0.0008320034,0.004068897],"category_scores_gemma":[0.004287799,0.0004462711,0.0007411555,0.001347946,0.001119416,0.001758752,0.001035673,0.0009229309,0.0004621443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008685167,"about_ca_system_score_gemma":0.0004878601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004968747,"about_ca_topic_score_gemma":0.0006118827,"domain_scores_codex":[0.9985354,0.0005377693,0.00007523881,0.000332537,0.0003160921,0.0002030061],"domain_scores_gemma":[0.9964192,0.00171319,0.0005661887,0.0007613215,0.0003242304,0.0002158413],"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.0002184593,0.00005681378,0.001091121,0.0002247845,0.00006271882,0.0003167773,0.0002509215,0.08677956,0.02164531,0.8031644,0.003627316,0.08256182],"study_design_scores_gemma":[0.000104432,0.000347668,0.0008643002,0.0000691794,0.00005058306,0.001071178,0.0001394135,0.2669919,0.01408955,0.6901468,0.0260669,0.00005820947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2056922,0.001056013,0.7649806,0.0004855065,0.0001663725,0.0001580801,0.0003601829,0.0004594586,0.02664156],"genre_scores_gemma":[0.7576155,0.0008116512,0.2337456,0.0003169261,0.0001806786,0.0003548456,0.0003489123,0.00009348835,0.006532379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004068897,"threshold_uncertainty_score":0.01361185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085573612","doi":"10.1002/jcd.20193","title":"Enumeration of generalized Hadamard matrices of order 16 and related designs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; St. Peter's Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Combinatorics; Enumeration; Order (exchange); Hadamard matrix; Discrete mathematics; Mathematical analysis","authors":[{"name":"Peter B. Gibbons","is_ca":true},{"name":"Rudolf Mathon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01861412344521519,"gpt":0.2166864600996515,"spread":0.1980723366544363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007072105,0.0004550261,0.0004253726,0.001226263,0.0006779634,0.001293621,0.0004196383,0.0006380885,0.0033326],"category_scores_gemma":[0.003359358,0.000320502,0.000516165,0.001282937,0.0009250578,0.001423005,0.00069571,0.0005390628,0.0004648952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007056429,"about_ca_system_score_gemma":0.0006944746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004576332,"about_ca_topic_score_gemma":0.0007687272,"domain_scores_codex":[0.998904,0.0003177054,0.00009506261,0.0001280452,0.0003685591,0.000186654],"domain_scores_gemma":[0.9972474,0.001182646,0.0006283831,0.0004350443,0.0003591441,0.0001473757],"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.0008018242,0.0003055221,0.01159188,0.0004210172,0.0000740797,0.001330875,0.0009372692,0.1018045,0.06265375,0.636416,0.002817906,0.1808455],"study_design_scores_gemma":[0.0002006972,0.0009490738,0.00381155,0.0001581514,0.00007240545,0.002485477,0.000601412,0.2565195,0.07538683,0.637365,0.02230958,0.000140364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8345267,0.0004617032,0.1450042,0.0002896042,0.00004682242,0.0001421035,0.0003566728,0.000240424,0.01893173],"genre_scores_gemma":[0.9015083,0.0001864208,0.0917066,0.00005835374,0.00002351231,0.0001003635,0.0004102128,0.00003443863,0.00597176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0033326,"threshold_uncertainty_score":0.01114863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050377717","doi":"10.1002/1520-6610(2001)9:1<1::aid-jcd1>3.0.co;2-h","title":"The spectrum of ?-resolvable designs with block size four","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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; Beijing Institute For Brain Disorders","keywords":"Mathematics; Disjoint sets; Block (permutation group theory); Combinatorics; Block size; Class (philosophy); Block design; Property (philosophy); Point (geometry); Spectrum (functional analysis); Discrete mathematics; Computer science; Artificial intelligence; Key (lock)","authors":[{"name":"Troy Vasiga","is_ca":true},{"name":"Steven Furino","is_ca":true},{"name":"Alan C. H. Ling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01639612341163756,"gpt":0.2046042192495821,"spread":0.1882080958379446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643257,0.0005677793,0.000742825,0.001757699,0.001240104,0.001858356,0.0008512188,0.001406476,0.005361773],"category_scores_gemma":[0.006974901,0.0006391086,0.0004907739,0.0008412095,0.001965882,0.001495364,0.001578846,0.00107255,0.0009347324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007206354,"about_ca_system_score_gemma":0.0005275133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002348692,"about_ca_topic_score_gemma":0.0001608776,"domain_scores_codex":[0.998208,0.00045586,0.0001402438,0.0003024561,0.0005546136,0.0003387076],"domain_scores_gemma":[0.9913266,0.005358332,0.001131849,0.0009898565,0.0006509898,0.0005423048],"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.001793393,0.0001669225,0.003951841,0.0003507006,0.00007748639,0.0008195351,0.0008950437,0.02112111,0.04844556,0.8602243,0.002144196,0.06000988],"study_design_scores_gemma":[0.0004896048,0.0004569834,0.001919576,0.0001579115,0.00005086554,0.00158073,0.0003099299,0.08090668,0.01951917,0.8866298,0.007896093,0.00008266393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8007545,0.0006980365,0.1583502,0.0008324332,0.00004916171,0.00007911981,0.0005303923,0.0004136972,0.03829243],"genre_scores_gemma":[0.9756154,0.0002291722,0.02133534,0.0001524349,0.00005791138,0.0001711546,0.0002299268,0.00003061962,0.002177991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005361773,"threshold_uncertainty_score":0.01793689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3006556965","doi":"10.1002/jcd.21706","title":"Classification of skew‐Hadamard matrices of order 32 and association schemes of order 31","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Hadamard transform; Skew; Combinatorics; Hadamard's maximal determinant problem; Order (exchange); Complex Hadamard matrix; Permutation (music); Association scheme; Equivalence (formal languages); Hadamard matrix; Hadamard's inequality; Backtracking; Matrix (chemical analysis); Hadamard product; Discrete mathematics; Algorithm; Computer science; Mathematical analysis","authors":[{"name":"Akihide Hanaki","is_ca":false},{"name":"Hadi Kharaghani","is_ca":true},{"name":"Ali Mohammadian","is_ca":false},{"name":"B. Tayfeh‐Rezaie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01922249569994263,"gpt":0.2258178620339508,"spread":0.2065953663340081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008171441,0.000345843,0.0004102433,0.001851242,0.001178305,0.001650743,0.0005726743,0.0008215647,0.005890521],"category_scores_gemma":[0.003729744,0.0002803237,0.0005005567,0.001214242,0.001481193,0.001770473,0.001015933,0.0009473667,0.0005902017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005852093,"about_ca_system_score_gemma":0.0005889488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003623902,"about_ca_topic_score_gemma":0.000317589,"domain_scores_codex":[0.9987413,0.0002296045,0.0001388736,0.0002277409,0.000419624,0.0002429849],"domain_scores_gemma":[0.9967173,0.001018441,0.0005834854,0.0009143709,0.0004643968,0.0003020519],"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.0004095074,0.0002325483,0.01082907,0.0001349274,0.00002353958,0.0004335051,0.001025189,0.01083924,0.02329249,0.850219,0.002277772,0.1002833],"study_design_scores_gemma":[0.0001068639,0.0004617287,0.007731076,0.00008093756,0.0000257888,0.001730261,0.0007127605,0.07787976,0.02291915,0.8628966,0.02535327,0.0001016708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9006233,0.0003060876,0.0803085,0.0002736263,0.00008564826,0.0001184224,0.0003384375,0.0001505726,0.01779539],"genre_scores_gemma":[0.9564072,0.0000988166,0.03924497,0.00004645915,0.00003436776,0.00005561133,0.0004179524,0.00002216496,0.003672629],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005890521,"threshold_uncertainty_score":0.01970577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008014647","doi":"10.1002/jcd.20006","title":"Existence question for difference families and construction of some new families","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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","keywords":"Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Luis Martínez","is_ca":false},{"name":"Dragomir Ž. Ðoković","is_ca":true},{"name":"Antonio Vera López","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01650254630098339,"gpt":0.2273513855587111,"spread":0.2108488392577277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971479,0.0003695731,0.0005149159,0.001411265,0.001438299,0.001531449,0.0006861718,0.001099304,0.004940214],"category_scores_gemma":[0.00682938,0.00065686,0.0007167687,0.0007476571,0.001259097,0.003381102,0.001697543,0.001366064,0.0003328825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009529378,"about_ca_system_score_gemma":0.000369951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001294972,"about_ca_topic_score_gemma":0.0000961653,"domain_scores_codex":[0.9989771,0.0003052988,0.00007269784,0.0002562014,0.0002627833,0.0001260176],"domain_scores_gemma":[0.995497,0.002717951,0.0004611606,0.0003809818,0.0006156827,0.0003272396],"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.0003022905,0.00007065559,0.00390474,0.000149982,0.00002843132,0.0003240262,0.0005118333,0.003011781,0.01677249,0.9464887,0.001313441,0.02712159],"study_design_scores_gemma":[0.0001521773,0.0004008988,0.002847043,0.0001560084,0.00008024107,0.003142484,0.0007900296,0.08089259,0.02627322,0.8594093,0.02576246,0.00009358033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5449054,0.0007602468,0.4300984,0.001153267,0.0001263817,0.0001040784,0.000325287,0.0001353745,0.02239161],"genre_scores_gemma":[0.8914195,0.0002814846,0.101922,0.0002293645,0.0001059642,0.0001892506,0.000308827,0.00005102118,0.005492661],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004940214,"threshold_uncertainty_score":0.01652664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2529460726","doi":"10.1002/jcd.21536","title":"Triple Systems are Eulerian","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eulerian path; Mathematics; Combinatorics; Steiner system; Euler's formula; Triple system; Order (exchange); Graph; Context (archaeology); Rank (graph theory); Discrete mathematics; Pure mathematics; Lagrangian; Mathematical analysis","authors":[{"name":"Mateja Šajna","is_ca":true},{"name":"Andrew Wagner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01717736666673144,"gpt":0.2061783393717065,"spread":0.189000972704975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002761382,0.0002714917,0.0002683132,0.0006606461,0.0009592354,0.001048219,0.0002269042,0.0003621831,0.00849875],"category_scores_gemma":[0.0009918857,0.0003177665,0.0003251877,0.000368854,0.001208716,0.001477989,0.0011684,0.0006423318,0.0007086364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005065678,"about_ca_system_score_gemma":0.0006258189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008490596,"about_ca_topic_score_gemma":0.001083737,"domain_scores_codex":[0.9995854,0.00006985021,0.00002922077,0.00008641866,0.0001145379,0.0001145559],"domain_scores_gemma":[0.9992607,0.0001605963,0.000149223,0.0001284842,0.0002013409,0.00009959326],"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.0001355749,0.00003354344,0.001662229,0.0001028987,0.00001838751,0.0003586112,0.0004988587,0.01611974,0.01626279,0.9392844,0.002204657,0.02331833],"study_design_scores_gemma":[0.00003470419,0.0002201766,0.001510433,0.0001032638,0.00002673318,0.0008452966,0.0007464132,0.05229587,0.0247001,0.8711713,0.04829016,0.00005564712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6267389,0.00051247,0.2652136,0.0004077243,0.0001887007,0.00009990588,0.0004137881,0.0004330279,0.1059919],"genre_scores_gemma":[0.9676875,0.0001860113,0.02240056,0.0000870049,0.00002478027,0.00004684381,0.0001897276,0.00004213988,0.00933542],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00849875,"threshold_uncertainty_score":0.02843118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}