{"meta":{"query_hash":"fec8933506cf","filters":{"venue":"Journal of Combinatorial Designs"},"cohort_total":162,"direct_labels_cover":0,"predictions_cover":162,"exported":162,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/fec8933506cf","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorial+Designs"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11759817211194565,"score_gpt":0.3310637144322862,"score_spread":0.21346554232034057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502829000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27852213,0.0011457327,0.60653853,0.0016158193,0.0005614849,0.00017480744,0.00039977097,0.00032910926,0.11071262],"genre_scores_gemma":[0.88964033,0.00071115,0.09026986,0.00045496415,0.00030762813,0.00017993363,0.00024595045,0.00006684718,0.01812339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690527,0.0011008892,0.00020133964,0.0004799564,0.0009571087,0.0003554227],"domain_scores_gemma":[0.99359137,0.0018027758,0.0012644256,0.0013667673,0.0014661943,0.0005084247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025328468,0.00061393104,0.00046750205,0.0015572973,0.001186784,0.0025829058,0.00063909125,0.00090868626,0.007016329],"category_scores_gemma":[0.0070687975,0.00032721253,0.0006406069,0.001282482,0.0045014536,0.001997975,0.0027643077,0.0015625175,0.0014175038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022517792,0.000005557308,0.00014550821,0.000015307023,0.0000036087647,0.000020449157,0.000072217226,0.0017630899,0.0005842818,0.9916045,0.0003990432,0.005364009],"study_design_scores_gemma":[0.000029349452,0.00009131414,0.0002849329,0.00003594784,0.000009610177,0.00022183529,0.00012607602,0.015520339,0.0020384695,0.96383435,0.017773325,0.00003434422],"about_ca_topic_score_codex":0.00074255845,"about_ca_topic_score_gemma":0.00049848005,"teacher_disagreement_score":0.007016329,"about_ca_system_score_codex":0.001166649,"about_ca_system_score_gemma":0.0008283155,"threshold_uncertainty_score":0.023471951},"labels":[],"label_agreement":null},{"id":"W1514353915","doi":"10.1002/jcd.21427","title":"Equitably Colored Balanced Incomplete Block Designs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders; Canada Foundation for Innovation","keywords":"Mathematics; Colored; Integer (computer science); Combinatorics; Block (permutation group theory); Block design; Discrete mathematics; Computer science; Law","score_opus":0.04942652340474804,"score_gpt":0.24936105834956793,"score_spread":0.19993453494481989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514353915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2516869,0.00018008838,0.70267385,0.00019386943,0.00008513054,0.00017678343,0.00031420105,0.00036705632,0.04432214],"genre_scores_gemma":[0.8460955,0.00013068787,0.14662501,0.00012254482,0.000022517132,0.00022523844,0.00024004692,0.000063898675,0.0064745992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988048,0.000382077,0.00008763107,0.00018062159,0.00031768353,0.00022716552],"domain_scores_gemma":[0.99813867,0.00048851356,0.0002819916,0.0004351614,0.0005204784,0.00013516795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011554952,0.00051465974,0.0005211314,0.0005599289,0.0006336026,0.0010897014,0.000686788,0.00046739375,0.006527408],"category_scores_gemma":[0.0028487486,0.00034227435,0.00027141455,0.0004605519,0.00069512153,0.0012683687,0.00091136893,0.0005618379,0.00075570977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001077524,0.00020497199,0.00324617,0.0003556786,0.000095516196,0.00035095194,0.00027496275,0.13461782,0.117187254,0.6612008,0.0030054818,0.07838282],"study_design_scores_gemma":[0.00038392984,0.00082452846,0.0015433017,0.00013160455,0.00010596922,0.00061625574,0.00023853857,0.55280316,0.15185885,0.25383595,0.037582934,0.000074977215],"about_ca_topic_score_codex":0.0005642922,"about_ca_topic_score_gemma":0.0012650458,"teacher_disagreement_score":0.006527408,"about_ca_system_score_codex":0.00077976874,"about_ca_system_score_gemma":0.00078638416,"threshold_uncertainty_score":0.02183628},"labels":[],"label_agreement":null},{"id":"W1522959676","doi":"10.1002/jcd.21377","title":"Three‐Phase Barker Arrays","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Aperiodic graph; Phase (matter); Algebraic number; Function (biology); Combinatorics; Existential quantification; Matrix (chemical analysis); Generating function; Discrete mathematics; Arithmetic; Mathematical analysis; Quantum mechanics","score_opus":0.016589660886695418,"score_gpt":0.22608809282131725,"score_spread":0.20949843193462184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522959676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2517016,0.00054664374,0.6728334,0.00066237315,0.00038918163,0.00009105752,0.00030908678,0.0010696902,0.07239697],"genre_scores_gemma":[0.88344187,0.00037889736,0.102216616,0.00046285856,0.00014978029,0.00011538701,0.00019556767,0.00006641493,0.012972626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996099,0.00007680429,0.000023603492,0.00006219208,0.0001359023,0.00009167057],"domain_scores_gemma":[0.99834573,0.0005891079,0.00027999052,0.00030422758,0.0003638307,0.0001170218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003489647,0.0004100048,0.000380039,0.0005760053,0.00049010466,0.00094061,0.00039900307,0.0006529528,0.008572653],"category_scores_gemma":[0.0020916297,0.000247235,0.00026052428,0.00046288586,0.0006798876,0.0012821944,0.00081977155,0.00070447044,0.0019061265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004996064,0.00008572046,0.0010528513,0.00013966103,0.000026478157,0.00041717672,0.00028836614,0.030229831,0.1477708,0.7381481,0.0044884165,0.07685296],"study_design_scores_gemma":[0.00012176097,0.00045824365,0.001128829,0.00006678571,0.00003433846,0.0011636899,0.00022042364,0.24773028,0.13861288,0.5638228,0.046492692,0.00014723695],"about_ca_topic_score_codex":0.00020679065,"about_ca_topic_score_gemma":0.00025980867,"teacher_disagreement_score":0.008572653,"about_ca_system_score_codex":0.0002744675,"about_ca_system_score_gemma":0.00028257398,"threshold_uncertainty_score":0.028678417},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Order (exchange); Decomposition; Discrete mathematics","score_opus":0.017931818266640507,"score_gpt":0.22816228992088358,"score_spread":0.21023047165424308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541637185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47732532,0.002832816,0.42193845,0.0010490286,0.0002688102,0.0005093674,0.002342536,0.00049081293,0.09324285],"genre_scores_gemma":[0.89817655,0.0015738378,0.08224562,0.00043540905,0.00015113404,0.0003949416,0.0030731931,0.0001633709,0.013785895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990953,0.00012859257,0.00005254889,0.00021332533,0.00024977772,0.0002604612],"domain_scores_gemma":[0.9979247,0.0006538413,0.00035660586,0.00028028912,0.00048610356,0.00029847806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006471657,0.0006683714,0.0006295303,0.0018164478,0.0009229124,0.0021718193,0.00060869433,0.00084724394,0.007126549],"category_scores_gemma":[0.00306374,0.00061777537,0.00091208564,0.0012288223,0.0016180088,0.0021946097,0.0012138538,0.00133981,0.0007654914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035948542,0.000091766255,0.0020395906,0.00032555472,0.000055081047,0.00061630463,0.0005007309,0.019308237,0.021602103,0.9117623,0.0068303463,0.036508523],"study_design_scores_gemma":[0.00012232739,0.000117775584,0.0015264647,0.00022603435,0.000052156345,0.00078263367,0.00052188314,0.04479635,0.013709624,0.9149693,0.02312278,0.000052628362],"about_ca_topic_score_codex":0.0016383053,"about_ca_topic_score_gemma":0.0022768322,"teacher_disagreement_score":0.007126549,"about_ca_system_score_codex":0.00090488343,"about_ca_system_score_gemma":0.001038231,"threshold_uncertainty_score":0.023840666},"labels":[],"label_agreement":null},{"id":"W1565202964","doi":"10.1002/jcd.21393","title":"A Three‐Factor Product Construction for Mutually Orthogonal Latin Squares","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kronecker product; Mathematics; Transversal (combinatorics); Product (mathematics); Latin square; Orthogonal array; Combinatorics; Table (database); Resolution (logic); Square (algebra); Kronecker delta; Algebra over a field; Pure mathematics; Statistics; Computer science; Geometry; Mathematical analysis","score_opus":0.019663794156290007,"score_gpt":0.22177891748209777,"score_spread":0.20211512332580778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565202964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18404347,0.0004210291,0.7459676,0.00034096692,0.00031350146,0.00010925337,0.00018626443,0.00095734984,0.06766054],"genre_scores_gemma":[0.75841564,0.00030876626,0.22330914,0.00026614487,0.000106800326,0.0001237073,0.00021709198,0.0003377604,0.016914971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926525,0.00020374473,0.00004582191,0.00015335286,0.0001910155,0.00014070798],"domain_scores_gemma":[0.99922144,0.00019725441,0.00008308631,0.00025609278,0.00015346317,0.00008863744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755257,0.0003677769,0.00037567972,0.0006775306,0.00066479004,0.001081403,0.00046357978,0.00045601782,0.008857756],"category_scores_gemma":[0.0011277765,0.0003883644,0.00055775116,0.00054849545,0.0011388524,0.0011691971,0.0018089372,0.0010534824,0.0017354088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015678439,0.00005101727,0.0006242441,0.000099153884,0.000017629012,0.0002937785,0.00037062372,0.003312,0.03200968,0.8802932,0.003141971,0.07962991],"study_design_scores_gemma":[0.000106779735,0.0006449162,0.0009313454,0.00011553462,0.00006740746,0.0018040919,0.0004585482,0.04598907,0.11448855,0.73056746,0.10470158,0.000124732],"about_ca_topic_score_codex":0.00025944528,"about_ca_topic_score_gemma":0.00029245156,"teacher_disagreement_score":0.008857756,"about_ca_system_score_codex":0.00030382237,"about_ca_system_score_gemma":0.00027163772,"threshold_uncertainty_score":0.029632151},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Complete bipartite graph; Hamiltonian path; Graph; Discrete mathematics","score_opus":0.029608792030511425,"score_gpt":0.2273490084058673,"score_spread":0.19774021637535588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566220351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37103742,0.0013069874,0.5331441,0.0032626872,0.00018890407,0.00060151867,0.0015256925,0.00046195244,0.08847069],"genre_scores_gemma":[0.8266492,0.001198697,0.13968475,0.0007823418,0.00022482075,0.00036278192,0.0014832213,0.00019994046,0.029414237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988092,0.00038663007,0.0000440795,0.00022950086,0.00019485324,0.00033583186],"domain_scores_gemma":[0.99698704,0.0021694626,0.00020158461,0.00029038955,0.00018842958,0.00016313195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011121061,0.0006131618,0.000747433,0.00064625626,0.0013379661,0.0014431924,0.0009810046,0.0013532051,0.014555414],"category_scores_gemma":[0.0044662296,0.000492378,0.0008209645,0.0009540742,0.0016236935,0.0044818674,0.0013246887,0.0012563039,0.0009028673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183685,0.00026605822,0.0012043709,0.0003580195,0.000059591544,0.00042915548,0.00061878504,0.06314137,0.0051591913,0.8545773,0.020261312,0.053406276],"study_design_scores_gemma":[0.00015788835,0.00010178359,0.0003463574,0.0000641427,0.000026673404,0.00015272359,0.0003662375,0.14131957,0.002566856,0.8424328,0.012424443,0.000040399045],"about_ca_topic_score_codex":0.012124315,"about_ca_topic_score_gemma":0.01457494,"teacher_disagreement_score":0.014555414,"about_ca_system_score_codex":0.0018625215,"about_ca_system_score_gemma":0.0015883052,"threshold_uncertainty_score":0.048692763},"labels":[],"label_agreement":null},{"id":"W1599668014","doi":"10.1002/jcd.21319","title":"Trinal Decompositions of Steiner Triple Systems into Triangles","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Steiner system; Combinatorics; Vertex (graph theory); Order (exchange); Midpoint; Pairwise comparison; Intersection (aeronautics); Geometry; Graph","score_opus":0.018729803315847168,"score_gpt":0.23870246730773245,"score_spread":0.21997266399188528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599668014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46599084,0.0004364152,0.48329532,0.00036162583,0.0000941637,0.00015189101,0.00060116954,0.00027785066,0.04879071],"genre_scores_gemma":[0.9082979,0.0002469341,0.082312554,0.00011114537,0.000044970046,0.000116711286,0.00093202235,0.00007853798,0.007859328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990145,0.00024945068,0.00009216772,0.00016081924,0.00027626764,0.00020678136],"domain_scores_gemma":[0.9981225,0.0005488639,0.00036415283,0.00034617088,0.00038279858,0.0002355216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072376453,0.00029855987,0.00054995524,0.0012713876,0.0007568175,0.0011924113,0.00049629464,0.00043546344,0.008851487],"category_scores_gemma":[0.0023896545,0.00040064182,0.00047699446,0.00091583055,0.0010474714,0.0015380087,0.0017186766,0.00077390944,0.00074751023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000427913,0.00008913256,0.004043074,0.0002682302,0.000051649276,0.0006012161,0.001095099,0.060202226,0.017758602,0.8430763,0.0055072103,0.066879384],"study_design_scores_gemma":[0.0000629978,0.0001734072,0.001452643,0.00011493807,0.000037158214,0.0008506586,0.0013087521,0.21576537,0.008464574,0.74893993,0.02278697,0.00004256218],"about_ca_topic_score_codex":0.0007334401,"about_ca_topic_score_gemma":0.0010499171,"teacher_disagreement_score":0.008851487,"about_ca_system_score_codex":0.0007008637,"about_ca_system_score_gemma":0.0003512472,"threshold_uncertainty_score":0.02961123},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Graph; Decomposition; Factor (programming language); Order (exchange); Discrete mathematics; Computer science; Chemistry","score_opus":0.023096758306833373,"score_gpt":0.24517342109675486,"score_spread":0.2220766627899215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800155867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.742185,0.00052804674,0.22795317,0.00034969542,0.00009793113,0.0002863687,0.0011778518,0.00023694849,0.02718494],"genre_scores_gemma":[0.88657445,0.00042213805,0.09996545,0.00021287089,0.00006343334,0.00022373148,0.0015567404,0.00009438128,0.010886814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922156,0.00013434522,0.00004450311,0.00021441458,0.00014621373,0.00023901137],"domain_scores_gemma":[0.99736917,0.00079530576,0.0005724151,0.00038208129,0.00044244117,0.00043859213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049260055,0.0007165665,0.00059473695,0.0012201541,0.0007967265,0.0014734707,0.00042457585,0.0004953192,0.0060303374],"category_scores_gemma":[0.0022774497,0.0004936852,0.00067462114,0.00056005246,0.00090875546,0.0018615421,0.00084350066,0.00077444396,0.00076131994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022127794,0.0004878446,0.010411034,0.0009799168,0.0002457502,0.0022077416,0.0011976385,0.08350175,0.13261151,0.62229687,0.010717066,0.13313006],"study_design_scores_gemma":[0.00035546755,0.0009876477,0.00778336,0.00034109104,0.00030708165,0.002378461,0.0011750858,0.1653453,0.064179696,0.71422094,0.042782094,0.00014385312],"about_ca_topic_score_codex":0.0015219519,"about_ca_topic_score_gemma":0.0028458107,"teacher_disagreement_score":0.0060303374,"about_ca_system_score_codex":0.0005729077,"about_ca_system_score_gemma":0.0007363443,"threshold_uncertainty_score":0.02017355},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021854492476667983,"score_gpt":0.22479205968209653,"score_spread":0.20293756720542855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1821740204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.884111,0.00036241455,0.086034425,0.0004188928,0.000038398473,0.000070110946,0.00032088035,0.00020173195,0.02844225],"genre_scores_gemma":[0.97817194,0.00019278849,0.017888807,0.00006116964,0.000022700086,0.000078468285,0.00016138665,0.000053852447,0.0033687856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988287,0.00033922118,0.00004601423,0.00025964231,0.00029843522,0.00022812447],"domain_scores_gemma":[0.99441874,0.0030884426,0.0011717645,0.0005122278,0.00036463738,0.00044417472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767434,0.000588843,0.0007910011,0.0028304106,0.0016171302,0.0019772435,0.0007092066,0.0009930946,0.006494771],"category_scores_gemma":[0.0069449134,0.0006588192,0.0005578538,0.0011578724,0.0019145692,0.0023700579,0.0011527219,0.0009313697,0.00041796212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037136127,0.00009879088,0.008255937,0.00023207435,0.00006695588,0.00066216383,0.0006840705,0.05086504,0.0157756,0.89626974,0.0031478468,0.023570236],"study_design_scores_gemma":[0.00007250032,0.000281659,0.008613113,0.00018216501,0.00008825186,0.0017735955,0.0008512329,0.22872582,0.021045946,0.72461283,0.013669391,0.000083464234],"about_ca_topic_score_codex":0.0007163023,"about_ca_topic_score_gemma":0.00083051895,"teacher_disagreement_score":0.006494771,"about_ca_system_score_codex":0.0013276575,"about_ca_system_score_gemma":0.0003834237,"threshold_uncertainty_score":0.021727145},"labels":[],"label_agreement":null},{"id":"W1928034317","doi":"10.1002/jcd.21324","title":"Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Upper and lower bounds; Group (periodic table); Generalization; Integer (computer science); Type (biology); Block (permutation group theory); Combinatorial design; Block size; Limit (mathematics); Discrete mathematics","score_opus":0.0222665637184636,"score_gpt":0.21794672969470974,"score_spread":0.19568016597624613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928034317","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52183074,0.00041554536,0.4580747,0.0003427032,0.00012472022,0.00013989878,0.0002322945,0.00086977414,0.017969644],"genre_scores_gemma":[0.84097475,0.00012347351,0.15484843,0.00013687334,0.000037273912,0.00010515521,0.00017400007,0.000041470616,0.0035585305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991959,0.00026057984,0.00006526541,0.00013044501,0.00018883085,0.00015907885],"domain_scores_gemma":[0.9976986,0.00066562375,0.00044236367,0.0007509095,0.00026630674,0.00017627032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000639561,0.0003440121,0.00045059147,0.00056808215,0.00043133475,0.0010181046,0.0006091717,0.00055822154,0.0024289063],"category_scores_gemma":[0.0019666867,0.00028280684,0.00040998994,0.0008060079,0.00061146414,0.0010580099,0.00076760363,0.00052557583,0.00038648688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017615882,0.0003367903,0.009729839,0.0004295922,0.00015848414,0.0010028932,0.00042145833,0.14698485,0.28772983,0.37430364,0.006692305,0.17044875],"study_design_scores_gemma":[0.0002208805,0.0018676587,0.002140551,0.00008885475,0.00012707517,0.0021433528,0.00016921725,0.5868899,0.21575136,0.14003794,0.05046683,0.00009639519],"about_ca_topic_score_codex":0.00034241975,"about_ca_topic_score_gemma":0.0005762148,"teacher_disagreement_score":0.0024289063,"about_ca_system_score_codex":0.0006856181,"about_ca_system_score_gemma":0.00038139735,"threshold_uncertainty_score":0.008125544},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027203003280620378,"score_gpt":0.23307030169027662,"score_spread":0.20586729840965623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1939767867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51698136,0.00046827502,0.46045294,0.00044935883,0.000042856882,0.000095179035,0.0004354131,0.00041672325,0.020657929],"genre_scores_gemma":[0.9085893,0.00017651563,0.08807495,0.000118176424,0.000037706202,0.00013181596,0.00029124637,0.00004841457,0.0025318963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832696,0.0005651911,0.00010623242,0.00035636194,0.0004304621,0.00021472313],"domain_scores_gemma":[0.9829906,0.010771433,0.0017130566,0.002589846,0.0014624539,0.00047265526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017468651,0.00032701608,0.00057761645,0.0009340722,0.00072469935,0.0012924124,0.0008146348,0.0009073006,0.0035587838],"category_scores_gemma":[0.015658643,0.00072465657,0.0005548317,0.00074299803,0.0011857699,0.0015881298,0.001169092,0.001222405,0.0005570414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008113046,0.00017433889,0.0067628804,0.00041288513,0.0001044186,0.00058412313,0.00073356513,0.08640117,0.048255216,0.78991103,0.0030302983,0.06281879],"study_design_scores_gemma":[0.00016119034,0.00043196382,0.001690042,0.00012082862,0.000073267816,0.0014253359,0.00028392114,0.24782361,0.028631615,0.7098166,0.009487833,0.000053856704],"about_ca_topic_score_codex":0.0002222438,"about_ca_topic_score_gemma":0.00035608368,"teacher_disagreement_score":0.0035587838,"about_ca_system_score_codex":0.00081375265,"about_ca_system_score_gemma":0.00058184925,"threshold_uncertainty_score":0.011905313},"labels":[],"label_agreement":null},{"id":"W1940678198","doi":"10.1002/jcd.21414","title":"Constructing Pandiagonal Latin Squares from Linear Cellular Automaton on Elementary Abelian Groups","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","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","keywords":"Latin square; Mathematics; Permutation (music); Lexicographical order; Combinatorics; Abelian group; Order (exchange); Prime (order theory); Cellular automaton; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.0422532410936953,"score_gpt":0.26833807122476705,"score_spread":0.22608483013107175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940678198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24173704,0.00020724695,0.7382604,0.00021747898,0.00013486897,0.00018307,0.00016620141,0.0016205753,0.017473152],"genre_scores_gemma":[0.7395007,0.00015335511,0.2531572,0.00010191073,0.000019264238,0.00026163633,0.00024270748,0.00009078385,0.0064724553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996958,0.00008354379,0.000024667108,0.00008597195,0.000059420552,0.000050564122],"domain_scores_gemma":[0.9996916,0.000114299066,0.00002877574,0.00007221227,0.000070622475,0.000022567821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016007548,0.00040068573,0.0003901913,0.0003906104,0.0005079519,0.0005152232,0.00046269683,0.00036849585,0.0029077525],"category_scores_gemma":[0.00075593276,0.00019142308,0.00051389454,0.0004266719,0.0005996073,0.0004908141,0.00082231854,0.00031874533,0.0005743264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006427344,0.00019601647,0.006017604,0.00065793464,0.00012067325,0.0015309772,0.00093624165,0.2525878,0.18067592,0.26900196,0.0049455296,0.28268656],"study_design_scores_gemma":[0.00013313904,0.0005521208,0.0011900758,0.0000670726,0.000092317045,0.00061395887,0.00035732193,0.75482064,0.09183091,0.1202984,0.029959451,0.00008451299],"about_ca_topic_score_codex":0.0014735879,"about_ca_topic_score_gemma":0.0014672114,"teacher_disagreement_score":0.0029077525,"about_ca_system_score_codex":0.00034665607,"about_ca_system_score_gemma":0.00049814093,"threshold_uncertainty_score":0.009727418},"labels":[],"label_agreement":null},{"id":"W1948972712","doi":"10.1002/jcd.21328","title":"Cycle Extensions in BIBD Block‐Intersection Graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Beijing Institute For Brain Disorders","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Intersection (aeronautics); Intersection graph; Discrete mathematics; Line graph","score_opus":0.015058811688889324,"score_gpt":0.22534113340204748,"score_spread":0.21028232171315817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948972712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5614086,0.00043587002,0.41193134,0.00033674872,0.000029833329,0.00028223806,0.00081836694,0.0005584169,0.02419861],"genre_scores_gemma":[0.8202238,0.0002594983,0.17167412,0.000108957094,0.00001454415,0.0002487378,0.0010510595,0.000074510055,0.0063447715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961853,0.00008141306,0.000021492906,0.000085932035,0.000110132445,0.000082545674],"domain_scores_gemma":[0.9990109,0.00037318096,0.00016465326,0.00016136037,0.00015987731,0.00013002311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919849,0.0002941102,0.00031150016,0.0007781698,0.00074560114,0.00070683996,0.00054899283,0.00033786957,0.0037550891],"category_scores_gemma":[0.001122298,0.00040415925,0.00032473478,0.0008127317,0.0005317136,0.0013408037,0.0012249902,0.00072969036,0.00031577842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011693371,0.00030806416,0.007534621,0.000578161,0.00010558631,0.0011806778,0.0011194163,0.19833283,0.059317917,0.49590218,0.0059508537,0.22850041],"study_design_scores_gemma":[0.000111108224,0.00025301456,0.0033455952,0.0001468011,0.00009611379,0.0007851252,0.00049742515,0.5121154,0.033748593,0.4053219,0.043525238,0.000053744927],"about_ca_topic_score_codex":0.002042966,"about_ca_topic_score_gemma":0.0029487496,"teacher_disagreement_score":0.0037550891,"about_ca_system_score_codex":0.00072870986,"about_ca_system_score_gemma":0.0005608845,"threshold_uncertainty_score":0.0125620365},"labels":[],"label_agreement":null},{"id":"W1956284500","doi":"10.1002/jcd.21419","title":"Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation‐detachment Approach","year":2014,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multigraph; Degree (music); Variable (mathematics); Decomposition; Existential quantification","score_opus":0.01722085646959558,"score_gpt":0.22773193411690057,"score_spread":0.21051107764730498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956284500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21692583,0.00073103735,0.7592404,0.0003986446,0.000109565444,0.00014364481,0.00019463463,0.00022006585,0.022036195],"genre_scores_gemma":[0.7266344,0.00046752518,0.26268098,0.0003450025,0.000097321514,0.00023737852,0.00042450518,0.00010491381,0.009007948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966896,0.00009430526,0.000022258131,0.00007780083,0.000056135083,0.00008049005],"domain_scores_gemma":[0.9993512,0.00015869533,0.00007946486,0.00020166278,0.00009549962,0.00011340385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003716305,0.00059452327,0.00029093536,0.0009495617,0.00091044983,0.00081347855,0.00059118273,0.00052569533,0.0040175025],"category_scores_gemma":[0.0011045372,0.000397154,0.00072696334,0.0008436711,0.0008424469,0.0021103323,0.001473019,0.0014964838,0.00045927943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004518804,0.00019522534,0.0018535347,0.00042398158,0.000091292575,0.00093990227,0.00090035493,0.04813682,0.089009285,0.6883297,0.0067991856,0.16286884],"study_design_scores_gemma":[0.000055989865,0.0001881279,0.0018998869,0.00014329607,0.000066533954,0.0008246563,0.00052548904,0.17355534,0.027653906,0.7652041,0.029809693,0.00007296044],"about_ca_topic_score_codex":0.00073165225,"about_ca_topic_score_gemma":0.001236117,"teacher_disagreement_score":0.0040175025,"about_ca_system_score_codex":0.00044878165,"about_ca_system_score_gemma":0.0003599692,"threshold_uncertainty_score":0.013439894},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.014776714017030023,"score_gpt":0.21460459658773007,"score_spread":0.19982788257070005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964395996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76501405,0.00033777245,0.20218427,0.00019052591,0.0000867282,0.00016872774,0.00044230302,0.00022966237,0.031345934],"genre_scores_gemma":[0.96615815,0.00017884052,0.027773287,0.00008837026,0.00005297836,0.000112170805,0.00046708027,0.000043522075,0.0051255994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992386,0.00015424685,0.00006070567,0.00020601002,0.00020139254,0.00013890922],"domain_scores_gemma":[0.9984717,0.00034838117,0.00029260467,0.00030124868,0.00028102158,0.00030505564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071633304,0.00031969146,0.0003708316,0.0013154373,0.0006409932,0.0011244119,0.00040317109,0.00036571952,0.005284767],"category_scores_gemma":[0.0017819148,0.0003055691,0.00044517132,0.00057844835,0.0010736459,0.0017754921,0.00086379587,0.0006347455,0.00036407445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001392861,0.00008177961,0.001583335,0.00007697048,0.000029613699,0.00042329327,0.00077937415,0.005790505,0.009446666,0.95930654,0.0014515807,0.020891055],"study_design_scores_gemma":[0.000037600676,0.00007213311,0.0011088672,0.000031075822,0.000024417854,0.00032016946,0.00033681295,0.02657733,0.004579473,0.95974225,0.007150702,0.000019326504],"about_ca_topic_score_codex":0.0004917134,"about_ca_topic_score_gemma":0.0006513946,"teacher_disagreement_score":0.005284767,"about_ca_system_score_codex":0.00043742804,"about_ca_system_score_gemma":0.0003276049,"threshold_uncertainty_score":0.017679274},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04613618521940243,"score_gpt":0.26001373705092606,"score_spread":0.21387755183152363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966120745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42972964,0.0004202739,0.54690963,0.00031524678,0.000075990414,0.0000972648,0.0005413873,0.0011666078,0.020743959],"genre_scores_gemma":[0.85317844,0.00019017501,0.14213768,0.00014937388,0.00008187348,0.00017066438,0.0005512023,0.00015447677,0.0033861713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.00033191664,0.0000973332,0.00027845998,0.0003984261,0.00019439824],"domain_scores_gemma":[0.99579936,0.0019825855,0.00064914324,0.00085132295,0.0004879919,0.0002296621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005031082,0.00056044845,0.00053301844,0.0011558095,0.00054358394,0.0012802687,0.0005674898,0.00048609855,0.0038326948],"category_scores_gemma":[0.003933931,0.0003628119,0.0004728477,0.0015153347,0.000790784,0.0021956093,0.0010925371,0.00058590394,0.00053300854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051567383,0.00012361852,0.0050659403,0.00029745064,0.00009178273,0.00058852084,0.0005218002,0.15327626,0.0647342,0.56761014,0.0055601606,0.2016145],"study_design_scores_gemma":[0.000044332395,0.00036038223,0.0021215833,0.00006015622,0.000059812704,0.0010443392,0.00030258964,0.42864358,0.049773335,0.49447885,0.023055578,0.000055378412],"about_ca_topic_score_codex":0.00030856626,"about_ca_topic_score_gemma":0.00032062456,"teacher_disagreement_score":0.0038326948,"about_ca_system_score_codex":0.0005729839,"about_ca_system_score_gemma":0.0002826858,"threshold_uncertainty_score":0.012821674},"labels":[],"label_agreement":null},{"id":"W1967788202","doi":"10.1002/jcd.20144","title":"On the spectrum of critical sets in latin squares of order 2<sup><i>n</i></sup>","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Circulant matrix; Mathematics; Combinatorics; Order (exchange); Square (algebra); Abelian group; Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.01674029674862886,"score_gpt":0.24787666359341357,"score_spread":0.2311363668447847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967788202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9211074,0.000308957,0.061823912,0.00016777881,0.000034052704,0.000032253032,0.000113389135,0.000095665055,0.016316487],"genre_scores_gemma":[0.9882621,0.00008956857,0.010345179,0.000041958247,0.000033087857,0.000050626953,0.00012736891,0.000029782408,0.0010201798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950147,0.0001009231,0.000032784934,0.000096040545,0.00015939391,0.00010941869],"domain_scores_gemma":[0.99655473,0.0020980537,0.00054316525,0.00022280747,0.00031454317,0.0002667203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056793407,0.00032173426,0.00042443912,0.0021216746,0.0012918125,0.0015862559,0.00040929386,0.0004744281,0.0033205338],"category_scores_gemma":[0.0035082246,0.00036313577,0.00034022267,0.0006452485,0.0020674022,0.0015688101,0.0011308177,0.00049001194,0.00023111212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068900886,0.00015496173,0.008823961,0.00014115564,0.000042838015,0.0014667419,0.0016784378,0.029458864,0.048013426,0.876876,0.00272977,0.029924886],"study_design_scores_gemma":[0.00009446901,0.00021927136,0.0056996597,0.000099945064,0.000031723892,0.0013837591,0.00128263,0.11806917,0.03348087,0.83283764,0.0067295725,0.000071298084],"about_ca_topic_score_codex":0.0007369979,"about_ca_topic_score_gemma":0.0005509079,"teacher_disagreement_score":0.0033205338,"about_ca_system_score_codex":0.00081052247,"about_ca_system_score_gemma":0.00033191248,"threshold_uncertainty_score":0.011108339},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.013758034569920165,"score_gpt":0.2069027847097385,"score_spread":0.19314475013981833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970963182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42139342,0.00030466536,0.5449189,0.00022496484,0.00006946181,0.00023314157,0.0006633717,0.0005056219,0.031686526],"genre_scores_gemma":[0.83656883,0.00020669446,0.15664254,0.00009742561,0.000044381293,0.00022058818,0.0005644981,0.000043758944,0.005611354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902976,0.00028254258,0.0000842482,0.00011955176,0.0003191822,0.0001647869],"domain_scores_gemma":[0.9972651,0.0006455353,0.0008045425,0.0007009983,0.00041341278,0.00017053391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081153604,0.00059851474,0.00073642394,0.0007004958,0.0004390244,0.0009903305,0.0007941463,0.00060310756,0.0055067562],"category_scores_gemma":[0.0021832003,0.00045811088,0.00049185427,0.00061518303,0.00048604386,0.0010649617,0.0008826043,0.00053282647,0.0012996633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031076856,0.0002601099,0.0034090115,0.0005453414,0.00026614798,0.0006504081,0.00024836065,0.109278545,0.3025534,0.41003603,0.0034021132,0.16624291],"study_design_scores_gemma":[0.0012044974,0.0026058862,0.0027744118,0.00018342472,0.00024558144,0.0014675916,0.00014950658,0.46757814,0.204743,0.2901536,0.028729666,0.00016472448],"about_ca_topic_score_codex":0.00042775722,"about_ca_topic_score_gemma":0.0012480221,"teacher_disagreement_score":0.0055067562,"about_ca_system_score_codex":0.000468586,"about_ca_system_score_gemma":0.0007233456,"threshold_uncertainty_score":0.018421948},"labels":[],"label_agreement":null},{"id":"W1971473039","doi":"10.1002/jcd.20033","title":"Quasi‐embeddings of Steiner triple systems, or Steiner triple systems of different orders with maximum intersection","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Order (exchange); Intersection (aeronautics); Steiner system; Generalization; Prime (order theory); Recursion (computer science); Discrete mathematics; Mathematical analysis; Algorithm","score_opus":0.01459643275759967,"score_gpt":0.2186255622253785,"score_spread":0.20402912946777882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971473039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75400966,0.0006412902,0.1833064,0.00076120533,0.00020256176,0.000070204245,0.00038022408,0.00034653224,0.060281772],"genre_scores_gemma":[0.95716465,0.000215564,0.036248885,0.00011567892,0.00007096794,0.00006199504,0.00041684724,0.00009710497,0.0056083435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991505,0.00019657472,0.00008051155,0.0001675023,0.00023183909,0.00017315394],"domain_scores_gemma":[0.99781406,0.00070344406,0.00042532544,0.00040842377,0.00029584867,0.00035289096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008362445,0.0004017634,0.00047674007,0.00095375255,0.0012194599,0.0019999042,0.00076190894,0.0008072262,0.010343888],"category_scores_gemma":[0.0029721316,0.0005914958,0.00071613,0.00090846623,0.0021469442,0.005189792,0.0018291014,0.001545214,0.00082509284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013304538,0.000026930697,0.0009689829,0.00008151025,0.000012091222,0.0001290758,0.00034839928,0.004887125,0.003534684,0.97833955,0.0010107771,0.010527804],"study_design_scores_gemma":[0.000057253445,0.00017243004,0.0013667222,0.0000670952,0.000024921414,0.00044618952,0.0009559091,0.033818346,0.007884871,0.9394936,0.015666686,0.000045885605],"about_ca_topic_score_codex":0.0004540722,"about_ca_topic_score_gemma":0.0006055514,"teacher_disagreement_score":0.010343888,"about_ca_system_score_codex":0.0010432587,"about_ca_system_score_gemma":0.0003935709,"threshold_uncertainty_score":0.034603715},"labels":[],"label_agreement":null},{"id":"W1971646571","doi":"10.1002/jcd.10031","title":"New type of block design","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Equivalence (formal languages); Block (permutation group theory); Type (biology); Combinatorics; Class (philosophy); Difference set; Discrete mathematics; Arithmetic; Computer science; Artificial intelligence; Abelian group","score_opus":0.046615365826622866,"score_gpt":0.22926837539136305,"score_spread":0.18265300956474018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971646571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043850236,0.00055458915,0.9118068,0.0003456485,0.0003561774,0.00020826426,0.00034838374,0.00043435275,0.042095542],"genre_scores_gemma":[0.60489696,0.0005736086,0.3641668,0.000804452,0.00025287797,0.0006114039,0.00055373344,0.00015498686,0.027985204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971253,0.0011455396,0.0001728892,0.00047452282,0.0008214257,0.00026044715],"domain_scores_gemma":[0.9957616,0.0014253356,0.00038284578,0.0013211821,0.00088498025,0.00022421624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020288697,0.00041388918,0.00055806834,0.00077272154,0.00056138006,0.0012494338,0.0009800526,0.0009178293,0.010329557],"category_scores_gemma":[0.0048440117,0.0003242528,0.000608331,0.0007204037,0.0010538548,0.0019273307,0.0013458142,0.0011663396,0.0016240599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005019528,0.0001246645,0.0013445596,0.00024840987,0.000065852764,0.00011622279,0.00019202568,0.014940798,0.016553968,0.8414269,0.0039738305,0.1205107],"study_design_scores_gemma":[0.00029400343,0.0013193144,0.0015208019,0.00015077413,0.00011007331,0.0010380036,0.00009759062,0.13968056,0.027315298,0.7176626,0.11070543,0.00010550544],"about_ca_topic_score_codex":0.00035383826,"about_ca_topic_score_gemma":0.00050721044,"teacher_disagreement_score":0.010329557,"about_ca_system_score_codex":0.0008554025,"about_ca_system_score_gemma":0.0006983947,"threshold_uncertainty_score":0.034555793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010338117526900113,"score_gpt":0.21725186685555517,"score_spread":0.20691374932865506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973315577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7477599,0.0007999985,0.23228177,0.00032669757,0.00003548603,0.00014560805,0.00056254625,0.00021896204,0.017869093],"genre_scores_gemma":[0.9113242,0.00061996747,0.08232828,0.0001116799,0.00004299895,0.00013551055,0.0008176464,0.00012192305,0.0044978405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993604,0.00023104697,0.000026313404,0.00011836431,0.000108408574,0.00015545095],"domain_scores_gemma":[0.99858826,0.00076221663,0.00021521463,0.00018137222,0.0001228958,0.00013001755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054367795,0.0005139271,0.0007337421,0.0007044174,0.00053255307,0.00089320686,0.00047287066,0.0005186541,0.0027764458],"category_scores_gemma":[0.0023685982,0.0003277286,0.00043047318,0.0011225721,0.00060794066,0.001070205,0.00097604905,0.00028097394,0.00029698908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042720113,0.00010606945,0.0028866027,0.0003227246,0.00009174549,0.0005071059,0.00028470557,0.78914326,0.015368303,0.09319779,0.005118258,0.0925462],"study_design_scores_gemma":[0.000041777686,0.00016760553,0.0012770721,0.00004624351,0.00003638179,0.0004315517,0.00016865706,0.89539886,0.008923623,0.08477216,0.0087135825,0.000022454904],"about_ca_topic_score_codex":0.002277377,"about_ca_topic_score_gemma":0.0014259449,"teacher_disagreement_score":0.0027764458,"about_ca_system_score_codex":0.00077918044,"about_ca_system_score_gemma":0.000503391,"threshold_uncertainty_score":0.009288132},"labels":[],"label_agreement":null},{"id":"W1975962647","doi":"10.1002/jcd.10057","title":"Some Hadamard matrices of order 32 and their binary codes","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Hadamard transform; Binary Golay code; Hadamard matrix; Mathematics; Ternary Golay code; Complex Hadamard matrix; Binary number; Order (exchange); Combinatorics; Hadamard code; Code (set theory); Binary code; Hadamard's inequality; Matrix (chemical analysis); Discrete mathematics; Linear code; Arithmetic; Algorithm; Block code; Computer science; Decoding methods; Set (abstract data type)","score_opus":0.011426857845416945,"score_gpt":0.20877933062935145,"score_spread":0.1973524727839345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975962647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9010763,0.0007812147,0.06902826,0.000561486,0.00015798007,0.000049240127,0.00018510617,0.00008308523,0.028077193],"genre_scores_gemma":[0.97787744,0.0001696756,0.017600458,0.00007980836,0.000060467337,0.000026941963,0.000090344896,0.000011279405,0.0040835505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995585,0.00010968363,0.000024504623,0.000059269558,0.00017415258,0.000073743446],"domain_scores_gemma":[0.9992619,0.00021975258,0.00019741166,0.0000732409,0.00013440626,0.000113333386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443028,0.0003624786,0.00028005152,0.00094256346,0.00073054474,0.0008424826,0.00026895144,0.0005944445,0.0018418571],"category_scores_gemma":[0.0015767193,0.00024032484,0.00019574449,0.00050523353,0.00097334577,0.0005884918,0.0005950119,0.0008640293,0.00023481903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029761082,0.00005708435,0.001381927,0.000082714345,0.00001721778,0.00068934145,0.0003780103,0.013053519,0.026340788,0.9428124,0.0013414697,0.013547963],"study_design_scores_gemma":[0.00008991314,0.00019807594,0.0021462457,0.00007065296,0.00001631501,0.0015172989,0.00022586447,0.10828659,0.026113214,0.8508018,0.010416568,0.000117538],"about_ca_topic_score_codex":0.00075245637,"about_ca_topic_score_gemma":0.0006060269,"teacher_disagreement_score":0.0018418571,"about_ca_system_score_codex":0.00048179206,"about_ca_system_score_gemma":0.00044185546,"threshold_uncertainty_score":0.0061615705},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035267551852609595,"score_gpt":0.21890301828844091,"score_spread":0.1836354664358313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982048527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20569217,0.0010560128,0.76498055,0.0004855065,0.0001663725,0.00015808009,0.00036018292,0.00045945862,0.026641563],"genre_scores_gemma":[0.7576155,0.00081165123,0.23374557,0.0003169261,0.00018067862,0.00035484563,0.00034891226,0.00009348835,0.0065323794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985354,0.0005377693,0.00007523881,0.000332537,0.00031609213,0.00020300612],"domain_scores_gemma":[0.9964192,0.0017131899,0.0005661887,0.0007613215,0.00032423038,0.0002158413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417667,0.0007150651,0.0005409631,0.00095949863,0.0006584561,0.0012716522,0.0006464133,0.00083200337,0.004068897],"category_scores_gemma":[0.004287799,0.00044627112,0.00074115547,0.0013479461,0.0011194155,0.0017587519,0.0010356732,0.0009229309,0.0004621443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002184593,0.00005681378,0.0010911211,0.00022478453,0.00006271882,0.0003167773,0.00025092147,0.086779565,0.021645311,0.8031644,0.003627316,0.08256182],"study_design_scores_gemma":[0.00010443199,0.00034766804,0.00086430024,0.000069179405,0.000050583058,0.0010711779,0.00013941346,0.26699185,0.014089552,0.6901468,0.026066897,0.00005820947],"about_ca_topic_score_codex":0.00049687474,"about_ca_topic_score_gemma":0.0006118827,"teacher_disagreement_score":0.004068897,"about_ca_system_score_codex":0.00086851674,"about_ca_system_score_gemma":0.00048786012,"threshold_uncertainty_score":0.013611853},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030965606947279775,"score_gpt":0.2514559348853198,"score_spread":0.22049032793804002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983867705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022078326,0.00058553566,0.96560764,0.0005091724,0.00006148015,0.000044723532,0.000041434127,0.000088208624,0.010983491],"genre_scores_gemma":[0.7028679,0.0014490221,0.28789395,0.00044146742,0.0001976384,0.00024628558,0.000130477,0.00007082406,0.0067023835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999065,0.00031037946,0.00003641025,0.000086227905,0.00039767823,0.0001042911],"domain_scores_gemma":[0.99840015,0.00096454663,0.0001872532,0.00017417701,0.00022970195,0.000044184824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017120122,0.0005958342,0.0005420374,0.0013190215,0.0006430844,0.0017623545,0.00088961795,0.0010605135,0.0024623778],"category_scores_gemma":[0.0038062439,0.00046104254,0.00049429806,0.0009544234,0.0014847408,0.0023662446,0.00084428716,0.0008549992,0.000259493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005583397,0.000057129753,0.00032392578,0.00012132641,0.000026171052,0.00005183445,0.00007773114,0.21780586,0.0048027853,0.72717005,0.0015724518,0.047934953],"study_design_scores_gemma":[0.000028743292,0.0001027198,0.00014654403,0.000039209564,0.000023885998,0.00009880531,0.00005743187,0.47886792,0.004888299,0.5089658,0.0067632277,0.000017447708],"about_ca_topic_score_codex":0.0005292993,"about_ca_topic_score_gemma":0.0005530034,"teacher_disagreement_score":0.0024623778,"about_ca_system_score_codex":0.001954197,"about_ca_system_score_gemma":0.0008491465,"threshold_uncertainty_score":0.014178753},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Mod","score_opus":0.06391543511405508,"score_gpt":0.3568091950535579,"score_spread":0.29289375993950284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984385881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94937855,0.00022646898,0.032982934,0.00018686302,0.00011831824,0.000039298116,0.00011156015,0.000087698536,0.01686845],"genre_scores_gemma":[0.98612773,0.0001252778,0.0078805685,0.000071349226,0.00006676031,0.00007729021,0.0001958067,0.000058507307,0.005396627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927336,0.00016490839,0.00006188047,0.0000910721,0.00018597658,0.00022294342],"domain_scores_gemma":[0.9977804,0.0009414187,0.00036813854,0.0002375961,0.00023164375,0.0004408984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085626775,0.0005759183,0.00054550305,0.0019439268,0.001326076,0.0014248162,0.00061804266,0.00057955924,0.003533955],"category_scores_gemma":[0.0031489474,0.0002833561,0.0004882933,0.00088141416,0.0021986545,0.0018104394,0.0013962202,0.00097642245,0.0004967118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005774742,0.00010663424,0.0019012055,0.00008430123,0.0000124047265,0.0006252777,0.0012622088,0.011009297,0.010485821,0.9566385,0.0015592502,0.01573771],"study_design_scores_gemma":[0.0001385065,0.00023835886,0.001977386,0.00008492927,0.000012535934,0.00031628984,0.00045187183,0.043582056,0.0058317785,0.94146854,0.005844676,0.00005303639],"about_ca_topic_score_codex":0.00076969294,"about_ca_topic_score_gemma":0.0011047571,"teacher_disagreement_score":0.003533955,"about_ca_system_score_codex":0.0015372202,"about_ca_system_score_gemma":0.00040407162,"threshold_uncertainty_score":0.011822283},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Prime power; Combinatorics; Prime (order theory); Character (mathematics); Discrete mathematics; Arithmetic; Geometry","score_opus":0.017603726356398626,"score_gpt":0.19152062674963516,"score_spread":0.17391690039323654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986793172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93185943,0.0003080012,0.05026654,0.0006752945,0.00008275506,0.00006795169,0.00024239424,0.00015080212,0.016346756],"genre_scores_gemma":[0.98463917,0.00009820347,0.012428641,0.00011521063,0.000038825765,0.0000675611,0.00021112616,0.000019045965,0.0023821348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985532,0.00037192286,0.00009923822,0.0002635789,0.00036484716,0.00034711682],"domain_scores_gemma":[0.99598926,0.002156186,0.00052896206,0.00041339017,0.000540371,0.0003718571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015133028,0.00026920438,0.00053121086,0.0008953072,0.0019576848,0.0013596066,0.0005614065,0.00085622247,0.004515615],"category_scores_gemma":[0.0050477465,0.00041460176,0.0005107596,0.0005065205,0.0013265623,0.0018296962,0.0014854225,0.0010470608,0.0007057919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018092296,0.000270586,0.020109287,0.00024434456,0.00007059654,0.0021823589,0.0019925188,0.005962589,0.059931282,0.82975173,0.0037641458,0.073911294],"study_design_scores_gemma":[0.0006102812,0.0011716902,0.0073945965,0.00016909103,0.00011285192,0.008385408,0.0013410382,0.03335319,0.103208,0.8039669,0.040091265,0.00019565973],"about_ca_topic_score_codex":0.000140469,"about_ca_topic_score_gemma":0.00010760014,"teacher_disagreement_score":0.004515615,"about_ca_system_score_codex":0.00083396584,"about_ca_system_score_gemma":0.00048493667,"threshold_uncertainty_score":0.015106261},"labels":[],"label_agreement":null},{"id":"W1989084180","doi":"10.1002/jcd.1014","title":"Necessary existence criteria for mandatory representation designs MRD (4, k; ν)","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Pairwise comparison; Combinatorics; Block (permutation group theory); Representation (politics); Combinatorial design; Block design; Set (abstract data type); Discrete mathematics; Statistics; Computer science; Law","score_opus":0.06290992553931898,"score_gpt":0.30640907384357857,"score_spread":0.2434991483042596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989084180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39778778,0.001136953,0.56553227,0.0018664466,0.00016551933,0.0005139277,0.0016012427,0.0010039308,0.03039206],"genre_scores_gemma":[0.8336017,0.00028636874,0.15952133,0.000276663,0.00016766223,0.0008310524,0.0009923485,0.00013494208,0.0041879956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98891604,0.0047571696,0.001149898,0.0018920754,0.0022943586,0.000990527],"domain_scores_gemma":[0.88417214,0.080942914,0.012508221,0.0058396077,0.01248902,0.004048104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009340262,0.001274322,0.0016415204,0.002464002,0.0012202709,0.002171654,0.0015958946,0.002782998,0.013373282],"category_scores_gemma":[0.077338286,0.0016003235,0.0010434347,0.00119428,0.0024778224,0.004349676,0.0029728992,0.0019206227,0.0021695925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047561084,0.000788269,0.017101763,0.001398636,0.00020842525,0.0013617022,0.0013086947,0.054627042,0.043550946,0.7671518,0.009371394,0.09837516],"study_design_scores_gemma":[0.0014474742,0.0054710866,0.007310717,0.0007744521,0.00026569038,0.0035562303,0.0013834413,0.30969453,0.06517246,0.57869005,0.02589162,0.00034220406],"about_ca_topic_score_codex":0.00035321864,"about_ca_topic_score_gemma":0.00047426598,"teacher_disagreement_score":0.013373282,"about_ca_system_score_codex":0.001457034,"about_ca_system_score_gemma":0.0011934157,"threshold_uncertainty_score":0.049396574},"labels":[],"label_agreement":null},{"id":"W1989666997","doi":"10.1002/jcd.20012","title":"Weaving hadamard matrices with maximum excess and classes with small excess","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Manitoba","funders":"","keywords":"Hadamard transform; Hadamard matrix; Complex Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Combinatorics; Hadamard's inequality; Hadamard product; Matrix (chemical analysis); Order (exchange); Weaving; Kronecker product; Kronecker delta; Mathematical analysis; Composite material; Physics; Materials science","score_opus":0.013795336902620707,"score_gpt":0.19825136723104436,"score_spread":0.18445603032842364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989666997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.482054,0.00042546343,0.47375086,0.000337981,0.0001518599,0.00010906477,0.00016826057,0.0009848902,0.042017672],"genre_scores_gemma":[0.88251686,0.00022123777,0.10795689,0.00011934097,0.00010047467,0.0001101068,0.00027457127,0.00026075065,0.0084398305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985617,0.00024461152,0.00013889698,0.00023110308,0.0005277461,0.00029603532],"domain_scores_gemma":[0.99667656,0.001397922,0.00036483444,0.00084563636,0.00040572838,0.0003092034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009133152,0.00071628805,0.0005082078,0.001695733,0.001378612,0.0017872237,0.0005939221,0.00063686824,0.0061009326],"category_scores_gemma":[0.002832041,0.0005158323,0.0010471172,0.0008682321,0.0019190557,0.0024124242,0.0018946779,0.0017364332,0.0010242879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020179937,0.0001199045,0.0020992511,0.00013419038,0.000029121182,0.0004575517,0.00047574556,0.013535874,0.065847,0.8668894,0.0017150181,0.0484951],"study_design_scores_gemma":[0.000049835515,0.0003136731,0.0020862268,0.00008158115,0.000041466472,0.00084451796,0.00024669088,0.059155557,0.14039898,0.7678854,0.028789012,0.000107038584],"about_ca_topic_score_codex":0.0006665934,"about_ca_topic_score_gemma":0.00078172394,"teacher_disagreement_score":0.0061009326,"about_ca_system_score_codex":0.0009012346,"about_ca_system_score_gemma":0.0003428006,"threshold_uncertainty_score":0.020409644},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019869379363056817,"score_gpt":0.23518324999577622,"score_spread":0.2153138706327194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993163310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07854868,0.0006426089,0.86981905,0.00036248434,0.00017200042,0.00036181137,0.00037789985,0.00044978326,0.049265817],"genre_scores_gemma":[0.68506366,0.00034351888,0.3014688,0.0002742123,0.00016695942,0.0005194089,0.00042557763,0.00014763627,0.011590293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914213,0.0027877644,0.00058106816,0.0018871145,0.0023493234,0.00097332837],"domain_scores_gemma":[0.9881054,0.0031128724,0.001677368,0.0034824267,0.002920569,0.00070140127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036577205,0.0009571034,0.0011339049,0.0022331933,0.0017832282,0.0032817146,0.0019662478,0.0013644886,0.012293367],"category_scores_gemma":[0.008085837,0.0008795396,0.0010869757,0.0025273375,0.0027487774,0.003711879,0.0034187003,0.0016832727,0.0018051321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047127446,0.00014366454,0.0017537293,0.0002050811,0.00013888595,0.00015819038,0.00035520847,0.04718795,0.010427117,0.83317965,0.0041284277,0.10185086],"study_design_scores_gemma":[0.00023966431,0.0009851984,0.00077882997,0.00014489774,0.00015387493,0.0010809767,0.00030825732,0.18255098,0.026038175,0.71894234,0.06865964,0.00011706769],"about_ca_topic_score_codex":0.0005698039,"about_ca_topic_score_gemma":0.0007008163,"teacher_disagreement_score":0.012293367,"about_ca_system_score_codex":0.0019901425,"about_ca_system_score_gemma":0.0012696981,"threshold_uncertainty_score":0.041125417},"labels":[],"label_agreement":null},{"id":"W1995950135","doi":"10.1002/jcd.20221","title":"Generalized Hadamard matrices whose transposes are not generalized Hadamard matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Hadamard's inequality; Mathematics; Hadamard's maximal determinant problem; Hadamard product; Hadamard three-lines theorem; Combinatorics; Mathematical analysis","score_opus":0.01928377501370095,"score_gpt":0.23377073186798195,"score_spread":0.21448695685428099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995950135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19088434,0.0014459655,0.7174623,0.0033340023,0.0018378762,0.00019840356,0.0003812263,0.00069038634,0.08376555],"genre_scores_gemma":[0.7554146,0.00095051987,0.21113558,0.001834336,0.0004892934,0.00020255597,0.00036991792,0.00017548843,0.029427752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903476,0.00026032474,0.000057790687,0.00020135433,0.0003222405,0.00012350698],"domain_scores_gemma":[0.9980539,0.0005753207,0.0002041598,0.0005407873,0.00050206,0.00012380721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071956177,0.00064644445,0.0005056527,0.00057124137,0.0008408433,0.001545662,0.0007310079,0.0011153133,0.00702942],"category_scores_gemma":[0.0034877537,0.00038041815,0.0005653347,0.00064437336,0.0016150568,0.0020197413,0.00088823267,0.0016290698,0.0015129569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011251624,0.000021828206,0.00034808085,0.00010892029,0.000020829177,0.00037826126,0.00017349844,0.0036783097,0.014284972,0.951466,0.0045604142,0.024846356],"study_design_scores_gemma":[0.000055816057,0.00013611525,0.0003748108,0.00006171643,0.000022457463,0.0009876236,0.0001540443,0.029969843,0.01684595,0.92175686,0.029561492,0.00007319997],"about_ca_topic_score_codex":0.000497427,"about_ca_topic_score_gemma":0.0005056498,"teacher_disagreement_score":0.00702942,"about_ca_system_score_codex":0.0005429418,"about_ca_system_score_gemma":0.0004982233,"threshold_uncertainty_score":0.02351576},"labels":[],"label_agreement":null},{"id":"W1996390551","doi":"10.1002/jcd.20092","title":"Erratum to: Self‐dual codes and the (22,8,4) balanced incomplete block design","year":2005,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Block (permutation group theory); Arithmetic; Discrete mathematics; Philosophy; Linguistics","score_opus":0.014092883060217824,"score_gpt":0.2208217076198572,"score_spread":0.20672882455963937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996390551","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010790406,0.009997483,0.037290532,0.07886322,0.8030773,0.00017944151,0.002415337,0.0008584102,0.056527857],"genre_scores_gemma":[0.18342727,0.023980696,0.07881197,0.058732305,0.06167138,0.00042438647,0.0058409185,0.0016118473,0.5854993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990164,0.00016471495,0.00012720346,0.00011239613,0.0004968409,0.000082449296],"domain_scores_gemma":[0.99675035,0.0011086928,0.00023987397,0.000251019,0.0015406333,0.00010945854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097346347,0.001030622,0.0007384912,0.0013190227,0.0016782745,0.0011951244,0.0011170588,0.0020989648,0.02840991],"category_scores_gemma":[0.0122555075,0.00043882758,0.00045498356,0.0012754841,0.0010215626,0.0015022649,0.00068797247,0.0026416604,0.009765115],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023921387,0.000027957722,0.0003475039,0.00031176262,0.000018306397,0.001069772,0.0001581982,0.0011574067,0.0009815259,0.026846172,0.91248405,0.056358095],"study_design_scores_gemma":[0.000058826343,0.00011905765,0.0009195593,0.00042900603,0.000044581477,0.00192807,0.00025067074,0.0029292577,0.0036767588,0.02290344,0.9666599,0.00008083972],"about_ca_topic_score_codex":0.0027888892,"about_ca_topic_score_gemma":0.0063671228,"teacher_disagreement_score":0.02840991,"about_ca_system_score_codex":0.0014903239,"about_ca_system_score_gemma":0.0010404815,"threshold_uncertainty_score":0.09504056},"labels":[],"label_agreement":null},{"id":"W1996563160","doi":"10.1002/jcd.20283","title":"Existential closure of block intersection graphs of infinite designs having infinite block size","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Intersection (aeronautics); Block (permutation group theory); Block size; Discrete mathematics; Closure (psychology); Graph; Computer science","score_opus":0.07509661579310065,"score_gpt":0.2916596910825237,"score_spread":0.21656307528942306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996563160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83181477,0.00027405715,0.16033795,0.00013246751,0.000013658562,0.00004958936,0.00023581625,0.00014446495,0.006997184],"genre_scores_gemma":[0.96545994,0.00016364129,0.03239588,0.000048355625,0.000014687587,0.000089508176,0.00034743873,0.00005561061,0.0014248954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984621,0.00038322218,0.000116796495,0.0004307565,0.00034452305,0.00026262627],"domain_scores_gemma":[0.9933994,0.0036176974,0.0013992864,0.0005833049,0.00050573493,0.000494582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013467586,0.00046154033,0.0006160711,0.0010500527,0.0011488172,0.0015046578,0.0009340651,0.000538397,0.0018960364],"category_scores_gemma":[0.0057295295,0.0006410003,0.00076568144,0.00079539145,0.0026408918,0.004099349,0.0020669706,0.0009081015,0.00013239373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076010515,0.00017349859,0.010629451,0.000283022,0.00008529624,0.0009438449,0.0024295116,0.037537392,0.022043835,0.8813866,0.0008038354,0.04292373],"study_design_scores_gemma":[0.00009681431,0.00029370788,0.0044607674,0.00010917938,0.000112764086,0.0014728664,0.0012774853,0.11855773,0.020931445,0.84410435,0.008507976,0.00007491962],"about_ca_topic_score_codex":0.0010191761,"about_ca_topic_score_gemma":0.00077919936,"teacher_disagreement_score":0.0018960364,"about_ca_system_score_codex":0.0009471257,"about_ca_system_score_gemma":0.0006070362,"threshold_uncertainty_score":0.0071223974},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02112653195116119,"score_gpt":0.19883430334844865,"score_spread":0.17770777139728747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997203758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5173348,0.0036977378,0.39410597,0.0040640314,0.00043251552,0.00011292271,0.0009406265,0.001173033,0.0781384],"genre_scores_gemma":[0.9539322,0.0010240431,0.03968774,0.0004381921,0.00020160565,0.00010427671,0.00047986044,0.00008526521,0.0040468634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773175,0.0006954221,0.00017098835,0.00034849948,0.00064255396,0.0004107943],"domain_scores_gemma":[0.9820164,0.012829832,0.0013334586,0.0020038183,0.0012977166,0.00051873206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558585,0.00046071477,0.00059586175,0.0011971496,0.0012483234,0.004165886,0.0009402757,0.0012944309,0.00630576],"category_scores_gemma":[0.012894829,0.00071015384,0.0006267076,0.001532323,0.002162111,0.0044569275,0.0018192243,0.0016114563,0.0010511652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000433398,0.00010206537,0.0020533446,0.00026593992,0.00005060955,0.00028214094,0.00056058035,0.046946492,0.014470111,0.86069155,0.005336037,0.068807706],"study_design_scores_gemma":[0.000064224914,0.00025176816,0.00081197306,0.00011698106,0.000062381856,0.000541223,0.0002956151,0.1974272,0.02849227,0.7493546,0.022488425,0.00009333473],"about_ca_topic_score_codex":0.0004869472,"about_ca_topic_score_gemma":0.0003154336,"teacher_disagreement_score":0.00630576,"about_ca_system_score_codex":0.0012373091,"about_ca_system_score_gemma":0.0005828342,"threshold_uncertainty_score":0.021094859},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005941501822332705,"score_gpt":0.19282354696042872,"score_spread":0.186882045138096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998402533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42645338,0.001781042,0.5196824,0.0012276304,0.00022374078,0.00037039584,0.0006153526,0.00051363104,0.04913246],"genre_scores_gemma":[0.77580196,0.0010118764,0.21123347,0.00039177368,0.0001556023,0.0004671189,0.0006483158,0.00009566388,0.010194188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812275,0.00057579926,0.00016896741,0.0003533,0.00049078435,0.00028832536],"domain_scores_gemma":[0.9913304,0.005109912,0.0010310066,0.0014811691,0.00077502866,0.00027251095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024261754,0.00062141387,0.0006938937,0.0010398042,0.0009037792,0.0015878001,0.0008373054,0.0007216866,0.0077530863],"category_scores_gemma":[0.010508484,0.0005171539,0.00060318253,0.00074272265,0.001321882,0.0027968145,0.0013265668,0.0011952685,0.0011825868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017576341,0.00024267727,0.0041513173,0.00067984493,0.000116132025,0.00047089934,0.0005154122,0.06817537,0.0232114,0.7068428,0.0043604225,0.18947619],"study_design_scores_gemma":[0.0008254557,0.0015515018,0.0011978465,0.0003392152,0.00016205694,0.0016284358,0.00033383947,0.1805915,0.055713125,0.71150905,0.046053354,0.000094568546],"about_ca_topic_score_codex":0.00037733815,"about_ca_topic_score_gemma":0.0006178118,"teacher_disagreement_score":0.0077530863,"about_ca_system_score_codex":0.00072304346,"about_ca_system_score_gemma":0.00088279304,"threshold_uncertainty_score":0.025936604},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019756980661113883,"score_gpt":0.2289022324656349,"score_spread":0.209145251804521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999801607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5620844,0.00066662324,0.39940652,0.0004957026,0.0004298479,0.00038239008,0.00038659383,0.0009732311,0.035174683],"genre_scores_gemma":[0.7659399,0.00020734244,0.22557256,0.00017296526,0.00005708583,0.00021468614,0.00035224474,0.00009847212,0.0073847296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942917,0.00018264812,0.000043036052,0.00010974759,0.00013321634,0.00010221935],"domain_scores_gemma":[0.9991561,0.00023923653,0.00018539556,0.00017473848,0.000140456,0.00010399331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054738845,0.000520362,0.00039135918,0.0009141681,0.0008902369,0.00057310157,0.0005076542,0.00046543084,0.004744709],"category_scores_gemma":[0.0014373537,0.0003854478,0.00038297768,0.0006199249,0.0006366992,0.00091885705,0.001154157,0.0005870862,0.0011129635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011782667,0.00032486249,0.003976423,0.0005228866,0.00006393165,0.0016665213,0.0011873195,0.010455164,0.19022636,0.5584361,0.0073120943,0.22465008],"study_design_scores_gemma":[0.00047903694,0.003173749,0.0053634993,0.00021781144,0.00017503361,0.0036963488,0.00043230396,0.06676835,0.44502604,0.33965394,0.13475306,0.00026083662],"about_ca_topic_score_codex":0.00021185102,"about_ca_topic_score_gemma":0.00033835712,"teacher_disagreement_score":0.004744709,"about_ca_system_score_codex":0.00044235025,"about_ca_system_score_gemma":0.00055254425,"threshold_uncertainty_score":0.015872657},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01960852151754365,"score_gpt":0.21183499385540264,"score_spread":0.192226472337859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003363815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5841646,0.0005929166,0.39451158,0.00043336116,0.00009188156,0.0001758642,0.00035221834,0.0008306738,0.018846927],"genre_scores_gemma":[0.9165671,0.00009302676,0.08051565,0.00009322926,0.000029228097,0.00008544272,0.00014064382,0.000029423922,0.0024462072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990421,0.00027729498,0.000080940685,0.00019690066,0.00027205065,0.00013073815],"domain_scores_gemma":[0.99651825,0.0009720427,0.0008025867,0.0012244501,0.00036049972,0.00012210084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218816,0.00041365193,0.00045468114,0.00048302513,0.000364662,0.0007982224,0.0007424594,0.0005575346,0.0035660623],"category_scores_gemma":[0.0019553923,0.00027630854,0.00041094903,0.00045334923,0.0006286351,0.0008683301,0.0006531168,0.0005913002,0.0005294477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003035027,0.00026887527,0.0044069244,0.0006122308,0.00020775269,0.0015370087,0.00054352125,0.13384087,0.2704711,0.3913182,0.0034584757,0.19029996],"study_design_scores_gemma":[0.00078213104,0.0019757603,0.0019352116,0.00015475867,0.00020681132,0.002446094,0.00016649211,0.42228338,0.2153647,0.31269234,0.041869782,0.00012258226],"about_ca_topic_score_codex":0.00021473474,"about_ca_topic_score_gemma":0.00043992177,"teacher_disagreement_score":0.0035660623,"about_ca_system_score_codex":0.0004891896,"about_ca_system_score_gemma":0.00045460422,"threshold_uncertainty_score":0.011929631},"labels":[],"label_agreement":null},{"id":"W2003797078","doi":"10.1002/jcd.20123","title":"Weak amicable <i>T</i>‐matrices and Plotkin arrays","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Prime (order theory); Class (philosophy); Prime power; Order (exchange); Orthogonal array; Discrete mathematics; Arithmetic; Statistics; Computer science","score_opus":0.008082513293770173,"score_gpt":0.19165961232274634,"score_spread":0.18357709902897618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003797078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48474017,0.0005905965,0.46313784,0.00044374733,0.00025363525,0.00010273747,0.00022801457,0.0005057393,0.049997494],"genre_scores_gemma":[0.9533765,0.00023684393,0.03705787,0.0001852571,0.0000948937,0.00008084196,0.00011841492,0.00004952961,0.008799946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995647,0.00009180185,0.000026511929,0.00008692819,0.00012822796,0.00010183173],"domain_scores_gemma":[0.999137,0.00019997424,0.00024617385,0.00012914951,0.00017485766,0.000112840185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033942217,0.0004947124,0.00023480336,0.00074448815,0.00047239446,0.0011780978,0.0003030725,0.00049056084,0.0049260156],"category_scores_gemma":[0.0012328688,0.00019494692,0.00031546399,0.0004928678,0.0010341879,0.0010862781,0.00068726076,0.00089435274,0.001069351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034258686,0.00003526303,0.001236722,0.00006521266,0.000017929737,0.00034459025,0.0001843402,0.010308361,0.06996769,0.8847069,0.0017401001,0.031050311],"study_design_scores_gemma":[0.00009573283,0.0007941867,0.0014478839,0.00007291851,0.00002997485,0.001800299,0.00030391928,0.10832665,0.09488984,0.7607279,0.031405255,0.000105374325],"about_ca_topic_score_codex":0.00022152936,"about_ca_topic_score_gemma":0.00024719257,"teacher_disagreement_score":0.0049260156,"about_ca_system_score_codex":0.00037395547,"about_ca_system_score_gemma":0.00034878662,"threshold_uncertainty_score":0.016479194},"labels":[],"label_agreement":null},{"id":"W2004704048","doi":"10.1002/jcd.20255","title":"The spectrum of 2‐idempotent 3‐quasigroups with conjugate invariant subgroups","year":2010,"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Lakehead University","keywords":"Quasigroup; Mathematics; Combinatorics; Idempotence; Invariant (physics); Order (exchange); Ternary operation; Mathematical physics","score_opus":0.007669229664755829,"score_gpt":0.19136397101840294,"score_spread":0.1836947413536471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004704048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91869986,0.00022496225,0.02974693,0.0004742615,0.00017015911,0.000058600508,0.000210617,0.00017684334,0.050237816],"genre_scores_gemma":[0.9866041,0.00009383782,0.0034927246,0.00013476689,0.00012659887,0.00007447604,0.00015421893,0.00005592336,0.009263545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930334,0.00014539858,0.000039139468,0.00009020602,0.0002253524,0.0001964914],"domain_scores_gemma":[0.99933124,0.00017549748,0.00012220834,0.00008530923,0.000124054,0.0001617866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000738985,0.0004629472,0.00040513577,0.001838331,0.0013420231,0.0021755013,0.0003991756,0.0006621299,0.007800809],"category_scores_gemma":[0.0007521244,0.00026238087,0.00065939524,0.0007356138,0.002055042,0.0018891736,0.001325244,0.00063449,0.0011345964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017657319,0.000056941823,0.0003499525,0.00001860491,0.000009739053,0.0002711917,0.0005993205,0.0008805149,0.009329277,0.98172414,0.0008096327,0.0057740486],"study_design_scores_gemma":[0.000121069424,0.00015261177,0.0014999786,0.000023524364,0.000012816264,0.0002616921,0.00037764804,0.009763797,0.00707702,0.9736372,0.007031227,0.000041372507],"about_ca_topic_score_codex":0.0009192677,"about_ca_topic_score_gemma":0.00048585763,"teacher_disagreement_score":0.007800809,"about_ca_system_score_codex":0.0013645646,"about_ca_system_score_gemma":0.00048758098,"threshold_uncertainty_score":0.026096344},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01650254630098339,"score_gpt":0.22735138555871107,"score_spread":0.21084883925772768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008014647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54490536,0.00076024677,0.43009838,0.0011532669,0.00012638171,0.0001040784,0.00032528702,0.00013537447,0.02239161],"genre_scores_gemma":[0.89141953,0.00028148462,0.10192198,0.00022936451,0.00010596421,0.00018925055,0.000308827,0.000051021176,0.005492661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897707,0.0003052988,0.00007269784,0.00025620137,0.00026278326,0.00012601759],"domain_scores_gemma":[0.995497,0.0027179508,0.0004611606,0.00038098183,0.0006156827,0.0003272396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971479,0.0003695731,0.00051491585,0.0014112655,0.001438299,0.0015314486,0.00068617176,0.0010993043,0.004940214],"category_scores_gemma":[0.00682938,0.00065686,0.0007167687,0.0007476571,0.0012590968,0.0033811023,0.001697543,0.0013660638,0.00033288248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030229051,0.000070655595,0.00390474,0.00014998198,0.000028431316,0.00032402616,0.0005118333,0.0030117808,0.016772486,0.9464887,0.0013134407,0.027121592],"study_design_scores_gemma":[0.00015217731,0.00040089883,0.002847043,0.00015600836,0.00008024107,0.0031424835,0.0007900296,0.08089259,0.026273215,0.8594093,0.025762465,0.00009358033],"about_ca_topic_score_codex":0.00012949716,"about_ca_topic_score_gemma":0.0000961653,"teacher_disagreement_score":0.004940214,"about_ca_system_score_codex":0.00095293776,"about_ca_system_score_gemma":0.00036995095,"threshold_uncertainty_score":0.01652664},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Beijing Institute For Brain Disorders","keywords":"Pentagon; Simple (philosophy); Mathematics; Combinatorics; Type (biology); Geometry","score_opus":0.01786100687697741,"score_gpt":0.2316456012462305,"score_spread":0.21378459436925307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008647334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.824471,0.0005429513,0.13044888,0.0002378865,0.000099060366,0.00011404649,0.0002509991,0.00009441757,0.043740816],"genre_scores_gemma":[0.977358,0.00012723659,0.019431308,0.00003426019,0.000027161426,0.000032666278,0.000094943105,0.0000055224955,0.002888826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.00009780447,0.000027274255,0.00006144196,0.00011282461,0.00006772295],"domain_scores_gemma":[0.9990269,0.00022616536,0.00032439572,0.0001438272,0.00015124422,0.00012744984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140961,0.0001915025,0.00028115482,0.00075314863,0.00051894214,0.0006565721,0.00029312624,0.00031402154,0.004051341],"category_scores_gemma":[0.0011608186,0.00022855765,0.0002307046,0.00081176957,0.0006177388,0.00070335955,0.0009217827,0.0003012777,0.00032088754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035547285,0.000075337724,0.0053906157,0.00022813289,0.000051724914,0.00096540403,0.0004633223,0.053504054,0.014232997,0.8757335,0.002746513,0.04625292],"study_design_scores_gemma":[0.00015714984,0.00042862544,0.0044472273,0.000061100465,0.000047700047,0.0018188546,0.00057909894,0.1654434,0.0065243207,0.8034357,0.017006293,0.00005046477],"about_ca_topic_score_codex":0.00028382897,"about_ca_topic_score_gemma":0.0005319065,"teacher_disagreement_score":0.004051341,"about_ca_system_score_codex":0.0003673827,"about_ca_system_score_gemma":0.00022010779,"threshold_uncertainty_score":0.013553023},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016510781878883555,"score_gpt":0.2267145336467825,"score_spread":0.21020375176789896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018363124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6561029,0.00059671135,0.23655404,0.0010092915,0.00020092526,0.00018984545,0.00028218402,0.00021752692,0.10484663],"genre_scores_gemma":[0.9512439,0.00016870968,0.034804,0.00018789648,0.000058621077,0.000078692734,0.00015635062,0.000026525904,0.013275305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993969,0.00014316215,0.000030663443,0.00010051144,0.00019677328,0.00013195926],"domain_scores_gemma":[0.9990207,0.0003546019,0.00017106335,0.0001662463,0.00018446382,0.00010297906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040909275,0.00023608605,0.00031836113,0.0007433061,0.0011335474,0.0012536251,0.00058849406,0.0008822864,0.008998644],"category_scores_gemma":[0.0015921572,0.00027695895,0.00035909723,0.00054837595,0.0010388987,0.0015824678,0.0013143859,0.0012878826,0.0005838252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056803932,0.00002315824,0.00029136456,0.00004704377,0.0000099145545,0.00018353434,0.00028868526,0.0050830804,0.006351318,0.9763179,0.0006256084,0.0107216425],"study_design_scores_gemma":[0.000027658374,0.00008493801,0.00032745194,0.00002541745,0.000007290894,0.0003105668,0.0002794652,0.03679229,0.005394573,0.94762266,0.009102018,0.000025586696],"about_ca_topic_score_codex":0.0005552907,"about_ca_topic_score_gemma":0.0009972284,"teacher_disagreement_score":0.008998644,"about_ca_system_score_codex":0.0004988458,"about_ca_system_score_gemma":0.00045728651,"threshold_uncertainty_score":0.030103445},"labels":[],"label_agreement":null},{"id":"W2029060558","doi":"10.1002/jcd.20143","title":"Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular <i>n</i>‐queens solutions","year":2007,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Latin square; Magic square; Mathematics; Combinatorics; Orthogonal array; Modular design; Diagonal; Construct (python library); Least-squares function approximation; Statistics; Computer science; Geometry; Chemistry","score_opus":0.020036007918038928,"score_gpt":0.21804263491021536,"score_spread":0.19800662699217644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029060558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5625455,0.00013785918,0.3809676,0.00033157953,0.00014922289,0.00019140363,0.00014134798,0.0003511988,0.055184398],"genre_scores_gemma":[0.73198843,0.00009971193,0.25620395,0.00016230161,0.00002280454,0.00012216483,0.00019054969,0.00010221008,0.011107901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974567,0.00007567641,0.000018269735,0.000052579086,0.00006482157,0.000043008684],"domain_scores_gemma":[0.99962175,0.00011536271,0.000073476156,0.00009725666,0.000054845095,0.00003723853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025690356,0.0003418126,0.00026148584,0.00033838936,0.0004803911,0.00042580525,0.00037316862,0.00027490617,0.0056003677],"category_scores_gemma":[0.0011063521,0.00023123951,0.00038347524,0.00031214766,0.0006527375,0.0007197833,0.0013690158,0.000403902,0.0006595665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037484433,0.00018439605,0.0047093243,0.0004226684,0.00007583189,0.00076099986,0.0006454938,0.04677074,0.09082586,0.58557296,0.005999718,0.26365712],"study_design_scores_gemma":[0.00026788883,0.00086466165,0.0032995557,0.00012504098,0.00009832323,0.002066318,0.00086720893,0.25494924,0.14772992,0.5308828,0.058748398,0.00010063206],"about_ca_topic_score_codex":0.0002569278,"about_ca_topic_score_gemma":0.00052974094,"teacher_disagreement_score":0.0056003677,"about_ca_system_score_codex":0.00021345932,"about_ca_system_score_gemma":0.00039652607,"threshold_uncertainty_score":0.018735051},"labels":[],"label_agreement":null},{"id":"W2031150529","doi":"10.1002/jcd.10038","title":"New families of strongly regular graphs","year":2003,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Zero (linguistics); Construct (python library); Discrete mathematics; Computer science; Geometry; Linguistics","score_opus":0.01171215837774376,"score_gpt":0.2047028187216017,"score_spread":0.19299066034385795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031150529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8129024,0.00026744328,0.14757794,0.00042574998,0.000120346835,0.00010697185,0.00018992314,0.0004526608,0.03795666],"genre_scores_gemma":[0.9622689,0.0001451297,0.028496327,0.00011576686,0.00004760791,0.00010890816,0.00026105088,0.00007687768,0.00847942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00022940867,0.000036407484,0.00018920632,0.00025358572,0.00012708199],"domain_scores_gemma":[0.99797136,0.0006723745,0.0003382877,0.00041363886,0.0003638103,0.00024043891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006133903,0.00038911242,0.00039703044,0.0013933384,0.0011957774,0.001171453,0.0007967041,0.00074963825,0.0034097624],"category_scores_gemma":[0.002955769,0.00049326423,0.0005652821,0.00044064978,0.0015365727,0.0013015226,0.0012123482,0.0010243464,0.0003044397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018295781,0.000083180756,0.0035230676,0.000113232134,0.000049543614,0.0010991972,0.0008298486,0.011624994,0.030536616,0.9229418,0.002160148,0.02685535],"study_design_scores_gemma":[0.000095412586,0.0003028853,0.0041622915,0.00007903428,0.00008786342,0.00376762,0.0008178699,0.10274425,0.022126026,0.83389497,0.03183335,0.00008838295],"about_ca_topic_score_codex":0.00023588717,"about_ca_topic_score_gemma":0.0004592175,"teacher_disagreement_score":0.0034097624,"about_ca_system_score_codex":0.00053952873,"about_ca_system_score_gemma":0.00030729218,"threshold_uncertainty_score":0.011406839},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022744075756981605,"score_gpt":0.23509329946316176,"score_spread":0.21234922370618015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043080690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4355928,0.00041683647,0.4717995,0.00052569294,0.00045132881,0.000247126,0.00029531424,0.0015302426,0.08914122],"genre_scores_gemma":[0.88764966,0.00017300982,0.10245489,0.00018231041,0.00009631678,0.00014691934,0.00031377902,0.00015921396,0.008823908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988084,0.0003029981,0.00005878941,0.00020395749,0.00033969857,0.00028618722],"domain_scores_gemma":[0.9986029,0.00041258,0.00020465253,0.00038872394,0.0002219733,0.0001691003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043108687,0.00040249922,0.00042403894,0.0011324713,0.0007959191,0.0011080507,0.0004965175,0.0004667186,0.0049151494],"category_scores_gemma":[0.001717866,0.0002927813,0.00061537686,0.00096746883,0.001162101,0.0009860368,0.0018394907,0.0008848289,0.0009840024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004312245,0.0001240461,0.0023982278,0.00021572567,0.000052738596,0.0007902978,0.0011733596,0.027493088,0.07223331,0.7571414,0.00790001,0.13004658],"study_design_scores_gemma":[0.00015777684,0.00076319,0.0020457844,0.000087448316,0.00009069222,0.0015495574,0.00049761136,0.11928045,0.12620136,0.6302014,0.11903081,0.000093857816],"about_ca_topic_score_codex":0.00047546707,"about_ca_topic_score_gemma":0.000428933,"teacher_disagreement_score":0.0049151494,"about_ca_system_score_codex":0.0005343963,"about_ca_system_score_gemma":0.00048838847,"threshold_uncertainty_score":0.016442835},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.00926922698022215,"score_gpt":0.21362919230506672,"score_spread":0.20435996532484457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043898581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5462817,0.0010032303,0.3596862,0.0022885695,0.000112020025,0.00040744152,0.001000172,0.00036240483,0.08885828],"genre_scores_gemma":[0.8813098,0.00047522777,0.09726671,0.00037996023,0.00008981453,0.0002036183,0.0007000819,0.00010234013,0.019472511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989297,0.0002988975,0.00005038698,0.00019706579,0.00021861073,0.00030536676],"domain_scores_gemma":[0.9968659,0.0021116713,0.00030018395,0.00035379626,0.00017483094,0.00019364724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086962216,0.00042578555,0.0005823378,0.00077396,0.0011710102,0.0015936921,0.0012198641,0.001384086,0.010072342],"category_scores_gemma":[0.004588642,0.00046704191,0.0008683702,0.0006920363,0.0011298438,0.0020761588,0.0010393027,0.0013301617,0.0006219486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062705314,0.00017730078,0.0019057579,0.00028936204,0.00011323531,0.0004973849,0.00060940994,0.081187695,0.009339434,0.7920896,0.013362698,0.099801116],"study_design_scores_gemma":[0.00022414491,0.00010502075,0.00069189735,0.00006679116,0.000047918304,0.00028947176,0.00040123,0.13375728,0.0073072505,0.84291327,0.014140202,0.000055462246],"about_ca_topic_score_codex":0.0056148265,"about_ca_topic_score_gemma":0.0073752203,"teacher_disagreement_score":0.010072342,"about_ca_system_score_codex":0.000879439,"about_ca_system_score_gemma":0.0013107437,"threshold_uncertainty_score":0.03369534},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01703019996916811,"score_gpt":0.21518093293299134,"score_spread":0.19815073296382324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047891102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27542028,0.00041265183,0.69055367,0.00026560636,0.00014140822,0.0002528897,0.0007646213,0.000579667,0.031609207],"genre_scores_gemma":[0.80510026,0.00021345637,0.18458225,0.00013789628,0.000081178296,0.00039602706,0.00058957405,0.000060676815,0.008838695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888366,0.00035040724,0.000115816496,0.00013549272,0.00029625988,0.00021834314],"domain_scores_gemma":[0.99773055,0.0005335414,0.00048084982,0.0004903651,0.00058551074,0.00017911289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013577711,0.00039010932,0.0007618676,0.0005964069,0.00046383907,0.000763309,0.00047446176,0.0003656456,0.0062121246],"category_scores_gemma":[0.0035630881,0.0002876461,0.00030071897,0.00057899556,0.0005414129,0.0010398454,0.00082404906,0.0005357134,0.0013188387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031662553,0.00021639293,0.004656589,0.0004385055,0.000101176665,0.0004196025,0.00041688822,0.06312986,0.08098871,0.59005827,0.005844114,0.25056365],"study_design_scores_gemma":[0.001297899,0.004248157,0.003817811,0.00036454026,0.00018082006,0.0008848176,0.00033908873,0.34552795,0.11994953,0.42036858,0.10287606,0.00014468942],"about_ca_topic_score_codex":0.0005260836,"about_ca_topic_score_gemma":0.00083732174,"teacher_disagreement_score":0.0062121246,"about_ca_system_score_codex":0.00069262984,"about_ca_system_score_gemma":0.00068555016,"threshold_uncertainty_score":0.020781577},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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)","score_opus":0.016396123411637556,"score_gpt":0.2046042192495821,"score_spread":0.18820809583794457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050377717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8007545,0.00069803646,0.15835021,0.00083243323,0.000049161714,0.00007911981,0.00053039234,0.0004136972,0.03829243],"genre_scores_gemma":[0.97561544,0.00022917222,0.021335343,0.00015243495,0.00005791138,0.00017115462,0.00022992681,0.000030619623,0.0021779905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820805,0.00045586,0.00014024379,0.00030245606,0.0005546136,0.00033870758],"domain_scores_gemma":[0.99132663,0.005358332,0.0011318491,0.0009898565,0.0006509898,0.0005423048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643257,0.0005677793,0.000742825,0.0017576991,0.0012401042,0.0018583562,0.00085121876,0.0014064761,0.0053617726],"category_scores_gemma":[0.0069749006,0.0006391086,0.0004907739,0.0008412095,0.001965882,0.0014953641,0.0015788459,0.00107255,0.0009347324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017933928,0.00016692252,0.0039518415,0.00035070057,0.00007748639,0.0008195351,0.00089504366,0.021121107,0.04844556,0.8602243,0.0021441956,0.060009878],"study_design_scores_gemma":[0.00048960483,0.0004569834,0.0019195761,0.00015791146,0.000050865543,0.0015807298,0.0003099299,0.08090668,0.019519173,0.88662976,0.007896093,0.00008266393],"about_ca_topic_score_codex":0.0002348692,"about_ca_topic_score_gemma":0.0001608776,"teacher_disagreement_score":0.0053617726,"about_ca_system_score_codex":0.0007206354,"about_ca_system_score_gemma":0.00052751333,"threshold_uncertainty_score":0.017936885},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007049594916190552,"score_gpt":0.19678227760369268,"score_spread":0.18973268268750212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052666099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62249786,0.0004875412,0.34743938,0.0005600984,0.000059469203,0.00018498395,0.0008124118,0.00041716444,0.027541082],"genre_scores_gemma":[0.8958158,0.00034652406,0.096856155,0.00012583101,0.000039765077,0.00021713965,0.00075294473,0.000084674546,0.0057612853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991387,0.00022745937,0.00004476993,0.00012474648,0.000275354,0.00018895081],"domain_scores_gemma":[0.99547595,0.0026915476,0.0005089547,0.0007309773,0.00037153787,0.00022105318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010103894,0.00045135713,0.0003919949,0.0009079791,0.0015081068,0.0010078378,0.00065393833,0.00082602026,0.0074277017],"category_scores_gemma":[0.004416904,0.00055647193,0.0006342681,0.0010530184,0.0010238098,0.002448886,0.0015485368,0.0010122707,0.00060027716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073198637,0.000213554,0.0062946943,0.00029071196,0.00008141986,0.0007161201,0.0013079948,0.06572625,0.026637474,0.7886557,0.006696789,0.10264739],"study_design_scores_gemma":[0.00013395859,0.0003695989,0.0044464227,0.00010603475,0.000082603816,0.002264597,0.00077027426,0.20180471,0.05113012,0.70850074,0.030236436,0.00015443584],"about_ca_topic_score_codex":0.00052284315,"about_ca_topic_score_gemma":0.0005468013,"teacher_disagreement_score":0.0074277017,"about_ca_system_score_codex":0.0010741032,"about_ca_system_score_gemma":0.0005105041,"threshold_uncertainty_score":0.024848104},"labels":[],"label_agreement":null},{"id":"W2053412048","doi":"10.1002/jcd.20142","title":"Hill‐climbing to Pasch valleys","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isomorphism (crystallography); Mathematics; Combinatorics; Climbing; Hill climbing; Distribution (mathematics); Sample (material); Enumeration; Uniform distribution (continuous); Discrete mathematics; Algorithm; Statistics; Mathematical analysis; Geography","score_opus":0.015663260765045792,"score_gpt":0.23496170549880568,"score_spread":0.2192984447337599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053412048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34520215,0.0005102881,0.6287337,0.0009299079,0.00013914068,0.0005660308,0.000362183,0.0016254083,0.02193116],"genre_scores_gemma":[0.75457996,0.00014396019,0.2367679,0.00057667936,0.000045037483,0.0004974189,0.00073776953,0.0002370073,0.006414292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.00020383649,0.000026454949,0.0001094351,0.00014470363,0.00014617454],"domain_scores_gemma":[0.997922,0.0010007819,0.00014233397,0.00042521022,0.00032301477,0.00018679477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014799887,0.0005933243,0.001489799,0.0014199323,0.0012914754,0.0010024594,0.0017061504,0.0010984951,0.006020288],"category_scores_gemma":[0.005830575,0.0005874979,0.0010913382,0.0007690393,0.0010142975,0.0009852477,0.0016989075,0.0012296442,0.0009365987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042030995,0.0004557125,0.0063868985,0.00023240781,0.00019735804,0.0003362316,0.0006135639,0.7510632,0.0064195227,0.06715268,0.017735219,0.14898685],"study_design_scores_gemma":[0.000054555516,0.00016467506,0.0006807215,0.00002232587,0.00001819153,0.000093157105,0.000115356765,0.9645188,0.00102219,0.029810408,0.0034849315,0.000014671758],"about_ca_topic_score_codex":0.002471706,"about_ca_topic_score_gemma":0.003279242,"teacher_disagreement_score":0.006020288,"about_ca_system_score_codex":0.00080305064,"about_ca_system_score_gemma":0.00079916616,"threshold_uncertainty_score":0.020139813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02016573371690598,"score_gpt":0.24760062650780465,"score_spread":0.22743489279089868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053450537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63199335,0.0011173807,0.31864783,0.00088532973,0.00026258285,0.000092599534,0.00014307177,0.00026464002,0.046593264],"genre_scores_gemma":[0.9303219,0.00043312256,0.06085805,0.00022972055,0.00008990772,0.00006727878,0.00006696946,0.00003095938,0.007902065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944013,0.00020361428,0.000033477427,0.00006013141,0.00016798299,0.00009458952],"domain_scores_gemma":[0.9990646,0.0002748752,0.00020170343,0.00018447719,0.00016350587,0.000110785644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204524,0.00026459433,0.00028266478,0.00079912925,0.0006633356,0.0008547312,0.00025838945,0.00037094826,0.0017006608],"category_scores_gemma":[0.0013761944,0.00023905285,0.00025788049,0.00051449146,0.0015573329,0.0009288546,0.0008370257,0.0006990413,0.00029978092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022136948,0.000065177854,0.0008783902,0.00005161138,0.000011775409,0.00015312115,0.00018744593,0.009348811,0.011879288,0.94229215,0.0010039436,0.033906933],"study_design_scores_gemma":[0.00009618229,0.0003176237,0.0005032786,0.000042056774,0.000015020968,0.0005116738,0.00015584883,0.05590621,0.029136019,0.8994088,0.013852279,0.000055078883],"about_ca_topic_score_codex":0.00031773985,"about_ca_topic_score_gemma":0.0005121927,"teacher_disagreement_score":0.0017006608,"about_ca_system_score_codex":0.00058620836,"about_ca_system_score_gemma":0.0006467051,"threshold_uncertainty_score":0.005689323},"labels":[],"label_agreement":null},{"id":"W2059478281","doi":"10.1002/jcd.20052","title":"Self‐dual codes and the (22,8,4) balanced incomplete block design","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Concordia University","funders":"Beijing Institute For Brain Disorders","keywords":"Combinatorial design; Combinatorics; Mathematics; Row; Block (permutation group theory); Dual (grammatical number); Automorphism; Binary number; Discrete mathematics; Automorphism group; Block design; Matrix (chemical analysis); Orthogonal array; Arithmetic; Computer science; Statistics","score_opus":0.01350705680339325,"score_gpt":0.20963026954122202,"score_spread":0.19612321273782876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059478281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78046775,0.0006515003,0.16677062,0.0006126267,0.00015178,0.00009726349,0.0005993965,0.00017102117,0.050478034],"genre_scores_gemma":[0.9351269,0.00028642095,0.05353691,0.00013071479,0.000033492375,0.000087843335,0.00032383556,0.000021196021,0.010452777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967754,0.000085387146,0.000023236003,0.00003983813,0.000106963096,0.000066964276],"domain_scores_gemma":[0.99935895,0.00019685269,0.0001563152,0.00010938274,0.00013038248,0.000048226935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037396047,0.00019954602,0.00019941285,0.00052278535,0.00046912272,0.0005518921,0.00022737634,0.00034535935,0.004387287],"category_scores_gemma":[0.0012687359,0.00014808326,0.00015358465,0.0003446021,0.00041864798,0.0005469616,0.00047475428,0.00029214445,0.0006322854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006189598,0.00012740942,0.006498922,0.00016346312,0.000035113226,0.00064557523,0.00035673665,0.019998083,0.04119344,0.78678155,0.005867027,0.13771378],"study_design_scores_gemma":[0.00018742564,0.00067098,0.005666724,0.0001600393,0.00008063206,0.0027214922,0.00036082373,0.1537842,0.07073908,0.6712788,0.094252974,0.00009687684],"about_ca_topic_score_codex":0.0004490324,"about_ca_topic_score_gemma":0.0009365286,"teacher_disagreement_score":0.004387287,"about_ca_system_score_codex":0.0003924703,"about_ca_system_score_gemma":0.00041695056,"threshold_uncertainty_score":0.0146769285},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022920587970493445,"score_gpt":0.22988340870295726,"score_spread":0.2069628207324638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060964556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12946498,0.00034696408,0.8469614,0.00020265604,0.00009068076,0.00013422404,0.00014052333,0.0002678644,0.022390723],"genre_scores_gemma":[0.6569799,0.0002826834,0.33313337,0.00019592984,0.00007721118,0.00027892843,0.00021114534,0.000048625618,0.0087922085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985051,0.0005688054,0.000101086,0.00025423855,0.00041473805,0.0001561136],"domain_scores_gemma":[0.99691296,0.0010698793,0.0006216235,0.00072408316,0.000494943,0.00017642774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429987,0.00053137925,0.00037853577,0.00072639826,0.00047753283,0.0009491818,0.00042497818,0.0007138865,0.004164527],"category_scores_gemma":[0.0038300392,0.00035934776,0.00044914157,0.0006330138,0.0013819226,0.0012348426,0.00064503547,0.0008951959,0.0007672485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039535185,0.0000684453,0.0009633179,0.00012212113,0.000030489924,0.00022590774,0.0002149175,0.029982936,0.030908259,0.8603284,0.0015681973,0.07519168],"study_design_scores_gemma":[0.00019502416,0.00091909076,0.0008610312,0.00006428896,0.000036562375,0.0010660042,0.00012480283,0.1607126,0.03847121,0.7750486,0.022419699,0.000080983526],"about_ca_topic_score_codex":0.0003879566,"about_ca_topic_score_gemma":0.00068199506,"teacher_disagreement_score":0.004164527,"about_ca_system_score_codex":0.00071293296,"about_ca_system_score_gemma":0.00060513744,"threshold_uncertainty_score":0.013931692},"labels":[],"label_agreement":null},{"id":"W2063916523","doi":"10.1002/jcd.20130","title":"The spectrum of equitable, 4‐chromatic Steiner quadruple systems","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Hypergraph; Order (exchange); Existential quantification; Set (abstract data type); Spectrum (functional analysis); Discrete mathematics; Computer science; Physics","score_opus":0.009154970012086322,"score_gpt":0.1990968129694868,"score_spread":0.1899418429574005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063916523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492596,0.00023971379,0.027276898,0.00021376983,0.000021872123,0.000023362336,0.00020589044,0.00009120862,0.02266778],"genre_scores_gemma":[0.9925884,0.00010755779,0.0048691337,0.000040400962,0.000014339273,0.00003135428,0.00014029758,0.000014911282,0.0021936568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945265,0.00010471016,0.000037576203,0.00009305123,0.00015228207,0.00015978335],"domain_scores_gemma":[0.99889416,0.00038029603,0.00020976817,0.00015001153,0.00016694698,0.00019883554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000507393,0.00031548744,0.00032077744,0.0016779988,0.0015374442,0.0013413088,0.00051720935,0.0004998613,0.0053364104],"category_scores_gemma":[0.0013284354,0.0003831179,0.00024404425,0.0009829946,0.0012768711,0.0012810109,0.0013898013,0.00039782058,0.00040612862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034772142,0.00007062597,0.004445076,0.00011172142,0.00003537259,0.0005892625,0.0008893955,0.021457424,0.021379482,0.92971134,0.0021105553,0.018851977],"study_design_scores_gemma":[0.0001343554,0.00018818893,0.0036160785,0.000072370654,0.00003855644,0.000983684,0.0009834345,0.07196577,0.011784468,0.89823747,0.011941906,0.000053758587],"about_ca_topic_score_codex":0.0007362268,"about_ca_topic_score_gemma":0.0008675076,"teacher_disagreement_score":0.0053364104,"about_ca_system_score_codex":0.0009166796,"about_ca_system_score_gemma":0.00032273112,"threshold_uncertainty_score":0.017852068},"labels":[],"label_agreement":null},{"id":"W2064625927","doi":"10.1002/jcd.20132","title":"There is no 2‐(22, 8, 4) block design","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Lethbridge; Concordia University","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Block design; Arithmetic","score_opus":0.01326745694562284,"score_gpt":0.203416123957026,"score_spread":0.19014866701140315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064625927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42554384,0.0013317122,0.40275794,0.0027157369,0.0010772584,0.00062598835,0.0010148281,0.0012709559,0.16366176],"genre_scores_gemma":[0.7856817,0.0003053486,0.17468877,0.0010190661,0.00014440893,0.00066041155,0.00069366914,0.00016177261,0.036644857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997924,0.00072934333,0.00015302263,0.0003509494,0.00050034473,0.0003423662],"domain_scores_gemma":[0.99784136,0.00080724835,0.00035240702,0.00041893695,0.00041513916,0.00016480293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110163,0.0006711211,0.000760701,0.0005862463,0.0010913559,0.0013559879,0.00083716173,0.0015405663,0.028234262],"category_scores_gemma":[0.0036721618,0.0005891125,0.0005860075,0.0004475257,0.00081083644,0.001817167,0.0011064643,0.0009332493,0.005576563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030148576,0.0006671515,0.007146973,0.0013937283,0.0003891631,0.0016152074,0.00052108336,0.0334835,0.108265765,0.47709468,0.0269695,0.33943847],"study_design_scores_gemma":[0.0016817439,0.0061070337,0.0036523007,0.0005301526,0.00044448324,0.0037886272,0.00051834295,0.14997597,0.08107272,0.48057106,0.2713681,0.00028958626],"about_ca_topic_score_codex":0.00046221213,"about_ca_topic_score_gemma":0.0009746598,"teacher_disagreement_score":0.028234262,"about_ca_system_score_codex":0.00062558276,"about_ca_system_score_gemma":0.0011708819,"threshold_uncertainty_score":0.09445304},"labels":[],"label_agreement":null},{"id":"W2065282626","doi":"10.1002/jcd.20019","title":"Upper bounds on the general covering number <i>C</i><sub>λ</sub>(<i>v</i>, <i>k</i>, <i>t</i>, <i>m</i>)","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Block (permutation group theory); Lambda; Physics; Mathematical analysis","score_opus":0.011309506145559475,"score_gpt":0.21135197271658804,"score_spread":0.20004246657102856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065282626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5865705,0.0064018886,0.33201212,0.0022394012,0.00016689338,0.00027516606,0.0015711405,0.0015448361,0.069218054],"genre_scores_gemma":[0.9044652,0.0014126817,0.0893629,0.00021809178,0.0002031149,0.00030635,0.0008573043,0.00025233766,0.0029219373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954894,0.001094116,0.00023544057,0.00092201,0.0011571546,0.0011017973],"domain_scores_gemma":[0.9628809,0.026353838,0.0026899183,0.0047023427,0.0011405537,0.002232458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046362244,0.0014157582,0.0017030371,0.0023506025,0.0020607852,0.0038540359,0.002810327,0.0017288686,0.00617833],"category_scores_gemma":[0.024847286,0.0012570746,0.0011733784,0.0027506824,0.0023130872,0.004802525,0.0036152985,0.002418844,0.0010300595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004625967,0.0008568595,0.029000517,0.0013022382,0.0004924995,0.00089588494,0.0011642136,0.37599832,0.07673304,0.3380736,0.022154927,0.14870194],"study_design_scores_gemma":[0.00020596289,0.0006604623,0.011260512,0.0002665185,0.0003532265,0.0022753638,0.0003044763,0.6628151,0.039150875,0.2661149,0.016414281,0.00017840487],"about_ca_topic_score_codex":0.0009942311,"about_ca_topic_score_gemma":0.0017298541,"teacher_disagreement_score":0.00617833,"about_ca_system_score_codex":0.0038924317,"about_ca_system_score_gemma":0.0010107259,"threshold_uncertainty_score":0.028241754},"labels":[],"label_agreement":null},{"id":"W2068073986","doi":"10.1002/jcd.20024","title":"On the maximum number of different ordered pairs of symbols in sets of latin squares","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Latin square; Prime power; Order (exchange); Set (abstract data type); Prime (order theory); Discrete mathematics; Computer science","score_opus":0.018857131427791086,"score_gpt":0.2324954432858922,"score_spread":0.21363831185810112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068073986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8028343,0.001661012,0.18407735,0.0015363606,0.00009098864,0.00012573664,0.00043166545,0.0006886754,0.008553937],"genre_scores_gemma":[0.9096978,0.00047939774,0.087515265,0.00019554634,0.00013525516,0.00013509725,0.000355352,0.00014575379,0.0013405052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927168,0.0036478736,0.00046073797,0.0012137126,0.0012662279,0.00069458975],"domain_scores_gemma":[0.9109154,0.072448395,0.007174338,0.005379836,0.0020663452,0.0020157737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055424115,0.0010983256,0.0022116303,0.0015867423,0.0021708938,0.004063556,0.003216978,0.0019991419,0.0044572176],"category_scores_gemma":[0.04044688,0.0013038104,0.0010536811,0.0022757505,0.0031703927,0.007484508,0.003110225,0.0017595909,0.0006952964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055850917,0.0009028399,0.027333904,0.0013469472,0.00061330607,0.0010444688,0.001111728,0.5676016,0.07577579,0.14428687,0.005743843,0.1686536],"study_design_scores_gemma":[0.00036226117,0.0011588455,0.0049388604,0.00014417424,0.0003296023,0.0022249587,0.000771779,0.75523436,0.0762497,0.1535348,0.0049170586,0.00013359368],"about_ca_topic_score_codex":0.0003300747,"about_ca_topic_score_gemma":0.0005959064,"teacher_disagreement_score":0.0055424115,"about_ca_system_score_codex":0.0016759576,"about_ca_system_score_gemma":0.000899189,"threshold_uncertainty_score":0.029311419},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026660759426930178,"score_gpt":0.21846771219749944,"score_spread":0.19180695277056925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069219864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5575461,0.0009000095,0.42265844,0.0011045081,0.000053885742,0.00030959919,0.0006060458,0.0009020624,0.015919443],"genre_scores_gemma":[0.79947835,0.0006039986,0.19527805,0.00013920666,0.00006887754,0.00021089494,0.0011475311,0.000110805006,0.002962238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983469,0.0005412247,0.00016432069,0.00040623185,0.0003081333,0.0002331829],"domain_scores_gemma":[0.99521977,0.0023349286,0.0007212166,0.0012866484,0.00018202772,0.00025543282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015599048,0.0007079891,0.0009982641,0.0010920251,0.0014653619,0.0033861045,0.0014682302,0.0013613312,0.0037526975],"category_scores_gemma":[0.009602647,0.00049421587,0.0011144446,0.0027334108,0.0014537978,0.0064407256,0.0025109535,0.001184386,0.00051115704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010111977,0.0004439352,0.012540801,0.0006114004,0.00017380067,0.00046874414,0.0017497826,0.115754195,0.012076681,0.5749098,0.007902175,0.27235743],"study_design_scores_gemma":[0.00018672763,0.00024299398,0.0018474543,0.000067023946,0.00008904806,0.0011961861,0.0004989202,0.32731867,0.009101906,0.6501999,0.009206605,0.00004452308],"about_ca_topic_score_codex":0.00041088808,"about_ca_topic_score_gemma":0.00051272317,"teacher_disagreement_score":0.0037526975,"about_ca_system_score_codex":0.0016073762,"about_ca_system_score_gemma":0.0007712499,"threshold_uncertainty_score":0.0125540495},"labels":[],"label_agreement":null},{"id":"W2071186718","doi":"10.1002/jcd.20064","title":"Coloring 4‐cycle systems","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Partition (number theory); Monochromatic color; Integer (computer science); Graph; Order (exchange); Discrete mathematics; Physics; Computer science","score_opus":0.013809098564854424,"score_gpt":0.21316624790662134,"score_spread":0.1993571493417669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071186718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.764636,0.0006097043,0.16449113,0.0003528743,0.00016901855,0.00027838183,0.000441439,0.00035280365,0.068668686],"genre_scores_gemma":[0.9149723,0.0002811561,0.0651107,0.00015905329,0.00003680429,0.00021810697,0.00053433457,0.00008440002,0.018603165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952006,0.000105231484,0.00002309247,0.000088271525,0.00008051399,0.00018277572],"domain_scores_gemma":[0.99943846,0.00012800161,0.000095834504,0.00012463513,0.00013146567,0.00008169205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027788334,0.00041952633,0.00030273836,0.00084028667,0.0011148104,0.0010260894,0.00055888435,0.0004819039,0.009968113],"category_scores_gemma":[0.0007554582,0.0003426707,0.000444327,0.0007295402,0.0008151341,0.0009761536,0.0012680087,0.00045041004,0.0008226599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005836868,0.00016746798,0.0063568447,0.00042795864,0.00011425465,0.0005717617,0.0011976904,0.0816445,0.1007861,0.70978826,0.0108942585,0.08746726],"study_design_scores_gemma":[0.00019507715,0.00036839457,0.0030612762,0.000093256465,0.00006738061,0.00071493717,0.00077601854,0.19749404,0.057872817,0.6437339,0.095513515,0.00010943035],"about_ca_topic_score_codex":0.0024612057,"about_ca_topic_score_gemma":0.004228757,"teacher_disagreement_score":0.009968113,"about_ca_system_score_codex":0.0011072699,"about_ca_system_score_gemma":0.00069939415,"threshold_uncertainty_score":0.033346593},"labels":[],"label_agreement":null},{"id":"W2072012053","doi":"10.1002/jcd.20176","title":"A S(3, {4, 6}, 18) with a subdesign S(3, 4, 8) does not exist","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics","score_opus":0.019203955240580505,"score_gpt":0.22985446570618256,"score_spread":0.21065051046560207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072012053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81433403,0.00024576802,0.15482348,0.0004498706,0.00010745907,0.00035994692,0.0005345711,0.0005627114,0.028582199],"genre_scores_gemma":[0.8946479,0.00006369791,0.098395675,0.00019306339,0.000019928353,0.00024549084,0.00030898757,0.000024705632,0.0061005545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902475,0.00030455063,0.00011355486,0.00025039588,0.00017599667,0.00013073935],"domain_scores_gemma":[0.9974292,0.000661311,0.0005484152,0.0005935782,0.00048600032,0.00028153596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091965,0.0004368671,0.0004373463,0.00040910274,0.00056732004,0.0007581334,0.00039221445,0.00065622275,0.00578032],"category_scores_gemma":[0.0020165567,0.00023139457,0.0003657324,0.000312384,0.0006824206,0.00071260426,0.0005591932,0.00049026165,0.00095527904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010076158,0.0015042841,0.037092146,0.0009563608,0.00035692586,0.0017113662,0.0008062614,0.055630755,0.29077777,0.26486757,0.011941714,0.32427856],"study_design_scores_gemma":[0.0018810349,0.018071227,0.019597726,0.0004227536,0.00057486095,0.005807347,0.0010945606,0.3017387,0.2475448,0.25435403,0.14872853,0.00018439251],"about_ca_topic_score_codex":0.0004237502,"about_ca_topic_score_gemma":0.0012438543,"teacher_disagreement_score":0.00578032,"about_ca_system_score_codex":0.0006137342,"about_ca_system_score_gemma":0.0008725272,"threshold_uncertainty_score":0.019337058},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02602588023385388,"score_gpt":0.24733068587122356,"score_spread":0.22130480563736968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074300802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5867232,0.005021601,0.31922472,0.003524711,0.00078046654,0.00029705578,0.0014248115,0.0013574051,0.081646],"genre_scores_gemma":[0.8987388,0.0013744407,0.08084381,0.00045637184,0.00044474564,0.00045776233,0.0010664397,0.00017526792,0.016442351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99303716,0.0015767713,0.00049683626,0.0009953537,0.0027085708,0.0011853849],"domain_scores_gemma":[0.974151,0.014992067,0.0023470768,0.0044978755,0.0024431818,0.0015687512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036842455,0.0014502069,0.001797539,0.002050525,0.0020451292,0.0036893368,0.0021575359,0.0019288706,0.0129855415],"category_scores_gemma":[0.017678747,0.0010999988,0.0013085266,0.0012715153,0.0025142985,0.005489225,0.0023521183,0.0025174457,0.0021770524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056112255,0.00068945996,0.014150397,0.0013237006,0.0003317037,0.0012037728,0.0007612952,0.12388975,0.084937125,0.5649953,0.01807607,0.1840302],"study_design_scores_gemma":[0.00068900234,0.0011599371,0.0040164515,0.0002643382,0.00023846349,0.0024310453,0.00024278442,0.21189415,0.08279665,0.6613714,0.034666933,0.0002287999],"about_ca_topic_score_codex":0.00060516055,"about_ca_topic_score_gemma":0.00081621256,"teacher_disagreement_score":0.0129855415,"about_ca_system_score_codex":0.0027554412,"about_ca_system_score_gemma":0.0016082771,"threshold_uncertainty_score":0.043440938},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01213506156045652,"score_gpt":0.20925554002383573,"score_spread":0.1971204784633792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075668496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067519434,0.0007840339,0.8028424,0.0010481452,0.0003837956,0.00027129202,0.00031295224,0.00036698073,0.12647094],"genre_scores_gemma":[0.6027462,0.00095649593,0.3642452,0.0006493512,0.0005792913,0.0006145395,0.0005711223,0.0001668286,0.029471003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969574,0.001115735,0.00020127608,0.00046842315,0.00087990856,0.00037720375],"domain_scores_gemma":[0.9975811,0.0010824188,0.00022396327,0.00058240484,0.00039965316,0.00013043657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024518685,0.0006847826,0.0006502985,0.0016787514,0.001579554,0.0030853609,0.0009873775,0.0007239356,0.014736338],"category_scores_gemma":[0.005186046,0.00045781492,0.001279781,0.0015819148,0.0036283715,0.004409276,0.00283689,0.0019319208,0.0024901906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015202777,0.000013957695,0.000045608835,0.000024688408,0.0000036475153,0.000014469123,0.00005314506,0.001607609,0.00035640405,0.9866263,0.00064014853,0.010598681],"study_design_scores_gemma":[0.000014006557,0.000032103337,0.000033379736,0.000018333129,0.000005783019,0.00004086995,0.000027353899,0.008209935,0.0010714231,0.98061943,0.009914228,0.000013138281],"about_ca_topic_score_codex":0.00054372614,"about_ca_topic_score_gemma":0.0008421748,"teacher_disagreement_score":0.014736338,"about_ca_system_score_codex":0.0013603347,"about_ca_system_score_gemma":0.0011559344,"threshold_uncertainty_score":0.04929793},"labels":[],"label_agreement":null},{"id":"W2078909675","doi":"10.1002/jcd.20210","title":"Graphs with the <i>n</i>‐e.c. adjacency property constructed from resolvable designs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Adjacency list; Combinatorics; Adjacency matrix; Affine transformation; Discrete mathematics; Property (philosophy); Extension (predicate logic); Graph; Pure mathematics; Computer science","score_opus":0.014712632749133009,"score_gpt":0.19691762003460528,"score_spread":0.18220498728547227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078909675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4558454,0.0001307757,0.52365273,0.000258907,0.000038609403,0.00008496455,0.0002597344,0.00032290624,0.019405972],"genre_scores_gemma":[0.914323,0.00009248306,0.08243621,0.00009390327,0.000015666434,0.00010750652,0.0002587434,0.000058768655,0.0026136297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992199,0.00026687083,0.00004651494,0.00015502407,0.00020396584,0.00010773552],"domain_scores_gemma":[0.9966742,0.00150294,0.0005862266,0.0008240608,0.00029501706,0.00011752719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056613976,0.00028217607,0.00026228157,0.00062032125,0.0005301686,0.00084757624,0.000589513,0.00054830336,0.00202285],"category_scores_gemma":[0.0025410482,0.00032911066,0.0005187908,0.00054336246,0.0011927878,0.0006344271,0.0006019455,0.0008961397,0.00030998333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002594904,0.00012498834,0.0029985073,0.00013361372,0.000052755684,0.0005363461,0.00025658612,0.103512466,0.05451235,0.79391694,0.0015973656,0.04209855],"study_design_scores_gemma":[0.000113702416,0.0004258554,0.002629834,0.00007457043,0.000086124484,0.0016282337,0.00019580923,0.30809674,0.10386187,0.5672182,0.015583719,0.00008539909],"about_ca_topic_score_codex":0.00036204228,"about_ca_topic_score_gemma":0.00049037265,"teacher_disagreement_score":0.00202285,"about_ca_system_score_codex":0.00055657566,"about_ca_system_score_gemma":0.00043746555,"threshold_uncertainty_score":0.0067671537},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Steiner system; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.015618636098015773,"score_gpt":0.22014537530343356,"score_spread":0.20452673920541778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079936473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80325043,0.00059909926,0.14932916,0.0005125709,0.0001199289,0.000068454094,0.0004379811,0.00021775941,0.045464654],"genre_scores_gemma":[0.97239155,0.000308094,0.021395084,0.000077439276,0.000047515696,0.000043882643,0.00026466616,0.000053792297,0.005417913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938095,0.000149096,0.000022703085,0.000091011665,0.00016040134,0.00019582549],"domain_scores_gemma":[0.99810374,0.00091645,0.0002715011,0.00018661864,0.00030246974,0.00021914818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004820863,0.00035085477,0.0003599977,0.0013319422,0.0013930491,0.0014445742,0.0005118123,0.0006859994,0.0072162384],"category_scores_gemma":[0.002403881,0.00030357164,0.00035094426,0.0019745822,0.00109587,0.0019089316,0.001015553,0.0007324688,0.0005178978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056509586,0.000073560375,0.0042505814,0.00021532178,0.000046807345,0.0005777331,0.00070961996,0.10803992,0.022232704,0.8203203,0.00691192,0.036056366],"study_design_scores_gemma":[0.00009101645,0.00025504016,0.0026270724,0.00008809654,0.000045213004,0.00095368375,0.0007755642,0.38074765,0.015379296,0.5831919,0.015769446,0.00007610992],"about_ca_topic_score_codex":0.00229695,"about_ca_topic_score_gemma":0.0028255899,"teacher_disagreement_score":0.0072162384,"about_ca_system_score_codex":0.001767835,"about_ca_system_score_gemma":0.0006036023,"threshold_uncertainty_score":0.024140716},"labels":[],"label_agreement":null},{"id":"W2080969535","doi":"10.1002/jcd.20284","title":"Geometrical constructions of class-uniformly resolvable structure","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Block (permutation group theory); Construct (python library); Class (philosophy); Block size; Combinatorics; Block design; Variety (cybernetics); Discrete mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.025103032435483303,"score_gpt":0.20433610972306407,"score_spread":0.17923307728758076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080969535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1580922,0.0003462801,0.78478193,0.00027162503,0.000113948896,0.00013075375,0.0005083381,0.0009475126,0.054807376],"genre_scores_gemma":[0.66510785,0.00030849635,0.32046694,0.00015571286,0.000046797068,0.00021981978,0.0007673056,0.00024739222,0.012679709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910223,0.0002170647,0.000056300716,0.00017783236,0.00027164858,0.00017487127],"domain_scores_gemma":[0.99747413,0.0008474005,0.00037280752,0.0007978928,0.00029839083,0.00020942284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126886,0.00054336607,0.00044772838,0.0015533676,0.0012697593,0.0014197681,0.0010479799,0.0006540349,0.0072726924],"category_scores_gemma":[0.0026768835,0.0004914461,0.0007578618,0.0010559673,0.001308027,0.0018032644,0.0018243265,0.0015565293,0.0012906976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075592776,0.00004168642,0.00067176344,0.000093939656,0.0000157588,0.00020571168,0.00029894186,0.014966216,0.011656984,0.93423635,0.0016945823,0.036042646],"study_design_scores_gemma":[0.00007994711,0.00025232873,0.001047132,0.00011160772,0.000043786433,0.001206487,0.00042784138,0.093589425,0.0707641,0.77121526,0.061157353,0.00010471325],"about_ca_topic_score_codex":0.0005795794,"about_ca_topic_score_gemma":0.0009955757,"teacher_disagreement_score":0.0072726924,"about_ca_system_score_codex":0.0010739338,"about_ca_system_score_gemma":0.00065881363,"threshold_uncertainty_score":0.024329603},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.024492949221999766,"score_gpt":0.23080166930600302,"score_spread":0.20630872008400325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081479998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45020807,0.0007530196,0.50910896,0.00054233416,0.00023465912,0.0001582966,0.0007591204,0.0019364761,0.03629919],"genre_scores_gemma":[0.8329303,0.00019623381,0.16151695,0.00021958184,0.00009704083,0.00021821595,0.0005369205,0.00013109704,0.0041536023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796677,0.00061275926,0.00021375604,0.00033125276,0.0005676939,0.0003078116],"domain_scores_gemma":[0.9926051,0.0036448622,0.0010041364,0.0014156029,0.00089316,0.0004371729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077344826,0.0005290529,0.00052629696,0.0010803054,0.00066515943,0.0013760031,0.00068815274,0.0005589171,0.0045712227],"category_scores_gemma":[0.0053752903,0.00040496144,0.0004407119,0.0012925522,0.0006613967,0.0020950842,0.0012342352,0.0006607292,0.0008988497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015064098,0.00017238894,0.009925456,0.00047415643,0.00012351504,0.0016601424,0.00064955594,0.09766234,0.15890086,0.42054278,0.009918951,0.2984634],"study_design_scores_gemma":[0.00015233891,0.00093981135,0.0042307205,0.00016683611,0.00013926046,0.0040655765,0.000397522,0.3965662,0.15437135,0.37844402,0.06036628,0.00016010342],"about_ca_topic_score_codex":0.00016389186,"about_ca_topic_score_gemma":0.00026670206,"teacher_disagreement_score":0.0045712227,"about_ca_system_score_codex":0.00047631015,"about_ca_system_score_gemma":0.00030870573,"threshold_uncertainty_score":0.015292287},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018614123445215187,"score_gpt":0.21668646009965148,"score_spread":0.1980723366544363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085573612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83452666,0.00046170317,0.1450042,0.00028960424,0.000046822424,0.00014210347,0.0003566728,0.00024042398,0.018931733],"genre_scores_gemma":[0.90150833,0.00018642079,0.091706604,0.000058353744,0.000023512312,0.00010036354,0.00041021276,0.00003443863,0.0059717605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998904,0.00031770536,0.000095062605,0.0001280452,0.00036855906,0.00018665395],"domain_scores_gemma":[0.9972474,0.0011826465,0.0006283831,0.00043504435,0.0003591441,0.0001473757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007072105,0.00045502608,0.00042537256,0.0012262635,0.00067796337,0.0012936206,0.0004196383,0.0006380885,0.0033325998],"category_scores_gemma":[0.0033593583,0.000320502,0.000516165,0.001282937,0.0009250578,0.0014230047,0.00069571,0.0005390628,0.0004648952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008018242,0.00030552215,0.011591884,0.0004210172,0.000074079704,0.0013308754,0.00093726924,0.101804495,0.06265375,0.63641596,0.0028179064,0.18084547],"study_design_scores_gemma":[0.00020069725,0.00094907376,0.0038115496,0.00015815136,0.00007240545,0.0024854767,0.000601412,0.2565195,0.07538683,0.637365,0.022309577,0.00014036403],"about_ca_topic_score_codex":0.00045763317,"about_ca_topic_score_gemma":0.0007687272,"teacher_disagreement_score":0.0033325998,"about_ca_system_score_codex":0.0007056429,"about_ca_system_score_gemma":0.00069447455,"threshold_uncertainty_score":0.011148632},"labels":[],"label_agreement":null},{"id":"W2086203055","doi":"10.1002/jcd.20253","title":"New results on GDDs, covering, packing and directable designs with block size 5","year":2010,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Northern British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Block size; Block (permutation group theory); Type (biology); Upper and lower bounds; Extension (predicate logic); Class (philosophy); Discrete mathematics; Computer science","score_opus":0.010785763754290831,"score_gpt":0.20712132106714284,"score_spread":0.19633555731285202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086203055","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51881796,0.0020431024,0.41080573,0.00044549786,0.00021497656,0.00016415009,0.00032595076,0.0005504253,0.06663217],"genre_scores_gemma":[0.8000137,0.000851898,0.18572007,0.00018886696,0.00014298555,0.00015156996,0.00038738607,0.000088850175,0.012454615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999258,0.00019703471,0.00005468321,0.00009323775,0.00027962006,0.00011745502],"domain_scores_gemma":[0.9988331,0.00060743664,0.00018336586,0.00017800587,0.000120243836,0.00007787484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056788995,0.00066870014,0.00054059917,0.00095369894,0.00039326053,0.00079406955,0.0005656209,0.0005656082,0.0049154735],"category_scores_gemma":[0.0023452467,0.00043584386,0.0006407486,0.0008020171,0.0008897285,0.0011523552,0.0007985222,0.0007161574,0.00065818947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044097775,0.00028470167,0.004570505,0.0007045601,0.00009886593,0.0006276039,0.0005050979,0.14778939,0.03857963,0.6112852,0.006220693,0.18889266],"study_design_scores_gemma":[0.00026195723,0.0018261969,0.0032894844,0.00019047491,0.00011835499,0.0016977856,0.00029782462,0.36397606,0.04092282,0.5242614,0.06307712,0.00008047145],"about_ca_topic_score_codex":0.00075575407,"about_ca_topic_score_gemma":0.0010140771,"teacher_disagreement_score":0.0049154735,"about_ca_system_score_codex":0.00081199204,"about_ca_system_score_gemma":0.0004510384,"threshold_uncertainty_score":0.016443908},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.025362088995684495,"score_gpt":0.22952727849013357,"score_spread":0.2041651894944491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086211490","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47750878,0.0011135829,0.46417737,0.0003735373,0.000080339225,0.00020953195,0.0006035323,0.00046319747,0.055470034],"genre_scores_gemma":[0.9028491,0.00035760985,0.091283135,0.00014963716,0.00004695735,0.0001519223,0.00042739886,0.000052683605,0.0046815695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978288,0.0005866287,0.00010128714,0.00043023747,0.00057081087,0.00048209543],"domain_scores_gemma":[0.99007773,0.0051769014,0.0014175756,0.002287646,0.000756412,0.00028360207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017216146,0.0004849961,0.00062576577,0.0011655649,0.0010695389,0.0014166145,0.0012464545,0.0010753302,0.006093122],"category_scores_gemma":[0.0090183625,0.00036579743,0.0007165283,0.00097484456,0.0011765513,0.0017695441,0.000999614,0.0012937536,0.00081506645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004374778,0.0001421006,0.0032592623,0.0002494155,0.00007383403,0.00029045306,0.00026635022,0.049972072,0.020644179,0.8240342,0.0024561551,0.098174475],"study_design_scores_gemma":[0.00017650885,0.0005406566,0.0019837609,0.00013808855,0.00008823073,0.0026355304,0.00029551663,0.25638348,0.070877306,0.6378356,0.028922861,0.00012236652],"about_ca_topic_score_codex":0.0003254818,"about_ca_topic_score_gemma":0.00054508203,"teacher_disagreement_score":0.006093122,"about_ca_system_score_codex":0.0009005119,"about_ca_system_score_gemma":0.00072479364,"threshold_uncertainty_score":0.020383477},"labels":[],"label_agreement":null},{"id":"W2107173441","doi":"10.1002/jcd.20027","title":"Existence of non‐resolvable Steiner triple systems","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Steiner system; Discrete mathematics","score_opus":0.015950432283600536,"score_gpt":0.21961820395871795,"score_spread":0.2036677716751174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107173441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55010104,0.0009853742,0.36482546,0.0006145889,0.00020709504,0.00012793829,0.00048161054,0.00041296816,0.082243934],"genre_scores_gemma":[0.91667473,0.00042300546,0.07017647,0.00012161325,0.000048529117,0.00010250693,0.0006918377,0.00007538051,0.011685924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852175,0.00033447798,0.000102391794,0.00025017126,0.0004909901,0.00030019353],"domain_scores_gemma":[0.99643683,0.0015331679,0.00056761847,0.00061922724,0.00054025074,0.00030288956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084239786,0.00043851958,0.00050544814,0.0012412735,0.0015970492,0.0026594982,0.0009891471,0.0014335951,0.009211324],"category_scores_gemma":[0.0033111696,0.0008052065,0.0007248717,0.0010863391,0.0013692805,0.0025139973,0.00231269,0.0017465367,0.0016614106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010547947,0.000050395716,0.00077039364,0.00014679373,0.000029202956,0.00049673795,0.00048159453,0.0083830645,0.012086959,0.9540809,0.0017965573,0.021572037],"study_design_scores_gemma":[0.00008594931,0.00016605189,0.00069920125,0.000109359484,0.000046182497,0.0013491214,0.0006912507,0.03931106,0.021193398,0.91099733,0.025269557,0.00008159104],"about_ca_topic_score_codex":0.00031296205,"about_ca_topic_score_gemma":0.0006513213,"teacher_disagreement_score":0.009211324,"about_ca_system_score_codex":0.0007825057,"about_ca_system_score_gemma":0.000723203,"threshold_uncertainty_score":0.030814946},"labels":[],"label_agreement":null},{"id":"W2108238762","doi":"10.1002/jcd.20228","title":"Closed trail decompositions of complete equipartite graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.023775411428861366,"score_gpt":0.240176696414461,"score_spread":0.21640128498559963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108238762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6310166,0.00044708786,0.32537004,0.00038913707,0.00010423992,0.0002582368,0.0016464527,0.0003730733,0.040395144],"genre_scores_gemma":[0.9228686,0.00021398439,0.0627668,0.0001386148,0.00003999442,0.00018225874,0.0016583038,0.00008647681,0.012044823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914825,0.0001656945,0.0000661593,0.0001592144,0.000233864,0.00022689196],"domain_scores_gemma":[0.9964148,0.0008577433,0.00063227606,0.0004710068,0.0007810643,0.00084304076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061921333,0.000378919,0.00044910307,0.0017928538,0.0012113722,0.0026335784,0.00071749487,0.0005998445,0.008131563],"category_scores_gemma":[0.0036578667,0.00053358375,0.0005122654,0.0012413634,0.0012020796,0.00237315,0.0011074544,0.0012295757,0.0009053098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007865425,0.00036230692,0.003025013,0.00028130418,0.000072096766,0.00091327704,0.0008407319,0.054559458,0.015730595,0.85764396,0.010235713,0.055548973],"study_design_scores_gemma":[0.00011883332,0.00014898059,0.0013973999,0.000108388784,0.000039954015,0.00048687813,0.0005299793,0.20001121,0.005212356,0.7811481,0.010754422,0.00004358528],"about_ca_topic_score_codex":0.0018075885,"about_ca_topic_score_gemma":0.0026286258,"teacher_disagreement_score":0.008131563,"about_ca_system_score_codex":0.0011051575,"about_ca_system_score_gemma":0.0008177614,"threshold_uncertainty_score":0.027202785},"labels":[],"label_agreement":null},{"id":"W2112800816","doi":"10.1002/jcd.21404","title":"Orthogonally Resolvable Cycle Decompositions","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Discovery Centre; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Lexicographical order; Graph; Vertex (graph theory); Cycle basis; Discrete mathematics; Graph power; Line graph","score_opus":0.00810714327679006,"score_gpt":0.20694116070078067,"score_spread":0.1988340174239906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112800816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64476836,0.0004236352,0.31865752,0.0002316611,0.00006990641,0.00011206085,0.00043001052,0.00028471876,0.035022035],"genre_scores_gemma":[0.90916693,0.00017680836,0.08143579,0.00013352903,0.000029483293,0.000104428516,0.0006823802,0.00006434028,0.008206289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994469,0.00009231505,0.000037313985,0.00012512342,0.00015582674,0.00014249382],"domain_scores_gemma":[0.99896073,0.00022677756,0.00018710016,0.00023344556,0.0002408858,0.00015101081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003415792,0.0002981997,0.0003016778,0.0010231847,0.00069986924,0.0008887575,0.00046983204,0.0003817933,0.0036900067],"category_scores_gemma":[0.0014474797,0.00027026574,0.0004980161,0.00064448826,0.0007239321,0.0009639164,0.001066856,0.00068278034,0.0003668759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023972834,0.00012551305,0.0030924657,0.00014738884,0.000056212513,0.0005762568,0.0004725668,0.016461248,0.040600393,0.8729196,0.0029621802,0.06234643],"study_design_scores_gemma":[0.00007990273,0.00021653445,0.0028261126,0.000113314345,0.000066397406,0.0017152809,0.00076746615,0.14580917,0.042201634,0.76876247,0.037354175,0.00008746222],"about_ca_topic_score_codex":0.00082248624,"about_ca_topic_score_gemma":0.0012311765,"teacher_disagreement_score":0.0036900067,"about_ca_system_score_codex":0.0004715158,"about_ca_system_score_gemma":0.00044378013,"threshold_uncertainty_score":0.012344301},"labels":[],"label_agreement":null},{"id":"W2118518205","doi":"10.1002/jcd.20117","title":"Binary caps with many free pairs of points","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Maximization; Point (geometry); Binary number; Upper and lower bounds; Space (punctuation); Discrete mathematics; Arithmetic; Computer science; Geometry; Mathematical optimization","score_opus":0.007973961774066958,"score_gpt":0.18376682079341125,"score_spread":0.1757928590193443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118518205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35787413,0.0018616968,0.60301185,0.0018922345,0.00026251154,0.00047241486,0.0012321804,0.0005812065,0.032811776],"genre_scores_gemma":[0.89607406,0.0004427395,0.09401756,0.0004983829,0.00032415954,0.000797769,0.0008218003,0.00014044336,0.006883114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98757964,0.0063992464,0.0005687533,0.0023691612,0.0019894973,0.0010937216],"domain_scores_gemma":[0.95587367,0.02559938,0.0059001977,0.007981117,0.0019973859,0.0026482637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071263025,0.0012869965,0.0035247079,0.001898262,0.0031658225,0.0048098145,0.0025661087,0.00220959,0.0106727425],"category_scores_gemma":[0.026384039,0.0015531863,0.0014020109,0.0019179473,0.0047981306,0.0069366083,0.006429479,0.0030482102,0.0014296126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00285594,0.00032171776,0.0064480472,0.00073661836,0.0003003258,0.00079972553,0.0007793017,0.057813156,0.018202798,0.8396938,0.007561637,0.06448699],"study_design_scores_gemma":[0.00039282112,0.0006591628,0.0032285615,0.00017479541,0.0001706644,0.0015069563,0.000524568,0.15571922,0.019990392,0.80087423,0.016602838,0.00015581209],"about_ca_topic_score_codex":0.00027628563,"about_ca_topic_score_gemma":0.00021072185,"teacher_disagreement_score":0.0106727425,"about_ca_system_score_codex":0.0011861258,"about_ca_system_score_gemma":0.0008452869,"threshold_uncertainty_score":0.037687957},"labels":[],"label_agreement":null},{"id":"W2131023786","doi":"10.1002/jcd.1006","title":"More on the existence of small quasimultiples of affine and projective planes of arbitrary order","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Affine transformation; Projective plane; Order (exchange); Projective test; Integer (computer science); Discrete mathematics; Pure mathematics; Geometry; Computer science","score_opus":0.031767186384510225,"score_gpt":0.22858677587691043,"score_spread":0.1968195894924002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131023786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7942616,0.0034874058,0.09782351,0.002534368,0.00022730498,0.000056849167,0.00013344143,0.00011514147,0.101360336],"genre_scores_gemma":[0.98611164,0.0005331442,0.007433352,0.00016050834,0.00009135116,0.000022902983,0.00004612318,0.000017977065,0.0055831387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995316,0.00012219064,0.000021470347,0.00011757764,0.00013301951,0.00007416618],"domain_scores_gemma":[0.9979049,0.001012115,0.00042452448,0.00029643087,0.00015063572,0.00021135215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085978006,0.0005206567,0.0005018653,0.0011276717,0.00105857,0.0016816244,0.00031036453,0.0006217035,0.00989171],"category_scores_gemma":[0.0027644995,0.00031300262,0.0003900717,0.0007327914,0.002111794,0.0035086363,0.0011508419,0.0012781218,0.0004443374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029516322,0.000058261983,0.003249478,0.00011396052,0.000024610179,0.00076035433,0.0004604386,0.0043432447,0.023762798,0.9435415,0.0014961361,0.02189407],"study_design_scores_gemma":[0.00010723415,0.00060803693,0.005599713,0.00013104714,0.00004813192,0.0026479678,0.0009462347,0.02363436,0.032023825,0.9085913,0.025583789,0.00007842889],"about_ca_topic_score_codex":0.00037893653,"about_ca_topic_score_gemma":0.00042663995,"teacher_disagreement_score":0.00989171,"about_ca_system_score_codex":0.00067220454,"about_ca_system_score_gemma":0.00017131049,"threshold_uncertainty_score":0.03309107},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01717917542251244,"score_gpt":0.2250459578724909,"score_spread":0.20786678244997847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131599704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8966674,0.00095787627,0.07203365,0.0006898956,0.00017551439,0.00014049336,0.0004429418,0.00019832152,0.0286939],"genre_scores_gemma":[0.9768034,0.00021112978,0.018834414,0.000101682344,0.000113381204,0.00005062555,0.0004881369,0.000026640442,0.0033704662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978023,0.0004247661,0.00016759419,0.0003235871,0.00087248656,0.00040924555],"domain_scores_gemma":[0.99325824,0.0030883797,0.0011348714,0.001039846,0.0009636498,0.00051488756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014536019,0.0006171912,0.00078805565,0.0041636257,0.0013578229,0.002112213,0.0005427297,0.0009798448,0.005849068],"category_scores_gemma":[0.008508909,0.0003178586,0.00046735274,0.0019767438,0.0019256171,0.0020559025,0.0009362538,0.0012121496,0.00069665944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012287174,0.00030617716,0.017639102,0.00020718329,0.00004517651,0.0009294396,0.0016749364,0.0180271,0.04061517,0.780453,0.0064734994,0.1324005],"study_design_scores_gemma":[0.0001534333,0.0005207052,0.009964576,0.000109217275,0.000022489241,0.0023359589,0.00054496474,0.07529471,0.015403772,0.87343675,0.022101102,0.00011228579],"about_ca_topic_score_codex":0.00089596084,"about_ca_topic_score_gemma":0.0005639529,"teacher_disagreement_score":0.005849068,"about_ca_system_score_codex":0.000849986,"about_ca_system_score_gemma":0.0005626544,"threshold_uncertainty_score":0.019567072},"labels":[],"label_agreement":null},{"id":"W2135235789","doi":"10.1002/jcd.20115","title":"Block designs which are divisible in multiple ways","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Set (abstract data type); Point (geometry); Dual (grammatical number); Arithmetic; Block design; Discrete mathematics; Computer science; Linguistics; Programming language; Geometry","score_opus":0.02620789169931127,"score_gpt":0.2106389366666364,"score_spread":0.18443104496732515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135235789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36219192,0.00044253844,0.57654774,0.0003310631,0.0001962807,0.00035345452,0.00043131315,0.0007914684,0.0587143],"genre_scores_gemma":[0.74162525,0.00027464938,0.23145951,0.0001440575,0.00007713968,0.00038420793,0.000581537,0.00017237989,0.025281174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985812,0.00034028463,0.000098736135,0.00026903074,0.0004322594,0.00027856303],"domain_scores_gemma":[0.9972018,0.00077242585,0.00051940756,0.00093405443,0.00033112607,0.00024127598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092214637,0.0006540845,0.000924689,0.0008911195,0.0007793067,0.0015203448,0.0008582445,0.00070349633,0.008753221],"category_scores_gemma":[0.0021611587,0.0006747391,0.000674769,0.00084154744,0.0012115879,0.0018310569,0.0016852387,0.0011547485,0.0018164521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008241,0.00019935139,0.0013105322,0.00024948956,0.00004870392,0.00053757854,0.00034994716,0.014283714,0.09678726,0.7916761,0.0019753904,0.091757804],"study_design_scores_gemma":[0.0003389857,0.001390174,0.00076343387,0.0001446792,0.00010951372,0.0013699605,0.00018544325,0.055459123,0.15402198,0.72779405,0.058339335,0.00008345248],"about_ca_topic_score_codex":0.00012626636,"about_ca_topic_score_gemma":0.00030773663,"teacher_disagreement_score":0.008753221,"about_ca_system_score_codex":0.00061682664,"about_ca_system_score_gemma":0.00045720435,"threshold_uncertainty_score":0.029282391},"labels":[],"label_agreement":null},{"id":"W2136980365","doi":"10.1002/jcd.21346","title":"From Squashed 6‐Cycles to Steiner Triple Systems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Steiner system","score_opus":0.014087512407547543,"score_gpt":0.21454753748302668,"score_spread":0.20046002507547914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136980365","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85504633,0.00087963307,0.09374934,0.00029721923,0.00014593078,0.000041377705,0.00024299577,0.00016458168,0.04943264],"genre_scores_gemma":[0.9855047,0.00024838888,0.010315547,0.00008631975,0.000040944105,0.000018964953,0.00009908611,0.000020220128,0.0036658177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984,0.000032442404,0.000012154712,0.000031178617,0.00004858343,0.000035532266],"domain_scores_gemma":[0.99970394,0.000090181005,0.00005678383,0.000040062907,0.00006094014,0.000048157533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015680837,0.00026250622,0.00021051039,0.000921481,0.00047010797,0.0008207071,0.00029399106,0.0004836443,0.006656582],"category_scores_gemma":[0.00049924967,0.0001994047,0.00022415632,0.0005291349,0.0007248005,0.0011940565,0.0010157785,0.00054968323,0.0004859584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000798591,0.000028670393,0.00070186425,0.00011312951,0.000011166685,0.0004171997,0.00028491547,0.017475953,0.016374635,0.94563204,0.0015151782,0.017365398],"study_design_scores_gemma":[0.000012909877,0.000077844794,0.00051086466,0.000034831617,0.000004751245,0.00041762018,0.00012431474,0.03235116,0.0046768724,0.95671344,0.0050593964,0.000015896574],"about_ca_topic_score_codex":0.00023701912,"about_ca_topic_score_gemma":0.0003066536,"teacher_disagreement_score":0.006656582,"about_ca_system_score_codex":0.00028583797,"about_ca_system_score_gemma":0.00015643248,"threshold_uncertainty_score":0.022268474},"labels":[],"label_agreement":null},{"id":"W2140709916","doi":"10.1002/jcd.21506","title":"Well‐Balanced Designs for Data Placement","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Abbotsford Veterinary Clinic; University of the Fraser Valley","funders":"Agence Nationale de la Recherche","keywords":"Conjecture; Mathematics; Variance (accounting); Set (abstract data type); Combinatorics; Replication (statistics); Value (mathematics); Server; Expected value; Element (criminal law); File size; Discrete mathematics; Existential quantification; Computer science; Statistics","score_opus":0.13556485426302842,"score_gpt":0.33849804791881555,"score_spread":0.20293319365578713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140709916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047878098,0.0006399607,0.94559735,0.00053016766,0.00008697104,0.00017386257,0.000249011,0.00031073258,0.0045338846],"genre_scores_gemma":[0.5353,0.00085320015,0.45710152,0.00045320851,0.0002084958,0.0007056592,0.00052865845,0.00020156964,0.0046477206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99435693,0.00290323,0.00033868168,0.00080076966,0.0011450048,0.00045529247],"domain_scores_gemma":[0.9776619,0.012307357,0.0036519035,0.0026387516,0.0028244306,0.0009157113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068344628,0.0014867308,0.0012212821,0.0016699608,0.0008021818,0.0021785714,0.0011386219,0.001774773,0.0058158254],"category_scores_gemma":[0.018321764,0.0011713671,0.0007263452,0.0015280078,0.0014006803,0.0038506985,0.0014580138,0.0013017029,0.0013925849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076949626,0.00032104252,0.0032692726,0.0004842999,0.00011939437,0.00023333251,0.0003005679,0.36114988,0.020119384,0.51205844,0.0054878504,0.095687084],"study_design_scores_gemma":[0.00024578322,0.0008979952,0.00079388916,0.00015657589,0.000051569667,0.0004205204,0.00012789946,0.51837915,0.008236006,0.46110103,0.009521892,0.0000677329],"about_ca_topic_score_codex":0.00037924497,"about_ca_topic_score_gemma":0.00047859983,"teacher_disagreement_score":0.0068344628,"about_ca_system_score_codex":0.0016330376,"about_ca_system_score_gemma":0.0011257167,"threshold_uncertainty_score":0.036144495},"labels":[],"label_agreement":null},{"id":"W2150371189","doi":"10.1002/jcd.20232","title":"Embedding partial odd‐cycle systems in systems with orders in all admissible congruence classes","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Mathematics; Embedding; Congruence (geometry); Combinatorics; Order (exchange); Discrete mathematics; Geometry; Computer science","score_opus":0.019975682053149414,"score_gpt":0.2577288350817729,"score_spread":0.2377531530286235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150371189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7596947,0.00028193658,0.19269182,0.00028618643,0.00010388834,0.00012723071,0.00016582577,0.00031996323,0.046328522],"genre_scores_gemma":[0.9725529,0.00010512853,0.021308864,0.000048905913,0.000026155238,0.000057735815,0.00013144639,0.000054390686,0.0057144403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946266,0.000083784056,0.000033350396,0.00011880053,0.00016063398,0.00014078787],"domain_scores_gemma":[0.99920243,0.0001923707,0.00013898741,0.00019523004,0.000137808,0.00013312353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032600347,0.0004306911,0.00032669544,0.00065267127,0.0009503334,0.0016945944,0.00044546844,0.00042849203,0.006197943],"category_scores_gemma":[0.001586922,0.00037578467,0.00036751665,0.00038334148,0.0015811493,0.0018389855,0.0020580315,0.0010604125,0.00065210945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002246275,0.000082596445,0.003059895,0.0001263396,0.000019468971,0.00029901403,0.0010361561,0.0148064485,0.02218721,0.9225187,0.0009907973,0.034648824],"study_design_scores_gemma":[0.00007681479,0.0002507207,0.001783524,0.000089764566,0.00003556949,0.00036476235,0.0008695735,0.09497974,0.031539228,0.8440463,0.025911823,0.000052191204],"about_ca_topic_score_codex":0.0009908638,"about_ca_topic_score_gemma":0.0011094644,"teacher_disagreement_score":0.006197943,"about_ca_system_score_codex":0.00082382874,"about_ca_system_score_gemma":0.00051812467,"threshold_uncertainty_score":0.020734131},"labels":[],"label_agreement":null},{"id":"W2153397321","doi":"10.1002/jcd.20080","title":"On isomorphic factorizations of circulant graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Conjecture; Circulant graph; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01612969014607039,"score_gpt":0.21551202290486426,"score_spread":0.19938233275879388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153397321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82923883,0.0005058741,0.11492074,0.00067220366,0.00018808743,0.00009856106,0.000292397,0.00033125668,0.053752013],"genre_scores_gemma":[0.9776804,0.00020527099,0.015062995,0.0002085841,0.0001486338,0.000040741394,0.0003755638,0.00005959558,0.0062182215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986766,0.00028279363,0.000047226975,0.00030809196,0.0002738048,0.00041143244],"domain_scores_gemma":[0.99803585,0.0007020485,0.0003054621,0.00040197695,0.00025986537,0.00029486057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072025816,0.00054614915,0.000595497,0.0012712931,0.0015397759,0.0019950534,0.00049066276,0.0006962194,0.0080897305],"category_scores_gemma":[0.0035020122,0.00038665088,0.00066763605,0.00076071697,0.0018090844,0.0024856864,0.0011440892,0.00092539104,0.00071397325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033670152,0.00014109454,0.0018483341,0.000078790494,0.000018257693,0.00041614217,0.0007908624,0.006157516,0.00824096,0.9552072,0.004229183,0.022534898],"study_design_scores_gemma":[0.00006001517,0.00012703551,0.001096482,0.00003586028,0.000021979187,0.00057023676,0.0006026524,0.028428437,0.0040593697,0.95614487,0.008817546,0.000035464],"about_ca_topic_score_codex":0.0020204796,"about_ca_topic_score_gemma":0.0023231637,"teacher_disagreement_score":0.0080897305,"about_ca_system_score_codex":0.00096407445,"about_ca_system_score_gemma":0.00044315445,"threshold_uncertainty_score":0.027062833},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Latin square; Combinatorics; Order (exchange); Quasigroup; Orthogonal array; Discrete mathematics; Statistics","score_opus":0.016444570046306017,"score_gpt":0.19053457647846297,"score_spread":0.17409000643215697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154750111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.907395,0.0014292795,0.029607812,0.0005050432,0.00016550445,0.000055478722,0.00023739002,0.00025291325,0.06035165],"genre_scores_gemma":[0.98570895,0.0004230704,0.007353215,0.00007368809,0.0000989242,0.00003063153,0.00016721513,0.000023508752,0.0061208047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00014577809,0.000043450196,0.00016447862,0.00021020652,0.00017138045],"domain_scores_gemma":[0.99703205,0.0015257795,0.00053496344,0.0004014817,0.00021140926,0.00029424814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539102,0.00038608786,0.0003221437,0.0019017961,0.0009568457,0.0019165804,0.00037171997,0.00046518203,0.010417336],"category_scores_gemma":[0.0023428649,0.00019970913,0.00039657974,0.00076913723,0.0030731703,0.0025118543,0.00111495,0.0006234682,0.0007719785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068606733,0.00013250318,0.013734788,0.0002486933,0.000028630635,0.0005983318,0.00084820355,0.0036710456,0.02375107,0.852577,0.0028648747,0.10085886],"study_design_scores_gemma":[0.00007942194,0.00041190808,0.009295457,0.000106537875,0.000049141716,0.002094397,0.00079500483,0.0095241135,0.027406177,0.9082442,0.0419327,0.00006105395],"about_ca_topic_score_codex":0.00036933832,"about_ca_topic_score_gemma":0.00047453278,"teacher_disagreement_score":0.010417336,"about_ca_system_score_codex":0.0006699382,"about_ca_system_score_gemma":0.00036090007,"threshold_uncertainty_score":0.034849465},"labels":[],"label_agreement":null},{"id":"W2154983517","doi":"10.1002/jcd.20203","title":"On the amicability of orthogonal designs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Orthogonal array; Combinatorics; Combinatorial design; Integer (computer science); Order (exchange); Zero (linguistics); Construct (python library); Connection (principal bundle); Space (punctuation); Discrete mathematics; Statistics; Computer science","score_opus":0.022226344966923328,"score_gpt":0.22729121147593112,"score_spread":0.2050648665090078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154983517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2928134,0.0005195176,0.6769064,0.0006065776,0.00016435831,0.00019493217,0.00019635916,0.00026600933,0.028332546],"genre_scores_gemma":[0.83146137,0.00031011814,0.1615571,0.0003088502,0.0001895781,0.00044564012,0.0002000355,0.000054845394,0.005472426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922043,0.0033502893,0.00049942645,0.000965669,0.0023430472,0.00063740567],"domain_scores_gemma":[0.965906,0.02126216,0.0037583245,0.005188726,0.0027421855,0.0011425528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004532879,0.00078414084,0.00088448205,0.002058964,0.0012597836,0.0017869165,0.00090085436,0.0015497693,0.0052914163],"category_scores_gemma":[0.0288904,0.0007216161,0.00089351495,0.0009878281,0.0035312322,0.0026685097,0.003438844,0.002793282,0.00075401075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065439893,0.000102788195,0.0018728372,0.000117164345,0.000051207673,0.00021393214,0.00034129643,0.030467296,0.016331626,0.8966682,0.0009915952,0.052187677],"study_design_scores_gemma":[0.00016549342,0.00080597505,0.00090697146,0.00012813244,0.000036519763,0.0006666288,0.00016944869,0.1285717,0.017059272,0.84324664,0.00814743,0.000095768824],"about_ca_topic_score_codex":0.00023425797,"about_ca_topic_score_gemma":0.00022483229,"teacher_disagreement_score":0.0052914163,"about_ca_system_score_codex":0.00069449935,"about_ca_system_score_gemma":0.0009607981,"threshold_uncertainty_score":0.023972392},"labels":[],"label_agreement":null},{"id":"W2156872656","doi":"10.1002/jcd.20157","title":"Pair covering and other designs with block size 6","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Upper and lower bounds; Prime (order theory); Mathematical analysis","score_opus":0.014569718599967979,"score_gpt":0.21444943629866944,"score_spread":0.19987971769870147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156872656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7576328,0.0011150587,0.21317567,0.00028117272,0.00013272896,0.00015739273,0.00037221707,0.00069227646,0.026440639],"genre_scores_gemma":[0.90757245,0.00020606478,0.08800105,0.00010781429,0.000037505757,0.000154887,0.00022330778,0.000049231414,0.0036475628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991328,0.00027252646,0.00008025622,0.00012910343,0.00018225264,0.0002031111],"domain_scores_gemma":[0.99825186,0.00065734243,0.0004117641,0.000296112,0.00025580867,0.00012713108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073475944,0.00049558486,0.0005329143,0.0010693372,0.0005620758,0.0007086604,0.00056744355,0.0007443236,0.0042573838],"category_scores_gemma":[0.0026692385,0.00037262723,0.00048515556,0.0009030475,0.00043535407,0.0010364106,0.00063522847,0.00044012396,0.00076405425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025627648,0.000776481,0.011765728,0.0007423085,0.00023044711,0.00092115876,0.0007139919,0.225226,0.19282669,0.29217514,0.008381274,0.26367816],"study_design_scores_gemma":[0.0004330404,0.0062645543,0.0070109544,0.0002456861,0.0002219843,0.0025138303,0.00036084943,0.6315552,0.14851095,0.14583124,0.056852076,0.00019969777],"about_ca_topic_score_codex":0.0005425574,"about_ca_topic_score_gemma":0.0008753301,"teacher_disagreement_score":0.0042573838,"about_ca_system_score_codex":0.00079210877,"about_ca_system_score_gemma":0.00045876575,"threshold_uncertainty_score":0.014242351},"labels":[],"label_agreement":null},{"id":"W2158050621","doi":"10.1002/jcd.20249","title":"Hadamard matrices of small order and Yang conjecture","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Hadamard transform; Combinatorics; Hadamard matrix; Order (exchange); Equivalence (formal languages); Hadamard's maximal determinant problem; Equivalence class (music); Class (philosophy); Matrix (chemical analysis); Complex Hadamard matrix; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.008780618604829458,"score_gpt":0.2003418539122833,"score_spread":0.19156123530745384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158050621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8259616,0.0013287568,0.087024786,0.0045822314,0.00048057013,0.000044826433,0.00018737001,0.00031977444,0.08007003],"genre_scores_gemma":[0.98556584,0.00024048724,0.009396794,0.00032365634,0.00016270319,0.000035670455,0.0000907743,0.000022879132,0.004161172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.0002923351,0.00005756469,0.00018993948,0.0003740742,0.00022145902],"domain_scores_gemma":[0.9960621,0.0018619582,0.0005287006,0.000838735,0.0004285053,0.0002799018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014489824,0.00040991255,0.0005916675,0.000921719,0.0014115154,0.0016227963,0.00060440425,0.0010685408,0.0067275255],"category_scores_gemma":[0.007554084,0.00034924294,0.00045198185,0.00070671766,0.0030117962,0.0035168952,0.0015798693,0.0018906092,0.00080201245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002705663,0.000040340852,0.0022193957,0.0000460001,0.000008550659,0.00021900097,0.00035167433,0.006190685,0.0043165344,0.9687519,0.002347009,0.015238469],"study_design_scores_gemma":[0.00004262395,0.00008908818,0.00052541506,0.000021831558,0.000005601581,0.00032492945,0.00018973964,0.020542463,0.004318183,0.9680425,0.0058669425,0.000030569467],"about_ca_topic_score_codex":0.00065412035,"about_ca_topic_score_gemma":0.0004788362,"teacher_disagreement_score":0.0067275255,"about_ca_system_score_codex":0.00083119504,"about_ca_system_score_gemma":0.0007930679,"threshold_uncertainty_score":0.02250576},"labels":[],"label_agreement":null},{"id":"W2159652182","doi":"10.1002/jcd.20280","title":"An existence theory for loopy graph decompositions","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Simple graph; Complement graph; Line graph; Graph power","score_opus":0.03905277402300821,"score_gpt":0.2514002905828278,"score_spread":0.2123475165598196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159652182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12631847,0.0026750693,0.79407007,0.0012345288,0.00012692361,0.00010278361,0.00046957817,0.00047917507,0.074523315],"genre_scores_gemma":[0.7727302,0.0021227745,0.19364294,0.0005977795,0.0003509854,0.0003812233,0.00074884953,0.0001863403,0.029239004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901867,0.00022377475,0.00006242415,0.00026655383,0.00026412736,0.00016444724],"domain_scores_gemma":[0.9958157,0.0026126208,0.0003775091,0.00036941914,0.0005503657,0.0002743814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015320932,0.0005115406,0.00054900046,0.002940136,0.001531856,0.0022343176,0.0008352248,0.0011931116,0.008431268],"category_scores_gemma":[0.005882284,0.0009068496,0.0008759116,0.001762544,0.0026341456,0.005005575,0.0024174259,0.0022357067,0.0011462949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014055484,0.000011345705,0.00020150446,0.00005590851,0.000005091287,0.00003147281,0.00024040941,0.0014423133,0.0004157261,0.9882195,0.00100903,0.008353637],"study_design_scores_gemma":[0.000014517057,0.000032295156,0.00019796715,0.000056241468,0.000016507074,0.00014497116,0.00015369413,0.014387309,0.00068995653,0.97320503,0.011090097,0.000011380886],"about_ca_topic_score_codex":0.00048344774,"about_ca_topic_score_gemma":0.0005090308,"teacher_disagreement_score":0.008431268,"about_ca_system_score_codex":0.0015610757,"about_ca_system_score_gemma":0.0004570736,"threshold_uncertainty_score":0.028205335},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Skew; Combinatorics; Construct (python library); Order (exchange); Mathematical analysis; Computer science; Telecommunications","score_opus":0.017542440485355474,"score_gpt":0.20827647295620788,"score_spread":0.1907340324708524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162400339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86653376,0.00022420209,0.093388155,0.00019780973,0.0001608065,0.00005058771,0.00022787244,0.00015594496,0.039060842],"genre_scores_gemma":[0.96419317,0.000111718284,0.030872602,0.00006667301,0.000037455782,0.00004196841,0.00022291436,0.000019169076,0.0044342936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961275,0.000060822065,0.000020029634,0.000072486764,0.00015974356,0.0000741374],"domain_scores_gemma":[0.9992053,0.00023477526,0.00018163321,0.00012535398,0.00015964541,0.000093352246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554681,0.0004003877,0.00028449218,0.00066724134,0.00072426343,0.0005436492,0.00027418687,0.00033320664,0.005227525],"category_scores_gemma":[0.0011262392,0.000237764,0.000334335,0.00035130058,0.0005862097,0.00064359297,0.00035054202,0.0005363293,0.0007346439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000804549,0.00016905164,0.0068645678,0.0001289356,0.000041330768,0.0007867763,0.00081094116,0.010253462,0.14312288,0.7236352,0.0029227955,0.11045947],"study_design_scores_gemma":[0.00023937774,0.0013900024,0.00920378,0.00008250164,0.00007758283,0.0032451635,0.0008463327,0.06407327,0.26531982,0.5892934,0.06603645,0.0001923498],"about_ca_topic_score_codex":0.00022832112,"about_ca_topic_score_gemma":0.00023409318,"teacher_disagreement_score":0.005227525,"about_ca_system_score_codex":0.00029131921,"about_ca_system_score_gemma":0.0003251998,"threshold_uncertainty_score":0.017487824},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Index (typography); Combinatorics; Computer science","score_opus":0.019847447336637417,"score_gpt":0.2075589500617135,"score_spread":0.18771150272507608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166664532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58289605,0.0026491617,0.37926337,0.0003488194,0.00053094944,0.00014058709,0.00036482196,0.0004392628,0.033367082],"genre_scores_gemma":[0.8484858,0.001149154,0.1353322,0.00021030624,0.0001959879,0.0001377374,0.00058163854,0.00008796868,0.013819046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997137,0.000054990825,0.000024476942,0.000056876244,0.000066871224,0.00008311559],"domain_scores_gemma":[0.99952173,0.00011615049,0.00009138135,0.00007234929,0.00012862807,0.00006970276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004071234,0.00047966652,0.0005236519,0.00088697,0.0009731997,0.0005987552,0.00044822993,0.00044688457,0.003030685],"category_scores_gemma":[0.0013120676,0.00026756214,0.00042520592,0.0006953461,0.0005792105,0.00116395,0.0006787844,0.0005553897,0.00034450277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001868766,0.00018213555,0.0033067872,0.0005969265,0.00010163526,0.0026692294,0.0011531315,0.018771594,0.13107298,0.55701315,0.009839655,0.27342394],"study_design_scores_gemma":[0.0005936267,0.0018335733,0.007334195,0.00027813396,0.0004483013,0.0052975304,0.0010763542,0.25965986,0.22523242,0.36345914,0.1343879,0.000398848],"about_ca_topic_score_codex":0.0008124448,"about_ca_topic_score_gemma":0.0012520304,"teacher_disagreement_score":0.003030685,"about_ca_system_score_codex":0.0005000462,"about_ca_system_score_gemma":0.00032207032,"threshold_uncertainty_score":0.010138631},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01570326075954689,"score_gpt":0.22395823546161986,"score_spread":0.20825497470207296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170886510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7356071,0.0020223137,0.12641206,0.0011587769,0.00077127345,0.00022913225,0.0010591048,0.0004045591,0.13233577],"genre_scores_gemma":[0.96174544,0.00026127367,0.028038623,0.00015845583,0.0001926188,0.00005713355,0.00041427906,0.000030200094,0.009102009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810094,0.00033627098,0.0001635823,0.00033796625,0.000681591,0.00037976197],"domain_scores_gemma":[0.998384,0.00039140118,0.00033601047,0.0003055328,0.0004503574,0.00013271303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068609195,0.0006837917,0.0006914295,0.0017411363,0.0011181073,0.001849055,0.0004204307,0.00089195836,0.010302314],"category_scores_gemma":[0.0026563571,0.00023603093,0.00045579075,0.0010715302,0.0015952376,0.0016099694,0.00070562446,0.0010520522,0.001129705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044054908,0.00009186452,0.0018136924,0.00012460756,0.000020696036,0.000710635,0.0003899155,0.00490714,0.018931413,0.91918254,0.0034318753,0.049955096],"study_design_scores_gemma":[0.000061623614,0.00028781293,0.0017251294,0.00007035698,0.0000143460975,0.0011387788,0.00020050602,0.013899393,0.010986656,0.9466504,0.02488601,0.000079133606],"about_ca_topic_score_codex":0.0005745813,"about_ca_topic_score_gemma":0.0004063222,"teacher_disagreement_score":0.010302314,"about_ca_system_score_codex":0.00056423625,"about_ca_system_score_gemma":0.00056906714,"threshold_uncertainty_score":0.034464657},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01717736666673144,"score_gpt":0.20617833937170646,"score_spread":0.189000972704975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529460726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267389,0.00051246997,0.2652136,0.00040772426,0.00018870074,0.000099905876,0.00041378808,0.00043302792,0.1059919],"genre_scores_gemma":[0.9676875,0.00018601127,0.02240056,0.0000870049,0.00002478027,0.000046843812,0.0001897276,0.000042139876,0.00933542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958545,0.00006985021,0.00002922077,0.00008641866,0.000114537885,0.00011455591],"domain_scores_gemma":[0.9992607,0.00016059632,0.00014922301,0.00012848416,0.00020134092,0.00009959326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027613816,0.00027149168,0.0002683132,0.0006606461,0.0009592354,0.0010482192,0.00022690422,0.00036218308,0.00849875],"category_scores_gemma":[0.0009918857,0.0003177665,0.00032518772,0.000368854,0.001208716,0.0014779895,0.0011683996,0.00064233184,0.0007086364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013557487,0.00003354344,0.0016622287,0.000102898724,0.00001838751,0.00035861123,0.0004988587,0.016119735,0.016262786,0.9392844,0.0022046568,0.023318328],"study_design_scores_gemma":[0.000034704186,0.00022017657,0.0015104334,0.00010326379,0.00002673318,0.0008452966,0.0007464132,0.05229587,0.024700096,0.8711713,0.048290156,0.000055647117],"about_ca_topic_score_codex":0.00084905955,"about_ca_topic_score_gemma":0.0010837369,"teacher_disagreement_score":0.00849875,"about_ca_system_score_codex":0.0005065678,"about_ca_system_score_gemma":0.0006258189,"threshold_uncertainty_score":0.028431177},"labels":[],"label_agreement":null},{"id":"W2550630193","doi":"10.1002/jcd.21525","title":"Constructions for Circulant and Group‐Developed Generalized Weighing Matrices","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Class (philosophy); Combinatorics; Order (exchange); Group (periodic table); Type (biology); Algebra over a field; Pure mathematics; Discrete mathematics; Computer science","score_opus":0.020222413859070133,"score_gpt":0.22747447726784684,"score_spread":0.2072520634087767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550630193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.269698,0.0005391151,0.66216564,0.00046897263,0.0006298862,0.0001907565,0.00018231872,0.0005992882,0.065525934],"genre_scores_gemma":[0.81497604,0.00029938473,0.16546555,0.00034688404,0.00022854951,0.00017340829,0.00018662048,0.00015067351,0.01817286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.00015613566,0.000024897723,0.0000979622,0.00017089001,0.00010157375],"domain_scores_gemma":[0.99935406,0.00014294402,0.00009811178,0.00014843866,0.0001511775,0.00010525657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005499452,0.00056874036,0.0003953141,0.0009393995,0.0007743196,0.0012341583,0.00062451314,0.0007983769,0.003999729],"category_scores_gemma":[0.0013289313,0.0003028556,0.000528222,0.00072644773,0.0010427133,0.0010441025,0.0008939672,0.0010613479,0.0006726041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004546889,0.000025537425,0.00015047488,0.000035509587,0.0000089393125,0.00015916582,0.00011577087,0.0026687488,0.015396473,0.9676204,0.0011107486,0.012662861],"study_design_scores_gemma":[0.000076575736,0.00020530797,0.000492418,0.000044630382,0.000030856358,0.0007111332,0.00011863268,0.055198587,0.027540859,0.8834399,0.03205095,0.00009021106],"about_ca_topic_score_codex":0.0003338614,"about_ca_topic_score_gemma":0.00053154386,"teacher_disagreement_score":0.003999729,"about_ca_system_score_codex":0.0005594179,"about_ca_system_score_gemma":0.0004469891,"threshold_uncertainty_score":0.013380468},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03057987468056145,"score_gpt":0.28325625428563783,"score_spread":0.2526763796050764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562106824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24525622,0.003336294,0.7077196,0.0031471842,0.00022265696,0.0001228009,0.0005412451,0.0011383517,0.03851564],"genre_scores_gemma":[0.9449989,0.0011959103,0.049511537,0.00043187343,0.00040494834,0.00014792822,0.00038760575,0.00023567394,0.002685525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981,0.0005921963,0.00006973164,0.00027327248,0.00071545754,0.00024937783],"domain_scores_gemma":[0.9600228,0.034127414,0.0014736942,0.0022840428,0.0014421607,0.0006500185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563775,0.00070795126,0.00086794415,0.002037815,0.0006399354,0.0017904361,0.0015326688,0.0012554163,0.0038779946],"category_scores_gemma":[0.03600643,0.0005491912,0.0005087856,0.0014736195,0.0020944334,0.004341273,0.0026354566,0.001938037,0.00037600828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061378215,0.0001828924,0.010315642,0.00041389695,0.000100458135,0.0007145584,0.00038737213,0.38506553,0.023878237,0.49739313,0.006813021,0.07412142],"study_design_scores_gemma":[0.000019661156,0.00011029093,0.0013616651,0.00006662069,0.0000304279,0.00045996602,0.000049674487,0.8050611,0.009017863,0.18198305,0.0018086417,0.000031029933],"about_ca_topic_score_codex":0.00040339888,"about_ca_topic_score_gemma":0.00040388945,"teacher_disagreement_score":0.0038779946,"about_ca_system_score_codex":0.0015331022,"about_ca_system_score_gemma":0.0007909694,"threshold_uncertainty_score":0.013558686},"labels":[],"label_agreement":null},{"id":"W2570717844","doi":"10.1002/jcd.21566","title":"Transversals in Latin Arrays with Many Distinct Symbols","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Transversal (combinatorics); Latin square; Row; Transpose; Mathematics; Row and column spaces; Combinatorics; Diagonal; Order (exchange); Computation; Algorithm; Computer science; Geometry; Physics; Mathematical analysis","score_opus":0.019967279226445162,"score_gpt":0.22742522466215115,"score_spread":0.20745794543570598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570717844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7268314,0.00063132506,0.21092004,0.00069086935,0.0003832413,0.00014683626,0.000491899,0.00107156,0.058832813],"genre_scores_gemma":[0.89646316,0.00045795605,0.083040476,0.000569257,0.00010037688,0.0001949566,0.0005495659,0.000354392,0.018269854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861515,0.00029735957,0.00016286067,0.00028925962,0.00028328985,0.00035208414],"domain_scores_gemma":[0.9952909,0.0014438872,0.0011416359,0.0007698506,0.0010576879,0.00029599064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767984,0.0005845254,0.00057289156,0.0008147319,0.001444394,0.0018531943,0.00054336764,0.0007633883,0.011601796],"category_scores_gemma":[0.0038930578,0.00063998817,0.0005966697,0.00075192057,0.0013560742,0.0023302343,0.0017925578,0.0010564236,0.0023623866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017683473,0.00027357088,0.007911304,0.0005945628,0.000110055145,0.0031029398,0.0017440916,0.024795013,0.30711102,0.57475996,0.0068522547,0.07097686],"study_design_scores_gemma":[0.00036403793,0.0025115286,0.0038735399,0.00047536084,0.00022188366,0.008877272,0.004148107,0.13983618,0.31337994,0.44420356,0.081799336,0.00030931848],"about_ca_topic_score_codex":0.00080451975,"about_ca_topic_score_gemma":0.0011279468,"teacher_disagreement_score":0.011601796,"about_ca_system_score_codex":0.00062455866,"about_ca_system_score_gemma":0.0007190258,"threshold_uncertainty_score":0.038811922},"labels":[],"label_agreement":null},{"id":"W2583437275","doi":"10.1002/jcd.21584","title":"Twofold triple systems with cyclic 2‐intersecting Gray codes","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Vertex (graph theory); Gray code; Hamiltonian (control theory); Graph; Hamiltonian path; Complete graph","score_opus":0.01931081608931478,"score_gpt":0.2339449387799443,"score_spread":0.2146341226906295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583437275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73002744,0.00016086729,0.22692007,0.00021717904,0.000093030605,0.00009672065,0.00022560378,0.00029399036,0.041965127],"genre_scores_gemma":[0.97367406,0.00005090787,0.022833709,0.00006473423,0.000013934623,0.000077203535,0.00011651884,0.000024160503,0.0031447217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995258,0.00011040014,0.000032862234,0.00007774786,0.00013604506,0.00011717711],"domain_scores_gemma":[0.99916244,0.00022767897,0.00014873892,0.0001754327,0.00014716723,0.00013845335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875696,0.00031235605,0.00034363466,0.0007216666,0.00080718315,0.0009165791,0.0003777544,0.0005163446,0.008126058],"category_scores_gemma":[0.0010438696,0.0002376695,0.0003485928,0.00048095032,0.0007874716,0.0009411142,0.0009913004,0.00061442395,0.00047243253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029041627,0.00010843931,0.002011505,0.000103922095,0.00003655329,0.00043368049,0.00020271653,0.05744219,0.040459905,0.8716204,0.001929538,0.02536073],"study_design_scores_gemma":[0.000089559675,0.00042830483,0.0017457772,0.000054630324,0.000042357722,0.0006500843,0.00033874012,0.3890892,0.041134227,0.555098,0.011258999,0.00007008193],"about_ca_topic_score_codex":0.0006659717,"about_ca_topic_score_gemma":0.00085300865,"teacher_disagreement_score":0.008126058,"about_ca_system_score_codex":0.0006477195,"about_ca_system_score_gemma":0.00051794446,"threshold_uncertainty_score":0.027184367},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07791015228074148,"score_gpt":0.32123829879430965,"score_spread":0.24332814651356816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592616259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45835665,0.0015081648,0.4512109,0.0011069161,0.00020658635,0.0004156668,0.0013874228,0.0013195728,0.08448808],"genre_scores_gemma":[0.8996024,0.00036737334,0.082365856,0.0002424293,0.00017733987,0.00028299208,0.0007916613,0.00014728867,0.016022544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774075,0.00045987943,0.00015056426,0.0006746915,0.0006045266,0.0003695256],"domain_scores_gemma":[0.9894503,0.0055363397,0.0012776996,0.0018957118,0.001171085,0.0006688831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018719041,0.00076264486,0.0011279806,0.0020421573,0.0018808282,0.0027306618,0.0015496403,0.001035146,0.014965632],"category_scores_gemma":[0.009057601,0.0006999302,0.00067373767,0.0013432257,0.0027087978,0.005171358,0.002975099,0.0017024641,0.0015290778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003323342,0.000074335185,0.0014882152,0.00022445036,0.00005025637,0.00021639222,0.0004006224,0.033392858,0.011261039,0.9180818,0.00635039,0.028127344],"study_design_scores_gemma":[0.0000701558,0.00017381256,0.0010962634,0.00006610948,0.000044051096,0.000553487,0.00020606018,0.12049773,0.010937963,0.84856325,0.017739583,0.000051497413],"about_ca_topic_score_codex":0.0008524488,"about_ca_topic_score_gemma":0.0010361696,"teacher_disagreement_score":0.014965632,"about_ca_system_score_codex":0.001765383,"about_ca_system_score_gemma":0.000812674,"threshold_uncertainty_score":0.05006498},"labels":[],"label_agreement":null},{"id":"W2735586407","doi":"10.1002/jcd.21656","title":"On the honeymoon Oberwolfach problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Honeymoon; Computer science; Philosophy; Linguistics","score_opus":0.05087011902851744,"score_gpt":0.277660496589167,"score_spread":0.2267903775606496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735586407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49509275,0.0017227308,0.3273027,0.027852053,0.0005036468,0.0008870489,0.0026805813,0.0007452353,0.14321315],"genre_scores_gemma":[0.82841957,0.0010892104,0.123237394,0.002878781,0.00037922326,0.00064128113,0.0022342969,0.00020031515,0.040919922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965616,0.0015965059,0.00014476919,0.00058434333,0.0005544629,0.0005582736],"domain_scores_gemma":[0.98677737,0.009809126,0.0008232426,0.0013279609,0.00059902825,0.0006634035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002645539,0.0007060866,0.0010323613,0.0011179859,0.0024287167,0.0026266212,0.0018685991,0.003563171,0.020623285],"category_scores_gemma":[0.016585112,0.00064262276,0.00083489536,0.0020515898,0.002783477,0.006383658,0.0024644965,0.0023978576,0.0015921807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041216606,0.00033252285,0.0029644165,0.00030410138,0.000067053275,0.0003682409,0.00061771396,0.031056304,0.0009507366,0.7826542,0.062180143,0.1180923],"study_design_scores_gemma":[0.00020098827,0.00008554531,0.0008768682,0.00010531871,0.000027214348,0.00038156152,0.000629007,0.11447626,0.0013283798,0.8573489,0.02449396,0.000045944344],"about_ca_topic_score_codex":0.0053223283,"about_ca_topic_score_gemma":0.004000187,"teacher_disagreement_score":0.020623285,"about_ca_system_score_codex":0.0023147264,"about_ca_system_score_gemma":0.0020248024,"threshold_uncertainty_score":0.06899178},"labels":[],"label_agreement":null},{"id":"W2749856437","doi":"10.1002/jcd.21636","title":"Linking systems of difference sets","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Abelian group; Constructive; Group (periodic table); Connection (principal bundle); Argument (complex analysis); Difference set; Set (abstract data type); Projection (relational algebra); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.028635667905442762,"score_gpt":0.24508546527669758,"score_spread":0.21644979737125483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749856437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47803646,0.00040196217,0.4398403,0.0005677564,0.0003679139,0.00015344152,0.00036008348,0.0005484502,0.0797236],"genre_scores_gemma":[0.90646356,0.00018106883,0.077919304,0.00032768823,0.00014851763,0.00016694766,0.00042077727,0.00011402302,0.01425817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986632,0.00035791783,0.00009012416,0.0003515173,0.00033836925,0.00019888762],"domain_scores_gemma":[0.99794346,0.0008411402,0.00025741357,0.0003932818,0.00032314617,0.00024150839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061791,0.00034763452,0.00034138243,0.001839734,0.0013952147,0.0019801974,0.00064531335,0.00068016595,0.010091916],"category_scores_gemma":[0.00260961,0.00042098152,0.0006057742,0.0009426573,0.0019796358,0.0030519613,0.0029505584,0.0012496642,0.0012665343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023304556,0.000020810056,0.0005051407,0.000033191132,0.0000075535177,0.00007484332,0.00023547163,0.0016301929,0.004133125,0.98322314,0.0006181984,0.009494926],"study_design_scores_gemma":[0.0000222053,0.000079114645,0.0005984749,0.000029453879,0.000014697818,0.00028564004,0.00020154138,0.011172643,0.009003184,0.95881695,0.019741567,0.00003449736],"about_ca_topic_score_codex":0.000197682,"about_ca_topic_score_gemma":0.00020915613,"teacher_disagreement_score":0.010091916,"about_ca_system_score_codex":0.0008366418,"about_ca_system_score_gemma":0.00036421887,"threshold_uncertainty_score":0.033760846},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01419316015051537,"score_gpt":0.21104339872923655,"score_spread":0.1968502385787212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761333931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56770915,0.001885866,0.33403882,0.0048844926,0.00029572807,0.00048685804,0.0019855748,0.00044583564,0.08826768],"genre_scores_gemma":[0.8574541,0.0015770172,0.117927045,0.0007847427,0.00029497434,0.00030514665,0.0015619665,0.00016466531,0.019930262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990963,0.00029271346,0.00003999276,0.00016946222,0.00013012561,0.00027132384],"domain_scores_gemma":[0.99675316,0.0022404613,0.00029094727,0.00024405096,0.00021040655,0.0002608925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009345285,0.0007295499,0.00086571,0.0007365065,0.0013137946,0.0018180297,0.001148284,0.0014759108,0.0113195265],"category_scores_gemma":[0.0058303815,0.00053316,0.00059444766,0.0010074438,0.0013180018,0.004267904,0.0014403057,0.001327796,0.0009385782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081650005,0.00027048477,0.0016075103,0.0005029711,0.00007481476,0.00065067824,0.00063011254,0.11339103,0.0056566396,0.77701926,0.027879925,0.07150008],"study_design_scores_gemma":[0.000150731,0.00010680154,0.00041756115,0.00008776747,0.000029314791,0.00021588293,0.00035563728,0.16082509,0.0019678397,0.8263129,0.0094818,0.00004867951],"about_ca_topic_score_codex":0.0065449644,"about_ca_topic_score_gemma":0.0068383254,"teacher_disagreement_score":0.0113195265,"about_ca_system_score_codex":0.0014459712,"about_ca_system_score_gemma":0.0013950432,"threshold_uncertainty_score":0.037867546},"labels":[],"label_agreement":null},{"id":"W2800602737","doi":"10.1002/jcd.21633","title":"Strong Skolem starters","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Interpretation (philosophy); Construct (python library); Class (philosophy); Mathematics; Combinatorics; Computer science; Artificial intelligence; Programming language","score_opus":0.023758266210428234,"score_gpt":0.23985008275366695,"score_spread":0.21609181654323872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800602737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6155508,0.0006062795,0.29725856,0.0004496723,0.00019726009,0.00011499694,0.00042345535,0.000836933,0.08456209],"genre_scores_gemma":[0.92846334,0.00021406922,0.0401499,0.00020080621,0.00011938188,0.00010222469,0.0004991031,0.00015012293,0.030101005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993192,0.00014397097,0.000041501262,0.00018025917,0.00018430947,0.00013082703],"domain_scores_gemma":[0.9980817,0.00071072247,0.00031093127,0.00032571334,0.00034279897,0.00022823097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053573895,0.00047989175,0.0005040214,0.001561979,0.0011638092,0.0016525066,0.0005761629,0.0007695818,0.01040689],"category_scores_gemma":[0.0018864953,0.00032220542,0.0005917061,0.0006570948,0.0020136626,0.0024065548,0.0016195371,0.0012814538,0.0025959897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012451988,0.000035682446,0.0010261635,0.00007353577,0.0000133277335,0.00035629777,0.00033511914,0.002189492,0.0078450795,0.9776522,0.0011976403,0.009150894],"study_design_scores_gemma":[0.000039881153,0.00020979755,0.00085651584,0.000071684415,0.00002707178,0.0008897025,0.00039089817,0.013532877,0.015518338,0.94169015,0.026721992,0.000051032563],"about_ca_topic_score_codex":0.00011951604,"about_ca_topic_score_gemma":0.00018532203,"teacher_disagreement_score":0.01040689,"about_ca_system_score_codex":0.0004473003,"about_ca_system_score_gemma":0.00028442437,"threshold_uncertainty_score":0.034814477},"labels":[],"label_agreement":null},{"id":"W2892600074","doi":"10.1002/jcd.21792","title":"Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Security Agency","keywords":"Combinatorics; Matching (statistics); Mathematics; Multigraph; Variable (mathematics); Vertex (graph theory); Graph; Mathematical analysis","score_opus":0.02493946873722629,"score_gpt":0.24319524863859657,"score_spread":0.21825577990137027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892600074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22812212,0.0003618105,0.7501917,0.00018804104,0.000053124346,0.00014719069,0.00030910288,0.00029313262,0.020333873],"genre_scores_gemma":[0.63641065,0.00042964777,0.35048366,0.00020422746,0.00003754804,0.0002165823,0.000754574,0.0001271007,0.0113361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996381,0.00006837356,0.000022061564,0.0000917566,0.00008728789,0.000092470174],"domain_scores_gemma":[0.99931514,0.00015416776,0.00013317917,0.00021610229,0.000085312975,0.00009617221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003381762,0.0005690367,0.000309484,0.000977464,0.0006261121,0.00086405233,0.000460266,0.0004118071,0.003833294],"category_scores_gemma":[0.00092301355,0.00049146014,0.0008628277,0.0005229277,0.0006812019,0.0015496492,0.0012452885,0.0013177991,0.0004989878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027424528,0.00017370746,0.0016739421,0.00030889895,0.000080717706,0.00075258606,0.000989544,0.08123611,0.1081973,0.689193,0.00497911,0.1121408],"study_design_scores_gemma":[0.00007596338,0.00020421133,0.0022473007,0.00014192477,0.00006782152,0.00081242825,0.00055273785,0.2579686,0.051222187,0.6546737,0.031940553,0.00009258661],"about_ca_topic_score_codex":0.0010914017,"about_ca_topic_score_gemma":0.0018991802,"teacher_disagreement_score":0.003833294,"about_ca_system_score_codex":0.0004700838,"about_ca_system_score_gemma":0.00035296296,"threshold_uncertainty_score":0.012823641},"labels":[],"label_agreement":null},{"id":"W2896470915","doi":"10.1002/jcd.21653","title":"A perfect one‐factorisation of","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Perfect graph theorem; Trivially perfect graph; Perfect power; Perfect graph; Strong perfect graph theorem; Graph; Decomposition","score_opus":0.014672431757413994,"score_gpt":0.20391971557685762,"score_spread":0.1892472838194436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896470915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54404145,0.0012159122,0.310664,0.0021115323,0.00060544343,0.00018062461,0.0011716732,0.001237314,0.13877207],"genre_scores_gemma":[0.97245413,0.00021829817,0.016821144,0.00027045605,0.00008971165,0.0000345303,0.00039643722,0.00008058943,0.009634642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986828,0.00016788514,0.00005955864,0.00050119456,0.00023236724,0.00035625786],"domain_scores_gemma":[0.9981014,0.00039799546,0.00023872,0.0007016434,0.00036205465,0.00019827667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006878741,0.00045669754,0.0006250413,0.0006797483,0.0012255581,0.0019607104,0.0006486455,0.0006440406,0.009787059],"category_scores_gemma":[0.0033065244,0.00043018252,0.00079943275,0.00060248334,0.0027147855,0.0027134859,0.0015201147,0.0014141026,0.0015383096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042464727,0.00006339544,0.0013465532,0.0001257131,0.000042763204,0.00025684264,0.00040561243,0.0048024883,0.011476536,0.9425936,0.0063780523,0.032083787],"study_design_scores_gemma":[0.00006596815,0.00017263599,0.0008866819,0.000082733604,0.000049236645,0.0005089135,0.00023149415,0.010702777,0.015661811,0.93757695,0.034014773,0.000045972098],"about_ca_topic_score_codex":0.0017302223,"about_ca_topic_score_gemma":0.0011569919,"teacher_disagreement_score":0.009787059,"about_ca_system_score_codex":0.0009567829,"about_ca_system_score_gemma":0.00082599977,"threshold_uncertainty_score":0.03274095},"labels":[],"label_agreement":null},{"id":"W2910395593","doi":"10.1002/jcd.21645","title":"On the spouse‐loving variant of the Oberwolfach problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Disjoint union (topology); Spouse; Decomposition; Order (exchange); Graph; Discrete mathematics; Law; Chemistry","score_opus":0.010110573656766993,"score_gpt":0.18287924003979242,"score_spread":0.17276866638302543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910395593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71655595,0.0004799801,0.1678727,0.0040717693,0.00018544967,0.00034458208,0.0016568705,0.0002983557,0.108534366],"genre_scores_gemma":[0.9378961,0.00057308126,0.038690012,0.00046566862,0.00019496583,0.00014047296,0.001769867,0.0000758787,0.020193908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895906,0.00034063618,0.00004567735,0.00021844127,0.0001671329,0.0002690476],"domain_scores_gemma":[0.99737954,0.0014904361,0.00028627564,0.00039572138,0.00016938784,0.000278557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583732,0.00058827957,0.00084239466,0.00076816516,0.0017224378,0.0024038453,0.0012720725,0.0015737743,0.01772434],"category_scores_gemma":[0.004826333,0.00040940996,0.0005093684,0.0013531697,0.0015972576,0.004787391,0.0022767934,0.0013669007,0.0011998169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003898366,0.0002981687,0.002262766,0.00019067769,0.00005597137,0.0005655987,0.0007611663,0.028934699,0.001769276,0.89501226,0.024322601,0.04543692],"study_design_scores_gemma":[0.00016050221,0.000083490486,0.00088872376,0.000044945944,0.00003648953,0.00040800314,0.0008828935,0.0781471,0.0018322908,0.90202475,0.01545905,0.00003187421],"about_ca_topic_score_codex":0.0035163858,"about_ca_topic_score_gemma":0.00318469,"teacher_disagreement_score":0.01772434,"about_ca_system_score_codex":0.00091527094,"about_ca_system_score_gemma":0.0009217625,"threshold_uncertainty_score":0.059293807},"labels":[],"label_agreement":null},{"id":"W2911181738","doi":"10.1002/jcd.21671","title":"On the structure of small strength‐2 covering arrays","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Alphabet; Mathematics; Conjecture; Constructive; Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03640273383186182,"score_gpt":0.24397679166309294,"score_spread":0.20757405783123112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911181738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71271735,0.00056489964,0.25912648,0.00061488745,0.00006979715,0.000090012596,0.00075479865,0.00046462813,0.025597107],"genre_scores_gemma":[0.96470934,0.00020378028,0.030758778,0.0001624159,0.00007439688,0.0001263534,0.00053296017,0.00008805642,0.0033437498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904937,0.00024797735,0.00006504224,0.000168835,0.00027811588,0.00019065815],"domain_scores_gemma":[0.99329007,0.0041070017,0.00096115854,0.00064169086,0.00064014207,0.00035996764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055478705,0.00037611477,0.000531222,0.0009814383,0.0006151273,0.0014881196,0.00059147604,0.0007099271,0.0047896565],"category_scores_gemma":[0.0064321547,0.00048553172,0.00027748386,0.0011692317,0.00096334494,0.0017164064,0.0011910655,0.00067537476,0.0006402703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065680634,0.00013899837,0.0083599975,0.00032888126,0.000065687615,0.00095858035,0.00073704886,0.2040125,0.0821419,0.61563337,0.0076818075,0.07928436],"study_design_scores_gemma":[0.00007179819,0.00027630862,0.0030415393,0.000059273774,0.000030776413,0.00087612204,0.00026590086,0.42250276,0.029527035,0.53057235,0.012716596,0.000059554422],"about_ca_topic_score_codex":0.0002932221,"about_ca_topic_score_gemma":0.0002668249,"teacher_disagreement_score":0.0047896565,"about_ca_system_score_codex":0.00048927986,"about_ca_system_score_gemma":0.000345939,"threshold_uncertainty_score":0.01602298},"labels":[],"label_agreement":null},{"id":"W2945057858","doi":"10.1002/jcd.21688","title":"Cyclic cycle systems of the complete multipartite graph","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Multipartite; Graph; Mathematics; Combinatorics; Complete graph; Discrete mathematics; Physics; Quantum; Quantum mechanics","score_opus":0.024455040743029136,"score_gpt":0.22575083174653895,"score_spread":0.2012957910035098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945057858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75690985,0.0007625076,0.21247639,0.0005910809,0.00008447997,0.00011365616,0.0005055848,0.00016988859,0.028386539],"genre_scores_gemma":[0.9694885,0.00018242092,0.025160408,0.00008430687,0.000028347113,0.000089434645,0.00031037323,0.000027114605,0.004629133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964046,0.00009516318,0.000014730078,0.00008110147,0.000086822176,0.000081632235],"domain_scores_gemma":[0.998678,0.0005352263,0.00020476768,0.00016909947,0.00022360204,0.00018927768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038191362,0.00029668232,0.00032467008,0.0010774487,0.00073343585,0.0009972625,0.00044275858,0.0006654381,0.005493548],"category_scores_gemma":[0.0019211109,0.00041755493,0.0003001647,0.00059474685,0.00093476754,0.0011682003,0.0008032745,0.0006909404,0.00030394984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016948639,0.00006708711,0.0020192566,0.00017237588,0.000037955113,0.00035845707,0.00037924014,0.057030708,0.02035494,0.898213,0.0029980673,0.018199375],"study_design_scores_gemma":[0.000056341385,0.00012912806,0.0017093675,0.00008141163,0.00002898185,0.00056035875,0.0003923883,0.3465176,0.011747586,0.62764424,0.011087959,0.000044581568],"about_ca_topic_score_codex":0.0011064586,"about_ca_topic_score_gemma":0.0011018079,"teacher_disagreement_score":0.005493548,"about_ca_system_score_codex":0.00054675544,"about_ca_system_score_gemma":0.0004407867,"threshold_uncertainty_score":0.01837778},"labels":[],"label_agreement":null},{"id":"W2949136445","doi":"10.1002/jcd.21302","title":"New Results on D‐Optimal Matrices","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Construct (python library); Matrix (chemical analysis); Matrix analysis; Order (exchange); Algebra over a field","score_opus":0.026848153183403035,"score_gpt":0.2711175042299427,"score_spread":0.24426935104653966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949136445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32276478,0.001195484,0.5537001,0.0012577006,0.0006765695,0.00013150393,0.0005615703,0.000505682,0.11920659],"genre_scores_gemma":[0.84566087,0.0004930835,0.1417739,0.00068023853,0.00020009678,0.00011603786,0.0004572924,0.00011755031,0.010500962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992943,0.00015929795,0.000042899126,0.00011629185,0.00029597885,0.00009120585],"domain_scores_gemma":[0.9985977,0.0006161866,0.00014039704,0.00025235774,0.0002183439,0.00017514003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007641733,0.0006243527,0.00047943043,0.0010893549,0.00054639106,0.0012345909,0.0007203827,0.0005281699,0.008941305],"category_scores_gemma":[0.0030765089,0.00038127517,0.0003767203,0.0006296545,0.0013514792,0.0013567118,0.0013047869,0.0014929163,0.00090044114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018875903,0.000089439556,0.0005984781,0.00016571855,0.000013870443,0.00007042474,0.00009242672,0.017085452,0.0126342,0.9348735,0.0032568185,0.030930819],"study_design_scores_gemma":[0.000107275504,0.00022308614,0.0005044277,0.000059864724,0.000015273345,0.00022184057,0.00008341648,0.09939229,0.015337795,0.86761767,0.016399253,0.000037779184],"about_ca_topic_score_codex":0.0002795956,"about_ca_topic_score_gemma":0.00044233145,"teacher_disagreement_score":0.008941305,"about_ca_system_score_codex":0.0008313428,"about_ca_system_score_gemma":0.00062827993,"threshold_uncertainty_score":0.029911578},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010052348245165835,"score_gpt":0.19875470144772636,"score_spread":0.1887023532025605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949680615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40190297,0.0011240091,0.5385673,0.00092734303,0.0008377658,0.00016119856,0.0002711014,0.00046106573,0.055747144],"genre_scores_gemma":[0.8475327,0.00035942768,0.1376995,0.00031076343,0.0002060161,0.00008567611,0.00018302322,0.00007963776,0.013543305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991435,0.0002051429,0.000069422145,0.00010071016,0.00037335668,0.00010778965],"domain_scores_gemma":[0.9987111,0.00030811256,0.00018259106,0.00027580894,0.00032888996,0.00019355347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007880665,0.00047109867,0.00036240017,0.0009019408,0.0006883712,0.0014431565,0.00045970973,0.0004985777,0.0042419597],"category_scores_gemma":[0.0018484321,0.00039923954,0.00048507098,0.0005484753,0.0009580723,0.0013440959,0.0009473658,0.0010074083,0.0006223554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377292,0.000058823454,0.00071098265,0.00007806543,0.000021368744,0.0003856105,0.00030616162,0.008338263,0.026020138,0.9316749,0.0019462924,0.030275622],"study_design_scores_gemma":[0.00013133769,0.0005018956,0.00130088,0.000060773582,0.000042712112,0.0019846335,0.00032383826,0.12819862,0.077329986,0.74526083,0.044711627,0.00015290122],"about_ca_topic_score_codex":0.0002479602,"about_ca_topic_score_gemma":0.0002686124,"teacher_disagreement_score":0.0042419597,"about_ca_system_score_codex":0.00052797864,"about_ca_system_score_gemma":0.00049236935,"threshold_uncertainty_score":0.014190793},"labels":[],"label_agreement":null},{"id":"W2952022585","doi":"10.1002/jcd.21318","title":"Turyn‐Type Sequences: Classification, Enumeration, and Construction","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"","keywords":"Equivalence (formal languages); Construct (python library); Equivalence relation; Autocorrelation; Canonical form","score_opus":0.10527406570236061,"score_gpt":0.34553701937972836,"score_spread":0.24026295367736775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952022585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72272676,0.0010653805,0.22899546,0.0004842671,0.00019758106,0.00014001378,0.00091400725,0.00027886019,0.045197695],"genre_scores_gemma":[0.9067216,0.00053428044,0.08162566,0.00017216546,0.00014963059,0.00020657488,0.0015228152,0.00008488982,0.00898246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.00019129568,0.00010312781,0.00015314677,0.00016786007,0.00015376466],"domain_scores_gemma":[0.99849963,0.0005239972,0.00031166186,0.00018534479,0.00029527282,0.00018415305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006708455,0.00042133805,0.0005460617,0.002639695,0.0010143404,0.0015695384,0.0005665748,0.0007545182,0.003690422],"category_scores_gemma":[0.002561531,0.00030319215,0.00038810846,0.002002526,0.0015993213,0.0021053688,0.0011392375,0.0009776684,0.00060326443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085678,0.000063467145,0.003463025,0.00008862233,0.0000089913965,0.0001679956,0.00043453238,0.002401719,0.003720082,0.94992065,0.001922618,0.03772257],"study_design_scores_gemma":[0.000025704388,0.00012595007,0.003985957,0.00012995188,0.000019716323,0.0010760445,0.00035686023,0.033602636,0.005935149,0.9325994,0.022082372,0.000060237715],"about_ca_topic_score_codex":0.0004211423,"about_ca_topic_score_gemma":0.00042166715,"teacher_disagreement_score":0.003690422,"about_ca_system_score_codex":0.0006762378,"about_ca_system_score_gemma":0.00048199575,"threshold_uncertainty_score":0.012345672},"labels":[],"label_agreement":null},{"id":"W2963390100","doi":"10.1002/jcd.21598","title":"Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"FP7 People: Marie-Curie Actions; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Mathematics; Combinatorics; Multiplicity (mathematics); Eigenvalues and eigenvectors; Order (exchange); Strongly regular graph; Upper and lower bounds; Graph; Pathwidth; Geometry; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.08058842278116572,"score_gpt":0.36371478949876734,"score_spread":0.2831263667176016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963390100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9523571,0.00015561121,0.03272169,0.00013158891,0.00002584338,0.000033605593,0.00007825675,0.00007133416,0.014424986],"genre_scores_gemma":[0.99108106,0.00006825443,0.006032697,0.000029983028,0.000019655063,0.000026475453,0.000093382114,0.000026400117,0.0026221452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993932,0.00014404728,0.00003193728,0.00016163407,0.00012724938,0.0001419346],"domain_scores_gemma":[0.99713135,0.0011585361,0.0008282302,0.00025329477,0.00025604403,0.00037250866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043443957,0.00034254303,0.00053649215,0.0013260924,0.0009396005,0.0014406417,0.00046361116,0.0007399586,0.0051241135],"category_scores_gemma":[0.0028824445,0.00050173735,0.00043900748,0.0006419889,0.0018551323,0.0014813966,0.00094347313,0.00066790555,0.0003564157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003785962,0.0000676405,0.0073831375,0.00010479893,0.000030520892,0.0005294061,0.00061543373,0.018025534,0.010611125,0.94583833,0.0011858367,0.015229649],"study_design_scores_gemma":[0.00015532915,0.000508197,0.010583239,0.000106232925,0.00006728841,0.0017015807,0.0021083434,0.15714681,0.014731276,0.79600924,0.016788369,0.00009402654],"about_ca_topic_score_codex":0.0014624199,"about_ca_topic_score_gemma":0.0014265691,"teacher_disagreement_score":0.0051241135,"about_ca_system_score_codex":0.0006888972,"about_ca_system_score_gemma":0.0002298961,"threshold_uncertainty_score":0.017141879},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01069518822555812,"score_gpt":0.18305549727227075,"score_spread":0.17236030904671262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964093181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46284488,0.0018008007,0.40545988,0.0055028745,0.00036405944,0.00037808836,0.0014340711,0.00038548687,0.12182988],"genre_scores_gemma":[0.87197816,0.0013478625,0.097484976,0.00068060163,0.0002542306,0.00018015497,0.0011227363,0.00011613357,0.026835125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906784,0.0002667356,0.000036099318,0.00016257037,0.0001492359,0.0003176142],"domain_scores_gemma":[0.99770856,0.0015168217,0.00020982875,0.00021893733,0.00015656359,0.00018938757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529726,0.00053366815,0.00069940276,0.00065566506,0.0013220363,0.0017518798,0.00088061846,0.0012048435,0.010597273],"category_scores_gemma":[0.0043034866,0.00038429484,0.0005332921,0.0009838782,0.001456298,0.0040876,0.001197177,0.00148263,0.00076691044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042752904,0.00015203367,0.001065028,0.00024112791,0.000038641952,0.0004707504,0.00044701443,0.04558597,0.002942067,0.88537997,0.01965402,0.04359596],"study_design_scores_gemma":[0.00010112062,0.00005723186,0.00030930783,0.00006208385,0.000017642502,0.00014292369,0.00030850357,0.10131091,0.0014060573,0.88628167,0.009972559,0.000029949952],"about_ca_topic_score_codex":0.011340176,"about_ca_topic_score_gemma":0.011167516,"teacher_disagreement_score":0.011340176,"about_ca_system_score_codex":0.0014380764,"about_ca_system_score_gemma":0.0015904208,"threshold_uncertainty_score":0.035451353},"labels":[],"label_agreement":null},{"id":"W2967987125","doi":"10.1002/jcd.21701","title":"All group‐based latin squares possess near transversals","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Transversal (combinatorics); Conjecture; Combinatorics; Square (algebra); Mathematics; Class (philosophy); Group (periodic table); Order (exchange); Column (typography); Discrete mathematics; Physics; Computer science; Geometry; Mathematical analysis; Connection (principal bundle); Artificial intelligence; Biology","score_opus":0.042583768513273515,"score_gpt":0.2535990957581289,"score_spread":0.2110153272448554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967987125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9091757,0.0002635231,0.044018004,0.00025596158,0.00016005541,0.000051388604,0.00035506207,0.00040485468,0.04531532],"genre_scores_gemma":[0.9811229,0.00011022183,0.010014664,0.00014747048,0.000069377755,0.00003647683,0.00041771765,0.00006593935,0.008015209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918693,0.00013182235,0.000064709646,0.00029750087,0.00015846481,0.00016063591],"domain_scores_gemma":[0.9969168,0.0005594222,0.00076691044,0.0009052248,0.00043805805,0.000413697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004437729,0.00038130555,0.0005528448,0.0007309027,0.0012688761,0.0018759553,0.00050178013,0.0007773371,0.008347974],"category_scores_gemma":[0.0020000383,0.0004152524,0.0005288898,0.00044136398,0.0015941792,0.0020991936,0.0016558833,0.0011575216,0.0013698322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001249846,0.00014680908,0.011108639,0.00018838797,0.000060426297,0.001280458,0.0011679156,0.0078018773,0.074165806,0.8666588,0.0034537336,0.03271738],"study_design_scores_gemma":[0.00016024157,0.0013718121,0.008433772,0.00011346174,0.00006667763,0.004124086,0.0015918702,0.024055088,0.06585194,0.8494394,0.04468139,0.00011029523],"about_ca_topic_score_codex":0.0004434682,"about_ca_topic_score_gemma":0.0004858692,"teacher_disagreement_score":0.008347974,"about_ca_system_score_codex":0.0004845492,"about_ca_system_score_gemma":0.0004175167,"threshold_uncertainty_score":0.027926803},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028004945576191598,"score_gpt":0.23563613328123525,"score_spread":0.20763118770504366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973469729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18638015,0.00064041925,0.71485895,0.0019711915,0.000491773,0.00018899531,0.000671985,0.0002532592,0.09454332],"genre_scores_gemma":[0.6781949,0.00079188077,0.2814375,0.00048509848,0.00039749953,0.00041057635,0.0008241104,0.00016163728,0.037296813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955195,0.00007859575,0.00002389836,0.00011808154,0.00008737164,0.00014005945],"domain_scores_gemma":[0.9992525,0.0003263748,0.00007173723,0.00008128234,0.00016862823,0.000099479854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070846354,0.0006545597,0.00093037327,0.00085449993,0.0013612218,0.001990242,0.0011474442,0.002115525,0.010903269],"category_scores_gemma":[0.0031048066,0.0005461336,0.00085502886,0.0007388263,0.0010348812,0.0022332976,0.0020390325,0.0023138644,0.000913824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060007646,0.000036853544,0.0001562992,0.00012306511,0.00001335837,0.00009756704,0.00016800167,0.0066271536,0.0023752355,0.9660443,0.004819911,0.019478269],"study_design_scores_gemma":[0.00004398125,0.00007015207,0.00015219815,0.000070459144,0.000016888018,0.00015723893,0.000306018,0.03867525,0.0021980375,0.9442983,0.013987522,0.000023845263],"about_ca_topic_score_codex":0.0008789954,"about_ca_topic_score_gemma":0.0006785092,"teacher_disagreement_score":0.010903269,"about_ca_system_score_codex":0.0008126512,"about_ca_system_score_gemma":0.0009820281,"threshold_uncertainty_score":0.036475062},"labels":[],"label_agreement":null},{"id":"W2986160520","doi":"10.1002/jcd.21778","title":"Small Latin arrays have a near transversal","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Diagonal; Transversal (combinatorics); Row; Latin square; Row and column spaces; Mathematics; Combinatorics; Corollary; Matrix (chemical analysis); Diagonal matrix; Order (exchange); Computation; Table (database); Column (typography); Algorithm; Connection (principal bundle); Computer science; Geometry; Mathematical analysis; Materials science","score_opus":0.03635854040924036,"score_gpt":0.22252333559703177,"score_spread":0.18616479518779142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986160520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.800084,0.00040359152,0.15298074,0.000543878,0.00014966862,0.00003885688,0.0002643059,0.00056786597,0.044967085],"genre_scores_gemma":[0.9405583,0.00020643999,0.045243423,0.00028625157,0.00006141377,0.000042090043,0.00025519566,0.00015205883,0.013194795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948454,0.00012059141,0.000034138444,0.00012153478,0.00013747001,0.0001015589],"domain_scores_gemma":[0.99684685,0.0012134151,0.00059509365,0.00057818886,0.00047190514,0.00029454497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035826873,0.00038694218,0.0004124294,0.0006605894,0.0006480752,0.0016238025,0.0003548331,0.00063645863,0.009438991],"category_scores_gemma":[0.0031874932,0.0005291167,0.00035381786,0.00045870384,0.0010092388,0.0016123427,0.0011101373,0.0008589804,0.0016594937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010400782,0.00016138241,0.008579653,0.00027043573,0.000050868184,0.0007082659,0.0004801283,0.040712364,0.18375915,0.7186849,0.004961236,0.040591564],"study_design_scores_gemma":[0.0001270627,0.0009209238,0.0042409366,0.00014721634,0.000057128073,0.0022470301,0.0007479464,0.17894964,0.09382444,0.6923609,0.026285637,0.00009110427],"about_ca_topic_score_codex":0.00035085576,"about_ca_topic_score_gemma":0.0006915409,"teacher_disagreement_score":0.009438991,"about_ca_system_score_codex":0.00039067407,"about_ca_system_score_gemma":0.00030481725,"threshold_uncertainty_score":0.031576574},"labels":[],"label_agreement":null},{"id":"W2989059133","doi":"10.1002/jcd.21712","title":"Colourings of star systems","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Star (game theory); Partition (number theory); Order (exchange); Bipartite graph; Chromatic scale; Mathematics; Monochromatic color; Vertex (graph theory); Graph; Complete graph; Integer (computer science); Physics; Discrete mathematics; Astrophysics; Computer science","score_opus":0.028141003823335436,"score_gpt":0.22874985212866059,"score_spread":0.20060884830532516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989059133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74208516,0.0006262173,0.18064061,0.0005418004,0.00030868914,0.00016656565,0.00046096955,0.00053600833,0.07463401],"genre_scores_gemma":[0.96347445,0.00015161105,0.02727692,0.00012857214,0.000035899546,0.000049378214,0.00023453936,0.00007636201,0.008572175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998966,0.00024578508,0.00007597303,0.00021945675,0.00020238619,0.00029051956],"domain_scores_gemma":[0.9973236,0.0007718799,0.00031700917,0.00059882965,0.00046287823,0.0005259027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309184,0.00027703185,0.00043792615,0.0008101866,0.0015372735,0.0020286746,0.00037644673,0.0005963512,0.010426512],"category_scores_gemma":[0.0023413873,0.000414232,0.0005892765,0.0005669905,0.0014954801,0.0020184894,0.0020235549,0.0008318535,0.0007967664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042179687,0.00009533496,0.004016197,0.00021643771,0.000050238472,0.00029346533,0.00069429795,0.02488962,0.04052701,0.8962933,0.00468417,0.027818147],"study_design_scores_gemma":[0.00013621926,0.0004367759,0.003771267,0.00007503232,0.00006480941,0.0007622165,0.00062044844,0.10590847,0.037138313,0.8052743,0.045720022,0.00009205083],"about_ca_topic_score_codex":0.0012170636,"about_ca_topic_score_gemma":0.0021063888,"teacher_disagreement_score":0.010426512,"about_ca_system_score_codex":0.0011415499,"about_ca_system_score_gemma":0.0007698628,"threshold_uncertainty_score":0.03488016},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019222495699942627,"score_gpt":0.22581786203395077,"score_spread":0.20659536633400813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006556965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9006233,0.00030608763,0.080308504,0.00027362627,0.00008564826,0.00011842239,0.00033843753,0.00015057261,0.017795386],"genre_scores_gemma":[0.9564072,0.0000988166,0.039244972,0.000046459154,0.000034367764,0.00005561133,0.0004179524,0.00002216496,0.0036726291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987413,0.00022960454,0.00013887361,0.00022774086,0.00041962403,0.00024298485],"domain_scores_gemma":[0.9967173,0.0010184413,0.00058348535,0.0009143709,0.00046439675,0.0003020519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081714406,0.00034584303,0.00041024332,0.0018512417,0.0011783055,0.0016507431,0.0005726743,0.0008215647,0.005890521],"category_scores_gemma":[0.0037297443,0.00028032373,0.0005005567,0.0012142418,0.0014811928,0.0017704725,0.0010159333,0.0009473667,0.0005902017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040950737,0.00023254831,0.010829073,0.0001349274,0.000023539576,0.0004335051,0.0010251891,0.010839241,0.023292491,0.85021895,0.002277772,0.10028333],"study_design_scores_gemma":[0.00010686387,0.00046172875,0.007731076,0.00008093756,0.000025788799,0.0017302608,0.0007127605,0.077879764,0.022919152,0.8628966,0.025353268,0.000101670754],"about_ca_topic_score_codex":0.00036239016,"about_ca_topic_score_gemma":0.00031758903,"teacher_disagreement_score":0.005890521,"about_ca_system_score_codex":0.00058520935,"about_ca_system_score_gemma":0.00058894884,"threshold_uncertainty_score":0.019705772},"labels":[],"label_agreement":null},{"id":"W3010175047","doi":"10.1002/jcd.21709","title":"Design theory and some forbidden configurations","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pigeonhole principle; Divisibility rule; Combinatorics; Row; Extension (predicate logic); Matrix (chemical analysis); Upper and lower bounds; Row and column spaces; Column (typography); Block (permutation group theory); Value (mathematics); Set (abstract data type); Discrete mathematics; Geometry; Statistics; Connection (principal bundle); Computer science","score_opus":0.029087719874567212,"score_gpt":0.22395697859690114,"score_spread":0.19486925872233393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010175047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15860486,0.0006907631,0.7628266,0.003000926,0.00017474499,0.00016780222,0.00024225979,0.0002880393,0.07400408],"genre_scores_gemma":[0.88992286,0.00030934857,0.09897925,0.0006263762,0.000110396446,0.00036336813,0.00019556737,0.00006006308,0.009432602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555075,0.0023524165,0.00020579163,0.0005212799,0.0008731622,0.0004966174],"domain_scores_gemma":[0.99131525,0.0057774335,0.0006275308,0.0012880148,0.00065402343,0.00033779832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027221837,0.00056412845,0.0006618671,0.0010859878,0.0018843677,0.002099848,0.0013491452,0.0017147934,0.009375538],"category_scores_gemma":[0.008207729,0.00079293037,0.00087836874,0.0009680353,0.0040033855,0.0029351136,0.0021111388,0.0028027708,0.00068272796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037652342,0.00003372779,0.00021453811,0.000057745456,0.000013199932,0.00008644455,0.00011702564,0.00894415,0.00082493376,0.98072124,0.0010214915,0.007928046],"study_design_scores_gemma":[0.000039353814,0.00007580736,0.00012087993,0.000043428136,0.000011940425,0.00018432779,0.000084310974,0.031298347,0.0014631258,0.96110576,0.0055554467,0.000017267108],"about_ca_topic_score_codex":0.0004031255,"about_ca_topic_score_gemma":0.00038953978,"teacher_disagreement_score":0.009375538,"about_ca_system_score_codex":0.0015434141,"about_ca_system_score_gemma":0.00085293193,"threshold_uncertainty_score":0.03136432},"labels":[],"label_agreement":null},{"id":"W3012119802","doi":"10.1002/jcd.21710","title":"The existence of disjoint (hooked) near‐Rosa sequences and applications","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Simple (philosophy); Discrete mathematics; Epistemology","score_opus":0.021723266705923006,"score_gpt":0.2215002456100916,"score_spread":0.1997769789041686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012119802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72830105,0.0007466932,0.22007614,0.0005080659,0.00019626766,0.00008918412,0.00033766965,0.00024057792,0.04950432],"genre_scores_gemma":[0.94817215,0.0001972861,0.04758909,0.000089067245,0.000040433235,0.00005851788,0.00020111277,0.000018644314,0.0036336682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994141,0.000106947155,0.00007740494,0.00013704956,0.00017143437,0.00009300311],"domain_scores_gemma":[0.99733186,0.0010769559,0.0004697855,0.00031497376,0.00040321174,0.00040329926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044877204,0.00038613298,0.0004747787,0.0012155379,0.00091296027,0.00092935265,0.0004531546,0.0007643736,0.0048002554],"category_scores_gemma":[0.003998567,0.00035943015,0.00040880116,0.00045518097,0.0014238667,0.0012571855,0.0017871038,0.0010585862,0.0005541489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002862519,0.000095614094,0.0034255912,0.00024684577,0.00003071712,0.0009328859,0.00042122792,0.013390887,0.059778832,0.88642216,0.0007836591,0.03418535],"study_design_scores_gemma":[0.00008771773,0.00043341378,0.0026016016,0.00016497436,0.00004649878,0.0031091562,0.00093719165,0.073501706,0.06327752,0.8366063,0.019108644,0.00012531238],"about_ca_topic_score_codex":0.00036635512,"about_ca_topic_score_gemma":0.00053633825,"teacher_disagreement_score":0.0048002554,"about_ca_system_score_codex":0.00049557514,"about_ca_system_score_gemma":0.00060839124,"threshold_uncertainty_score":0.016058445},"labels":[],"label_agreement":null},{"id":"W3028993401","doi":"10.1002/jcd.21762","title":"The localization number of designs","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Combinatorics; Mathematics; Graph; Block design; Discrete mathematics; Projective plane; Incidence (geometry); Computer science; Pure mathematics; Geometry; Correlation","score_opus":0.030535407494273213,"score_gpt":0.2584612004419536,"score_spread":0.22792579294768037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028993401","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6184786,0.00067483506,0.34469673,0.0011189894,0.00005487877,0.00014144994,0.00055053516,0.0008432555,0.033440873],"genre_scores_gemma":[0.97302973,0.00031498086,0.020140752,0.00012954877,0.000025881454,0.0001587395,0.00031803732,0.00013665135,0.0057456563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981067,0.00067115965,0.000086842956,0.00037152597,0.0003850861,0.00037866912],"domain_scores_gemma":[0.9863187,0.008461339,0.0019337515,0.0013383084,0.0011336396,0.0008142729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015500467,0.0008419689,0.000790416,0.0014841626,0.001023277,0.0018749312,0.0011494029,0.0011256498,0.011952395],"category_scores_gemma":[0.012423,0.00078383455,0.0006033087,0.000896159,0.00224475,0.0040452946,0.001753469,0.0013765896,0.0012062897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014303176,0.00038279715,0.012478765,0.0007855622,0.00013009338,0.0007996474,0.0012074136,0.29666862,0.05934074,0.5473907,0.00670979,0.07267563],"study_design_scores_gemma":[0.00029145618,0.0012192811,0.0055317814,0.00024364876,0.00016952114,0.0013379969,0.00083029165,0.49328908,0.06511552,0.41839564,0.013449109,0.0001266665],"about_ca_topic_score_codex":0.00073526206,"about_ca_topic_score_gemma":0.0006974815,"teacher_disagreement_score":0.011952395,"about_ca_system_score_codex":0.0018181802,"about_ca_system_score_gemma":0.00074960815,"threshold_uncertainty_score":0.039984763},"labels":[],"label_agreement":null},{"id":"W3047392627","doi":"10.1002/jcd.21747","title":"An extension of a construction of covering arrays","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Alphabet; Extension (predicate logic); Combinatorics; Row; Matching (statistics); Discrete mathematics; Computer science; Statistics","score_opus":0.02059721547403701,"score_gpt":0.2198631619983976,"score_spread":0.19926594652436058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047392627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19707724,0.000601615,0.74550265,0.0008457852,0.00043853238,0.0002634095,0.00045908688,0.0015748024,0.05323684],"genre_scores_gemma":[0.7702928,0.0004162515,0.21935558,0.0004812245,0.00014738768,0.00023294211,0.00030991886,0.00017286472,0.008591064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993949,0.00014602697,0.00003966123,0.00013333709,0.00016718174,0.00011891773],"domain_scores_gemma":[0.9985814,0.0005545582,0.000114704286,0.0004540601,0.00022996285,0.00006521352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034018295,0.00039319627,0.00031218512,0.00078221946,0.00075078965,0.0008290732,0.00046344326,0.00062910974,0.0032215654],"category_scores_gemma":[0.0022087386,0.00038855788,0.00048171193,0.00097126747,0.0007456647,0.0011020356,0.0010678916,0.00077597867,0.0006594672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039610523,0.00013754435,0.0022445214,0.00031389642,0.000073386094,0.00086064235,0.0010372457,0.024988458,0.17943166,0.6169084,0.006669459,0.16693869],"study_design_scores_gemma":[0.00014503166,0.00078228273,0.0023799224,0.00009937772,0.00012254753,0.0031688933,0.00029229565,0.17117439,0.4172557,0.23423299,0.17015359,0.00019296593],"about_ca_topic_score_codex":0.0003088117,"about_ca_topic_score_gemma":0.00027999814,"teacher_disagreement_score":0.0032215654,"about_ca_system_score_codex":0.00043408395,"about_ca_system_score_gemma":0.00037730703,"threshold_uncertainty_score":0.010777235},"labels":[],"label_agreement":null},{"id":"W3152641317","doi":"10.1002/jcd.21777","title":"Maximal partial Room squares","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Square (algebra); Order (exchange); Partial least squares regression; Combinatorics; Spectrum (functional analysis); Statistics; Geometry; Physics; Quantum mechanics","score_opus":0.01700286428564882,"score_gpt":0.22267349823552923,"score_spread":0.20567063394988042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152641317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83864844,0.00035451405,0.12800097,0.00009705657,0.00003309393,0.00003513661,0.0005673588,0.00039893884,0.031864464],"genre_scores_gemma":[0.9832919,0.000059921633,0.014395422,0.00002313558,0.000014809299,0.000025020394,0.00027929214,0.00005866544,0.0018518432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911195,0.0001900842,0.000048641392,0.00018811438,0.00026217813,0.00019909733],"domain_scores_gemma":[0.9981134,0.00086080574,0.0002216304,0.00028404384,0.0002743682,0.0002457709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040945603,0.00039550412,0.0005282497,0.00079013885,0.00052384136,0.0012589499,0.00061915285,0.00031398443,0.0060000056],"category_scores_gemma":[0.0024023468,0.00037030398,0.00036940732,0.0005114205,0.0013869143,0.0013187602,0.001269188,0.00043077365,0.0005585185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013636918,0.000095838004,0.007321657,0.00040792357,0.00010612347,0.00064780883,0.000527733,0.096062526,0.13519512,0.68123114,0.0037425493,0.07329785],"study_design_scores_gemma":[0.00011639352,0.00069197157,0.00790418,0.00009884343,0.00006256395,0.0021852746,0.001003968,0.18534535,0.109737605,0.6739304,0.018815365,0.0001080601],"about_ca_topic_score_codex":0.00029629222,"about_ca_topic_score_gemma":0.00040616092,"teacher_disagreement_score":0.0060000056,"about_ca_system_score_codex":0.00029096255,"about_ca_system_score_gemma":0.00025115375,"threshold_uncertainty_score":0.020072043},"labels":[],"label_agreement":null},{"id":"W3157423422","doi":"10.1002/jcd.21943","title":"On products of strong Skolem starters","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Skew; Combinatorics; Computer science","score_opus":0.015417561569669551,"score_gpt":0.22459304399427418,"score_spread":0.20917548242460463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157423422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6648444,0.0002890415,0.28102073,0.00018219854,0.000106877866,0.00008443349,0.00017407518,0.0003459633,0.052952338],"genre_scores_gemma":[0.9396952,0.00012181868,0.04422445,0.00009180994,0.000057111276,0.00006859944,0.00023122612,0.00009789003,0.01541199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999493,0.00012489823,0.000027187678,0.00009695845,0.00016826334,0.000089684574],"domain_scores_gemma":[0.9985531,0.0005659276,0.00020032203,0.00023147785,0.0002656112,0.00018353557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756445,0.00033305548,0.00029538854,0.0008803257,0.0007866881,0.000941172,0.00029522832,0.00039882396,0.0061415895],"category_scores_gemma":[0.0016140867,0.00029296614,0.00049258105,0.00036713708,0.0011908993,0.0012017585,0.001130395,0.00080611283,0.0010221049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015681401,0.000047215766,0.001310149,0.000060819082,0.000012321879,0.00041559525,0.0003412325,0.0038515518,0.013431152,0.96818966,0.00093791605,0.011245632],"study_design_scores_gemma":[0.000058093672,0.00042720692,0.0011655737,0.00008057359,0.000035094312,0.0009643502,0.00035103128,0.03221064,0.027831912,0.9124432,0.024382459,0.000049778042],"about_ca_topic_score_codex":0.00013463154,"about_ca_topic_score_gemma":0.0003223145,"teacher_disagreement_score":0.0061415895,"about_ca_system_score_codex":0.00036688324,"about_ca_system_score_gemma":0.00027464028,"threshold_uncertainty_score":0.020545721},"labels":[],"label_agreement":null},{"id":"W3186141999","doi":"10.1002/jcd.21798","title":"On strongly regular designs admitting fusion to strongly regular decomposition","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Strongly regular graph; Combinatorics; Regular graph; Vertex (graph theory); Graph; Two-graph; Homogeneous; Partition (number theory); Equivalence (formal languages); Discrete mathematics; Line graph; Graph power","score_opus":0.016395991287428757,"score_gpt":0.24739433640207986,"score_spread":0.23099834511465112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186141999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6135472,0.00031820964,0.3547459,0.00021243241,0.00004515392,0.00015820545,0.00031390114,0.0004032639,0.030255742],"genre_scores_gemma":[0.9494036,0.0001270155,0.048180237,0.00005448748,0.000019042052,0.000121848614,0.00019172825,0.000060069957,0.0018420478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647695,0.0011561102,0.0003047111,0.00072827114,0.0008626777,0.00047132422],"domain_scores_gemma":[0.9947778,0.002164646,0.00081547804,0.0011878434,0.00058632996,0.00046784544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032219759,0.0005602756,0.00078315474,0.0011803551,0.0009510852,0.0017263243,0.0006366628,0.001234859,0.0054247463],"category_scores_gemma":[0.007750723,0.0007020821,0.0011183774,0.00083397503,0.0029215005,0.0026319143,0.0023760465,0.0012848919,0.0007444495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003286353,0.000082368766,0.0018681241,0.00011538528,0.00003006668,0.0003581003,0.00043883297,0.0174401,0.024532657,0.9384409,0.00058405387,0.015780777],"study_design_scores_gemma":[0.000109571214,0.00066108326,0.0016594401,0.000115727504,0.000051257623,0.0011283058,0.0006657575,0.06618396,0.03428378,0.8850176,0.010035115,0.000088378845],"about_ca_topic_score_codex":0.00021985966,"about_ca_topic_score_gemma":0.00025735906,"teacher_disagreement_score":0.0054247463,"about_ca_system_score_codex":0.00088666915,"about_ca_system_score_gemma":0.00044250014,"threshold_uncertainty_score":0.018147528},"labels":[],"label_agreement":null},{"id":"W3190498263","doi":"10.1002/jcd.21805","title":"Extended near Skolem sequences Part II","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Memorial University of Newfoundland; Mount Allison University","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Order (exchange); Integer (computer science); Construct (python library); Discrete mathematics; Computer science","score_opus":0.07389808868193168,"score_gpt":0.34574889115184654,"score_spread":0.2718508024699149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190498263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44796038,0.00096675905,0.35095,0.00052749965,0.0009023573,0.00017647973,0.000573317,0.00064684404,0.19729629],"genre_scores_gemma":[0.88378006,0.00042279207,0.06576539,0.00029966683,0.00023164034,0.00012644769,0.00074987655,0.00017195851,0.048452135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951315,0.00010389812,0.00004844875,0.000103277525,0.00015204938,0.00007918086],"domain_scores_gemma":[0.9993358,0.00012032489,0.000085273336,0.00014098604,0.00021583468,0.000101678095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005649646,0.00048449216,0.0004050966,0.00083986955,0.0008288437,0.0010783102,0.0004054416,0.00050120195,0.008006508],"category_scores_gemma":[0.0011409557,0.00021569426,0.00045261453,0.00048811088,0.0011569248,0.0014608052,0.0009778128,0.0009641741,0.0019692858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011533786,0.000041646752,0.0003849914,0.00007677358,0.00000853261,0.00015331295,0.00028749777,0.0027468556,0.0150204385,0.9600718,0.0016258198,0.019466883],"study_design_scores_gemma":[0.000021972555,0.0002698551,0.000978222,0.00012478205,0.000020833275,0.0007123676,0.0003399039,0.018843433,0.022663794,0.8919134,0.06405663,0.000054846358],"about_ca_topic_score_codex":0.00020561885,"about_ca_topic_score_gemma":0.00027603575,"teacher_disagreement_score":0.008006508,"about_ca_system_score_codex":0.00058972597,"about_ca_system_score_gemma":0.0004230195,"threshold_uncertainty_score":0.02678448},"labels":[],"label_agreement":null},{"id":"W3202612442","doi":"10.1002/jcd.21806","title":"Legendre pairs of lengths ℓ≡0(mod3)","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Legendre polynomials; Mathematics; Combinatorics; Integer (computer science); Legendre transformation; Legendre function; Multiplier (economics); Order (exchange); Mathematical analysis","score_opus":0.02414696928504522,"score_gpt":0.2488568550173062,"score_spread":0.22470988573226097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202612442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79203445,0.00039968782,0.16318819,0.00040704833,0.00022705682,0.000050168434,0.00021702681,0.00027478882,0.043201584],"genre_scores_gemma":[0.9718317,0.000106966945,0.023843117,0.000143881,0.000105320425,0.000044080207,0.0001382764,0.000044080123,0.0037427016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992393,0.00014153875,0.00004405897,0.00014932416,0.00022989897,0.00019581437],"domain_scores_gemma":[0.99777895,0.00086275855,0.0005451806,0.00031549323,0.00029920848,0.00019840892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007988053,0.00053039775,0.00037891453,0.0015233814,0.00096920604,0.0014418544,0.0005992962,0.0006496877,0.009250586],"category_scores_gemma":[0.0041410252,0.00034011906,0.00044657156,0.00071505556,0.0016774078,0.0021135793,0.0013046558,0.0011402707,0.0010321873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004152602,0.00006344861,0.003210581,0.000066080895,0.000018562605,0.000511589,0.00043671517,0.0030922003,0.024785059,0.9405759,0.0014619465,0.025362624],"study_design_scores_gemma":[0.00007119964,0.00038218102,0.00481607,0.00008032752,0.000029771112,0.0019656143,0.00044198788,0.03371911,0.05159582,0.8907404,0.016049732,0.00010783293],"about_ca_topic_score_codex":0.00018810136,"about_ca_topic_score_gemma":0.00018641834,"teacher_disagreement_score":0.009250586,"about_ca_system_score_codex":0.00046826177,"about_ca_system_score_gemma":0.00035859214,"threshold_uncertainty_score":0.030946255},"labels":[],"label_agreement":null},{"id":"W3209675893","doi":"10.1002/jcd.21809","title":"The combinatorial game N<scp>ofil</scp> played on Steiner triple systems","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University of Edmonton; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Steiner system; Hypergraph; Discrete mathematics; Complete graph","score_opus":0.030839130138622266,"score_gpt":0.2560989864287562,"score_spread":0.22525985629013395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209675893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7001054,0.00007868981,0.25903597,0.0012117813,0.0000645385,0.00044745012,0.0007716793,0.00038442094,0.037900016],"genre_scores_gemma":[0.9563199,0.000045344786,0.03959955,0.00013178898,0.000017524973,0.00013911517,0.00034608121,0.00006036986,0.0033402932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965089,0.0015270549,0.00012525843,0.00047958049,0.0004454247,0.00091373775],"domain_scores_gemma":[0.9941399,0.004077878,0.00038475785,0.00042956357,0.00028529353,0.00068260217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017138321,0.00070388964,0.0008678491,0.0006376147,0.0012105337,0.0031874673,0.0017697404,0.0011164624,0.0066247624],"category_scores_gemma":[0.0060839835,0.00042329644,0.0009241438,0.0005462921,0.0023891146,0.0026227091,0.0016108748,0.0017222089,0.00036938215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025428052,0.0008035611,0.009068394,0.00042750966,0.00021386494,0.0008489648,0.0011409649,0.31260663,0.02611743,0.5817285,0.008823078,0.055678345],"study_design_scores_gemma":[0.00012869635,0.00040800666,0.0014796129,0.000038667753,0.00004902768,0.00024685852,0.0007986253,0.70501643,0.008931309,0.27934116,0.0035068293,0.000054831686],"about_ca_topic_score_codex":0.004843382,"about_ca_topic_score_gemma":0.004926272,"teacher_disagreement_score":0.0066247624,"about_ca_system_score_codex":0.0030801718,"about_ca_system_score_gemma":0.0022918142,"threshold_uncertainty_score":0.022348344},"labels":[],"label_agreement":null},{"id":"W4210712480","doi":"10.1002/jcd.21801","title":"Extended near Skolem sequences Part I","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Memorial University of Newfoundland; Mount Allison University","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Order (exchange); Integer (computer science); Construct (python library); Discrete mathematics; Computer science","score_opus":0.01908965891260589,"score_gpt":0.22893250119867262,"score_spread":0.20984284228606673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210712480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44340044,0.00079276273,0.3885797,0.00032378448,0.0006255262,0.0002002773,0.0006848608,0.0005846383,0.16480798],"genre_scores_gemma":[0.88738364,0.00038825316,0.07450028,0.0002596939,0.0001628328,0.000127956,0.00086759427,0.00011724918,0.036192566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952793,0.0000942142,0.000049051254,0.00010392958,0.00014841097,0.00007638981],"domain_scores_gemma":[0.9992605,0.0001271358,0.00011245383,0.00014849825,0.0002518499,0.00009960235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042069127,0.00050924654,0.0003595515,0.0008504438,0.0007819333,0.0009985594,0.00039119206,0.0004759364,0.0075414004],"category_scores_gemma":[0.001042093,0.00019125524,0.00042135536,0.00050307607,0.0010109844,0.0011574776,0.0007850429,0.00081799045,0.0019044942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024676428,0.000091288864,0.0008828301,0.00013434868,0.000014302699,0.00027448774,0.00035618097,0.008636662,0.037299834,0.91112494,0.0025658938,0.038372464],"study_design_scores_gemma":[0.000036854795,0.00067007187,0.0016978454,0.00018561212,0.000028315197,0.0012188393,0.00040840553,0.061363287,0.047702316,0.80515563,0.08144905,0.00008376893],"about_ca_topic_score_codex":0.0002602785,"about_ca_topic_score_gemma":0.000338099,"teacher_disagreement_score":0.0075414004,"about_ca_system_score_codex":0.00053537625,"about_ca_system_score_gemma":0.00039849925,"threshold_uncertainty_score":0.02522844},"labels":[],"label_agreement":null},{"id":"W4229802701","doi":"10.1002/jcd.21612","title":"Issue Information","year":2018,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.042971506389614125,"score_gpt":0.23865094844130708,"score_spread":0.19567944205169296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229802701","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002517152,0.0022498465,0.0020987373,0.0039838906,0.025344163,0.00037230534,0.012998129,0.0024356658,0.9502656],"genre_scores_gemma":[0.001038318,0.001714019,0.00085649075,0.0017329147,0.0050951224,0.00009496332,0.0067081857,0.0009551081,0.9818049],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837554,0.00013513789,0.0001390663,0.00023627657,0.0009548521,0.00015912343],"domain_scores_gemma":[0.99384934,0.00060004886,0.0002888306,0.00066382915,0.002811485,0.0017864879],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015245678,0.0016780916,0.0017029827,0.0042521576,0.0015875689,0.011786459,0.0018887367,0.0026410725,0.90717655],"category_scores_gemma":[0.008365718,0.00068476493,0.0011497161,0.003843559,0.00066483783,0.004551203,0.0022832812,0.0025001979,0.87747544],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011030917,0.000021889156,0.00004346624,0.00010657485,0.000002175039,0.00001269939,0.000004916338,0.000031474785,0.00009637174,0.0012750055,0.9678198,0.030574476],"study_design_scores_gemma":[0.000008947644,0.000014092458,0.00017519682,0.00010858898,0.0000016799161,0.000033579967,0.000012187274,0.00006402188,0.000058539317,0.0012765967,0.99824166,0.000004965271],"about_ca_topic_score_codex":0.0014309142,"about_ca_topic_score_gemma":0.0032536697,"teacher_disagreement_score":0.90717655,"about_ca_system_score_codex":0.0016146685,"about_ca_system_score_gemma":0.0027547851,"threshold_uncertainty_score":0.1324014},"labels":[],"label_agreement":null},{"id":"W4230881455","doi":"10.1002/jcd.21573","title":"Issue Information","year":2017,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Mathematics","score_opus":0.053904681377386646,"score_gpt":0.2511710133118732,"score_spread":0.19726633193448656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230881455","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027460526,0.004234401,0.0075658034,0.004574132,0.020805137,0.0005175641,0.021576785,0.0045888657,0.93586266],"genre_scores_gemma":[0.0026217515,0.0043697255,0.0035338113,0.0025536097,0.01020949,0.00036369433,0.014189535,0.0025191158,0.95963925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971668,0.0004466149,0.00027406224,0.00044249234,0.0014402559,0.00022970763],"domain_scores_gemma":[0.99028075,0.0026207126,0.0005188828,0.0014067378,0.0030223057,0.0021506415],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023808393,0.0020938255,0.0019940548,0.0038987598,0.0012512679,0.0117521575,0.0023925004,0.0028903892,0.88664204],"category_scores_gemma":[0.0153354015,0.0010630505,0.0012005286,0.0045194104,0.0007823115,0.005375137,0.002523273,0.003009286,0.7850149],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014642382,0.000021495787,0.000040403935,0.00013678071,0.0000034212253,0.000006467866,0.0000051171232,0.00006378188,0.000059234662,0.0025070298,0.9535958,0.043545794],"study_design_scores_gemma":[0.000024344248,0.000026447668,0.00021168034,0.0002144928,0.0000030820843,0.000036794143,0.000012521944,0.00021166218,0.00009284487,0.005337481,0.9938211,0.000007502265],"about_ca_topic_score_codex":0.0009241632,"about_ca_topic_score_gemma":0.0020424586,"teacher_disagreement_score":0.11335796,"about_ca_system_score_codex":0.002087731,"about_ca_system_score_gemma":0.0029730094,"threshold_uncertainty_score":0.16169137},"labels":[],"label_agreement":null},{"id":"W4231074754","doi":"10.1002/jcd.21613","title":"Issue Information","year":2018,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Mathematics","score_opus":0.042971506389614125,"score_gpt":0.23865094844130708,"score_spread":0.19567944205169296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231074754","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002517152,0.0022498465,0.0020987373,0.0039838906,0.025344163,0.00037230534,0.012998129,0.0024356658,0.9502656],"genre_scores_gemma":[0.001038318,0.001714019,0.00085649075,0.0017329147,0.0050951224,0.00009496332,0.0067081857,0.0009551081,0.9818049],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837554,0.00013513789,0.0001390663,0.00023627657,0.0009548521,0.00015912343],"domain_scores_gemma":[0.99384934,0.00060004886,0.0002888306,0.00066382915,0.002811485,0.0017864879],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015245678,0.0016780916,0.0017029827,0.0042521576,0.0015875689,0.011786459,0.0018887367,0.0026410725,0.90717655],"category_scores_gemma":[0.008365718,0.00068476493,0.0011497161,0.003843559,0.00066483783,0.004551203,0.0022832812,0.0025001979,0.87747544],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011030917,0.000021889156,0.00004346624,0.00010657485,0.000002175039,0.00001269939,0.000004916338,0.000031474785,0.00009637174,0.0012750055,0.9678198,0.030574476],"study_design_scores_gemma":[0.000008947644,0.000014092458,0.00017519682,0.00010858898,0.0000016799161,0.000033579967,0.000012187274,0.00006402188,0.000058539317,0.0012765967,0.99824166,0.000004965271],"about_ca_topic_score_codex":0.0014309142,"about_ca_topic_score_gemma":0.0032536697,"teacher_disagreement_score":0.092823446,"about_ca_system_score_codex":0.0016146685,"about_ca_system_score_gemma":0.0027547851,"threshold_uncertainty_score":0.1324014},"labels":[],"label_agreement":null},{"id":"W4231524328","doi":"10.1002/jcd.21807","title":"Issue Information","year":2021,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Ottawa; University of Victoria; University of New Brunswick; University of Lethbridge; University of Waterloo; McMaster University; Burnaby Hospital","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Library science; Mathematics","score_opus":0.042801746951269364,"score_gpt":0.2353812565678832,"score_spread":0.19257950961661383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231524328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000155749,0.0009388878,0.00056081486,0.0040730312,0.012045288,0.0002477684,0.025372792,0.0018468349,0.9547589],"genre_scores_gemma":[0.00079527084,0.0006826533,0.000226706,0.0015441078,0.001902414,0.00008372745,0.008635078,0.0005281533,0.98560184],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989347,0.000103685,0.00009135773,0.00019701192,0.00052647357,0.00014678611],"domain_scores_gemma":[0.9954242,0.00065350864,0.00025043316,0.0005076951,0.001919538,0.0012446515],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009948579,0.0014030541,0.0016901329,0.0028713222,0.0014215762,0.008346187,0.0017347743,0.0026435105,0.92646277],"category_scores_gemma":[0.0070379693,0.0006233333,0.00076641835,0.0032813936,0.00053099217,0.0045070425,0.0019859418,0.002436408,0.9019602],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013657793,0.000010544105,0.000026624777,0.00009591069,8.6806887e-7,0.0000098807495,0.000005781397,0.000018158564,0.00004989214,0.0006561586,0.97997046,0.019142099],"study_design_scores_gemma":[0.000008653703,0.00000793446,0.00012590757,0.000078658435,9.09709e-7,0.000015072146,0.000009460366,0.000025468118,0.000039823855,0.00036619222,0.9993193,0.0000026022037],"about_ca_topic_score_codex":0.002477589,"about_ca_topic_score_gemma":0.0044908035,"teacher_disagreement_score":0.07353723,"about_ca_system_score_codex":0.0014134712,"about_ca_system_score_gemma":0.0020634562,"threshold_uncertainty_score":0.10489184},"labels":[],"label_agreement":null},{"id":"W4233625210","doi":"10.1002/jcd.21583","title":"Issue Information","year":2018,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; Mathematics; World Wide Web","score_opus":0.016294099377336675,"score_gpt":0.2344492926866282,"score_spread":0.21815519330929153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233625210","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019487059,0.002643611,0.0017032867,0.0020299852,0.011666179,0.00026601102,0.009700204,0.0018960454,0.9698999],"genre_scores_gemma":[0.0013905269,0.0028541542,0.0010826404,0.0010981923,0.005313034,0.00013387011,0.006920736,0.0009546772,0.9802521],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782395,0.00021024825,0.00018354047,0.0003480612,0.0012218022,0.00021232286],"domain_scores_gemma":[0.9932126,0.0012669727,0.00039551294,0.0008896724,0.0022913532,0.0019438748],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017153404,0.0024300204,0.001990236,0.005071801,0.0016999583,0.01312489,0.0024340416,0.0031573782,0.8793088],"category_scores_gemma":[0.0077965027,0.0011512225,0.001135523,0.0055673374,0.0008360995,0.005322177,0.0024884345,0.003074665,0.7967311],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012894851,0.000027769784,0.000046790483,0.0001368627,0.0000024232313,0.000008898682,0.0000060739726,0.00005455982,0.00008701672,0.0017878502,0.95487475,0.04295418],"study_design_scores_gemma":[0.000013831751,0.000021562353,0.00027902203,0.00016221672,0.0000018269363,0.000030825642,0.000012244241,0.00012503462,0.000090338624,0.0019033476,0.9973538,0.000005875249],"about_ca_topic_score_codex":0.0014995978,"about_ca_topic_score_gemma":0.0034646136,"teacher_disagreement_score":0.12069118,"about_ca_system_score_codex":0.0021679488,"about_ca_system_score_gemma":0.0030831469,"threshold_uncertainty_score":0.17215127},"labels":[],"label_agreement":null},{"id":"W4234236625","doi":"10.1002/jcd.21478","title":"Aims and Scope","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scope (computer science); Citation; Computer science; Information retrieval; World Wide Web; Combinatorics; Library science; Mathematics; Programming language","score_opus":0.019079283183959496,"score_gpt":0.21382232026349507,"score_spread":0.19474303707953558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234236625","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02055145,0.16346258,0.040943865,0.054008342,0.019285124,0.085651666,0.028326962,0.000966736,0.58680326],"genre_scores_gemma":[0.15954883,0.16920161,0.09952476,0.12771776,0.0230399,0.18787311,0.020033525,0.0012635305,0.211797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9915291,0.0034647041,0.00075171475,0.001132494,0.0024204296,0.00070154073],"domain_scores_gemma":[0.9855826,0.0051253787,0.0010442259,0.0013106805,0.0040140953,0.0029230164],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.019007906,0.0014628348,0.0014987692,0.0043319627,0.0017516421,0.007496185,0.0033129486,0.0044543515,0.13513976],"category_scores_gemma":[0.031450663,0.0005494627,0.0016007181,0.0034342404,0.0033252381,0.0048589227,0.0067966785,0.0019336178,0.049768146],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017066532,0.00087389007,0.006174719,0.044533502,0.0001469861,0.00048634713,0.0016836883,0.0011504061,0.0009544581,0.20265076,0.21354645,0.52609223],"study_design_scores_gemma":[0.0002717425,0.0006043763,0.0038578259,0.031739756,0.00014645659,0.0006322171,0.0027976157,0.0003246091,0.000614727,0.03246958,0.9265099,0.000031098298],"about_ca_topic_score_codex":0.0014675362,"about_ca_topic_score_gemma":0.0022125442,"teacher_disagreement_score":0.86486024,"about_ca_system_score_codex":0.0036500355,"about_ca_system_score_gemma":0.013774939,"threshold_uncertainty_score":0.45208752},"labels":[],"label_agreement":null},{"id":"W4235452122","doi":"10.1002/jcd.21572","title":"Issue Information","year":2017,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.053904681377386646,"score_gpt":0.2511710133118732,"score_spread":0.19726633193448656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235452122","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027178077,0.004797333,0.0065735467,0.004075528,0.017938403,0.00049319986,0.021149388,0.0041507776,0.9405501],"genre_scores_gemma":[0.002503436,0.0048719994,0.0032681383,0.0022850079,0.009250272,0.00034191736,0.014316598,0.002288554,0.96087414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971054,0.0004407489,0.00027339722,0.00044208718,0.0015024048,0.00023589024],"domain_scores_gemma":[0.99088556,0.0023814498,0.00051375607,0.0013409677,0.002750435,0.0021278893],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0024610444,0.002183243,0.0020052553,0.0039717527,0.0012082768,0.011975229,0.0025019061,0.0029139137,0.8837298],"category_scores_gemma":[0.01397225,0.0010331888,0.0011940122,0.0045345128,0.0007951107,0.0054164836,0.002560833,0.0029982633,0.77832633],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016241493,0.000023144767,0.00004165788,0.00015817724,0.0000037363022,0.0000068644545,0.000005093743,0.00006939561,0.00006607349,0.002504983,0.9496082,0.047496438],"study_design_scores_gemma":[0.000022843207,0.000024784129,0.0002098684,0.00022021282,0.0000028981121,0.000035108234,0.000010837694,0.00018720777,0.00008880016,0.0047231093,0.9944675,0.000006946676],"about_ca_topic_score_codex":0.0009693077,"about_ca_topic_score_gemma":0.002177274,"teacher_disagreement_score":0.116270185,"about_ca_system_score_codex":0.002095483,"about_ca_system_score_gemma":0.0029801796,"threshold_uncertainty_score":0.16584522},"labels":[],"label_agreement":null},{"id":"W4235587553","doi":"10.1002/jcd.21578","title":"Issue Information","year":2018,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Memorial University of Newfoundland; University of Ottawa; Wilfrid Laurier University; Toronto Metropolitan University; McMaster University; University of Waterloo; University of Manitoba; University of Lethbridge","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Mathematics","score_opus":0.016294099377336675,"score_gpt":0.2344492926866282,"score_spread":0.21815519330929153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235587553","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019487059,0.002643611,0.0017032867,0.0020299852,0.011666179,0.00026601102,0.009700204,0.0018960454,0.9698999],"genre_scores_gemma":[0.0013905269,0.0028541542,0.0010826404,0.0010981923,0.005313034,0.00013387011,0.006920736,0.0009546772,0.9802521],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782395,0.00021024825,0.00018354047,0.0003480612,0.0012218022,0.00021232286],"domain_scores_gemma":[0.9932126,0.0012669727,0.00039551294,0.0008896724,0.0022913532,0.0019438748],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017153404,0.0024300204,0.001990236,0.005071801,0.0016999583,0.01312489,0.0024340416,0.0031573782,0.8793088],"category_scores_gemma":[0.0077965027,0.0011512225,0.001135523,0.0055673374,0.0008360995,0.005322177,0.0024884345,0.003074665,0.7967311],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012894851,0.000027769784,0.000046790483,0.0001368627,0.0000024232313,0.000008898682,0.0000060739726,0.00005455982,0.00008701672,0.0017878502,0.95487475,0.04295418],"study_design_scores_gemma":[0.000013831751,0.000021562353,0.00027902203,0.00016221672,0.0000018269363,0.000030825642,0.000012244241,0.00012503462,0.000090338624,0.0019033476,0.9973538,0.000005875249],"about_ca_topic_score_codex":0.0014995978,"about_ca_topic_score_gemma":0.0034646136,"teacher_disagreement_score":0.12069118,"about_ca_system_score_codex":0.0021679488,"about_ca_system_score_gemma":0.0030831469,"threshold_uncertainty_score":0.17215127},"labels":[],"label_agreement":null},{"id":"W4236106218","doi":"10.1002/jcd.21548","title":"Issue Information","year":2017,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Legal case studies and regulations","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Information retrieval; Combinatorics; Mathematics; World Wide Web","score_opus":0.03452047139294346,"score_gpt":0.3412623467892791,"score_spread":0.30674187539633563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236106218","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017541015,0.0005448989,0.0007569849,0.0025177978,0.010294764,0.00036173066,0.021586185,0.0019436077,0.96181864],"genre_scores_gemma":[0.0005320646,0.0003938904,0.00033571105,0.0008393577,0.000918482,0.000091703216,0.008803325,0.00061730336,0.987468],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863786,0.000111200156,0.00010068387,0.00018940802,0.00078835536,0.00017251834],"domain_scores_gemma":[0.99471706,0.0005712857,0.00021674027,0.0007225682,0.0025502348,0.001222026],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001327514,0.0014409004,0.0014437964,0.0031832836,0.0020507055,0.008533201,0.0020493856,0.0025893964,0.931147],"category_scores_gemma":[0.0083586555,0.00071340974,0.0010105006,0.0037658787,0.00065190473,0.004830721,0.0023256969,0.0027357475,0.9189111],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015364629,0.000016016475,0.000035218352,0.00009188716,0.0000011737435,0.000009871238,0.000008678889,0.000021378417,0.000069931266,0.0013236351,0.9794165,0.018990312],"study_design_scores_gemma":[0.000008645758,0.00001012139,0.00015104095,0.000059411537,0.0000010159449,0.000015995933,0.000023422153,0.0000225088,0.00006819437,0.00076946116,0.99886656,0.0000037061632],"about_ca_topic_score_codex":0.0030144162,"about_ca_topic_score_gemma":0.0053395447,"teacher_disagreement_score":0.06885302,"about_ca_system_score_codex":0.0016684049,"about_ca_system_score_gemma":0.0034099242,"threshold_uncertainty_score":0.098210394},"labels":[],"label_agreement":null},{"id":"W4237019688","doi":"10.1002/jcd.21538","title":"Issue Information","year":2016,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Legal case studies and regulations","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Mathematics; Library science","score_opus":0.023937211377524165,"score_gpt":0.317288604178516,"score_spread":0.2933513928009919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237019688","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000189752,0.00059520476,0.0007227167,0.0024171227,0.00942377,0.00035987902,0.021169018,0.0018777013,0.9632448],"genre_scores_gemma":[0.0005426503,0.00038984194,0.0003330052,0.0008012574,0.00086884765,0.00008453007,0.008018742,0.000529837,0.9884312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987035,0.00010385821,0.00009942843,0.00019093198,0.0007471069,0.00015524554],"domain_scores_gemma":[0.9952651,0.0005093465,0.00021299711,0.00066540495,0.0022143454,0.0011327299],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012580378,0.0013800077,0.0014374453,0.0030919837,0.0018796953,0.0080769565,0.0019380739,0.002551644,0.9239661],"category_scores_gemma":[0.008002918,0.0006890968,0.0009828995,0.0036009895,0.0005979144,0.004513266,0.0021940407,0.0025156504,0.91042376],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017502703,0.000017420689,0.000043648495,0.0001045675,0.0000012725953,0.000011133088,0.000009492624,0.000022023305,0.00008517069,0.0013231725,0.97530967,0.023054998],"study_design_scores_gemma":[0.000008511714,0.000011095462,0.0001808102,0.000062043895,0.0000010581352,0.000018358653,0.00002212625,0.000022086193,0.00006751694,0.00071001885,0.99889284,0.0000035678092],"about_ca_topic_score_codex":0.0027314215,"about_ca_topic_score_gemma":0.004928814,"teacher_disagreement_score":0.07603389,"about_ca_system_score_codex":0.0014799894,"about_ca_system_score_gemma":0.002972885,"threshold_uncertainty_score":0.108453095},"labels":[],"label_agreement":null},{"id":"W4237281083","doi":"10.1002/(sici)1520-6610(2000)8:1<58::aid-jcd8>3.3.co;2-u","title":"Steiner triple systems with disjoint or intersecting subsystems","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; McMaster University","funders":"","keywords":"Disjoint sets; Steiner system; Mathematics; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.01622461215861664,"score_gpt":0.20769918507483157,"score_spread":0.19147457291621492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237281083","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80268705,0.0006432365,0.17063154,0.00022109992,0.000046683163,0.00005246937,0.0003940814,0.00017677688,0.025147047],"genre_scores_gemma":[0.9700842,0.00021686566,0.026628016,0.000036732483,0.000020043917,0.000045640605,0.00032524517,0.000014598567,0.0026286796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993211,0.00011635621,0.00007523326,0.0001259579,0.00019274322,0.00016856988],"domain_scores_gemma":[0.99816906,0.00057702925,0.00055171637,0.00023824329,0.00025086783,0.00021299082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054659677,0.00039433307,0.0006301249,0.00091599766,0.00091774797,0.001397186,0.00042157873,0.0008486078,0.0043132314],"category_scores_gemma":[0.002393142,0.0006059449,0.0003968157,0.0009530322,0.001115342,0.0020241647,0.0016236594,0.00051972974,0.00041768828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079269684,0.00006670184,0.006569617,0.00031177103,0.000110801346,0.0028127593,0.0011116676,0.123644166,0.039471824,0.77990997,0.0028991443,0.042298913],"study_design_scores_gemma":[0.00017476751,0.0005216569,0.0052985386,0.00015007165,0.00018264249,0.0034914706,0.0018530784,0.33762062,0.029559439,0.60142213,0.019608922,0.000116612835],"about_ca_topic_score_codex":0.0007157431,"about_ca_topic_score_gemma":0.0010908403,"teacher_disagreement_score":0.0043132314,"about_ca_system_score_codex":0.0006312314,"about_ca_system_score_gemma":0.00046369934,"threshold_uncertainty_score":0.014429212},"labels":[],"label_agreement":null},{"id":"W4241581715","doi":"10.1002/jcd.21579","title":"Issue Information","year":2018,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Mathematics; Library science","score_opus":0.042971506389614125,"score_gpt":0.23865094844130708,"score_spread":0.19567944205169296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241581715","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027019763,0.004201124,0.006951878,0.0044025383,0.022109905,0.0004973426,0.018883927,0.0045856587,0.9380974],"genre_scores_gemma":[0.0025118594,0.0041028173,0.0033835834,0.002520236,0.010980022,0.00034573872,0.012247459,0.0023584473,0.9615499],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972621,0.00042639184,0.00026581556,0.00044221358,0.0013788628,0.00022460832],"domain_scores_gemma":[0.99060494,0.0024819314,0.00051607133,0.0013558886,0.0028621037,0.0021791228],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023025079,0.0020930814,0.0019926007,0.003733045,0.0012828234,0.011607331,0.0023249923,0.0028855817,0.8849668],"category_scores_gemma":[0.014345719,0.0010593603,0.0011872918,0.0042490414,0.00075540884,0.005069184,0.0023842517,0.0029753665,0.7802574],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015399188,0.000022161426,0.000038891583,0.0001308544,0.0000033561973,0.000006573823,0.000004885032,0.000060465703,0.000061929604,0.0023246538,0.9536992,0.04363166],"study_design_scores_gemma":[0.000025466668,0.000028110802,0.00022520803,0.00019727681,0.0000030070707,0.000037064667,0.000011415323,0.00020711591,0.00008880217,0.004800554,0.9943685,0.0000075549747],"about_ca_topic_score_codex":0.00087497616,"about_ca_topic_score_gemma":0.0019944052,"teacher_disagreement_score":0.8849668,"about_ca_system_score_codex":0.0019582273,"about_ca_system_score_gemma":0.0026699912,"threshold_uncertainty_score":0.16408092},"labels":[],"label_agreement":null},{"id":"W4241648996","doi":"10.1002/jcd.1013","title":"Existence of (3, 1, 2)‐conjugate orthogonal diagonal latin squares","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Latin square; Diagonal; Mathematics; Conjugate; Orthogonal array; Combinatorics; Square (algebra); Main diagonal; Statistics; Mathematical analysis; Geometry; Taguchi methods; Chemistry","score_opus":0.024069946551698303,"score_gpt":0.22918974953155238,"score_spread":0.20511980297985408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241648996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7452699,0.0007068785,0.15634836,0.0005253942,0.00020145514,0.000083200095,0.00021823209,0.00020842685,0.09643813],"genre_scores_gemma":[0.96582085,0.00022715941,0.02724714,0.00019960653,0.00006389154,0.000081416234,0.00014733622,0.000038734957,0.006173847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903405,0.00024655825,0.0000693882,0.00020184983,0.00022994602,0.00021822091],"domain_scores_gemma":[0.9968437,0.001228183,0.0008178315,0.0003494656,0.0004984341,0.00026246623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005251309,0.00044098042,0.00034186218,0.0014850688,0.0009849013,0.0019611013,0.00036560814,0.00079534744,0.0067875884],"category_scores_gemma":[0.003216287,0.00038702632,0.00028035048,0.0009086308,0.0017328358,0.001335411,0.0015060209,0.0006036682,0.0010700567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003928443,0.000080646816,0.0035566858,0.000114630326,0.000023987226,0.0009849711,0.0007639162,0.0033856395,0.05441447,0.8868428,0.0020008562,0.047438484],"study_design_scores_gemma":[0.00014262454,0.0003697576,0.0031812068,0.00016704501,0.000042689222,0.0043863324,0.001053463,0.03767751,0.07139612,0.84739935,0.034063052,0.00012085679],"about_ca_topic_score_codex":0.00018358963,"about_ca_topic_score_gemma":0.0002308188,"teacher_disagreement_score":0.0067875884,"about_ca_system_score_codex":0.00034078638,"about_ca_system_score_gemma":0.00042274318,"threshold_uncertainty_score":0.022706807},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02761422325529419,"score_gpt":0.26846090353492696,"score_spread":0.24084668027963277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246412311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17713095,0.00038405537,0.788734,0.0002833522,0.00013715719,0.000082401544,0.00039951364,0.0010976839,0.031750955],"genre_scores_gemma":[0.8158117,0.00035302615,0.17353235,0.00029465035,0.00012620242,0.00019203732,0.00050922576,0.0003703714,0.008810375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832326,0.00054646935,0.000103981074,0.00031076785,0.0004919531,0.00022352346],"domain_scores_gemma":[0.9944712,0.0025275312,0.0006223689,0.0012702937,0.00082478556,0.00028387122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078443607,0.0005358878,0.00042339892,0.0012196033,0.0006014818,0.0015435632,0.00084100757,0.0006168619,0.005432137],"category_scores_gemma":[0.0041156965,0.0004395774,0.00052263215,0.0015626015,0.001094435,0.0023388837,0.0014846284,0.00086917856,0.001216023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023777425,0.00007903734,0.0039364584,0.00022580862,0.00006802622,0.00066216924,0.00043797112,0.042473003,0.0450778,0.7686029,0.0044893087,0.13370973],"study_design_scores_gemma":[0.0000524569,0.00037574605,0.0019188514,0.00011120833,0.00009507128,0.0020302027,0.00036530948,0.1699622,0.066002294,0.71031755,0.048675347,0.00009379428],"about_ca_topic_score_codex":0.00020957952,"about_ca_topic_score_gemma":0.00019367319,"teacher_disagreement_score":0.005432137,"about_ca_system_score_codex":0.000439392,"about_ca_system_score_gemma":0.00030554636,"threshold_uncertainty_score":0.018172264},"labels":[],"label_agreement":null},{"id":"W4249832418","doi":"10.1002/jcd.21488","title":"Issue Information","year":2016,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Legal case studies and regulations","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Mathematics","score_opus":0.023937211377524165,"score_gpt":0.317288604178516,"score_spread":0.2933513928009919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249832418","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034080917,0.0008593256,0.0022939127,0.002733061,0.0074565574,0.0008022708,0.049731348,0.003566998,0.9322157],"genre_scores_gemma":[0.001818812,0.00070426654,0.0015847092,0.0012944238,0.0014741997,0.0004819193,0.01674386,0.0012638771,0.97463393],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99676573,0.000499774,0.00034981105,0.00037334228,0.0017346292,0.0002767302],"domain_scores_gemma":[0.9887134,0.0021989653,0.00068477046,0.0017166388,0.0044579967,0.0022282854],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036219212,0.0013481863,0.0011710202,0.004426205,0.0018614251,0.011032904,0.0018684763,0.002730485,0.90076137],"category_scores_gemma":[0.017792003,0.001214837,0.0009837165,0.005176635,0.00060577656,0.004487072,0.0024492622,0.0025255603,0.8360067],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025292837,0.000025221876,0.000055140415,0.000118186006,0.0000018109303,0.000006259043,0.000015317271,0.000026320964,0.000057819518,0.0018277561,0.97139704,0.026443977],"study_design_scores_gemma":[0.000024969679,0.00001647789,0.0002227207,0.000079565354,0.000001960187,0.000015569964,0.000021117088,0.000038258062,0.00007509175,0.0010964035,0.9984036,0.0000044257827],"about_ca_topic_score_codex":0.00231107,"about_ca_topic_score_gemma":0.0053417026,"teacher_disagreement_score":0.90076137,"about_ca_system_score_codex":0.0023971105,"about_ca_system_score_gemma":0.004213867,"threshold_uncertainty_score":0.1415518},"labels":[],"label_agreement":null},{"id":"W4255349584","doi":"10.1002/jcd.21537","title":"Issue Information","year":2016,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"University-Industry-Government Innovation Models","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Information retrieval; Combinatorics; Mathematics; World Wide Web","score_opus":0.025023075953215956,"score_gpt":0.23890727803144327,"score_spread":0.2138842020782273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255349584","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028072577,0.00071749714,0.0017449704,0.0019709743,0.006327378,0.00043836472,0.029638842,0.0047284258,0.9541529],"genre_scores_gemma":[0.0010907138,0.00044250413,0.00069542584,0.0006818837,0.000947949,0.00013851875,0.009791283,0.001173754,0.98503786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981077,0.0002390646,0.00018116465,0.00024654347,0.0010205971,0.00020484073],"domain_scores_gemma":[0.9936872,0.0009223257,0.0003411629,0.0009829863,0.0023457066,0.0017206278],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001831593,0.0016012181,0.0013145223,0.0038121843,0.0017698616,0.012074932,0.0018522128,0.0024037494,0.93030703],"category_scores_gemma":[0.009778565,0.0011431271,0.0009950498,0.0048725638,0.00056405854,0.0052062897,0.0024855565,0.0025900947,0.90147096],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022874867,0.000026311718,0.000046628917,0.00010019385,0.0000017200433,0.000007636393,0.000012115522,0.000030845236,0.000083023704,0.001179598,0.96594995,0.032539107],"study_design_scores_gemma":[0.000020003126,0.00001760156,0.00019470566,0.000058396716,0.000001626715,0.000016596052,0.00001845312,0.000046078698,0.000083111896,0.0008300979,0.9987087,0.0000046190207],"about_ca_topic_score_codex":0.0021386945,"about_ca_topic_score_gemma":0.0046328832,"teacher_disagreement_score":0.06969297,"about_ca_system_score_codex":0.001886015,"about_ca_system_score_gemma":0.002880188,"threshold_uncertainty_score":0.09940851},"labels":[],"label_agreement":null},{"id":"W4256391099","doi":"10.1002/jcd.20262","title":"Octahedral designs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Winnipeg","funders":"","keywords":"Octahedron; Mathematics; Combinatorics; Order (exchange); Annals; Crystallography; Crystal structure; Chemistry; Classics","score_opus":0.015957315847465344,"score_gpt":0.22547883673295072,"score_spread":0.20952152088548537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256391099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18508852,0.0016048667,0.52719736,0.00060898444,0.001007295,0.0006735805,0.0011560959,0.0008098229,0.2818536],"genre_scores_gemma":[0.67591995,0.0012811661,0.27191672,0.00064437295,0.00022743737,0.00060946925,0.0012768379,0.00019829875,0.047925748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987142,0.00029575994,0.000121741556,0.00021650067,0.0004108353,0.00024088171],"domain_scores_gemma":[0.99883765,0.00015813016,0.00022005534,0.00026174844,0.00036180174,0.00016058834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045666468,0.00054577715,0.00054271624,0.0014021212,0.001042679,0.001960775,0.00065816817,0.00069360476,0.0138579],"category_scores_gemma":[0.0014982134,0.00040789414,0.0005303199,0.0011829422,0.0010758938,0.001183109,0.0014907811,0.0008207717,0.0027667366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000282683,0.00013437888,0.0011260804,0.00023239857,0.000035939076,0.00024763672,0.0002725069,0.009264975,0.011764146,0.865911,0.006901283,0.10382696],"study_design_scores_gemma":[0.00022681402,0.0007429052,0.0007745219,0.00027493812,0.00008028436,0.0013001391,0.00065074157,0.031749938,0.016446093,0.6337512,0.31392613,0.00007635819],"about_ca_topic_score_codex":0.00056328037,"about_ca_topic_score_gemma":0.0009782638,"teacher_disagreement_score":0.0138579,"about_ca_system_score_codex":0.00058416004,"about_ca_system_score_gemma":0.0005999194,"threshold_uncertainty_score":0.0463593},"labels":[],"label_agreement":null},{"id":"W4280564734","doi":"10.1002/jcd.21844","title":"An update on the existence of Kirkman triple systems with steiner triple systems as subdesigns","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner system; Mathematics; Triple system; Order (exchange); Combinatorics; Combinatorial design; Frame (networking); Triple play (telecommunications); Discrete mathematics; Pure mathematics; Computer science; Telecommunications","score_opus":0.019704813476672075,"score_gpt":0.22005683289197553,"score_spread":0.20035201941530345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280564734","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1244937,0.055466224,0.31976226,0.015628042,0.011361556,0.000120559016,0.00094005873,0.0012408284,0.47098678],"genre_scores_gemma":[0.66918284,0.03434389,0.241547,0.003320238,0.0056661367,0.000114944174,0.0010606012,0.0005133961,0.044250965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986511,0.00029489855,0.00018974394,0.00033051777,0.00038770118,0.00014601045],"domain_scores_gemma":[0.9963194,0.0020025054,0.00023129972,0.0006411716,0.0006432037,0.00016237568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019749496,0.000424962,0.00061498047,0.002101212,0.0016635497,0.0033459046,0.0011418201,0.0014942104,0.008653565],"category_scores_gemma":[0.0052914163,0.00072937785,0.00055080216,0.002636705,0.0028653406,0.007916192,0.0017630871,0.0034164512,0.0015949217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090566304,0.000035261393,0.00046293729,0.00047890388,0.000010374921,0.00021531263,0.00046582808,0.001594192,0.0017617006,0.8943372,0.010970162,0.08957752],"study_design_scores_gemma":[0.00001616168,0.00012518787,0.00035690097,0.00044734596,0.000034507397,0.0012129241,0.00036733338,0.0053510615,0.0059401924,0.33957395,0.64649576,0.00007874318],"about_ca_topic_score_codex":0.00072379457,"about_ca_topic_score_gemma":0.0009909454,"teacher_disagreement_score":0.008653565,"about_ca_system_score_codex":0.0021663113,"about_ca_system_score_gemma":0.00095880777,"threshold_uncertainty_score":0.028949022},"labels":[],"label_agreement":null},{"id":"W4284676051","doi":"10.1002/jcd.21850","title":"Issue Information","year":2022,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Ottawa; University of Victoria; University of New Brunswick; University of Lethbridge; University of Waterloo; McMaster University; Burnaby Hospital","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; Mathematics; World Wide Web; Library science","score_opus":0.01584470105589454,"score_gpt":0.2287724197227644,"score_spread":0.21292771866686988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284676051","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013624561,0.0005007493,0.00042946267,0.001292708,0.0046183607,0.00019287568,0.014780595,0.0013915912,0.9766574],"genre_scores_gemma":[0.00069847936,0.0004630722,0.00022150893,0.0006155518,0.00076472166,0.00005728519,0.0070131384,0.00043092313,0.98973536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990846,0.00006364973,0.00007143124,0.00018002324,0.0004761454,0.00012415594],"domain_scores_gemma":[0.9962984,0.00045710028,0.00020814638,0.00048398256,0.0016113471,0.0009410689],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00086291647,0.0014983438,0.0014881911,0.0033290156,0.001528016,0.008698,0.0016655212,0.0025505994,0.9240508],"category_scores_gemma":[0.0052368715,0.000713642,0.0007424668,0.0041568596,0.0006026418,0.0046512233,0.0018276315,0.0023081452,0.90723765],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016989032,0.000018965777,0.000044970904,0.00012050607,0.0000011343277,0.000015235579,0.0000098455575,0.000026149843,0.00013229929,0.0010626076,0.96837395,0.030177377],"study_design_scores_gemma":[0.000007414875,0.000009348828,0.00018265746,0.00006157929,9.165028e-7,0.000017966646,0.000013180365,0.000025965526,0.000059330516,0.000319455,0.99929917,0.0000030009876],"about_ca_topic_score_codex":0.0029372454,"about_ca_topic_score_gemma":0.0050474824,"teacher_disagreement_score":0.07594919,"about_ca_system_score_codex":0.0011508343,"about_ca_system_score_gemma":0.0019936801,"threshold_uncertainty_score":0.10833222},"labels":[],"label_agreement":null},{"id":"W4287307773","doi":"10.1002/jcd.21851","title":"Extended near Skolem sequences, Part III","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Memorial University of Newfoundland; Mount Allison University","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Integer (computer science); Order (exchange); Construct (python library); Computer science","score_opus":0.01655865879486378,"score_gpt":0.21834247106184484,"score_spread":0.20178381226698106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287307773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2860245,0.0018262842,0.5059542,0.00052273244,0.0016883459,0.00028718647,0.0008220701,0.0006084071,0.2022662],"genre_scores_gemma":[0.8338072,0.0010249875,0.10041005,0.0005515042,0.0004680484,0.00020492263,0.0012452079,0.00022340534,0.062064633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950576,0.00010214074,0.000049669216,0.0000987746,0.00016546508,0.000078161735],"domain_scores_gemma":[0.99919003,0.00014068921,0.00011325609,0.00018899693,0.0002620184,0.000104989274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052910385,0.00051584456,0.00034160298,0.0007425355,0.0006047241,0.0011179737,0.00036672517,0.00044894166,0.0061132503],"category_scores_gemma":[0.0012610664,0.00019268607,0.00044442213,0.00045318378,0.0009331218,0.0009104845,0.00067695836,0.00084133854,0.0020935147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022785904,0.000076253375,0.0006740631,0.00016196765,0.000017546156,0.00033407297,0.00030520494,0.009939346,0.03527657,0.9045656,0.0047306223,0.04369094],"study_design_scores_gemma":[0.000027571365,0.00049292756,0.0014427245,0.00021931482,0.000029329949,0.0012003847,0.00029478053,0.051723905,0.03951328,0.7982074,0.10676484,0.000083630184],"about_ca_topic_score_codex":0.00029565196,"about_ca_topic_score_gemma":0.00033068034,"teacher_disagreement_score":0.0061132503,"about_ca_system_score_codex":0.00045857945,"about_ca_system_score_gemma":0.0005658684,"threshold_uncertainty_score":0.02045089},"labels":[],"label_agreement":null},{"id":"W4304787108","doi":"10.1002/jcd.21863","title":"Issue Information","year":2022,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Designs","topic":"Product Development and Customization","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Ottawa; University of Victoria; University of New Brunswick; University of Lethbridge; University of Waterloo; McMaster University; Burnaby Hospital","funders":"","keywords":"Citation; Computer science; Combinatorics; Information retrieval; World Wide Web; Mathematics; Library science","score_opus":0.01584470105589454,"score_gpt":0.2287724197227644,"score_spread":0.21292771866686988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304787108","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001595341,0.00032073195,0.0007218232,0.0011280973,0.0044442723,0.00021010979,0.011225815,0.0016661689,0.98012346],"genre_scores_gemma":[0.00041322285,0.00023436168,0.00033877467,0.00040371195,0.00050826964,0.000057562862,0.0044452385,0.00044603116,0.99315286],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990677,0.00008110178,0.00006010499,0.0001467372,0.0005451466,0.00009916076],"domain_scores_gemma":[0.9970182,0.00042405745,0.00013703102,0.00037684344,0.0013558003,0.0006881504],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001029695,0.0016824708,0.0016598563,0.0056779464,0.0015767878,0.007731009,0.0021843454,0.0027453587,0.9418369],"category_scores_gemma":[0.005857042,0.0008293161,0.0008997593,0.005096657,0.00060984644,0.003854512,0.002218238,0.0019653966,0.91452533],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014873108,0.000031236068,0.000040189418,0.0001340519,0.0000015422922,0.000013287588,0.0000073526317,0.00004842063,0.00013164264,0.0018479351,0.96268487,0.03504459],"study_design_scores_gemma":[0.000016587406,0.000017359976,0.0002710675,0.00009293417,0.0000021184974,0.000020873737,0.00001993036,0.000100250414,0.00011538841,0.0014413316,0.99789536,0.00000667376],"about_ca_topic_score_codex":0.0021625515,"about_ca_topic_score_gemma":0.004581763,"teacher_disagreement_score":0.058163106,"about_ca_system_score_codex":0.0011937665,"about_ca_system_score_gemma":0.002300524,"threshold_uncertainty_score":0.08296263},"labels":[],"label_agreement":null},{"id":"W4319320075","doi":"10.1002/jcd.21876","title":"Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"National Institute of Standards and Technology; Österreichische Forschungsförderungsgesellschaft","keywords":"Mathematics; Solver; Combinatorics; Extension (predicate logic); Tuple; Packing problems; Column (typography); Class (philosophy); Upper and lower bounds; Discrete mathematics; Rank (graph theory); Computer science; Mathematical optimization; Geometry","score_opus":0.06385576691572493,"score_gpt":0.3199365614301567,"score_spread":0.2560807945144318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319320075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09192817,0.0006366425,0.8907514,0.0002607379,0.00003642898,0.000088895555,0.00027539095,0.00044429468,0.015578107],"genre_scores_gemma":[0.57314336,0.0005882182,0.4193423,0.00020762614,0.000096217314,0.00020217149,0.001097824,0.00019293731,0.0051292833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987382,0.0002621873,0.00007433112,0.00021756934,0.0005211876,0.00018647836],"domain_scores_gemma":[0.9967487,0.0019412044,0.00035773145,0.00055321894,0.00030850584,0.000090674694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008333014,0.000510607,0.00060220715,0.0010829779,0.0005174825,0.0017042438,0.00074671645,0.00069879956,0.0046156584],"category_scores_gemma":[0.005290711,0.00039892376,0.0005981295,0.001815401,0.0010106455,0.0029600891,0.00091084506,0.00086600863,0.00045702784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001674303,0.00013446553,0.0058347397,0.00032776294,0.000035883524,0.0002442374,0.00037101994,0.16924335,0.009622718,0.5580684,0.0037203806,0.25222957],"study_design_scores_gemma":[0.000027246871,0.00013299083,0.0013954369,0.000074231706,0.000018123987,0.0005193387,0.00015211382,0.5863572,0.007751873,0.39127737,0.012269516,0.00002469351],"about_ca_topic_score_codex":0.0006014222,"about_ca_topic_score_gemma":0.00059293373,"teacher_disagreement_score":0.0046156584,"about_ca_system_score_codex":0.0007140699,"about_ca_system_score_gemma":0.0006050034,"threshold_uncertainty_score":0.015440941},"labels":[],"label_agreement":null},{"id":"W4361269916","doi":"10.1002/jcd.21882","title":"Ordered covering arrays and upper bounds on covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Ciência sem Fronteiras; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministério da Ciência, Tecnologia e Inovação; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Concatenation (mathematics); Cartesian product; Hamming code; Hamming distance; Discrete mathematics; Connection (principal bundle); Product (mathematics); Block code; Algorithm; Decoding methods; Geometry","score_opus":0.02489971877531201,"score_gpt":0.2561583306077486,"score_spread":0.23125861183243662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361269916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10920525,0.0036721379,0.7964945,0.0009232643,0.0003112103,0.0001134209,0.0007870509,0.0012099129,0.08728328],"genre_scores_gemma":[0.8041042,0.0026800607,0.17987862,0.00046071628,0.00035891606,0.00030378625,0.0009599387,0.00041875467,0.010835046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955955,0.0009727105,0.00028419515,0.0005256147,0.0018380114,0.00078385405],"domain_scores_gemma":[0.98497033,0.009328312,0.0008854385,0.0024719336,0.0018744386,0.00046952354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017977861,0.00096260867,0.00081027264,0.00238786,0.001179729,0.0033058831,0.0011392497,0.00084102794,0.008693211],"category_scores_gemma":[0.012626304,0.0004580458,0.00092109956,0.0031520233,0.0022580395,0.00541599,0.003195267,0.00278342,0.0022775452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013010939,0.000070551556,0.0010624948,0.0002872636,0.00003230948,0.00018677452,0.00036882402,0.04712965,0.009849048,0.8527041,0.004329149,0.08384975],"study_design_scores_gemma":[0.000018249968,0.00015654892,0.00081116386,0.00016100143,0.0000422,0.0006973344,0.0002078417,0.1225935,0.032335985,0.815992,0.026898384,0.00008578705],"about_ca_topic_score_codex":0.0005591252,"about_ca_topic_score_gemma":0.00058421626,"teacher_disagreement_score":0.008693211,"about_ca_system_score_codex":0.0016380987,"about_ca_system_score_gemma":0.0007990421,"threshold_uncertainty_score":0.029081702},"labels":[],"label_agreement":null},{"id":"W4378981817","doi":"10.1002/jcd.21885","title":"Linear and circular single‐change covering designs revisited","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Mathematics; Combinatorics; Block (permutation group theory); Element (criminal law); Block design; Discrete mathematics","score_opus":0.0625248715641342,"score_gpt":0.24859973879210645,"score_spread":0.18607486722797226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378981817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44174784,0.00046753665,0.52228993,0.00041433045,0.00006476729,0.00012970301,0.00010777634,0.00028978672,0.034488354],"genre_scores_gemma":[0.8959518,0.00014715335,0.098660626,0.00013496778,0.000031672484,0.00006215784,0.00008896128,0.00003148327,0.0048910794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912745,0.0002126499,0.00005237127,0.00017141724,0.00023740463,0.00019872937],"domain_scores_gemma":[0.9983954,0.00074728974,0.00021864305,0.0003271455,0.00024962248,0.000061929364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007714277,0.000290942,0.00028864222,0.0004479634,0.0005015386,0.00068377244,0.00058645534,0.0006298954,0.0041903425],"category_scores_gemma":[0.0023857767,0.00027160818,0.0004435179,0.00041256324,0.0011053544,0.0009842147,0.00072187063,0.0006110357,0.0004557762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041351654,0.00015625735,0.0034261965,0.0003824815,0.00005071221,0.00060772436,0.0005729679,0.09421738,0.058576856,0.70115334,0.002726254,0.13771634],"study_design_scores_gemma":[0.00016735352,0.0007604592,0.0018915783,0.00011022325,0.000076552395,0.0016504715,0.0003258437,0.5271651,0.09072489,0.34447324,0.03258252,0.000071676186],"about_ca_topic_score_codex":0.0005858871,"about_ca_topic_score_gemma":0.0006372541,"teacher_disagreement_score":0.0041903425,"about_ca_system_score_codex":0.0007586072,"about_ca_system_score_gemma":0.00054571754,"threshold_uncertainty_score":0.014018118},"labels":[],"label_agreement":null},{"id":"W4386051996","doi":"10.1002/jcd.21913","title":"On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Prime (order theory); Decomposition; Discrete mathematics","score_opus":0.036563962291686854,"score_gpt":0.23832960328035302,"score_spread":0.20176564098866617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386051996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365195,0.00035651756,0.11814817,0.0017042842,0.000068919486,0.0003467825,0.0014919405,0.00023411281,0.041129783],"genre_scores_gemma":[0.945343,0.00046594325,0.043486517,0.00029543697,0.00008260594,0.00020306847,0.0018622061,0.00005007356,0.008211179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924386,0.00022491947,0.00004550642,0.00015148628,0.000113927126,0.00022043013],"domain_scores_gemma":[0.9950781,0.0035475995,0.00044858968,0.00032259902,0.00024605266,0.00035700962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093164877,0.00047676737,0.0007389917,0.0010528092,0.001107971,0.002059207,0.0008881934,0.0013194694,0.009272016],"category_scores_gemma":[0.005372214,0.0005924953,0.000502839,0.00095009065,0.0011373477,0.0028625885,0.0011539662,0.0009820107,0.0007051404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075654226,0.000504406,0.0055617723,0.00061337755,0.000107785316,0.0012960366,0.0009155603,0.10345244,0.011011721,0.8040893,0.014486476,0.057204507],"study_design_scores_gemma":[0.00027246072,0.00021909115,0.0022595704,0.00012855002,0.00006167421,0.0008260414,0.0012217418,0.21640848,0.007656377,0.7604109,0.010453106,0.0000819912],"about_ca_topic_score_codex":0.0024276727,"about_ca_topic_score_gemma":0.0042006997,"teacher_disagreement_score":0.009272016,"about_ca_system_score_codex":0.0010689603,"about_ca_system_score_gemma":0.0011260723,"threshold_uncertainty_score":0.03101796},"labels":[],"label_agreement":null},{"id":"W4387057486","doi":"10.1002/jcd.21918","title":"Completing the solution of the directed Oberwolfach problem with cycles of equal length","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Digraph; Combinatorics; Decomposition; Discrete mathematics","score_opus":0.024096584297988225,"score_gpt":0.21763709788451333,"score_spread":0.1935405135865251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387057486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35542506,0.0002925361,0.58428776,0.0013148523,0.00018605226,0.00034780925,0.00085966097,0.0004327202,0.056853607],"genre_scores_gemma":[0.6737521,0.00048218755,0.2947432,0.00037106435,0.0000985065,0.00022466047,0.0011979224,0.0001515173,0.028978916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.000086546715,0.000020907306,0.00008720588,0.00007663075,0.00010839066],"domain_scores_gemma":[0.9992453,0.00036916952,0.00007573866,0.00015644415,0.00008672026,0.00006666012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042028865,0.00034181343,0.00043603836,0.00036595756,0.00062049745,0.0008990472,0.00069922325,0.00070750277,0.011672528],"category_scores_gemma":[0.0020441338,0.0002509656,0.0004585045,0.0005588138,0.00043116783,0.001423742,0.0010876299,0.0010314175,0.00091372523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003756433,0.00031367023,0.0020001333,0.00063512084,0.000085640146,0.0005230159,0.00066944025,0.10828693,0.018181443,0.57664776,0.023861745,0.26841944],"study_design_scores_gemma":[0.00019152767,0.00030891638,0.0011270401,0.00011061159,0.00004863752,0.0004208135,0.0008293901,0.25663632,0.022844672,0.665908,0.051516972,0.000057168723],"about_ca_topic_score_codex":0.0017577157,"about_ca_topic_score_gemma":0.0024443597,"teacher_disagreement_score":0.011672528,"about_ca_system_score_codex":0.00045168935,"about_ca_system_score_gemma":0.0010548694,"threshold_uncertainty_score":0.039048493},"labels":[],"label_agreement":null},{"id":"W4394931129","doi":"10.1002/jcd.21937","title":"On equitably 2‐colourable odd cycle decompositions","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics","score_opus":0.012082366208100104,"score_gpt":0.23988717804543583,"score_spread":0.22780481183733572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394931129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8336353,0.00023685941,0.14643368,0.00021120424,0.0000342896,0.00009444594,0.000293345,0.00009732593,0.018963667],"genre_scores_gemma":[0.9725238,0.000117406336,0.02275493,0.00008298286,0.000021392418,0.00008145593,0.00029968182,0.000042520947,0.0040757423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.00019268553,0.000045512767,0.00016721868,0.0001551741,0.00028300151],"domain_scores_gemma":[0.9981205,0.0007858217,0.00031349927,0.00024000496,0.0002726983,0.00026739785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007750346,0.00049779296,0.00044730733,0.0010964767,0.00084385317,0.0013226917,0.0005250876,0.0004918271,0.005057893],"category_scores_gemma":[0.0030851904,0.0003636563,0.00035227084,0.0006831432,0.0009951869,0.0013721093,0.0012718987,0.00072760024,0.00032599602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009480873,0.00019865809,0.005843797,0.00022880107,0.000051135743,0.000676889,0.0013425064,0.06629897,0.032928344,0.8445555,0.0031345377,0.043792937],"study_design_scores_gemma":[0.0001096844,0.00015768816,0.0023792211,0.000076052056,0.00003626409,0.0005793425,0.000732215,0.17841282,0.013850414,0.7925613,0.011062139,0.000042862182],"about_ca_topic_score_codex":0.0009021732,"about_ca_topic_score_gemma":0.0010990965,"teacher_disagreement_score":0.005057893,"about_ca_system_score_codex":0.0008675168,"about_ca_system_score_gemma":0.00045332592,"threshold_uncertainty_score":0.016920388},"labels":[],"label_agreement":null},{"id":"W4399741283","doi":"10.1002/jcd.21949","title":"Mutual incidence matrix of two balanced incomplete block designs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke","keywords":"Mathematics; Incidence matrix; Eigenvalues and eigenvectors; Block (permutation group theory); Matrix (chemical analysis); Incidence (geometry); Combinatorics; Set (abstract data type); Block design; Computer science; Geometry","score_opus":0.02045178124355624,"score_gpt":0.27014474296842816,"score_spread":0.24969296172487193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399741283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35459727,0.000110176064,0.62562126,0.00014372244,0.000063132095,0.000076012824,0.00017047714,0.0001909472,0.019026982],"genre_scores_gemma":[0.94049734,0.000051976942,0.05506684,0.000040009378,0.0000215342,0.00011034751,0.000091886475,0.00001912588,0.0041009868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988379,0.00036481128,0.00004469209,0.00015586002,0.00045748334,0.00013935631],"domain_scores_gemma":[0.9988398,0.0003423351,0.00027238522,0.0001795199,0.00027524534,0.00009065572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923873,0.00038303994,0.0003717712,0.0007468093,0.00033809963,0.00089516095,0.0004641294,0.00048629366,0.0044830954],"category_scores_gemma":[0.0022847892,0.0002301637,0.00027304346,0.00045963787,0.0005769323,0.0008091589,0.0005827484,0.0003689403,0.0003474382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006537562,0.00016240039,0.0040107337,0.00011148766,0.000096347874,0.0004668317,0.00020351088,0.2172089,0.06944977,0.64238733,0.0016821141,0.06356678],"study_design_scores_gemma":[0.00008519815,0.00050210307,0.002408601,0.00003978898,0.00007233239,0.0005148382,0.00012970691,0.8466893,0.028490283,0.11423967,0.006763556,0.00006468455],"about_ca_topic_score_codex":0.00046799786,"about_ca_topic_score_gemma":0.0005803868,"teacher_disagreement_score":0.0044830954,"about_ca_system_score_codex":0.0005904501,"about_ca_system_score_gemma":0.00042918738,"threshold_uncertainty_score":0.014997482},"labels":[],"label_agreement":null},{"id":"W4403201646","doi":"10.1002/jcd.21957","title":"Nestings of BIBDs with block size four","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block (permutation group theory); Block size; Combinatorics; Biology; Ecology; Key (lock)","score_opus":0.013564207698928028,"score_gpt":0.20742279509058476,"score_spread":0.19385858739165673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403201646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5199055,0.00039258142,0.4280826,0.00028587764,0.000109307264,0.00015858373,0.00027731698,0.00062859023,0.05015954],"genre_scores_gemma":[0.88107884,0.00010676558,0.10988234,0.00008367317,0.000013528593,0.000088303525,0.00014016283,0.00006368993,0.008542721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915063,0.00022941142,0.00009258793,0.00010167157,0.00026002713,0.00016567105],"domain_scores_gemma":[0.9981426,0.00051715656,0.00036115706,0.00039205997,0.0003824279,0.00020463449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915772,0.00023534038,0.0003094324,0.0005052345,0.00064895774,0.00082831073,0.00040778978,0.0003609166,0.004561872],"category_scores_gemma":[0.0024944227,0.00043357298,0.00027425247,0.0003699785,0.00086112175,0.0011779065,0.0011725343,0.00042425806,0.0005150818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034521194,0.000105703075,0.0067506954,0.0003071686,0.000050280323,0.001112898,0.00092167285,0.04180595,0.06476133,0.8209398,0.0032668472,0.059632517],"study_design_scores_gemma":[0.00016218604,0.00072308443,0.003601437,0.00027005203,0.00008854542,0.0019161322,0.00085451,0.3167124,0.0537287,0.54026383,0.081591144,0.000088015775],"about_ca_topic_score_codex":0.0011703243,"about_ca_topic_score_gemma":0.0021164676,"teacher_disagreement_score":0.004561872,"about_ca_system_score_codex":0.0005856968,"about_ca_system_score_gemma":0.0005020359,"threshold_uncertainty_score":0.015260994},"labels":[],"label_agreement":null},{"id":"W4404492401","doi":"10.1002/jcd.21961","title":"Tic‐Tac‐Toe on Designs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; Toronto Metropolitan University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mount Allison University","keywords":"Mathematics; Combinatorics","score_opus":0.047379995541963406,"score_gpt":0.29280148961952435,"score_spread":0.24542149407756095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404492401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33000612,0.00020566807,0.5399307,0.0009578123,0.00017823072,0.00034193465,0.0002694542,0.00042899422,0.12768109],"genre_scores_gemma":[0.9156684,0.00008822589,0.0643675,0.00017979331,0.00003225312,0.00023537902,0.00011394023,0.00004137597,0.019273212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968759,0.0014809126,0.00015490531,0.00036585485,0.000580378,0.0005419229],"domain_scores_gemma":[0.9960639,0.0020223125,0.0002947102,0.00053839816,0.00051663944,0.00056409946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022647714,0.0007227252,0.0005266462,0.00059698505,0.0008263836,0.0020384446,0.00069219235,0.0013853922,0.012222976],"category_scores_gemma":[0.006998766,0.00037366844,0.00054842175,0.00039382328,0.0019913977,0.002119254,0.0016815028,0.001339019,0.00093977415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063989195,0.00009868065,0.0015113705,0.00013276438,0.00004112123,0.00030526795,0.00039636332,0.038879763,0.007429772,0.9182852,0.0022585783,0.03002124],"study_design_scores_gemma":[0.00013667098,0.00069649203,0.0007959212,0.00006799637,0.000038026537,0.00030775438,0.0006520142,0.2386344,0.005609319,0.73129606,0.021720123,0.000045182012],"about_ca_topic_score_codex":0.001946445,"about_ca_topic_score_gemma":0.0024843107,"teacher_disagreement_score":0.012222976,"about_ca_system_score_codex":0.0014599729,"about_ca_system_score_gemma":0.0008462141,"threshold_uncertainty_score":0.04088992},"labels":[],"label_agreement":null},{"id":"W4407584381","doi":"10.1002/jcd.21963","title":"New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Shift register; Register (sociolinguistics); Combinatorics; Arithmetic; Computer science; Telecommunications; Linguistics","score_opus":0.02288744062894737,"score_gpt":0.2535322213116313,"score_spread":0.2306447806826839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407584381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4681852,0.0009140166,0.5074838,0.0005219032,0.00021736728,0.0001219263,0.00040242533,0.0016083801,0.020544972],"genre_scores_gemma":[0.91046023,0.00029697682,0.08439413,0.0001825466,0.000096370495,0.00015352112,0.00029403213,0.000104383565,0.004017872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992569,0.00018510895,0.00005661528,0.00012161944,0.00021426294,0.00016543097],"domain_scores_gemma":[0.99718565,0.0011213358,0.00053637393,0.00054228393,0.0004050574,0.00020937485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049229804,0.00048639564,0.00046269599,0.00078494713,0.000601536,0.0007822806,0.000504491,0.0005911528,0.003089902],"category_scores_gemma":[0.0027843758,0.00042179797,0.0004701826,0.0008582907,0.0006541661,0.0010998108,0.0013429123,0.0006520806,0.0007207711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009935566,0.0001662423,0.006030428,0.00037660336,0.00011821262,0.0019811196,0.001150782,0.10114141,0.2070425,0.473209,0.0084283585,0.19936177],"study_design_scores_gemma":[0.00015098951,0.0012425015,0.0030695016,0.00014546284,0.000104611405,0.0034032776,0.00044131637,0.49494413,0.18607607,0.2608212,0.04938796,0.00021299614],"about_ca_topic_score_codex":0.00017133613,"about_ca_topic_score_gemma":0.00013323959,"teacher_disagreement_score":0.003089902,"about_ca_system_score_codex":0.0003777789,"about_ca_system_score_gemma":0.00031627013,"threshold_uncertainty_score":0.010336757},"labels":[],"label_agreement":null},{"id":"W4408857251","doi":"10.1002/jcd.21967","title":"The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Variable (mathematics); Arithmetic; Discrete mathematics; Mathematical analysis","score_opus":0.0048401494233164385,"score_gpt":0.1939390366370824,"score_spread":0.18909888721376597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408857251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15218024,0.00016028639,0.8190862,0.0010666857,0.000051629464,0.00047007386,0.00030292186,0.00033541233,0.02634664],"genre_scores_gemma":[0.32522693,0.0001934517,0.6623119,0.00021511232,0.000039685212,0.0004352499,0.00053450314,0.000078338264,0.010964834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992329,0.00026815577,0.00003668799,0.00013028077,0.00016890997,0.00016309606],"domain_scores_gemma":[0.99889636,0.0006557156,0.000082999104,0.0001607507,0.00011653625,0.000087552224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935063,0.0003892664,0.00044617843,0.00084117823,0.00085643586,0.0010253687,0.0011995644,0.0009954248,0.00657769],"category_scores_gemma":[0.00340076,0.0003683004,0.00080106274,0.0008167373,0.0011800049,0.0018137178,0.0021013801,0.0014735374,0.00054095074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000880731,0.00021842335,0.0012815546,0.0002172983,0.00003493114,0.0002641179,0.00048207387,0.06177912,0.006600386,0.8046674,0.008127498,0.11623918],"study_design_scores_gemma":[0.000118743425,0.00012050057,0.0005423278,0.00009103706,0.000049448237,0.00031416948,0.00048056562,0.37916857,0.0073604803,0.5856991,0.0260105,0.00004452602],"about_ca_topic_score_codex":0.0021922959,"about_ca_topic_score_gemma":0.0044284198,"teacher_disagreement_score":0.00657769,"about_ca_system_score_codex":0.00080867176,"about_ca_system_score_gemma":0.0012602336,"threshold_uncertainty_score":0.022004604},"labels":[],"label_agreement":null},{"id":"W4409146582","doi":"10.1002/jcd.21981","title":"On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group Sym(7) $\\text{Sym}(7)$","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Regina","funders":"","keywords":"Mathematics; Association scheme; Group (periodic table); Symmetric group; Scheme (mathematics); Combinatorics; Algebra over a field; Pure mathematics; Chemistry; Organic chemistry","score_opus":0.03970540340867535,"score_gpt":0.3046826059921753,"score_spread":0.26497720258349994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409146582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89068526,0.00032984608,0.070818305,0.00058939477,0.00016579867,0.000062454346,0.00023523562,0.00010334828,0.03701032],"genre_scores_gemma":[0.9727007,0.00026030568,0.013432737,0.0001852978,0.0001975802,0.000057968384,0.0002716821,0.0000457302,0.0128480075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992505,0.00016830498,0.00003436604,0.00011669658,0.00019892943,0.0002312744],"domain_scores_gemma":[0.99868447,0.00036307637,0.00030854042,0.00013118946,0.00019831113,0.00031437058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090186734,0.0004769824,0.00072954263,0.0018933329,0.0015919488,0.0022011057,0.0007432993,0.0006801245,0.009243876],"category_scores_gemma":[0.0018313045,0.00030643848,0.00071476673,0.00096996117,0.00325276,0.0029506637,0.0016081111,0.0014630717,0.001305212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035560486,0.000021646045,0.00022131373,0.00001319255,0.0000042051465,0.000056286677,0.00019438368,0.0013843188,0.0012615923,0.99325246,0.00037993095,0.0031751534],"study_design_scores_gemma":[0.00001721906,0.000049915743,0.0003260271,0.0000128643205,0.000004153859,0.00009188206,0.000111422916,0.008528452,0.0015885134,0.9869888,0.0022519,0.00002892742],"about_ca_topic_score_codex":0.00170374,"about_ca_topic_score_gemma":0.0013847912,"teacher_disagreement_score":0.009243876,"about_ca_system_score_codex":0.0011328198,"about_ca_system_score_gemma":0.0010276355,"threshold_uncertainty_score":0.030923843},"labels":[],"label_agreement":null},{"id":"W4410382679","doi":"10.1002/jcd.21988","title":"How to Burn a Latin Square","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Mathematics; Square (algebra); Combinatorics; Statistics; Geometry; Food science","score_opus":0.014002726562170368,"score_gpt":0.22534505286964837,"score_spread":0.211342326307478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410382679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5807196,0.00040626523,0.39082846,0.0005671727,0.00012875079,0.000110133944,0.00007998734,0.00041434626,0.026745299],"genre_scores_gemma":[0.8913427,0.0001878422,0.09689588,0.00019034157,0.00003001196,0.000083177234,0.00009001411,0.0001524437,0.011027599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994266,0.00015734014,0.00003181905,0.00013093036,0.0001357563,0.00011761877],"domain_scores_gemma":[0.9980843,0.0007924217,0.00026381869,0.0004977535,0.0002131804,0.0001485185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070014846,0.00023465118,0.00033516507,0.00050615927,0.00095431873,0.0010722822,0.0007390111,0.0006928232,0.006545668],"category_scores_gemma":[0.003615369,0.00032556462,0.0003249432,0.0004640911,0.001606987,0.0030302845,0.0010226147,0.000738016,0.0008288682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057572674,0.00014802872,0.0062065683,0.00029146345,0.00007005197,0.00065660075,0.0011474742,0.11023187,0.08632108,0.68522614,0.0029595692,0.10616552],"study_design_scores_gemma":[0.000051497456,0.0003280425,0.0014208189,0.000100310936,0.00003748314,0.0007276986,0.0010881523,0.35946313,0.07034596,0.54476213,0.021617003,0.000057809273],"about_ca_topic_score_codex":0.00062804046,"about_ca_topic_score_gemma":0.0007840556,"teacher_disagreement_score":0.006545668,"about_ca_system_score_codex":0.0005215289,"about_ca_system_score_gemma":0.0003523694,"threshold_uncertainty_score":0.021897435},"labels":[],"label_agreement":null},{"id":"W4411391499","doi":"10.1002/jcd.21985","title":"Strong External Difference Families and Classification of α‐Valuations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bipartite graph; Affine transformation; Dihedral group; Combinatorics; Alpha (finance); Sequence (biology); Discrete mathematics; Pure mathematics; Group (periodic table); Statistics; Graph","score_opus":0.02747110979178699,"score_gpt":0.2607734652761141,"score_spread":0.23330235548432712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411391499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7378787,0.00014908427,0.22595468,0.00030993109,0.000059667414,0.000060027327,0.00030734006,0.00015416139,0.035126485],"genre_scores_gemma":[0.9789185,0.00006498144,0.016119383,0.00005390234,0.000024430352,0.00003406062,0.00019126138,0.000021814642,0.0045717317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993507,0.000153446,0.000048409755,0.000117305055,0.00015650857,0.00017363435],"domain_scores_gemma":[0.9982008,0.00082438305,0.00019190168,0.00027397124,0.00023070184,0.00027818006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011018887,0.00028493244,0.00033429387,0.0012808125,0.00095974415,0.0015204374,0.0005264527,0.00047880952,0.005801974],"category_scores_gemma":[0.0026135661,0.00021146395,0.0006112063,0.00073993846,0.001803811,0.0026736008,0.0011286384,0.0011697921,0.0003814397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006315471,0.000043848864,0.0023330848,0.000029739935,0.000007629569,0.00010505703,0.00021140293,0.0029947562,0.0033861294,0.9764948,0.00053450343,0.0137958685],"study_design_scores_gemma":[0.000023670169,0.00008343795,0.0017842288,0.00004051229,0.000011210325,0.00043952928,0.00033794562,0.021669446,0.006491784,0.9602461,0.008846048,0.000026056912],"about_ca_topic_score_codex":0.00021861444,"about_ca_topic_score_gemma":0.00020479334,"teacher_disagreement_score":0.005801974,"about_ca_system_score_codex":0.0008934409,"about_ca_system_score_gemma":0.00023083267,"threshold_uncertainty_score":0.019409537},"labels":[],"label_agreement":null},{"id":"W4414086407","doi":"10.1002/jcd.22004","title":"Steiner Triple Systems With High Discrepancy","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Steiner system; Mathematical proof; Combinatorial proof; Order (exchange); Combinatorial design; Type (biology)","score_opus":0.02312655991804681,"score_gpt":0.2846814135717978,"score_spread":0.26155485365375103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414086407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81358343,0.00046879958,0.16876884,0.00054110546,0.000059640926,0.000035327626,0.0002756355,0.00023415261,0.016033188],"genre_scores_gemma":[0.9747873,0.00013079931,0.022427578,0.00009181001,0.000027997372,0.000047812857,0.00019569889,0.00004244962,0.0022486656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987949,0.00041260858,0.00007589652,0.00023042546,0.00033200794,0.00015418924],"domain_scores_gemma":[0.9941361,0.0033675088,0.00072883663,0.0006894399,0.00062958576,0.00044859224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257192,0.0003732017,0.00063017226,0.00084539846,0.0007371429,0.0013400703,0.00077521586,0.00089393056,0.004074965],"category_scores_gemma":[0.0071625444,0.0005500834,0.00047024668,0.0006850009,0.0015071771,0.002001558,0.0015265776,0.0013871229,0.0004129833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003201149,0.000057099343,0.004629418,0.00020088008,0.00003420908,0.00027610952,0.00042772427,0.060035665,0.015505603,0.9040976,0.0016018971,0.012813661],"study_design_scores_gemma":[0.00005852636,0.00024158605,0.0018532287,0.00007445829,0.000020494002,0.0006369736,0.0002865142,0.17456385,0.009148134,0.8074491,0.0056243506,0.000042734602],"about_ca_topic_score_codex":0.0004905468,"about_ca_topic_score_gemma":0.00041899655,"teacher_disagreement_score":0.004074965,"about_ca_system_score_codex":0.0012568837,"about_ca_system_score_gemma":0.0003995468,"threshold_uncertainty_score":0.013632119},"labels":[],"label_agreement":null},{"id":"W4414774764","doi":"10.1002/jcd.22009","title":"New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Software; Electronic circuit; Digital electronics; Set (abstract data type); Difference set","score_opus":0.014142629376500527,"score_gpt":0.2521182587800359,"score_spread":0.2379756294035354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414774764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075559735,0.00057777285,0.89462185,0.00025324113,0.0001794427,0.00015342195,0.00022328216,0.0006158125,0.027815381],"genre_scores_gemma":[0.42999065,0.0003837149,0.5611517,0.00021770682,0.0000696087,0.00019476126,0.00047243133,0.00017092422,0.007348461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994418,0.00011407876,0.000042157975,0.000082446735,0.00026932577,0.000050094874],"domain_scores_gemma":[0.999006,0.00053320796,0.00005370894,0.00019293306,0.00016410426,0.000050111103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044904463,0.00034951823,0.00059930334,0.0012350314,0.0006037646,0.0008073016,0.001240132,0.00051397533,0.0062806546],"category_scores_gemma":[0.0024634427,0.00030610966,0.00060646865,0.001311054,0.00065870996,0.0017595842,0.0014381127,0.0009615124,0.0007348729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047667854,0.00021417114,0.0008473788,0.00036427987,0.00006042046,0.00025349765,0.00026182353,0.07022425,0.058983292,0.5017199,0.008462011,0.35813224],"study_design_scores_gemma":[0.00018246954,0.00046574973,0.00058255764,0.00006298791,0.00004601026,0.00082632323,0.00008172078,0.6988443,0.032790087,0.23680468,0.029241735,0.00007132817],"about_ca_topic_score_codex":0.00057517417,"about_ca_topic_score_gemma":0.0007478922,"teacher_disagreement_score":0.0062806546,"about_ca_system_score_codex":0.0005158861,"about_ca_system_score_gemma":0.0004068476,"threshold_uncertainty_score":0.021010876},"labels":[],"label_agreement":null},{"id":"W4415043018","doi":"10.1002/jcd.22011","title":"On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Ministrstvo za Izobraževanje, Znanost in Šport; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Adjacency matrix; Bipartite graph; Vertex (graph theory); Diagonal; Adjacency list; Complete bipartite graph; Diagonal matrix; Matrix (chemical analysis)","score_opus":0.06420158687839946,"score_gpt":0.330335616842609,"score_spread":0.26613402996420954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415043018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8227347,0.00011248173,0.1584146,0.00065481523,0.000028744957,0.00004160312,0.0003184158,0.00015056427,0.017544055],"genre_scores_gemma":[0.98988193,0.00008017889,0.007946016,0.00008761038,0.00004376058,0.000027735574,0.00019388598,0.000029619461,0.0017093065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938536,0.00020246691,0.000022661567,0.00013458898,0.00010068037,0.00015420288],"domain_scores_gemma":[0.9954218,0.0024231253,0.0006982904,0.0005041226,0.00043203757,0.0005205618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010116884,0.00028662826,0.00044090647,0.00081412226,0.00092656707,0.0010866547,0.00054405455,0.0005130977,0.004401172],"category_scores_gemma":[0.008032576,0.00035852124,0.00036653312,0.00070242176,0.00187376,0.002163978,0.0010287934,0.0009100309,0.00041952808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003281994,0.000057417143,0.0017295068,0.000064507825,0.000010246353,0.00027618877,0.00032366198,0.019823704,0.0068791616,0.96146655,0.0016161776,0.0074245757],"study_design_scores_gemma":[0.00008672537,0.000114515264,0.0015685698,0.000021623462,0.000016563132,0.00038444914,0.00029122105,0.13861547,0.0031278473,0.8535592,0.0021870928,0.00002677669],"about_ca_topic_score_codex":0.0010985134,"about_ca_topic_score_gemma":0.0010889325,"teacher_disagreement_score":0.004401172,"about_ca_system_score_codex":0.0006327704,"about_ca_system_score_gemma":0.00042996832,"threshold_uncertainty_score":0.01472342},"labels":[],"label_agreement":null},{"id":"W7117447460","doi":"10.1002/jcd.70000","title":"Recursive and Cyclic Constructions for Double‐Change Covering Designs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Construct (python library); Block (permutation group theory); Block design; Block size; Order (exchange)","score_opus":0.03945158606277906,"score_gpt":0.2684919453883778,"score_spread":0.22904035932559874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117447460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31526116,0.00022774786,0.65614295,0.00013340746,0.000056489083,0.00015332864,0.00021084135,0.000488791,0.027325196],"genre_scores_gemma":[0.70286,0.00009644353,0.2912733,0.00009779054,0.000025908455,0.00021764044,0.00032057878,0.00007820663,0.0050301766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993585,0.00017342535,0.00004285972,0.00010311619,0.00020076045,0.000121371326],"domain_scores_gemma":[0.99873203,0.00053016935,0.00015790369,0.00027731573,0.00024001965,0.00006261466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055259216,0.0003055985,0.000238486,0.0007014541,0.00047922143,0.000517921,0.00050965033,0.0004036258,0.0031261737],"category_scores_gemma":[0.001638732,0.0002833404,0.00045376082,0.00046230337,0.00060617883,0.0005875167,0.00067165797,0.00051639555,0.000421107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029249708,0.00016478273,0.0030111223,0.0002761595,0.000036271358,0.0004635624,0.0006376649,0.051880598,0.13242157,0.6220459,0.003489795,0.1852802],"study_design_scores_gemma":[0.00019188365,0.0012178137,0.004211189,0.00018506017,0.00011768628,0.002031473,0.00035661078,0.35994923,0.20178598,0.33027253,0.09953652,0.00014415717],"about_ca_topic_score_codex":0.00052550115,"about_ca_topic_score_gemma":0.00091867836,"teacher_disagreement_score":0.0031261737,"about_ca_system_score_codex":0.00058584975,"about_ca_system_score_gemma":0.00036455184,"threshold_uncertainty_score":0.010458112},"labels":[],"label_agreement":null}]}