{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888014,0.0001545992,0.0003301179,0.0001981265,0.0001436793,0.00007093642,0.0001753822,0.00008510484,0.00003456846],"category_scores_gemma":[0.0000174895,0.0001441106,0.000137625,0.0002115707,0.00005745806,0.0002505468,0.00001421512,0.0002428631,0.00000714402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003114018,"about_ca_system_score_gemma":0.00001506538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005389993,"about_ca_topic_score_gemma":0.000001760108,"domain_scores_codex":[0.9989346,0.0001121543,0.0004543162,0.00008109139,0.0002059864,0.0002118938],"domain_scores_gemma":[0.9993094,0.0001751423,0.0001240744,0.0001284016,0.00009380272,0.0001691858],"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.0007562682,0.0005474479,0.005168225,0.0001661348,0.001120863,0.0005369452,0.002105855,0.008607464,0.1702849,0.7920014,0.01465031,0.004054158],"study_design_scores_gemma":[0.009977377,0.001233243,0.01203595,0.0003717644,0.0003363844,0.002462271,0.0005838915,0.00446172,0.007732155,0.9291021,0.03068775,0.001015365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9882368,0.0008352453,0.004103056,0.00006617569,0.004052607,0.0001152279,0.000005564119,0.00008614622,0.00249919],"genre_scores_gemma":[0.9991876,0.0002270835,0.0002770023,0.00002030376,0.0002469851,0.000002967093,0.000001387364,0.00002362031,0.00001308009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1625528,"threshold_uncertainty_score":0.5876658,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004807284,0.0001313087,0.0002676252,0.0001633711,0.00005082066,0.00005995923,0.0001302125,0.00009775398,0.00001500991],"category_scores_gemma":[0.00002566735,0.0001173393,0.00008732156,0.0001712607,0.00002968756,0.0001232663,0.000009040813,0.0002130899,0.000005617465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003129699,"about_ca_system_score_gemma":0.00001798291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001368828,"about_ca_topic_score_gemma":0.000002710923,"domain_scores_codex":[0.9990652,0.00009153895,0.0004345372,0.0000643247,0.000172708,0.000171656],"domain_scores_gemma":[0.9994831,0.0001324247,0.0001232761,0.00009847502,0.0000778611,0.00008486513],"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.0003127192,0.0002837949,0.007387415,0.0002763191,0.0002315613,0.0002792914,0.0005767467,0.005372966,0.06782772,0.9016407,0.01291847,0.002892321],"study_design_scores_gemma":[0.01035712,0.001863294,0.01405811,0.0005223873,0.0002693374,0.0007059615,0.0003144627,0.002779326,0.03989156,0.8649866,0.06302714,0.001224688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9787485,0.002412514,0.007529963,0.00002968344,0.005803862,0.0001185157,0.000002950397,0.000072161,0.005281842],"genre_scores_gemma":[0.9987805,0.00002825475,0.0002672253,0.000005721267,0.0008275357,0.000001531136,7.885801e-7,0.00002280302,0.0000656331],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05010867,"threshold_uncertainty_score":0.4784959,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535802,0.0001213568,0.000259242,0.0000964892,0.00004741898,0.00002744836,0.0002654193,0.00004417905,0.0001033403],"category_scores_gemma":[0.00009118037,0.00008453023,0.0001467933,0.0001662527,0.00003441376,0.0001096134,0.000008701414,0.0002810572,0.00001492495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003547245,"about_ca_system_score_gemma":0.000008550105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001498786,"about_ca_topic_score_gemma":5.943825e-7,"domain_scores_codex":[0.998946,0.00009166639,0.0004451802,0.00004951459,0.0003106301,0.0001569819],"domain_scores_gemma":[0.9990864,0.0003957087,0.0001946792,0.0001730279,0.00008424472,0.00006597467],"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.0004675121,0.0006049814,0.0003423331,0.0002567086,0.001060169,0.0001428517,0.003270343,0.1261603,0.09731451,0.7376595,0.02285676,0.00986403],"study_design_scores_gemma":[0.004435028,0.002391436,0.0005481813,0.0007484596,0.0001384018,0.0001067551,0.0002194542,0.01961334,0.1514968,0.812104,0.007575148,0.0006229223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840437,0.0003749777,0.005444787,0.00003312178,0.006098025,0.0001116814,0.00000467452,0.00002808642,0.003861006],"genre_scores_gemma":[0.999631,0.00004595856,0.00003707693,0.00000792735,0.0002316358,0.000001566494,8.961761e-8,0.00001961739,0.0000250541],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1065469,"threshold_uncertainty_score":0.3447043,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008075973,0.0001050046,0.0003008369,0.0001449207,0.00002561594,0.00001529171,0.0001852969,0.0000861467,0.00005308195],"category_scores_gemma":[0.00005891772,0.00008775435,0.000124464,0.0002526788,0.00002307834,0.0003084302,0.000009795863,0.000169258,0.00001260775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002792563,"about_ca_system_score_gemma":0.00002397011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001877438,"about_ca_topic_score_gemma":9.053511e-8,"domain_scores_codex":[0.9989557,0.00009239445,0.0004651467,0.00003213047,0.0002613151,0.0001933169],"domain_scores_gemma":[0.9992931,0.0001250241,0.0002020015,0.0001089414,0.0001630677,0.0001079056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00076767,0.001105153,0.02593459,0.001057843,0.001605295,0.00005957432,0.004723731,0.004398457,0.2354163,0.6679262,0.052686,0.004319196],"study_design_scores_gemma":[0.01550966,0.003311001,0.019484,0.001362432,0.001219505,0.001076904,0.002186091,0.001063712,0.4775479,0.2294292,0.2455008,0.002308817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9602918,0.004320309,0.006260102,0.00001845481,0.02201028,0.0001163894,0.000002939567,0.00004511272,0.006934599],"genre_scores_gemma":[0.9986441,0.00006120148,0.000349507,0.000004144459,0.0008937609,0.000001052875,2.254917e-7,0.00001884353,0.00002720581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4384969,"threshold_uncertainty_score":0.3578519,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008786825,0.0001475918,0.0003074431,0.0001224917,0.0001397827,0.0002073865,0.0006044129,0.00005409771,0.000007590165],"category_scores_gemma":[0.0003866433,0.0001142979,0.00009971705,0.0003921063,0.00003371312,0.0006830054,0.00002760976,0.0002601187,0.000007200193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006027839,"about_ca_system_score_gemma":0.0003025807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003268071,"about_ca_topic_score_gemma":5.547916e-7,"domain_scores_codex":[0.9985118,0.0001745783,0.0003867858,0.0001530655,0.0004915249,0.0002822579],"domain_scores_gemma":[0.9985858,0.0003134985,0.0004037888,0.0002304043,0.0002953756,0.0001711807],"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.00002216715,0.000597392,0.008727037,0.00005378973,0.0002790743,0.001031284,0.001255069,0.003149332,0.03748767,0.9255596,0.003954936,0.01788268],"study_design_scores_gemma":[0.02742943,0.01264302,0.009240845,0.00154222,0.0003655841,0.006752646,0.0006864488,0.00809959,0.23691,0.6520554,0.0411307,0.003144129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09743447,0.0001960646,0.8938516,0.0001287422,0.004404901,0.0000779383,3.195937e-7,0.00005306176,0.003852948],"genre_scores_gemma":[0.988676,0.000008676352,0.01093182,0.00006183256,0.000268578,9.626381e-7,8.882508e-8,0.00001184412,0.00004020561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8912416,"threshold_uncertainty_score":0.4660932,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522761,0.00008656111,0.0002408735,0.0001387041,0.00006890533,0.00005977717,0.0004640257,0.00005201765,0.000002831116],"category_scores_gemma":[0.0001710051,0.00007931786,0.0001197444,0.0003009317,0.00004695425,0.0005930904,0.00003845479,0.0001818645,0.000002282236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007800127,"about_ca_system_score_gemma":0.0001812968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001018358,"about_ca_topic_score_gemma":2.7485e-7,"domain_scores_codex":[0.9988801,0.00005134711,0.0004640995,0.00009410544,0.0003612635,0.0001490894],"domain_scores_gemma":[0.9988747,0.0001018139,0.0005483895,0.0001486169,0.0002394877,0.00008705081],"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.000004663942,0.0001448692,0.0008837666,0.00002282797,0.00004095434,0.00006409612,0.0003736881,0.001514857,0.06830936,0.9147716,0.00003556187,0.01383378],"study_design_scores_gemma":[0.004523661,0.001602003,0.0019301,0.0003954056,0.00004293699,0.001002978,0.00009248261,0.000684732,0.06542663,0.923658,0.0003483746,0.0002926743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.122083,0.00007031384,0.8732129,0.00007789894,0.004000443,0.00003724919,2.807531e-7,0.00002018638,0.0004976955],"genre_scores_gemma":[0.9785116,0.00001261054,0.02109305,0.00001912688,0.0003567134,3.041048e-7,1.048669e-7,0.000005214955,0.000001320268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8564285,"threshold_uncertainty_score":0.3234488,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007044816,0.00009755187,0.0001856341,0.00004189075,0.0001386425,0.0000949692,0.0001545273,0.00005816222,0.000001317348],"category_scores_gemma":[0.00002991253,0.00006324804,0.00008929809,0.00006494809,0.00002641219,0.0001385024,0.000003312724,0.0001241672,0.000001140808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001977763,"about_ca_system_score_gemma":0.00001306933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.571677e-7,"about_ca_topic_score_gemma":3.781988e-7,"domain_scores_codex":[0.9992803,0.00005302627,0.0003187204,0.00004821285,0.0001286123,0.000171121],"domain_scores_gemma":[0.9994418,0.0002209989,0.00009162221,0.00008598986,0.00008669226,0.00007287351],"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.001165125,0.0002194696,0.000192381,0.0002077447,0.0004937449,0.00003901371,0.0043365,0.003611058,0.1100602,0.8241971,0.02007381,0.03540386],"study_design_scores_gemma":[0.002576047,0.001324741,0.0004150596,0.00009702628,0.00006297335,0.000100011,0.0001847362,0.0009726163,0.01417144,0.9344632,0.04542323,0.0002089375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9772218,0.003779286,0.007102338,0.0003745697,0.008732831,0.0006055639,0.000004062653,0.00009437827,0.002085137],"genre_scores_gemma":[0.9990303,0.0001198171,0.0003004745,0.0000139045,0.000452489,0.000004229576,1.816581e-7,0.00001191653,0.00006669921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.110266,"threshold_uncertainty_score":0.2579181,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002386625,0.0001306063,0.0003395327,0.0001318935,0.00002873088,0.00002004601,0.0002396151,0.00006515493,0.00005203735],"category_scores_gemma":[0.00003494243,0.00009645811,0.00009313243,0.0002206315,0.00006590601,0.0001359266,0.000008508786,0.0001908954,0.000005693922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002584041,"about_ca_system_score_gemma":0.00001517036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001472726,"about_ca_topic_score_gemma":2.440863e-7,"domain_scores_codex":[0.9989967,0.00007098688,0.0004031312,0.00006074921,0.0003143554,0.0001541186],"domain_scores_gemma":[0.9993073,0.0001063976,0.0001887625,0.0001570305,0.0001569784,0.00008351305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001541877,0.001785945,0.01923248,0.0009105148,0.001793306,0.0006063844,0.01960395,0.00301726,0.4377081,0.501296,0.00488292,0.007621286],"study_design_scores_gemma":[0.02958031,0.02489076,0.05967567,0.006133631,0.0009830445,0.002930298,0.00663343,0.006605458,0.563388,0.2786073,0.01652629,0.004045771],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9878413,0.0008876823,0.003566099,0.00001035948,0.002284695,0.00009364136,0.000001865378,0.00003143209,0.005282937],"genre_scores_gemma":[0.9994577,0.00006342515,0.0002778708,0.000003812521,0.00009913858,0.000001744416,7.852934e-8,0.00001678846,0.00007942284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2226887,"threshold_uncertainty_score":0.3933448,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008951333,0.00008013649,0.0002153638,0.0001108434,0.00002873352,0.00001346257,0.0002562032,0.00008692774,0.00004583112],"category_scores_gemma":[0.0001752685,0.00005243621,0.0001022859,0.0002278674,0.00004650775,0.00008464802,0.000005767953,0.0002887821,0.000003818198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001045775,"about_ca_system_score_gemma":0.00003301094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002047452,"about_ca_topic_score_gemma":6.750049e-7,"domain_scores_codex":[0.9990665,0.00009426996,0.0004490579,0.00003850946,0.0002692345,0.00008245152],"domain_scores_gemma":[0.9988212,0.0003982807,0.0003275279,0.0001722399,0.0002463003,0.00003443428],"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.00009838168,0.00007862989,0.0002092388,0.00004905204,0.00007804045,0.000001466651,0.0001986157,0.0003040845,0.4084701,0.5879324,0.002301896,0.0002781061],"study_design_scores_gemma":[0.003325671,0.001605174,0.01355395,0.0004053746,0.0002391701,0.00006673348,0.0006709618,0.002463705,0.44392,0.5232227,0.01009969,0.0004268244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9894677,0.00008484086,0.001254408,0.00006405807,0.00612158,0.00009205119,0.00000211445,0.00001065509,0.002902594],"genre_scores_gemma":[0.9996347,0.00001558184,0.00009122165,0.000003768103,0.0002277757,0.000001599764,2.125211e-7,0.00001176194,0.00001339405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0647097,"threshold_uncertainty_score":0.2138287,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997717,0.0002286063,0.0004704795,0.0002804571,0.00009599115,0.0001231857,0.0002216349,0.0002117908,0.00004096811],"category_scores_gemma":[0.00007366071,0.0002001869,0.0001399686,0.0002825356,0.00005219842,0.0003892834,0.00001818358,0.0004051349,0.00001958911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009509962,"about_ca_system_score_gemma":0.0000313497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001656009,"about_ca_topic_score_gemma":0.00000109548,"domain_scores_codex":[0.998059,0.00017704,0.0009012416,0.0001188294,0.0003751916,0.0003686903],"domain_scores_gemma":[0.9988261,0.0003081764,0.000204047,0.0001831302,0.0001978443,0.0002806906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001012662,0.0005374319,0.01079648,0.000771565,0.001856972,0.001476622,0.004497708,0.009282281,0.6632785,0.2715755,0.03157267,0.003341547],"study_design_scores_gemma":[0.05810307,0.01423111,0.04183252,0.003739466,0.002346228,0.01658281,0.01988957,0.01466318,0.2252941,0.4941909,0.1011987,0.007928396],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9727992,0.00251333,0.008084363,0.00001757022,0.01297849,0.0003586111,0.00000286685,0.0001081712,0.003137427],"genre_scores_gemma":[0.999195,0.0000653491,0.00005773594,0.000006931454,0.0005378278,0.00000318414,0.000001805273,0.00004875458,0.00008335914],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4379845,"threshold_uncertainty_score":0.8163383,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034385,0.0001932436,0.0003132405,0.0002685046,0.00008013089,0.00004358139,0.0001505103,0.0001238493,0.00003166114],"category_scores_gemma":[0.00006637111,0.0001633531,0.0001391807,0.0001932234,0.00003899064,0.000204483,0.000005451824,0.0003347243,0.00001599408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006247267,"about_ca_system_score_gemma":0.00002345455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.861423e-7,"about_ca_topic_score_gemma":1.173364e-7,"domain_scores_codex":[0.9987252,0.0002069001,0.0003629095,0.00007455501,0.0003330759,0.0002973361],"domain_scores_gemma":[0.99902,0.0003632544,0.0001298472,0.0001559879,0.00006164259,0.000269228],"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.002248451,0.001256094,0.009283652,0.0002593166,0.000612258,0.0001325776,0.001723251,0.03084842,0.04321407,0.8771051,0.03016609,0.003150731],"study_design_scores_gemma":[0.04981464,0.02752488,0.03594972,0.004165814,0.001500667,0.0009528239,0.001671618,0.0205448,0.2913017,0.4751567,0.085473,0.005943666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9560414,0.0008531775,0.008313172,0.00007877611,0.02366379,0.000353794,0.000005208976,0.0001356916,0.01055499],"genre_scores_gemma":[0.9992102,0.00002096107,0.0001556614,0.0000625571,0.0004980683,0.000003627616,5.588479e-7,0.00003384562,0.00001451216],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4019485,"threshold_uncertainty_score":0.6661345,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037536,0.0001211738,0.0002375312,0.0001551285,0.0001386648,0.0001963987,0.000951134,0.00007483699,0.00001217674],"category_scores_gemma":[0.0008587973,0.0001055619,0.00007667505,0.0004030908,0.00005344501,0.0005253963,0.0001180419,0.0002236741,0.00001352088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007171804,"about_ca_system_score_gemma":0.0002502336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001260386,"about_ca_topic_score_gemma":1.069645e-7,"domain_scores_codex":[0.9987342,0.00009908579,0.0003841805,0.0001417491,0.0004066476,0.000234123],"domain_scores_gemma":[0.9982215,0.0004117907,0.000361926,0.0003436292,0.0005313782,0.0001297621],"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.00009945464,0.0004173612,0.001577797,0.0000245172,0.0001003809,0.0001191161,0.0008096671,0.00004728708,0.007409677,0.8281533,0.1464399,0.01480161],"study_design_scores_gemma":[0.0008343488,0.00167957,0.000187084,0.0001473391,0.00001760451,0.0002024549,0.000003068102,0.003652614,0.01754354,0.9635979,0.01191993,0.0002145429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00410271,0.00004741288,0.9862108,0.0001002455,0.006119128,0.00004949672,3.868968e-7,0.0009072218,0.002462556],"genre_scores_gemma":[0.5993401,0.00000335566,0.399567,0.00007909162,0.0009766314,8.737479e-7,8.53899e-8,0.000008624661,0.00002417332],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5952374,"threshold_uncertainty_score":0.4304691,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006633145,0.0001348995,0.0002803681,0.0001823914,0.0000568658,0.0000484161,0.0002102534,0.0001047832,0.00006130264],"category_scores_gemma":[0.00002716126,0.0001233379,0.0001641914,0.0001714196,0.00002435583,0.0003406309,0.000008801975,0.0003098756,0.00003984192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001394737,"about_ca_system_score_gemma":0.00002246567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000181061,"about_ca_topic_score_gemma":0.000001929163,"domain_scores_codex":[0.9989027,0.0001356092,0.000498615,0.00005871272,0.0002251596,0.0001792219],"domain_scores_gemma":[0.9994192,0.0001006489,0.0001437774,0.0001256242,0.00009564844,0.0001151552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001432164,0.000981539,0.002412151,0.0002933473,0.001323187,0.000246373,0.005896969,0.06985717,0.3943492,0.3848805,0.09177245,0.04655504],"study_design_scores_gemma":[0.01375126,0.004722246,0.00271187,0.000964365,0.000534557,0.002252547,0.001524259,0.01599255,0.4200891,0.2878664,0.2475645,0.002026356],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9326152,0.0006868346,0.03736223,0.00007881809,0.0196663,0.0001767881,0.000001800717,0.0001591166,0.009252949],"genre_scores_gemma":[0.9981394,0.00002363481,0.0002669558,0.0000181329,0.001482537,0.000002224288,4.366695e-7,0.00002563728,0.00004107206],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1557921,"threshold_uncertainty_score":0.5029575,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001849551,0.0001321746,0.0002499027,0.0002766614,0.0001370103,0.0001365574,0.0007730504,0.00007038959,0.000005849421],"category_scores_gemma":[0.0003367806,0.0001151491,0.0001693937,0.00045676,0.00002535723,0.0004328974,0.00004473918,0.0003383109,0.00001833052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007713072,"about_ca_system_score_gemma":0.0001114228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003328549,"about_ca_topic_score_gemma":5.143214e-7,"domain_scores_codex":[0.9984022,0.00007598791,0.0004995891,0.0001429585,0.0005634435,0.0003158724],"domain_scores_gemma":[0.9984394,0.0004910458,0.0004125311,0.0002271214,0.0002340344,0.0001958569],"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.00002042458,0.0003601608,0.001743222,0.00001617048,0.00007523318,0.0007523207,0.0004753552,0.0003220343,0.03826804,0.8921767,0.002693714,0.06309664],"study_design_scores_gemma":[0.007170395,0.005391517,0.01841983,0.0006215738,0.00007383924,0.0009788937,0.0001614928,0.002173903,0.1355004,0.8192688,0.009126464,0.001112924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1144555,0.00007021795,0.8702469,0.0001185049,0.009712792,0.0000585018,2.354611e-7,0.00005434472,0.005283062],"genre_scores_gemma":[0.9959296,0.000006725147,0.003332573,0.0001252645,0.0005762383,2.689517e-7,1.072078e-7,0.000009510714,0.00001972149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8814741,"threshold_uncertainty_score":0.4695643,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140849,0.0001445329,0.0002310993,0.00008806917,0.00009835201,0.00004626118,0.0002248674,0.0000818312,0.00002584971],"category_scores_gemma":[0.00006195607,0.0000853623,0.0001926089,0.0001170819,0.00002491642,0.0002182049,0.000005354952,0.0002076097,0.00001499341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004729462,"about_ca_system_score_gemma":0.00001364124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.966192e-7,"about_ca_topic_score_gemma":1.730943e-7,"domain_scores_codex":[0.9989591,0.0001113018,0.0003732393,0.00004610157,0.0002163489,0.0002939423],"domain_scores_gemma":[0.9990178,0.0004974484,0.0001345998,0.0001404656,0.00008406907,0.000125608],"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.0002497113,0.0002230477,0.001172105,0.0001093041,0.0003421444,0.000003210462,0.004206532,0.001529067,0.02501577,0.9410272,0.02589636,0.0002255433],"study_design_scores_gemma":[0.004940276,0.002628986,0.001756243,0.0004960118,0.000327681,0.00008859132,0.001014979,0.0006617213,0.2689094,0.561756,0.1564675,0.0009525478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9832208,0.0002691181,0.002953759,0.00004668246,0.01211133,0.0003222501,0.000004581304,0.00004458183,0.001026885],"genre_scores_gemma":[0.998895,0.000009182828,0.00008242179,0.00001976154,0.0008735233,0.00001377689,6.590863e-7,0.00002982124,0.00007588493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3792712,"threshold_uncertainty_score":0.3480974,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000653791,0.0001442105,0.0002109522,0.00008467697,0.00007003787,0.00004292426,0.0002723408,0.00006389124,0.00005413022],"category_scores_gemma":[0.00002926751,0.00006070265,0.00008879499,0.0001419461,0.00005408086,0.0001537053,0.000005311121,0.000185084,0.00003230196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005230399,"about_ca_system_score_gemma":0.00002983257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001701271,"about_ca_topic_score_gemma":9.080339e-7,"domain_scores_codex":[0.9989939,0.0001362234,0.0003006405,0.00006637659,0.0003026673,0.0002001772],"domain_scores_gemma":[0.9991865,0.0003244988,0.0001231705,0.0001748301,0.0001090614,0.0000819363],"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.0007731143,0.0001426514,0.0002575887,0.00005609227,0.0004811238,0.00009756582,0.001178204,0.001431101,0.04514127,0.9290535,0.01991846,0.001469256],"study_design_scores_gemma":[0.0104103,0.005733227,0.0004193107,0.001895457,0.0001925293,0.0004317002,0.0004290242,0.00013388,0.09804896,0.8256731,0.05571829,0.0009142307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9812484,0.0000939162,0.008327572,0.0004196704,0.004713004,0.0002790943,0.000002377765,0.00007698641,0.00483899],"genre_scores_gemma":[0.9994161,0.00001714378,0.0000650038,0.00002699391,0.000277405,0.000006138329,7.916591e-8,0.00002827089,0.0001628309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1033805,"threshold_uncertainty_score":0.2475382,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006316723,0.0001449198,0.0004188355,0.00006724465,0.00007768822,0.0001364811,0.0001631198,0.00009602671,0.001245571],"category_scores_gemma":[0.0008206076,0.0001023145,0.0001018547,0.0001221478,0.00008204369,0.0003365436,0.00002561839,0.0002169679,0.00004263518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004579081,"about_ca_system_score_gemma":0.00005182446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004781865,"about_ca_topic_score_gemma":3.7127e-7,"domain_scores_codex":[0.9984704,0.0001821644,0.0006910761,0.00009100135,0.0004004515,0.0001649637],"domain_scores_gemma":[0.9980438,0.0007841927,0.0004155567,0.0001247837,0.0004486561,0.0001830121],"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.0000354284,0.0002976757,0.00005061108,0.0000625215,0.00004306458,0.00000364263,0.0003287103,3.784376e-7,0.01083728,0.9552234,0.03196338,0.001153905],"study_design_scores_gemma":[0.0009584583,0.0004800167,0.0002969429,0.00005748504,0.000044562,0.00007062328,0.0001902319,0.001444638,0.003978254,0.9910302,0.001318267,0.0001302892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3203919,0.00007837659,0.6588998,0.001906703,0.001385746,0.0008678136,0.000002494072,0.00008194132,0.01638515],"genre_scores_gemma":[0.8181345,0.00001473614,0.1811546,0.0001253153,0.0003226728,0.00001033751,8.419258e-7,0.00002210958,0.0002148917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4977426,"threshold_uncertainty_score":0.9996674,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000874469,0.0001825288,0.0003823231,0.0004433142,0.00008582331,0.0001009502,0.0002323599,0.0001366652,0.0000390246],"category_scores_gemma":[0.0001244586,0.0001598931,0.0001071508,0.0008359603,0.00003654886,0.0003163708,0.00001624196,0.0002907559,0.00001777045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005740477,"about_ca_system_score_gemma":0.00003933839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004093908,"about_ca_topic_score_gemma":4.033745e-7,"domain_scores_codex":[0.9986786,0.0001436421,0.0005035725,0.00009451075,0.0003247749,0.0002549096],"domain_scores_gemma":[0.999022,0.0002831772,0.0001721674,0.0001386348,0.0001927068,0.0001913343],"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.003467289,0.001167342,0.03946045,0.001203359,0.002917761,0.003080375,0.003180953,0.01121022,0.1678663,0.6580271,0.07569657,0.03272225],"study_design_scores_gemma":[0.02056051,0.009370317,0.02185884,0.001378639,0.001495483,0.008467481,0.001531974,0.006009846,0.0409997,0.5928419,0.291827,0.003658289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9676787,0.007960466,0.006608605,0.00004929792,0.0127272,0.0001914918,0.000001574847,0.0001094188,0.004673272],"genre_scores_gemma":[0.9977918,0.001125817,0.0002538128,0.00001359098,0.000713267,0.00000146971,3.893636e-7,0.00003160807,0.00006826824],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2161304,"threshold_uncertainty_score":0.6520249,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003832257,0.0001343361,0.0003578477,0.0002032519,0.00008050882,0.00003440926,0.0001472831,0.0001117328,0.00001537113],"category_scores_gemma":[0.00008972894,0.000125034,0.0001144174,0.0002278695,0.0001259801,0.0002299696,0.00001724607,0.0002108014,0.000002114378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002771297,"about_ca_system_score_gemma":0.00004115616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001575058,"about_ca_topic_score_gemma":0.00000237794,"domain_scores_codex":[0.9988114,0.00009363581,0.000675372,0.00006612677,0.000209744,0.0001437505],"domain_scores_gemma":[0.9991871,0.0002364426,0.0002455876,0.0001379823,0.0001404612,0.00005249134],"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.0001843993,0.0001693252,0.007721928,0.000395474,0.0005962148,0.0000700918,0.001531946,0.0250852,0.1990965,0.7545041,0.009565823,0.001078914],"study_design_scores_gemma":[0.009436793,0.001147641,0.008691989,0.0008547637,0.0004206764,0.00137122,0.00369253,0.002832287,0.07793998,0.8864477,0.006326667,0.0008377603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9765136,0.0009649157,0.0009827648,0.00001091229,0.004879706,0.00009144455,0.000009698297,0.00004671296,0.01650029],"genre_scores_gemma":[0.9992115,0.0001029896,0.0004039023,0.000001433378,0.0002079952,0.000001369984,8.294255e-7,0.00001701403,0.00005291481],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1319435,"threshold_uncertainty_score":0.5098736,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133116,0.00009967043,0.0003474152,0.00007510396,0.0001685541,0.0001035761,0.001371703,0.00006112881,0.000002709429],"category_scores_gemma":[0.0005279035,0.00008731667,0.0001119474,0.00008590668,0.00006458967,0.0008752214,0.00009963691,0.000156987,0.000001054044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003375052,"about_ca_system_score_gemma":0.0001226278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002562851,"about_ca_topic_score_gemma":3.054016e-7,"domain_scores_codex":[0.9986099,0.0001025336,0.0005670095,0.0001266697,0.0004493062,0.0001445847],"domain_scores_gemma":[0.9968747,0.0002736882,0.001786494,0.0005427824,0.0004140085,0.0001083048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002108348,0.0005076821,0.01273831,0.00008140458,0.00005778222,0.00001831663,0.000530217,0.001478871,0.8037384,0.1514207,0.00006662437,0.02934065],"study_design_scores_gemma":[0.00837619,0.00410559,0.1454164,0.001262526,0.0001622839,0.0001713039,0.0001016126,0.1178555,0.4509671,0.2704012,0.0004846186,0.0006956193],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2333706,0.0000487588,0.7644165,0.00004722346,0.001634672,0.00008668716,7.818331e-7,0.00001298111,0.0003817817],"genre_scores_gemma":[0.9951566,0.00000946266,0.004520151,0.00000836717,0.0002942826,7.639675e-7,1.968488e-7,0.000006829654,0.000003369847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.761786,"threshold_uncertainty_score":0.3560671,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006177019,0.0001698488,0.0004222123,0.0001688544,0.00005055976,0.00003152468,0.0002645756,0.0001421017,0.00005534966],"category_scores_gemma":[0.00006916908,0.000149514,0.0001832199,0.0002652499,0.00008906002,0.0003869882,0.000006845566,0.0002935952,0.000005296991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007343222,"about_ca_system_score_gemma":0.00007616833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001040568,"about_ca_topic_score_gemma":3.188096e-7,"domain_scores_codex":[0.9984894,0.0002029109,0.0006768195,0.00009808932,0.0003479303,0.0001848358],"domain_scores_gemma":[0.9990473,0.0001779298,0.0003145472,0.0001647525,0.000177215,0.000118273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000556941,0.0001981826,0.001947295,0.0000892397,0.0004279664,0.000225723,0.001361541,0.005246284,0.8729745,0.1090914,0.0022888,0.005592193],"study_design_scores_gemma":[0.005356537,0.003762027,0.009445738,0.001323845,0.0003754546,0.0006766247,0.001797812,0.003857859,0.1992151,0.769495,0.003667002,0.001026996],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891857,0.0008049178,0.001702085,0.00004396833,0.007019625,0.0001079377,0.00001211918,0.00005425388,0.001069392],"genre_scores_gemma":[0.9983461,0.0001083557,0.001049769,0.00001103111,0.0004626148,0.000001112462,0.000001486381,0.0000134823,0.000006000535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6737593,"threshold_uncertainty_score":0.6097002,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000393245,0.0001507454,0.000406737,0.0001908034,0.00003653785,0.00006133074,0.0002091352,0.0001104003,0.00006136142],"category_scores_gemma":[0.00006106055,0.0001287254,0.000122234,0.0001760505,0.0000412652,0.0004886642,0.00001726332,0.0002055994,0.00001208411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002670414,"about_ca_system_score_gemma":0.00005550534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004245715,"about_ca_topic_score_gemma":5.673716e-7,"domain_scores_codex":[0.9988353,0.00007979267,0.0005455752,0.00007117612,0.0002807388,0.0001874717],"domain_scores_gemma":[0.9991426,0.0001755453,0.0002301506,0.0001264788,0.0001361689,0.0001890034],"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.0004888548,0.0003356427,0.005644158,0.00109058,0.001590318,0.00008903367,0.002477407,0.002693374,0.1732524,0.6092505,0.1917535,0.01133424],"study_design_scores_gemma":[0.007082861,0.001690408,0.006729118,0.0005865866,0.0002940848,0.0002273323,0.0006023183,0.0007901382,0.0298434,0.9258634,0.02550056,0.0007898303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9842947,0.004179125,0.001680582,0.0001350065,0.00856728,0.0002278156,0.000001783947,0.00004672215,0.0008669536],"genre_scores_gemma":[0.9984603,0.0002748088,0.0004334144,0.00001237822,0.0007263243,0.000001879126,2.557306e-7,0.00002416906,0.00006649455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3166128,"threshold_uncertainty_score":0.5249268,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001012334,0.000277992,0.0005155595,0.0001686765,0.0001319278,0.0001138705,0.0004330608,0.0001618662,0.00004609115],"category_scores_gemma":[0.00006558418,0.0002226021,0.0001791161,0.0003676951,0.0000537873,0.0004854759,0.00001989038,0.0004573273,0.00002564554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001217447,"about_ca_system_score_gemma":0.00006095115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005719764,"about_ca_topic_score_gemma":0.000009543749,"domain_scores_codex":[0.9981177,0.0001339462,0.0006513831,0.0001424303,0.000533652,0.0004208682],"domain_scores_gemma":[0.9987026,0.00035325,0.0002296471,0.000295836,0.0001786867,0.000239932],"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.003950949,0.001508268,0.002363482,0.0004354298,0.002145319,0.0005952316,0.001907113,0.338758,0.175277,0.4361605,0.03205721,0.0048415],"study_design_scores_gemma":[0.05665397,0.01720946,0.007727202,0.002826847,0.001787417,0.00320197,0.0008546269,0.04255266,0.1750504,0.5554274,0.1308553,0.00585273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8910004,0.001624236,0.07962324,0.0001545418,0.007952706,0.000655941,0.000007213393,0.0003460881,0.01863562],"genre_scores_gemma":[0.9966865,0.0000396759,0.001853348,0.00002183231,0.001221969,0.000008941761,4.96631e-7,0.00006337994,0.0001038202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2962053,"threshold_uncertainty_score":0.9077452,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430589,0.0002797921,0.001014135,0.0003424086,0.0001261763,0.00002972562,0.0007428621,0.0001750758,0.0001894013],"category_scores_gemma":[0.001791972,0.0002193756,0.0006140827,0.0005447115,0.0003219678,0.0002573991,0.00008931019,0.0005485741,0.00001652653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001836863,"about_ca_system_score_gemma":0.0006233415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003762198,"about_ca_topic_score_gemma":0.00001721462,"domain_scores_codex":[0.996167,0.0004631995,0.001364991,0.0002098332,0.00135199,0.0004429937],"domain_scores_gemma":[0.9953252,0.001805962,0.001306274,0.0004631091,0.0008520278,0.0002474259],"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.000737104,0.00217112,0.0006161276,0.0002444874,0.0003478429,0.00007022178,0.001137025,0.00007053101,0.02361718,0.9693779,0.001505253,0.0001052633],"study_design_scores_gemma":[0.003578955,0.002316836,0.0001771913,0.0004595658,0.0002146692,0.00004267524,0.0002772045,0.000007306455,0.07319257,0.9194049,0.0001410301,0.0001870848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9811916,0.0002239424,0.0148033,0.0002518974,0.001182847,0.0003190163,0.00003096881,0.00002798293,0.001968471],"genre_scores_gemma":[0.9956019,0.00005784059,0.003965071,0.00003715493,0.000225647,0.000007750647,0.000001556576,0.00003736278,0.00006571462],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04997293,"threshold_uncertainty_score":0.8945878,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008218156,0.0001591782,0.0002567881,0.00006306518,0.0003353791,0.0002249191,0.0006087715,0.00007638576,0.00002743106],"category_scores_gemma":[0.00004990376,0.00008935745,0.0001086411,0.00004954447,0.0000761649,0.0002676793,0.0000130801,0.0003667133,0.00002639128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004022994,"about_ca_system_score_gemma":0.00002813419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005789816,"about_ca_topic_score_gemma":0.000001930519,"domain_scores_codex":[0.998973,0.0001085033,0.0003065297,0.00007504906,0.000326119,0.000210824],"domain_scores_gemma":[0.9989623,0.0001739447,0.0002557822,0.0004097772,0.0001067876,0.0000913687],"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.0007725563,0.000245427,0.0005413423,0.0001124209,0.0006271621,0.0002338157,0.002541414,0.007664295,0.01210326,0.9626077,0.01117217,0.001378411],"study_design_scores_gemma":[0.008569652,0.004378218,0.00287705,0.001378342,0.0002589751,0.0004682532,0.0005531573,0.001572706,0.06256067,0.8909826,0.02539204,0.001008388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9794473,0.00009125084,0.0008745456,0.000192686,0.005076333,0.0002322728,0.000002046138,0.00004707157,0.01403648],"genre_scores_gemma":[0.9992483,0.0000181611,0.00006979669,0.00001810682,0.0004765966,0.000006167325,1.604617e-7,0.00003066806,0.0001320798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07162518,"threshold_uncertainty_score":0.3643891,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043704,0.0001742154,0.0003668682,0.00008967872,0.00009885705,0.0001220151,0.000231785,0.0001312627,0.00001296553],"category_scores_gemma":[0.00007886736,0.0001252778,0.00006760503,0.0001337685,0.00004959476,0.000421078,0.00001899536,0.0003473221,0.000003443607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000648186,"about_ca_system_score_gemma":0.0001392677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002085943,"about_ca_topic_score_gemma":0.00001760574,"domain_scores_codex":[0.9990023,0.00002345943,0.000360757,0.00008171864,0.0003183527,0.0002133523],"domain_scores_gemma":[0.9992032,0.0001332501,0.0001821323,0.0001755074,0.00008206207,0.0002238396],"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.005600323,0.0006245055,0.00816525,0.0005549965,0.002493436,0.001316395,0.002245791,0.03705647,0.01648211,0.9197532,0.001827737,0.00387981],"study_design_scores_gemma":[0.01264309,0.002555806,0.01056206,0.0006615822,0.0001816855,0.0007434699,0.000168601,0.0001472196,0.006231722,0.9643169,0.001288424,0.0004994064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9858485,0.0004887432,0.008936428,0.0002411853,0.003736272,0.0002078871,0.000001672312,0.0000675339,0.0004718005],"genre_scores_gemma":[0.9977719,0.00009145278,0.0008598056,0.00002015378,0.001180698,0.000001417718,7.247947e-8,0.00003306047,0.00004146088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04456376,"threshold_uncertainty_score":0.5108679,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004486425,0.0001362306,0.0003892287,0.0001810487,0.00006810691,0.00001876346,0.0001776682,0.00009640727,0.00001717509],"category_scores_gemma":[0.00005982834,0.000120531,0.0001208466,0.0002172947,0.0000804469,0.000202529,0.00001312166,0.0001992623,0.000003471785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002674005,"about_ca_system_score_gemma":0.00004128737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007581958,"about_ca_topic_score_gemma":4.746494e-7,"domain_scores_codex":[0.9988844,0.00009193172,0.0005116513,0.00006717899,0.0002842642,0.00016062],"domain_scores_gemma":[0.9992509,0.0001668487,0.0002155822,0.000116411,0.0001364111,0.0001138548],"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.002328611,0.001267842,0.03419549,0.002489083,0.003017294,0.001507271,0.01147518,0.006550546,0.2056232,0.6395757,0.08710052,0.004869316],"study_design_scores_gemma":[0.03094758,0.008296769,0.03761235,0.002217962,0.001125635,0.006378095,0.002503705,0.001637945,0.155834,0.6256472,0.124442,0.003356669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9892199,0.001986161,0.001142092,0.00001730443,0.004916737,0.00009285435,0.000002718296,0.00003330546,0.002588945],"genre_scores_gemma":[0.998948,0.0004063779,0.0002666367,0.000005183478,0.000322953,0.000001181599,2.889329e-7,0.00002174168,0.00002765404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04978915,"threshold_uncertainty_score":0.4915112,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009319463,0.0002818723,0.0005667856,0.0001500667,0.0001478003,0.0001063204,0.0002319561,0.0001559572,0.00004076678],"category_scores_gemma":[0.0001804896,0.0002334193,0.0001037697,0.0003515985,0.00007487883,0.0002736194,0.00001502939,0.0004250554,0.000005282322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007298955,"about_ca_system_score_gemma":0.00009070278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007122018,"about_ca_topic_score_gemma":0.000003611747,"domain_scores_codex":[0.9981737,0.0002814319,0.0005860503,0.0001566574,0.0003992482,0.0004029403],"domain_scores_gemma":[0.9986389,0.0004784325,0.0001813252,0.0002406669,0.0001957843,0.0002648389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005388931,0.001309264,0.08444858,0.001220419,0.003693405,0.001726361,0.005286748,0.06163142,0.4862906,0.3215401,0.02690737,0.0005568175],"study_design_scores_gemma":[0.06769273,0.01656555,0.02537458,0.002039337,0.001331712,0.01086689,0.00375722,0.005675641,0.1807392,0.507591,0.1722707,0.006095356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9904779,0.0006555228,0.003132046,0.00002019857,0.002341747,0.0002775153,0.000005101319,0.00008412365,0.003005872],"genre_scores_gemma":[0.9989674,0.00004067586,0.0005857068,0.00002310099,0.0002726704,0.000006696177,4.105464e-7,0.00005475085,0.00004859552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3055514,"threshold_uncertainty_score":0.9518562,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005355475,0.0001387584,0.0002460166,0.00006157414,0.0001320725,0.0001134876,0.0001351868,0.00007397671,0.00001026896],"category_scores_gemma":[0.00003442923,0.00009469364,0.00007479049,0.00010308,0.00006072633,0.0001940875,0.00001887387,0.0001750896,9.647182e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002233675,"about_ca_system_score_gemma":0.000006448197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002201358,"about_ca_topic_score_gemma":3.371971e-7,"domain_scores_codex":[0.9992236,0.00004505649,0.0003099934,0.00008173757,0.0001562611,0.0001833744],"domain_scores_gemma":[0.9993738,0.0002428571,0.0001210683,0.00009261092,0.00007589172,0.00009376718],"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.001089766,0.0005171193,0.003675726,0.002416102,0.004248112,0.0003128091,0.01722223,0.01217219,0.07446609,0.560177,0.08799715,0.2357057],"study_design_scores_gemma":[0.019956,0.005016122,0.003257788,0.0008448322,0.001120941,0.002785375,0.001304105,0.1669761,0.01359592,0.3405177,0.4424987,0.002126368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5299237,0.05463868,0.3787701,0.001380581,0.02790171,0.002901446,0.00006191558,0.0002981568,0.004123612],"genre_scores_gemma":[0.9974729,0.0007745562,0.001102328,0.00002111165,0.0005317224,0.00001140449,2.748944e-7,0.00002687874,0.00005883434],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4675491,"threshold_uncertainty_score":0.3861495,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169489,0.0001583748,0.0004266847,0.0001052859,0.00005357946,0.0000217763,0.0003686413,0.00011562,0.0001920706],"category_scores_gemma":[0.000152727,0.0001099366,0.0002147599,0.0003923122,0.00007384783,0.0001250457,0.00001300852,0.0002897028,0.00001393696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004446873,"about_ca_system_score_gemma":0.00006830558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006446202,"about_ca_topic_score_gemma":5.841076e-7,"domain_scores_codex":[0.9983553,0.0002510607,0.0006852733,0.00006598642,0.0004487097,0.0001936981],"domain_scores_gemma":[0.9986029,0.000464203,0.0003313574,0.0002423905,0.0002817322,0.00007743642],"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.00157822,0.0007987061,0.008547292,0.000232536,0.001322321,0.0001111854,0.002045975,0.008765461,0.09566692,0.8551467,0.02445343,0.001331252],"study_design_scores_gemma":[0.009510515,0.00341325,0.007843501,0.001588188,0.0005815232,0.0008365954,0.001357088,0.001369938,0.2005703,0.7217199,0.05004721,0.001161945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9769697,0.000191975,0.004854083,0.0001074965,0.005483313,0.0001751123,0.000003730518,0.00002295293,0.01219171],"genre_scores_gemma":[0.9993411,0.00005248818,0.0001125038,0.00001852925,0.0003411365,0.00000293327,3.246123e-7,0.00002808184,0.0001028571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1334268,"threshold_uncertainty_score":0.4483085,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375657,0.0001799547,0.0003511321,0.0001597524,0.00029926,0.0003166631,0.0008663853,0.00009372408,0.00001097789],"category_scores_gemma":[0.0001579582,0.000119772,0.0002022011,0.0004120367,0.0001695114,0.0006840865,0.0001474765,0.0004498067,0.000008983217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003949825,"about_ca_system_score_gemma":0.0001900882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000237712,"about_ca_topic_score_gemma":0.000001120093,"domain_scores_codex":[0.9977306,0.0007298226,0.000518195,0.000181632,0.0005624888,0.0002772422],"domain_scores_gemma":[0.9976153,0.001239025,0.0003944802,0.0003117489,0.0002677273,0.0001717237],"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.0003158524,0.000153764,0.0001497721,0.00000562991,0.0001022996,0.00003078803,0.0007170117,0.00002356158,0.0003566183,0.990679,0.001193381,0.006272359],"study_design_scores_gemma":[0.01286911,0.001446463,0.001201507,0.00009519163,0.0002627271,0.001431525,0.0001149208,0.003905608,0.002839849,0.9154961,0.05978349,0.0005534894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2844383,0.003996917,0.6870987,0.009019913,0.009593821,0.0006540023,0.000004242671,0.0002610024,0.004933092],"genre_scores_gemma":[0.967986,0.0001278479,0.03045686,0.0003828343,0.001007032,0.000003112112,1.92688e-7,0.00001058672,0.00002557457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6835476,"threshold_uncertainty_score":0.4884162,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006717132,0.000276864,0.0005520035,0.0001544058,0.0001084542,0.00008017529,0.0003930277,0.0001380339,0.00005497409],"category_scores_gemma":[0.00007916231,0.0002230946,0.0001740767,0.0004450807,0.00005681155,0.0002543439,0.00001577884,0.0004178571,0.00002458717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009586591,"about_ca_system_score_gemma":0.00007056892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003573396,"about_ca_topic_score_gemma":0.000001736492,"domain_scores_codex":[0.9981885,0.0001822792,0.0006367757,0.0001291328,0.0004751607,0.0003881852],"domain_scores_gemma":[0.9986511,0.0003658332,0.0002486914,0.0002548031,0.0002350847,0.0002444189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.008403277,0.001821856,0.02550212,0.0006993951,0.004497682,0.005643839,0.004097284,0.12833,0.6473259,0.1244044,0.04675914,0.002515199],"study_design_scores_gemma":[0.08204979,0.02440934,0.03229078,0.004441258,0.002357978,0.02875277,0.002377601,0.01048685,0.1697385,0.3440657,0.2905155,0.008514006],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9813368,0.0004323879,0.005571832,0.00007049807,0.006340614,0.0002853599,0.00000365205,0.0001656135,0.005793241],"genre_scores_gemma":[0.9982175,0.00005859838,0.0005818285,0.00002881454,0.0009500338,0.000006045294,4.149574e-7,0.0000560267,0.0001007016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4775873,"threshold_uncertainty_score":0.9097534,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034201,0.0001138383,0.0003361917,0.0001963849,0.00007530121,0.00002350659,0.0002244767,0.00006602534,0.00002592911],"category_scores_gemma":[0.00001447244,0.0001084604,0.0002074887,0.0002406191,0.00004947203,0.0001306981,0.0000106839,0.0002070728,0.000004874904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003055729,"about_ca_system_score_gemma":0.00001780363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001165752,"about_ca_topic_score_gemma":0.000001305579,"domain_scores_codex":[0.9987922,0.0001252159,0.0006595553,0.00004431796,0.0002204347,0.0001582941],"domain_scores_gemma":[0.9992045,0.0002012832,0.0002419337,0.0001320306,0.000162041,0.00005818118],"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.00009053677,0.0002410946,0.002058423,0.0001274812,0.0002122107,0.00003817638,0.0002264346,0.009364773,0.292083,0.6888101,0.006579562,0.0001682712],"study_design_scores_gemma":[0.004369139,0.000792564,0.007222665,0.0005141558,0.0002159017,0.0003733543,0.0002322018,0.001721095,0.07588188,0.9017904,0.006367444,0.0005191785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9695504,0.0007343634,0.01324346,0.00002265814,0.006047114,0.0001249852,0.00001301323,0.0000620983,0.01020194],"genre_scores_gemma":[0.9991072,0.000008923345,0.0005982004,0.000003909709,0.0002526977,0.000001188106,0.000002030684,0.00001826412,0.000007582395],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2162011,"threshold_uncertainty_score":0.4422886,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003663336,0.0001736124,0.0003279502,0.0001240944,0.00006345344,0.00007496212,0.00015847,0.00009779914,0.00001912799],"category_scores_gemma":[0.00002979249,0.0001349989,0.00008866138,0.0001601524,0.00006439502,0.0002342949,0.0000130962,0.000273397,0.000005918307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005243042,"about_ca_system_score_gemma":0.00006502637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003543583,"about_ca_topic_score_gemma":9.67677e-7,"domain_scores_codex":[0.9989927,0.0000569916,0.0003654395,0.00008671673,0.0002897705,0.0002083754],"domain_scores_gemma":[0.9993897,0.00006835564,0.0001319271,0.0001252795,0.0001314357,0.0001532742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.003104473,0.001123931,0.003127877,0.0004252775,0.002469892,0.001432797,0.007506743,0.02774266,0.4304539,0.5179744,0.003893372,0.0007447015],"study_design_scores_gemma":[0.04698914,0.01480875,0.007775943,0.0026494,0.001054812,0.00808016,0.002149881,0.0003437803,0.5215361,0.3700748,0.02153946,0.002997725],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9885261,0.0005973523,0.004643242,0.00005033198,0.004611769,0.000121315,0.000001504915,0.00005741867,0.001390966],"genre_scores_gemma":[0.9992168,0.00002506216,0.0002664508,0.000007993895,0.0004285043,0.000001793823,2.287594e-7,0.00003110852,0.00002207909],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1478996,"threshold_uncertainty_score":0.5505096,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001057337,0.0001997698,0.0004033551,0.0002397374,0.0001025252,0.00008579407,0.0003795394,0.0001645529,0.000117328],"category_scores_gemma":[0.00007465281,0.0001779777,0.0002155018,0.0003861424,0.00004005193,0.0004234568,0.00001451836,0.0004001258,0.00005977558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001095937,"about_ca_system_score_gemma":0.00006387539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003139809,"about_ca_topic_score_gemma":9.467485e-7,"domain_scores_codex":[0.9983656,0.000146734,0.0006536237,0.00009108605,0.0003900416,0.0003528662],"domain_scores_gemma":[0.9990167,0.0001662623,0.0001867631,0.0002259286,0.0001903092,0.0002140052],"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.001800774,0.0007337016,0.00445262,0.0002838581,0.001159444,0.001791359,0.001821974,0.02903701,0.1741743,0.6460906,0.1332947,0.005359676],"study_design_scores_gemma":[0.008792563,0.002788389,0.00131118,0.0005290756,0.0002987925,0.002176754,0.0006828103,0.004253917,0.0407233,0.4103703,0.5267308,0.001342144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8248655,0.002532705,0.05696802,0.0001586049,0.03307721,0.0004839293,0.000005917075,0.0003740755,0.08153407],"genre_scores_gemma":[0.9981413,0.0001538944,0.0003461641,0.00002405458,0.001019819,0.000003575037,7.238028e-7,0.00004269751,0.0002677597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3934361,"threshold_uncertainty_score":0.7257721,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002494706,0.0001605177,0.0003512783,0.0001075402,0.0001501176,0.00005212679,0.0004602576,0.0001001549,0.00001784479],"category_scores_gemma":[0.0001549327,0.0001122785,0.0001985341,0.0002956448,0.00008494653,0.0004105889,0.0000246318,0.000287211,0.00001302805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006294449,"about_ca_system_score_gemma":0.0000335372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003276631,"about_ca_topic_score_gemma":4.681419e-7,"domain_scores_codex":[0.9981686,0.0002677667,0.0006819222,0.00006020169,0.000425726,0.000395719],"domain_scores_gemma":[0.9985007,0.0006145702,0.0002941775,0.0002615423,0.0001532703,0.0001757621],"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.0003702239,0.0003661285,0.004727662,0.000224315,0.0004759079,0.00001871775,0.001441952,0.001574777,0.08377573,0.8977467,0.007844476,0.001433435],"study_design_scores_gemma":[0.01008048,0.005155457,0.01757248,0.001705376,0.0008598655,0.0008126507,0.002764708,0.00229384,0.2297019,0.6246511,0.1024024,0.001999853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8770385,0.01626889,0.04231415,0.0000640665,0.04584849,0.0006213169,0.000006346389,0.0001433008,0.01769498],"genre_scores_gemma":[0.9987413,0.0001331224,0.0003300774,0.000005028192,0.0006916767,0.000004579727,2.67353e-7,0.00002842568,0.00006547711],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2730956,"threshold_uncertainty_score":0.4578585,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000547585,0.0001331914,0.0004024714,0.0001414659,0.00005770342,0.00001405765,0.0002774085,0.00008864898,0.00002033339],"category_scores_gemma":[0.00007381821,0.00009837105,0.0002804503,0.0002555136,0.00007605731,0.000135157,0.00001189175,0.0002164535,0.000001240336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005740598,"about_ca_system_score_gemma":0.00005790349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006839552,"about_ca_topic_score_gemma":0.000001458762,"domain_scores_codex":[0.998462,0.0003289291,0.0006716603,0.00005809146,0.000338586,0.0001407204],"domain_scores_gemma":[0.9989871,0.0002132595,0.0003805209,0.0001779258,0.0001730414,0.00006811028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002810848,0.0002002655,0.001287928,0.0003087167,0.0004465394,0.000009148271,0.002293754,0.007653522,0.5047317,0.4820111,0.0004451677,0.0003310612],"study_design_scores_gemma":[0.005785862,0.001145293,0.00459479,0.0006854981,0.000221637,0.0001475353,0.0005953728,0.0006655325,0.4895265,0.4944327,0.001755284,0.00044393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9828283,0.0004560752,0.0102489,0.00000968334,0.005657569,0.0001432968,0.000008048747,0.00001462298,0.0006334595],"genre_scores_gemma":[0.9995914,0.00002119931,0.0002499242,0.000003848325,0.0001113907,0.000001448998,3.620626e-7,0.00001775574,0.000002672136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01676305,"threshold_uncertainty_score":0.4011455,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002520628,0.0001644265,0.0003621064,0.0001223567,0.00003152544,0.00001716172,0.0002241212,0.0001503544,0.000006760745],"category_scores_gemma":[0.0004684566,0.0001524861,0.0001156191,0.0002272389,0.00006155398,0.0001747131,0.00001589813,0.0004085269,0.000005889332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001050584,"about_ca_system_score_gemma":0.0000233346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.587935e-7,"about_ca_topic_score_gemma":9.702021e-8,"domain_scores_codex":[0.998844,0.00003998058,0.0004793758,0.00008241583,0.0003081294,0.0002461215],"domain_scores_gemma":[0.9991496,0.000337151,0.0001689241,0.0001697056,0.00009381925,0.00008080023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001280106,0.000201539,0.00009956641,0.00006124637,0.0001584151,0.00004693038,0.00004296712,0.08578689,0.6857397,0.211858,0.007186316,0.008690407],"study_design_scores_gemma":[0.0010511,0.0005859482,0.00004705741,0.0001252593,0.00002891657,0.0000195141,0.00002774619,0.0004100942,0.8067152,0.1891547,0.001629769,0.0002046872],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9287458,0.0009079165,0.06398567,0.00002051385,0.003670874,0.0001089885,0.000003150701,0.0001370199,0.002420074],"genre_scores_gemma":[0.9955644,0.0003173262,0.003974897,0.000008487579,0.00009554897,0.000001691901,2.697839e-7,0.00003478892,0.000002562263],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1209755,"threshold_uncertainty_score":0.6218202,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005938238,0.00007123595,0.0002327129,0.00007483229,0.00002560441,0.000006454641,0.0002503271,0.00004727305,0.00001899065],"category_scores_gemma":[0.0001293464,0.00004033543,0.00009370115,0.0001811475,0.00004333069,0.00008728109,0.00001437289,0.00007836051,0.000008394976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002523816,"about_ca_system_score_gemma":0.00002522077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003308126,"about_ca_topic_score_gemma":6.623378e-7,"domain_scores_codex":[0.9991316,0.0001011881,0.0003984806,0.00003987489,0.0002211377,0.0001077859],"domain_scores_gemma":[0.9992009,0.0001998157,0.0001792505,0.0001496957,0.0002172203,0.00005305935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004330802,0.0000913742,0.0004449111,0.0001027276,0.0001949649,0.00000594121,0.0009455176,0.001582031,0.8131821,0.1748648,0.004177365,0.003975251],"study_design_scores_gemma":[0.007913779,0.007312307,0.01006604,0.003396069,0.0003637027,0.0002143683,0.0008602902,0.002254488,0.3730297,0.5137531,0.07988873,0.0009473466],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9447233,0.0006108219,0.04173505,0.000266957,0.01041276,0.0002183317,0.00001391734,0.00002449185,0.001994381],"genre_scores_gemma":[0.9995233,0.00002161875,0.0002046474,0.000006135424,0.0002096628,0.000001006027,7.914775e-8,0.000009262243,0.00002431772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4401523,"threshold_uncertainty_score":0.1644831,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007493803,0.0001656255,0.0003906237,0.0001973066,0.00006758219,0.00009530212,0.0002412897,0.0001123775,0.00001543337],"category_scores_gemma":[0.00007245613,0.0001409799,0.0001562844,0.0002243125,0.00001401658,0.0001917587,0.000004317964,0.0003169134,0.0000178383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001069171,"about_ca_system_score_gemma":0.00002628951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001804519,"about_ca_topic_score_gemma":1.13151e-7,"domain_scores_codex":[0.9986653,0.0001276556,0.0005535368,0.0000766505,0.0003522259,0.0002245691],"domain_scores_gemma":[0.99926,0.0001405579,0.0001713069,0.000162387,0.0001209449,0.0001448161],"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.000572618,0.0002664402,0.00007197485,0.00009413528,0.0002051472,0.0002297743,0.0003717527,0.03429664,0.04502644,0.8892978,0.02872194,0.0008452894],"study_design_scores_gemma":[0.03638573,0.02630296,0.002679674,0.004197551,0.000704832,0.001707669,0.001443738,0.02101858,0.1084846,0.5859725,0.2073111,0.003791055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9230425,0.001459079,0.004796948,0.00006103361,0.04994792,0.0003664023,0.000004267051,0.0001850451,0.02013681],"genre_scores_gemma":[0.9985854,0.00002061566,0.00002340276,0.00001780664,0.001171891,0.000002366532,4.304773e-7,0.00002081238,0.000157282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3033254,"threshold_uncertainty_score":0.5748994,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656452,0.0001871217,0.0003395926,0.0002050799,0.00009011818,0.00006415162,0.0002415139,0.0001206408,0.00007482542],"category_scores_gemma":[0.00001961029,0.0001752565,0.0002166137,0.0002543048,0.00004771953,0.0002589186,0.0000106222,0.0002867087,0.00003508004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007665556,"about_ca_system_score_gemma":0.00006761402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003283491,"about_ca_topic_score_gemma":7.256191e-7,"domain_scores_codex":[0.9983654,0.000148007,0.0006867445,0.00008969294,0.0004634457,0.0002467012],"domain_scores_gemma":[0.9991301,0.0002232941,0.0001999784,0.0001071272,0.0002209458,0.0001185115],"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.0002126198,0.0003035555,0.00167646,0.00007814692,0.0002815303,0.0002121277,0.000160882,0.1974104,0.02625277,0.7544267,0.01797471,0.00100999],"study_design_scores_gemma":[0.002959513,0.0004782214,0.004998376,0.00009436369,0.00009752835,0.0005730481,0.000035143,0.007153314,0.005362664,0.9709518,0.006829475,0.0004665846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5438485,0.0008756168,0.4343629,0.00005145764,0.01371399,0.0002347281,0.000009332432,0.0001726794,0.006730711],"genre_scores_gemma":[0.9970769,0.000004455111,0.001528127,0.00001529465,0.001297861,0.000002952452,0.000004980452,0.00003424504,0.00003513732],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4532284,"threshold_uncertainty_score":0.7146753,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003052963,0.0001557383,0.0003793483,0.0001669502,0.0001459815,0.0003153211,0.0005270939,0.0001295227,0.000003897033],"category_scores_gemma":[0.000135197,0.0001185855,0.0001408301,0.0002032734,0.00004432472,0.000744213,0.00007934553,0.0003448137,0.00001106018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008898596,"about_ca_system_score_gemma":0.0001089376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001669453,"about_ca_topic_score_gemma":7.84003e-8,"domain_scores_codex":[0.998088,0.0004386546,0.0005971012,0.000185943,0.0004262322,0.0002640955],"domain_scores_gemma":[0.9985611,0.000492355,0.0003074624,0.0001975296,0.0002560302,0.0001854546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002414286,0.0002381001,0.00003940987,0.00001707136,0.000128469,0.00003978295,0.001917049,0.008659678,0.001051412,0.9651892,0.003817196,0.0186612],"study_design_scores_gemma":[0.009338463,0.003795871,0.00027121,0.000415059,0.0001472736,0.003551817,0.0008306757,0.6731787,0.006578697,0.2875768,0.01322976,0.001085672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004764194,0.0003482346,0.9894517,0.0001978694,0.003051506,0.0001547442,1.437709e-7,0.00002739798,0.002004201],"genre_scores_gemma":[0.9404716,0.00001736456,0.05787241,0.0001105702,0.001424492,0.000004286153,8.097989e-8,0.00001057846,0.00008856506],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9357074,"threshold_uncertainty_score":0.4835775,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626786,0.0002321095,0.0007931222,0.0003160317,0.00008566499,0.0001053408,0.0004634633,0.000201761,0.000009366079],"category_scores_gemma":[0.00007067763,0.0002079929,0.0002049148,0.0004317998,0.00003263836,0.0004612094,0.000008854192,0.0003083835,0.000008053564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054614,"about_ca_system_score_gemma":0.00007110024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005235136,"about_ca_topic_score_gemma":0.000001212024,"domain_scores_codex":[0.9974852,0.000367773,0.001172496,0.0001268972,0.0005169412,0.0003307323],"domain_scores_gemma":[0.9984718,0.0001126273,0.0004818877,0.0003519909,0.0003383766,0.0002433397],"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.0009175934,0.000921207,0.0004953491,0.0008249652,0.000745149,0.0003556913,0.001485514,0.2217078,0.1526845,0.5980688,0.02122753,0.0005659185],"study_design_scores_gemma":[0.05726289,0.04590004,0.008622151,0.01208932,0.002858242,0.006383488,0.01627208,0.2698344,0.1597162,0.290608,0.1225891,0.007864068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9194929,0.01038071,0.01404544,0.00003433695,0.04547369,0.0008946913,0.00004208893,0.0002314448,0.00940471],"genre_scores_gemma":[0.9988648,0.00005233632,0.0000573035,0.000005210464,0.0009115412,0.000003584436,0.000003123711,0.00003236164,0.00006979439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3074608,"threshold_uncertainty_score":0.8481705,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001420845,0.0001111909,0.0002899487,0.00009402491,0.0001137843,0.00003703659,0.0001794345,0.0001036064,0.00007131574],"category_scores_gemma":[0.0003891769,0.00007810372,0.0001517485,0.00009323531,0.00004134002,0.0003159324,0.00002813931,0.0002199396,0.000007473653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005524801,"about_ca_system_score_gemma":0.00002932397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001314595,"about_ca_topic_score_gemma":2.909086e-8,"domain_scores_codex":[0.9986126,0.0002295926,0.000482227,0.00004909088,0.0003942407,0.0002321769],"domain_scores_gemma":[0.998695,0.0003575218,0.0004382812,0.0001575908,0.0001946183,0.0001570431],"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.00007462926,0.0001347699,0.001565839,0.00003140342,0.00006930411,0.000006375461,0.0005715694,0.000003903849,0.0007761277,0.9869388,0.009728015,0.00009930615],"study_design_scores_gemma":[0.0009955118,0.0002339733,0.0007950582,0.00007062711,0.000121074,0.0001993264,0.0001526311,0.00001232057,0.002365132,0.9815513,0.01335653,0.0001465285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9423476,0.001163113,0.00771125,0.00005825778,0.04090165,0.0002059406,0.000002787604,0.00003345842,0.007575913],"genre_scores_gemma":[0.9954706,0.0000209336,0.0008705129,0.00001879305,0.003487063,0.000001570733,2.339389e-7,0.00001831192,0.0001119201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05312303,"threshold_uncertainty_score":0.3184977,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007179506,0.0001816463,0.0003796472,0.0001481246,0.00006309271,0.00004847845,0.0001995257,0.0001268159,0.0000524446],"category_scores_gemma":[0.00004787776,0.0001678799,0.0001235403,0.0001363557,0.00004457575,0.0003288465,0.00002088815,0.0002542679,0.000006502455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004985608,"about_ca_system_score_gemma":0.0000328033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009651981,"about_ca_topic_score_gemma":5.321363e-7,"domain_scores_codex":[0.9988553,0.0001233802,0.0005023949,0.00009074842,0.0001990018,0.0002291914],"domain_scores_gemma":[0.999336,0.00008623926,0.0001652644,0.0001347378,0.0001001023,0.0001776542],"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.001226932,0.0002459359,0.003924211,0.0003688878,0.0008421619,0.0004609811,0.005989647,0.001272747,0.2670222,0.7129447,0.003964663,0.001736971],"study_design_scores_gemma":[0.01310413,0.003129645,0.006555588,0.0007029507,0.0004463713,0.001713165,0.0005742802,0.002174372,0.3734201,0.572625,0.0237329,0.001821534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9693301,0.000737266,0.0205449,0.000006027525,0.005772912,0.0001406278,0.000002183852,0.00007898925,0.003386962],"genre_scores_gemma":[0.9980577,0.0001817004,0.001327652,0.00001859033,0.0003486562,0.000003730739,2.6699e-7,0.00003682379,0.00002487472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1403197,"threshold_uncertainty_score":0.6845945,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005794861,0.0001249827,0.000434678,0.0002040538,0.00005046309,0.00001047,0.0001221623,0.000126907,0.00004046786],"category_scores_gemma":[0.00007529706,0.0001100258,0.0001081561,0.0003088825,0.00006167588,0.000214226,0.000008679581,0.0001541143,0.000001188035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003011377,"about_ca_system_score_gemma":0.00005402359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009472677,"about_ca_topic_score_gemma":4.589324e-7,"domain_scores_codex":[0.998607,0.0001893855,0.0007524806,0.00006292994,0.0002683693,0.0001198647],"domain_scores_gemma":[0.9990174,0.0001370956,0.0003822873,0.0001068189,0.0002840596,0.00007236064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001239165,0.0004236314,0.005937399,0.0005374392,0.001342202,0.0001348553,0.004302181,0.01531425,0.8134766,0.1487879,0.00736482,0.00113958],"study_design_scores_gemma":[0.02258167,0.004375708,0.007293722,0.0009600771,0.0008520355,0.002056772,0.0005810135,0.005784333,0.7250381,0.2245347,0.004658837,0.001283073],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9875044,0.002043952,0.006873678,0.00001212455,0.002641129,0.0001282546,0.000002237477,0.00002065406,0.0007735345],"genre_scores_gemma":[0.9987165,0.0004475209,0.0006494796,0.000002337197,0.0001229886,0.000001475097,0.000001031101,0.00001907771,0.00003954472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08843849,"threshold_uncertainty_score":0.4486721,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060275,0.000181011,0.0003812402,0.00008452708,0.0001361618,0.00006225635,0.0004117262,0.00008991337,0.00002833859],"category_scores_gemma":[0.0001009125,0.0001150943,0.0001628737,0.0003563176,0.00007752317,0.0001678569,0.00001279143,0.0003131932,0.000006634883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000560086,"about_ca_system_score_gemma":0.00007478873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005836871,"about_ca_topic_score_gemma":0.000004464623,"domain_scores_codex":[0.9984264,0.0001691748,0.0005790871,0.00007739308,0.0004283626,0.0003196094],"domain_scores_gemma":[0.9985102,0.0006628198,0.0002855809,0.0002496039,0.000162896,0.0001289193],"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.01002828,0.001232026,0.01612696,0.0005182252,0.004650582,0.002034865,0.003003259,0.09997235,0.2449685,0.57305,0.04209808,0.002316833],"study_design_scores_gemma":[0.02074808,0.01174376,0.007659604,0.001438009,0.0009808718,0.00573532,0.001799592,0.003391998,0.2413106,0.5767604,0.1263856,0.002046105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9712983,0.001450069,0.009129424,0.0002113259,0.008198087,0.0003785261,0.000002755784,0.00008515084,0.009246373],"genre_scores_gemma":[0.9988691,0.0001562598,0.0001919366,0.000006455138,0.0005412485,0.000003409435,8.514506e-8,0.00003491467,0.0001966081],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09658036,"threshold_uncertainty_score":0.4693409,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006139497,0.00009458613,0.000397676,0.0001095625,0.00001836387,0.00001184379,0.0001293321,0.0001223389,0.00001221394],"category_scores_gemma":[0.0003553647,0.00008688528,0.00008162016,0.0004118605,0.00002546294,0.0001757064,0.00001101811,0.0001490761,7.876579e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003418973,"about_ca_system_score_gemma":0.00006010319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003179037,"about_ca_topic_score_gemma":2.47693e-7,"domain_scores_codex":[0.9987328,0.0001049867,0.0006783428,0.00005869956,0.0003339102,0.00009123186],"domain_scores_gemma":[0.9983377,0.0002189461,0.0007494735,0.00007517508,0.0005618147,0.00005689469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004417203,0.0002265304,0.02581742,0.001300153,0.0008192622,0.000003700994,0.00208206,0.0008188426,0.8532908,0.1093282,0.005008358,0.0008629144],"study_design_scores_gemma":[0.01533012,0.004292718,0.06394576,0.00137036,0.001363882,0.00003321795,0.002435149,0.0115837,0.7863447,0.09390512,0.01826954,0.001125742],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9919976,0.0008924726,0.004773132,0.000112575,0.001504581,0.0001200777,0.000007011256,0.00001426038,0.0005783136],"genre_scores_gemma":[0.999061,0.0001308866,0.0006095831,0.000004168339,0.0001690282,0.000001096908,9.610504e-7,0.0000126472,0.00001059914],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0669461,"threshold_uncertainty_score":0.3543079,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002668023,0.0001025761,0.0002686524,0.0001350482,0.00003993862,0.00002201848,0.00009199255,0.00007691746,9.350505e-7],"category_scores_gemma":[0.00007875065,0.00009126794,0.0000741714,0.00009328095,0.00007741396,0.0002249701,0.000005974074,0.000101322,3.272261e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003791499,"about_ca_system_score_gemma":0.00005756684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001328069,"about_ca_topic_score_gemma":0.00000109835,"domain_scores_codex":[0.9992808,0.0000362735,0.0003732173,0.00005878002,0.0001460802,0.0001049274],"domain_scores_gemma":[0.9994718,0.0001056496,0.000164003,0.00007128093,0.0001152867,0.00007194485],"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.0001537364,0.00002825113,0.0003449424,0.0001713203,0.00005865027,0.000002313989,0.000630819,0.0007479993,0.04618615,0.9480353,0.00003484271,0.003605656],"study_design_scores_gemma":[0.002187322,0.0006292507,0.001727474,0.0003161184,0.00005287849,0.00007859746,0.0005289856,0.00009622167,0.04808722,0.9459671,0.0001964229,0.0001324097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9541522,0.0008477768,0.04044946,0.00002391582,0.004270452,0.0001320184,0.00000348904,0.00002538215,0.00009536544],"genre_scores_gemma":[0.996035,0.0003624603,0.003256339,0.000003180213,0.0003214387,0.000002304342,4.503911e-7,0.0000103777,0.000008384013],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04188292,"threshold_uncertainty_score":0.3721798,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007285718,0.000141571,0.0003699201,0.0001496335,0.00004629238,0.00005339937,0.0002576651,0.0001101924,0.0000373651],"category_scores_gemma":[0.00008483352,0.00009154186,0.0001539674,0.0001524349,0.00002690284,0.0002593503,0.000008732488,0.000130815,0.00004563516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000862919,"about_ca_system_score_gemma":0.00002903817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000124803,"about_ca_topic_score_gemma":2.135013e-7,"domain_scores_codex":[0.9987541,0.0001555174,0.0005321821,0.00006822766,0.0002775418,0.0002124024],"domain_scores_gemma":[0.9991469,0.000136096,0.0002399647,0.0001694621,0.0001529657,0.0001546066],"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.0007570711,0.0003194146,0.003489919,0.0004568881,0.001042184,0.0005425625,0.0006904584,0.001757453,0.3500452,0.5218002,0.1151702,0.003928449],"study_design_scores_gemma":[0.03223616,0.003452846,0.006491261,0.00549903,0.0004918835,0.002066896,0.001695296,0.0009697729,0.1042679,0.2382981,0.6018344,0.002696513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8007712,0.003920364,0.04447251,0.0002093922,0.1407192,0.0005378714,0.00002632962,0.0003300097,0.009013074],"genre_scores_gemma":[0.9983027,0.00005118501,0.00002303734,0.000004277273,0.001380581,0.00000398727,1.26819e-7,0.00002944125,0.0002046829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4866641,"threshold_uncertainty_score":0.3732969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}