{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32039192,0.000078376586,0.65889984,0.0019067032,0.0013857459,0.0008678136,0.0000024940723,0.00008194132,0.016385151],"genre_scores_gemma":[0.8181345,0.000014736139,0.18115458,0.00012531526,0.00032267283,0.000010337508,8.419258e-7,0.000022109578,0.00021489167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847037,0.00018216444,0.0006910761,0.00009100135,0.00040045154,0.00016496367],"domain_scores_gemma":[0.9980438,0.0007841927,0.00041555671,0.00012478369,0.0004486561,0.00018301209],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006316723,0.00014491976,0.00041883552,0.00006724465,0.00007768822,0.00013648109,0.00016311978,0.00009602671,0.0012455708],"category_scores_gemma":[0.00082060765,0.000102314545,0.00010185467,0.00012214783,0.00008204369,0.00033654363,0.00002561839,0.00021696788,0.000042635176],"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.000035428402,0.00029767572,0.000050611077,0.0000625215,0.00004306458,0.0000036426304,0.00032871027,3.784376e-7,0.010837281,0.9552234,0.031963382,0.0011539053],"study_design_scores_gemma":[0.00095845835,0.0004800167,0.0002969429,0.00005748504,0.000044562003,0.00007062328,0.00019023192,0.0014446379,0.003978254,0.9910302,0.0013182666,0.00013028922],"about_ca_topic_score_codex":0.0000047818653,"about_ca_topic_score_gemma":3.7126998e-7,"teacher_disagreement_score":0.4977426,"about_ca_system_score_codex":0.00004579081,"about_ca_system_score_gemma":0.000051824463,"threshold_uncertainty_score":0.9996674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92914605,0.0014559397,0.02047062,0.00009750639,0.035156056,0.0004963607,0.0000124516955,0.00029281373,0.012872213],"genre_scores_gemma":[0.99827933,0.00001550288,0.00053346524,0.000023259601,0.0010442052,0.0000060796438,0.000001142287,0.000043705215,0.000053316788],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980378,0.00025330196,0.000717979,0.000105805884,0.00051464845,0.00037042826],"domain_scores_gemma":[0.99859804,0.00018522391,0.00024420308,0.00021746346,0.0003691096,0.00038594782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001468623,0.00022714889,0.0005413854,0.00020403408,0.00006759025,0.000083098545,0.0004435094,0.00015541489,0.00001996413],"category_scores_gemma":[0.00017221583,0.00020533313,0.00018297009,0.00034178334,0.00005081609,0.00031008234,0.000029749346,0.00035126705,0.00004555092],"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.0031994008,0.00082297536,0.0026977456,0.0003694545,0.0017927964,0.001061904,0.005368287,0.061545357,0.41847977,0.30410546,0.19892131,0.0016355172],"study_design_scores_gemma":[0.035355516,0.009421238,0.0018436246,0.00089600676,0.0006823452,0.002105572,0.0022402843,0.011291021,0.1043836,0.69349337,0.13545379,0.0028336523],"about_ca_topic_score_codex":0.0000032504627,"about_ca_topic_score_gemma":7.2853663e-7,"teacher_disagreement_score":0.38938788,"about_ca_system_score_codex":0.00017507949,"about_ca_system_score_gemma":0.00014009405,"threshold_uncertainty_score":0.8373242},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83498186,0.0008544798,0.13062993,0.0000820097,0.02426208,0.00036431776,0.0000027311644,0.00013660693,0.008685993],"genre_scores_gemma":[0.9987075,0.000014540111,0.00031193267,0.00001383416,0.00089492096,0.000006322998,3.9044053e-7,0.000027488495,0.000023116349],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894357,0.000059124337,0.00046856166,0.000060655504,0.00025637183,0.00021172262],"domain_scores_gemma":[0.99927795,0.000098607095,0.00012262887,0.00015780276,0.0001685503,0.00017447126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046278854,0.00014192438,0.0002903927,0.00012639647,0.000049544997,0.000076276585,0.00024238628,0.000098328375,0.000346702],"category_scores_gemma":[0.000043711094,0.00011801385,0.00016456352,0.00015822962,0.000027451799,0.000362652,0.000008795794,0.00026767293,0.00013779337],"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.00039835204,0.0008988689,0.0011808474,0.00024224212,0.0011163488,0.00024111853,0.0012592113,0.003872002,0.36975226,0.34957302,0.25331858,0.018147172],"study_design_scores_gemma":[0.011278213,0.0018500079,0.0015960224,0.00028009998,0.00017188492,0.00037270863,0.0002904933,0.008874387,0.03557005,0.9010613,0.03780225,0.000852576],"about_ca_topic_score_codex":0.0000040337277,"about_ca_topic_score_gemma":3.5780195e-7,"teacher_disagreement_score":0.5514883,"about_ca_system_score_codex":0.000041287316,"about_ca_system_score_gemma":0.0000262695,"threshold_uncertainty_score":0.48124653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882368,0.0008352453,0.004103056,0.00006617569,0.0040526073,0.00011522786,0.0000055641194,0.000086146225,0.00249919],"genre_scores_gemma":[0.9991876,0.0002270835,0.00027700234,0.00002030376,0.00024698506,0.0000029670928,0.0000013873645,0.000023620305,0.000013080089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893457,0.00011215429,0.0004543162,0.00008109139,0.00020598643,0.00021189381],"domain_scores_gemma":[0.9993094,0.00017514225,0.00012407443,0.00012840156,0.00009380272,0.00016918576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038880145,0.00015459918,0.0003301179,0.0001981265,0.0001436793,0.00007093642,0.0001753822,0.00008510484,0.000034568457],"category_scores_gemma":[0.000017489501,0.00014411057,0.00013762496,0.00021157067,0.000057458063,0.00025054684,0.000014215118,0.00024286308,0.0000071440204],"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.0007562682,0.0005474479,0.0051682247,0.0001661348,0.0011208628,0.00053694524,0.0021058547,0.008607464,0.17028494,0.79200137,0.0146503085,0.0040541585],"study_design_scores_gemma":[0.009977377,0.001233243,0.012035952,0.0003717644,0.00033638437,0.0024622707,0.00058389147,0.00446172,0.0077321553,0.9291021,0.03068775,0.0010153652],"about_ca_topic_score_codex":0.000005389993,"about_ca_topic_score_gemma":0.0000017601079,"teacher_disagreement_score":0.16255279,"about_ca_system_score_codex":0.00003114018,"about_ca_system_score_gemma":0.000015065379,"threshold_uncertainty_score":0.5876658},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7950868,0.00021202092,0.18515979,0.000049069244,0.018383063,0.00036466875,0.000011548701,0.00009088807,0.0006421477],"genre_scores_gemma":[0.99589276,0.0000045456595,0.0019730488,0.000006049181,0.0020748996,0.000008575938,0.0000014443307,0.000028796063,0.000009852428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888444,0.00007872186,0.00049917557,0.00009391898,0.00024893798,0.00019483564],"domain_scores_gemma":[0.9990649,0.00024305997,0.00021003572,0.00013419347,0.00024638927,0.000101424564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000689891,0.0001505717,0.00032226346,0.00017467498,0.000077416356,0.000053085223,0.00016904784,0.00008474274,0.000027629942],"category_scores_gemma":[0.00021669001,0.00013044814,0.0001822107,0.00015839854,0.000041342588,0.00019356613,0.0000067527712,0.00019494991,0.0000048926026],"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.0007278757,0.00012982982,0.0037443936,0.00033476224,0.00038687428,0.000008442474,0.00057533884,0.002548972,0.06384336,0.90449256,0.004527084,0.01868048],"study_design_scores_gemma":[0.00905307,0.0031323512,0.007544352,0.0004070336,0.0002403347,0.0003719677,0.00019890745,0.0069894916,0.057340495,0.8629994,0.050748374,0.00097422063],"about_ca_topic_score_codex":7.999531e-7,"about_ca_topic_score_gemma":0.0000017011256,"teacher_disagreement_score":0.20080598,"about_ca_system_score_codex":0.000038911097,"about_ca_system_score_gemma":0.000048381244,"threshold_uncertainty_score":0.5319521},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832208,0.00026911809,0.0029537592,0.000046682457,0.012111327,0.0003222501,0.000004581304,0.000044581826,0.0010268847],"genre_scores_gemma":[0.998895,0.000009182828,0.00008242179,0.000019761537,0.0008735233,0.000013776891,6.5908625e-7,0.000029821238,0.000075884935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895906,0.000111301844,0.00037323928,0.000046101573,0.00021634894,0.0002939423],"domain_scores_gemma":[0.99901783,0.0004974484,0.00013459983,0.0001404656,0.00008406907,0.00012560796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011408492,0.00014453294,0.00023109929,0.00008806917,0.00009835201,0.00004626118,0.00022486736,0.0000818312,0.00002584971],"category_scores_gemma":[0.000061956074,0.0000853623,0.00019260889,0.00011708188,0.000024916422,0.00021820492,0.0000053549525,0.00020760966,0.000014993409],"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.00024971127,0.00022304765,0.0011721046,0.00010930407,0.0003421444,0.0000032104622,0.004206532,0.0015290673,0.025015766,0.9410272,0.025896365,0.00022554328],"study_design_scores_gemma":[0.004940276,0.0026289856,0.0017562434,0.0004960118,0.00032768105,0.00008859132,0.0010149789,0.00066172134,0.26890942,0.561756,0.15646751,0.00095254777],"about_ca_topic_score_codex":9.966192e-7,"about_ca_topic_score_gemma":1.7309429e-7,"teacher_disagreement_score":0.37927118,"about_ca_system_score_codex":0.000047294616,"about_ca_system_score_gemma":0.000013641239,"threshold_uncertainty_score":0.34809735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9358428,0.0071311905,0.019509355,0.000018602783,0.034267243,0.0003255877,0.0000097886295,0.00006644226,0.002829007],"genre_scores_gemma":[0.9983167,0.000031895914,0.0002497706,0.0000020982309,0.0013265249,0.0000062403287,0.0000012221685,0.000024368426,0.000041190968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983495,0.00024465675,0.0008077788,0.000050178838,0.00031321906,0.00023466656],"domain_scores_gemma":[0.9989785,0.00019633172,0.00029798146,0.00015400792,0.00018226395,0.00019089469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011746833,0.00014948673,0.00048980175,0.00026375384,0.00005911593,0.00003127312,0.00022302807,0.00011427261,0.000024051407],"category_scores_gemma":[0.000056162804,0.00012769327,0.00023272463,0.00026875784,0.000035098434,0.0003715968,0.000011064434,0.00021085865,0.0000096708545],"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.0012935938,0.0013418876,0.0039130757,0.0009874891,0.0014477023,0.00005260332,0.0038591728,0.008631291,0.3076843,0.65186566,0.01748961,0.0014335964],"study_design_scores_gemma":[0.06481595,0.011119627,0.011127184,0.0043704496,0.002869398,0.0037903765,0.008468488,0.0063295728,0.50365466,0.16819829,0.21088548,0.004370489],"about_ca_topic_score_codex":0.0000060737284,"about_ca_topic_score_gemma":2.5239237e-7,"teacher_disagreement_score":0.48366737,"about_ca_system_score_codex":0.00007736738,"about_ca_system_score_gemma":0.00003729017,"threshold_uncertainty_score":0.5207181},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828283,0.00045607524,0.0102489,0.00000968334,0.005657569,0.00014329683,0.000008048747,0.000014622981,0.00063345954],"genre_scores_gemma":[0.9995914,0.000021199314,0.0002499242,0.000003848325,0.0001113907,0.0000014489975,3.620626e-7,0.000017755741,0.0000026721357],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998462,0.00032892908,0.0006716603,0.00005809146,0.000338586,0.00014072038],"domain_scores_gemma":[0.99898714,0.00021325951,0.00038052085,0.00017792576,0.00017304144,0.00006811028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000547585,0.00013319144,0.00040247143,0.00014146588,0.00005770342,0.000014057655,0.0002774085,0.00008864898,0.00002033339],"category_scores_gemma":[0.000073818206,0.00009837105,0.00028045027,0.0002555136,0.00007605731,0.000135157,0.000011891753,0.00021645348,0.0000012403361],"study_design_candidate":"bench_or_experimental","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.0002810848,0.00020026554,0.0012879275,0.00030871667,0.0004465394,0.000009148271,0.002293754,0.007653522,0.50473166,0.48201114,0.0004451677,0.00033106122],"study_design_scores_gemma":[0.0057858624,0.0011452927,0.00459479,0.00068549806,0.00022163696,0.00014753529,0.0005953728,0.0006655325,0.4895265,0.49443275,0.0017552844,0.00044393004],"about_ca_topic_score_codex":0.0000068395516,"about_ca_topic_score_gemma":0.0000014587615,"teacher_disagreement_score":0.016763054,"about_ca_system_score_codex":0.000057405985,"about_ca_system_score_gemma":0.00005790349,"threshold_uncertainty_score":0.40114552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9560414,0.00085317745,0.0083131725,0.00007877611,0.02366379,0.00035379396,0.0000052089763,0.00013569162,0.010554994],"genre_scores_gemma":[0.9992102,0.000020961072,0.00015566144,0.000062557105,0.0004980683,0.0000036276163,5.588479e-7,0.000033845623,0.0000145121585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872524,0.00020690006,0.00036290946,0.00007455501,0.00033307594,0.00029733614],"domain_scores_gemma":[0.99902004,0.00036325437,0.00012984719,0.00015598795,0.00006164259,0.00026922804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010343854,0.00019324357,0.00031324045,0.00026850458,0.000080130885,0.000043581385,0.00015051031,0.0001238493,0.000031661144],"category_scores_gemma":[0.00006637111,0.00016335308,0.00013918075,0.00019322342,0.00003899064,0.00020448305,0.0000054518237,0.0003347243,0.000015994077],"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.0022484506,0.0012560942,0.009283652,0.0002593166,0.00061225804,0.00013257762,0.0017232513,0.030848416,0.04321407,0.8771051,0.030166086,0.0031507306],"study_design_scores_gemma":[0.04981464,0.027524877,0.03594972,0.0041658143,0.0015006673,0.0009528239,0.0016716176,0.020544805,0.2913017,0.47515666,0.085473,0.0059436657],"about_ca_topic_score_codex":9.861423e-7,"about_ca_topic_score_gemma":1.1733641e-7,"teacher_disagreement_score":0.40194845,"about_ca_system_score_codex":0.00006247267,"about_ca_system_score_gemma":0.00002345455,"threshold_uncertainty_score":0.6661345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617059,0.0007820532,0.031489167,0.0000069755356,0.0038999333,0.00023394125,0.0000030410183,0.00007006944,0.0018089227],"genre_scores_gemma":[0.99795055,0.000040576295,0.001301047,0.000007644406,0.0005986915,0.000004601083,4.896417e-7,0.000070468064,0.000025948695],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99825364,0.00012910346,0.0005534393,0.00010684321,0.0005163515,0.0004406044],"domain_scores_gemma":[0.99857324,0.0003623335,0.0003556657,0.00024104715,0.00021694759,0.00025074315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000860756,0.00027909141,0.0005968714,0.00015065199,0.0000778133,0.000054533248,0.00028174729,0.00012143103,0.000028663851],"category_scores_gemma":[0.00007757976,0.00021332985,0.00012176892,0.00046693502,0.00005906232,0.0006135082,0.000016987804,0.00036489035,0.0000060542948],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.005210262,0.0010535002,0.04243173,0.0010553219,0.0025040351,0.00016052107,0.0042604534,0.067806154,0.8202984,0.053799994,0.0010972953,0.00032233715],"study_design_scores_gemma":[0.031001516,0.02622205,0.027940128,0.0066599664,0.0023278587,0.0034632059,0.0025393076,0.0011843352,0.85762364,0.018425027,0.018228058,0.004384891],"about_ca_topic_score_codex":0.0000061295946,"about_ca_topic_score_gemma":0.0000016067306,"teacher_disagreement_score":0.06662182,"about_ca_system_score_codex":0.00009480903,"about_ca_system_score_gemma":0.00006670126,"threshold_uncertainty_score":0.8699339},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8770385,0.016268888,0.04231415,0.0000640665,0.045848493,0.0006213169,0.000006346389,0.00014330076,0.017694978],"genre_scores_gemma":[0.9987413,0.00013312243,0.00033007743,0.000005028192,0.00069167675,0.000004579727,2.67353e-7,0.000028425678,0.00006547711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816865,0.00026776668,0.00068192225,0.00006020169,0.00042572603,0.00039571905],"domain_scores_gemma":[0.9985007,0.0006145702,0.00029417753,0.00026154233,0.0001532703,0.0001757621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024947058,0.00016051772,0.00035127832,0.00010754017,0.00015011757,0.000052126794,0.00046025758,0.000100154924,0.000017844788],"category_scores_gemma":[0.00015493274,0.00011227852,0.00019853412,0.0002956448,0.00008494653,0.0004105889,0.000024631798,0.00028721098,0.000013028049],"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.0003702239,0.00036612852,0.004727662,0.00022431502,0.00047590787,0.000018717748,0.0014419523,0.0015747773,0.08377573,0.8977467,0.007844476,0.0014334348],"study_design_scores_gemma":[0.010080484,0.0051554567,0.01757248,0.0017053758,0.00085986545,0.0008126507,0.002764708,0.0022938403,0.22970188,0.6246511,0.10240236,0.001999853],"about_ca_topic_score_codex":0.0000032766307,"about_ca_topic_score_gemma":4.6814193e-7,"teacher_disagreement_score":0.27309564,"about_ca_system_score_codex":0.00006294449,"about_ca_system_score_gemma":0.000033537195,"threshold_uncertainty_score":0.4578585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050877,0.00024760162,0.28537786,0.0010856178,0.0067143436,0.0002659444,0.000027330187,0.0001615909,0.0010319997],"genre_scores_gemma":[0.9601513,0.0000058312003,0.038638894,0.0001164112,0.0010287153,0.0000042627144,0.000021891372,0.000016463144,0.000016196505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791133,0.00018712197,0.00066158775,0.00022952816,0.00075102365,0.00025940093],"domain_scores_gemma":[0.9981716,0.00031820586,0.00055418524,0.00038000845,0.0002643253,0.000311646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126454,0.00018740905,0.00033031314,0.0002208133,0.00013152564,0.00017872635,0.0008687219,0.00009479672,0.000038595266],"category_scores_gemma":[0.00009481437,0.00016719368,0.0001357151,0.00038605605,0.00005277792,0.000437631,0.000121709716,0.0003381041,0.00006993713],"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.00017440405,0.001207527,0.00515418,0.000018676988,0.00025096055,0.00039949812,0.0014705918,0.00028898183,0.025855616,0.91998655,0.017377853,0.027815156],"study_design_scores_gemma":[0.015747815,0.0034954643,0.0017517683,0.00032970795,0.0002049473,0.00021321833,0.00096002605,0.071982846,0.19794767,0.6633615,0.042710412,0.0012946615],"about_ca_topic_score_codex":0.000049543163,"about_ca_topic_score_gemma":0.0000019688973,"teacher_disagreement_score":0.2566251,"about_ca_system_score_codex":0.0001763523,"about_ca_system_score_gemma":0.00029529864,"threshold_uncertainty_score":0.681796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9727305,0.00084243517,0.0008500037,0.0000214321,0.023255551,0.000078622405,8.9997536e-7,0.0000444395,0.0021760806],"genre_scores_gemma":[0.9993125,0.000035530353,0.00006832986,0.000009365976,0.00054025196,0.0000026317543,1.9459348e-7,0.00002007865,0.000011108624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989682,0.00013311197,0.0004198683,0.00004798252,0.00018475013,0.00024612853],"domain_scores_gemma":[0.9994399,0.00013592951,0.00010086762,0.00010886544,0.000073912306,0.00014051005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082437566,0.00011388555,0.00023500745,0.00040052974,0.000044655095,0.000022054806,0.00012186919,0.00009536882,0.000033389828],"category_scores_gemma":[0.00008083637,0.00010312783,0.00013832643,0.0003796004,0.00002334232,0.0003881185,0.000008972465,0.000293818,0.000020645786],"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.0007996677,0.0018625708,0.026229337,0.0002937506,0.0005845558,0.00023696599,0.00879402,0.016199531,0.37778962,0.5301424,0.034900382,0.0021671501],"study_design_scores_gemma":[0.013931929,0.0026972962,0.06691597,0.0015751242,0.0004789647,0.003250797,0.0033823864,0.0030148851,0.0911691,0.76496863,0.04627473,0.0023402092],"about_ca_topic_score_codex":0.0000053328495,"about_ca_topic_score_gemma":0.0000014043542,"teacher_disagreement_score":0.28662053,"about_ca_system_score_codex":0.00006755944,"about_ca_system_score_gemma":0.000013533853,"threshold_uncertainty_score":0.42054307},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5548886,0.001061997,0.42957318,0.00004911789,0.0077516274,0.00044020146,0.0000047803524,0.000090643145,0.0061398484],"genre_scores_gemma":[0.9947329,0.000020913678,0.0048299157,0.000013040678,0.00036574143,0.000006838022,0.0000016600795,0.000024105058,0.000004882854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980891,0.00040337976,0.00080983824,0.00009091501,0.00038755595,0.00021926149],"domain_scores_gemma":[0.99865836,0.00042125303,0.0003752938,0.00025923434,0.00018829138,0.00009757767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020200291,0.00017780585,0.00043903574,0.00016330804,0.0001447993,0.00006741621,0.00042664475,0.00008825405,0.000010776191],"category_scores_gemma":[0.0000872212,0.00012938722,0.0001909117,0.00027906414,0.000082134226,0.00023301883,0.000026711456,0.0002701099,0.0000038733424],"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.00023278175,0.00037238136,0.0013382358,0.00053058,0.00071094953,0.0000033477047,0.004587432,0.13035527,0.24217287,0.61641675,0.0012895315,0.0019898755],"study_design_scores_gemma":[0.010061075,0.001820511,0.004606643,0.0012373043,0.0007770658,0.0002243051,0.0021024651,0.30106938,0.085044384,0.56832653,0.023398736,0.0013315929],"about_ca_topic_score_codex":0.000011825366,"about_ca_topic_score_gemma":3.7023835e-7,"teacher_disagreement_score":0.43984428,"about_ca_system_score_codex":0.000046007808,"about_ca_system_score_gemma":0.000024491574,"threshold_uncertainty_score":0.52762574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9695504,0.0007343634,0.013243465,0.00002265814,0.0060471143,0.00012498522,0.000013013227,0.0000620983,0.010201944],"genre_scores_gemma":[0.9991072,0.000008923345,0.00059820036,0.000003909709,0.0002526977,0.0000011881057,0.0000020306838,0.000018264118,0.0000075823946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987922,0.00012521594,0.00065955525,0.000044317963,0.0002204347,0.00015829413],"domain_scores_gemma":[0.9992045,0.0002012832,0.00024193374,0.00013203057,0.000162041,0.000058181184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034201,0.00011383828,0.00033619173,0.00019638492,0.000075301214,0.000023506585,0.00022447668,0.000066025335,0.000025929106],"category_scores_gemma":[0.00001447244,0.00010846039,0.0002074887,0.00024061908,0.00004947203,0.00013069813,0.000010683897,0.00020707284,0.000004874904],"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.00009053677,0.00024109456,0.0020584231,0.00012748118,0.00021221071,0.000038176382,0.0002264346,0.009364773,0.292083,0.68881005,0.0065795616,0.0001682712],"study_design_scores_gemma":[0.0043691387,0.00079256395,0.007222665,0.0005141558,0.00021590175,0.00037335427,0.00023220183,0.0017210954,0.07588188,0.90179044,0.006367444,0.00051917846],"about_ca_topic_score_codex":0.000011657516,"about_ca_topic_score_gemma":0.0000013055794,"teacher_disagreement_score":0.21620111,"about_ca_system_score_codex":0.000030557287,"about_ca_system_score_gemma":0.000017803632,"threshold_uncertainty_score":0.44228864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11445546,0.00007021795,0.8702469,0.000118504875,0.009712792,0.0000585018,2.3546106e-7,0.000054344717,0.0052830623],"genre_scores_gemma":[0.9959296,0.000006725147,0.0033325735,0.00012526455,0.0005762383,2.689517e-7,1.0720784e-7,0.000009510714,0.000019721489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984022,0.00007598791,0.0004995891,0.00014295845,0.0005634435,0.00031587243],"domain_scores_gemma":[0.99843943,0.00049104576,0.00041253114,0.0002271214,0.0002340344,0.00019585693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018495513,0.00013217462,0.00024990275,0.00027666136,0.00013701033,0.00013655737,0.00077305036,0.00007038959,0.0000058494206],"category_scores_gemma":[0.00033678062,0.000115149065,0.00016939368,0.00045676,0.000025357227,0.00043289736,0.00004473918,0.00033831093,0.000018330522],"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.000020424575,0.00036016083,0.0017432222,0.00001617048,0.00007523318,0.00075232075,0.0004753552,0.00032203435,0.03826804,0.8921767,0.002693714,0.063096635],"study_design_scores_gemma":[0.0071703955,0.0053915167,0.018419828,0.0006215738,0.00007383924,0.0009788937,0.0001614928,0.0021739027,0.13550042,0.81926876,0.009126464,0.001112924],"about_ca_topic_score_codex":0.0000033285494,"about_ca_topic_score_gemma":5.1432136e-7,"teacher_disagreement_score":0.88147414,"about_ca_system_score_codex":0.00007713072,"about_ca_system_score_gemma":0.00011142283,"threshold_uncertainty_score":0.46956426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924258,0.00018476321,0.002386666,0.00012007276,0.0018671796,0.000118261574,0.000003500573,0.000011593666,0.0028821859],"genre_scores_gemma":[0.9996874,0.000007157045,0.00008555228,0.000013077044,0.00018144374,9.379103e-7,1.964865e-7,0.00001851775,0.000005761549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983915,0.00018368878,0.0007591802,0.000061785104,0.0003809468,0.00022287888],"domain_scores_gemma":[0.99802446,0.0014613064,0.00014769338,0.00016491621,0.00013173431,0.000069900045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019667728,0.00012802942,0.00036636525,0.0002795758,0.00002653317,0.000011937903,0.00024726338,0.000108684835,0.00006887289],"category_scores_gemma":[0.0004976535,0.00009242007,0.00012774767,0.0004613036,0.00008785315,0.00008717568,0.000011651996,0.00037041758,0.0000033429692],"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.00048064673,0.00034534285,0.0011704273,0.00016125069,0.000082623286,0.00007036012,0.0016643867,0.01271979,0.0080543775,0.9741283,0.00095318124,0.00016932008],"study_design_scores_gemma":[0.0038492063,0.002348363,0.005329981,0.00091646047,0.00009054021,0.000082106875,0.0018537223,0.0038061393,0.15238027,0.82830745,0.0006326971,0.0004030771],"about_ca_topic_score_codex":0.000006415877,"about_ca_topic_score_gemma":0.0000021767332,"teacher_disagreement_score":0.14582086,"about_ca_system_score_codex":0.000038886792,"about_ca_system_score_gemma":0.000036696867,"threshold_uncertainty_score":0.3768781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99047786,0.0006555228,0.0031320462,0.000020198566,0.0023417473,0.00027751533,0.0000051013194,0.000084123654,0.0030058722],"genre_scores_gemma":[0.9989674,0.000040675855,0.0005857068,0.000023100993,0.00027267035,0.000006696177,4.1054645e-7,0.000054750853,0.000048595517],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817365,0.00028143186,0.0005860503,0.00015665739,0.00039924815,0.00040294032],"domain_scores_gemma":[0.9986389,0.00047843246,0.00018132516,0.00024066691,0.0001957843,0.00026483892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009319463,0.00028187232,0.0005667856,0.00015006665,0.00014780028,0.0001063204,0.00023195615,0.00015595724,0.000040766783],"category_scores_gemma":[0.0001804896,0.00023341928,0.00010376971,0.00035159852,0.00007487883,0.00027361937,0.000015029389,0.0004250554,0.000005282322],"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.0053889314,0.0013092635,0.08444858,0.0012204194,0.0036934048,0.0017263606,0.005286748,0.061631415,0.48629063,0.32154006,0.026907371,0.0005568175],"study_design_scores_gemma":[0.06769273,0.016565548,0.025374582,0.002039337,0.0013317125,0.010866887,0.00375722,0.0056756414,0.18073922,0.507591,0.17227075,0.0060953563],"about_ca_topic_score_codex":0.0000071220184,"about_ca_topic_score_gemma":0.0000036117467,"teacher_disagreement_score":0.3055514,"about_ca_system_score_codex":0.00007298955,"about_ca_system_score_gemma":0.00009070278,"threshold_uncertainty_score":0.9518562},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9469332,0.000697384,0.033889715,0.000010308623,0.017456306,0.00063229294,0.000014821715,0.00006345193,0.00030251432],"genre_scores_gemma":[0.9992589,0.000032737236,0.000056455643,0.0000018670426,0.00044087062,0.00001682381,0.0000024629824,0.00006450479,0.00012538239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99713,0.000254273,0.0014585836,0.00015835512,0.0006859058,0.00031289784],"domain_scores_gemma":[0.9979893,0.00013949406,0.00093080674,0.0002852182,0.00048555355,0.00016964604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085808506,0.00034032157,0.0011350393,0.0004673971,0.000055761342,0.0000623967,0.00033187124,0.00020506262,0.000015435468],"category_scores_gemma":[0.00006192991,0.00023007863,0.00024136768,0.00050274056,0.000075288226,0.0003243203,0.000018477132,0.0003565375,0.0000022997212],"study_design_candidate":"bench_or_experimental","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.018883904,0.0050586043,0.0029243596,0.012011899,0.006696214,0.00042958907,0.0075671114,0.32304677,0.28348002,0.33293083,0.006486417,0.00048425634],"study_design_scores_gemma":[0.2242755,0.11664306,0.0024492417,0.045156658,0.006042186,0.0069363494,0.07161311,0.026562812,0.43111536,0.042709913,0.018441172,0.008054628],"about_ca_topic_score_codex":0.00014535768,"about_ca_topic_score_gemma":0.0000110347655,"teacher_disagreement_score":0.29648396,"about_ca_system_score_codex":0.00027070593,"about_ca_system_score_gemma":0.00012040905,"threshold_uncertainty_score":0.9382334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5946714,0.01926532,0.24996409,0.00019236366,0.10002096,0.0010341887,0.0000059168847,0.0003796469,0.034466103],"genre_scores_gemma":[0.9979097,0.00008849358,0.0012459139,0.00000423989,0.0005624294,3.5803438e-7,6.572584e-8,0.000021171534,0.00016759003],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899083,0.00010726427,0.00046563408,0.000047231315,0.00024389823,0.00014514131],"domain_scores_gemma":[0.9992946,0.00014013531,0.00016329694,0.00013101795,0.00014151668,0.00012943319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042100498,0.00011208202,0.00030605384,0.00013347824,0.000022648714,0.000017194923,0.00022270498,0.000091620226,0.00018093761],"category_scores_gemma":[0.000066009496,0.00009974309,0.000118279604,0.00026788132,0.000016239304,0.00012733255,0.0000066322473,0.00018049842,0.000028696038],"study_design_candidate":"bench_or_experimental","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.00080712844,0.0005359269,0.0006462739,0.00032066036,0.001286896,0.0002532379,0.0034231907,0.06034064,0.3173612,0.16118568,0.44512895,0.00871023],"study_design_scores_gemma":[0.01613911,0.0093016755,0.00083926873,0.0011456434,0.0007578406,0.0012953526,0.00038745787,0.013277546,0.47380966,0.38843757,0.09282192,0.001786973],"about_ca_topic_score_codex":0.0000015133904,"about_ca_topic_score_gemma":6.0396474e-8,"teacher_disagreement_score":0.40323833,"about_ca_system_score_codex":0.000028287612,"about_ca_system_score_gemma":0.000027505152,"threshold_uncertainty_score":0.40674055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9287458,0.00090791646,0.06398567,0.000020513851,0.0036708743,0.00010898848,0.0000031507009,0.00013701989,0.0024200736],"genre_scores_gemma":[0.9955644,0.0003173262,0.0039748973,0.000008487579,0.000095548974,0.0000016919013,2.697839e-7,0.00003478892,0.0000025622628],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884397,0.00003998058,0.0004793758,0.00008241583,0.00030812938,0.00024612152],"domain_scores_gemma":[0.9991496,0.00033715102,0.00016892413,0.00016970557,0.00009381925,0.00008080023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002520628,0.00016442653,0.00036210637,0.00012235668,0.000031525436,0.000017161721,0.00022412116,0.0001503544,0.0000067607452],"category_scores_gemma":[0.00046845662,0.00015248609,0.00011561911,0.0002272389,0.000061553976,0.00017471315,0.000015898135,0.0004085269,0.0000058893324],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00012801064,0.00020153899,0.00009956641,0.00006124637,0.00015841512,0.000046930378,0.000042967124,0.08578689,0.6857397,0.211858,0.007186316,0.0086904075],"study_design_scores_gemma":[0.0010510996,0.0005859482,0.00004705741,0.00012525932,0.000028916565,0.000019514096,0.000027746188,0.0004100942,0.8067152,0.18915473,0.0016297695,0.00020468715],"about_ca_topic_score_codex":1.5879347e-7,"about_ca_topic_score_gemma":9.7020205e-8,"teacher_disagreement_score":0.12097547,"about_ca_system_score_codex":0.00010505838,"about_ca_system_score_gemma":0.000023334596,"threshold_uncertainty_score":0.6218202},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882029,0.0058012693,0.0014902726,0.000042105567,0.0039964602,0.00009185603,0.000004950569,0.000031502426,0.00033865895],"genre_scores_gemma":[0.9988924,0.0004307287,0.00020384692,0.0000070481383,0.00043680303,0.000001277977,3.635799e-7,0.000020153522,0.000007352214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911404,0.00006929841,0.00043866006,0.000060574544,0.00017118485,0.00014624474],"domain_scores_gemma":[0.999377,0.0001226682,0.00018064649,0.00010502457,0.00013231192,0.00008236487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004930042,0.00014031715,0.0003763474,0.00017601767,0.000043889817,0.000029129242,0.00016865399,0.00009436233,0.0000064838537],"category_scores_gemma":[0.000027396625,0.00010692412,0.000099182835,0.00020748164,0.00005536251,0.00028727757,0.00001549121,0.00018198055,0.0000020467028],"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.0006206251,0.00045965362,0.0010813394,0.0007376368,0.00090045156,0.00014346043,0.0032433826,0.020233171,0.36502862,0.6045703,0.0018247211,0.0011566144],"study_design_scores_gemma":[0.00741646,0.0021691779,0.0018921192,0.0007737509,0.00016596889,0.00039980107,0.0011222418,0.0003274971,0.19838966,0.78307694,0.0036710424,0.00059531163],"about_ca_topic_score_codex":0.0000050460744,"about_ca_topic_score_gemma":3.5709647e-7,"teacher_disagreement_score":0.17850663,"about_ca_system_score_codex":0.000032825676,"about_ca_system_score_gemma":0.00004836826,"threshold_uncertainty_score":0.4360239},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96933013,0.000737266,0.020544896,0.000006027525,0.0057729124,0.00014062783,0.0000021838516,0.00007898925,0.0033869618],"genre_scores_gemma":[0.9980577,0.00018170041,0.0013276524,0.00001859033,0.00034865618,0.0000037307389,2.6699004e-7,0.00003682379,0.00002487472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988553,0.00012338017,0.0005023949,0.00009074842,0.00019900182,0.00022919143],"domain_scores_gemma":[0.999336,0.000086239255,0.00016526444,0.00013473777,0.00010010235,0.00017765422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071795064,0.00018164628,0.0003796472,0.00014812461,0.00006309271,0.000048478447,0.00019952568,0.00012681594,0.000052444597],"category_scores_gemma":[0.000047877762,0.00016787993,0.0001235403,0.00013635565,0.00004457575,0.00032884648,0.000020888152,0.00025426788,0.0000065024547],"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.0012269318,0.00024593587,0.003924211,0.00036888776,0.0008421619,0.0004609811,0.0059896465,0.001272747,0.2670222,0.7129447,0.0039646635,0.0017369711],"study_design_scores_gemma":[0.013104133,0.0031296446,0.0065555885,0.0007029507,0.00044637127,0.0017131647,0.0005742802,0.0021743719,0.3734201,0.572625,0.023732899,0.001821534],"about_ca_topic_score_codex":0.000009651981,"about_ca_topic_score_gemma":5.3213626e-7,"teacher_disagreement_score":0.14031972,"about_ca_system_score_codex":0.000049856077,"about_ca_system_score_gemma":0.000032803302,"threshold_uncertainty_score":0.6845945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047641937,0.00034823464,0.9894517,0.0001978694,0.003051506,0.00015474424,1.4377089e-7,0.00002739798,0.002004201],"genre_scores_gemma":[0.94047165,0.00001736456,0.057872407,0.0001105702,0.0014244916,0.000004286153,8.097989e-8,0.000010578463,0.00008856506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998088,0.0004386546,0.00059710117,0.00018594299,0.00042623223,0.00026409546],"domain_scores_gemma":[0.99856114,0.000492355,0.0003074624,0.0001975296,0.00025603018,0.00018545457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030529632,0.00015573834,0.0003793483,0.00016695015,0.00014598152,0.00031532111,0.0005270939,0.00012952274,0.0000038970334],"category_scores_gemma":[0.00013519704,0.00011858546,0.00014083015,0.00020327336,0.00004432472,0.000744213,0.00007934553,0.00034481366,0.000011060176],"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.0002414286,0.00023810014,0.000039409868,0.000017071361,0.00012846896,0.000039782946,0.0019170493,0.008659678,0.0010514121,0.9651892,0.0038171958,0.018661201],"study_design_scores_gemma":[0.009338463,0.0037958708,0.00027121004,0.00041505895,0.00014727362,0.0035518166,0.0008306757,0.67317873,0.006578697,0.28757676,0.0132297585,0.0010856718],"about_ca_topic_score_codex":0.0000016694535,"about_ca_topic_score_gemma":7.84003e-8,"teacher_disagreement_score":0.93570745,"about_ca_system_score_codex":0.00008898596,"about_ca_system_score_gemma":0.000108937624,"threshold_uncertainty_score":0.4835775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811916,0.0002239424,0.0148033025,0.00025189744,0.001182847,0.0003190163,0.00003096881,0.00002798293,0.0019684709],"genre_scores_gemma":[0.9956019,0.000057840585,0.003965071,0.00003715493,0.000225647,0.000007750647,0.0000015565756,0.000037362777,0.00006571462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996167,0.00046319945,0.0013649906,0.00020983318,0.0013519897,0.00044299365],"domain_scores_gemma":[0.9953252,0.001805962,0.0013062743,0.00046310906,0.00085202785,0.00024742587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024305892,0.00027979212,0.0010141348,0.00034240857,0.00012617632,0.000029725617,0.0007428621,0.00017507581,0.00018940127],"category_scores_gemma":[0.0017919722,0.00021937562,0.0006140827,0.00054471154,0.0003219678,0.0002573991,0.00008931019,0.00054857414,0.000016526526],"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.000737104,0.0021711197,0.0006161276,0.00024448743,0.00034784287,0.00007022178,0.0011370253,0.00007053101,0.023617176,0.9693779,0.0015052535,0.00010526327],"study_design_scores_gemma":[0.0035789548,0.002316836,0.00017719128,0.00045956584,0.00021466921,0.00004267524,0.00027720447,0.000007306455,0.07319257,0.9194049,0.00014103013,0.00018708484],"about_ca_topic_score_codex":0.00003762198,"about_ca_topic_score_gemma":0.000017214616,"teacher_disagreement_score":0.049972933,"about_ca_system_score_codex":0.00018368626,"about_ca_system_score_gemma":0.00062334153,"threshold_uncertainty_score":0.8945878},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878413,0.00088768225,0.0035660989,0.000010359477,0.0022846952,0.00009364136,0.0000018653782,0.000031432093,0.005282937],"genre_scores_gemma":[0.9994577,0.00006342515,0.00027787077,0.000003812521,0.000099138575,0.0000017444164,7.852934e-8,0.00001678846,0.00007942284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989967,0.00007098688,0.00040313115,0.000060749215,0.0003143554,0.00015411858],"domain_scores_gemma":[0.99930733,0.00010639759,0.00018876248,0.00015703052,0.00015697839,0.00008351305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023866248,0.0001306063,0.00033953274,0.00013189354,0.000028730876,0.000020046005,0.00023961508,0.000065154934,0.000052037347],"category_scores_gemma":[0.000034942426,0.00009645811,0.00009313243,0.00022063154,0.00006590601,0.00013592662,0.000008508786,0.00019089539,0.000005693922],"study_design_candidate":"bench_or_experimental","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.0015418772,0.001785945,0.01923248,0.0009105148,0.0017933061,0.00060638436,0.019603955,0.0030172605,0.43770808,0.501296,0.0048829196,0.0076212855],"study_design_scores_gemma":[0.02958031,0.024890764,0.059675667,0.0061336313,0.0009830445,0.0029302975,0.00663343,0.0066054584,0.563388,0.2786073,0.01652629,0.0040457714],"about_ca_topic_score_codex":0.000001472726,"about_ca_topic_score_gemma":2.4408632e-7,"teacher_disagreement_score":0.22268866,"about_ca_system_score_codex":0.000025840407,"about_ca_system_score_gemma":0.000015170355,"threshold_uncertainty_score":0.39334476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6874681,0.0014397091,0.2745668,0.000118750875,0.029700177,0.0007531582,0.0000141432665,0.0001990379,0.0057400824],"genre_scores_gemma":[0.9972201,0.00011019659,0.0012171536,0.00002313482,0.0012726387,0.0000185468,0.000003172941,0.000038309332,0.000096719676],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853206,0.00017500995,0.000632741,0.00012028877,0.00028266248,0.00025724288],"domain_scores_gemma":[0.99889576,0.00028616548,0.0002202462,0.00020427324,0.00024874293,0.00014480298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009815983,0.00017374047,0.00036172656,0.00018292925,0.00010603465,0.00008920364,0.0003047294,0.00012445574,0.000058675],"category_scores_gemma":[0.00012107047,0.00016572456,0.00020966082,0.00023633735,0.000039172395,0.00052172656,0.0000118212065,0.00018965194,0.000009010829],"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.0054723728,0.00090571353,0.006043383,0.0010358387,0.001329304,0.00087635993,0.0042549255,0.0085078655,0.5329887,0.26973125,0.15686432,0.011989932],"study_design_scores_gemma":[0.014089547,0.0033174818,0.0039897705,0.0008321983,0.00052491296,0.0015120127,0.0018090198,0.008603953,0.10526085,0.7685095,0.089930475,0.00162025],"about_ca_topic_score_codex":0.000002077545,"about_ca_topic_score_gemma":4.6084446e-7,"teacher_disagreement_score":0.49877828,"about_ca_system_score_codex":0.000074072144,"about_ca_system_score_gemma":0.000044485605,"threshold_uncertainty_score":0.67580515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96983457,0.0011966852,0.025832158,0.000047649817,0.0018776315,0.0001479828,0.0000015854124,0.000068442874,0.0009933178],"genre_scores_gemma":[0.99798495,0.00011133269,0.0014379593,0.000009257017,0.00039572077,0.0000044651138,3.6913838e-7,0.000042396234,0.000013541848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988573,0.000069426664,0.000376024,0.00011728255,0.00032421295,0.000255753],"domain_scores_gemma":[0.99919724,0.000114810886,0.0002217088,0.00013763424,0.00016057017,0.00016804547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043571793,0.000223424,0.00041002498,0.00018683264,0.00010142416,0.00017041761,0.00023292114,0.00009748592,0.0000064459746],"category_scores_gemma":[0.000014952513,0.00015664735,0.000056806428,0.000283459,0.000070159695,0.00041575596,0.000014567181,0.00030977165,0.0000019419613],"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.014089442,0.002398513,0.07573429,0.0068437713,0.007195042,0.009276385,0.015644195,0.24232,0.085280515,0.5210233,0.0024514701,0.017743107],"study_design_scores_gemma":[0.067261145,0.021104753,0.030600833,0.011614616,0.002431868,0.013782983,0.008042488,0.00054507866,0.119576305,0.6950325,0.024343332,0.0056641344],"about_ca_topic_score_codex":0.0000130003955,"about_ca_topic_score_gemma":0.000011549212,"teacher_disagreement_score":0.24177492,"about_ca_system_score_codex":0.000064722815,"about_ca_system_score_gemma":0.00008086178,"threshold_uncertainty_score":0.63878936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93261516,0.00068683457,0.037362233,0.00007881809,0.019666295,0.00017678812,0.0000018007171,0.00015911658,0.009252949],"genre_scores_gemma":[0.9981394,0.000023634811,0.00026695582,0.000018132898,0.0014825369,0.0000022242878,4.366695e-7,0.000025637275,0.00004107206],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989027,0.0001356092,0.000498615,0.000058712718,0.00022515962,0.00017922194],"domain_scores_gemma":[0.99941915,0.00010064893,0.00014377745,0.00012562415,0.000095648444,0.00011515522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066331454,0.00013489953,0.00028036814,0.00018239138,0.000056865803,0.0000484161,0.00021025336,0.000104783176,0.000061302635],"category_scores_gemma":[0.000027161259,0.00012333793,0.00016419144,0.00017141958,0.000024355832,0.0003406309,0.000008801975,0.00030987558,0.00003984192],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0014321642,0.000981539,0.0024121506,0.00029334726,0.0013231866,0.00024637298,0.005896969,0.06985717,0.39434916,0.38488045,0.09177245,0.04655504],"study_design_scores_gemma":[0.013751265,0.0047222455,0.00271187,0.00096436497,0.000534557,0.0022525468,0.0015242588,0.015992552,0.4200891,0.28786638,0.24756451,0.0020263563],"about_ca_topic_score_codex":0.00000181061,"about_ca_topic_score_gemma":0.0000019291626,"teacher_disagreement_score":0.15579206,"about_ca_system_score_codex":0.00013947372,"about_ca_system_score_gemma":0.00002246567,"threshold_uncertainty_score":0.50295746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768913,0.0071361596,0.0027788,0.00035692673,0.011333735,0.00035651508,0.000025450465,0.00025204683,0.0008690821],"genre_scores_gemma":[0.99522823,0.0012540674,0.0012816846,0.00013840145,0.001895939,0.0000071429836,0.0000040794066,0.00006350143,0.0001269813],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99678063,0.00039917338,0.0012667475,0.00022290675,0.0007968062,0.0005337454],"domain_scores_gemma":[0.9982439,0.00019900937,0.0005950585,0.0003300153,0.00029992362,0.00033207695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010748319,0.0004664425,0.001059769,0.0004842178,0.00018337792,0.00024762264,0.0006874285,0.00029817715,0.000097393204],"category_scores_gemma":[0.00006327233,0.00040630915,0.0005989628,0.00058886845,0.00004777115,0.00063521106,0.000012344833,0.0004935967,0.00002451866],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.008723276,0.0020020683,0.002985885,0.0012309599,0.0030247534,0.0025691297,0.004028489,0.047525883,0.5451578,0.25332758,0.119087026,0.01033713],"study_design_scores_gemma":[0.056367803,0.00711594,0.01943496,0.002851895,0.0032551982,0.0017868368,0.0011750397,0.005815433,0.3575819,0.28391412,0.25426432,0.006436501],"about_ca_topic_score_codex":0.000012413507,"about_ca_topic_score_gemma":0.0000026256141,"teacher_disagreement_score":0.18757589,"about_ca_system_score_codex":0.00012363408,"about_ca_system_score_gemma":0.000075281256,"threshold_uncertainty_score":0.9998389},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007977688,0.03594193,0.028259816,0.0014572899,0.8446345,0.005085477,0.00016358141,0.0010438302,0.07543592],"genre_scores_gemma":[0.9505212,0.0028735744,0.0028381834,0.00033198312,0.03256639,0.00009379819,0.000019337269,0.00042391906,0.010331619],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99617106,0.0009501846,0.0012557883,0.00025544854,0.0008152955,0.0005522537],"domain_scores_gemma":[0.9974731,0.00080191967,0.0005723604,0.0004466088,0.0003475408,0.00035844772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002913382,0.0006372593,0.001517859,0.00037661789,0.00023278467,0.00029102867,0.0007696848,0.00065378303,0.000026891285],"category_scores_gemma":[0.00022590913,0.00045747077,0.00038001622,0.00041000434,0.00014648077,0.0002064383,0.000079671,0.002014401,0.0000240111],"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.00057925505,0.00006611358,0.0000036162883,0.00016363281,0.00076328474,0.00008027132,0.0009149606,0.0024722998,0.000551067,0.013518957,0.98071593,0.0001706273],"study_design_scores_gemma":[0.011319567,0.0015552207,0.00012806956,0.0015665501,0.0010783168,0.0012855735,0.00026364217,0.0040958957,0.0006650319,0.075011194,0.90141845,0.001612501],"about_ca_topic_score_codex":0.0000052795176,"about_ca_topic_score_gemma":0.0000024238366,"teacher_disagreement_score":0.9425435,"about_ca_system_score_codex":0.00018840976,"about_ca_system_score_gemma":0.0002550832,"threshold_uncertainty_score":0.9997877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879503,0.000094866205,0.0011084629,0.00000795015,0.0068387403,0.00025129935,0.0000100195275,0.000023999557,0.0037143568],"genre_scores_gemma":[0.993198,0.00005004641,0.0062593017,0.000015019649,0.00038965096,0.0000024453104,4.0631863e-7,0.000045804227,0.00003936977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657464,0.00048818695,0.0017345968,0.00018057994,0.00071475597,0.000307234],"domain_scores_gemma":[0.99495345,0.0012210262,0.0023041102,0.00041229508,0.0009500647,0.00015906697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016679391,0.00031002468,0.0009063926,0.0005320043,0.00014216924,0.00002448352,0.00058383896,0.00031122885,0.00012952414],"category_scores_gemma":[0.0014261426,0.00025806876,0.00069343275,0.0004867765,0.0002702084,0.000274869,0.00012446156,0.0005936831,8.4660064e-7],"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.0037434248,0.0013233603,0.010219813,0.0005336888,0.0014466644,0.00008285923,0.014841871,0.000031292013,0.049553707,0.9162454,0.0015328311,0.00044511203],"study_design_scores_gemma":[0.003272248,0.002534187,0.003581001,0.00042980566,0.00059408986,0.00020136399,0.000543423,0.000009445624,0.07341827,0.91493875,0.00017241802,0.00030501818],"about_ca_topic_score_codex":0.00002502528,"about_ca_topic_score_gemma":0.0000029964121,"teacher_disagreement_score":0.023864558,"about_ca_system_score_codex":0.000050103863,"about_ca_system_score_gemma":0.00014913036,"threshold_uncertainty_score":0.9999871},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98404366,0.00037497765,0.005444787,0.000033121778,0.0060980245,0.00011168141,0.0000046745204,0.000028086424,0.003861006],"genre_scores_gemma":[0.99963105,0.000045958564,0.00003707693,0.0000079273495,0.00023163584,0.0000015664943,8.961761e-8,0.00001961739,0.0000250541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998946,0.00009166639,0.00044518022,0.000049514587,0.0003106301,0.00015698194],"domain_scores_gemma":[0.9990864,0.00039570875,0.00019467919,0.00017302792,0.00008424472,0.00006597467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053580204,0.0001213568,0.00025924196,0.000096489195,0.00004741898,0.000027448355,0.00026541928,0.000044179054,0.00010334026],"category_scores_gemma":[0.00009118037,0.00008453023,0.00014679335,0.00016625268,0.000034413762,0.00010961344,0.000008701414,0.00028105718,0.000014924946],"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.00046751212,0.00060498144,0.00034233308,0.00025670862,0.001060169,0.00014285166,0.0032703427,0.12616028,0.09731451,0.7376595,0.022856763,0.00986403],"study_design_scores_gemma":[0.0044350284,0.002391436,0.0005481813,0.0007484596,0.00013840178,0.00010675513,0.00021945423,0.019613342,0.15149684,0.81210405,0.0075751483,0.00062292226],"about_ca_topic_score_codex":0.0000014987864,"about_ca_topic_score_gemma":5.9438247e-7,"teacher_disagreement_score":0.10654693,"about_ca_system_score_codex":0.00003547245,"about_ca_system_score_gemma":0.000008550105,"threshold_uncertainty_score":0.34470427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885261,0.00059735234,0.004643242,0.00005033198,0.004611769,0.00012131502,0.0000015049154,0.000057418674,0.0013909665],"genre_scores_gemma":[0.9992168,0.000025062158,0.00026645078,0.000007993895,0.00042850425,0.0000017938231,2.287594e-7,0.000031108517,0.000022079093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989927,0.0000569916,0.00036543954,0.000086716725,0.00028977048,0.00020837536],"domain_scores_gemma":[0.9993897,0.00006835564,0.00013192707,0.00012527949,0.00013143572,0.0001532742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036633364,0.00017361237,0.00032795023,0.00012409441,0.000063453444,0.000074962125,0.00015847002,0.000097799144,0.000019127989],"category_scores_gemma":[0.000029792485,0.00013499893,0.00008866138,0.00016015235,0.00006439502,0.0002342949,0.000013096198,0.000273397,0.000005918307],"study_design_candidate":"bench_or_experimental","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.0031044725,0.0011239308,0.0031278774,0.00042527748,0.0024698924,0.0014327966,0.0075067426,0.027742656,0.4304539,0.5179744,0.0038933717,0.0007447015],"study_design_scores_gemma":[0.04698914,0.01480875,0.0077759433,0.0026494004,0.0010548118,0.00808016,0.0021498809,0.0003437803,0.5215361,0.3700748,0.02153946,0.002997725],"about_ca_topic_score_codex":0.0000035435833,"about_ca_topic_score_gemma":9.67677e-7,"teacher_disagreement_score":0.14789958,"about_ca_system_score_codex":0.00005243042,"about_ca_system_score_gemma":0.00006502637,"threshold_uncertainty_score":0.55050963},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891857,0.00080491777,0.0017020853,0.00004396833,0.0070196246,0.00010793772,0.000012119181,0.000054253876,0.0010693924],"genre_scores_gemma":[0.99834615,0.00010835566,0.0010497692,0.00001103111,0.0004626148,0.0000011124621,0.000001486381,0.000013482297,0.0000060005354],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848944,0.00020291095,0.0006768195,0.000098089324,0.00034793033,0.0001848358],"domain_scores_gemma":[0.9990473,0.00017792976,0.00031454716,0.00016475246,0.00017721501,0.00011827303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006177019,0.00016984883,0.0004222123,0.00016885444,0.00005055976,0.00003152468,0.00026457565,0.00014210172,0.00005534966],"category_scores_gemma":[0.00006916908,0.00014951396,0.00018321989,0.00026524987,0.00008906002,0.00038698822,0.000006845566,0.00029359516,0.000005296991],"study_design_candidate":"bench_or_experimental","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.000556941,0.00019818264,0.0019472946,0.0000892397,0.00042796644,0.00022572298,0.0013615408,0.005246284,0.87297446,0.10909141,0.0022888,0.0055921925],"study_design_scores_gemma":[0.005356537,0.003762027,0.009445738,0.0013238445,0.00037545458,0.00067662465,0.0017978116,0.0038578594,0.1992151,0.769495,0.0036670018,0.0010269956],"about_ca_topic_score_codex":0.000010405683,"about_ca_topic_score_gemma":3.1880964e-7,"teacher_disagreement_score":0.67375934,"about_ca_system_score_codex":0.000073432224,"about_ca_system_score_gemma":0.00007616833,"threshold_uncertainty_score":0.6097002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89100045,0.001624236,0.07962324,0.0001545418,0.007952706,0.00065594097,0.0000072133935,0.00034608808,0.01863562],"genre_scores_gemma":[0.9966865,0.000039675895,0.0018533476,0.000021832306,0.0012219687,0.000008941761,4.96631e-7,0.000063379935,0.00010382017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811774,0.00013394622,0.0006513831,0.00014243032,0.000533652,0.00042086816],"domain_scores_gemma":[0.99870265,0.00035325,0.00022964709,0.00029583595,0.00017868674,0.00023993201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010123345,0.00027799205,0.00051555946,0.00016867646,0.00013192782,0.000113870534,0.00043306078,0.00016186618,0.00004609115],"category_scores_gemma":[0.00006558418,0.00022260215,0.00017911613,0.00036769512,0.0000537873,0.0004854759,0.000019890378,0.00045732726,0.000025645539],"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.003950949,0.0015082684,0.0023634818,0.00043542983,0.0021453195,0.0005952316,0.0019071129,0.338758,0.175277,0.4361605,0.03205721,0.0048415],"study_design_scores_gemma":[0.05665397,0.017209461,0.0077272016,0.002826847,0.0017874168,0.00320197,0.0008546269,0.042552665,0.17505042,0.5554274,0.13085532,0.0058527305],"about_ca_topic_score_codex":0.0000057197635,"about_ca_topic_score_gemma":0.000009543749,"teacher_disagreement_score":0.29620534,"about_ca_system_score_codex":0.00012174468,"about_ca_system_score_gemma":0.00006095115,"threshold_uncertainty_score":0.9077452},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9624146,0.0040580626,0.008984917,0.000041768628,0.008644318,0.0001516967,0.0000036462839,0.00012212206,0.015578864],"genre_scores_gemma":[0.9986678,0.00008985584,0.00027161784,0.0000049203572,0.0008766973,0.0000016341544,4.4483298e-7,0.000023127046,0.00006394812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990541,0.00007125995,0.0004172717,0.00006534018,0.00021079877,0.00018126608],"domain_scores_gemma":[0.9995018,0.000113442984,0.00013794364,0.000094209754,0.00007336783,0.00007919343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004677571,0.0001289189,0.0002814989,0.00014154897,0.000060463706,0.00007324129,0.00014859124,0.000085682055,0.000013450331],"category_scores_gemma":[0.000017214667,0.00011310653,0.00008698773,0.00017822662,0.000031470274,0.00024127439,0.000009131195,0.00019150884,0.0000073179517],"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.0002753403,0.00032423352,0.004030211,0.00034422232,0.00031317107,0.00014633928,0.0004359033,0.012672506,0.28820378,0.6333268,0.05878605,0.0011414222],"study_design_scores_gemma":[0.0069410056,0.0011194843,0.0033353714,0.00043060983,0.0002841441,0.0007408996,0.00040528743,0.0023622003,0.07770184,0.7688409,0.1368271,0.0010111551],"about_ca_topic_score_codex":0.000009284545,"about_ca_topic_score_gemma":8.9990294e-7,"teacher_disagreement_score":0.21050194,"about_ca_system_score_codex":0.000031906773,"about_ca_system_score_gemma":0.00001789163,"threshold_uncertainty_score":0.46123505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97834647,0.00033151978,0.005472532,0.00021090738,0.013392429,0.00023529326,0.000003224189,0.000042507905,0.0019650925],"genre_scores_gemma":[0.99912363,0.000049290767,0.00013881295,0.0000072920975,0.0006213673,0.0000033145575,3.2422844e-7,0.000030424582,0.000025536634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849117,0.00013564038,0.0006472976,0.000076965734,0.00039437477,0.00025454842],"domain_scores_gemma":[0.9986983,0.00038606446,0.00034441033,0.00027518545,0.00015764205,0.0001383977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015728595,0.00017238004,0.00037303622,0.00009798763,0.00011717696,0.00006702454,0.00042407334,0.00010787133,0.000022646027],"category_scores_gemma":[0.00008256355,0.00010391128,0.00015067314,0.0002118683,0.00013109384,0.000178554,0.000016016606,0.00061141275,0.00000704491],"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.00074145565,0.00015764138,0.001006855,0.00007022528,0.0004525987,0.00011299708,0.0005346105,0.0009900691,0.17024976,0.82391334,0.0014852028,0.00028525063],"study_design_scores_gemma":[0.010890849,0.0048536453,0.006922762,0.00049524166,0.0004703083,0.0018690616,0.0009456086,0.0020225279,0.33519822,0.59758234,0.03760949,0.0011399622],"about_ca_topic_score_codex":0.0000066979874,"about_ca_topic_score_gemma":0.000017910814,"teacher_disagreement_score":0.22633101,"about_ca_system_score_codex":0.000025237707,"about_ca_system_score_gemma":0.00006893758,"threshold_uncertainty_score":0.4237379},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95415217,0.0008477768,0.040449463,0.000023915822,0.0042704516,0.00013201835,0.0000034890397,0.000025382147,0.00009536544],"genre_scores_gemma":[0.99603504,0.00036246033,0.0032563393,0.000003180213,0.00032143874,0.0000023043422,4.503911e-7,0.0000103776965,0.000008384013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928075,0.000036273497,0.0003732173,0.00005878002,0.00014608023,0.00010492744],"domain_scores_gemma":[0.99947184,0.00010564964,0.00016400298,0.000071280934,0.00011528675,0.00007194485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026680226,0.00010257613,0.00026865242,0.00013504816,0.000039938623,0.00002201848,0.00009199255,0.00007691746,9.3505054e-7],"category_scores_gemma":[0.00007875065,0.00009126794,0.000074171396,0.00009328095,0.000077413955,0.00022497009,0.0000059740737,0.000101322,3.2722613e-7],"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.00015373644,0.000028251126,0.00034494244,0.00017132027,0.000058650272,0.0000023139892,0.000630819,0.0007479993,0.046186145,0.9480353,0.000034842706,0.0036056556],"study_design_scores_gemma":[0.0021873224,0.00062925066,0.0017274744,0.00031611836,0.000052878495,0.000078597455,0.0005289856,0.00009622167,0.048087217,0.9459671,0.00019642289,0.00013240968],"about_ca_topic_score_codex":0.000013280691,"about_ca_topic_score_gemma":0.00000109835,"teacher_disagreement_score":0.041882925,"about_ca_system_score_codex":0.000037914993,"about_ca_system_score_gemma":0.00005756684,"threshold_uncertainty_score":0.37217984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9727992,0.0025133302,0.008084363,0.000017570217,0.012978489,0.00035861108,0.0000028668503,0.00010817116,0.003137427],"genre_scores_gemma":[0.99919504,0.0000653491,0.00005773594,0.0000069314538,0.0005378278,0.0000031841405,0.000001805273,0.000048754577,0.00008335914],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805903,0.00017703998,0.0009012416,0.00011882935,0.00037519156,0.0003686903],"domain_scores_gemma":[0.9988261,0.00030817644,0.00020404704,0.00018313022,0.00019784426,0.0002806906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019977172,0.0002286063,0.00047047948,0.0002804571,0.00009599115,0.00012318569,0.00022163487,0.00021179084,0.000040968105],"category_scores_gemma":[0.00007366071,0.00020018686,0.00013996862,0.00028253565,0.00005219842,0.00038928338,0.000018183582,0.00040513487,0.00001958911],"study_design_candidate":"bench_or_experimental","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.0010126616,0.00053743186,0.010796481,0.00077156496,0.0018569715,0.0014766224,0.004497708,0.009282281,0.6632785,0.2715755,0.031572666,0.0033415467],"study_design_scores_gemma":[0.05810307,0.014231111,0.041832518,0.0037394664,0.0023462279,0.01658281,0.019889565,0.014663179,0.22529408,0.49419087,0.1011987,0.007928396],"about_ca_topic_score_codex":0.000016560087,"about_ca_topic_score_gemma":0.0000010954795,"teacher_disagreement_score":0.43798447,"about_ca_system_score_codex":0.00009509962,"about_ca_system_score_gemma":0.000031349704,"threshold_uncertainty_score":0.8163383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9194929,0.010380706,0.014045441,0.00003433695,0.04547369,0.0008946913,0.000042088926,0.00023144479,0.00940471],"genre_scores_gemma":[0.99886477,0.00005233632,0.000057303503,0.000005210464,0.00091154117,0.0000035844364,0.0000031237112,0.000032361644,0.00006979439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748516,0.000367773,0.0011724964,0.0001268972,0.0005169412,0.00033073232],"domain_scores_gemma":[0.9984718,0.000112627284,0.00048188772,0.0003519909,0.00033837656,0.00024333972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626786,0.00023210947,0.0007931222,0.00031603166,0.000085664986,0.00010534082,0.00046346328,0.00020176098,0.000009366079],"category_scores_gemma":[0.00007067763,0.00020799291,0.00020491485,0.00043179982,0.000032638363,0.0004612094,0.000008854192,0.00030838352,0.000008053564],"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.00091759337,0.00092120696,0.0004953491,0.0008249652,0.00074514904,0.00035569133,0.0014855142,0.22170776,0.15268448,0.59806883,0.021227535,0.0005659185],"study_design_scores_gemma":[0.05726289,0.045900036,0.008622151,0.012089316,0.0028582423,0.0063834884,0.01627208,0.2698344,0.15971625,0.290608,0.12258912,0.007864068],"about_ca_topic_score_codex":0.00005235136,"about_ca_topic_score_gemma":0.0000012120237,"teacher_disagreement_score":0.30746084,"about_ca_system_score_codex":0.00010546142,"about_ca_system_score_gemma":0.000071100236,"threshold_uncertainty_score":0.8481705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95872825,0.0016846454,0.033115257,0.000029108429,0.005243162,0.00011650078,0.00003533876,0.0000711704,0.0009765798],"genre_scores_gemma":[0.99776137,0.000035700683,0.0010342976,0.000012831982,0.0011092847,0.0000017281902,0.0000054169022,0.00003075446,0.000008607923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998195,0.0001526347,0.0007561106,0.00013173657,0.00038363697,0.0003808896],"domain_scores_gemma":[0.99854803,0.0006672642,0.0002457972,0.00013760009,0.00016938179,0.00023190462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275874,0.00021757967,0.00041601446,0.00027171348,0.00017357698,0.00008628456,0.00017290136,0.00016345392,0.00005207185],"category_scores_gemma":[0.00012693251,0.00020441278,0.00016638129,0.00024807506,0.000119474134,0.00027076306,0.000027005659,0.00044762276,0.0000052711443],"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.0007712674,0.00030654977,0.13825749,0.00020177843,0.0011938902,0.0006598316,0.002519998,0.004459341,0.134226,0.702498,0.0019263201,0.012979496],"study_design_scores_gemma":[0.010299196,0.0013020368,0.09882197,0.0009604094,0.0005839157,0.0010729721,0.0048604216,0.0053292513,0.03304208,0.83600724,0.005984114,0.0017363988],"about_ca_topic_score_codex":0.000015471063,"about_ca_topic_score_gemma":0.000010159397,"teacher_disagreement_score":0.13350919,"about_ca_system_score_codex":0.00007718364,"about_ca_system_score_gemma":0.00005221881,"threshold_uncertainty_score":0.83357114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93240577,0.003249022,0.02759006,0.0000133146505,0.01951198,0.00020794949,0.0000034927045,0.00007032088,0.016948074],"genre_scores_gemma":[0.99885094,0.000067625326,0.00080231903,0.0000018488743,0.00016986295,6.578979e-7,2.032867e-7,0.00002119993,0.000085315216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988092,0.0001411162,0.0005336516,0.000056350655,0.0002914131,0.0001682751],"domain_scores_gemma":[0.9993051,0.00008865228,0.00018836348,0.00016127717,0.00012552713,0.00013102118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002579,0.00013240852,0.00036200238,0.00019978757,0.000029207968,0.000019029652,0.0001988942,0.00009457566,0.000060858572],"category_scores_gemma":[0.000069998976,0.00011876508,0.00020769586,0.00026360637,0.00003014984,0.00016817289,0.0000046909677,0.0001904338,0.0000047382136],"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.00009914039,0.000069625465,0.00066992245,0.000087085115,0.0002874242,0.000027683307,0.00048116298,0.0026127587,0.05584134,0.92924684,0.010001736,0.00057529926],"study_design_scores_gemma":[0.004593901,0.001169983,0.00073033554,0.0002737859,0.00018016736,0.00016110239,0.00083437475,0.000059764916,0.22653045,0.73162687,0.03340487,0.0004343904],"about_ca_topic_score_codex":0.0000032200928,"about_ca_topic_score_gemma":3.5476089e-7,"teacher_disagreement_score":0.19761994,"about_ca_system_score_codex":0.000026950544,"about_ca_system_score_gemma":0.00007444643,"threshold_uncertainty_score":0.48430994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12208304,0.00007031384,0.8732129,0.00007789894,0.0040004435,0.00003724919,2.807531e-7,0.00002018638,0.00049769547],"genre_scores_gemma":[0.9785116,0.000012610539,0.021093054,0.000019126881,0.00035671343,3.041048e-7,1.04866935e-7,0.0000052149553,0.000001320268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.00005134711,0.00046409946,0.00009410544,0.00036126355,0.0001490894],"domain_scores_gemma":[0.99887466,0.00010181386,0.0005483895,0.0001486169,0.00023948766,0.00008705081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522761,0.000086561115,0.00024087349,0.00013870405,0.00006890533,0.00005977717,0.00046402574,0.000052017647,0.000002831116],"category_scores_gemma":[0.00017100506,0.00007931786,0.00011974441,0.00030093166,0.000046954254,0.00059309043,0.000038454793,0.00018186448,0.0000022822362],"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.000004663942,0.00014486916,0.00088376657,0.000022827971,0.000040954335,0.000064096115,0.00037368815,0.0015148572,0.06830936,0.91477156,0.000035561872,0.013833778],"study_design_scores_gemma":[0.004523661,0.0016020034,0.0019301003,0.00039540563,0.00004293699,0.0010029784,0.00009248261,0.000684732,0.06542663,0.923658,0.00034837457,0.0002926743],"about_ca_topic_score_codex":0.00001018358,"about_ca_topic_score_gemma":2.7484995e-7,"teacher_disagreement_score":0.8564285,"about_ca_system_score_codex":0.00007800127,"about_ca_system_score_gemma":0.00018129681,"threshold_uncertainty_score":0.32344884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97722185,0.0037792863,0.007102338,0.00037456967,0.008732831,0.00060556387,0.0000040626533,0.000094378265,0.002085137],"genre_scores_gemma":[0.9990303,0.000119817116,0.00030047446,0.000013904495,0.00045248895,0.000004229576,1.8165814e-7,0.0000119165325,0.00006669921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928033,0.000053026266,0.0003187204,0.000048212853,0.00012861232,0.00017112096],"domain_scores_gemma":[0.9994418,0.00022099892,0.00009162221,0.000085989865,0.00008669226,0.00007287351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070448156,0.00009755187,0.00018563407,0.000041890748,0.00013864251,0.0000949692,0.00015452731,0.000058162215,0.0000013173477],"category_scores_gemma":[0.000029912528,0.000063248044,0.00008929809,0.00006494809,0.000026412192,0.0001385024,0.0000033127242,0.00012416721,0.0000011408084],"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.0011651248,0.0002194696,0.00019238096,0.00020774471,0.00049374485,0.000039013714,0.0043364996,0.0036110575,0.11006017,0.8241971,0.02007381,0.035403855],"study_design_scores_gemma":[0.0025760473,0.0013247412,0.00041505956,0.00009702628,0.00006297335,0.00010001097,0.00018473623,0.00097261625,0.014171444,0.9344632,0.045423232,0.00020893748],"about_ca_topic_score_codex":4.571677e-7,"about_ca_topic_score_gemma":3.7819876e-7,"teacher_disagreement_score":0.110266045,"about_ca_system_score_codex":0.00001977763,"about_ca_system_score_gemma":0.000013069331,"threshold_uncertainty_score":0.25791806},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98133683,0.00043238787,0.005571832,0.00007049807,0.0063406136,0.00028535989,0.0000036520496,0.00016561353,0.005793241],"genre_scores_gemma":[0.9982175,0.00005859838,0.0005818285,0.000028814538,0.00095003383,0.000006045294,4.1495744e-7,0.000056026704,0.00010070164],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981885,0.00018227923,0.00063677575,0.00012913278,0.00047516066,0.0003881852],"domain_scores_gemma":[0.99865115,0.00036583317,0.00024869145,0.00025480308,0.00023508468,0.00024441892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006717132,0.000276864,0.0005520035,0.00015440579,0.00010845422,0.00008017529,0.0003930277,0.00013803388,0.000054974087],"category_scores_gemma":[0.00007916231,0.00022309463,0.00017407673,0.00044508075,0.000056811547,0.00025434393,0.000015778838,0.00041785705,0.000024587169],"study_design_candidate":"bench_or_experimental","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.008403277,0.0018218557,0.025502121,0.0006993951,0.0044976817,0.005643839,0.0040972843,0.12832996,0.6473259,0.1244044,0.046759136,0.0025151987],"study_design_scores_gemma":[0.08204979,0.024409337,0.03229078,0.0044412585,0.002357978,0.02875277,0.0023776013,0.0104868505,0.1697385,0.3440657,0.29051545,0.008514006],"about_ca_topic_score_codex":0.0000035733956,"about_ca_topic_score_gemma":0.000001736492,"teacher_disagreement_score":0.47758734,"about_ca_system_score_codex":0.00009586591,"about_ca_system_score_gemma":0.000070568916,"threshold_uncertainty_score":0.90975344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9712983,0.0014500687,0.009129424,0.00021132588,0.008198087,0.0003785261,0.0000027557842,0.000085150845,0.009246373],"genre_scores_gemma":[0.99886906,0.00015625976,0.00019193659,0.000006455138,0.00054124853,0.0000034094348,8.514506e-8,0.000034914672,0.00019660807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984264,0.00016917483,0.00057908706,0.00007739308,0.00042836257,0.00031960945],"domain_scores_gemma":[0.9985102,0.0006628198,0.0002855809,0.00024960385,0.000162896,0.00012891932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010602755,0.00018101095,0.00038124016,0.000084527084,0.00013616176,0.00006225635,0.00041172619,0.000089913374,0.000028338594],"category_scores_gemma":[0.00010091247,0.00011509429,0.0001628737,0.00035631759,0.000077523175,0.00016785692,0.000012791429,0.00031319322,0.0000066348834],"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.010028284,0.0012320258,0.016126957,0.00051822525,0.004650582,0.0020348649,0.003003259,0.09997235,0.24496849,0.57305,0.042098083,0.0023168325],"study_design_scores_gemma":[0.020748079,0.011743757,0.0076596043,0.0014380085,0.0009808718,0.0057353196,0.0017995924,0.003391998,0.24131064,0.5767604,0.12638563,0.0020461048],"about_ca_topic_score_codex":0.000005836871,"about_ca_topic_score_gemma":0.000004464623,"teacher_disagreement_score":0.09658036,"about_ca_system_score_codex":0.000056008597,"about_ca_system_score_gemma":0.00007478873,"threshold_uncertainty_score":0.4693409},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97651356,0.00096491573,0.0009827648,0.0000109122875,0.004879706,0.00009144455,0.000009698297,0.00004671296,0.016500289],"genre_scores_gemma":[0.99921155,0.00010298964,0.00040390232,0.0000014333779,0.0002079952,0.0000013699838,8.2942546e-7,0.000017014034,0.00005291481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881136,0.00009363581,0.00067537196,0.00006612677,0.00020974403,0.0001437505],"domain_scores_gemma":[0.99918705,0.00023644262,0.00024558764,0.00013798226,0.00014046123,0.000052491338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038322574,0.00013433614,0.0003578477,0.00020325193,0.00008050882,0.000034409262,0.00014728308,0.00011173277,0.000015371133],"category_scores_gemma":[0.00008972894,0.00012503396,0.000114417395,0.0002278695,0.00012598009,0.00022996956,0.000017246068,0.00021080136,0.0000021143783],"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.00018439934,0.00016932515,0.007721928,0.00039547402,0.0005962148,0.0000700918,0.0015319459,0.0250852,0.19909653,0.75450414,0.009565823,0.0010789138],"study_design_scores_gemma":[0.009436793,0.0011476408,0.008691989,0.0008547637,0.00042067637,0.0013712203,0.0036925303,0.0028322875,0.07793998,0.88644767,0.0063266675,0.0008377603],"about_ca_topic_score_codex":0.00001575058,"about_ca_topic_score_gemma":0.0000023779403,"teacher_disagreement_score":0.13194354,"about_ca_system_score_codex":0.000027712973,"about_ca_system_score_gemma":0.00004115616,"threshold_uncertainty_score":0.5098736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85436505,0.00049594155,0.0988197,0.00007637113,0.02851768,0.00023773758,0.0000010952222,0.00013449551,0.01735194],"genre_scores_gemma":[0.99817836,0.00001223324,0.000433053,0.000035845973,0.0012585429,0.000001225498,2.2609903e-7,0.000032826476,0.000047674894],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985116,0.00009973185,0.0006480382,0.00007697126,0.00035167218,0.00031195948],"domain_scores_gemma":[0.99902606,0.00024363349,0.00012293682,0.00015441398,0.00015867237,0.00029426013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029141754,0.00014835107,0.00031161658,0.0002684927,0.00006501658,0.00004911705,0.00028101666,0.00011307736,0.0000417638],"category_scores_gemma":[0.00013205211,0.00013655805,0.00017282204,0.0003188052,0.0000142715835,0.00016847633,0.000016201855,0.00031354628,0.00004704027],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0008702131,0.00038102095,0.0018189148,0.00021073093,0.00070229656,0.00077779003,0.0036509077,0.011296368,0.50471175,0.42209688,0.04143913,0.012043983],"study_design_scores_gemma":[0.011713633,0.0047008717,0.0058551626,0.0012571105,0.00038056434,0.0012599933,0.002846783,0.000921578,0.44820434,0.3185514,0.20182009,0.0024884592],"about_ca_topic_score_codex":0.0000020811524,"about_ca_topic_score_gemma":9.095499e-7,"teacher_disagreement_score":0.16038096,"about_ca_system_score_codex":0.00007513841,"about_ca_system_score_gemma":0.000025622854,"threshold_uncertainty_score":0.5568676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28443834,0.003996917,0.6870987,0.009019913,0.009593821,0.0006540023,0.0000042426714,0.00026100242,0.004933092],"genre_scores_gemma":[0.967986,0.00012784792,0.030456856,0.0003828343,0.0010070316,0.000003112112,1.9268802e-7,0.000010586723,0.000025574565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977306,0.00072982255,0.00051819504,0.00018163197,0.0005624888,0.00027724222],"domain_scores_gemma":[0.9976153,0.0012390247,0.00039448024,0.00031174885,0.00026772733,0.00017172367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375657,0.00017995475,0.00035113213,0.00015975237,0.00029926,0.00031666312,0.0008663853,0.000093724084,0.000010977894],"category_scores_gemma":[0.0001579582,0.00011977204,0.00020220107,0.00041203672,0.00016951142,0.0006840865,0.0001474765,0.0004498067,0.0000089832165],"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.0003158524,0.00015376402,0.00014977208,0.00000562991,0.00010229961,0.00003078803,0.0007170117,0.000023561579,0.00035661826,0.99067897,0.0011933806,0.006272359],"study_design_scores_gemma":[0.012869108,0.0014464628,0.0012015074,0.00009519163,0.00026272712,0.0014315251,0.000114920826,0.0039056076,0.0028398489,0.9154961,0.059783492,0.00055348943],"about_ca_topic_score_codex":0.0000023771204,"about_ca_topic_score_gemma":0.0000011200925,"teacher_disagreement_score":0.6835476,"about_ca_system_score_codex":0.00003949825,"about_ca_system_score_gemma":0.00019008825,"threshold_uncertainty_score":0.4884162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89033055,0.009332105,0.070544966,0.00093161524,0.019019468,0.0014992445,0.000013924743,0.0005027406,0.0078253895],"genre_scores_gemma":[0.9967792,0.00016405982,0.0018138665,0.00003757068,0.0011540933,0.000005963322,2.3029607e-7,0.00002497169,0.000020012672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984582,0.0004179949,0.0005233462,0.000081258826,0.00029288628,0.00022630132],"domain_scores_gemma":[0.9988098,0.000628734,0.00017384042,0.00015463926,0.00011383051,0.000119128716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018147897,0.00017872774,0.0004234468,0.00009712142,0.00012483355,0.000091276925,0.00023530403,0.00009441721,0.000014198245],"category_scores_gemma":[0.00007092003,0.00012060168,0.00012301277,0.00015653156,0.00009214412,0.00020270866,0.0000201804,0.0003251207,0.000010006776],"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.0038213525,0.00048932893,0.00050009065,0.00033949668,0.0023411268,0.0001810142,0.008408825,0.058374316,0.043554503,0.84155935,0.036261268,0.0041693393],"study_design_scores_gemma":[0.074711986,0.0032376496,0.0018986342,0.00078534294,0.0013908782,0.0047674426,0.0012964384,0.1239048,0.06413509,0.5289738,0.19231237,0.0025855175],"about_ca_topic_score_codex":0.0000013290256,"about_ca_topic_score_gemma":4.5250954e-7,"teacher_disagreement_score":0.3125855,"about_ca_system_score_codex":0.000052584342,"about_ca_system_score_gemma":0.00003612317,"threshold_uncertainty_score":0.49179938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96767867,0.007960466,0.006608605,0.000049297923,0.012727203,0.00019149178,0.0000015748468,0.00010941876,0.0046732724],"genre_scores_gemma":[0.99779177,0.001125817,0.0002538128,0.00001359098,0.000713267,0.0000014697104,3.893636e-7,0.00003160807,0.00006826824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867857,0.00014364212,0.00050357246,0.000094510746,0.00032477488,0.00025490957],"domain_scores_gemma":[0.999022,0.00028317724,0.00017216742,0.0001386348,0.0001927068,0.00019133433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000874469,0.00018252883,0.0003823231,0.00044331423,0.00008582331,0.000100950165,0.0002323599,0.00013666518,0.000039024602],"category_scores_gemma":[0.0001244586,0.00015989305,0.000107150845,0.00083596027,0.000036548863,0.00031637077,0.000016241964,0.00029075594,0.000017770446],"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.0034672895,0.0011673422,0.039460454,0.0012033593,0.002917761,0.003080375,0.0031809527,0.011210225,0.16786632,0.6580271,0.07569657,0.03272225],"study_design_scores_gemma":[0.020560514,0.009370317,0.021858841,0.0013786393,0.0014954833,0.008467481,0.001531974,0.006009846,0.0409997,0.5928419,0.291827,0.0036582893],"about_ca_topic_score_codex":0.000004093908,"about_ca_topic_score_gemma":4.033745e-7,"teacher_disagreement_score":0.21613042,"about_ca_system_score_codex":0.000057404766,"about_ca_system_score_gemma":0.00003933839,"threshold_uncertainty_score":0.6520249},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92459637,0.010807485,0.014615581,0.00007323015,0.03531548,0.0004994046,0.00000798843,0.000105369814,0.013979114],"genre_scores_gemma":[0.9987656,0.0000336197,0.000028226634,0.0000011948435,0.0009404565,0.0000040577447,4.6807963e-7,0.00002776963,0.00019862977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981296,0.00018861933,0.0009058346,0.00005824639,0.00041813325,0.00029958994],"domain_scores_gemma":[0.998852,0.00036089084,0.0003707228,0.00022526253,0.00012651685,0.000064575186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014879678,0.00015116722,0.00041124993,0.00011349309,0.00011211345,0.00008537633,0.00035860873,0.000084442414,0.000010052275],"category_scores_gemma":[0.000041689334,0.00010186224,0.0001764996,0.00025829588,0.000052675252,0.00016729276,0.00001598846,0.00020333071,0.0000088819315],"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.00013053059,0.00014019347,0.00038913236,0.0003614761,0.0003064164,0.000042505606,0.00017728814,0.03682755,0.048983343,0.8971948,0.015347164,0.000099579906],"study_design_scores_gemma":[0.010488864,0.0031072125,0.0027740235,0.0018573899,0.00065570255,0.0009487331,0.002190523,0.0211943,0.11009645,0.7891152,0.056115158,0.0014564714],"about_ca_topic_score_codex":0.000034003224,"about_ca_topic_score_gemma":0.000003038283,"teacher_disagreement_score":0.10807964,"about_ca_system_score_codex":0.00006914247,"about_ca_system_score_gemma":0.00004486102,"threshold_uncertainty_score":0.41538218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7330536,0.007596822,0.09180537,0.00018235341,0.07211608,0.0010420654,0.000018792502,0.0005716381,0.093613274],"genre_scores_gemma":[0.9972709,0.000031788863,0.0005154484,0.000018626099,0.0017780911,0.0000030778724,3.447622e-7,0.00004113939,0.0003406169],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859554,0.00016551047,0.0005610634,0.000083791056,0.00034112742,0.0002529975],"domain_scores_gemma":[0.9991608,0.0001622356,0.00017524438,0.00017789537,0.00022388234,0.00009993926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007141254,0.00019010404,0.00034698338,0.00013496031,0.000069029775,0.00007008029,0.0002943168,0.00014367628,0.00014380233],"category_scores_gemma":[0.00002925545,0.00016346588,0.00020447203,0.000201497,0.000029810306,0.00019422035,0.00000956668,0.0002851245,0.00011537481],"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.00070600986,0.000611672,0.0008876142,0.00023521538,0.0006929939,0.0004746289,0.00060965883,0.029412024,0.1646126,0.15382737,0.64712447,0.00080575986],"study_design_scores_gemma":[0.00888941,0.0023177138,0.0012296704,0.00053228316,0.0003403799,0.0007152813,0.00018494767,0.0043285065,0.1983342,0.59595865,0.18574268,0.0014263123],"about_ca_topic_score_codex":0.0000054468524,"about_ca_topic_score_gemma":1.8595615e-7,"teacher_disagreement_score":0.46138176,"about_ca_system_score_codex":0.000063565756,"about_ca_system_score_gemma":0.000043702938,"threshold_uncertainty_score":0.6665945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97474396,0.00029782826,0.0030856384,0.00023139238,0.013848438,0.00024418178,0.000007576168,0.00012411184,0.007416859],"genre_scores_gemma":[0.9972623,0.00016874318,0.000114736875,0.00042829078,0.0019009243,0.000014070035,0.0000013313387,0.00008907585,0.000020557252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975657,0.00020028246,0.00081780413,0.00017624052,0.00072589365,0.0005141077],"domain_scores_gemma":[0.9986448,0.0002689052,0.00026938308,0.00040045122,0.00018489147,0.00023155942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001172224,0.00038523762,0.00051902817,0.00012759719,0.0002522177,0.0002027292,0.0005909111,0.00019663396,0.00003103697],"category_scores_gemma":[0.00008442574,0.00028318356,0.0004487978,0.00042912815,0.000105748986,0.0003823937,0.000034832927,0.0008029113,0.00015450131],"study_design_candidate":"bench_or_experimental","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.00034547917,0.00029951104,0.00037237827,0.000072163675,0.00043691025,0.00019306458,0.0007370017,0.034182776,0.4682838,0.47548857,0.019141333,0.00044701571],"study_design_scores_gemma":[0.004831438,0.0006797856,0.00030848928,0.00041906684,0.00014846463,0.00072126964,0.00014148295,0.00011382875,0.7360388,0.22281756,0.032992803,0.0007870394],"about_ca_topic_score_codex":0.000003966338,"about_ca_topic_score_gemma":9.80535e-7,"teacher_disagreement_score":0.26775497,"about_ca_system_score_codex":0.00022580245,"about_ca_system_score_gemma":0.00011769992,"threshold_uncertainty_score":0.99996203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969895,0.00006878561,0.00036614493,0.00003071057,0.0015506035,0.00015126809,0.0000048739994,0.0000070893357,0.0008310205],"genre_scores_gemma":[0.9998761,0.000014698831,0.000034683606,0.0000028849556,0.00004911808,0.0000026037649,4.2623293e-7,0.00001663358,0.0000028973504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985058,0.00018347726,0.0007759043,0.000053546642,0.00034531535,0.00013599527],"domain_scores_gemma":[0.9989271,0.0003814069,0.00035958912,0.00017123508,0.00011673261,0.00004391404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058492244,0.00013214831,0.00048069947,0.00015446953,0.000015852725,0.000008026645,0.00023560812,0.000091478156,0.0000418619],"category_scores_gemma":[0.00011733356,0.000088919296,0.00017317753,0.00026194102,0.00005080421,0.00007027226,0.000011852091,0.00022929088,0.0000017471245],"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.00080474984,0.0009806121,0.008815989,0.0005229041,0.00036870077,0.000030381081,0.003296682,0.022024706,0.074182585,0.888285,0.0003397667,0.00034793097],"study_design_scores_gemma":[0.004224855,0.00090776116,0.010844502,0.0012300585,0.000055569122,0.000018220086,0.00079762965,0.00012753626,0.1506522,0.8309365,0.000025128991,0.00018006613],"about_ca_topic_score_codex":0.000012483882,"about_ca_topic_score_gemma":0.0000027812957,"teacher_disagreement_score":0.076469615,"about_ca_system_score_codex":0.00004571904,"about_ca_system_score_gemma":0.0000354601,"threshold_uncertainty_score":0.36260235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52992374,0.054638684,0.37877014,0.001380581,0.027901707,0.0029014456,0.00006191558,0.00029815678,0.004123612],"genre_scores_gemma":[0.9974729,0.00077455625,0.0011023282,0.000021111651,0.00053172244,0.000011404487,2.7489443e-7,0.000026878744,0.000058834343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992236,0.00004505649,0.00030999337,0.00008173757,0.00015626106,0.00018337442],"domain_scores_gemma":[0.9993738,0.00024285709,0.000121068326,0.00009261092,0.000075891716,0.00009376718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005355475,0.00013875839,0.00024601657,0.00006157414,0.00013207247,0.00011348758,0.0001351868,0.00007397671,0.0000102689555],"category_scores_gemma":[0.000034429228,0.00009469364,0.000074790485,0.00010308,0.00006072633,0.00019408754,0.000018873872,0.00017508956,9.647182e-7],"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.0010897656,0.0005171193,0.0036757265,0.0024161015,0.0042481115,0.0003128091,0.017222226,0.012172189,0.074466094,0.56017697,0.08799715,0.23570573],"study_design_scores_gemma":[0.019955996,0.0050161215,0.0032577885,0.0008448322,0.0011209409,0.0027853753,0.0013041054,0.16697611,0.013595925,0.34051767,0.44249874,0.002126368],"about_ca_topic_score_codex":0.0000022013578,"about_ca_topic_score_gemma":3.371971e-7,"teacher_disagreement_score":0.46754915,"about_ca_system_score_codex":0.000022336751,"about_ca_system_score_gemma":0.0000064481974,"threshold_uncertainty_score":0.38614947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94403726,0.0031987734,0.0075808857,0.000042325824,0.031282376,0.00021034513,0.0000023834239,0.00016247753,0.013483182],"genre_scores_gemma":[0.9975329,0.00003743907,0.000116705145,0.0000059372546,0.0022181256,0.0000034782302,1.8888866e-7,0.000025828793,0.00005940946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886537,0.00009037813,0.00051509275,0.000056553148,0.00026822527,0.00020441273],"domain_scores_gemma":[0.9993934,0.00009995173,0.00013988678,0.0001249313,0.000110888264,0.00013095533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070770865,0.00012497113,0.0003002149,0.00013742533,0.00005560869,0.00006903135,0.00022566211,0.000091633,0.00002160025],"category_scores_gemma":[0.00003186406,0.00011337547,0.00012429456,0.00015831579,0.000017938497,0.00030558993,0.000008993837,0.00023866713,0.000042153606],"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.00028882784,0.00029228316,0.0006739941,0.00030743907,0.00064064324,0.00017096075,0.0014512934,0.35321915,0.083759695,0.5325446,0.022587484,0.0040636244],"study_design_scores_gemma":[0.015940469,0.0022638766,0.0012762405,0.0015361945,0.00050327124,0.0023003053,0.0017749397,0.059061162,0.10996931,0.06947846,0.73352766,0.00236812],"about_ca_topic_score_codex":0.000001880915,"about_ca_topic_score_gemma":2.823282e-7,"teacher_disagreement_score":0.7109402,"about_ca_system_score_codex":0.00010669597,"about_ca_system_score_gemma":0.000025885294,"threshold_uncertainty_score":0.46233174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8717369,0.00051662844,0.09391453,0.000055506916,0.016209668,0.00038207386,0.000005838271,0.00022080504,0.016958056],"genre_scores_gemma":[0.9981946,0.000018515211,0.00065187685,0.000021459979,0.00095366436,0.0000023921168,3.887373e-7,0.00004548553,0.00011164232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836177,0.000096423355,0.0006209588,0.00010189958,0.0004661382,0.00035282577],"domain_scores_gemma":[0.9988803,0.0002677686,0.0002173894,0.0001959485,0.00021488199,0.00022367502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018313499,0.00021809318,0.0004123195,0.00024939672,0.00008277775,0.00006848689,0.00029601692,0.00012637101,0.000047879254],"category_scores_gemma":[0.000048687365,0.00014371703,0.00015229701,0.00029596107,0.000066225206,0.0002662551,0.000009537283,0.00036919038,0.000014124848],"study_design_candidate":"bench_or_experimental","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.007844181,0.0008259077,0.0035110838,0.00052701804,0.0015136462,0.003202727,0.0037302743,0.002995046,0.42500937,0.53022474,0.014265485,0.0063505145],"study_design_scores_gemma":[0.015686693,0.005316863,0.0041669724,0.000938615,0.0005056552,0.002117055,0.0017842982,0.00030559945,0.7339967,0.19042774,0.042777814,0.0019759736],"about_ca_topic_score_codex":0.0000034974028,"about_ca_topic_score_gemma":0.0000034756306,"teacher_disagreement_score":0.33979702,"about_ca_system_score_codex":0.000087731845,"about_ca_system_score_gemma":0.000054855453,"threshold_uncertainty_score":0.58606106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97696966,0.00019197499,0.004854083,0.0001074965,0.005483313,0.00017511235,0.0000037305183,0.000022952929,0.012191705],"genre_scores_gemma":[0.99934113,0.00005248818,0.00011250383,0.000018529248,0.00034113653,0.0000029332698,3.246123e-7,0.00002808184,0.000102857055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835527,0.00025106073,0.0006852733,0.00006598642,0.00044870973,0.00019369811],"domain_scores_gemma":[0.99860287,0.00046420295,0.00033135735,0.00024239052,0.0002817322,0.00007743642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169489,0.00015837477,0.0004266847,0.000105285915,0.000053579457,0.000021776297,0.00036864128,0.00011562001,0.00019207058],"category_scores_gemma":[0.00015272696,0.00010993662,0.00021475986,0.00039231218,0.00007384783,0.0001250457,0.000013008519,0.00028970285,0.000013936957],"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.0015782202,0.0007987061,0.008547292,0.00023253597,0.0013223209,0.0001111854,0.0020459753,0.008765461,0.09566692,0.8551467,0.024453426,0.0013312523],"study_design_scores_gemma":[0.009510515,0.00341325,0.007843501,0.0015881882,0.0005815232,0.00083659537,0.0013570879,0.001369938,0.20057034,0.7217199,0.050047208,0.0011619452],"about_ca_topic_score_codex":0.0000064462024,"about_ca_topic_score_gemma":5.841076e-7,"teacher_disagreement_score":0.1334268,"about_ca_system_score_codex":0.00004446873,"about_ca_system_score_gemma":0.000068305584,"threshold_uncertainty_score":0.44830853},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5438485,0.0008756168,0.43436295,0.000051457642,0.013713995,0.0002347281,0.000009332432,0.00017267941,0.006730711],"genre_scores_gemma":[0.9970769,0.0000044551107,0.0015281267,0.000015294652,0.0012978608,0.000002952452,0.0000049804516,0.000034245037,0.00003513732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983654,0.00014800705,0.0006867445,0.00008969294,0.00046344567,0.00024670118],"domain_scores_gemma":[0.99913013,0.00022329412,0.00019997844,0.000107127176,0.00022094576,0.00011851151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065645203,0.00018712168,0.0003395926,0.0002050799,0.000090118185,0.00006415162,0.00024151386,0.00012064084,0.000074825424],"category_scores_gemma":[0.000019610292,0.00017525651,0.00021661367,0.00025430476,0.000047719528,0.00025891856,0.000010622196,0.00028670873,0.000035080044],"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.00021261975,0.00030355545,0.0016764605,0.00007814692,0.00028153035,0.00021212774,0.00016088197,0.19741045,0.026252773,0.7544267,0.017974712,0.0010099903],"study_design_scores_gemma":[0.002959513,0.0004782214,0.0049983757,0.00009436369,0.00009752835,0.0005730481,0.000035143003,0.0071533136,0.005362664,0.9709518,0.0068294746,0.0004665846],"about_ca_topic_score_codex":0.0000032834912,"about_ca_topic_score_gemma":7.256191e-7,"teacher_disagreement_score":0.4532284,"about_ca_system_score_codex":0.00007665556,"about_ca_system_score_gemma":0.00006761402,"threshold_uncertainty_score":0.7146753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597044,0.0025234653,0.015452765,0.000531438,0.007921776,0.0008277649,0.000017444374,0.00028205026,0.01273891],"genre_scores_gemma":[0.9988315,0.000041832358,0.00057795685,0.000058977974,0.0004021836,0.0000043106234,0.0000014369563,0.000028462158,0.0000533032],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983363,0.00026915382,0.0005073995,0.00012376904,0.00045214884,0.00031119643],"domain_scores_gemma":[0.99886787,0.00020146482,0.00023486737,0.00029720407,0.00024093555,0.0001576544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006246347,0.0002460346,0.00042646483,0.00012042121,0.00016523451,0.00011205647,0.00048192506,0.00012568112,0.000057101097],"category_scores_gemma":[0.00003859887,0.00012375232,0.00015474731,0.00043612104,0.000099855664,0.00031024523,0.000008578195,0.00048864225,0.0000091961665],"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.0048765033,0.0008985863,0.005937291,0.00012696083,0.0021071632,0.0009034582,0.0048686936,0.008577469,0.5043207,0.255515,0.20225534,0.009612889],"study_design_scores_gemma":[0.019474693,0.009305927,0.010191582,0.0014600366,0.0011302371,0.0012376265,0.003138341,0.0013909881,0.17087306,0.72070897,0.058680255,0.0024082926],"about_ca_topic_score_codex":0.00001609626,"about_ca_topic_score_gemma":0.0000023891073,"teacher_disagreement_score":0.46519396,"about_ca_system_score_codex":0.000049575105,"about_ca_system_score_gemma":0.00010145785,"threshold_uncertainty_score":0.5046474},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9230425,0.0014590791,0.0047969483,0.00006103361,0.049947925,0.00036640232,0.000004267051,0.00018504508,0.020136809],"genre_scores_gemma":[0.9985854,0.000020615656,0.00002340276,0.000017806644,0.0011718911,0.0000023665323,4.3047726e-7,0.000020812377,0.00015728196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866533,0.00012765563,0.0005535368,0.0000766505,0.00035222588,0.00022456913],"domain_scores_gemma":[0.99926,0.00014055794,0.0001713069,0.000162387,0.00012094492,0.0001448161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074938027,0.00016562552,0.0003906237,0.00019730655,0.000067582194,0.000095302115,0.00024128973,0.00011237748,0.00001543337],"category_scores_gemma":[0.00007245613,0.00014097992,0.00015628441,0.00022431248,0.000014016583,0.00019175868,0.0000043179643,0.0003169134,0.000017838298],"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.00057261804,0.0002664402,0.00007197485,0.000094135285,0.00020514721,0.00022977428,0.00037175274,0.034296643,0.045026444,0.88929784,0.02872194,0.00084528944],"study_design_scores_gemma":[0.03638573,0.026302958,0.0026796737,0.0041975514,0.000704832,0.001707669,0.0014437377,0.021018576,0.108484596,0.5859725,0.20731114,0.0037910554],"about_ca_topic_score_codex":0.0000018045191,"about_ca_topic_score_gemma":1.1315103e-7,"teacher_disagreement_score":0.30332536,"about_ca_system_score_codex":0.000106917054,"about_ca_system_score_gemma":0.000026289514,"threshold_uncertainty_score":0.57489944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644821,0.00056263804,0.0063802977,0.000007052623,0.014055598,0.0001487486,0.000020735091,0.000056262146,0.014286523],"genre_scores_gemma":[0.9985707,0.0000234045,0.0010703107,0.0000031021202,0.00029308908,7.7972203e-7,5.4074366e-7,0.000018964929,0.00001914916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876493,0.00008064227,0.00062405487,0.000061896244,0.0002818066,0.00018665743],"domain_scores_gemma":[0.9991128,0.00010347149,0.00024510224,0.00016665952,0.00024212475,0.0001298314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375515,0.00012982715,0.0003752941,0.00040986,0.00005072608,0.000015967997,0.00026038516,0.00015712899,0.0001919025],"category_scores_gemma":[0.00009109083,0.00011124533,0.00016708518,0.0005587956,0.00008391054,0.00023002576,0.000013281073,0.00034418982,0.000003983468],"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.00053965056,0.0002604074,0.0043238667,0.00022204994,0.000749628,0.00008899264,0.0016177956,0.0015532163,0.06811163,0.9144936,0.0063072406,0.0017318772],"study_design_scores_gemma":[0.0061632055,0.0025680638,0.006170677,0.0003062936,0.00039732418,0.0013485557,0.0012325085,0.0006780934,0.22918673,0.73117787,0.019993061,0.00077762036],"about_ca_topic_score_codex":0.0000051987163,"about_ca_topic_score_gemma":5.710862e-7,"teacher_disagreement_score":0.18331578,"about_ca_system_score_codex":0.000045727324,"about_ca_system_score_gemma":0.000055151377,"threshold_uncertainty_score":0.4536453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09743447,0.00019606457,0.8938516,0.00012874225,0.0044049006,0.000077938304,3.1959365e-7,0.000053061758,0.0038529483],"genre_scores_gemma":[0.988676,0.000008676352,0.010931819,0.000061832565,0.000268578,9.626381e-7,8.8825075e-8,0.000011844122,0.000040205614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985118,0.00017457826,0.00038678583,0.00015306554,0.0004915249,0.00028225785],"domain_scores_gemma":[0.99858576,0.0003134985,0.00040378878,0.00023040427,0.0002953756,0.00017118068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087868253,0.00014759183,0.0003074431,0.00012249166,0.00013978267,0.00020738647,0.0006044129,0.00005409771,0.000007590165],"category_scores_gemma":[0.00038664328,0.00011429788,0.00009971705,0.0003921063,0.00003371312,0.0006830054,0.000027609758,0.00026011866,0.0000072001926],"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.000022167149,0.00059739203,0.008727037,0.000053789732,0.00027907427,0.0010312838,0.0012550687,0.0031493315,0.037487667,0.9255596,0.0039549363,0.01788268],"study_design_scores_gemma":[0.027429426,0.012643019,0.009240845,0.0015422202,0.00036558407,0.006752646,0.00068644877,0.00809959,0.23691002,0.6520554,0.041130695,0.003144129],"about_ca_topic_score_codex":0.0000032680712,"about_ca_topic_score_gemma":5.547916e-7,"teacher_disagreement_score":0.89124155,"about_ca_system_score_codex":0.00006027839,"about_ca_system_score_gemma":0.0003025807,"threshold_uncertainty_score":0.46609324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875044,0.0020439525,0.0068736784,0.000012124553,0.0026411288,0.00012825457,0.0000022374775,0.000020654063,0.0007735345],"genre_scores_gemma":[0.99871653,0.00044752087,0.0006494796,0.0000023371974,0.0001229886,0.0000014750967,0.0000010311005,0.000019077712,0.000039544717],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998607,0.00018938554,0.00075248064,0.00006292994,0.0002683693,0.000119864744],"domain_scores_gemma":[0.99901736,0.00013709556,0.00038228728,0.000106818916,0.00028405964,0.00007236064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057948614,0.00012498266,0.00043467796,0.00020405381,0.000050463088,0.000010470005,0.00012216234,0.00012690699,0.000040467858],"category_scores_gemma":[0.00007529706,0.00011002578,0.00010815607,0.0003088825,0.000061675884,0.00021422603,0.000008679581,0.00015411426,0.0000011880352],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0012391652,0.0004236314,0.0059373993,0.0005374392,0.0013422022,0.00013485533,0.004302181,0.015314255,0.81347656,0.14878793,0.0073648198,0.0011395798],"study_design_scores_gemma":[0.022581674,0.004375708,0.007293722,0.0009600771,0.0008520355,0.0020567724,0.0005810135,0.005784333,0.72503805,0.2245347,0.004658837,0.0012830726],"about_ca_topic_score_codex":0.000009472677,"about_ca_topic_score_gemma":4.5893245e-7,"teacher_disagreement_score":0.08843849,"about_ca_system_score_codex":0.00003011377,"about_ca_system_score_gemma":0.000054023585,"threshold_uncertainty_score":0.44867212},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98023224,0.00020597108,0.0023512738,0.000052963802,0.008747798,0.00021154615,0.0000055708297,0.00008485414,0.008107777],"genre_scores_gemma":[0.99753636,0.000030547395,0.0012729678,0.000011102838,0.0009363326,0.0000015604838,3.2116498e-7,0.0000417544,0.00016904093],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998719,0.00008314705,0.00045044677,0.00013384843,0.00033984886,0.00027370735],"domain_scores_gemma":[0.99869573,0.00051010324,0.00020985061,0.00020834195,0.00010485582,0.0002711411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007978674,0.00021993463,0.0003746905,0.00011685841,0.000097913144,0.00012742657,0.00019801957,0.00014271133,0.000025186044],"category_scores_gemma":[0.00022839774,0.00017473499,0.00007770027,0.00019684831,0.000034465305,0.0002398096,0.000013074204,0.0006058046,0.000006936429],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.007836528,0.0004475263,0.0028764878,0.0002727643,0.0012128239,0.0007206436,0.003784182,0.014515238,0.814764,0.10858213,0.036690645,0.008296989],"study_design_scores_gemma":[0.04512395,0.013259942,0.009227024,0.002734266,0.00079051865,0.0032927953,0.0006251529,0.0016728716,0.61053425,0.113626525,0.19571888,0.0033938503],"about_ca_topic_score_codex":0.000011476372,"about_ca_topic_score_gemma":0.000006871581,"teacher_disagreement_score":0.20422982,"about_ca_system_score_codex":0.000033890326,"about_ca_system_score_gemma":0.00008302247,"threshold_uncertainty_score":0.7125486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82486546,0.0025327054,0.05696802,0.00015860486,0.033077206,0.0004839293,0.0000059170748,0.00037407555,0.081534065],"genre_scores_gemma":[0.9981413,0.00015389438,0.00034616407,0.000024054576,0.0010198189,0.0000035750365,7.238028e-7,0.000042697513,0.00026775972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836564,0.00014673403,0.0006536237,0.00009108605,0.00039004162,0.00035286625],"domain_scores_gemma":[0.9990167,0.00016626228,0.00018676312,0.00022592861,0.00019030918,0.0002140052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010573369,0.00019976975,0.0004033551,0.00023973739,0.00010252521,0.00008579407,0.00037953944,0.00016455293,0.000117327974],"category_scores_gemma":[0.00007465281,0.00017797772,0.00021550182,0.00038614238,0.00004005193,0.00042345683,0.000014518359,0.00040012583,0.00005977558],"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.0018007735,0.0007337016,0.00445262,0.0002838581,0.0011594439,0.0017913586,0.0018219737,0.029037012,0.17417432,0.64609057,0.13329467,0.005359676],"study_design_scores_gemma":[0.008792563,0.0027883893,0.0013111803,0.00052907557,0.0002987925,0.0021767544,0.0006828103,0.0042539174,0.040723298,0.4103703,0.5267308,0.0013421435],"about_ca_topic_score_codex":0.0000031398085,"about_ca_topic_score_gemma":9.4674846e-7,"teacher_disagreement_score":0.3934361,"about_ca_system_score_codex":0.00010959372,"about_ca_system_score_gemma":0.00006387539,"threshold_uncertainty_score":0.7257721},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92837894,0.00286775,0.02999034,0.000019195975,0.030009203,0.00039393766,0.000008230584,0.00007331283,0.008259085],"genre_scores_gemma":[0.9990065,0.00003895307,0.0003071909,0.0000029982161,0.00052104687,0.0000040630957,4.1511385e-7,0.000026814445,0.00009199674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847925,0.00007742336,0.00076483545,0.00007518041,0.000385056,0.0002182728],"domain_scores_gemma":[0.9990656,0.000075475014,0.00029497105,0.00020278574,0.00023437176,0.00012681892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080412225,0.00015498271,0.0004983207,0.00018083332,0.000042428517,0.00003860092,0.00031879736,0.00011696632,0.000010486251],"category_scores_gemma":[0.000051910098,0.00013293799,0.00018345479,0.00029288832,0.000041010342,0.00024898813,0.000012065743,0.00023007131,0.00001058661],"study_design_candidate":"bench_or_experimental","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.00056451984,0.0005466188,0.0003901293,0.0010658164,0.00065737375,0.00025810825,0.0017564135,0.17938298,0.3086298,0.50182915,0.0045999195,0.00031913375],"study_design_scores_gemma":[0.04115631,0.008786642,0.001512582,0.005722701,0.0007477989,0.0016655552,0.0032642747,0.007038635,0.5489308,0.34335342,0.03540407,0.0024171947],"about_ca_topic_score_codex":0.000018206178,"about_ca_topic_score_gemma":4.4061247e-7,"teacher_disagreement_score":0.240301,"about_ca_system_score_codex":0.0000921283,"about_ca_system_score_gemma":0.000081364786,"threshold_uncertainty_score":0.5421054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97561455,0.0008071868,0.009986222,0.000090546884,0.006535366,0.0002018022,0.000018941142,0.000084957224,0.0066604177],"genre_scores_gemma":[0.9993127,0.00003521146,0.00039690125,0.000016623313,0.00021089936,0.0000010905718,0.0000014771304,0.000013969883,0.000011099271],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868464,0.00011595424,0.0006761577,0.000061158404,0.0002688063,0.00019330092],"domain_scores_gemma":[0.9992353,0.000113378475,0.00021752073,0.0001485107,0.0001579437,0.00012734969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044126465,0.00013336468,0.0004060791,0.0002930594,0.00006508039,0.00003837104,0.00024335572,0.00008318112,0.0000502267],"category_scores_gemma":[0.000021359985,0.00012932693,0.00027190516,0.00031454023,0.000046805962,0.00018271708,0.0000047992135,0.00021616314,0.000008583962],"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.00025903765,0.0003152282,0.000092624345,0.00006396116,0.00024982018,0.000052913387,0.0006167589,0.0027628152,0.60101336,0.38804957,0.005168607,0.0013553059],"study_design_scores_gemma":[0.006003323,0.0030389177,0.006835174,0.0004557851,0.0002714781,0.000226598,0.00015165292,0.0009975145,0.073812425,0.8977515,0.009882981,0.00057266554],"about_ca_topic_score_codex":0.0000024336573,"about_ca_topic_score_gemma":8.17611e-7,"teacher_disagreement_score":0.52720094,"about_ca_system_score_codex":0.000035751666,"about_ca_system_score_gemma":0.000031199295,"threshold_uncertainty_score":0.52737993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8362324,0.0005755363,0.097951315,0.00010839324,0.019249277,0.00018729955,0.0000050747944,0.00019255218,0.045498133],"genre_scores_gemma":[0.99841547,0.00001392158,0.0007200345,0.000019894407,0.0007668085,0.000002257659,8.165155e-7,0.000023252649,0.000037550526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989563,0.00014552231,0.00042429435,0.000058851678,0.00023191658,0.00018306416],"domain_scores_gemma":[0.99929655,0.00017572913,0.00011448487,0.00014534517,0.00013136542,0.0001365177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007864909,0.00011320497,0.00025555948,0.00013282531,0.000086020416,0.000051605322,0.00022218165,0.00008005079,0.000049535953],"category_scores_gemma":[0.000053436885,0.00010398011,0.00015037294,0.00016617811,0.000023819635,0.00019721314,0.000009700337,0.00022646722,0.00003353268],"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.00019484283,0.00023467126,0.0006447621,0.00009809131,0.00030035153,0.000054273925,0.00038764774,0.033049136,0.07556556,0.87042576,0.0172447,0.0018002045],"study_design_scores_gemma":[0.005046319,0.0015260844,0.0025574896,0.00037494863,0.00020336517,0.00053032144,0.00011827736,0.010403048,0.029248338,0.82160884,0.12762363,0.0007593257],"about_ca_topic_score_codex":0.0000011855196,"about_ca_topic_score_gemma":6.4255244e-7,"teacher_disagreement_score":0.16218305,"about_ca_system_score_codex":0.00003698626,"about_ca_system_score_gemma":0.0000258999,"threshold_uncertainty_score":0.4240186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987239,0.0005477501,0.003117286,0.00003061838,0.0039391182,0.00011586064,0.0000058218893,0.000045806322,0.004958745],"genre_scores_gemma":[0.99901104,0.000010218884,0.00044616676,0.0000036057174,0.00045531167,0.0000017030383,7.048473e-7,0.000028754279,0.000042488355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988053,0.000100014324,0.000513835,0.0000633974,0.00033847487,0.00017899946],"domain_scores_gemma":[0.9992427,0.00009324982,0.00022612966,0.00021291465,0.00015078056,0.00007417267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052986003,0.00014484346,0.00035747426,0.00017654165,0.00003517505,0.00001852198,0.00029242382,0.00008902398,0.000030156783],"category_scores_gemma":[0.000022362452,0.000114767194,0.00013086804,0.000219976,0.00004947156,0.00017994005,0.000013137424,0.00020914985,0.000004334431],"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.0017460879,0.001001824,0.011254592,0.00071766024,0.0009274261,0.0009796908,0.00086211093,0.019639654,0.16569649,0.72072476,0.07601062,0.00043909065],"study_design_scores_gemma":[0.018075913,0.005924654,0.02553493,0.0014200476,0.00048236866,0.0010209777,0.0007036917,0.0012614364,0.1733429,0.7601372,0.010838202,0.0012576949],"about_ca_topic_score_codex":0.0000137939,"about_ca_topic_score_gemma":0.0000016011112,"teacher_disagreement_score":0.06517242,"about_ca_system_score_codex":0.00004234986,"about_ca_system_score_gemma":0.000037246475,"threshold_uncertainty_score":0.46800703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971378,0.0004200039,0.00036976684,0.000026238653,0.0007780456,0.00016021487,0.00000640057,0.000007517627,0.0010940096],"genre_scores_gemma":[0.9995935,0.00009098449,0.00017496521,0.0000039971014,0.00011139416,0.0000019286592,3.2192108e-7,0.000011848427,0.000011038422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904543,0.00011848511,0.00047542472,0.0000551887,0.00020654358,0.00009893741],"domain_scores_gemma":[0.9987549,0.0005645142,0.0003123924,0.00012331865,0.00020886901,0.000035995312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005096254,0.00011180887,0.00035981048,0.00011610582,0.00002272533,0.0000060662255,0.00017580752,0.00006774573,0.000007839281],"category_scores_gemma":[0.00015207447,0.00007359761,0.00008154202,0.00020954787,0.000101753474,0.00006603597,0.0000103410675,0.0001724767,1.9942675e-7],"study_design_candidate":"bench_or_experimental","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.0070235194,0.0017658026,0.026439847,0.0018846383,0.0018350095,0.00016250121,0.019345133,0.019850213,0.28685823,0.6313555,0.0007329569,0.0027466295],"study_design_scores_gemma":[0.014703864,0.011944239,0.04393381,0.0049173497,0.0006057741,0.0007047805,0.0150854075,0.0090125175,0.66421527,0.23171338,0.0019627893,0.0012007912],"about_ca_topic_score_codex":0.000012853227,"about_ca_topic_score_gemma":0.0000018527065,"teacher_disagreement_score":0.39964214,"about_ca_system_score_codex":0.00001079493,"about_ca_system_score_gemma":0.000035332192,"threshold_uncertainty_score":0.30012232},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894677,0.00008484086,0.0012544078,0.00006405807,0.00612158,0.00009205119,0.0000021144497,0.0000106550915,0.002902594],"genre_scores_gemma":[0.9996347,0.000015581838,0.00009122165,0.000003768103,0.00022777566,0.000001599764,2.1252109e-7,0.000011761941,0.000013394055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990665,0.000094269955,0.00044905787,0.000038509465,0.0002692345,0.00008245152],"domain_scores_gemma":[0.9988212,0.0003982807,0.00032752793,0.00017223995,0.00024630027,0.00003443428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008951333,0.00008013649,0.00021536378,0.00011084336,0.00002873352,0.000013462565,0.00025620323,0.000086927736,0.000045831115],"category_scores_gemma":[0.00017526852,0.000052436208,0.00010228588,0.00022786742,0.00004650775,0.00008464802,0.000005767953,0.0002887821,0.000003818198],"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.00009838168,0.00007862989,0.00020923877,0.000049052043,0.00007804045,0.0000014666507,0.00019861573,0.00030408453,0.4084701,0.5879324,0.0023018958,0.0002781061],"study_design_scores_gemma":[0.0033256714,0.001605174,0.013553946,0.00040537462,0.0002391701,0.000066733475,0.0006709618,0.0024637054,0.44392005,0.5232227,0.010099693,0.00042682438],"about_ca_topic_score_codex":0.0000020474524,"about_ca_topic_score_gemma":6.750049e-7,"teacher_disagreement_score":0.0647097,"about_ca_system_score_codex":0.000010457749,"about_ca_system_score_gemma":0.000033010943,"threshold_uncertainty_score":0.21382865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97936934,0.0008277775,0.008269404,0.00003376871,0.0078022615,0.00023890048,0.000005349097,0.00009762869,0.0033555792],"genre_scores_gemma":[0.99886745,0.000020305932,0.00022945154,0.0000057035127,0.00079914916,0.0000062274326,0.0000010596074,0.00004104321,0.000029606812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982751,0.00015262325,0.0007527951,0.00011339501,0.00035739815,0.00034867448],"domain_scores_gemma":[0.9990101,0.00026929282,0.00022945099,0.00018731273,0.000193155,0.000110714944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009070596,0.00021284752,0.00046825578,0.0003289867,0.00007202126,0.00007085267,0.00031093042,0.00017023631,0.00001962617],"category_scores_gemma":[0.000113427996,0.00019928104,0.00014952775,0.00057534326,0.0000240583,0.0002706933,0.000016586922,0.00041776235,0.000020872008],"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.0009316131,0.0019083881,0.12728395,0.0005879306,0.0004648346,0.0010466501,0.001273609,0.33295786,0.27156878,0.21625549,0.04504728,0.0006736075],"study_design_scores_gemma":[0.02781943,0.0021250884,0.0851034,0.0020908718,0.00030268406,0.00073672057,0.0009625695,0.020026026,0.21104616,0.6223788,0.024620077,0.0027881395],"about_ca_topic_score_codex":0.000025903357,"about_ca_topic_score_gemma":0.000041475978,"teacher_disagreement_score":0.40612334,"about_ca_system_score_codex":0.00012157215,"about_ca_system_score_gemma":0.000047263115,"threshold_uncertainty_score":0.81264454},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9580272,0.0008172822,0.008985307,0.00006192407,0.02993425,0.00041415522,0.000007901438,0.0000954169,0.0016566069],"genre_scores_gemma":[0.9974618,0.000009338643,0.00017337126,0.000015638856,0.002145452,0.000019246172,0.0000011690619,0.000038246348,0.00013573344],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984749,0.00016951363,0.00066184794,0.0000963108,0.0003513531,0.00024607626],"domain_scores_gemma":[0.998986,0.00016660044,0.00015009636,0.00021629696,0.00020919216,0.0002717999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004561821,0.00018198708,0.0004580577,0.0001931454,0.0000483671,0.00016648984,0.00033555675,0.00012315928,0.00012211036],"category_scores_gemma":[0.00006923245,0.00015115472,0.00015215165,0.0002258126,0.000014775771,0.00032681646,0.00001648225,0.00021991102,0.00023558759],"study_design_candidate":"bench_or_experimental","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.0004268462,0.0004078728,0.0011136427,0.00026176948,0.0012075477,0.0001486033,0.0038891796,0.031924445,0.57383144,0.08273182,0.3009645,0.0030923358],"study_design_scores_gemma":[0.028371545,0.0060075438,0.010786953,0.0031461874,0.0008458275,0.00044644027,0.008618653,0.021852063,0.1652088,0.5189567,0.23112,0.0046392735],"about_ca_topic_score_codex":0.000086981476,"about_ca_topic_score_gemma":6.449659e-7,"teacher_disagreement_score":0.43622488,"about_ca_system_score_codex":0.00007420086,"about_ca_system_score_gemma":0.000025303134,"threshold_uncertainty_score":0.61639106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63909066,0.001540615,0.34132096,0.00065766624,0.014105238,0.0007853873,0.000038775484,0.000024488323,0.0024362253],"genre_scores_gemma":[0.9892816,0.000032022537,0.008204898,0.00018003769,0.0020643554,0.000002888724,0.00006250599,0.000013824267,0.0001578915],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885225,0.00011843144,0.00039228503,0.00019989195,0.00021149013,0.00022564548],"domain_scores_gemma":[0.99877864,0.000060239927,0.00031166078,0.0003112796,0.00035801416,0.00018018499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013695187,0.00013054711,0.00023481475,0.000032942953,0.000057093468,0.000040046147,0.00064400217,0.0001358263,0.0000057979682],"category_scores_gemma":[0.0006321596,0.00009770063,0.00009493053,0.000064501844,0.00003806939,0.000009738018,0.00018459301,0.00010610495,0.00000398118],"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.0047067436,0.00068219414,0.0022441384,0.000034163157,0.00034934745,0.000028555069,0.000061786784,0.0004519472,0.6551972,0.0036654698,0.32877845,0.0037999793],"study_design_scores_gemma":[0.01347559,0.014871164,0.00025243306,0.00007230829,0.00016922012,0.000117332114,0.00019968892,0.0015886499,0.2056321,0.01664962,0.7463241,0.00064774614],"about_ca_topic_score_codex":0.0000014565801,"about_ca_topic_score_gemma":3.9670638e-7,"teacher_disagreement_score":0.44956514,"about_ca_system_score_codex":0.000026665597,"about_ca_system_score_gemma":0.00023337746,"threshold_uncertainty_score":0.3984116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858571,0.0022074,0.00234543,0.000037116046,0.007867873,0.00043298383,0.0000020407267,0.00007248903,0.0011775431],"genre_scores_gemma":[0.9994727,0.00005190633,0.000046235305,0.0000102417025,0.00036378903,0.000010203818,7.170789e-7,0.000028097846,0.000016142225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977585,0.0002991207,0.00092521874,0.0001499996,0.00043026093,0.00043687556],"domain_scores_gemma":[0.99904495,0.00017847381,0.0002694086,0.00018424823,0.00012388063,0.0001990043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011901608,0.0002444666,0.00064442644,0.00040249742,0.000039020128,0.00016573581,0.00031233978,0.00016792797,0.0000065645518],"category_scores_gemma":[0.00007600498,0.00020925746,0.00007731098,0.0005061265,0.000030506077,0.0005135783,0.000007296415,0.00047107518,0.00000576521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00056600175,0.0002509645,0.0031446556,0.00026941966,0.00012469388,0.0007567025,0.00088735047,0.93928915,0.010289934,0.043418452,0.0008660345,0.00013666053],"study_design_scores_gemma":[0.056042723,0.014047053,0.011681305,0.021745699,0.0005744455,0.0041617258,0.014052821,0.77127653,0.017395586,0.044524565,0.038711097,0.0057864217],"about_ca_topic_score_codex":0.00010037027,"about_ca_topic_score_gemma":0.0000089606465,"teacher_disagreement_score":0.16801257,"about_ca_system_score_codex":0.00021683624,"about_ca_system_score_gemma":0.00012367453,"threshold_uncertainty_score":0.85332716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97619593,0.00042099663,0.0108241355,0.000043960208,0.009077033,0.00015065413,0.000016465432,0.00005622823,0.0032145751],"genre_scores_gemma":[0.99959946,0.000035739904,0.0000578529,0.000008486166,0.00026968375,0.0000013298186,0.0000012111541,0.00001472792,0.000011531547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998972,0.00007997713,0.00048825284,0.0000508532,0.00027721212,0.00013169243],"domain_scores_gemma":[0.9993172,0.00014471191,0.00018059691,0.00013283752,0.00013526142,0.000089391026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033202747,0.00011290151,0.0002801416,0.0002285166,0.000037541893,0.00001574793,0.0001820298,0.000082385915,0.00007974851],"category_scores_gemma":[0.000054992703,0.000098821154,0.00016595266,0.00023463256,0.000026788353,0.00013335557,0.000004653726,0.00019820455,0.000017626902],"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.00012433168,0.00033968152,0.00052601873,0.00008281998,0.0003167753,0.000023393079,0.0007346129,0.02489567,0.09509052,0.8699587,0.00736828,0.0005392068],"study_design_scores_gemma":[0.009010512,0.0030677444,0.0030633586,0.00079958653,0.00036002527,0.00032358445,0.00032414854,0.0023546584,0.20030202,0.7565255,0.02279056,0.0010782756],"about_ca_topic_score_codex":8.364167e-7,"about_ca_topic_score_gemma":2.6485648e-7,"teacher_disagreement_score":0.11343316,"about_ca_system_score_codex":0.0000417576,"about_ca_system_score_gemma":0.000029786479,"threshold_uncertainty_score":0.40298095},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787485,0.0024125138,0.007529963,0.00002968344,0.005803862,0.00011851568,0.0000029503972,0.000072161,0.0052818423],"genre_scores_gemma":[0.9987805,0.000028254753,0.00026722535,0.000005721267,0.0008275357,0.0000015311356,7.885801e-7,0.00002280302,0.000065633096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990652,0.00009153895,0.0004345372,0.0000643247,0.00017270802,0.00017165596],"domain_scores_gemma":[0.9994831,0.0001324247,0.00012327613,0.00009847502,0.0000778611,0.000084865125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048072843,0.00013130867,0.00026762523,0.00016337109,0.000050820665,0.00005995923,0.00013021249,0.00009775398,0.000015009911],"category_scores_gemma":[0.00002566735,0.00011733933,0.00008732156,0.0001712607,0.000029687557,0.00012326632,0.000009040813,0.00021308988,0.0000056174654],"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.00031271923,0.0002837949,0.0073874146,0.00027631907,0.00023156134,0.00027929142,0.0005767467,0.0053729657,0.06782772,0.90164065,0.012918467,0.0028923207],"study_design_scores_gemma":[0.010357123,0.0018632938,0.014058113,0.0005223873,0.00026933738,0.00070596155,0.00031446267,0.0027793264,0.039891563,0.8649866,0.06302714,0.0012246885],"about_ca_topic_score_codex":0.000013688279,"about_ca_topic_score_gemma":0.000002710923,"teacher_disagreement_score":0.050108675,"about_ca_system_score_codex":0.000031296993,"about_ca_system_score_gemma":0.000017982906,"threshold_uncertainty_score":0.4784959},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98794687,0.000148311,0.005123996,0.00012558454,0.0033204504,0.00015679629,0.0000030409126,0.00002943641,0.0031455294],"genre_scores_gemma":[0.9995947,0.000010803745,0.00006769564,0.000033456807,0.0002714367,0.0000012010844,2.3492053e-7,0.000011124538,0.000009372902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985766,0.00026225514,0.00056477386,0.00006617398,0.00036244158,0.00016777552],"domain_scores_gemma":[0.998776,0.0005618695,0.00020521105,0.00022328734,0.00015250334,0.00008110627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171759,0.00013696996,0.0003215506,0.00009446418,0.000055082466,0.000021658057,0.00033148436,0.000088902634,0.000057137975],"category_scores_gemma":[0.00019669691,0.00009015885,0.0002272619,0.00021514003,0.000054472017,0.000102300655,0.0000055652386,0.0003295586,0.0000064059486],"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.00034548654,0.0002553619,0.00020434371,0.00002698341,0.00011416524,0.000016958771,0.00030306654,0.003337969,0.05633771,0.93454385,0.0035921223,0.0009219581],"study_design_scores_gemma":[0.0013271949,0.0018817036,0.0049352725,0.00015496659,0.000066229295,0.000054491124,0.00009427687,0.00045617067,0.048919395,0.94106925,0.00082365534,0.00021738243],"about_ca_topic_score_codex":4.8362807e-7,"about_ca_topic_score_gemma":1.2721735e-7,"teacher_disagreement_score":0.011647819,"about_ca_system_score_codex":0.00004656595,"about_ca_system_score_gemma":0.000043490752,"threshold_uncertainty_score":0.3676571},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97774583,0.00043934846,0.015627503,0.00001242435,0.0035055783,0.00013271175,0.0000014146725,0.000068686495,0.0024664826],"genre_scores_gemma":[0.99885553,0.000010400307,0.00050612626,0.000025064084,0.0005067332,0.0000011010859,4.9953826e-8,0.00003914927,0.000055828496],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989484,0.000064848915,0.0003944102,0.00007882301,0.00026134824,0.00025217264],"domain_scores_gemma":[0.9991069,0.00038531475,0.00013748035,0.00011525558,0.00008471011,0.0001703408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011858989,0.00016576635,0.00029803987,0.00010592639,0.000061980245,0.000052017207,0.00013713025,0.000098226985,0.000018281164],"category_scores_gemma":[0.00005160662,0.00013154437,0.000070354195,0.00017601045,0.000045552377,0.000163728,0.000009143192,0.0002483353,0.0000032639052],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0067778565,0.0010169873,0.061844267,0.0010753032,0.0032972277,0.0024587417,0.011108297,0.025025466,0.6084275,0.2589893,0.014238949,0.005740077],"study_design_scores_gemma":[0.038344324,0.012735686,0.026599767,0.0029070524,0.0011394701,0.008524534,0.0039728936,0.002072917,0.50367147,0.16122523,0.2343829,0.0044237487],"about_ca_topic_score_codex":0.0000026163798,"about_ca_topic_score_gemma":0.0000017914067,"teacher_disagreement_score":0.22014394,"about_ca_system_score_codex":0.000046853034,"about_ca_system_score_gemma":0.000025865813,"threshold_uncertainty_score":0.5364223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98933345,0.0006770165,0.0015865035,0.000022803039,0.0073299557,0.00007368758,0.0000022352508,0.000020858672,0.00095348194],"genre_scores_gemma":[0.9988039,0.000043827535,0.00067634776,0.000004757024,0.0004376693,7.979156e-7,2.2483077e-7,0.000016561462,0.0000158872],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927294,0.00005189594,0.00035544107,0.000050519684,0.00015016724,0.00011902191],"domain_scores_gemma":[0.99935806,0.00014014219,0.00016711885,0.000100627345,0.00014669323,0.00008734682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004983378,0.0001082301,0.00028869687,0.00012536193,0.000030672305,0.00003051936,0.00015201034,0.00013021265,0.00003187412],"category_scores_gemma":[0.00006790551,0.00008792508,0.0000740348,0.00015605237,0.000042073047,0.00010464344,0.000010961304,0.00034830222,0.0000014965619],"study_design_candidate":"bench_or_experimental","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.0003636676,0.00018411047,0.0055115586,0.0006214233,0.00059932005,0.000111137364,0.0016829576,0.0017050067,0.6771399,0.30359802,0.003998465,0.004484478],"study_design_scores_gemma":[0.017718343,0.004462222,0.013234432,0.0009598739,0.00091190723,0.002309191,0.0009546524,0.003048832,0.33117238,0.537418,0.08587985,0.0019303252],"about_ca_topic_score_codex":0.000004022628,"about_ca_topic_score_gemma":0.0000029635398,"teacher_disagreement_score":0.34596747,"about_ca_system_score_codex":0.000007153377,"about_ca_system_score_gemma":0.000025621064,"threshold_uncertainty_score":0.35854807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49103802,0.0006685148,0.48481593,0.000008822977,0.016800491,0.00041169624,0.000016450816,0.00015976085,0.0060803145],"genre_scores_gemma":[0.99608284,0.000016747785,0.0034126628,0.000012117412,0.00042448012,0.000011494226,0.000001130513,0.000027418779,0.000011119558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990411,0.00015250567,0.00040337344,0.0000733959,0.00014043476,0.00018920265],"domain_scores_gemma":[0.9991943,0.00016167239,0.00013011502,0.00017940668,0.00017961045,0.00015488187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092973333,0.000128586,0.00024476516,0.0001621372,0.000096927186,0.00003286726,0.0003221573,0.00008826567,0.000036734597],"category_scores_gemma":[0.000029190178,0.00011491169,0.00019866682,0.00014203553,0.000046040426,0.00033964572,0.0000048206743,0.00015640269,0.0000050937906],"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.00036922735,0.00020161946,0.00009721542,0.000043362466,0.00014517613,0.000019790745,0.0010954634,0.00021316779,0.028256364,0.96841645,0.0006188408,0.00052333926],"study_design_scores_gemma":[0.001146081,0.0010337115,0.00031615113,0.00006572647,0.00008848615,0.0000942229,0.00026736117,0.00018719665,0.03290552,0.9630829,0.0006229033,0.00018970386],"about_ca_topic_score_codex":9.689271e-7,"about_ca_topic_score_gemma":3.3605355e-7,"teacher_disagreement_score":0.5050448,"about_ca_system_score_codex":0.000026277221,"about_ca_system_score_gemma":0.000026677895,"threshold_uncertainty_score":0.46859625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892199,0.0019861613,0.001142092,0.000017304426,0.004916737,0.00009285435,0.0000027182964,0.000033305463,0.002588945],"genre_scores_gemma":[0.998948,0.00040637786,0.00026663666,0.000005183478,0.00032295304,0.0000011815989,2.8893285e-7,0.000021741678,0.000027654043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988844,0.00009193172,0.00051165133,0.00006717899,0.00028426418,0.00016061995],"domain_scores_gemma":[0.9992509,0.00016684872,0.00021558223,0.00011641102,0.00013641106,0.00011385483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004486425,0.0001362306,0.00038922866,0.0001810487,0.00006810691,0.000018763461,0.00017766823,0.00009640727,0.000017175087],"category_scores_gemma":[0.000059828344,0.000120531,0.00012084656,0.00021729471,0.0000804469,0.00020252896,0.000013121658,0.00019926226,0.000003471785],"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.0023286105,0.0012678418,0.034195486,0.0024890834,0.0030172935,0.001507271,0.011475182,0.0065505463,0.20562316,0.63957566,0.08710052,0.004869316],"study_design_scores_gemma":[0.030947583,0.008296769,0.037612353,0.002217962,0.0011256349,0.006378095,0.002503705,0.0016379452,0.15583402,0.62564725,0.12444203,0.0033566689],"about_ca_topic_score_codex":0.000007581958,"about_ca_topic_score_gemma":4.7464943e-7,"teacher_disagreement_score":0.04978915,"about_ca_system_score_codex":0.000026740046,"about_ca_system_score_gemma":0.000041287367,"threshold_uncertainty_score":0.49151117},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858485,0.0004887432,0.008936428,0.00024118526,0.0037362722,0.0002078871,0.0000016723116,0.0000675339,0.00047180054],"genre_scores_gemma":[0.99777186,0.00009145278,0.00085980556,0.000020153784,0.0011806979,0.0000014177184,7.247947e-8,0.000033060474,0.000041460884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900234,0.000023459426,0.00036075697,0.000081718645,0.00031835266,0.00021335231],"domain_scores_gemma":[0.9992032,0.00013325008,0.00018213232,0.00017550736,0.00008206207,0.0002238396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030437042,0.00017421544,0.00036686816,0.00008967872,0.00009885705,0.0001220151,0.000231785,0.00013126266,0.00001296553],"category_scores_gemma":[0.00007886736,0.00012527776,0.00006760503,0.00013376852,0.00004959476,0.000421078,0.000018995363,0.00034732214,0.0000034436068],"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.005600323,0.00062450545,0.00816525,0.00055499654,0.0024934364,0.0013163947,0.002245791,0.03705647,0.016482115,0.9197532,0.0018277369,0.00387981],"study_design_scores_gemma":[0.012643088,0.0025558057,0.010562064,0.00066158216,0.00018168548,0.0007434699,0.00016860102,0.00014721965,0.0062317224,0.9643169,0.0012884238,0.0004994064],"about_ca_topic_score_codex":0.000020859428,"about_ca_topic_score_gemma":0.000017605737,"teacher_disagreement_score":0.044563755,"about_ca_system_score_codex":0.000064818596,"about_ca_system_score_gemma":0.00013926768,"threshold_uncertainty_score":0.5108679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9602918,0.0043203095,0.0062601017,0.00001845481,0.022010282,0.000116389376,0.0000029395671,0.000045112716,0.006934599],"genre_scores_gemma":[0.99864405,0.000061201485,0.00034950697,0.0000041444587,0.00089376094,0.0000010528753,2.254917e-7,0.00001884353,0.000027205811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895567,0.00009239445,0.00046514673,0.00003213047,0.0002613151,0.00019331685],"domain_scores_gemma":[0.9992931,0.00012502413,0.0002020015,0.000108941356,0.0001630677,0.00010790563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008075973,0.000105004634,0.0003008369,0.00014492069,0.000025615944,0.000015291713,0.0001852969,0.0000861467,0.00005308195],"category_scores_gemma":[0.000058917718,0.00008775435,0.00012446396,0.00025267876,0.000023078339,0.00030843017,0.000009795863,0.00016925803,0.000012607755],"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.00076767,0.0011051525,0.02593459,0.0010578432,0.0016052946,0.000059574322,0.004723731,0.004398457,0.23541632,0.6679262,0.052686,0.0043191956],"study_design_scores_gemma":[0.015509662,0.0033110015,0.019484002,0.0013624319,0.0012195047,0.0010769037,0.0021860907,0.0010637116,0.47754785,0.22942924,0.24550076,0.0023088166],"about_ca_topic_score_codex":0.0000018774376,"about_ca_topic_score_gemma":9.053511e-8,"teacher_disagreement_score":0.43849692,"about_ca_system_score_codex":0.00002792563,"about_ca_system_score_gemma":0.000023970106,"threshold_uncertainty_score":0.35785186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80077124,0.003920364,0.04447251,0.00020939221,0.1407192,0.0005378714,0.00002632962,0.00033000967,0.0090130735],"genre_scores_gemma":[0.9983027,0.00005118501,0.000023037343,0.000004277273,0.001380581,0.0000039872702,1.26819e-7,0.000029441248,0.00020468293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875414,0.00015551744,0.0005321821,0.00006822766,0.00027754184,0.00021240245],"domain_scores_gemma":[0.9991469,0.00013609602,0.00023996468,0.00016946212,0.00015296573,0.00015460656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007285718,0.00014157098,0.0003699201,0.00014963352,0.00004629238,0.00005339937,0.00025766506,0.000110192384,0.0000373651],"category_scores_gemma":[0.00008483352,0.00009154186,0.00015396741,0.00015243495,0.000026902844,0.0002593503,0.000008732488,0.00013081504,0.00004563516],"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.00075707113,0.00031941463,0.0034899192,0.0004568881,0.0010421836,0.0005425625,0.0006904584,0.0017574531,0.35004523,0.52180016,0.11517022,0.0039284495],"study_design_scores_gemma":[0.032236155,0.0034528456,0.006491261,0.0054990305,0.00049188355,0.0020668958,0.0016952959,0.0009697729,0.10426785,0.23829812,0.60183436,0.002696513],"about_ca_topic_score_codex":0.0000012480298,"about_ca_topic_score_gemma":2.1350134e-7,"teacher_disagreement_score":0.48666415,"about_ca_system_score_codex":0.000086291904,"about_ca_system_score_gemma":0.000029038172,"threshold_uncertainty_score":0.37329686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8256281,0.0011938978,0.15646617,0.00010293688,0.015780997,0.00026779875,0.000014039896,0.0000767627,0.00046929964],"genre_scores_gemma":[0.9965823,0.0001981814,0.0025391423,0.000006302797,0.00063003966,0.000007739377,3.6673913e-7,0.000019568235,0.00001634547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919003,0.00006649771,0.00039240255,0.00006765305,0.00012764981,0.00015573973],"domain_scores_gemma":[0.9993332,0.00025016666,0.0001402005,0.00007263502,0.000107639054,0.00009618146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197532,0.00010971606,0.00026150708,0.00013508562,0.000086849555,0.00004479973,0.00010915208,0.000073442214,0.000012281001],"category_scores_gemma":[0.000058311813,0.0000742374,0.00009566358,0.000096041964,0.00003696499,0.00022883991,0.000007980161,0.00007130058,0.0000016715961],"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.0002274596,0.000041748906,0.0007856502,0.00013928389,0.000397568,0.000022710918,0.00030739204,0.00006437793,0.28995824,0.69642204,0.0028907694,0.008742729],"study_design_scores_gemma":[0.019055543,0.0009147602,0.0015044749,0.0008530079,0.00039621617,0.0012602967,0.00037184884,0.0007170965,0.03610652,0.84449524,0.09332768,0.0009973035],"about_ca_topic_score_codex":0.0000010979089,"about_ca_topic_score_gemma":3.408466e-7,"teacher_disagreement_score":0.2538517,"about_ca_system_score_codex":0.00003981152,"about_ca_system_score_gemma":0.000025657924,"threshold_uncertainty_score":0.30273134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2333706,0.000048758797,0.7644165,0.000047223464,0.0016346717,0.00008668716,7.8183314e-7,0.00001298111,0.00038178166],"genre_scores_gemma":[0.9951566,0.00000946266,0.004520151,0.00000836717,0.00029428262,7.6396753e-7,1.9684876e-7,0.0000068296536,0.0000033698468],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986099,0.00010253355,0.0005670095,0.00012666972,0.00044930616,0.00014458469],"domain_scores_gemma":[0.99687475,0.0002736882,0.0017864937,0.00054278236,0.00041400854,0.000108304754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133116,0.00009967043,0.0003474152,0.00007510396,0.00016855408,0.00010357608,0.0013717029,0.00006112881,0.000002709429],"category_scores_gemma":[0.0005279035,0.00008731667,0.00011194736,0.00008590668,0.00006458967,0.00087522145,0.00009963691,0.00015698702,0.0000010540441],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000021083475,0.0005076821,0.012738313,0.00008140458,0.000057782225,0.000018316632,0.00053021696,0.0014788706,0.80373836,0.15142071,0.00006662437,0.029340655],"study_design_scores_gemma":[0.0083761895,0.00410559,0.14541642,0.0012625257,0.00016228386,0.00017130388,0.00010161257,0.11785547,0.4509671,0.27040124,0.00048461865,0.0006956193],"about_ca_topic_score_codex":0.000025628508,"about_ca_topic_score_gemma":3.0540164e-7,"teacher_disagreement_score":0.761786,"about_ca_system_score_codex":0.00003375052,"about_ca_system_score_gemma":0.00012262781,"threshold_uncertainty_score":0.35606706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801306,0.000111681526,0.008111658,0.000048146063,0.004076108,0.00015132788,0.0000038929993,0.000030277859,0.0073363152],"genre_scores_gemma":[0.9994461,0.000011274379,0.00013463962,0.000002647592,0.00034752526,0.0000032585197,2.8118274e-7,0.000024611014,0.000029680328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990085,0.0000783679,0.00039602138,0.000071737355,0.00024594224,0.00019942869],"domain_scores_gemma":[0.99928486,0.00008802244,0.00021518134,0.00024730325,0.000063823965,0.00010081477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065119896,0.0001440086,0.00036357983,0.00011259525,0.000104750005,0.00011583722,0.00038650518,0.00008340117,0.000023738427],"category_scores_gemma":[0.00005386271,0.00011402807,0.00009625442,0.00006877886,0.000051667004,0.000322085,0.0000069477005,0.0002936027,0.000006562345],"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.003945328,0.0010388347,0.12945116,0.0009935821,0.0014559623,0.003645166,0.008874152,0.024413275,0.13106246,0.68432593,0.0050615277,0.005732627],"study_design_scores_gemma":[0.048484582,0.0058410233,0.33643815,0.0052558095,0.000670855,0.0009165128,0.0018373411,0.005359126,0.1094288,0.46879098,0.013685908,0.003290931],"about_ca_topic_score_codex":0.0000071922163,"about_ca_topic_score_gemma":0.0000059831427,"teacher_disagreement_score":0.21553497,"about_ca_system_score_codex":0.000047258087,"about_ca_system_score_gemma":0.00003134431,"threshold_uncertainty_score":0.46499297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93444806,0.000839156,0.010403442,0.000026294349,0.043365587,0.000307536,0.00000495215,0.000118335374,0.010486649],"genre_scores_gemma":[0.99847645,0.000021437374,0.000055871362,0.000002584187,0.0013104858,0.0000053993217,3.5024792e-7,0.000040442155,0.00008696346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986554,0.0001283472,0.00051578815,0.000097309574,0.00033529973,0.00026787882],"domain_scores_gemma":[0.99868715,0.000119830765,0.00051165523,0.00036218422,0.00016559073,0.0001536043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010427171,0.00019683038,0.00048757187,0.00014178382,0.00030749518,0.00036609473,0.0005357175,0.0001037762,0.0000091351385],"category_scores_gemma":[0.000081648825,0.00014966553,0.00015154447,0.00007569651,0.000060994927,0.0004628889,0.000018937362,0.000345246,0.000009359113],"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.0039947266,0.00090498704,0.048740048,0.0025279664,0.005767844,0.0018743648,0.0075209793,0.045138806,0.19929431,0.6470543,0.034310665,0.0028709872],"study_design_scores_gemma":[0.12230952,0.02668843,0.041359235,0.027560534,0.0045418297,0.018125156,0.023175735,0.039113346,0.32460064,0.20828818,0.15176342,0.012473983],"about_ca_topic_score_codex":0.000024578047,"about_ca_topic_score_gemma":0.0000030952438,"teacher_disagreement_score":0.43876612,"about_ca_system_score_codex":0.00007446047,"about_ca_system_score_gemma":0.00003533271,"threshold_uncertainty_score":0.61031836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94234765,0.0011631128,0.0077112503,0.000058257785,0.04090165,0.00020594063,0.000002787604,0.000033458422,0.007575913],"genre_scores_gemma":[0.99547064,0.000020933598,0.0008705129,0.000018793055,0.0034870633,0.000001570733,2.339389e-7,0.000018311917,0.00011192012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861264,0.00022959262,0.000482227,0.000049090882,0.00039424072,0.00023217691],"domain_scores_gemma":[0.99869496,0.00035752184,0.00043828125,0.00015759082,0.00019461827,0.00015704309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014208452,0.00011119091,0.00028994866,0.00009402491,0.000113784256,0.00003703659,0.0001794345,0.000103606355,0.00007131574],"category_scores_gemma":[0.00038917686,0.000078103716,0.0001517485,0.000093235314,0.000041340023,0.00031593238,0.000028139313,0.00021993955,0.000007473653],"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.000074629264,0.00013476986,0.0015658389,0.00003140342,0.00006930411,0.000006375461,0.0005715694,0.0000039038487,0.0007761277,0.9869388,0.009728015,0.000099306155],"study_design_scores_gemma":[0.0009955118,0.00023397332,0.0007950582,0.00007062711,0.000121074,0.0001993264,0.00015263111,0.000012320571,0.0023651316,0.9815513,0.013356528,0.00014652849],"about_ca_topic_score_codex":0.0000013145952,"about_ca_topic_score_gemma":2.9090856e-8,"teacher_disagreement_score":0.05312303,"about_ca_system_score_codex":0.000055248005,"about_ca_system_score_gemma":0.000029323974,"threshold_uncertainty_score":0.31849772},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9481996,0.00004921942,0.0052396394,0.00087910437,0.010732384,0.0006931304,0.000001896202,0.00004666577,0.034158334],"genre_scores_gemma":[0.99773216,0.000006523593,0.00080905616,0.00009697074,0.0005366726,0.000003820385,1.8552183e-7,0.000025230473,0.00078936515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984422,0.00018476,0.00051530544,0.00009630904,0.00056518306,0.00019626714],"domain_scores_gemma":[0.99790853,0.0009578068,0.0005473544,0.00027193772,0.00023794244,0.00007639644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013458718,0.00014333145,0.0002987323,0.00008722221,0.0001003417,0.00007076918,0.0003016568,0.00012638298,0.0002800896],"category_scores_gemma":[0.00033085136,0.00008574706,0.00020520877,0.0001775215,0.000026853068,0.00016890271,0.00002472167,0.00050455955,0.00012776157],"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.0002649205,0.00021201196,0.00006723079,0.000027201588,0.0000683317,0.0000070493115,0.00018034346,0.0000153804,0.0034571406,0.9776343,0.017498054,0.0005680149],"study_design_scores_gemma":[0.0014446053,0.0015550009,0.00009878525,0.00009916599,0.00005453498,0.000051911036,0.000062058076,0.0000529252,0.008615803,0.97971624,0.008119395,0.00012955756],"about_ca_topic_score_codex":0.0000039755682,"about_ca_topic_score_gemma":6.4371045e-7,"teacher_disagreement_score":0.04953255,"about_ca_system_score_codex":0.00009263926,"about_ca_system_score_gemma":0.00009104452,"threshold_uncertainty_score":0.34966636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879116,0.0043109483,0.016512917,0.0000053828016,0.08902631,0.00037635065,0.000027210475,0.000088544126,0.0017407347],"genre_scores_gemma":[0.9976313,0.00014182422,0.00015281787,0.0000017911809,0.0019838812,0.0000063563853,0.0000031104578,0.000053109106,0.00002577124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742794,0.00030538757,0.001286233,0.00014598787,0.0005805527,0.00025392193],"domain_scores_gemma":[0.9977233,0.00022453436,0.0009628159,0.00040775488,0.0005358797,0.00014572292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001323844,0.00032737877,0.0010478235,0.00031809454,0.000044162214,0.00009685784,0.0007552596,0.00051409885,0.0000124132475],"category_scores_gemma":[0.00007930301,0.0002922452,0.00036634802,0.0001489603,0.00007623045,0.00008316703,0.00011501216,0.0009341611,0.000006760787],"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.0022834255,0.0018766094,0.01857216,0.04382383,0.011411741,0.0010013824,0.015312825,0.21941133,0.18981552,0.4590727,0.031182505,0.0062359725],"study_design_scores_gemma":[0.0075399135,0.0034649367,0.004581166,0.034806263,0.0016337102,0.0007745592,0.00064747425,0.024711572,0.055234563,0.8560805,0.0072661582,0.0032591913],"about_ca_topic_score_codex":0.0000074922086,"about_ca_topic_score_gemma":2.991513e-7,"teacher_disagreement_score":0.3970078,"about_ca_system_score_codex":0.00011173249,"about_ca_system_score_gemma":0.00013944661,"threshold_uncertainty_score":0.999953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9794473,0.00009125084,0.0008745456,0.00019268595,0.0050763334,0.00023227278,0.000002046138,0.000047071575,0.014036482],"genre_scores_gemma":[0.99924827,0.000018161105,0.00006979669,0.00001810682,0.00047659664,0.000006167325,1.6046168e-7,0.00003066806,0.00013207982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897295,0.00010850327,0.00030652972,0.00007504906,0.00032611898,0.00021082396],"domain_scores_gemma":[0.99896234,0.00017394469,0.00025578216,0.00040977725,0.0001067876,0.0000913687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082181557,0.00015917822,0.00025678813,0.00006306518,0.0003353791,0.00022491909,0.00060877146,0.00007638576,0.00002743106],"category_scores_gemma":[0.000049903756,0.00008935745,0.000108641056,0.000049544473,0.0000761649,0.0002676793,0.000013080095,0.00036671333,0.000026391275],"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.00077255635,0.00024542704,0.0005413423,0.0001124209,0.0006271621,0.00023381572,0.002541414,0.0076642954,0.012103256,0.96260774,0.011172172,0.001378411],"study_design_scores_gemma":[0.008569652,0.004378218,0.00287705,0.0013783418,0.00025897508,0.00046825325,0.0005531573,0.0015727062,0.06256067,0.89098257,0.02539204,0.0010083882],"about_ca_topic_score_codex":0.0000057898164,"about_ca_topic_score_gemma":0.0000019305187,"teacher_disagreement_score":0.07162518,"about_ca_system_score_codex":0.000040229945,"about_ca_system_score_gemma":0.000028134193,"threshold_uncertainty_score":0.3643891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7330649,0.0023899134,0.059603978,0.000063506224,0.19111447,0.00065708376,0.00005124552,0.00031364447,0.012741283],"genre_scores_gemma":[0.99577594,0.000061254505,0.00031182033,0.0000071120016,0.003734475,0.0000052023147,0.000003369379,0.00006484741,0.000035969282],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979894,0.00021181972,0.000866668,0.00014530617,0.00047865853,0.00030813937],"domain_scores_gemma":[0.9986182,0.00010293245,0.00044216987,0.00036218792,0.0002701561,0.00020434815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010507676,0.00033173268,0.0006874073,0.0002780488,0.000056939607,0.00013367711,0.0006352706,0.00039242554,0.00008369847],"category_scores_gemma":[0.000040351057,0.00031154355,0.000408604,0.00010103054,0.000066780114,0.00019898741,0.00008569392,0.0010454445,0.00003130174],"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.0022710112,0.001224026,0.002038066,0.005231317,0.010999265,0.0014950488,0.009314009,0.11542511,0.03188738,0.39273515,0.41974276,0.007636873],"study_design_scores_gemma":[0.0057744626,0.0022742911,0.0006385808,0.0030566726,0.0008751452,0.00028945395,0.0006283474,0.004573416,0.017909706,0.91083103,0.05100643,0.002142438],"about_ca_topic_score_codex":0.0000027256913,"about_ca_topic_score_gemma":4.640148e-7,"teacher_disagreement_score":0.5180959,"about_ca_system_score_codex":0.0001739419,"about_ca_system_score_gemma":0.00013160147,"threshold_uncertainty_score":0.99993366},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9635507,0.0076767914,0.02300485,0.000025159916,0.004958993,0.0004232353,0.00007109267,0.00006153315,0.00022768645],"genre_scores_gemma":[0.9948389,0.0005794615,0.0042814794,0.000009321446,0.00020780819,0.00001637942,0.00001214925,0.00005171175,0.0000027975582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973554,0.00033448127,0.0012518889,0.00027669888,0.00042281768,0.0003586945],"domain_scores_gemma":[0.998087,0.00033890476,0.00059385796,0.0003736976,0.000312662,0.00029388766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087055843,0.000420929,0.0011573802,0.00044212778,0.00015585672,0.00016957968,0.00031966803,0.0002882539,0.000016769369],"category_scores_gemma":[0.000037188707,0.00043647483,0.0003585492,0.00022519773,0.00016003396,0.00021687419,0.00022556886,0.00081964425,7.739524e-7],"study_design_candidate":"bench_or_experimental","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.00057197263,0.00065144047,0.005261087,0.003993355,0.0034239627,0.00035302292,0.004776043,0.08162046,0.8806732,0.01668325,0.0003617782,0.0016304107],"study_design_scores_gemma":[0.03678258,0.0048634144,0.058476876,0.022675328,0.0051466348,0.0038015947,0.004002765,0.35653782,0.14969741,0.3425332,0.007682195,0.00780017],"about_ca_topic_score_codex":0.000059092356,"about_ca_topic_score_gemma":0.000014692507,"teacher_disagreement_score":0.7309758,"about_ca_system_score_codex":0.000058476904,"about_ca_system_score_gemma":0.000051354116,"threshold_uncertainty_score":0.9998087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98605675,0.00020450732,0.0016082783,0.000005246058,0.008789371,0.00010271725,0.0000011689262,0.000019685614,0.0032123055],"genre_scores_gemma":[0.9995978,0.000016718132,0.000087648405,0.0000018531077,0.0002527453,6.999669e-7,3.429028e-7,0.000014917522,0.00002729416],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991337,0.00008412228,0.00038880436,0.000041208492,0.00025072106,0.00010142724],"domain_scores_gemma":[0.99941266,0.000118427255,0.00017684717,0.00011410074,0.00012529804,0.0000526759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445396,0.00008256072,0.00028270166,0.00012388318,0.000013172399,0.000013468103,0.0001377837,0.00007719621,0.00008403696],"category_scores_gemma":[0.00003524705,0.00007491492,0.00013413912,0.00013276529,0.000011483689,0.00017159151,0.000005354389,0.00015955974,0.000021638336],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00042881913,0.00025954822,0.010730956,0.00049560773,0.00052179204,0.000011619148,0.0019275683,0.007187003,0.7677846,0.20788758,0.0015720429,0.001192878],"study_design_scores_gemma":[0.013588861,0.006302371,0.024090447,0.0013591006,0.00041898226,0.00018193664,0.00090609695,0.0037121405,0.6660456,0.26563025,0.01660017,0.0011640742],"about_ca_topic_score_codex":0.0000018071705,"about_ca_topic_score_gemma":8.515182e-8,"teacher_disagreement_score":0.101739004,"about_ca_system_score_codex":0.000043107255,"about_ca_system_score_gemma":0.000028957535,"threshold_uncertainty_score":0.30549416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98136556,0.000149706,0.00080067245,0.00013694393,0.009795722,0.00031715067,0.0000019322874,0.000020125455,0.007412202],"genre_scores_gemma":[0.9996018,0.000006477499,0.000028298025,0.000026327185,0.00021960425,0.0000021258752,6.530604e-8,0.000021596454,0.00009374701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986964,0.00023804512,0.00046952043,0.00005942001,0.00037702624,0.00015961818],"domain_scores_gemma":[0.99888563,0.0004223825,0.0002593689,0.0002893654,0.00010089623,0.000042374093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013151175,0.00012212699,0.00025755184,0.000062919324,0.00006108586,0.000032589753,0.00049646734,0.000078495235,0.00006775982],"category_scores_gemma":[0.00006114762,0.000063724496,0.00020795596,0.00021474357,0.000029423265,0.00009136119,0.000022923592,0.0003902878,0.00001999601],"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.00009421234,0.000075649135,0.000311831,0.00006864308,0.00015308203,0.000006893026,0.0005093486,0.016372005,0.038237058,0.9420266,0.002042397,0.00010228014],"study_design_scores_gemma":[0.0040685525,0.0015155814,0.004497447,0.001496667,0.00020204656,0.0003292582,0.000745231,0.0022814523,0.08133799,0.8949553,0.008017642,0.0005528341],"about_ca_topic_score_codex":0.000002876082,"about_ca_topic_score_gemma":2.6871578e-7,"teacher_disagreement_score":0.047071304,"about_ca_system_score_codex":0.00004484482,"about_ca_system_score_gemma":0.000046843117,"threshold_uncertainty_score":0.25986096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44310153,0.00028668897,0.5283931,0.00041894,0.026034221,0.0003843865,0.000018238718,0.000043848457,0.0013190529],"genre_scores_gemma":[0.9974592,0.000020705651,0.0016074087,0.00007794297,0.00079929276,4.9388024e-7,9.759149e-7,0.00001916065,0.000014843654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760705,0.00029593852,0.00081002596,0.00026860574,0.000749495,0.00026890676],"domain_scores_gemma":[0.99552995,0.0012856686,0.0018087947,0.00077802705,0.0004944498,0.00010310605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008298073,0.00029386434,0.00066079304,0.00020406183,0.000092976756,0.00023569439,0.0026206477,0.00026149515,0.000016444395],"category_scores_gemma":[0.00074389286,0.00019969826,0.00036788563,0.00022163385,0.00004601013,0.00015095092,0.00048169366,0.0015518677,0.0000037948334],"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.000027526681,0.00038573163,0.0009339864,0.0004051449,0.0005740908,0.00013264279,0.001782007,0.083332546,0.037638947,0.8587621,0.002591041,0.013434255],"study_design_scores_gemma":[0.0017912803,0.0014259467,0.00082538876,0.002218791,0.00014090359,0.00011059033,0.00006300548,0.018393286,0.041120254,0.93286526,0.00036475676,0.0006805517],"about_ca_topic_score_codex":0.00001260354,"about_ca_topic_score_gemma":7.762046e-7,"teacher_disagreement_score":0.55435765,"about_ca_system_score_codex":0.00011007292,"about_ca_system_score_gemma":0.00066159497,"threshold_uncertainty_score":0.81434584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720293,0.0042403294,0.00564479,0.000023968778,0.11502627,0.0010148342,0.00008333886,0.00006597518,0.0018711655],"genre_scores_gemma":[0.9988999,0.00009130881,0.000035100966,0.0000050764274,0.00086012617,0.000010517472,0.0000020976584,0.000060928112,0.00003494876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970696,0.000516317,0.0013184337,0.0001560574,0.00065328745,0.0002862986],"domain_scores_gemma":[0.9975018,0.00026726248,0.0010914507,0.00070869306,0.0003109819,0.00011982838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011745498,0.00034619795,0.0010512938,0.00024485882,0.00006329327,0.000084096326,0.0010818816,0.00038522112,0.00001001065],"category_scores_gemma":[0.0000754813,0.00025360205,0.0007615823,0.00024212112,0.00008876231,0.00010772824,0.000158763,0.00112197,0.000013913823],"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.00020490072,0.0002051314,0.0030377733,0.0025850872,0.0014563893,0.00002548703,0.00097107777,0.85426193,0.07566877,0.0565717,0.004956973,0.000054750086],"study_design_scores_gemma":[0.02766751,0.0027917193,0.0404867,0.031342532,0.004216996,0.001134516,0.001888569,0.0800481,0.09554425,0.66588324,0.04247955,0.0065162973],"about_ca_topic_score_codex":0.000030166399,"about_ca_topic_score_gemma":0.0000010757522,"teacher_disagreement_score":0.77421385,"about_ca_system_score_codex":0.00009847109,"about_ca_system_score_gemma":0.000103478626,"threshold_uncertainty_score":0.9999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027467858,0.0009515715,0.9209671,0.0015465089,0.037595816,0.00018917375,0.0000030918038,0.00010140984,0.011177481],"genre_scores_gemma":[0.9272774,0.000037385937,0.0669696,0.00011669319,0.005076018,5.8338935e-7,2.7477586e-7,0.000011921493,0.00051012915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983404,0.00020456372,0.00049039646,0.00011241192,0.00053499127,0.00031721775],"domain_scores_gemma":[0.9983427,0.00040840427,0.00048136018,0.0002806535,0.00012714826,0.0003597206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017257509,0.00013731068,0.00024373335,0.00018418694,0.00009184284,0.00014151377,0.00091744814,0.00007938345,0.00002662329],"category_scores_gemma":[0.00021435865,0.00010625555,0.0001482176,0.00033169714,0.000015595411,0.0010415063,0.00007704539,0.00028810362,0.000089979694],"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.00048129298,0.00030012577,0.000029831304,0.0000066011603,0.000046232788,0.00006294311,0.00074858847,0.00013624488,0.0005357798,0.94226015,0.036786746,0.018605458],"study_design_scores_gemma":[0.019201132,0.009666692,0.0017851441,0.00036763484,0.00016824358,0.0013295324,0.0001401124,0.0019951535,0.09665499,0.523318,0.3438822,0.0014911753],"about_ca_topic_score_codex":0.0000028085014,"about_ca_topic_score_gemma":2.138189e-8,"teacher_disagreement_score":0.89980954,"about_ca_system_score_codex":0.000051261162,"about_ca_system_score_gemma":0.00015997195,"threshold_uncertainty_score":0.43329757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842947,0.0041791247,0.0016805817,0.00013500651,0.00856728,0.00022781557,0.000001783947,0.00004672215,0.00086695363],"genre_scores_gemma":[0.9984603,0.0002748088,0.00043341436,0.000012378225,0.00072632433,0.0000018791262,2.557306e-7,0.000024169058,0.000066494555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883527,0.00007979267,0.0005455752,0.00007117612,0.00028073884,0.00018747168],"domain_scores_gemma":[0.99914265,0.00017554533,0.00023015063,0.00012647884,0.00013616889,0.00018900345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000393245,0.00015074544,0.00040673697,0.00019080342,0.000036537855,0.00006133074,0.00020913522,0.00011040025,0.000061361425],"category_scores_gemma":[0.00006106055,0.00012872538,0.00012223399,0.00017605051,0.0000412652,0.0004886642,0.000017263315,0.00020559938,0.000012084105],"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.0004888548,0.00033564275,0.005644158,0.0010905798,0.0015903179,0.000089033674,0.002477407,0.0026933737,0.17325242,0.6092505,0.19175346,0.011334239],"study_design_scores_gemma":[0.0070828614,0.0016904079,0.006729118,0.0005865866,0.00029408478,0.00022733229,0.00060231827,0.0007901382,0.029843401,0.9258634,0.025500558,0.0007898303],"about_ca_topic_score_codex":0.000042457148,"about_ca_topic_score_gemma":5.6737156e-7,"teacher_disagreement_score":0.31661284,"about_ca_system_score_codex":0.000026704143,"about_ca_system_score_gemma":0.000055505345,"threshold_uncertainty_score":0.52492684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.849133,0.00127316,0.10911869,0.0005825573,0.036584094,0.00073037244,0.0000040228333,0.00013149527,0.0024425727],"genre_scores_gemma":[0.9361062,0.00008808065,0.062226206,0.00002087376,0.0014939253,0.0000039238953,8.2345304e-7,0.00002889648,0.000031046828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981214,0.00020640486,0.00081773405,0.00010657837,0.000490413,0.00025749643],"domain_scores_gemma":[0.9969855,0.0007548461,0.00097495597,0.00022162164,0.00084549503,0.00021755863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012065475,0.00018499132,0.00040863952,0.00014274572,0.00014792434,0.00006717185,0.00018872721,0.00015174589,0.000036094312],"category_scores_gemma":[0.0023337342,0.00015958039,0.000074637726,0.00029274813,0.00012901147,0.0008632177,0.000030653795,0.00029641914,0.000008821924],"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.00006748229,0.00018363191,0.001061555,0.000051728945,0.00007243849,0.0000024192059,0.00075824565,0.0000011801393,0.005583309,0.9904733,0.001256099,0.0004886421],"study_design_scores_gemma":[0.001039202,0.00029536645,0.00022468525,0.00006867237,0.00012540196,0.00030093946,0.000355807,0.000030802115,0.0052050482,0.9891914,0.0029815342,0.00018109925],"about_ca_topic_score_codex":8.808083e-7,"about_ca_topic_score_gemma":1.2795388e-7,"teacher_disagreement_score":0.08697319,"about_ca_system_score_codex":0.00013952641,"about_ca_system_score_gemma":0.00015443563,"threshold_uncertainty_score":0.65075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977355,0.00036002896,0.0004055356,0.00011543081,0.00057170977,0.00021199373,0.0000058015085,0.0000064840197,0.0005875426],"genre_scores_gemma":[0.99552524,0.00016724863,0.0041244715,0.00000205014,0.000058980022,0.0000022390998,6.390955e-7,0.000029196954,0.00008995177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973501,0.00062421337,0.0010841975,0.00012408054,0.0005860583,0.00023133012],"domain_scores_gemma":[0.9964319,0.0007702112,0.0014106225,0.00046749547,0.00081580336,0.00010400719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003293081,0.00016131515,0.00079320493,0.0003688341,0.00009327906,0.000050669354,0.0005463225,0.00019237337,0.00004531148],"category_scores_gemma":[0.0026209878,0.00013658316,0.0001492869,0.00017794732,0.00038716532,0.00033295242,0.00009760273,0.0003867432,5.2040366e-7],"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.0015607717,0.0005310359,0.0077505955,0.00024388755,0.00025001387,0.00007858905,0.0011458428,0.000009482512,0.044824455,0.9428417,0.00049775146,0.0002658695],"study_design_scores_gemma":[0.0058900528,0.0010465265,0.0032066756,0.00035271156,0.000078071964,0.000028247714,0.00013569673,0.00009908392,0.02394793,0.9650272,0.000056107096,0.00013167053],"about_ca_topic_score_codex":0.000045534514,"about_ca_topic_score_gemma":0.000011462952,"teacher_disagreement_score":0.022185521,"about_ca_system_score_codex":0.000039830946,"about_ca_system_score_gemma":0.0001839078,"threshold_uncertainty_score":0.55696994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812484,0.0000939162,0.008327572,0.0004196704,0.0047130035,0.00027909433,0.0000023777654,0.00007698641,0.00483899],"genre_scores_gemma":[0.9994161,0.000017143782,0.0000650038,0.000026993914,0.000277405,0.000006138329,7.9165915e-8,0.000028270888,0.0001628309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899393,0.0001362234,0.0003006405,0.00006637659,0.0003026673,0.00020017716],"domain_scores_gemma":[0.9991865,0.00032449883,0.00012317052,0.00017483014,0.00010906143,0.0000819363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000653791,0.00014421051,0.00021095217,0.00008467697,0.00007003787,0.000042924257,0.00027234078,0.00006389124,0.00005413022],"category_scores_gemma":[0.00002926751,0.000060702652,0.00008879499,0.00014194612,0.000054080858,0.00015370535,0.000005311121,0.00018508396,0.000032301956],"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.0007731143,0.00014265144,0.00025758872,0.000056092274,0.00048112383,0.00009756582,0.0011782037,0.0014311009,0.04514127,0.92905354,0.019918464,0.0014692562],"study_design_scores_gemma":[0.010410301,0.0057332274,0.00041931073,0.0018954574,0.0001925293,0.00043170023,0.0004290242,0.00013388002,0.09804896,0.8256731,0.055718288,0.0009142307],"about_ca_topic_score_codex":0.0000017012713,"about_ca_topic_score_gemma":9.0803394e-7,"teacher_disagreement_score":0.10338049,"about_ca_system_score_codex":0.00005230399,"about_ca_system_score_gemma":0.000029832572,"threshold_uncertainty_score":0.24753824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7016862,0.004371863,0.17230904,0.0012516787,0.11208866,0.0019310348,0.00021915497,0.00096745783,0.0051749223],"genre_scores_gemma":[0.997364,0.000047122372,0.0009386318,0.00006448764,0.001452844,0.000010971183,0.000016005024,0.000100066914,0.0000059035933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730647,0.00040604375,0.0010905851,0.00021921901,0.0006422797,0.0003353805],"domain_scores_gemma":[0.99837816,0.0003012953,0.0004731913,0.00033455723,0.00019601261,0.0003167589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087592483,0.00045123018,0.0010140795,0.00025845284,0.00006896,0.00026721347,0.0007679134,0.0005138704,0.00007422878],"category_scores_gemma":[0.00008312029,0.00043781463,0.000688921,0.00025107243,0.000062300685,0.00015804624,0.000047730602,0.001490796,0.000019200439],"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.0040172786,0.0013234686,0.0012092455,0.008767803,0.0065888506,0.0029103532,0.010000922,0.5914468,0.095528305,0.22503062,0.051175587,0.0020007615],"study_design_scores_gemma":[0.02136161,0.0044247787,0.001970009,0.0054109064,0.0028595806,0.00018324437,0.0007205276,0.08034767,0.04282189,0.7329412,0.10221459,0.0047439975],"about_ca_topic_score_codex":0.000012899732,"about_ca_topic_score_gemma":9.824249e-7,"teacher_disagreement_score":0.51109916,"about_ca_system_score_codex":0.00013160358,"about_ca_system_score_gemma":0.0001904515,"threshold_uncertainty_score":0.99980736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9447233,0.00061082194,0.04173505,0.00026695698,0.01041276,0.00021833168,0.000013917341,0.000024491846,0.0019943812],"genre_scores_gemma":[0.9995233,0.000021618745,0.00020464743,0.0000061354235,0.00020966277,0.0000010060267,7.914775e-8,0.000009262243,0.000024317718],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913156,0.00010118814,0.0003984806,0.000039874885,0.00022113766,0.000107785905],"domain_scores_gemma":[0.99920094,0.00019981565,0.00017925049,0.00014969574,0.00021722032,0.00005305935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005938238,0.000071235954,0.00023271292,0.000074832285,0.00002560441,0.0000064546407,0.00025032708,0.00004727305,0.000018990653],"category_scores_gemma":[0.00012934643,0.000040335428,0.00009370115,0.00018114748,0.000043330685,0.000087281085,0.00001437289,0.00007836051,0.000008394976],"study_design_candidate":"bench_or_experimental","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.0004330802,0.0000913742,0.00044491113,0.00010272758,0.00019496494,0.0000059412096,0.0009455176,0.0015820306,0.81318206,0.17486478,0.0041773645,0.003975251],"study_design_scores_gemma":[0.007913779,0.0073123067,0.010066044,0.003396069,0.00036370265,0.00021436828,0.0008602902,0.002254488,0.37302974,0.5137531,0.07988873,0.0009473466],"about_ca_topic_score_codex":0.0000033081255,"about_ca_topic_score_gemma":6.623378e-7,"teacher_disagreement_score":0.44015232,"about_ca_system_score_codex":0.000025238163,"about_ca_system_score_gemma":0.000025220772,"threshold_uncertainty_score":0.1644831},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8527528,0.0028963103,0.07812558,0.000096896845,0.060540684,0.00048253106,0.000025694984,0.00018573378,0.0048937807],"genre_scores_gemma":[0.99654704,0.000104152045,0.0016287923,0.000011323276,0.0015579072,0.000008064954,0.0000076660235,0.000080792204,0.000054268734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977536,0.0003247365,0.00096473715,0.00018983557,0.00044444608,0.00032263697],"domain_scores_gemma":[0.99860275,0.00014030328,0.00036820333,0.00036037536,0.00029730154,0.00023106193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090459257,0.00038858876,0.00092464196,0.0001770366,0.0000778333,0.0003142586,0.0005460309,0.0005554089,0.00009124581],"category_scores_gemma":[0.0000732347,0.00038871903,0.0007044377,0.00013764131,0.00005613818,0.00011971913,0.00005771148,0.0016433434,0.0000075196485],"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.0019525088,0.0017126102,0.0017015203,0.006639279,0.0100249965,0.0063340785,0.04416725,0.7254338,0.09755034,0.076793276,0.021947753,0.0057425518],"study_design_scores_gemma":[0.03356308,0.004635175,0.002650498,0.015979558,0.0052168956,0.002167316,0.009072077,0.07246032,0.15684074,0.6077702,0.08001373,0.0096303895],"about_ca_topic_score_codex":0.000012307716,"about_ca_topic_score_gemma":0.000004981984,"teacher_disagreement_score":0.65297353,"about_ca_system_score_codex":0.00014438742,"about_ca_system_score_gemma":0.00029309702,"threshold_uncertainty_score":0.9998565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8765123,0.0074131554,0.010369664,0.00007775697,0.10085128,0.00093794434,0.00008101199,0.00020319202,0.0035537046],"genre_scores_gemma":[0.99808663,0.00014974551,0.00015862907,0.0000040130494,0.0015112145,0.0000076186407,0.0000024796461,0.000061719686,0.000017950266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974945,0.00025472604,0.0013159085,0.00014002825,0.00057305576,0.00022174716],"domain_scores_gemma":[0.99806273,0.00017528601,0.0008934284,0.00028940357,0.00036809992,0.00021107773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009602414,0.00031159294,0.001166303,0.00024024746,0.000029901761,0.000075196134,0.00067277614,0.00040335662,0.000015902822],"category_scores_gemma":[0.00010259148,0.00029726993,0.00043413558,0.00017566622,0.00004766522,0.00010137651,0.000105687766,0.0010723425,0.000007802048],"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.0019074013,0.00068442576,0.0006427976,0.02103761,0.00703788,0.0011139571,0.0067371456,0.2523449,0.13554442,0.50809175,0.064498015,0.0003596571],"study_design_scores_gemma":[0.013809661,0.0059010983,0.00096115825,0.014311327,0.0027121545,0.0007072194,0.002247393,0.029483115,0.105504386,0.75339234,0.06696691,0.0040032296],"about_ca_topic_score_codex":0.000010973892,"about_ca_topic_score_gemma":1.4564625e-7,"teacher_disagreement_score":0.24530058,"about_ca_system_score_codex":0.00012722041,"about_ca_system_score_gemma":0.00017282112,"threshold_uncertainty_score":0.99994797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919976,0.0008924726,0.004773132,0.00011257504,0.0015045814,0.00012007774,0.0000070112555,0.0000142603785,0.0005783136],"genre_scores_gemma":[0.99906105,0.00013088665,0.0006095831,0.000004168339,0.00016902824,0.0000010969085,9.610504e-7,0.000012647195,0.000010599139],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987328,0.00010498671,0.00067834277,0.000058699556,0.00033391017,0.00009123186],"domain_scores_gemma":[0.9983377,0.00021894614,0.0007494735,0.00007517508,0.0005618147,0.000056894693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006139497,0.00009458613,0.000397676,0.00010956249,0.00001836387,0.000011843789,0.00012933205,0.00012233891,0.000012213935],"category_scores_gemma":[0.00035536467,0.00008688528,0.00008162016,0.00041186047,0.000025462938,0.0001757064,0.0000110181145,0.00014907615,7.8765794e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00044172033,0.00022653039,0.025817422,0.0013001534,0.0008192622,0.000003700994,0.0020820596,0.0008188426,0.8532908,0.10932824,0.005008358,0.0008629144],"study_design_scores_gemma":[0.015330118,0.0042927177,0.063945755,0.0013703598,0.0013638822,0.00003321795,0.0024351494,0.011583698,0.7863447,0.09390512,0.018269537,0.0011257424],"about_ca_topic_score_codex":0.0000031790369,"about_ca_topic_score_gemma":2.4769298e-7,"teacher_disagreement_score":0.0669461,"about_ca_system_score_codex":0.000034189732,"about_ca_system_score_gemma":0.000060103186,"threshold_uncertainty_score":0.3543079},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2087963,0.005457467,0.76817393,0.00073786103,0.011938454,0.00069763645,0.000009275226,0.0002752877,0.0039137965],"genre_scores_gemma":[0.9988785,0.000063071384,0.00027696264,0.000075922966,0.0006710357,0.0000026454095,3.2075604e-7,0.000020097992,0.000011434691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905217,0.00026522615,0.00033822484,0.00006001574,0.0001569821,0.00012740183],"domain_scores_gemma":[0.9992405,0.00035045645,0.000096270574,0.00006782694,0.00007279594,0.00017213411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775566,0.00011095222,0.00024204707,0.00006324159,0.000059224585,0.000057504647,0.00014415439,0.00007275113,0.000033792323],"category_scores_gemma":[0.00012862647,0.00009728107,0.00006957065,0.000107862754,0.000035210232,0.00030385182,0.000008349444,0.00020093957,0.000010863988],"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.00028694846,0.000024148858,0.000018129233,0.000053320513,0.00017558021,0.000044444692,0.0015296199,0.002076828,0.08445756,0.9061044,0.004613997,0.00061503955],"study_design_scores_gemma":[0.0030098297,0.0011904084,0.00014125866,0.00009107396,0.00016360817,0.00015176205,0.0005874476,0.0027065359,0.046634838,0.93825585,0.0066861655,0.0003812481],"about_ca_topic_score_codex":1.9109102e-7,"about_ca_topic_score_gemma":1.6858767e-8,"teacher_disagreement_score":0.7900822,"about_ca_system_score_codex":0.000015907635,"about_ca_system_score_gemma":0.000034979003,"threshold_uncertainty_score":0.39670068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90297765,0.012897399,0.06688903,0.0015604362,0.007895854,0.0010694684,0.000025562014,0.00015186949,0.0065327142],"genre_scores_gemma":[0.9993521,0.00016570685,0.00016769169,0.000011661585,0.0002838743,0.000005763634,1.6773535e-7,0.000008201589,0.000004852313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992436,0.00006887582,0.00036570145,0.000050415543,0.00017477584,0.000096616655],"domain_scores_gemma":[0.9993714,0.00019419228,0.00015408451,0.000090027206,0.000089453366,0.00010082442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003819457,0.00007623086,0.0001855182,0.000017960247,0.000106131374,0.000055995573,0.00020842624,0.000038525064,0.0000034575569],"category_scores_gemma":[0.00005622087,0.000052154148,0.00007033265,0.00014698459,0.00011819294,0.00010263224,0.000014128781,0.000153792,0.0000022820202],"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.00018547304,0.000057275076,0.0008537893,0.00028117804,0.00024550786,0.000018815568,0.002655193,0.0022347255,0.058589343,0.92716914,0.0018201842,0.0058893627],"study_design_scores_gemma":[0.003590158,0.0022552132,0.002462621,0.00039988692,0.0002875936,0.0002664064,0.003488299,0.007707459,0.06449003,0.76807415,0.14620961,0.00076857215],"about_ca_topic_score_codex":0.0000013563382,"about_ca_topic_score_gemma":2.5208715e-7,"teacher_disagreement_score":0.159095,"about_ca_system_score_codex":0.000011757232,"about_ca_system_score_gemma":0.000034352262,"threshold_uncertainty_score":0.21267845},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09658504,0.005040426,0.77757764,0.0003561199,0.10779731,0.0013521796,0.000042488336,0.0002741728,0.010974639],"genre_scores_gemma":[0.9983604,0.00026590278,0.0001976661,0.000009466328,0.0010894835,0.0000043269292,0.0000027006436,0.000051437237,0.000018646466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977805,0.00036500086,0.0010480868,0.000110280605,0.0005015874,0.00019455864],"domain_scores_gemma":[0.9981508,0.00035306258,0.00069954584,0.0002910987,0.00037377674,0.00013170546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010873477,0.00025041774,0.0005999783,0.00007640994,0.00008745133,0.000091832815,0.0006459299,0.00030694093,0.000025869833],"category_scores_gemma":[0.00019536621,0.00018855894,0.0003675219,0.00021151111,0.000075222604,0.00009116622,0.00008117234,0.0007872986,0.00001302914],"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.0011034128,0.00029217955,0.0012081758,0.0022087737,0.0029150113,0.0002132129,0.0040745763,0.16553754,0.013191892,0.7481642,0.058554765,0.0025362775],"study_design_scores_gemma":[0.0016436579,0.00033335335,0.00014740313,0.00087475544,0.00039700244,0.0001341088,0.00030677117,0.00951144,0.020541191,0.95048463,0.015084342,0.00054132903],"about_ca_topic_score_codex":0.0000036481722,"about_ca_topic_score_gemma":3.978036e-7,"teacher_disagreement_score":0.9017753,"about_ca_system_score_codex":0.00008457035,"about_ca_system_score_gemma":0.00016003936,"threshold_uncertainty_score":0.7689211},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9532164,0.00015269751,0.042833723,0.000011723687,0.0033941767,0.000064723805,0.000002733742,0.00002133995,0.00030251773],"genre_scores_gemma":[0.9987988,0.000023042228,0.00085928437,0.0000043213017,0.00030048378,3.408576e-7,3.2660733e-7,0.000013043754,3.4794255e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999071,0.000083295854,0.00050341635,0.000050965267,0.00020984029,0.00008150622],"domain_scores_gemma":[0.99931675,0.000052321233,0.0002682392,0.00009369177,0.00017035277,0.000098637924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031684723,0.00008224692,0.00032768236,0.00007699737,0.00001709351,0.000008410935,0.00012864161,0.0000656937,0.00001520982],"category_scores_gemma":[0.00005862624,0.00007709068,0.000108702436,0.00016749791,0.00003738862,0.00019981293,0.0000057128714,0.00013998029,8.5743534e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00029211314,0.00004980449,0.00035946796,0.00017623628,0.000085042804,0.000012181453,0.00083337096,0.0147194695,0.9404476,0.0423152,0.00013748991,0.00057202537],"study_design_scores_gemma":[0.003718072,0.003117163,0.0010950487,0.0004552218,0.00015694107,0.0001782316,0.0011502323,0.011577338,0.9251439,0.052289013,0.000806095,0.0003127608],"about_ca_topic_score_codex":0.0000013950096,"about_ca_topic_score_gemma":5.2675226e-8,"teacher_disagreement_score":0.045582447,"about_ca_system_score_codex":0.000015287822,"about_ca_system_score_gemma":0.000026993966,"threshold_uncertainty_score":0.31436667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9259283,0.0026825361,0.01885903,0.00009719596,0.046555374,0.000105058854,0.0000057851407,0.000112444315,0.00565428],"genre_scores_gemma":[0.9979896,0.000033424138,0.00013818154,0.000010440587,0.0017517573,0.0000016667371,8.3972435e-7,0.00002241486,0.000051699626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885607,0.00014904488,0.00044296047,0.000069477326,0.0002833119,0.00019913356],"domain_scores_gemma":[0.9993462,0.00010031473,0.00009913656,0.00014228889,0.00018184836,0.00013023858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235637,0.0001222939,0.00029151133,0.000076730634,0.000051973475,0.00006855853,0.00016404976,0.000096182834,0.00009558978],"category_scores_gemma":[0.00008038607,0.00011410974,0.00019267613,0.0001899127,0.00001719441,0.00014639573,0.000013838634,0.00025550975,0.000021290052],"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.00079368695,0.00074591895,0.002854738,0.00036686525,0.0012371611,0.003732948,0.0019419733,0.014512581,0.31760415,0.606084,0.039365664,0.0107602915],"study_design_scores_gemma":[0.00740392,0.0012426652,0.0024860462,0.00040561394,0.0003035966,0.0017893589,0.0007992867,0.0015620625,0.5243002,0.3009787,0.15774928,0.0009792642],"about_ca_topic_score_codex":8.266857e-7,"about_ca_topic_score_gemma":4.9286234e-7,"teacher_disagreement_score":0.3051053,"about_ca_system_score_codex":0.000041593143,"about_ca_system_score_gemma":0.00007844378,"threshold_uncertainty_score":0.465326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.944591,0.0021105409,0.0062017003,0.00009474008,0.040986277,0.00022732186,0.000009754623,0.00012301504,0.0056556375],"genre_scores_gemma":[0.99930114,0.000016370665,0.000055124005,0.0000027051829,0.00056298246,0.0000011977098,3.8944046e-7,0.000023332448,0.00003677083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904466,0.000075357704,0.00040064735,0.000067741785,0.00027505905,0.00013655366],"domain_scores_gemma":[0.9995216,0.00013386134,0.00007348962,0.00012134898,0.000086737215,0.00006296485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057097484,0.00011015647,0.00024219848,0.00019599622,0.000018442766,0.00003745908,0.0001515326,0.000056298046,0.000021588592],"category_scores_gemma":[0.00004167508,0.00009120015,0.00011610739,0.00020625109,0.000023425882,0.00020378298,0.000005331584,0.00024840795,0.000011171411],"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.00019429535,0.000107224085,0.000028252494,0.00058257935,0.0004042384,0.00013043804,0.0008669308,0.006774642,0.063730195,0.9096369,0.01589963,0.0016446791],"study_design_scores_gemma":[0.0041960794,0.0059164185,0.0003472064,0.0036448662,0.00040705036,0.00028166905,0.0007642796,0.0046312986,0.3377831,0.6021341,0.038947694,0.0009462003],"about_ca_topic_score_codex":6.9262603e-7,"about_ca_topic_score_gemma":7.376614e-8,"teacher_disagreement_score":0.30750275,"about_ca_system_score_codex":0.000050408376,"about_ca_system_score_gemma":0.00005083981,"threshold_uncertainty_score":0.3719034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9324135,0.0004677942,0.055966314,0.000112710215,0.009337276,0.0002536745,0.000006290243,0.000105798936,0.001336619],"genre_scores_gemma":[0.99680305,0.000014685901,0.0019524556,0.00002868206,0.0010505532,0.000006723864,0.000004725504,0.000063399544,0.000075715616],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974473,0.00045313005,0.00082050695,0.00021600985,0.00065275194,0.00041028354],"domain_scores_gemma":[0.9983627,0.00027496667,0.00024575292,0.000362702,0.00039938325,0.00035448797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011553882,0.0002920771,0.00053108064,0.0002844363,0.00017871485,0.00014094316,0.00032273095,0.00019794697,0.000090820395],"category_scores_gemma":[0.00020591826,0.00029240333,0.00029971654,0.00045209858,0.000022724054,0.000295133,0.000036747693,0.0004750934,0.00003529557],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0009649791,0.0004643416,0.0001710244,0.00016455092,0.00045996305,0.00085832854,0.0007938368,0.11847736,0.684307,0.1768795,0.012723315,0.0037358557],"study_design_scores_gemma":[0.009894934,0.0063553,0.0023243083,0.002907795,0.00051117,0.0010863431,0.0014966561,0.00486015,0.80191743,0.15091461,0.015911352,0.0018199676],"about_ca_topic_score_codex":0.000001426125,"about_ca_topic_score_gemma":9.516799e-7,"teacher_disagreement_score":0.11761046,"about_ca_system_score_codex":0.00023910047,"about_ca_system_score_gemma":0.00011900775,"threshold_uncertainty_score":0.9999528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7621865,0.0023476733,0.16503684,0.0036131851,0.03118196,0.00084408926,0.000025510946,0.00033516178,0.034429047],"genre_scores_gemma":[0.8260743,0.0001151938,0.16992545,0.00013045412,0.0019066541,0.0000085730535,0.0000013040577,0.000077071214,0.0017610118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767816,0.00027484563,0.000901875,0.00013444845,0.0007009463,0.00030971062],"domain_scores_gemma":[0.9966646,0.0014004213,0.0006485296,0.00033372428,0.00075172196,0.00020101755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011256005,0.00020533362,0.0006525754,0.00005337244,0.00024896063,0.00010004682,0.00033272427,0.00012435044,0.00039256446],"category_scores_gemma":[0.004959143,0.00016605809,0.00026430812,0.00028957197,0.00017521555,0.00036911585,0.0001131271,0.0003899826,0.000018571569],"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.000087258784,0.00044635148,0.0000071412014,0.00006928882,0.00010847547,0.0002589283,0.0006950266,0.000006876566,0.0030094278,0.99035007,0.004483134,0.00047801057],"study_design_scores_gemma":[0.0010507478,0.00043121082,0.000005848305,0.00019382856,0.00010325829,0.00031835053,0.00038076573,0.000015010718,0.037815504,0.9475354,0.0119726835,0.00017739885],"about_ca_topic_score_codex":2.9563492e-7,"about_ca_topic_score_gemma":2.646434e-7,"teacher_disagreement_score":0.06388777,"about_ca_system_score_codex":0.0000960121,"about_ca_system_score_gemma":0.00043889388,"threshold_uncertainty_score":0.67716527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24308096,0.002311414,0.7221994,0.0013298483,0.022751698,0.00014496887,0.000003830588,0.000080180354,0.008097747],"genre_scores_gemma":[0.991715,0.000053442694,0.007800002,0.000054781864,0.0003321783,5.986492e-7,2.1563227e-7,0.0000074880336,0.00003627591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838233,0.00032058053,0.0005102466,0.0001390385,0.0004645792,0.00018322127],"domain_scores_gemma":[0.9981856,0.00032352915,0.00041517735,0.00036158288,0.0005910056,0.00012310225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797736,0.00011387364,0.0003293234,0.00016833775,0.000072173316,0.000073602474,0.00079175556,0.00007622036,0.000035832327],"category_scores_gemma":[0.00019756374,0.00010395905,0.00032645298,0.000627304,0.000051533778,0.00044023697,0.00011946265,0.00024431088,0.00000433369],"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.00005729886,0.00026361094,0.00031095525,0.000017138842,0.000080802965,0.00016061465,0.0003523717,0.000028178361,0.013794137,0.978259,0.0014332377,0.005242624],"study_design_scores_gemma":[0.0024226978,0.0013058695,0.0009960218,0.00015490373,0.00006520783,0.00038319378,0.00020717623,0.00023585414,0.17305431,0.8065657,0.014320461,0.00028861722],"about_ca_topic_score_codex":0.0000013179432,"about_ca_topic_score_gemma":3.0533738e-7,"teacher_disagreement_score":0.74863404,"about_ca_system_score_codex":0.000024434017,"about_ca_system_score_gemma":0.00032549878,"threshold_uncertainty_score":0.4239327},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13583744,0.008709358,0.27147117,0.0036412699,0.560905,0.001660542,0.00003912925,0.0004740462,0.017262066],"genre_scores_gemma":[0.9925803,0.00021424446,0.0015222077,0.00017396074,0.0044652913,0.000015073734,0.0000025467314,0.000041237814,0.0009851343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952755,0.0009652206,0.0011121737,0.00038341904,0.0016391559,0.0006245338],"domain_scores_gemma":[0.993795,0.0029105127,0.0008884659,0.0009162514,0.0011490359,0.00034073522],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022051954,0.00034392733,0.0006756622,0.00021795687,0.0005784795,0.0012206291,0.0021921694,0.00020920034,0.000006250528],"category_scores_gemma":[0.0014086502,0.0002522136,0.00046838832,0.0010583194,0.0001391385,0.00058475987,0.00030374457,0.00093396584,0.000034771565],"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.00007402299,0.0004780696,0.000035814137,0.000016582153,0.00018187704,0.00041243335,0.00031910258,0.0002379064,0.0013235601,0.9667344,0.028767671,0.0014185315],"study_design_scores_gemma":[0.011619802,0.0037617758,0.0005302003,0.0003156208,0.00011364369,0.00084351917,0.00041164484,0.009755048,0.018736178,0.5458822,0.4076143,0.0004160804],"about_ca_topic_score_codex":0.00001108379,"about_ca_topic_score_gemma":0.0000011570505,"teacher_disagreement_score":0.85674286,"about_ca_system_score_codex":0.00017805654,"about_ca_system_score_gemma":0.00072272005,"threshold_uncertainty_score":0.999993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9252986,0.0048398674,0.0046300855,0.00015983515,0.050477866,0.00014825823,0.0000074081595,0.00016021368,0.014277912],"genre_scores_gemma":[0.99856144,0.00009267112,0.0003181956,0.000018314715,0.00088877114,0.0000017836556,8.262093e-7,0.000019449908,0.0000985737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881285,0.00017177431,0.0004547056,0.000074852964,0.00029310235,0.00019268332],"domain_scores_gemma":[0.9992846,0.000108492415,0.00011843563,0.0001506242,0.00020730613,0.00013054631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005668349,0.00012296837,0.00029763413,0.00005317612,0.000075238335,0.0001038168,0.00018607988,0.00009140613,0.00013811617],"category_scores_gemma":[0.000081617334,0.000110803354,0.00017337021,0.00023250114,0.000039880288,0.00021254426,0.00001165124,0.00025482816,0.000024392059],"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.00035407604,0.000634527,0.0011799748,0.0004237694,0.0014871433,0.004111963,0.0027676825,0.011665685,0.22392525,0.6786266,0.06649117,0.008332171],"study_design_scores_gemma":[0.004347727,0.0008987376,0.001038898,0.00059115794,0.00023844735,0.0018483843,0.0010011747,0.0013590088,0.2421461,0.4961374,0.24954313,0.00084981875],"about_ca_topic_score_codex":8.0453003e-7,"about_ca_topic_score_gemma":3.6715858e-7,"teacher_disagreement_score":0.18305196,"about_ca_system_score_codex":0.00004405523,"about_ca_system_score_gemma":0.00012137813,"threshold_uncertainty_score":0.45184296},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011555509,0.0017348982,0.0010146295,0.00012555516,0.2180169,0.00013022179,0.00038092473,0.0000055897367,0.77847576],"genre_scores_gemma":[0.0057378616,0.0020546352,0.0005617154,0.00032989826,0.010348556,0.0000062998192,0.000048001366,0.000040277562,0.98087275],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978859,0.00002264127,0.0015542017,0.00017404405,0.00009188722,0.00027133743],"domain_scores_gemma":[0.996436,0.000061235165,0.0028156033,0.00025361514,0.00031383618,0.000119707016],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012826364,0.00023066341,0.000950119,0.00060034805,0.00013134067,0.00027490102,0.00056172756,0.00029340968,0.052202623],"category_scores_gemma":[0.00022904511,0.00024150015,0.00033017178,0.00018565386,0.0001210682,0.0009468197,0.00009543307,0.00033038287,0.33852103],"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.00004683819,0.00003997097,0.000012539875,0.000036380436,0.00019376128,0.0000014846646,0.0004340491,0.000013680986,6.491112e-7,0.025143614,0.973957,0.000120003264],"study_design_scores_gemma":[0.00097623665,0.00026329886,0.00001410958,0.000056432404,0.000022710688,0.0000069127623,0.00011978876,0.000015622416,0.000032755735,0.013934821,0.9843106,0.00024670124],"about_ca_topic_score_codex":0.00002448339,"about_ca_topic_score_gemma":1.7286128e-7,"teacher_disagreement_score":0.2863184,"about_ca_system_score_codex":0.0002484098,"about_ca_system_score_gemma":0.00012781152,"threshold_uncertainty_score":0.984809},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053010812,0.0023295998,0.00055201835,0.00017285498,0.20288272,0.00012329803,0.00040275126,0.0000041464655,0.7934796],"genre_scores_gemma":[0.0074333623,0.002779093,0.00025081466,0.00014883094,0.0052473326,0.000005340256,0.000035306097,0.00002937652,0.98407054],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807566,0.00001843027,0.0013855612,0.00016887972,0.00008928449,0.00026219225],"domain_scores_gemma":[0.9948743,0.000055521563,0.004324874,0.00039193052,0.00023352429,0.00011983785],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012873382,0.00023133661,0.0010504058,0.0005075419,0.00024717927,0.00052686984,0.0008369252,0.00029612344,0.02314112],"category_scores_gemma":[0.0003529456,0.00024361214,0.00037088367,0.00006882694,0.0001094698,0.0013070173,0.000113202674,0.00040701893,0.2130466],"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.000038941493,0.0000359902,0.000018598615,0.000041561485,0.0001995621,0.0000029685987,0.00030070925,0.0000242674,5.2307485e-7,0.030764466,0.9682744,0.00029802404],"study_design_scores_gemma":[0.0010950962,0.00014492795,0.000030992705,0.000069905334,0.000024081213,0.000007083767,0.000076794604,0.000012600018,0.000018324428,0.01364586,0.98462546,0.00024885414],"about_ca_topic_score_codex":0.00004351149,"about_ca_topic_score_gemma":2.2301651e-7,"teacher_disagreement_score":0.1976354,"about_ca_system_score_codex":0.00022243678,"about_ca_system_score_gemma":0.00014584881,"threshold_uncertainty_score":0.9934215},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011555509,0.0017348982,0.0010146295,0.00012555516,0.2180169,0.00013022179,0.00038092473,0.0000055897367,0.77847576],"genre_scores_gemma":[0.0057378616,0.0020546352,0.0005617154,0.00032989826,0.010348556,0.0000062998192,0.000048001366,0.000040277562,0.98087275],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978859,0.00002264127,0.0015542017,0.00017404405,0.00009188722,0.00027133743],"domain_scores_gemma":[0.996436,0.000061235165,0.0028156033,0.00025361514,0.00031383618,0.000119707016],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012826364,0.00023066341,0.000950119,0.00060034805,0.00013134067,0.00027490102,0.00056172756,0.00029340968,0.052202623],"category_scores_gemma":[0.00022904511,0.00024150015,0.00033017178,0.00018565386,0.0001210682,0.0009468197,0.00009543307,0.00033038287,0.33852103],"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.00004683819,0.00003997097,0.000012539875,0.000036380436,0.00019376128,0.0000014846646,0.0004340491,0.000013680986,6.491112e-7,0.025143614,0.973957,0.000120003264],"study_design_scores_gemma":[0.00097623665,0.00026329886,0.00001410958,0.000056432404,0.000022710688,0.0000069127623,0.00011978876,0.000015622416,0.000032755735,0.013934821,0.9843106,0.00024670124],"about_ca_topic_score_codex":0.00002448339,"about_ca_topic_score_gemma":1.7286128e-7,"teacher_disagreement_score":0.2863184,"about_ca_system_score_codex":0.0002484098,"about_ca_system_score_gemma":0.00012781152,"threshold_uncertainty_score":0.984809},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092076574,0.0060331738,0.00104176,0.00019259335,0.21165319,0.000110259316,0.0003868131,0.000004692903,0.78048545],"genre_scores_gemma":[0.0044632256,0.004481674,0.000548184,0.00035635973,0.0055279294,0.000006265092,0.00008807969,0.000036380083,0.9844919],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978932,0.000028154152,0.0015529536,0.00017902096,0.0000936915,0.00025295714],"domain_scores_gemma":[0.996809,0.00007313881,0.0024412456,0.00025016803,0.0003102818,0.000116165975],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010240102,0.00022170007,0.0010566179,0.0004883697,0.00010996856,0.00033236633,0.00044097644,0.00028145761,0.049160566],"category_scores_gemma":[0.0002641845,0.00024349119,0.00039743434,0.00021818574,0.000063280095,0.00083889347,0.00010187229,0.0004126076,0.13221206],"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.00002505448,0.000050112292,0.000012878392,0.00005017203,0.00023413898,0.0000055013843,0.00037376906,0.000054650125,0.0000012129914,0.03574862,0.9632742,0.00016971731],"study_design_scores_gemma":[0.00096582685,0.000114644536,0.000014257839,0.000073382456,0.000024737676,0.000011426317,0.0002452262,0.000013088872,0.000043474498,0.0068125855,0.9914369,0.0002444512],"about_ca_topic_score_codex":0.00002423448,"about_ca_topic_score_gemma":1.9016804e-7,"teacher_disagreement_score":0.20612526,"about_ca_system_score_codex":0.0002532067,"about_ca_system_score_gemma":0.00019070266,"threshold_uncertainty_score":0.9929282},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001742207,0.00062868465,0.0068464614,0.0016242668,0.3392679,0.0007496152,0.000007920592,0.00006726049,0.6490657],"genre_scores_gemma":[0.20857103,0.0012950099,0.0029138527,0.010641892,0.5737949,0.00005035689,0.0019214326,0.00044549792,0.200366],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803126,0.000023048968,0.0009300343,0.00011278939,0.0006694587,0.00023339986],"domain_scores_gemma":[0.99575514,0.00002849966,0.0022422278,0.00017684409,0.0017770911,0.000020226074],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008912397,0.00027204858,0.0004907615,0.00078785035,0.00015371176,0.000644579,0.0005218355,0.00030413832,0.004511971],"category_scores_gemma":[0.00033953227,0.00023699566,0.00015573291,0.00051075185,0.000042594573,0.0039852983,0.00009871719,0.0003680271,0.027102152],"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.00016100446,0.000043458916,0.000016158187,0.00017128186,0.00006997216,0.000002520865,0.000054547363,0.000016042432,0.000032384178,0.003773931,0.9939492,0.0017095528],"study_design_scores_gemma":[0.0011408206,0.000051742576,0.000040721578,0.00018329135,0.000113833696,0.000005364332,0.000031448588,0.000030285386,0.00021361788,0.006444586,0.99146456,0.000279739],"about_ca_topic_score_codex":0.00001249159,"about_ca_topic_score_gemma":3.4584966e-7,"teacher_disagreement_score":0.44869965,"about_ca_system_score_codex":0.000111650195,"about_ca_system_score_gemma":0.00029339863,"threshold_uncertainty_score":0.99639803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418997,0.0008134244,0.011490798,0.0077094394,0.018890884,0.00033881518,5.7532395e-7,0.00008482059,0.018771548],"genre_scores_gemma":[0.9966296,0.00006406365,0.00018972643,0.00019706586,0.0027025142,7.987731e-7,3.0150957e-7,0.000011022589,0.0002049005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931437,0.000010289483,0.0002616538,0.000077970886,0.00021908553,0.00011660688],"domain_scores_gemma":[0.99929917,0.0000364376,0.0003098576,0.00006426568,0.0002762283,0.000014033993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512722,0.00008122727,0.0001498583,0.0001682484,0.000070144975,0.000115020826,0.00012764231,0.000039484345,0.000092359245],"category_scores_gemma":[0.00025581452,0.000050106373,0.000034592587,0.00016700414,0.000029428527,0.0012476849,0.000043005475,0.00005311071,0.00005120764],"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.00092374394,0.00028499446,0.040596012,0.00012383521,0.00015767073,0.000074365016,0.00011291227,0.0000039045008,0.061133254,0.6660584,0.12830362,0.102227256],"study_design_scores_gemma":[0.0108721,0.00018007663,0.03239806,0.00050567277,0.0001905736,0.000050402894,0.00006506601,0.00003352423,0.01042597,0.4691911,0.4754363,0.0006511405],"about_ca_topic_score_codex":0.0000022661486,"about_ca_topic_score_gemma":3.5938365e-7,"teacher_disagreement_score":0.34713268,"about_ca_system_score_codex":0.000025730194,"about_ca_system_score_gemma":0.000041343646,"threshold_uncertainty_score":0.20432785},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053010812,0.0023295998,0.00055201835,0.00017285498,0.20288272,0.00012329803,0.00040275126,0.0000041464655,0.7934796],"genre_scores_gemma":[0.0074333623,0.002779093,0.00025081466,0.00014883094,0.0052473326,0.000005340256,0.000035306097,0.00002937652,0.98407054],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807566,0.00001843027,0.0013855612,0.00016887972,0.00008928449,0.00026219225],"domain_scores_gemma":[0.9948743,0.000055521563,0.004324874,0.00039193052,0.00023352429,0.00011983785],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012873382,0.00023133661,0.0010504058,0.0005075419,0.00024717927,0.00052686984,0.0008369252,0.00029612344,0.02314112],"category_scores_gemma":[0.0003529456,0.00024361214,0.00037088367,0.00006882694,0.0001094698,0.0013070173,0.000113202674,0.00040701893,0.2130466],"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.000038941493,0.0000359902,0.000018598615,0.000041561485,0.0001995621,0.0000029685987,0.00030070925,0.0000242674,5.2307485e-7,0.030764466,0.9682744,0.00029802404],"study_design_scores_gemma":[0.0010950962,0.00014492795,0.000030992705,0.000069905334,0.000024081213,0.000007083767,0.000076794604,0.000012600018,0.000018324428,0.01364586,0.98462546,0.00024885414],"about_ca_topic_score_codex":0.00004351149,"about_ca_topic_score_gemma":2.2301651e-7,"teacher_disagreement_score":0.1976354,"about_ca_system_score_codex":0.00022243678,"about_ca_system_score_gemma":0.00014584881,"threshold_uncertainty_score":0.9934215},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001742207,0.00062868465,0.0068464614,0.0016242668,0.3392679,0.0007496152,0.000007920592,0.00006726049,0.6490657],"genre_scores_gemma":[0.20857103,0.0012950099,0.0029138527,0.010641892,0.5737949,0.00005035689,0.0019214326,0.00044549792,0.200366],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803126,0.000023048968,0.0009300343,0.00011278939,0.0006694587,0.00023339986],"domain_scores_gemma":[0.99575514,0.00002849966,0.0022422278,0.00017684409,0.0017770911,0.000020226074],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008912397,0.00027204858,0.0004907615,0.00078785035,0.00015371176,0.000644579,0.0005218355,0.00030413832,0.004511971],"category_scores_gemma":[0.00033953227,0.00023699566,0.00015573291,0.00051075185,0.000042594573,0.0039852983,0.00009871719,0.0003680271,0.027102152],"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.00016100446,0.000043458916,0.000016158187,0.00017128186,0.00006997216,0.000002520865,0.000054547363,0.000016042432,0.000032384178,0.003773931,0.9939492,0.0017095528],"study_design_scores_gemma":[0.0011408206,0.000051742576,0.000040721578,0.00018329135,0.000113833696,0.000005364332,0.000031448588,0.000030285386,0.00021361788,0.006444586,0.99146456,0.000279739],"about_ca_topic_score_codex":0.00001249159,"about_ca_topic_score_gemma":3.4584966e-7,"teacher_disagreement_score":0.44869965,"about_ca_system_score_codex":0.000111650195,"about_ca_system_score_gemma":0.00029339863,"threshold_uncertainty_score":0.99639803},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069135276,0.001294844,0.0004754595,0.0032231566,0.14041649,0.00026904143,0.000028653729,0.000008762829,0.85421443],"genre_scores_gemma":[0.18598022,0.012854498,0.000725998,0.00043589645,0.099176385,0.0000179758,0.000074279356,0.00007518846,0.7006596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795663,0.00023592831,0.0006101332,0.00006826014,0.00087230396,0.00025671782],"domain_scores_gemma":[0.9965022,0.00015476589,0.0017711949,0.00020198635,0.0011976275,0.00017219709],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001164979,0.00016364403,0.00048709693,0.0002026098,0.0014498201,0.00048359507,0.00058873364,0.00040549485,0.0016524738],"category_scores_gemma":[0.00069449696,0.00013440342,0.00029157486,0.000113141956,0.00026586337,0.0011602399,0.000053498825,0.00051164016,0.0020754724],"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.00003850989,0.00002948283,0.0000024910576,0.000023133505,0.0000934199,0.0000064167107,0.0033461067,0.000014311962,0.000002335239,0.023127116,0.97135663,0.001960028],"study_design_scores_gemma":[0.000593896,0.00016789314,0.00002433934,0.00012470796,0.000083505714,0.0000045276006,0.00059260824,9.0836534e-7,0.0000130928665,0.0040448145,0.9941925,0.00015724104],"about_ca_topic_score_codex":0.0004626025,"about_ca_topic_score_gemma":0.000025067968,"teacher_disagreement_score":0.18591107,"about_ca_system_score_codex":0.00026234798,"about_ca_system_score_gemma":0.0015101545,"threshold_uncertainty_score":0.99985015},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000618587,0.0013184473,0.0019988285,0.0058470666,0.14246175,0.0003056458,0.000046471574,0.000013024068,0.8479469],"genre_scores_gemma":[0.119702645,0.016022358,0.00074972573,0.00072037434,0.11786271,0.000022083277,0.00004467271,0.00008884302,0.74478656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978132,0.00029377575,0.00067890645,0.00006751008,0.0008729743,0.00027359577],"domain_scores_gemma":[0.9971565,0.00026030725,0.0011132532,0.000121438025,0.0011722317,0.00017625692],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010271914,0.0001610201,0.00043784024,0.00023694416,0.0005900383,0.00018007854,0.00035866594,0.00037656396,0.0034714907],"category_scores_gemma":[0.0004236525,0.0001107515,0.00027239113,0.00022516416,0.00020595653,0.000912653,0.000039761824,0.00034691615,0.0034614503],"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.000044236094,0.000025477457,0.0000017377101,0.000019858291,0.000085642496,0.0000037724378,0.0024697904,0.0000044090507,0.000007404668,0.042492446,0.95234877,0.0024964625],"study_design_scores_gemma":[0.0006867716,0.00017933942,0.0000093037015,0.0001535917,0.00006114872,0.000003828117,0.000504677,2.498449e-7,0.000025583367,0.006163232,0.9920585,0.00015378869],"about_ca_topic_score_codex":0.00014108924,"about_ca_topic_score_gemma":0.000009284415,"teacher_disagreement_score":0.11964079,"about_ca_system_score_codex":0.00034044337,"about_ca_system_score_gemma":0.0012769636,"threshold_uncertainty_score":0.99743944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701999,0.0009208166,0.004666453,0.000013776247,0.016665742,0.00042509506,0.0000047710087,0.00015928557,0.0069441902],"genre_scores_gemma":[0.9979101,0.000027535038,0.000047114405,0.0000045738316,0.001222648,0.000010542503,6.950737e-7,0.00005520462,0.000721596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981013,0.0002359468,0.0008242159,0.00011544609,0.00041784384,0.00030523777],"domain_scores_gemma":[0.9990677,0.00015222984,0.00022946153,0.00021505188,0.00015229399,0.00018325092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009609096,0.0002397312,0.000584969,0.00017563839,0.000085945656,0.00014620602,0.00028050656,0.0001157253,0.00014433646],"category_scores_gemma":[0.00003166092,0.00015633329,0.00014875983,0.00034996623,0.000033423206,0.0003409739,0.0000066163007,0.00035741812,0.000029216488],"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.037384227,0.0028121686,0.008337281,0.007907274,0.011286735,0.008813644,0.032108974,0.5015821,0.10331674,0.1762353,0.08340835,0.026807193],"study_design_scores_gemma":[0.1182251,0.049265243,0.0027127198,0.030147523,0.0033585147,0.046390336,0.0452986,0.09628682,0.065012254,0.021124143,0.5103091,0.011869654],"about_ca_topic_score_codex":0.000017041111,"about_ca_topic_score_gemma":0.0000033968265,"teacher_disagreement_score":0.42690074,"about_ca_system_score_codex":0.00012239712,"about_ca_system_score_gemma":0.00005655436,"threshold_uncertainty_score":0.6375087},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011555509,0.0017348982,0.0010146295,0.00012555516,0.2180169,0.00013022179,0.00038092473,0.0000055897367,0.77847576],"genre_scores_gemma":[0.0057378616,0.0020546352,0.0005617154,0.00032989826,0.010348556,0.0000062998192,0.000048001366,0.000040277562,0.98087275],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978859,0.00002264127,0.0015542017,0.00017404405,0.00009188722,0.00027133743],"domain_scores_gemma":[0.996436,0.000061235165,0.0028156033,0.00025361514,0.00031383618,0.000119707016],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012826364,0.00023066341,0.000950119,0.00060034805,0.00013134067,0.00027490102,0.00056172756,0.00029340968,0.052202623],"category_scores_gemma":[0.00022904511,0.00024150015,0.00033017178,0.00018565386,0.0001210682,0.0009468197,0.00009543307,0.00033038287,0.33852103],"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.00004683819,0.00003997097,0.000012539875,0.000036380436,0.00019376128,0.0000014846646,0.0004340491,0.000013680986,6.491112e-7,0.025143614,0.973957,0.000120003264],"study_design_scores_gemma":[0.00097623665,0.00026329886,0.00001410958,0.000056432404,0.000022710688,0.0000069127623,0.00011978876,0.000015622416,0.000032755735,0.013934821,0.9843106,0.00024670124],"about_ca_topic_score_codex":0.00002448339,"about_ca_topic_score_gemma":1.7286128e-7,"teacher_disagreement_score":0.2863184,"about_ca_system_score_codex":0.0002484098,"about_ca_system_score_gemma":0.00012781152,"threshold_uncertainty_score":0.984809},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857623,0.00063894916,0.003373028,0.000021877835,0.0054813838,0.000090171925,0.000005560234,0.000035187375,0.0045915465],"genre_scores_gemma":[0.99900603,0.000089762936,0.00024606194,0.000007693327,0.00057327276,0.0000022098986,8.300436e-7,0.000021978174,0.00005215547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847865,0.00012739754,0.0007118869,0.00007546974,0.00039450385,0.0002120783],"domain_scores_gemma":[0.99902683,0.00022086856,0.00026914693,0.00014428917,0.00020895853,0.00012992682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069724786,0.00015413278,0.00039747605,0.00021315724,0.000044198063,0.000025497664,0.00027670697,0.000098953846,0.00010341868],"category_scores_gemma":[0.00008350939,0.00013632842,0.00021314425,0.00031906588,0.00006360505,0.00021990258,0.000014093102,0.0002529345,0.000010273155],"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.001006948,0.0004067878,0.018883316,0.00026956364,0.0005369577,0.00045616427,0.0012637314,0.0065467823,0.08068437,0.88371974,0.0029142196,0.003311437],"study_design_scores_gemma":[0.010265867,0.0035557298,0.028854204,0.0012508773,0.00035225073,0.0013626368,0.0008071843,0.0030245127,0.080020115,0.83538693,0.033716366,0.0014033553],"about_ca_topic_score_codex":0.0000021356384,"about_ca_topic_score_gemma":8.4655886e-7,"teacher_disagreement_score":0.04833281,"about_ca_system_score_codex":0.00003261197,"about_ca_system_score_gemma":0.000053328597,"threshold_uncertainty_score":0.5559312},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041027097,0.000047412883,0.9862108,0.00010024548,0.006119128,0.00004949672,3.8689683e-7,0.00090722175,0.0024625557],"genre_scores_gemma":[0.59934014,0.0000033556598,0.39956704,0.00007909162,0.0009766314,8.7374787e-7,8.53899e-8,0.000008624661,0.000024173321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873424,0.00009908579,0.00038418052,0.0001417491,0.0004066476,0.000234123],"domain_scores_gemma":[0.9982215,0.0004117907,0.000361926,0.0003436292,0.0005313782,0.00012976209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010375361,0.00012117376,0.00023753122,0.00015512851,0.0001386648,0.00019639873,0.00095113396,0.000074836986,0.000012176743],"category_scores_gemma":[0.0008587973,0.000105561936,0.00007667505,0.00040309076,0.000053445012,0.00052539626,0.00011804194,0.00022367407,0.000013520885],"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.000099454635,0.00041736115,0.0015777968,0.000024517201,0.00010038092,0.00011911608,0.0008096671,0.00004728708,0.007409677,0.82815325,0.14643988,0.014801609],"study_design_scores_gemma":[0.00083434884,0.0016795696,0.00018708405,0.00014733913,0.00001760451,0.00020245492,0.0000030681024,0.0036526138,0.017543543,0.9635979,0.01191993,0.00021454295],"about_ca_topic_score_codex":0.000012603862,"about_ca_topic_score_gemma":1.0696446e-7,"teacher_disagreement_score":0.5952374,"about_ca_system_score_codex":0.000071718045,"about_ca_system_score_gemma":0.0002502336,"threshold_uncertainty_score":0.43046907},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000618587,0.0013184473,0.0019988285,0.0058470666,0.14246175,0.0003056458,0.000046471574,0.000013024068,0.8479469],"genre_scores_gemma":[0.119702645,0.016022358,0.00074972573,0.00072037434,0.11786271,0.000022083277,0.00004467271,0.00008884302,0.74478656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978132,0.00029377575,0.00067890645,0.00006751008,0.0008729743,0.00027359577],"domain_scores_gemma":[0.9971565,0.00026030725,0.0011132532,0.000121438025,0.0011722317,0.00017625692],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010271914,0.0001610201,0.00043784024,0.00023694416,0.0005900383,0.00018007854,0.00035866594,0.00037656396,0.0034714907],"category_scores_gemma":[0.0004236525,0.0001107515,0.00027239113,0.00022516416,0.00020595653,0.000912653,0.000039761824,0.00034691615,0.0034614503],"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.000044236094,0.000025477457,0.0000017377101,0.000019858291,0.000085642496,0.0000037724378,0.0024697904,0.0000044090507,0.000007404668,0.042492446,0.95234877,0.0024964625],"study_design_scores_gemma":[0.0006867716,0.00017933942,0.0000093037015,0.0001535917,0.00006114872,0.000003828117,0.000504677,2.498449e-7,0.000025583367,0.006163232,0.9920585,0.00015378869],"about_ca_topic_score_codex":0.00014108924,"about_ca_topic_score_gemma":0.000009284415,"teacher_disagreement_score":0.11964079,"about_ca_system_score_codex":0.00034044337,"about_ca_system_score_gemma":0.0012769636,"threshold_uncertainty_score":0.99743944},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021490762,0.000085094034,0.026700918,0.0036081476,0.110642076,0.00053190714,0.000042396066,0.00004601683,0.8561944],"genre_scores_gemma":[0.38891563,0.00042003026,0.0011260778,0.013158571,0.18890703,0.000015023006,0.00041682046,0.00034185604,0.40669897],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975956,0.000027202428,0.0008948456,0.00011630471,0.0010995454,0.00026647482],"domain_scores_gemma":[0.99506783,0.00007049977,0.0030975677,0.00022134082,0.0015149951,0.000027735301],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006913891,0.00029897798,0.00051291543,0.00090373325,0.00014978075,0.00048616785,0.00067696464,0.00070263015,0.007056492],"category_scores_gemma":[0.00019117922,0.00024939651,0.00019786009,0.0004990656,0.00004348849,0.0060010464,0.00015697767,0.00091506215,0.011996244],"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.00015779122,0.00005851351,0.0000339156,0.000118217016,0.000103564074,0.000008485322,0.000019292589,0.000050365154,0.00010958654,0.042128857,0.9560869,0.0011245143],"study_design_scores_gemma":[0.001975718,0.000054537482,0.00002504996,0.0002844231,0.00011489899,0.000004725092,0.000054330787,0.000030087469,0.00013045751,0.0070414543,0.9899917,0.00029261943],"about_ca_topic_score_codex":0.000020513015,"about_ca_topic_score_gemma":1.9649983e-7,"teacher_disagreement_score":0.4494954,"about_ca_system_score_codex":0.00035909982,"about_ca_system_score_gemma":0.00025538218,"threshold_uncertainty_score":0.9999958},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413217,0.00022685622,0.009241137,0.000038720857,0.04154996,0.00014193522,0.0000024565043,0.000118437536,0.007358819],"genre_scores_gemma":[0.99769366,0.000012586517,0.000595516,0.000012266705,0.0016028578,0.0000024005672,3.9402718e-7,0.000032690685,0.000047601134],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881095,0.00008821936,0.0004926141,0.0000705148,0.00029464762,0.00024303328],"domain_scores_gemma":[0.9991789,0.00014567566,0.00014177074,0.00018939414,0.00015313282,0.00019112893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008607749,0.00016000417,0.0003115841,0.00016751414,0.0000667788,0.00006611835,0.00034512256,0.000162788,0.00014857439],"category_scores_gemma":[0.00009315571,0.00013964938,0.00019314354,0.00019394564,0.00004719407,0.00027429312,0.000011207373,0.0006372453,0.000040260955],"study_design_candidate":"bench_or_experimental","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.00016656668,0.00015345958,0.0008880414,0.000061676496,0.00022201514,0.0001599421,0.00055935554,0.0007690505,0.6807795,0.29827836,0.016253734,0.0017082562],"study_design_scores_gemma":[0.007873313,0.0018381878,0.0029370405,0.00021534532,0.00028860508,0.0017865039,0.0003315301,0.001810569,0.27863267,0.5759909,0.12690979,0.0013855255],"about_ca_topic_score_codex":0.0000012910652,"about_ca_topic_score_gemma":9.871412e-7,"teacher_disagreement_score":0.40214688,"about_ca_system_score_codex":0.000026768987,"about_ca_system_score_gemma":0.00005237543,"threshold_uncertainty_score":0.5694736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96118116,0.0018956718,0.0052224486,0.00006807829,0.027231893,0.0014270965,0.000056694764,0.00013836681,0.0027785862],"genre_scores_gemma":[0.99905956,0.00002149652,0.000021010028,0.000018134953,0.000539203,0.00007057613,0.0000036426748,0.000068041525,0.00019834927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960203,0.0013078172,0.0010166122,0.0001853885,0.0011119434,0.00035793163],"domain_scores_gemma":[0.9979503,0.00031749436,0.0006881127,0.0005792779,0.00026995497,0.00019484358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030663977,0.0003040242,0.0007344468,0.00029469872,0.00030429574,0.00013949568,0.0009263019,0.00009194489,0.00005674927],"category_scores_gemma":[0.000054403426,0.00020485287,0.00019464012,0.0006313128,0.00007691872,0.00028928576,0.000028982156,0.0006460745,0.000009247633],"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.0027844051,0.00069454836,0.00032641552,0.00038461902,0.00078609085,0.00031073403,0.0017462221,0.23048349,0.037732348,0.7150644,0.0095956335,0.000091103975],"study_design_scores_gemma":[0.083324745,0.1578016,0.0016120801,0.0071986374,0.004048066,0.013828901,0.10744198,0.15053533,0.12883355,0.10871032,0.22605859,0.010606211],"about_ca_topic_score_codex":0.000059479113,"about_ca_topic_score_gemma":0.0000012475768,"teacher_disagreement_score":0.60635406,"about_ca_system_score_codex":0.00018283486,"about_ca_system_score_gemma":0.00014417815,"threshold_uncertainty_score":0.8353658},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010133212,0.0010549471,0.0026665286,0.002085874,0.33654588,0.00083027384,0.000014231794,0.00006747466,0.6557215],"genre_scores_gemma":[0.24112597,0.0028132393,0.0021015736,0.019454043,0.35375705,0.00020319516,0.0059353556,0.0007295368,0.37388003],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978651,0.000034628712,0.0009126668,0.00011117045,0.0008570602,0.00021937407],"domain_scores_gemma":[0.99674326,0.000036464666,0.0022473952,0.0001670422,0.0007884741,0.000017345723],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009872408,0.0002530589,0.00048184558,0.0008899004,0.00023506099,0.00050923915,0.0005719216,0.00018104583,0.018869646],"category_scores_gemma":[0.00026407457,0.0002376847,0.00017454296,0.0006345328,0.000020881012,0.0034263986,0.00016761223,0.0005994316,0.009026136],"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.00016958051,0.00005913424,0.000016505688,0.00016571199,0.00007193795,0.0000056358117,0.000060430742,0.00019208204,0.000022768008,0.0068618497,0.98990196,0.0024724277],"study_design_scores_gemma":[0.0011655537,0.000044004373,0.000031282296,0.000062051404,0.000108750195,0.0000070234864,0.00007324932,0.000029991977,0.00005303347,0.004321901,0.9938296,0.00027354746],"about_ca_topic_score_codex":0.000017571543,"about_ca_topic_score_gemma":1.8679381e-7,"teacher_disagreement_score":0.28184143,"about_ca_system_score_codex":0.00018940953,"about_ca_system_score_gemma":0.0003375218,"threshold_uncertainty_score":0.9917455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91332626,0.00277811,0.0032124142,0.00012887493,0.06891502,0.00038089702,0.000020435926,0.00023739887,0.011000619],"genre_scores_gemma":[0.99904597,0.000024433863,0.00009990254,0.000023037677,0.0006595553,0.000010682069,0.0000012856908,0.000025904172,0.00010925211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843174,0.00025852415,0.000522651,0.000080792954,0.00047682106,0.0002294829],"domain_scores_gemma":[0.99935716,0.00009124532,0.00018318578,0.00016176277,0.000077417775,0.00012922366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011587613,0.00013559335,0.0003091806,0.00010642149,0.0002431399,0.00006188054,0.0003682772,0.00005027828,0.00037266786],"category_scores_gemma":[0.000025415913,0.00013107173,0.00017885362,0.00028516538,0.000038783975,0.00017679813,0.00003296319,0.00047577303,0.000010505845],"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.0012681237,0.0008234398,0.0006008153,0.00020595493,0.0012480173,0.0016915014,0.0050936397,0.10049353,0.0575722,0.65680283,0.1682158,0.0059841597],"study_design_scores_gemma":[0.007542345,0.0027069764,0.00036578006,0.00013630246,0.00020890281,0.0016586438,0.0017392454,0.003836473,0.013149968,0.3237881,0.64392096,0.0009462961],"about_ca_topic_score_codex":0.0000034534826,"about_ca_topic_score_gemma":1.9321148e-7,"teacher_disagreement_score":0.47570515,"about_ca_system_score_codex":0.0001294932,"about_ca_system_score_gemma":0.00009539855,"threshold_uncertainty_score":0.534495},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010133212,0.0010549471,0.0026665286,0.002085874,0.33654588,0.00083027384,0.000014231794,0.00006747466,0.6557215],"genre_scores_gemma":[0.24112597,0.0028132393,0.0021015736,0.019454043,0.35375705,0.00020319516,0.0059353556,0.0007295368,0.37388003],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978651,0.000034628712,0.0009126668,0.00011117045,0.0008570602,0.00021937407],"domain_scores_gemma":[0.99674326,0.000036464666,0.0022473952,0.0001670422,0.0007884741,0.000017345723],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009872408,0.0002530589,0.00048184558,0.0008899004,0.00023506099,0.00050923915,0.0005719216,0.00018104583,0.018869646],"category_scores_gemma":[0.00026407457,0.0002376847,0.00017454296,0.0006345328,0.000020881012,0.0034263986,0.00016761223,0.0005994316,0.009026136],"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.00016958051,0.00005913424,0.000016505688,0.00016571199,0.00007193795,0.0000056358117,0.000060430742,0.00019208204,0.000022768008,0.0068618497,0.98990196,0.0024724277],"study_design_scores_gemma":[0.0011655537,0.000044004373,0.000031282296,0.000062051404,0.000108750195,0.0000070234864,0.00007324932,0.000029991977,0.00005303347,0.004321901,0.9938296,0.00027354746],"about_ca_topic_score_codex":0.000017571543,"about_ca_topic_score_gemma":1.8679381e-7,"teacher_disagreement_score":0.28184143,"about_ca_system_score_codex":0.00018940953,"about_ca_system_score_gemma":0.0003375218,"threshold_uncertainty_score":0.9917455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09177583,0.00009085321,0.90504205,0.00010379204,0.002412572,0.00010208434,9.547933e-7,0.000081383536,0.0003905013],"genre_scores_gemma":[0.9729552,0.000080718266,0.026491383,0.000027901127,0.00041426087,0.0000030182646,6.923621e-7,0.000020244408,0.000006529368],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997705,0.00036218844,0.00078869145,0.00027505367,0.0005178765,0.00035123096],"domain_scores_gemma":[0.99723077,0.001058496,0.0009737005,0.00030745633,0.00025793986,0.00017163964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023849704,0.00020132655,0.0005287404,0.0003433869,0.00015871802,0.00018829867,0.0006308329,0.000108191336,0.000003993355],"category_scores_gemma":[0.0009432522,0.00019234847,0.00015742003,0.0008998328,0.000056858964,0.0008566871,0.000111774294,0.00035150134,0.0000034277234],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000010303153,0.00006720152,0.0019587863,0.000085518346,0.00006885736,0.000054344047,0.0014199602,0.0020640844,0.9207785,0.019804582,0.0000811367,0.05360674],"study_design_scores_gemma":[0.005777482,0.0016194944,0.033497512,0.0012219277,0.00016124612,0.0005859357,0.0005842439,0.36380422,0.3667864,0.22347674,0.0012785397,0.0012062535],"about_ca_topic_score_codex":0.000008944909,"about_ca_topic_score_gemma":3.2198488e-7,"teacher_disagreement_score":0.88117945,"about_ca_system_score_codex":0.00009967074,"about_ca_system_score_gemma":0.00016448899,"threshold_uncertainty_score":0.7843743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.808066,0.00015995662,0.17943466,0.00058466906,0.009141016,0.0001283495,0.0000021498543,0.00018301135,0.0023001966],"genre_scores_gemma":[0.99809605,0.00008431393,0.001364584,0.00009019076,0.0003169828,0.0000016809228,2.6955522e-7,0.00001194583,0.000033957283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987281,0.0001341663,0.00031675334,0.00016870421,0.00039817663,0.00025407693],"domain_scores_gemma":[0.9988612,0.00044715547,0.00021161209,0.00022652226,0.00011668032,0.00013684452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010764422,0.00014230596,0.0002674961,0.00033427693,0.0002155961,0.00032843705,0.0005221395,0.000066214445,0.00000647384],"category_scores_gemma":[0.00012550702,0.00012750467,0.00012857406,0.00064026885,0.00005233991,0.00048349437,0.00012423247,0.00025085124,0.000013028203],"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.00019210363,0.000082860635,0.0009977915,0.000020524933,0.00007886987,0.000105051215,0.00063760346,0.00039610444,0.011103869,0.980904,0.0014384753,0.004042744],"study_design_scores_gemma":[0.004126923,0.0030025032,0.0059322636,0.00036533087,0.00005040986,0.00019279623,0.00019255001,0.0038663757,0.018561218,0.942591,0.020518227,0.00060041936],"about_ca_topic_score_codex":0.000002736706,"about_ca_topic_score_gemma":2.810529e-7,"teacher_disagreement_score":0.19003008,"about_ca_system_score_codex":0.000036252215,"about_ca_system_score_gemma":0.0000782279,"threshold_uncertainty_score":0.51994896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98083526,0.0023112667,0.0071584843,0.000054318698,0.008260947,0.00032648034,0.000007342454,0.0003106743,0.0007352031],"genre_scores_gemma":[0.9984798,0.00024139082,0.00012707428,0.000017903785,0.0010668087,0.0000050849503,0.0000017998308,0.00004418444,0.000015958796],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987396,0.00014217813,0.00046134787,0.00010172131,0.0002927044,0.00026244047],"domain_scores_gemma":[0.99925447,0.00018159399,0.00013595642,0.00015046308,0.00011434427,0.00016318067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009794309,0.00017171375,0.00037876327,0.00029501005,0.000079652935,0.00006729335,0.00017419229,0.00012488419,0.0000143575135],"category_scores_gemma":[0.000113402,0.00016493189,0.00012966064,0.00052717706,0.000031249416,0.00030868704,0.000024419585,0.00025323682,0.000025276926],"study_design_candidate":"bench_or_experimental","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.00045582125,0.00027068,0.0039979,0.0017009632,0.0011798742,0.0017864075,0.005237462,0.005821091,0.904158,0.05544538,0.011656582,0.008289835],"study_design_scores_gemma":[0.02891014,0.009051614,0.020191617,0.0073572765,0.0017761315,0.0036224509,0.0029347704,0.052771848,0.28529203,0.4010055,0.18103804,0.0060485764],"about_ca_topic_score_codex":0.0000016439848,"about_ca_topic_score_gemma":1.0296551e-7,"teacher_disagreement_score":0.61886597,"about_ca_system_score_codex":0.000058102974,"about_ca_system_score_gemma":0.000016021626,"threshold_uncertainty_score":0.67257273},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903884,0.0004595087,0.0016197746,0.00018425356,0.004538648,0.00068674603,0.00003259282,0.00028789812,0.0018021669],"genre_scores_gemma":[0.99948084,0.000078455494,0.0000917506,0.000015534806,0.00023668008,0.000025388697,0.000002857465,0.000034066143,0.000034428635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870247,0.00014538986,0.0004764927,0.000096109,0.00028049108,0.000299036],"domain_scores_gemma":[0.9980907,0.0013520069,0.00016539072,0.00014930461,0.00012989224,0.00011274887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001369977,0.00017321447,0.00032258258,0.0003922856,0.00018091376,0.00009491175,0.00024145201,0.00008403332,0.0000062022727],"category_scores_gemma":[0.00019793723,0.00011710601,0.00016108956,0.0008934756,0.000047441514,0.0001380639,0.000019083389,0.00024443562,0.000009771766],"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.00024000453,0.00007014196,0.00025198708,0.00018140613,0.0003593871,0.000017215929,0.00050294446,0.0023434723,0.009276542,0.97505033,0.01024952,0.0014570697],"study_design_scores_gemma":[0.003955552,0.0016365354,0.0036548928,0.0004286242,0.00018713342,0.000065337,0.00034647944,0.017187217,0.005739967,0.94746035,0.018797593,0.00054030353],"about_ca_topic_score_codex":0.0000019695135,"about_ca_topic_score_gemma":7.196336e-7,"teacher_disagreement_score":0.027589945,"about_ca_system_score_codex":0.000033640477,"about_ca_system_score_gemma":0.000019883659,"threshold_uncertainty_score":0.47754443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945725,0.00016241438,0.0017537938,0.00007062662,0.0022685472,0.00022957208,0.000005340646,0.00006448465,0.0008726835],"genre_scores_gemma":[0.9996933,0.000010841048,0.000089503854,0.0000020135126,0.00016792327,0.000003179943,5.584929e-7,0.000018810288,0.000013881539],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854314,0.00030040875,0.0005388969,0.000052551994,0.00039444212,0.00017058484],"domain_scores_gemma":[0.9988662,0.00035234084,0.00039063155,0.00016443504,0.00019192515,0.00003448312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147444,0.00010899878,0.00028522243,0.00008787215,0.00010287976,0.000016096861,0.000330108,0.000057246056,0.000005096928],"category_scores_gemma":[0.00007691391,0.000058390222,0.00013467259,0.00054092804,0.000089872774,0.00008611632,0.00002704701,0.00024844072,0.0000014788466],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00088682264,0.00035029143,0.011087769,0.0009779624,0.0014403693,0.000023925279,0.008407394,0.08585,0.56898564,0.31321383,0.006120741,0.0026552388],"study_design_scores_gemma":[0.015327464,0.0040539387,0.11314332,0.0054440247,0.0012073311,0.00046554967,0.0060911817,0.039141282,0.50017434,0.30686295,0.006561035,0.0015275859],"about_ca_topic_score_codex":0.000012196156,"about_ca_topic_score_gemma":0.0000027187036,"teacher_disagreement_score":0.10205555,"about_ca_system_score_codex":0.000028752285,"about_ca_system_score_gemma":0.000044708948,"threshold_uncertainty_score":0.23810841},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801617,0.0036391981,0.01790231,0.0002259575,0.057742238,0.0002816915,0.00001678451,0.0004396014,0.039590504],"genre_scores_gemma":[0.99920475,0.000034550474,0.000102115824,0.00001673105,0.00051142863,0.000004338586,7.889117e-7,0.00003266077,0.00009263626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898326,0.00008868028,0.00038381078,0.00007734154,0.00025223536,0.00021467883],"domain_scores_gemma":[0.9993273,0.00031080315,0.000048552025,0.000120701785,0.00006884695,0.00012378092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005637276,0.00013386372,0.00023528506,0.00023171035,0.00008174688,0.00014679838,0.0001941159,0.00009010302,0.000111450194],"category_scores_gemma":[0.000031697407,0.00011629119,0.00018861632,0.00027287696,0.000020290976,0.00025911795,0.0000091556285,0.0003514401,0.00012056594],"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.00007994066,0.00010180907,0.000007101553,0.00010868642,0.0002434312,0.00024892247,0.00026489946,0.01835023,0.031560227,0.9218657,0.026396384,0.000772689],"study_design_scores_gemma":[0.0011016179,0.0011152392,0.000052674277,0.00070295914,0.00012839868,0.0003322156,0.000090529946,0.005386288,0.01906229,0.9536816,0.018017776,0.0003284026],"about_ca_topic_score_codex":0.0000011961771,"about_ca_topic_score_gemma":2.5704065e-7,"teacher_disagreement_score":0.11904303,"about_ca_system_score_codex":0.000105902436,"about_ca_system_score_gemma":0.000047858754,"threshold_uncertainty_score":0.4742217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9426055,0.004083415,0.029601285,0.00003798152,0.02155748,0.00027396172,0.000016398333,0.00019802128,0.0016259903],"genre_scores_gemma":[0.99833333,0.000058823465,0.0006032587,0.0000053057574,0.0009011266,0.0000037361458,6.8970013e-7,0.000042383526,0.0000513635],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808496,0.00020007105,0.000861002,0.00011957208,0.0004701904,0.00026417722],"domain_scores_gemma":[0.9988613,0.00043075057,0.00018164978,0.00019934098,0.00018030145,0.00014666907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011586654,0.00021240201,0.0005190448,0.00031730675,0.00004715892,0.000077996316,0.0004079425,0.00011156417,0.000046675326],"category_scores_gemma":[0.00008190425,0.00018840244,0.0002652493,0.00048743578,0.00006356546,0.00032579305,0.000027776348,0.00042291486,0.000033580738],"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.00034693582,0.00013592058,0.00064841,0.0008106575,0.00072379084,0.0005871167,0.0016708017,0.018287756,0.63054436,0.33644983,0.0087528275,0.001041583],"study_design_scores_gemma":[0.0091750175,0.003863638,0.0010645728,0.0045691035,0.0008302404,0.002651849,0.0005716614,0.04320243,0.29864934,0.6123038,0.021253586,0.0018647804],"about_ca_topic_score_codex":0.000005597076,"about_ca_topic_score_gemma":8.3299483e-7,"teacher_disagreement_score":0.33189502,"about_ca_system_score_codex":0.00009694311,"about_ca_system_score_gemma":0.00011611821,"threshold_uncertainty_score":0.76828283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98281807,0.0012557338,0.0027316008,0.00004602554,0.009678114,0.00011372737,0.0000025956367,0.000108954286,0.003245174],"genre_scores_gemma":[0.99900514,0.00002112283,0.00028412655,0.0000037918594,0.000583972,0.0000015467529,8.7687646e-8,0.000032195283,0.00006802807],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990048,0.00006256433,0.00042585225,0.00006417642,0.00029282644,0.00014978283],"domain_scores_gemma":[0.99919116,0.00037162247,0.00010340885,0.0001069712,0.00013823352,0.0000885775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861711,0.00012934036,0.00030496335,0.00016770528,0.00002476512,0.0000509319,0.0001744901,0.000075325435,0.00002135507],"category_scores_gemma":[0.000072827395,0.00009638069,0.00012807923,0.0004298978,0.00003401187,0.00017683917,0.000007691102,0.00026004013,0.0000058505057],"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.0012728719,0.00038392824,0.002855145,0.0034499168,0.0027065636,0.002668334,0.0045019817,0.02875676,0.47179642,0.44975674,0.027732067,0.00411925],"study_design_scores_gemma":[0.015262503,0.01318981,0.0062263506,0.012472415,0.0020552278,0.010641869,0.0013982274,0.013634359,0.30152664,0.5198356,0.1008796,0.0028774103],"about_ca_topic_score_codex":0.0000022764693,"about_ca_topic_score_gemma":2.4610395e-7,"teacher_disagreement_score":0.1702698,"about_ca_system_score_codex":0.000031234587,"about_ca_system_score_gemma":0.00006688762,"threshold_uncertainty_score":0.39302903},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015465597,0.0008819342,0.9363408,0.0025331874,0.041120175,0.0003353811,0.0000026800167,0.0003172521,0.003002998],"genre_scores_gemma":[0.97090137,0.000038230944,0.026351374,0.00021994291,0.0023060376,0.000005172412,4.4322417e-7,0.000034103763,0.00014331506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965272,0.00046249505,0.00087636756,0.00045488388,0.001188937,0.0004901097],"domain_scores_gemma":[0.9969177,0.0013628614,0.00027954488,0.00065377593,0.00044453077,0.00034156183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002225943,0.00032288965,0.0005346067,0.00049638574,0.0001464196,0.0008137757,0.001852685,0.00017370934,0.0000828303],"category_scores_gemma":[0.00040736407,0.00026254475,0.00041156277,0.0009719251,0.00010722091,0.00088702183,0.00024674117,0.0007916643,0.00018833588],"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.000087728346,0.00058181386,0.000052879543,0.000058550075,0.00015089093,0.0010772124,0.00068509585,0.0007074067,0.0024812573,0.93580544,0.017587401,0.040724296],"study_design_scores_gemma":[0.0017632564,0.005177435,0.00060006056,0.00033967156,0.0000882155,0.0006844071,0.00002439287,0.048309393,0.00866502,0.8959272,0.037752822,0.0006681423],"about_ca_topic_score_codex":0.0000047629646,"about_ca_topic_score_gemma":3.4691416e-7,"teacher_disagreement_score":0.9554358,"about_ca_system_score_codex":0.00037188374,"about_ca_system_score_gemma":0.0006677375,"threshold_uncertainty_score":0.99998266},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076451585,0.00071109604,0.91539526,0.00005448661,0.0054792943,0.00010892371,0.0000025183735,0.000042389755,0.0017544447],"genre_scores_gemma":[0.97345746,0.0002673817,0.025722003,0.000017941446,0.00042223392,3.6877805e-7,8.6519697e-7,0.000020517045,0.00009123991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988579,0.00005011147,0.0005965429,0.00008070882,0.00024756757,0.00016716983],"domain_scores_gemma":[0.999283,0.00011926497,0.00022719539,0.00012892282,0.00016436144,0.00007725441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002548783,0.00015284607,0.00037035844,0.00024288525,0.000046360743,0.00004380433,0.00022039821,0.00011577019,0.000023702129],"category_scores_gemma":[0.000096336,0.00014260907,0.00013163593,0.00034174384,0.000039815975,0.00032770535,0.000018828061,0.00021674261,0.0000014986716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0006855041,0.00016989766,0.003205432,0.0005945078,0.0007658103,0.00007033645,0.0020383855,0.76690537,0.1681242,0.045117795,0.0083970865,0.0039256513],"study_design_scores_gemma":[0.014546238,0.0017599423,0.003015854,0.00520035,0.0011031796,0.00008495685,0.0018685387,0.5182101,0.35163334,0.08783892,0.012896938,0.0018416224],"about_ca_topic_score_codex":0.000024871388,"about_ca_topic_score_gemma":0.0000014951445,"teacher_disagreement_score":0.89700586,"about_ca_system_score_codex":0.00010091249,"about_ca_system_score_gemma":0.00021574435,"threshold_uncertainty_score":0.58154297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6901296,0.005937001,0.12271245,0.0005948786,0.061785385,0.002079781,0.000016469,0.00086000224,0.11588449],"genre_scores_gemma":[0.9978346,0.000060296796,0.0017007046,0.000007704044,0.00023580054,0.000012513608,5.359518e-7,0.000017999382,0.0001297954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887806,0.00018940927,0.0004323017,0.00007715501,0.0002136917,0.00020940597],"domain_scores_gemma":[0.99897516,0.0003275946,0.00017776527,0.00015605753,0.00030013509,0.00006330138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007491823,0.00013701853,0.00024986308,0.000111298585,0.00021340643,0.00010160713,0.00022429957,0.000093077426,0.000008394931],"category_scores_gemma":[0.00008020861,0.000090065485,0.00007355546,0.0004978033,0.00007627704,0.00018483732,0.000010500599,0.00034016318,0.0000027009676],"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.0007504323,0.00007394496,0.00036362608,0.00009363653,0.0006384928,0.000017671588,0.0003626535,0.00513439,0.0046570376,0.98066086,0.0046039824,0.0026432516],"study_design_scores_gemma":[0.0047231386,0.00080909027,0.00054300594,0.00094575237,0.00031839588,0.000323999,0.0009965504,0.001199395,0.014871598,0.9088733,0.06599423,0.0004015368],"about_ca_topic_score_codex":0.000004191409,"about_ca_topic_score_gemma":0.0000011983534,"teacher_disagreement_score":0.3077051,"about_ca_system_score_codex":0.00009802935,"about_ca_system_score_gemma":0.00012635093,"threshold_uncertainty_score":0.3672764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98686093,0.00020043456,0.0006716912,0.0021570253,0.0053646066,0.0008235914,0.000012468611,0.000013538863,0.0038956911],"genre_scores_gemma":[0.99876386,0.00003348796,0.00020799362,0.00014972621,0.00025645425,0.00001065456,3.9313124e-7,0.000030729192,0.00054667733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945737,0.0019096469,0.0011587591,0.00016021272,0.0018399673,0.00035772342],"domain_scores_gemma":[0.98630047,0.010219479,0.0018412295,0.00078476337,0.0007919542,0.00006209783],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0062551755,0.00023023988,0.0005896137,0.0003612393,0.00026367023,0.00007154029,0.0017240401,0.00022709032,0.00006449932],"category_scores_gemma":[0.012987167,0.00011366674,0.00059695187,0.0021852865,0.00018040216,0.00015842983,0.00028990593,0.0010750592,0.000006434354],"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.0002790892,0.0006561136,0.004589219,0.00010261884,0.0003616136,0.0000017352567,0.0002914598,0.0000036097756,0.005041504,0.9763959,0.0120121185,0.00026502705],"study_design_scores_gemma":[0.0017617076,0.0005870898,0.014166057,0.0004936557,0.00019911316,0.0000051529337,0.0001368428,0.000064985274,0.012605689,0.96895546,0.00089708314,0.00012718352],"about_ca_topic_score_codex":0.000007807578,"about_ca_topic_score_gemma":0.00000402678,"teacher_disagreement_score":0.011902932,"about_ca_system_score_codex":0.000461794,"about_ca_system_score_gemma":0.00026925807,"threshold_uncertainty_score":0.9953269},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78398234,0.0016916858,0.14101703,0.0015223052,0.051102962,0.0006038326,0.000007682345,0.00023574058,0.01983643],"genre_scores_gemma":[0.9988248,0.000007395985,0.00023379049,0.00003337069,0.0004473671,0.0000038941557,2.1331836e-7,0.0000139151225,0.0004352847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991973,0.000081046026,0.00030293988,0.000060610593,0.0001926944,0.00016540405],"domain_scores_gemma":[0.9994303,0.00011023437,0.000069514674,0.00013546197,0.00014600669,0.00010848379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042579236,0.00011658749,0.00027353768,0.000248109,0.000046894762,0.0001066813,0.00022856121,0.0000832029,0.000012195868],"category_scores_gemma":[0.000120607314,0.00010331213,0.00013310523,0.00038955428,0.000011055977,0.00013658893,0.00001415377,0.0002096121,0.000008574497],"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.00040345557,0.00018180064,0.0016331108,0.00036129064,0.0005552788,0.00016162648,0.0015237454,0.006138056,0.08650037,0.8051975,0.09143304,0.0059107332],"study_design_scores_gemma":[0.006681829,0.0016791167,0.0033594223,0.0015564759,0.000255957,0.00009632071,0.0015630309,0.0010344249,0.08480284,0.49854302,0.3995143,0.0009132619],"about_ca_topic_score_codex":9.4108424e-7,"about_ca_topic_score_gemma":5.122198e-7,"teacher_disagreement_score":0.30808124,"about_ca_system_score_codex":0.00006220943,"about_ca_system_score_gemma":0.000036906622,"threshold_uncertainty_score":0.42129463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9356589,0.0007290701,0.058889776,0.000017326662,0.0027605167,0.00007442851,0.0000019538984,0.000013510626,0.00185457],"genre_scores_gemma":[0.99961436,0.00008366436,0.00017302368,0.0000018563196,0.00008066944,0.0000023012753,2.5268344e-7,0.00000487056,0.000039019218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992831,0.00008477337,0.0003651022,0.00004278296,0.00015214876,0.00007213525],"domain_scores_gemma":[0.9994794,0.000145959,0.00012239788,0.000084260835,0.00013389818,0.00003406487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037990924,0.00006982435,0.00018741879,0.00017722842,0.00003621521,0.000022216787,0.00011201525,0.000051196555,0.0000050425765],"category_scores_gemma":[0.00006045016,0.00006217471,0.000052353946,0.00015119763,0.000041388983,0.00009520318,0.000008094611,0.00012205157,5.385422e-7],"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.000067323635,0.000066456756,0.0065470613,0.000121659985,0.00011322474,0.0000018791256,0.0004315741,0.00069805305,0.2824618,0.7037214,0.0002799944,0.0054895645],"study_design_scores_gemma":[0.0036185347,0.0005470178,0.4112919,0.0010157605,0.0002870268,0.000032745666,0.0012685562,0.012633641,0.048597947,0.51955825,0.00084034016,0.00030828113],"about_ca_topic_score_codex":0.0000015203556,"about_ca_topic_score_gemma":5.485946e-7,"teacher_disagreement_score":0.40474483,"about_ca_system_score_codex":0.00002574018,"about_ca_system_score_gemma":0.000039706163,"threshold_uncertainty_score":0.2535411},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8910223,0.0015174043,0.041636504,0.00047914402,0.044643704,0.0008710298,0.000012756959,0.00009568602,0.019721465],"genre_scores_gemma":[0.9954036,0.000018616236,0.0023957465,0.000028315213,0.0006341853,0.000004409971,3.8918506e-7,0.000020697018,0.0014940272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.00022903005,0.00061917887,0.00011438637,0.00043090427,0.00020215903],"domain_scores_gemma":[0.9982408,0.0005109596,0.000497292,0.00029380483,0.00037171514,0.0000854255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892292,0.00017348018,0.0005283168,0.0002117364,0.0001720635,0.00007528803,0.00035169598,0.00011254762,0.000022597049],"category_scores_gemma":[0.00034280808,0.0001055022,0.00014471014,0.0002933552,0.00007106869,0.00015868824,0.00004846007,0.00031024782,8.3669704e-7],"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.00051474455,0.00012117396,0.00037480544,0.000090086774,0.00026493153,0.000042897762,0.0001604803,0.000014088531,0.0001737767,0.99058074,0.00752075,0.00014150926],"study_design_scores_gemma":[0.0032607547,0.0006149531,0.0003554609,0.00031282296,0.0002333229,0.00006269841,0.00014805302,0.00001693085,0.0009376256,0.9883452,0.005563886,0.00014829723],"about_ca_topic_score_codex":0.000009369116,"about_ca_topic_score_gemma":5.6715686e-7,"teacher_disagreement_score":0.10438131,"about_ca_system_score_codex":0.000069129346,"about_ca_system_score_gemma":0.00015934078,"threshold_uncertainty_score":0.4302255},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044537224,0.0012960491,0.9409065,0.00033416596,0.0075507015,0.0006585063,0.000006042937,0.00019533998,0.0045154444],"genre_scores_gemma":[0.9977125,0.000028711389,0.0015741998,0.00003996338,0.00017672328,0.00001693219,0.0000013968438,0.000021289698,0.0004282835],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986295,0.00019713963,0.00049781665,0.0001067183,0.0002782869,0.0002905023],"domain_scores_gemma":[0.9990963,0.0003047617,0.00010102317,0.00020837775,0.00012215889,0.00016738649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008265874,0.00017786508,0.0004159932,0.00023064071,0.00007337764,0.000099420744,0.00038241188,0.00018266264,0.000050295115],"category_scores_gemma":[0.000085822205,0.00015948467,0.00019504508,0.00045102573,0.000018947345,0.00011131134,0.000012875031,0.00047107963,0.000005392992],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0013471314,0.00044187973,0.00061027904,0.0005751568,0.0005714685,0.00012518423,0.00040790314,0.001953985,0.7866975,0.049274106,0.12748516,0.030510252],"study_design_scores_gemma":[0.0045808656,0.0010675096,0.00006455507,0.0006484913,0.00009540339,0.000029798739,0.0000738008,0.000874772,0.84363866,0.12599981,0.022556784,0.00036955028],"about_ca_topic_score_codex":0.000019246858,"about_ca_topic_score_gemma":9.87717e-7,"teacher_disagreement_score":0.9531753,"about_ca_system_score_codex":0.000079686906,"about_ca_system_score_gemma":0.00019612498,"threshold_uncertainty_score":0.6503596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99075156,0.000058477774,0.0005948561,0.000843623,0.0027395263,0.00046457237,0.000009648653,0.000016480393,0.004521264],"genre_scores_gemma":[0.99864244,0.0000080296,0.000673691,0.00006689855,0.0002206511,0.0000034737636,3.2282685e-7,0.000020938845,0.0003635238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976267,0.0005228366,0.00078792934,0.00011513178,0.000671933,0.00027542704],"domain_scores_gemma":[0.9953602,0.003053473,0.00060184597,0.00036939312,0.00053197274,0.00008313196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024644234,0.00017238475,0.0004528219,0.00034383248,0.00015308394,0.00006168417,0.00069104915,0.0001387955,0.00012349026],"category_scores_gemma":[0.00451573,0.00008563827,0.00024056435,0.0006164679,0.00015727703,0.00012891124,0.00009330338,0.0007550238,0.0000028203376],"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.0013014751,0.0002550931,0.00025265143,0.000113350834,0.00023817169,0.000015656296,0.0004012992,0.0000130491435,0.016232762,0.962573,0.017948123,0.0006553522],"study_design_scores_gemma":[0.0016775907,0.0008902071,0.00010262939,0.00033021823,0.00008193075,0.000014318429,0.00016037766,0.000114661256,0.040916268,0.9542107,0.0014011514,0.000099953526],"about_ca_topic_score_codex":0.0000063717544,"about_ca_topic_score_gemma":0.0000019727206,"teacher_disagreement_score":0.024683505,"about_ca_system_score_codex":0.00009484947,"about_ca_system_score_gemma":0.000422921,"threshold_uncertainty_score":0.54060763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.712996,0.005419813,0.21966624,0.00028824023,0.053114958,0.0018052786,0.000033840683,0.00020623961,0.006469375],"genre_scores_gemma":[0.99857324,0.00012736379,0.0006896857,0.000019868874,0.0005001643,0.000033638265,7.747796e-7,0.000018047902,0.00003724098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915665,0.00005636025,0.00039751513,0.000086372405,0.00011331612,0.00018979525],"domain_scores_gemma":[0.99924403,0.00027722318,0.00012321626,0.00010487518,0.00015954091,0.000091121234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446358,0.00014011003,0.00032049164,0.0002408115,0.00012725894,0.00006517603,0.00013622624,0.000114615556,0.000006042023],"category_scores_gemma":[0.000052646203,0.00013672946,0.00012637854,0.00021733232,0.00005544416,0.00025671025,0.000013047647,0.00018884246,0.0000011231158],"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.0006364796,0.00006487707,0.00064928754,0.0003112808,0.0005076422,0.0000168187,0.0008571002,0.0004935222,0.022177145,0.96721286,0.0042123417,0.0028606527],"study_design_scores_gemma":[0.01580356,0.0011591678,0.0010398662,0.0011805382,0.0006329559,0.00037808958,0.001365783,0.0008361986,0.061143693,0.8671342,0.048583236,0.00074267684],"about_ca_topic_score_codex":0.0000030970832,"about_ca_topic_score_gemma":9.759788e-7,"teacher_disagreement_score":0.2855772,"about_ca_system_score_codex":0.00007044829,"about_ca_system_score_gemma":0.000043514923,"threshold_uncertainty_score":0.5575666},"labels":[],"label_agreement":null}]}