{"meta":{"query_hash":"25cd3a93dcdb","filters":{"topic":"graph theory and CDMA systems"},"cohort_total":1464,"direct_labels_cover":0,"predictions_cover":1464,"exported":1464,"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/25cd3a93dcdb","api":"https://metacan.xera.ac/api/v1/cohort?topic=graph+theory+and+CDMA+systems"},"results":[{"id":"W10019877","doi":"10.1103/physrevd.53.5891","title":"Cyclically decomposing the complete graph into cycles with pendent edges","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Wheel graph; Complete graph; Integer (computer science); Discrete mathematics; Graph power; Line graph; Computer science","score_opus":0.012203389694537608,"score_gpt":0.20142780540359354,"score_spread":0.18922441570905593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10019877","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.99326706,0.00059784914,0.00026972248,0.000087761415,0.0011448286,0.00019449487,0.0000019957088,0.00032348445,0.0041128057],"genre_scores_gemma":[0.9996402,0.00005361522,0.00013464774,0.00004827446,0.000017973087,0.000032370423,0.000004588386,0.000040201343,0.000028091468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989978,0.00008280333,0.000223251,0.00018086251,0.00023160038,0.0002836782],"domain_scores_gemma":[0.99930114,0.00013339776,0.000039732236,0.000393178,0.000040026087,0.00009254552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017045112,0.00020412517,0.0002187019,0.00006794514,0.00039383315,0.00004441101,0.00034964774,0.00006069783,0.000014604306],"category_scores_gemma":[0.000007442959,0.00014135893,0.00008245046,0.00025497098,0.00017876027,0.00011215809,0.000037643647,0.00021961534,0.000056774497],"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.00008886541,0.00017776807,0.044589564,0.00015336106,0.00046272637,0.00016374399,0.00631331,0.004274168,0.015059368,0.9222725,0.0046423613,0.0018022464],"study_design_scores_gemma":[0.0036419223,0.0004678671,0.14401352,0.00036382576,0.00014075804,0.000895199,0.0012955355,0.0031519446,0.015749315,0.80866843,0.019841636,0.0017700229],"about_ca_topic_score_codex":0.000044149292,"about_ca_topic_score_gemma":0.000026287193,"teacher_disagreement_score":0.11360407,"about_ca_system_score_codex":0.00003284955,"about_ca_system_score_gemma":0.00001145942,"threshold_uncertainty_score":0.576445},"labels":[],"label_agreement":null},{"id":"W1026885838","doi":"10.1007/978-3-642-04016-0_25","title":"Algorithmic Aspects of the Local Lemma","year":2002,"lang":"en","type":"book-chapter","venue":"Algorithms and combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto; University of New Brunswick","funders":"","keywords":"Lemma (botany); Computer science; Biology","score_opus":0.008461829463697671,"score_gpt":0.16574342609356726,"score_spread":0.1572815966298696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1026885838","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042645435,0.012698308,0.001715467,0.000028252418,0.0040460103,0.0004729716,0.00008203333,0.00022088185,0.9803096],"genre_scores_gemma":[0.85612845,0.0025154834,0.000051809435,0.00003413669,0.0003001161,0.000022866128,0.000012218977,0.00022202481,0.1407129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880296,0.000017146485,0.00037689155,0.0002426364,0.0003185854,0.00024175835],"domain_scores_gemma":[0.99918574,0.000053324275,0.00011686776,0.00048326718,0.00006816053,0.000092632334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012071944,0.00038269625,0.00047613645,0.000093768016,0.00009698398,0.000025291129,0.00031860106,0.0003976057,0.00008340693],"category_scores_gemma":[0.000002753571,0.00030663592,0.0001982306,0.00008778514,0.00019641449,0.000049851576,0.00008896108,0.00050813047,0.000026733991],"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.0000011857924,0.000014747146,0.0000063945613,0.0001885738,0.00013901321,0.000018549654,0.000094463474,0.000051605766,0.000007175085,0.97563756,0.0009646832,0.022876041],"study_design_scores_gemma":[0.0007326251,0.00015209682,0.00008138579,0.00045391906,0.00019680294,0.00013754224,0.000054583645,0.013240522,0.00042929378,0.7248761,0.25877106,0.00087405223],"about_ca_topic_score_codex":0.000008958407,"about_ca_topic_score_gemma":0.0000017171418,"teacher_disagreement_score":0.855702,"about_ca_system_score_codex":0.000059159916,"about_ca_system_score_gemma":0.00001622093,"threshold_uncertainty_score":0.99993855},"labels":[],"label_agreement":null},{"id":"W112478939","doi":"","title":"Nonplanar sequences of iterated r-jump graphs","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Jump; Iterated function; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.007000301445368651,"score_gpt":0.19267451901793306,"score_spread":0.18567421757256442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112478939","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.980678,0.0007197101,0.000013363119,0.0000030547571,0.0018976943,0.00008098648,0.0000052118726,0.00013913424,0.016462808],"genre_scores_gemma":[0.9998403,0.000020929967,0.0000368696,0.000008061617,0.000001702352,0.000009465105,0.0000039131123,0.000016792017,0.00006191728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933875,0.00006943295,0.00020813197,0.000102412465,0.00010879148,0.00017247937],"domain_scores_gemma":[0.9996315,0.00004342691,0.000032572552,0.00019836373,0.000040092633,0.00005403775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019635097,0.00011689862,0.00017833672,0.0000820204,0.000036421876,0.000013414138,0.00012289968,0.00007054672,0.00007361976],"category_scores_gemma":[0.000015286581,0.00011387136,0.00005837342,0.0003204761,0.000041515697,0.00008662494,0.0000043466944,0.00008854782,0.000038894108],"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.0000032412006,0.00002422562,0.0032548192,0.00006489899,0.000044493652,0.000008784549,0.00026436543,0.0002861227,0.016914008,0.97841275,0.0006701085,0.000052195886],"study_design_scores_gemma":[0.0007368283,0.00009952781,0.0007649331,0.00009352715,0.000024148907,0.000024138937,0.00024539657,0.00043187817,0.16501561,0.8276049,0.0046146284,0.0003444938],"about_ca_topic_score_codex":0.0000070073497,"about_ca_topic_score_gemma":0.0000013155995,"teacher_disagreement_score":0.15080784,"about_ca_system_score_codex":0.000011674222,"about_ca_system_score_gemma":0.000009863186,"threshold_uncertainty_score":0.46435395},"labels":[],"label_agreement":null},{"id":"W113348692","doi":"","title":"Mod sum number of wheels.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.008855883404500739,"score_gpt":0.19606006397915307,"score_spread":0.18720418057465232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113348692","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.9194038,0.00033930864,0.000011688046,0.00000970109,0.0018136931,0.00006177483,0.000003143555,0.00015346445,0.07820345],"genre_scores_gemma":[0.9993858,0.000025467429,0.00002358881,0.000006698486,0.0000067976407,0.000008309692,0.000001158985,0.000021799773,0.00052039133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945885,0.000025118748,0.0001685753,0.00008310193,0.000106388594,0.0001579749],"domain_scores_gemma":[0.99964035,0.00003065626,0.000022113905,0.00023509671,0.00002356833,0.000048228852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089878435,0.000095624724,0.00015375139,0.00003140827,0.000023579823,0.000008853284,0.0001317087,0.000065391934,0.00044637226],"category_scores_gemma":[0.000008106022,0.00009908306,0.00006022208,0.0001589583,0.000025280247,0.000080150676,0.000013006398,0.000086178574,0.00033885162],"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.0000025723186,0.00006873256,0.0056141387,0.00010296708,0.00006170594,0.000006443123,0.00057935354,0.0001981582,0.0017920171,0.9803924,0.010526245,0.00065524003],"study_design_scores_gemma":[0.0018908129,0.0000708706,0.002874917,0.00016326888,0.00004223289,0.000041977743,0.00019452226,0.013923108,0.023912823,0.9355095,0.020711664,0.0006642816],"about_ca_topic_score_codex":0.0000060427346,"about_ca_topic_score_gemma":5.762297e-7,"teacher_disagreement_score":0.079982005,"about_ca_system_score_codex":0.000013988656,"about_ca_system_score_gemma":0.0000013088505,"threshold_uncertainty_score":0.48874632},"labels":[],"label_agreement":null},{"id":"W114458668","doi":"","title":"3-Regular Hypergraphs that are Decomposable and Threshold.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007924042138880443,"score_gpt":0.1845288132611205,"score_spread":0.17660477112224005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114458668","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.97798556,0.0029756508,0.000011802135,0.000012466242,0.00182727,0.00012049341,0.0000021746116,0.00023057287,0.016834008],"genre_scores_gemma":[0.9996473,0.00008294121,0.000044629192,0.000023301558,0.0000039349507,0.000018144849,0.0000017967343,0.000033455002,0.00014449106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992797,0.000042269134,0.00013068071,0.00016979504,0.000118021744,0.00025953358],"domain_scores_gemma":[0.9995306,0.000035436275,0.000025193003,0.00028524728,0.000018390252,0.0001050976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019937828,0.00016747425,0.00020341492,0.00007092088,0.000100700294,0.000048514743,0.00011168204,0.00009280837,0.000034748235],"category_scores_gemma":[0.000009377926,0.0001658904,0.00005535957,0.00017364306,0.00004509338,0.00012975292,0.0000139881895,0.00012132717,0.00003512761],"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.0000033425652,0.000026769017,0.04754707,0.000064369255,0.000058039026,0.00001513344,0.00011696914,0.0001438917,0.0012846374,0.9485654,0.0020825525,0.00009182804],"study_design_scores_gemma":[0.0010896134,0.000042592485,0.006516739,0.00008304498,0.000030727693,0.00006173983,0.00044211023,0.00053512974,0.019611722,0.9494466,0.021660967,0.0004790172],"about_ca_topic_score_codex":0.000002497136,"about_ca_topic_score_gemma":0.0000026323653,"teacher_disagreement_score":0.04103033,"about_ca_system_score_codex":0.000015639107,"about_ca_system_score_gemma":0.0000046773616,"threshold_uncertainty_score":0.6764814},"labels":[],"label_agreement":null},{"id":"W1153051990","doi":"","title":"Recent results on (ï°,ï¬) - designs and related configurations","year":2011,"lang":"es","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","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 Waterloo","funders":"","keywords":"Computer science","score_opus":0.31066380465531745,"score_gpt":0.48442581022582004,"score_spread":0.1737620055705026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1153051990","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.69581646,0.04377293,0.00017409872,0.00017095079,0.0027140002,0.0013033851,0.00030667652,0.00017041166,0.25557113],"genre_scores_gemma":[0.9460164,0.052989356,0.000068966336,0.00006738204,0.00011437378,0.000040815226,0.000023748105,0.00009745884,0.0005815404],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9959898,0.0007143913,0.0016580886,0.0005832049,0.000521572,0.000532926],"domain_scores_gemma":[0.9970655,0.0005224271,0.0008922968,0.00076429185,0.00030664637,0.00044887268],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002185139,0.0005535782,0.00096865627,0.0009987246,0.00041127225,0.0012300649,0.0016844937,0.00033401893,0.009893114],"category_scores_gemma":[0.00045088842,0.00052717974,0.00020119055,0.0011496077,0.0002189582,0.0017187543,0.0002885512,0.0007730305,0.00010710592],"study_design_candidate":"observational","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.0071182908,0.002769869,0.100231215,0.00163094,0.0066019027,0.00093884335,0.014081687,0.004141875,0.4524341,0.1052445,0.15328535,0.15152143],"study_design_scores_gemma":[0.003698682,0.00016641166,0.7503655,0.005389781,0.00064971903,0.00015834557,0.00063780835,0.0007506219,0.11111451,0.04080708,0.084163964,0.0020975876],"about_ca_topic_score_codex":0.00027912753,"about_ca_topic_score_gemma":0.000011625091,"teacher_disagreement_score":0.65013427,"about_ca_system_score_codex":0.00009415259,"about_ca_system_score_gemma":0.000085789274,"threshold_uncertainty_score":0.99980676},"labels":[],"label_agreement":null},{"id":"W116960971","doi":"","title":"Four Colour Classes in Projective Planes with Non-Fano Quads.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fano plane; Mathematics; Projective test; Combinatorics; Pure mathematics","score_opus":0.006909749877575993,"score_gpt":0.2035340965721297,"score_spread":0.1966243466945537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116960971","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.9805983,0.00008331802,0.00005836698,0.000008868242,0.001111236,0.00031082955,0.0000024676579,0.0001740282,0.017652636],"genre_scores_gemma":[0.9997361,0.0000057804536,0.00005089963,0.0000133820195,0.000013019154,0.000034930672,0.0000034039,0.000033057993,0.00010945565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99910617,0.000033112792,0.00020564056,0.0001679657,0.00014937967,0.00033775766],"domain_scores_gemma":[0.99954796,0.00013132382,0.0000342574,0.00018603861,0.00003496576,0.000065484564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845585,0.0001717569,0.00021954789,0.00015712259,0.000044370074,0.00002446024,0.00014377684,0.00010737987,0.0000085513275],"category_scores_gemma":[0.000013794803,0.00015273967,0.00003034555,0.00040060334,0.00003503034,0.00012327501,0.000013251325,0.00020596008,0.000037146332],"study_design_candidate":"observational","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.00055516313,0.0003572671,0.3696408,0.00046578547,0.00031002003,0.0008895968,0.007012015,0.0018678186,0.005637749,0.60885483,0.0031326343,0.0012763147],"study_design_scores_gemma":[0.0113253165,0.0017950992,0.64345753,0.0009745652,0.00009854638,0.00035653755,0.010890153,0.0035263572,0.045871194,0.26734653,0.011674461,0.0026837082],"about_ca_topic_score_codex":0.00006899498,"about_ca_topic_score_gemma":0.00027991255,"teacher_disagreement_score":0.3415083,"about_ca_system_score_codex":0.00007441598,"about_ca_system_score_gemma":0.000022930062,"threshold_uncertainty_score":0.6228543},"labels":[],"label_agreement":null},{"id":"W117039097","doi":"10.1023/a:1011275205253","title":"$$(C_k \\oplus G,k,\\lambda )$$ Difference Families","year":2001,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Research Council Canada; Beijing Institute For Brain Disorders; National Science Council","keywords":"Lambda; Mathematics; Combinatorics; Modulo; Physics; Quantum mechanics","score_opus":0.01434313926246763,"score_gpt":0.1962404041754294,"score_spread":0.18189726491296176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117039097","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.9301978,0.003382453,0.051467046,0.000015392281,0.00028684444,0.0001726362,0.000013865501,0.0004781323,0.013985865],"genre_scores_gemma":[0.99694103,0.0022957067,0.0005016647,0.00005425844,0.000066646746,0.000043136977,0.000006968334,0.000028810588,0.00006179848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990541,0.00005106719,0.00020657612,0.00021623421,0.00013415779,0.0003378797],"domain_scores_gemma":[0.9995082,0.00007377474,0.000024053337,0.00024046304,0.000025776502,0.00012774701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013585862,0.00023656621,0.00024858397,0.00024607257,0.00014728864,0.000089202964,0.00015100907,0.000099236866,0.000047040325],"category_scores_gemma":[0.0000046276755,0.00021093864,0.00011703166,0.00051511364,0.000121670775,0.000092316135,0.000018367864,0.0001319282,0.000015591033],"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.00025627448,0.00027523242,0.20706916,0.0008042072,0.0009900173,0.0002459415,0.0065015745,0.0019890151,0.16198875,0.43424776,0.005691437,0.17994064],"study_design_scores_gemma":[0.0057629733,0.0014269211,0.41621986,0.00096574094,0.0005438522,0.0008900027,0.01336746,0.03380084,0.020456214,0.2792646,0.22062522,0.0066763344],"about_ca_topic_score_codex":0.00002225363,"about_ca_topic_score_gemma":0.000024848714,"teacher_disagreement_score":0.21493378,"about_ca_system_score_codex":0.0000059520967,"about_ca_system_score_gemma":0.0000041200246,"threshold_uncertainty_score":0.86018276},"labels":[],"label_agreement":null},{"id":"W1173892267","doi":"","title":"Monocular Observers Resist Peripheral Target (Troxler) Fading","year":2003,"lang":"en","type":"article","venue":"Investigative Ophthalmology & Visual Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Toronto Western Hospital","funders":"","keywords":"Fading; Resist; Monocular; Peripheral; Optics; Computer science; Materials science; Computer vision; Telecommunications; Physics; Decoding methods; Nanotechnology","score_opus":0.029871769263014644,"score_gpt":0.2771591708713315,"score_spread":0.24728740160831686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1173892267","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.97119015,0.000278591,0.00005900089,0.000024143525,0.00084805535,0.0001914631,0.000004194661,0.0001665831,0.027237834],"genre_scores_gemma":[0.997038,0.000002209886,0.002457998,0.00005807184,0.000041096537,0.000043879932,0.0000023417042,0.000028363911,0.000328025],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978453,0.0002720275,0.00031147143,0.0005121964,0.0003299311,0.000729078],"domain_scores_gemma":[0.99911594,0.00007963919,0.00006679133,0.000288809,0.00009272508,0.00035610763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011153829,0.00028372777,0.00029859945,0.00017731427,0.0004891657,0.000083952946,0.000504583,0.00012762536,0.00026611684],"category_scores_gemma":[0.00035732583,0.00027849866,0.00008918363,0.0011898273,0.0025766187,0.0005323353,0.000050582672,0.00028323583,0.000080693964],"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.0000067781566,0.00003266242,0.031052738,0.00003431482,0.000040269864,0.00019649613,0.0014742317,0.006237685,0.949416,0.011360313,0.00010831626,0.00004019946],"study_design_scores_gemma":[0.00050715165,0.00034835294,0.027841855,0.00008833329,0.00002082194,0.0005369755,0.0017510697,0.0102847535,0.9127928,0.0427923,0.0021203,0.00091527705],"about_ca_topic_score_codex":0.000028167036,"about_ca_topic_score_gemma":0.0000012033681,"teacher_disagreement_score":0.036623184,"about_ca_system_score_codex":0.0001790924,"about_ca_system_score_gemma":0.00012349148,"threshold_uncertainty_score":0.99996674},"labels":[],"label_agreement":null},{"id":"W1174782472","doi":"","title":"Pairwise Balanced Designs of Dimension Three","year":2013,"lang":"en","type":"dissertation","venue":"UVic’s Research and Learning Repository (University of Victoria)","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dimension (graph theory); Mathematics; Pairwise comparison; Affine transformation; Integer (computer science); Combinatorics; Discrete mathematics; Affine space; Pure mathematics; Computer science; Statistics","score_opus":0.020425151825179563,"score_gpt":0.2365314628989257,"score_spread":0.21610631107374614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1174782472","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.9849078,0.0015917972,0.000104119215,0.000003722158,0.00089709996,0.00030131708,0.0000035143232,0.00010383726,0.012086815],"genre_scores_gemma":[0.9855154,0.00027587492,0.00010102084,2.468838e-7,0.000113814276,0.0000017723046,0.000066073604,0.000035274534,0.01389052],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9983316,0.00031259988,0.00020957351,0.000283665,0.00054474286,0.00031779511],"domain_scores_gemma":[0.9987415,0.00023018543,0.00014297714,0.0002843865,0.00044222566,0.00015871423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059275265,0.0001938729,0.00043002403,0.0003436276,0.0004134509,0.000031005435,0.00028367975,0.0003739136,0.0000950733],"category_scores_gemma":[0.000049845763,0.00023098322,0.00011124079,0.00031254612,0.00015209863,0.00016416142,0.000043345186,0.00097026426,0.00002234468],"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.0013066847,0.00023152433,0.016276658,0.007895202,0.0010913612,0.00017775277,0.025751624,0.0034350283,0.92691916,0.0021828287,0.007857136,0.006875041],"study_design_scores_gemma":[0.011211396,0.010923958,0.41120774,0.017647317,0.0010372107,0.00011602358,0.19192882,0.06187883,0.16945046,0.009168602,0.10909635,0.006333295],"about_ca_topic_score_codex":0.0004242508,"about_ca_topic_score_gemma":0.000092267306,"teacher_disagreement_score":0.7574687,"about_ca_system_score_codex":0.00006511145,"about_ca_system_score_gemma":0.00006461049,"threshold_uncertainty_score":0.94192225},"labels":[],"label_agreement":null},{"id":"W120353176","doi":"","title":"A Counterexample to a Conjecture on Packing Two Copies of a Tree into its Third Power.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Counterexample; Mathematics; Conjecture; Tree (set theory); Combinatorics; Power (physics); Discrete mathematics; Physics","score_opus":0.0077309406380179,"score_gpt":0.22308949051499274,"score_spread":0.21535854987697484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120353176","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.99195534,0.00027544092,0.00007247967,0.000062300816,0.0016885394,0.00026620866,0.00000909485,0.00020364614,0.0054669706],"genre_scores_gemma":[0.99976295,0.0000046023447,0.00004653069,0.000085004955,0.000009977165,0.000027748245,0.0000029931246,0.000034018267,0.000026169102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991028,0.000033287084,0.0002475773,0.00017726683,0.00019780266,0.00024128288],"domain_scores_gemma":[0.9994259,0.00007558896,0.00004278701,0.00030885654,0.00005314576,0.0000937068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001738526,0.00019553663,0.00029429488,0.00011935616,0.000057732123,0.000028843633,0.00021679381,0.000081140606,0.000021279513],"category_scores_gemma":[0.00004248779,0.00018749158,0.00007724849,0.00029512402,0.000026868249,0.00007941216,0.000029528315,0.00015764819,0.00008536986],"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.000045498822,0.00006348809,0.0003564559,0.000119992284,0.00008844868,0.00001685782,0.0066454164,0.0037657062,0.01988825,0.96818835,0.00064465485,0.00017690624],"study_design_scores_gemma":[0.0050526266,0.0012048732,0.002487593,0.0011016512,0.00004262239,0.000028865548,0.0012916668,0.00015273989,0.14990042,0.83172745,0.006185979,0.00082354515],"about_ca_topic_score_codex":0.000058201655,"about_ca_topic_score_gemma":0.00008110947,"teacher_disagreement_score":0.1364609,"about_ca_system_score_codex":0.00008902695,"about_ca_system_score_gemma":0.000019773122,"threshold_uncertainty_score":0.76456845},"labels":[],"label_agreement":null},{"id":"W120583540","doi":"","title":"Associated Graphs of p-dimensional (0, 1)-matrices.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005177347561728064,"score_gpt":0.18968011858260153,"score_spread":0.18450277102087348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120583540","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.99185765,0.00085912336,0.0000021501196,0.00001547139,0.0012430144,0.00007664433,0.000007839378,0.00020347828,0.0057346215],"genre_scores_gemma":[0.9998071,0.00001533088,0.00003484169,0.000015248575,0.0000057731045,0.000006489562,0.00000770323,0.000020147243,0.000087358814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926955,0.000037036694,0.0002433612,0.000095182506,0.00017447115,0.00018037544],"domain_scores_gemma":[0.999603,0.00007031483,0.000050124516,0.00017110464,0.000049774735,0.000055682962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022227682,0.000111594425,0.0001889427,0.00009799463,0.000036788457,0.000007656836,0.00013364319,0.00008967523,0.000069011505],"category_scores_gemma":[0.00002098819,0.00011414647,0.00008709372,0.00032426007,0.00002799878,0.00009716795,0.000015634463,0.00010731272,0.00006314805],"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.000011817049,0.00018928135,0.0050230264,0.00006376366,0.00022438052,0.000005881291,0.00034617874,0.0052359477,0.0106402105,0.963839,0.013251818,0.0011687146],"study_design_scores_gemma":[0.0037553953,0.00018366262,0.019640686,0.00024892995,0.000115702685,0.00001915924,0.00011761894,0.015141829,0.052162506,0.8963241,0.011312711,0.0009776733],"about_ca_topic_score_codex":0.00000703008,"about_ca_topic_score_gemma":0.0000032707387,"teacher_disagreement_score":0.06751486,"about_ca_system_score_codex":0.00003180525,"about_ca_system_score_gemma":0.000008071903,"threshold_uncertainty_score":0.4654758},"labels":[],"label_agreement":null},{"id":"W121839993","doi":"","title":"Scalability of Agent-Based Onion Routing Network.","year":2004,"lang":"en","type":"article","venue":"NPARC","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scalability; Computer science; Routing (electronic design automation); Computer network; Network routing; Routing protocol; Distributed computing; Database","score_opus":0.007943249353208138,"score_gpt":0.19182682728488654,"score_spread":0.1838835779316784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121839993","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.9645601,0.000049487346,0.012901427,0.00003360019,0.0003642471,0.000099321274,0.000002905132,0.00017016802,0.02181875],"genre_scores_gemma":[0.99896145,0.0000010589056,0.000922667,0.00001717682,0.000067785026,0.000005603791,0.0000027081296,0.000011393728,0.000010164187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994762,0.000028060096,0.00016942662,0.000080541926,0.0000840668,0.00016173976],"domain_scores_gemma":[0.999709,0.000026951826,0.000022753975,0.00017758478,0.000015447933,0.000048253256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028269406,0.00007,0.00011505379,0.00001999098,0.000030701023,0.0000059728204,0.00007472115,0.000046649948,0.000090078545],"category_scores_gemma":[0.000019805471,0.00006908431,0.000059781472,0.00013496414,0.000026396498,0.000031921227,0.0000072438975,0.00007070248,0.000016413995],"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.000017577102,0.000047440157,0.006035663,0.00021347705,0.000029489316,0.0000031291981,0.0002586969,0.9049602,0.04519235,0.03662226,0.00031226667,0.00630744],"study_design_scores_gemma":[0.0056819776,0.00038013636,0.06387528,0.0011573379,0.00012015954,0.000017721122,0.0005127584,0.2007225,0.39983314,0.31983364,0.006298097,0.0015672621],"about_ca_topic_score_codex":0.0000065495824,"about_ca_topic_score_gemma":0.000005390151,"teacher_disagreement_score":0.7042377,"about_ca_system_score_codex":0.000035579993,"about_ca_system_score_gemma":0.000012758499,"threshold_uncertainty_score":0.28171763},"labels":[],"label_agreement":null},{"id":"W122684963","doi":"","title":"Matricial construction of k-colourings on square lattice.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square lattice; Square (algebra); Combinatorics; Lattice (music); Discrete mathematics; Geometry; Condensed matter physics; Physics","score_opus":0.005344730187852847,"score_gpt":0.1940213375665132,"score_spread":0.18867660737866038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122684963","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.98351437,0.00008461485,0.000009944356,0.000027258768,0.0018888551,0.000099703204,0.000003802105,0.00016214712,0.014209295],"genre_scores_gemma":[0.9997708,0.000007704123,0.00011562794,0.000010182156,0.00002928132,0.00000772893,0.0000016833683,0.000017091414,0.000039867926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994446,0.00002431719,0.00018912149,0.00008767895,0.000118749216,0.00013552906],"domain_scores_gemma":[0.9997011,0.000042618285,0.000038469414,0.00015220088,0.000027174157,0.00003847331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010961182,0.00009615413,0.00014579887,0.00008738885,0.00003695895,0.000009408927,0.00008896108,0.000076928576,0.00004990147],"category_scores_gemma":[0.000010629549,0.00010145711,0.000056718185,0.00016208747,0.000030684478,0.00007707721,0.000008841153,0.0001046573,0.000090007365],"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.000018224133,0.000035751913,0.0015832346,0.000064009255,0.000029326362,0.0000017442693,0.00021367821,0.00088442693,0.0009109754,0.9928957,0.000624591,0.0027383396],"study_design_scores_gemma":[0.004108737,0.0005689386,0.014141048,0.00033605646,0.000113141614,0.00005950006,0.0007696661,0.0051660067,0.16203038,0.7789916,0.032704268,0.0010106758],"about_ca_topic_score_codex":0.0000042258257,"about_ca_topic_score_gemma":0.0000013314624,"teacher_disagreement_score":0.21390413,"about_ca_system_score_codex":0.00003657096,"about_ca_system_score_gemma":0.000004569947,"threshold_uncertainty_score":0.41373008},"labels":[],"label_agreement":null},{"id":"W123040501","doi":"10.12988/imf.2006.06076","title":"The existence of two new classes of near-Skolem type sequences","year":2006,"lang":"en","type":"article","venue":"International Mathematical Forum","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":"Type (biology); Mathematics; Geology; Paleontology","score_opus":0.012848226922383873,"score_gpt":0.2557675030974616,"score_spread":0.24291927617507772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123040501","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.8304115,0.0005970109,0.016088415,0.00071738573,0.0011927905,0.00019266618,0.000018874922,0.000110374065,0.15067098],"genre_scores_gemma":[0.99752516,0.000006666027,0.001493696,0.000006582713,0.00004951792,0.0000034111843,0.000001924076,0.00000776514,0.00090525794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993162,0.000011965846,0.00030463544,0.000054969154,0.00020603543,0.00010618836],"domain_scores_gemma":[0.99950397,0.00023723593,0.000055310753,0.000117421965,0.00006462021,0.0000214422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012782938,0.0000662571,0.000112459624,0.00002067645,0.00002695395,0.00002393699,0.00025930372,0.000025542025,0.00008528696],"category_scores_gemma":[0.000055962115,0.00004448667,0.000058956834,0.00008220516,0.00010701591,0.00006193784,0.000021834103,0.000049011225,0.000034977962],"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.000006880529,0.000016201906,0.00055727613,0.000040600866,0.00003306855,7.894326e-7,0.000048305432,0.001064891,0.003267955,0.9935631,0.0009203737,0.0004805231],"study_design_scores_gemma":[0.00014049967,0.000028825172,0.0002962264,0.00012977218,0.000008372051,0.000012449746,0.00015795082,0.015587335,0.013857136,0.9652505,0.0044571403,0.000073787705],"about_ca_topic_score_codex":0.000029291348,"about_ca_topic_score_gemma":0.000018101367,"teacher_disagreement_score":0.16711368,"about_ca_system_score_codex":0.000011643914,"about_ca_system_score_gemma":0.00001545458,"threshold_uncertainty_score":0.18141139},"labels":[],"label_agreement":null},{"id":"W1231542496","doi":"","title":"A Family of Group Divisible Designs of Block Size Four and Three Groups With l1=2 and l2=1 Using MOLS.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Combinatorics; Block size; Arithmetic; Computer science; Chemistry; Organic chemistry","score_opus":0.012798856765436153,"score_gpt":0.18449992206033822,"score_spread":0.17170106529490206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1231542496","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.99773866,0.0007818876,0.00035831323,0.0000028193028,0.00022200315,0.00017933249,0.000005847857,0.00004584264,0.0006652722],"genre_scores_gemma":[0.9994361,0.000013782171,0.00049784686,0.0000027554438,0.000006696366,0.0000061524424,6.6344614e-7,0.000029611972,0.000006431672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926335,0.000029428498,0.00024066771,0.00014781226,0.00014010824,0.00017864704],"domain_scores_gemma":[0.9994782,0.00010994443,0.00008729754,0.00024098894,0.000037254922,0.00004628772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001919569,0.00015649914,0.0002966199,0.000057364028,0.00006897076,0.00002593271,0.00010550382,0.00007343354,0.0000015846124],"category_scores_gemma":[0.000010129996,0.00014351807,0.000031929583,0.00015460889,0.00010934909,0.0001278343,0.00004096276,0.00008088938,2.821804e-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.00009149097,0.00012373009,0.22822326,0.0007379409,0.00019444045,0.000024858935,0.00031820667,0.0015560692,0.16708925,0.60133845,0.00006722528,0.00023505914],"study_design_scores_gemma":[0.003218092,0.00044658678,0.4499633,0.0004327998,0.00014122578,0.00005384927,0.00021955764,0.008242252,0.011940983,0.52482575,0.000019886573,0.0004957201],"about_ca_topic_score_codex":0.00027562233,"about_ca_topic_score_gemma":0.000036444533,"teacher_disagreement_score":0.22174004,"about_ca_system_score_codex":0.000011462389,"about_ca_system_score_gemma":0.0000063046386,"threshold_uncertainty_score":0.5852497},"labels":[],"label_agreement":null},{"id":"W124262862","doi":"","title":"l-Designs with Two Block Sizes.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics","score_opus":0.012000235474458165,"score_gpt":0.1957680972040253,"score_spread":0.18376786172956713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124262862","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.97923267,0.00020159691,0.000029199135,0.000010196591,0.0010222543,0.00012445897,0.0000016596532,0.00043277402,0.01894519],"genre_scores_gemma":[0.99946785,0.000015261932,0.00005758211,0.000018588746,0.000012928648,0.000022330622,0.0000019720987,0.000037410373,0.00036608824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.0000312003,0.00013439257,0.00013148796,0.00014316573,0.00023496903],"domain_scores_gemma":[0.99955094,0.000046493526,0.000019179668,0.00026714103,0.00002925195,0.00008701591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008623309,0.0001486389,0.00016967268,0.000048202975,0.0001034928,0.000012949845,0.00014624328,0.000048672347,0.000029478528],"category_scores_gemma":[0.00000568965,0.0001306475,0.00004139276,0.00022205865,0.000053905573,0.000089274516,0.0000106702355,0.00013205013,0.0001443428],"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.00006229785,0.00016189621,0.03890112,0.00010122584,0.00024471577,0.0003839946,0.0021437479,0.0057517593,0.006213122,0.9308931,0.014964291,0.00017870408],"study_design_scores_gemma":[0.022999372,0.0017486844,0.058376033,0.0005803053,0.00027358945,0.0028594467,0.0008606236,0.009229546,0.122280195,0.717894,0.057604406,0.005293797],"about_ca_topic_score_codex":0.000010582522,"about_ca_topic_score_gemma":0.00000285125,"teacher_disagreement_score":0.21299912,"about_ca_system_score_codex":0.000025462203,"about_ca_system_score_gemma":0.00001309772,"threshold_uncertainty_score":0.5327651},"labels":[],"label_agreement":null},{"id":"W124382047","doi":"","title":"On the structure of a generalization of weakly associative lattices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Antisymmetric relation; Mathematics; Associative property; Equivalence relation; Combinatorics; Integer (computer science); Upper and lower bounds; Pure mathematics; Relation (database); Discrete mathematics; Mathematical analysis; Computer science; Mathematical physics","score_opus":0.008104195425823812,"score_gpt":0.18725474881974102,"score_spread":0.17915055339391722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124382047","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.9950468,0.00016473395,0.000008613998,0.000021658023,0.00067947805,0.000092424685,0.000014716856,0.000030130834,0.0039414335],"genre_scores_gemma":[0.9998898,0.000010685903,0.000007022622,0.000013508833,0.0000042783445,0.0000016884206,0.0000020674395,0.000011130513,0.000059797414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995218,0.00006604811,0.00015006601,0.00005514982,0.00012691172,0.000080056154],"domain_scores_gemma":[0.9996001,0.000116286305,0.00007439757,0.00015232596,0.000042312186,0.000014565195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008148805,0.000071618386,0.00012587254,0.000033100037,0.000026633843,0.000005039481,0.00010064208,0.00005749332,0.00012473429],"category_scores_gemma":[0.000039302085,0.000053252712,0.00004072223,0.00019133052,0.000023990217,0.000036984136,0.0000071745326,0.0000741043,0.00000556204],"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.0000019947781,0.0000195145,0.000767559,0.00003164338,0.00006436188,2.5649248e-7,0.0012474408,0.0012224297,0.013572233,0.98124665,0.001761791,0.000064124535],"study_design_scores_gemma":[0.0005601676,0.000112461195,0.0040003136,0.00009628438,0.00003964688,9.1998635e-7,0.0002566,0.015713105,0.12268401,0.8560459,0.00030274902,0.00018786175],"about_ca_topic_score_codex":0.0000049428013,"about_ca_topic_score_gemma":0.0000020010662,"teacher_disagreement_score":0.12520078,"about_ca_system_score_codex":0.000017078672,"about_ca_system_score_gemma":0.0000016838615,"threshold_uncertainty_score":0.21715826},"labels":[],"label_agreement":null},{"id":"W124688773","doi":"10.1007/bf03012206","title":"Pseudo-Chebyshev subspaces inL 1","year":2000,"lang":"en","type":"article","venue":"Korean Journal of Computational & Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Linear subspace; Chebyshev filter; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.007129362771190418,"score_gpt":0.19928264731478024,"score_spread":0.19215328454358982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124688773","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.90113753,0.00020233016,0.05212591,0.00005033981,0.0001883426,0.00013569517,0.0000068313147,0.00009958335,0.046053432],"genre_scores_gemma":[0.9564202,0.000025009453,0.043234073,0.000029873234,0.00017452825,0.0000033365181,0.000004450806,0.000032843804,0.000075673466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987905,0.000014584506,0.00060036255,0.000068336616,0.00036193247,0.00016428984],"domain_scores_gemma":[0.99935716,0.00019274009,0.00015184052,0.0001111173,0.00008178921,0.00010533393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038143795,0.00016366407,0.0003089896,0.00012377837,0.00005647991,0.00004914869,0.00021628883,0.000057981822,0.00035777493],"category_scores_gemma":[0.000007046056,0.00014292847,0.00011221879,0.00017828468,0.00004955185,0.00009841341,0.0000069573675,0.00019443476,0.00013048352],"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.000041388706,0.00014331784,0.000021725737,0.00028780158,0.00025147144,0.00002643717,0.0034805515,0.8187199,0.0008787651,0.16084175,0.0039220992,0.011384753],"study_design_scores_gemma":[0.0013112022,0.00009491208,0.00048141862,0.00025199895,0.00010947813,0.0009228786,0.0010994878,0.08134498,0.0023674343,0.9081942,0.003337234,0.00048477665],"about_ca_topic_score_codex":1.5028225e-7,"about_ca_topic_score_gemma":2.315912e-7,"teacher_disagreement_score":0.7473525,"about_ca_system_score_codex":0.000028123604,"about_ca_system_score_gemma":0.000024281306,"threshold_uncertainty_score":0.5828454},"labels":[],"label_agreement":null},{"id":"W125492227","doi":"","title":"On the nonexistence of perfect codes in J(2w+p2, w).","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical economics","score_opus":0.007774068949106711,"score_gpt":0.19750988146403622,"score_spread":0.18973581251492952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125492227","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.97716266,0.00022187112,0.000004407198,0.00005269088,0.00054811034,0.00011175353,0.0000020279854,0.00005332228,0.02184317],"genre_scores_gemma":[0.9998532,0.000014016917,0.000010996956,0.000026687076,0.000006033632,0.000017550175,6.299896e-7,0.000013122771,0.000057756908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941784,0.00006742109,0.00017147134,0.00008679389,0.000110741166,0.00014573592],"domain_scores_gemma":[0.9994508,0.00023575702,0.000023440123,0.00025298796,0.000013156777,0.00002386334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034232088,0.000093933624,0.00014223225,0.00005272441,0.000029267225,0.00000925943,0.00019236314,0.000046730627,0.0000399608],"category_scores_gemma":[0.00003524886,0.000070984446,0.000045953726,0.0001850275,0.000040264127,0.000043734126,0.000012677476,0.00013687687,0.00006623988],"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.000009619441,0.000042341064,0.0010902409,0.000025051051,0.00001359036,0.0000020261446,0.0006195372,0.0021900302,0.0024507963,0.99270326,0.0005017456,0.00035174505],"study_design_scores_gemma":[0.0021049567,0.00036111078,0.016332822,0.0005097199,0.000025464804,0.000014859241,0.0009940097,0.020408759,0.08717328,0.8663541,0.005039204,0.0006817244],"about_ca_topic_score_codex":0.000012113371,"about_ca_topic_score_gemma":0.000012666484,"teacher_disagreement_score":0.1263492,"about_ca_system_score_codex":0.000028816385,"about_ca_system_score_gemma":0.0000053157664,"threshold_uncertainty_score":0.28946617},"labels":[],"label_agreement":null},{"id":"W128047091","doi":"10.1007/s10623-015-0045-y","title":"Unreal $$BH(n,6)$$ B H ( n , 6 ) ’s and Hadamard matrices","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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; University of Warwick","keywords":"Hadamard transform; Hadamard matrix; Combinatorics; Order (exchange); Mathematics; Matrix (chemical analysis); Integer (computer science); Root of unity; Complex Hadamard matrix; Physics; Computer science; Chemistry; Mathematical analysis; Quantum mechanics","score_opus":0.02497924002193775,"score_gpt":0.20941996251118505,"score_spread":0.1844407224892473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128047091","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.9522865,0.014327983,0.019397983,0.000040101575,0.0004087235,0.00022720786,0.00002470153,0.00045794042,0.012828903],"genre_scores_gemma":[0.9979124,0.0006439687,0.0012758865,0.000038059552,0.00006485907,0.000020694828,0.000005073845,0.000022913786,0.000016112988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926883,0.000050992778,0.00015929979,0.00017158964,0.0001217038,0.0002275949],"domain_scores_gemma":[0.99953324,0.0000587289,0.000022755501,0.00013869542,0.000029755654,0.00021680996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027674803,0.00017436645,0.00020022239,0.00018708144,0.00007764312,0.000104701256,0.00008062599,0.000086046166,0.000008485213],"category_scores_gemma":[0.000006022511,0.00015489839,0.00005401614,0.00028472036,0.00009585499,0.00013223424,0.000019152641,0.000092326125,0.0000061057644],"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.00045235574,0.00022778173,0.20474316,0.0015314765,0.0014113788,0.0001901891,0.012754936,0.001886738,0.019058011,0.6039054,0.070605054,0.083233565],"study_design_scores_gemma":[0.009868149,0.002362487,0.07616283,0.0008290734,0.00087494566,0.00095289934,0.019207152,0.03087945,0.009980381,0.39617977,0.44664156,0.0060612843],"about_ca_topic_score_codex":0.000029656578,"about_ca_topic_score_gemma":0.000012905095,"teacher_disagreement_score":0.37603652,"about_ca_system_score_codex":0.0000048298,"about_ca_system_score_gemma":0.0000060287766,"threshold_uncertainty_score":0.6316573},"labels":[],"label_agreement":null},{"id":"W129801080","doi":"10.1007/978-1-4614-4325-4_4","title":"Results in Configuration Ordering","year":2012,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Pairwise comparison; Intersection (aeronautics); Configuration design; Block (permutation group theory); Set (abstract data type); Graph; Mathematics; Computer science; Combinatorics; Engineering","score_opus":0.023085923475904855,"score_gpt":0.21207550350084978,"score_spread":0.18898958002494493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129801080","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067439093,0.0010239223,0.0007230032,0.000005123842,0.00043415392,0.00037589404,0.000016737748,0.00015624432,0.99659055],"genre_scores_gemma":[0.5568735,0.0004453009,0.0019732532,0.000023138951,0.00049531326,0.00010356493,0.000096659016,0.00040577387,0.43958348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986868,0.000011197366,0.0007425483,0.00015344078,0.0001570393,0.00024900545],"domain_scores_gemma":[0.9993351,0.00009697632,0.000116601404,0.00038556042,0.000018313072,0.00004741793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048128524,0.00029768216,0.0004333431,0.00026273596,0.000017528659,0.000026837295,0.00016219802,0.0003587802,0.00008160913],"category_scores_gemma":[0.000029104656,0.00031496762,0.000067149114,0.000029935945,0.000035864312,0.00007811601,0.00002252082,0.00042592696,0.00020486077],"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.000009316097,0.000020708392,0.0000046451,0.0014346387,0.000038818296,0.000030144163,0.004232547,0.0013445725,0.00037823076,0.98885006,0.0004458078,0.0032105176],"study_design_scores_gemma":[0.0015460725,0.000048949827,0.000040042145,0.00745287,0.000074991985,0.000059726364,0.00048418157,0.01372164,0.0013151206,0.79267913,0.18072763,0.0018496399],"about_ca_topic_score_codex":0.0000018733117,"about_ca_topic_score_gemma":0.000038771475,"teacher_disagreement_score":0.557007,"about_ca_system_score_codex":0.00010066966,"about_ca_system_score_gemma":0.000011308446,"threshold_uncertainty_score":0.99993026},"labels":[],"label_agreement":null},{"id":"W130025484","doi":"","title":"Extended Mendelsohn Triple Systems Having a Prescribed Number of Blocks in Common.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.011795918517392368,"score_gpt":0.21405103025219924,"score_spread":0.20225511173480687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130025484","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.9715058,0.001330851,0.000011205636,0.0000069492867,0.0027806405,0.00033396974,0.000008630819,0.00020221728,0.023819732],"genre_scores_gemma":[0.999289,0.000031253574,0.000016347998,0.0000040622276,0.0000093141025,0.00006907697,0.0000031894187,0.00003928594,0.0005384813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859387,0.00012700506,0.0005457462,0.00018597103,0.00021619938,0.00033122223],"domain_scores_gemma":[0.99930215,0.000085087464,0.00007499396,0.00041993975,0.000036314923,0.00008149696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033974354,0.000199175,0.0004485675,0.000120220895,0.000040114966,0.000029257175,0.0002616055,0.00013883346,0.00013035712],"category_scores_gemma":[0.000018063154,0.00021204773,0.00008654288,0.00038832694,0.000036035122,0.00014355949,0.000033676864,0.0002228461,0.00004588834],"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.000052339365,0.00072238996,0.0411045,0.00088277884,0.0003015751,0.00011851782,0.0051250793,0.003912284,0.007207517,0.92627513,0.0128230555,0.0014748148],"study_design_scores_gemma":[0.017703092,0.00043484732,0.021624936,0.002660382,0.00024779633,0.0003848744,0.0045608035,0.40920347,0.022216458,0.50441957,0.013100104,0.0034436525],"about_ca_topic_score_codex":0.00010528296,"about_ca_topic_score_gemma":0.00000936586,"teacher_disagreement_score":0.42185557,"about_ca_system_score_codex":0.00006321754,"about_ca_system_score_gemma":0.0000043608443,"threshold_uncertainty_score":0.86470556},"labels":[],"label_agreement":null},{"id":"W131130404","doi":"","title":"Subgraphs orthogonal to a 1-factorization of complete bipartite graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Factorization; Complete bipartite graph; Discrete mathematics; Graph; Algorithm","score_opus":0.015412347984693804,"score_gpt":0.19371870108837577,"score_spread":0.17830635310368198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131130404","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.9931284,0.00026376496,0.000331479,0.000018602752,0.0019905143,0.00019304722,0.000024282379,0.00021117536,0.0038386974],"genre_scores_gemma":[0.99980116,0.000022607168,0.00004210296,0.000020916694,0.000006566807,0.000021996644,0.00000963505,0.000028322056,0.00004669816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990815,0.0000453536,0.00029451883,0.0001499003,0.0001956979,0.00023301676],"domain_scores_gemma":[0.99945647,0.000046553116,0.00004166587,0.0002754868,0.00006041285,0.00011942044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012790918,0.00015089601,0.00022413499,0.00020753966,0.0000509894,0.000017382465,0.0001710129,0.00006879057,0.00015307359],"category_scores_gemma":[0.000017203556,0.00015973595,0.000096356445,0.0007391627,0.000032821634,0.00010344359,0.000018229892,0.00009192254,0.000108772554],"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.000008919945,0.000066524924,0.017829942,0.00008200376,0.00007444059,0.000003892817,0.0007598027,0.0007211997,0.020214144,0.95715773,0.00261594,0.00046547028],"study_design_scores_gemma":[0.0024452908,0.0005284404,0.05714015,0.00027310097,0.00009175324,0.000022055752,0.00020128993,0.0100553,0.024301818,0.87518644,0.028414179,0.0013401771],"about_ca_topic_score_codex":0.0000062706204,"about_ca_topic_score_gemma":0.0000045987117,"teacher_disagreement_score":0.08197127,"about_ca_system_score_codex":0.000015474703,"about_ca_system_score_gemma":0.000002422817,"threshold_uncertainty_score":0.6513843},"labels":[],"label_agreement":null},{"id":"W131723753","doi":"","title":"Maximal-clique Partitions of Different Sizes.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics","score_opus":0.006993031492048129,"score_gpt":0.19831261128887817,"score_spread":0.19131957979683004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131723753","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.9866067,0.00022973197,0.000037847236,0.00005085224,0.00091346406,0.00009808611,0.000006910904,0.0001733727,0.011882996],"genre_scores_gemma":[0.9997418,0.000027366488,0.00002794712,0.000013553508,0.000012787691,0.000028792947,0.0000045156166,0.000018808621,0.00012442977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994191,0.00003001142,0.00021126276,0.00008543866,0.00009192685,0.00016224779],"domain_scores_gemma":[0.9996252,0.000043596076,0.00002611497,0.0002217653,0.000023286188,0.000060029703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078325706,0.00010598649,0.00016867221,0.00004764096,0.000033005686,0.000009131589,0.000111290705,0.00006013814,0.0001296565],"category_scores_gemma":[0.000009073687,0.000101590245,0.00007383014,0.000103906386,0.000030825282,0.00007250498,0.000014615461,0.00009511261,0.000072467476],"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.000005337917,0.00010678199,0.0024145653,0.000059525028,0.000043640208,0.0000018471604,0.00026346787,0.0006516929,0.005258083,0.9885087,0.0021517426,0.00053461705],"study_design_scores_gemma":[0.0011958505,0.00011190611,0.01626691,0.00011500219,0.00004547915,0.000011259729,0.00012341778,0.0023322238,0.11433357,0.8537962,0.011225857,0.0004423249],"about_ca_topic_score_codex":0.000002805547,"about_ca_topic_score_gemma":0.0000058577207,"teacher_disagreement_score":0.1347125,"about_ca_system_score_codex":0.000027148548,"about_ca_system_score_gemma":0.0000042742595,"threshold_uncertainty_score":0.414273},"labels":[],"label_agreement":null},{"id":"W13196732","doi":"10.1001/archinte.1954.00250030159019","title":"Minimal Enclosings of Triple Systems I: Adding One Point.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Triple point; Point (geometry); Geometry; Physics","score_opus":0.009213134216822294,"score_gpt":0.19176774308390987,"score_spread":0.18255460886708758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13196732","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.953327,0.0014253259,0.00006213838,0.000003563299,0.0054598157,0.00022244554,0.000008445658,0.00019281168,0.039298464],"genre_scores_gemma":[0.9995953,0.0000147185765,0.00008254688,0.000003993286,0.000009439732,0.000023062958,0.0000032359296,0.000035302033,0.00023240945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893856,0.00009651369,0.00036873925,0.00014675804,0.00018520761,0.00026422387],"domain_scores_gemma":[0.99944544,0.00007622101,0.00006930222,0.00027637553,0.000050973456,0.00008167422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043787333,0.0001546202,0.00031826395,0.00010815574,0.000054052754,0.0000263953,0.00015148771,0.00010385826,0.000044446013],"category_scores_gemma":[0.000061567756,0.00017020322,0.000086068285,0.00029686402,0.00003600653,0.00012932293,0.000011751527,0.0001280131,0.00003804488],"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.000008286647,0.000055005945,0.00075943023,0.00021567853,0.00007642667,0.000004258868,0.00038424542,0.00014239628,0.017817754,0.9788528,0.0016319618,0.00005173275],"study_design_scores_gemma":[0.009777508,0.0009830324,0.0023876475,0.002219953,0.0003446427,0.00019737752,0.00555588,0.007183967,0.37133622,0.5230172,0.0741641,0.0028324747],"about_ca_topic_score_codex":0.000014337606,"about_ca_topic_score_gemma":4.982481e-7,"teacher_disagreement_score":0.4558356,"about_ca_system_score_codex":0.00004259838,"about_ca_system_score_gemma":0.000013572433,"threshold_uncertainty_score":0.6940686},"labels":[],"label_agreement":null},{"id":"W132979487","doi":"","title":"The uniqueness of the generalized quadrangle of order 5 with an axis of symmetry.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Uniqueness; Quadrangle; Mathematics; Symmetry (geometry); Order (exchange); Pure mathematics; Geometry; Mathematical analysis; Geology; Geomorphology","score_opus":0.007763172392274823,"score_gpt":0.1928783009272191,"score_spread":0.18511512853494427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132979487","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.99753255,0.000331736,0.000026993635,0.000010492331,0.0005486916,0.00015672405,0.0000050035665,0.00002834268,0.001359469],"genre_scores_gemma":[0.9998077,0.00003701514,0.000050065308,0.00000346318,0.0000030187525,0.000010940321,0.00000112006,0.00001924386,0.00006738987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924576,0.00013139957,0.0002483167,0.000074876174,0.0001783817,0.00012126335],"domain_scores_gemma":[0.99916965,0.00008332997,0.00009616659,0.0004949555,0.00012920926,0.000026665017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023042422,0.00009892809,0.00021490583,0.00003226913,0.00007669869,0.0000030576832,0.0003172392,0.00005208548,0.0000067233022],"category_scores_gemma":[0.000018396577,0.000055553115,0.000058499332,0.0004586445,0.00018785457,0.00005338209,0.000019406401,0.00006635075,4.3541172e-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.00008965522,0.00010194543,0.015239047,0.00013962573,0.00015244179,0.000001793379,0.0013339446,0.0012586381,0.012656845,0.9686669,0.0001810666,0.00017811],"study_design_scores_gemma":[0.0045010797,0.00081199507,0.03746518,0.0003061283,0.00012088271,0.000055039407,0.0013993377,0.0025155812,0.6918279,0.25783736,0.002573691,0.00058583025],"about_ca_topic_score_codex":0.00012734054,"about_ca_topic_score_gemma":0.000028801698,"teacher_disagreement_score":0.71082956,"about_ca_system_score_codex":0.000009456465,"about_ca_system_score_gemma":0.000026412541,"threshold_uncertainty_score":0.22653903},"labels":[],"label_agreement":null},{"id":"W134208412","doi":"10.1016/s1571-0661(05)80556-0","title":"Preface","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Library science; Humanities; Association (psychology); Geography; Computer science; Epistemology; Philosophy","score_opus":0.005233163918159997,"score_gpt":0.1923543362941889,"score_spread":0.1871211723760289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134208412","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.53627753,0.0009741766,0.4490795,0.00014890388,0.0006337953,0.00018812268,6.916096e-7,0.00038325522,0.0123140495],"genre_scores_gemma":[0.99889755,0.000024868536,0.0009309737,0.00005375076,0.00006742987,0.000008050195,1.4991285e-7,0.0000111972895,0.0000060233956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985777,0.000044525543,0.00016976573,0.00026312936,0.00023046673,0.0007143829],"domain_scores_gemma":[0.99943,0.000151791,0.0000103516795,0.00030376564,0.00001759106,0.00008650777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006550319,0.00012430373,0.00012900207,0.00012966638,0.00008617171,0.00006723297,0.00058245694,0.000043516502,0.00021526079],"category_scores_gemma":[0.000036796235,0.00011093184,0.000034386725,0.0007762095,0.0008093827,0.00016941926,0.00006556027,0.00027323246,0.00013398788],"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.0000015641803,0.000018691428,0.00009366276,0.000007869749,0.0000025281506,0.0000035411542,0.00025157258,0.0057202163,0.0009898739,0.9744032,0.000014183493,0.018493082],"study_design_scores_gemma":[0.00014658665,0.00008767534,0.00016374078,0.000022901613,0.0000017081459,0.000025136116,0.0000024857973,0.8059199,0.009265834,0.18386127,0.00031692363,0.00018581505],"about_ca_topic_score_codex":5.972246e-7,"about_ca_topic_score_gemma":0.0000015924388,"teacher_disagreement_score":0.8001997,"about_ca_system_score_codex":0.00010814404,"about_ca_system_score_gemma":0.000011245243,"threshold_uncertainty_score":0.45236692},"labels":[],"label_agreement":null},{"id":"W134708599","doi":"","title":"A note on integral sum crowns.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006871076022382889,"score_gpt":0.2045657210963019,"score_spread":0.197694645073919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134708599","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.9010694,0.00014313369,0.000047179852,0.000014986872,0.005278132,0.000106683896,0.000002371672,0.00030853797,0.09302959],"genre_scores_gemma":[0.99953645,0.0000059330605,0.000028816832,0.00004210289,0.0000070893566,0.000017017644,0.0000020360785,0.000030084417,0.00033044905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931586,0.000058175236,0.00014586089,0.00012904355,0.00011314526,0.00023789634],"domain_scores_gemma":[0.99956447,0.000056402274,0.000015665513,0.0002690087,0.000018625047,0.00007583479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018853426,0.00014476094,0.00014844768,0.00006602777,0.000054434662,0.000027996415,0.00012599365,0.00008528485,0.00007148806],"category_scores_gemma":[0.00004076649,0.00013693291,0.000071350216,0.00018059037,0.00002425825,0.00006330285,0.0000064994047,0.00019502614,0.00034975883],"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.000005622211,0.000029763856,0.00040901298,0.000018171788,0.000018811177,0.000009937402,0.0001995128,0.00013957068,0.0009452901,0.99484897,0.00305951,0.00031582447],"study_design_scores_gemma":[0.0013024234,0.00017294778,0.0009870245,0.00009731158,0.000018314215,0.000020794301,0.00015840937,0.00063593365,0.037902508,0.86920834,0.088962466,0.000533538],"about_ca_topic_score_codex":0.000004647557,"about_ca_topic_score_gemma":0.0000023457815,"teacher_disagreement_score":0.12564065,"about_ca_system_score_codex":0.000042937107,"about_ca_system_score_gemma":0.0000083712575,"threshold_uncertainty_score":0.5583962},"labels":[],"label_agreement":null},{"id":"W134742427","doi":"10.1023/a:1025729310932","title":"Construction of Symmetric Balanced Squares with Blocksize More than One","year":2003,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Correctness; Generalization; Combinatorics; Element (criminal law); Mathematics; Order (exchange); Square (algebra); Latin square; Computer science; Algorithm; Geometry; Mathematical analysis; Chemistry","score_opus":0.009850491808335369,"score_gpt":0.1851121763869151,"score_spread":0.17526168457857974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134742427","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.95932364,0.0018203281,0.03421866,0.000004378919,0.00009302946,0.00018666117,0.000015505506,0.0001294589,0.0042083496],"genre_scores_gemma":[0.99371856,0.00020085683,0.006012114,0.0000071109016,0.000012951476,0.000022282306,0.0000032796715,0.00001928441,0.0000035342355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929994,0.000053841326,0.00018048682,0.00014698751,0.00013329324,0.00018547666],"domain_scores_gemma":[0.9996111,0.00006320386,0.000047486414,0.00016432912,0.000044357934,0.00006955583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013688626,0.00015456618,0.00024669824,0.0003123445,0.00006392374,0.00002421483,0.000059198075,0.000069827154,0.000018926892],"category_scores_gemma":[0.0000070082096,0.00013195362,0.00006992273,0.00088444183,0.00016107157,0.00006708387,0.000003420081,0.000080387086,7.0975136e-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.00014236104,0.00013003059,0.15338795,0.0006693805,0.00071107334,0.000009730926,0.0009037863,0.0014374526,0.04070285,0.7959793,0.00011623866,0.00580982],"study_design_scores_gemma":[0.012768023,0.0040482217,0.22755757,0.0022103516,0.0014050386,0.0008405619,0.021305393,0.006690793,0.53478324,0.17477317,0.0085981805,0.0050194524],"about_ca_topic_score_codex":0.000009868483,"about_ca_topic_score_gemma":0.0000044887893,"teacher_disagreement_score":0.62120616,"about_ca_system_score_codex":0.000003867933,"about_ca_system_score_gemma":0.0000059153767,"threshold_uncertainty_score":0.53809124},"labels":[],"label_agreement":null},{"id":"W135015279","doi":"","title":"Classification of Optimal Linear Z4 Rate 1/2 Codes of Length <= 8.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01200983823082374,"score_gpt":0.22912365217522115,"score_spread":0.2171138139443974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135015279","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.9940481,0.00015621519,0.0005267504,0.0000039163915,0.0009337299,0.000093257746,0.000005626212,0.00007608159,0.0041563283],"genre_scores_gemma":[0.99974734,0.0000142998815,0.00016265687,0.0000019917816,0.00000808252,0.0000031919049,0.0000061507662,0.000017033344,0.00003927225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999315,0.000036100486,0.00031991486,0.00008522764,0.00010240682,0.00014131397],"domain_scores_gemma":[0.9994873,0.0001094865,0.00007599911,0.00021773991,0.00006875379,0.000040750623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640588,0.000089655965,0.00018558673,0.00008187881,0.000020460522,0.0000033814797,0.00012738432,0.00007907639,0.0000127008725],"category_scores_gemma":[0.000027476794,0.00009196503,0.00005479685,0.00020918122,0.00004958089,0.000066679175,0.000010501312,0.000086167944,0.000010861272],"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.000040649153,0.00007271597,0.0042623985,0.00016685751,0.00006948538,0.000002151295,0.0005715997,0.0013533094,0.15894815,0.8337629,0.00019303699,0.00055672653],"study_design_scores_gemma":[0.0018660672,0.0002907102,0.07937274,0.00018882571,0.000067844696,0.000006679111,0.00122526,0.022395195,0.8220403,0.069544226,0.0025210427,0.0004811051],"about_ca_topic_score_codex":0.000007154466,"about_ca_topic_score_gemma":0.000001731647,"teacher_disagreement_score":0.7642187,"about_ca_system_score_codex":0.0000188445,"about_ca_system_score_gemma":0.00000783813,"threshold_uncertainty_score":0.3750225},"labels":[],"label_agreement":null},{"id":"W135039823","doi":"","title":"Minimal Enclosings of Triple Systems II: Increasing The Index By 1.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Statistics; Computer science","score_opus":0.0051966860520873195,"score_gpt":0.1834440522645888,"score_spread":0.17824736621250148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135039823","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.98307616,0.0022064375,0.00003303697,0.000008103822,0.0034505778,0.00021684058,0.0000073832034,0.000108103464,0.01089334],"genre_scores_gemma":[0.9997102,0.000013825886,0.0000073119704,0.000008318208,0.0000074479144,0.000023204044,0.0000026716548,0.000029545356,0.00019744915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988947,0.0002131993,0.00032630155,0.00012707364,0.0001967477,0.00024197924],"domain_scores_gemma":[0.99939054,0.000127872,0.00007409476,0.00030579075,0.00004217367,0.000059505226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007596741,0.00015473235,0.00024269713,0.000054582575,0.00015145105,0.00003321079,0.00021744774,0.00010155743,0.000014739214],"category_scores_gemma":[0.000077426135,0.00012551222,0.0000715702,0.00029950961,0.000065048574,0.00009736959,0.000020295314,0.00015785087,0.000008739223],"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.000027472855,0.00009027739,0.008321655,0.00016701514,0.00013007992,0.0000034737354,0.0012285735,0.00024852104,0.026644645,0.9514091,0.011619585,0.00010957949],"study_design_scores_gemma":[0.010868173,0.0010656349,0.0075249164,0.0013074707,0.00037153915,0.00045985662,0.010294575,0.018702483,0.21320188,0.39195895,0.34107336,0.0031711794],"about_ca_topic_score_codex":0.00008132238,"about_ca_topic_score_gemma":7.936001e-7,"teacher_disagreement_score":0.5594502,"about_ca_system_score_codex":0.00003568414,"about_ca_system_score_gemma":0.0000151052545,"threshold_uncertainty_score":0.51182395},"labels":[],"label_agreement":null},{"id":"W13527032","doi":"","title":"Norms of circulant and semicirculant matrices and Horadams sequence.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Sequence (biology); Combinatorics; Genetics; Biology","score_opus":0.008280693447397824,"score_gpt":0.20718506679663845,"score_spread":0.19890437334924063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13527032","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.99534297,0.002497008,0.000034702392,0.000005039721,0.0005762988,0.00009876095,0.000005630716,0.00008004847,0.0013595471],"genre_scores_gemma":[0.99973893,0.00019056941,0.000027497452,0.000006491548,0.0000063272983,0.0000023123455,0.0000026964065,0.00001504784,0.000010149102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993712,0.000010754194,0.00020723006,0.00011942425,0.000107950415,0.0001834542],"domain_scores_gemma":[0.999657,0.000063553554,0.00003812594,0.00014108104,0.000021061293,0.000079174475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003657421,0.00011277585,0.00018953954,0.00008334291,0.0000367332,0.000015519809,0.00007530717,0.000072794144,0.000004381541],"category_scores_gemma":[0.000007984181,0.000102380785,0.00002497869,0.00015546501,0.00006185732,0.0000817688,0.000019648189,0.00008600703,0.0000026884952],"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.000026866632,0.00005120613,0.08570719,0.00088363315,0.00017868471,0.00010079047,0.0021965925,0.00006745737,0.20445277,0.70014733,0.00025283505,0.0059346748],"study_design_scores_gemma":[0.003320582,0.0003694065,0.15070528,0.0006718913,0.00018151192,0.0008789987,0.0029437528,0.0043414305,0.103603534,0.72801644,0.0033841594,0.0015830282],"about_ca_topic_score_codex":0.000036949627,"about_ca_topic_score_gemma":0.000004026094,"teacher_disagreement_score":0.10084924,"about_ca_system_score_codex":0.000015716,"about_ca_system_score_gemma":0.0000046141668,"threshold_uncertainty_score":0.4174967},"labels":[],"label_agreement":null},{"id":"W137609861","doi":"","title":"The spectra for two classes of graph designs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.017811495597468672,"score_gpt":0.2180627641014866,"score_spread":0.20025126850401792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137609861","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.96813273,0.0041588936,0.00084241247,0.000090873036,0.005344998,0.0005996337,0.000010430545,0.00030762958,0.020512417],"genre_scores_gemma":[0.9996157,0.000089022455,0.00006208241,0.000005899167,0.000011732017,0.000043433338,8.1869143e-7,0.000021423022,0.00014988288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941653,0.000032168908,0.00018397797,0.00008245761,0.000088273184,0.00019661018],"domain_scores_gemma":[0.99938923,0.00027008122,0.000032463093,0.00023971421,0.00003261818,0.00003586578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020927322,0.00009790831,0.00013271133,0.000037298018,0.00010021676,0.000021631526,0.00019273945,0.000038177248,0.000018392248],"category_scores_gemma":[0.000023177692,0.00007619393,0.0000955311,0.00016789728,0.000050729435,0.00005366672,0.0000072175535,0.00006628653,0.000015067169],"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.0000058902447,0.000022482887,0.00016910955,0.000038946997,0.000055393455,7.9971164e-7,0.00015595104,0.0001447034,0.003731269,0.9885359,0.006458304,0.00068124215],"study_design_scores_gemma":[0.0009601398,0.00011663285,0.00025805022,0.00003120885,0.00002788219,0.0000049800146,0.00015354618,0.0035979415,0.036385074,0.9451937,0.013075208,0.00019562716],"about_ca_topic_score_codex":0.0000027362319,"about_ca_topic_score_gemma":0.0000031950465,"teacher_disagreement_score":0.0433422,"about_ca_system_score_codex":0.000012006802,"about_ca_system_score_gemma":0.0000023942089,"threshold_uncertainty_score":0.3107098},"labels":[],"label_agreement":null},{"id":"W13813071","doi":"","title":"The intersection problem for twin bowtie and near bowtie systems.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Mathematics; Geography; Cartography","score_opus":0.006539774111095832,"score_gpt":0.193649324619739,"score_spread":0.18710955050864317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13813071","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.9865179,0.0016896921,0.00030956304,0.000048845253,0.005420874,0.00063613616,0.0000036421438,0.00027756917,0.0050957897],"genre_scores_gemma":[0.999324,0.000050460814,0.00002275441,0.000007296557,0.000026312055,0.00016950944,0.0000029489772,0.000030649688,0.00036607028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.00004509618,0.00020556299,0.00013169472,0.00008501059,0.00024088736],"domain_scores_gemma":[0.9995585,0.000117448115,0.000034748755,0.00019215269,0.000038905542,0.000058231755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000376924,0.00012875606,0.00013803439,0.000024249905,0.00026882364,0.00019316771,0.00011798149,0.00007596519,0.0000022612635],"category_scores_gemma":[0.00001603837,0.00010217108,0.00004904892,0.00012220984,0.00004860748,0.00011309413,0.000016796119,0.0001054282,0.000013238514],"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.000053760188,0.000021440026,0.0012494195,0.0002008146,0.00010861635,0.0000037580614,0.0007154782,0.00062091305,0.0005846252,0.9865583,0.007576181,0.0023066925],"study_design_scores_gemma":[0.0024797246,0.0004156145,0.0010636793,0.0002720718,0.00007417226,0.0001443843,0.002312682,0.06228362,0.00074116647,0.54186755,0.38768646,0.0006588846],"about_ca_topic_score_codex":0.000023488616,"about_ca_topic_score_gemma":0.000006049355,"teacher_disagreement_score":0.44469076,"about_ca_system_score_codex":0.000049050013,"about_ca_system_score_gemma":0.000007927942,"threshold_uncertainty_score":0.41664156},"labels":[],"label_agreement":null},{"id":"W139510642","doi":"","title":"Small 2-factors of Bipartite Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Graph","score_opus":0.014788959360586332,"score_gpt":0.19352386450597928,"score_spread":0.17873490514539295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139510642","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.9881443,0.00034586803,0.000014592174,0.000004610463,0.0020484468,0.000082426406,0.0000029404957,0.000202218,0.009154643],"genre_scores_gemma":[0.99979156,0.00004789717,0.000012460636,0.000005021564,0.000003927058,0.0000071157247,0.0000039919632,0.00002359682,0.000104398605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936,0.000029687006,0.00021304016,0.00010049136,0.0000949077,0.0002018524],"domain_scores_gemma":[0.99956393,0.000047352914,0.000032595843,0.00025589054,0.000028407301,0.000071822455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012668886,0.00012525059,0.00018728344,0.00010279962,0.000031971143,0.000010360694,0.00015970279,0.00007158621,0.00005221963],"category_scores_gemma":[0.000011975387,0.000120384335,0.00009067322,0.00034656381,0.000036306854,0.00006599773,0.000013965552,0.0000910771,0.00003067288],"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.000010445328,0.00006238254,0.12666582,0.000075049866,0.00009003323,0.000010468397,0.00051154615,0.0003276576,0.0073606363,0.86378855,0.0007403396,0.00035706637],"study_design_scores_gemma":[0.0012562709,0.00017273318,0.06475276,0.00012212343,0.000055443015,0.000017318062,0.00038613976,0.00078576244,0.055327047,0.8600752,0.016415205,0.0006340253],"about_ca_topic_score_codex":0.000019280038,"about_ca_topic_score_gemma":0.0000063301527,"teacher_disagreement_score":0.061913066,"about_ca_system_score_codex":0.000012153325,"about_ca_system_score_gemma":0.000004411433,"threshold_uncertainty_score":0.49091306},"labels":[],"label_agreement":null},{"id":"W140062478","doi":"","title":"On c-Hadamard matrices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Mathematics; Mathematical analysis","score_opus":0.00753535808064969,"score_gpt":0.17903196736818489,"score_spread":0.17149660928753518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140062478","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.882383,0.00070609275,0.0000071023246,0.000025892738,0.003435735,0.00008947268,0.000002222725,0.0004355659,0.11291495],"genre_scores_gemma":[0.9992487,0.000042517957,0.000008194082,0.000040782455,0.000010523082,0.000013324257,0.0000011958966,0.000026165151,0.00060858956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942,0.000024349616,0.00012808573,0.00010816003,0.00012721265,0.00019222064],"domain_scores_gemma":[0.999604,0.000058620826,0.000015098512,0.00024535973,0.000011790873,0.00006511471],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008458391,0.0001162864,0.000121646175,0.000069412956,0.000049594986,0.0000263231,0.00014536468,0.00006477859,0.00036117356],"category_scores_gemma":[0.000010931598,0.00011539546,0.000054040695,0.00019929136,0.000013999559,0.00006562181,0.000009706836,0.0001252215,0.0014019015],"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.0000026795885,0.000040222087,0.00022720061,0.000031692973,0.000028832354,0.000015714339,0.00016063073,0.0003794145,0.00021721196,0.9480665,0.049710575,0.0011193469],"study_design_scores_gemma":[0.0014205837,0.00017814247,0.0009522161,0.000094543495,0.000026145595,0.00002019378,0.0000738525,0.010442772,0.0030926608,0.9238189,0.05922871,0.00065126334],"about_ca_topic_score_codex":0.0000019993522,"about_ca_topic_score_gemma":3.310048e-7,"teacher_disagreement_score":0.11686574,"about_ca_system_score_codex":0.00002839238,"about_ca_system_score_gemma":9.3505776e-7,"threshold_uncertainty_score":0.99937564},"labels":[],"label_agreement":null},{"id":"W140290324","doi":"","title":"Generalized Steiner Triple Systems with Group Size g = 7, 8.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Group (periodic table); Steiner tree problem; Combinatorics; Pure mathematics; Physics","score_opus":0.004838672456518819,"score_gpt":0.17559055662067116,"score_spread":0.17075188416415235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140290324","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.9751483,0.0009926675,0.000014638495,0.000009828234,0.0023623426,0.00031723952,0.0000069824678,0.0005570005,0.02059096],"genre_scores_gemma":[0.995861,0.0000397399,0.000041652675,0.000021559661,0.0000309205,0.00009449906,0.000008728538,0.000062654886,0.0038392725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889785,0.000092022616,0.00026144675,0.00020327924,0.00021051751,0.0003348595],"domain_scores_gemma":[0.9993675,0.00006092317,0.00002773286,0.00039872868,0.000025907559,0.00011926129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020237558,0.00022730073,0.00030897863,0.000044617787,0.00008519555,0.00007252923,0.00020316904,0.00010247491,0.00032136822],"category_scores_gemma":[0.0000054709503,0.00018997736,0.000065832806,0.00030275792,0.000034394227,0.00015007846,0.000007801913,0.00014296411,0.00021296907],"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.00020240269,0.0001472732,0.0015985455,0.00027267312,0.00036894128,0.00009396264,0.00057480426,0.010895727,0.0038470975,0.96689916,0.013597712,0.001501728],"study_design_scores_gemma":[0.03807812,0.0020550378,0.009421643,0.0011337337,0.0004899885,0.0006079815,0.0012095917,0.051952258,0.006317209,0.2078104,0.675039,0.0058850483],"about_ca_topic_score_codex":0.000056118173,"about_ca_topic_score_gemma":0.000004783023,"teacher_disagreement_score":0.75908875,"about_ca_system_score_codex":0.000041537824,"about_ca_system_score_gemma":0.0000074325503,"threshold_uncertainty_score":0.77470523},"labels":[],"label_agreement":null},{"id":"W14142706","doi":"","title":"The Doyen-Wilson Theorem for Extended Directed Triple Systems.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006816897687461571,"score_gpt":0.2122335786978402,"score_spread":0.20541668101037863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14142706","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.9306448,0.0064257015,0.0018042052,0.000047986,0.030348804,0.0018576806,0.000025036215,0.0020391515,0.026806606],"genre_scores_gemma":[0.99893785,0.000035306613,0.000025533509,0.000008858665,0.000047687485,0.00011863227,0.000008561929,0.000052708867,0.0007648647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872404,0.00007436222,0.0003629185,0.00017582996,0.00017729722,0.00048555984],"domain_scores_gemma":[0.99870485,0.00062616146,0.000059496848,0.00042364877,0.00008528128,0.000100570585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015181121,0.00019511279,0.00023026374,0.00006482414,0.0003021038,0.00009457459,0.00031109783,0.00012418114,0.000004291021],"category_scores_gemma":[0.00009790417,0.00014434419,0.000119370015,0.0002847296,0.000053466854,0.0000838691,0.000017782479,0.00014688779,0.000027055123],"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.00006483834,0.000025013554,0.00009016694,0.00006690036,0.00008307635,0.0000037126981,0.0001979878,0.00005539229,0.0014829058,0.99060535,0.00540385,0.0019207904],"study_design_scores_gemma":[0.0033167447,0.00022087227,0.0029829808,0.00014453709,0.00007909539,0.00003117541,0.0014057866,0.012530998,0.0129098585,0.7784825,0.18711586,0.0007796103],"about_ca_topic_score_codex":0.0000098648525,"about_ca_topic_score_gemma":0.000008669945,"teacher_disagreement_score":0.21212289,"about_ca_system_score_codex":0.00006877836,"about_ca_system_score_gemma":0.000010629056,"threshold_uncertainty_score":0.5886185},"labels":[],"label_agreement":null},{"id":"W142381885","doi":"","title":"On k-arcs Covering a Line in Finite Projective Planes.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective test; Line (geometry); Projective line; Projective plane; Pure mathematics; Geometry; Projective space","score_opus":0.00904422544584932,"score_gpt":0.2066362370154323,"score_spread":0.19759201156958298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142381885","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.98229176,0.00011360659,0.00004345093,0.0000099751405,0.0014466657,0.00019678789,0.000003945184,0.00019725243,0.015696552],"genre_scores_gemma":[0.9997369,0.000029853,0.0000057722814,0.000026548987,0.000011357298,0.000038755585,0.000006136376,0.000026815645,0.00011786068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928445,0.000039550396,0.00017498799,0.00014699821,0.00011380136,0.00024021705],"domain_scores_gemma":[0.9995805,0.00014949778,0.000020109183,0.0001896107,0.000013900866,0.000046379806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017307518,0.00014204034,0.00017188552,0.00014205452,0.000032754622,0.000019933239,0.00011819226,0.00008097208,0.000024404082],"category_scores_gemma":[0.00004089318,0.00014628783,0.000036794325,0.0003431277,0.000015384623,0.00008357401,0.0000150514325,0.00021269808,0.000098884135],"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.00019440221,0.0002196367,0.012307622,0.00012228396,0.00007785115,0.00034076424,0.0023129112,0.050898712,0.0010048517,0.9305062,0.00067674293,0.0013379868],"study_design_scores_gemma":[0.005594117,0.0006998858,0.017796667,0.00066782197,0.000023354054,0.00007314229,0.00063287606,0.056991555,0.005081674,0.9008366,0.010380347,0.0012219973],"about_ca_topic_score_codex":0.000029386294,"about_ca_topic_score_gemma":0.00001942908,"teacher_disagreement_score":0.029669674,"about_ca_system_score_codex":0.00006808053,"about_ca_system_score_gemma":0.000008313039,"threshold_uncertainty_score":0.59654444},"labels":[],"label_agreement":null},{"id":"W1430209699","doi":"10.1007/s10623-015-0110-6","title":"Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Lambda; Vertex (graph theory); Graph; Block (permutation group theory); Discrete mathematics; Physics","score_opus":0.029505932804844065,"score_gpt":0.22644484818791555,"score_spread":0.19693891538307148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1430209699","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.9887506,0.0014977092,0.008330244,0.000009256023,0.00017413928,0.00025056585,0.000019120967,0.00012614463,0.00084222],"genre_scores_gemma":[0.99857014,0.0002375461,0.0010947026,0.000021536493,0.000016254591,0.000030124911,0.00000423763,0.000023385455,0.0000020753491],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988963,0.0001243341,0.00033241074,0.00024068334,0.00013657444,0.00026968605],"domain_scores_gemma":[0.9994239,0.00008836664,0.00005642844,0.000206712,0.000060760234,0.0001638087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014462,0.00021382587,0.00035479607,0.00043401337,0.00007226587,0.00003202198,0.00009386654,0.00011270336,0.0000031579348],"category_scores_gemma":[0.000015002861,0.00020650444,0.00009283017,0.00059376936,0.00016228136,0.00012021446,0.000028415545,0.00015547457,0.0000010422713],"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.00088122033,0.00060368143,0.25898156,0.0011694077,0.0008609715,0.00009886241,0.012766349,0.038379323,0.57307476,0.104536235,0.0021725683,0.0064750514],"study_design_scores_gemma":[0.013778277,0.0030617686,0.34001836,0.0022442727,0.000505235,0.0006877143,0.016609974,0.2517943,0.04200855,0.32243404,0.002694365,0.004163152],"about_ca_topic_score_codex":0.0001291982,"about_ca_topic_score_gemma":0.00013627634,"teacher_disagreement_score":0.53106624,"about_ca_system_score_codex":0.000012702881,"about_ca_system_score_gemma":0.0000096811655,"threshold_uncertainty_score":0.8421007},"labels":[],"label_agreement":null},{"id":"W144515280","doi":"","title":"Greedy Defining Sets in Latin Squares.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; Greedy algorithm; Least-squares function approximation; Combinatorics; Mathematical optimization; Statistics; Biology","score_opus":0.011783479061915646,"score_gpt":0.1994339256728513,"score_spread":0.18765044661093563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144515280","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.97955775,0.00047438522,0.0000036572042,0.000008479169,0.0014092325,0.00008428923,0.0000023773239,0.0002268498,0.018232971],"genre_scores_gemma":[0.99979824,0.000019737909,0.0000375738,0.000014699795,0.0000030629685,0.000018649278,0.0000052320747,0.000027069706,0.00007572269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926925,0.00004156834,0.00020680089,0.00012380794,0.00011680948,0.00024178534],"domain_scores_gemma":[0.99964833,0.000061605475,0.000019592677,0.00020109936,0.0000133248905,0.00005604571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015561652,0.0001237729,0.00016976603,0.00014578446,0.000059669004,0.000009947442,0.00013091958,0.00008140393,0.000031695206],"category_scores_gemma":[0.000020127614,0.000136166,0.000042639625,0.00038335522,0.000027711265,0.00009552944,0.000018257046,0.00017403715,0.00018324681],"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.00000965019,0.000049991097,0.12630089,0.00006192939,0.000026419124,0.00016660735,0.002413403,0.0019941938,0.0005343806,0.8651937,0.0025755698,0.00067322],"study_design_scores_gemma":[0.004174441,0.00016821105,0.25870386,0.0003079496,0.000017568074,0.00015128944,0.00063980307,0.013199848,0.003930971,0.7108843,0.0065764985,0.0012452757],"about_ca_topic_score_codex":0.000028918745,"about_ca_topic_score_gemma":0.0000122253705,"teacher_disagreement_score":0.15430948,"about_ca_system_score_codex":0.00003723676,"about_ca_system_score_gemma":0.000009391768,"threshold_uncertainty_score":0.5552688},"labels":[],"label_agreement":null},{"id":"W144967261","doi":"","title":"Minimal 4-Equitability of C2nOK1.","year":2002,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013384184263481709,"score_gpt":0.2057151738129442,"score_spread":0.1923309895494625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144967261","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.94077295,0.004348296,0.000006213756,0.00005843255,0.006953888,0.0002930429,0.000036993646,0.00014173766,0.04738844],"genre_scores_gemma":[0.9990776,0.00009016739,0.000031994277,0.000011235093,0.000028361334,0.000016420418,0.0000036143547,0.000053193467,0.00068742014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784404,0.00020129641,0.0007266472,0.0003565745,0.0003364304,0.000534995],"domain_scores_gemma":[0.9985136,0.00021952628,0.00014591565,0.0008350903,0.000104486804,0.00018139882],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005816669,0.0003356067,0.00059083285,0.000118304335,0.00009098484,0.000033455806,0.00042723987,0.00028281732,0.001496872],"category_scores_gemma":[0.000109535424,0.00037559573,0.00028394695,0.0004788711,0.00017972488,0.00018480048,0.00008770505,0.0003256426,0.00051884976],"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.00003566389,0.00056837103,0.007808082,0.0010470347,0.0002622749,0.00002500287,0.002893443,0.00009921927,0.0050375774,0.97412807,0.006069016,0.0020262299],"study_design_scores_gemma":[0.0063268165,0.0015537319,0.02245353,0.00093462947,0.00048703962,0.00006426981,0.0019205371,0.015767733,0.030973628,0.8939109,0.023253987,0.0023532081],"about_ca_topic_score_codex":0.000030025309,"about_ca_topic_score_gemma":0.0000025253553,"teacher_disagreement_score":0.0802172,"about_ca_system_score_codex":0.00008647271,"about_ca_system_score_gemma":0.00001289822,"threshold_uncertainty_score":0.9998696},"labels":[],"label_agreement":null},{"id":"W1470794575","doi":"","title":"Existence for perfect T(K 1 , k)-triple systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.013800513891207901,"score_gpt":0.216804341998463,"score_spread":0.2030038281072551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1470794575","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.9648998,0.0042683966,0.00030515552,0.0000064971114,0.01784895,0.0005355615,0.000014325683,0.00045712662,0.011664208],"genre_scores_gemma":[0.99922305,0.0000115852545,0.00005672239,0.00000837148,0.00005902177,0.00018667003,0.0000068177696,0.000037960308,0.00040977332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915874,0.000042472242,0.00019069482,0.00010654545,0.00010668867,0.00039486657],"domain_scores_gemma":[0.99945104,0.00009914688,0.000027438253,0.00026523074,0.00003561034,0.00012156084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044111823,0.00014333024,0.0001957029,0.000052837964,0.000088786546,0.00003344705,0.00015946868,0.000085632964,0.0000124260505],"category_scores_gemma":[0.00003177183,0.00014078844,0.000084746884,0.00014050631,0.000019461382,0.00019694588,0.000013890963,0.000085132764,0.00011418873],"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.0000073999136,0.000031049785,0.002547303,0.00024024112,0.000042302163,6.317195e-7,0.0003445171,0.00008715233,0.0010797573,0.98926806,0.0061887014,0.00016285399],"study_design_scores_gemma":[0.006643332,0.00060767314,0.008951609,0.00061524444,0.00028833895,0.00019043326,0.0029958675,0.02765412,0.025249254,0.41351074,0.5100941,0.0031992667],"about_ca_topic_score_codex":0.0000064752217,"about_ca_topic_score_gemma":3.2928205e-7,"teacher_disagreement_score":0.5757573,"about_ca_system_score_codex":0.000046237,"about_ca_system_score_gemma":0.000005667378,"threshold_uncertainty_score":0.5741186},"labels":[],"label_agreement":null},{"id":"W1485965721","doi":"10.1023/a:1012504516447","title":"Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":148,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Crosslight Software (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders","keywords":"Visual cryptography; Computer science; Cryptography; Pixel; Computation; Theoretical computer science; Transparency (behavior); Integer (computer science); Algorithm; Steganography; Discrete mathematics; Mathematics; Image (mathematics); Secret sharing; Artificial intelligence; Computer security","score_opus":0.02859812944527219,"score_gpt":0.20674045132377347,"score_spread":0.1781423218785013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485965721","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.9522416,0.0029711556,0.037652247,0.000008819899,0.00017100215,0.00033332914,0.000065792476,0.0003267962,0.0062292647],"genre_scores_gemma":[0.99538535,0.00039184687,0.0040323674,0.000020669699,0.000057237656,0.00004090739,0.000006420953,0.000057679397,0.0000075105636],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984323,0.0000671717,0.00045034508,0.00035300638,0.00026206466,0.00043513175],"domain_scores_gemma":[0.9992217,0.000088925735,0.00007784411,0.00033620055,0.00010273373,0.00017259139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019245927,0.00039272849,0.0005376563,0.00060278777,0.00014280665,0.00008561933,0.0002057436,0.00017036236,0.00024891764],"category_scores_gemma":[0.0000038492167,0.00033360277,0.00020672772,0.0012896578,0.00040182588,0.0002224539,0.000020081641,0.00020346224,0.000004179958],"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.0006740026,0.00076084764,0.22061595,0.0021469407,0.0038240917,0.00010796846,0.0039236937,0.0015378942,0.3376184,0.3364967,0.001958239,0.09033525],"study_design_scores_gemma":[0.016486475,0.005853328,0.25067782,0.004348962,0.0017994669,0.0011501665,0.012711914,0.039955754,0.5392815,0.094364785,0.021351103,0.01201874],"about_ca_topic_score_codex":0.0000035424396,"about_ca_topic_score_gemma":0.000007012579,"teacher_disagreement_score":0.24213192,"about_ca_system_score_codex":0.0000055946257,"about_ca_system_score_gemma":0.0000050814206,"threshold_uncertainty_score":0.9999116},"labels":[],"label_agreement":null},{"id":"W1488163438","doi":"","title":"Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multileaf collimator; Integer matrix; Context (archaeology); Mathematical optimization; Binary number; Decomposition method (queueing theory); Algorithm; Discrete mathematics; Beam (structure); Symmetric matrix; Nonnegative matrix","score_opus":0.03833592896667294,"score_gpt":0.3791121652766149,"score_spread":0.34077623630994197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488163438","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.964643,0.0010112249,0.030855427,0.00029272266,0.0005700728,0.0012110098,0.000082990424,0.00021570305,0.0011178744],"genre_scores_gemma":[0.99195194,0.0001200078,0.006390081,0.000013740823,0.00034190266,0.0005316558,0.00012899013,0.000041943546,0.00047971975],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989228,0.00010797765,0.00021264155,0.00021379258,0.0002022956,0.00034047855],"domain_scores_gemma":[0.9992488,0.00023625024,0.0000080526825,0.00026200447,0.00013526028,0.00010962472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008423006,0.00012867055,0.00013848799,0.00032970053,0.0007155773,0.00023217224,0.00016746733,0.00012614373,0.00005896326],"category_scores_gemma":[0.000037772326,0.00012446938,0.00004695367,0.00032286183,0.00009486811,0.0002911121,0.000024321018,0.00045413265,0.000034272944],"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.000091572896,0.0002359531,0.0019512626,0.00016409211,0.00035107075,0.000016480344,0.0064924518,0.077287756,0.7357891,0.12830135,0.0041098185,0.045209073],"study_design_scores_gemma":[0.0014788363,0.00025224657,0.0032475782,0.000042538144,0.000013259927,0.00006244058,0.0009279432,0.9651776,0.013160486,0.0037775317,0.011472549,0.00038697486],"about_ca_topic_score_codex":0.00004910001,"about_ca_topic_score_gemma":0.00004914943,"teacher_disagreement_score":0.88788986,"about_ca_system_score_codex":0.000036267516,"about_ca_system_score_gemma":0.00004821315,"threshold_uncertainty_score":0.5503714},"labels":[],"label_agreement":null},{"id":"W148937047","doi":"","title":"On groups with redundancy in multiplication.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplication (music); Arithmetic; Redundancy (engineering); Computer science; Combinatorics; Operating system","score_opus":0.007186927590803211,"score_gpt":0.1793688034782214,"score_spread":0.17218187588741818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148937047","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.97870296,0.00020016584,0.00001601099,0.000028736209,0.0005205959,0.00013614354,0.0000010051607,0.00017730058,0.020217057],"genre_scores_gemma":[0.9997266,0.000013263499,0.000022513612,0.000017030612,0.000004342827,0.000048709302,0.0000017132962,0.000022112888,0.00014369989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994974,0.000023161092,0.00012027168,0.00011884218,0.00008903281,0.00015128088],"domain_scores_gemma":[0.9996427,0.00004708388,0.000015124334,0.00024390197,0.000011109666,0.00004004365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007027354,0.000097815406,0.0001039664,0.00007378113,0.000030502504,0.0000141990695,0.00010410239,0.000047540634,0.00005087434],"category_scores_gemma":[0.000008683712,0.000089564215,0.000019285591,0.0002443679,0.00001741033,0.00007085885,0.0000052423893,0.00012151288,0.00019180168],"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.00000936892,0.000093639486,0.0028800317,0.00002736178,0.000014815132,0.000011683738,0.00057395094,0.0013863886,0.00035208437,0.9923047,0.0015704073,0.000775567],"study_design_scores_gemma":[0.005502462,0.0004714232,0.03310937,0.00042722447,0.000017947736,0.000033584303,0.00030250012,0.032600082,0.00434072,0.9161315,0.0060349596,0.0010282093],"about_ca_topic_score_codex":0.000004105144,"about_ca_topic_score_gemma":0.0000045355155,"teacher_disagreement_score":0.07617319,"about_ca_system_score_codex":0.000036554997,"about_ca_system_score_gemma":0.0000011901487,"threshold_uncertainty_score":0.36523226},"labels":[],"label_agreement":null},{"id":"W1490843286","doi":"10.1007/978-3-642-14031-0_17","title":"Finding Maximum Edge Bicliques in Convex Bipartite Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hospital for Sick Children; Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Complete bipartite graph; Vertex (graph theory); Cardinality (data modeling); Mathematics; Edge-transitive graph; Discrete mathematics; Graph; Computer science; Graph power; Line graph","score_opus":0.01211060963806525,"score_gpt":0.21813808290157072,"score_spread":0.20602747326350546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490843286","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.044511847,0.001881126,0.9282662,0.00011670255,0.009187884,0.0007223223,0.000018273011,0.0005863085,0.0147093395],"genre_scores_gemma":[0.99206305,0.000057164692,0.007250035,0.00017341392,0.00028013973,0.000012612408,0.000004802253,0.0000558884,0.0001029068],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981142,0.000021390702,0.00042236914,0.00059096346,0.00032478498,0.0005262424],"domain_scores_gemma":[0.9989903,0.0002112542,0.000078067664,0.0005663129,0.00004690971,0.000107184525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069717737,0.00040509924,0.0004563326,0.0010914975,0.00009339886,0.0001730411,0.00084000506,0.00045523827,0.000051088507],"category_scores_gemma":[0.000027088243,0.00038669357,0.00010490878,0.00046107362,0.00047468927,0.0002300105,0.00014696483,0.0011693977,0.000045698504],"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.000045289333,0.00008556326,0.00658393,0.0012569086,0.00010693577,0.0007614048,0.009319437,0.15798737,0.042586785,0.1294507,0.00011489385,0.6517008],"study_design_scores_gemma":[0.0004591332,0.000112766684,0.0007383023,0.001627562,0.000013646155,0.000093002,9.226674e-7,0.096110255,0.026710419,0.8637545,0.008823401,0.0015560986],"about_ca_topic_score_codex":0.000015026002,"about_ca_topic_score_gemma":0.0002629175,"teacher_disagreement_score":0.9475512,"about_ca_system_score_codex":0.00008741493,"about_ca_system_score_gemma":0.000058110105,"threshold_uncertainty_score":0.9998585},"labels":[],"label_agreement":null},{"id":"W1491211998","doi":"10.1515/spma-2015-0022","title":"Symmetric Hadamard matrices of order 116and 172 exist","year":2015,"lang":"en","type":"article","venue":"Special Matrices","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; University of Waterloo","funders":"","keywords":"Mathematics; Hadamard transform; Order (exchange); Complex Hadamard matrix; Hadamard's inequality; Hadamard matrix; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis; Business","score_opus":0.015074638710474587,"score_gpt":0.21627885911335382,"score_spread":0.20120422040287922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491211998","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.61565435,0.010279977,0.00020560775,0.000024320496,0.003173692,0.00023517465,0.000033285367,0.0002723196,0.3701213],"genre_scores_gemma":[0.9964622,0.00033673443,0.00040431906,0.000008222004,0.0022244174,0.000010456168,0.0000055158557,0.00003439084,0.0005137281],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988346,0.00004533795,0.00036555016,0.00016306608,0.00033158195,0.00025986112],"domain_scores_gemma":[0.9993399,0.00008413106,0.00009624456,0.0002294278,0.00011664594,0.00013365805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025641327,0.00018219976,0.00031882344,0.00044351764,0.000044147437,0.00005948066,0.00027986075,0.00010567948,0.00019942327],"category_scores_gemma":[0.00006602344,0.00016635572,0.00008360503,0.0016413315,0.000049256952,0.00020067414,0.000036822355,0.00011192682,0.00027575306],"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.00072195986,0.00063695846,0.07318945,0.004611275,0.0012050157,0.0002545174,0.008695281,0.015762512,0.0038222426,0.384726,0.41731519,0.08905959],"study_design_scores_gemma":[0.0037732038,0.0005672468,0.013910705,0.000283834,0.00035333214,0.000091482696,0.005171079,0.0018049126,0.008988489,0.049496762,0.91343385,0.0021250756],"about_ca_topic_score_codex":0.00008516115,"about_ca_topic_score_gemma":0.00003273562,"teacher_disagreement_score":0.4961187,"about_ca_system_score_codex":0.00004103419,"about_ca_system_score_gemma":0.00002803975,"threshold_uncertainty_score":0.67837894},"labels":[],"label_agreement":null},{"id":"W1491894411","doi":"10.1016/s0378-3758(02)00204-5","title":"Block disjoint difference families for Steiner triple systems:","year":2002,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"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","funders":"","keywords":"Disjoint sets; Mathematics; Block (permutation group theory); Combinatorics; Steiner system; Discrete mathematics","score_opus":0.025863671569799948,"score_gpt":0.2446282121276711,"score_spread":0.21876454055787115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491894411","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.4405921,0.00547495,0.55051565,0.00003093988,0.0011113498,0.00018312724,0.00016462206,0.000064056425,0.0018631648],"genre_scores_gemma":[0.998446,0.00012587626,0.0011443414,0.000010500311,0.00011022722,0.000006308597,0.0000018082554,0.000010835293,0.00014412834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991263,0.00003378081,0.0004295779,0.00008102061,0.00014352688,0.00018576544],"domain_scores_gemma":[0.9990467,0.0005849536,0.00009052082,0.0000708605,0.00007946338,0.00012752671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020045636,0.00012693706,0.00031143572,0.00009251525,0.00006460379,0.00007841208,0.00009109563,0.000056049572,0.000013676412],"category_scores_gemma":[0.00023055963,0.000094944386,0.00003592716,0.00006418806,0.000058537633,0.00009332843,0.00000931378,0.00018381632,0.000003091228],"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.0007401091,0.0005981014,0.046478,0.007953073,0.0014223052,0.00061092136,0.016597832,0.083327934,0.021075554,0.63652307,0.08731865,0.097354464],"study_design_scores_gemma":[0.0038509823,0.0025045348,0.033224843,0.0031384474,0.00028545182,0.00084422226,0.0039416766,0.909575,0.0005450909,0.02075739,0.02007401,0.0012583694],"about_ca_topic_score_codex":0.0000030198096,"about_ca_topic_score_gemma":3.1822876e-7,"teacher_disagreement_score":0.82624704,"about_ca_system_score_codex":0.0000140339835,"about_ca_system_score_gemma":0.0000056579497,"threshold_uncertainty_score":0.38717195},"labels":[],"label_agreement":null},{"id":"W1500536468","doi":"10.1016/j.jctb.2015.05.002","title":"Edge-colouring eight-regular planar graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Complement (music); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.01002942422884646,"score_gpt":0.1973660829021129,"score_spread":0.18733665867326646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500536468","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.94837505,0.0026905104,0.00060308946,0.00006245455,0.032385893,0.00015456224,0.0000067364335,0.00015330674,0.015568394],"genre_scores_gemma":[0.9985194,0.000047228456,0.000120586505,0.000015874994,0.0010292294,0.000003516107,0.0000014216729,0.000043054788,0.0002196546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983841,0.00026247842,0.00058394077,0.000094907125,0.00038670114,0.00028786945],"domain_scores_gemma":[0.9989266,0.000118044714,0.00020240371,0.00024478434,0.00021992416,0.0002882393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018657515,0.00022443153,0.00045550606,0.00022375499,0.00008407844,0.00007234544,0.0004093146,0.0001479746,0.00004733879],"category_scores_gemma":[0.00012846418,0.00019308318,0.00020879862,0.00026190872,0.00010441976,0.0005915233,0.000022953413,0.0003618388,0.000020553696],"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.0007716956,0.000054428096,0.00018618046,0.00005254214,0.0002647368,0.00013436358,0.0012739792,0.0008825707,0.0021469484,0.9877941,0.006079365,0.00035907835],"study_design_scores_gemma":[0.0015946847,0.00046206202,0.000058225054,0.00009309581,0.000057048437,0.00037064578,0.0012011904,0.00001763712,0.010852273,0.93176144,0.05328013,0.00025157086],"about_ca_topic_score_codex":8.797647e-7,"about_ca_topic_score_gemma":4.3513467e-7,"teacher_disagreement_score":0.056032676,"about_ca_system_score_codex":0.00007890874,"about_ca_system_score_gemma":0.00005850579,"threshold_uncertainty_score":0.7873703},"labels":[],"label_agreement":null},{"id":"W1503683857","doi":"10.37236/2982","title":"On the Directed Oberwolfach Problem with Equal Cycle Lengths","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Ottawa; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Decomposition; Discrete mathematics","score_opus":0.002879945969358733,"score_gpt":0.1617463215410101,"score_spread":0.15886637557165137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503683857","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.97688365,0.0012281088,0.009852792,0.00038875724,0.00043286767,0.00019859165,5.511024e-7,0.0001194498,0.010895257],"genre_scores_gemma":[0.99964243,0.000067159504,0.0000030004924,0.000043554246,0.00008630427,0.0000062554286,2.8782614e-7,0.00003399341,0.000117035415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985505,0.00027251596,0.00029749857,0.000069965914,0.00034928691,0.00046026846],"domain_scores_gemma":[0.99888366,0.0005252399,0.00015685557,0.00028353938,0.000096543874,0.000054146683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017106575,0.00016536048,0.00021946222,0.000059579976,0.00016185612,0.00004262458,0.000502654,0.000052471045,0.000013075909],"category_scores_gemma":[0.000052948817,0.00007937376,0.00008693061,0.00034592862,0.0000493775,0.000077314675,0.000013228079,0.00088433997,0.000015267708],"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.000051445535,0.000045836572,0.00002772596,0.000013455306,0.00013633708,0.0000015592154,0.0002861403,0.005974734,0.00030052214,0.99227947,0.00044091346,0.00044186736],"study_design_scores_gemma":[0.00088038057,0.0011515316,0.00013875733,0.000088800654,0.00007161553,0.00017641345,0.00014318505,0.004540816,0.0026971549,0.98239946,0.007514158,0.00019774513],"about_ca_topic_score_codex":0.000002144385,"about_ca_topic_score_gemma":0.0000036070096,"teacher_disagreement_score":0.022758786,"about_ca_system_score_codex":0.00013390795,"about_ca_system_score_gemma":0.000060377908,"threshold_uncertainty_score":0.38420662},"labels":[],"label_agreement":null},{"id":"W1510785677","doi":"10.37236/1036","title":"A Few More Cyclic Steiner 2-Designs","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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":"Natural Sciences and Engineering Research Council of Canada; Jiangsu Provincial Department of Education; National Science Foundation","keywords":"Mathematics; Combinatorics; Steiner system; Discrete mathematics","score_opus":0.004355605282741898,"score_gpt":0.18554196479731666,"score_spread":0.18118635951457476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510785677","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.9632955,0.015553335,0.01269185,0.0002784957,0.0010160465,0.00013518243,8.804403e-7,0.000094511364,0.0069341683],"genre_scores_gemma":[0.998911,0.00021700462,0.0000025596366,0.00001967218,0.00021190903,0.000002745568,5.519562e-7,0.000032231757,0.00060232857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876577,0.00006783599,0.00037906386,0.000056896934,0.00027018186,0.00046025688],"domain_scores_gemma":[0.99944574,0.000090094385,0.00013361096,0.00020824779,0.00007690376,0.000045387173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998571,0.0001494027,0.00023330556,0.000099558834,0.00008331643,0.000032993725,0.00039334834,0.000064059124,0.000013983528],"category_scores_gemma":[0.00000922397,0.000100991594,0.00014811949,0.00036252322,0.000037891885,0.000110429835,0.000011641963,0.00056646013,0.000012660324],"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.0000203447,0.00005630172,0.00014775732,0.00002244712,0.000113153306,0.000014629952,0.00015076753,0.0060727177,0.0044588214,0.986066,0.0026647928,0.00021226984],"study_design_scores_gemma":[0.00093749724,0.0002804492,0.00061184505,0.000044194032,0.00009314856,0.00047711038,0.00018553637,0.0007577732,0.006050008,0.97367847,0.016655136,0.00022885497],"about_ca_topic_score_codex":0.0000051510165,"about_ca_topic_score_gemma":0.0000028382842,"teacher_disagreement_score":0.035615467,"about_ca_system_score_codex":0.00018342253,"about_ca_system_score_gemma":0.000056154695,"threshold_uncertainty_score":0.41183177},"labels":[],"label_agreement":null},{"id":"W151171227","doi":"","title":"Quarter Ten-Squares","year":2003,"lang":"en","type":"article","venue":"Digital Commons @ Butler University (Butler University)","topic":"graph theory and CDMA systems","field":"Engineering","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":"Quarter (Canadian coin); History","score_opus":0.00634044529023859,"score_gpt":0.1396434968843774,"score_spread":0.13330305159413883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151171227","genre_codex":"other","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.31315207,0.00006716603,0.0044710157,0.000054734515,0.0004042579,0.00022052688,0.00018867075,0.0007274003,0.6807142],"genre_scores_gemma":[0.98557955,0.00001788722,0.00006007439,0.000016014332,0.000023701854,1.3841509e-7,0.000041814696,0.000035201967,0.014225622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986272,0.00011849366,0.00015449816,0.00035747842,0.00021652157,0.0005257947],"domain_scores_gemma":[0.9989292,0.0001050074,0.000049881968,0.0005399486,0.000087863955,0.00028809972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000087573135,0.00034535487,0.00032626855,0.0006036212,0.00033239182,0.00011749396,0.00058469805,0.00019539637,0.00025826076],"category_scores_gemma":[0.000013523764,0.00042912996,0.0002670549,0.00096618844,0.000193025,0.0011589762,0.000094242925,0.0003260749,0.0004351158],"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.00035025392,0.00069119723,0.054557286,0.0002696047,0.0013356883,0.0026351595,0.0027591232,0.0029960438,0.0010470948,0.8737888,0.054718815,0.0048509464],"study_design_scores_gemma":[0.0012079786,0.000084211344,0.0019443883,0.000048611088,0.000074585325,0.00003204864,0.008128297,0.0001856056,0.0005479449,0.0007941289,0.9861941,0.00075814687],"about_ca_topic_score_codex":0.000023733151,"about_ca_topic_score_gemma":0.00007248159,"teacher_disagreement_score":0.9314752,"about_ca_system_score_codex":0.0002321172,"about_ca_system_score_gemma":0.00004138552,"threshold_uncertainty_score":0.99981606},"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":"W1514758408","doi":"10.37236/5157","title":"Tiling Groups with Difference Sets","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Simon Fraser University","funders":"Hrvatska Zaklada za Znanost; National Natural Science Foundation of China; European Science Foundation","keywords":"Mathematics; Disjoint sets; Combinatorics; Difference set; Substitution tiling; Abelian group; Skew; Hadamard transform; Group (periodic table); Discrete mathematics; Mathematical analysis","score_opus":0.009063236364971758,"score_gpt":0.1919677807521649,"score_spread":0.18290454438719314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514758408","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.9819921,0.0049527227,0.010785672,0.000057778518,0.0005598819,0.000058445134,2.4975543e-7,0.00004113011,0.0015519956],"genre_scores_gemma":[0.9996907,0.00013218017,0.000003831223,0.0000109067505,0.00006263528,0.0000014795525,2.2298603e-7,0.000020226787,0.000077827935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903893,0.00007275368,0.00021900136,0.000046185516,0.00028436867,0.00033878093],"domain_scores_gemma":[0.99945873,0.00006738744,0.000100170124,0.00016372267,0.00012015418,0.00008983279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082130387,0.00011545001,0.00018708623,0.000056437762,0.00004731411,0.00002692246,0.00033580285,0.000038962993,0.0000019665674],"category_scores_gemma":[0.000018896006,0.00006765885,0.000048520367,0.00024635898,0.00003057541,0.00008965568,0.000011661895,0.00053330313,0.000005546301],"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.00012021816,0.000060612594,0.0010717825,0.000033172728,0.00023730383,0.00002629059,0.0016485292,0.006207777,0.0005661819,0.98873323,0.00044548092,0.00084943214],"study_design_scores_gemma":[0.0015813624,0.0010763003,0.00053332525,0.00009386769,0.0000915545,0.0010741963,0.0009762908,0.0028244422,0.0022920899,0.9863584,0.0028451853,0.0002529749],"about_ca_topic_score_codex":0.0000010991282,"about_ca_topic_score_gemma":0.000002581159,"teacher_disagreement_score":0.017698565,"about_ca_system_score_codex":0.00016390777,"about_ca_system_score_gemma":0.00011556987,"threshold_uncertainty_score":0.2759048},"labels":[],"label_agreement":null},{"id":"W1516753266","doi":"","title":"3-Monotone Expanders.","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Monotone polygon; Bipartite graph; Construct (python library); Mathematics; Queue; Computer science; Combinatorics; Discrete mathematics; Computer network; Geometry","score_opus":0.07133057850789767,"score_gpt":0.16176905431963465,"score_spread":0.09043847581173697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516753266","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.9292652,0.00041397344,0.02079244,0.0000066113193,0.0016098814,0.00027920207,0.00003281102,0.0008679325,0.04673192],"genre_scores_gemma":[0.9978798,0.00013090622,0.000014458434,0.000012324934,0.00012734484,0.0000014996347,0.000029655335,0.00004679689,0.0017572396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989775,0.00007237185,0.00015822791,0.00043912235,0.00005615115,0.000296655],"domain_scores_gemma":[0.9989428,0.000027195536,0.00005904384,0.0007029462,0.000068964415,0.00019907767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021016691,0.0003077708,0.0003395925,0.0001895394,0.000052027048,0.000033851615,0.0005036914,0.00037009676,0.000076874916],"category_scores_gemma":[0.000008740545,0.0003747403,0.0001805082,0.00024420986,0.00007204177,0.00011560125,0.00024872384,0.0005128467,0.00029960813],"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.00003402871,0.000032929347,0.0011627122,0.00025816998,0.00025779495,0.00026697174,0.00044100097,0.9444218,0.00013602726,0.048725836,0.0041367956,0.00012587721],"study_design_scores_gemma":[0.0022907357,0.00009841932,0.000789977,0.00050439686,0.0004653275,0.000027482703,0.0025448091,0.61861503,0.0013616135,0.35036448,0.0200858,0.0028519374],"about_ca_topic_score_codex":0.000039552328,"about_ca_topic_score_gemma":0.000021435812,"teacher_disagreement_score":0.32580683,"about_ca_system_score_codex":0.00017940297,"about_ca_system_score_gemma":0.00004630459,"threshold_uncertainty_score":0.9998705},"labels":[],"label_agreement":null},{"id":"W1519765522","doi":"10.1023/a:1016567022721","title":"Packing Arrays and Packing Designs","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Carleton University","funders":"","keywords":"Combinatorics; Alphabet; Mathematics; Disjoint sets; Row; Upper and lower bounds; Row and column spaces; Discrete mathematics; Computer science","score_opus":0.03282951747971311,"score_gpt":0.20017519738008152,"score_spread":0.16734567990036842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519765522","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.7482808,0.015847458,0.22099212,0.000043898384,0.00037554346,0.00041656173,0.000021998676,0.00079470477,0.013226871],"genre_scores_gemma":[0.99644667,0.0013123109,0.0020131152,0.000057872836,0.000080164835,0.000030050145,0.0000028774612,0.000043012566,0.000013927954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989138,0.0000756073,0.00023189087,0.00026364264,0.00013126456,0.00038375164],"domain_scores_gemma":[0.9994566,0.00011306862,0.000036593934,0.00020745858,0.00002306667,0.00016324819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024547963,0.00026350547,0.00027084432,0.00024457584,0.00023956357,0.00016563876,0.00009956591,0.000116261064,0.00007621388],"category_scores_gemma":[0.000007653486,0.00025053287,0.000098586046,0.00037840052,0.00012845368,0.00018069895,0.000018166345,0.00016402772,0.0000091225165],"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.0000968198,0.00029451642,0.11568318,0.0018769882,0.0016586118,0.00025126518,0.021060608,0.0029366119,0.26699117,0.3712916,0.012294255,0.20556436],"study_design_scores_gemma":[0.012652422,0.0028232867,0.058542736,0.003780248,0.001646584,0.0019575371,0.021826718,0.3123624,0.079555415,0.3350624,0.15510373,0.014686506],"about_ca_topic_score_codex":0.0000061288006,"about_ca_topic_score_gemma":0.0000057320003,"teacher_disagreement_score":0.30942577,"about_ca_system_score_codex":0.000006274687,"about_ca_system_score_gemma":0.0000014348285,"threshold_uncertainty_score":0.9999947},"labels":[],"label_agreement":null},{"id":"W1520472005","doi":"10.1109/leos.2004.1363198","title":"Demonstration of a 4-user 2-D wavelength-time OCDMA system employing depth-first search codes","year":2004,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; Code division multiple access; Wavelength; Electronic engineering; Optics; Computer network; Physics; Engineering","score_opus":0.010042660369932042,"score_gpt":0.19976537564918134,"score_spread":0.1897227152792493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520472005","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.9470304,0.00009308182,0.016457237,0.000018039684,0.00019207443,0.0002565006,0.000006349657,0.000572397,0.035373922],"genre_scores_gemma":[0.9988666,0.000006749059,0.00078594603,0.000003617739,0.00005791472,0.000017410053,0.0000054042825,0.000032591488,0.00022376634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990247,0.000040024388,0.00033751575,0.00014641332,0.00020053599,0.0002508301],"domain_scores_gemma":[0.9995524,0.00005755732,0.000028465009,0.00023202064,0.000054966564,0.000074538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032683832,0.00014970438,0.00023782728,0.00011928672,0.00006703686,0.000029976054,0.00014247486,0.00010496183,0.000029490513],"category_scores_gemma":[0.0000062179306,0.00013794699,0.00008277329,0.00022846556,0.000039326187,0.00014868405,0.0000150076785,0.00010527034,0.00016890344],"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.000082016544,0.00018251674,0.011539452,0.0044431784,0.0006022493,0.000057804322,0.0052498486,0.22633734,0.18039156,0.5663672,0.0005340434,0.004212768],"study_design_scores_gemma":[0.005516292,0.0005126023,0.01676838,0.0037750935,0.00023534663,0.00052471284,0.013609171,0.1286182,0.8247804,0.001889359,0.0014432847,0.002327129],"about_ca_topic_score_codex":0.00007975616,"about_ca_topic_score_gemma":0.000100044796,"teacher_disagreement_score":0.64438885,"about_ca_system_score_codex":0.00008147956,"about_ca_system_score_gemma":0.000019137711,"threshold_uncertainty_score":0.5625315},"labels":[],"label_agreement":null},{"id":"W1522265958","doi":"10.37236/988","title":"Existentially Closed BIBD Block-Intersection Graphs","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Memorial University of Newfoundland; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Lambda; Intersection (aeronautics); Block (permutation group theory); Graph; Intersection graph; Discrete mathematics; Line graph; Physics","score_opus":0.003953022700178417,"score_gpt":0.1925948955714602,"score_spread":0.18864187287128178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522265958","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.96712774,0.004417549,0.019740436,0.000055738252,0.003661538,0.000092096445,3.5116042e-7,0.00007747159,0.004827073],"genre_scores_gemma":[0.99941117,0.00028204676,0.0000030655897,0.000014380782,0.0001518483,8.595267e-7,2.604275e-7,0.000027034155,0.00010934387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986096,0.00007634656,0.00046110284,0.00006356326,0.00029254705,0.0004968106],"domain_scores_gemma":[0.9992817,0.00014731781,0.00017396975,0.0001888569,0.00013638432,0.00007177803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021113208,0.0001427437,0.00020420524,0.0002454461,0.00011207187,0.000032529373,0.00035800604,0.000078086465,0.000008322982],"category_scores_gemma":[0.0000315287,0.000104550636,0.00020480606,0.0005669383,0.00004468773,0.00012836051,0.0000121117,0.0006844296,0.000008314113],"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.000099460005,0.000058573794,0.00013178393,0.000028397664,0.00023756037,0.000019480638,0.00046048028,0.0007164213,0.008224474,0.9888268,0.00039608253,0.00080047577],"study_design_scores_gemma":[0.0010130167,0.0007005252,0.0006301391,0.00006243519,0.00012774942,0.0010230555,0.0006366621,0.0002265033,0.016757747,0.96912664,0.009451326,0.00024419426],"about_ca_topic_score_codex":0.000002629841,"about_ca_topic_score_gemma":0.000011169641,"teacher_disagreement_score":0.032283414,"about_ca_system_score_codex":0.00021114698,"about_ca_system_score_gemma":0.000054038173,"threshold_uncertainty_score":0.4263451},"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":"W1528227909","doi":"10.1023/a:1016501125022","title":"Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science","score_opus":0.014008493613757519,"score_gpt":0.20708942770020075,"score_spread":0.19308093408644322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528227909","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.7793036,0.004471489,0.20267588,0.00012870849,0.00062889466,0.0009930076,0.0005078057,0.00033262136,0.010958006],"genre_scores_gemma":[0.99518,0.00023561639,0.0042623063,0.00005002815,0.000053808242,0.0001564419,0.000022689317,0.00001764869,0.000021475858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994345,0.000020395919,0.00014767327,0.00015884596,0.00006629718,0.00017230111],"domain_scores_gemma":[0.9996316,0.0001171183,0.000027974444,0.00009828835,0.000040954223,0.000084052714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007285583,0.00015593934,0.00016955077,0.00014450903,0.00022738127,0.00008854033,0.000048492326,0.00006581727,0.00006753335],"category_scores_gemma":[0.0000032722555,0.00014978489,0.000087171094,0.00014277331,0.00014938535,0.00012941084,0.000008660815,0.00008626101,0.0000022308698],"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.0001266971,0.00027078678,0.014954384,0.0008336852,0.0022928857,0.000015769403,0.0052168234,0.0004563098,0.022845931,0.8969233,0.034129277,0.021934161],"study_design_scores_gemma":[0.010202778,0.0019677035,0.0147888325,0.0009072952,0.0009017036,0.00075400085,0.015227857,0.104797766,0.017625026,0.3779374,0.4511643,0.0037253248],"about_ca_topic_score_codex":0.0000024121623,"about_ca_topic_score_gemma":0.000007004144,"teacher_disagreement_score":0.51898587,"about_ca_system_score_codex":0.000007321083,"about_ca_system_score_gemma":0.0000023624734,"threshold_uncertainty_score":0.61080503},"labels":[],"label_agreement":null},{"id":"W152869389","doi":"","title":"Families of Matrices with Good Auto and Cross-Correlation.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Correlation; Statistics; Geometry","score_opus":0.004246140175229221,"score_gpt":0.19646889642758048,"score_spread":0.19222275625235125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152869389","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.9864398,0.00080564554,0.00006939438,0.000003599942,0.00051250623,0.00007518926,0.0000022059612,0.00011936103,0.011972262],"genre_scores_gemma":[0.9996617,0.000081225415,0.00004111286,0.0000026141,0.0000043670216,0.000007152036,0.0000016875501,0.000014199816,0.00018597975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995719,0.000013064119,0.00013486184,0.00008312987,0.00008854645,0.0001084913],"domain_scores_gemma":[0.99972624,0.000050466675,0.00003017097,0.00012991237,0.00002987775,0.00003333893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090927766,0.00008730089,0.00012558511,0.000060197526,0.000042599997,0.000023529785,0.00006613251,0.000048968017,0.000012079286],"category_scores_gemma":[0.0000057106995,0.000075620184,0.000018410698,0.00020222449,0.000051722902,0.00014366137,0.000010163467,0.000060832524,0.000008849055],"study_design_candidate":"observational","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.000018151393,0.000025135987,0.39764395,0.00010787477,0.00005712179,0.000007767155,0.00056717795,0.002041162,0.00057736656,0.5983157,0.00008598726,0.00055256876],"study_design_scores_gemma":[0.004043142,0.00043523015,0.6034656,0.000309732,0.000103708946,0.00014590996,0.0012803798,0.014970591,0.0051650763,0.35712942,0.012060504,0.0008906614],"about_ca_topic_score_codex":0.000017914817,"about_ca_topic_score_gemma":0.0000028967788,"teacher_disagreement_score":0.2411863,"about_ca_system_score_codex":0.000008804056,"about_ca_system_score_gemma":0.000004675303,"threshold_uncertainty_score":0.30837014},"labels":[],"label_agreement":null},{"id":"W1539787319","doi":"10.1016/j.ejc.2016.11.001","title":"On excluded minors of connectivity 2 for the class of frame matroids","year":2016,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Matroid; Combinatorics; Class (philosophy); Minor (academic); Mathematics; Frame (networking); Binary number; Set (abstract data type); Graphic matroid; Discrete mathematics; Computer science; Artificial intelligence; Arithmetic; Humanities","score_opus":0.01546122094561451,"score_gpt":0.21814366560072188,"score_spread":0.20268244465510737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539787319","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.9298808,0.0018398927,0.048908655,0.000098361874,0.007832828,0.0003938174,0.00008127981,0.000038321232,0.010926057],"genre_scores_gemma":[0.9994697,0.00012473666,0.000043784534,0.000008565135,0.00018531612,0.0000026072155,9.145732e-7,0.000071422204,0.000092979826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980136,0.00045804767,0.00088893936,0.00011891918,0.00033767318,0.00018281708],"domain_scores_gemma":[0.99711025,0.001020355,0.0009337742,0.00050574867,0.00035272175,0.000077166755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022577888,0.00025177022,0.00063411164,0.00018093316,0.000040362207,0.000020425088,0.0007947009,0.00009711261,0.000011795607],"category_scores_gemma":[0.00026312677,0.00016345218,0.00049227953,0.000108744425,0.0000918307,0.000045579163,0.00011137322,0.0006381476,0.0000039363445],"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.001101145,0.0007043256,0.0011480612,0.0049124975,0.0031699026,0.000102699574,0.0026609038,0.035471074,0.016286314,0.90742916,0.02020095,0.0068129585],"study_design_scores_gemma":[0.010354034,0.005015529,0.014925196,0.008410482,0.0011970169,0.00019449981,0.0008430421,0.0036705295,0.06324505,0.85610586,0.034224607,0.0018141532],"about_ca_topic_score_codex":4.773806e-7,"about_ca_topic_score_gemma":1.3399772e-7,"teacher_disagreement_score":0.069588885,"about_ca_system_score_codex":0.00005898416,"about_ca_system_score_gemma":0.00003936226,"threshold_uncertainty_score":0.6665386},"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":"W154253029","doi":"","title":"On embedding partial unitals and large (k, n)-arcs","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embedding; Mathematics; Pure mathematics; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009529900423714164,"score_gpt":0.2078367881897664,"score_spread":0.19830688776605224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154253029","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.9848844,0.0004345882,0.000040308598,0.000017882703,0.0015078892,0.00008134539,0.0000058886226,0.00023799481,0.012789722],"genre_scores_gemma":[0.9997607,0.000026337702,0.000008210996,0.000027896282,0.000011540747,0.000008765629,0.0000021096,0.00002514992,0.00012931509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993855,0.000037882688,0.00012720536,0.00011832148,0.00009664251,0.00023445216],"domain_scores_gemma":[0.9996484,0.00007022573,0.000015206947,0.00017503553,0.000010413903,0.000080720885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014050257,0.00011842523,0.00013205793,0.000055370896,0.000092704286,0.00003666584,0.00008035382,0.000067010784,0.00014977193],"category_scores_gemma":[0.0000212443,0.00012016668,0.000031910433,0.000117510135,0.000015703961,0.00008685218,0.000018198889,0.00012440945,0.00016282816],"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.0000038271533,0.00004296988,0.00031556722,0.000033068718,0.000031136078,0.000015669817,0.0005954056,0.00020898663,0.00041684488,0.99366915,0.0038516375,0.00081572664],"study_design_scores_gemma":[0.00389356,0.0003855465,0.0009439791,0.00024066016,0.00005647188,0.000053676802,0.00063474686,0.13443208,0.007835817,0.7748066,0.07557103,0.0011457949],"about_ca_topic_score_codex":0.0000011343134,"about_ca_topic_score_gemma":5.2647886e-7,"teacher_disagreement_score":0.21886252,"about_ca_system_score_codex":0.000014832869,"about_ca_system_score_gemma":7.9310735e-7,"threshold_uncertainty_score":0.4900255},"labels":[],"label_agreement":null},{"id":"W1543709120","doi":"10.37236/2166","title":"Forbidden Submatrices: Some New Bounds and Constructions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Hypergraph; Mathematics; Vertex (graph theory); Order (exchange); Simple (philosophy); Matrix (chemical analysis); Block matrix; Discrete mathematics; Graph; Physics; Eigenvalues and eigenvectors","score_opus":0.0028402254465351925,"score_gpt":0.1610518127403532,"score_spread":0.158211587293818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543709120","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.9607474,0.03371467,0.00242624,0.00020770518,0.0009969821,0.00013370907,3.9424688e-7,0.00004708011,0.001725811],"genre_scores_gemma":[0.99821305,0.0013994671,0.0000073406927,0.000015141507,0.00015957444,0.0000023479533,2.035108e-7,0.000016209942,0.00018664553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920446,0.000039035505,0.00025677567,0.000045178414,0.0001453188,0.00030922997],"domain_scores_gemma":[0.9995333,0.00007727138,0.00009747991,0.00012832951,0.00007527199,0.000088324734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024862008,0.00010314284,0.00016795212,0.0000891854,0.00010574818,0.000074431766,0.00021830862,0.000050429542,0.000019313007],"category_scores_gemma":[0.000012274605,0.00007197074,0.000067323475,0.00019949484,0.000047485217,0.00030881568,0.000013293206,0.00040393465,0.000013412744],"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.0000042997026,0.0000077352615,0.0002060697,0.00002494537,0.000106898224,9.974029e-7,0.00051309145,0.00011553659,0.00038999983,0.995693,0.0015169226,0.0014204852],"study_design_scores_gemma":[0.0005450961,0.00016348943,0.00030727818,0.000018345241,0.00005670637,0.00048126094,0.0009137347,0.00017274627,0.0005045236,0.98822963,0.008499658,0.00010754081],"about_ca_topic_score_codex":0.000010918208,"about_ca_topic_score_gemma":0.0000019523357,"teacher_disagreement_score":0.03746566,"about_ca_system_score_codex":0.000105970976,"about_ca_system_score_gemma":0.00010774288,"threshold_uncertainty_score":0.29348814},"labels":[],"label_agreement":null},{"id":"W1545406086","doi":"10.1023/a:1016506704066","title":"Partitioning Sets of Triples into Small Planes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fano plane; Affine transformation; Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Pure mathematics","score_opus":0.028945925164152182,"score_gpt":0.1936804898784044,"score_spread":0.1647345647142522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545406086","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.9749242,0.0062104124,0.014205532,0.000012003873,0.00013725637,0.00012790623,0.0000172568,0.00019091135,0.004174522],"genre_scores_gemma":[0.99788094,0.0004902985,0.0015434843,0.000013380491,0.000023130717,0.000020271393,0.0000066059915,0.000014672013,0.000007234335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994254,0.000039883947,0.00019591031,0.00011236453,0.00006887343,0.00015758234],"domain_scores_gemma":[0.9997002,0.000066860455,0.00003099845,0.00012196081,0.00001794322,0.00006207172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011639463,0.00012358591,0.00018339441,0.00015869497,0.00008012181,0.000029560804,0.0000721855,0.00006212499,0.00007181671],"category_scores_gemma":[0.000004358242,0.00011584776,0.00007993699,0.00023784071,0.0000779676,0.000057867444,0.000007130524,0.000062486564,0.0000050510744],"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.00017548782,0.00051517464,0.15158054,0.004214505,0.0018030372,0.00009629691,0.028722886,0.011667743,0.18845364,0.46827123,0.012790026,0.13170943],"study_design_scores_gemma":[0.009333101,0.0027127818,0.0693756,0.0030688234,0.0010192489,0.00044589498,0.017141119,0.18093182,0.22246087,0.3809931,0.10571949,0.006798141],"about_ca_topic_score_codex":0.000014898447,"about_ca_topic_score_gemma":0.000019113148,"teacher_disagreement_score":0.1692641,"about_ca_system_score_codex":0.0000021818016,"about_ca_system_score_gemma":9.4541247e-7,"threshold_uncertainty_score":0.47241345},"labels":[],"label_agreement":null},{"id":"W1548637683","doi":"10.1007/978-3-642-15874-2_22","title":"New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hadamard transform; Hadamard three-lines theorem; Hadamard matrix; Complex Hadamard matrix; Hadamard product; Kronecker product; Hadamard's inequality; Mathematics; Block matrix; Hadamard's maximal determinant problem; Matrix (chemical analysis); Hadamard three-circle theorem; Kronecker delta; Combinatorics; Pure mathematics; Computer science; Physics; Mathematical analysis; Eigenvalues and eigenvectors; Materials science; Composite material","score_opus":0.006851824099351875,"score_gpt":0.1847018446053393,"score_spread":0.17785002050598744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548637683","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.014177795,0.001625164,0.97363377,0.000039955798,0.0040723416,0.00031527496,0.000021173113,0.00016684669,0.0059476867],"genre_scores_gemma":[0.9690644,0.0001871553,0.030314099,0.000036360594,0.0002085688,0.0000032394669,0.000007956838,0.00003024987,0.00014797381],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865764,0.000013058312,0.0004037604,0.0004118083,0.0002769336,0.00023679934],"domain_scores_gemma":[0.9991682,0.00018481488,0.00013541266,0.00035554235,0.00006328508,0.000092700626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025450435,0.00028851972,0.00039634822,0.00055470667,0.00013465199,0.000081943144,0.00036503558,0.00032745468,0.000036997888],"category_scores_gemma":[0.000012878228,0.00026687304,0.00008308106,0.00034001796,0.00077021634,0.00018638126,0.0000858114,0.0006319236,0.000008935906],"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.00003427988,0.000014880683,0.0013364691,0.0008512334,0.0002546178,0.000037761398,0.003218622,0.11891854,0.05962602,0.045187213,0.000086116466,0.77043426],"study_design_scores_gemma":[0.0013232317,0.000521716,0.0033043304,0.0026615346,0.00024347883,0.0009146983,0.000016836484,0.17193161,0.009225964,0.7941652,0.013260605,0.0024308073],"about_ca_topic_score_codex":0.00007226843,"about_ca_topic_score_gemma":0.0001548799,"teacher_disagreement_score":0.9548866,"about_ca_system_score_codex":0.000040209856,"about_ca_system_score_gemma":0.00009678172,"threshold_uncertainty_score":0.99997836},"labels":[],"label_agreement":null},{"id":"W1557139302","doi":"10.1007/11534273_26","title":"A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Adjacency list; Computer science; Graph; Adjacency matrix; Labelling; Line (geometry); Combinatorics; Scheme (mathematics); Line graph; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science","score_opus":0.009875477647055073,"score_gpt":0.22399919091034076,"score_spread":0.2141237132632857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557139302","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.0015855759,0.002632004,0.9919927,0.00005583613,0.0015672835,0.0005254072,0.000026648231,0.00028152793,0.0013330191],"genre_scores_gemma":[0.8286036,0.00025461303,0.16930506,0.00034672092,0.0006858579,0.000055706972,0.000030202942,0.00016431339,0.0005539019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804676,0.000005992695,0.00043072895,0.0006531798,0.0002996818,0.00056367],"domain_scores_gemma":[0.9989241,0.00021510138,0.0000883741,0.0005698937,0.00009404346,0.000108510925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045227827,0.00045070052,0.000452816,0.0005664781,0.00014388365,0.00011134933,0.0008330707,0.00032473388,0.000021492462],"category_scores_gemma":[0.000019113368,0.00043565704,0.00017365877,0.00031377314,0.0002103633,0.00015397834,0.000097258475,0.0005317726,0.000021068536],"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.000015544785,0.000021309817,0.000020490772,0.0004551376,0.0000584377,0.000018572848,0.0005800246,0.50613666,0.006423932,0.032706726,0.000025557158,0.45353758],"study_design_scores_gemma":[0.0002794308,0.000092492875,0.000009275504,0.00057615817,0.000014667498,0.000034517772,2.2999484e-7,0.8206666,0.0018536028,0.17272763,0.0030872473,0.00065812614],"about_ca_topic_score_codex":0.000002563051,"about_ca_topic_score_gemma":0.000064215004,"teacher_disagreement_score":0.827018,"about_ca_system_score_codex":0.00014251015,"about_ca_system_score_gemma":0.000057703222,"threshold_uncertainty_score":0.9998095},"labels":[],"label_agreement":null},{"id":"W1558644659","doi":"","title":"A study of typenumber in book-embedding","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Artificial intelligence; Computer science","score_opus":0.012701671020705909,"score_gpt":0.22187006321866187,"score_spread":0.20916839219795597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558644659","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.98062366,0.00047455938,7.0396953e-7,0.0000025000131,0.00080401887,0.00014475542,4.6013233e-7,0.00006497294,0.017884377],"genre_scores_gemma":[0.9997837,0.000010678729,0.0000033817532,0.000004579952,0.000002915908,0.000015191009,2.3080982e-7,0.000015709149,0.00016362518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994833,0.0000367494,0.0001825776,0.00008247567,0.00008930445,0.00012562699],"domain_scores_gemma":[0.9997319,0.000032556894,0.000019240346,0.00017902142,0.000011314626,0.00002593938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114593604,0.00007769431,0.00015178678,0.00007486499,0.000014830269,0.000006435298,0.0000990948,0.000038158083,0.00012862204],"category_scores_gemma":[0.000008870469,0.00008211204,0.000023478759,0.00020450023,0.000008992734,0.000076100965,0.000014192788,0.000092253686,0.00006792317],"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.000038699258,0.0029311082,0.22335958,0.00037553482,0.00037557655,0.00029213738,0.045141574,0.011317259,0.0039928923,0.69254667,0.017250627,0.0023783285],"study_design_scores_gemma":[0.044313725,0.0038171893,0.15229833,0.0016253593,0.0003274797,0.000159175,0.041664325,0.12971292,0.02071246,0.5624697,0.037417788,0.005481499],"about_ca_topic_score_codex":0.000016363758,"about_ca_topic_score_gemma":0.000009846403,"teacher_disagreement_score":0.13007693,"about_ca_system_score_codex":0.000017766415,"about_ca_system_score_gemma":9.2090636e-7,"threshold_uncertainty_score":0.33484316},"labels":[],"label_agreement":null},{"id":"W1563415799","doi":"10.37236/370","title":"Properties of the Steiner Triple Systems of Order 19","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"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":"Nokia Foundation; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Mathematics; Chromatic scale; Combinatorics; Order (exchange); Index (typography); Edge coloring; Discrete mathematics; Graph; Computer science","score_opus":0.004956060529502049,"score_gpt":0.16972398822276255,"score_spread":0.1647679276932605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563415799","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.98753315,0.008684645,0.0003420301,0.000061983395,0.0025537524,0.00016830361,9.835018e-7,0.000013011927,0.00064211903],"genre_scores_gemma":[0.9994049,0.00013598758,8.521588e-7,0.000004072871,0.00007596055,0.0000030518818,7.050789e-8,0.00002008208,0.00035502532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873066,0.00012920756,0.00051314966,0.000042788983,0.0003236028,0.00026059788],"domain_scores_gemma":[0.9989952,0.000057512912,0.0003259638,0.0003268205,0.00025974846,0.00003477187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012102361,0.000114782786,0.0002957364,0.00006603618,0.00005793725,0.000012843154,0.0006085667,0.0000716499,0.0000049344603],"category_scores_gemma":[0.00008447524,0.000056679914,0.00013567672,0.00041106678,0.00008972003,0.000075024494,0.000024331031,0.00071175484,0.0000010447839],"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.00005868855,0.00008492019,0.0006801662,0.00026716443,0.00029003117,7.5431524e-7,0.00084227807,0.0042501204,0.1534605,0.8394615,0.000536255,0.0000675896],"study_design_scores_gemma":[0.0069734487,0.0019155286,0.0017677266,0.0011132208,0.0008035795,0.0015551116,0.0044152215,0.008918702,0.5921437,0.3254935,0.053892512,0.0010077328],"about_ca_topic_score_codex":0.000014723569,"about_ca_topic_score_gemma":0.000007767863,"teacher_disagreement_score":0.513968,"about_ca_system_score_codex":0.000048299542,"about_ca_system_score_gemma":0.00017322155,"threshold_uncertainty_score":0.30922604},"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":"W156637814","doi":"","title":"Double Orderings of (0, 1)-Matrices.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007482849627625452,"score_gpt":0.19869061385869172,"score_spread":0.19120776423106625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156637814","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.963957,0.0006833018,0.000031181633,0.000008179597,0.0015638209,0.000087113796,9.638657e-7,0.00020778044,0.03346064],"genre_scores_gemma":[0.99963355,0.00008696307,0.00002295688,0.000005059425,0.000006568179,0.000010163584,0.0000016676811,0.000020853051,0.00021219191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994414,0.000010596449,0.00018691835,0.000086385895,0.00010613023,0.00016857563],"domain_scores_gemma":[0.9996529,0.000024494851,0.000029606283,0.00021341206,0.000031050495,0.000048489117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012747823,0.00009747259,0.00015905483,0.00007276717,0.00002796489,0.000011298653,0.00015670208,0.000059239454,0.00007603063],"category_scores_gemma":[0.0000041996063,0.000100244186,0.00005209014,0.00033864958,0.000021746335,0.00009712992,0.000016946191,0.000077702985,0.00006437234],"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.000036941696,0.00006632464,0.0089132665,0.00017386004,0.00008025309,0.000018697645,0.0005787616,0.0011371512,0.007153954,0.97814155,0.0026444816,0.001054767],"study_design_scores_gemma":[0.007149331,0.0002479249,0.0059108417,0.0002670126,0.000088723646,0.000111891764,0.0005730624,0.0037696967,0.07074389,0.7559879,0.15394205,0.0012076667],"about_ca_topic_score_codex":0.000027965265,"about_ca_topic_score_gemma":0.0000021673598,"teacher_disagreement_score":0.22215363,"about_ca_system_score_codex":0.000015469695,"about_ca_system_score_gemma":0.0000050924887,"threshold_uncertainty_score":0.4087839},"labels":[],"label_agreement":null},{"id":"W1568296425","doi":"10.37236/1533","title":"Large Equiangular Sets of Lines in Euclidean Space","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equiangular polygon; Mathematics; Combinatorics; Euclidean space; Upper and lower bounds; Constructive; Euclidean geometry; Integer (computer science); Euclidean distance; Space (punctuation); Order (exchange); Dimension (graph theory); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Regular polygon; Process (computing); Computer science","score_opus":0.0035316720272018697,"score_gpt":0.20008741365690902,"score_spread":0.19655574162970715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568296425","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.9870125,0.010072338,0.00044841022,0.00010258261,0.000277361,0.00006924574,0.0000011575411,0.000017548966,0.0019988539],"genre_scores_gemma":[0.99857783,0.0011342121,0.0000020994646,0.000010169646,0.000048666436,9.743108e-7,3.7293006e-7,0.000020490546,0.00020516156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988015,0.0001110055,0.00041757055,0.000048798607,0.00021146338,0.0004096532],"domain_scores_gemma":[0.999531,0.0000798559,0.000109445544,0.00018454964,0.000054667045,0.00004049285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012409186,0.000114644834,0.0002720809,0.000110440735,0.000030343586,0.00000972874,0.0003379878,0.00006128487,0.000057531895],"category_scores_gemma":[0.000020535932,0.00008456927,0.00010890874,0.00041787777,0.000023055127,0.000093954965,0.000009704084,0.00049159233,0.000007981342],"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.00011093893,0.00020478434,0.0011810535,0.00010578794,0.00020307457,0.000036197198,0.0022423994,0.011263561,0.0026577916,0.9798656,0.00066366355,0.0014651237],"study_design_scores_gemma":[0.0026128658,0.00063237885,0.0011938147,0.00023473513,0.00008070702,0.00032986348,0.0007469524,0.003246437,0.011566128,0.9500837,0.0289519,0.0003205373],"about_ca_topic_score_codex":0.0000031496622,"about_ca_topic_score_gemma":0.000009171376,"teacher_disagreement_score":0.029781943,"about_ca_system_score_codex":0.00009799472,"about_ca_system_score_gemma":0.000056728055,"threshold_uncertainty_score":0.34486347},"labels":[],"label_agreement":null},{"id":"W1569869406","doi":"","title":"On circulant and two-circulant weighing matrices","year":2010,"lang":"en","type":"article","venue":"Research Online (University of Wollongong)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Circulant matrix; Construct (python library); Mathematics; Table (database); Hospitality; Matrix (chemical analysis); Combinatorics; Order (exchange); Computer science; Data mining; Geography","score_opus":0.018600524886797358,"score_gpt":0.26289564941248855,"score_spread":0.2442951245256912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569869406","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.99581903,0.00017768666,0.00014873884,0.00015259346,0.0001799388,0.00015793745,0.000051427993,0.00010112177,0.0032115127],"genre_scores_gemma":[0.9991665,0.00015873025,0.00035303045,0.0000038353705,0.00007892777,2.9719496e-7,0.000014737987,0.000016799659,0.0002071229],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988658,0.00009823312,0.00010011261,0.00021318295,0.0003821666,0.0003405395],"domain_scores_gemma":[0.9991706,0.00022634417,0.000027481332,0.00030645047,0.000094189985,0.00017492082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670654,0.00011367338,0.00020552478,0.0004358317,0.00022657306,0.000026177257,0.00033040397,0.00009986104,0.000106094194],"category_scores_gemma":[0.00004524334,0.00012513668,0.00006990247,0.00042137524,0.00019651387,0.00015433121,0.00009295659,0.0006592213,0.000036950856],"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.000492372,0.00095448445,0.014353948,0.0021171418,0.000926705,0.0013115151,0.010489364,0.00539041,0.6484563,0.25316295,0.0059775063,0.05636732],"study_design_scores_gemma":[0.017117247,0.002006815,0.21817844,0.0026027171,0.00036104902,0.0007262484,0.062484294,0.5224288,0.013204832,0.06374421,0.09250103,0.0046443245],"about_ca_topic_score_codex":0.0003596297,"about_ca_topic_score_gemma":0.00052969705,"teacher_disagreement_score":0.63525146,"about_ca_system_score_codex":0.000027456166,"about_ca_system_score_gemma":0.000026495505,"threshold_uncertainty_score":0.5102926},"labels":[],"label_agreement":null},{"id":"W1574893070","doi":"10.1016/j.disc.2012.03.018","title":"The intersection spectrum of Skolem sequences and its applications to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si94.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>λ</mml:mi></mml:math>-fold cyclic triple systems","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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","funders":"","keywords":"Intersection (aeronautics); Mathematics; Spectrum (functional analysis); Scroll; Discrete mathematics; Algorithm; Combinatorics; Physics","score_opus":0.014777833416157732,"score_gpt":0.23422135265150526,"score_spread":0.21944351923534752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574893070","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.9891037,0.00077450724,0.0064651296,0.00005132851,0.000707691,0.0002289366,0.00007890942,0.00014556236,0.0024442484],"genre_scores_gemma":[0.99850786,0.000091937174,0.00039731097,0.000020732601,0.00030127523,0.00047686085,0.000029508255,0.00007748715,0.00009705484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983499,0.000052163614,0.0006051743,0.00022168524,0.00033775455,0.00043329378],"domain_scores_gemma":[0.9986853,0.00030089283,0.00027360691,0.0005442759,0.000028284232,0.00016766561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069885526,0.0002480799,0.00022745464,0.00007299193,0.00029579346,0.00016108947,0.00032892858,0.00019374647,0.0000069245766],"category_scores_gemma":[0.00009437363,0.00022528331,0.00018622397,0.00026321984,0.000102585385,0.00026810644,0.00011972588,0.00021332224,0.00019113229],"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.000020802432,0.00003894569,0.000012374126,0.0008496173,0.00016391846,0.0000024092296,0.0024392458,0.0010109525,0.0036783165,0.99156034,0.000103443024,0.000119658274],"study_design_scores_gemma":[0.00025674648,0.00013374233,0.000041403546,0.000473673,0.00018002027,0.00014879934,0.0051576598,0.9749067,0.013669793,0.002457462,0.002240873,0.00033316572],"about_ca_topic_score_codex":0.000042197567,"about_ca_topic_score_gemma":0.00004273068,"teacher_disagreement_score":0.98910284,"about_ca_system_score_codex":0.000018368224,"about_ca_system_score_gemma":0.00002555341,"threshold_uncertainty_score":0.91867864},"labels":[],"label_agreement":null},{"id":"W1575036539","doi":"","title":"The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4).","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.007011103592310649,"score_gpt":0.19993837308537743,"score_spread":0.1929272694930668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575036539","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.99008,0.0015475947,0.00008139938,0.00027708977,0.004374126,0.0003980412,0.000012317475,0.0004083938,0.0028210098],"genre_scores_gemma":[0.9992921,0.000038261667,0.000042417847,0.00003688642,0.000031666154,0.00013949248,0.0000037823215,0.000038336042,0.0003771099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991884,0.000032117397,0.00020289485,0.00013554191,0.00012084537,0.00032020503],"domain_scores_gemma":[0.9993125,0.000182103,0.00004089288,0.0003485795,0.00004504817,0.00007082928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031793118,0.00015128983,0.00015108097,0.000043211592,0.00026447867,0.000060523216,0.00027774475,0.000082022576,0.000008829136],"category_scores_gemma":[0.000029094776,0.0001185579,0.00012799873,0.00016832113,0.000042798547,0.0001075043,0.000016653301,0.00010952512,0.000057932415],"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.000009362547,0.000022061533,0.0010061535,0.000028822395,0.000044891098,9.679894e-7,0.00014931163,0.0003467707,0.00023833476,0.97891665,0.017435836,0.0018008557],"study_design_scores_gemma":[0.0007953039,0.000037270198,0.0013579654,0.000029864505,0.000021407239,0.000005945643,0.00025425435,0.002693676,0.0029959597,0.69468516,0.29686147,0.00026170138],"about_ca_topic_score_codex":0.0000026259893,"about_ca_topic_score_gemma":0.000036626694,"teacher_disagreement_score":0.28423145,"about_ca_system_score_codex":0.000031227253,"about_ca_system_score_gemma":0.000005786356,"threshold_uncertainty_score":0.4834651},"labels":[],"label_agreement":null},{"id":"W1575607382","doi":"10.21236/ada548359","title":"On the Use of Transeunt Triangles to Synthesize Fixed-Polarity Reed-Muller Expansions of Functions","year":2009,"lang":"en","type":"report","venue":"","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 Calgary; University of New Brunswick","funders":"","keywords":"Polarity (international relations); Mathematics; Combinatorics; Chemistry","score_opus":0.08012366534817301,"score_gpt":0.24692418845792688,"score_spread":0.16680052310975385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575607382","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.49870288,0.003241376,0.038446035,0.0012808883,0.009000667,0.0068524657,0.0033681742,0.0016724728,0.43743503],"genre_scores_gemma":[0.99105275,0.00021242097,0.00018289276,0.00004893033,0.00011671892,0.00006795426,0.000022314802,0.00006290705,0.008233115],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807644,0.00015553809,0.0007689455,0.0002405299,0.0005238404,0.00023469739],"domain_scores_gemma":[0.99760777,0.001066144,0.0001264939,0.00091236416,0.00019020741,0.0000970016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070791563,0.0003287054,0.0007161945,0.00027935152,0.000080231155,0.000020602534,0.00025753863,0.0003664901,0.00056662655],"category_scores_gemma":[0.00046212744,0.00021790697,0.00047872285,0.00036007058,0.000054865584,0.000055312197,0.000013744909,0.00039095187,0.000027955819],"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.00064574956,0.0012664902,0.00023042927,0.0030009681,0.00347881,0.000045465935,0.00297758,0.068200305,0.04840695,0.058077432,0.785479,0.028190816],"study_design_scores_gemma":[0.0008147359,0.0009095717,0.00438447,0.0047581713,0.0011218463,0.00008832962,0.0016031895,0.0006632623,0.027121224,0.0019001393,0.9548562,0.0017788477],"about_ca_topic_score_codex":0.00036838354,"about_ca_topic_score_gemma":0.0002523668,"teacher_disagreement_score":0.49234986,"about_ca_system_score_codex":0.00006164773,"about_ca_system_score_gemma":0.000101209196,"threshold_uncertainty_score":0.8885988},"labels":[],"label_agreement":null},{"id":"W157693631","doi":"10.1023/a:1016502619995","title":"A new bound on the number of designs with classical affine parameters","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Hyperplane; Upper and lower bounds; Mathematics; Physics; Mathematical analysis","score_opus":0.031624451258734323,"score_gpt":0.20987776773415298,"score_spread":0.17825331647541864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157693631","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.913912,0.0006281672,0.07038877,0.00015703806,0.000107891916,0.00034679016,0.000012463476,0.00017624484,0.014270631],"genre_scores_gemma":[0.9969314,0.00008942266,0.002747516,0.00007023105,0.000033280845,0.000027142236,0.0000013293003,0.000028589937,0.0000711424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914163,0.00008113622,0.00018699675,0.00017149838,0.00017212876,0.00024662446],"domain_scores_gemma":[0.9993147,0.00025267107,0.00003945085,0.00026209094,0.000019070882,0.00011200022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014476472,0.00020695842,0.00023668063,0.00009302012,0.00009729449,0.00006300136,0.00014111359,0.00007609268,0.00024542643],"category_scores_gemma":[0.0000057802995,0.00012896948,0.000113505674,0.00044153188,0.0001660594,0.000059808666,0.000007953371,0.00015249911,0.00001542673],"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.0004928671,0.00038545992,0.017989935,0.00031754907,0.0016472327,0.0000767158,0.004179535,0.0036538984,0.016583966,0.8707282,0.050653074,0.033291556],"study_design_scores_gemma":[0.023942234,0.013374634,0.05084658,0.005154068,0.0032245375,0.0021631054,0.01371626,0.11896183,0.17565209,0.41363806,0.1661687,0.0131579],"about_ca_topic_score_codex":0.000013012122,"about_ca_topic_score_gemma":0.000008060591,"teacher_disagreement_score":0.45709014,"about_ca_system_score_codex":0.000005062587,"about_ca_system_score_gemma":0.0000040982836,"threshold_uncertainty_score":0.5259223},"labels":[],"label_agreement":null},{"id":"W1578994341","doi":"10.37236/4915","title":"Mutually Unbiased Bush-type Hadamard Matrices and Association Schemes","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"University of Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Antipodal point; Hadamard transform; Association scheme; Bipartite graph; Complex Hadamard matrix; Upper and lower bounds; Mutually unbiased bases; Discrete mathematics; Hadamard matrix; Pure mathematics; Graph","score_opus":0.007296489678677821,"score_gpt":0.1924970514505779,"score_spread":0.18520056177190009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578994341","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.98045015,0.016478514,0.0008461197,0.00019756267,0.0010038841,0.00006476438,4.289503e-7,0.000041942018,0.00091664173],"genre_scores_gemma":[0.9986215,0.001033763,0.0000050814565,0.000019665726,0.00010773908,7.7918185e-7,4.5987693e-7,0.000016736027,0.0001942445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893856,0.00011164861,0.0002689639,0.000048041755,0.00033343068,0.0002993734],"domain_scores_gemma":[0.99921334,0.00015573036,0.00019606734,0.00010604677,0.0002503214,0.00007850848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017952295,0.000105632396,0.00019536378,0.000078794066,0.00005621462,0.000050171042,0.00021028046,0.000076445045,0.00000295124],"category_scores_gemma":[0.00015817686,0.00007664581,0.000048770682,0.00032713282,0.000015791205,0.00015838207,0.000014394927,0.0004490704,0.000006534021],"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.00020797734,0.000109844994,0.009400097,0.00009806507,0.00093652087,0.00001785576,0.0022917748,0.0026036068,0.0023401729,0.9671387,0.013689896,0.0011654819],"study_design_scores_gemma":[0.0033651013,0.0013781278,0.0013469935,0.00010171489,0.00032034962,0.00034178255,0.0015290908,0.0026497392,0.005473134,0.8913733,0.09163786,0.00048280903],"about_ca_topic_score_codex":0.0000023008217,"about_ca_topic_score_gemma":0.0000021885758,"teacher_disagreement_score":0.07794796,"about_ca_system_score_codex":0.00035793873,"about_ca_system_score_gemma":0.00014147122,"threshold_uncertainty_score":0.31255254},"labels":[],"label_agreement":null},{"id":"W1584410877","doi":"10.1016/j.disc.2015.06.025","title":"Homomorphisms of binary Cayley graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Foster graph; Bipartite graph; Discrete mathematics; Vertex-transitive graph; Edge-transitive graph; Petersen graph; Voltage graph; Graph; Line graph","score_opus":0.020814942163330904,"score_gpt":0.21761016459963592,"score_spread":0.196795222436305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584410877","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.9557551,0.000557539,0.0034117252,0.000010109681,0.0003892235,0.00017528882,0.000029365487,0.00024376706,0.039427876],"genre_scores_gemma":[0.99795693,0.000010098882,0.0018050557,0.0000045142647,0.000019466408,0.000012909486,0.000008271659,0.000031834003,0.0001509417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992923,0.000019682038,0.0002815443,0.000075715485,0.00017520245,0.00015553381],"domain_scores_gemma":[0.99945664,0.000035950143,0.000050696966,0.00032044502,0.000039443763,0.000096828306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025430406,0.00012818456,0.00024025181,0.000083796236,0.000017506058,0.000011265947,0.00016735848,0.000059855305,0.000024322677],"category_scores_gemma":[0.000024676163,0.00011003762,0.00008358165,0.00019423537,0.00005887361,0.000067802874,0.000022852568,0.000071881535,0.00006058904],"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.00001904207,0.00016736344,0.00061032013,0.0020400689,0.00028618381,0.000043936307,0.015827555,0.008351461,0.020995984,0.94356465,0.0077091367,0.00038429725],"study_design_scores_gemma":[0.0019573092,0.00041266368,0.00044504885,0.00085513724,0.0002340231,0.00015660052,0.016801491,0.11067164,0.0467645,0.8158948,0.0043991916,0.001407644],"about_ca_topic_score_codex":0.000003076585,"about_ca_topic_score_gemma":9.642953e-7,"teacher_disagreement_score":0.1276699,"about_ca_system_score_codex":0.000011743982,"about_ca_system_score_gemma":0.000008268882,"threshold_uncertainty_score":0.44872037},"labels":[],"label_agreement":null},{"id":"W158518767","doi":"","title":"Upon the existence of a removable circuit in a simple 3-connected Eularian graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Combinatorics; Epistemology","score_opus":0.015599871772160686,"score_gpt":0.19445154388921215,"score_spread":0.17885167211705147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158518767","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.9917437,0.00042818178,0.000012870042,0.000014464273,0.00071538833,0.00021026123,0.0000034591283,0.00011843753,0.0067532337],"genre_scores_gemma":[0.99984384,0.00003416504,0.000011914632,0.000014748361,0.0000039195993,0.000026266047,0.0000038025178,0.000022831526,0.000038506754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902415,0.000102534665,0.00030585233,0.00014702308,0.00015868348,0.0002617621],"domain_scores_gemma":[0.9993186,0.00012092565,0.000048811984,0.0004254648,0.000039976294,0.000046239762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033910305,0.00013595328,0.00023743266,0.00011466197,0.00008440104,0.000009547302,0.00029945237,0.00008374909,0.000026823978],"category_scores_gemma":[0.000055286553,0.000116365634,0.0000794862,0.0007407619,0.000065769804,0.000096760545,0.000022822273,0.00018581399,0.000014578647],"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.000014645922,0.0000586765,0.008083209,0.00007196836,0.000044412187,0.00005444516,0.0021015608,0.00044695157,0.00738195,0.981177,0.00042371725,0.00014149719],"study_design_scores_gemma":[0.0011801574,0.0000686403,0.024034936,0.0000825018,0.000013700424,0.00008249687,0.00043235527,0.0020675426,0.00756652,0.9627624,0.0014249096,0.00028384628],"about_ca_topic_score_codex":0.0001448033,"about_ca_topic_score_gemma":0.000040284,"teacher_disagreement_score":0.018414574,"about_ca_system_score_codex":0.000028741943,"about_ca_system_score_gemma":0.000018307837,"threshold_uncertainty_score":0.47452527},"labels":[],"label_agreement":null},{"id":"W1596450573","doi":"10.37236/4019","title":"Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Semiconductor Research Corporation","keywords":"Computer science; Leverage (statistics); Computer security; Theoretical computer science; Arithmetic; Discrete mathematics; Mathematical economics; Mathematics; Artificial intelligence","score_opus":0.013494369177216685,"score_gpt":0.2269681067281516,"score_spread":0.2134737375509349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596450573","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.34935015,0.014904859,0.5368851,0.0027486663,0.07400141,0.0059216954,0.0028106906,0.00080998597,0.012567443],"genre_scores_gemma":[0.9978925,0.00014141011,0.0002373004,0.00005025337,0.0014054084,0.000074039075,0.000053654985,0.000090077476,0.000055376982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701196,0.00035729588,0.0009237559,0.00020613286,0.00071065046,0.0007901809],"domain_scores_gemma":[0.99783415,0.00047130082,0.0005796829,0.00061084796,0.00032658785,0.00017745177],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018018401,0.00045694644,0.00071499695,0.00023562388,0.00046550372,0.00018355841,0.0012552291,0.00031744852,0.0003075161],"category_scores_gemma":[0.000075231976,0.000301965,0.0005094824,0.00043624372,0.00015397753,0.00008903384,0.00017630337,0.0026620436,0.000012696117],"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.00004403322,0.000036545865,0.0000043476825,0.000057132507,0.00065112044,0.0000039468214,0.00030234276,0.05654995,0.0001572188,0.92725766,0.014869556,0.00006615543],"study_design_scores_gemma":[0.00073013315,0.00019076339,0.000011514685,0.00025671357,0.0003188694,0.0005477376,0.0001244448,0.003463522,0.00026559774,0.96114486,0.032577597,0.00036822085],"about_ca_topic_score_codex":0.000015648784,"about_ca_topic_score_gemma":0.0000063730895,"teacher_disagreement_score":0.6485423,"about_ca_system_score_codex":0.0008872948,"about_ca_system_score_gemma":0.00086427614,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W1596689408","doi":"10.1007/978-3-540-73545-8","title":"Computing and combinatorics : 13th Annual International Conference, COCOON 2007 Banff, Canada, July 16-19, 2007 : proceedings","year":2007,"lang":"en","type":"book","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Approximation algorithm; Supertree; Discrete mathematics; Computer science; Phylogenetic tree","score_opus":0.006874799824019512,"score_gpt":0.19811840518549742,"score_spread":0.19124360536147791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596689408","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.0010666462,0.00081083307,0.0010922255,0.000020956406,0.0043960833,0.000391141,0.00017402368,0.0003331394,0.99171495],"genre_scores_gemma":[0.24525164,0.0001168332,0.00009560406,0.00025934246,0.0010162514,0.0000094047855,0.00023814873,0.00013365157,0.75287914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783325,0.000010575554,0.00060940126,0.00041642177,0.0005931657,0.0005371754],"domain_scores_gemma":[0.99869734,0.000111050605,0.00016627107,0.00015348662,0.0005302081,0.00034161372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005125306,0.00053408445,0.0005471956,0.00030153035,0.0001290485,0.00012486326,0.00041610736,0.00047862573,0.00040155774],"category_scores_gemma":[0.000031100477,0.0005649891,0.000065884946,0.00015412751,0.000101610225,0.00015214615,0.00010246344,0.00076365,0.000029933552],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013140518,0.000011557819,0.00033117353,0.00041517292,0.00017395677,0.000031918185,0.0002171331,0.00003958964,0.0000030436297,0.21461141,0.7835833,0.00056864205],"study_design_scores_gemma":[0.0005513643,0.00003947007,0.00022182763,0.00042028903,0.000044478405,0.00008866859,0.000544543,0.0024638562,0.000027359798,0.0049618804,0.9898681,0.00076815137],"about_ca_topic_score_codex":0.010785591,"about_ca_topic_score_gemma":0.015257335,"teacher_disagreement_score":0.24418499,"about_ca_system_score_codex":0.0008238996,"about_ca_system_score_gemma":0.00054007256,"threshold_uncertainty_score":0.99968016},"labels":[],"label_agreement":null},{"id":"W1597940416","doi":"10.37236/1780","title":"Steiner Triple Systems Intersecting in Pairwise Disjoint Blocks","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Waterloo","funders":"","keywords":"Disjoint sets; Pairwise comparison; Combinatorics; Mathematics; Steiner system; Order (exchange); Discrete mathematics; Statistics","score_opus":0.004361955931023079,"score_gpt":0.18012806763112676,"score_spread":0.1757661117001037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597940416","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.9810594,0.008235286,0.0071269497,0.00009007948,0.0021698065,0.0001675969,4.666089e-7,0.0000493389,0.0011010838],"genre_scores_gemma":[0.99952394,0.0002154389,0.0000012514411,0.00000794547,0.00012422598,0.0000056416775,2.6501036e-7,0.000029124982,0.00009217862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846846,0.00011528935,0.00058982347,0.00007448465,0.00025078954,0.0005011265],"domain_scores_gemma":[0.99941105,0.000081395636,0.00017635261,0.00020034458,0.0000693082,0.000061569895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001613925,0.00016212963,0.0003172985,0.00018323374,0.00005987306,0.00004265813,0.00036797152,0.00007099327,0.0000034537825],"category_scores_gemma":[0.00004488751,0.00011377024,0.00013147836,0.00046783636,0.000025426241,0.00013757702,0.000019903586,0.0009019332,0.0000047380818],"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.0000998453,0.00017940304,0.0005879199,0.00012699212,0.0002357678,0.000075633514,0.0032967082,0.189172,0.0026032429,0.8030234,0.00025427627,0.00034482311],"study_design_scores_gemma":[0.010402378,0.0019310032,0.0004917819,0.0013246891,0.00018763161,0.0028996058,0.0105275335,0.008440867,0.0089616375,0.946779,0.007089805,0.00096405955],"about_ca_topic_score_codex":0.0000225034,"about_ca_topic_score_gemma":0.000019204197,"teacher_disagreement_score":0.18073113,"about_ca_system_score_codex":0.0006773185,"about_ca_system_score_gemma":0.000103558596,"threshold_uncertainty_score":0.46394157},"labels":[],"label_agreement":null},{"id":"W1598186826","doi":"10.37236/1548","title":"Small Forbidden Configurations II","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Combinatorics; Mathematics; Notation; Permutation (music); Vertex (graph theory); Matrix (chemical analysis); Discrete mathematics; Graph; Physics; Arithmetic","score_opus":0.006646584142994286,"score_gpt":0.17528224717656196,"score_spread":0.16863566303356767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598186826","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.9657313,0.0055288104,0.002630554,0.0002455981,0.0005814539,0.00010142752,9.35863e-7,0.000057694942,0.025122177],"genre_scores_gemma":[0.9977624,0.0007212074,0.0000018026142,0.00002402271,0.00010339513,0.000002406576,4.997474e-7,0.000017454906,0.0013668289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991426,0.000064754466,0.0002903513,0.000039758503,0.00014290772,0.000319623],"domain_scores_gemma":[0.9995998,0.00006117129,0.00006462823,0.0001634695,0.00006261426,0.000048331483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058256957,0.000099280274,0.00015712928,0.000051418294,0.00015840125,0.000023255378,0.0003327868,0.00004745134,0.00015445823],"category_scores_gemma":[0.000009450527,0.00006997412,0.000103872866,0.00022237853,0.000025980564,0.00008768899,0.0000058795636,0.0004548754,0.00002520047],"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.000021290669,0.000041793002,0.000016424028,0.000010078027,0.00014543605,0.0000044594135,0.0006299495,0.0031832152,0.00096076453,0.9908716,0.0014473118,0.0026676627],"study_design_scores_gemma":[0.00082312233,0.0005032008,0.00015295445,0.00003425607,0.000085227766,0.00048702833,0.00019342951,0.0010719282,0.0031959466,0.86500704,0.12825453,0.00019135502],"about_ca_topic_score_codex":0.0000015496817,"about_ca_topic_score_gemma":0.000003541515,"teacher_disagreement_score":0.12680721,"about_ca_system_score_codex":0.00009521408,"about_ca_system_score_gemma":0.00006875927,"threshold_uncertainty_score":0.28534618},"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":"W1600003812","doi":"10.37236/1962","title":"Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Canadian Nautical Research Society","funders":"","keywords":"Mathematics; Generalization; Cartesian product; Hamming bound; Binary number; Combinatorics; Discrete mathematics; Perfect power; Metric (unit); Block code; Linear code; Algorithm; Arithmetic; Decoding methods","score_opus":0.0038938752042240923,"score_gpt":0.18445010385323013,"score_spread":0.18055622864900603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600003812","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.9824675,0.016249567,0.00017565348,0.00013972403,0.00020124848,0.000096714895,7.549355e-7,0.000013883424,0.0006550002],"genre_scores_gemma":[0.99859434,0.0012673491,0.0000048862776,0.000007836101,0.000074966636,0.0000018318291,2.2925018e-7,0.000017041646,0.000031490064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895597,0.00011593578,0.00038489344,0.00006061571,0.00017340179,0.00030917014],"domain_scores_gemma":[0.9994848,0.000106622254,0.00013211917,0.00015681503,0.000081607504,0.000038049737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012230235,0.00011859955,0.00027373928,0.00013814619,0.000033013177,0.000013075173,0.00020100512,0.000050882234,0.000002681145],"category_scores_gemma":[0.000051279225,0.00008676255,0.000050510997,0.00034862547,0.000043150783,0.00012487575,0.000013016113,0.00048481935,0.000001285986],"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.00012595534,0.00023954382,0.007873369,0.00034162428,0.00027190108,0.000020067751,0.0067412276,0.008689546,0.021185774,0.94689304,0.0003102993,0.00730763],"study_design_scores_gemma":[0.008208515,0.004072138,0.02054952,0.00095962314,0.00039667948,0.002329966,0.002975086,0.011092143,0.14072059,0.7761048,0.03121221,0.0013786914],"about_ca_topic_score_codex":0.000003388049,"about_ca_topic_score_gemma":0.000012810878,"teacher_disagreement_score":0.17078823,"about_ca_system_score_codex":0.00010771389,"about_ca_system_score_gemma":0.00008312875,"threshold_uncertainty_score":0.35380742},"labels":[],"label_agreement":null},{"id":"W1601784190","doi":"10.1002/jgt.21806","title":"Bipartite 2‐Factorizations of Complete Multipartite Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Multipartite; Mathematics; Combinatorics; Bipartite graph; Factorization; Complete bipartite graph; Discrete mathematics; Disjoint sets; Graph; Edge-transitive graph; Line graph; Graph power; Algorithm","score_opus":0.009481002985737785,"score_gpt":0.19545050325212707,"score_spread":0.18596950026638928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601784190","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.9284651,0.001001666,0.06507312,0.00001884162,0.0015864084,0.00010104934,0.000023111495,0.000074645766,0.0036560458],"genre_scores_gemma":[0.99939626,0.000078205616,0.0003348793,0.00002187164,0.000105736806,0.0000021631156,0.0000019220163,0.00002765394,0.000031307496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858457,0.00025259875,0.0006704606,0.00007451974,0.00022129763,0.00019653204],"domain_scores_gemma":[0.99889666,0.00029698625,0.0002839424,0.00024041557,0.00015910079,0.00012290114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012069107,0.00015055187,0.00037252973,0.00044825953,0.00006137133,0.000017592676,0.0002628616,0.00007182032,0.00006552952],"category_scores_gemma":[0.000096063064,0.00012625457,0.00030881588,0.00043098105,0.00013034158,0.00019162192,0.000012620825,0.00020424984,0.000011038988],"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.0001280482,0.000106490384,0.00911431,0.00021864018,0.00051336584,0.000006632394,0.001396554,0.01807451,0.13935746,0.82737863,0.000876948,0.002828403],"study_design_scores_gemma":[0.002439035,0.00060963247,0.021388095,0.00061985216,0.00032358826,0.00017239086,0.0007063432,0.0041998527,0.039191794,0.8969505,0.032671187,0.0007277205],"about_ca_topic_score_codex":0.0000011851857,"about_ca_topic_score_gemma":0.0000022014215,"teacher_disagreement_score":0.100165665,"about_ca_system_score_codex":0.000009679389,"about_ca_system_score_gemma":0.000008817609,"threshold_uncertainty_score":0.5148512},"labels":[],"label_agreement":null},{"id":"W1606071578","doi":"","title":"All 2-regular leaves of partial 6-cycle systems","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Horticulture; Biology","score_opus":0.006925416122718716,"score_gpt":0.19817404696321222,"score_spread":0.1912486308404935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606071578","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.9903467,0.0015844443,0.000037158487,0.000022232558,0.0026712578,0.0001423692,0.0000056070467,0.00022330912,0.0049668723],"genre_scores_gemma":[0.99973416,0.00002141873,0.000020584457,0.00000900922,0.000041687526,0.000019729041,0.000003537247,0.000029234932,0.000120663375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913186,0.000054121763,0.00029754356,0.00012273074,0.00016060415,0.00023312499],"domain_scores_gemma":[0.9994998,0.000036795325,0.000044379216,0.0003144776,0.000028504755,0.000076021744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022526404,0.00013513089,0.00023712119,0.00004613363,0.000030276626,0.00002061287,0.00018725227,0.00008905641,0.000024850311],"category_scores_gemma":[0.000009205681,0.00013713502,0.000074958596,0.00012055245,0.000038308808,0.00012986976,0.000018976923,0.00009307194,0.00009608221],"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.000011701754,0.000072306386,0.00094097015,0.00017242337,0.0001411703,0.0000047975304,0.00052455993,0.020961642,0.008724024,0.9647145,0.0031986944,0.00053316966],"study_design_scores_gemma":[0.0061745313,0.00042094107,0.004528067,0.0006394704,0.00027247542,0.00009098247,0.0015079773,0.15060845,0.29409415,0.23939319,0.3000311,0.0022386934],"about_ca_topic_score_codex":0.000019095827,"about_ca_topic_score_gemma":0.0000013641758,"teacher_disagreement_score":0.72532135,"about_ca_system_score_codex":0.000027876793,"about_ca_system_score_gemma":0.000006443708,"threshold_uncertainty_score":0.5592204},"labels":[],"label_agreement":null},{"id":"W1606300424","doi":"10.1023/a:1016588722296","title":"The Existence of Four HMOLS with Equal Sized Holes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Suzhou University; University of New South Wales; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Prime power; Mathematics; Combinatorics; Prime (order theory); Discrete mathematics; Pure mathematics","score_opus":0.02939402757677752,"score_gpt":0.19118167629087704,"score_spread":0.1617876487140995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606300424","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.89123017,0.009604195,0.08599125,0.00004880746,0.0001627624,0.0004093009,0.000024207835,0.00025525104,0.012274046],"genre_scores_gemma":[0.9983801,0.00059332675,0.0009228857,0.000012637477,0.000021266855,0.000030439172,7.015161e-7,0.000016706887,0.000021928528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993082,0.000058678906,0.00017726925,0.00011723437,0.00013237455,0.00020622922],"domain_scores_gemma":[0.9994828,0.00017872074,0.000040896633,0.00020776471,0.000032485692,0.000057308473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019384557,0.00013905636,0.00017657723,0.00007139376,0.00014646327,0.000053366304,0.00014018684,0.00004594464,0.0000157651],"category_scores_gemma":[0.0000054657335,0.000086962296,0.00007670479,0.00031237022,0.00027015028,0.00006369154,0.000009071334,0.000081632286,0.0000026975185],"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.00029682717,0.0001448783,0.014728135,0.000603502,0.0010238448,0.000054449956,0.004255465,0.0017056635,0.05441069,0.8661114,0.002550985,0.05411419],"study_design_scores_gemma":[0.02098237,0.008367001,0.055794615,0.0038358162,0.0015904865,0.0012106951,0.031067794,0.117434226,0.12595902,0.4811092,0.14305234,0.009596431],"about_ca_topic_score_codex":0.0000039798606,"about_ca_topic_score_gemma":0.000008078755,"teacher_disagreement_score":0.38500217,"about_ca_system_score_codex":0.0000020144837,"about_ca_system_score_gemma":0.000001969788,"threshold_uncertainty_score":0.35462195},"labels":[],"label_agreement":null},{"id":"W1628042023","doi":"10.1007/s11425-004-5192-y","title":"Minimal regular 2-graphs and applications","year":2006,"lang":"en","type":"article","venue":"Science in China Series A Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.003987348108826153,"score_gpt":0.19315499083618612,"score_spread":0.18916764272735997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1628042023","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.9830127,0.00018651616,0.0018569584,0.000030621402,0.0000798984,0.00020662743,0.0000037891054,0.00013798816,0.014484928],"genre_scores_gemma":[0.9945272,0.00001630992,0.005213419,0.0000024464923,0.000017167386,0.000056518365,7.5021904e-7,0.000009495443,0.00015667014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933696,0.000005560482,0.0001916322,0.00012774106,0.0001428503,0.00019525783],"domain_scores_gemma":[0.9996932,0.000019629873,0.0000245048,0.00021403376,0.000013530399,0.00003510416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035736637,0.00008966154,0.00011283276,0.0001386595,0.00011436118,0.0000733802,0.00018967318,0.000029420124,0.0000058640117],"category_scores_gemma":[0.000010297603,0.00008151169,0.000017517192,0.00066865893,0.00038425016,0.0002751244,0.000027923965,0.00006034831,0.0000053601207],"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.0000011738388,0.00003369227,0.0009143454,0.00023548273,0.0000017254462,0.000002192532,0.0011887978,0.00066728203,0.013480256,0.9827612,0.00006742143,0.0006464079],"study_design_scores_gemma":[0.00012595142,0.000024970008,0.008260914,0.00007507931,0.0000058266505,0.00007690302,0.0015893115,0.011389432,0.00544782,0.97085655,0.0018958806,0.00025134045],"about_ca_topic_score_codex":0.00000746264,"about_ca_topic_score_gemma":0.00002163642,"teacher_disagreement_score":0.014328257,"about_ca_system_score_codex":0.000016251099,"about_ca_system_score_gemma":0.000011375675,"threshold_uncertainty_score":0.33239502},"labels":[],"label_agreement":null},{"id":"W1651530065","doi":"10.37236/1776","title":"Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Group (periodic table); Combinatorics; Class (philosophy); Block (permutation group theory); Resolution (logic); Block size; Discrete mathematics; Computer science","score_opus":0.008638205555097384,"score_gpt":0.1994477517754778,"score_spread":0.1908095462203804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651530065","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.8575116,0.031937964,0.094824836,0.00034009438,0.0033239129,0.00066200545,0.00000791327,0.00037301437,0.011018674],"genre_scores_gemma":[0.99796534,0.0012587551,0.00007145994,0.00005452876,0.00024061992,0.0000103577295,0.0000038228522,0.00009356083,0.0003015659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967769,0.00016015898,0.0008321197,0.0002041076,0.0007208299,0.0013059133],"domain_scores_gemma":[0.9984943,0.00019963615,0.0003411706,0.0006051642,0.00015923486,0.00020047718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020839074,0.00040849586,0.0005817723,0.00030112677,0.0004294064,0.00017740292,0.001178565,0.000206351,0.00003404225],"category_scores_gemma":[0.00005198046,0.0002999202,0.00030315528,0.0009817198,0.000106782616,0.0005787465,0.00007579937,0.0015292055,0.000023780061],"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.00009486835,0.00010391813,0.00013836565,0.00007103876,0.0002647677,0.000024875153,0.00036074567,0.022398118,0.0042935386,0.97107404,0.0009908902,0.00018483952],"study_design_scores_gemma":[0.0019718835,0.0011242068,0.00034589597,0.000115312585,0.00011423941,0.00034647033,0.00031279374,0.0004041568,0.0058972347,0.9737345,0.015252349,0.00038095767],"about_ca_topic_score_codex":0.000034519904,"about_ca_topic_score_gemma":0.00003737345,"teacher_disagreement_score":0.14045374,"about_ca_system_score_codex":0.00075827126,"about_ca_system_score_gemma":0.00018609589,"threshold_uncertainty_score":0.9999453},"labels":[],"label_agreement":null},{"id":"W1661835338","doi":"","title":"Balanced generalized weighing matrices and their applications","year":2004,"lang":"en","type":"article","venue":"OPUS (Augsburg University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hadamard transform; Equivalence (formal languages); Affine transformation; Rank (graph theory); Combinatorics; Matrix (chemical analysis); Context (archaeology); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.0036747468428249075,"score_gpt":0.14849607064535986,"score_spread":0.14482132380253496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661835338","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.9596456,0.0008414939,0.033534195,0.00005974874,0.00018225984,0.00023519964,0.000019137753,0.00044994583,0.005032399],"genre_scores_gemma":[0.9989342,0.00023663962,0.00033031416,0.000010595141,0.000048386046,0.0000022768807,0.000006182224,0.000012662092,0.00041873934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999605,0.000015817242,0.000068119974,0.00012757136,0.000039198247,0.00014429254],"domain_scores_gemma":[0.9997295,0.0000179327,0.000020250798,0.00014797026,0.000014570312,0.00006977642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043125954,0.00010565995,0.00011956796,0.00014806332,0.00013392446,0.000024324689,0.0001335493,0.000055411878,0.000008541734],"category_scores_gemma":[9.707063e-7,0.00010636319,0.000040978568,0.00030952346,0.00003223538,0.00015123293,0.000023946288,0.000070806425,0.000013018611],"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.000028834302,0.0000387307,0.00050579896,0.00015194542,0.0001704837,0.000034488177,0.0013623621,0.012866385,0.43088314,0.5490687,0.00017041307,0.0047187386],"study_design_scores_gemma":[0.00585224,0.000084990126,0.000930233,0.00022552989,0.00015722968,0.00007918892,0.0065286243,0.003287576,0.27131662,0.06511389,0.64480674,0.0016171279],"about_ca_topic_score_codex":0.000028240114,"about_ca_topic_score_gemma":4.914273e-7,"teacher_disagreement_score":0.64463633,"about_ca_system_score_codex":0.00004788479,"about_ca_system_score_gemma":0.000008153285,"threshold_uncertainty_score":0.4337365},"labels":[],"label_agreement":null},{"id":"W1662264210","doi":"10.1109/ofc.2003.315966","title":"BER performance of an optical fast frequency-hopping CDMA system with multiple simultaneous users","year":2003,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Bit error rate; Frequency-hopping spread spectrum; Computer science; Code division multiple access; Interference (communication); Time-hopping; Electronic engineering; Spread spectrum; Bit rate; Telecommunications; Computer network; Detector; Engineering; Decoding methods","score_opus":0.004613419014371462,"score_gpt":0.1655175397938425,"score_spread":0.16090412077947105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1662264210","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.9657817,0.000045054665,0.0049872147,9.130065e-7,0.0001756485,0.00017561823,0.0000037949906,0.00030844146,0.028521607],"genre_scores_gemma":[0.9969394,0.000002073937,0.002872589,0.000004666467,0.000022044902,0.00001376949,0.000002610222,0.000036436188,0.000106394786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990986,0.000041104566,0.0002612979,0.00016415183,0.00016120415,0.00027366477],"domain_scores_gemma":[0.9994166,0.00009567346,0.000029994126,0.000296323,0.0000504227,0.00011100266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017507389,0.00017278078,0.0002327446,0.00006615678,0.00005769442,0.000019369398,0.0001241687,0.00008324625,0.00003134565],"category_scores_gemma":[0.0000193471,0.00013669925,0.00003924206,0.00017976093,0.000050754665,0.00018280912,0.000005251181,0.00011431818,0.000026801037],"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.00008139573,0.00008726948,0.025804045,0.0016374638,0.0002077026,0.000103194034,0.0011432199,0.87325054,0.041115668,0.055269837,0.000012500438,0.0012871319],"study_design_scores_gemma":[0.0011955547,0.00045825043,0.00089598144,0.0004834275,0.000045285833,0.0003814392,0.0049438407,0.9210407,0.069603674,0.00001763675,0.0002628881,0.0006712843],"about_ca_topic_score_codex":0.000020598662,"about_ca_topic_score_gemma":0.000045986802,"teacher_disagreement_score":0.0552522,"about_ca_system_score_codex":0.000040946685,"about_ca_system_score_gemma":0.000012026373,"threshold_uncertainty_score":0.5574434},"labels":[],"label_agreement":null},{"id":"W166850336","doi":"","title":"Disjoint Partial Triple Systems of Different Orders.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics","score_opus":0.0054992165173615055,"score_gpt":0.18026248925254648,"score_spread":0.17476327273518497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166850336","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.98935485,0.0005564266,0.00011935595,0.000006078764,0.005405605,0.00020582377,0.000008373049,0.00019504844,0.004148439],"genre_scores_gemma":[0.9997477,0.0000061461615,0.0000029968244,0.0000014936114,0.000025293266,0.0000364261,0.000010953055,0.000026377524,0.0001426308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908036,0.000056119014,0.00035232853,0.00012262553,0.00016490041,0.00022364983],"domain_scores_gemma":[0.9995661,0.000038134516,0.000053118172,0.00026536186,0.000028806762,0.00004849901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001245674,0.00015193161,0.00029009176,0.00006228297,0.000038275582,0.000022457545,0.00013483691,0.000077184326,0.00001951281],"category_scores_gemma":[0.0000069121656,0.00013617885,0.000089543784,0.00014898436,0.000034110177,0.000056819772,0.000017056624,0.00009116008,0.000022425547],"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.000011007702,0.000094755924,0.005050618,0.00017200514,0.00004429074,0.0000042853344,0.00007198125,0.001618341,0.0052000084,0.98442715,0.00325701,0.00004854228],"study_design_scores_gemma":[0.0083520515,0.0005867579,0.035983764,0.0006125595,0.00022177609,0.000040686933,0.0008370797,0.045039676,0.13142051,0.75336456,0.021526376,0.0020142205],"about_ca_topic_score_codex":0.00011647411,"about_ca_topic_score_gemma":0.000007085338,"teacher_disagreement_score":0.2310626,"about_ca_system_score_codex":0.00003174387,"about_ca_system_score_gemma":0.0000051421125,"threshold_uncertainty_score":0.5553212},"labels":[],"label_agreement":null},{"id":"W1669180421","doi":"10.1109/icc.2001.937332","title":"Mining the fibre-optic channel capacity in the local area: maximizing spectral efficiency in multi-wavelength optical CDMA networks","year":2002,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Code division multiple access; Computer science; Wavelength-division multiplexing; Channel (broadcasting); Optical performance monitoring; Spectral efficiency; Wavelength; Code (set theory); Electronic engineering; Optical fiber; Division (mathematics); Channel capacity; Passive optical network; Multiwavelength optical networking; Computer network; Telecommunications; Optics; Physics; Engineering; Mathematics","score_opus":0.04285557672486566,"score_gpt":0.19849357376796192,"score_spread":0.15563799704309628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669180421","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.92947775,0.00034589967,0.059624277,0.00013593797,0.00033516754,0.00033352565,9.2917276e-7,0.00013006188,0.009616441],"genre_scores_gemma":[0.9993289,0.000021549115,0.00038283068,0.000071351955,0.00008071531,0.000040850464,9.804938e-7,0.000025049847,0.000047757425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983797,0.0001541019,0.00038685818,0.00023558522,0.0001916963,0.00065204385],"domain_scores_gemma":[0.9991969,0.00036931154,0.000025358691,0.00033739148,0.000010350039,0.000060702165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008537464,0.00024326536,0.00024979256,0.00010665598,0.00011339801,0.000069348134,0.00040070497,0.00014212122,0.00006361702],"category_scores_gemma":[0.000038713537,0.00014785679,0.00009480482,0.0005601719,0.00014215289,0.00010772271,0.000031488646,0.0005886714,0.000025053285],"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.00001499806,0.00020262552,0.0017476067,0.000058603662,0.000030824085,0.00013860529,0.013737962,0.96659,0.00012062427,0.013750232,0.00021273969,0.003395193],"study_design_scores_gemma":[0.00044165397,0.000034631405,0.0045147426,0.00007356177,0.0000073206693,0.000087350694,0.0047489987,0.98962903,0.0000994092,0.000121312616,0.000030957588,0.00021102204],"about_ca_topic_score_codex":0.000055408298,"about_ca_topic_score_gemma":0.00039012037,"teacher_disagreement_score":0.06985115,"about_ca_system_score_codex":0.00006592541,"about_ca_system_score_gemma":0.0000032779926,"threshold_uncertainty_score":0.60294247},"labels":[],"label_agreement":null},{"id":"W167066395","doi":"","title":"A New Construction For Group Divisible Designs With Block Size Five and Few Groups.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Block size; Combinatorics; Arithmetic; Computer science; Operating system","score_opus":0.006824054315018605,"score_gpt":0.19564269927913483,"score_spread":0.1888186449641162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167066395","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.98697865,0.000314251,0.009596765,0.00001310798,0.0012978163,0.0004009392,0.000003622144,0.00022598499,0.0011688888],"genre_scores_gemma":[0.99726236,0.000010780217,0.0025197547,0.000012326115,0.000026023105,0.00001919109,0.0000027960155,0.000031807944,0.00011495125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992909,0.000016342525,0.00016530171,0.00016810247,0.000096367476,0.00026302773],"domain_scores_gemma":[0.9994102,0.00024591465,0.00003485755,0.0001505422,0.00002948809,0.00012896502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026564428,0.00015346624,0.00018133874,0.000056328317,0.00009618117,0.000040193812,0.00007677894,0.00008603786,0.000007559376],"category_scores_gemma":[0.000018015215,0.00014318549,0.000037036283,0.00018919396,0.00004201751,0.00012846559,0.0000117679865,0.000093386414,0.0000041801036],"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.0001233606,0.000024483454,0.0043291985,0.00013593194,0.00012226844,0.000009358256,0.0006464193,0.000085846834,0.003088963,0.9870787,0.0011438127,0.0032116268],"study_design_scores_gemma":[0.0072831437,0.0010834233,0.016515536,0.00025061477,0.00015836516,0.00024020504,0.0016979757,0.00092111796,0.0127164,0.9543429,0.0038362127,0.000954119],"about_ca_topic_score_codex":0.000023281633,"about_ca_topic_score_gemma":0.00002176568,"teacher_disagreement_score":0.032735843,"about_ca_system_score_codex":0.000029222534,"about_ca_system_score_gemma":0.000009905917,"threshold_uncertainty_score":0.5838935},"labels":[],"label_agreement":null},{"id":"W1679611287","doi":"10.1155/2015/528083","title":"Starter Labelling of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>-Windmill Graphs with Small Defects","year":2015,"lang":"lv","type":"article","venue":"International Journal of Combinatorics","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":"Algorithm; Artificial intelligence; Computer science","score_opus":0.018822687982401817,"score_gpt":0.2232062879342021,"score_spread":0.20438359995180028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1679611287","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.96438664,0.0013558435,0.0016534603,0.00010284492,0.0046132086,0.000021066733,0.000038789094,0.000036744284,0.027791416],"genre_scores_gemma":[0.9984424,0.00030351116,0.0004144372,0.00012613529,0.0004685775,0.0000199027,0.000032116397,0.00012483413,0.0000680662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969412,0.00012138557,0.00090376526,0.0002599561,0.0013193897,0.00045428608],"domain_scores_gemma":[0.99743813,0.00037490434,0.001023689,0.00038293374,0.00044293035,0.00033738898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011408344,0.00028404497,0.0002178504,0.00032907835,0.00012988967,0.00026108063,0.0008683157,0.00040770572,0.0007494898],"category_scores_gemma":[0.00024690316,0.00037917847,0.00046512033,0.00033659875,0.00018529582,0.00050117593,0.00018478149,0.0007088847,0.00015908208],"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.00046857697,0.00019214799,0.00014068384,0.00028822708,0.0012221511,0.0007282116,0.0018091021,0.005426247,0.00066336227,0.98602694,0.0028079022,0.00022641843],"study_design_scores_gemma":[0.011104277,0.007478559,0.000748768,0.007756522,0.0021907242,0.0070281136,0.006948169,0.34052485,0.56076014,0.035283048,0.017714912,0.0024618981],"about_ca_topic_score_codex":0.00009309603,"about_ca_topic_score_gemma":0.00004045934,"teacher_disagreement_score":0.9507439,"about_ca_system_score_codex":0.000026753261,"about_ca_system_score_gemma":0.00035248318,"threshold_uncertainty_score":0.999866},"labels":[],"label_agreement":null},{"id":"W168427437","doi":"","title":"Cordialness of cycles with parallel Pk-chords and multiple subdivision graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Combinatorics; Geography","score_opus":0.005601636298647363,"score_gpt":0.1951557387908735,"score_spread":0.18955410249222615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168427437","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.9966106,0.00046969604,0.00033031084,0.0000029321384,0.0007564393,0.00015247209,0.0000037295397,0.00012097723,0.0015528355],"genre_scores_gemma":[0.9998255,0.000034276563,0.00008456882,0.0000042900037,0.000004685625,0.0000043390314,0.000004007521,0.000026061804,0.000012308721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992696,0.000025095898,0.00021087706,0.00013529883,0.00014750584,0.00021159656],"domain_scores_gemma":[0.99949205,0.00013580653,0.00004433217,0.00020452896,0.000038403236,0.000084896186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033561548,0.00014233861,0.00021781962,0.000102300844,0.000055532768,0.0000138138985,0.00010401859,0.00007858046,0.0000051007632],"category_scores_gemma":[0.000013774108,0.0001241226,0.00003760346,0.00021920397,0.00008083041,0.00009757631,0.00001924676,0.00010074498,0.0000031658767],"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.00019322266,0.00009279663,0.26869848,0.00021636355,0.000112492526,0.000024911471,0.0007930642,0.00042545324,0.0049721505,0.7213793,0.00019898213,0.0028927962],"study_design_scores_gemma":[0.0057628504,0.00052960723,0.5693524,0.00034399654,0.00008007159,0.00004732273,0.001192836,0.0027949112,0.034446646,0.3832528,0.0012573439,0.00093924045],"about_ca_topic_score_codex":0.00004233227,"about_ca_topic_score_gemma":0.000026567195,"teacher_disagreement_score":0.33812648,"about_ca_system_score_codex":0.000009964794,"about_ca_system_score_gemma":0.0000043267214,"threshold_uncertainty_score":0.5061573},"labels":[],"label_agreement":null},{"id":"W170162790","doi":"","title":"Embeddings of Steiner Quadruple Systems.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner tree problem; Combinatorics","score_opus":0.009033768621034338,"score_gpt":0.18489732337680154,"score_spread":0.1758635547557672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170162790","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.9656065,0.0019271909,0.000021481743,0.000007042086,0.0032775523,0.00013559639,0.0000053823496,0.00024331316,0.028775912],"genre_scores_gemma":[0.9991276,0.000025982765,0.000010419279,0.0000043479326,0.000010626787,0.000017990818,0.0000016764538,0.000030058638,0.00077126146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922854,0.000036742807,0.00027372217,0.00011052389,0.00015195039,0.00019854768],"domain_scores_gemma":[0.9995191,0.00004757517,0.000044687335,0.0002851381,0.000040249928,0.00006325922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015809397,0.000128767,0.00023728854,0.000078501034,0.000032924636,0.000018892579,0.00016939126,0.00008009549,0.000110323264],"category_scores_gemma":[0.000013071414,0.00012753524,0.00006788903,0.00022464695,0.00002809748,0.00010070036,0.000015340058,0.000096972784,0.00015321567],"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.0000034940997,0.00005975202,0.0012929862,0.0003245545,0.000089033696,0.000008299602,0.0008314826,0.0019086814,0.0051971157,0.9760799,0.013944749,0.00025995955],"study_design_scores_gemma":[0.010312665,0.0010263231,0.0040835226,0.0018172088,0.00034420763,0.00022320224,0.0050930814,0.39969203,0.07034858,0.3133968,0.18935934,0.0043029953],"about_ca_topic_score_codex":0.000018207546,"about_ca_topic_score_gemma":5.366732e-7,"teacher_disagreement_score":0.66268307,"about_ca_system_score_codex":0.00002261547,"about_ca_system_score_gemma":0.000001735715,"threshold_uncertainty_score":0.52007365},"labels":[],"label_agreement":null},{"id":"W171333665","doi":"","title":"A Note on Distance-Regular Graphs with Girth 3.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Odd graph; Combinatorics; Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.0038080119001334136,"score_gpt":0.17997172265771003,"score_spread":0.1761637107575766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171333665","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.9881067,0.0001768712,0.00044936905,0.000037968017,0.001411961,0.00017697424,0.000005632071,0.00041004,0.009224477],"genre_scores_gemma":[0.9997445,0.000009571092,0.00006460437,0.000031258558,0.000007373455,0.00003012242,0.0000047870226,0.000042095216,0.00006573017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921906,0.000019847748,0.00013828953,0.00017423945,0.00018921615,0.00025934025],"domain_scores_gemma":[0.9994803,0.000023007287,0.000023963039,0.00035925332,0.000022827096,0.00009063577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093040246,0.00018505326,0.00017912145,0.00007366628,0.00007869586,0.000028894041,0.00016001369,0.00006885502,0.000009424181],"category_scores_gemma":[0.0000047498747,0.00015744231,0.000060189708,0.00031438298,0.000051279894,0.00009097619,0.000008137179,0.0001594651,0.000084071966],"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.00003218349,0.000046171077,0.00035783314,0.000036755202,0.000038784918,0.00003428389,0.0002810306,0.0047947075,0.0005339896,0.99349636,0.00015032684,0.00019756792],"study_design_scores_gemma":[0.0022157182,0.000293176,0.0015540074,0.0002096034,0.000020939378,0.000014885748,0.00007515354,0.00012317009,0.010232069,0.9796837,0.005171038,0.0004065578],"about_ca_topic_score_codex":0.000008893366,"about_ca_topic_score_gemma":0.000012559161,"teacher_disagreement_score":0.013812684,"about_ca_system_score_codex":0.000060828617,"about_ca_system_score_gemma":0.000012166197,"threshold_uncertainty_score":0.64203113},"labels":[],"label_agreement":null},{"id":"W171577813","doi":"","title":"Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00617502743079777,"score_gpt":0.18179463751196306,"score_spread":0.1756196100811653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171577813","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.9948895,0.0017000557,0.000060251426,0.00003106118,0.0008664902,0.00018506878,0.000006276515,0.00031578258,0.0019455203],"genre_scores_gemma":[0.9996993,0.000025963649,0.00015019109,0.000019988469,0.000010071129,0.000021750455,0.00001925637,0.0000381408,0.000015338243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895704,0.000062506515,0.0002493004,0.00024097558,0.00017002088,0.00032013765],"domain_scores_gemma":[0.9994439,0.00009901705,0.000047288435,0.00026931523,0.00004304329,0.00009746894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001725038,0.00024655266,0.00028161556,0.0001530681,0.00019043144,0.00009484483,0.00016974423,0.00008616012,0.000010409673],"category_scores_gemma":[0.000003881097,0.00022956837,0.00005457301,0.0003721734,0.00013412251,0.00020576551,0.000027743505,0.00016926377,0.00002009308],"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.000073258234,0.000114297465,0.08162345,0.00037978482,0.00022389929,0.00006254034,0.0010601671,0.0011473836,0.021842599,0.89068836,0.001979167,0.00080506416],"study_design_scores_gemma":[0.003146227,0.00031619475,0.03953231,0.0003160742,0.00014651968,0.00012687218,0.00041260064,0.0032176531,0.0080167,0.9355531,0.008021733,0.0011940182],"about_ca_topic_score_codex":0.00016666194,"about_ca_topic_score_gemma":0.000099869256,"teacher_disagreement_score":0.04486471,"about_ca_system_score_codex":0.000025320805,"about_ca_system_score_gemma":0.000008346318,"threshold_uncertainty_score":0.93615264},"labels":[],"label_agreement":null},{"id":"W1726244176","doi":"","title":"Comment on \\The Hadamard circulant conjecture\"","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University; University of Manitoba","funders":"","keywords":"Circulant matrix; Hadamard matrix; Conjecture; Mathematics; Hadamard transform; Combinatorics; Hadamard three-lines theorem; Hadamard's inequality; Hadamard's maximal determinant problem; Matrix (chemical analysis); Identity matrix; Complex Hadamard matrix; Permutation matrix; Physics; Eigenvalues and eigenvectors; Mathematical analysis; Quantum mechanics","score_opus":0.0678257273384302,"score_gpt":0.1462636615740821,"score_spread":0.0784379342356519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1726244176","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.9041727,0.00021321575,0.016405847,0.00040900116,0.003021788,0.00090582593,0.000082705235,0.0008378769,0.07395104],"genre_scores_gemma":[0.9990001,0.00008918715,0.0000053731064,0.0004292835,0.000078233265,0.0000029257008,0.000017141161,0.000039913586,0.0003378619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989147,0.0001556039,0.00015945829,0.00041410202,0.000062023704,0.0002940825],"domain_scores_gemma":[0.99872667,0.00011087181,0.0000758768,0.0009499595,0.000028979835,0.00010763815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002525051,0.00033882787,0.0003050621,0.00012532617,0.000118279255,0.000035301353,0.0006936472,0.00027781137,0.00023764516],"category_scores_gemma":[0.000008230671,0.00029494276,0.0002493456,0.00015894439,0.00008945602,0.000035067325,0.00021413162,0.000726712,0.00029535912],"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.000036482583,0.00005164144,0.0004893526,0.00017204852,0.00042732526,0.0002082046,0.00042534404,0.21302584,0.000047884096,0.7738914,0.011165287,0.00005920854],"study_design_scores_gemma":[0.002168853,0.00031665264,0.0022198602,0.0015633131,0.0008816572,0.000044661385,0.0016468054,0.17272961,0.0054895924,0.64833987,0.16065682,0.0039423252],"about_ca_topic_score_codex":0.000072548835,"about_ca_topic_score_gemma":0.000015291438,"teacher_disagreement_score":0.14949153,"about_ca_system_score_codex":0.00013336397,"about_ca_system_score_gemma":0.000020786723,"threshold_uncertainty_score":0.9999503},"labels":[],"label_agreement":null},{"id":"W1728359497","doi":"10.1016/j.laa.2011.03.042","title":"A characterization of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>λ</mml:mi><mml:mtext>,</mml:mtext><mml:mn>2</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:mrow></mml:math>-stable <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mrow><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>0</mml:mn><mml:mtext>,</mml:mtext><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:mrow></mml:math> matrices","year":2011,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","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":"St. Francis Xavier University; University of Calgary","funders":"","keywords":"Scroll; Matrix (chemical analysis); Mathematics; Cover (algebra); Row; Combinatorics; Algorithm; Computer science; Chemistry; Database; Philosophy; Theology; Chromatography","score_opus":0.015730651543428353,"score_gpt":0.22599528347422929,"score_spread":0.21026463193080094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1728359497","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.9139499,0.0069970815,0.0030260535,0.001001718,0.005296143,0.00056942203,0.0055952086,0.0017149679,0.06184948],"genre_scores_gemma":[0.9614923,0.007551639,0.0041278927,0.0021934928,0.0058246264,0.006744093,0.008025155,0.0033382592,0.0007025522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9695736,0.0016036709,0.007627131,0.006682265,0.0068074134,0.0077059045],"domain_scores_gemma":[0.97626686,0.0038910792,0.007695886,0.006865808,0.0011168323,0.004163528],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005961895,0.004197463,0.0020327982,0.0023625745,0.005612755,0.0047432254,0.007307491,0.008497402,0.053694293],"category_scores_gemma":[0.0027997056,0.0072929743,0.0056758192,0.005257188,0.004365608,0.005752141,0.0051936144,0.0061280103,0.0082413135],"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.0036910877,0.0018682602,0.000054477005,0.005200524,0.0063636457,0.0013796578,0.0061242282,0.003739435,0.013982871,0.884855,0.06676324,0.005977578],"study_design_scores_gemma":[0.0061017987,0.0043002088,0.00018844631,0.0042718276,0.00653789,0.0031191027,0.006590445,0.21171866,0.72386575,0.0049300655,0.021527164,0.0068486505],"about_ca_topic_score_codex":0.004422989,"about_ca_topic_score_gemma":0.0025169058,"teacher_disagreement_score":0.87992495,"about_ca_system_score_codex":0.0001336885,"about_ca_system_score_gemma":0.0036830015,"threshold_uncertainty_score":0.99834394},"labels":[],"label_agreement":null},{"id":"W173337542","doi":"","title":"Centers of Tensor Products of Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Tensor (intrinsic definition); Combinatorics; Pure mathematics","score_opus":0.006096749259206535,"score_gpt":0.1847817289992875,"score_spread":0.17868497974008096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173337542","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.9947578,0.0004261791,0.0000024833182,0.00002677255,0.0011014227,0.0001108457,0.000005098923,0.00007324462,0.0034962033],"genre_scores_gemma":[0.9998223,0.00001939122,0.000067272544,0.0000050427807,0.0000060118455,0.0000051201296,0.0000019955428,0.000016133408,0.000056713474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941754,0.00002282412,0.00023087395,0.00008804258,0.00010827372,0.00013241412],"domain_scores_gemma":[0.9996016,0.000019709933,0.00004625492,0.00024379534,0.000056221903,0.000032438606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013029817,0.00008797438,0.00018025363,0.0000817572,0.00001292126,0.0000028026304,0.00013304266,0.00004149064,0.000014042675],"category_scores_gemma":[0.000016853819,0.000086218985,0.00005638284,0.0002320874,0.00004358409,0.000069843605,0.000011204942,0.00006095333,0.000011236239],"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.000022918295,0.00015189576,0.011299123,0.000434989,0.00013072063,0.0000018253787,0.0007886522,0.00081201224,0.07802359,0.9035988,0.0035172347,0.0012182309],"study_design_scores_gemma":[0.0021131379,0.00021042893,0.017679313,0.00026054317,0.00006372774,0.000012740956,0.0003179423,0.0008457496,0.8144838,0.15191977,0.011599658,0.00049319497],"about_ca_topic_score_codex":0.000005076049,"about_ca_topic_score_gemma":8.074513e-7,"teacher_disagreement_score":0.75167906,"about_ca_system_score_codex":0.000010672474,"about_ca_system_score_gemma":0.000005257747,"threshold_uncertainty_score":0.3515908},"labels":[],"label_agreement":null},{"id":"W1735124671","doi":"10.37236/2345","title":"The 1/3-2/3 Conjecture for $N$-Free Ordered Sets","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Interval (graph theory); Ordered set; Partially ordered set; Set (abstract data type); Total order; Finite set; Discrete mathematics; Mathematical analysis","score_opus":0.004945317641066587,"score_gpt":0.20236732236204444,"score_spread":0.19742200472097785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1735124671","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.8135847,0.13597135,0.034072183,0.0021309864,0.010013364,0.0008327286,0.000008880667,0.00014505415,0.0032407406],"genre_scores_gemma":[0.9989196,0.00060915353,0.000004228333,0.000024798806,0.0002489618,0.000009389024,4.4532993e-7,0.000029060238,0.00015433274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987077,0.000096953336,0.0003035273,0.000037430535,0.00020466675,0.00064972835],"domain_scores_gemma":[0.99888635,0.00048282745,0.00014351934,0.00032033343,0.0000977838,0.00006916555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018725822,0.00013256304,0.00018388766,0.000036663565,0.0002468272,0.000038357695,0.00069217494,0.00006833021,0.0000038083065],"category_scores_gemma":[0.000112719805,0.0000699025,0.00015278831,0.00019044911,0.000041852574,0.000117262825,0.000021289721,0.0005189661,0.000003664284],"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.00004338065,0.000024095836,0.0000775059,0.000019762034,0.0002046494,4.1368688e-7,0.00040211566,0.00031133168,0.00023575664,0.9901583,0.0077517563,0.00077093556],"study_design_scores_gemma":[0.0010221595,0.00023318313,0.0001134209,0.000015830867,0.00008022685,0.0002402293,0.00029758623,0.00033603687,0.0017934986,0.8398713,0.15586647,0.00013004606],"about_ca_topic_score_codex":5.8364515e-7,"about_ca_topic_score_gemma":0.0000030491094,"teacher_disagreement_score":0.18533492,"about_ca_system_score_codex":0.0001316211,"about_ca_system_score_gemma":0.00006697991,"threshold_uncertainty_score":0.2850541},"labels":[],"label_agreement":null},{"id":"W175875804","doi":"","title":"Z-Cyclic Directed Moore (2, 6) Generalised Whist Tournament Designs on p elements where p = 7 (mod 12).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Tournament; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019217455684710814,"score_gpt":0.21000240372774406,"score_spread":0.19078494804303325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175875804","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.9836775,0.00045408163,0.000029712506,0.00003348499,0.00274468,0.0003256319,0.000011512273,0.0006823513,0.012041015],"genre_scores_gemma":[0.99852556,0.00014751006,0.00010350647,0.000055654353,0.00003543167,0.00008115431,0.000022774257,0.00007032635,0.0009581102],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984561,0.00011698947,0.00038867295,0.00026997563,0.00032608194,0.00044216102],"domain_scores_gemma":[0.99920595,0.000046571055,0.00006759487,0.0004589129,0.00004245492,0.00017849202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016427464,0.00029985522,0.00030743482,0.000119951204,0.00023225929,0.00003574127,0.00028345364,0.00012599459,0.00016893435],"category_scores_gemma":[0.000014544368,0.00030113044,0.000118511336,0.00023803119,0.000040292867,0.000118076125,0.000025857897,0.00023012454,0.00017639418],"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.0004202239,0.0017721223,0.038240913,0.00050007465,0.0016215256,0.00083256245,0.0058368775,0.010847183,0.12390703,0.3887154,0.42287263,0.0044334745],"study_design_scores_gemma":[0.040979955,0.0034705359,0.0768978,0.0020159055,0.00054451614,0.00045389123,0.0012193193,0.045112923,0.20544258,0.3395337,0.27487022,0.009458684],"about_ca_topic_score_codex":0.000026860822,"about_ca_topic_score_gemma":0.000014315389,"teacher_disagreement_score":0.14800243,"about_ca_system_score_codex":0.00018748143,"about_ca_system_score_gemma":0.00001814379,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W177027056","doi":"","title":"The values sqrt(2q) and log2q: their relationship with k-arcs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006421720995426841,"score_gpt":0.1782583689177718,"score_spread":0.17183664792234496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177027056","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.97915083,0.0013676578,0.0000073877945,0.00006603699,0.00044184775,0.0001231252,0.0000019044962,0.0001897793,0.018651426],"genre_scores_gemma":[0.9990585,0.00009249894,0.000011741213,0.000012409504,0.00000933638,0.000021163447,0.0000019049199,0.00002281488,0.0007696661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943197,0.00006807684,0.0001233814,0.00010806576,0.000088613226,0.00017989473],"domain_scores_gemma":[0.99942046,0.00023836635,0.000015230111,0.00025619543,0.000015916863,0.000053837044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024927652,0.00011883875,0.00010313159,0.000018043,0.00026759438,0.000058685113,0.0001237033,0.00005454463,0.000027593469],"category_scores_gemma":[0.000010998559,0.00007512922,0.000025321513,0.00014507836,0.00009314185,0.000095726,0.000007793013,0.00015114744,0.00004856052],"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.000032319578,0.00001787858,0.014694085,0.000026653945,0.00007364611,0.0000049179034,0.0014293727,0.0004673502,0.000069375805,0.97574997,0.001678962,0.0057554776],"study_design_scores_gemma":[0.0006922401,0.00009526676,0.04388678,0.000057185185,0.00002195263,0.0000337332,0.000458614,0.0012620252,0.00046657838,0.9321825,0.020574506,0.00026864503],"about_ca_topic_score_codex":0.0000052656346,"about_ca_topic_score_gemma":0.0000049856953,"teacher_disagreement_score":0.04356749,"about_ca_system_score_codex":0.00001418242,"about_ca_system_score_gemma":0.0000061234514,"threshold_uncertainty_score":0.30636805},"labels":[],"label_agreement":null},{"id":"W1776326016","doi":"10.1016/j.ffa.2015.09.003","title":"Symmetric Bush-type generalized Hadamard matrices and association schemes","year":2015,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Japan Society for the Promotion of Science; Soochow University","keywords":"Mathematics; Hadamard transform; Association scheme; Hadamard three-lines theorem; Hadamard's inequality; Prime power; Hadamard matrix; Hadamard product; Type (biology); Complex Hadamard matrix; Prime (order theory); Finite field; Combinatorics; Abelian group; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.014241497948721274,"score_gpt":0.2065913276532174,"score_spread":0.1923498297044961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1776326016","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.8787139,0.021293567,0.06559362,0.00066379266,0.00052129634,0.00082964293,0.00010153357,0.00064252387,0.031640097],"genre_scores_gemma":[0.9984871,0.0005708181,0.00029802092,0.000053604406,0.00010044437,0.00008236879,0.000022032398,0.000010645112,0.00037496001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995888,0.000019846371,0.00012160835,0.0001041147,0.000057030546,0.00010864086],"domain_scores_gemma":[0.99957246,0.00014262462,0.000033815602,0.00012470079,0.000052508454,0.00007388722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018036565,0.00008817026,0.0001144612,0.00008603726,0.00007314216,0.000051578885,0.00005827975,0.00011260127,0.000009655768],"category_scores_gemma":[0.00002897661,0.000075329684,0.00001997236,0.00033077996,0.000011361372,0.00006399785,0.000018323723,0.00009141113,0.000017917813],"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.00009313887,0.00019713554,0.038531482,0.0006812058,0.0009215967,0.0000026463279,0.0069003506,0.002797299,0.0031484202,0.8058741,0.035479534,0.1053731],"study_design_scores_gemma":[0.0010046624,0.00011323201,0.0020746891,0.000033666558,0.0000699696,0.000010815235,0.00076591194,0.028297234,0.001634028,0.07103525,0.8944067,0.00055387896],"about_ca_topic_score_codex":0.000014534578,"about_ca_topic_score_gemma":0.000005899129,"teacher_disagreement_score":0.85892713,"about_ca_system_score_codex":0.000014103988,"about_ca_system_score_gemma":0.000006703312,"threshold_uncertainty_score":0.30718553},"labels":[],"label_agreement":null},{"id":"W177822790","doi":"","title":"On Relatively Short Sides of Convex Hexagons.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Combinatorics; Geometry","score_opus":0.009605387970541978,"score_gpt":0.21682407100820955,"score_spread":0.20721868303766758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177822790","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.94877034,0.0001679267,0.00009622488,0.000004940054,0.0016598227,0.00010347967,0.0000027456672,0.00014066369,0.049053866],"genre_scores_gemma":[0.99981135,0.0000058004657,0.000023993509,0.000013374502,0.00000587523,0.0000039213082,0.0000022216498,0.000022891178,0.000110560744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992847,0.000027040289,0.0002470239,0.00010596273,0.00014185788,0.00019343193],"domain_scores_gemma":[0.99943775,0.00023042018,0.000024718342,0.0002091479,0.000033780318,0.00006417529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042598342,0.000118667645,0.00019274864,0.00009372235,0.000033514825,0.0000061469063,0.000119999306,0.000089267836,0.000030295107],"category_scores_gemma":[0.000037271995,0.00011793673,0.000063509826,0.0001920717,0.000050036106,0.00006128391,0.000011365541,0.00014641682,0.000047570702],"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.00002202225,0.00003685234,0.003668967,0.000037631882,0.000051937364,0.00001034569,0.00033253222,0.00016503851,0.0045936317,0.98977774,0.0008042558,0.00049904996],"study_design_scores_gemma":[0.0007170371,0.00024855154,0.030853024,0.00015177584,0.000025021369,0.000008985582,0.00039450332,0.00034355003,0.13748632,0.82719004,0.0022006184,0.0003805646],"about_ca_topic_score_codex":0.000004564676,"about_ca_topic_score_gemma":0.0000018123342,"teacher_disagreement_score":0.16258769,"about_ca_system_score_codex":0.000028643293,"about_ca_system_score_gemma":0.00000569388,"threshold_uncertainty_score":0.48093203},"labels":[],"label_agreement":null},{"id":"W1780283977","doi":"10.1109/isssta.1996.563811","title":"Optical CDMA by amplitude spectral encoding of spectrally-sliced light-emitting-diodes","year":2002,"lang":"en","type":"article","venue":"","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 Ottawa","funders":"","keywords":"Encoder; Computer science; Code division multiple access; Optics; Line code; Encoding (memory); Fiber optic splitter; Electronic engineering; Light-emitting diode; Bit error rate; Broadband; Optical power; Optical fiber; Optoelectronics; Physics; Decoding methods; Telecommunications; Laser; Engineering; Fiber optic sensor; Bandwidth (computing)","score_opus":0.009489451214890227,"score_gpt":0.18805047428154045,"score_spread":0.17856102306665023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780283977","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.7575419,0.00066756195,0.0034482821,0.000084721236,0.00028047772,0.00014336307,0.000006358787,0.00042162678,0.23740572],"genre_scores_gemma":[0.9975652,0.000045788376,0.0012407078,0.00002631806,0.00012936267,0.00000865199,0.000002609845,0.000033656055,0.0009477229],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875873,0.000026281603,0.0004034311,0.0002062795,0.00019210111,0.00041315475],"domain_scores_gemma":[0.99948967,0.00007546134,0.000035783996,0.00027364766,0.000019112256,0.00010634242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019701009,0.00020811427,0.00030971298,0.000083428036,0.00004914199,0.00004059811,0.00023005911,0.000109598055,0.0009016793],"category_scores_gemma":[0.000022114562,0.00019041123,0.00014156113,0.00020578268,0.00004240372,0.00012906322,0.000018872663,0.0001834442,0.00012821092],"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.000009321745,0.000104494095,0.0013632298,0.00018092495,0.0001482634,0.00001551378,0.000985535,0.0004892433,0.90279996,0.07985205,0.013464841,0.00058664114],"study_design_scores_gemma":[0.0006299864,0.00012490107,0.0005531754,0.0001056777,0.000042474705,0.000054038606,0.00050636765,0.009756023,0.97965455,0.0013636724,0.00658317,0.00062595116],"about_ca_topic_score_codex":0.00000868633,"about_ca_topic_score_gemma":0.0000054364837,"teacher_disagreement_score":0.24002329,"about_ca_system_score_codex":0.00003257341,"about_ca_system_score_gemma":0.000002161953,"threshold_uncertainty_score":0.9872756},"labels":[],"label_agreement":null},{"id":"W1781781209","doi":"10.1016/j.ejc.2016.12.005","title":"Hardness of computing clique number and chromatic number for Cayley graphs","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Circulant matrix; Mathematics; Cayley graph; Discrete mathematics; Chordal graph; Clique; Indifference graph; Quotient; Clique problem; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.016793337465747682,"score_gpt":0.2496986862510314,"score_spread":0.2329053487852837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781781209","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.96392107,0.00080195535,0.012428535,0.000014888504,0.006701509,0.00027612038,0.000021646118,0.000054033837,0.015780231],"genre_scores_gemma":[0.9988245,0.00021484395,0.00056347146,0.000006215258,0.00019211657,0.0000015113795,0.0000039347647,0.00010406543,0.000089351095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797136,0.0003544171,0.0010211616,0.00016485534,0.00025392373,0.00023426274],"domain_scores_gemma":[0.9977224,0.00015123768,0.0011435699,0.00046302966,0.0003678678,0.00015190631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022578642,0.00031789544,0.00083881844,0.00011425028,0.0001184201,0.00012356513,0.00066482,0.00011374548,0.000007502963],"category_scores_gemma":[0.00013696945,0.00030567555,0.0003331693,0.000069387905,0.00009177211,0.000108166736,0.00020454153,0.00071871607,0.000007615189],"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.00066001964,0.0016314699,0.1239348,0.07918575,0.010757679,0.0020930301,0.036975637,0.0352866,0.004257296,0.61978734,0.063829646,0.021600746],"study_design_scores_gemma":[0.01800355,0.0013101707,0.08980755,0.033393003,0.0025380396,0.0049985657,0.0017872285,0.020504827,0.007217,0.77329665,0.041503843,0.00563958],"about_ca_topic_score_codex":0.0000018576263,"about_ca_topic_score_gemma":2.38453e-7,"teacher_disagreement_score":0.15350932,"about_ca_system_score_codex":0.00003949917,"about_ca_system_score_gemma":0.000042333966,"threshold_uncertainty_score":0.99993956},"labels":[],"label_agreement":null},{"id":"W1782134016","doi":"10.1016/j.disc.2015.04.012","title":"Two-dimensional balanced sampling plans avoiding adjacent units","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Scholarship Council; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; Victoria University; University of Victoria","keywords":"Adjacency list; Sampling (signal processing); Mathematics; Column (typography); Point (geometry); Wright; Scheme (mathematics); Sampling scheme; Adjacency matrix; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Statistics; Geometry; Connection (principal bundle); Mathematical analysis","score_opus":0.04944068887286893,"score_gpt":0.25395106434571846,"score_spread":0.20451037547284953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782134016","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.9462628,0.00033089155,0.03079977,0.000025473688,0.00088990305,0.00025431803,0.000068239715,0.00058893114,0.020779707],"genre_scores_gemma":[0.9952561,0.0000027012784,0.0043831086,0.000021331307,0.000106815045,0.000015946016,0.000034743025,0.00004700404,0.00013219754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901336,0.000039328093,0.00029474567,0.00012530018,0.00024727033,0.00027999503],"domain_scores_gemma":[0.9993325,0.00013027739,0.000046912613,0.00026454654,0.00006121519,0.00016457756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046105083,0.00018724306,0.00024026119,0.00006486364,0.00008066278,0.000043857737,0.00015753203,0.000058617774,0.00002338455],"category_scores_gemma":[0.0000966967,0.00016484872,0.000048101698,0.0002126818,0.00002550156,0.000091681715,0.000036918078,0.0001835333,0.00013094206],"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.00004464741,0.00010804533,0.00086497696,0.001295694,0.00039936806,0.000050545696,0.02558087,0.60796964,0.025279177,0.3319696,0.0058457074,0.0005917524],"study_design_scores_gemma":[0.0031328858,0.000119539225,0.00012696667,0.0015417401,0.00015771136,0.0002221999,0.019809281,0.8436055,0.01725264,0.10665907,0.005600203,0.0017722412],"about_ca_topic_score_codex":0.000002672643,"about_ca_topic_score_gemma":0.000004256217,"teacher_disagreement_score":0.2356359,"about_ca_system_score_codex":0.000045643694,"about_ca_system_score_gemma":0.000018291339,"threshold_uncertainty_score":0.6722336},"labels":[],"label_agreement":null},{"id":"W178472531","doi":"","title":"All c-Bhaskar Rao Designs With Block Size 3 and c >= -1 Exist.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Block size; Combinatorics; Computer science","score_opus":0.01190397609527716,"score_gpt":0.20134943463475435,"score_spread":0.1894454585394772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178472531","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.9844158,0.00043303918,0.00003170048,0.000035056357,0.0006582265,0.00015353737,0.0000015757423,0.00028839908,0.013982635],"genre_scores_gemma":[0.99927676,0.000058979378,0.000118901386,0.000048243666,0.0000124033195,0.000022057755,0.0000015252895,0.000038475402,0.0004226633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992549,0.000042276453,0.0001436972,0.00016877709,0.00012013951,0.0002702158],"domain_scores_gemma":[0.9994766,0.00011079544,0.000022433582,0.00024874642,0.00002461402,0.00011678934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001657102,0.00017256942,0.00018978423,0.000038368686,0.000064792504,0.000042615156,0.000117716205,0.000078177465,0.000025626105],"category_scores_gemma":[0.000013715251,0.00015468318,0.000029866262,0.00017031899,0.000046482113,0.000102391576,0.000016324104,0.00012981646,0.000039246268],"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.00021883297,0.00021322747,0.023465764,0.00026166116,0.00058456697,0.00045113347,0.0026741866,0.0011320368,0.016766412,0.94535154,0.0075629875,0.0013176776],"study_design_scores_gemma":[0.00834653,0.0009021056,0.020356,0.0003491212,0.0002401681,0.00094869593,0.0009767896,0.0014697516,0.010379087,0.80389404,0.14995049,0.0021871922],"about_ca_topic_score_codex":0.000013713847,"about_ca_topic_score_gemma":0.00000589251,"teacher_disagreement_score":0.1423875,"about_ca_system_score_codex":0.000022385062,"about_ca_system_score_gemma":0.0000070667834,"threshold_uncertainty_score":0.6307797},"labels":[],"label_agreement":null},{"id":"W1790131601","doi":"","title":"Embeddings of Maximum Packings of Triples","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01395709014173337,"score_gpt":0.19350167484654723,"score_spread":0.17954458470481385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790131601","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.97484523,0.00021993468,0.000026951351,0.000001265094,0.0011542569,0.00007818863,0.0000044797607,0.00008527104,0.02358445],"genre_scores_gemma":[0.9998283,0.000013597385,0.0000864756,0.0000024029093,0.0000026747596,0.000005651979,0.000001175722,0.000019909343,0.000039824536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938756,0.000021801317,0.00026878697,0.000080885766,0.00010281795,0.00013813867],"domain_scores_gemma":[0.9995963,0.00003135478,0.0000697007,0.00021798378,0.00004569587,0.000038939917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018598215,0.000098729295,0.00022786827,0.00008049681,0.000014704501,0.000002843718,0.00017203657,0.000067788234,0.000077120145],"category_scores_gemma":[0.000017385273,0.00009821866,0.00008085988,0.00018050933,0.000053005762,0.00007679381,0.00001853132,0.00006809947,0.000011896026],"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.00002280138,0.00006555209,0.0069802934,0.0002458723,0.00008532966,0.000003246213,0.0031515437,0.0000124769695,0.018377168,0.96991676,0.00057074294,0.0005681898],"study_design_scores_gemma":[0.00063204346,0.000112003545,0.005365003,0.000109639164,0.000027058128,0.0000044262138,0.00044759936,0.00014754596,0.26785398,0.72453105,0.0005901272,0.00017952516],"about_ca_topic_score_codex":0.000025181242,"about_ca_topic_score_gemma":8.0616877e-7,"teacher_disagreement_score":0.24947679,"about_ca_system_score_codex":0.000008482967,"about_ca_system_score_gemma":0.000005242828,"threshold_uncertainty_score":0.40052408},"labels":[],"label_agreement":null},{"id":"W1798424565","doi":"10.13001/1081-3810.3117","title":"On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs","year":2016,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","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 Waterloo; University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Rank (graph theory); Sequence (biology); Diagonal; Principal (computer security); Binary number; Skew; Zero (linguistics); Characterization (materials science); Main diagonal; Discrete mathematics; Physics; Arithmetic; Geometry; Computer science","score_opus":0.007944830767194344,"score_gpt":0.2128902299548589,"score_spread":0.20494539918766455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798424565","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.9902345,0.007870408,0.00041307881,0.0001927923,0.0006470385,0.00020951885,0.000024263893,0.00003230425,0.00037610313],"genre_scores_gemma":[0.9970145,0.0026651316,0.000010082793,0.000024086345,0.00019262715,0.000009624844,0.0000028768136,0.000036879024,0.000044167755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981604,0.00017513364,0.000727169,0.00016270569,0.0003506288,0.0004239307],"domain_scores_gemma":[0.9987359,0.00027485203,0.00048765875,0.00031192615,0.00010328232,0.000086364125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011007645,0.00030323307,0.00055746536,0.00023323964,0.00006558911,0.00003202526,0.00047379927,0.00017719464,0.00005611334],"category_scores_gemma":[0.000051704523,0.0001763622,0.00032252967,0.00009917822,0.00014433388,0.00006426113,0.00006401449,0.0012158006,0.0000069287466],"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.00055432704,0.00016790038,0.0010016178,0.001366746,0.0029403036,0.000083921914,0.0027387172,0.0017899766,0.04652525,0.9389778,0.00051929813,0.0033341348],"study_design_scores_gemma":[0.0015948098,0.0012807547,0.0030263,0.003525872,0.0005281219,0.00078610214,0.00027791687,0.0011148158,0.02822076,0.9562537,0.0023832996,0.0010075594],"about_ca_topic_score_codex":0.0000023007901,"about_ca_topic_score_gemma":0.0000026293737,"teacher_disagreement_score":0.018304491,"about_ca_system_score_codex":0.00007054878,"about_ca_system_score_gemma":0.00014723335,"threshold_uncertainty_score":0.71918416},"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":"W1820995978","doi":"10.1109/icc.2002.997376","title":"On the cutoff rate of a variable-bit-rate (VBR) OFFH-CDMA system","year":2003,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Variable bitrate; Code division multiple access; Computer science; Decoding methods; Encoder; Bit error rate; Encoding (memory); Real-time computing; Cutoff; Electronic engineering; Algorithm; Bit rate; Computer network; Engineering","score_opus":0.006200433653193886,"score_gpt":0.15747194745339374,"score_spread":0.15127151380019985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1820995978","genre_codex":"other","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.43759927,0.00015307384,0.008845896,0.000028083428,0.0010504111,0.00038928378,0.000012254817,0.0004007087,0.551521],"genre_scores_gemma":[0.997554,0.0000038145179,0.00006847949,0.00007407673,0.000026584677,0.00003515188,0.0000012186949,0.000030018546,0.0022066236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99891055,0.00031091462,0.0003061779,0.00014074816,0.00009315873,0.00023845682],"domain_scores_gemma":[0.9991164,0.00029422098,0.00004819905,0.00045162404,0.000037518366,0.000052031668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128892,0.0001714644,0.00023608921,0.00006171226,0.00006725468,0.000027631315,0.00018302274,0.00008031141,0.000277612],"category_scores_gemma":[0.0000496414,0.00010846084,0.00007745271,0.00030399952,0.000030043468,0.000056759127,0.000008832539,0.0001293619,0.00019416315],"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.000010529397,0.000012710642,0.000025792875,0.00018192943,0.00007517264,0.0000034510929,0.00011431231,0.009094675,0.010783623,0.97745115,0.002227156,0.000019505596],"study_design_scores_gemma":[0.004777315,0.00069013174,0.0008504878,0.0028420466,0.00036863776,0.00022542186,0.010616484,0.16568306,0.577783,0.11610211,0.117127284,0.0029340102],"about_ca_topic_score_codex":0.000023312943,"about_ca_topic_score_gemma":0.0000027463218,"teacher_disagreement_score":0.86134905,"about_ca_system_score_codex":0.000028962819,"about_ca_system_score_gemma":0.000013851648,"threshold_uncertainty_score":0.44229046},"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":"W1830971984","doi":"10.1109/glocom.2001.965829","title":"A new transmitter-receiver architecture for noncoherent multirate OFFH-CDMA system with fixed optimal detection threshold","year":2002,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Transmitter; Code division multiple access; Computer science; Bit error rate; Electronic engineering; Code (set theory); Algorithm; Probability density function; Real-time computing; Telecommunications; Mathematics; Decoding methods; Statistics; Channel (broadcasting); Engineering","score_opus":0.009235404823184534,"score_gpt":0.17003756054738692,"score_spread":0.1608021557242024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830971984","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.23885559,0.00019535412,0.7527438,0.000029406658,0.00041862382,0.00087703747,0.000014040695,0.0007584523,0.0061077164],"genre_scores_gemma":[0.99474716,0.0000024538026,0.0031184065,0.00001935653,0.00018233572,0.00014284007,0.0000034458262,0.000060075996,0.0017239407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.00002375384,0.00023416536,0.00024141002,0.0001399962,0.00032638872],"domain_scores_gemma":[0.9995346,0.000036504523,0.000031256488,0.00023665142,0.00002711837,0.00013383442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007174658,0.00026229268,0.00025470468,0.000096731936,0.00008509874,0.00005246805,0.00013483026,0.0001194323,0.0001447664],"category_scores_gemma":[0.0000012933377,0.0001939011,0.00012906824,0.00016462516,0.0000172889,0.0000991309,0.0000047056,0.00015830024,0.000047345082],"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.00081457524,0.00012548787,0.0002858569,0.002632431,0.00094097794,0.000047352773,0.007432868,0.7387812,0.099472485,0.0020223488,0.00547826,0.14196616],"study_design_scores_gemma":[0.006280511,0.00096313446,0.00034822084,0.00052962115,0.0001868415,0.00026189908,0.0014577474,0.85733825,0.10966226,0.00006307525,0.021639854,0.0012685937],"about_ca_topic_score_codex":0.000040839648,"about_ca_topic_score_gemma":0.00025170535,"teacher_disagreement_score":0.75589156,"about_ca_system_score_codex":0.00005017244,"about_ca_system_score_gemma":0.0000040345344,"threshold_uncertainty_score":0.79070574},"labels":[],"label_agreement":null},{"id":"W1841438603","doi":"10.1109/ofc.2002.1036335","title":"Multiwavelength 'single-mode' erbium doped fiber laser for FFH-OCDMA testing","year":2002,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Erbium doped fiber amplifier; Erbium; Fiber laser; Materials science; Optoelectronics; Laser; Optical fiber; Wavelength-division multiplexing; Doping; Computer science; Optics; Telecommunications; Optical amplifier; Physics; Wavelength","score_opus":0.03889013954293606,"score_gpt":0.2135819597101589,"score_spread":0.17469182016722284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841438603","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.5825339,0.0004193036,0.007836093,0.00009612361,0.0013404493,0.0010282254,0.000051083316,0.002341022,0.40435383],"genre_scores_gemma":[0.9811145,0.000002041226,0.0063036005,0.00007030725,0.00024986448,0.000073125324,0.00000563404,0.00006454791,0.012116395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.000021987005,0.00026847873,0.00020523318,0.00010402923,0.00038838314],"domain_scores_gemma":[0.9993094,0.0002528377,0.000028019518,0.00025903192,0.000054953358,0.00009575632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013512492,0.00020389225,0.00021013718,0.000073843774,0.00009891584,0.000052375388,0.00014206058,0.000103245475,0.0006406756],"category_scores_gemma":[0.00007511619,0.0001847746,0.000095836906,0.00018721531,0.000021734437,0.00014893211,0.000017243685,0.00010703952,0.0004161117],"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.00013490449,0.0011465227,0.0027511443,0.0031540408,0.0012009852,0.00009505391,0.006946424,0.1407482,0.21023662,0.013919057,0.25869676,0.3609703],"study_design_scores_gemma":[0.0016349694,0.00014109617,0.00016227603,0.00013276309,0.00006346671,0.00003904186,0.0002328484,0.8143067,0.058698207,0.00096547604,0.12275033,0.00087283313],"about_ca_topic_score_codex":0.000011267636,"about_ca_topic_score_gemma":0.000011154848,"teacher_disagreement_score":0.6735585,"about_ca_system_score_codex":0.000026913334,"about_ca_system_score_gemma":0.0000020909274,"threshold_uncertainty_score":0.75348896},"labels":[],"label_agreement":null},{"id":"W1855352450","doi":"10.1007/s00373-015-1623-5","title":"Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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","funders":"","keywords":"Combinatorics; Stars; Mathematics; Graph; Complete graph; Computer science","score_opus":0.015044310037013401,"score_gpt":0.18577438856827067,"score_spread":0.17073007853125727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855352450","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.99434316,0.00084598194,0.003448541,0.00014217955,0.0002924078,0.00043443788,0.000029758967,0.00005177884,0.0004117254],"genre_scores_gemma":[0.999744,0.000047451886,0.00009117282,0.000029345978,0.000008836555,0.000035405184,0.0000014743069,0.000019756393,0.000022556113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999387,0.000018370849,0.00013201409,0.00013212634,0.00013766637,0.00019280546],"domain_scores_gemma":[0.999415,0.00019148503,0.000054638054,0.00018028302,0.0000740433,0.000084565945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560923,0.00014923252,0.00019958825,0.00005988895,0.00014970022,0.000055957295,0.00012592222,0.00003156289,4.99959e-7],"category_scores_gemma":[0.00001059722,0.00007968477,0.000028957858,0.00033558722,0.0002053444,0.00006120954,0.000027666401,0.00010076117,1.4996523e-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.00018790911,0.000010892841,0.027519844,0.0001873417,0.00026116197,0.0000024976437,0.0065257796,0.00047073854,0.000091684524,0.96237487,0.0006525172,0.0017147888],"study_design_scores_gemma":[0.0099602975,0.004693238,0.022761274,0.00073623355,0.00065909215,0.0005015958,0.1318135,0.0055784774,0.0061861887,0.78923213,0.02608137,0.0017965977],"about_ca_topic_score_codex":0.000055018314,"about_ca_topic_score_gemma":0.000048690414,"teacher_disagreement_score":0.1731427,"about_ca_system_score_codex":0.00000969022,"about_ca_system_score_gemma":0.000010557895,"threshold_uncertainty_score":0.32494506},"labels":[],"label_agreement":null},{"id":"W187688748","doi":"","title":"The generalized exponent sets of primitive, minimally strong digraphs (II).","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Exponent; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.008517221550269133,"score_gpt":0.2156154293940034,"score_spread":0.20709820784373428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187688748","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.9882313,0.0010122488,0.000042957847,0.000015731908,0.002096276,0.00020442391,0.0000056641034,0.00012777609,0.008263632],"genre_scores_gemma":[0.99970406,0.000055164273,0.00006154876,0.000007591331,0.000008743133,0.000016178363,0.000004770177,0.00002776832,0.000114159884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887556,0.000055635464,0.00037235915,0.00013266089,0.00021858612,0.00034520868],"domain_scores_gemma":[0.9992854,0.00017209441,0.00007068811,0.00033206271,0.000057319416,0.00008243117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063583214,0.0001621493,0.00020283101,0.000070900925,0.0001746633,0.000019771007,0.0002673754,0.00007923763,0.000011068762],"category_scores_gemma":[0.000021088128,0.00012935049,0.00012083623,0.00021485334,0.0000837102,0.0000746354,0.00004161267,0.0001310495,0.000007685383],"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.00006311592,0.000064250075,0.0024020185,0.00004250264,0.00015009767,0.0000094559655,0.00084383454,0.00011090902,0.02492549,0.9686287,0.0011402238,0.0016194085],"study_design_scores_gemma":[0.0074579227,0.00088637066,0.1322106,0.0003491799,0.00018661545,0.000037626138,0.0035735443,0.0019848123,0.37199327,0.43663523,0.042951003,0.0017338354],"about_ca_topic_score_codex":0.000011755655,"about_ca_topic_score_gemma":0.000013376971,"teacher_disagreement_score":0.53199345,"about_ca_system_score_codex":0.00003079943,"about_ca_system_score_gemma":0.000010611917,"threshold_uncertainty_score":0.52747595},"labels":[],"label_agreement":null},{"id":"W1878001422","doi":"10.1007/s10623-015-0162-7","title":"On generalized Howell designs with block size three","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Permutation (music); Lambda; Block (permutation group theory); Steiner system; Column (typography); Constant (computer programming); Discrete mathematics; Connection (principal bundle); Geometry; Physics; Computer science","score_opus":0.029166425862312675,"score_gpt":0.2086252813018232,"score_spread":0.1794588554395105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878001422","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.92668325,0.0014945656,0.062276997,0.000027125212,0.00023534212,0.0004065255,0.000018932398,0.00050794816,0.008349312],"genre_scores_gemma":[0.9958812,0.000069011956,0.0037168763,0.0001049371,0.00007142192,0.00006509907,0.0000048046904,0.000055880897,0.00003077677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988338,0.00008524789,0.00020071039,0.0002749386,0.00023686279,0.0003684478],"domain_scores_gemma":[0.9991542,0.0001509242,0.000038441267,0.00032135413,0.000056191886,0.00027888498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029805832,0.00031357296,0.0003140718,0.00016984454,0.00010850758,0.000102447535,0.0001594536,0.00011586394,0.00002617433],"category_scores_gemma":[0.000011386464,0.0002437208,0.000103142935,0.0004457016,0.00011640404,0.000095332645,0.000012672058,0.00015382531,0.0000185521],"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.002954929,0.00065609365,0.03487961,0.0006413787,0.0026063032,0.00041429728,0.0050762678,0.07131799,0.054565,0.76988184,0.04864618,0.00836013],"study_design_scores_gemma":[0.033015758,0.013438045,0.022222253,0.0015681746,0.0014881284,0.0009248362,0.0046982146,0.0506482,0.06433235,0.72239804,0.07454549,0.010720487],"about_ca_topic_score_codex":0.000019459672,"about_ca_topic_score_gemma":0.000038622406,"teacher_disagreement_score":0.06919794,"about_ca_system_score_codex":0.000011700049,"about_ca_system_score_gemma":0.0000139673975,"threshold_uncertainty_score":0.99386454},"labels":[],"label_agreement":null},{"id":"W1891427623","doi":"10.1016/j.jctb.2014.11.005","title":"Edge-colouring seven-regular planar graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Mitsubishi Foundation; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Multigraph; Combinatorics; Mathematics; Conjecture; Complement (music); Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Set (abstract data type); Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.010203735005251237,"score_gpt":0.20080065200930536,"score_spread":0.19059691700405412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891427623","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.95406944,0.0023207902,0.00064885564,0.00006445305,0.029362641,0.00015006156,0.000005919214,0.0001723375,0.013205534],"genre_scores_gemma":[0.9985861,0.000040889467,0.0001241088,0.000016717182,0.0009458937,0.0000034741588,0.0000011629468,0.000042812775,0.00023884041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840593,0.00027028285,0.0005705167,0.000092827606,0.0003762734,0.00028417664],"domain_scores_gemma":[0.99895084,0.00011516989,0.0002004103,0.00024009096,0.00021390735,0.00027956723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019931404,0.00021917424,0.0004466857,0.00020950756,0.000079781574,0.0000682269,0.00040014926,0.0001457073,0.000038868107],"category_scores_gemma":[0.0001381409,0.0001935824,0.00020367507,0.000259217,0.000099194825,0.00057467766,0.00002363384,0.0003628079,0.000018529834],"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.00079598255,0.00005628127,0.0001643046,0.000057559453,0.0002793271,0.00013814065,0.0018497685,0.0015470391,0.0018887976,0.9871097,0.00564368,0.00046938067],"study_design_scores_gemma":[0.0015724119,0.0004576704,0.00005932134,0.00009678163,0.000054580665,0.00043309544,0.001749809,0.000020750607,0.0076664845,0.93932813,0.04830691,0.0002540463],"about_ca_topic_score_codex":8.9259873e-7,"about_ca_topic_score_gemma":4.4898246e-7,"teacher_disagreement_score":0.047781598,"about_ca_system_score_codex":0.0000799063,"about_ca_system_score_gemma":0.000062384555,"threshold_uncertainty_score":0.78940606},"labels":[],"label_agreement":null},{"id":"W1899294640","doi":"10.1007/s10623-015-0123-1","title":"A Latin square autotopism secret sharing scheme","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","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":"Dalhousie University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Latin square; Secret sharing; Scheme (mathematics); Initialization; Computer science; Square (algebra); Theoretical computer science; Shamir's Secret Sharing; Homomorphic secret sharing; Algorithm; Mathematics; Cryptography","score_opus":0.0431490186133615,"score_gpt":0.22567523647646529,"score_spread":0.1825262178631038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899294640","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.9570018,0.0022503796,0.029221019,0.00001918334,0.00028463802,0.00024298897,0.000017328242,0.0006675622,0.010295081],"genre_scores_gemma":[0.9967591,0.000045862438,0.0029438818,0.000037880407,0.00007922247,0.000047180933,0.0000120875275,0.000033264394,0.000041486062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913204,0.000032344375,0.00019708775,0.00021333086,0.00014361518,0.0002815734],"domain_scores_gemma":[0.9994652,0.000028488865,0.000025997686,0.00023408969,0.000037494035,0.00020871291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027217125,0.00019478342,0.00021176605,0.00018234104,0.00008378124,0.00010303115,0.00014061062,0.00010504279,0.00003038098],"category_scores_gemma":[0.000008420382,0.00018519179,0.00009452534,0.00035939025,0.000057263565,0.00012415826,0.000029545938,0.0001391178,0.00001569607],"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.000110742345,0.00011557356,0.23648147,0.00085635995,0.00061852456,0.00009739793,0.0111778,0.0029828574,0.027277203,0.7030614,0.008663964,0.008556684],"study_design_scores_gemma":[0.008345997,0.0013051586,0.056912895,0.0013887295,0.0003294696,0.00022230673,0.014918789,0.28446206,0.0155565655,0.44887266,0.16197929,0.0057060905],"about_ca_topic_score_codex":0.000020221802,"about_ca_topic_score_gemma":0.000008864843,"teacher_disagreement_score":0.2814792,"about_ca_system_score_codex":0.000009388784,"about_ca_system_score_gemma":0.000006997053,"threshold_uncertainty_score":0.7551902},"labels":[],"label_agreement":null},{"id":"W1903527885","doi":"10.1016/j.tcs.2016.05.015","title":"A dichotomy theorem for circular colouring reconfiguration","year":2016,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University; McGill University","keywords":"Control reconfiguration; Vertex (graph theory); Combinatorics; Mathematics; Graph; PSPACE; Discrete mathematics; Computational complexity theory; Computer science; Algorithm","score_opus":0.010654360260838465,"score_gpt":0.22518936423400743,"score_spread":0.21453500397316896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903527885","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.09495067,0.00009409695,0.8923206,0.00010063375,0.0030331418,0.0008053866,0.000029578816,0.0004892241,0.008176707],"genre_scores_gemma":[0.9953416,0.000008457266,0.003820137,0.00005091966,0.0005508436,0.00017369213,0.0000059659533,0.00003890047,0.0000094735715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997984,0.000089517904,0.0003808144,0.0006303814,0.00035065875,0.00056462124],"domain_scores_gemma":[0.99854046,0.00029016635,0.0000701251,0.0007392217,0.00015736872,0.0002026608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018687163,0.0003141966,0.00036474297,0.00020421541,0.00024238172,0.0002976769,0.0011549839,0.00021050853,0.000050973948],"category_scores_gemma":[0.00006129614,0.00024448233,0.00017804804,0.0002121539,0.0014712613,0.00015904759,0.00031681327,0.00030595402,0.000039141574],"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.000013496264,0.000010163172,0.000006581255,0.00020885642,0.000023390987,0.000003016621,0.00026010882,0.0018038664,0.0043357536,0.98607844,0.000054718694,0.0072015775],"study_design_scores_gemma":[0.00019475847,0.000046756868,0.000045792414,0.00032675805,0.00001759205,0.00001306978,0.000005913834,0.25652948,0.01403433,0.72813195,0.00030284884,0.00035075602],"about_ca_topic_score_codex":3.4369944e-7,"about_ca_topic_score_gemma":1.5077336e-7,"teacher_disagreement_score":0.9003909,"about_ca_system_score_codex":0.00011688984,"about_ca_system_score_gemma":0.00007084111,"threshold_uncertainty_score":0.99697006},"labels":[],"label_agreement":null},{"id":"W190917613","doi":"","title":"The Use of Sklem Sequences to Generate Perfect One-Factorizations.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.030652822980997554,"score_gpt":0.21840171629374663,"score_spread":0.18774889331274908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190917613","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.9958576,0.0001850285,0.00018802266,0.000044309872,0.002092171,0.0001568897,0.00000493998,0.000111647176,0.0013594045],"genre_scores_gemma":[0.99945503,0.000104054656,0.000058328354,0.000017469481,0.000014043043,0.000022640917,0.0000028373117,0.000018317394,0.00030726084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932116,0.00006737579,0.00019689657,0.000099291276,0.00013311939,0.00018214293],"domain_scores_gemma":[0.9994376,0.00013944284,0.000028397462,0.0002699332,0.000060764116,0.00006388781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016842948,0.00010144379,0.00012616933,0.000047944555,0.00013013353,0.00006142943,0.00017775953,0.0000457547,0.000019457573],"category_scores_gemma":[0.000046532416,0.00008083627,0.000045696386,0.00036550325,0.000031251966,0.00012850964,0.000018249248,0.00007334606,0.000035820813],"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.0000170014,0.000037909842,0.010732826,0.000029836847,0.00011275272,0.0000054932957,0.00070255913,0.01556167,0.02742633,0.9410208,0.0026694664,0.0016833586],"study_design_scores_gemma":[0.001812106,0.0006481628,0.024823884,0.00034269824,0.00014530522,0.000045678946,0.00069879065,0.01966183,0.17995457,0.37343523,0.39672533,0.0017064182],"about_ca_topic_score_codex":0.000024526878,"about_ca_topic_score_gemma":0.000011747405,"teacher_disagreement_score":0.5675856,"about_ca_system_score_codex":0.000027393991,"about_ca_system_score_gemma":0.000011576166,"threshold_uncertainty_score":0.32964075},"labels":[],"label_agreement":null},{"id":"W191044012","doi":"","title":"Cycles Containing Given Subsets in 1-Tough Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009577903490147092,"score_gpt":0.21043725183450446,"score_spread":0.20085934834435737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191044012","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.98178935,0.0006358278,0.000007811362,0.000027536711,0.0017461856,0.00013032576,0.0000019622967,0.00026820265,0.015392809],"genre_scores_gemma":[0.99977165,0.000071106966,0.000012996777,0.000021881939,0.000008248371,0.000028853574,0.00000578418,0.00003166554,0.000047815924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909997,0.0000594261,0.00024138932,0.00015655553,0.000119685006,0.0003229776],"domain_scores_gemma":[0.9995847,0.000071233386,0.000025883623,0.00022790281,0.00001807241,0.00007221359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024694452,0.00015759384,0.00021914316,0.0001473635,0.00005005187,0.000029273164,0.0001864204,0.00009637901,0.000040250914],"category_scores_gemma":[0.000016313297,0.00017158131,0.00006386049,0.0003956989,0.000030731466,0.00015505767,0.000019177483,0.00018332122,0.00008006942],"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.000038753064,0.00006634166,0.1573282,0.0000487802,0.00005816419,0.00019979001,0.0014595687,0.0008895503,0.0014318879,0.8355427,0.0011711874,0.0017650992],"study_design_scores_gemma":[0.001964482,0.00008247138,0.06957824,0.00015477768,0.000013592287,0.000046072546,0.0007494564,0.0016535603,0.0014511648,0.9165619,0.0072147325,0.0005295446],"about_ca_topic_score_codex":0.00004450626,"about_ca_topic_score_gemma":0.00003835451,"teacher_disagreement_score":0.087749965,"about_ca_system_score_codex":0.000041949283,"about_ca_system_score_gemma":0.000006250502,"threshold_uncertainty_score":0.69968826},"labels":[],"label_agreement":null},{"id":"W1921367233","doi":"10.37236/717","title":"Genetic Algorithms Applied to Problems of Forbidden Configurations","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Simple (philosophy); Matrix (chemical analysis); Combinatorics; Mathematics; Permutation (music); Algorithm; SIMPLE algorithm; Column (typography); Discrete mathematics; Geometry; Connection (principal bundle); Physics","score_opus":0.01169907123761127,"score_gpt":0.18765395701796503,"score_spread":0.17595488578035376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921367233","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.8376367,0.0046086716,0.1344847,0.00005452097,0.0010771184,0.0005730083,0.000002793994,0.000064272084,0.021498209],"genre_scores_gemma":[0.99966425,0.00015467322,0.00004748816,0.000009571842,0.00004689156,0.000009516391,2.0800086e-7,0.000020936981,0.000046449582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990047,0.000038452883,0.00041608486,0.00005076645,0.00019212198,0.00029787733],"domain_scores_gemma":[0.99944055,0.000041655345,0.00014453667,0.00019377205,0.00011539441,0.00006409914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004995752,0.00010726927,0.00021692012,0.00010413304,0.00004677418,0.000009136058,0.00038528166,0.000046375466,0.000020614483],"category_scores_gemma":[0.000009593332,0.00007802438,0.000080027894,0.00031324715,0.00002789837,0.00004693745,0.000012559927,0.00028439454,0.000009323023],"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.000026707246,0.00007145923,0.00006327481,0.000048569113,0.00021718224,0.0000020018583,0.0029093868,0.0032665576,0.010066292,0.9819325,0.00029297857,0.0011030749],"study_design_scores_gemma":[0.0008594491,0.00084511144,0.0013886557,0.00006478167,0.00013021058,0.00018032706,0.00062389567,0.0006660056,0.03325145,0.9582872,0.003458678,0.00024428155],"about_ca_topic_score_codex":0.0000039865618,"about_ca_topic_score_gemma":0.0000032491503,"teacher_disagreement_score":0.16202755,"about_ca_system_score_codex":0.00006700144,"about_ca_system_score_gemma":0.00006953048,"threshold_uncertainty_score":0.31817418},"labels":[],"label_agreement":null},{"id":"W192156423","doi":"","title":"Multidecompositions of the complete graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.007819124245561936,"score_gpt":0.19302755839102267,"score_spread":0.18520843414546073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192156423","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.9935595,0.00012864944,0.000088909794,0.000043019078,0.0020401317,0.00012526264,0.000013163226,0.00010757635,0.0038938182],"genre_scores_gemma":[0.9998815,0.000004502322,0.000057671874,0.000015306725,0.0000033598658,0.000010657425,0.0000022153065,0.000013217759,0.000011535522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953616,0.000026108277,0.00015786548,0.00006651292,0.000093694165,0.000119637334],"domain_scores_gemma":[0.9996164,0.000028319115,0.000026072954,0.0002726623,0.000024040763,0.000032524957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007328834,0.000080868005,0.000111915346,0.000037888796,0.0000787291,0.0000075992943,0.00019812406,0.000036375248,0.000009648257],"category_scores_gemma":[0.0000055912133,0.000064415115,0.00009852806,0.00023768266,0.000058768237,0.0000459813,0.000020136384,0.00009374927,0.000021716874],"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.0000016746375,0.000033627744,0.0007505268,0.000027047881,0.00003424434,9.4811503e-7,0.00026031843,0.0059297825,0.018320825,0.9744208,0.00018952756,0.000030707037],"study_design_scores_gemma":[0.00085763296,0.000025354868,0.011728155,0.000084030966,0.000017887292,0.000009854304,0.00008070007,0.00020229186,0.02437338,0.96167815,0.00080327614,0.00013926618],"about_ca_topic_score_codex":0.00002175782,"about_ca_topic_score_gemma":0.000006293935,"teacher_disagreement_score":0.0127426,"about_ca_system_score_codex":0.000020217009,"about_ca_system_score_gemma":0.0000064295336,"threshold_uncertainty_score":0.26267722},"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":"W1930072229","doi":"10.1109/pacrim.1997.620372","title":"Network architecture for a high bandwidth WDMA/CDMA local area network","year":2002,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Bandwidth (computing); Computer science; Computer network; Code division multiple access; Architecture; W-CDMA","score_opus":0.008984655532222746,"score_gpt":0.16242536961910295,"score_spread":0.1534407140868802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930072229","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.018893145,0.0024767201,0.9395886,0.00020889971,0.0022329865,0.0006636559,0.00001568922,0.0011164281,0.03480388],"genre_scores_gemma":[0.99417174,0.00001810811,0.0021733136,0.00028807585,0.0013170772,0.00010295264,0.000013517891,0.000056945362,0.0018582421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987877,0.00003547658,0.00024988857,0.00021054943,0.000109977394,0.0006063992],"domain_scores_gemma":[0.99937946,0.00015511463,0.000024380908,0.0003001192,0.000019583997,0.000121363344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018168347,0.00023656414,0.0002797631,0.000036295853,0.00012864044,0.000039685605,0.00018416981,0.00015006032,0.0006381812],"category_scores_gemma":[0.0000062007152,0.00019852644,0.00012504104,0.0002671837,0.00004195094,0.000048906895,0.000018542969,0.00017971982,0.00008213095],"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.000022416378,0.000013139159,0.0001652634,0.00006577114,0.00007886516,0.0000057048755,0.000118063675,0.75628364,0.000021672497,0.034131072,0.196564,0.012530372],"study_design_scores_gemma":[0.0018564402,0.00029127143,0.00054360647,0.00024634946,0.00009980971,0.00008487421,0.00011505164,0.4236687,0.00031723737,0.16136041,0.4101702,0.0012460342],"about_ca_topic_score_codex":0.0000072575226,"about_ca_topic_score_gemma":0.0000536426,"teacher_disagreement_score":0.9752786,"about_ca_system_score_codex":0.000021615682,"about_ca_system_score_gemma":0.0000022954757,"threshold_uncertainty_score":0.80956733},"labels":[],"label_agreement":null},{"id":"W193517690","doi":"","title":"The number of repeated blocks in twofold extended triple systems.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.00425814293118565,"score_gpt":0.1978705931960348,"score_spread":0.19361245026484916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193517690","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.9710391,0.0009756465,0.0000048490933,0.0000076018973,0.0029186502,0.00021665558,0.0000036781557,0.0001380812,0.024695711],"genre_scores_gemma":[0.99901575,0.000016432636,0.0000036310305,0.0000016180775,0.00001137776,0.00004213178,0.0000040997134,0.0000238094,0.000881151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998943,0.000095151765,0.00043456102,0.00012300303,0.0001551547,0.00024913138],"domain_scores_gemma":[0.99939615,0.000107646374,0.00006255401,0.00036262083,0.000041337753,0.000029703731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046651554,0.00013041221,0.00022665471,0.000049386876,0.00005831415,0.000028401393,0.00020163757,0.000090675785,0.000011004792],"category_scores_gemma":[0.000018658075,0.00010507563,0.00006378739,0.0003613041,0.000038898575,0.00005468718,0.000017307471,0.00013596819,0.000021354479],"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.000021631367,0.00006479511,0.013333006,0.0000722202,0.000040657564,0.000015303747,0.000106264524,0.0014752646,0.0018362878,0.9788405,0.004065464,0.0001286511],"study_design_scores_gemma":[0.0057233465,0.00009327286,0.053213887,0.000500263,0.00006668639,0.00009623337,0.0010157157,0.01837467,0.018445149,0.8806974,0.020761237,0.001012131],"about_ca_topic_score_codex":0.00027950451,"about_ca_topic_score_gemma":0.000022708891,"teacher_disagreement_score":0.09814305,"about_ca_system_score_codex":0.000041470674,"about_ca_system_score_gemma":0.000008978682,"threshold_uncertainty_score":0.428486},"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":"W194888234","doi":"","title":"An Algorithm for Constructing two disjoint Hadamard Designs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Disjoint sets; Mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.012072343842401518,"score_gpt":0.23182245057817272,"score_spread":0.2197501067357712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194888234","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.94480056,0.00019095611,0.04715294,0.000016632768,0.005082278,0.00047220424,0.000019333755,0.0006551856,0.0016099039],"genre_scores_gemma":[0.988562,0.0000031447491,0.011242663,0.000018297142,0.00003508952,0.00006771372,0.000012662674,0.000048119506,0.0000102929935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911463,0.00003265146,0.00023624401,0.00019123775,0.00011040525,0.00031482746],"domain_scores_gemma":[0.9994596,0.000059947593,0.000035875764,0.00027692932,0.00004605036,0.000121596015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028251117,0.00017491863,0.00021493428,0.000061695704,0.00011754865,0.00005956486,0.00017773214,0.0000719148,0.000009533235],"category_scores_gemma":[0.000014429572,0.00018465164,0.00008600418,0.00013854034,0.000047494446,0.00019690854,0.000011638046,0.00011979955,0.00001930895],"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.000006998172,0.000052745603,0.00026684933,0.000052043288,0.000070796596,0.000010966765,0.00045755628,0.0027610518,0.008081737,0.96652585,0.00011103816,0.02160236],"study_design_scores_gemma":[0.002902844,0.00017170967,0.00010213339,0.000073099036,0.00003141194,0.000043689655,0.0006253641,0.008309613,0.04427186,0.9422608,0.00076959137,0.00043787225],"about_ca_topic_score_codex":0.000016795153,"about_ca_topic_score_gemma":0.0000034452971,"teacher_disagreement_score":0.04376145,"about_ca_system_score_codex":0.00007362773,"about_ca_system_score_gemma":0.00002067495,"threshold_uncertainty_score":0.7529875},"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":"W195379771","doi":"","title":"Strongly pan-factorial property in cages.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Factorial experiment; Factorial; Statistics; Mathematical analysis; Epistemology; Philosophy","score_opus":0.012514581587055519,"score_gpt":0.19126386033144668,"score_spread":0.17874927874439117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195379771","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.9810271,0.00018007675,0.0000063670864,0.000007289564,0.0059988117,0.00017953364,0.000003072623,0.00024057782,0.012357155],"genre_scores_gemma":[0.999461,0.000028027138,0.000009781766,0.0000045742895,0.000039268416,0.000029317142,0.00000449639,0.000029731178,0.00039380355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991447,0.000050675997,0.00022125879,0.00014747166,0.00015236018,0.0002835314],"domain_scores_gemma":[0.99962336,0.000032144395,0.000019305524,0.00024013313,0.000020286732,0.000064767366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014349479,0.0001520032,0.00020225835,0.000078546334,0.000059052585,0.000013653484,0.00017300343,0.00010420217,0.00003250463],"category_scores_gemma":[0.000019508347,0.000120204044,0.0000519795,0.000219044,0.000037772832,0.00015300178,0.000018949022,0.00021135794,0.00009793604],"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.00019852702,0.0006502162,0.17427437,0.00036264217,0.0002658604,0.00074513,0.010288649,0.0040633734,0.01850767,0.73994595,0.046911,0.0037866086],"study_design_scores_gemma":[0.023304407,0.0011010745,0.2852873,0.00056405726,0.000086312095,0.0003729834,0.0013173699,0.010067481,0.041742112,0.39781138,0.23318642,0.005159108],"about_ca_topic_score_codex":0.00010384915,"about_ca_topic_score_gemma":0.000021199867,"teacher_disagreement_score":0.34213457,"about_ca_system_score_codex":0.000072038856,"about_ca_system_score_gemma":0.000020654754,"threshold_uncertainty_score":0.49017784},"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":"W1956988622","doi":"10.1109/ccece.2000.849627","title":"Anti-jamming solution to narrowband CDMA interference problem","year":2002,"lang":"en","type":"article","venue":"","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":"École de Technologie Supérieure","funders":"","keywords":"Jamming; Narrowband; Interference (communication); Computer science; Code division multiple access; Near-far problem; Spread spectrum; Co-channel interference; Electronic engineering; Telecommunications; Engineering; Physics; Channel (broadcasting)","score_opus":0.014170049105807922,"score_gpt":0.1822563223951964,"score_spread":0.16808627328938847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956988622","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.80631304,0.00029012098,0.04915696,0.00016130623,0.0006056086,0.0002669562,0.0000021561818,0.0007480279,0.14245585],"genre_scores_gemma":[0.9976455,0.0000070683504,0.00057293987,0.0000340623,0.000048240043,0.000017271703,6.67238e-7,0.000013760996,0.0016604986],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994665,0.000015621345,0.0001423314,0.00011429688,0.000063182175,0.00019806514],"domain_scores_gemma":[0.9997617,0.000012133643,0.000008985505,0.00013584776,0.000014759279,0.000066567314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009623965,0.00009500267,0.00010477869,0.000067920606,0.00004734938,0.000032524516,0.000101625235,0.00004285916,0.0003861201],"category_scores_gemma":[0.0000052075657,0.000087183806,0.000030508189,0.00015752354,0.00000961395,0.000108406304,0.000015278216,0.000068329675,0.000535226],"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.000023765426,0.00018113933,0.005761362,0.0008695186,0.00022899047,0.00004441925,0.019915378,0.027195226,0.63091683,0.07823976,0.10306347,0.13356014],"study_design_scores_gemma":[0.0022795273,0.0009866206,0.0040864395,0.001625572,0.00008427732,0.00029520266,0.003555052,0.48891973,0.27563432,0.007755492,0.21092728,0.0038504654],"about_ca_topic_score_codex":0.000008860085,"about_ca_topic_score_gemma":0.000017023507,"teacher_disagreement_score":0.46172452,"about_ca_system_score_codex":0.000018749475,"about_ca_system_score_gemma":8.186952e-7,"threshold_uncertainty_score":0.6879426},"labels":[],"label_agreement":null},{"id":"W1959268203","doi":"","title":"Minimal perfect bicoverings of K v with block sizes two, three and four","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Block size; Set (abstract data type); Computer science","score_opus":0.005688535359316719,"score_gpt":0.1784936644605806,"score_spread":0.1728051291012639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959268203","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.9968959,0.00031152097,0.000022230386,0.000011592151,0.0003975655,0.00011513783,0.0000027595534,0.000108085944,0.0021351804],"genre_scores_gemma":[0.9998133,0.000009539834,0.00011622274,0.0000048719767,0.0000073358297,0.000009811385,5.592069e-7,0.000025752792,0.0000125852075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999444,0.00001132663,0.00013810604,0.00012383203,0.00011360474,0.00016913826],"domain_scores_gemma":[0.99967444,0.000041367424,0.00003021445,0.00017221448,0.000024764291,0.000057026275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010522747,0.00013593119,0.00019985082,0.00005209074,0.00003774224,0.000016775753,0.00009293708,0.00004587388,0.000005291041],"category_scores_gemma":[0.0000085371175,0.00011815085,0.000035609537,0.00014202816,0.000057425634,0.000091579095,0.000019824543,0.000090565656,0.0000057383763],"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.00014997783,0.00011213706,0.04648313,0.00048537255,0.00032135757,0.00006415641,0.001500758,0.009370876,0.04203485,0.8987593,0.00009613093,0.00062196824],"study_design_scores_gemma":[0.015829407,0.002258211,0.10279443,0.00090090226,0.00022083032,0.00042150004,0.00057961635,0.0018233819,0.12215401,0.75041693,0.0010520094,0.0015487662],"about_ca_topic_score_codex":0.000041447678,"about_ca_topic_score_gemma":0.000023489127,"teacher_disagreement_score":0.14834236,"about_ca_system_score_codex":0.000018116867,"about_ca_system_score_gemma":0.000011223706,"threshold_uncertainty_score":0.48180518},"labels":[],"label_agreement":null},{"id":"W1964363507","doi":"10.1007/s00026-009-0027-8","title":"Weighing Matrices and String Sorting","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Sorting; String (physics); Mathematics; Algorithm; Combinatorics","score_opus":0.019427009807834895,"score_gpt":0.24735247166784396,"score_spread":0.22792546186000906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964363507","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.9886003,0.0040376224,0.00028434978,0.000053665473,0.0002568633,0.000048311576,9.562953e-7,0.00012539836,0.00659254],"genre_scores_gemma":[0.99945635,0.00043518693,0.000025037905,0.000026116028,0.000026183858,9.0742174e-7,5.789482e-7,0.000008769874,0.000020855405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942726,0.000015610207,0.00021379106,0.00007482125,0.00010374541,0.00016480249],"domain_scores_gemma":[0.9997028,0.000047263205,0.000052877273,0.0001080511,0.00003875504,0.000050229937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025194898,0.00008837076,0.00015603536,0.00008453304,0.000045762266,0.000023218481,0.00008783073,0.000048147765,0.000002315722],"category_scores_gemma":[0.000020493277,0.00009123017,0.000037297457,0.00020179091,0.000011069198,0.00014548676,0.0000105876225,0.00008571421,0.0000018383923],"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.000006308672,0.000038241025,0.0035584678,0.00021949624,0.000041755866,0.000007964113,0.00063836464,0.00078890135,0.0027249719,0.97520775,0.000594675,0.016173104],"study_design_scores_gemma":[0.0005488194,0.00025846128,0.0152765205,0.0003316387,0.000028545921,0.0000141266655,0.0005290365,0.0057335054,0.06448268,0.9078358,0.004406564,0.00055432174],"about_ca_topic_score_codex":0.000002221507,"about_ca_topic_score_gemma":1.3218943e-7,"teacher_disagreement_score":0.06737197,"about_ca_system_score_codex":0.0000032815901,"about_ca_system_score_gemma":0.0000027907806,"threshold_uncertainty_score":0.37202585},"labels":[],"label_agreement":null},{"id":"W1964393859","doi":"10.1016/j.ejc.2012.07.003","title":"On the removal lemma for linear systems over Abelian groups","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Mathematics; Abelian group; Coprime integers; Lemma (botany); Integer (computer science); Combinatorics; Order (exchange); Elementary abelian group; Group (periodic table); Extension (predicate logic); Discrete mathematics; Matrix (chemical analysis)","score_opus":0.017823009999461344,"score_gpt":0.2064599083475682,"score_spread":0.18863689834810685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964393859","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.95330364,0.003922448,0.007997316,0.00006560629,0.011412366,0.0002358692,0.000007319457,0.00007586106,0.022979595],"genre_scores_gemma":[0.99870694,0.000037711852,0.000031478434,0.00004150119,0.0008306872,0.0000015471704,6.9757044e-7,0.00006291445,0.0002865408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986589,0.00033688193,0.0004361351,0.000054532135,0.0002444697,0.00026906191],"domain_scores_gemma":[0.99910724,0.0002624663,0.00017513164,0.00022195268,0.000094600065,0.00013859985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025864884,0.0001494232,0.00020468644,0.00009263241,0.00010308112,0.000048271704,0.00033016913,0.000028709685,0.000009831592],"category_scores_gemma":[0.000099777695,0.00009920608,0.00015927626,0.00016775566,0.000021773065,0.00015167588,0.000016050602,0.00029808978,0.00005625363],"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.000058197118,0.00010294433,0.00031019672,0.0001359254,0.00016416184,0.0000715232,0.0007150358,0.0028312344,0.0007668592,0.9646116,0.029797496,0.0004348407],"study_design_scores_gemma":[0.0028286977,0.0010351738,0.0025121632,0.0005959725,0.000137575,0.0010179736,0.0007415668,0.0048362743,0.00096529705,0.009972869,0.9747196,0.0006368334],"about_ca_topic_score_codex":1.8905949e-7,"about_ca_topic_score_gemma":1.9276243e-8,"teacher_disagreement_score":0.9546387,"about_ca_system_score_codex":0.00004465864,"about_ca_system_score_gemma":0.0000065325703,"threshold_uncertainty_score":0.40455064},"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":"W1965839285","doi":"10.1016/j.disc.2006.04.042","title":"Constructions and bounds for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si50.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-splitting systems","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Manitoba; University of Waterloo","funders":"","keywords":"Block (permutation group theory); Mathematics; Combinatorics; Type (biology); Discrete mathematics; Algorithm","score_opus":0.01351620445440694,"score_gpt":0.22577824832043367,"score_spread":0.21226204386602673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965839285","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.9706673,0.0035113962,0.005628906,0.00024792986,0.003886509,0.00042389493,0.0016536159,0.0008707404,0.013109705],"genre_scores_gemma":[0.9864299,0.00066648936,0.005669141,0.00026088022,0.002726779,0.001774871,0.000972424,0.0012507687,0.00024870844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9870471,0.00050366565,0.003997428,0.0024133993,0.002615729,0.0034227122],"domain_scores_gemma":[0.9903716,0.0024347233,0.0029488124,0.0025574372,0.00039964393,0.0012878202],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003437061,0.0019276554,0.0012621225,0.00079169497,0.0029204993,0.0031248156,0.0021713942,0.003023039,0.0006723371],"category_scores_gemma":[0.0013213019,0.0029063332,0.0024164747,0.0014518141,0.0019261827,0.0016628607,0.0013476607,0.0021882714,0.001124973],"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.00048305708,0.00040384498,0.000050467024,0.0074183666,0.0025695828,0.00036624825,0.004632144,0.0061963173,0.0027238973,0.96528447,0.008673722,0.0011979124],"study_design_scores_gemma":[0.005432441,0.0023275649,0.000044105822,0.008618105,0.0053053508,0.0048611094,0.025400443,0.675158,0.13398518,0.12663141,0.006843339,0.0053929486],"about_ca_topic_score_codex":0.001515461,"about_ca_topic_score_gemma":0.0005416584,"teacher_disagreement_score":0.838653,"about_ca_system_score_codex":0.0000927396,"about_ca_system_score_gemma":0.00076905644,"threshold_uncertainty_score":0.99965274},"labels":[],"label_agreement":null},{"id":"W1966840469","doi":"10.1007/s11590-008-0109-2","title":"On the upper bounds of the minimum number of rows of disjunct matrices","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Row; Disjunct; Column (typography); Row and column spaces; Combinatorics; Matrix (chemical analysis); Mathematics; Upper and lower bounds; Value (mathematics); Chemistry; Geometry; Computer science; Statistics; Connection (principal bundle); Population; Chromatography; Mathematical analysis","score_opus":0.005580011362657026,"score_gpt":0.17649678357502357,"score_spread":0.17091677221236654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966840469","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.9876629,0.00003567542,0.006580151,0.00035746297,0.00024329104,0.000117913914,0.000008957823,0.000017979932,0.00497568],"genre_scores_gemma":[0.9994324,0.0000176254,0.00029272086,0.00013333918,0.000016477836,0.000005668863,0.0000021479232,0.000012417981,0.00008723149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994694,0.000052944597,0.0002090166,0.000054913908,0.00014129623,0.00007245704],"domain_scores_gemma":[0.999563,0.000087805456,0.000091811504,0.00022354393,0.00002371878,0.000010130658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009502671,0.00007129686,0.00011258538,0.000032458403,0.000042626973,0.0000036202237,0.00015283676,0.00003057425,0.00014927027],"category_scores_gemma":[0.000016930837,0.000042315656,0.000082939114,0.00023357965,0.00009829839,0.000049244896,0.000010604803,0.000048274316,0.0000037520422],"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.000010124182,0.000016360178,0.0042162887,0.000049953967,0.000039815382,2.4899595e-7,0.0006901121,0.9814302,0.004501031,0.0031626641,0.005870314,0.000012926094],"study_design_scores_gemma":[0.0034834687,0.00019718222,0.03874171,0.0012165331,0.00036794864,0.00010116503,0.002101355,0.7341002,0.21034963,0.0013658679,0.006472086,0.0015028062],"about_ca_topic_score_codex":0.0000066164394,"about_ca_topic_score_gemma":3.4808946e-7,"teacher_disagreement_score":0.24732992,"about_ca_system_score_codex":0.000007233428,"about_ca_system_score_gemma":0.0000043159534,"threshold_uncertainty_score":0.17255825},"labels":[],"label_agreement":null},{"id":"W1966947400","doi":"10.1016/s0012-365x(01)00284-9","title":"Complete latin squares of order pn exist for odd primes p and n&gt;2","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Arizona State University","keywords":"Mathematics; Latin square; Combinatorics; Order (exchange); Integer (computer science); Prime (order theory); Group (periodic table); Discrete mathematics; Cyclic group; Abelian group; Physics","score_opus":0.026909461635927022,"score_gpt":0.2220562871268048,"score_spread":0.19514682549087778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966947400","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.86320716,0.0023930008,0.06932121,0.00009324742,0.0003085109,0.0012298576,0.000376104,0.00039600144,0.06267493],"genre_scores_gemma":[0.98877245,0.000020988518,0.010588041,0.0000072299176,0.000029189217,0.000031490956,0.000009109861,0.000034250163,0.00050725223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939036,0.000011841007,0.00027315543,0.00008602021,0.00009032507,0.00014830167],"domain_scores_gemma":[0.9995295,0.00014736081,0.000055908262,0.00019631672,0.000032251886,0.00003867828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112638525,0.00012687677,0.00024899023,0.000058038564,0.00004635809,0.000021802543,0.00008994537,0.00004748997,0.000056257133],"category_scores_gemma":[0.000039055118,0.00010864765,0.000054095082,0.00010946802,0.00005712962,0.000045806548,0.000016151473,0.000042431093,0.000009812311],"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.000015201944,0.00012801825,0.00038778165,0.009182175,0.0003340047,0.0000031852453,0.021606935,0.0014608339,0.032352764,0.9269113,0.0054587065,0.0021590926],"study_design_scores_gemma":[0.0020428381,0.00029359534,0.00037949035,0.0009776009,0.00021545398,0.000031708394,0.0043803654,0.73304814,0.013021315,0.21928129,0.02517866,0.0011495475],"about_ca_topic_score_codex":0.0000011101072,"about_ca_topic_score_gemma":0.0000019444212,"teacher_disagreement_score":0.7315873,"about_ca_system_score_codex":0.000005069555,"about_ca_system_score_gemma":0.0000012828064,"threshold_uncertainty_score":0.44305226},"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":"W1968078289","doi":"10.1016/j.disc.2011.02.009","title":"Extra two-fold Steiner pentagon systems","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Beijing Institute For Brain Disorders","keywords":"Pentagon; Combinatorics; Mathematics; Fold (higher-order function); Multigraph; Steiner system; Path (computing); Discrete mathematics; Geometry; Computer science; Graph","score_opus":0.02788486845778938,"score_gpt":0.2116887652868379,"score_spread":0.18380389682904852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968078289","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.5968227,0.0012391497,0.03947475,0.000005542654,0.0019784474,0.0007079378,0.00004397917,0.0011025621,0.35862496],"genre_scores_gemma":[0.99745953,0.000013432107,0.0012158805,0.0000064267724,0.00010158597,0.00005439261,0.000007779845,0.000068026355,0.0010729631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897087,0.000031786403,0.00038372804,0.00013901516,0.00018340943,0.00029120457],"domain_scores_gemma":[0.9993244,0.000035313366,0.000059508453,0.00045657737,0.000023766384,0.00010045692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025982116,0.00022014181,0.00028228038,0.000074097596,0.00005105691,0.000050706924,0.00024409284,0.00007256019,0.00017377219],"category_scores_gemma":[0.000009122142,0.00018345381,0.00010347916,0.00012616049,0.000035090106,0.00013039255,0.000026637521,0.00011913644,0.00035868326],"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.000014258352,0.00014061542,0.00042557987,0.0027768956,0.00036084882,0.00006716583,0.018228747,0.0020018718,0.016055087,0.9566704,0.0028011953,0.00045732787],"study_design_scores_gemma":[0.0055665104,0.0005810509,0.0012141409,0.0038315025,0.0010388197,0.0009285947,0.05457358,0.6764049,0.07283675,0.14560002,0.030802479,0.0066216625],"about_ca_topic_score_codex":0.000016337719,"about_ca_topic_score_gemma":0.0000034817656,"teacher_disagreement_score":0.8110704,"about_ca_system_score_codex":0.000021782444,"about_ca_system_score_gemma":0.0000041265616,"threshold_uncertainty_score":0.7481029},"labels":[],"label_agreement":null},{"id":"W1968128554","doi":"10.1016/j.disc.2003.11.031","title":"The Hamilton–Waterloo problem: the case of Hamilton cycles and triangle-factors","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Ministerstvo školstva, vedy, výskumu a športu Slovenskej republiky; Natural Sciences and Engineering Research Council of Canada; Slovenská Akadémia Vied","keywords":"Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Factorization; Discrete mathematics; Mathematical optimization; Algorithm; Graph","score_opus":0.010628488815673309,"score_gpt":0.20978061464927777,"score_spread":0.19915212583360448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968128554","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.995499,0.00065261306,0.0011991094,0.000041445583,0.0001238932,0.00038329116,0.000020992964,0.00009211414,0.0019875162],"genre_scores_gemma":[0.99920136,0.0000943534,0.00044568098,0.0000046816076,0.000024679115,0.000027091977,0.0000027363435,0.000033281583,0.00016610994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916315,0.000042583943,0.00037194014,0.0000985561,0.000108717315,0.00021505242],"domain_scores_gemma":[0.9992067,0.0002493467,0.00008470217,0.00038911053,0.000021495038,0.00004859699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043775252,0.00017863073,0.00023374594,0.000034076213,0.00021667707,0.00007219942,0.00019275336,0.00006271695,0.0000035729277],"category_scores_gemma":[0.000023475926,0.00008766119,0.00009391232,0.00012268593,0.00017368833,0.00007057583,0.000022047974,0.00012218113,0.000005184907],"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.00003008493,0.00011440566,0.00027054583,0.0025717628,0.0006328834,0.00019257555,0.2400417,0.0068673803,0.007021435,0.7395355,0.00024189423,0.0024797977],"study_design_scores_gemma":[0.0034017293,0.00034786237,0.00042802942,0.0013475188,0.0005715784,0.002435463,0.14508365,0.017445713,0.07554061,0.7468609,0.005043646,0.0014932684],"about_ca_topic_score_codex":0.000048206024,"about_ca_topic_score_gemma":0.00011649593,"teacher_disagreement_score":0.09495805,"about_ca_system_score_codex":0.000016155882,"about_ca_system_score_gemma":0.0000059466984,"threshold_uncertainty_score":0.35747194},"labels":[],"label_agreement":null},{"id":"W1968376338","doi":"10.1007/s00454-013-9564-3","title":"Pairwise Balanced Designs with Prescribed Minimum Dimension","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Dimension (graph theory); Integer (computer science); Pairwise comparison; Subspace topology; Space (punctuation); Linear space; Upper and lower bounds; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.008800566591257537,"score_gpt":0.19598536669691574,"score_spread":0.18718480010565822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968376338","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.92135656,0.00027672018,0.07476674,0.0000491041,0.0002705154,0.000366331,0.000018090528,0.0003554185,0.0025405188],"genre_scores_gemma":[0.9964009,0.0000022830232,0.0030178488,0.00007285178,0.000063241496,0.000072442126,0.00011079577,0.000037876438,0.00022175787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989534,0.000049157523,0.00022796172,0.0002123318,0.0002849337,0.00027221008],"domain_scores_gemma":[0.9994433,0.00012520091,0.000040563373,0.00017567736,0.00009186721,0.00012341604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100614765,0.00019870128,0.00019504224,0.00016327483,0.00008558911,0.00006813303,0.00013499853,0.0000639639,0.00025675693],"category_scores_gemma":[0.000011110804,0.00016360018,0.00006337983,0.00040952626,0.000052810425,0.0002476671,0.000021775513,0.00012230857,0.00028167755],"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.00006725161,0.000063431384,0.0094995955,0.0001921269,0.00026861086,0.000018617437,0.00074373296,0.96558505,0.006739779,0.005761889,0.008600367,0.002459543],"study_design_scores_gemma":[0.0024180412,0.00038272428,0.20599139,0.00030547855,0.00007262105,0.000064363194,0.00075650803,0.76410735,0.0024922208,0.020260543,0.0018264938,0.0013222805],"about_ca_topic_score_codex":0.00001243071,"about_ca_topic_score_gemma":0.0000010402532,"teacher_disagreement_score":0.20147772,"about_ca_system_score_codex":0.000027471506,"about_ca_system_score_gemma":0.000013960483,"threshold_uncertainty_score":0.66714215},"labels":[],"label_agreement":null},{"id":"W1969055353","doi":"10.1016/j.jctb.2010.12.002","title":"Unexpected behaviour of crossing sequences","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.013971670668904795,"score_gpt":0.21000680651573364,"score_spread":0.19603513584682886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969055353","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.9850517,0.00059978093,0.00032087672,0.0000029588184,0.007666874,0.000055461063,0.0000038483317,0.000048872556,0.0062496406],"genre_scores_gemma":[0.99942,0.000020493546,0.00024358378,0.00000212268,0.0002458077,0.0000013339852,3.7654962e-7,0.000021433756,0.000044846365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987833,0.00016918358,0.0006094761,0.000060362792,0.00021094007,0.00016672061],"domain_scores_gemma":[0.9991885,0.00007423289,0.00029759822,0.0001572926,0.0002018295,0.00008054273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084452034,0.00014139559,0.0003644706,0.00013603097,0.00008240545,0.00003808132,0.0002917,0.00009923192,0.00016003073],"category_scores_gemma":[0.000066989705,0.00011952364,0.00016333553,0.00020796887,0.00025358374,0.00046473977,0.000017349414,0.00021288458,0.0000023394527],"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.00093876536,0.00012480056,0.0030819378,0.000099130884,0.0002572746,0.00008490159,0.009576645,0.000083186016,0.048701458,0.93626,0.00011309505,0.0006788084],"study_design_scores_gemma":[0.00095301005,0.00052095763,0.0022090934,0.00019695432,0.00008626146,0.00024473114,0.0033070913,0.0000064217143,0.27364254,0.717799,0.0007984545,0.00023550156],"about_ca_topic_score_codex":0.0000049839164,"about_ca_topic_score_gemma":6.587745e-7,"teacher_disagreement_score":0.22494107,"about_ca_system_score_codex":0.000027291042,"about_ca_system_score_gemma":0.00004929243,"threshold_uncertainty_score":0.48740324},"labels":[],"label_agreement":null},{"id":"W1969286931","doi":"10.1016/j.ejc.2006.07.008","title":"The cone condition and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>t</mml:mi></mml:math>-designs","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Scroll; Mathematics; Combinatorics; Theology","score_opus":0.011731601163762295,"score_gpt":0.2086038448841361,"score_spread":0.19687224372037382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969286931","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.9884475,0.0013570752,0.0015135754,0.00007170081,0.001653569,0.00003416305,0.000015923952,0.00007396654,0.0068325447],"genre_scores_gemma":[0.998855,0.00034661166,0.00008010377,0.00006373132,0.000428891,0.0000053293065,0.000015700949,0.00009960708,0.000105001905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821305,0.00022609229,0.00063963654,0.00016245269,0.00042055594,0.00033821448],"domain_scores_gemma":[0.99873674,0.0002914033,0.000415408,0.00032088291,0.000082138955,0.0001534285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013295765,0.00022096875,0.00018136122,0.00008288072,0.0003796902,0.0002552,0.00035453594,0.0001031054,0.000009065243],"category_scores_gemma":[0.00009947299,0.00021336916,0.00021315238,0.00018861344,0.0001521282,0.00029662513,0.00008056766,0.00048932084,0.0001541471],"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.0000723248,0.000057093184,0.000028056813,0.00009176929,0.00013116933,0.00039478616,0.00022985485,0.0014677722,0.0018447846,0.99337405,0.0020565633,0.00025178902],"study_design_scores_gemma":[0.0062361117,0.002589711,0.0034037533,0.0013594116,0.00074809557,0.0040105763,0.0015886668,0.85108215,0.015311843,0.027763596,0.08445802,0.001448041],"about_ca_topic_score_codex":0.0000058284845,"about_ca_topic_score_gemma":0.0000029412165,"teacher_disagreement_score":0.96561044,"about_ca_system_score_codex":0.000015588263,"about_ca_system_score_gemma":0.0000443765,"threshold_uncertainty_score":0.8700942},"labels":[],"label_agreement":null},{"id":"W1969647805","doi":"10.1007/s00373-002-0506-8","title":"Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index","year":2003,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Chromatic scale; Steiner system; Block size; Discrete mathematics; Arithmetic; Computer science; Key (lock)","score_opus":0.00509165638525723,"score_gpt":0.17323249390673115,"score_spread":0.1681408375214739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969647805","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.9849229,0.0074685547,0.000053748736,0.000009755168,0.00092646055,0.00035231147,0.0000031484133,0.00006661288,0.006196515],"genre_scores_gemma":[0.9993268,0.00037032753,0.0000043157816,0.000007612447,0.000010746913,0.000035610843,5.247447e-7,0.000018544826,0.00022551655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915457,0.00010967067,0.00029121412,0.0001186104,0.00014916732,0.00017678225],"domain_scores_gemma":[0.99953765,0.000096232434,0.00006406005,0.0002050158,0.00003468693,0.00006234318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004735019,0.00015365714,0.00034680645,0.00009926709,0.00009877554,0.0000481586,0.00009168463,0.00008564107,0.000005516204],"category_scores_gemma":[0.000023949695,0.000106832325,0.00006728841,0.0003203854,0.00013320967,0.000052985895,0.000015710479,0.00011395049,0.0000010718371],"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.000018998562,0.000023320099,0.005125109,0.00029437107,0.00008721838,0.0000021142762,0.0005466137,0.00006785994,0.00014255021,0.99339515,0.00024717257,0.000049516777],"study_design_scores_gemma":[0.026562719,0.00038811244,0.019405205,0.000574118,0.00043419085,0.00032783777,0.0053363084,0.015372293,0.002882383,0.88864255,0.038576357,0.0014979484],"about_ca_topic_score_codex":0.00002373068,"about_ca_topic_score_gemma":0.0000013586574,"teacher_disagreement_score":0.10475263,"about_ca_system_score_codex":0.0000089740015,"about_ca_system_score_gemma":0.0000065850804,"threshold_uncertainty_score":0.43564957},"labels":[],"label_agreement":null},{"id":"W1969787279","doi":"10.1057/jors.2013.114","title":"A comparison of several enumerative algorithms for Sudoku","year":2013,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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":"HEC Montréal; Université Laval","funders":"Max-Planck-Gesellschaft","keywords":"Backtracking; Integer programming; Grid; Algorithm; Integer (computer science); Benchmark (surveying); Computer science; Set (abstract data type); Constraint (computer-aided design); Linear programming; Mathematics; Column (typography); Mathematical optimization","score_opus":0.09510289117562633,"score_gpt":0.40199805820218587,"score_spread":0.30689516702655956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969787279","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.9728655,0.0009166356,0.021390839,0.0020384877,0.00080981344,0.0009226784,0.00004238341,0.00001230123,0.0010013316],"genre_scores_gemma":[0.99579126,0.000020459767,0.0033044207,0.000028626488,0.00026350567,0.000029032873,0.0000016359531,0.000010148401,0.0005509327],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986536,0.00015452564,0.00036739957,0.000052384567,0.00059645285,0.00017565853],"domain_scores_gemma":[0.99842566,0.0003245115,0.000071199094,0.0001002157,0.001017699,0.000060698585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527526,0.000067715984,0.00018689774,0.000032846336,0.00020939777,0.00006466095,0.00028994572,0.000058598147,0.000094389274],"category_scores_gemma":[0.00014598596,0.00004226905,0.00028374285,0.0001792077,0.00010838697,0.00024837066,0.00003083872,0.00038225047,0.0000059184567],"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.000081708145,0.00032495835,0.0038973512,0.00032588004,0.0011595407,6.3766555e-7,0.020244662,0.21419635,0.19104232,0.02274452,0.5436751,0.002306941],"study_design_scores_gemma":[0.0017978245,0.00055351434,0.010318569,0.00025155616,0.000031502255,0.00003821984,0.009702854,0.87145364,0.073471166,0.01574857,0.016373403,0.0002592024],"about_ca_topic_score_codex":0.000010130022,"about_ca_topic_score_gemma":0.0000016826081,"teacher_disagreement_score":0.65725726,"about_ca_system_score_codex":0.00008216316,"about_ca_system_score_gemma":0.00010919098,"threshold_uncertainty_score":0.17236818},"labels":[],"label_agreement":null},{"id":"W1969831346","doi":"10.1007/s10801-013-0479-0","title":"Finite polytopes have finite regular covers","year":2013,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Finite set; Mathematical analysis","score_opus":0.005271517632017944,"score_gpt":0.17528745389585895,"score_spread":0.170015936263841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969831346","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.9823916,0.0026604054,0.0033138064,0.00025427097,0.003874373,0.00020644939,0.000004722966,0.000116728836,0.007177661],"genre_scores_gemma":[0.9988408,0.0001666088,0.000058905545,0.00007841265,0.00015109632,0.0000043912555,0.0000011617578,0.00003832029,0.0006603169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986103,0.000069930575,0.0005797643,0.00009515101,0.0003555141,0.00028929915],"domain_scores_gemma":[0.99873006,0.00039708836,0.00021132527,0.00025399125,0.00020721709,0.00020031605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037969725,0.00020184016,0.00036418927,0.0002485059,0.00007102111,0.000098730285,0.00034136066,0.00012739337,0.00020719116],"category_scores_gemma":[0.00019320821,0.00018025543,0.0002161817,0.0002970129,0.000043828004,0.0004382274,0.000029957124,0.00039819322,0.00010686508],"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.00023232933,0.0011698774,0.045077495,0.00130928,0.003641238,0.0011224519,0.009908413,0.13246703,0.021643315,0.5694121,0.19515072,0.01886577],"study_design_scores_gemma":[0.0058129253,0.0013449613,0.018926049,0.0007237439,0.00029161852,0.00063672627,0.002795401,0.025025016,0.0136683015,0.79411143,0.13490118,0.0017626503],"about_ca_topic_score_codex":0.0000067736164,"about_ca_topic_score_gemma":7.529948e-7,"teacher_disagreement_score":0.22469935,"about_ca_system_score_codex":0.00006517972,"about_ca_system_score_gemma":0.000031210267,"threshold_uncertainty_score":0.7350603},"labels":[],"label_agreement":null},{"id":"W1970417156","doi":"10.1016/s0140-3664(02)00238-4","title":"Evolutionary approach to optimize the assignment of cells to switches in personal communication networks","year":2003,"lang":"en","type":"article","venue":"Computer Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristic; Mathematical optimization; Convergence (economics); Evolutionary algorithm; Optimization problem; Combinatorial optimization; Distributed computing; Artificial intelligence; Algorithm; Mathematics","score_opus":0.0186540089955976,"score_gpt":0.2036066731379924,"score_spread":0.1849526641423948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970417156","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.01878363,0.0031643722,0.9578573,0.00060664274,0.00022790559,0.0009522127,0.0000096755375,0.000118530355,0.018279722],"genre_scores_gemma":[0.91446424,0.000091462556,0.08507251,0.00011418783,0.000013897371,0.00018774973,0.0000144724845,0.0000145557415,0.000026926935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989966,0.00033580404,0.0002998604,0.000107205036,0.00010060691,0.00015992988],"domain_scores_gemma":[0.9980446,0.00025537726,0.000035772475,0.0015563812,0.000044049684,0.00006378625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905433,0.00011265629,0.0001559456,0.00009858849,0.00015091574,0.000023515053,0.0010913857,0.000051652514,0.0000058231003],"category_scores_gemma":[0.0000073554256,0.00010064837,0.000056611323,0.00045642303,0.00006564542,0.000055868655,0.00022580357,0.0002201499,0.000013708264],"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.0000037484708,0.00015502048,0.0003187774,0.000014164801,0.000033816526,4.7965703e-8,0.0040838337,0.96252036,0.00028200092,0.027940981,0.0036191416,0.001028103],"study_design_scores_gemma":[0.00025485706,0.000031142197,0.0045992956,0.00010605148,0.00001411768,0.000006260261,0.001045631,0.97602046,0.00019775581,0.00067412463,0.016816521,0.00023380642],"about_ca_topic_score_codex":0.000016137748,"about_ca_topic_score_gemma":0.000009892572,"teacher_disagreement_score":0.8956806,"about_ca_system_score_codex":0.000072057774,"about_ca_system_score_gemma":0.000013712801,"threshold_uncertainty_score":0.41043216},"labels":[],"label_agreement":null},{"id":"W1970894474","doi":"10.1109/50.983229","title":"Multirate optical fast frequency hopping CDMA system using power control","year":2002,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Code division multiple access; Computer science; Power control; Electronic engineering; Frequency-hopping spread spectrum; Transmission (telecommunications); Quality of service; Interference (communication); Computer network; Spread spectrum; Bit error rate; Power (physics); Real-time computing; Telecommunications; Engineering","score_opus":0.009444941127040595,"score_gpt":0.18803178965772502,"score_spread":0.17858684853068443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970894474","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.9554594,0.0030964387,0.03373926,0.00022416271,0.001620289,0.0001612864,0.0000052413493,0.00043072202,0.005263174],"genre_scores_gemma":[0.9974786,0.000021542659,0.0022544954,0.00001759565,0.00016179416,0.0000020531152,1.0744241e-7,0.000039719507,0.000024097435],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998432,0.00005264712,0.00079178956,0.00013214488,0.00019726022,0.00039419153],"domain_scores_gemma":[0.9991602,0.000057491125,0.0002511238,0.0002677024,0.00015562229,0.00010789695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033783686,0.00022140832,0.0005538893,0.000689188,0.0000831262,0.000033730907,0.00033543777,0.00037261102,0.00006629822],"category_scores_gemma":[0.000053643456,0.00018774733,0.00017638365,0.00041973713,0.0001028427,0.0001890759,0.000020732183,0.0005915513,0.000062041785],"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.000048037222,0.00016976942,0.00369448,0.0003755624,0.0011133524,0.0027028443,0.00082033273,0.0076677804,0.86669046,0.11239897,0.00056441716,0.0037540295],"study_design_scores_gemma":[0.022326952,0.0039657224,0.0016490668,0.007536982,0.0015630546,0.08359614,0.016864793,0.5751587,0.2544501,0.013786127,0.014039061,0.0050632395],"about_ca_topic_score_codex":9.153941e-7,"about_ca_topic_score_gemma":7.4971166e-7,"teacher_disagreement_score":0.6122403,"about_ca_system_score_codex":0.00016553789,"about_ca_system_score_gemma":0.000009761336,"threshold_uncertainty_score":0.76561135},"labels":[],"label_agreement":null},{"id":"W1970941496","doi":"10.1109/ofc.2006.215835","title":"Label stacking using spectral amplitude code labels for optical packet switching","year":2006,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Stacking; Computer science; Label switching; Network packet; Code (set theory); Amplitude; Path protection; Computer network; Routing (electronic design automation); Path (computing); Packet switching; Wavelength-division multiplexing; Optoelectronics; Optics; Physics; Multiprotocol Label Switching","score_opus":0.025030063857586847,"score_gpt":0.2539191723359545,"score_spread":0.22888910847836766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970941496","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.7382623,0.00011730814,0.2538412,0.000015604332,0.00030674046,0.00020256704,0.000015883428,0.00037959573,0.0068587917],"genre_scores_gemma":[0.98112917,0.000001510199,0.018295472,0.00002547592,0.00030835377,0.000014222895,0.000009296077,0.00005157612,0.00016494174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893314,0.000014942787,0.00028990567,0.00018605776,0.00012201711,0.00045396978],"domain_scores_gemma":[0.9995934,0.00010743254,0.00002408765,0.00018338629,0.000026582142,0.0000651602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028606426,0.00018080657,0.00021941999,0.000070157876,0.000117209376,0.0001064931,0.000121401696,0.00008721521,0.00003304914],"category_scores_gemma":[0.000011606141,0.00017199747,0.00007834476,0.00012469594,0.000017784738,0.00015743551,0.000016339118,0.00012318476,0.000013566071],"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.000023333063,0.00006385094,0.0017958618,0.00021387634,0.000085019776,0.000011649604,0.00016811785,0.026531635,0.392109,0.57748544,0.0005878678,0.0009243306],"study_design_scores_gemma":[0.0038777094,0.00016207417,0.0026910056,0.00033881422,0.00018080442,0.00013380608,0.00079810276,0.6486128,0.20695788,0.12545285,0.008790252,0.002003923],"about_ca_topic_score_codex":0.000040485782,"about_ca_topic_score_gemma":0.00008667733,"teacher_disagreement_score":0.62208116,"about_ca_system_score_codex":0.00006170155,"about_ca_system_score_gemma":0.000008580011,"threshold_uncertainty_score":0.7013853},"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":"W1971692815","doi":"10.1016/j.ejc.2005.03.004","title":"Hadamard ideals and Hadamard matrices with two circulant cores","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Mathematics; Hadamard three-lines theorem; Circulant matrix; Hadamard three-circle theorem; Formalism (music); Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.0048725861245969525,"score_gpt":0.1753602694732534,"score_spread":0.17048768334865644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971692815","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.9767428,0.005140095,0.0022747181,0.00008814925,0.00057055306,0.00006629005,0.0000023486039,0.000072007584,0.015043009],"genre_scores_gemma":[0.9989856,0.00036465807,0.00025955233,0.00003744682,0.00021745889,3.7180553e-7,4.9290077e-7,0.000048157952,0.00008624416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988265,0.0001942659,0.00042398053,0.00008742074,0.00027145247,0.0001963558],"domain_scores_gemma":[0.9993244,0.00006818893,0.00018577398,0.00015024294,0.00010688893,0.00016450985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089191255,0.0001677323,0.00027431836,0.00015166753,0.00006831596,0.00009075998,0.00022495806,0.000017643775,0.000011944021],"category_scores_gemma":[0.000017786102,0.00012909739,0.00006257109,0.00019236663,0.00004307631,0.0002167803,0.000023210687,0.00026001333,0.000020942449],"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.0012510093,0.0010321498,0.1626478,0.002136395,0.0038544983,0.012980754,0.012111315,0.12021399,0.0213413,0.45411095,0.08469395,0.123625875],"study_design_scores_gemma":[0.021150073,0.0040936847,0.1312349,0.0025142832,0.0008585687,0.015041082,0.0021307706,0.00689126,0.0070445347,0.018237384,0.7875656,0.0032378985],"about_ca_topic_score_codex":6.84366e-7,"about_ca_topic_score_gemma":8.6253294e-7,"teacher_disagreement_score":0.7028716,"about_ca_system_score_codex":0.00003384482,"about_ca_system_score_gemma":0.000013352006,"threshold_uncertainty_score":0.52644384},"labels":[],"label_agreement":null},{"id":"W1971749321","doi":"10.1007/s10623-006-0008-4","title":"The Existence of (ν,6, λ)-Perfect Mendelsohn Designs with λ &gt; 1","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Combinatorics; Physics; Arithmetic; Discrete mathematics","score_opus":0.010746906289025781,"score_gpt":0.183547787819434,"score_spread":0.17280088153040823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971749321","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.80638397,0.00917135,0.15800601,0.00002611826,0.00018829152,0.00052533246,0.000027421036,0.00033856623,0.025332961],"genre_scores_gemma":[0.99794316,0.00026402174,0.0016408733,0.000008586731,0.000037874735,0.000051051582,0.0000035289302,0.000027211643,0.000023675842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902207,0.00008386722,0.00024772,0.0001733008,0.00017600133,0.00029705488],"domain_scores_gemma":[0.999376,0.00019526937,0.000054524102,0.00026866156,0.00004792179,0.00005764641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003420306,0.00019965209,0.00022216648,0.00011298484,0.00022247514,0.00006807116,0.0001736564,0.000063853324,0.000008089386],"category_scores_gemma":[0.0000029221537,0.00013009753,0.000099541416,0.00044673396,0.00027080445,0.00008510246,0.000011083267,0.00009875406,0.0000017922891],"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.00024358726,0.00010410406,0.014266139,0.00030399064,0.0004572148,0.000025576486,0.00068310683,0.004731421,0.10629303,0.86342394,0.002276541,0.007191348],"study_design_scores_gemma":[0.006933566,0.0046448465,0.06744597,0.0014717458,0.0010917404,0.0005963865,0.00715062,0.027487125,0.28557873,0.5233979,0.06882425,0.0053771217],"about_ca_topic_score_codex":0.00003844098,"about_ca_topic_score_gemma":0.000055552835,"teacher_disagreement_score":0.34002602,"about_ca_system_score_codex":0.0000054565635,"about_ca_system_score_gemma":0.000008065892,"threshold_uncertainty_score":0.53052235},"labels":[],"label_agreement":null},{"id":"W1971847304","doi":"10.1016/j.laa.2013.09.004","title":"Circulant partial Hadamard matrices","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Manitoba","funders":"","keywords":"Mathematics; Circulant matrix; Combinatorics; Hadamard transform; Hadamard matrix; Conjecture; Matrix (chemical analysis); Connection (principal bundle); Order (exchange); Hadamard's maximal determinant problem; Discrete mathematics; Complex Hadamard matrix; Mathematical analysis","score_opus":0.006614475853016987,"score_gpt":0.19487126999000629,"score_spread":0.18825679413698929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971847304","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.97086287,0.0037071495,0.014621221,0.00024923572,0.00015642768,0.00092790567,0.000027672004,0.00057143235,0.008876117],"genre_scores_gemma":[0.9988154,0.00016198831,0.00014070873,0.00004163799,0.00018702619,0.00044014913,0.000013666202,0.000015011583,0.00018442143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955314,0.0000095093565,0.00013601723,0.00011229465,0.00005595121,0.00013308371],"domain_scores_gemma":[0.9997126,0.00002683022,0.000015809024,0.00014240181,0.000023121827,0.00007924285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042617292,0.000083481784,0.000089470384,0.000036123776,0.00008531312,0.00003837442,0.000080515856,0.0000487121,0.0001452901],"category_scores_gemma":[0.0000026438472,0.000075067095,0.000027500133,0.00012961733,0.000015757247,0.000097800454,0.00001280782,0.00006471686,0.0007101965],"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.000007697946,0.000145483,0.0017864375,0.0006277003,0.00026661184,0.0000025857973,0.0011230519,0.0016186547,0.082532145,0.85681,0.012483623,0.04259601],"study_design_scores_gemma":[0.0007718775,0.00007540626,0.008199137,0.00005982288,0.00011796227,0.00006576062,0.000553995,0.2028815,0.02480335,0.031237058,0.73013616,0.0010979522],"about_ca_topic_score_codex":0.0000077778595,"about_ca_topic_score_gemma":9.2314605e-7,"teacher_disagreement_score":0.82557297,"about_ca_system_score_codex":0.000004174866,"about_ca_system_score_gemma":0.000003203269,"threshold_uncertainty_score":0.91283756},"labels":[],"label_agreement":null},{"id":"W1971956496","doi":"10.1016/s0012-365x(99)00342-8","title":"Modified group divisible designs with block size four","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Group (periodic table); Discrete mathematics; Arithmetic; Computer science","score_opus":0.017692051282143628,"score_gpt":0.20049401682381235,"score_spread":0.18280196554166872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971956496","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.88019013,0.000103966864,0.02142905,0.000017154744,0.00008193036,0.00036431683,0.000016651673,0.00059652276,0.097200304],"genre_scores_gemma":[0.9932748,0.000016078639,0.004818842,0.000016618818,0.00004926869,0.00004579034,0.0000036966542,0.00006615097,0.001708764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.00002643865,0.00025194185,0.00014433991,0.00019977662,0.00030302102],"domain_scores_gemma":[0.9993426,0.0001284052,0.000030198024,0.0003907744,0.000013928943,0.000094097406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017376554,0.00022061933,0.00026248713,0.00003557735,0.00007918531,0.0000649311,0.00019937463,0.00007201128,0.00030736008],"category_scores_gemma":[0.000010509107,0.00016899998,0.000074764685,0.00019102983,0.000039899212,0.000104190665,0.000010245092,0.00011948316,0.00018285791],"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.00030010822,0.0008206776,0.00089212187,0.0072084027,0.0021814734,0.00042057366,0.03142046,0.44661176,0.024761502,0.4666309,0.0067822845,0.011969716],"study_design_scores_gemma":[0.00560608,0.00097393506,0.0015999716,0.0022148269,0.0006911569,0.0007622445,0.0041385936,0.73544735,0.011358272,0.22170874,0.01090712,0.004591727],"about_ca_topic_score_codex":0.0000029989708,"about_ca_topic_score_gemma":0.0000049038863,"teacher_disagreement_score":0.28883556,"about_ca_system_score_codex":0.000016448535,"about_ca_system_score_gemma":0.000004536322,"threshold_uncertainty_score":0.6891619},"labels":[],"label_agreement":null},{"id":"W1972419950","doi":"10.1016/s0012-365x(03)00262-0","title":"Existence of (v,{5,w∗},1)-PBDs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Embedding; Line (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.011148453049231023,"score_gpt":0.20617023034433635,"score_spread":0.19502177729510534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972419950","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.5998987,0.00047553898,0.036575608,0.00000491819,0.0003271247,0.00018925265,0.000012624213,0.00021528287,0.36230096],"genre_scores_gemma":[0.9932999,0.000010687492,0.0063467883,0.0000039953993,0.000009363409,0.00000888338,0.0000011708576,0.000021141903,0.0002980505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999434,0.000019236948,0.00023859876,0.00006218328,0.00011055618,0.00013542875],"domain_scores_gemma":[0.9995967,0.000047484024,0.000037539765,0.00026200176,0.00001862496,0.000037657723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019125958,0.00009808803,0.00017637292,0.00003779228,0.00001960137,0.000009093332,0.00010849427,0.000042095126,0.00007779851],"category_scores_gemma":[0.000041821575,0.00008475033,0.000066271714,0.00012907438,0.000039463655,0.000045193683,0.0000063905527,0.000054619883,0.000040526244],"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":[7.537497e-7,0.000020539992,0.0001207939,0.000673379,0.000036275218,0.000002330557,0.00166892,0.00035954962,0.0043471134,0.99248236,0.00016850195,0.000119484845],"study_design_scores_gemma":[0.0008527341,0.00012546177,0.0002418864,0.0007254555,0.00012054699,0.0001168869,0.008653226,0.027774239,0.23176244,0.713036,0.015489192,0.0011019066],"about_ca_topic_score_codex":4.256472e-7,"about_ca_topic_score_gemma":4.6953693e-7,"teacher_disagreement_score":0.39340124,"about_ca_system_score_codex":0.0000072461717,"about_ca_system_score_gemma":0.0000041308067,"threshold_uncertainty_score":0.34560183},"labels":[],"label_agreement":null},{"id":"W1972446935","doi":"10.1006/inco.2001.3044","title":"Quorum Systems Constructed from Combinatorial Designs","year":2001,"lang":"en","type":"article","venue":"Information and Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Beijing Institute For Brain Disorders","keywords":"Combinatorial design; Rank (graph theory); Intersection (aeronautics); Computer science; Quorum sensing; Consistency (knowledge bases); Set (abstract data type); Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.009540108577223393,"score_gpt":0.19348066349873738,"score_spread":0.18394055492151398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972446935","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.80595446,0.000096414486,0.18557282,0.000010518666,0.0018576244,0.00016031344,0.000012492501,0.00031516582,0.006020214],"genre_scores_gemma":[0.99968755,0.0000116858255,0.00009739483,0.000018477425,0.000055892666,0.000008917664,0.00011207688,0.0000040736704,0.0000039369556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995362,0.000027854523,0.00023073645,0.0000365277,0.00008844034,0.00008020852],"domain_scores_gemma":[0.99978954,0.0000390528,0.00004347122,0.0000445738,0.000043673674,0.00003971844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008054452,0.00007075266,0.000084651445,0.00007182396,0.00006175583,0.000118421645,0.00003144607,0.000054957993,0.000011064936],"category_scores_gemma":[0.000005197837,0.00007236569,0.000013810237,0.0001063048,0.000015811638,0.0005497597,0.000004932786,0.000047887574,0.000059256326],"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.00020582936,0.000047068417,0.023151323,0.00041855968,0.00029964323,0.000009391198,0.011205277,0.47834155,0.0017187567,0.30773282,0.010328128,0.16654164],"study_design_scores_gemma":[0.00146201,0.00003873964,0.0076443106,0.000054888944,0.00001453587,0.000042481308,0.0024400447,0.9646774,0.00015441842,0.009472918,0.013748053,0.00025022752],"about_ca_topic_score_codex":0.00004950764,"about_ca_topic_score_gemma":0.0000010691913,"teacher_disagreement_score":0.4863358,"about_ca_system_score_codex":0.000016013866,"about_ca_system_score_gemma":0.0000061535807,"threshold_uncertainty_score":0.29509872},"labels":[],"label_agreement":null},{"id":"W1972558562","doi":"10.1016/j.laa.2011.11.013","title":"The principal rank characteristic sequence of a real symmetric matrix","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Rank (graph theory); Minor (academic); Combinatorics; Sequence (biology); Principal (computer security); Matrix (chemical analysis); Order (exchange); Principal component analysis; Symmetric matrix; Eigenvalues and eigenvectors; Law; Statistics; Computer science","score_opus":0.021449319394394484,"score_gpt":0.2403341954377746,"score_spread":0.2188848760433801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972558562","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.9831496,0.0015778496,0.0034190156,0.000022847129,0.000112558555,0.000605031,0.00007186509,0.00018057741,0.010860655],"genre_scores_gemma":[0.9987382,0.0007028194,0.00014107606,0.00000419788,0.000057232628,0.00015622166,0.000007618084,0.0000123102645,0.00018027649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950796,0.000016845663,0.00019927061,0.000094416166,0.00006132739,0.00012015492],"domain_scores_gemma":[0.9995955,0.000072684736,0.000041920266,0.00020449255,0.00003547339,0.000049893864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013551452,0.00007718739,0.00010008283,0.000048596685,0.000107570704,0.000009942039,0.00014128503,0.000042631636,0.000014066012],"category_scores_gemma":[0.000011635805,0.000057642977,0.000030380914,0.00028152668,0.000045105793,0.00004402061,0.000017581233,0.00007379138,0.000040983836],"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.000014991028,0.000028967836,0.00037471863,0.00013938469,0.000050278628,6.8667543e-7,0.00063324906,0.000010317848,0.013206049,0.9801694,0.000023459914,0.0053484966],"study_design_scores_gemma":[0.0038481778,0.0009224345,0.1863383,0.00042868318,0.0009174244,0.00035198548,0.0026032703,0.22316638,0.1215558,0.13252924,0.32374075,0.0035975403],"about_ca_topic_score_codex":0.0000097197335,"about_ca_topic_score_gemma":0.00000219656,"teacher_disagreement_score":0.84764016,"about_ca_system_score_codex":0.0000053108843,"about_ca_system_score_gemma":0.000007125386,"threshold_uncertainty_score":0.23506124},"labels":[],"label_agreement":null},{"id":"W1972595683","doi":"10.1016/s0012-365x(02)00482-x","title":"A note on {4}-GDDs of type 210","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Block size; Class (philosophy); Block (permutation group theory); Type (biology); Combinatorics; Discrete mathematics; Group (periodic table); Arithmetic; Computer science; Chemistry","score_opus":0.01162020813950074,"score_gpt":0.22679861714162675,"score_spread":0.215178409002126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972595683","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.6774232,0.0001972146,0.012414912,0.000008648922,0.0006023846,0.00022475881,0.0000143912575,0.00021155932,0.30890298],"genre_scores_gemma":[0.9977981,0.000008201429,0.0018547468,0.00000817672,0.000013916388,0.0000045061483,0.0000018082161,0.000026341804,0.00028422655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947953,0.000019500081,0.00020016578,0.00006282194,0.000112391834,0.00012561723],"domain_scores_gemma":[0.99958575,0.0000637695,0.000033184726,0.00026238814,0.000019477695,0.000035449113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016135535,0.00010366704,0.00017417951,0.00004602189,0.000018209399,0.000008358301,0.000085749445,0.000052401334,0.00007913726],"category_scores_gemma":[0.000059888254,0.00008652976,0.00005695553,0.00014566044,0.000022275952,0.000025456153,0.000004961346,0.00007075008,0.00011101627],"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.000006848084,0.00005776195,0.00004753985,0.000819738,0.000066979956,0.0000061533965,0.0032542306,0.003284965,0.0076207393,0.9838792,0.0006692918,0.00028656638],"study_design_scores_gemma":[0.0022296484,0.0008587927,0.00024093057,0.002024043,0.00028253117,0.00013879026,0.0050774207,0.11007154,0.30352852,0.51966363,0.053671706,0.0022124487],"about_ca_topic_score_codex":3.995114e-7,"about_ca_topic_score_gemma":5.395926e-7,"teacher_disagreement_score":0.46421555,"about_ca_system_score_codex":0.000009377684,"about_ca_system_score_gemma":0.0000049475134,"threshold_uncertainty_score":0.35285813},"labels":[],"label_agreement":null},{"id":"W1973350705","doi":"10.1117/12.628632","title":"Unipolar-encoding/bipolar-decoding for optical CDMA using an electro-optical phase modulator and fiber bragg grating arrays","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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 Ottawa","funders":"","keywords":"Decoding methods; Fiber Bragg grating; Encoder; Computer science; Encoding (memory); Code division multiple access; Multiplexing; Electronic engineering; Optics; Physics; Optical fiber; Telecommunications; Engineering","score_opus":0.014976583096099862,"score_gpt":0.24186951018021266,"score_spread":0.2268929270841128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973350705","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.99552757,0.00042102853,0.0014258164,0.0003660488,0.0002688177,0.000828416,0.000082342856,0.00026452725,0.0008154167],"genre_scores_gemma":[0.81644654,0.00005967215,0.18210284,0.00005096146,0.0009846938,0.00013614114,0.0000143179095,0.00014864112,0.000056180703],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969058,6.503426e-8,0.001049282,0.0005838394,0.00062944466,0.0008315502],"domain_scores_gemma":[0.99814236,0.00026169675,0.00026770556,0.00010497518,0.0008851756,0.0003380639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011174526,0.00057160354,0.0006908716,0.00019450558,0.00023907873,0.00028264872,0.000772715,0.00037678418,0.000015140664],"category_scores_gemma":[0.00045480285,0.0005327362,0.00063516106,0.0003576055,0.00026629548,0.0013011598,0.00011531099,0.00055008807,0.0000012887783],"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.000082972045,0.00014335978,0.00008093701,0.00054414896,0.00036929426,1.3201029e-7,0.00026857998,0.0020415785,0.65543246,0.33886132,0.00021679241,0.0019584317],"study_design_scores_gemma":[0.0019968934,0.00045891677,0.000053263026,0.00033882624,0.00026205386,0.00007251532,0.00082486536,0.6460705,0.34417412,0.001774385,0.0033103987,0.0006632982],"about_ca_topic_score_codex":0.000004078347,"about_ca_topic_score_gemma":3.423306e-7,"teacher_disagreement_score":0.6440289,"about_ca_system_score_codex":0.00025640673,"about_ca_system_score_gemma":0.000032787317,"threshold_uncertainty_score":0.9997124},"labels":[],"label_agreement":null},{"id":"W1973378877","doi":"10.1109/tit.2012.2196021","title":"A Construction of Codebooks Associated With Binary Sequences","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"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; Codebook; Combinatorics; Hamming space; Binary code; Binary number; Sequence (biology); Hadamard matrix; Hadamard transform; Matrix (chemical analysis); Hamming distance; Hamming code; Matrix norm; Discrete mathematics; Hamming weight; Algorithm; Block code; Eigenvalues and eigenvectors; Arithmetic; Mathematical analysis; Physics; Decoding methods","score_opus":0.006846413880487452,"score_gpt":0.17949388306727582,"score_spread":0.17264746918678836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973378877","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.45796594,0.000031420717,0.52448475,0.0000046092196,0.00084021786,0.00019697037,0.000067629575,0.00032478877,0.016083637],"genre_scores_gemma":[0.9997005,0.00000767394,0.0001589739,0.000020568466,0.000010529507,0.000036702546,0.00000732006,0.000008729204,0.000049033242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993519,0.0000721159,0.00025801157,0.000032618238,0.00013642559,0.00014891622],"domain_scores_gemma":[0.9996142,0.00008919575,0.00007844741,0.00011534398,0.000050412233,0.000052411076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036145814,0.00010548604,0.00011961378,0.00019461622,0.00008556931,0.000012297503,0.00005887276,0.00008192514,0.00010362764],"category_scores_gemma":[0.0000033627396,0.00008972211,0.000049359536,0.00018525339,0.00013465293,0.000968176,1.9574256e-7,0.00012932763,0.00004366739],"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.0010288367,0.00036971274,0.0004912323,0.0007993967,0.0016120933,0.0000014802218,0.038248427,0.4329114,0.009177589,0.40211868,0.0002567381,0.112984404],"study_design_scores_gemma":[0.005754864,0.0014458788,0.002914514,0.0016644407,0.0006867041,0.00034161803,0.03852637,0.038359843,0.8716018,0.032868143,0.0033719572,0.0024638316],"about_ca_topic_score_codex":0.0000023002206,"about_ca_topic_score_gemma":0.0000015512961,"teacher_disagreement_score":0.86242425,"about_ca_system_score_codex":0.000040745625,"about_ca_system_score_gemma":0.000012406463,"threshold_uncertainty_score":0.36587614},"labels":[],"label_agreement":null},{"id":"W1973674225","doi":"10.1016/s0166-218x(00)00381-4","title":"Almost resolvable perfect Mendelsohn designs with block size five","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Block size; Block (permutation group theory); Discrete mathematics","score_opus":0.01463708394742453,"score_gpt":0.1866140436394577,"score_spread":0.17197695969203317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973674225","genre_codex":"other","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.2636203,0.0005054737,0.0214859,0.000043948305,0.00017379128,0.0013488431,0.00004418067,0.0012909558,0.71148664],"genre_scores_gemma":[0.9875863,0.00003085669,0.010868374,0.000027592545,0.0000597333,0.00014585182,0.000004703637,0.00009868419,0.0011778664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987758,0.000015328296,0.00030958303,0.00022408296,0.000257901,0.00041731764],"domain_scores_gemma":[0.9990581,0.00022426441,0.00006375178,0.000512563,0.000022551707,0.00011875192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019104198,0.00030535285,0.00036556285,0.000053195974,0.00012805838,0.000064977474,0.0002386666,0.00010663498,0.00032522934],"category_scores_gemma":[0.00001429908,0.00024825454,0.00007135226,0.0002554138,0.0000647468,0.0000756441,0.000027890088,0.00019427095,0.00032550277],"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.00016779627,0.0007527945,0.00008105017,0.0051601124,0.0020053973,0.00020183936,0.06353855,0.081384785,0.14011902,0.6602123,0.044486526,0.0018898622],"study_design_scores_gemma":[0.008196549,0.0010856461,0.00010364332,0.0016398304,0.001354213,0.00076561485,0.03602545,0.6254333,0.15187038,0.14475912,0.02164487,0.0071213534],"about_ca_topic_score_codex":0.000002215653,"about_ca_topic_score_gemma":0.0000034953239,"teacher_disagreement_score":0.72396606,"about_ca_system_score_codex":0.000034700573,"about_ca_system_score_gemma":0.000004437531,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W1973989497","doi":"10.1016/j.comgeo.2012.10.005","title":"Families of polytopal digraphs that do not satisfy the shelling property","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University","funders":"","keywords":"Property (philosophy); Mathematics; Combinatorics; Philosophy","score_opus":0.017847801814345886,"score_gpt":0.20855456157778607,"score_spread":0.19070675976344018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973989497","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.97987086,0.0022442346,0.013493784,0.000029504956,0.0006519374,0.00013618132,0.000022012524,0.000097738164,0.0034537707],"genre_scores_gemma":[0.9992368,0.000021206813,0.00046285207,0.000043788365,0.00013406653,0.0000102720805,0.000010809633,0.000016506217,0.00006367854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992398,0.00004068573,0.00019369066,0.00008123666,0.00024694117,0.00019764458],"domain_scores_gemma":[0.9994959,0.00024206565,0.00004103613,0.00013517252,0.000036148296,0.000049638315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030224113,0.000114385046,0.00014032835,0.0001540248,0.000082990875,0.000023772094,0.0001537592,0.000046740206,0.000046488116],"category_scores_gemma":[0.00001618939,0.00006882488,0.00007127961,0.00037134497,0.000078893034,0.00013742896,0.000024088955,0.000113518814,0.000035258876],"study_design_candidate":"observational","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.000032624135,0.00010635185,0.30542442,0.00046418316,0.00036490685,0.0000019000003,0.004884464,0.56721723,0.0033614282,0.084174216,0.0014668858,0.03250141],"study_design_scores_gemma":[0.000787501,0.00007253965,0.9037691,0.00022534649,0.00008324221,0.00007516283,0.003247374,0.055230357,0.01050282,0.01431514,0.010879997,0.0008114187],"about_ca_topic_score_codex":0.000009524156,"about_ca_topic_score_gemma":5.7267664e-7,"teacher_disagreement_score":0.5983447,"about_ca_system_score_codex":0.000011316574,"about_ca_system_score_gemma":0.0000075256758,"threshold_uncertainty_score":0.2806597},"labels":[],"label_agreement":null},{"id":"W1974529300","doi":"10.1016/j.jalgebra.2009.12.014","title":"Zero patterns and unitary similarity","year":2009,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Unitary state; Zero (linguistics); Similarity (geometry); Pure mathematics; Artificial intelligence; Computer science; Linguistics","score_opus":0.005606270103088619,"score_gpt":0.18749308336013323,"score_spread":0.18188681325704462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974529300","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.99629164,0.0007546417,0.0016130449,0.00013788445,0.00025878943,0.000021223685,0.000002005703,0.000022120517,0.0008986302],"genre_scores_gemma":[0.9995474,0.00010621678,0.000088624845,0.00012465447,0.000112663925,9.814115e-8,3.2132982e-7,0.000005838539,0.000014159834],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99957055,0.00002290297,0.00019346597,0.00003261284,0.000088151784,0.00009230672],"domain_scores_gemma":[0.9997692,0.00002265681,0.000041349387,0.00006608827,0.000025942558,0.00007476903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019401131,0.00006657756,0.00013130119,0.00007031505,0.000023432085,0.000019096333,0.00007427593,0.000040928135,0.000022519762],"category_scores_gemma":[0.000008322842,0.000055662604,0.000048425034,0.000053995915,0.000008899405,0.00014465472,0.000004206493,0.00017097523,0.000002351474],"study_design_candidate":"observational","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.00065057294,0.0009502427,0.2297836,0.0014917909,0.00230108,0.0040585026,0.015776126,0.017964855,0.10157793,0.17107,0.08742228,0.36695302],"study_design_scores_gemma":[0.0025671585,0.0013207293,0.71555793,0.0006509417,0.00018705479,0.0029284458,0.00092303305,0.0023188803,0.013496993,0.24355993,0.015641723,0.00084718945],"about_ca_topic_score_codex":0.000001035509,"about_ca_topic_score_gemma":9.754436e-7,"teacher_disagreement_score":0.48577434,"about_ca_system_score_codex":0.000009209756,"about_ca_system_score_gemma":0.0000042075144,"threshold_uncertainty_score":0.2269855},"labels":[],"label_agreement":null},{"id":"W1974807847","doi":"10.1016/j.disc.2005.03.023","title":"Extended Petersen graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"McMaster University","funders":"","keywords":"Combinatorics; Mathematics; Petersen graph; Discrete mathematics; Chordal graph; Indifference graph; Graph; Line graph; Voltage graph","score_opus":0.007963816504260353,"score_gpt":0.20945181349046588,"score_spread":0.20148799698620554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974807847","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.735411,0.0006357194,0.02150596,0.0001233943,0.00054817187,0.00041298967,0.000028907763,0.0014185633,0.23991528],"genre_scores_gemma":[0.9942084,0.000017011702,0.0051642866,0.000030880965,0.00007301272,0.000019737141,0.0000053587632,0.000038985927,0.0004423405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931693,0.000013192479,0.0002309506,0.00009332719,0.00013002713,0.00021558924],"domain_scores_gemma":[0.9995602,0.00003388948,0.000026899716,0.00029741952,0.000012141478,0.000069451635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013569917,0.00014573544,0.0001699064,0.000065520304,0.000043252727,0.00003486541,0.00015042254,0.000052738975,0.00013229364],"category_scores_gemma":[0.000009828765,0.00012653966,0.00010053873,0.000114922266,0.000030511672,0.0001028697,0.000015148988,0.00008880515,0.000337889],"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.000010449881,0.00016614703,0.000109493056,0.0012954766,0.0003791227,0.000028892155,0.014725616,0.005374659,0.020637937,0.9347,0.010619753,0.01195241],"study_design_scores_gemma":[0.0019481492,0.00014640178,0.0011697614,0.00065213145,0.0002692277,0.000311305,0.008308233,0.40883002,0.038475443,0.44652286,0.09070787,0.002658625],"about_ca_topic_score_codex":3.3755063e-7,"about_ca_topic_score_gemma":0.0000024959768,"teacher_disagreement_score":0.48817718,"about_ca_system_score_codex":0.000015128544,"about_ca_system_score_gemma":0.0000024770036,"threshold_uncertainty_score":0.51601374},"labels":[],"label_agreement":null},{"id":"W1975073433","doi":"10.1016/j.dam.2005.03.004","title":"On the computational complexity of defining sets","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"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; Vertex (graph theory); Computational complexity theory; Feedback vertex set; Discrete mathematics; Dominating set; Integer (computer science); Set (abstract data type); Graph; Algorithm; Computer science","score_opus":0.022911517164400135,"score_gpt":0.22810424032527768,"score_spread":0.20519272316087755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975073433","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.7739216,0.00005474337,0.04760599,0.0001228248,0.000070414564,0.0003436658,0.00006851314,0.00021424657,0.17759797],"genre_scores_gemma":[0.9854142,9.962334e-7,0.014460439,0.00004774576,0.000011226934,0.000020983209,0.000016558002,0.000019306133,0.0000085582815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939984,0.000008680252,0.00024014115,0.00006725199,0.00016485326,0.000119231765],"domain_scores_gemma":[0.9994492,0.0002659267,0.000054324748,0.00019289271,0.000012357294,0.00002529063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019729337,0.00010734413,0.0001573802,0.000029896722,0.00005767926,0.000013201022,0.00014241821,0.00003342968,0.000085167274],"category_scores_gemma":[0.0000094573625,0.000075546486,0.00004901383,0.000086506654,0.00008851718,0.000019563473,0.00001643329,0.00009288538,0.00016513611],"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.0000024213089,0.00001720428,0.0000016895004,0.00008756311,0.000027710927,1.1947411e-7,0.0010709842,0.060168996,0.00042312915,0.9374378,0.00049515953,0.00026722637],"study_design_scores_gemma":[0.00020065716,0.000011785344,0.00007829362,0.00006655887,0.000017087228,0.000003941651,0.0007972466,0.23122947,0.00261771,0.7645816,0.00023985452,0.00015577796],"about_ca_topic_score_codex":3.2113215e-7,"about_ca_topic_score_gemma":0.0000010814049,"teacher_disagreement_score":0.21149255,"about_ca_system_score_codex":0.00001192472,"about_ca_system_score_gemma":0.0000037760933,"threshold_uncertainty_score":0.30806965},"labels":[],"label_agreement":null},{"id":"W1975666971","doi":"10.1016/s0012-365x(03)00273-5","title":"HGDDs with block size four","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Discrete mathematics; Computer science; Key (lock)","score_opus":0.008262183121001977,"score_gpt":0.18470170720327095,"score_spread":0.17643952408226898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975666971","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.7356186,0.00018556428,0.017075978,0.00001775148,0.00025080185,0.00030414652,0.000010071962,0.0005175325,0.24601956],"genre_scores_gemma":[0.9927081,0.0000054676057,0.006235847,0.000012748625,0.00002247387,0.000021724692,8.22406e-7,0.0000470139,0.0009458069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993488,0.000021807347,0.00018036496,0.00009340817,0.00014182026,0.000213771],"domain_scores_gemma":[0.99948984,0.00009635979,0.000029165722,0.00029950126,0.000017776669,0.0000673705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016340133,0.0001572783,0.00018857433,0.000026686961,0.000046394867,0.000035184577,0.00010420832,0.00005108093,0.00008883516],"category_scores_gemma":[0.000042368432,0.00011747862,0.000052180192,0.00014357889,0.000028840455,0.00005396352,0.000006077497,0.00009193616,0.00009867695],"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.000013667842,0.000114038005,0.00091766403,0.0021082577,0.0005001183,0.000097650445,0.0075669773,0.010460746,0.0058914176,0.96941847,0.0026674361,0.00024354571],"study_design_scores_gemma":[0.008240993,0.0010417381,0.0014852381,0.003277664,0.0010732488,0.0035472836,0.02772949,0.10912615,0.120146625,0.58210456,0.13432416,0.007902862],"about_ca_topic_score_codex":4.5712503e-7,"about_ca_topic_score_gemma":0.000002263828,"teacher_disagreement_score":0.38731393,"about_ca_system_score_codex":0.000012287767,"about_ca_system_score_gemma":0.0000061710584,"threshold_uncertainty_score":0.47906393},"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":"W1976201283","doi":"10.1007/s10623-014-9944-6","title":"Mutually unbiased weighing matrices","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Hadamard transform; Mutually unbiased bases; Mathematics; Best linear unbiased prediction; Upper and lower bounds; Combinatorics; Computer science; Statistics; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.00843946014366608,"score_gpt":0.18375611678491696,"score_spread":0.17531665664125087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976201283","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.7667619,0.0023379533,0.2137139,0.000019149527,0.00044841474,0.00018609971,0.0000109658395,0.0006978178,0.015823817],"genre_scores_gemma":[0.9975192,0.00020096054,0.002050811,0.00006231476,0.00010333267,0.000020595679,0.000005691465,0.000028400247,0.000008708776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918824,0.000076612814,0.00018811358,0.00017559851,0.00011466491,0.0002567509],"domain_scores_gemma":[0.9995281,0.00012659396,0.000028983019,0.00018611421,0.000020817648,0.00010939272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031862367,0.00018013385,0.0002024867,0.00021314206,0.0001329932,0.00010587153,0.00012780154,0.00008097491,0.000031387422],"category_scores_gemma":[0.000007212107,0.00016370855,0.000100256344,0.0003480132,0.00006075165,0.0001161478,0.000012019125,0.00010348058,0.000014450948],"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.000090568814,0.000113547445,0.01910549,0.0009922761,0.00062495586,0.000026710974,0.0030885905,0.0036459584,0.088561535,0.7918719,0.006910482,0.084967986],"study_design_scores_gemma":[0.006337704,0.0016104252,0.034631725,0.0012029285,0.0007203387,0.00017962245,0.0049637733,0.16896664,0.042408876,0.3173448,0.4153344,0.0062987604],"about_ca_topic_score_codex":0.000009733322,"about_ca_topic_score_gemma":0.000006376911,"teacher_disagreement_score":0.4745271,"about_ca_system_score_codex":0.0000035965788,"about_ca_system_score_gemma":0.0000024421875,"threshold_uncertainty_score":0.66758406},"labels":[],"label_agreement":null},{"id":"W1976934926","doi":"10.1016/j.apnum.2007.01.008","title":"Euclidean distances and least squares problems for a given set of vectors","year":2007,"lang":"en","type":"article","venue":"Applied Numerical Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Euclidean distance matrix; Euclidean distance; Euclidean geometry; Rank (graph theory); Combinatorics; Euclidean space; Simple (philosophy); Column (typography); Matrix (chemical analysis); Set (abstract data type); Least-squares function approximation; Euclidean shortest path; Applied mathematics; Geometry; Statistics; Computer science","score_opus":0.011910150118512559,"score_gpt":0.2183315139589488,"score_spread":0.20642136384043622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976934926","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.46112132,0.00031990223,0.529933,0.000019904015,0.00012918802,0.00082362513,0.000042292737,0.00022557027,0.007385216],"genre_scores_gemma":[0.99305665,0.0000061632218,0.0067908345,0.0000050353906,0.00004287553,0.000046558263,0.0000047423937,0.000029699882,0.00001744435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924886,0.000004827695,0.00032924398,0.00010763794,0.00010641102,0.0002030325],"domain_scores_gemma":[0.9994247,0.00028605902,0.000068990164,0.00013846788,0.000016158658,0.00006565318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027854583,0.00013096754,0.00027717385,0.00004372489,0.000036626516,0.000012822687,0.0000936551,0.00005594191,0.000007164382],"category_scores_gemma":[0.000017793674,0.0001111501,0.000048392063,0.00013931791,0.0000630407,0.000026496686,0.000013584533,0.000060736304,0.0000042453757],"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.00014283737,0.00029260444,0.0010327653,0.013200502,0.0004194429,0.000004150423,0.022852857,0.0032665464,0.051079687,0.8810987,0.0013711735,0.025238743],"study_design_scores_gemma":[0.0032621662,0.00070811255,0.0020990358,0.000938492,0.00033686208,0.000054628857,0.021755885,0.04895231,0.06630824,0.81496847,0.03841611,0.0021997008],"about_ca_topic_score_codex":0.0000015725861,"about_ca_topic_score_gemma":0.0000024063877,"teacher_disagreement_score":0.53193533,"about_ca_system_score_codex":0.000010369189,"about_ca_system_score_gemma":0.000002367332,"threshold_uncertainty_score":0.45325693},"labels":[],"label_agreement":null},{"id":"W1977101828","doi":"10.1016/j.disc.2010.06.010","title":"Spreads, arcs, and multiple wavelength codes","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.006451104124225585,"score_gpt":0.19599923977507003,"score_spread":0.18954813565084444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977101828","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.9848618,0.000079848585,0.0029452094,0.000014491083,0.00030783258,0.00015269071,0.000029133862,0.0002626665,0.011346359],"genre_scores_gemma":[0.99493855,0.000018934805,0.0047731297,0.000007250458,0.00006244985,0.000008688793,0.000007003993,0.00003327914,0.00015073536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944586,0.000009478785,0.00018049749,0.00009785647,0.00009086678,0.00017547331],"domain_scores_gemma":[0.9995064,0.00011836598,0.000024411418,0.00025959144,0.000013387696,0.00007780595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016933883,0.00013714192,0.0001761075,0.000038907332,0.000053126325,0.00004442001,0.000106264684,0.00007505496,0.000039197916],"category_scores_gemma":[0.000055596265,0.0001147464,0.00003956867,0.000054129778,0.000059690283,0.000066694716,0.000023659037,0.00017139503,0.0000419868],"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.000014517356,0.00014246808,0.005503116,0.0032017655,0.00032124761,0.000027911276,0.01727318,0.00036002317,0.20992382,0.75023246,0.0024367743,0.010562713],"study_design_scores_gemma":[0.001393728,0.00007754362,0.002365809,0.00034070364,0.00013474368,0.00022067394,0.004606589,0.7530035,0.060073897,0.15761581,0.01866771,0.0014992862],"about_ca_topic_score_codex":0.0000031177872,"about_ca_topic_score_gemma":0.000022900354,"teacher_disagreement_score":0.75264347,"about_ca_system_score_codex":0.0000033047138,"about_ca_system_score_gemma":0.0000024509604,"threshold_uncertainty_score":0.4679222},"labels":[],"label_agreement":null},{"id":"W1977808884","doi":"10.1016/j.ejc.2010.05.001","title":"Cyclically<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>t</mml:mi></mml:math>-complementary uniform hypergraphs","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Hypergraph; Combinatorics; Permutation (music); Vertex (graph theory); Isomorphism (crystallography); Partition (number theory); Discrete mathematics; Graph","score_opus":0.01091408648858767,"score_gpt":0.21289985691249547,"score_spread":0.2019857704239078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977808884","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.9834588,0.00031041153,0.0005431181,0.0000997737,0.003973441,0.00004191636,0.000029756473,0.00012887723,0.011413879],"genre_scores_gemma":[0.9981876,0.00021878701,0.00051087077,0.000190242,0.0006235011,0.000006807707,0.000031148793,0.00017426073,0.000056778063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738926,0.00016220773,0.000974278,0.00025625151,0.0006699775,0.00054800435],"domain_scores_gemma":[0.99819934,0.00019744897,0.0004959588,0.0006258524,0.00010558802,0.00037577926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014947908,0.00034650843,0.00028714768,0.00019427431,0.00031866066,0.0002045324,0.0008638152,0.00015954401,0.000059524515],"category_scores_gemma":[0.00012160051,0.0003767429,0.0004978066,0.00035200428,0.00014535266,0.00043269762,0.00020301851,0.0011587788,0.00040767292],"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.000095894764,0.00014353468,0.00011998136,0.00014513807,0.00028791817,0.00067486375,0.0004297816,0.0006805625,0.00400864,0.9911827,0.0015500354,0.00068094773],"study_design_scores_gemma":[0.007952914,0.003350297,0.003784484,0.0013325695,0.001030044,0.005284262,0.0018015488,0.6982177,0.014909835,0.017955663,0.24192683,0.0024538876],"about_ca_topic_score_codex":0.000011733678,"about_ca_topic_score_gemma":0.0000118023645,"teacher_disagreement_score":0.973227,"about_ca_system_score_codex":0.000017429973,"about_ca_system_score_gemma":0.00007109181,"threshold_uncertainty_score":0.99986845},"labels":[],"label_agreement":null},{"id":"W1978202062","doi":"10.1016/s0012-365x(03)00039-6","title":"Resolvable group divisible designs with block size four and group size six","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"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; Combinatorics; Block (permutation group theory); Group (periodic table); Discrete mathematics; Arithmetic; Computer science","score_opus":0.014082470600140767,"score_gpt":0.1977526242482627,"score_spread":0.18367015364812195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978202062","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.91720104,0.000489881,0.025771733,0.000030818606,0.00023911799,0.00070942915,0.000021974158,0.00047553252,0.055060472],"genre_scores_gemma":[0.97763306,0.000030290272,0.021551622,0.000021236649,0.000032655364,0.00005061064,0.0000013843088,0.000085269385,0.00059387047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878454,0.000057133857,0.00031328644,0.00022296527,0.00022530221,0.00039675424],"domain_scores_gemma":[0.9987407,0.00046526457,0.000080995764,0.0005506788,0.000022464112,0.00013995125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044463493,0.00029308593,0.00035973426,0.00003663896,0.00021124618,0.00018087398,0.00019679568,0.000101635895,0.00006718544],"category_scores_gemma":[0.00017239628,0.00023222627,0.00006498496,0.00016584153,0.00008844273,0.00018227578,0.00003437976,0.00016188256,0.000025715533],"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.000072682415,0.00028959147,0.0061141737,0.004794577,0.00078924885,0.00016671342,0.00682769,0.002178257,0.02767869,0.94891,0.0018570771,0.00032132526],"study_design_scores_gemma":[0.016860617,0.0031938392,0.017377509,0.006134434,0.0019450804,0.002347449,0.026823064,0.089437395,0.038716692,0.75431997,0.0321323,0.010711662],"about_ca_topic_score_codex":0.0000057115376,"about_ca_topic_score_gemma":0.000022551416,"teacher_disagreement_score":0.19459002,"about_ca_system_score_codex":0.000020308324,"about_ca_system_score_gemma":0.0000057312836,"threshold_uncertainty_score":0.94699126},"labels":[],"label_agreement":null},{"id":"W1978705134","doi":"10.1016/j.disc.2003.11.034","title":"Mixed partitions of sets of triples into small planes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Pairwise comparison; Set (abstract data type); Line (geometry); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.02249479605233382,"score_gpt":0.21483600644783965,"score_spread":0.19234121039550583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978705134","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.98304534,0.00018379501,0.012004229,0.000012459164,0.00011296916,0.00012491658,0.000049039885,0.000076960285,0.004390291],"genre_scores_gemma":[0.9932831,0.00001355104,0.0066281194,0.0000015677224,0.000010497009,0.000012437631,0.000015849766,0.000016525764,0.000018375837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994187,0.000011855312,0.00032881254,0.000054027776,0.00008571196,0.00010088763],"domain_scores_gemma":[0.99961764,0.000055670338,0.00006733785,0.00020474986,0.000021734631,0.000032896838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114098555,0.000093705676,0.00022634902,0.000056959787,0.00002052057,0.000005617555,0.00010798283,0.00004749845,0.000017326147],"category_scores_gemma":[0.000025811474,0.000081266226,0.000076569784,0.00010735437,0.000052869884,0.00003176294,0.000011863043,0.000043151842,0.000011243745],"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.0000142820145,0.00022461299,0.0002490506,0.0073167356,0.0003255003,0.000008011035,0.025076868,0.046384107,0.060277943,0.8594439,0.00018815316,0.0004908266],"study_design_scores_gemma":[0.00096651254,0.00011439766,0.0003670295,0.0011097713,0.00013141528,0.00002371564,0.007257847,0.006146582,0.35420692,0.6289462,0.0003312073,0.00039841476],"about_ca_topic_score_codex":0.000009254665,"about_ca_topic_score_gemma":0.000030879775,"teacher_disagreement_score":0.29392898,"about_ca_system_score_codex":0.000008206357,"about_ca_system_score_gemma":0.0000068676827,"threshold_uncertainty_score":0.33139408},"labels":[],"label_agreement":null},{"id":"W1979070523","doi":"10.1007/s10114-010-8277-2","title":"Existence of 4-fold perfect (v, {5, 8}, 1)-Mendelsohn designs","year":2010,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"graph theory and CDMA systems","field":"Engineering","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":"Mount Saint Vincent University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Perfect power; Block (permutation group theory); Discrete mathematics; Computer science","score_opus":0.014890181987086954,"score_gpt":0.21363641312238088,"score_spread":0.19874623113529394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979070523","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.8913414,0.00008427411,0.00024505483,0.000036145586,0.0011605358,0.00028783086,0.000021765123,0.00061604776,0.106206976],"genre_scores_gemma":[0.9949649,0.000033505472,0.004464522,0.000010297298,0.0001508288,0.000052794057,0.000004013765,0.00005830758,0.00026084716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986135,0.00005453391,0.0005581671,0.00021389748,0.00023038653,0.00032950856],"domain_scores_gemma":[0.9984576,0.0004111611,0.00010550699,0.00078485,0.00012608596,0.000114760915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760067,0.00025611822,0.00047314147,0.00008985827,0.00007621795,0.000059239035,0.00046148986,0.00017347347,0.0003605697],"category_scores_gemma":[0.00053886813,0.00023548801,0.00015712522,0.00023403595,0.00022934798,0.00049662,0.000052825944,0.00033554644,0.00002662995],"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.00007394065,0.00028811247,0.00032762057,0.0023518158,0.000369274,0.000018078466,0.022611994,0.000044778983,0.39481324,0.5743465,0.003965788,0.00078889035],"study_design_scores_gemma":[0.0019690539,0.00090559514,0.0011530415,0.0012386756,0.00044035938,0.0003394751,0.016215077,0.0036545105,0.64612216,0.26177126,0.06321653,0.0029742513],"about_ca_topic_score_codex":0.00000175686,"about_ca_topic_score_gemma":0.000009199199,"teacher_disagreement_score":0.3125752,"about_ca_system_score_codex":0.000009820195,"about_ca_system_score_gemma":0.000023171557,"threshold_uncertainty_score":0.9602922},"labels":[],"label_agreement":null},{"id":"W1979736093","doi":"10.1007/s00493-008-2272-6","title":"Note edge-colourings of K n,n with no long two-coloured cycles","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Graph; Upper and lower bounds","score_opus":0.0062415386611180896,"score_gpt":0.1904457517298767,"score_spread":0.18420421306875862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979736093","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.975878,0.00038176554,0.0003614162,0.000011931329,0.0006572163,0.00017669583,0.0000025277245,0.0002788194,0.022251612],"genre_scores_gemma":[0.9993254,0.000029798046,0.00012319084,0.000008921073,0.000041637453,0.000024544723,0.0000020321165,0.000038272105,0.00040621776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991728,0.000031721607,0.00021805636,0.00014932132,0.00017668112,0.00025141196],"domain_scores_gemma":[0.9994114,0.00006135136,0.00005590231,0.0002999243,0.000082276485,0.000089117944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009797819,0.0001688981,0.00028354287,0.00008976326,0.00009293946,0.00000793333,0.00021702024,0.00007355133,0.000029141449],"category_scores_gemma":[0.0000161265,0.00015029176,0.00006837838,0.00029974975,0.000088694025,0.00009080749,0.000025087267,0.00015659213,0.000085084146],"study_design_candidate":"observational","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.001431033,0.0028765777,0.3636203,0.003793514,0.0021242513,0.0025319974,0.022536801,0.03422098,0.098826386,0.41058347,0.05037878,0.0070759035],"study_design_scores_gemma":[0.026195465,0.003993828,0.4002388,0.0016699828,0.0004991182,0.001605686,0.0005409375,0.014052084,0.4070969,0.038607337,0.099424735,0.0060751354],"about_ca_topic_score_codex":0.000013576797,"about_ca_topic_score_gemma":0.0000024823694,"teacher_disagreement_score":0.37197614,"about_ca_system_score_codex":0.000047190788,"about_ca_system_score_gemma":0.00001894699,"threshold_uncertainty_score":0.612872},"labels":[],"label_agreement":null},{"id":"W1979946760","doi":"10.1007/b97564","title":"Combinatorial Designs : Constructions and Analysis","year":2004,"lang":"en","type":"book","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":444,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorial design; Automorphism; Hadamard transform; Pairwise comparison; Mathematics; Hadamard matrix; Orthogonal array; Combinatorics; Complex Hadamard matrix; Discrete mathematics; Statistics","score_opus":0.007955915025722161,"score_gpt":0.18029905525098605,"score_spread":0.1723431402252639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979946760","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.00023229329,0.0004800844,0.0093507515,0.0000023769553,0.0013749336,0.00013023532,0.00003880253,0.00035144296,0.9880391],"genre_scores_gemma":[0.3464327,0.000118793694,0.00035525704,0.000014025847,0.0005294494,0.00003163421,0.00019320233,0.00009492813,0.65223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.000013731643,0.0001786228,0.00014044043,0.00008457902,0.00011721335],"domain_scores_gemma":[0.9996681,0.00003759166,0.000023807055,0.00018140631,0.000019696756,0.000069394126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000067632944,0.0001779688,0.00033896702,0.00027285508,0.000053295476,0.000034533572,0.00006591416,0.00024348889,0.00029251826],"category_scores_gemma":[0.0000022748598,0.00017626565,0.00014639004,0.00015416321,0.00007959928,0.000033732373,0.000010263969,0.00017529,0.00002250343],"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.0000016816746,0.000003543393,0.000035854053,0.000081380116,0.0017486402,0.0000058991423,0.00008537929,0.0018089502,0.000012191659,0.99369717,0.002307727,0.00021157679],"study_design_scores_gemma":[0.00092059706,0.000052940424,0.00009315288,0.00012059671,0.003959556,0.00006354889,0.00008993919,0.0011765113,0.00012938784,0.79710877,0.19523852,0.0010464848],"about_ca_topic_score_codex":0.0000052361283,"about_ca_topic_score_gemma":0.000013783831,"teacher_disagreement_score":0.3462004,"about_ca_system_score_codex":0.000119578464,"about_ca_system_score_gemma":0.00007946608,"threshold_uncertainty_score":0.7187905},"labels":[],"label_agreement":null},{"id":"W1980356269","doi":"10.1016/s0012-365x(02)00492-2","title":"On the non-existence of quasi-3 designs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; Okanagan College","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Combinatorics; Arithmetic; Linguistics","score_opus":0.023208766331806904,"score_gpt":0.22167077100832394,"score_spread":0.19846200467651703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980356269","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.6614491,0.000107496104,0.11793541,0.000023180952,0.00026612158,0.00039115304,0.00001178531,0.000117112875,0.21969865],"genre_scores_gemma":[0.998391,0.000005112286,0.0013545176,0.000013318138,0.0000075269686,0.000017373995,5.88401e-7,0.00002004578,0.0001905703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994342,0.000035256384,0.00020447401,0.000062901076,0.000130386,0.00013280049],"domain_scores_gemma":[0.999321,0.00024629373,0.000043135355,0.00034586695,0.00001562943,0.000028071536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003402096,0.00010659056,0.0001554308,0.000027761214,0.00004107453,0.000013266327,0.00016027594,0.000037583755,0.000074084055],"category_scores_gemma":[0.00008216852,0.0000673649,0.00007079776,0.00012486412,0.000046340254,0.000025998666,0.0000058300757,0.00007874443,0.00006638048],"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.0000012113397,0.000028102744,0.000016222759,0.00021423194,0.000028701083,0.0000011844764,0.0018735899,0.00063208013,0.0021514557,0.9947025,0.0003200192,0.00003067551],"study_design_scores_gemma":[0.00043165765,0.00025109103,0.000079401914,0.00077426207,0.00007940922,0.000030400899,0.008402061,0.056799028,0.11833359,0.8130053,0.0011959864,0.0006177557],"about_ca_topic_score_codex":5.698433e-7,"about_ca_topic_score_gemma":5.567336e-7,"teacher_disagreement_score":0.33694187,"about_ca_system_score_codex":0.000008042039,"about_ca_system_score_gemma":0.000004708639,"threshold_uncertainty_score":0.2747061},"labels":[],"label_agreement":null},{"id":"W1980734399","doi":"10.1002/jgt.20104","title":"Edge disjoint cycles through specified vertices","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Lemma (botany); Disjoint sets; Bipartite graph; Graph; Pairwise comparison; Discrete mathematics; Bound graph; Graph power; Line graph","score_opus":0.012285815764060338,"score_gpt":0.21785074350112285,"score_spread":0.2055649277370625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980734399","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.94468886,0.009323547,0.008571628,0.00014731583,0.0016485248,0.00008786992,0.000004804279,0.00011314584,0.03541431],"genre_scores_gemma":[0.99796987,0.0004735657,0.0005581149,0.000081345934,0.00075391354,0.0000018961427,4.7670844e-7,0.000031505155,0.00012929009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877596,0.00013877546,0.00054090173,0.00008557026,0.00021953473,0.00023926435],"domain_scores_gemma":[0.99932677,0.00015679478,0.00015192902,0.00020870703,0.000057031095,0.000098776705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451529,0.00017149,0.00030580556,0.00017187619,0.0000721164,0.00004406854,0.00029677578,0.000078371166,0.0002332731],"category_scores_gemma":[0.000030425615,0.00013392682,0.00029906924,0.00019585493,0.00009411735,0.000490938,0.000015809703,0.0002921512,0.000060599457],"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.0007034688,0.00027929613,0.0009868434,0.00022565298,0.0010126902,0.00012303251,0.008074114,0.013584997,0.032942086,0.89188623,0.012610021,0.03757159],"study_design_scores_gemma":[0.001961822,0.00029563843,0.007553256,0.0004870568,0.00023704128,0.0006582197,0.00398483,0.00035415048,0.05742137,0.79860884,0.12765199,0.000785798],"about_ca_topic_score_codex":6.329251e-7,"about_ca_topic_score_gemma":0.0000028587112,"teacher_disagreement_score":0.11504197,"about_ca_system_score_codex":0.00003362637,"about_ca_system_score_gemma":0.000010445997,"threshold_uncertainty_score":0.54613775},"labels":[],"label_agreement":null},{"id":"W1980792663","doi":"10.1023/b:desi.0000032607.03637.1c","title":"The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Latin square; Mathematics; Order (exchange); Set (abstract data type); Combinatorics; Projective test; Orthogonal array; Pure mathematics; Computer science; Statistics; Chemistry","score_opus":0.016162427861778395,"score_gpt":0.2094475287446339,"score_spread":0.1932851008828555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980792663","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.9688843,0.00096624915,0.028359361,0.000009419839,0.00007591967,0.00015601386,0.000039738778,0.00002677315,0.0014822433],"genre_scores_gemma":[0.99625736,0.00016570407,0.0035296658,0.000004779516,0.000010772132,0.000011494888,0.0000027258625,0.000014482143,0.0000029919388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991389,0.000036959045,0.00035812004,0.000112420494,0.00017761797,0.00017601287],"domain_scores_gemma":[0.9994226,0.00011895857,0.00010592236,0.00020014663,0.00010739344,0.000044989098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027535713,0.00013860737,0.00025582573,0.00014879854,0.00006828605,0.000012219927,0.00016304373,0.000066701214,0.000008882694],"category_scores_gemma":[0.000011547623,0.000102661565,0.00013445636,0.0005311186,0.00026013743,0.00005309404,0.000017586912,0.000079276666,4.6380657e-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.0004348578,0.00022870542,0.05929482,0.001680507,0.000860012,0.000017040627,0.005031729,0.020240223,0.18428595,0.71462667,0.00012574505,0.013173757],"study_design_scores_gemma":[0.006926983,0.0030041444,0.3975696,0.0021272155,0.00048230743,0.000113005415,0.011569607,0.008483556,0.2299787,0.33612555,0.0016291318,0.0019901986],"about_ca_topic_score_codex":0.000025125415,"about_ca_topic_score_gemma":0.000026527898,"teacher_disagreement_score":0.3785011,"about_ca_system_score_codex":0.0000025735483,"about_ca_system_score_gemma":0.000018048462,"threshold_uncertainty_score":0.41864172},"labels":[],"label_agreement":null},{"id":"W1980936231","doi":"10.1007/s004540010023","title":"Covering Squares with Squares","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Division of Mathematical Sciences; University of Alberta; National Science Foundation","keywords":"Mathematics; Combinatorics; Sequence (biology); Square (algebra); Least-squares function approximation; Geometry; Statistics; Chemistry","score_opus":0.003261643802897685,"score_gpt":0.18219877660642803,"score_spread":0.17893713280353035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980936231","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.9626145,0.00044146224,0.016205586,0.000022867363,0.0001310645,0.000116929805,0.000043034877,0.00035969092,0.02006489],"genre_scores_gemma":[0.9986862,0.000007879716,0.000719121,0.00005175362,0.00009372626,0.000017356846,0.00008620417,0.00003458473,0.00030320842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990942,0.000025623416,0.00019319436,0.00017865827,0.00027465378,0.00023366543],"domain_scores_gemma":[0.99963063,0.00009561069,0.000020451194,0.00013996435,0.000031395884,0.000081930884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008687424,0.00017271053,0.00016473973,0.00014516871,0.0001008004,0.0000694191,0.00013586308,0.000047769587,0.0009394346],"category_scores_gemma":[0.0000040992218,0.00015300629,0.00006324102,0.00043375025,0.000050170736,0.00018355764,0.000009243374,0.00011814442,0.00022578199],"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.000032155524,0.000011423161,0.002560718,0.000062903884,0.00007379562,0.000013238605,0.00021149947,0.98575896,0.000047798272,0.004935702,0.00034782322,0.005944006],"study_design_scores_gemma":[0.0036560446,0.0006354315,0.29254505,0.00069102773,0.00013021127,0.00035024717,0.0016338363,0.59664106,0.0012831662,0.035336986,0.06428164,0.0028153132],"about_ca_topic_score_codex":0.000011379944,"about_ca_topic_score_gemma":0.0000033691833,"teacher_disagreement_score":0.3891179,"about_ca_system_score_codex":0.000025032024,"about_ca_system_score_gemma":0.000011275404,"threshold_uncertainty_score":0.99997383},"labels":[],"label_agreement":null},{"id":"W1980966478","doi":"10.1016/j.disc.2007.07.115","title":"Colouring even cycle systems","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0071205228748530405,"score_gpt":0.2108613125004122,"score_spread":0.20374078962555917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980966478","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.8176757,0.0005719615,0.08535834,0.0000057779225,0.0008734461,0.00031361807,0.000010856143,0.0006457685,0.09454454],"genre_scores_gemma":[0.9985946,0.0000057808184,0.00082748797,0.000004799079,0.00011432865,0.000013360312,0.0000035618732,0.000044800032,0.00039132853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990898,0.0000131368815,0.00033393374,0.000094330484,0.00016665294,0.00030217168],"domain_scores_gemma":[0.9994819,0.00009247589,0.000043278014,0.00027539072,0.00001869068,0.000088253866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000579867,0.00014494717,0.00020714167,0.00007118327,0.00006139193,0.000048865044,0.00016146612,0.00007713696,0.000020509346],"category_scores_gemma":[0.000018584162,0.00013090474,0.0000673414,0.00014151406,0.000023337987,0.00007515656,0.000019916462,0.000104441264,0.00015682445],"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.000023216864,0.00015241293,0.0011171892,0.0061801677,0.0005374814,0.00017000719,0.01859354,0.06577,0.0249777,0.87780267,0.0029800518,0.0016955592],"study_design_scores_gemma":[0.0022114364,0.00020575884,0.002339216,0.0025113407,0.0002939703,0.000572647,0.036062673,0.7982462,0.034397844,0.08752327,0.032269657,0.0033660047],"about_ca_topic_score_codex":0.0000042376273,"about_ca_topic_score_gemma":0.0000041195385,"teacher_disagreement_score":0.7902794,"about_ca_system_score_codex":0.000034715795,"about_ca_system_score_gemma":0.0000031378165,"threshold_uncertainty_score":0.533814},"labels":[],"label_agreement":null},{"id":"W198168630","doi":"10.4169/math.mag.84.2.142","title":"Parity Party with Picture Proofs: An Odd Checkerboard Problem","year":2011,"lang":"en","type":"article","venue":"Mathematics Magazine","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":"Dalhousie University","funders":"","keywords":"Mathematics; Mathematical proof; Checkerboard; Parity (physics); Binary number; Graph; Combinatorics; Discrete mathematics; Arithmetic; Geometry; Quantum mechanics","score_opus":0.020594270810343044,"score_gpt":0.19256736674186586,"score_spread":0.17197309593152282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198168630","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.76894474,0.00018291954,0.022239516,0.000019996407,0.00022085784,0.0010957007,0.000021336287,0.0014882587,0.20578669],"genre_scores_gemma":[0.96571445,0.000004757192,0.033239413,0.000018922452,0.000067882116,0.000107771506,0.0000118737835,0.00007301784,0.00076190475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900365,0.000028155346,0.00029514742,0.00018554415,0.00017865177,0.00030884243],"domain_scores_gemma":[0.9992193,0.000014665616,0.00006309198,0.0005234239,0.000048716316,0.00013078272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002869764,0.00025348904,0.00030091705,0.000054603275,0.000055035223,0.000037587695,0.00022671708,0.00010567114,0.00023254196],"category_scores_gemma":[0.0000061329915,0.0001823955,0.000049295504,0.00017971949,0.000056208613,0.00018004309,0.000022501992,0.00019677743,0.00023609061],"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.0004361985,0.0058501707,0.013735004,0.025731115,0.0025956105,0.0005035457,0.17411731,0.003891211,0.039162233,0.70499265,0.01928037,0.009704558],"study_design_scores_gemma":[0.0063708844,0.0030399454,0.01586909,0.0026124853,0.0011720965,0.0010387495,0.0054236427,0.09360368,0.07584923,0.74776584,0.041091774,0.0061625554],"about_ca_topic_score_codex":0.0000015857643,"about_ca_topic_score_gemma":0.00003285942,"teacher_disagreement_score":0.20502478,"about_ca_system_score_codex":0.000017277276,"about_ca_system_score_gemma":0.000009554884,"threshold_uncertainty_score":0.7437872},"labels":[],"label_agreement":null},{"id":"W1982015000","doi":"10.1016/j.tcs.2009.02.015","title":"Matrix columns allocation problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"David and Lucile Packard Foundation","keywords":"Orthogonal frequency-division multiple access; Matrix (chemical analysis); Combinatorics; Mathematical proof; Transmission (telecommunications); Mathematics; Computer science; Element (criminal law); Mathematical optimization; Discrete mathematics; Orthogonal frequency-division multiplexing; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.004906022925432091,"score_gpt":0.21023301304130262,"score_spread":0.20532699011587052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982015000","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.24570903,0.00007562033,0.735456,0.00022475558,0.0006292261,0.00021499934,9.859846e-7,0.00057682814,0.017112555],"genre_scores_gemma":[0.9964883,0.00000292789,0.0033052547,0.00008727632,0.000092656424,0.0000037411692,6.559528e-7,0.0000055617143,0.000013637241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990743,0.000027812339,0.00015364065,0.00020781491,0.00024022828,0.000296216],"domain_scores_gemma":[0.99949723,0.00003088718,0.000012519095,0.00029236724,0.00004501938,0.000121983634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069023325,0.00009506024,0.000102838676,0.0000797349,0.00013508252,0.00011921166,0.00044503107,0.00003434364,0.000036586236],"category_scores_gemma":[0.0000100659545,0.000083991734,0.00003059812,0.00051941694,0.0005695245,0.00018533212,0.000028797931,0.0000937647,0.000104004685],"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.0000015530179,0.000012756118,0.0000098803675,0.0000079185065,0.0000014203016,0.0000012100456,0.00019891825,0.006986481,0.0057192086,0.9782055,0.00006345103,0.0087916795],"study_design_scores_gemma":[0.00012449156,0.00014268387,0.001003925,0.00003780714,0.000004182777,0.000026118474,0.000007790745,0.67437774,0.005283975,0.31842133,0.00037172798,0.00019820308],"about_ca_topic_score_codex":4.3653148e-7,"about_ca_topic_score_gemma":1.977908e-7,"teacher_disagreement_score":0.7507793,"about_ca_system_score_codex":0.000028091112,"about_ca_system_score_gemma":0.00001205809,"threshold_uncertainty_score":0.34250835},"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":"W1982890265","doi":"10.1016/j.jcta.2012.03.013","title":"On triple systems and strongly regular graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Strongly regular graph; Mathematics; Graph; Automorphism; Latin square; Discrete mathematics; Line graph; Pathwidth; Chemistry","score_opus":0.005895100764086992,"score_gpt":0.19247226673729487,"score_spread":0.18657716597320786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982890265","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.9663166,0.0053686835,0.00021754316,0.000012531216,0.023558516,0.00014425088,0.0000053444787,0.00006126746,0.004315272],"genre_scores_gemma":[0.99891883,0.00008678857,0.000016494194,0.0000054125358,0.0007649239,0.000004335585,5.573809e-7,0.000029744297,0.00017289614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987308,0.00026101706,0.00042921957,0.00006212172,0.0002464838,0.00027038492],"domain_scores_gemma":[0.9992192,0.00017602668,0.00016536812,0.0001767706,0.00007260075,0.00019006105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016094927,0.00017580415,0.0003728466,0.00015653702,0.00008412218,0.00006367816,0.00015650917,0.00010781198,0.000022892053],"category_scores_gemma":[0.00007884686,0.00014306924,0.000117144096,0.00014413882,0.00007523739,0.0005238812,0.000015246179,0.00025810694,0.000004803239],"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.0004823684,0.000044916203,0.00015772044,0.00006666772,0.0001424186,0.000007959904,0.0004565041,0.000306468,0.0010033251,0.9961356,0.0010223624,0.00017367964],"study_design_scores_gemma":[0.0029641883,0.0013223131,0.00043621263,0.0003200369,0.00012896757,0.0006210268,0.0030156316,0.00005630091,0.0041817683,0.9314494,0.055042017,0.00046213812],"about_ca_topic_score_codex":6.9968513e-7,"about_ca_topic_score_gemma":5.986929e-8,"teacher_disagreement_score":0.06468621,"about_ca_system_score_codex":0.000035730824,"about_ca_system_score_gemma":0.000011108243,"threshold_uncertainty_score":0.5834194},"labels":[],"label_agreement":null},{"id":"W1982895103","doi":"10.1016/s0012-365x(03)00031-1","title":"Bhaskar Rao designs with block size four","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Incidence matrix; Combinatorics; Block (permutation group theory); Block design; Row; Discrete mathematics; Product (mathematics); Computer science; Key (lock)","score_opus":0.016759671315099114,"score_gpt":0.1989495018509451,"score_spread":0.18218983053584598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982895103","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.7149882,0.00031416182,0.09715576,0.000025924055,0.0003414147,0.000652069,0.000016800743,0.00081740785,0.18568829],"genre_scores_gemma":[0.9864044,0.0000066808793,0.012457388,0.000015987038,0.000026726766,0.00003223475,0.0000010579681,0.00006250787,0.0009930027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991654,0.00003972399,0.00022693924,0.00012240435,0.00017004649,0.00027547425],"domain_scores_gemma":[0.99933016,0.00015762371,0.000040352592,0.00036168698,0.0000232031,0.00008699124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465938,0.0002016082,0.0002438768,0.00003555707,0.000065448556,0.000047005215,0.00013325058,0.000067597735,0.00009609228],"category_scores_gemma":[0.000060776056,0.00015347471,0.00006818078,0.00017500452,0.000036893834,0.000069350725,0.0000072557373,0.000114121016,0.000115386814],"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.000039424776,0.00025317777,0.0010186046,0.003669525,0.0010523468,0.00022785996,0.016589377,0.029148925,0.024548817,0.91812664,0.0049601607,0.0003651595],"study_design_scores_gemma":[0.009595023,0.0013383812,0.00074525777,0.0035898408,0.0014213726,0.0034353375,0.031129615,0.11429218,0.20344283,0.5413772,0.08099775,0.008635247],"about_ca_topic_score_codex":5.912242e-7,"about_ca_topic_score_gemma":0.0000023368027,"teacher_disagreement_score":0.37674946,"about_ca_system_score_codex":0.00001772391,"about_ca_system_score_gemma":0.000010169032,"threshold_uncertainty_score":0.6258517},"labels":[],"label_agreement":null},{"id":"W1984523325","doi":"10.1016/j.ejc.2007.08.003","title":"Vertex-transitive self-complementary uniform hypergraphs","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Transitive relation; Combinatorics; Vertex (graph theory); Hypergraph; Prime power; Modulo; Prime (order theory); Discrete mathematics; Graph","score_opus":0.008940873634418138,"score_gpt":0.1691587544205315,"score_spread":0.16021788078611335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984523325","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.9359756,0.0007845409,0.00100723,0.000027875045,0.0020753152,0.000064318694,0.0000039993047,0.00012803105,0.059933066],"genre_scores_gemma":[0.9992907,0.00036105592,0.00013145467,0.000036201152,0.00008766838,2.9216125e-7,0.0000015668783,0.00004667646,0.000044399632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987656,0.00021167353,0.0004741585,0.000071984905,0.00026460193,0.00021198396],"domain_scores_gemma":[0.9994186,0.000047068283,0.000108501874,0.00015429665,0.00012485472,0.00014663753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005718022,0.00016227101,0.00023936864,0.00017978155,0.0001038084,0.000013991479,0.00029911145,0.000019275472,0.00002129223],"category_scores_gemma":[0.000007641067,0.00015039381,0.00015135393,0.00029989792,0.000037168502,0.00015751086,0.000016063577,0.00031203486,0.000028296636],"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.0009896575,0.004406692,0.094626255,0.0017718355,0.009981345,0.05737878,0.088729315,0.019239761,0.031376876,0.5415034,0.13250838,0.017487673],"study_design_scores_gemma":[0.031804614,0.008191581,0.15028328,0.0014686701,0.001101066,0.029641075,0.008888093,0.008574928,0.025092416,0.06555356,0.66408,0.0053206827],"about_ca_topic_score_codex":5.9129894e-7,"about_ca_topic_score_gemma":1.6534682e-7,"teacher_disagreement_score":0.5315717,"about_ca_system_score_codex":0.000052244945,"about_ca_system_score_gemma":0.000018203107,"threshold_uncertainty_score":0.61328816},"labels":[],"label_agreement":null},{"id":"W1984765529","doi":"10.1016/j.dam.2006.09.009","title":"Super-simple <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> designs","year":2006,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Simple (philosophy); Mathematics; Algorithm; Combinatorics; Scroll; Discrete mathematics; Theology","score_opus":0.016832993092146,"score_gpt":0.22662424923359775,"score_spread":0.20979125614145175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984765529","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.9354645,0.003471886,0.008845685,0.00048502407,0.003892189,0.00075308525,0.0033902533,0.0020069578,0.04169041],"genre_scores_gemma":[0.972884,0.0015897742,0.009284448,0.0011089521,0.004151646,0.003853335,0.0036708368,0.00300185,0.00045515996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9746049,0.00095967593,0.006563251,0.0049165743,0.005939277,0.007016302],"domain_scores_gemma":[0.98267806,0.0038809478,0.004556866,0.005411463,0.0006036241,0.0028690365],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005436207,0.004015237,0.0022748513,0.0015285539,0.004034354,0.003944984,0.0058542904,0.0061284285,0.0064226827],"category_scores_gemma":[0.0016854537,0.0062143696,0.0047976472,0.0032584716,0.0030710374,0.002637496,0.0035308003,0.0049025477,0.0068458985],"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.0015992875,0.0012882847,0.000024183542,0.0057327314,0.0043765153,0.0012997626,0.0065628383,0.008264592,0.013301314,0.9017081,0.053190365,0.0026519964],"study_design_scores_gemma":[0.007463461,0.0030836638,0.000048012378,0.0047768364,0.006965344,0.0031465595,0.015963053,0.21056652,0.61593336,0.107561015,0.015553588,0.008938568],"about_ca_topic_score_codex":0.0022188802,"about_ca_topic_score_gemma":0.0013629931,"teacher_disagreement_score":0.79414713,"about_ca_system_score_codex":0.00019446792,"about_ca_system_score_gemma":0.001713697,"threshold_uncertainty_score":0.999642},"labels":[],"label_agreement":null},{"id":"W1984779023","doi":"10.1016/j.tcs.2010.09.018","title":"The three column Bandpass problem is solvable in linear time","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Band-pass filter; Column (typography); Mathematics; Stacking; Time complexity; Combinatorics; Algorithm; Physics; Geometry; Engineering; Electronic engineering","score_opus":0.0035244790066319394,"score_gpt":0.18918575694195033,"score_spread":0.1856612779353184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984779023","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.88112354,0.000053580854,0.08736142,0.00061096763,0.0020555337,0.00046943623,0.0000040355512,0.00036487548,0.027956579],"genre_scores_gemma":[0.99597347,0.0000017628299,0.0037536754,0.00007252213,0.00011871528,0.000014062067,2.477805e-7,0.000011885165,0.000053685162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987648,0.00003107768,0.0002070423,0.00023944741,0.00028045478,0.00047714898],"domain_scores_gemma":[0.99920523,0.00016331766,0.000016427744,0.0004454878,0.000048183396,0.0001213258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041325,0.000121830875,0.00013304251,0.000062266416,0.00029153362,0.00018587615,0.00090315257,0.00006142447,0.000115719246],"category_scores_gemma":[0.000021011712,0.000083426145,0.000038998107,0.0005692717,0.0017117305,0.00015687122,0.00013860209,0.00034803076,0.00027460657],"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.0000070002625,0.000016054893,0.0002003641,0.0000107469805,0.000003672137,0.0000036585488,0.00024764592,0.0007776081,0.0083307205,0.98564225,0.00040893714,0.004351359],"study_design_scores_gemma":[0.00013945777,0.000042168165,0.0006507049,0.000020638443,0.0000020885445,0.000013924518,0.000004123696,0.79561406,0.0040630745,0.19740124,0.0018953753,0.0001531368],"about_ca_topic_score_codex":0.0000034042268,"about_ca_topic_score_gemma":0.000016701728,"teacher_disagreement_score":0.79483646,"about_ca_system_score_codex":0.00001568288,"about_ca_system_score_gemma":0.00002700115,"threshold_uncertainty_score":0.63069427},"labels":[],"label_agreement":null},{"id":"W1985009561","doi":"10.1109/4234.864189","title":"Impact of the beat noise on the performance of 2-D optical CDMA systems","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Beat (acoustics); Computer science; Spread spectrum; Noise (video); Telecommunications; Noise measurement; Bit error rate; Speech recognition; Code division multiple access; Acoustics; Electronic engineering; Algorithm; Physics; Noise reduction; Engineering; Artificial intelligence","score_opus":0.015273241714799273,"score_gpt":0.22434181105422651,"score_spread":0.20906856933942725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985009561","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.99386054,0.00019659795,0.000028200224,0.00051245245,0.00012438917,0.0002049654,0.000016288503,0.000033685104,0.0050228736],"genre_scores_gemma":[0.9997241,0.00009082881,0.000020382815,0.000056703593,0.000018906614,0.000036297373,0.0000019698723,0.000013443919,0.00003738028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993398,0.0001457949,0.00024157917,0.000052589858,0.0001039863,0.00011624925],"domain_scores_gemma":[0.99775535,0.00023512015,0.000044166653,0.0019231803,0.000020793506,0.00002137268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022018905,0.00009300962,0.00012935905,0.000034657205,0.000118803764,0.000012320703,0.0010806068,0.000034565302,0.000025023912],"category_scores_gemma":[0.0000068394966,0.000053210886,0.00013266697,0.00021919061,0.0002234933,0.000049013877,0.000024005265,0.00019580041,0.000025430285],"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.0000419259,0.00018778422,0.014499134,0.00018352675,0.00041254927,2.4709044e-7,0.0021186068,0.6540667,0.30263653,0.016746415,0.00643403,0.0026725656],"study_design_scores_gemma":[0.0022801545,0.0006782127,0.26009688,0.0033152949,0.0004035456,0.00009035996,0.00087245647,0.59581435,0.115313984,0.0002745045,0.01918738,0.0016728591],"about_ca_topic_score_codex":0.00003981568,"about_ca_topic_score_gemma":0.000001753247,"teacher_disagreement_score":0.24559775,"about_ca_system_score_codex":0.000034475244,"about_ca_system_score_gemma":0.000007473148,"threshold_uncertainty_score":0.2169877},"labels":[],"label_agreement":null},{"id":"W1985015255","doi":"10.1016/s0024-3795(01)00596-1","title":"An inequality for non-negative matrices II","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Integer (computer science); Upper and lower bounds; Linear algebra; Matrix (chemical analysis); Function (biology); Algebra over a field; Pure mathematics; Geometry","score_opus":0.01623345754678761,"score_gpt":0.24569102377448537,"score_spread":0.22945756622769775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985015255","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.9331934,0.0011997499,0.059194658,0.00014470174,0.00009496917,0.0012957591,0.00021311075,0.0004060915,0.0042575565],"genre_scores_gemma":[0.997987,0.00010640744,0.0009217745,0.000037237853,0.00018236392,0.00052210153,0.000020359224,0.0000168589,0.00020594872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999529,0.000011061152,0.0001522928,0.00013980185,0.00004494493,0.00012291876],"domain_scores_gemma":[0.9996282,0.000065647415,0.000024338906,0.00017143994,0.00003637386,0.000074017655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008660014,0.00009140836,0.00010705304,0.000040748633,0.00020475037,0.000020039568,0.0000959057,0.000055695215,0.000045311488],"category_scores_gemma":[0.0000068698455,0.00008638954,0.000030478539,0.0001623562,0.000017228402,0.00012369834,0.000009943593,0.00005600973,0.00004058019],"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.00004167529,0.0007682901,0.0006439557,0.0013874449,0.00032768157,9.767697e-7,0.012854952,0.002499442,0.050468776,0.8718191,0.0069355145,0.05225224],"study_design_scores_gemma":[0.0011373243,0.0003443071,0.0012392476,0.00004031853,0.000099438956,0.000009335459,0.0008411317,0.79469454,0.027189322,0.0371363,0.13645978,0.0008089565],"about_ca_topic_score_codex":0.0000022708953,"about_ca_topic_score_gemma":0.000002703273,"teacher_disagreement_score":0.83468276,"about_ca_system_score_codex":0.0000052138826,"about_ca_system_score_gemma":0.0000015266671,"threshold_uncertainty_score":0.3522863},"labels":[],"label_agreement":null},{"id":"W1985708755","doi":"10.1016/s0012-365x(00)00324-1","title":"Pushing the cycles out of multipartite tournaments","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Tournament; Discrete mathematics","score_opus":0.01945680643809539,"score_gpt":0.24135492945844647,"score_spread":0.22189812302035108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985708755","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.96542156,0.00023579778,0.014053095,0.00004461451,0.0003426444,0.00017866913,0.0000084476815,0.00011762505,0.019597521],"genre_scores_gemma":[0.9989807,0.00003979045,0.0006943579,0.000010196194,0.000044251705,0.00001212263,0.0000017318944,0.000022917508,0.00019395928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933505,0.000022038841,0.00027863655,0.000058760965,0.00014569036,0.00015983856],"domain_scores_gemma":[0.99952817,0.00008283488,0.000061382,0.00027783323,0.000015612304,0.000034175548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024351804,0.00010550588,0.00016008821,0.000030340976,0.000053203898,0.00003079801,0.00019950545,0.00003569581,0.000038696242],"category_scores_gemma":[0.000029400499,0.00006892529,0.00007932531,0.000080344355,0.00003960238,0.0000762168,0.000023273336,0.00008389333,0.000045466895],"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.00008842123,0.00071663497,0.028680284,0.0059439745,0.0025577247,0.0001260688,0.26628464,0.093856744,0.1919751,0.37880543,0.008846562,0.022118406],"study_design_scores_gemma":[0.0026311052,0.00016999041,0.00602405,0.0028943378,0.00049599004,0.00018021312,0.044993415,0.62327963,0.07061873,0.20094162,0.04562183,0.002149057],"about_ca_topic_score_codex":0.000002258925,"about_ca_topic_score_gemma":0.000008503031,"teacher_disagreement_score":0.52942294,"about_ca_system_score_codex":0.000009613797,"about_ca_system_score_gemma":0.0000019746506,"threshold_uncertainty_score":0.2810692},"labels":[],"label_agreement":null},{"id":"W1985908622","doi":"10.1016/j.jcta.2009.02.007","title":"On decompositions of complete hypergraphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Hypergraph; Combinatorics; Partition (number theory); Mathematics; Discrete mathematics","score_opus":0.005404203268405634,"score_gpt":0.1992977980009139,"score_spread":0.19389359473250828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985908622","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.9762382,0.00049781793,0.00081026746,0.00008354318,0.006078096,0.00010114078,0.000013934896,0.000057268997,0.016119722],"genre_scores_gemma":[0.99955946,0.000037905775,0.00011265912,0.000031485422,0.00022197235,8.167768e-7,0.0000010102084,0.000012778019,0.000021914944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.00014065254,0.0004886564,0.00005368584,0.00020628289,0.00014309712],"domain_scores_gemma":[0.999265,0.00018770383,0.0001760233,0.00016785368,0.00012191043,0.00008151878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194558,0.00013328984,0.00035798852,0.00018257093,0.00006224976,0.000019673835,0.00022729891,0.00006659949,0.000058596244],"category_scores_gemma":[0.00004281688,0.00011499103,0.00021619837,0.00020288283,0.00006481307,0.00019459227,0.0000062580416,0.00020852123,0.0000042380484],"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.00056385784,0.0000917318,0.000010102819,0.000017312033,0.00008924308,0.000013859683,0.00022307198,0.0012460317,0.020488298,0.9762555,0.0005544894,0.00044650008],"study_design_scores_gemma":[0.000885479,0.001367618,0.0002562833,0.00013039295,0.000035967943,0.00011758907,0.00017447579,0.00002013272,0.0117079215,0.98168904,0.0034897006,0.00012537661],"about_ca_topic_score_codex":2.3627801e-7,"about_ca_topic_score_gemma":1.0197461e-7,"teacher_disagreement_score":0.023321249,"about_ca_system_score_codex":0.000022516115,"about_ca_system_score_gemma":0.000014099113,"threshold_uncertainty_score":0.4689198},"labels":[],"label_agreement":null},{"id":"W1986290062","doi":"10.1016/j.laa.2007.01.012","title":"Hadamard powers and totally positive matrices","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Hadamard transform; Mathematics; Hadamard matrix; Hadamard product; Hadamard's inequality; Complex Hadamard matrix; Hadamard's maximal determinant problem; Combinatorics; Matrix (chemical analysis); Pure mathematics; Mathematical analysis","score_opus":0.0038280930354010556,"score_gpt":0.20499506527779165,"score_spread":0.2011669722423906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986290062","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.9443323,0.0055432683,0.021260925,0.0001228818,0.00008502853,0.0004920583,0.000041895473,0.00027072695,0.027850885],"genre_scores_gemma":[0.99903303,0.0002263336,0.00034126933,0.00004990841,0.00009026861,0.000027453721,0.000011386965,0.000013965659,0.00020637806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956346,0.000006027558,0.00012630473,0.000119073964,0.000052666794,0.00013244605],"domain_scores_gemma":[0.99972135,0.000062634725,0.000016899958,0.00009047125,0.00002303469,0.00008563552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011554931,0.00008602194,0.00008483568,0.000056967772,0.00009550351,0.000024236893,0.00004966515,0.00005392337,0.000012810223],"category_scores_gemma":[0.000003390289,0.00008275176,0.000018723316,0.00014861565,0.000025917161,0.00007413637,0.000014562936,0.00006990194,0.000031279982],"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.00004014827,0.00006950072,0.00092586206,0.00026189955,0.00018868495,0.0000074397726,0.001963773,0.00016126357,0.032265835,0.93045896,0.00076975225,0.03288687],"study_design_scores_gemma":[0.003687929,0.00066528603,0.13269338,0.00034348216,0.0005375833,0.0005892619,0.007183663,0.0375959,0.10643013,0.058760747,0.64757437,0.003938285],"about_ca_topic_score_codex":0.000003124876,"about_ca_topic_score_gemma":0.000004250946,"teacher_disagreement_score":0.8716982,"about_ca_system_score_codex":0.0000056275708,"about_ca_system_score_gemma":0.0000028243273,"threshold_uncertainty_score":0.33745188},"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":"W1987220346","doi":"10.1016/j.disc.2007.05.009","title":"Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Centre International de Recherche sur le Cancer","keywords":"Mathematics; Hamiltonian path; Combinatorics; Graph; Discrete mathematics","score_opus":0.012819830166623363,"score_gpt":0.21155990504484762,"score_spread":0.19874007487822426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987220346","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.9719816,0.0004481836,0.012633603,0.000008403239,0.0008048734,0.00043429204,0.000095327225,0.000179255,0.013414491],"genre_scores_gemma":[0.99935734,0.000005177282,0.0003688552,0.000008043899,0.00005272587,0.000011911567,0.0000031069471,0.00004572335,0.00014708779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870896,0.000036880137,0.0005422492,0.000117158015,0.00027717574,0.000317563],"domain_scores_gemma":[0.99901557,0.00014258998,0.00013062559,0.00059965503,0.000032314267,0.00007923497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036572642,0.00020210142,0.00033523125,0.00008739113,0.00007073757,0.000032083826,0.00037751655,0.0000910603,0.000016833232],"category_scores_gemma":[0.000026540225,0.00013956666,0.00019601219,0.00031536387,0.00010191411,0.000056172365,0.000039287817,0.0001411864,0.000029232091],"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.000049830483,0.0003816077,0.008651711,0.013006152,0.0014159159,0.000058306563,0.042735144,0.020162785,0.2746918,0.6356101,0.0018163288,0.0014203156],"study_design_scores_gemma":[0.00846651,0.0006902269,0.14112887,0.012215484,0.0014464604,0.001314623,0.060224272,0.34218282,0.19540888,0.1883636,0.039701533,0.008856724],"about_ca_topic_score_codex":0.000019624415,"about_ca_topic_score_gemma":0.000029317418,"teacher_disagreement_score":0.44724652,"about_ca_system_score_codex":0.000025110414,"about_ca_system_score_gemma":0.0000055410524,"threshold_uncertainty_score":0.5691363},"labels":[],"label_agreement":null},{"id":"W1987260656","doi":"10.1016/s0012-365x(03)00285-1","title":"Existence of incomplete resolvable minimum coverings of pairs by triples","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Order (exchange); Discrete mathematics","score_opus":0.011479590207855652,"score_gpt":0.2011635292465455,"score_spread":0.18968393903868985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987260656","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.93047255,0.0007611948,0.014229045,0.0000040414952,0.00014781978,0.00023414525,0.000100276375,0.00009527967,0.053955633],"genre_scores_gemma":[0.99418396,0.000039766237,0.005426914,0.0000027198937,0.0000054556394,0.000011350579,0.000005309058,0.000028766119,0.0002957714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904555,0.00003392307,0.00047583604,0.00009425364,0.00017482106,0.00017560026],"domain_scores_gemma":[0.9993486,0.00012646393,0.00012508553,0.00032240516,0.000032034288,0.000045431814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031932045,0.00014079014,0.00035608723,0.000052130374,0.00002363077,0.000009112974,0.00017317866,0.000058775327,0.000050997507],"category_scores_gemma":[0.00007300745,0.00012793108,0.000097039636,0.00017501872,0.00008131444,0.00006374395,0.000015624937,0.000062828694,0.0000075388816],"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.00003158578,0.00021557302,0.0010724758,0.009811222,0.0004190016,0.000005426681,0.011714648,0.0020290292,0.25853732,0.7103853,0.0055848486,0.00019355494],"study_design_scores_gemma":[0.0019112551,0.00036313172,0.00010929873,0.0018747255,0.00021318806,0.000044424796,0.015238516,0.037484664,0.7896156,0.12873647,0.023149153,0.0012596077],"about_ca_topic_score_codex":0.0000061499873,"about_ca_topic_score_gemma":0.000001634769,"teacher_disagreement_score":0.5816488,"about_ca_system_score_codex":0.000010963399,"about_ca_system_score_gemma":0.000007095453,"threshold_uncertainty_score":0.5216878},"labels":[],"label_agreement":null},{"id":"W1988776662","doi":"10.1016/j.dam.2005.07.006","title":"Equivalence of some LP-based lower bounds for the Golomb ruler problem","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Université du Québec à Montréal","funders":"","keywords":"Golomb coding; Mathematics; Upper and lower bounds; Ruler; Combinatorics; Equivalence (formal languages); Linear programming; Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Image compression","score_opus":0.011016444497554815,"score_gpt":0.21941546201412174,"score_spread":0.20839901751656692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988776662","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.1992634,0.0016540708,0.7273836,0.0004259436,0.0006612017,0.004555572,0.00022451387,0.0009049495,0.06492674],"genre_scores_gemma":[0.9799164,0.000012848513,0.019320512,0.000054031614,0.000110385365,0.00036115397,0.0000080323125,0.000055414355,0.00016125607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990024,0.0000059742792,0.0003950228,0.00013091673,0.00018487529,0.00028079606],"domain_scores_gemma":[0.99910134,0.0002768411,0.00009488995,0.00045420555,0.00002742472,0.000045288256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037086406,0.0001924479,0.00026450327,0.000042813506,0.00007939244,0.00003163754,0.00032281413,0.00008244585,0.000037009784],"category_scores_gemma":[0.000010412402,0.00013343763,0.00013248227,0.000110862915,0.00010046501,0.000069510796,0.00002352431,0.000099885874,0.000037697588],"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.00002956583,0.00010284036,0.0000037081622,0.0021557207,0.00014486151,3.8705508e-7,0.0015242628,0.029284459,0.030476365,0.9323362,0.0013306772,0.0026109403],"study_design_scores_gemma":[0.0025836169,0.00016019038,0.00004314169,0.0005748423,0.000426585,0.000008359767,0.0019604329,0.5014894,0.11896795,0.3333018,0.039193545,0.0012901614],"about_ca_topic_score_codex":5.265037e-7,"about_ca_topic_score_gemma":0.0000013744285,"teacher_disagreement_score":0.78065294,"about_ca_system_score_codex":0.000022542928,"about_ca_system_score_gemma":0.0000132423265,"threshold_uncertainty_score":0.54414284},"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":"W1990001583","doi":"10.1109/iscc.2007.4381540","title":"A New Simple Method for Calculating the Bit Error Rate of OCDMA Systems","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications","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 British Columbia","funders":"","keywords":"Bit error rate; Computer science; Code division multiple access; Interference (communication); Algorithm; Simple (philosophy); Electronic engineering; Expression (computer science); Code (set theory); Decoding methods; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.02799154940597839,"score_gpt":0.28252572300992335,"score_spread":0.254534173603945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990001583","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.08490119,0.0046816007,0.8817402,0.010222167,0.0028331636,0.005150376,0.00016298772,0.0011096637,0.00919864],"genre_scores_gemma":[0.9599383,0.0015409001,0.037209716,0.0005815294,0.00022938426,0.0002645364,0.0000478579,0.000108866814,0.000078944635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970083,0.0002546042,0.0012572663,0.0005645354,0.00028708315,0.0006281641],"domain_scores_gemma":[0.9933236,0.0029440185,0.0005232172,0.0025022125,0.00037319376,0.000333724],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0022849918,0.00061343424,0.00076718396,0.00043520928,0.0014589169,0.00043610652,0.0028047375,0.0002469208,0.0000010706476],"category_scores_gemma":[0.000020946298,0.0005403327,0.00025987212,0.00072718185,0.0003949629,0.00029211421,0.0005052708,0.0006891591,0.0000042341294],"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.00062055007,0.0011692045,0.0014410022,0.0019193867,0.002162086,0.0000029272196,0.026261613,0.09931358,0.09372421,0.68601245,0.030704604,0.05666838],"study_design_scores_gemma":[0.0016405608,0.00061342475,0.00027603313,0.000913301,0.0002211422,0.00007550335,0.0016891102,0.96183896,0.0028909042,0.001824462,0.0271316,0.0008849732],"about_ca_topic_score_codex":0.00024231173,"about_ca_topic_score_gemma":0.000039003506,"teacher_disagreement_score":0.8750371,"about_ca_system_score_codex":0.000108369255,"about_ca_system_score_gemma":0.000053151318,"threshold_uncertainty_score":0.99984103},"labels":[],"label_agreement":null},{"id":"W1990906482","doi":"10.1016/j.laa.2005.10.001","title":"A remark on the faces of the cone of Euclidean distance matrices","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Subspace topology; Mathematics; Euclidean distance; Euclidean geometry; Cone (formal languages); Euclidean distance matrix; Characterization (materials science); Combinatorics; Pure mathematics; Mathematical analysis; Algorithm; Geometry; Physics; Optics","score_opus":0.006921840420104553,"score_gpt":0.19997549251396604,"score_spread":0.1930536520938615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990906482","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.9867157,0.0027058364,0.0013692514,0.00065938046,0.000034041575,0.0004669475,0.00006605848,0.000044337896,0.007938499],"genre_scores_gemma":[0.999477,0.00013948318,0.00004794431,0.000030869458,0.000046826255,0.000051989147,0.000001590856,0.000006914448,0.00019737019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999635,0.000018606157,0.00015538838,0.00006396012,0.00006717034,0.000059884496],"domain_scores_gemma":[0.9995846,0.00011469481,0.000050975297,0.00021257502,0.000021273978,0.000015894508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097499586,0.000056756395,0.000083492974,0.000016004866,0.00006693389,0.000005474667,0.00014528458,0.000024740111,0.000017625172],"category_scores_gemma":[0.000009239529,0.00003223575,0.000032560718,0.00017952455,0.000048616217,0.000026031426,0.000012665085,0.000057818976,0.000010312804],"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.000007283738,0.000037020676,0.00025147837,0.00012261231,0.00004004608,2.4133167e-8,0.00058712054,0.0009988466,0.010812309,0.98422587,0.00052504486,0.0023923172],"study_design_scores_gemma":[0.00077393616,0.00011907084,0.011440874,0.00040198152,0.00016499429,0.000010307735,0.0019767003,0.046175547,0.34810832,0.02991183,0.5603155,0.00060096657],"about_ca_topic_score_codex":0.0000018017777,"about_ca_topic_score_gemma":0.000006574866,"teacher_disagreement_score":0.95431405,"about_ca_system_score_codex":0.0000027829426,"about_ca_system_score_gemma":0.0000032022986,"threshold_uncertainty_score":0.13145357},"labels":[],"label_agreement":null},{"id":"W1990948848","doi":"10.1016/s0378-3758(00)00282-2","title":"Super-simple designs with v⩽32","year":2001,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Northern British Columbia","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.028599775855948518,"score_gpt":0.26505201145686647,"score_spread":0.23645223560091794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990948848","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.5165937,0.0003182369,0.4808358,0.000009860948,0.00006537976,0.000020104204,0.000007700698,0.00001978188,0.002129446],"genre_scores_gemma":[0.9972388,0.00004232524,0.0026236344,0.000017307288,0.000051607673,6.534035e-7,0.0000014612912,0.0000075381167,0.000016681543],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99946564,0.000024923533,0.00020527096,0.00004944645,0.000115594434,0.00013914116],"domain_scores_gemma":[0.999441,0.0003135729,0.000036049652,0.000045981476,0.0000453871,0.00011795996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016797303,0.00008188087,0.00016627823,0.00005439773,0.000043747772,0.0000422326,0.000058909485,0.000032304815,0.000053997075],"category_scores_gemma":[0.000070132504,0.000057481495,0.0000124771905,0.0000693451,0.00005054116,0.00012629428,0.0000048452953,0.0001836711,0.000003453343],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012231581,0.00021534954,0.6205082,0.0006620095,0.0006808244,0.00514536,0.007391085,0.05931099,0.011021324,0.20501664,0.018907601,0.06991747],"study_design_scores_gemma":[0.0077574733,0.008969873,0.5836774,0.0037772937,0.0005481343,0.0156100765,0.009254569,0.124120995,0.0025801265,0.17883784,0.061969068,0.002897118],"about_ca_topic_score_codex":0.0000028582579,"about_ca_topic_score_gemma":8.9751023e-7,"teacher_disagreement_score":0.4806451,"about_ca_system_score_codex":0.00000812336,"about_ca_system_score_gemma":0.0000135546825,"threshold_uncertainty_score":0.23440273},"labels":[],"label_agreement":null},{"id":"W1991057831","doi":"10.3336/gm.47.2.15","title":"On the size of equifacetted semi-regular polytopes","year":2012,"lang":"en","type":"preprint","venue":"Glasnik Matematicki","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; Colgate University; Javna Agencija za Raziskovalno Dejavnost RS; National Science Foundation","keywords":"Polytope; Regular polygon; Combinatorics; Flag (linear algebra); Mathematics; Face (sociological concept); Automorphism group; Group (periodic table); Automorphism; Convex polytope; Pure mathematics; Algebra over a field; Physics; Geometry; Convex analysis; Sociology; Convex optimization","score_opus":0.012089970052499682,"score_gpt":0.2015123630073441,"score_spread":0.18942239295484442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991057831","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.9679539,0.0018104594,0.0009917642,0.00017390643,0.002355387,0.0011704552,0.000114978335,0.00048911973,0.02493998],"genre_scores_gemma":[0.99884725,0.000027628561,0.00012047566,0.00006085219,0.0001437728,0.00016007094,0.000014093287,0.000083180574,0.00054266286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980729,0.00022415422,0.00070263766,0.00021643296,0.00038079536,0.00040305304],"domain_scores_gemma":[0.9977059,0.00065106346,0.00024062245,0.0012680296,0.000049395938,0.00008502029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009280911,0.00043523512,0.00073037326,0.00008683283,0.000059424037,0.00005925914,0.0006778161,0.0003348136,0.0006310222],"category_scores_gemma":[0.00014832492,0.0002942923,0.00026234155,0.00014053089,0.00009578202,0.000053411797,0.00023413381,0.0005117051,0.0003847269],"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.00013389136,0.0004460535,0.00043064792,0.065497495,0.0041203205,0.000029682558,0.0124957375,0.073035605,0.07454753,0.7155402,0.053005345,0.00071752694],"study_design_scores_gemma":[0.0020670171,0.00026524978,0.0033295597,0.029787147,0.00177742,0.0001281556,0.004148681,0.04023433,0.34766647,0.5572933,0.0077462713,0.0055563836],"about_ca_topic_score_codex":0.000013481272,"about_ca_topic_score_gemma":0.0000016162898,"teacher_disagreement_score":0.27311894,"about_ca_system_score_codex":0.000045359135,"about_ca_system_score_gemma":0.000016771295,"threshold_uncertainty_score":0.99995095},"labels":[],"label_agreement":null},{"id":"W1991560854","doi":"10.1016/j.dam.2007.10.027","title":"Existence of directed triplewhist tournaments with the three person property <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mi>T</mml:mi><mml:mi>W</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Tournament; Mathematics; Property (philosophy); Combinatorics; Discrete mathematics; Scroll; Theology; Philosophy","score_opus":0.017331763808788918,"score_gpt":0.22394668905066564,"score_spread":0.20661492524187672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991560854","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.59018165,0.0030238014,0.00569441,0.00079162506,0.0047974726,0.0003571523,0.0013412507,0.001091516,0.39272112],"genre_scores_gemma":[0.97545826,0.0017344995,0.008201073,0.0014927946,0.0034243222,0.0038746705,0.0023708197,0.0027793422,0.00066420645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97633743,0.0009832857,0.0054636914,0.0042807357,0.0066086124,0.0063262354],"domain_scores_gemma":[0.98100805,0.0036702661,0.005805449,0.006017478,0.0006074523,0.0028913044],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0062503,0.0029721728,0.0013945655,0.001504602,0.004387114,0.0033240106,0.006432643,0.0052698324,0.12204207],"category_scores_gemma":[0.0026144555,0.0047625736,0.004387929,0.0037595748,0.004394301,0.0027045757,0.0036204066,0.0048148492,0.0031192675],"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.0049682907,0.0012842824,0.000035724162,0.0066181254,0.0066214763,0.002489989,0.009942964,0.004869552,0.009426317,0.71317565,0.23727264,0.0032950162],"study_design_scores_gemma":[0.006210368,0.0035413825,0.00009084019,0.0053533986,0.0056579057,0.0033982275,0.012252675,0.026450215,0.9194727,0.006420701,0.0055659236,0.0055856933],"about_ca_topic_score_codex":0.002624412,"about_ca_topic_score_gemma":0.003148463,"teacher_disagreement_score":0.91004634,"about_ca_system_score_codex":0.00009922874,"about_ca_system_score_gemma":0.0024913314,"threshold_uncertainty_score":0.99894303},"labels":[],"label_agreement":null},{"id":"W1992795105","doi":"10.1016/j.disc.2004.10.016","title":"The set of values of b for which there exist block designs with b blocks","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Okanagan University College; University of Alberta","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.020589966131387954,"score_gpt":0.24154454317375756,"score_spread":0.22095457704236962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992795105","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.9462119,0.000893869,0.031137453,0.00009197681,0.00009513372,0.0008579616,0.00011279636,0.00012992513,0.020468984],"genre_scores_gemma":[0.99422693,0.000018107012,0.005331559,0.0000019654815,0.000046894478,0.000039466748,0.0000032736314,0.000033379205,0.00029845105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992833,0.000019897792,0.00031950892,0.00007145818,0.00014332586,0.00016246698],"domain_scores_gemma":[0.99916667,0.00028326112,0.00010497574,0.0003349159,0.000081408274,0.000028796327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003484966,0.0001299028,0.0002331615,0.000025634707,0.00006424825,0.000015633523,0.00020873282,0.00004877617,0.00000721744],"category_scores_gemma":[0.000031059335,0.00007617339,0.00007095677,0.00012204804,0.000070142545,0.0000360359,0.000012074015,0.000056041335,0.0000022246013],"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.00029745305,0.000307252,0.0008140542,0.010207141,0.002489777,0.000002849922,0.062651865,0.11812621,0.03915462,0.755812,0.0061972206,0.0039395806],"study_design_scores_gemma":[0.0030375707,0.001079676,0.00019585133,0.0024893167,0.0008145124,0.00008238499,0.0355443,0.34831107,0.40579408,0.18999769,0.011177712,0.0014758259],"about_ca_topic_score_codex":0.000001204179,"about_ca_topic_score_gemma":0.000021256199,"teacher_disagreement_score":0.5658143,"about_ca_system_score_codex":0.000008066217,"about_ca_system_score_gemma":0.00000967444,"threshold_uncertainty_score":0.3106261},"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":"W1993218841","doi":"10.1016/s0012-365x(00)00419-2","title":"Directed packing and covering designs with block size four","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"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","funders":"","keywords":"Mathematics; Combinatorics; Block size; Block (permutation group theory); Packing problems; Discrete mathematics; Computer science; Key (lock)","score_opus":0.01629517972808663,"score_gpt":0.200881071769452,"score_spread":0.18458589204136536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993218841","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.9678482,0.00015666256,0.017581202,0.000011396885,0.00006688572,0.00018645638,0.0000046592017,0.0005375402,0.013607001],"genre_scores_gemma":[0.99491453,0.000038081576,0.0047211815,0.000008484764,0.000036021123,0.000016025613,0.0000011389361,0.00004803231,0.00021649903],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993488,0.000017814553,0.00017550883,0.000112444046,0.00012325731,0.00022216824],"domain_scores_gemma":[0.9995128,0.00016293344,0.00003588074,0.00019868732,0.000017874732,0.00007180893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013302821,0.00016807394,0.00020980094,0.00003542701,0.000070727656,0.000065531596,0.00007954132,0.000049386395,0.000022427304],"category_scores_gemma":[0.000034774148,0.00013353581,0.000030917243,0.00016008083,0.00003220762,0.000088568406,0.000017330829,0.000089606045,0.000010791392],"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.0006016096,0.00075798633,0.088937424,0.022462185,0.0060669812,0.0029390515,0.13485987,0.117803335,0.33468646,0.2699874,0.0038430402,0.017054647],"study_design_scores_gemma":[0.0063037025,0.00072778837,0.01414614,0.0059522917,0.0009280381,0.0049187434,0.015873896,0.823311,0.031092713,0.07986085,0.011166371,0.005718472],"about_ca_topic_score_codex":0.0000023105633,"about_ca_topic_score_gemma":0.000007572345,"teacher_disagreement_score":0.70550764,"about_ca_system_score_codex":0.000014155072,"about_ca_system_score_gemma":0.0000035828211,"threshold_uncertainty_score":0.5445432},"labels":[],"label_agreement":null},{"id":"W1993293547","doi":"10.1007/s11075-014-9910-4","title":"Some new periodic Golay pairs","year":2014,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"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":"Binary Golay code; Mathematics; Hadamard transform; Ternary Golay code; Combinatorics; Statistics; Mathematical analysis; Hamming code","score_opus":0.007193687431960727,"score_gpt":0.19346671730521492,"score_spread":0.1862730298732542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993293547","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.14984201,0.0060119973,0.78619933,0.0010993531,0.010736305,0.00074944197,0.000026952373,0.005914544,0.039420087],"genre_scores_gemma":[0.9952722,0.000019905146,0.0023476614,0.00017388503,0.0012902495,0.000016153854,0.000006071376,0.000048119684,0.0008257495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990179,0.000054436714,0.00021118924,0.00019627428,0.00017879119,0.0003413846],"domain_scores_gemma":[0.9993904,0.000056979126,0.000020457155,0.00026898755,0.000011954213,0.00025122316],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015308849,0.0001838605,0.0002481778,0.000053295502,0.000067995126,0.000046732086,0.000199552,0.00009798856,0.00019716696],"category_scores_gemma":[0.000024410556,0.00016415889,0.00011534593,0.0002047748,0.000035881985,0.00013063202,0.000019947616,0.00019544073,0.00088002323],"study_design_candidate":"design_other","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.000030194427,0.00014600337,0.0020408642,0.00021821845,0.00025582014,0.000039805767,0.001983652,0.012786037,0.005265993,0.06129381,0.05119794,0.8647417],"study_design_scores_gemma":[0.0010049698,0.0002469178,0.0036666002,0.000054469558,0.00003808443,0.00006024084,0.00015838748,0.29480284,0.0022066804,0.022248276,0.6745493,0.00096322404],"about_ca_topic_score_codex":0.00003937122,"about_ca_topic_score_gemma":6.990631e-7,"teacher_disagreement_score":0.8637784,"about_ca_system_score_codex":0.00002786422,"about_ca_system_score_gemma":0.000011072138,"threshold_uncertainty_score":0.9998979},"labels":[],"label_agreement":null},{"id":"W1993405564","doi":"10.1023/b:desi.0000029211.79206.e1","title":"On the Action of the Groups GL(n+1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) on PG(n, qt)","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"York University","funders":"","keywords":"PSL; Combinatorics; Prime (order theory); Prime power; Group (periodic table); Mathematics; Physics","score_opus":0.019267064133812545,"score_gpt":0.20105479734727522,"score_spread":0.18178773321346267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993405564","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.99224323,0.0006556805,0.0036254115,0.00017868563,0.00030944397,0.00035156636,0.00002151951,0.000102053884,0.002512423],"genre_scores_gemma":[0.99931216,0.00031189263,0.00007071624,0.00017604206,0.000050727307,0.00004044708,0.0000022422566,0.000027058435,0.00000870643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990213,0.00010706695,0.00022244599,0.00020982351,0.00020651962,0.00023283403],"domain_scores_gemma":[0.999279,0.00019995989,0.00006435929,0.00036478185,0.000025489626,0.00006640163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000311351,0.00023330457,0.00021120216,0.00013912996,0.00026604906,0.000059542115,0.00018160431,0.00010549494,0.000015968688],"category_scores_gemma":[0.000015614258,0.00013703709,0.00015351964,0.00044312247,0.00021831077,0.00007513465,0.000021772645,0.00022656922,0.0000037695863],"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.0001289877,0.00010578358,0.0013532018,0.00016682848,0.00022351049,0.00000424111,0.00126551,0.003513124,0.0243675,0.96406424,0.0009798915,0.0038271556],"study_design_scores_gemma":[0.0041309036,0.0019468372,0.06544994,0.001548864,0.0003808947,0.00014945993,0.005163107,0.0018372857,0.17167544,0.7369631,0.008966797,0.0017873511],"about_ca_topic_score_codex":0.000025561114,"about_ca_topic_score_gemma":0.000028367844,"teacher_disagreement_score":0.22710115,"about_ca_system_score_codex":0.0000127905,"about_ca_system_score_gemma":0.000006763953,"threshold_uncertainty_score":0.558821},"labels":[],"label_agreement":null},{"id":"W1993609467","doi":"10.1016/s0097-3165(03)00053-0","title":"Decompositions of complete multigraphs derived from Hadamard matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Combinatorics; Mathematical analysis","score_opus":0.0073355197483380655,"score_gpt":0.19867845312648041,"score_spread":0.19134293337814234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993609467","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.98541296,0.0021714463,0.0023701435,0.000013583369,0.006632,0.00011118332,0.000043596516,0.0000476712,0.0031974395],"genre_scores_gemma":[0.99843574,0.00014482421,0.0011892042,0.000008491549,0.00017859993,0.0000030233543,0.0000027207736,0.000025469177,0.000011958952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843836,0.00037999055,0.0006838009,0.000081041806,0.00023422726,0.00018259336],"domain_scores_gemma":[0.9987755,0.0004149109,0.00031530843,0.00020192079,0.00018161972,0.00011077948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065695134,0.00018007371,0.0004901934,0.00017594188,0.00008977433,0.000037267306,0.00026275392,0.000097396536,0.000176254],"category_scores_gemma":[0.000091534224,0.0001624882,0.00026670177,0.0002460294,0.000116403775,0.000324782,0.00001332722,0.00022317615,0.000004630649],"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.0006216905,0.00013302437,0.00063876377,0.00007772437,0.0006363529,0.00003298113,0.0011913562,0.001199636,0.13951716,0.85536355,0.00038027397,0.00020747918],"study_design_scores_gemma":[0.0024502045,0.00040883487,0.0009830366,0.00022383648,0.00016914886,0.0001242792,0.0018176422,0.000043393753,0.09730841,0.8809769,0.01517243,0.00032189145],"about_ca_topic_score_codex":0.0000049887803,"about_ca_topic_score_gemma":0.0000017721563,"teacher_disagreement_score":0.04220874,"about_ca_system_score_codex":0.000026400026,"about_ca_system_score_gemma":0.000028784681,"threshold_uncertainty_score":0.6626076},"labels":[],"label_agreement":null},{"id":"W1993648632","doi":"10.1016/j.disc.2007.04.017","title":"The existence of (p,q)-extended Rosa sequences","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"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 Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Sequence (biology); Integer (computer science); Integer sequence; Discrete mathematics; Generating function; Computer science; Genetics","score_opus":0.011905023200997749,"score_gpt":0.23612706196625494,"score_spread":0.22422203876525718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993648632","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.82384884,0.0015058131,0.058942486,0.000037279548,0.00071315386,0.00036927746,0.000023064822,0.0003260983,0.11423396],"genre_scores_gemma":[0.9977894,0.00003281073,0.0018911083,0.000003985873,0.000029682515,0.0000058071955,0.0000013939548,0.00001512933,0.00023071599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992188,0.000014011424,0.00032905902,0.00006428922,0.00017006422,0.0002037303],"domain_scores_gemma":[0.99933094,0.00024495335,0.00006539179,0.00029144302,0.000027613229,0.00003964262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485245,0.000100933954,0.0001437736,0.000027176146,0.00007994914,0.000023180653,0.00024265634,0.00004246451,0.000009272748],"category_scores_gemma":[0.00004583283,0.000063935746,0.000070112765,0.00014550099,0.00012510929,0.000051505594,0.000016815671,0.00007557318,0.000017085695],"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.000009162037,0.000023528646,0.00010276368,0.00057198136,0.00009090757,0.000009781678,0.005020242,0.00032319498,0.011946802,0.9781643,0.00021810467,0.0035192126],"study_design_scores_gemma":[0.00055519445,0.00016417433,0.0016149457,0.0007425179,0.00011330998,0.0001325323,0.032395564,0.0368088,0.19234595,0.72480685,0.009369593,0.0009505848],"about_ca_topic_score_codex":0.0000017660552,"about_ca_topic_score_gemma":0.0000115822895,"teacher_disagreement_score":0.25335747,"about_ca_system_score_codex":0.000010626796,"about_ca_system_score_gemma":0.000004742965,"threshold_uncertainty_score":0.26072243},"labels":[],"label_agreement":null},{"id":"W1993665068","doi":"10.1364/bgpp.2003.wd4","title":"Experimental Demonstration of Frequency-Encoded Optical CDMA using Superimposed Fiber Bragg Gratings","year":2003,"lang":"en","type":"article","venue":"Bragg Gratings, Photosensitivity, and Poling in Glass Waveguides","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":"Université Laval","funders":"","keywords":"Fiber Bragg grating; Code division multiple access; Interference (communication); Optics; Wavelength-division multiplexing; Computer science; ENCODE; Multiplexing; Optical fiber; Wavelength; Materials science; Optoelectronics; Physics; Telecommunications","score_opus":0.015065265828809191,"score_gpt":0.23196333734758406,"score_spread":0.21689807151877488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993665068","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.9862605,0.00061484467,0.00052827346,0.000009045709,0.00034402224,0.0003721912,0.000031124157,0.00014656957,0.011693433],"genre_scores_gemma":[0.9949783,0.00002256166,0.0047349054,0.0000400768,0.00009733451,0.000015801885,0.0000130637345,0.00006527586,0.000032689106],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975341,0.00028985614,0.00085692626,0.00041786605,0.00034854052,0.00055272854],"domain_scores_gemma":[0.99898654,0.00032751483,0.00014817873,0.00026525892,0.000110396046,0.00016213789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009947004,0.00043446006,0.0006018174,0.00025419495,0.00020853883,0.000116263254,0.000103902,0.00026118872,0.000023989709],"category_scores_gemma":[0.00023353966,0.00045617917,0.00013864902,0.0003668241,0.0002686707,0.00038384032,0.000033350898,0.00031953794,0.0000027159444],"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.000017725415,0.000094955576,0.0037404355,0.00016571314,0.00003890491,0.000037823986,0.0020484126,0.0018285596,0.9786355,0.013167959,0.000020631558,0.0002033882],"study_design_scores_gemma":[0.00080682203,0.00011145349,0.0009976348,0.00042371335,0.000029417582,0.0003418137,0.0019109186,0.037683178,0.9553879,0.0017340828,0.000026646801,0.000546433],"about_ca_topic_score_codex":0.0005738396,"about_ca_topic_score_gemma":0.00021545956,"teacher_disagreement_score":0.035854615,"about_ca_system_score_codex":0.00010621225,"about_ca_system_score_gemma":0.00008578753,"threshold_uncertainty_score":0.999789},"labels":[],"label_agreement":null},{"id":"W1994061928","doi":"10.1145/1370256.1370261","title":"Integer least squares","year":2008,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Decoding methods; Integer (computer science); RADIUS; Mathematics; Matrix (chemical analysis); Algorithm; Least-squares function approximation; Mathematical optimization; Combinatorics; Computer science; Applied mathematics; Statistics","score_opus":0.008660548941696305,"score_gpt":0.14777982949737295,"score_spread":0.13911928055567666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994061928","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.6857233,0.00020300815,0.0056412057,0.000012338988,0.00035212663,0.000037341888,8.6436984e-7,0.0004885635,0.30754122],"genre_scores_gemma":[0.99726677,0.000008554884,0.00004256963,0.000020428446,0.000046340596,0.0000042923252,6.947301e-7,0.000008668967,0.002601675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976707,0.0000064041633,0.00006181934,0.00004154267,0.00003916282,0.00008398288],"domain_scores_gemma":[0.9998672,0.000008733492,0.000002694556,0.000087957036,0.0000062030595,0.000027185117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000027383434,0.000047641468,0.000052554904,0.000026759515,0.000027268066,0.0000039545057,0.00004848257,0.000023209279,0.00038244453],"category_scores_gemma":[0.0000022003667,0.000038959763,0.00002802503,0.000055776803,0.000016579716,0.000044062177,0.000004054935,0.000041848976,0.00046768048],"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.000038409435,0.00012778006,0.03564162,0.00033686895,0.00030683746,0.0002539714,0.008624341,0.027524712,0.041947193,0.532509,0.33922505,0.013464217],"study_design_scores_gemma":[0.0018092525,0.00020023843,0.040863957,0.00016194285,0.0000311996,0.0013021766,0.0041119754,0.049866676,0.11331694,0.012951661,0.77317846,0.0022055397],"about_ca_topic_score_codex":0.00000606573,"about_ca_topic_score_gemma":0.000003884258,"teacher_disagreement_score":0.51955736,"about_ca_system_score_codex":0.000004721631,"about_ca_system_score_gemma":0.0000014466265,"threshold_uncertainty_score":0.6011242},"labels":[],"label_agreement":null},{"id":"W1994066278","doi":"10.1006/jcta.2001.3231","title":"A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"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; School of Mathematics, Institute for Research in Fundamental Sciences","keywords":"Mathematics; Combinatorics; Hadamard transform; Diagonal; Graph; Hadamard matrix; Block (permutation group theory); Block matrix; Order (exchange); Discrete mathematics; Geometry; Physics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.006470355454004183,"score_gpt":0.20229150830952286,"score_spread":0.19582115285551868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994066278","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.98199767,0.007353765,0.00004870853,0.000095257215,0.008176881,0.0001385411,0.0000036552967,0.00009717677,0.0020883724],"genre_scores_gemma":[0.99812824,0.00045531796,0.00010591769,0.000009447173,0.0005985373,0.0000024372305,4.947348e-7,0.000045856315,0.0006537604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984358,0.00024678186,0.00058497424,0.00012425768,0.00030377964,0.0003043885],"domain_scores_gemma":[0.99902606,0.00015879188,0.00020936635,0.00026113048,0.00015356454,0.00019108513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008407883,0.00025382012,0.00048983283,0.00020551571,0.00012897394,0.00011916166,0.00027662303,0.00012277381,0.00012883828],"category_scores_gemma":[0.00009284044,0.0002254389,0.00017604209,0.00033102385,0.00012326498,0.00051555573,0.000035743324,0.00039824395,0.000010967766],"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.0007414572,0.00008836359,0.00029922143,0.00011144891,0.0004291832,0.0001315492,0.0011251953,0.0012080356,0.0072738566,0.9845903,0.0031430717,0.0008583418],"study_design_scores_gemma":[0.0043948954,0.001312894,0.00015171392,0.0002363377,0.00021030742,0.0014441554,0.0011802565,0.00035816446,0.0040763062,0.90196323,0.08407463,0.000597133],"about_ca_topic_score_codex":0.0000019713668,"about_ca_topic_score_gemma":9.3648663e-7,"teacher_disagreement_score":0.08262707,"about_ca_system_score_codex":0.000046666697,"about_ca_system_score_gemma":0.000012765214,"threshold_uncertainty_score":0.91931313},"labels":[],"label_agreement":null},{"id":"W1994563618","doi":"10.1016/j.disc.2014.12.023","title":"Threefold triple systems with nonsingular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Invertible matrix; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.017982152610338732,"score_gpt":0.22790358011279457,"score_spread":0.20992142750245585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994563618","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.52338517,0.002654178,0.005319571,0.00026673527,0.0040501477,0.00010991562,0.00054353895,0.00044114928,0.4632296],"genre_scores_gemma":[0.9892343,0.00048376727,0.003721602,0.0003837915,0.00212558,0.0010354706,0.0010433019,0.0012010287,0.00077112054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98991,0.0004704452,0.0024367073,0.0016272028,0.0029209936,0.0026346701],"domain_scores_gemma":[0.9917127,0.0012498664,0.0020850962,0.003307346,0.00023176926,0.0014132466],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029774571,0.001237774,0.00064450176,0.00055386976,0.0012252086,0.0018728641,0.0022187964,0.0022559636,0.09267651],"category_scores_gemma":[0.0012928299,0.0020489583,0.0017452476,0.0013498577,0.0012301692,0.0014198562,0.0012574083,0.001693148,0.0026418357],"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.0009372429,0.00033823622,0.00001715246,0.0049141976,0.0026012466,0.0015118036,0.0061511267,0.006997102,0.0015677266,0.82066685,0.15394995,0.00034735535],"study_design_scores_gemma":[0.0027736598,0.0016344597,0.000023210843,0.0043606213,0.0023719782,0.0022557576,0.0076507316,0.3577224,0.6141301,0.0004905913,0.0042327554,0.0023537627],"about_ca_topic_score_codex":0.00093392935,"about_ca_topic_score_gemma":0.0007914248,"teacher_disagreement_score":0.82017624,"about_ca_system_score_codex":0.000030797066,"about_ca_system_score_gemma":0.0010723383,"threshold_uncertainty_score":0.99916327},"labels":[],"label_agreement":null},{"id":"W1994635102","doi":"10.1145/345542.345596","title":"Black box Frobenius decompositions over small fields","year":2000,"lang":"en","type":"article","venue":"","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 Calgary","funders":"","keywords":"Computation; Mathematics; Matrix (chemical analysis); Computational complexity theory; Finite field; Invariant (physics); Algorithm; Time complexity; Computer science; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.005823442050223875,"score_gpt":0.1837122960985122,"score_spread":0.17788885404828833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994635102","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.6717691,0.000063355066,0.003777955,0.000024908551,0.00013154723,0.000053795116,0.0000037047216,0.00029737965,0.3238783],"genre_scores_gemma":[0.99291766,0.00001900833,0.00032886153,0.00011835768,0.00007611389,0.0000068313643,0.000005145975,0.000013315028,0.0065147015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999619,0.000012349197,0.000110637804,0.000077512545,0.000039374037,0.00014111117],"domain_scores_gemma":[0.99975634,0.000021516771,0.0000039829874,0.00016131438,0.000005250857,0.000051623825],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000035785466,0.00008067755,0.00008088396,0.000028005772,0.000035860237,0.000023720675,0.00007985131,0.00006685784,0.0088639315],"category_scores_gemma":[6.946166e-7,0.00007554922,0.00005897811,0.00007322725,0.000014141369,0.00004806745,0.0000041187227,0.00007831823,0.00083101215],"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.00010354709,0.00037871648,0.0036363835,0.00042239437,0.000753663,0.00011993507,0.0055683567,0.39237824,0.023703001,0.2592839,0.25714302,0.056508847],"study_design_scores_gemma":[0.0038388844,0.0003059769,0.025772842,0.0002918731,0.00019896466,0.00016919691,0.00076909293,0.2084251,0.064758785,0.06954406,0.62272704,0.0031981866],"about_ca_topic_score_codex":0.000027167924,"about_ca_topic_score_gemma":0.00006767775,"teacher_disagreement_score":0.365584,"about_ca_system_score_codex":0.000008243993,"about_ca_system_score_gemma":0.0000018898133,"threshold_uncertainty_score":0.99994695},"labels":[],"label_agreement":null},{"id":"W1994937623","doi":"10.1016/j.disc.2006.11.035","title":"Perfect dexagon triple systems","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.009309574290791578,"score_gpt":0.21490568765407242,"score_spread":0.20559611336328085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994937623","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.70807356,0.0012422311,0.1566191,0.000006090315,0.0018160148,0.00050954113,0.000016992757,0.0008577486,0.13085872],"genre_scores_gemma":[0.9983611,0.000010417597,0.0006219337,0.0000053754534,0.00013579732,0.000015666094,0.0000069884827,0.000050024548,0.0007927085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990219,0.00001969033,0.00035721425,0.00010737066,0.0001773289,0.00031649464],"domain_scores_gemma":[0.999414,0.00010576448,0.0000433713,0.00032076825,0.000021180076,0.00009490503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007450077,0.00017127545,0.0002441644,0.00009004209,0.00006191108,0.000055640718,0.00016112675,0.000089640256,0.000032610424],"category_scores_gemma":[0.00002770394,0.00014601511,0.000093775634,0.00018175822,0.000026062808,0.00007498674,0.000014704788,0.00011705286,0.00019040455],"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.000047186008,0.00021735375,0.0013905393,0.008370543,0.00064310606,0.00015490837,0.019921556,0.012570601,0.03786613,0.90497404,0.010090754,0.003753278],"study_design_scores_gemma":[0.0042303894,0.00052761997,0.0020300536,0.0027133857,0.0005742053,0.001016093,0.048324656,0.6970598,0.07371617,0.052942887,0.11167226,0.005192452],"about_ca_topic_score_codex":0.0000042177,"about_ca_topic_score_gemma":0.0000041491044,"teacher_disagreement_score":0.8520312,"about_ca_system_score_codex":0.000034419612,"about_ca_system_score_gemma":0.0000039843003,"threshold_uncertainty_score":0.59543234},"labels":[],"label_agreement":null},{"id":"W1994957129","doi":"10.1090/s0002-9939-2011-11149-3","title":"On the lengths of irreducible pairs of complex matrices","year":2011,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.02621858826301766,"score_gpt":0.21578026665806535,"score_spread":0.1895616783950477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994957129","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.9662692,0.000033680044,0.00011280069,0.000071982875,0.00002985436,0.00020906652,0.0000081266435,0.000049533683,0.03321575],"genre_scores_gemma":[0.99774396,0.000020348994,0.002121869,0.00003267084,0.000012789229,0.000015892427,1.01326954e-7,0.000019980818,0.000032387474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999071,0.000010545601,0.0003838444,0.00010271661,0.0002603568,0.00017152254],"domain_scores_gemma":[0.9991481,0.00020663525,0.00034228945,0.00018327519,0.00008548595,0.00003425325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005005502,0.00013394371,0.0003880846,0.000019641802,0.000047240836,0.0000058449305,0.00054701476,0.000032134354,0.00009929336],"category_scores_gemma":[0.00009897036,0.00007291006,0.0003453657,0.00044875857,0.00067609915,0.000047894282,0.000068228605,0.00013054702,0.0000055455466],"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.000049018156,0.0003887385,0.0016364646,0.0029561145,0.00051511155,5.4065325e-8,0.0201155,0.000043388438,0.118805714,0.84352523,0.011342076,0.0006226128],"study_design_scores_gemma":[0.00041231577,0.00050627795,0.009303732,0.00096798583,0.00027578525,0.000011896259,0.047048196,0.011620031,0.35183895,0.57728934,0.00021622384,0.0005092578],"about_ca_topic_score_codex":0.000013160122,"about_ca_topic_score_gemma":6.357265e-8,"teacher_disagreement_score":0.26623586,"about_ca_system_score_codex":0.000012636047,"about_ca_system_score_gemma":0.000005428075,"threshold_uncertainty_score":0.29731858},"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":"W1996469228","doi":"10.1016/j.ejc.2012.01.010","title":"Subdigraphs with orthogonal factorizations of digraphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Factorization; Integer (computer science); Arc (geometry); Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.006067909235337864,"score_gpt":0.15986234370706287,"score_spread":0.153794434471725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996469228","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.9633361,0.001424645,0.011663278,0.0000055239225,0.0013298696,0.000048793107,0.0000057339776,0.000041269202,0.022144772],"genre_scores_gemma":[0.99968314,0.00006989585,0.00007828338,0.0000041517583,0.000094665884,2.8868357e-7,0.0000014474049,0.000037746187,0.00003036096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989135,0.00016738799,0.00042392063,0.000041319552,0.0002607226,0.00019314662],"domain_scores_gemma":[0.99925727,0.000054099186,0.00021245658,0.00014608141,0.00016801356,0.00016210416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062262284,0.00012732131,0.00021629824,0.00021117518,0.00004114456,0.000014566927,0.00020612348,0.000019642086,0.000017962644],"category_scores_gemma":[0.000014870057,0.000099275094,0.000111602945,0.00047974783,0.000046422232,0.0002649798,0.000011012412,0.0002058674,0.0000064355822],"study_design_candidate":"observational","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.00008469566,0.00046854888,0.41800442,0.00023889152,0.0006052675,0.000092691625,0.0033869531,0.0025903243,0.004895647,0.56669784,0.0017028485,0.0012318895],"study_design_scores_gemma":[0.007030701,0.0029737533,0.84203565,0.0010389544,0.00065406435,0.0016603803,0.0025014565,0.0001775144,0.0253828,0.010938764,0.10374457,0.0018614114],"about_ca_topic_score_codex":1.2321405e-7,"about_ca_topic_score_gemma":1.2024981e-7,"teacher_disagreement_score":0.5557591,"about_ca_system_score_codex":0.000012848322,"about_ca_system_score_gemma":0.000012464455,"threshold_uncertainty_score":0.4048321},"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":"W1999323173","doi":"10.1016/j.disc.2004.04.005","title":"Spanning spiders and light-splitting switches","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Spanning tree; Mathematics; Combinatorics; Minimum degree spanning tree; Subdivision; Connected dominating set; Minimum spanning tree; Discrete mathematics; Bounded function; Graph","score_opus":0.007775992139421603,"score_gpt":0.19697964970249354,"score_spread":0.18920365756307195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999323173","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.9582048,0.00059938425,0.018560627,0.0000872775,0.00015217964,0.00014083313,0.0000022168806,0.0003553157,0.02189734],"genre_scores_gemma":[0.9948428,0.000013511899,0.0049759005,0.000015338897,0.000053450058,0.000009914393,0.0000014544989,0.000035642166,0.000051932573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993591,0.0000058425994,0.00022556652,0.00010635377,0.00009806649,0.00020507425],"domain_scores_gemma":[0.9996749,0.000035022465,0.000035136865,0.0001784468,0.0000098622395,0.00006663503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019637693,0.0001451729,0.00018426238,0.000050816074,0.00007459935,0.000058834652,0.00008351142,0.00005563679,0.0000062017716],"category_scores_gemma":[0.000029885725,0.0001271008,0.00004765662,0.000094250056,0.000026531117,0.00010106963,0.000022787055,0.00009805757,0.000030321366],"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.0000078642515,0.00006897494,0.0013354622,0.004619419,0.0003695084,0.000053886408,0.06510406,0.019879214,0.0825178,0.8228419,0.00028700038,0.0029149067],"study_design_scores_gemma":[0.0019827676,0.00012303419,0.0008612055,0.0028161828,0.00021040841,0.00028581952,0.03881797,0.023770781,0.09863103,0.8273877,0.0031990407,0.0019140588],"about_ca_topic_score_codex":0.0000026884575,"about_ca_topic_score_gemma":0.0000019009383,"teacher_disagreement_score":0.03663803,"about_ca_system_score_codex":0.000017660346,"about_ca_system_score_gemma":0.0000039085535,"threshold_uncertainty_score":0.518302},"labels":[],"label_agreement":null},{"id":"W1999517739","doi":"10.1090/s0002-9939-07-08703-5","title":"Proof of the Barker array conjecture","year":2007,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"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; Central Michigan University","keywords":"Conjecture; Mathematics; Computer science; Combinatorics","score_opus":0.006271600572417103,"score_gpt":0.21246153044958785,"score_spread":0.20618992987717075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999517739","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.9719712,0.0002652916,0.0023094863,0.0006820366,0.00028000932,0.0008852601,0.000021593807,0.00006240622,0.023522703],"genre_scores_gemma":[0.9970486,0.000012780602,0.0021416384,0.00014879604,0.00013718121,0.000014873458,1.7250439e-7,0.00006049225,0.0004354601],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975783,0.00002309582,0.00087887485,0.0002730378,0.00068649126,0.0005601577],"domain_scores_gemma":[0.99810743,0.00026564498,0.00091836,0.00037993168,0.00020903295,0.00011961285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016891309,0.00036931428,0.00082945137,0.000024894709,0.00017135889,0.000033469063,0.0011437936,0.00016276247,0.00007554485],"category_scores_gemma":[0.00031339342,0.00020470264,0.0011773652,0.001139604,0.0017367993,0.000091370865,0.00021275916,0.00061711116,0.0000070052406],"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.0001650181,0.0008602854,0.013315104,0.014479339,0.002278587,4.4110175e-7,0.048331276,0.00013333313,0.66468745,0.23997042,0.012935485,0.002843265],"study_design_scores_gemma":[0.000754745,0.0002652791,0.011940008,0.0026291087,0.0007539025,0.00006594995,0.027288048,0.002519103,0.7908882,0.15989682,0.0021523759,0.0008464856],"about_ca_topic_score_codex":0.000012766138,"about_ca_topic_score_gemma":5.7547e-7,"teacher_disagreement_score":0.12620074,"about_ca_system_score_codex":0.00008096399,"about_ca_system_score_gemma":0.00002873011,"threshold_uncertainty_score":0.83475316},"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":"W2000324685","doi":"10.1016/j.jspi.2005.12.009","title":"Three variable full orthogonal designs of order 56","year":2006,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Circulant matrix; Orthogonal array; Lemma (botany); Combinatorics; Order (exchange); Variable (mathematics); Discrete mathematics; Pure mathematics; Statistics; Mathematical analysis; Taguchi methods","score_opus":0.018935210861081683,"score_gpt":0.24360818867140965,"score_spread":0.22467297781032797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000324685","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.13871989,0.00051977165,0.85796505,0.000005354004,0.00013446648,0.000021683743,0.000028659024,0.000011722801,0.0025934249],"genre_scores_gemma":[0.9774989,0.000007290112,0.022384448,0.0000063727134,0.000081956794,5.6998283e-7,0.000002873454,0.0000068357367,0.000010746244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927807,0.000021063355,0.0003767574,0.000052502182,0.00013959632,0.00013199533],"domain_scores_gemma":[0.99930614,0.00038586784,0.000091324866,0.000049331717,0.00010428809,0.000063051084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027423384,0.000085184816,0.00021886404,0.00006548992,0.000032109354,0.000022941338,0.00006836327,0.000050243874,0.00006464406],"category_scores_gemma":[0.000099315075,0.000068545305,0.000022970913,0.000100224985,0.000060265815,0.00009400045,0.000008069585,0.00018207727,0.00000173528],"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.00023098124,0.00010397206,0.040670846,0.00045702697,0.00019054754,0.00015486992,0.00027891624,0.0801091,0.020017134,0.84543425,0.008379512,0.003972871],"study_design_scores_gemma":[0.0019944368,0.0015212011,0.15523252,0.0015364735,0.0002477734,0.0007024162,0.00032433256,0.11572246,0.0012014024,0.7175233,0.003236277,0.0007574595],"about_ca_topic_score_codex":0.000011736099,"about_ca_topic_score_gemma":0.000001837579,"teacher_disagreement_score":0.83877903,"about_ca_system_score_codex":0.000006835498,"about_ca_system_score_gemma":0.000033596738,"threshold_uncertainty_score":0.27951965},"labels":[],"label_agreement":null},{"id":"W2000536858","doi":"10.1016/s0012-365x(00)00270-3","title":"A derivation of an affine plane of order 4 from a triangle-free 3-colored K16","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Brock University","funders":"","keywords":"Mathematics; Colored; Affine transformation; Combinatorics; Plane (geometry); Affine plane (incidence geometry); Order (exchange); Set (abstract data type); Discrete mathematics; Pure mathematics; Geometry; Computer science","score_opus":0.011191066028033032,"score_gpt":0.2082213218269116,"score_spread":0.1970302557988786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000536858","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.98043424,0.000091450944,0.014804681,0.000014188557,0.000090338566,0.00020326609,0.000105378356,0.00009390915,0.004162564],"genre_scores_gemma":[0.9908622,0.000010906309,0.008897123,0.0000044644216,0.000042616346,0.000014654739,0.00007657463,0.000029119308,0.00006234473],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999164,0.00002798932,0.00043843358,0.000087699234,0.00015705166,0.00012483551],"domain_scores_gemma":[0.9992309,0.00010597991,0.00012145573,0.00045843594,0.00004259033,0.000040642266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017032414,0.00012623197,0.00034242164,0.000078197874,0.000016008624,0.000009403307,0.00022177513,0.0000778829,0.00017139968],"category_scores_gemma":[0.00009682224,0.000110393186,0.00006047346,0.00023822462,0.000033365115,0.00009266819,0.000020995049,0.000054286378,0.0000063064167],"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.00087781966,0.0016675561,0.0026107654,0.0057747043,0.0019213805,0.00008542375,0.06375568,0.024920296,0.6830375,0.20058441,0.002752544,0.012011912],"study_design_scores_gemma":[0.0083030695,0.0007796045,0.0034060648,0.0014220878,0.00048218181,0.00004861629,0.01094161,0.38483027,0.1876514,0.39919063,0.0015864245,0.0013580533],"about_ca_topic_score_codex":0.00002623773,"about_ca_topic_score_gemma":0.000037934973,"teacher_disagreement_score":0.49538612,"about_ca_system_score_codex":0.000009259153,"about_ca_system_score_gemma":0.000006549448,"threshold_uncertainty_score":0.45017034},"labels":[],"label_agreement":null},{"id":"W2000545126","doi":"10.1016/j.laa.2011.07.008","title":"Linear algebraic methods in communication complexity","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Rank (graph theory); Mathematics; Communication complexity; Context (archaeology); Matrix (chemical analysis); Algebraic number; Linear algebra; Algebra over a field; Function (biology); Theoretical computer science; Discrete mathematics; Computer science; Combinatorics; Pure mathematics","score_opus":0.05856417071582608,"score_gpt":0.30244909039383344,"score_spread":0.24388491967800735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000545126","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.62190276,0.011185531,0.2856983,0.0002776238,0.00023864198,0.0025152175,0.00008270229,0.0013945228,0.07670471],"genre_scores_gemma":[0.9607281,0.00031028612,0.038410563,0.000053280037,0.00004564897,0.00029619123,0.000036122536,0.000027073693,0.000092743016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992345,0.00010264287,0.0002819402,0.00016121878,0.00005327434,0.00016641505],"domain_scores_gemma":[0.99937516,0.000085280364,0.000035223693,0.00039406048,0.000032508888,0.000077788995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003355394,0.00012758771,0.0001698021,0.00010057078,0.00010544425,0.0000109785515,0.00021761886,0.000090814494,0.000102864105],"category_scores_gemma":[0.000012302583,0.00013007066,0.00003664348,0.0003331981,0.00006967816,0.00011423929,0.000044076034,0.0001925656,0.00009264313],"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.000012098762,0.00012227568,0.00067731336,0.00013125312,0.000046690184,5.89251e-7,0.0024596362,0.00009319857,0.0050726673,0.97964245,0.00012826185,0.011613545],"study_design_scores_gemma":[0.001864456,0.000150396,0.040417995,0.00017831367,0.00012787769,0.00005810776,0.0018881379,0.26086244,0.057321798,0.5180016,0.11741549,0.0017133708],"about_ca_topic_score_codex":0.00002414088,"about_ca_topic_score_gemma":0.00002890021,"teacher_disagreement_score":0.46164086,"about_ca_system_score_codex":0.000012158256,"about_ca_system_score_gemma":0.00000601872,"threshold_uncertainty_score":0.53041273},"labels":[],"label_agreement":null},{"id":"W2000678401","doi":"10.1016/j.disopt.2009.04.003","title":"On stars and Steiner stars","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Star (game theory); Combinatorics; Stars; Plane (geometry); Mathematics; Matching (statistics); Point (geometry); Line (geometry); Center (category theory); Physics; Mathematical analysis; Geometry; Astrophysics","score_opus":0.00380459814755335,"score_gpt":0.1846824485308133,"score_spread":0.18087785038325996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000678401","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.72559494,0.0005167913,0.22385523,0.000234185,0.00047754264,0.0004317184,0.000031683034,0.0006764092,0.04818152],"genre_scores_gemma":[0.99853015,0.000049297018,0.0011241785,0.00006620292,0.000022673725,0.0000037268178,0.00003507978,0.000014014209,0.0001546519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958783,0.000018852485,0.00010443738,0.00010031096,0.00007631211,0.0001122591],"domain_scores_gemma":[0.99980474,0.000012282107,0.000014735866,0.00011239244,0.000012059351,0.000043785785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062055944,0.00009355565,0.00008269633,0.00005851524,0.000041039482,0.000033909073,0.00003911112,0.00004386161,0.00004317407],"category_scores_gemma":[0.0000070771375,0.00008593677,0.000019480402,0.0000990917,0.000011396675,0.00012130932,0.000003111316,0.00005181114,0.0000071514446],"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.0000129553055,0.0000047431267,0.000027085467,0.000009332726,0.000008057647,0.0000013651714,0.00015857331,0.9848409,0.0004809269,0.012513533,0.00037961488,0.0015628632],"study_design_scores_gemma":[0.0005140448,0.00018839978,0.0014947478,0.00006205543,0.000017048375,0.000003489664,0.00013239255,0.9937773,0.00072239764,0.002136949,0.00065103645,0.00030015918],"about_ca_topic_score_codex":0.0000011484726,"about_ca_topic_score_gemma":7.792742e-7,"teacher_disagreement_score":0.27293524,"about_ca_system_score_codex":0.000012281886,"about_ca_system_score_gemma":0.0000017871057,"threshold_uncertainty_score":0.35044},"labels":[],"label_agreement":null},{"id":"W2001034532","doi":"10.1137/s0895480101384402","title":"Lower Bounds from Tile Covers for the Channel Assignment Problem","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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":"Dalhousie University","funders":"","keywords":"Cover (algebra); Mathematics; Reduction (mathematics); Clique; Channel (broadcasting); Constraint (computer-aided design); Tile; Upper and lower bounds; Combinatorics; Enumeration; Mathematical optimization; Assignment problem; Discrete mathematics; Computer science; Computer network","score_opus":0.01180277747908987,"score_gpt":0.21966324579152882,"score_spread":0.20786046831243896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001034532","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.3273225,0.0037251061,0.5896918,0.0037949076,0.0066570262,0.003434835,0.0005006079,0.00071045844,0.06416271],"genre_scores_gemma":[0.9959467,0.00008305152,0.002330504,0.00011775717,0.00061636156,0.000056989313,0.0000045603965,0.0000594254,0.0007846686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.000025303505,0.00039607505,0.000101125406,0.00029090198,0.00029560144],"domain_scores_gemma":[0.99918485,0.00029357386,0.00012332585,0.00026178596,0.000030484944,0.00010596463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048787583,0.00020317997,0.00022793606,0.00004835302,0.00022586453,0.00018056607,0.00028415755,0.00007312617,0.00016381768],"category_scores_gemma":[0.00002190579,0.00012659456,0.00020630701,0.00007073133,0.000035283778,0.00012943924,0.000016329765,0.0002620917,0.000089227164],"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.00033344602,0.00077696634,0.000024720051,0.0007762656,0.0028887747,0.000048004793,0.02108455,0.6997849,0.012591443,0.12541501,0.12466043,0.011615519],"study_design_scores_gemma":[0.0035239984,0.0008052998,0.00006552682,0.0015559507,0.0004693636,0.00021128583,0.0067712194,0.4596868,0.0119218975,0.25292587,0.2607005,0.0013622917],"about_ca_topic_score_codex":6.621501e-7,"about_ca_topic_score_gemma":0.0000027330943,"teacher_disagreement_score":0.66862416,"about_ca_system_score_codex":0.00009559267,"about_ca_system_score_gemma":0.000013152473,"threshold_uncertainty_score":0.5162377},"labels":[],"label_agreement":null},{"id":"W2001092675","doi":"10.1016/j.jcta.2007.04.005","title":"On generalized separating hash families","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Hash function; Double hashing; Mathematics; Hash chain; SHA-2; Collision resistance; Computer science; Theoretical computer science; Hash table; Computer security","score_opus":0.005995814983847147,"score_gpt":0.21914593369610458,"score_spread":0.21315011871225742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001092675","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.9629962,0.00044039305,0.0017064261,0.000014169914,0.012701852,0.00008566729,0.0000021680448,0.00008764507,0.0219655],"genre_scores_gemma":[0.9985705,0.00004429601,0.0001701215,0.00003468001,0.0009526511,0.000001437042,6.6350543e-7,0.000031534804,0.00019412451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861854,0.00014990369,0.00060792535,0.000074862204,0.00028626536,0.00026252438],"domain_scores_gemma":[0.9990602,0.00035227262,0.00018905026,0.00016763728,0.00011585102,0.00011496488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022966648,0.00018388774,0.0003639938,0.00018568702,0.00010723055,0.00005588772,0.00022962659,0.00010844076,0.00007346395],"category_scores_gemma":[0.00014487334,0.00015423565,0.00018259845,0.00020333896,0.00006885463,0.00027978816,0.000015400421,0.0003070331,0.000011769661],"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.0010819994,0.000037588878,0.000041826603,0.000030779356,0.00012967635,0.00006297645,0.0007791968,0.0016225973,0.008820896,0.9853133,0.0010356948,0.0010434544],"study_design_scores_gemma":[0.0020435487,0.0007682043,0.00011525515,0.00014796358,0.00004019351,0.00019497664,0.00162849,0.000044955585,0.042087212,0.92505497,0.027572079,0.00030215114],"about_ca_topic_score_codex":7.6863637e-7,"about_ca_topic_score_gemma":9.713945e-7,"teacher_disagreement_score":0.060258344,"about_ca_system_score_codex":0.0000554596,"about_ca_system_score_gemma":0.000019628415,"threshold_uncertainty_score":0.62895477},"labels":[],"label_agreement":null},{"id":"W2001357342","doi":"10.3934/amc.2011.5.69","title":"The enumeration of Costas arrays of order 28 and its consequences","year":2011,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"graph theory and CDMA systems","field":"Engineering","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":"Autodesk (Canada)","funders":"Science Foundation Ireland","keywords":"Enumeration; Mathematics; Golomb coding; Order (exchange); Combinatorics; Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03017044645058189,"score_gpt":0.2670171081107196,"score_spread":0.2368466616601377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001357342","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.7259956,0.11575495,0.030866379,0.00014709495,0.00023589839,0.00113218,0.000069063884,0.000083494764,0.12571533],"genre_scores_gemma":[0.9771792,0.008542936,0.014244487,8.678995e-7,0.0000010297092,0.00001755273,0.0000013780443,0.000004857295,0.000007673876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946564,0.000047495836,0.00034952833,0.000028797267,0.000058670816,0.000049875343],"domain_scores_gemma":[0.99886894,0.0004393251,0.00013890894,0.0004600585,0.00008359015,0.000009163596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029521296,0.0000483024,0.00013161449,0.000037969592,0.000039760755,0.000002345705,0.00032142142,0.000021781414,0.0000043011364],"category_scores_gemma":[0.000087564855,0.000037723905,0.000015889045,0.00014154769,0.00027734353,0.00012325101,0.000031149706,0.000054207372,5.651995e-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.0000033903332,0.00006396413,0.00020532937,0.00036043837,0.000025908606,3.386415e-8,0.009835535,0.00072950183,0.008677888,0.9787295,0.000002892218,0.0013656559],"study_design_scores_gemma":[0.00033803773,0.00008002758,0.0002622137,0.000710328,0.00004441683,0.000006382241,0.012346024,0.03926498,0.123501405,0.8221896,0.0010672343,0.00018934278],"about_ca_topic_score_codex":0.0000044820767,"about_ca_topic_score_gemma":0.000077875244,"teacher_disagreement_score":0.2511836,"about_ca_system_score_codex":0.000003355905,"about_ca_system_score_gemma":0.0000073198967,"threshold_uncertainty_score":0.15383361},"labels":[],"label_agreement":null},{"id":"W2001705063","doi":"10.1016/j.disc.2003.11.033","title":"Pancyclic BIBD block-intersection graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"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","funders":"","keywords":"Mathematics; Intersection (aeronautics); Combinatorics; Block (permutation group theory); Discrete mathematics","score_opus":0.007389320496746208,"score_gpt":0.2008945973059468,"score_spread":0.1935052768092006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001705063","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.9564722,0.00022668863,0.02000709,0.000031987554,0.0008715059,0.0001867066,0.0000101375535,0.0006872559,0.021506406],"genre_scores_gemma":[0.99858344,0.000019563513,0.0011854408,0.000009202541,0.000050433602,0.000025423393,0.000003929684,0.000040482235,0.00008207697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.000011212995,0.00024505888,0.000109134766,0.00012644797,0.00020769298],"domain_scores_gemma":[0.9995837,0.000032728105,0.000035120698,0.0002708408,0.00001543528,0.00006213579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011796851,0.00015766588,0.00017422701,0.00012172253,0.000066345994,0.000039963845,0.00012347952,0.00007043243,0.000027794016],"category_scores_gemma":[0.000020403479,0.00014011945,0.00011542674,0.0002519179,0.00003878999,0.000100438214,0.000013447167,0.0001119821,0.00017058788],"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.000010515212,0.00015901592,0.00032404467,0.0018215153,0.00030815875,0.000025758345,0.015567798,0.021311058,0.02791984,0.93103683,0.0007105667,0.0008049102],"study_design_scores_gemma":[0.0010908694,0.000144054,0.0005185255,0.0008852315,0.00014218704,0.00024034284,0.0052252794,0.011743996,0.035960812,0.94063765,0.0023336085,0.0010774696],"about_ca_topic_score_codex":0.0000049453297,"about_ca_topic_score_gemma":0.000009315934,"teacher_disagreement_score":0.042111225,"about_ca_system_score_codex":0.00003284753,"about_ca_system_score_gemma":0.0000039943607,"threshold_uncertainty_score":0.5713905},"labels":[],"label_agreement":null},{"id":"W2002795111","doi":"10.1016/s1571-0653(04)00257-4","title":"Perfectly Orderable P4 Composition","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Path (computing); Graph; Composition (language); Split graph; Discrete mathematics; Chordal graph; 1-planar graph; Computer science","score_opus":0.006189615629021227,"score_gpt":0.21348491819102486,"score_spread":0.20729530256200362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002795111","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.92554665,0.001079724,0.061470896,0.000049591705,0.00013288378,0.00023920657,0.00000237416,0.0002890908,0.011189566],"genre_scores_gemma":[0.9988831,0.00016182639,0.00070250704,0.000016111222,0.00005501063,0.000035989953,0.000010469804,0.0000417975,0.0000931757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989247,0.000035883946,0.0002838445,0.00013269001,0.00013049965,0.0004923878],"domain_scores_gemma":[0.99951845,0.00012965093,0.000032093936,0.00026662825,0.000013331194,0.000039848688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029023318,0.00017564329,0.00022897952,0.00009809502,0.000057654102,0.00003937878,0.00016407255,0.00007974406,0.00013272733],"category_scores_gemma":[0.000020837573,0.0001689078,0.00006340651,0.00029565734,0.000027364793,0.00011005997,0.000016029719,0.00025852057,0.00009218889],"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.00010141975,0.0006198447,0.004273926,0.002317753,0.00043375968,0.000117335396,0.011909509,0.13936916,0.12021318,0.70939475,0.0004895937,0.010759775],"study_design_scores_gemma":[0.001793399,0.00031445577,0.0004348064,0.0007125214,0.000081201826,0.00039387887,0.00066937646,0.50795364,0.045513514,0.43682835,0.0038988132,0.0014060263],"about_ca_topic_score_codex":0.000008876025,"about_ca_topic_score_gemma":0.000052222673,"teacher_disagreement_score":0.3685845,"about_ca_system_score_codex":0.00012521702,"about_ca_system_score_gemma":0.000014121572,"threshold_uncertainty_score":0.68878603},"labels":[],"label_agreement":null},{"id":"W2002893084","doi":"10.1016/j.jctb.2003.08.004","title":"Bounded degree acyclic decompositions of digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Digraph; Partition (number theory); Combinatorics; Directed acyclic graph; Mathematics; Degree (music); Bounded function; Integer (computer science); Vertex (graph theory); Decomposition; Directed graph; Discrete mathematics; Graph; Chemistry; Computer science; Physics","score_opus":0.009481242828341514,"score_gpt":0.20708025769932967,"score_spread":0.19759901487098816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002893084","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.9567669,0.0010931458,0.0015238399,0.000014605635,0.009941388,0.00011145362,0.000007001949,0.00005434499,0.03048733],"genre_scores_gemma":[0.9993917,0.000081227096,0.0002667129,0.000007000127,0.00016181185,0.000002774733,7.698187e-7,0.000025367928,0.00006266037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857855,0.0003020168,0.0006323055,0.00006577166,0.0002270693,0.00019426549],"domain_scores_gemma":[0.9990549,0.0002194033,0.00023915872,0.00021512645,0.0001608353,0.00011058097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009627664,0.00016196206,0.0004045725,0.00019600935,0.00009109095,0.000035709625,0.00024819028,0.00010087053,0.00011487321],"category_scores_gemma":[0.00012249965,0.00014496814,0.00026238483,0.0002933051,0.0001352999,0.00038406477,0.0000103818,0.0002409659,0.0000042926263],"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.00018744188,0.00007753454,0.00016755649,0.000047207555,0.00021079456,0.000013417875,0.00047173267,0.00017282438,0.010580648,0.9876216,0.00025304034,0.0001962227],"study_design_scores_gemma":[0.0010655066,0.00032438917,0.00022781367,0.00009056829,0.0000684183,0.0002455413,0.000658778,0.0000032645426,0.05521779,0.92996794,0.011964232,0.00016577718],"about_ca_topic_score_codex":5.594454e-7,"about_ca_topic_score_gemma":7.559202e-7,"teacher_disagreement_score":0.05765366,"about_ca_system_score_codex":0.000032803233,"about_ca_system_score_gemma":0.000039588787,"threshold_uncertainty_score":0.5911629},"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":"W2003743811","doi":"10.1007/s10623-011-9520-2","title":"Steiner triple systems satisfying the 4-vertex condition","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Aalto-Yliopisto; Academy of Finland","keywords":"Combinatorics; Vertex (graph theory); Affine transformation; Mathematics; Steiner system; Projective plane; Graph; Discrete mathematics; Block (permutation group theory); Triple system; Pure mathematics; Geometry","score_opus":0.029903246043006478,"score_gpt":0.19741332686179824,"score_spread":0.16751008081879176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003743811","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.8228806,0.012008775,0.12613904,0.000015139946,0.002042412,0.0010548737,0.00006867499,0.0008403771,0.034950063],"genre_scores_gemma":[0.99937946,0.00019115198,0.00019474301,0.000030522722,0.00004833944,0.00009379314,0.000007862589,0.000026091759,0.000028064953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991701,0.000105492414,0.00021984437,0.0001529542,0.00011668132,0.00023487613],"domain_scores_gemma":[0.9995679,0.00006476974,0.0000391648,0.00022755773,0.000027673563,0.00007291656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030480805,0.00017412956,0.000187568,0.0001330494,0.00020118401,0.00008240786,0.00013038867,0.00008013143,0.000052300587],"category_scores_gemma":[0.0000038284406,0.00012229654,0.000096075266,0.000296911,0.00010102433,0.00012757273,0.000011174295,0.00011581727,0.000014113376],"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.00008565958,0.00007746528,0.015361426,0.0005564372,0.0007637504,0.00003194661,0.0072696814,0.00063675607,0.023396637,0.93139523,0.010914976,0.0095100375],"study_design_scores_gemma":[0.012039724,0.0026843287,0.2283671,0.00263953,0.0020790366,0.0012282955,0.05959556,0.14066568,0.03995797,0.33512542,0.16645518,0.009162183],"about_ca_topic_score_codex":0.00006333268,"about_ca_topic_score_gemma":0.000010591649,"teacher_disagreement_score":0.5962698,"about_ca_system_score_codex":0.00000549914,"about_ca_system_score_gemma":0.0000033282981,"threshold_uncertainty_score":0.49871078},"labels":[],"label_agreement":null},{"id":"W2003770393","doi":"10.1016/s0097-3165(02)00018-3","title":"Some new triplewhist tournaments TWh(v)","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Tournament; Mathematics; Product (mathematics); Frame (networking); Combinatorics; Physics; Geometry; Engineering; Mechanical engineering","score_opus":0.006672644512148106,"score_gpt":0.19728052111862196,"score_spread":0.19060787660647385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003770393","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.83974135,0.013935945,0.0021732226,0.00016943685,0.10376852,0.0004161673,0.000009555973,0.00026202598,0.039523765],"genre_scores_gemma":[0.9965527,0.00025017012,0.00015091983,0.00003415548,0.001567354,0.0000018735713,4.564828e-7,0.00004265255,0.0013997413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984135,0.00027338663,0.0006360591,0.00008509312,0.00031444858,0.0002775361],"domain_scores_gemma":[0.9991106,0.000110230096,0.00022667767,0.0002128931,0.00009398899,0.00024563432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012669892,0.00020933076,0.00043004274,0.00015400254,0.00009320644,0.00008328411,0.0002921943,0.00011459696,0.0002530118],"category_scores_gemma":[0.00020070032,0.00018294522,0.0002322304,0.00020589781,0.00005495287,0.00068808487,0.000012638941,0.0003450915,0.000020596453],"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.0003296113,0.000046834968,0.000053136875,0.000026507612,0.00018675633,0.000048699996,0.00043815555,0.0002691068,0.0024046306,0.9898135,0.005824801,0.000558264],"study_design_scores_gemma":[0.0017917864,0.0003091559,0.000023492132,0.000064233434,0.0000420473,0.00027925204,0.000434081,0.00000281329,0.009086992,0.78278106,0.20499757,0.00018748095],"about_ca_topic_score_codex":8.3462095e-7,"about_ca_topic_score_gemma":2.424802e-7,"teacher_disagreement_score":0.2070324,"about_ca_system_score_codex":0.00009498559,"about_ca_system_score_gemma":0.00009039969,"threshold_uncertainty_score":0.74602896},"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":"W2003926749","doi":"10.1145/507457.507473","title":"The computational complexity of the local postage stamp problem","year":2002,"lang":"en","type":"article","venue":"ACM SIGACT News","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 Waterloo","funders":"","keywords":"Integer (computer science); Postage Stamps; Combinatorics; Mathematics; Time complexity; Discrete mathematics; Set (abstract data type); Computational complexity theory; Turing; Computer science; Algorithm","score_opus":0.027139177761183967,"score_gpt":0.2068266196016482,"score_spread":0.17968744184046423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003926749","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.9594456,0.0010171717,0.008429578,0.0017431608,0.0008200498,0.00072578323,0.00006653209,0.00025647107,0.02749566],"genre_scores_gemma":[0.9994438,0.000010059235,0.00019638526,0.00006240668,0.000033760673,0.000007821525,0.0000026910918,0.000013511441,0.00022954964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992947,0.0000796231,0.00021466507,0.0000785558,0.00017144794,0.00016103503],"domain_scores_gemma":[0.999262,0.00022804615,0.000046718138,0.00040251546,0.000027535641,0.0000331836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014525403,0.000095657386,0.0001086785,0.000015680402,0.00014878315,0.000024518606,0.00043813806,0.000037484577,0.00009129697],"category_scores_gemma":[0.00002598248,0.00005572674,0.000082637045,0.00014725883,0.00020591449,0.000052672585,0.00005653636,0.0001336379,0.00004355424],"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.00005965727,0.00021648496,0.0118559785,0.00040233083,0.00046191856,0.000009161888,0.0077728,0.40176812,0.0072329375,0.45147258,0.06429909,0.054448932],"study_design_scores_gemma":[0.002188666,0.00023314891,0.05183016,0.0002583469,0.00008072595,0.000082008606,0.003787007,0.28621313,0.009070192,0.45655403,0.1886542,0.0010483826],"about_ca_topic_score_codex":0.00003135787,"about_ca_topic_score_gemma":0.000060659255,"teacher_disagreement_score":0.124355115,"about_ca_system_score_codex":0.000019742018,"about_ca_system_score_gemma":0.00000540838,"threshold_uncertainty_score":0.22724706},"labels":[],"label_agreement":null},{"id":"W2004001692","doi":"10.1016/j.jda.2012.04.002","title":"Monomer-dimer tatami tilings of square regions","year":2012,"lang":"en","type":"preprint","venue":"Journal of Discrete Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Combinatorics; Dimer; Monomer; Square (algebra); Square tiling; Mathematics; Substitution tiling; Hexagonal tiling; Grid; Physics; Geometry; Polymer","score_opus":0.018253734975467534,"score_gpt":0.24423502890339974,"score_spread":0.2259812939279322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004001692","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.7199139,0.09462503,0.14361294,0.00040692318,0.024490895,0.0012956597,0.0009054731,0.00036743112,0.014381773],"genre_scores_gemma":[0.99463123,0.0007666799,0.003288915,0.000010334496,0.0010404985,0.000009723774,0.000022720667,0.00008646824,0.00014341265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977356,0.00010894804,0.0011743413,0.00016320021,0.00046478887,0.00035307248],"domain_scores_gemma":[0.99811983,0.000077544515,0.00080249313,0.0005077848,0.00025031762,0.0002420448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008077353,0.00037241567,0.00089413335,0.0003540295,0.000042225303,0.000039337436,0.00058483565,0.0004046512,0.00007699636],"category_scores_gemma":[0.00003000536,0.00031990118,0.0006910915,0.00017373862,0.00009218175,0.00023847232,0.00014440872,0.0012698866,0.000016061222],"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.0010728847,0.0020357931,0.01294231,0.030005816,0.040709857,0.0010642081,0.063030496,0.5369393,0.052232742,0.03010343,0.09761282,0.13225031],"study_design_scores_gemma":[0.017194794,0.0036321185,0.030606251,0.045992013,0.015439086,0.0064936318,0.030487146,0.18286347,0.1264043,0.18973863,0.33322772,0.01792082],"about_ca_topic_score_codex":0.000025150435,"about_ca_topic_score_gemma":0.0000018236333,"teacher_disagreement_score":0.35407585,"about_ca_system_score_codex":0.00007019291,"about_ca_system_score_gemma":0.00006273059,"threshold_uncertainty_score":0.9999253},"labels":[],"label_agreement":null},{"id":"W2004373556","doi":"10.1016/s0304-3975(02)00648-5","title":"Rank inequalities and separation algorithms for packing designs and sparse triple systems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Division of Mathematical Sciences; University of Toronto","keywords":"Polytope; Mathematics; Combinatorics; Algorithm; Rank (graph theory); Discrete mathematics","score_opus":0.034358244664242595,"score_gpt":0.26517106086767717,"score_spread":0.23081281620343458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004373556","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.19870429,0.00032038998,0.79935324,0.000008958721,0.0005677652,0.0002558838,0.00000372489,0.00008890959,0.000696815],"genre_scores_gemma":[0.99341553,0.000010072108,0.0064520054,0.000017654382,0.0000626437,0.00002338926,7.2224054e-7,0.000009135974,0.000008826553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999113,0.000094791765,0.0001788895,0.0002128606,0.0001411624,0.00025925745],"domain_scores_gemma":[0.9994667,0.00022171617,0.00001909824,0.00013752014,0.00004539341,0.00010957019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015302037,0.00011300966,0.00016284152,0.00007918284,0.00020782964,0.0002223567,0.000109427725,0.000039908202,0.0000035098092],"category_scores_gemma":[0.000045334185,0.000095660216,0.00001887779,0.00018755674,0.0006680917,0.00020479326,0.000022123715,0.00005537345,0.0000017211376],"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.000005074545,0.000004041828,0.000036555615,0.00006347612,0.0000044459266,7.373146e-7,0.00065654237,0.0010189479,0.0009490505,0.9959105,0.000014816485,0.0013358098],"study_design_scores_gemma":[0.0004098377,0.0001238264,0.00007324787,0.000059799757,0.00001044257,0.000054962267,0.0001844431,0.8800475,0.0039923,0.11452641,0.00030431617,0.00021290443],"about_ca_topic_score_codex":0.0000010737084,"about_ca_topic_score_gemma":1.9464251e-7,"teacher_disagreement_score":0.8813841,"about_ca_system_score_codex":0.0000140140455,"about_ca_system_score_gemma":0.0000114913955,"threshold_uncertainty_score":0.39009106},"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":"W2005094977","doi":"10.1007/s10623-010-9483-8","title":"Hamilton cycles in restricted block-intersection graphs","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Intersection (aeronautics); Mathematics; Block (permutation group theory); Hamiltonian path; Discrete mathematics; Graph; Geography","score_opus":0.02530779575660416,"score_gpt":0.19915862997280187,"score_spread":0.1738508342161977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005094977","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.98751664,0.00078728516,0.0033070524,0.000001519082,0.00024166756,0.00017068828,0.000006264302,0.00028170715,0.007687166],"genre_scores_gemma":[0.9990368,0.00038442158,0.00047538226,0.000013689506,0.00001745467,0.00004063553,0.000004101135,0.00002346999,0.0000040604773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991806,0.00006923004,0.00022891916,0.00018983966,0.00008197353,0.00024943711],"domain_scores_gemma":[0.99968,0.000030960844,0.00002740411,0.00016614654,0.000018044348,0.000077460485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013339226,0.00017698287,0.00018488648,0.00056318677,0.00006479866,0.000029640234,0.0000967931,0.000109190645,0.000019815061],"category_scores_gemma":[0.000002939105,0.00017123015,0.00009561585,0.0007063144,0.00007452545,0.00011409764,0.0000079561005,0.00014251287,0.0000042473816],"study_design_candidate":"observational","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.00073885906,0.0006679741,0.36683407,0.00078898337,0.0009006368,0.0002594488,0.03187148,0.0014102533,0.17504793,0.39621678,0.0024047245,0.022858843],"study_design_scores_gemma":[0.003372106,0.0009646189,0.7374261,0.00065455964,0.00018190613,0.00019166917,0.007498016,0.009064585,0.039199945,0.19498986,0.004112642,0.0023439995],"about_ca_topic_score_codex":0.000117529315,"about_ca_topic_score_gemma":0.000116510564,"teacher_disagreement_score":0.37059203,"about_ca_system_score_codex":0.000007756344,"about_ca_system_score_gemma":0.0000025347827,"threshold_uncertainty_score":0.69825625},"labels":[],"label_agreement":null},{"id":"W2005133195","doi":"10.1016/j.ejc.2004.07.010","title":"Poset edge-labellings and left modularity","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"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 New Brunswick; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Partially ordered set; Combinatorics; Bounded function; Lattice (music); Discrete mathematics; Modular design; Computer science; Physics; Mathematical analysis","score_opus":0.0058107588642839,"score_gpt":0.1672636208497889,"score_spread":0.16145286198550501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005133195","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.9826433,0.0019853048,0.007872078,0.00006390585,0.0013495318,0.000036716916,0.0000016608576,0.00005261009,0.005994897],"genre_scores_gemma":[0.9993857,0.00025496806,0.00016370705,0.000022966413,0.000092826056,4.3904087e-8,4.4050802e-7,0.000032072247,0.0000472595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992109,0.00010462371,0.00032346384,0.00006272303,0.00015545647,0.00014282201],"domain_scores_gemma":[0.99955106,0.00001998648,0.0000912948,0.00011964698,0.0000849328,0.00013306178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078489946,0.00011562816,0.00017834063,0.00009321948,0.000057694186,0.000046915127,0.00018261417,0.000023289205,0.000004694297],"category_scores_gemma":[0.00002239282,0.00010713451,0.00006077935,0.00010633846,0.000033026074,0.00014983006,0.00002114986,0.00030121583,0.000019924064],"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.00016680289,0.0008332568,0.016022608,0.001040144,0.0009482267,0.0042660628,0.012576315,0.062087294,0.033620324,0.85025954,0.008834006,0.009345442],"study_design_scores_gemma":[0.018478155,0.003302147,0.063783765,0.0016313802,0.0003981572,0.0077743237,0.0011974765,0.0019373347,0.026499104,0.6536558,0.21872117,0.0026211832],"about_ca_topic_score_codex":3.1602087e-7,"about_ca_topic_score_gemma":1.0791e-7,"teacher_disagreement_score":0.20988716,"about_ca_system_score_codex":0.000032125812,"about_ca_system_score_gemma":0.000009904298,"threshold_uncertainty_score":0.43688184},"labels":[],"label_agreement":null},{"id":"W2005295899","doi":"10.1006/jcta.2000.3060","title":"Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Affine transformation; Mathematics; Hadamard transform; Combinatorics; Upper and lower bounds; Prime power; Order (exchange); Combinatorial design; Hadamard matrix; Discrete mathematics; Prime (order theory); Pure mathematics; Mathematical analysis","score_opus":0.007386910017196912,"score_gpt":0.20423052351866688,"score_spread":0.19684361350146998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005295899","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.98061293,0.0013424366,0.000020841344,0.00007136784,0.0012629726,0.00008103041,0.000003824983,0.000017958087,0.01658664],"genre_scores_gemma":[0.99868536,0.00075804285,0.000038403847,0.000017360177,0.00024142042,0.0000020144619,1.5515914e-7,0.00001745435,0.00023978083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990349,0.00020560909,0.0003619239,0.00006382313,0.00019912046,0.00013465977],"domain_scores_gemma":[0.9990448,0.00057067984,0.0001278984,0.00012830747,0.00006194207,0.000066418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011041221,0.00013781319,0.00030183577,0.000092478964,0.00009054788,0.000068849244,0.00015717237,0.00007405497,0.00028409838],"category_scores_gemma":[0.00007562404,0.00009047349,0.00007510241,0.00024924384,0.0001356547,0.0002232497,0.000013029266,0.00019879019,0.0000035500625],"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.00084398786,0.00004030111,0.00042860614,0.000067980975,0.00016594624,0.000012329114,0.00059242395,0.00007053724,0.00055331085,0.9925194,0.00065075094,0.004054448],"study_design_scores_gemma":[0.0015864761,0.0007675885,0.0015054987,0.00022627188,0.000119565375,0.000513577,0.0011518935,0.000047062775,0.0052440446,0.9518729,0.036691,0.0002741148],"about_ca_topic_score_codex":0.0000019496936,"about_ca_topic_score_gemma":2.2361225e-7,"teacher_disagreement_score":0.04064647,"about_ca_system_score_codex":0.00001412858,"about_ca_system_score_gemma":0.000013093196,"threshold_uncertainty_score":0.3689402},"labels":[],"label_agreement":null},{"id":"W2005448597","doi":"10.1016/j.disc.2005.02.023","title":"On a new class of productive regular Hadamard matrices","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Prime power; Corollary; Combinatorics; Hadamard matrix; Order (exchange); Class (philosophy); Integer (computer science); Prime (order theory); Hadamard's inequality; Hadamard's maximal determinant problem; Discrete mathematics; Matrix (chemical analysis); Computer science","score_opus":0.006219342849004023,"score_gpt":0.19458562041908972,"score_spread":0.1883662775700857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005448597","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.907569,0.00063460815,0.015736649,0.00007430221,0.00033146093,0.00048159508,0.000027810212,0.0003300648,0.0748145],"genre_scores_gemma":[0.99558234,0.0000055263386,0.00277566,0.0000041624885,0.00011439197,0.0000105183135,0.000007109165,0.000036773396,0.0014635213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992259,0.00001754563,0.00029486025,0.00011560131,0.00018819504,0.00015788476],"domain_scores_gemma":[0.9994678,0.0000615425,0.00007781717,0.00033322893,0.000023692899,0.00003590856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014228754,0.00014693693,0.00024378384,0.00008071855,0.000024781451,0.000018718178,0.00014050864,0.000058149584,0.000028199993],"category_scores_gemma":[0.000023084991,0.00012246834,0.00008672425,0.0001885729,0.00003387222,0.000060576098,0.000012866922,0.000075943535,0.00003891128],"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.000017570614,0.00008376576,0.00005544692,0.0012476654,0.00011190991,0.0000062000563,0.0017577837,0.012791717,0.008939426,0.9596544,0.014943077,0.00039104483],"study_design_scores_gemma":[0.0006584537,0.00015489217,0.00027639276,0.00069645536,0.00012578767,0.000023300321,0.0013389849,0.01797355,0.08473537,0.8879869,0.0054149106,0.00061498943],"about_ca_topic_score_codex":0.000011344568,"about_ca_topic_score_gemma":0.000003533563,"teacher_disagreement_score":0.08801333,"about_ca_system_score_codex":0.000018005901,"about_ca_system_score_gemma":0.000008208512,"threshold_uncertainty_score":0.49941137},"labels":[],"label_agreement":null},{"id":"W2005796648","doi":"10.1016/j.jalgebra.2013.05.027","title":"On the uniformity of zero-dimensional complete intersections","year":2013,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Zero (linguistics); Intersection (aeronautics); Combinatorics; Complete intersection; Interval (graph theory); Discrete mathematics; Pure mathematics","score_opus":0.010564110884583363,"score_gpt":0.1858224580844088,"score_spread":0.17525834719982544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005796648","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.9962029,0.000054802946,0.0006403434,0.0001676307,0.0005473094,0.000053926193,0.0000026646762,0.000010857028,0.0023196083],"genre_scores_gemma":[0.9997831,0.0000028716454,0.000050597864,0.000062470244,0.00005061068,0.0000012926276,2.5298806e-7,0.0000071024424,0.00004167838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945074,0.000039294,0.00026911547,0.000027030828,0.00013498357,0.000078812394],"domain_scores_gemma":[0.9995239,0.00015319603,0.00009812731,0.00010090513,0.00008306927,0.000040843326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022336093,0.00006149376,0.00012563483,0.000076426775,0.00003931801,0.000011500434,0.00012660057,0.000027249158,0.00035390788],"category_scores_gemma":[0.000023957433,0.00003659146,0.00011151347,0.000089782276,0.0000360377,0.00009998336,0.000009527248,0.00019443718,0.000053603017],"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.00013458694,0.00029601398,0.0019893881,0.00017426608,0.0013670197,0.000023740124,0.0025814103,0.055599112,0.16648261,0.60032356,0.16827182,0.0027564545],"study_design_scores_gemma":[0.0027275067,0.0020442102,0.085563526,0.0014399666,0.00020636022,0.0016311684,0.0034877686,0.026989115,0.055232745,0.80966485,0.010144546,0.0008682399],"about_ca_topic_score_codex":0.000007508723,"about_ca_topic_score_gemma":0.0000018083348,"teacher_disagreement_score":0.20934127,"about_ca_system_score_codex":0.00001625352,"about_ca_system_score_gemma":0.000006960207,"threshold_uncertainty_score":0.3875043},"labels":[],"label_agreement":null},{"id":"W2006143633","doi":"10.1006/jcta.2001.3189","title":"A Theory of Ternary Complementary Pairs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Binary Golay code; Complementary sequences; Autocorrelation; Ternary operation; Zero (linguistics); Mathematics; Combinatorics; Binary number; Discrete mathematics; Algorithm; Arithmetic; Computer science; Statistics","score_opus":0.009776670719507887,"score_gpt":0.20789294868449082,"score_spread":0.19811627796498293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006143633","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.97235745,0.0017021704,0.0019775901,0.000053553118,0.010098798,0.00016358618,0.000015095746,0.00007838763,0.013553353],"genre_scores_gemma":[0.99888474,0.00018110292,0.00010803779,0.000024345447,0.00061431277,0.0000028671832,0.0000018227032,0.000033796547,0.0001489875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982215,0.0004009706,0.0007663403,0.00007941461,0.00029966966,0.00023207284],"domain_scores_gemma":[0.99893284,0.0002963885,0.0002925011,0.00023673216,0.0001317905,0.00010977181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019178914,0.00019372611,0.00047976634,0.00017611778,0.00006392846,0.00002224337,0.00039675544,0.00008046169,0.000512739],"category_scores_gemma":[0.000057251942,0.00016552387,0.0002558718,0.0002185567,0.0001465808,0.00039316015,0.00003995158,0.0002629296,0.000005397429],"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.0024698116,0.00013407013,0.0012535806,0.00010498437,0.00049431156,0.0001474469,0.0013488192,0.00042348113,0.0050804177,0.9844178,0.001338028,0.0027872745],"study_design_scores_gemma":[0.0016662547,0.00073616294,0.00042753728,0.00017109029,0.00008228642,0.0005613621,0.0033585823,0.000023073086,0.005760701,0.95403934,0.032959353,0.00021424433],"about_ca_topic_score_codex":0.0000016675016,"about_ca_topic_score_gemma":5.736619e-7,"teacher_disagreement_score":0.031621326,"about_ca_system_score_codex":0.000043211323,"about_ca_system_score_gemma":0.000027568787,"threshold_uncertainty_score":0.6749868},"labels":[],"label_agreement":null},{"id":"W2006340097","doi":"10.1016/s0166-218x(99)00123-7","title":"On the strong chromatic index of cyclic multigraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Edge coloring; Upper and lower bounds; Index (typography); Graph; Multigraph; Discrete mathematics; Line graph; Mathematical analysis; Computer science; Graph power","score_opus":0.007138909142864235,"score_gpt":0.1925086100329304,"score_spread":0.18536970089006616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006340097","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.866675,0.00004503559,0.0032625387,0.0000100616535,0.000042355136,0.00040516804,0.000011906011,0.00016067264,0.12938723],"genre_scores_gemma":[0.99930066,0.000012216582,0.00044050565,0.000017761187,0.000019099067,0.00008109528,0.0000038869543,0.000038884624,0.00008586461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910575,0.000014125656,0.0003534742,0.00010531938,0.00021069372,0.00021061527],"domain_scores_gemma":[0.99917215,0.00022664205,0.00005811617,0.0004925947,0.0000071659265,0.000043324475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019668168,0.00018652366,0.00026073607,0.000055108918,0.00006060902,0.000019839415,0.00026125446,0.00006872599,0.00048214465],"category_scores_gemma":[0.000008322386,0.00012442928,0.00009676917,0.00019437945,0.00007983077,0.000028659011,0.000010318871,0.0001394555,0.00015369014],"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.00001565188,0.00009393952,0.000018222338,0.00079191715,0.0001958962,0.0000015781962,0.004299283,0.015955064,0.0117825065,0.96313757,0.00055467174,0.003153688],"study_design_scores_gemma":[0.0019418712,0.00014797584,0.0010851489,0.0010821709,0.00023310304,0.000020925347,0.00901652,0.28813365,0.057416264,0.63835764,0.0011052345,0.0014594907],"about_ca_topic_score_codex":0.0000017680918,"about_ca_topic_score_gemma":0.0000017184409,"teacher_disagreement_score":0.32477993,"about_ca_system_score_codex":0.000010312961,"about_ca_system_score_gemma":0.0000033825,"threshold_uncertainty_score":0.5279146},"labels":[],"label_agreement":null},{"id":"W2006549279","doi":"10.1016/j.disopt.2007.12.002","title":"Minimum cycle factors in quasi-transitive digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Transitive relation; Discrete mathematics; Path (computing); Computer science","score_opus":0.006986559510435831,"score_gpt":0.18918722940017602,"score_spread":0.18220066988974018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006549279","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.8769119,0.00013746729,0.113679565,0.000013950151,0.0002517546,0.00019498574,0.000019988041,0.00022663208,0.008563748],"genre_scores_gemma":[0.99938405,0.000085925385,0.00032823274,0.000007780572,0.000019870651,0.000015046843,0.000084210966,0.000026536442,0.000048355716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936414,0.000041875097,0.00018795012,0.00013211273,0.00009600016,0.00017792097],"domain_scores_gemma":[0.99976635,0.000026494614,0.000020272206,0.00012267439,0.000016410817,0.000047791593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056884215,0.00013121645,0.00014403767,0.00013813385,0.000060533424,0.000012416623,0.000069854286,0.00007710901,0.00004659355],"category_scores_gemma":[0.000008413016,0.00012846477,0.00005918494,0.0003300799,0.000037300764,0.00022103504,0.000004583814,0.00008234705,0.000008139655],"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.000010135084,0.000018327884,0.0073704496,0.000018942095,0.000015468562,0.00000864394,0.0034626476,0.9879148,0.00045328043,0.0006412019,0.000032664833,0.00005342419],"study_design_scores_gemma":[0.0005985959,0.00005146659,0.015017474,0.000060033562,0.000011700972,0.000009235708,0.0012392071,0.97969145,0.0025547585,0.0002821531,0.000091197166,0.0003927489],"about_ca_topic_score_codex":0.000024932686,"about_ca_topic_score_gemma":0.000017392795,"teacher_disagreement_score":0.12247213,"about_ca_system_score_codex":0.000022204646,"about_ca_system_score_gemma":0.000005264064,"threshold_uncertainty_score":0.52386415},"labels":[],"label_agreement":null},{"id":"W2006989602","doi":"10.1109/cig.2010.5592926","title":"The enumeration of Costas arrays of order 28","year":2010,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"Science Foundation Ireland","keywords":"Enumeration; Golomb coding; Computer science; Order (exchange); Combinatorics; Mathematics; Algorithm; Parallel computing; Artificial intelligence","score_opus":0.003140576652433672,"score_gpt":0.1765832734747749,"score_spread":0.17344269682234123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006989602","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.94221735,0.000055592307,0.010944108,0.00002092107,0.0005595365,0.0000788792,0.000002341498,0.00004151398,0.046079777],"genre_scores_gemma":[0.9995801,0.0000051889397,0.00017063896,0.0000027322833,0.000018727575,0.0000023197722,8.720919e-7,0.0000041557487,0.00021526485],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997787,0.000008548418,0.00010086013,0.000023368342,0.000044310356,0.000044202156],"domain_scores_gemma":[0.99978954,0.000036932408,0.000014720642,0.00011834698,0.000031034167,0.000009417052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013010185,0.00002939877,0.000046491612,0.000011591282,0.000019028537,0.0000041787357,0.000050735875,0.000024996212,0.00007890314],"category_scores_gemma":[0.0000120536215,0.000018691982,0.000017190656,0.000060441213,0.000021471787,0.00002551635,0.0000027353997,0.000047846454,0.000007478704],"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.000005290693,0.0000092212695,0.0003125916,0.00003834034,0.00003112624,7.561464e-8,0.0006139333,0.0015524854,0.7721312,0.2190596,0.0008865685,0.0053595323],"study_design_scores_gemma":[0.00026155653,0.00003473292,0.0010152212,0.000013701476,0.000012236196,0.0000031991524,0.0007542227,0.019385722,0.9471107,0.005652173,0.025634164,0.00012236134],"about_ca_topic_score_codex":0.000010736192,"about_ca_topic_score_gemma":0.000071098744,"teacher_disagreement_score":0.21340743,"about_ca_system_score_codex":0.0000010045766,"about_ca_system_score_gemma":0.000002715226,"threshold_uncertainty_score":0.0863934},"labels":[],"label_agreement":null},{"id":"W2007025549","doi":"10.1016/s0024-3795(00)00337-2","title":"The Hadamard core of the totally nonnegative matrices","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Hadamard product; Combinatorics; Hadamard matrix; Nonnegative matrix; Complex Hadamard matrix; Class (philosophy); Hadamard transform; Characterization (materials science); Matrix (chemical analysis); Product (mathematics); Hadamard's maximal determinant problem; Subclass; Hadamard's inequality; Symmetric matrix; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.008450985238730445,"score_gpt":0.20912430548615804,"score_spread":0.2006733202474276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007025549","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.9756019,0.0037912547,0.0022437663,0.0004162365,0.00013716832,0.00068165833,0.000032694494,0.000107037646,0.016988268],"genre_scores_gemma":[0.99873966,0.00046455683,0.00003681423,0.000021931755,0.000075235155,0.00010165974,0.0000020537825,0.000009396512,0.0005486892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961734,0.000013064063,0.00013858388,0.00007338311,0.000065478496,0.00009217707],"domain_scores_gemma":[0.99958336,0.000113269394,0.00003598796,0.00020378546,0.000036657344,0.000026961166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008323593,0.0000666781,0.0000699733,0.000013760445,0.00021149318,0.00001568342,0.00016770147,0.00003322908,0.000010646659],"category_scores_gemma":[0.000009537426,0.000038218182,0.000037591373,0.00024357646,0.000054391425,0.00003640074,0.000023627876,0.00007323984,0.000018049235],"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.000013779903,0.00003243041,0.0008661507,0.000076198354,0.000098989454,3.1737815e-7,0.0008914472,0.0010783258,0.006887012,0.9806852,0.0009454914,0.008424689],"study_design_scores_gemma":[0.00087853323,0.000112421854,0.023957564,0.00013531127,0.00017897678,0.00007959747,0.0029433446,0.08604452,0.02265831,0.104130484,0.75817394,0.0007070209],"about_ca_topic_score_codex":0.0000036441568,"about_ca_topic_score_gemma":0.000013056891,"teacher_disagreement_score":0.87655467,"about_ca_system_score_codex":0.0000039408146,"about_ca_system_score_gemma":0.000005620519,"threshold_uncertainty_score":0.1626656},"labels":[],"label_agreement":null},{"id":"W2007540911","doi":"10.1080/03081080600788234","title":"Inertias of zero–nonzero patterns","year":2006,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","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 Victoria","funders":"","keywords":"Zero (linguistics); Mathematics; Sign (mathematics); Combinatorics; Zero mode; Zero-point energy; Matrix (chemical analysis); Zero order; Mathematical analysis; Physics; Mathematical physics; Quantum mechanics; Applied mathematics","score_opus":0.004902152918712059,"score_gpt":0.18924666141021435,"score_spread":0.18434450849150227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007540911","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.9923646,0.00061167486,0.004666955,0.000009037557,0.00024132417,0.00011760476,0.000040396106,0.0001793874,0.0017690562],"genre_scores_gemma":[0.99892515,0.000040280484,0.0004897611,0.000017744662,0.00017074712,0.0000072733546,0.00002639508,0.000032555683,0.00029007232],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923205,0.000022989607,0.00030221988,0.00014522932,0.00010348929,0.00019404397],"domain_scores_gemma":[0.9996402,0.000041109604,0.000032231983,0.00019810304,0.000031224285,0.00005711701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108847074,0.00015538554,0.00022278384,0.00007597207,0.000032710577,0.000011564479,0.0000878345,0.00009310059,0.000042631807],"category_scores_gemma":[0.000008759022,0.00014020606,0.00007214127,0.00010334665,0.000046277553,0.000069431764,0.000022420145,0.00010932933,0.00002391381],"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.00038597363,0.0011122262,0.33076334,0.0051658526,0.0008941699,0.00016117077,0.0056130495,0.05560421,0.45714772,0.06311383,0.008233465,0.071805],"study_design_scores_gemma":[0.004853612,0.00029795754,0.0865561,0.00040079738,0.00017625066,0.00009183262,0.00058756734,0.42314696,0.44259956,0.0056246305,0.03398401,0.0016807182],"about_ca_topic_score_codex":0.00012611022,"about_ca_topic_score_gemma":0.000026669302,"teacher_disagreement_score":0.36754277,"about_ca_system_score_codex":0.000005043848,"about_ca_system_score_gemma":0.0000041775297,"threshold_uncertainty_score":0.5717437},"labels":[],"label_agreement":null},{"id":"W2008006139","doi":"10.1049/el:20010257","title":"Polynomials for generating selection sets withcomplementary quotientsin guided scrambling line coding","year":2001,"lang":"en","type":"article","venue":"Electronics Letters","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 Alberta","funders":"","keywords":"Scrambling; Quotient; Coding (social sciences); Mathematics; Selection (genetic algorithm); Line (geometry); Algorithm; Arithmetic; Discrete mathematics; Theoretical computer science; Computer science; Pure mathematics; Artificial intelligence; Statistics","score_opus":0.022450328635027925,"score_gpt":0.25494390680489,"score_spread":0.23249357816986205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008006139","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.9022425,0.00043092793,0.09556085,0.00039203186,0.0005190314,0.00041586632,0.000008311773,0.000323838,0.00010669221],"genre_scores_gemma":[0.9954802,0.00004057748,0.002739288,0.0009707681,0.00050515134,0.0000762367,0.00008279761,0.00006690232,0.000038070913],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985452,0.00005106799,0.00038482688,0.00023665074,0.00013656748,0.0006456728],"domain_scores_gemma":[0.99963903,0.000056703717,0.00006807186,0.00014326586,0.00003087165,0.00006208144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045191817,0.00021352377,0.00021435926,0.0001537721,0.0002598003,0.00007691514,0.00013641406,0.000058747642,0.000027827748],"category_scores_gemma":[0.000014765374,0.00024073414,0.000098177334,0.00026760396,0.000013809295,0.00016751103,0.000012398911,0.00018789215,0.0000074829527],"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.000032513115,0.000015522412,0.0010106349,0.000055603054,0.0001413838,0.0000026003963,0.00017436939,0.12846202,0.85751665,0.0011459397,0.009313065,0.0021296884],"study_design_scores_gemma":[0.0026280389,0.00031125572,0.00013644513,0.00014094144,0.000120112316,0.00015476566,0.00016149195,0.70733863,0.2397234,0.0006441,0.04752496,0.0011158597],"about_ca_topic_score_codex":0.000020668313,"about_ca_topic_score_gemma":0.000077733566,"teacher_disagreement_score":0.61779326,"about_ca_system_score_codex":0.00025924016,"about_ca_system_score_gemma":0.00001790915,"threshold_uncertainty_score":0.98168534},"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":"W2008104692","doi":"10.1109/vtcfall.2014.6966170","title":"SCMA Codebook Design","year":2014,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":642,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Codebook; Computer science; Algorithm; QAM; Quadrature amplitude modulation; Code division multiple access; Code (set theory); Theoretical computer science; Bit error rate; Telecommunications; Decoding methods","score_opus":0.007264408937287988,"score_gpt":0.1498062417669913,"score_spread":0.1425418328297033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008104692","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.011264406,0.000043005344,0.6417758,0.00000739617,0.00024624515,0.00006188563,1.9204195e-7,0.00047316257,0.34612793],"genre_scores_gemma":[0.9967337,0.0000012404707,0.0009053685,0.000044003045,0.000044891753,0.000007647939,2.9787947e-7,0.0000104663795,0.0022523757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974257,0.00002712427,0.000059991497,0.000044446788,0.000035567984,0.000090305526],"domain_scores_gemma":[0.99981505,0.000038040038,0.0000032765665,0.00010748857,0.00000497623,0.00003114587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016009218,0.000048101363,0.000055690794,0.000020554573,0.000018174504,0.000010802956,0.000056363508,0.000025751848,0.00017351413],"category_scores_gemma":[0.000004648122,0.000040353134,0.00001913124,0.0000307584,0.000008021884,0.000028751352,0.0000032019977,0.000028944078,0.00048083768],"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.000012997465,0.000018336139,0.0003639723,0.00011748517,0.000077673285,0.0000036722304,0.00050501665,0.05597872,0.04385054,0.8036949,0.064386934,0.030989747],"study_design_scores_gemma":[0.00067821867,0.00010681779,0.00055415777,0.000049620034,0.000018032924,0.000026133705,0.00011828328,0.49159545,0.1304504,0.057425875,0.31833628,0.00064072764],"about_ca_topic_score_codex":0.0000013846982,"about_ca_topic_score_gemma":0.0000010229716,"teacher_disagreement_score":0.9854693,"about_ca_system_score_codex":0.000003986903,"about_ca_system_score_gemma":0.0000010049448,"threshold_uncertainty_score":0.6180356},"labels":[],"label_agreement":null},{"id":"W2008148950","doi":"10.1016/j.disc.2003.11.016","title":"Bicolouring Steiner systems S(2,4,v)","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"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; Block (permutation group theory); Discrete mathematics","score_opus":0.008656548377924686,"score_gpt":0.19543831530461134,"score_spread":0.18678176692668666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008148950","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.8829991,0.0012022537,0.059547722,0.00002880826,0.0011704745,0.000445133,0.000017766462,0.0010716616,0.05351709],"genre_scores_gemma":[0.9983654,0.000013816948,0.0011104187,0.000006278267,0.000103341765,0.000041319294,0.0000042130587,0.00005318314,0.0003020504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991655,0.000012164224,0.00029359807,0.000107390595,0.0001660989,0.0002552658],"domain_scores_gemma":[0.9995224,0.000028760116,0.00003770033,0.00031406689,0.00001894596,0.000078138095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017817933,0.00017186826,0.0002267193,0.00007419269,0.00005918173,0.0000760483,0.0001697729,0.0000736494,0.00001640616],"category_scores_gemma":[0.000013208774,0.00014591386,0.00007648672,0.0001545123,0.00002718358,0.00010143598,0.000020588584,0.00010837195,0.00023242984],"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.0000031735885,0.000061911276,0.000054317108,0.0020530245,0.00017486612,0.00004179503,0.004424543,0.257544,0.008643295,0.7264278,0.0003696027,0.00020167207],"study_design_scores_gemma":[0.00849639,0.0005177732,0.00058460556,0.00752908,0.0004983477,0.0012239685,0.03469734,0.39404804,0.08261731,0.40738672,0.055455614,0.0069448138],"about_ca_topic_score_codex":0.0000054069974,"about_ca_topic_score_gemma":0.0000019354713,"teacher_disagreement_score":0.31904107,"about_ca_system_score_codex":0.000047286532,"about_ca_system_score_gemma":0.0000066378957,"threshold_uncertainty_score":0.59501946},"labels":[],"label_agreement":null},{"id":"W2008597407","doi":"10.1007/s00373-006-0664-1","title":"On the Intersection Problem for Steiner Triple Systems of Different Orders","year":2006,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Victoria; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Steiner system; Mathematics; Intersection (aeronautics); Order (exchange); Set (abstract data type); Steiner tree problem; Triple system; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.005505699171466485,"score_gpt":0.16559429727165292,"score_spread":0.16008859810018644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008597407","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.99395466,0.0003966274,0.0017391549,0.000012902419,0.0010720195,0.00045679236,0.000008810597,0.0000765311,0.0022825233],"genre_scores_gemma":[0.99968123,0.000012254934,0.0000024026717,0.0000035914215,0.000011789906,0.000110084344,0.0000044415615,0.000014472571,0.00015974342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995074,0.00002574204,0.00017896337,0.00008620828,0.00008282789,0.000118825534],"domain_scores_gemma":[0.9997027,0.00008478894,0.000040475497,0.00012000379,0.000032969936,0.000019040048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012967695,0.00010604937,0.0001443279,0.00005700255,0.00006733142,0.000024046838,0.00006583411,0.000050217033,0.0000014075305],"category_scores_gemma":[0.0000037113705,0.00006871417,0.00006440359,0.00015815157,0.00002466817,0.000025150084,0.000006159506,0.00006422585,3.888329e-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.00001353496,0.00003955712,0.0005425229,0.00018052121,0.000028612058,1.4352831e-7,0.000060678656,0.0004810365,0.0004625348,0.9961155,0.0019777736,0.00009756537],"study_design_scores_gemma":[0.001348035,0.0005044601,0.0014175377,0.00016110094,0.000049619324,0.000004729772,0.000736871,0.013624328,0.0024287452,0.9766853,0.0027601777,0.0002791021],"about_ca_topic_score_codex":0.000040111812,"about_ca_topic_score_gemma":0.000007480795,"teacher_disagreement_score":0.019430226,"about_ca_system_score_codex":0.000014523951,"about_ca_system_score_gemma":0.0000018662691,"threshold_uncertainty_score":0.28020826},"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":"W2009700041","doi":"10.1007/s00026-011-0094-5","title":"Cores of Geometric Graphs","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Indifference graph; Chordal graph; Clique-sum; Metric dimension; Cograph; 1-planar graph; Pathwidth; Block graph; Discrete mathematics; Graph; Line graph","score_opus":0.06872167980822945,"score_gpt":0.23859015168705247,"score_spread":0.16986847187882304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009700041","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.96381617,0.0021581259,0.00023924201,0.0000025950694,0.0005630653,0.000065465996,0.000007480659,0.000068123605,0.03307974],"genre_scores_gemma":[0.99958575,0.00032354146,0.000016299717,0.000006582466,0.0000048502034,0.0000034557152,0.0000011993025,0.000014162695,0.000044153283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993671,0.000021545413,0.0002620896,0.00006315668,0.00014134734,0.00014477049],"domain_scores_gemma":[0.99947816,0.000049261896,0.00007048381,0.00022433703,0.0001286733,0.000049079765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022681018,0.00008866805,0.0002148212,0.00032945818,0.000013694371,0.0000022116485,0.00019041728,0.00006325978,0.00003683874],"category_scores_gemma":[0.000030583848,0.00008715184,0.000100921236,0.0009170694,0.000045944318,0.00006757365,0.000015508425,0.00006410275,0.0000075491907],"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.00001662471,0.00016611151,0.01792907,0.00034360253,0.00012615466,0.0000038671205,0.00055411254,0.000058572266,0.00076027034,0.9755416,0.003301011,0.0011990403],"study_design_scores_gemma":[0.00034314318,0.00033327448,0.0429075,0.000072179704,0.000023676977,0.0000037400637,0.00017399694,0.000120775956,0.3198238,0.6339347,0.0020093753,0.0002538453],"about_ca_topic_score_codex":0.00001707056,"about_ca_topic_score_gemma":3.8460604e-7,"teacher_disagreement_score":0.34160686,"about_ca_system_score_codex":0.0000019907777,"about_ca_system_score_gemma":0.000004771601,"threshold_uncertainty_score":0.3553949},"labels":[],"label_agreement":null},{"id":"W2009791993","doi":"10.1137/13094075x","title":"An Erdös--Ko--Rado Theorem for the Derangement Graph of ${PGL}_3(q)$ Acting on the Projective Plane","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"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":"Combinatorics; Mathematics; Projective plane; Derangement; Coset; Conjecture; Projective space; Projective line; Discrete mathematics; Projective linear group; Collineation; Projective test; Pure mathematics","score_opus":0.016863005714924547,"score_gpt":0.24357951935729413,"score_spread":0.22671651364236958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009791993","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.70208555,0.00047456226,0.26741263,0.0011119458,0.001429754,0.0027357512,0.00014255113,0.00022761039,0.024379633],"genre_scores_gemma":[0.9989595,0.000040399693,0.0005525667,0.000086202424,0.00019515028,0.000059466165,0.0000034206635,0.000055962177,0.00004732074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985688,0.00018173706,0.00046775411,0.00012519088,0.00036091285,0.00029566055],"domain_scores_gemma":[0.9977149,0.0014289321,0.00027803096,0.00044532318,0.00005912121,0.000073697964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008954,0.00024622522,0.0002990053,0.00008450177,0.00034984088,0.00011557024,0.00048130166,0.000068368776,0.00003265098],"category_scores_gemma":[0.00014172215,0.00012071791,0.00020530843,0.00013723271,0.00007933282,0.00008998341,0.000013998737,0.00038066713,0.0000071359286],"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.00035119144,0.0004090144,0.0000652991,0.0009882988,0.0013336029,0.0000047655726,0.024803367,0.020999767,0.013135996,0.9194536,0.006871589,0.011583481],"study_design_scores_gemma":[0.0032517472,0.0040521775,0.00022946489,0.0029538656,0.000652383,0.00024893045,0.05627082,0.23492314,0.08636868,0.5948156,0.014740826,0.0014923619],"about_ca_topic_score_codex":0.0000011480543,"about_ca_topic_score_gemma":0.0000023831467,"teacher_disagreement_score":0.324638,"about_ca_system_score_codex":0.000033213848,"about_ca_system_score_gemma":0.000008922759,"threshold_uncertainty_score":0.49227333},"labels":[],"label_agreement":null},{"id":"W2010749767","doi":"10.1016/s0024-3795(00)00047-1","title":"On the sequence of powers of a stochastic matrix with large exponent","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Exponent; Combinatorics; Sequence (biology); Graph; Matrix (chemical analysis); Polynomial; Rate of convergence; Discrete mathematics; Mathematical analysis","score_opus":0.007591226831264977,"score_gpt":0.21609394891783304,"score_spread":0.20850272208656806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010749767","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.98685074,0.00037545405,0.010629682,0.0000643455,0.000009553648,0.00037623628,0.000079800506,0.000041371273,0.0015728404],"genre_scores_gemma":[0.9996646,0.000024216686,0.00004776567,0.000014110942,0.000012157004,0.000085837215,0.000005384774,0.00000891302,0.00013703386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996553,0.0000106516545,0.000117911004,0.00007032689,0.000067649395,0.00007812905],"domain_scores_gemma":[0.9997,0.00006877505,0.00002272441,0.000164746,0.000017983704,0.000025785295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006615968,0.00006155631,0.00008498297,0.000023807537,0.00004079653,0.0000033323345,0.00007742799,0.000023172812,0.000118910946],"category_scores_gemma":[0.0000027987394,0.000040385403,0.000019277766,0.00014338714,0.000032215063,0.000021339776,0.000004000357,0.000052526353,0.000022145488],"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.00004045135,0.00008049882,0.000016996419,0.00011846293,0.00006450323,3.1093418e-7,0.0009188907,0.01088903,0.012685084,0.97413814,0.00009453201,0.0009531202],"study_design_scores_gemma":[0.007574295,0.0031061063,0.0038944448,0.0021487111,0.00082530273,0.00019052609,0.008226208,0.604035,0.15839387,0.13124447,0.07693442,0.003426609],"about_ca_topic_score_codex":0.0000020864272,"about_ca_topic_score_gemma":0.000001070758,"teacher_disagreement_score":0.84289366,"about_ca_system_score_codex":0.0000029418618,"about_ca_system_score_gemma":0.0000046325445,"threshold_uncertainty_score":0.1646869},"labels":[],"label_agreement":null},{"id":"W2010841183","doi":"10.1016/j.disc.2006.11.050","title":"Directed complete bipartite graph decompositions: Indirect constructions","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.014052312043487284,"score_gpt":0.22950789611474717,"score_spread":0.2154555840712599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010841183","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.7672166,0.0004915908,0.1608962,0.000024767016,0.0010052287,0.0004998595,0.00015645156,0.002389528,0.06731973],"genre_scores_gemma":[0.9865278,0.000018644872,0.013181395,0.000015857795,0.00006739029,0.000025360032,0.000042843894,0.000044969056,0.00007572417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989177,0.000027302174,0.00043278642,0.00013274595,0.00015996874,0.00032948042],"domain_scores_gemma":[0.99928516,0.00018207727,0.00006148349,0.00031112638,0.000040633073,0.00011954698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031628925,0.00019447679,0.00026746813,0.00022074593,0.0001697466,0.000052747408,0.0001491333,0.00008084368,0.00009749539],"category_scores_gemma":[0.000022943064,0.00018507364,0.00012783191,0.0004885815,0.00010955334,0.00010270399,0.00001844876,0.00014951239,0.00013272997],"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.00005053435,0.00041668315,0.0044869026,0.0022620922,0.0018324568,0.00013185281,0.016964374,0.005676671,0.13315345,0.82313365,0.0067068287,0.005184504],"study_design_scores_gemma":[0.0044536716,0.0003368358,0.016398435,0.0027131916,0.0011549959,0.002128681,0.01917639,0.15906575,0.1293035,0.6081096,0.05104897,0.0061099837],"about_ca_topic_score_codex":0.0000027189253,"about_ca_topic_score_gemma":0.00002427176,"teacher_disagreement_score":0.21931116,"about_ca_system_score_codex":0.00002737778,"about_ca_system_score_gemma":0.0000050369613,"threshold_uncertainty_score":0.7547084},"labels":[],"label_agreement":null},{"id":"W2010902762","doi":"10.1016/s0097-3165(02)00015-8","title":"Doubly regular digraphs and symmetric designs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Adjacency matrix; Combinatorics; Mathematics; Versa; Incidence matrix; Matrix (chemical analysis); Carry (investment); Skew; Construct (python library); Adjacency list; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.008512606908426673,"score_gpt":0.19182302294834708,"score_spread":0.1833104160399204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010902762","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.96315897,0.007866092,0.0017913262,0.000023367404,0.010596996,0.00017569636,0.0000028267193,0.00009184602,0.016292866],"genre_scores_gemma":[0.99923354,0.0002648868,0.0001386977,0.000010108415,0.00020637487,0.0000026537407,2.1862235e-7,0.00002823337,0.00011530004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873877,0.00031217208,0.0004338755,0.00008322514,0.00021765324,0.00021433161],"domain_scores_gemma":[0.9992232,0.00020745514,0.00014439879,0.00016862349,0.00010945076,0.00014692814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016194795,0.0001744567,0.00035534616,0.00028666176,0.00009328797,0.000075166456,0.00016300424,0.00010807615,0.000042348427],"category_scores_gemma":[0.00019310626,0.00014836882,0.00013625309,0.00046060886,0.00009842421,0.0003999939,0.0000107427095,0.00024184702,0.0000026937785],"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.00019662562,0.000027925144,0.00015513838,0.000044468423,0.00014020722,0.00003392555,0.00029231852,0.000104910956,0.0024344334,0.9958191,0.00030435107,0.00044659415],"study_design_scores_gemma":[0.0013120498,0.0004280644,0.000117582895,0.00006462867,0.000063177366,0.00054180255,0.00060824613,0.000004981246,0.014226894,0.94662076,0.035799935,0.00021185857],"about_ca_topic_score_codex":3.4944344e-7,"about_ca_topic_score_gemma":1.3151887e-7,"teacher_disagreement_score":0.049198326,"about_ca_system_score_codex":0.000027507958,"about_ca_system_score_gemma":0.000024674413,"threshold_uncertainty_score":0.6050305},"labels":[],"label_agreement":null},{"id":"W2011595107","doi":"10.1023/a:1016592806366","title":"Balanced Incomplete Block Designs with Block Size 9 and λ=2,4,8","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BGC Engineering (Canada); University of Northern British Columbia","funders":"","keywords":"Block (permutation group theory); Ternary operation; Lambda; Combinatorics; Mathematics; Group (periodic table); Physics; Arithmetic; Computer science; Quantum mechanics","score_opus":0.018081097912936026,"score_gpt":0.1854340216622266,"score_spread":0.1673529237492906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011595107","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.9809318,0.004360786,0.00836822,0.000041664607,0.000107956526,0.0004010086,0.000028833727,0.00047873196,0.0052809636],"genre_scores_gemma":[0.99630296,0.0005954329,0.0028362235,0.00007880584,0.000054282205,0.00005157229,0.0000019767638,0.00004663856,0.000032089978],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988388,0.00007397276,0.0002302392,0.00030552206,0.00015801597,0.00039348015],"domain_scores_gemma":[0.99929065,0.00018417362,0.000041443323,0.00025468,0.000033669054,0.00019536422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015436175,0.00031708254,0.00034432055,0.00016063178,0.00020206007,0.00011637307,0.000122006,0.00010705958,0.00005251451],"category_scores_gemma":[0.000006451927,0.0002657788,0.00007514938,0.0004552465,0.0001861576,0.00011984475,0.000019208917,0.0001619901,0.000007702076],"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.0009687476,0.00096554164,0.2132541,0.003635099,0.005260232,0.00069664634,0.017773692,0.011872243,0.54658747,0.14383255,0.022414146,0.032739546],"study_design_scores_gemma":[0.042960305,0.013124312,0.305848,0.0047296844,0.003392253,0.007250676,0.013746742,0.23288167,0.06661486,0.09682519,0.18869273,0.023933569],"about_ca_topic_score_codex":0.000009233031,"about_ca_topic_score_gemma":0.000013291714,"teacher_disagreement_score":0.47997263,"about_ca_system_score_codex":0.0000059858203,"about_ca_system_score_gemma":0.0000025227598,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W2011692663","doi":"10.1016/j.disc.2006.06.033","title":"Resolvable balanced incomplete block designs with subdesigns of block size 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Block size; Combinatorics; Block (permutation group theory); Discrete mathematics; Pairwise comparison; Statistics; Computer science","score_opus":0.016187533241745405,"score_gpt":0.2196362729728939,"score_spread":0.2034487397311485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011692663","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.8934127,0.00017882981,0.065373,0.000011290179,0.00014169466,0.00054215634,0.000030349558,0.00038401756,0.039925937],"genre_scores_gemma":[0.98222286,0.000006156212,0.01726585,0.000010222729,0.000042935255,0.000013713226,0.0000031708082,0.00006491988,0.00037019968],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863845,0.000028608256,0.0005016217,0.00015510658,0.00027646797,0.00039972342],"domain_scores_gemma":[0.9988331,0.00040586782,0.00011770866,0.0004756474,0.000059329665,0.000108302105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006293261,0.00024385568,0.00041929298,0.00007949691,0.00006240335,0.000023945315,0.000252434,0.0000943376,0.000042232557],"category_scores_gemma":[0.00004826997,0.00019582165,0.00008755679,0.00030646363,0.0000864036,0.00005910468,0.000023979452,0.00014150486,0.000025606676],"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.00052699796,0.0006149346,0.0054457015,0.009711306,0.0016414537,0.00024682202,0.024710368,0.04739238,0.7107971,0.19422668,0.0042204503,0.0004658315],"study_design_scores_gemma":[0.007866323,0.0021057578,0.0053634406,0.0047980575,0.00093944924,0.0007577702,0.017693069,0.10740067,0.7645668,0.07689029,0.006506071,0.0051123286],"about_ca_topic_score_codex":0.000007853863,"about_ca_topic_score_gemma":0.000028122096,"teacher_disagreement_score":0.1173364,"about_ca_system_score_codex":0.000027330498,"about_ca_system_score_gemma":0.000012221233,"threshold_uncertainty_score":0.7985375},"labels":[],"label_agreement":null},{"id":"W2011992755","doi":"10.1016/j.disc.2008.07.003","title":"Super-simple balanced incomplete block designs with block size 4 and index 5","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders; National Natural Science Foundation of China","keywords":"Simple (philosophy); Mathematics; Intersection (aeronautics); Block (permutation group theory); Block size; Combinatorics; Discrete mathematics; Block design; Algorithm; Computer science","score_opus":0.015937151067999592,"score_gpt":0.20201873383249255,"score_spread":0.18608158276449296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011992755","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.988739,0.00012275147,0.005450924,0.000013567672,0.000050073202,0.00027231034,0.000021915312,0.00028749357,0.0050419807],"genre_scores_gemma":[0.99700147,0.000027042473,0.002641288,0.000022364478,0.000044662425,0.000031925872,0.0000045575957,0.00005969824,0.00016698362],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902475,0.000027274817,0.00027824417,0.00016829673,0.00019661791,0.00030482895],"domain_scores_gemma":[0.9992712,0.0001989716,0.00004376906,0.00033978184,0.000028399008,0.00011785242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012328192,0.00024686323,0.00034635674,0.00004946317,0.00014055993,0.000034090106,0.00015059877,0.00007958914,0.000029304712],"category_scores_gemma":[0.00003054237,0.00019514267,0.000049619233,0.00017869446,0.00011156528,0.00009204233,0.00003231418,0.00014182198,0.000021819516],"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.00074240525,0.0013903824,0.20240048,0.020525528,0.00563965,0.0020636271,0.20991738,0.09100711,0.25036854,0.19616581,0.018323291,0.0014558014],"study_design_scores_gemma":[0.018146671,0.0022328196,0.06777664,0.0029931446,0.00095353374,0.012202918,0.02631498,0.66408515,0.04909423,0.12652695,0.01869382,0.010979139],"about_ca_topic_score_codex":0.000005526734,"about_ca_topic_score_gemma":0.000009931586,"teacher_disagreement_score":0.57307804,"about_ca_system_score_codex":0.000016499904,"about_ca_system_score_gemma":0.000010559024,"threshold_uncertainty_score":0.7957687},"labels":[],"label_agreement":null},{"id":"W2012207201","doi":"10.7155/jgaa.00278","title":"Hamilton Cycles in Restricted and Incomplete Rotator Graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","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":"University of Victoria; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Indifference graph; Discrete mathematics; Graph; Computer science","score_opus":0.009693911016826953,"score_gpt":0.2227337202091065,"score_spread":0.21303980919227955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012207201","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.98726946,0.006767677,0.005325584,0.000028270611,0.00010477998,0.00017041553,0.000012083133,0.000026779177,0.00029495836],"genre_scores_gemma":[0.9970627,0.0014209608,0.001341264,0.000012391011,0.00011363445,0.000031320797,0.0000015606198,0.000011940292,0.0000042595575],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993461,0.000026044765,0.00031600654,0.00006133685,0.00008848917,0.000162022],"domain_scores_gemma":[0.99959886,0.000054851964,0.00008155995,0.00008891641,0.000032039672,0.0001438008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021445523,0.00009667915,0.00017481425,0.00029896665,0.00006815074,0.000024583946,0.000072337534,0.000051783165,0.0000025905513],"category_scores_gemma":[0.00000359914,0.000083967505,0.00004588272,0.0003923455,0.000055229106,0.0001891832,0.0000087872495,0.00016437065,9.727308e-7],"study_design_candidate":"observational","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.00014474112,0.0009342634,0.30872646,0.0007652574,0.00077679456,0.00003424168,0.008216865,0.0017204334,0.054416344,0.30827403,0.0021519624,0.31383863],"study_design_scores_gemma":[0.0024670733,0.00022174203,0.8379152,0.00024164958,0.0001370176,0.0008093358,0.0020533975,0.0037245231,0.0014202282,0.08742472,0.06281607,0.000769049],"about_ca_topic_score_codex":0.000007682621,"about_ca_topic_score_gemma":0.0000036991835,"teacher_disagreement_score":0.52918875,"about_ca_system_score_codex":0.000008641125,"about_ca_system_score_gemma":0.000003897231,"threshold_uncertainty_score":0.34240952},"labels":[],"label_agreement":null},{"id":"W2012294171","doi":"10.1016/j.dam.2013.05.007","title":"Super-simple balanced incomplete block designs with block size 5 and index 3","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Mathematics; Simple (philosophy); Block (permutation group theory); Block size; Block design; Combinatorics; Index (typography); Hash function; Discrete mathematics; Algorithm; Arithmetic; Computer science; Key (lock)","score_opus":0.00862092791215069,"score_gpt":0.18716392127110532,"score_spread":0.17854299335895463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012294171","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.9705853,0.00006079108,0.010187308,0.000017742032,0.000039452774,0.00082026917,0.000014937085,0.0003918848,0.017882349],"genre_scores_gemma":[0.9931769,0.000009888537,0.0063392688,0.000037687114,0.000043738564,0.00023634336,0.0000064108012,0.00007700109,0.000072799274],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.000011946875,0.00031808525,0.00021039143,0.00019695409,0.00037274815],"domain_scores_gemma":[0.9991518,0.00021694739,0.000055187218,0.00040295225,0.0000288469,0.0001442308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012440399,0.0002997054,0.00038711773,0.000050549508,0.000098570854,0.00010011763,0.00018450909,0.00010138894,0.00008505236],"category_scores_gemma":[0.0000119932465,0.00023441718,0.000039923736,0.00017551078,0.000088107176,0.00009456841,0.000046335546,0.00016377831,0.00009449504],"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.00012377564,0.00033600014,0.003706772,0.0072076675,0.0015138028,0.000039463208,0.023165347,0.015433249,0.6444624,0.29548916,0.0063068657,0.002215497],"study_design_scores_gemma":[0.012443007,0.00075641565,0.01579581,0.0011917942,0.00075834914,0.0007479096,0.034455873,0.30535015,0.07476365,0.537829,0.007832975,0.008075074],"about_ca_topic_score_codex":0.000009466654,"about_ca_topic_score_gemma":0.000008033962,"teacher_disagreement_score":0.56969875,"about_ca_system_score_codex":0.000017533874,"about_ca_system_score_gemma":0.00000792911,"threshold_uncertainty_score":0.9559255},"labels":[],"label_agreement":null},{"id":"W2012407873","doi":"10.5539/jmr.v1n2p43","title":"The Model and Algorithm to Estimate the Difficulty Levels of Sudoku Puzzles","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Algorithm; Process (computing); Brute force; Computer science; Artificial intelligence; Calculus (dental); Programming language","score_opus":0.07183652209651653,"score_gpt":0.3841909402591585,"score_spread":0.312354418162642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012407873","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.95323855,0.0011407384,0.042513233,0.0012525446,0.00009864247,0.00028925587,0.000013358232,0.000016204138,0.0014375031],"genre_scores_gemma":[0.9911545,0.00009656805,0.008462117,0.000005559555,0.00004899041,0.00000263667,6.718933e-8,0.000011398813,0.00021816217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986387,0.00008584224,0.000409631,0.000046080102,0.00059060595,0.00022913568],"domain_scores_gemma":[0.9987799,0.0005870127,0.00007404997,0.00021514228,0.00025343473,0.00009045465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035470328,0.0000805078,0.00019373038,0.00010465949,0.00016592629,0.00008773384,0.00039333032,0.00003895285,0.0000029239775],"category_scores_gemma":[0.00021820211,0.000038515507,0.00006258299,0.0001931142,0.000085405496,0.000065303095,0.000036722355,0.0003365332,0.0000034405243],"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.00009940224,0.0005996599,0.000049018323,0.0011405812,0.00062638667,0.000071571434,0.03735436,0.31958297,0.14623162,0.23746596,0.017730046,0.23904842],"study_design_scores_gemma":[0.00032846964,0.00022345445,0.0011306893,0.0003665002,0.000021882006,0.00021497981,0.0029550665,0.7913408,0.006854758,0.19593953,0.000498637,0.0001251817],"about_ca_topic_score_codex":6.0008637e-7,"about_ca_topic_score_gemma":0.0000025027846,"teacher_disagreement_score":0.4717579,"about_ca_system_score_codex":0.000021395055,"about_ca_system_score_gemma":0.000022594919,"threshold_uncertainty_score":0.15706168},"labels":[],"label_agreement":null},{"id":"W2013198476","doi":"10.1007/s00184-008-0182-7","title":"Existence of balanced sampling plans avoiding cyclic distances","year":2008,"lang":"en","type":"article","venue":"Metrika","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Sampling (signal processing); Statistics; Calculus (dental); Orthodontics; Computer science; Telecommunications","score_opus":0.03748381395675505,"score_gpt":0.22632852735766015,"score_spread":0.1888447134009051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013198476","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.9753134,0.0016241204,0.013959808,0.000002863865,0.00040690816,0.000064644,0.000019117264,0.00015588544,0.008453226],"genre_scores_gemma":[0.9990236,0.00014652354,0.00065549783,0.000004887732,0.000044261233,0.00000752287,0.0000033578021,0.000014526632,0.00009980855],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993329,0.000031508473,0.00021986413,0.000107611566,0.00013209191,0.00017604572],"domain_scores_gemma":[0.999564,0.00016714683,0.00003780395,0.00017369377,0.000015638036,0.000041744006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020827868,0.00009741361,0.000203033,0.0001209123,0.00008789898,0.0000064596143,0.00014604285,0.00004235886,0.000018479916],"category_scores_gemma":[0.000051392955,0.00009206351,0.00006285318,0.00044003574,0.000044472796,0.00007818874,0.000009383638,0.00010922918,0.000015760588],"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.00016914602,0.00019632022,0.25149193,0.0022522593,0.0005983009,0.00013485417,0.015753957,0.029214134,0.6018243,0.07913149,0.0013927052,0.017840624],"study_design_scores_gemma":[0.0032651199,0.0003353622,0.13915162,0.0014661954,0.00012571944,0.00033221958,0.0062794467,0.017073927,0.7561564,0.019379353,0.053754423,0.0026802167],"about_ca_topic_score_codex":0.000008393876,"about_ca_topic_score_gemma":0.0000057892603,"teacher_disagreement_score":0.15433212,"about_ca_system_score_codex":0.000018206963,"about_ca_system_score_gemma":0.0000042528623,"threshold_uncertainty_score":0.3754241},"labels":[],"label_agreement":null},{"id":"W2013977006","doi":"10.1016/s0012-365x(99)00374-x","title":"Cyclically resolvable cyclic Steiner triple systems of order 21 and 39","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Steiner system; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.007023607796388143,"score_gpt":0.19988096601752797,"score_spread":0.19285735822113984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013977006","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.93193555,0.001407745,0.002871494,0.0000150817295,0.00017938296,0.00039542277,0.0000372646,0.00021468248,0.0629434],"genre_scores_gemma":[0.994678,0.000105667954,0.0012626784,0.000007615765,0.000048756494,0.000032909367,0.000007802328,0.00005037719,0.00380618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989308,0.00003732875,0.0004764956,0.00013713368,0.00018271984,0.00023548109],"domain_scores_gemma":[0.9993736,0.00008033859,0.000055728433,0.0003756445,0.000030803956,0.000083851904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025943413,0.00018198835,0.000386642,0.00006332401,0.000045559045,0.000044666536,0.00014793174,0.00010093839,0.00017122114],"category_scores_gemma":[0.000024942678,0.00014986812,0.000060890194,0.00021824574,0.000060854603,0.00008880817,0.000016617261,0.00010184761,0.000056400466],"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.00028056678,0.0009494043,0.0033775559,0.03284501,0.0023442083,0.000109562956,0.036289338,0.095753364,0.11179962,0.6840642,0.017590392,0.014596772],"study_design_scores_gemma":[0.0060782623,0.0006311579,0.0017249961,0.004004295,0.0006721689,0.00043269,0.008618908,0.8129719,0.011995232,0.045300663,0.104044326,0.0035254112],"about_ca_topic_score_codex":0.000018190307,"about_ca_topic_score_gemma":0.0000036799004,"teacher_disagreement_score":0.7172185,"about_ca_system_score_codex":0.000010320272,"about_ca_system_score_gemma":0.0000054479724,"threshold_uncertainty_score":0.6111445},"labels":[],"label_agreement":null},{"id":"W2014043378","doi":"10.1109/tit.2013.2241391","title":"Wavelength Isolation Sequence Design","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Golomb coding; Spectrometer; Complementary sequences; Binary number; Sequence (biology); Wavelength; Algorithm; Pseudorandom binary sequence; Mathematics; Computer science; Optics; Physics; Arithmetic; Discrete mathematics; Artificial intelligence; Chemistry","score_opus":0.01332491978848729,"score_gpt":0.19279997669613566,"score_spread":0.17947505690764837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014043378","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.013361262,0.0000067880583,0.9774573,0.000016809348,0.0007102362,0.0003784391,0.000012838147,0.0005311852,0.0075251535],"genre_scores_gemma":[0.9985102,0.000018288738,0.0009379635,0.000122549,0.000018290031,0.00018503326,0.0000052911464,0.00001369718,0.00018869445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924546,0.00009011673,0.0003017316,0.000060068913,0.000131808,0.00017082527],"domain_scores_gemma":[0.9995043,0.00013063804,0.000040176234,0.00019905345,0.00006221437,0.000063593325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032141412,0.0001364394,0.00009655247,0.00020742933,0.00014226427,0.000078826284,0.00010762827,0.00009266687,0.0006990598],"category_scores_gemma":[0.000003826921,0.0001303052,0.000060581173,0.00020150216,0.00003353313,0.001942722,2.3810652e-7,0.00017277947,0.002776524],"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.00004706606,0.000026981294,0.0000011612725,0.000096617274,0.00008125091,3.1113382e-7,0.0037510777,0.5831472,0.0034419466,0.022175398,0.0009699591,0.38626102],"study_design_scores_gemma":[0.0006281198,0.00012661229,0.00007469951,0.00007741993,0.00003243813,0.000030827094,0.0016219479,0.8936084,0.062569134,0.038686454,0.0019924478,0.0005515033],"about_ca_topic_score_codex":0.0000048853594,"about_ca_topic_score_gemma":3.8510348e-7,"teacher_disagreement_score":0.9851489,"about_ca_system_score_codex":0.000057536963,"about_ca_system_score_gemma":0.000011156611,"threshold_uncertainty_score":0.9979999},"labels":[],"label_agreement":null},{"id":"W2014599857","doi":"10.1016/j.disc.2009.11.001","title":"Super-simple, pan-orientable and pan-decomposable GDDs with block size 4","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Simple (philosophy); Block (permutation group theory); Block size; Graph; Type (biology); Discrete mathematics; Simple graph; Computer science; Biology; Key (lock)","score_opus":0.005352589684274519,"score_gpt":0.20006041606032907,"score_spread":0.19470782637605455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014599857","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.9670257,0.00033449323,0.0018754808,0.0000399013,0.00010968244,0.0002996233,0.000022867964,0.00034269862,0.029949538],"genre_scores_gemma":[0.99591637,0.000033509918,0.0031635317,0.000038067028,0.000060572955,0.000016082711,0.000008376934,0.000040657767,0.0007228266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989947,0.000019190318,0.0002806111,0.00017584609,0.0001773385,0.00035228438],"domain_scores_gemma":[0.9993535,0.00012316651,0.00003838539,0.00035874872,0.000024897598,0.00010127763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017276629,0.00024385612,0.00033121923,0.000040427072,0.00010265661,0.000095878895,0.00014248921,0.00007566278,0.000053486285],"category_scores_gemma":[0.000021414951,0.00018997389,0.00005037099,0.00017236345,0.00004534853,0.0001279568,0.000018908982,0.00012794865,0.00003241857],"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.00027312976,0.00130124,0.0117811635,0.0077759647,0.0016764681,0.0003198223,0.051867876,0.008267626,0.07835393,0.79522806,0.03368001,0.009474688],"study_design_scores_gemma":[0.011565906,0.0034484316,0.017576383,0.0031414218,0.0013647954,0.0022371304,0.038566016,0.15269445,0.076790564,0.60896546,0.074768364,0.008881049],"about_ca_topic_score_codex":0.000005301726,"about_ca_topic_score_gemma":0.000008971617,"teacher_disagreement_score":0.1862626,"about_ca_system_score_codex":0.000018134233,"about_ca_system_score_gemma":0.0000070016326,"threshold_uncertainty_score":0.77469105},"labels":[],"label_agreement":null},{"id":"W2015241707","doi":"10.1016/j.disc.2009.08.020","title":"Quarter-regular biembeddings of Latin squares","year":2009,"lang":"es","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Australian Mathematical Sciences Institute","keywords":"Latin square; Mathematics; Combinatorics; Quarter (Canadian coin); Least-squares function approximation; Symmetry (geometry); Discrete mathematics; Statistics; Geometry; Geography","score_opus":0.00905420544041423,"score_gpt":0.22745417199221818,"score_spread":0.21839996655180394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015241707","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.9395383,0.0012818202,0.016102603,0.00022741803,0.00037251317,0.0005435546,0.00011584657,0.00029110428,0.041526813],"genre_scores_gemma":[0.9962213,0.00003525872,0.0032249242,0.000017258635,0.00010741365,0.0000071683758,0.00001723383,0.000050128245,0.0003193077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981604,0.000058355716,0.00082623033,0.00021714502,0.00034782567,0.00039004552],"domain_scores_gemma":[0.99878156,0.00013321626,0.00026334875,0.0006465223,0.000062359526,0.00011297036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038416043,0.0003732903,0.0006738812,0.00024279792,0.00006769136,0.000094880925,0.00034151145,0.00020233856,0.00010466802],"category_scores_gemma":[0.00005896893,0.00034191937,0.0002953674,0.0004339256,0.00008382713,0.00013927824,0.000024885137,0.00018595002,0.00012823992],"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.00001543068,0.00018027326,0.00023808234,0.0031784652,0.00019154791,0.000013129144,0.010425449,0.0014545907,0.027217513,0.9550708,0.0009006772,0.0011140322],"study_design_scores_gemma":[0.002812376,0.0019286616,0.0044142976,0.012262829,0.0011242973,0.000092542876,0.016792048,0.25452858,0.109544925,0.58157384,0.011461958,0.0034636527],"about_ca_topic_score_codex":0.0000033076176,"about_ca_topic_score_gemma":3.706247e-7,"teacher_disagreement_score":0.37349698,"about_ca_system_score_codex":0.000023640558,"about_ca_system_score_gemma":0.000011690448,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W2015250236","doi":"10.1117/12.473977","title":"Optical Code-Division Multiple Access: Challenges and Solutions","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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":"McGill University","funders":"","keywords":"Computer science; Turbo code; Coding (social sciences); Code division multiple access; Forward error correction; Focus (optics); Electronic engineering; Code (set theory); Computer engineering; Computer network; Decoding methods; Telecommunications; Optics","score_opus":0.023184735493126957,"score_gpt":0.23275643986517866,"score_spread":0.2095717043720517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015250236","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.9887176,0.0015279617,0.0001342017,0.00055623596,0.00036662567,0.00046128835,0.000035585108,0.00019638754,0.008004109],"genre_scores_gemma":[0.98078936,0.0009354431,0.017800143,0.000025180187,0.00016113005,0.0001516667,0.000003794378,0.00007270444,0.00006055202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998072,2.9082434e-8,0.00060885143,0.00035885596,0.00048227265,0.00047795684],"domain_scores_gemma":[0.99872345,0.00023970193,0.0001460459,0.0000702953,0.0006504558,0.00017004837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081692706,0.00034283174,0.00042641108,0.00011770055,0.00011529527,0.00012892729,0.0006781679,0.00023867411,0.0000091979155],"category_scores_gemma":[0.00059498457,0.00029727892,0.0004142134,0.00022526005,0.00023847667,0.0006830292,0.00013372219,0.00032886045,0.0000020125],"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.000022313621,0.00007532705,0.00024571316,0.0006988084,0.00032645738,9.136325e-8,0.00026553666,0.000471535,0.20117329,0.79528195,0.00085993914,0.0005790496],"study_design_scores_gemma":[0.0080259,0.0013089613,0.013527693,0.0028417986,0.00088950805,0.00023099163,0.013650194,0.30937424,0.54141283,0.051214915,0.05408506,0.0034378837],"about_ca_topic_score_codex":0.000001955048,"about_ca_topic_score_gemma":4.1045158e-7,"teacher_disagreement_score":0.744067,"about_ca_system_score_codex":0.0000855493,"about_ca_system_score_gemma":0.00001429961,"threshold_uncertainty_score":0.9999479},"labels":[],"label_agreement":null},{"id":"W2015733148","doi":"10.1016/j.disc.2011.09.007","title":"Spanning trees with specified differences in Cayley graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Fonds Québécois de la Recherche sur la Nature et les Technologies; Carleton University","keywords":"Mathematics; Combinatorics; Multiset; Cayley graph; Spanning tree; Discrete mathematics; Finite group; Graph; Group (periodic table)","score_opus":0.03176362460817492,"score_gpt":0.1924164574428819,"score_spread":0.160652832834707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015733148","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.93970793,0.00010872039,0.0044411384,0.000002141506,0.00008803087,0.00014403711,0.000004207011,0.0001713454,0.055332452],"genre_scores_gemma":[0.9969436,0.000013099159,0.0028761,0.0000028013721,0.00001470701,0.00002610418,0.0000021295625,0.00003080046,0.00009065396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927163,0.000019356497,0.00023925002,0.00011816124,0.00012512637,0.00022648445],"domain_scores_gemma":[0.99962693,0.00003988899,0.00002820923,0.00024252798,0.000010314456,0.00005213375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012749858,0.00017251795,0.00025896667,0.00011769139,0.000030159403,0.000024789293,0.00017167605,0.000052657815,0.00006449311],"category_scores_gemma":[0.0000066252705,0.00012430202,0.000045246114,0.00020875456,0.00005370245,0.00009011067,0.000013540704,0.00011449256,0.000021519534],"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.000100339355,0.00028680163,0.10832486,0.0015485279,0.0003910443,0.0002087508,0.13447854,0.00055778946,0.003221518,0.7488403,0.0001875767,0.0018539779],"study_design_scores_gemma":[0.0029659208,0.00073115755,0.31956506,0.004608266,0.00028454364,0.00020148035,0.08678181,0.07639006,0.033251595,0.47076488,0.00034025413,0.0041149827],"about_ca_topic_score_codex":0.000014094938,"about_ca_topic_score_gemma":0.00009702141,"teacher_disagreement_score":0.2780754,"about_ca_system_score_codex":0.000009688661,"about_ca_system_score_gemma":0.0000031766408,"threshold_uncertainty_score":0.5068889},"labels":[],"label_agreement":null},{"id":"W2015958023","doi":"10.1016/s0012-365x(03)00260-7","title":"Balanced incomplete block designs with block size 9: part II","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"Block (permutation group theory); Mathematics; Combinatorics; Block size; Discrete mathematics; Computer science","score_opus":0.01522455422241352,"score_gpt":0.2042299911895437,"score_spread":0.18900543696713018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015958023","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.911621,0.00020333641,0.007772265,0.000027853324,0.00033449597,0.00056407455,0.000032070202,0.0006628445,0.0787821],"genre_scores_gemma":[0.99170715,0.000009377882,0.007219471,0.000027133166,0.000046204754,0.000055773853,0.0000033690844,0.00007128914,0.0008602068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988462,0.00005037701,0.00033941818,0.000174606,0.00021877598,0.00037063393],"domain_scores_gemma":[0.99915624,0.000154955,0.00006709501,0.00047193601,0.00003254471,0.00011724701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026119128,0.0002743788,0.00035280178,0.000041167972,0.00015126013,0.000044072724,0.00018365146,0.00008063035,0.00010296312],"category_scores_gemma":[0.00006135713,0.00021544885,0.000081997445,0.00023076317,0.000056917455,0.00007355772,0.000019956859,0.00014613861,0.00007420564],"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.000087081935,0.0006128238,0.002092266,0.004801103,0.0018055419,0.00018809893,0.024270263,0.058389254,0.043412033,0.85024405,0.013842327,0.00025517322],"study_design_scores_gemma":[0.014545116,0.002813158,0.0011529102,0.006401611,0.0017038222,0.0028212522,0.020843036,0.15474956,0.19725308,0.30925328,0.27627996,0.01218322],"about_ca_topic_score_codex":8.777721e-7,"about_ca_topic_score_gemma":0.000004351514,"teacher_disagreement_score":0.54099077,"about_ca_system_score_codex":0.000023882192,"about_ca_system_score_gemma":0.0000128173015,"threshold_uncertainty_score":0.8785749},"labels":[],"label_agreement":null},{"id":"W2016554949","doi":"10.1016/j.disc.2010.07.023","title":"Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"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; Combinatorics; Discrete mathematics","score_opus":0.005441214389066695,"score_gpt":0.20432793689826478,"score_spread":0.1988867225091981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016554949","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.9969043,0.00046167214,0.00008131092,0.000010419006,0.00006564274,0.00011844428,0.000028369257,0.000009138635,0.002320706],"genre_scores_gemma":[0.9986195,0.00005577049,0.0012453985,0.0000016728924,0.000008187841,0.000003398414,7.309628e-7,0.000012758529,0.000052561434],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949414,0.000013232725,0.0002547903,0.00006410961,0.00009789231,0.00007586636],"domain_scores_gemma":[0.99958754,0.000063019135,0.00009044345,0.00021154473,0.000020834219,0.000026635658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020834697,0.000091117494,0.00021814174,0.00003752037,0.00002548424,0.000009174538,0.00007875037,0.00004351462,0.000011242844],"category_scores_gemma":[0.00002828193,0.000061949824,0.000030250518,0.00007128085,0.00019075589,0.000036592563,0.0000491354,0.00007463221,1.6328309e-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.000012485876,0.000073015304,0.015698658,0.0062977117,0.00022863728,6.781834e-7,0.016911676,0.000022679571,0.75179195,0.20712537,0.00005050369,0.0017866339],"study_design_scores_gemma":[0.006012286,0.00036624665,0.11083134,0.0036157942,0.0010178738,0.000218531,0.026348306,0.03548916,0.49995348,0.31318688,0.0014061857,0.0015539088],"about_ca_topic_score_codex":0.0000124158605,"about_ca_topic_score_gemma":0.0000235856,"teacher_disagreement_score":0.25183848,"about_ca_system_score_codex":0.0000012956915,"about_ca_system_score_gemma":0.0000031044701,"threshold_uncertainty_score":0.25262403},"labels":[],"label_agreement":null},{"id":"W2016752999","doi":"10.1016/j.jspi.2010.02.020","title":"Super-simple group divisible designs with block size 4 and index 2","year":2010,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Simple (philosophy); Group (periodic table); Combinatorics; Simple group; Block (permutation group theory); Index (typography); Block size; Discrete mathematics; Statistics; Computer science","score_opus":0.012164873528249773,"score_gpt":0.2418372042234312,"score_spread":0.22967233069518142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016752999","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.8999424,0.00014054438,0.09921613,0.0000086427735,0.000100970115,0.000029594372,0.000013925091,0.000018547853,0.00052926625],"genre_scores_gemma":[0.99666667,0.000016070506,0.0032273356,0.000014919378,0.00005676138,9.656677e-7,8.836976e-7,0.000009216588,0.0000071647028],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99941933,0.00002270897,0.00021172942,0.00007114898,0.00012418035,0.00015092286],"domain_scores_gemma":[0.9989464,0.0007447526,0.00004431632,0.000056371886,0.000041337724,0.00016680038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024232277,0.00010222536,0.00019423403,0.000048098227,0.00006423431,0.000077094686,0.00006097273,0.000057977195,0.000029533552],"category_scores_gemma":[0.00017821028,0.00007295393,0.000010803919,0.00005723384,0.000096494565,0.00014623176,0.000011558067,0.0004122,8.9384304e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000444918,0.00011918405,0.8162769,0.0005715198,0.00031324202,0.000648664,0.0033796672,0.003221339,0.05303038,0.10640712,0.0021170734,0.0134699745],"study_design_scores_gemma":[0.002287794,0.0018794342,0.9178554,0.0005827313,0.00012478897,0.0020802934,0.0012023313,0.023213789,0.0007668155,0.046357784,0.002913692,0.0007351908],"about_ca_topic_score_codex":0.0000066962684,"about_ca_topic_score_gemma":0.0000052589717,"teacher_disagreement_score":0.10157844,"about_ca_system_score_codex":0.0000034932084,"about_ca_system_score_gemma":0.000012346917,"threshold_uncertainty_score":0.2974975},"labels":[],"label_agreement":null},{"id":"W2016962604","doi":"10.1016/j.jcta.2008.06.010","title":"Linear spaces with small generated subspaces","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear subspace; Mathematics; Computer science; Pure mathematics","score_opus":0.011310246464176856,"score_gpt":0.18218775532860096,"score_spread":0.1708775088644241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016962604","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.9910062,0.0011603506,0.0007879532,0.000039486993,0.004338153,0.00008840389,0.0000025731779,0.00009669782,0.0024801749],"genre_scores_gemma":[0.9979586,0.00023914278,0.000489012,0.000011640024,0.00090698793,0.0000029435598,9.803407e-7,0.000040289553,0.00035041576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890554,0.0001777853,0.00037186913,0.00008405692,0.00023352781,0.00022721059],"domain_scores_gemma":[0.9991811,0.000102082246,0.0001828242,0.00017182749,0.00023082446,0.00013133172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058565295,0.00020460569,0.0003953602,0.00013214383,0.00013691696,0.000039576906,0.00024245508,0.000099400764,0.000056369176],"category_scores_gemma":[0.0000448663,0.00014888722,0.000110370835,0.00028200375,0.00016109164,0.00033322992,0.00001414435,0.00028950028,0.000007549098],"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.008067662,0.00033381765,0.0030296468,0.00032213848,0.0018009008,0.001840356,0.00886267,0.019551424,0.030960403,0.9210479,0.003282946,0.0009001177],"study_design_scores_gemma":[0.014698617,0.008451073,0.001258674,0.0010892979,0.00047728838,0.014159198,0.008695473,0.00064170477,0.32051647,0.3973004,0.23011468,0.0025971448],"about_ca_topic_score_codex":0.0000018480915,"about_ca_topic_score_gemma":0.0000023869402,"teacher_disagreement_score":0.52374756,"about_ca_system_score_codex":0.00002921044,"about_ca_system_score_gemma":0.000057308822,"threshold_uncertainty_score":0.6071445},"labels":[],"label_agreement":null},{"id":"W2017220809","doi":"10.1007/s10623-014-9977-x","title":"Diagonally cyclic equitable rectangles","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Rectangle; Diagonal; Mathematics; Constructive proof; Row; Diagonally dominant matrix; Embedding; Geometry; Pure mathematics; Computer science; Invertible matrix","score_opus":0.010308050751546586,"score_gpt":0.1910353581056382,"score_spread":0.18072730735409162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017220809","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.8116247,0.003615881,0.13110727,0.000027669474,0.00043706878,0.00022564571,0.000022908016,0.00074081094,0.052198026],"genre_scores_gemma":[0.9982713,0.0002677584,0.0012108644,0.00006345255,0.0000903711,0.000038674836,0.000008581378,0.00002993581,0.000019078912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991312,0.00007264728,0.00017226048,0.00017581267,0.0001065329,0.00034153168],"domain_scores_gemma":[0.99952793,0.00011927213,0.000022057933,0.00019882339,0.00001913713,0.00011279715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035308962,0.0001746627,0.00020738822,0.00016085818,0.0001387619,0.00007958564,0.000122213,0.00008190529,0.000032754604],"category_scores_gemma":[0.000008033478,0.00015960845,0.000100947254,0.00029417354,0.000071680995,0.00010019998,0.000017838824,0.0000961768,0.000017558368],"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.00004868392,0.00010388371,0.03048252,0.00040158172,0.00036618602,0.00001136598,0.0009359373,0.0010561482,0.08198837,0.81664515,0.007928345,0.060031846],"study_design_scores_gemma":[0.0037508316,0.001139023,0.040597856,0.0006142654,0.00029033018,0.00021269653,0.0014484557,0.02353408,0.027223846,0.52198374,0.37542492,0.00377996],"about_ca_topic_score_codex":0.000006507665,"about_ca_topic_score_gemma":0.000011048801,"teacher_disagreement_score":0.36749658,"about_ca_system_score_codex":0.000004740635,"about_ca_system_score_gemma":0.000002947384,"threshold_uncertainty_score":0.65086436},"labels":[],"label_agreement":null},{"id":"W2018081095","doi":"10.1006/eujc.1999.0318","title":"Subpolytopes of Cyclic Polytopes","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Polytope model; Combinatorial analysis; Combinatorial proof","score_opus":0.004005648358442802,"score_gpt":0.15832502605755522,"score_spread":0.15431937769911241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018081095","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.9122675,0.0021685981,0.00025781916,0.000019633486,0.0007389233,0.000031303178,0.0000019559127,0.000038487608,0.084475785],"genre_scores_gemma":[0.99895626,0.00034620715,0.00003971734,0.000013287085,0.000106521205,1.3266444e-7,3.2269196e-7,0.000035476547,0.00050208636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885505,0.00020996715,0.00053207204,0.000051898627,0.00020175302,0.00014923682],"domain_scores_gemma":[0.9994951,0.000043091237,0.0001279468,0.00016891476,0.000068683206,0.00009627374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624411,0.000118008466,0.0002559338,0.000120593075,0.00003081222,0.000019308194,0.0003303546,0.000020008249,0.00016636921],"category_scores_gemma":[0.000016887063,0.00010349721,0.00013594356,0.00023935066,0.00003807833,0.0001352873,0.000009937694,0.00019930798,0.00006518289],"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.0008379416,0.0018489169,0.03003158,0.0016578317,0.0023786651,0.0039289505,0.013047615,0.045506977,0.10567798,0.31711623,0.05724865,0.42071867],"study_design_scores_gemma":[0.008046362,0.0029540067,0.083171986,0.0013832335,0.00034505627,0.0020686213,0.0010017529,0.00086252164,0.09034984,0.029128524,0.7788894,0.0017986567],"about_ca_topic_score_codex":4.918736e-7,"about_ca_topic_score_gemma":8.399358e-8,"teacher_disagreement_score":0.72164077,"about_ca_system_score_codex":0.000015140402,"about_ca_system_score_gemma":0.000008656144,"threshold_uncertainty_score":0.42204937},"labels":[],"label_agreement":null},{"id":"W2018135193","doi":"10.1016/j.jcta.2005.07.013","title":"Further explorations into ternary complementary pairs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Ternary operation; Equivalence (formal languages); Product (mathematics); Computer science; Combinatorics; Mathematics; Discrete mathematics; Geometry","score_opus":0.0062114698178719506,"score_gpt":0.19757699805860948,"score_spread":0.19136552824073752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018135193","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.9623757,0.0016635744,0.0049992753,0.00037470332,0.01803018,0.00023236852,0.000014431642,0.00019850566,0.012111239],"genre_scores_gemma":[0.99816966,0.000026586742,0.00027602277,0.000020723282,0.0013424442,0.0000063549614,0.0000055575383,0.00003261857,0.00012003166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998771,0.00018838211,0.00056383444,0.000069946385,0.0002277185,0.00017909128],"domain_scores_gemma":[0.99940574,0.00010203674,0.0001558504,0.00016939256,0.000098588374,0.00006837116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068667287,0.00016259233,0.0002764963,0.00013107766,0.00010695463,0.000055657012,0.0002453779,0.000060790786,0.0002469291],"category_scores_gemma":[0.000014639659,0.0001435226,0.0001589456,0.00015926512,0.000079236714,0.000576401,0.000024098745,0.0002021082,0.000014176421],"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.00041578925,0.00012357716,0.0006586798,0.000057218054,0.00020876783,0.00007354041,0.0018870663,0.0024614308,0.0069671907,0.9775002,0.008901027,0.0007455229],"study_design_scores_gemma":[0.00095814787,0.00027775852,0.00019887494,0.000057264067,0.000039150164,0.00010379314,0.0027381638,0.000042336425,0.003879629,0.937511,0.05400608,0.00018776901],"about_ca_topic_score_codex":0.000008807755,"about_ca_topic_score_gemma":0.000006166276,"teacher_disagreement_score":0.045105055,"about_ca_system_score_codex":0.00005854371,"about_ca_system_score_gemma":0.000020702066,"threshold_uncertainty_score":0.58526814},"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":"W2020769553","doi":"10.1007/bf02942045","title":"When is an L(B, m, n, r, s, t, z, w) loop SRAR?","year":2005,"lang":"de","type":"article","venue":"Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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","funders":"","keywords":"Commutator; Loop (graph theory); Identity (music); Combinatorics; Mathematics; Field (mathematics); Physics; Pure mathematics; Algebra over a field","score_opus":0.013873792670867422,"score_gpt":0.21101381227086527,"score_spread":0.19714001959999786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020769553","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.68095183,0.19318572,0.03945055,0.0023237616,0.0043295957,0.0035938318,0.0006644206,0.002856885,0.072643384],"genre_scores_gemma":[0.9189094,0.0022115218,0.014559873,0.00081911415,0.0025674228,0.00004908164,0.00023625258,0.00057551626,0.06007185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99528706,0.0003294353,0.0009843083,0.0011796225,0.00078566966,0.0014339247],"domain_scores_gemma":[0.9964766,0.00023034091,0.00038658586,0.0018009905,0.00021190626,0.00089357514],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008632789,0.0011905305,0.0012059518,0.0005702756,0.00058931083,0.0003375527,0.0013885583,0.0009163207,0.005461377],"category_scores_gemma":[0.00002751058,0.0013416508,0.0005334192,0.0006347996,0.00024723532,0.0032618553,0.00030929045,0.0008437728,0.0068077906],"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.00064979325,0.0024336367,0.0012173627,0.0039763213,0.018591946,0.0021267147,0.26454893,0.0023766684,0.017958399,0.082471855,0.5395086,0.064139806],"study_design_scores_gemma":[0.0037569401,0.00056437915,0.00008441488,0.0018255776,0.005944387,0.00043427813,0.008145029,0.035238877,0.022081703,0.016640604,0.9014344,0.0038493646],"about_ca_topic_score_codex":0.00008895359,"about_ca_topic_score_gemma":0.000040723895,"teacher_disagreement_score":0.36192587,"about_ca_system_score_codex":0.00045563607,"about_ca_system_score_gemma":0.00012253296,"threshold_uncertainty_score":0.99890333},"labels":[],"label_agreement":null},{"id":"W2023526333","doi":"10.4153/cmb-2005-022-4","title":"Counting Multiple Cyclic Choices Without Adjacencies","year":2005,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":true,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Class (philosophy); Line (geometry); Geometry; Mathematical analysis; Artificial intelligence","score_opus":0.007979171966908664,"score_gpt":0.18238485461788131,"score_spread":0.17440568265097264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023526333","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.8594226,0.0006547468,0.0010100476,0.00074783777,0.00019405414,0.00030357146,0.000022504793,0.0004373912,0.13720724],"genre_scores_gemma":[0.9965708,0.000004890118,0.00093224767,0.0002656694,0.00020963364,0.000037414826,0.000003968017,0.000042414635,0.0019329455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989465,0.000026059888,0.00026731793,0.00014843344,0.00013333939,0.00047834174],"domain_scores_gemma":[0.99918205,0.00013965706,0.000023572642,0.00023684851,0.000023547036,0.00039435332],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026558727,0.00017524662,0.0002245208,0.00010767042,0.00012713714,0.00007465488,0.0002028481,0.00010071188,0.0049524354],"category_scores_gemma":[0.00015105617,0.00016736948,0.00006650439,0.000105708576,0.000063209554,0.000049775397,0.00000935982,0.00016380957,0.01371053],"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.000048196518,0.0003499108,0.031911038,0.005853998,0.0009767956,0.00027784824,0.018875845,0.022315195,0.017554538,0.5055899,0.3557411,0.040505603],"study_design_scores_gemma":[0.0003108943,0.000011064581,0.00045815663,0.00019513632,0.000021844618,0.000045403234,0.0005224686,0.020430671,0.0010766389,0.0020318632,0.97444034,0.00045550446],"about_ca_topic_score_codex":0.00034647374,"about_ca_topic_score_gemma":0.004689196,"teacher_disagreement_score":0.61869925,"about_ca_system_score_codex":0.00010480432,"about_ca_system_score_gemma":0.000024953026,"threshold_uncertainty_score":0.9959572},"labels":[],"label_agreement":null},{"id":"W2023583314","doi":"10.1016/s0024-3795(99)00249-9","title":"On almost regular tournament matrices","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Tournament; Mathematics; Class (philosophy); Matrix (chemical analysis); Order (exchange); Combinatorics; Value (mathematics); Pure mathematics; Discrete mathematics; Statistics; Computer science","score_opus":0.004672671609693921,"score_gpt":0.19729245957382446,"score_spread":0.19261978796413054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023583314","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.96191317,0.0029862206,0.0012078093,0.00020648153,0.000061755956,0.00048296552,0.00003182973,0.00032587873,0.032783914],"genre_scores_gemma":[0.9973534,0.00059260527,0.00010964491,0.00008323878,0.00013326596,0.0001400223,0.0000134513075,0.000017409764,0.0015569825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956214,0.00000989016,0.000127153,0.00011738647,0.00006834918,0.000115082046],"domain_scores_gemma":[0.9997153,0.000029097182,0.000011880552,0.00016613839,0.000010444727,0.00006711116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053321044,0.00008814678,0.00008308293,0.000037134836,0.0001033094,0.000023042616,0.00008106567,0.00004423658,0.00041280786],"category_scores_gemma":[0.0000014095817,0.00008012598,0.000027104217,0.00014462626,0.00001216333,0.000047786893,0.0000049192618,0.00007237506,0.00050224893],"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.000035292727,0.0001811736,0.00005822213,0.0002217402,0.00014174139,0.0000044473363,0.00074151915,0.008220081,0.0061735907,0.85237205,0.007952753,0.12389736],"study_design_scores_gemma":[0.00048533446,0.00011157934,0.0005045486,0.00006820512,0.00005293024,0.000033748784,0.00014406972,0.024636589,0.008145851,0.02827795,0.9370584,0.0004807979],"about_ca_topic_score_codex":0.0000011649053,"about_ca_topic_score_gemma":5.425649e-7,"teacher_disagreement_score":0.92910564,"about_ca_system_score_codex":0.0000074791437,"about_ca_system_score_gemma":0.000002317492,"threshold_uncertainty_score":0.64555615},"labels":[],"label_agreement":null},{"id":"W2023982328","doi":"10.1117/12.473981","title":"2D wavelength-time codes for optical code-division multiple access with differential detection","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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":"McGill University","funders":"","keywords":"Antipodal point; Computer science; Bit error rate; Code division multiple access; Coding gain; Coding (social sciences); Electronic engineering; Differential (mechanical device); Code (set theory); Algorithm; Computer network; Mathematics; Decoding methods; Engineering","score_opus":0.010073287001929384,"score_gpt":0.2171105528212115,"score_spread":0.2070372658192821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023982328","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.99412173,0.000052604093,0.0026334582,0.00011847441,0.00043521813,0.0009790498,0.00008773209,0.000244396,0.0013273376],"genre_scores_gemma":[0.9746551,0.000029292429,0.02444281,0.000016061897,0.000263763,0.00036065673,0.0000129263135,0.000112708476,0.00010667669],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99774843,3.8445183e-8,0.00069529784,0.0004255203,0.0005999907,0.00053071836],"domain_scores_gemma":[0.9981803,0.00030770258,0.00021949665,0.000078546625,0.0010492797,0.00016466036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005815523,0.00044229295,0.00054964254,0.00013254024,0.0001435328,0.00020729114,0.00077750493,0.00027602422,0.000016746053],"category_scores_gemma":[0.00046733493,0.00035431804,0.0005895975,0.00031890572,0.00019490324,0.00066599756,0.00007584116,0.00032988988,0.000002254837],"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.00022786678,0.00013461181,0.000305478,0.0009523732,0.00067556335,9.516237e-8,0.00015384071,0.0013440998,0.76577425,0.2292122,0.0005743585,0.00064524345],"study_design_scores_gemma":[0.002629017,0.0005763537,0.0007244946,0.00044210657,0.00027034347,0.000030086838,0.0006622374,0.26193175,0.727575,0.001829883,0.0026424483,0.00068626716],"about_ca_topic_score_codex":0.0000033151496,"about_ca_topic_score_gemma":5.9712335e-7,"teacher_disagreement_score":0.26058763,"about_ca_system_score_codex":0.00014284252,"about_ca_system_score_gemma":0.000018530078,"threshold_uncertainty_score":0.99989086},"labels":[],"label_agreement":null},{"id":"W2024021998","doi":"10.1016/j.jctb.2005.03.005","title":"Covering arrays on graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"University of Alberta","keywords":"Combinatorics; Clique number; Mathematics; Clique; Homomorphism; Graph; Discrete mathematics; Row; Extension (predicate logic); Computer science","score_opus":0.005227173648065162,"score_gpt":0.1918191603417305,"score_spread":0.18659198669366533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024021998","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.93836707,0.00073379505,0.00092446466,0.00009440756,0.017689038,0.000113166054,0.000004618231,0.00015228301,0.04192116],"genre_scores_gemma":[0.9983809,0.00008337586,0.000097737575,0.000039657727,0.0012044159,0.0000021502556,4.347652e-7,0.000032822583,0.00015850997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886066,0.00012656981,0.00045935134,0.00007300874,0.00026561692,0.00021479507],"domain_scores_gemma":[0.9993256,0.0001467144,0.00014460976,0.00018782995,0.00007995499,0.000115292176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893791,0.00017796707,0.0003184603,0.00016781353,0.00008118482,0.00005233987,0.00026674473,0.00009312072,0.00012549292],"category_scores_gemma":[0.00006442182,0.00015449815,0.00019777342,0.00017125082,0.000059842765,0.00047100039,0.0000131876,0.000337965,0.00003073497],"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.0005456658,0.000051419836,0.00003361748,0.000026964322,0.00012813653,0.00002113569,0.000491994,0.008096062,0.004504906,0.98283863,0.0012753371,0.0019861073],"study_design_scores_gemma":[0.0014740198,0.00065444846,0.000077094686,0.00015353633,0.0000388557,0.00019622431,0.00045833847,0.000056073062,0.042983044,0.81171775,0.14188588,0.00030472144],"about_ca_topic_score_codex":1.8637472e-7,"about_ca_topic_score_gemma":2.7774703e-7,"teacher_disagreement_score":0.1711209,"about_ca_system_score_codex":0.00006166517,"about_ca_system_score_gemma":0.000016977447,"threshold_uncertainty_score":0.63002515},"labels":[],"label_agreement":null},{"id":"W2024144406","doi":"10.1007/s10623-007-9163-5","title":"Williamson matrices up to order 59","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"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":"Class (philosophy); Order (exchange); Mathematics; Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Economics","score_opus":0.01850153224551272,"score_gpt":0.2070204207014444,"score_spread":0.1885188884559317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024144406","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.9231137,0.0026831746,0.06893977,0.000022895041,0.00039931576,0.00023945165,0.00001611291,0.0003995588,0.0041860123],"genre_scores_gemma":[0.996064,0.0008262701,0.0027929647,0.000089240806,0.00007126054,0.00004395957,0.000004481099,0.000030370522,0.00007744523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991879,0.000037383306,0.00017678563,0.00019122749,0.0001282902,0.00027845026],"domain_scores_gemma":[0.9995556,0.000043161683,0.000018377685,0.00018704278,0.000038067872,0.00015778758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012571106,0.0001876194,0.00020455124,0.0002584234,0.00017357999,0.000041960786,0.00012099055,0.00007864121,0.000055105094],"category_scores_gemma":[0.0000047767903,0.00017041386,0.00008211546,0.0007919489,0.00005962786,0.00010330949,0.000014518065,0.00008843743,0.000038593367],"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.0006538176,0.00044786633,0.17486858,0.002186028,0.0023440477,0.00048384463,0.039467275,0.01991264,0.18149659,0.3348588,0.17865005,0.06463046],"study_design_scores_gemma":[0.00581209,0.002042253,0.10719208,0.00090288225,0.00044849992,0.0011228629,0.00755917,0.011312426,0.03907305,0.04950331,0.7678251,0.0072062435],"about_ca_topic_score_codex":0.00001529611,"about_ca_topic_score_gemma":0.000007688201,"teacher_disagreement_score":0.5891751,"about_ca_system_score_codex":0.000004638255,"about_ca_system_score_gemma":0.0000044866856,"threshold_uncertainty_score":0.6949276},"labels":[],"label_agreement":null},{"id":"W2024356427","doi":"10.1023/b:desi.0000029217.97956.26","title":"The Lovász Local Lemma and Its Applications to some Combinatorial Arrays","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Lemma (botany); Probabilistic logic; Set (abstract data type); Hash function; Cover (algebra); Discrete mathematics; Mathematics; Combinatorics; Computer science; Theoretical computer science","score_opus":0.012036355856310578,"score_gpt":0.21135189421678455,"score_spread":0.19931553836047397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024356427","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.3713419,0.010041061,0.61407644,0.00029458143,0.00074786064,0.0012329617,0.000041247502,0.00044192432,0.001781985],"genre_scores_gemma":[0.998935,0.0004206399,0.00024717566,0.0000571849,0.00012168753,0.00019081282,0.0000030139522,0.000020592941,0.000003895406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928504,0.000028663175,0.0001630951,0.00017333867,0.00010491249,0.00024497107],"domain_scores_gemma":[0.99954265,0.000086347274,0.000018098754,0.00017141136,0.000027752081,0.000153715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018765226,0.000154485,0.00014395581,0.0000924764,0.00033968757,0.00010931145,0.0001287912,0.0000709345,0.0000022563506],"category_scores_gemma":[0.0000039462934,0.000121380246,0.000058066853,0.00030748453,0.000103497216,0.000087528504,0.000019968089,0.000106413056,0.000012274039],"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.000017620217,0.000019061976,0.00006428486,0.00003922073,0.000055875225,0.000001608938,0.0002838617,0.0013189445,0.004648384,0.98947173,0.00015682216,0.003922558],"study_design_scores_gemma":[0.002076022,0.00039910286,0.0011404486,0.00011252187,0.000097076976,0.000051075476,0.0016297614,0.0012997211,0.015959887,0.8628809,0.11341878,0.0009347469],"about_ca_topic_score_codex":0.00000699028,"about_ca_topic_score_gemma":0.000008651508,"teacher_disagreement_score":0.6275931,"about_ca_system_score_codex":0.000008985182,"about_ca_system_score_gemma":0.0000068261143,"threshold_uncertainty_score":0.4949743},"labels":[],"label_agreement":null},{"id":"W2024505149","doi":"10.1016/j.disc.2005.10.020","title":"On the orthogonal Latin squares polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Conjecture; Facet (psychology); Intersection (aeronautics); Rank (graph theory); Dimension (graph theory); Birkhoff polytope; Latin square; Class (philosophy); Euler's formula; Graph; Orthogonal array; Discrete mathematics; Statistics; Regular polygon; Computer science","score_opus":0.008075326840339818,"score_gpt":0.1871578789515727,"score_spread":0.1790825521112329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024505149","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.8362873,0.00010279561,0.005116156,0.00010633063,0.00017028657,0.00018518398,0.000023801595,0.0002490166,0.15775912],"genre_scores_gemma":[0.9986966,0.0000014884981,0.0002532718,0.000032927284,0.00008288546,0.000022970306,0.000007727062,0.000029806182,0.0008722756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999357,0.000023903474,0.00020639348,0.00007636169,0.00016308928,0.00017327203],"domain_scores_gemma":[0.9994522,0.00020481308,0.000031003183,0.00027791673,0.000010383806,0.000023733664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017487843,0.0001328586,0.00012709602,0.000045335444,0.00008078166,0.000047618534,0.00015628032,0.000043472213,0.0001825682],"category_scores_gemma":[0.000020176578,0.00008203559,0.000077588214,0.0001434797,0.00003598053,0.00003118876,0.000013079418,0.00010620636,0.0002066854],"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.0000016611806,0.000015528198,0.00007367561,0.00006673549,0.000016063634,0.0000026382943,0.00031112498,0.00238793,0.00062576996,0.99341905,0.003014108,0.00006573244],"study_design_scores_gemma":[0.00034839436,0.00006535628,0.0014981094,0.0003003133,0.000046493056,0.000019699968,0.0014240482,0.078038044,0.0075262836,0.90387666,0.0062500816,0.0006065085],"about_ca_topic_score_codex":0.000002852559,"about_ca_topic_score_gemma":0.0000065843287,"teacher_disagreement_score":0.16240934,"about_ca_system_score_codex":0.000009734705,"about_ca_system_score_gemma":0.0000029601072,"threshold_uncertainty_score":0.33453143},"labels":[],"label_agreement":null},{"id":"W2024890934","doi":"10.1016/s0012-365x(01)00099-1","title":"On decomposing Kn−I into cycles of a fixed odd length","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Range (aeronautics); Discrete mathematics","score_opus":0.012571420230017167,"score_gpt":0.21364196119860224,"score_spread":0.20107054096858507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024890934","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.9565932,0.0003377566,0.008595542,0.000017729093,0.00018019925,0.00015917314,0.000008338868,0.00020599474,0.033902064],"genre_scores_gemma":[0.99673754,0.000019783947,0.0030631977,0.0000072905264,0.000025971918,0.000009098374,0.0000021562869,0.0000360642,0.00009891717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999266,0.000023412651,0.00030822048,0.00009286824,0.00014757688,0.00016189204],"domain_scores_gemma":[0.9994359,0.00014782598,0.000057015182,0.00029625103,0.000014612927,0.00004838245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012923394,0.00014861125,0.0002470075,0.00008096758,0.000045803594,0.000021200358,0.00015010894,0.000059685604,0.00012280646],"category_scores_gemma":[0.000033520126,0.00012910133,0.00009495782,0.00012017072,0.000038344246,0.000057429457,0.000016900149,0.000090183785,0.00009749739],"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.000024559084,0.00048226418,0.00020872043,0.0059544393,0.00056733884,0.000028803086,0.060192928,0.02981297,0.06757921,0.8216905,0.0043142345,0.009144019],"study_design_scores_gemma":[0.00094350067,0.00020818967,0.00011782774,0.0017132801,0.000117549236,0.00003458072,0.0035142885,0.7791804,0.061355546,0.15056404,0.0013251073,0.00092569675],"about_ca_topic_score_codex":0.0000018637384,"about_ca_topic_score_gemma":0.000001960517,"teacher_disagreement_score":0.7493674,"about_ca_system_score_codex":0.000017163407,"about_ca_system_score_gemma":0.000001165413,"threshold_uncertainty_score":0.52645993},"labels":[],"label_agreement":null},{"id":"W2025239200","doi":"10.3390/sym5010047","title":"A Note on Lower Bounds for Colourful Simplicial Depth","year":2013,"lang":"en","type":"article","venue":"Symmetry","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":"Simon Fraser University; McMaster University","funders":"Universidad de Cantabria; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Combinatorics; Convex hull; Mathematics; Dimension (graph theory); Upper and lower bounds; Regular polygon; Simplicial complex; Point (geometry); Set (abstract data type); Computer science; Geometry; Mathematical analysis","score_opus":0.007351167647369117,"score_gpt":0.22239524360638582,"score_spread":0.2150440759590167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025239200","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.9395057,0.00007987081,0.0044930186,0.00007283557,0.0020433262,0.00052078394,0.000018175535,0.00031979935,0.052946474],"genre_scores_gemma":[0.99871063,0.0000014165216,0.00016450287,0.00019533167,0.00030575122,0.000116624986,0.0000054639086,0.000036444137,0.00046382935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993676,0.000014513996,0.0001424792,0.00012551191,0.00008517452,0.0002647041],"domain_scores_gemma":[0.99958587,0.0001050546,0.00001744534,0.00019487027,0.000025801415,0.00007094162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105037005,0.00012584546,0.00014452066,0.00007716469,0.00006395745,0.000047158155,0.000116615476,0.00010728682,0.00008707045],"category_scores_gemma":[0.000028171577,0.0001161552,0.000096200565,0.00013498402,0.000019040523,0.000069950875,0.000009441736,0.00010068491,0.00052945944],"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.00035745546,0.0004782663,0.0042076726,0.0011094725,0.0006076751,0.000026841528,0.0016770213,0.0039677825,0.07113039,0.41221723,0.34469178,0.15952843],"study_design_scores_gemma":[0.005179269,0.002070136,0.031950332,0.00035637207,0.0001532959,0.000047222835,0.00088099675,0.053216867,0.05715537,0.16454063,0.68152183,0.0029276724],"about_ca_topic_score_codex":0.000015304036,"about_ca_topic_score_gemma":0.000014333166,"teacher_disagreement_score":0.33683005,"about_ca_system_score_codex":0.00003445727,"about_ca_system_score_gemma":0.0000065407035,"threshold_uncertainty_score":0.68053067},"labels":[],"label_agreement":null},{"id":"W2026705184","doi":"10.1016/s0378-3758(99)00127-5","title":"V(m,t)'s for m=4,5,6","year":2000,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Idempotence; Pairwise comparison; Exponential function; Order (exchange); Latin square; Statistics; Discrete mathematics; Mathematical analysis","score_opus":0.01433589322004353,"score_gpt":0.2656529265657278,"score_spread":0.2513170333456843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026705184","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.52762574,0.0011271975,0.46207768,0.000027850474,0.00028498407,0.00006108128,0.0000527342,0.00003475667,0.0087080095],"genre_scores_gemma":[0.99610025,0.000037744896,0.0037029418,0.000019285042,0.00006953083,0.000001069984,0.0000011516248,0.0000049008245,0.000063124106],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961764,0.000010300899,0.00018917499,0.00003322818,0.00005726974,0.000092418246],"domain_scores_gemma":[0.9995509,0.00030207372,0.000021915837,0.000028035294,0.000026232156,0.00007088876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014803025,0.00005203998,0.00012490577,0.00002919185,0.000029924398,0.000025152955,0.00004281298,0.000027437714,0.00009817567],"category_scores_gemma":[0.00005718963,0.000041294665,0.000017252527,0.00002626696,0.000028208085,0.00007393479,0.000001493373,0.000093363495,0.0000034709362],"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.0006565724,0.000095591786,0.01229288,0.0008880244,0.00033665256,0.00020625729,0.0033487023,0.045166526,0.0034777615,0.29294416,0.047398802,0.5931881],"study_design_scores_gemma":[0.004827144,0.003272512,0.091362976,0.0020165986,0.00028171836,0.001288291,0.0012555879,0.21654487,0.0015058315,0.40979326,0.26644886,0.0014023426],"about_ca_topic_score_codex":4.996336e-7,"about_ca_topic_score_gemma":6.490989e-8,"teacher_disagreement_score":0.5917857,"about_ca_system_score_codex":0.0000040664722,"about_ca_system_score_gemma":0.0000062013423,"threshold_uncertainty_score":0.16839476},"labels":[],"label_agreement":null},{"id":"W2026972341","doi":"10.5539/jmr.v4n6p43","title":"Generalization of Transitive Cayley Digraphs","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Cayley graph; Mathematics; Generalization; Combinatorics; Vertex-transitive graph; Transitive reduction; Algebraic properties; Algebraic number; Cayley's theorem; Graph; Discrete mathematics; Voltage graph; Line graph","score_opus":0.0662730890371379,"score_gpt":0.33487419478440456,"score_spread":0.26860110574726664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026972341","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.9695849,0.0012681512,0.023638712,0.000017299199,0.00022598403,0.00009939324,0.0000044157237,0.000010683673,0.005150482],"genre_scores_gemma":[0.9982783,0.00012304127,0.0014050493,0.0000012742398,0.000120761586,0.0000018548591,5.403715e-7,0.000015879918,0.000053282292],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873364,0.00012085815,0.00040113775,0.000025890518,0.00050672644,0.00021176491],"domain_scores_gemma":[0.99923927,0.00018978475,0.00008007771,0.000111616224,0.00028299825,0.0000962734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027212137,0.00006036743,0.00019713904,0.0003232679,0.00003132285,0.000012510943,0.00014508714,0.00005280104,0.00004535803],"category_scores_gemma":[0.0000763929,0.000047394435,0.000092634014,0.00029918377,0.000049646194,0.00017053106,0.000008213201,0.00022034836,0.000008397212],"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.00008409058,0.0013804487,0.005482331,0.005153786,0.0010315634,0.00003287649,0.09441214,0.01128993,0.5937598,0.27474168,0.008860421,0.0037709386],"study_design_scores_gemma":[0.0028109795,0.00091267255,0.006325315,0.002612773,0.0002182602,0.0010058056,0.034204412,0.04097817,0.79500186,0.1080854,0.0070089647,0.00083534786],"about_ca_topic_score_codex":0.000001733346,"about_ca_topic_score_gemma":9.964695e-7,"teacher_disagreement_score":0.20124212,"about_ca_system_score_codex":0.000025059082,"about_ca_system_score_gemma":0.000014630899,"threshold_uncertainty_score":0.1932689},"labels":[],"label_agreement":null},{"id":"W2027025823","doi":"10.1145/1577769.1577773","title":"Message broadcast using optical orthogonal codes in vehicular communication systems","year":2007,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Computer science; Atomic broadcast; Multimedia Broadcast Multicast Service; Broadcast radiation; Broadcast communication network; Communications system; Vehicular communication systems; Computer network; Broadcasting (networking); Vehicular ad hoc network; Telecommunications; Wireless; Wireless ad hoc network","score_opus":0.014147082875131133,"score_gpt":0.23286363529151868,"score_spread":0.21871655241638754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027025823","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.9554411,0.0013476202,0.014758053,0.0000042046063,0.00021526511,0.00014152868,0.0000017282538,0.00015676519,0.02793371],"genre_scores_gemma":[0.9991677,0.00001673635,0.0006705314,0.0000073383976,0.000042234624,0.0000052446503,0.000007046032,0.000018686738,0.0000645006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918526,0.000060797254,0.00030494976,0.0000943557,0.0001268364,0.00022777302],"domain_scores_gemma":[0.999534,0.00010239824,0.000018946026,0.000262697,0.000021544174,0.000060407445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094708346,0.00010614417,0.00016402768,0.00010864264,0.000046616577,0.000037087,0.00013820812,0.000101044796,0.000021244081],"category_scores_gemma":[0.000010075964,0.00010152486,0.00003857755,0.00019380356,0.00003711349,0.000086231325,0.000022097744,0.00016148222,0.000020972446],"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.000041997893,0.00010736617,0.019136032,0.0003156927,0.00009873056,0.00010651337,0.00085851626,0.40503547,0.06967623,0.5026333,0.00016870767,0.0018214876],"study_design_scores_gemma":[0.0019457374,0.00005991083,0.024946826,0.0010498601,0.00006815766,0.0004469218,0.007114106,0.93119603,0.018789021,0.0017892153,0.011179631,0.0014145825],"about_ca_topic_score_codex":0.00006465476,"about_ca_topic_score_gemma":0.000087251305,"teacher_disagreement_score":0.5261606,"about_ca_system_score_codex":0.000057049136,"about_ca_system_score_gemma":0.0000054142265,"threshold_uncertainty_score":0.41400638},"labels":[],"label_agreement":null},{"id":"W2027236797","doi":"10.1364/ao.44.004368","title":"Effect of encoder–decoder mismatch due to wavelength and time misalignments on the performance of two-dimensional wavelength–time optical code-division multiple access systems","year":2005,"lang":"en","type":"article","venue":"Applied Optics","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":"McGill University","funders":"","keywords":"Optics; Wavelength; Encoder; Wavelength-division multiplexing; Computer science; Code (set theory); Division (mathematics); Optoelectronics; Materials science; Physics","score_opus":0.006793715217047603,"score_gpt":0.2198129741104752,"score_spread":0.2130192588934276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027236797","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.9963085,0.000050260216,0.00023012926,0.000024674224,0.00015325268,0.0008829218,0.000036885816,0.00007866853,0.0022346936],"genre_scores_gemma":[0.9989798,0.000007096458,0.00069739064,0.000026391268,0.00006559267,0.00007398333,0.000012226088,0.000054645894,0.0000828398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829036,0.00008611815,0.0005520307,0.00027830785,0.00044627703,0.00034688946],"domain_scores_gemma":[0.99813694,0.0011309651,0.0001012445,0.0004413854,0.000051217332,0.0001382433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009259482,0.00031816086,0.00056311284,0.00009912226,0.000093936666,0.000039602106,0.00034628942,0.00013976441,0.000025768057],"category_scores_gemma":[0.000036112786,0.00022874678,0.00006842784,0.00017786594,0.00008466137,0.00008789884,0.00011775041,0.00020036827,0.00014241898],"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.00051476614,0.00022521963,0.00045496057,0.0013031027,0.00035103923,0.0000050518465,0.0008807033,0.779978,0.19749469,0.007602,0.0007877962,0.010402685],"study_design_scores_gemma":[0.0009562152,0.00027140632,0.00019218789,0.00022436793,0.0000483795,0.000014148751,0.00002329359,0.78346163,0.21447186,0.000025033489,0.000063145984,0.00024836068],"about_ca_topic_score_codex":0.000003634389,"about_ca_topic_score_gemma":6.0274573e-7,"teacher_disagreement_score":0.016977165,"about_ca_system_score_codex":0.00004140206,"about_ca_system_score_gemma":0.000011092804,"threshold_uncertainty_score":0.9328023},"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":"W2030361986","doi":"10.1016/s0012-365x(01)00112-1","title":"On periodically-cyclic Gale 4-polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.008232989244292563,"score_gpt":0.20847555361806516,"score_spread":0.2002425643737726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030361986","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.82582414,0.0001617566,0.009688647,0.000049257236,0.00025033834,0.00017023608,0.000008746462,0.00044180668,0.16340508],"genre_scores_gemma":[0.99786264,0.00004317887,0.0007314412,0.000050378403,0.00006907252,0.000025307963,0.000005337829,0.0000428908,0.0011697278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921715,0.000017734792,0.00023618659,0.00011327393,0.00017361807,0.00024201926],"domain_scores_gemma":[0.99946904,0.00006947343,0.000027433302,0.00033617194,0.000010487635,0.00008738939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012934662,0.00016666432,0.00020432456,0.00006105711,0.00007309109,0.000057622354,0.00017739888,0.000070537484,0.00035712728],"category_scores_gemma":[0.000033698074,0.00013790972,0.00009312204,0.0001344397,0.0000436951,0.00005750317,0.000015837724,0.00012226177,0.0005838236],"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.00004479395,0.00034800151,0.00086293084,0.0014429721,0.00033980852,0.00018448604,0.011235241,0.006372155,0.022144003,0.9348329,0.014559022,0.007633711],"study_design_scores_gemma":[0.0034764372,0.000771314,0.0022524928,0.0025138857,0.00030834932,0.000737521,0.007934558,0.28070834,0.036114976,0.51729363,0.14331536,0.0045731515],"about_ca_topic_score_codex":0.000001014159,"about_ca_topic_score_gemma":0.000002204482,"teacher_disagreement_score":0.41753927,"about_ca_system_score_codex":0.000017199462,"about_ca_system_score_gemma":0.0000035727244,"threshold_uncertainty_score":0.75040656},"labels":[],"label_agreement":null},{"id":"W2030620609","doi":"10.1016/s0012-365x(02)00469-7","title":"On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"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","funders":"Shanghai Jiao Tong University","keywords":"Mathematics; Combinatorics; Existential quantification; Order (exchange); Embedding; Triple system; Discrete mathematics; Steiner system; Pure mathematics; Computer science","score_opus":0.012984800326886172,"score_gpt":0.2039888512577339,"score_spread":0.1910040509308477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030620609","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.94774795,0.00016885958,0.039747503,0.000010268388,0.000053865147,0.0007502956,0.000028076449,0.00005555471,0.011437655],"genre_scores_gemma":[0.99864036,0.0000053935837,0.0011482618,0.0000038471867,0.000005806684,0.00006032698,9.768814e-7,0.000019632585,0.00011542236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993468,0.000045623576,0.00027233904,0.000084238985,0.00014942064,0.00010158099],"domain_scores_gemma":[0.9991568,0.0003307557,0.00011901359,0.0003382768,0.000026683767,0.00002852433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003113045,0.00011118428,0.00023604112,0.000026263959,0.00003760559,0.000017778337,0.00011317854,0.000035038927,0.0000064311644],"category_scores_gemma":[0.000066871515,0.00006167973,0.000028467903,0.00013915902,0.0000846718,0.000036372334,0.000007811425,0.000058614034,0.0000027870533],"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.000031447766,0.0000379492,0.00013705048,0.00179536,0.00007481617,9.679676e-7,0.0031725303,0.0017818972,0.0040019066,0.9888616,0.000036213263,0.00006825593],"study_design_scores_gemma":[0.0050953464,0.0024998544,0.0018123692,0.005797824,0.0005681104,0.00025583032,0.05042167,0.6610123,0.05265743,0.21362227,0.0041476684,0.0021093048],"about_ca_topic_score_codex":0.000008096393,"about_ca_topic_score_gemma":0.0000054050547,"teacher_disagreement_score":0.77523935,"about_ca_system_score_codex":0.0000070917577,"about_ca_system_score_gemma":0.000006173078,"threshold_uncertainty_score":0.25152266},"labels":[],"label_agreement":null},{"id":"W2030762014","doi":"10.1007/s00373-013-1365-1","title":"Forbidden Configurations and Product Constructions","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Matrix (chemical analysis); TRACE (psycholinguistics); Mathematics; Product (mathematics); Permutation (music); Simple (philosophy); Identity matrix; Geometry; Physics; Eigenvalues and eigenvectors","score_opus":0.0044833847345464055,"score_gpt":0.16072249211837758,"score_spread":0.15623910738383118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030762014","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.98615366,0.0015877936,0.0001183582,0.000064067724,0.00056054536,0.00022864039,0.000005430215,0.00018874073,0.011092765],"genre_scores_gemma":[0.99952865,0.00021343626,0.00003262739,0.0000109407265,0.0000109310395,0.000054659078,0.0000029883352,0.000009895478,0.00013584718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996036,0.0000122651645,0.000109951456,0.00010360913,0.000049756127,0.000120764795],"domain_scores_gemma":[0.9997382,0.000021049684,0.000013558703,0.00011518908,0.000038702085,0.00007328393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004550042,0.00008906346,0.00009793235,0.00006875239,0.0001338454,0.000069478745,0.000037715003,0.00003668184,0.000026326117],"category_scores_gemma":[0.0000055855426,0.00008364858,0.000019856205,0.00016838674,0.00007523988,0.00013772231,0.000009448907,0.000078392804,0.000009513184],"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":[4.1497333e-7,0.000009382079,0.0044340775,0.00004284957,0.000028869363,5.869061e-7,0.00017887677,0.0000054634124,0.0011726026,0.98927796,0.0017389951,0.0031099454],"study_design_scores_gemma":[0.0005075055,0.000054263008,0.029337512,0.000024882183,0.000034361074,0.00011374387,0.0009375897,0.001367842,0.0010659966,0.95720387,0.009007249,0.00034516113],"about_ca_topic_score_codex":0.000018844177,"about_ca_topic_score_gemma":0.000002084376,"teacher_disagreement_score":0.032074045,"about_ca_system_score_codex":0.0000044702447,"about_ca_system_score_gemma":0.0000039290267,"threshold_uncertainty_score":0.341109},"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":"W2031991359","doi":"10.1080/00029890.2001.11919801","title":"Bidiagonal Factorizations of Totally Nonnegative Matrices","year":2001,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":80,"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; Algebra over a field; Pure mathematics","score_opus":0.006938435479803908,"score_gpt":0.21078975877974648,"score_spread":0.20385132329994257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031991359","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.62672806,0.0001636107,0.03913405,0.000049777045,0.00012704516,0.00023527334,0.000052810257,0.0002999965,0.33320937],"genre_scores_gemma":[0.9977775,0.00002209855,0.0019929595,0.000013222492,0.000043145446,0.000025895546,0.000004812132,0.000024973353,0.000095376345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918115,0.00003293761,0.00031265744,0.00011257307,0.00016350887,0.00019718683],"domain_scores_gemma":[0.9993381,0.0002557303,0.00007480111,0.00019976402,0.00004086355,0.00009074712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008623724,0.00013743283,0.00030414012,0.00008490643,0.000033333417,0.000014417815,0.00015044947,0.000031779204,0.00021494244],"category_scores_gemma":[0.00006295782,0.00011903344,0.00008860996,0.0004957812,0.00017922928,0.00009068342,0.000016286525,0.00007951349,0.00010113058],"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.000042818,0.0003945144,0.002487903,0.00042399767,0.00041706435,0.000034342927,0.0045635193,0.016709443,0.008479754,0.96101457,0.00095165987,0.0044804323],"study_design_scores_gemma":[0.0010367136,0.0008269144,0.017046485,0.00053663837,0.00024246884,0.0000722884,0.00813728,0.13001853,0.009207246,0.82548267,0.005761091,0.0016316837],"about_ca_topic_score_codex":0.000017648168,"about_ca_topic_score_gemma":0.0000043292944,"teacher_disagreement_score":0.37104946,"about_ca_system_score_codex":0.00001740902,"about_ca_system_score_gemma":0.000008455349,"threshold_uncertainty_score":0.48540425},"labels":[],"label_agreement":null},{"id":"W2032200582","doi":"10.1155/2010/851857","title":"Classification of Base Sequences BS(<i>n</i> + 1,<i>n</i>)","year":2010,"lang":"en","type":"article","venue":"International Journal of Combinatorics","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Mathematics; Conjecture; Combinatorics; Base (topology); Hadamard transform; Equivalence (formal languages); Equivalence relation; Monotonic function; Sequence (biology); Discrete mathematics; Mathematical analysis","score_opus":0.009034156212700232,"score_gpt":0.22968156833038914,"score_spread":0.2206474121176889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032200582","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.98332846,0.000160914,0.0018667959,0.00013673093,0.008895552,0.000035415498,0.000008097161,0.000024054947,0.0055439966],"genre_scores_gemma":[0.9995286,0.000056028224,0.00016235009,0.000014637012,0.00019103264,0.0000012996592,0.0000018722482,0.000010954391,0.00003326852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989673,0.000025184503,0.00045992844,0.000048617712,0.0004210942,0.00007790039],"domain_scores_gemma":[0.9989344,0.00008957569,0.00024793754,0.00010885492,0.0005595811,0.000059664435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004244402,0.000079956364,0.00014502331,0.00018853352,0.00001546035,0.000026202042,0.0004597415,0.00006702153,0.000041905645],"category_scores_gemma":[0.000077087905,0.00007252091,0.00010153888,0.0001339013,0.000048366062,0.00022957141,0.0000126151235,0.00027743753,0.0000066186244],"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.000042123036,0.00015607609,0.014790881,0.000041565498,0.00022193561,0.000044278877,0.00035904328,0.00085589435,0.41181383,0.56701684,0.0019081837,0.002749338],"study_design_scores_gemma":[0.0033198728,0.00038905034,0.03859415,0.00033853794,0.00011294753,0.0012392575,0.00082260673,0.010151123,0.39283237,0.4909642,0.06054943,0.00068645447],"about_ca_topic_score_codex":0.0000023835155,"about_ca_topic_score_gemma":0.0000022153763,"teacher_disagreement_score":0.07605265,"about_ca_system_score_codex":0.000030091322,"about_ca_system_score_gemma":0.00003608066,"threshold_uncertainty_score":0.2957317},"labels":[],"label_agreement":null},{"id":"W2033558565","doi":"10.1109/icc.2004.1312800","title":"Experimental demonstration and simulation results of frequency encoded optical CDMA","year":2004,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Code division multiple access; Decoding methods; Computer science; Encoding (memory); Bit error rate; Broadband; Electronic engineering; Code (set theory); Fiber Bragg grating; Broadband networks; Gold code; Algorithm; Optical fiber; Spread spectrum; Telecommunications; Engineering; Artificial intelligence","score_opus":0.010147680517603572,"score_gpt":0.22783668167761595,"score_spread":0.21768900116001239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033558565","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.9644346,0.00009961473,0.015991202,0.000007132853,0.0000704529,0.00007760795,0.0000023953014,0.000076076794,0.019240882],"genre_scores_gemma":[0.998247,0.0000015159477,0.0017098045,0.0000025927857,0.000017301867,0.0000029739517,0.000004269457,0.0000051137604,0.000009412576],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963593,0.000007924612,0.00016952908,0.00006573133,0.000058804362,0.00006208611],"domain_scores_gemma":[0.9998585,0.000023333641,0.000012885459,0.000066474524,0.000010393294,0.000028434008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006963346,0.00005332786,0.00006595423,0.00002930392,0.000017160388,0.0000075388407,0.000022540906,0.00004425731,0.00000832092],"category_scores_gemma":[0.000009300375,0.00004936065,0.000016192427,0.000048829497,0.0000256484,0.00010315683,0.0000033115762,0.000028785116,0.0000037689001],"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.000025971458,0.00003259757,0.00014660167,0.000022886381,0.000013647538,0.0000017397941,0.0007932133,0.25755253,0.6552821,0.085681,0.000004262036,0.00044344415],"study_design_scores_gemma":[0.0011715723,0.000103191145,0.00098375,0.00003027398,0.000005938286,0.0000065220224,0.00055255805,0.040757664,0.94986415,0.0063958764,0.000009079719,0.00011941135],"about_ca_topic_score_codex":0.000013631422,"about_ca_topic_score_gemma":0.0000054928846,"teacher_disagreement_score":0.29458207,"about_ca_system_score_codex":0.000013794766,"about_ca_system_score_gemma":0.0000040356936,"threshold_uncertainty_score":0.20128688},"labels":[],"label_agreement":null},{"id":"W2034155174","doi":"10.1117/12.474050","title":"Comparison of BER measurements in a FFH-OCDMA system with incoherent and coherent sources","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beat (acoustics); Bit error rate; Optics; Encoder; Physics; Computer science; Optical fiber; Laser; Fiber laser; Telecommunications; Decoding methods","score_opus":0.01733747100683725,"score_gpt":0.22757555488673847,"score_spread":0.21023808387990123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034155174","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.9952896,0.00045007796,0.000040244824,0.000058247835,0.00016109443,0.0005965996,0.000014558232,0.0000752646,0.0033142788],"genre_scores_gemma":[0.9916536,0.000017877472,0.008048407,0.000006072752,0.00005419173,0.00014418416,0.0000018900427,0.000049179882,0.000024579927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99804217,4.9344365e-8,0.00077263406,0.00026052792,0.00060714426,0.00031749753],"domain_scores_gemma":[0.99893296,0.000078219375,0.000264164,0.000053086653,0.00057295547,0.00009861852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006912371,0.00030550762,0.00059131195,0.00012519096,0.000042434705,0.000053295204,0.00040585184,0.00015014806,0.00000476147],"category_scores_gemma":[0.00009579777,0.00024178255,0.0002310086,0.00030501967,0.00016874344,0.0002500957,0.00004656915,0.00024385829,4.5511683e-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.00014003749,0.000225419,0.051898234,0.004101527,0.0009827359,1.1560972e-7,0.0014324172,0.0032036807,0.44314885,0.49427703,0.00043213152,0.00015781722],"study_design_scores_gemma":[0.0064807613,0.0013184808,0.010842765,0.0057784007,0.00060668,0.000073976895,0.032067608,0.09393608,0.84332037,0.001143072,0.0029388838,0.001492957],"about_ca_topic_score_codex":0.000011295689,"about_ca_topic_score_gemma":0.0000011628564,"teacher_disagreement_score":0.49313396,"about_ca_system_score_codex":0.00013266441,"about_ca_system_score_gemma":0.000014899779,"threshold_uncertainty_score":0.9859606},"labels":[],"label_agreement":null},{"id":"W2034588003","doi":"10.1109/cleo.2005.202072","title":"Performance of a multi-user OCDMA system demonstrator with full clock and data recovery","year":2005,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; Data recovery; Pseudorandom binary sequence; Code division multiple access; Electronic engineering; Computer hardware; Embedded system; Computer network; Engineering; Binary number","score_opus":0.01132107555017318,"score_gpt":0.1918600166066437,"score_spread":0.18053894105647053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034588003","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.9934352,0.0005348476,0.002295576,0.000004791822,0.00008073978,0.00013226591,0.000028352977,0.00016286713,0.0033253813],"genre_scores_gemma":[0.99673444,0.000035329922,0.002841475,0.000005477269,0.000043468182,0.000006216549,0.000005773097,0.000017074135,0.00031076602],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943537,0.000016278185,0.00018835835,0.0001470493,0.00007680695,0.0001361222],"domain_scores_gemma":[0.99945724,0.000020899017,0.000027810562,0.00042525848,0.000017224977,0.000051581294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001734999,0.00010940792,0.0001608283,0.000043824624,0.000028194185,0.000014586491,0.00016852371,0.00005033173,0.000012970444],"category_scores_gemma":[0.0000023021526,0.00008249926,0.000012985844,0.00008886013,0.000028692719,0.0002943499,0.00003140585,0.00006329958,0.00001848165],"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.0024268467,0.0007115665,0.44748437,0.027767848,0.0031493246,0.00008737598,0.003348501,0.14126825,0.15895355,0.072612494,0.014963362,0.1272265],"study_design_scores_gemma":[0.0015039222,0.00027611264,0.005901419,0.0006467964,0.000073738185,0.00029240237,0.0013140024,0.96483177,0.010719092,0.0000016823941,0.013915366,0.0005236691],"about_ca_topic_score_codex":0.00000673352,"about_ca_topic_score_gemma":0.00006430849,"teacher_disagreement_score":0.8235635,"about_ca_system_score_codex":0.000012409885,"about_ca_system_score_gemma":0.000008221436,"threshold_uncertainty_score":0.33642223},"labels":[],"label_agreement":null},{"id":"W2034818478","doi":"10.1016/j.disc.2003.11.020","title":"Tight incomplete block designs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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","funders":"","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Automorphism; Prime power; Discrete mathematics; Element (criminal law); Upper and lower bounds; Automorphism group; Type (biology); Group (periodic table); Prime (order theory); Physics; Mathematical analysis","score_opus":0.019179472657135925,"score_gpt":0.2161653535992005,"score_spread":0.19698588094206457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034818478","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.7349219,0.00037450047,0.16939324,0.000083905354,0.0006260086,0.0005305757,0.000034691977,0.0012613067,0.09277388],"genre_scores_gemma":[0.99283576,0.000007562763,0.006859606,0.000018706993,0.00006277081,0.0000207028,0.000005174962,0.000043853364,0.00014586074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927676,0.000012308548,0.0002465182,0.00009850237,0.0001392931,0.00022659416],"domain_scores_gemma":[0.99954146,0.000035442376,0.00003023303,0.00030210867,0.000014903416,0.00007586056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013559955,0.00016077384,0.00019633239,0.00005672615,0.00006249472,0.000038104714,0.00017940051,0.00006139204,0.00004377665],"category_scores_gemma":[0.00001234731,0.0001383679,0.000082536804,0.00014282235,0.000035042915,0.00006941645,0.000019942114,0.00009972874,0.00033825185],"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.000006277458,0.00011147957,0.00008939685,0.0013890425,0.0002620703,0.000058478538,0.01030439,0.050296888,0.031683736,0.9042208,0.00124436,0.0003330683],"study_design_scores_gemma":[0.0020987804,0.00017134061,0.00030275589,0.0009908685,0.00017708648,0.00030165713,0.0025352517,0.036481503,0.06647929,0.87566906,0.012963201,0.0018291762],"about_ca_topic_score_codex":0.0000019332147,"about_ca_topic_score_gemma":0.0000033190881,"teacher_disagreement_score":0.25791386,"about_ca_system_score_codex":0.000032203152,"about_ca_system_score_gemma":0.0000070099627,"threshold_uncertainty_score":0.56424797},"labels":[],"label_agreement":null},{"id":"W2034819091","doi":"10.1007/s10623-015-0037-y","title":"On tight bounds for binary frameproof codes","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"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":"Alphabet; Combinatorics; Binary number; Permutation (music); Mathematics; Hash function; Binary code; Degree (music); Discrete mathematics; Permutation matrix; Physics; Arithmetic; Computer science","score_opus":0.0312588281043503,"score_gpt":0.2366463420175295,"score_spread":0.2053875139131792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034819091","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.8121378,0.0053052623,0.1682822,0.00006261375,0.00089362985,0.0007885262,0.00012145843,0.0007123159,0.0116962],"genre_scores_gemma":[0.9974399,0.00007022576,0.0020602937,0.00009386167,0.000089159,0.0001452121,0.00002313006,0.000040565126,0.000037644517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910617,0.000047324458,0.00019042485,0.00022292799,0.00013781933,0.00029533924],"domain_scores_gemma":[0.9993592,0.00014255462,0.000028408585,0.000231133,0.00005215006,0.00018655033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033923145,0.00021832231,0.00025044865,0.00022621783,0.0001264459,0.00009533212,0.00012660559,0.00012886926,0.000013180674],"category_scores_gemma":[0.000014924836,0.00019131397,0.00013371042,0.00028305672,0.000099555975,0.000096293115,0.000011176606,0.00011119889,0.000009633887],"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.000513768,0.0002232341,0.003339932,0.0005093018,0.00052172056,0.000023160377,0.0021270202,0.0042901305,0.012698757,0.8997178,0.066861674,0.009173503],"study_design_scores_gemma":[0.004124742,0.0032586493,0.0018317393,0.00038831885,0.00021543975,0.00004832215,0.0019626934,0.029566282,0.0127868755,0.7547005,0.1891887,0.0019277574],"about_ca_topic_score_codex":0.000004780466,"about_ca_topic_score_gemma":0.0000040185023,"teacher_disagreement_score":0.18530211,"about_ca_system_score_codex":0.00001014756,"about_ca_system_score_gemma":0.000009848928,"threshold_uncertainty_score":0.7801557},"labels":[],"label_agreement":null},{"id":"W2035716614","doi":"10.4153/cjm-2005-017-2","title":"Generalized k-Configurations","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","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":"York University","funders":"","keywords":"Mathematics; Hyperplane; Disjoint sets; Intersection (aeronautics); Hilbert space; Combinatorics; Function (biology); Type (biology); Boundary (topology); Pure mathematics; Mathematical analysis","score_opus":0.01166974296912368,"score_gpt":0.1902134737351523,"score_spread":0.1785437307660286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035716614","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.959089,0.0014260056,0.010815575,0.0003185749,0.00069133955,0.00008647847,0.000012720154,0.000030681236,0.027529629],"genre_scores_gemma":[0.9943665,0.000009289878,0.0051636854,0.000037359325,0.00021663895,9.813264e-7,5.265906e-7,0.000014084816,0.00019093236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995031,0.0000109075445,0.0002779767,0.000021064088,0.000060250233,0.00012670975],"domain_scores_gemma":[0.9995337,0.000021741822,0.000051489016,0.00009313106,0.000052276006,0.00024763914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018209754,0.0000615652,0.00012735522,0.0001363243,0.0000442534,0.000033060765,0.00011684411,0.000036281996,0.00025753016],"category_scores_gemma":[0.000027097793,0.000055385743,0.000064453285,0.00007489241,0.000018178058,0.00009130942,7.548886e-7,0.00008852062,0.00005809001],"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.0000030729586,0.00005908919,0.0004048465,0.0004267936,0.00057904463,0.00021617649,0.01885635,0.11716023,0.014294693,0.71170753,0.121537514,0.01475466],"study_design_scores_gemma":[0.0016918731,0.00010693558,0.0005581309,0.0005601748,0.000216824,0.0030276994,0.0038865854,0.055880878,0.018000424,0.05170385,0.86345273,0.0009139086],"about_ca_topic_score_codex":0.000024110921,"about_ca_topic_score_gemma":0.002514039,"teacher_disagreement_score":0.7419152,"about_ca_system_score_codex":0.000048910082,"about_ca_system_score_gemma":0.00008906281,"threshold_uncertainty_score":0.28197747},"labels":[],"label_agreement":null},{"id":"W2036589342","doi":"10.1016/s0166-218x(03)00383-4","title":"Whist tournaments with the three person property","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Tournament; Mathematics; Property (philosophy); Mathematical economics; Combinatorics; Spectrum (functional analysis); Existential quantification; Discrete mathematics; Epistemology","score_opus":0.012532181091227152,"score_gpt":0.18093137730837014,"score_spread":0.168399196217143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036589342","genre_codex":"other","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.22068575,0.0002197181,0.08438927,0.00010368037,0.00017830604,0.0011800234,0.000008717187,0.00042513176,0.6928094],"genre_scores_gemma":[0.99624383,0.0000038482535,0.0029625546,0.000030795814,0.000025954636,0.0001238632,0.0000021984454,0.000051748717,0.0005551723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930537,0.000010132272,0.0001405178,0.00011427707,0.00019636091,0.0002333649],"domain_scores_gemma":[0.99949557,0.00003207943,0.000043034284,0.00036295876,0.0000137771085,0.000052555388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021360483,0.00018355912,0.00017840521,0.000023760327,0.00013138325,0.0000618657,0.00018404184,0.000046133413,0.00006481064],"category_scores_gemma":[0.000004744381,0.0000834369,0.000043088898,0.00013418235,0.000059631057,0.000043226388,0.000007884856,0.0001437879,0.00008323367],"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.000028857281,0.00011474599,0.00013079646,0.0010407346,0.00046891323,0.000013578342,0.01499193,0.003278372,0.015800385,0.9547486,0.0073801954,0.0020029445],"study_design_scores_gemma":[0.011681759,0.000880145,0.0010118182,0.0021001252,0.0018807872,0.00090711087,0.20268092,0.09763632,0.103464596,0.25453597,0.3140987,0.009121792],"about_ca_topic_score_codex":0.0000012282088,"about_ca_topic_score_gemma":0.0000127030735,"teacher_disagreement_score":0.7755581,"about_ca_system_score_codex":0.000025060033,"about_ca_system_score_gemma":0.000007545836,"threshold_uncertainty_score":0.34024578},"labels":[],"label_agreement":null},{"id":"W2036754114","doi":"10.1016/j.jcta.2013.12.004","title":"On balanced incomplete block designs with specified weak chromatic number","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Lambda; Block (permutation group theory); Combinatorics; Block design; Discrete mathematics; Physics; Optics","score_opus":0.007952064428015451,"score_gpt":0.19136564150939853,"score_spread":0.18341357708138306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036754114","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.970006,0.00006883221,0.0007362114,0.000042351818,0.0042494857,0.00026839584,0.0000023507803,0.00009646896,0.024529923],"genre_scores_gemma":[0.99897075,0.000014558095,0.0001768381,0.000022823333,0.0005533841,0.000014150704,6.6241046e-7,0.000048473295,0.00019835081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985381,0.00023119034,0.00051868573,0.00010003592,0.00033570893,0.00027632367],"domain_scores_gemma":[0.99895823,0.0003031707,0.00016990851,0.00026175787,0.00015418073,0.0001527526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444535,0.00024878647,0.00048710033,0.00009487124,0.00009285853,0.00010378882,0.00030652116,0.00009394418,0.0005371778],"category_scores_gemma":[0.000051667408,0.00018085791,0.00012821262,0.00021089605,0.00009569515,0.0004313726,0.000016840395,0.00033491323,0.00012415161],"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.0014132758,0.00012281159,0.00015789022,0.00012352249,0.00043640635,0.000052446383,0.0007136893,0.0018810366,0.011174838,0.9791425,0.004408927,0.00037266975],"study_design_scores_gemma":[0.002672994,0.001513724,0.001004771,0.0004911273,0.00007022534,0.00066344073,0.0010253561,0.00014703671,0.009684004,0.97709775,0.005137669,0.00049190846],"about_ca_topic_score_codex":0.0000014138982,"about_ca_topic_score_gemma":4.4867866e-7,"teacher_disagreement_score":0.02896478,"about_ca_system_score_codex":0.000068140216,"about_ca_system_score_gemma":0.000025726571,"threshold_uncertainty_score":0.7375171},"labels":[],"label_agreement":null},{"id":"W2036867308","doi":"10.1016/j.disc.2006.06.050","title":"Power Hadamard matrices","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Power (physics); Discrete mathematics; Mathematical analysis","score_opus":0.00612364456533038,"score_gpt":0.21358403106871565,"score_spread":0.20746038650338527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036867308","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.600769,0.0006255137,0.08458237,0.000016304977,0.0006069855,0.00019879326,0.000010684106,0.0006447533,0.31254563],"genre_scores_gemma":[0.996383,0.000010514734,0.0030651605,0.000015691978,0.000051011746,0.0000045878332,0.0000028650006,0.000036634876,0.00043051987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923754,0.000007097171,0.00026571332,0.000081872204,0.00015580049,0.0002519961],"domain_scores_gemma":[0.9995467,0.00008107992,0.00003317861,0.00024994608,0.000016246453,0.00007285128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040974273,0.00013397956,0.00016171703,0.00007676153,0.000042388976,0.000036393525,0.00015151192,0.00006643211,0.0001551494],"category_scores_gemma":[0.000015998423,0.00011344948,0.00007671385,0.00016403064,0.00002516436,0.00007668524,0.000016785356,0.00008924625,0.0002516585],"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.000028153496,0.00016300008,0.0014565436,0.0024849281,0.00046566295,0.00015774355,0.019767188,0.001530215,0.018642182,0.9370073,0.015234141,0.0030629497],"study_design_scores_gemma":[0.003315582,0.00044950738,0.0071354546,0.0018889597,0.00042505068,0.00063487526,0.046216194,0.059633173,0.11443099,0.4495265,0.3101643,0.006179424],"about_ca_topic_score_codex":7.2202533e-7,"about_ca_topic_score_gemma":0.0000019906981,"teacher_disagreement_score":0.48748082,"about_ca_system_score_codex":0.000016156513,"about_ca_system_score_gemma":0.0000023428418,"threshold_uncertainty_score":0.46263355},"labels":[],"label_agreement":null},{"id":"W2037418399","doi":"10.1016/s0012-365x(03)00081-5","title":"General constructions of c-Bhaskar Rao designs and the (c,λ) spectrum of a c-BRD(v,k,λ)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BGC Engineering (Canada)","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Order (exchange); Spectrum (functional analysis); Group (periodic table); Construct (python library); Series (stratigraphy); Discrete mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.010786752776677944,"score_gpt":0.2004288778269069,"score_spread":0.18964212505022895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037418399","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.91918576,0.0006939599,0.05573514,0.00003078221,0.00022192778,0.00038234444,0.000047679376,0.000063784726,0.02363865],"genre_scores_gemma":[0.9946257,0.000037640697,0.00517142,0.0000037917089,0.00001347932,0.000012023601,9.232863e-7,0.000017279908,0.00011773959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932444,0.00006277694,0.00032416417,0.00006552702,0.000099143515,0.00012394392],"domain_scores_gemma":[0.99948585,0.00013814798,0.00008017362,0.00024753046,0.00001752574,0.000030797277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003429908,0.00010816283,0.00028161635,0.00004739011,0.000041914664,0.000008443928,0.000087581146,0.000043299853,0.00003886119],"category_scores_gemma":[0.000046206147,0.0000730333,0.000084299965,0.00013389363,0.00028639726,0.000035224646,0.000010421263,0.00007003606,0.000002453642],"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.0000054257007,0.000012086108,0.000098568045,0.000312096,0.00009499879,5.397932e-7,0.0023205343,0.0006270135,0.0035304807,0.99289036,0.00007307597,0.000034851746],"study_design_scores_gemma":[0.0028526415,0.000087993016,0.00014945917,0.00031215505,0.00031985083,0.00028423918,0.0088007245,0.04604402,0.11359415,0.8261262,0.0009424484,0.00048609238],"about_ca_topic_score_codex":0.000003851711,"about_ca_topic_score_gemma":0.0000026459127,"teacher_disagreement_score":0.16676411,"about_ca_system_score_codex":0.000005360664,"about_ca_system_score_gemma":0.000008050099,"threshold_uncertainty_score":0.29782116},"labels":[],"label_agreement":null},{"id":"W2037774099","doi":"10.1016/s0024-3795(99)00185-8","title":"On pseudomatroid property of matrices","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Generalization; Property (philosophy); Matrix (chemical analysis); Principal (computer security); Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis; Computer science","score_opus":0.005463255585335254,"score_gpt":0.1963510214996721,"score_spread":0.19088776591433684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037774099","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.9671222,0.0012589304,0.00059070246,0.000052309046,0.000025126586,0.000382854,0.000028898146,0.00018206418,0.030356912],"genre_scores_gemma":[0.99841076,0.00028404593,0.000121670404,0.000021373224,0.00005261512,0.00009639908,0.0000061795695,0.00001216438,0.000994816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996405,0.000008428029,0.00013148163,0.00008765532,0.000052239866,0.000079695594],"domain_scores_gemma":[0.99977255,0.00002741962,0.000013534764,0.00013554489,0.000013162114,0.000037816662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004226653,0.00006831106,0.00008972331,0.000034377415,0.00004760028,0.0000072428675,0.000071864,0.00003626904,0.00019720769],"category_scores_gemma":[0.0000017247651,0.00004790902,0.000025073165,0.0001427656,0.00001649198,0.0000405455,0.000003862539,0.00004891943,0.00018576323],"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.000082317405,0.00031707057,0.00018299185,0.00092470984,0.0001752118,0.0000015124922,0.0010310211,0.006439794,0.04093179,0.81792635,0.004348829,0.12763841],"study_design_scores_gemma":[0.0019171953,0.00055212964,0.0024938534,0.00028062024,0.00017800427,0.00007634651,0.0003249739,0.1136245,0.096334144,0.05975347,0.7230768,0.001387967],"about_ca_topic_score_codex":0.0000021590022,"about_ca_topic_score_gemma":5.16571e-7,"teacher_disagreement_score":0.75817287,"about_ca_system_score_codex":0.0000026242813,"about_ca_system_score_gemma":0.0000025728962,"threshold_uncertainty_score":0.23876725},"labels":[],"label_agreement":null},{"id":"W2038004087","doi":"10.1016/s0097-3165(03)00098-0","title":"Cycle decompositions IV: complete directed graphs and fixed length directed cycles","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Directed graph; Discrete mathematics","score_opus":0.006390053528123849,"score_gpt":0.2002197457387437,"score_spread":0.19382969221061985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038004087","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.98470706,0.0017945308,0.00021888407,0.000035334342,0.005797379,0.00016422628,0.00002339353,0.00037486636,0.0068843355],"genre_scores_gemma":[0.9990946,0.00021685565,0.00044949003,0.000017578124,0.00012743351,0.0000068387435,0.0000032844932,0.000042556658,0.000041370742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982396,0.00054621993,0.0005815802,0.000126719,0.00022237509,0.00028355216],"domain_scores_gemma":[0.9988649,0.00037918353,0.00019347576,0.00020286486,0.00016997047,0.0001896172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008098922,0.00024973354,0.0005011627,0.0002158067,0.00023480834,0.00009564752,0.00019024653,0.00011858347,0.000090320034],"category_scores_gemma":[0.00015950638,0.00022744242,0.00017700213,0.000352215,0.00015789975,0.00041360236,0.00001913448,0.00032567765,0.000004156984],"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.00035731806,0.00009743719,0.00032315054,0.000056339508,0.00036701793,0.000038212995,0.00067694194,0.00028995232,0.014127368,0.9826253,0.00074180483,0.0002991563],"study_design_scores_gemma":[0.0022109507,0.0003265401,0.0016937702,0.00013623781,0.00012809818,0.0005549737,0.0006027382,0.00014746847,0.0071181473,0.96708006,0.019586276,0.00041471704],"about_ca_topic_score_codex":0.0000021605115,"about_ca_topic_score_gemma":0.0000022661623,"teacher_disagreement_score":0.01884447,"about_ca_system_score_codex":0.000037870974,"about_ca_system_score_gemma":0.000025861591,"threshold_uncertainty_score":0.92748326},"labels":[],"label_agreement":null},{"id":"W2038358052","doi":"10.1007/s10878-010-9335-5","title":"A modified power spectral density test applied to weighing matrices with small weight","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Theory of computation; Row; Prime (order theory); Spectral density; Combinatorics; Algorithm; Combinatorial optimization; Computer science; Statistics","score_opus":0.0037058371705139593,"score_gpt":0.17038198146559572,"score_spread":0.16667614429508176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038358052","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.8092255,0.000027165099,0.17691539,0.00006605939,0.00781266,0.00024481319,0.0000018720892,0.00010129833,0.005605217],"genre_scores_gemma":[0.97246146,0.0000068434024,0.02687147,0.0000137023235,0.0005996958,0.0000031597142,0.0000014014261,0.00003205747,0.000010194124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907297,0.000022252028,0.00037549288,0.000097576434,0.00024558997,0.00018609088],"domain_scores_gemma":[0.9992445,0.00008651595,0.00017769603,0.00014635373,0.0001896777,0.0001552429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036849824,0.00015965772,0.00027264588,0.0002069721,0.00007690338,0.00009741447,0.00019595327,0.00011491121,0.000029822391],"category_scores_gemma":[0.000047132486,0.00013098505,0.00006241257,0.00033348353,0.000017253678,0.000199895,0.000013261264,0.0003669961,0.0000056372537],"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.00037006204,0.00014378499,0.0007048493,0.00003793504,0.00010091058,0.000030926552,0.00063583197,0.92702866,0.017922707,0.052519783,0.00029670238,0.00020786129],"study_design_scores_gemma":[0.051031567,0.00903795,0.016534265,0.0015891765,0.001835297,0.0025076577,0.0015821006,0.4666322,0.31883103,0.10039472,0.022045543,0.007978503],"about_ca_topic_score_codex":0.0000020787543,"about_ca_topic_score_gemma":0.0000019925367,"teacher_disagreement_score":0.46039647,"about_ca_system_score_codex":0.00004050705,"about_ca_system_score_gemma":0.00003132088,"threshold_uncertainty_score":0.53414154},"labels":[],"label_agreement":null},{"id":"W2039034730","doi":"10.1007/s00493-005-0013-7","title":"Matroid Matching Via Mixed Skew-Symmetric Matrices","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matroid; Rank (graph theory); Matching (statistics); Discrete mathematics; Matrix (chemical analysis); Bipartite graph; Cardinality (data modeling); Skew; Graph","score_opus":0.00494074972957487,"score_gpt":0.1859508627076843,"score_spread":0.18101011297810943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039034730","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.9392108,0.008839377,0.0076822895,0.000098077195,0.002772691,0.00024626285,0.000005666582,0.0014196257,0.039725237],"genre_scores_gemma":[0.9988807,0.000091453716,0.00044239603,0.0000275177,0.00016861869,0.000017015867,0.0000041370945,0.000052017498,0.00031617415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989064,0.000048767,0.00028996478,0.00018699747,0.00020489444,0.00036297704],"domain_scores_gemma":[0.99938154,0.000089902576,0.000046218134,0.0003288138,0.000027896296,0.00012564793],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021318533,0.00020832101,0.00024759973,0.00029291882,0.00012025544,0.000061140156,0.00031683917,0.00010584453,0.00008448395],"category_scores_gemma":[0.000010544191,0.00020939446,0.00010950729,0.00084916066,0.000016644326,0.00020586817,0.00004038327,0.00021282244,0.0008330196],"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.000037518497,0.00053535163,0.0018321088,0.00086566113,0.0004402379,0.0000865549,0.003307567,0.007254814,0.017068855,0.83480036,0.037976276,0.09579469],"study_design_scores_gemma":[0.0037751005,0.00030446265,0.008044896,0.00025581286,0.00021984984,0.00029561823,0.0009843075,0.026793407,0.036747023,0.38164455,0.53778434,0.0031506482],"about_ca_topic_score_codex":0.000012576668,"about_ca_topic_score_gemma":0.0000016195413,"teacher_disagreement_score":0.49980804,"about_ca_system_score_codex":0.000107116626,"about_ca_system_score_gemma":0.000005856561,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W2039267601","doi":"10.1016/s0097-3165(02)00020-1","title":"Sets of three pairwise orthogonal Steiner triple systems","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; California Institute of Technology","keywords":"Steiner system; Disjoint sets; Combinatorics; Pairwise comparison; Mathematics; Order (exchange); Triple system; Discrete mathematics; Pure mathematics; Statistics","score_opus":0.008658855848408292,"score_gpt":0.1943711763680776,"score_spread":0.18571232051966932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039267601","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.9587294,0.0040851543,0.0015027997,0.000010851044,0.025370225,0.00025228152,0.00001848795,0.000067812274,0.009963008],"genre_scores_gemma":[0.99934,0.000050199935,0.000060120263,0.000003977664,0.00033374244,0.000005653776,9.692064e-7,0.000039273713,0.00016604201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979177,0.0004232907,0.00091105106,0.00009293292,0.00040092293,0.00025411614],"domain_scores_gemma":[0.9987438,0.00020381066,0.00038221577,0.00026332453,0.00026666577,0.00014021798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022691076,0.00022265193,0.0006271647,0.0001731535,0.00006386469,0.00004165783,0.00027311497,0.00014618013,0.0001081408],"category_scores_gemma":[0.00019241094,0.00018345159,0.00027001646,0.00028180936,0.000101173144,0.00037298584,0.000015164312,0.0002947869,0.0000053586637],"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.0005407412,0.000078283556,0.00051405793,0.00019283444,0.00030183097,0.00003901722,0.00029447497,0.002075555,0.0026904896,0.9922855,0.00077198446,0.00021521107],"study_design_scores_gemma":[0.004849371,0.0013911215,0.00035371195,0.00048544956,0.00019827137,0.00087222515,0.0020439005,0.00016785561,0.0129084755,0.90997916,0.06616593,0.0005845047],"about_ca_topic_score_codex":0.0000012198734,"about_ca_topic_score_gemma":9.815735e-7,"teacher_disagreement_score":0.08230634,"about_ca_system_score_codex":0.000045299814,"about_ca_system_score_gemma":0.000071747454,"threshold_uncertainty_score":0.74809384},"labels":[],"label_agreement":null},{"id":"W2040201663","doi":"10.1016/j.disc.2007.07.098","title":"Disjoint triangles and quadrilaterals in a graph","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Quadrilateral; Discrete mathematics; Simple graph; Order (exchange)","score_opus":0.009345719196038967,"score_gpt":0.21952165460769377,"score_spread":0.2101759354116548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040201663","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.9791372,0.00038796212,0.011460375,0.000014829527,0.00011486138,0.0001734891,0.000005379945,0.00012304621,0.00858285],"genre_scores_gemma":[0.99859506,0.000024695762,0.0012413583,0.000008550697,0.000023401853,0.000008410067,0.0000025074633,0.00002193541,0.0000741088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993049,0.000013056362,0.00030689038,0.00008633553,0.00008193573,0.00020689027],"domain_scores_gemma":[0.99967206,0.00008512507,0.000026282341,0.00015338162,0.0000059828044,0.00005718488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005083321,0.000119932265,0.00020073006,0.0001280317,0.00002174056,0.000028624001,0.000065975306,0.000056167268,0.000014223376],"category_scores_gemma":[0.000018471555,0.00010000193,0.000044414315,0.00015558283,0.000031863783,0.00006617472,0.0000139180165,0.0000789649,0.000012082968],"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.00008254493,0.00024021896,0.011988314,0.004591372,0.00028120197,0.00026415515,0.068150565,0.0014063763,0.034378868,0.8682576,0.0007068985,0.009651913],"study_design_scores_gemma":[0.0038826987,0.00019282218,0.028941184,0.0019172642,0.000116153366,0.0002493696,0.020897865,0.04182371,0.02751872,0.8686566,0.003555838,0.0022477747],"about_ca_topic_score_codex":0.000003913856,"about_ca_topic_score_gemma":0.00003696648,"teacher_disagreement_score":0.0472527,"about_ca_system_score_codex":0.000010782086,"about_ca_system_score_gemma":0.0000013740585,"threshold_uncertainty_score":0.40779606},"labels":[],"label_agreement":null},{"id":"W2040500577","doi":"10.1016/s0024-3795(02)00574-8","title":"A note on k-primitive directed graphs","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"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; Directed graph; Discrete mathematics; Graph coloring; Existential quantification","score_opus":0.007611452749879197,"score_gpt":0.21576382858939785,"score_spread":0.20815237583951865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040500577","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.8090902,0.0025604598,0.01677031,0.00013493562,0.0003238753,0.001525735,0.00011252499,0.0018306434,0.16765133],"genre_scores_gemma":[0.9990537,0.00011475478,0.00024462023,0.00006647473,0.00003620797,0.00021372736,0.000012205638,0.000020079824,0.00023820128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995232,0.000024354385,0.00011813602,0.00014363012,0.000058111873,0.00013255233],"domain_scores_gemma":[0.99965745,0.00006825941,0.00001529151,0.00015996682,0.000026004796,0.00007303146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006246738,0.00010539753,0.00009994914,0.00006325993,0.000104925406,0.000014521345,0.000055989243,0.000059462152,0.000034743738],"category_scores_gemma":[0.000014476315,0.000098648066,0.00003500596,0.00025585064,0.0000201555,0.000039571016,0.00000459663,0.00010119856,0.00014599184],"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.000003948691,0.00003491034,0.000037662187,0.000030030675,0.000029089842,5.4297686e-7,0.00022284461,0.0001504352,0.0061711934,0.9911821,0.00025095986,0.00188632],"study_design_scores_gemma":[0.0015223671,0.00021659955,0.0044616368,0.00011628482,0.00013468362,0.000047642872,0.0004063105,0.025129372,0.13373731,0.10743366,0.7254228,0.0013713249],"about_ca_topic_score_codex":8.31909e-7,"about_ca_topic_score_gemma":0.000001581361,"teacher_disagreement_score":0.8837484,"about_ca_system_score_codex":0.0000068503664,"about_ca_system_score_gemma":0.000004681549,"threshold_uncertainty_score":0.40227512},"labels":[],"label_agreement":null},{"id":"W2041202338","doi":"10.4153/cmb-2006-047-9","title":"On Sequences of Squares with Constant Second Differences","year":2006,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monotone polygon; Constant (computer programming); Property (philosophy); Least-squares function approximation; Combinatorics; Pure mathematics; Discrete mathematics; Statistics; Geometry","score_opus":0.0045014508442050875,"score_gpt":0.1526489958083323,"score_spread":0.14814754496412721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041202338","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.86131287,0.00011951631,0.00026755527,0.00010376496,0.000035897407,0.00010968385,0.000042729145,0.0000464032,0.1379616],"genre_scores_gemma":[0.999279,6.828474e-7,0.00012982229,0.000034018525,0.000017772123,0.0000145934955,0.0000023604473,0.000013613997,0.00050811155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993599,0.000023376306,0.00019315297,0.00009551108,0.000108353626,0.00021970336],"domain_scores_gemma":[0.9995141,0.00016354624,0.000023275468,0.00014033938,0.000019373341,0.0001393714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000093417,0.00011879898,0.00020540929,0.00008254775,0.000036360187,0.000020549742,0.00010892252,0.00005365078,0.009014174],"category_scores_gemma":[0.000013801699,0.00008654894,0.000032470936,0.00007194091,0.00014404865,0.000010491027,0.0000022806705,0.00007774437,0.00059209316],"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.000007746813,0.000020980513,0.00029100713,0.00043228242,0.000027749393,0.00005251719,0.00015718088,0.00032889194,0.0008603762,0.99028933,0.0074403253,0.00009162238],"study_design_scores_gemma":[0.0013325436,0.0007895055,0.0029070217,0.0026084895,0.00009196655,0.00021205006,0.002304057,0.0021434927,0.029688278,0.91804075,0.038208604,0.001673234],"about_ca_topic_score_codex":0.0004199385,"about_ca_topic_score_gemma":0.0032885799,"teacher_disagreement_score":0.13796617,"about_ca_system_score_codex":0.000029154011,"about_ca_system_score_gemma":0.000031957887,"threshold_uncertainty_score":0.99189174},"labels":[],"label_agreement":null},{"id":"W2042048765","doi":"10.1007/s10623-003-6739-6","title":"Resolvable Maximum Packings with Quadruples","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Block (permutation group theory); Type (biology); Group (periodic table); Physics","score_opus":0.00945934874243578,"score_gpt":0.18325039145913236,"score_spread":0.17379104271669657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042048765","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.897634,0.005409349,0.07624368,0.000086445725,0.00011079377,0.0002981781,0.000019869085,0.0007361119,0.019461561],"genre_scores_gemma":[0.9942474,0.0002631584,0.0052345376,0.000069457434,0.00007971695,0.00003470914,0.0000053592494,0.00003557124,0.000030111452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991935,0.000031273517,0.00016033843,0.00018736215,0.0001241909,0.00030337187],"domain_scores_gemma":[0.9995974,0.000043480013,0.000024757863,0.00020110184,0.000024977595,0.00010832014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017155365,0.00019645703,0.00019704054,0.00017215172,0.0001299115,0.00009177782,0.000103413724,0.000072651776,0.000051591633],"category_scores_gemma":[0.0000017733654,0.00015841855,0.00006846948,0.0003390016,0.00009861612,0.00016121267,0.0000095512405,0.00011148915,0.000014213566],"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.00066847773,0.00040549733,0.08110307,0.0012975762,0.0017775497,0.00013412228,0.009531261,0.022414625,0.08411877,0.61997193,0.029441364,0.14913578],"study_design_scores_gemma":[0.0048876125,0.0014022547,0.017873194,0.00089996675,0.00040961115,0.00044457297,0.0059236446,0.021188915,0.052409224,0.07144512,0.81897247,0.0041434085],"about_ca_topic_score_codex":0.000013435196,"about_ca_topic_score_gemma":0.00004270968,"teacher_disagreement_score":0.7895311,"about_ca_system_score_codex":0.000006189438,"about_ca_system_score_gemma":0.0000043022937,"threshold_uncertainty_score":0.64601207},"labels":[],"label_agreement":null},{"id":"W2042411230","doi":"10.1142/s0218195911003718","title":"STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":"Polyhedron; Mathematics; Regular polygon; Dihedral angle; Uniqueness; Combinatorics; Enhanced Data Rates for GSM Evolution; Geometry; Mathematical analysis; Computer science","score_opus":0.015015808765644074,"score_gpt":0.24725560740559002,"score_spread":0.23223979863994595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042411230","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.036283877,0.000508626,0.9569584,0.00010093552,0.0008405165,0.00032735802,0.0001464089,0.00007213492,0.004761717],"genre_scores_gemma":[0.98370147,0.000021240898,0.01516088,0.00010286068,0.000745757,0.00012753964,0.00005171889,0.000028461536,0.00006008883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863213,0.000025244848,0.00061965804,0.00011944554,0.0004475958,0.00015593584],"domain_scores_gemma":[0.9984361,0.00021188514,0.00024433414,0.00010989938,0.00088594324,0.000111817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037006967,0.00014641727,0.00018815236,0.0004974491,0.00007364649,0.00004659897,0.00058716926,0.0000646543,0.00020192911],"category_scores_gemma":[0.000019280442,0.00014300301,0.00023291826,0.00027971133,0.000070039765,0.00025219194,0.000024162528,0.00016067865,0.00004481248],"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.00025542275,0.00033304826,0.0010656511,0.00005753936,0.0012106582,0.000011329726,0.0005207687,0.092356905,0.0005996979,0.8417095,0.0014025813,0.06047692],"study_design_scores_gemma":[0.0018861728,0.00022163201,0.009815571,0.0000820762,0.0001205111,0.000734412,0.00040180903,0.0140971765,0.0016192185,0.81174946,0.15873559,0.00053639134],"about_ca_topic_score_codex":0.0000011766269,"about_ca_topic_score_gemma":6.6282917e-7,"teacher_disagreement_score":0.94741756,"about_ca_system_score_codex":0.000066279055,"about_ca_system_score_gemma":0.00006209569,"threshold_uncertainty_score":0.5831493},"labels":[],"label_agreement":null},{"id":"W2042593547","doi":"10.1016/j.laa.2014.06.045","title":"The principal rank characteristic sequence over various fields","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Iowa State University","keywords":"Rank (graph theory); Mathematics; Sequence (biology); Combinatorics; Principal (computer security); Field (mathematics); Order (exchange); Matrix (chemical analysis); Principal component analysis; Position (finance); Pure mathematics; Statistics; Chemistry","score_opus":0.008323045199526983,"score_gpt":0.21922469972582195,"score_spread":0.21090165452629497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042593547","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.9170928,0.0010381638,0.07058379,0.000353257,0.00033668525,0.0007248003,0.000032894754,0.0004322516,0.009405358],"genre_scores_gemma":[0.99895656,0.00013793935,0.00004321459,0.000079552956,0.00019825409,0.00017828657,0.000009149355,0.000012473327,0.00038456498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995423,0.000020159081,0.00013622137,0.00010868012,0.00005769795,0.00013492414],"domain_scores_gemma":[0.99956405,0.00012159346,0.000020944553,0.0002196338,0.000018604622,0.00005519648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013293438,0.00008292155,0.00007997065,0.000016075417,0.0002126466,0.00004015132,0.00012518452,0.00005578817,0.000018661922],"category_scores_gemma":[0.00001595173,0.00006192061,0.00002503503,0.00008794476,0.000030264113,0.000043299886,0.000017253718,0.00011135068,0.00008175845],"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.000008679832,0.000019931176,0.00019741281,0.00010062938,0.0000492056,5.662134e-7,0.00041006904,0.00028405178,0.0066481996,0.97263837,0.00030358386,0.019339312],"study_design_scores_gemma":[0.00035625792,0.000051043975,0.006212028,0.000026323834,0.00004385847,0.000026227379,0.00004042746,0.17879508,0.001714487,0.02119384,0.79116476,0.00037564896],"about_ca_topic_score_codex":0.0000027466524,"about_ca_topic_score_gemma":0.0000052446926,"teacher_disagreement_score":0.9514445,"about_ca_system_score_codex":0.000005115362,"about_ca_system_score_gemma":0.000004246884,"threshold_uncertainty_score":0.25250494},"labels":[],"label_agreement":null},{"id":"W2042786892","doi":"10.1007/s10623-003-6740-0","title":"A Recursive Construction for New Symmetric Designs","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Central Michigan University","keywords":"Integer (computer science); Prime (order theory); Mathematics; Construct (python library); Combinatorics; Prime power; Discrete mathematics; Computer science","score_opus":0.02292562942737984,"score_gpt":0.2237173399532567,"score_spread":0.20079171052587688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042786892","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.09243771,0.0051839896,0.89773035,0.0000713178,0.00040484185,0.00065786915,0.000036424786,0.0004046895,0.0030728017],"genre_scores_gemma":[0.9517672,0.00042913642,0.047276497,0.000063339714,0.00029589204,0.000082825485,0.000012622475,0.00003783626,0.00003464805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914825,0.000037347658,0.00022078223,0.00020745637,0.00009298844,0.000293173],"domain_scores_gemma":[0.9994635,0.0001418333,0.000040300387,0.0001522995,0.000042034604,0.00016002619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018689904,0.00019681663,0.00022324453,0.00041794384,0.00013749278,0.00007305324,0.00009479836,0.000114910596,0.000026632059],"category_scores_gemma":[0.000013596635,0.00019290151,0.00015332295,0.0006376639,0.00007381522,0.00015343264,0.0000065247395,0.00009063707,0.0000074958275],"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.00013024165,0.00005055336,0.0015253269,0.00020712499,0.0003958364,0.0000028976729,0.0010055064,0.0016986068,0.01345196,0.7428806,0.014341342,0.22431004],"study_design_scores_gemma":[0.007287496,0.00165198,0.0031914883,0.0004603309,0.0007806233,0.00040771486,0.003904022,0.022149267,0.07117105,0.49409527,0.39158988,0.0033108795],"about_ca_topic_score_codex":0.0000073513324,"about_ca_topic_score_gemma":0.000008327689,"teacher_disagreement_score":0.8593295,"about_ca_system_score_codex":0.000014003408,"about_ca_system_score_gemma":0.000011963204,"threshold_uncertainty_score":0.78662956},"labels":[],"label_agreement":null},{"id":"W2043233494","doi":"10.1007/s10623-007-9166-2","title":"On the existence of nearly Kirkman triple systems with subsystems","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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","funders":"Shanghai Jiao Tong University","keywords":"Embedding; Combinatorics; Mathematics; Triple system; Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.023992949675428484,"score_gpt":0.1781646385760412,"score_spread":0.15417168890061272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043233494","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.9789255,0.0023162446,0.012160277,0.000009134106,0.00022490488,0.00046532135,0.000020841415,0.0001516842,0.0057260706],"genre_scores_gemma":[0.9995482,0.00015262049,0.0000979051,0.000015682248,0.000035202927,0.00008332894,0.0000024617439,0.000027860591,0.000036766498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989582,0.00012389585,0.0002680818,0.00018087996,0.0002313402,0.00023765047],"domain_scores_gemma":[0.99926543,0.00018684873,0.00007048138,0.00034664338,0.00005121249,0.000079405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030038907,0.00020645707,0.0003068824,0.00015249182,0.00020234514,0.000044670225,0.00018488201,0.00007100236,0.000007719221],"category_scores_gemma":[0.0000056040712,0.00012630486,0.000096572905,0.0005114556,0.0002424001,0.000075651944,0.000007449905,0.00012770345,0.000004546086],"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.0003206031,0.00014017723,0.02066869,0.000937331,0.0006847008,0.000082059145,0.0048804674,0.0060717086,0.012851927,0.94910336,0.0038904257,0.0003685836],"study_design_scores_gemma":[0.0333411,0.03270042,0.22650199,0.020662302,0.00243815,0.009859485,0.0981055,0.23647794,0.12832409,0.09491095,0.0957453,0.020932786],"about_ca_topic_score_codex":0.0000622051,"about_ca_topic_score_gemma":0.000007112709,"teacher_disagreement_score":0.8541924,"about_ca_system_score_codex":0.000005521166,"about_ca_system_score_gemma":0.00000835181,"threshold_uncertainty_score":0.51505625},"labels":[],"label_agreement":null},{"id":"W2043278008","doi":"10.1016/j.disc.2013.08.020","title":"Recursive construction of non-cyclic pandiagonal Latin squares","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Orthogonality; Mathematics; Latin square; Integer (computer science); Construct (python library); Order (exchange); Least-squares function approximation; Cyclic group; Combinatorics; Discrete mathematics; Algorithm; Statistics; Computer science","score_opus":0.006462384230597858,"score_gpt":0.1989928853913748,"score_spread":0.19253050116077694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043278008","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.9671589,0.0000666869,0.014967481,0.000013945256,0.00023734174,0.00027073608,0.000019299905,0.000090263246,0.017175337],"genre_scores_gemma":[0.99152184,0.000011086895,0.008273293,0.0000036227405,0.000038823135,0.000038144182,0.000008935024,0.000021377593,0.00008287597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936223,0.000015467247,0.00028997197,0.00007312232,0.000118713884,0.00014048815],"domain_scores_gemma":[0.999573,0.000082213155,0.00007384393,0.00018859353,0.000037544578,0.00004482942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080996084,0.00011545183,0.00020734055,0.00008076358,0.000028660676,0.000019889765,0.00009374539,0.00006349752,0.00021389664],"category_scores_gemma":[0.000022914259,0.000098867895,0.00007327995,0.0001394038,0.00006978221,0.000093996765,0.00001225415,0.00007402117,0.00011348746],"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.000021286189,0.00019309568,0.007877381,0.006466036,0.00077621615,0.000008384121,0.032989774,0.0043681352,0.09972138,0.8246942,0.0059661698,0.016917937],"study_design_scores_gemma":[0.0011916601,0.00020668203,0.0075072865,0.0012241409,0.0001566397,0.00007502084,0.018427767,0.099583246,0.08668677,0.783111,0.0007533721,0.0010764461],"about_ca_topic_score_codex":0.0000063164966,"about_ca_topic_score_gemma":0.0000011621305,"teacher_disagreement_score":0.09521511,"about_ca_system_score_codex":0.000010468442,"about_ca_system_score_gemma":0.000004101864,"threshold_uncertainty_score":0.40317157},"labels":[],"label_agreement":null},{"id":"W2043757383","doi":"10.4153/cmb-2007-050-x","title":"Asymptotic Existence of Resolvable Graph Designs","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Combinatorics; Partition (number theory); Graph; Vertex (graph theory); Simple graph; Discrete mathematics","score_opus":0.014701720855173444,"score_gpt":0.19665776288759879,"score_spread":0.18195604203242535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043757383","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.5074368,0.0006677065,0.051942255,0.00019440599,0.00043442566,0.0004776205,0.000024562012,0.00027178784,0.4385504],"genre_scores_gemma":[0.997686,0.0000032460962,0.0015453452,0.00005348965,0.000032088345,0.000007894256,0.0000017125997,0.000027576585,0.0006426409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989365,0.000024477888,0.00034250642,0.00011705032,0.00013204254,0.0004474635],"domain_scores_gemma":[0.9989725,0.0002604738,0.000025793339,0.0002796384,0.00003351672,0.00042810108],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006889421,0.00013027099,0.00022367277,0.00018729699,0.00004862743,0.0000149709795,0.00020207147,0.00010139914,0.0029963993],"category_scores_gemma":[0.00013232027,0.00012781027,0.00007773173,0.00022641479,0.000094811876,0.000017566075,0.0000068501386,0.000119230805,0.001966175],"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.000017034106,0.00005412553,0.00035595888,0.0013250919,0.00011155495,0.00020128915,0.0010596305,0.00060922134,0.004664818,0.96794075,0.022435542,0.0012250039],"study_design_scores_gemma":[0.0017207643,0.00041105688,0.003927697,0.0023587141,0.00021195743,0.00044653332,0.003810086,0.004393682,0.046013292,0.6633406,0.27061564,0.002749981],"about_ca_topic_score_codex":0.00023222272,"about_ca_topic_score_gemma":0.00061051105,"teacher_disagreement_score":0.49024916,"about_ca_system_score_codex":0.00005808306,"about_ca_system_score_gemma":0.00002836019,"threshold_uncertainty_score":0.9988109},"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":"W2045116509","doi":"10.1155/asp.2005.1603","title":"Analysis of Optical CDMA Signal Transmission: Capacity Limits and Simulation Results","year":2005,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","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":"McGill University","funders":"","keywords":"Code division multiple access; Computer science; Bit error rate; Transmission (telecommunications); Additive white Gaussian noise; Turbo code; Electronic engineering; Channel (broadcasting); Throughput; Binary number; Decoding methods; Computer network; Telecommunications; Algorithm; Mathematics; Engineering; Wireless; Arithmetic","score_opus":0.018063042931133245,"score_gpt":0.2725134626304974,"score_spread":0.25445041969936416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045116509","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.8747874,0.007358241,0.11410917,0.000065966466,0.00007563244,0.00009482525,0.0000073855085,0.000057322362,0.0034440474],"genre_scores_gemma":[0.99765944,0.0002521594,0.0018810644,0.00002487887,0.00015072578,0.0000016262145,0.0000020185298,0.00001741005,0.000010700523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836737,0.000102763515,0.0007388191,0.00019402381,0.0003514841,0.00024552183],"domain_scores_gemma":[0.9992326,0.0002893661,0.00017815776,0.00007612343,0.000081399136,0.0001423804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073024596,0.00019044481,0.00039332267,0.00050184585,0.000118655604,0.00006371831,0.00012561781,0.000088761226,0.0000318537],"category_scores_gemma":[0.00003305108,0.00016262471,0.00010941144,0.0008162499,0.000080436446,0.00082571345,0.000005114475,0.0004489691,0.0000014877146],"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.00019188886,0.0000375441,0.0005166369,0.00006446801,0.000044400233,0.000009865001,0.0005700087,0.72289324,0.0029600866,0.00006368045,0.0000012278434,0.27264696],"study_design_scores_gemma":[0.0009445172,0.00016224652,0.0031020332,0.00060958375,0.00015280044,0.00004086981,0.0001881741,0.98390925,0.007793932,0.00069554854,0.0021328595,0.00026820527],"about_ca_topic_score_codex":2.5369604e-7,"about_ca_topic_score_gemma":0.0000036616798,"teacher_disagreement_score":0.27237877,"about_ca_system_score_codex":0.000055175926,"about_ca_system_score_gemma":0.000015777667,"threshold_uncertainty_score":0.6631643},"labels":[],"label_agreement":null},{"id":"W2045160518","doi":"10.1016/s0012-365x(00)00302-2","title":"Steiner pentagon covering designs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Pentagon; Combinatorics; Mathematics; Path (computing); Graph; Order (exchange); Undirected graph; Discrete mathematics; Geometry; Computer science","score_opus":0.020964857172028985,"score_gpt":0.2246420895706413,"score_spread":0.20367723239861232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045160518","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.76849484,0.00026513357,0.13214862,0.000017234106,0.00041762122,0.00024937728,0.000009513402,0.00058611773,0.097811535],"genre_scores_gemma":[0.9973413,0.000034871427,0.0015617836,0.00001403849,0.00007293415,0.000019240406,0.000006238505,0.000045721572,0.0009039094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930876,0.00001451616,0.0002238818,0.00009297149,0.00013451575,0.00022536983],"domain_scores_gemma":[0.9995856,0.000043867385,0.000027942911,0.00026522714,0.000012297979,0.00006501912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014971895,0.00014833383,0.00017563498,0.000050349543,0.00004979161,0.000046868256,0.00014387116,0.000051666135,0.00017031151],"category_scores_gemma":[0.000011998818,0.00013084848,0.00007282462,0.00013155975,0.000020230844,0.000105390915,0.000019375477,0.00008440848,0.00022524271],"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.00006867375,0.00038397635,0.0056289774,0.004900817,0.001008761,0.00042899972,0.026978353,0.07731145,0.24297309,0.6188473,0.012584768,0.008884828],"study_design_scores_gemma":[0.0031524203,0.00032234413,0.0012725997,0.001601832,0.00039625156,0.00089886534,0.014183782,0.63620484,0.081959106,0.15094773,0.10501475,0.0040454706],"about_ca_topic_score_codex":0.0000018029228,"about_ca_topic_score_gemma":0.0000025040185,"teacher_disagreement_score":0.5588934,"about_ca_system_score_codex":0.000022416882,"about_ca_system_score_gemma":0.000002888078,"threshold_uncertainty_score":0.5335846},"labels":[],"label_agreement":null},{"id":"W2045559318","doi":"10.1007/s00373-003-0527-y","title":"On a Decomposition of Complete Graphs","year":2003,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Prime power; Discrete mathematics; Graph; Strongly regular graph; Prime (order theory); Pathwidth; Line graph","score_opus":0.007840884330635641,"score_gpt":0.19614832992341494,"score_spread":0.1883074455927793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045559318","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.9837166,0.00074255606,0.00031217985,0.00000308658,0.00050295505,0.000095598945,0.000008223655,0.00009545763,0.014523365],"genre_scores_gemma":[0.9998039,0.000108964385,0.000027144168,0.000015517222,0.0000015410909,0.000009456314,0.0000034803857,0.0000140406355,0.000015940166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999445,0.000042724078,0.00016636246,0.00010387093,0.00010126311,0.00014074145],"domain_scores_gemma":[0.9996759,0.00005518977,0.000029079074,0.00015326009,0.000026034126,0.000060483697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012811364,0.00011719452,0.0001683166,0.00013957226,0.00006220676,0.000012859285,0.000059966027,0.000057544636,0.000008848868],"category_scores_gemma":[0.0000057133557,0.00011414583,0.00006711537,0.00032014484,0.00003854163,0.000039523067,0.00000473117,0.000088630884,0.000003635403],"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.000005227601,0.000039093407,0.0011621361,0.00006332767,0.000026851627,0.000001973047,0.000080178055,0.00009183463,0.0012711802,0.9968459,0.00025136655,0.00016094722],"study_design_scores_gemma":[0.00051576766,0.00016227615,0.00206826,0.000043117834,0.000016074771,0.000012539532,0.00007198613,0.0003418178,0.0028672265,0.99238276,0.0013495014,0.00016868189],"about_ca_topic_score_codex":0.0000027866838,"about_ca_topic_score_gemma":5.294829e-7,"teacher_disagreement_score":0.016087338,"about_ca_system_score_codex":0.000006851483,"about_ca_system_score_gemma":0.0000031712157,"threshold_uncertainty_score":0.46547318},"labels":[],"label_agreement":null},{"id":"W2045656598","doi":"10.1007/s10623-005-3256-9","title":"Super-simple (ν, 5, 5) Designs","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Beijing Institute For Brain Disorders","keywords":"Simple (philosophy); Computer science; Block (permutation group theory); Hash function; Block code; Arithmetic; Mathematics; Algorithm; Theoretical computer science; Combinatorics; Decoding methods; Programming language","score_opus":0.013824033353011033,"score_gpt":0.19672450476921718,"score_spread":0.18290047141620616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045656598","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.83441466,0.003794897,0.14471075,0.000015918547,0.00023819692,0.00029005774,0.00004033241,0.00074268546,0.015752474],"genre_scores_gemma":[0.99823225,0.000115204464,0.0013599691,0.00003551362,0.000116588635,0.000044161112,0.000026077927,0.000040439776,0.000029826742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989788,0.000060107122,0.00024234822,0.00021623823,0.00012969862,0.0003728145],"domain_scores_gemma":[0.9995442,0.000083232364,0.000021345099,0.00022524358,0.000026699707,0.00009925244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019973726,0.00023451775,0.00023630547,0.00021618519,0.00016352649,0.00010119049,0.00012769188,0.00010842966,0.00007516444],"category_scores_gemma":[0.0000028793709,0.00022083457,0.00013844516,0.00042041927,0.00010074127,0.0001278001,0.000012794085,0.000112639995,0.00001841448],"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.00007382572,0.0002012604,0.060876843,0.00043191502,0.000369193,0.00008063953,0.0008265515,0.0042958646,0.19583377,0.68001175,0.045926154,0.011072215],"study_design_scores_gemma":[0.0038109834,0.00075799465,0.061505303,0.00024031635,0.00039066796,0.00028956524,0.0025904507,0.016212007,0.078047,0.5889865,0.24292941,0.0042397967],"about_ca_topic_score_codex":0.00005917369,"about_ca_topic_score_gemma":0.000036646776,"teacher_disagreement_score":0.19700326,"about_ca_system_score_codex":0.00000710378,"about_ca_system_score_gemma":0.0000047177514,"threshold_uncertainty_score":0.90053725},"labels":[],"label_agreement":null},{"id":"W2045862997","doi":"10.1016/s0024-3795(03)00421-x","title":"Fractional Hadamard powers of positive semidefinite matrices","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Rank (graph theory); Integer (computer science); Quotient; Positive-definite matrix; Hadamard product; Hadamard matrix; Discrete mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Physics","score_opus":0.005745787963415875,"score_gpt":0.20671861240279749,"score_spread":0.2009728244393816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045862997","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.84391296,0.009455689,0.046308167,0.0001427605,0.00027850844,0.0009193701,0.0002897265,0.00034510813,0.09834774],"genre_scores_gemma":[0.9990532,0.00020991734,0.00042185927,0.000026854977,0.000034672168,0.000058818827,0.000018029732,0.000012107245,0.00016457013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995807,0.00001693097,0.0001497942,0.00009605651,0.00006767962,0.00008885599],"domain_scores_gemma":[0.99969536,0.000087086606,0.00003176412,0.00009809339,0.00004017462,0.00004752941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000757461,0.000076099896,0.00009742868,0.00005841781,0.00006402696,0.000008900298,0.000047044352,0.000050288687,0.00006241479],"category_scores_gemma":[0.0000091245365,0.00007542602,0.00003365643,0.00019553222,0.000022321616,0.00007021419,0.000005164793,0.000072056355,0.000046556732],"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.0000072215375,0.000045070858,0.00051817414,0.000101319645,0.00009478916,4.6662967e-7,0.00026046677,0.0009676999,0.010410847,0.9864301,0.00047173508,0.0006920999],"study_design_scores_gemma":[0.0018396331,0.00024398003,0.011574624,0.00021312508,0.00032041944,0.00016877215,0.0022855422,0.018915623,0.16463597,0.0886316,0.70957524,0.0015954917],"about_ca_topic_score_codex":0.000002047468,"about_ca_topic_score_gemma":6.7299595e-7,"teacher_disagreement_score":0.89779854,"about_ca_system_score_codex":0.0000057643288,"about_ca_system_score_gemma":0.000007408997,"threshold_uncertainty_score":0.30757838},"labels":[],"label_agreement":null},{"id":"W2046201622","doi":"10.1016/s0378-3758(02)00207-0","title":"Frames with block size four and index three","year":2002,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Type (biology); Block (permutation group theory); Combinatorics; Frame (networking); Index (typography); Block size; Discrete mathematics; Statistics; Computer science","score_opus":0.017824891944218237,"score_gpt":0.22179976195526843,"score_spread":0.2039748700110502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046201622","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.89809024,0.0008444525,0.09893059,0.00004510918,0.0000930579,0.000028975357,0.000010727829,0.000018780016,0.0019380677],"genre_scores_gemma":[0.9976888,0.000052171912,0.0021741448,0.000017810127,0.00004581414,5.203827e-7,8.7115914e-8,0.000006796833,0.000013879695],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99951744,0.000012907718,0.0001840482,0.000055806646,0.000115598225,0.00011422104],"domain_scores_gemma":[0.9992934,0.00044671274,0.00006115851,0.00005461689,0.000034253848,0.000109862245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010512816,0.00008638038,0.00017432478,0.00003253951,0.000067967754,0.000087075445,0.000057943886,0.000043551616,0.000035396537],"category_scores_gemma":[0.000158075,0.000060805138,0.000009356123,0.00003145696,0.00008890657,0.00012060811,0.00001066747,0.00024329261,0.0000013461364],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020249802,0.00006236946,0.91300905,0.00047981608,0.00035697463,0.0010431842,0.0023670366,0.0075424863,0.00052990514,0.041997228,0.004053177,0.028356256],"study_design_scores_gemma":[0.0012588822,0.00082967745,0.8645201,0.0008816072,0.000075089396,0.0012429464,0.00041514807,0.10218157,0.00004681332,0.02736461,0.0008024071,0.00038118265],"about_ca_topic_score_codex":0.0000029661023,"about_ca_topic_score_gemma":0.0000015784052,"teacher_disagreement_score":0.099598534,"about_ca_system_score_codex":0.000004204729,"about_ca_system_score_gemma":0.00000335715,"threshold_uncertainty_score":0.24795616},"labels":[],"label_agreement":null},{"id":"W2046260624","doi":"10.1007/s00373-007-0696-1","title":"Colouring Cubic Graphs by Small Steiner Triple Systems","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Cubic graph; Steiner system; Petersen graph; Vertex (graph theory); Graph; Discrete mathematics; Order (exchange); Line graph; Graph power; Voltage graph","score_opus":0.006570819486693912,"score_gpt":0.1749046238534504,"score_spread":0.1683338043667565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046260624","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.97612447,0.0126125,0.0009405814,0.000005983242,0.002770224,0.00029703756,0.000015206581,0.00046690545,0.006767082],"genre_scores_gemma":[0.99881387,0.00036963698,0.00001140209,0.000016576661,0.00002217818,0.000027948483,0.000011031007,0.000048473386,0.0006788677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863607,0.00004018625,0.00038575032,0.00024607388,0.00019189544,0.00050004106],"domain_scores_gemma":[0.9993115,0.00007966767,0.000058518937,0.0002768876,0.000051438,0.00022197641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063542963,0.00027003695,0.00032341687,0.00024251018,0.00019995713,0.00009731463,0.00019166796,0.00018382787,0.000004874873],"category_scores_gemma":[0.000008076004,0.00026335733,0.000102699836,0.000669772,0.00005772618,0.000097720185,0.0000292494,0.00024177335,0.000008369407],"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.00003540831,0.0001338573,0.012766059,0.00056050374,0.00021040658,0.000066945395,0.0004961393,0.00020001929,0.0071431724,0.9693964,0.007475515,0.001515562],"study_design_scores_gemma":[0.013763206,0.0016667057,0.017438347,0.0009077691,0.0005473527,0.00062083564,0.009371674,0.014289421,0.025486005,0.58528256,0.3241105,0.006515615],"about_ca_topic_score_codex":0.00005286502,"about_ca_topic_score_gemma":0.000008422696,"teacher_disagreement_score":0.38411385,"about_ca_system_score_codex":0.00003186471,"about_ca_system_score_gemma":0.000005874404,"threshold_uncertainty_score":0.9999819},"labels":[],"label_agreement":null},{"id":"W2047127803","doi":"10.1007/s10623-005-2140-y","title":"Classification and Constructions of Complete Caps in Binary Spaces","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"Equivalence (formal languages); Mathematics; Dependency (UML); Combinatorics; Binary number; Projective test; Discrete mathematics; Pure mathematics; Computer science; Arithmetic; Artificial intelligence","score_opus":0.017507920630705602,"score_gpt":0.20007116234668312,"score_spread":0.18256324171597751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047127803","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.99249405,0.0017930664,0.0035750333,0.0000122972315,0.00005556436,0.00010679784,0.000025465335,0.00005072493,0.001887003],"genre_scores_gemma":[0.9988054,0.00018323422,0.00096176,0.0000028734119,0.000013343988,0.000014288141,0.000009127662,0.0000077831055,0.0000021824587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99954504,0.0000362237,0.00016824488,0.000100793506,0.000047747573,0.00010194782],"domain_scores_gemma":[0.99980396,0.000044092583,0.000028616983,0.00008290165,0.0000146041375,0.000025815249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009612207,0.00008658477,0.00014066693,0.00023976565,0.00004653864,0.000020876934,0.00003253412,0.000048080597,0.0000050864187],"category_scores_gemma":[0.0000011932814,0.00008510583,0.00003085778,0.00028830618,0.00016852241,0.000060751514,0.000005069158,0.000053278174,4.0090362e-7],"study_design_candidate":"observational","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.000020606221,0.0000453017,0.32117045,0.00023967231,0.000047553916,0.0000037874975,0.0003842263,0.0008987405,0.22627217,0.44912252,0.0003430815,0.0014518909],"study_design_scores_gemma":[0.0009230806,0.00012735355,0.9221361,0.00016261727,0.00004940356,0.000051006708,0.0035549712,0.014483649,0.0025064363,0.053009506,0.0025611783,0.00043466623],"about_ca_topic_score_codex":0.000075503114,"about_ca_topic_score_gemma":0.00005141295,"teacher_disagreement_score":0.6009657,"about_ca_system_score_codex":0.0000027363103,"about_ca_system_score_gemma":0.0000022825006,"threshold_uncertainty_score":0.3470515},"labels":[],"label_agreement":null},{"id":"W2047595535","doi":"10.1016/j.ejc.2008.01.002","title":"Equiangular lines, mutually unbiased bases, and spin models","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":168,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Mutually unbiased bases; Combinatorics; Conjecture; Prime (order theory); Commutative property; Association scheme; Prime power; Discrete mathematics; Pure mathematics; Hilbert space","score_opus":0.019168578521812116,"score_gpt":0.18193559893691938,"score_spread":0.16276702041510727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047595535","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.96552163,0.0050309496,0.01654044,0.00002984146,0.0011170553,0.000060562295,0.0000032000269,0.00008037078,0.011615923],"genre_scores_gemma":[0.99890375,0.00053584424,0.00016772338,0.000039388895,0.00015881856,2.5119917e-7,0.0000010724624,0.000049838865,0.0001433276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884164,0.00021697383,0.00045583534,0.00008000986,0.00022738423,0.00017816988],"domain_scores_gemma":[0.999366,0.000044921373,0.0001237302,0.00016655202,0.00012259497,0.00017621831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161964,0.0001531057,0.0002444217,0.00014365042,0.00007857501,0.000026567808,0.00021894381,0.00002679761,0.000007943542],"category_scores_gemma":[0.000037449874,0.00014101867,0.00008843645,0.00019919859,0.000047909787,0.00022089251,0.000026875117,0.00026503258,0.000013035567],"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.0006156438,0.001411917,0.009726401,0.0016292938,0.0018447939,0.04596396,0.016270831,0.29642016,0.033031113,0.46168104,0.10332186,0.028082987],"study_design_scores_gemma":[0.035406873,0.008013596,0.03437653,0.0033272463,0.000826486,0.034298286,0.0026121638,0.23944761,0.017806366,0.14368406,0.47360116,0.006599602],"about_ca_topic_score_codex":5.8362866e-7,"about_ca_topic_score_gemma":1.1392751e-7,"teacher_disagreement_score":0.3702793,"about_ca_system_score_codex":0.000025260066,"about_ca_system_score_gemma":0.000019978355,"threshold_uncertainty_score":0.57505745},"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":"W2048687076","doi":"10.1016/s0378-3758(99)00114-7","title":"Perfect Mendelsohn designs with block size six","year":2000,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Saint Vincent University; National Science Foundation","keywords":"Mod; Mathematics; Combinatorics; Block (permutation group theory); Block design; Discrete mathematics; Arithmetic; Statistics","score_opus":0.01586154293082328,"score_gpt":0.24391740490041883,"score_spread":0.22805586196959554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048687076","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.94516957,0.000522413,0.044692338,0.000017770419,0.00009214934,0.000045164197,0.000018521478,0.000039827493,0.009402274],"genre_scores_gemma":[0.9968506,0.000047483893,0.0029587103,0.000019760395,0.00005487373,9.0117794e-7,5.786862e-7,0.000009564928,0.000057525518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99935496,0.00004104606,0.00023865633,0.00006538998,0.00014345895,0.0001564846],"domain_scores_gemma":[0.99912685,0.0006122388,0.000038964037,0.000053501164,0.000036383084,0.00013207327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020284801,0.00010460414,0.00020622833,0.000035781635,0.00005396441,0.000048329282,0.0000675712,0.000040573665,0.0002329754],"category_scores_gemma":[0.000068211186,0.000075195916,0.000017773833,0.00006474816,0.000058248934,0.000113951086,0.0000032350013,0.00024190696,0.000007741466],"study_design_candidate":"observational","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.0042382674,0.0005679745,0.12050591,0.0017567907,0.0021992226,0.0060048182,0.018935742,0.41252965,0.021568239,0.1135633,0.027223257,0.27090684],"study_design_scores_gemma":[0.014323036,0.019854937,0.5700406,0.009581932,0.001408323,0.017480584,0.0054061706,0.20085534,0.006201897,0.11000181,0.039461013,0.005384374],"about_ca_topic_score_codex":0.0000028082036,"about_ca_topic_score_gemma":4.5302687e-7,"teacher_disagreement_score":0.44953468,"about_ca_system_score_codex":0.00001002878,"about_ca_system_score_gemma":0.000017277676,"threshold_uncertainty_score":0.30664006},"labels":[],"label_agreement":null},{"id":"W2048775750","doi":"10.1007/s11083-014-9340-x","title":"Generalized Laminar Families and Certain Forbidden Matrices","year":2014,"lang":"en","type":"article","venue":"Order","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Laminar flow; Mathematics; Disjoint sets; Combinatorics; Discrete mathematics; Physics; Thermodynamics","score_opus":0.004958774077755051,"score_gpt":0.1872343444408253,"score_spread":0.18227557036307024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048775750","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.9792916,0.0009132853,0.0016637276,0.000029966594,0.00018878857,0.000060933977,0.0000018250277,0.00015925558,0.017690618],"genre_scores_gemma":[0.9982329,0.00011269165,0.00053356413,0.000031958287,0.00007440332,0.000011920349,0.0000026060486,0.000016499764,0.000983433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965507,0.000026677559,0.0000781318,0.00007552945,0.000046655754,0.00011793412],"domain_scores_gemma":[0.99981666,0.000028474253,0.000009212832,0.00010531752,0.000010959991,0.000029387687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010507034,0.00007692533,0.00009751445,0.000043234235,0.000037738715,0.000024072266,0.000053266875,0.000042534524,0.000052012703],"category_scores_gemma":[0.000009111882,0.000066650755,0.00001704728,0.0000890823,0.000017439948,0.0000528819,0.00001044375,0.000037170852,0.000049247847],"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.000101621335,0.00009746798,0.039761957,0.0023308527,0.00056418945,0.0000277391,0.011287926,0.013532423,0.082371764,0.58744633,0.050537273,0.21194044],"study_design_scores_gemma":[0.0017823211,0.000112044916,0.009346787,0.00008912235,0.000066903005,0.000041436204,0.0013771313,0.07985232,0.0048352736,0.021170141,0.8804153,0.00091117836],"about_ca_topic_score_codex":0.000020559668,"about_ca_topic_score_gemma":0.000016454465,"teacher_disagreement_score":0.8298781,"about_ca_system_score_codex":0.0000034437119,"about_ca_system_score_gemma":0.00000135736,"threshold_uncertainty_score":0.2717939},"labels":[],"label_agreement":null},{"id":"W2049216882","doi":"10.1016/j.disc.2009.05.019","title":"Hamiltonicity and restricted block-intersection graphs of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>t</mml:mi></mml:math>-designs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Mathematics; Intersection graph; Intersection (aeronautics); Graph; Vertex (graph theory); Block (permutation group theory); Discrete mathematics; Line graph","score_opus":0.01453078966665457,"score_gpt":0.22596034589161323,"score_spread":0.21142955622495865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049216882","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.9926034,0.0002499334,0.003424256,0.000029085664,0.00037811827,0.000106496664,0.000067112895,0.0002516,0.0028899533],"genre_scores_gemma":[0.99777776,0.0001532583,0.001682304,0.000046791592,0.00010859921,0.000049238093,0.000052591076,0.00008703937,0.00004242409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998045,0.00005896117,0.0007038007,0.00032779918,0.0004199937,0.00044441805],"domain_scores_gemma":[0.9986135,0.0002203334,0.00031777984,0.0006434575,0.00004609034,0.00015888829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040657903,0.00033986304,0.00031814506,0.0001581194,0.00021066859,0.00012474248,0.00030406468,0.00034979836,0.000013166528],"category_scores_gemma":[0.00013992279,0.00037066758,0.00032008818,0.0003530559,0.00015877174,0.00025233577,0.00008870925,0.0003469143,0.00006104933],"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.00007058527,0.00009212009,0.000011590867,0.00069339323,0.00020327998,0.000037063044,0.0018500107,0.0017645725,0.010491683,0.9844456,0.00017551282,0.000164636],"study_design_scores_gemma":[0.0005449253,0.00036345568,0.00017837138,0.0006557424,0.00023675337,0.0001795114,0.0011218973,0.97321427,0.0144988615,0.0084817195,0.00013998026,0.00038448555],"about_ca_topic_score_codex":0.000042918742,"about_ca_topic_score_gemma":0.000028555924,"teacher_disagreement_score":0.97596383,"about_ca_system_score_codex":0.000014707949,"about_ca_system_score_gemma":0.000038263464,"threshold_uncertainty_score":0.99987453},"labels":[],"label_agreement":null},{"id":"W2049246407","doi":"10.1016/j.disc.2011.06.003","title":"Paley graphs have Hamilton decompositions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"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","funders":"Australian Research Council","keywords":"Mathematics; Combinatorics; Discrete mathematics; Chordal graph; Indifference graph; Graph","score_opus":0.020762865953767026,"score_gpt":0.20976294429888379,"score_spread":0.18900007834511676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049246407","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.61548454,0.00027780322,0.051812842,0.000006136066,0.00048039327,0.00034607353,0.000038515504,0.00079006306,0.33076364],"genre_scores_gemma":[0.9927538,0.00002235057,0.0068714293,0.000012876349,0.00002130845,0.000038045095,0.000012121743,0.00004019941,0.00022784283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993176,0.000018375556,0.00024979108,0.00009953969,0.00010371747,0.00021099449],"domain_scores_gemma":[0.9995087,0.000032822674,0.000033250264,0.00032646395,0.000019117706,0.000079679885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116308816,0.00015545997,0.00017776905,0.000079001475,0.00007370287,0.000023882078,0.0001669486,0.000066605025,0.00014374654],"category_scores_gemma":[0.0000053379845,0.00013875405,0.0001131324,0.0001018455,0.000046128636,0.00008411708,0.000012984657,0.00009851993,0.00014344289],"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.000007891059,0.0001607415,0.0010419437,0.00083881797,0.0002875911,0.000034966088,0.041329578,0.0002944872,0.0054176203,0.9487762,0.001380322,0.00042984757],"study_design_scores_gemma":[0.00087435637,0.00015485562,0.0023183145,0.0006607251,0.0002680694,0.0001701176,0.008970635,0.0567861,0.043276336,0.8808987,0.004049623,0.0015721584],"about_ca_topic_score_codex":0.0000030184842,"about_ca_topic_score_gemma":0.000009364503,"teacher_disagreement_score":0.3772693,"about_ca_system_score_codex":0.000010386806,"about_ca_system_score_gemma":0.000002335375,"threshold_uncertainty_score":0.56582266},"labels":[],"label_agreement":null},{"id":"W2049419313","doi":"10.1016/j.ejc.2010.03.008","title":"Subgraphs with orthogonal factorizations and algorithms","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"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; Disjoint sets; Graph; Factorization; Vertex (graph theory); Integer (computer science); Induced subgraph; Discrete mathematics; Algorithm; Computer science","score_opus":0.0033887231626349977,"score_gpt":0.15646074815079491,"score_spread":0.15307202498815992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049419313","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.97779906,0.00022213264,0.011768504,0.000018842946,0.0016264492,0.000038001697,0.000003135893,0.000048648948,0.008475219],"genre_scores_gemma":[0.9994621,0.000047394144,0.00029427855,0.000006582436,0.00011131122,2.3607589e-7,8.6927787e-7,0.00003219999,0.000044994005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993394,0.0000823317,0.00024146568,0.00005633424,0.00016444601,0.00011602142],"domain_scores_gemma":[0.99949795,0.000042875326,0.00009122039,0.00011013615,0.00012258672,0.00013521127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047890126,0.00010593349,0.00014175569,0.00012037157,0.00006422413,0.000048263853,0.00014067558,0.000020106452,0.000014096175],"category_scores_gemma":[0.000020271971,0.00008205455,0.000040596704,0.00021621489,0.00004817508,0.00014397036,0.000010976842,0.0003880422,0.0000048867173],"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.00010289221,0.00035871964,0.13914803,0.00026353542,0.0007409657,0.0016058888,0.0036238912,0.001998545,0.031983864,0.79762083,0.003390486,0.019162327],"study_design_scores_gemma":[0.012120968,0.003880703,0.553735,0.0005900921,0.00048998557,0.009873049,0.001518218,0.0036407693,0.008588271,0.054355454,0.34839568,0.0028117725],"about_ca_topic_score_codex":1.06740444e-7,"about_ca_topic_score_gemma":5.6117796e-7,"teacher_disagreement_score":0.7432654,"about_ca_system_score_codex":0.0000050171816,"about_ca_system_score_gemma":0.0000116288575,"threshold_uncertainty_score":0.33460873},"labels":[],"label_agreement":null},{"id":"W2049467095","doi":"10.1007/s10801-007-0104-1","title":"On Weyl-Heisenberg orbits of equiangular lines","year":2007,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"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; Dimension (graph theory); Prime (order theory); Heisenberg group; Modulo; Characterization (materials science); Fiducial marker; Combinatorics; Pure mathematics; Physics","score_opus":0.0050689516096106895,"score_gpt":0.20425561528276032,"score_spread":0.19918666367314963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049467095","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.98950994,0.0016586643,0.0016603452,0.000031201296,0.003081913,0.00006384424,0.0000016414526,0.00003895216,0.0039535062],"genre_scores_gemma":[0.9995026,0.00006506073,0.00006111526,0.000022531636,0.00017442378,4.1788402e-7,4.877586e-7,0.000030336056,0.00014301098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853337,0.000034872817,0.00071683427,0.000073319134,0.0004022511,0.00023936115],"domain_scores_gemma":[0.9989123,0.0002597971,0.0002640228,0.00020618983,0.00021382484,0.000143897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010222788,0.00016125824,0.00037101377,0.00033037545,0.000034031247,0.000013814229,0.00026866916,0.00011953102,0.00003293254],"category_scores_gemma":[0.0001258039,0.00014075905,0.00020043965,0.00047731036,0.00003355934,0.0001160631,0.000018406836,0.0003200133,0.000011395396],"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.00022249823,0.000504557,0.002203272,0.0005026648,0.0005093545,0.00042986867,0.001153959,0.003952964,0.025492346,0.95326376,0.007072189,0.0046925754],"study_design_scores_gemma":[0.0055227396,0.002887032,0.012112247,0.001341998,0.00026894629,0.000838453,0.0010213334,0.0012398841,0.20130876,0.74763703,0.024681117,0.0011404817],"about_ca_topic_score_codex":0.0000012202612,"about_ca_topic_score_gemma":0.000001075434,"teacher_disagreement_score":0.20562674,"about_ca_system_score_codex":0.00006328595,"about_ca_system_score_gemma":0.00002479456,"threshold_uncertainty_score":0.57399875},"labels":[],"label_agreement":null},{"id":"W2049758775","doi":"10.1109/18.930940","title":"Self-dual codes over F/sub p/ and weighing matrices","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"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":"Dual (grammatical number); Hadamard transform; Block code; Mathematics; Linear code; Combinatorics; Hadamard matrix; Discrete mathematics; Computer science; Algorithm; Decoding methods","score_opus":0.003995417545620764,"score_gpt":0.18270862499340998,"score_spread":0.1787132074477892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049758775","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.42435738,0.0001407295,0.55891,0.000011877908,0.00092646596,0.00019157062,0.000031958174,0.00085514353,0.014574844],"genre_scores_gemma":[0.99924064,0.00039273687,0.00015391098,0.00007866936,0.000033181463,0.00003172189,0.0000035494147,0.000012728146,0.000052856307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993431,0.000049434442,0.00025878672,0.00006235716,0.00012820696,0.00015814275],"domain_scores_gemma":[0.9996251,0.000117824406,0.00003909755,0.00013313782,0.000023034201,0.00006181226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031741205,0.00013591204,0.00011242835,0.00023879232,0.00017959514,0.00008865958,0.000060626564,0.000085112726,0.00010463678],"category_scores_gemma":[0.0000016615235,0.0001305872,0.000051226412,0.00020148934,0.000028927421,0.0013001056,5.0739305e-7,0.00016282918,0.00016266256],"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.00078602374,0.00029643002,0.0001445513,0.0018866324,0.0012690384,0.000020852687,0.043429483,0.3215328,0.006074376,0.2297712,0.0017718705,0.39301676],"study_design_scores_gemma":[0.008442373,0.0007285233,0.0015985983,0.00080873934,0.0007737817,0.0011248355,0.019877162,0.46928778,0.20189975,0.06662716,0.22439496,0.004436341],"about_ca_topic_score_codex":0.0000025227525,"about_ca_topic_score_gemma":0.000002493963,"teacher_disagreement_score":0.5748833,"about_ca_system_score_codex":0.000032521606,"about_ca_system_score_gemma":0.0000060299576,"threshold_uncertainty_score":0.53251916},"labels":[],"label_agreement":null},{"id":"W2049977271","doi":"10.1007/s10114-013-2392-9","title":"Decomposing triples of $\\mathbb{Z}_{p^n } $ and $\\mathbb{Z}_{3p^n } $ into cyclic designs","year":2013,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Discrete mathematics","score_opus":0.010516326961022343,"score_gpt":0.20384515131592787,"score_spread":0.19332882435490553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049977271","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.98225784,0.0006565583,0.00063086953,0.00009490348,0.00041287483,0.0005837499,0.000009764916,0.00062539533,0.014728039],"genre_scores_gemma":[0.9897205,0.00020676616,0.009612015,0.000020822827,0.00010376573,0.00012205442,0.00000670436,0.00008752756,0.00011983486],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800825,0.00011221262,0.0009071757,0.00029846877,0.00024701474,0.0004268774],"domain_scores_gemma":[0.99815047,0.000684527,0.00017724039,0.0006492631,0.00015212448,0.0001863987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004678657,0.00039105362,0.00076135533,0.00017486441,0.00014646865,0.00018906961,0.0003828019,0.00019848015,0.00018623304],"category_scores_gemma":[0.000453451,0.00035221296,0.0001474016,0.00028499542,0.00031044675,0.0010096589,0.00010510871,0.00021525632,0.00004072511],"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.0001476346,0.0007321961,0.0011626277,0.013154647,0.0015282724,0.00002558171,0.14329049,0.00027754167,0.5718654,0.24414934,0.0124459695,0.0112203285],"study_design_scores_gemma":[0.0050859186,0.0014285285,0.008883457,0.0052221753,0.0009140936,0.00050413137,0.067739286,0.014922773,0.31365645,0.5408089,0.035337254,0.005497047],"about_ca_topic_score_codex":0.000012324896,"about_ca_topic_score_gemma":0.0000076258325,"teacher_disagreement_score":0.29665956,"about_ca_system_score_codex":0.000026413183,"about_ca_system_score_gemma":0.000019241188,"threshold_uncertainty_score":0.999893},"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":"W2050672239","doi":"10.1007/s10732-011-9173-3","title":"D-optimal matrices via quadratic integer optimization","year":2011,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Integer (computer science); Integer matrix; Circulant matrix; Matrix (chemical analysis); Mathematical optimization; Quadratic equation; Quadratic assignment problem; Optimization problem; Block matrix; Algorithm; Computer science; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.011127156781275642,"score_gpt":0.18824854385799494,"score_spread":0.1771213870767193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050672239","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.104644425,0.0008258576,0.88894886,0.000005712741,0.0013016731,0.000044243745,0.0000022218899,0.000044047694,0.0041829357],"genre_scores_gemma":[0.9786498,0.00009313736,0.021017892,0.000007815994,0.00016765209,5.9662716e-7,5.464592e-7,0.000018529166,0.000044011827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.000032744127,0.0003971993,0.000037965554,0.000126387,0.0001092835],"domain_scores_gemma":[0.9995687,0.000037128044,0.00013838784,0.00008631074,0.00010347585,0.000065982706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023006556,0.0000891358,0.00016575473,0.000123253,0.000027039245,0.000019113631,0.00013099155,0.000053256877,0.0001455293],"category_scores_gemma":[0.000035735186,0.000073866104,0.00006810901,0.00011267608,0.000019495958,0.00013389546,0.000007191952,0.00016269596,0.000020595027],"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.00008215507,0.00010763407,0.0009760787,0.00022922902,0.00020643674,0.0001914411,0.0025095937,0.9862054,0.0007298374,0.003226082,0.004416417,0.0011196929],"study_design_scores_gemma":[0.00092150265,0.0006213832,0.0009089376,0.00030817802,0.00032464936,0.0013367452,0.0010723791,0.9809002,0.004524799,0.0044370107,0.004065006,0.0005791766],"about_ca_topic_score_codex":0.0000012647521,"about_ca_topic_score_gemma":3.4497347e-7,"teacher_disagreement_score":0.8740054,"about_ca_system_score_codex":0.000020130012,"about_ca_system_score_gemma":0.000009261266,"threshold_uncertainty_score":0.30121723},"labels":[],"label_agreement":null},{"id":"W2050718596","doi":"10.1016/s0012-365x(03)00196-1","title":"MGDD with block size 4 and its application to sampling designs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Block design; Sampling (signal processing); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017915803458780806,"score_gpt":0.22782177702843118,"score_spread":0.20990597356965038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050718596","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.7071298,0.00017867029,0.2836241,0.000014759841,0.00004210791,0.00051820884,0.0000067295186,0.00020250076,0.008283155],"genre_scores_gemma":[0.98664343,0.000005350606,0.0131217195,0.000015260757,0.00001440003,0.00006794996,0.000001008777,0.000032508295,0.00009834907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994812,0.0000139670565,0.00014942803,0.00010980178,0.00009153492,0.00015404965],"domain_scores_gemma":[0.9995967,0.00010011534,0.000023742297,0.00017892684,0.000019488005,0.00008103584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001644276,0.00012291287,0.00014321617,0.000029879046,0.000052605505,0.000030418716,0.00006392296,0.000039167484,0.0000089319565],"category_scores_gemma":[0.000041512485,0.00010050207,0.000018148243,0.00014053502,0.000009692216,0.00004407346,0.000007218904,0.00005444053,0.000035764744],"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.00001839342,0.00007298436,0.00035550323,0.0021111541,0.00020395212,0.000005659752,0.01164952,0.033815373,0.16283387,0.7881856,0.00012425792,0.00062374637],"study_design_scores_gemma":[0.0048242053,0.0010525427,0.002152731,0.0031341403,0.00088757096,0.0010230448,0.02230943,0.28843862,0.34010047,0.29208288,0.037044376,0.0069500236],"about_ca_topic_score_codex":3.555292e-7,"about_ca_topic_score_gemma":0.0000018418325,"teacher_disagreement_score":0.49610272,"about_ca_system_score_codex":0.000010837909,"about_ca_system_score_gemma":0.0000036163874,"threshold_uncertainty_score":0.40983552},"labels":[],"label_agreement":null},{"id":"W2050823015","doi":"10.1006/jcta.2001.3230","title":"Tree-like Properties of Cycle Factorizations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"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":"Bijection; Combinatorics; Mathematics; Vertex (graph theory); Factorization; Generalization; Tree (set theory); Tuple; Product (mathematics); Degree (music); Class (philosophy); Set (abstract data type); Discrete mathematics; Computer science; Graph; Algorithm; Physics","score_opus":0.010848599789244946,"score_gpt":0.17369882893564886,"score_spread":0.16285022914640393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050823015","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.97267354,0.0027765788,0.0005822701,0.00003948666,0.011909086,0.0001311303,0.0000068784448,0.0000799534,0.011801054],"genre_scores_gemma":[0.9991889,0.00013031081,0.00003190631,0.0000050066933,0.00034039712,0.0000024775602,2.8402332e-7,0.000023599167,0.00027711852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989469,0.00013052802,0.0005087511,0.000052284315,0.00021622109,0.00014531949],"domain_scores_gemma":[0.9993765,0.0000555507,0.00018340706,0.00015633824,0.0001559653,0.0000722624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036415557,0.00013038053,0.00032139343,0.00012211376,0.00006111735,0.000027370314,0.00022220748,0.00007753018,0.00020591535],"category_scores_gemma":[0.00007389892,0.00010399381,0.00014935696,0.00020613169,0.000094473304,0.0004101361,0.000015118922,0.00016650211,0.0000064814726],"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.0004069404,0.00024316683,0.00024362003,0.0002466466,0.00044254825,0.000018752402,0.0058999546,0.002033825,0.06967581,0.91677815,0.0018631724,0.0021474152],"study_design_scores_gemma":[0.004195848,0.0016997434,0.00025648344,0.00075512036,0.0002494638,0.00036524047,0.006342308,0.0010415359,0.22511865,0.69604313,0.06307817,0.00085431687],"about_ca_topic_score_codex":7.3506897e-7,"about_ca_topic_score_gemma":4.3013034e-7,"teacher_disagreement_score":0.22073504,"about_ca_system_score_codex":0.000021593618,"about_ca_system_score_gemma":0.00001075377,"threshold_uncertainty_score":0.42407444},"labels":[],"label_agreement":null},{"id":"W2050844884","doi":"10.1016/j.ejc.2006.08.007","title":"On balanced incomplete-block designs with repeated blocks","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Engineering and Physical Sciences Research Council; Beijing Institute For Brain Disorders","keywords":"Lint; Mathematics; Combinatorics; Block (permutation group theory); Block design; Multiplicity (mathematics); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.008195666601238341,"score_gpt":0.17043293973253226,"score_spread":0.16223727313129394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050844884","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.92796576,0.00023428527,0.005138685,0.000019750045,0.00074895046,0.000073698575,0.0000019336144,0.00012264344,0.06569431],"genre_scores_gemma":[0.9994544,0.00000716436,0.000098993725,0.000019750252,0.00012944228,4.6003214e-7,0.0000013061161,0.000058805654,0.00022972688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987168,0.00024600903,0.00046019172,0.00009142934,0.00027880323,0.00020679177],"domain_scores_gemma":[0.99929017,0.00007615902,0.00018886372,0.00021442791,0.00013526285,0.00009508958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005723217,0.00017927217,0.00025212526,0.00015582122,0.00006018725,0.000044928896,0.00026710628,0.000023749759,0.000012535449],"category_scores_gemma":[0.00001850174,0.000141255,0.000081014085,0.00031302994,0.000029114726,0.00007723705,0.000011596905,0.00031330652,0.000027504164],"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.0016002812,0.0020161981,0.014263935,0.00040553702,0.001120722,0.012493037,0.0012465981,0.46491364,0.10174993,0.28608721,0.11150444,0.002598471],"study_design_scores_gemma":[0.07003608,0.04525535,0.16804974,0.007724283,0.0012519434,0.015969723,0.0013299217,0.011777309,0.18108962,0.19073313,0.29705933,0.009723575],"about_ca_topic_score_codex":5.7159565e-7,"about_ca_topic_score_gemma":3.0978015e-7,"teacher_disagreement_score":0.45313632,"about_ca_system_score_codex":0.000056166908,"about_ca_system_score_gemma":0.000009408769,"threshold_uncertainty_score":0.5760212},"labels":[],"label_agreement":null},{"id":"W2050946959","doi":"10.1016/j.disc.2008.01.016","title":"Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Lethbridge","funders":"Illinois State University","keywords":"Digraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Directed graph; Prime (order theory); Discrete mathematics; Graph","score_opus":0.014615531942675482,"score_gpt":0.19341050584554423,"score_spread":0.17879497390286875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050946959","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.97323126,0.000987479,0.001593966,0.000008659196,0.00063069345,0.00044652107,0.000079844845,0.00042793795,0.022593658],"genre_scores_gemma":[0.99935156,0.000044114102,0.00026726094,0.000005570506,0.000038420916,0.000030984833,0.0000055064224,0.000048770587,0.00020778415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987103,0.00007202306,0.0005063037,0.00013034853,0.00030994657,0.0002711001],"domain_scores_gemma":[0.9989642,0.00014985567,0.00013194085,0.0006417999,0.000042942647,0.00006929692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001823309,0.0002124334,0.0004045614,0.00015364404,0.00014933816,0.000021902255,0.00040227873,0.00008296645,0.000010781478],"category_scores_gemma":[0.00005107917,0.000146884,0.00020692468,0.00091212307,0.00014090385,0.00006505307,0.0000439545,0.00014643355,0.00003257032],"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.000038429247,0.0007553283,0.037812274,0.014224489,0.0024554075,0.00008894826,0.04035472,0.07041193,0.072856605,0.7529746,0.0073214937,0.00070572895],"study_design_scores_gemma":[0.0027317547,0.00019824055,0.10713129,0.0030033058,0.0005397758,0.0009421697,0.005663473,0.8268335,0.015785208,0.025411116,0.008918439,0.0028417686],"about_ca_topic_score_codex":0.000028872395,"about_ca_topic_score_gemma":0.0000061444416,"teacher_disagreement_score":0.75642157,"about_ca_system_score_codex":0.000022760227,"about_ca_system_score_gemma":0.000008051096,"threshold_uncertainty_score":0.5989756},"labels":[],"label_agreement":null},{"id":"W2050977427","doi":"10.1006/eujc.1998.0266","title":"Judicious Partitions of 3-uniform Hypergraphs","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Partition (number theory); Conjecture; Class (philosophy); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.00526714390918659,"score_gpt":0.16509049881869817,"score_spread":0.15982335490951158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050977427","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.8609913,0.0009631284,0.00043808884,0.000019241927,0.0007236242,0.00003352239,0.0000035798391,0.000042002546,0.1367855],"genre_scores_gemma":[0.9993051,0.00036672555,0.000046133762,0.000011868573,0.00006430929,2.420526e-7,6.428209e-7,0.000027423162,0.0001775096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990408,0.0001268392,0.00048161446,0.000041985986,0.00017552722,0.00013326418],"domain_scores_gemma":[0.99952215,0.000031416403,0.000106461564,0.0001530062,0.00009115045,0.00009582806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330076,0.00009536136,0.00019943525,0.00012393092,0.000042426727,0.00001290313,0.00022266753,0.000017685947,0.00015020663],"category_scores_gemma":[0.0000123416185,0.000086843604,0.00013612708,0.00028492507,0.000040252595,0.000110939785,0.0000064302267,0.00019103018,0.000059121714],"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.00041626804,0.0021448594,0.011346595,0.0010568944,0.0021194126,0.0031709443,0.009778108,0.15534884,0.020074582,0.5831474,0.09045528,0.1209408],"study_design_scores_gemma":[0.009228217,0.003953527,0.033130538,0.0014567069,0.0005452555,0.0027932825,0.0013956304,0.0019495602,0.015995523,0.19463097,0.73315674,0.0017640744],"about_ca_topic_score_codex":3.0385885e-7,"about_ca_topic_score_gemma":1.1512998e-7,"teacher_disagreement_score":0.64270145,"about_ca_system_score_codex":0.000014514597,"about_ca_system_score_gemma":0.000008649281,"threshold_uncertainty_score":0.35413793},"labels":[],"label_agreement":null},{"id":"W2051200764","doi":"10.1016/s0012-365x(03)00251-6","title":"The metamorphosis of λ-fold block designs with block size four into a maximum packing of λKn with 4-cycles","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Partition (number theory); Block (permutation group theory); Metamorphosis; Block size; Block design; Fold (higher-order function); Discrete mathematics; Computer science; Biology; Key (lock)","score_opus":0.014499723671043461,"score_gpt":0.20286254224414088,"score_spread":0.18836281857309742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051200764","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.9766284,0.00046526015,0.016756207,0.000020075588,0.00006318182,0.00045292085,0.000010973873,0.000100340476,0.005502641],"genre_scores_gemma":[0.9824487,0.00002609671,0.01732138,0.0000039106144,0.000010069202,0.000038524835,5.930562e-7,0.00006396309,0.000086757784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873745,0.00007666085,0.00045630417,0.00013756473,0.00032082383,0.00027121388],"domain_scores_gemma":[0.99860376,0.00050598255,0.00020866029,0.00053726754,0.00008008849,0.00006423259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997068,0.00025451067,0.00044878593,0.000053300828,0.00010132408,0.000035004334,0.0002487697,0.00006565999,0.000012263105],"category_scores_gemma":[0.00008767386,0.000145729,0.00010876413,0.0003233985,0.00015291532,0.00006700943,0.000018365436,0.00011987152,0.000003055046],"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.00055005366,0.0008427798,0.014592321,0.018438574,0.01028531,0.00010970835,0.07363037,0.061819404,0.2119561,0.60507476,0.00089346577,0.0018071734],"study_design_scores_gemma":[0.0036539107,0.0012901851,0.0006385046,0.004384443,0.002069925,0.00045994736,0.040849566,0.014799562,0.7891506,0.13832474,0.0021311052,0.0022475389],"about_ca_topic_score_codex":0.000009145071,"about_ca_topic_score_gemma":0.000034134187,"teacher_disagreement_score":0.57719445,"about_ca_system_score_codex":0.000016650196,"about_ca_system_score_gemma":0.000020107425,"threshold_uncertainty_score":0.59426564},"labels":[],"label_agreement":null},{"id":"W2051258063","doi":"10.1007/s10801-012-0395-8","title":"Nonexistence results for tight block designs","year":2012,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Block (permutation group theory); Upper and lower bounds; Combinatorial design; Discrete mathematics; Polynomial; Block design; Mathematical analysis","score_opus":0.025296127190621825,"score_gpt":0.23332721572369414,"score_spread":0.2080310885330723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051258063","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.9599159,0.005948909,0.008786567,0.00016354956,0.012112437,0.00038466818,0.00001891217,0.00014225036,0.0125268325],"genre_scores_gemma":[0.998872,0.00005725292,0.00039422617,0.00001841755,0.0003676827,0.0000048065544,9.1163145e-7,0.000026247653,0.00025845596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987911,0.0000434964,0.0005530111,0.00006317178,0.00022716638,0.00032208455],"domain_scores_gemma":[0.9990008,0.0002710698,0.00019889559,0.00017831156,0.00014767745,0.00020325687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010493333,0.00014285564,0.00026952988,0.00013669686,0.00006848952,0.000026789607,0.0002473649,0.000095082534,0.00000474096],"category_scores_gemma":[0.00013691095,0.00012415588,0.00017297266,0.00024631928,0.00002252069,0.00024076195,0.000013640322,0.00021348608,0.000013285541],"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.00058626255,0.0008798226,0.0029832209,0.0008164244,0.00083473313,0.000058990805,0.006983929,0.002213673,0.01693719,0.8617265,0.10355832,0.002420935],"study_design_scores_gemma":[0.01660086,0.003083882,0.011102601,0.0009754724,0.00072273804,0.002707848,0.0019506272,0.004349407,0.07593239,0.34318495,0.536888,0.0025012353],"about_ca_topic_score_codex":3.8230704e-7,"about_ca_topic_score_gemma":1.9593246e-7,"teacher_disagreement_score":0.5185416,"about_ca_system_score_codex":0.00007583021,"about_ca_system_score_gemma":0.000023489376,"threshold_uncertainty_score":0.506293},"labels":[],"label_agreement":null},{"id":"W2051966902","doi":"10.1016/j.disc.2011.12.006","title":"Triple metamorphosis of twofold triple systems","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Triple system; Combinatorics; Mathematics; Metamorphosis; Zero (linguistics); Pairing; Discrete mathematics; Pure mathematics; Physics; Biology","score_opus":0.02683210484313919,"score_gpt":0.20368523395798685,"score_spread":0.17685312911484766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051966902","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.7157878,0.003550136,0.064197086,0.0000057265065,0.003110966,0.0013550107,0.00018540942,0.0008942907,0.21091354],"genre_scores_gemma":[0.9970625,0.000025275676,0.0020422006,0.0000026539662,0.00003412975,0.00005450017,0.0000061415226,0.000050357834,0.00072226283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887174,0.00003876151,0.00054794096,0.00011710746,0.00019116621,0.00023328366],"domain_scores_gemma":[0.9992564,0.00004661829,0.00011722629,0.0004649527,0.000037920585,0.00007693753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039012806,0.0001914007,0.0004574942,0.00011023808,0.000033674845,0.000018400091,0.00025720574,0.000087648936,0.00013604217],"category_scores_gemma":[0.000027999145,0.00015993712,0.00016886136,0.00023752476,0.000044479846,0.00009884819,0.00002417169,0.000087484754,0.00007310886],"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.000048603015,0.00037555743,0.00085918885,0.008220292,0.0014276279,0.000027736123,0.029791985,0.0011914168,0.025249626,0.92494893,0.0073968535,0.00046217564],"study_design_scores_gemma":[0.005859547,0.00080563076,0.001267437,0.0031060998,0.0021466934,0.0002755141,0.04300979,0.37641367,0.42389917,0.11884197,0.01993005,0.004444397],"about_ca_topic_score_codex":0.00002779731,"about_ca_topic_score_gemma":0.000002312249,"teacher_disagreement_score":0.806107,"about_ca_system_score_codex":0.000015031154,"about_ca_system_score_gemma":0.000005657374,"threshold_uncertainty_score":0.65220463},"labels":[],"label_agreement":null},{"id":"W2052201505","doi":"10.1016/s0012-365x(00)00388-5","title":"Colouring Steiner systems with specified block colour patterns","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Mathematics; Combinatorics; Integer (computer science); Block (permutation group theory); Type (biology); Discrete mathematics; Steiner system; Computer science","score_opus":0.010682379561719704,"score_gpt":0.1909996477849388,"score_spread":0.18031726822321908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052201505","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.9672522,0.00016077951,0.010674119,0.000013918716,0.00031889367,0.00042192425,0.000021374899,0.0004525188,0.020684272],"genre_scores_gemma":[0.9981098,0.000028179362,0.0003315122,0.0000070702777,0.00014316653,0.000064334185,0.0000075754506,0.0000792776,0.001229093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988477,0.000030128376,0.00035240222,0.00016380545,0.00025024192,0.00035572084],"domain_scores_gemma":[0.9993252,0.00006819407,0.00005256802,0.00040965923,0.000036934645,0.00010743566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019121847,0.00025506737,0.00034775876,0.00007992972,0.0000777308,0.00011005272,0.00021142261,0.00008782445,0.00004053511],"category_scores_gemma":[0.0000069482253,0.00019632635,0.000059835027,0.000186201,0.000029716148,0.00009234803,0.000024462048,0.0001508378,0.00008738368],"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.0004938338,0.0010989154,0.050985258,0.022280866,0.004318845,0.0030667647,0.047082227,0.5206534,0.024701362,0.31410527,0.009890353,0.0013228579],"study_design_scores_gemma":[0.008766524,0.001661424,0.0097191585,0.011154135,0.0012736705,0.006528378,0.09451336,0.7724959,0.020382538,0.007740224,0.05655641,0.009208279],"about_ca_topic_score_codex":0.0000068666573,"about_ca_topic_score_gemma":0.0000133078665,"teacher_disagreement_score":0.30636504,"about_ca_system_score_codex":0.000041026477,"about_ca_system_score_gemma":0.000005902902,"threshold_uncertainty_score":0.80059564},"labels":[],"label_agreement":null},{"id":"W2052262845","doi":"10.1016/j.jctb.2008.03.007","title":"Removable cycles in non-bipartite graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Combinatorics; Connected component; Mathematics; Disjoint sets; Connectivity; Graph; Complete bipartite graph; Path (computing); Discrete mathematics; Computer science","score_opus":0.006866264398241998,"score_gpt":0.19441159737768268,"score_spread":0.18754533297944068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052262845","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.9824498,0.0007877255,0.000102371814,0.000018462011,0.007320583,0.00008444257,0.0000017042659,0.000047480404,0.009187384],"genre_scores_gemma":[0.99906665,0.00029936206,0.00008146501,0.000012249345,0.00033555154,0.0000033036324,5.3086455e-7,0.000028875449,0.00017200282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986684,0.00015745536,0.0006007055,0.00008070924,0.00023476157,0.00025801465],"domain_scores_gemma":[0.9993506,0.00012263922,0.00014557838,0.00019005965,0.000087609675,0.00010352126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010374453,0.00016980109,0.0004099932,0.00026127626,0.00008575314,0.000023847322,0.00027212955,0.00011064208,0.000061753504],"category_scores_gemma":[0.000069177535,0.00015300061,0.0001649485,0.00036732762,0.00011983845,0.00055294414,0.000018739576,0.00033844,0.000012776448],"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.0014630591,0.0001894873,0.0054593016,0.00013047631,0.00022906897,0.00080379576,0.0036879599,0.004502083,0.01501947,0.9648156,0.003026367,0.0006733355],"study_design_scores_gemma":[0.0020695163,0.00034295354,0.0036152455,0.0001915082,0.00002286372,0.00091629516,0.0007180971,0.00006605316,0.017325256,0.961703,0.012699437,0.00032974748],"about_ca_topic_score_codex":0.0000026112386,"about_ca_topic_score_gemma":0.0000015609289,"teacher_disagreement_score":0.016616812,"about_ca_system_score_codex":0.00004561574,"about_ca_system_score_gemma":0.000029657793,"threshold_uncertainty_score":0.62391835},"labels":[],"label_agreement":null},{"id":"W2052391167","doi":"10.1016/j.jcta.2009.03.002","title":"On the asymptotic existence of cocyclic Hadamard matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Hadamard matrix; Hadamard's inequality; Hadamard three-lines theorem; Mathematics; Hadamard's maximal determinant problem; Complex Hadamard matrix; Order (exchange); Combinatorics; Hadamard product; Binary number; Matrix (chemical analysis); Hadamard three-circle theorem; Pure mathematics; Arithmetic; Mathematical analysis; Chemistry","score_opus":0.006055257048665549,"score_gpt":0.19579576174781926,"score_spread":0.1897405046991537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052391167","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.9810827,0.00097231433,0.00012857447,0.00017498367,0.0047857193,0.000116652765,0.000002708163,0.00003763991,0.012698723],"genre_scores_gemma":[0.9994441,0.00010822835,0.000023575083,0.000046437763,0.00028920494,0.0000013181397,1.8359695e-7,0.000013344672,0.00007357367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986783,0.00024138927,0.0005272783,0.00006301055,0.0003192692,0.00017074516],"domain_scores_gemma":[0.9987697,0.00053900824,0.00028695093,0.00023719594,0.000102981656,0.00006416078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012587148,0.00015406577,0.00036191448,0.00010702478,0.00007621915,0.000039825267,0.00042650843,0.00006280885,0.0000651302],"category_scores_gemma":[0.00019070777,0.00009934712,0.00019176776,0.00024175488,0.00009569897,0.00022323949,0.000011318582,0.00027280013,0.0000063020557],"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.0005031928,0.000051196293,0.000016619886,0.000027923385,0.00008005343,0.000016368984,0.00035312164,0.000511491,0.0023398318,0.9947464,0.0006281898,0.00072562764],"study_design_scores_gemma":[0.0005597682,0.0010419618,0.00025460412,0.00021193603,0.00004390328,0.0001105514,0.00070384366,0.000022801145,0.012911734,0.98141366,0.0025937958,0.00013142642],"about_ca_topic_score_codex":4.059877e-7,"about_ca_topic_score_gemma":1.06909994e-7,"teacher_disagreement_score":0.01836145,"about_ca_system_score_codex":0.000030581,"about_ca_system_score_gemma":0.000021069503,"threshold_uncertainty_score":0.4051258},"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":"W2054188207","doi":"10.1016/j.jcta.2009.11.008","title":"On cycle systems with specified weak chromatic number","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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":"Chromatic scale; Combinatorics; Mathematics; Order (exchange); Physics","score_opus":0.0037975787769110926,"score_gpt":0.1871654017250892,"score_spread":0.1833678229481781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054188207","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.9210606,0.00036229184,0.0007022785,0.00004055777,0.008840414,0.00020703788,0.0000029541134,0.00013030485,0.06865355],"genre_scores_gemma":[0.99888974,0.000023888344,0.000028981582,0.000015356927,0.00080390985,0.000002884641,5.7798155e-7,0.000030604446,0.00020403917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860775,0.00019239097,0.0005090161,0.00008906387,0.00036273798,0.0002390185],"domain_scores_gemma":[0.9992007,0.00016037234,0.00015934106,0.00024606538,0.00010286888,0.00013066237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073384383,0.00022136437,0.0004720209,0.00009601072,0.000082066734,0.00010296116,0.000256329,0.000097139025,0.00008426644],"category_scores_gemma":[0.000038064332,0.00016188876,0.00012200131,0.00020810583,0.000054131277,0.00035393532,0.0000062798426,0.00030558117,0.000034416964],"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.0013272826,0.00008823856,0.000016377688,0.000058352558,0.00014533066,0.00007512712,0.0003517537,0.005177069,0.00078398286,0.99055415,0.0011110568,0.0003112608],"study_design_scores_gemma":[0.0025196727,0.0025699073,0.00041158992,0.00082847127,0.000091291484,0.0012909042,0.0015290421,0.0002196108,0.0030176353,0.97776395,0.00927186,0.0004860424],"about_ca_topic_score_codex":5.143187e-7,"about_ca_topic_score_gemma":1.5023807e-7,"teacher_disagreement_score":0.07782915,"about_ca_system_score_codex":0.00007216872,"about_ca_system_score_gemma":0.000022135599,"threshold_uncertainty_score":0.6601632},"labels":[],"label_agreement":null},{"id":"W205483883","doi":"","title":"Subdirectly Irreducible Squags of Cardinality 3n.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Mathematics; Combinatorics; Computer science; Data mining","score_opus":0.01364674758501507,"score_gpt":0.19695315716324893,"score_spread":0.18330640957823385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205483883","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.9393197,0.001679447,0.000007914877,0.000013121373,0.0025281315,0.00009992286,0.0000067280116,0.00022204201,0.05612301],"genre_scores_gemma":[0.9995964,0.00003184622,0.000016929851,0.000005629509,0.000010441437,0.000013157952,0.0000019365516,0.000023591392,0.00030006154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991941,0.00005866647,0.00024082186,0.00014049896,0.00015201732,0.00021388139],"domain_scores_gemma":[0.9994236,0.000050923325,0.000035168963,0.0003778527,0.00004094664,0.000071480754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441407,0.00012985982,0.00025972098,0.00006554497,0.00004008065,0.000013311358,0.00017232061,0.00007782367,0.0001669064],"category_scores_gemma":[0.000020257949,0.00013679972,0.00010745353,0.0002918648,0.000042285355,0.000095396186,0.000016962465,0.000113521084,0.00010727168],"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.0000146303755,0.00022140157,0.013893319,0.0004673709,0.00025975524,0.00002064086,0.0019367948,0.0007275252,0.0124884695,0.9425586,0.0241852,0.0032262858],"study_design_scores_gemma":[0.0034551346,0.000353881,0.025232561,0.00031487047,0.00018381809,0.00006754559,0.00079049024,0.011273696,0.18847063,0.7220647,0.04610717,0.0016855074],"about_ca_topic_score_codex":0.000037335838,"about_ca_topic_score_gemma":0.0000017760963,"teacher_disagreement_score":0.22049391,"about_ca_system_score_codex":0.000028944405,"about_ca_system_score_gemma":0.0000031685643,"threshold_uncertainty_score":0.55785304},"labels":[],"label_agreement":null},{"id":"W205520280","doi":"","title":"Some Equitably 2-colorable cycle decompositions of Kv+I.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.008695186536014433,"score_gpt":0.20325846106949594,"score_spread":0.19456327453348152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205520280","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.987493,0.0007500908,0.000023939767,0.000013007307,0.0017946739,0.00011182854,0.0000091922375,0.0002154639,0.0095887985],"genre_scores_gemma":[0.99965525,0.00005940974,0.00007006187,0.000012860484,0.000013232578,0.000022776789,0.000005912343,0.000024249182,0.00013625663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999283,0.000032277956,0.0002270094,0.000105205654,0.000122052086,0.00023046463],"domain_scores_gemma":[0.99955004,0.000056790494,0.000032107746,0.00025427784,0.000035672656,0.000071102586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011373086,0.000112962014,0.0002034933,0.000081247985,0.00011667937,0.000007632099,0.00016877808,0.000069648384,0.000040040406],"category_scores_gemma":[0.000008434572,0.00012331452,0.000077727454,0.00021636931,0.000058142436,0.00019830801,0.00002451871,0.00010162142,0.00010056756],"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.000008298499,0.00010464473,0.0011490515,0.00006883771,0.00006836283,0.000018894612,0.00041568174,0.0028899056,0.021899018,0.9701198,0.0032023182,0.000055206205],"study_design_scores_gemma":[0.0012385887,0.00015664869,0.0043378365,0.00008192364,0.000032696775,0.00006942226,0.00013832806,0.0028631052,0.068538174,0.9200981,0.0020313095,0.00041386255],"about_ca_topic_score_codex":0.000015356258,"about_ca_topic_score_gemma":0.0000011148674,"teacher_disagreement_score":0.050021674,"about_ca_system_score_codex":0.000029923025,"about_ca_system_score_gemma":0.000013843145,"threshold_uncertainty_score":0.502862},"labels":[],"label_agreement":null},{"id":"W2055791260","doi":"10.1007/s10107-003-0480-9","title":"A model of the coNP-complete non-Hamilton tour decision problem for directed graphs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Mathematics; Convex hull; Bijection; Permutation matrix; Polytope; Vertex (graph theory); Extreme point; Hamiltonian path; Discrete mathematics; Regular polygon; Graph; Geometry","score_opus":0.02167359950482958,"score_gpt":0.23023526394464486,"score_spread":0.20856166443981528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055791260","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.4179571,0.000061016304,0.5786506,0.000018412678,0.00010974268,0.0015092625,0.00001080898,0.00033177392,0.0013512921],"genre_scores_gemma":[0.89637697,0.000001202835,0.10327383,0.000008476518,0.000014479802,0.00025173867,0.0000020365487,0.000037618465,0.00003365613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988549,0.0000150913065,0.00044773915,0.00015839541,0.0002099817,0.00031393277],"domain_scores_gemma":[0.99933326,0.00015976791,0.0000656225,0.00031674159,0.000058497142,0.000066113535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003526057,0.00017661638,0.00030910363,0.0000569705,0.000098859295,0.000035133547,0.00026429998,0.00009060717,0.0000050069716],"category_scores_gemma":[0.00006243298,0.000119614946,0.00023055842,0.00025802184,0.000076385535,0.00006437586,0.0000295798,0.00012093364,0.000006603076],"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.00010223802,0.00055671757,0.00006676645,0.005313361,0.0002874964,0.0000030143942,0.00833018,0.14441347,0.07175151,0.7260542,0.0001859145,0.04293512],"study_design_scores_gemma":[0.00076881977,0.00005927576,0.000014519001,0.00066979515,0.000047265887,0.000008663118,0.00012989457,0.30077302,0.0060298503,0.6909345,0.00035877808,0.00020560171],"about_ca_topic_score_codex":0.0000019924264,"about_ca_topic_score_gemma":0.000005637376,"teacher_disagreement_score":0.47841984,"about_ca_system_score_codex":0.000028874143,"about_ca_system_score_gemma":0.000011959172,"threshold_uncertainty_score":0.4877756},"labels":[],"label_agreement":null},{"id":"W2056079849","doi":"10.1016/j.laa.2011.05.027","title":"Totally positive shapes and TPk-completable patterns","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Science Foundation","keywords":"Mathematics","score_opus":0.012834835054342663,"score_gpt":0.19167650993108398,"score_spread":0.17884167487674132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056079849","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.953962,0.0017794105,0.018556325,0.000042229658,0.000048037375,0.0005024308,0.00012422136,0.0002623108,0.02472301],"genre_scores_gemma":[0.99918234,0.00014169647,0.0002645967,0.00004472698,0.0000637388,0.00011052433,0.000014373514,0.000016374282,0.00016161805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99957305,0.0000097242755,0.000117732954,0.0001353115,0.000039799645,0.00012435821],"domain_scores_gemma":[0.99977237,0.000023866633,0.000015690728,0.00009278137,0.000021647053,0.000073618925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004596966,0.000095452655,0.00010038367,0.00003593717,0.00009643955,0.000019124886,0.00006261526,0.000043649798,0.00008142454],"category_scores_gemma":[0.0000017751795,0.00009065426,0.00001939919,0.00007562779,0.000021544412,0.000088545356,0.000021300795,0.00006603269,0.000048636535],"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.000016391568,0.000096246666,0.0027156533,0.00026416293,0.0001742387,0.000003180245,0.0038699978,0.000044822722,0.013378396,0.9686332,0.00018301715,0.010620716],"study_design_scores_gemma":[0.0035102875,0.00077575573,0.47993508,0.00047778446,0.0006290009,0.00048978586,0.0047329604,0.1420904,0.10011514,0.13949609,0.12345363,0.0042940867],"about_ca_topic_score_codex":0.000012989165,"about_ca_topic_score_gemma":0.0000070463448,"teacher_disagreement_score":0.8291371,"about_ca_system_score_codex":0.0000031048273,"about_ca_system_score_gemma":0.0000023634332,"threshold_uncertainty_score":0.36967736},"labels":[],"label_agreement":null},{"id":"W2056137755","doi":"10.1016/j.disc.2011.10.009","title":"Schröder quasigroups with a specified number of idempotents","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Mount Saint Vincent University; National Science Foundation","keywords":"Quasigroup; Mathematics; Idempotence; Combinatorics; Order (exchange); Commutative property; Discrete mathematics; Invariant (physics); Arithmetic; Variety (cybernetics)","score_opus":0.02227717268754375,"score_gpt":0.21127794351454662,"score_spread":0.18900077082700287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056137755","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.82750773,0.000042893407,0.030242164,0.0000018127561,0.00010136381,0.00017681187,0.000009761988,0.0001549894,0.14176248],"genre_scores_gemma":[0.98909545,0.000005656159,0.010657357,0.000003652691,0.000019742247,0.000014738996,0.0000026404036,0.000041905732,0.00015883599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992791,0.000015988253,0.00028036124,0.000092223156,0.00015944299,0.0001729301],"domain_scores_gemma":[0.99951994,0.000026342184,0.00004578197,0.00032385785,0.000028323726,0.000055757424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001328867,0.00014908428,0.00024727228,0.0000377087,0.000022173243,0.000009459463,0.00015635116,0.000056815876,0.00022789193],"category_scores_gemma":[0.0000074926834,0.000110357876,0.00006481834,0.00013390495,0.00005621327,0.00008500973,0.000015707736,0.00008204215,0.000105480976],"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.00013963936,0.00043625938,0.013624911,0.003873219,0.0009868077,0.00006873329,0.04453185,0.00030296252,0.006845023,0.92749244,0.0008229046,0.00087524665],"study_design_scores_gemma":[0.0062038894,0.0008601968,0.029360086,0.005688271,0.0011405011,0.0010405695,0.053003963,0.051161602,0.27071968,0.57218826,0.0029048722,0.005728125],"about_ca_topic_score_codex":0.00000454178,"about_ca_topic_score_gemma":0.0000026702255,"teacher_disagreement_score":0.35530418,"about_ca_system_score_codex":0.000007511995,"about_ca_system_score_gemma":0.0000035342046,"threshold_uncertainty_score":0.45002636},"labels":[],"label_agreement":null},{"id":"W2056660045","doi":"10.1007/s00224-005-1243-1","title":"More Fun with Symmetric Venn Diagrams","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Mathematics; Symmetry (geometry); Diagram; Discrete mathematics; Combinatorics; Geometry; Statistics","score_opus":0.006633079933243651,"score_gpt":0.1863290065497682,"score_spread":0.17969592661652453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056660045","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.9544331,0.0032943457,0.02611985,0.000009120869,0.00071985135,0.0003000915,0.0000057022103,0.0005607421,0.01455723],"genre_scores_gemma":[0.99915636,0.0000057399548,0.00016544186,0.000011745374,0.00040841522,0.000008052143,0.0000038846074,0.000054057473,0.00018633164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860567,0.00018696445,0.0004396189,0.0001813887,0.00025042085,0.0003359565],"domain_scores_gemma":[0.9990236,0.0003065263,0.00012533912,0.000397587,0.000058621194,0.00008833646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010888883,0.00022714259,0.00042847014,0.00022890342,0.00007684463,0.000035504952,0.00028660067,0.00008688405,0.0000087126655],"category_scores_gemma":[0.000017330862,0.00018789114,0.00008499871,0.00052336167,0.000093325085,0.000084858926,0.00002406812,0.0001619924,0.000053310298],"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.000079158795,0.000091163325,0.0022902358,0.0013602184,0.00043464443,0.000016720973,0.0055928705,0.5332212,0.0016777483,0.4243163,0.00044633364,0.030473454],"study_design_scores_gemma":[0.0064484105,0.0012535725,0.019600792,0.0073067388,0.0005380378,0.0012906202,0.017517386,0.8858586,0.017065559,0.0082319,0.03051765,0.0043707397],"about_ca_topic_score_codex":0.000007769428,"about_ca_topic_score_gemma":0.0000012092321,"teacher_disagreement_score":0.41608438,"about_ca_system_score_codex":0.000046441768,"about_ca_system_score_gemma":0.000010043829,"threshold_uncertainty_score":0.76619786},"labels":[],"label_agreement":null},{"id":"W2056713944","doi":"10.1007/s004540010025","title":"Oriented Matroid Rigidity of Multiplices","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Matroid; Combinatorics; Mathematics; Polytope; Affine transformation; Quotient; Regular polygon; Rigidity (electromagnetism); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.004473086168676054,"score_gpt":0.20529922138605056,"score_spread":0.2008261352173745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056713944","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.981735,0.0002546153,0.0091198925,0.0000087455255,0.0001826685,0.00009465061,0.00009093849,0.00016094025,0.008352556],"genre_scores_gemma":[0.9984547,0.000007748094,0.0011679798,0.000014645477,0.000059242193,0.000007883826,0.000105656865,0.000016667022,0.00016548876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992084,0.000028735156,0.00026257482,0.00013077636,0.00021621575,0.00015328391],"domain_scores_gemma":[0.99964213,0.00009595605,0.000033886743,0.00012720838,0.00004274886,0.000058078025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011369121,0.00011949154,0.00016863887,0.00012871406,0.000049098722,0.0000132112755,0.000119799,0.000048350674,0.00075791875],"category_scores_gemma":[0.000007235377,0.00011658941,0.00009063273,0.00042448187,0.000050943883,0.00011256975,0.0000100807765,0.00008453584,0.00013648355],"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.00004044314,0.00004601869,0.00603663,0.00015808987,0.00012861272,0.000003958103,0.0003362796,0.9722241,0.00078596623,0.013221103,0.0005413476,0.006477432],"study_design_scores_gemma":[0.0023051251,0.00017786156,0.27386457,0.0002215351,0.00007750532,0.000055503704,0.0006295171,0.6624732,0.0045550154,0.026567755,0.027957868,0.001114569],"about_ca_topic_score_codex":0.000012968448,"about_ca_topic_score_gemma":0.0000012527618,"teacher_disagreement_score":0.30975094,"about_ca_system_score_codex":0.000014364526,"about_ca_system_score_gemma":0.000007137701,"threshold_uncertainty_score":0.8298679},"labels":[],"label_agreement":null},{"id":"W2057027794","doi":"10.1142/s1793042112501163","title":"RECOGNIZING THE PRIMES USING PERMUTATIONS","year":2012,"lang":"en","type":"article","venue":"International Journal of Number Theory","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":"Brock University","funders":"","keywords":"Mathematics; Congruence (geometry); Combinatorics; Prime (order theory); Permutation (music); Integer (computer science); Statement (logic); Discrete mathematics; Set (abstract data type)","score_opus":0.020040947135924803,"score_gpt":0.2754748494102465,"score_spread":0.2554339022743217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057027794","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.9535742,0.0009379047,0.018512193,0.000096268384,0.0057511553,0.000054477827,0.000025015583,0.00003984673,0.021008965],"genre_scores_gemma":[0.99822295,0.00001795167,0.0004937023,0.000072650764,0.0010437109,0.0000015641393,0.0000020774878,0.000016520173,0.00012885594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992352,0.0001176879,0.0002717106,0.000029909135,0.00022118728,0.00012427696],"domain_scores_gemma":[0.99930537,0.0003110016,0.00011186859,0.00006910149,0.00015170127,0.000050950443],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008267942,0.00007448094,0.00008673663,0.000067616864,0.00005229457,0.000041596955,0.00027900224,0.000031302974,0.00093783817],"category_scores_gemma":[0.00009158773,0.000051690684,0.00011157918,0.00006524782,0.000039510025,0.00037496808,0.00001745883,0.00016829385,0.00006420297],"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.00034760722,0.00042333605,0.0573925,0.000076611366,0.005486157,0.00012027796,0.034661323,0.027341595,0.032971002,0.74765503,0.02213622,0.07138832],"study_design_scores_gemma":[0.0030682075,0.000082691426,0.038701877,0.0015683083,0.0007079864,0.024401521,0.02645887,0.009792475,0.023604486,0.5147391,0.35521364,0.0016608128],"about_ca_topic_score_codex":0.0000011459605,"about_ca_topic_score_gemma":2.7388728e-7,"teacher_disagreement_score":0.3330774,"about_ca_system_score_codex":0.00005710683,"about_ca_system_score_gemma":0.000015258517,"threshold_uncertainty_score":0.99997544},"labels":[],"label_agreement":null},{"id":"W2057728880","doi":"10.1016/s0024-3795(01)00338-x","title":"Boolean rank of Kronecker products","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Kronecker product; Combinatorics; Rank (graph theory); Logical matrix; Complete Boolean algebra; Two-element Boolean algebra; Kronecker delta; Product (mathematics); Boolean function; Boolean algebras canonically defined; Discrete mathematics; Parity function; Binary number; Integer (computer science); Upper and lower bounds; Boolean expression; Algebra over a field; Arithmetic; Pure mathematics; Group (periodic table); Computer science","score_opus":0.008806245643465804,"score_gpt":0.2059475694106554,"score_spread":0.1971413237671896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057728880","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.9743006,0.0032500657,0.0065175965,0.00019927873,0.00008848555,0.00057923625,0.00002994545,0.0001832731,0.014851466],"genre_scores_gemma":[0.9986123,0.00026484375,0.00027872142,0.0000148161225,0.00012161724,0.00007393947,0.000014913052,0.000014554054,0.00060431473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995803,0.000008417072,0.00014940808,0.000108862274,0.000053359945,0.00009962428],"domain_scores_gemma":[0.9997012,0.000016828244,0.000020117654,0.0001819715,0.000037761998,0.000042089294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006933611,0.00007273911,0.0001001637,0.00004112413,0.000044967626,0.000006352809,0.00006951637,0.00003853895,0.00005152573],"category_scores_gemma":[0.00000640111,0.00006859613,0.000020635865,0.00021535518,0.000022728966,0.000053574113,0.000009715701,0.000056067864,0.00010398799],"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.000055222477,0.00030791597,0.0021275575,0.0009900494,0.0002813981,0.0000035217906,0.0018108636,0.0018548078,0.2731897,0.67039526,0.004916016,0.04406766],"study_design_scores_gemma":[0.00064538844,0.00006305067,0.0030322939,0.000052666976,0.00006955001,0.000059139664,0.00023640871,0.013252746,0.06702524,0.0067379535,0.9083831,0.00044250986],"about_ca_topic_score_codex":0.0000012896604,"about_ca_topic_score_gemma":0.0000010838183,"teacher_disagreement_score":0.90346706,"about_ca_system_score_codex":0.0000029606224,"about_ca_system_score_gemma":0.000004205652,"threshold_uncertainty_score":0.2797269},"labels":[],"label_agreement":null},{"id":"W2058095168","doi":"10.1016/j.tcs.2008.06.002","title":"Heuristic algorithms for Hadamard matrices with two circulant cores","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"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","keywords":"Circulant matrix; Hadamard transform; Algorithm; Heuristic; Hadamard matrix; Mathematics; Complex Hadamard matrix; Combinatorics; Computer science; Mathematical optimization","score_opus":0.012383514390553699,"score_gpt":0.2220192531576568,"score_spread":0.20963573876710312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058095168","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.26630515,0.000084067295,0.73139745,0.000021019478,0.00040294282,0.00018730642,0.0000060031775,0.00023500374,0.0013610867],"genre_scores_gemma":[0.9799249,0.0000067922997,0.019815598,0.000045787183,0.0001624708,0.000020599451,0.0000014051546,0.000016364962,0.0000060848006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879426,0.000026319281,0.00016771496,0.0002845309,0.000315768,0.00041140142],"domain_scores_gemma":[0.99926585,0.00019071682,0.000021405858,0.00028270262,0.000078426056,0.00016087893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044381522,0.00015239762,0.0001901492,0.00010290045,0.00030726442,0.00007342064,0.0005017361,0.000026446072,0.000015677513],"category_scores_gemma":[0.000014500601,0.00010973594,0.000046342557,0.00043747897,0.0017612906,0.00013701883,0.00005029796,0.00009143409,0.00002356833],"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.000027439695,0.000024178096,0.00025934936,0.00005355379,0.000015499261,0.00004477852,0.0003820706,0.008020497,0.0005638403,0.9870196,0.00013134911,0.0034578387],"study_design_scores_gemma":[0.00057108764,0.00029096822,0.0010446825,0.000066616885,0.000017088078,0.00049176463,0.000017575569,0.9377833,0.0030646438,0.055978246,0.00030879845,0.0003652374],"about_ca_topic_score_codex":0.0000020095174,"about_ca_topic_score_gemma":3.8311717e-7,"teacher_disagreement_score":0.93104136,"about_ca_system_score_codex":0.000024248253,"about_ca_system_score_gemma":0.000028495837,"threshold_uncertainty_score":0.64895487},"labels":[],"label_agreement":null},{"id":"W2058209797","doi":"10.1016/s0012-365x(02)00461-2","title":"Existence of self-orthogonal diagonal Latin squares with a missing subsquare","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Latin square; Diagonal; Combinatorics; Orthogonal array; Discrete mathematics; Statistics; Geometry; Taguchi methods","score_opus":0.010705066625756082,"score_gpt":0.20211905626375562,"score_spread":0.19141398963799955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058209797","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.94733685,0.00032152518,0.021990357,0.0000072003913,0.000078690726,0.00019746093,0.000023849898,0.00021603225,0.029828046],"genre_scores_gemma":[0.9754634,0.0000054661737,0.024388492,0.000004524109,0.000016118724,0.000017087848,0.0000053665663,0.00003858284,0.000060987484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999048,0.00004128669,0.0003255451,0.00012176847,0.00024219305,0.00022123058],"domain_scores_gemma":[0.99940324,0.00012731111,0.00008385726,0.0002693384,0.000043177148,0.000073079194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022382643,0.000186189,0.00027699352,0.00007911893,0.000054415803,0.000028213046,0.00012308694,0.000058800277,0.00006401816],"category_scores_gemma":[0.0000353029,0.00014612776,0.00007851944,0.0002529363,0.000057581685,0.00008139499,0.0000083249015,0.00010277442,0.000010739563],"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.000016652795,0.00015347988,0.0071827834,0.0036965641,0.00026414543,0.000033369364,0.013210733,0.0028056796,0.0030004915,0.9691641,0.00008073076,0.00039131535],"study_design_scores_gemma":[0.006580035,0.0014106543,0.012063928,0.010182957,0.0011587681,0.0011247554,0.04788619,0.23664182,0.17106998,0.496235,0.009241476,0.006404425],"about_ca_topic_score_codex":7.674119e-7,"about_ca_topic_score_gemma":0.0000033792235,"teacher_disagreement_score":0.47292906,"about_ca_system_score_codex":0.0000145880485,"about_ca_system_score_gemma":0.00001948944,"threshold_uncertainty_score":0.59589165},"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":"W2060519045","doi":"10.1007/s00373-011-1092-4","title":"The Orthogonality Spectrum for Latin Squares of Different Orders","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonality; Mathematics; Latin square; Combinatorics; Order (exchange); Zhàng; Spectrum (functional analysis); Series (stratigraphy); Least-squares function approximation; Embedding; Upper and lower bounds; Discrete mathematics; Statistics; Mathematical analysis; Geometry; Computer science; Physics","score_opus":0.01590282505025051,"score_gpt":0.18330439079763167,"score_spread":0.16740156574738116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060519045","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.9956792,0.0007738925,0.0004659891,0.000012091176,0.000528502,0.0001739604,0.000009383867,0.00006193449,0.0022950592],"genre_scores_gemma":[0.9997623,0.00013778334,0.000009482986,0.0000033862848,0.000004988339,0.000028651297,0.000001608647,0.000011063071,0.00004075924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951375,0.000021037002,0.00016472668,0.000078989404,0.00007087424,0.00015059968],"domain_scores_gemma":[0.9996609,0.00008835302,0.000034000615,0.0001551439,0.000022452788,0.000039147264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015104288,0.00009600989,0.00013088195,0.00004183619,0.00010981186,0.000011558626,0.00010019395,0.000041946198,0.0000043222185],"category_scores_gemma":[0.000007961879,0.00006465208,0.00007306471,0.00015164094,0.000060513703,0.000023646217,0.000012768549,0.00005844699,3.1150216e-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.000015343287,0.000025903844,0.019517519,0.00008236502,0.000040350053,2.4183194e-7,0.00029136418,0.0000022086833,0.000047126076,0.9792889,0.00010413658,0.0005845473],"study_design_scores_gemma":[0.00032092817,0.00011609084,0.04071726,0.000013772949,0.000019839457,9.183092e-7,0.000292176,0.00037808434,0.0019443413,0.9548133,0.0012689212,0.00011437975],"about_ca_topic_score_codex":0.000012631715,"about_ca_topic_score_gemma":0.000018268998,"teacher_disagreement_score":0.024475606,"about_ca_system_score_codex":0.000004210438,"about_ca_system_score_gemma":0.0000027273527,"threshold_uncertainty_score":0.2636435},"labels":[],"label_agreement":null},{"id":"W2060891111","doi":"10.1109/milcom.2013.278","title":"Upper Bounding the Capacity of Binary Chip-Asynchronous Optical CDMA","year":2013,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Upper and lower bounds; Bounding overwatch; Decoding methods; Channel capacity; Binary symmetric channel; Asynchronous communication; Computer science; Channel (broadcasting); Binary number; Interference (communication); Code division multiple access; Gaussian; Algorithm; Transmission (telecommunications); Topology (electrical circuits); Demodulation; Chip; Electronic engineering; Mathematics; Telecommunications; Engineering; Physics; Combinatorics","score_opus":0.008526433015740218,"score_gpt":0.1795327316389762,"score_spread":0.171006298623236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060891111","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.9529202,0.00010715201,0.0010526165,0.00006570002,0.00035497546,0.00015730584,0.0000011837408,0.00013102216,0.045209855],"genre_scores_gemma":[0.9993988,0.0000051275756,0.0002893828,0.000023609757,0.000066620734,0.000025042917,7.1493054e-7,0.000015139753,0.0001755144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994229,0.00003028173,0.00017461303,0.0000805305,0.00009516294,0.00019650196],"domain_scores_gemma":[0.99960405,0.0000747139,0.000014578237,0.00023783147,0.000018565452,0.000050274353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017049495,0.00009864935,0.00013150171,0.00003711008,0.0000646896,0.00002877181,0.0001557054,0.000058484766,0.0006482451],"category_scores_gemma":[0.000011605877,0.00006171607,0.000071811504,0.00010148904,0.00009042424,0.000111164154,0.000020975558,0.00011899709,0.00025119746],"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.000010914745,0.00011896735,0.010622768,0.00040895166,0.00029026603,0.0000053116632,0.0033802793,0.0054141185,0.45379686,0.5156694,0.006194674,0.0040874872],"study_design_scores_gemma":[0.002101907,0.0006483979,0.33403754,0.00049174076,0.0001938556,0.00036258847,0.010538662,0.19238551,0.38658905,0.055759404,0.014424824,0.0024665068],"about_ca_topic_score_codex":0.00006327209,"about_ca_topic_score_gemma":0.0000046870427,"teacher_disagreement_score":0.45991,"about_ca_system_score_codex":0.00001717759,"about_ca_system_score_gemma":0.000004252593,"threshold_uncertainty_score":0.7097829},"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":"W2060994881","doi":"10.1016/j.endm.2005.06.047","title":"Ordered 3-colorings","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006024316810368814,"score_gpt":0.21238112792413372,"score_spread":0.20635681111376492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060994881","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.9616333,0.0011831624,0.019935332,0.0001999039,0.00012446102,0.0003363479,0.0000034279387,0.0004823021,0.016101737],"genre_scores_gemma":[0.9975176,0.000062903746,0.002039907,0.000019548177,0.000073416384,0.000048746,0.0000031607644,0.000046198344,0.00018854818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988626,0.000018728198,0.00032243397,0.000132723,0.000130697,0.0005327832],"domain_scores_gemma":[0.9995031,0.00012403549,0.000033500954,0.00028602514,0.000009996735,0.00004335326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028623716,0.0001794144,0.0002296486,0.000097610966,0.000033400676,0.000028329154,0.00021841213,0.00008213793,0.00009573514],"category_scores_gemma":[0.000049372014,0.00017052986,0.00006398601,0.0002467189,0.000029177723,0.00011994189,0.000022552387,0.0002602697,0.00014735073],"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.000017753562,0.00015628804,0.00042010122,0.0006443049,0.0001521455,0.00000969534,0.004523062,0.044980127,0.0101926755,0.92767775,0.0002725628,0.010953511],"study_design_scores_gemma":[0.0019388329,0.0002051673,0.0002857821,0.0004592263,0.00007009583,0.000101313715,0.0005300741,0.35682625,0.07312761,0.5307183,0.0341197,0.0016176408],"about_ca_topic_score_codex":0.000004102536,"about_ca_topic_score_gemma":0.00011156969,"teacher_disagreement_score":0.39695945,"about_ca_system_score_codex":0.00014831938,"about_ca_system_score_gemma":0.000017524922,"threshold_uncertainty_score":0.6954006},"labels":[],"label_agreement":null},{"id":"W2061974308","doi":"10.1016/j.laa.2003.09.020","title":"A limit theorem for sets of stochastic matrices","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Infimum and supremum; Integer (computer science); Hausdorff distance; Integer matrix; Sequence (biology); Discrete mathematics; Hausdorff space; Matrix (chemical analysis); Nonnegative matrix; Symmetric matrix; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.00963199490429643,"score_gpt":0.226216733695474,"score_spread":0.21658473879117757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061974308","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.50278884,0.0038654662,0.49000764,0.00012306574,0.00008624323,0.0013001827,0.00016535896,0.00025002818,0.0014131574],"genre_scores_gemma":[0.9987018,0.00004074915,0.00084666593,0.000012575079,0.00005846774,0.00028200718,0.000014012957,0.000015185229,0.000028555112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962926,0.000003847371,0.00014043803,0.000090104484,0.000041010102,0.00009531976],"domain_scores_gemma":[0.9997227,0.00006366261,0.00002581247,0.00011581776,0.000031009004,0.000040999148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000623475,0.00007200481,0.00010207097,0.000046009674,0.0000554905,0.000007894364,0.000074826225,0.00004307422,0.0000059579684],"category_scores_gemma":[0.000007336035,0.00006576913,0.000035934187,0.0001325339,0.000021046864,0.000041716583,0.000007998618,0.000037612157,0.000015007543],"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.000009053387,0.00003368044,0.000004243351,0.00022925115,0.00004019654,7.284829e-8,0.0003733455,0.0074994783,0.0050321934,0.9843798,0.000035766257,0.0023628804],"study_design_scores_gemma":[0.0031436563,0.0003978711,0.00053899706,0.00027226377,0.00032919098,0.000047702648,0.001104788,0.08868923,0.054299314,0.8275531,0.022576915,0.0010469612],"about_ca_topic_score_codex":0.0000011328154,"about_ca_topic_score_gemma":0.0000013099406,"teacher_disagreement_score":0.49591294,"about_ca_system_score_codex":0.0000048453003,"about_ca_system_score_gemma":0.0000063351704,"threshold_uncertainty_score":0.26819873},"labels":[],"label_agreement":null},{"id":"W206202451","doi":"","title":"Directed Bipartite Graphs Containing Every Possible Pair of Directed Cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.009180906024946346,"score_gpt":0.20630244044192478,"score_spread":0.19712153441697844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206202451","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.9863895,0.0010724552,0.000011035308,0.000009628557,0.002038009,0.00018225562,0.00000801302,0.0015018139,0.008787242],"genre_scores_gemma":[0.9995988,0.00007463742,0.00004358035,0.00001252503,0.000009794066,0.00003090595,0.000014101964,0.00005077575,0.00016486965],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.00011323846,0.0004161471,0.000207731,0.0002059721,0.0003849037],"domain_scores_gemma":[0.999181,0.0001449259,0.000082662904,0.00037610382,0.00009249879,0.00012283456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029624903,0.0002281969,0.00038933076,0.00020872011,0.00008532849,0.000027362925,0.00022118959,0.00013371404,0.00006153645],"category_scores_gemma":[0.000050452425,0.00023705438,0.00013838916,0.0008968121,0.00006636335,0.00018539898,0.000029274806,0.00017938668,0.00003390287],"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.00024732645,0.00035108125,0.5127391,0.0003326793,0.00072393037,0.00013332872,0.002222744,0.00140487,0.03950493,0.43358958,0.006043978,0.0027064371],"study_design_scores_gemma":[0.005890885,0.0005096602,0.37764838,0.00093066733,0.00021361047,0.00009754903,0.0008512674,0.01908328,0.06115864,0.52136844,0.0102296285,0.0020180012],"about_ca_topic_score_codex":0.00006681868,"about_ca_topic_score_gemma":0.000012779924,"teacher_disagreement_score":0.13509074,"about_ca_system_score_codex":0.00003782142,"about_ca_system_score_gemma":0.000017027438,"threshold_uncertainty_score":0.9666797},"labels":[],"label_agreement":null},{"id":"W2062166560","doi":"10.1016/j.disc.2012.08.013","title":"Quasigroups satisfying Stein’s third law with a specified number of idempotents","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Idempotence; Combinatorics; Order (exchange); Block (permutation group theory); Type (biology); Discrete mathematics; Block size; Arithmetic","score_opus":0.014594174514120125,"score_gpt":0.22851908390816383,"score_spread":0.2139249093940437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062166560","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.8817895,0.0001628626,0.014829289,0.0000048555557,0.00019565997,0.00022732334,0.000015469963,0.00017678042,0.10259825],"genre_scores_gemma":[0.99201614,0.000006510208,0.0077245664,0.0000099553645,0.000070999544,0.0000203072,0.000005243668,0.000052959676,0.00009334044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.000040395673,0.0003618561,0.00008857672,0.00024651623,0.0003094413],"domain_scores_gemma":[0.999355,0.00010375135,0.00006829671,0.00035008945,0.000024561814,0.000098305325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038478905,0.00019217636,0.00032735677,0.000032379823,0.000046849487,0.000022364698,0.00014663915,0.000073639145,0.00006202612],"category_scores_gemma":[0.000011788339,0.00014707638,0.00007860961,0.00013241745,0.00006489553,0.00020637503,0.000023647008,0.00011640588,0.000092523966],"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.000030262863,0.000100601,0.010081995,0.0016709806,0.00027024993,0.0000050849762,0.011869191,0.00029400777,0.004699763,0.9706327,0.00016437608,0.00018082099],"study_design_scores_gemma":[0.012341647,0.0010000027,0.051914692,0.015888924,0.0028375688,0.0028752265,0.121153,0.064877905,0.28524497,0.40879813,0.019809917,0.013258027],"about_ca_topic_score_codex":0.0000126454115,"about_ca_topic_score_gemma":0.000008197323,"teacher_disagreement_score":0.5618345,"about_ca_system_score_codex":0.000019453277,"about_ca_system_score_gemma":0.000002823415,"threshold_uncertainty_score":0.59976006},"labels":[],"label_agreement":null},{"id":"W2062536443","doi":"10.1016/j.laa.2014.03.025","title":"An Oppenheim type inequality for a block Hadamard product","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Shaanxi Normal University","keywords":"Mathematics; Block (permutation group theory); Inequality; Hadamard transform; Product (mathematics); Hadamard's inequality; Type (biology); Hadamard product; Hadamard matrix; Algebra over a field; Combinatorics; Pure mathematics; Arithmetic; Mathematical analysis; Geometry","score_opus":0.015226301867363286,"score_gpt":0.25336492642718433,"score_spread":0.23813862455982104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062536443","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.9496565,0.00096033723,0.04427147,0.00026732928,0.00022457822,0.0015552802,0.000069025955,0.00058318785,0.002412285],"genre_scores_gemma":[0.99835193,0.000023742696,0.00071276654,0.000055426874,0.00035536004,0.00030005875,0.000049465118,0.000022533945,0.00012872012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945366,0.000024099369,0.00015656889,0.00018206939,0.000048551727,0.00013501915],"domain_scores_gemma":[0.99949694,0.00004787611,0.00002141459,0.00028788944,0.000062207655,0.00008365597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021851054,0.00009676067,0.00012103588,0.00003118317,0.00011070794,0.000025368032,0.00010784971,0.000045825924,0.000009291167],"category_scores_gemma":[0.00002244062,0.00009076673,0.000025413989,0.000141304,0.000016048167,0.00007434495,0.000009203577,0.000060669452,0.00004149425],"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.0000528564,0.00020441454,0.00067085435,0.0007513911,0.00012731829,1.5429806e-7,0.00082173717,0.0020968788,0.072239466,0.8954792,0.0027592455,0.024796475],"study_design_scores_gemma":[0.000666935,0.0002710976,0.0018483474,0.000028266008,0.000083892155,0.000012099494,0.00012376638,0.14897974,0.028457707,0.023727627,0.79517037,0.0006301883],"about_ca_topic_score_codex":0.0000020470748,"about_ca_topic_score_gemma":0.0000040964505,"teacher_disagreement_score":0.8717516,"about_ca_system_score_codex":0.0000042802803,"about_ca_system_score_gemma":0.000006031146,"threshold_uncertainty_score":0.370136},"labels":[],"label_agreement":null},{"id":"W2062741368","doi":"10.1016/j.disc.2004.04.036","title":"Ovals and hyperovals in nets","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Corollary; Combinatorics; Order (exchange); Integer (computer science); Net (polyhedron); Latin square; Set (abstract data type); Discrete mathematics; Finite set; Geometry; Computer science","score_opus":0.007665902235596891,"score_gpt":0.2060537377521739,"score_spread":0.19838783551657702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062741368","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.97725385,0.0006612097,0.0011582524,0.00005613337,0.00006173159,0.00012853721,0.0000042500274,0.000119942124,0.020556081],"genre_scores_gemma":[0.9970333,0.00004017186,0.0026660815,0.000025118872,0.00003565201,0.000012785835,0.0000014911118,0.00002158,0.00016382211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947333,0.000013089643,0.0002116123,0.00007519792,0.00007306201,0.00015368921],"domain_scores_gemma":[0.999736,0.000047576497,0.00001760235,0.00015257196,0.0000052541122,0.000040985196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019925662,0.00010125405,0.00016766315,0.00005728943,0.000017326844,0.000025338908,0.000069191134,0.000046965368,0.000034815013],"category_scores_gemma":[0.000015155131,0.00008929425,0.000026399957,0.000083920844,0.000020922456,0.00008268865,0.00001432933,0.00006774306,0.000056227604],"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.00002007726,0.0002662802,0.004446475,0.0036258753,0.0002764773,0.00006367945,0.046774413,0.029626302,0.043188248,0.8239582,0.004864867,0.04288909],"study_design_scores_gemma":[0.0026490313,0.00010467945,0.0050502084,0.0012897312,0.00009542275,0.00027457505,0.0064693824,0.75281745,0.02533427,0.1557233,0.048148915,0.002043051],"about_ca_topic_score_codex":0.0000011500456,"about_ca_topic_score_gemma":0.000008743721,"teacher_disagreement_score":0.72319114,"about_ca_system_score_codex":0.000011170693,"about_ca_system_score_gemma":0.0000017126679,"threshold_uncertainty_score":0.3641314},"labels":[],"label_agreement":null},{"id":"W2062888049","doi":"10.1016/s0012-365x(02)00609-x","title":"Maximal arcs in Steiner systems S(2,4,v)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Arc (geometry); Steiner system; Block (permutation group theory); Discrete mathematics; Point (geometry); Set (abstract data type); Zero (linguistics); Construct (python library); Geometry; Computer science","score_opus":0.009829290237370867,"score_gpt":0.19804312760531687,"score_spread":0.188213837367946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062888049","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.79019,0.0012898879,0.018340856,0.000008462981,0.00091834663,0.00050629047,0.000016930378,0.0003766148,0.18835261],"genre_scores_gemma":[0.998504,0.0000122607635,0.0007951381,0.000004928332,0.000028198996,0.000046971087,0.0000034815002,0.000044957138,0.0005601028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990421,0.00005045477,0.00035905506,0.00011470851,0.00015340903,0.00028028587],"domain_scores_gemma":[0.9995297,0.00005621962,0.000033447635,0.0003054201,0.000013865482,0.00006133635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036459885,0.00017195595,0.0002628998,0.00010101642,0.000025832493,0.000049503993,0.00012855398,0.000079662466,0.000043293556],"category_scores_gemma":[0.000035591343,0.00015008371,0.00005952467,0.00021201897,0.000024657718,0.0000817443,0.00000944189,0.00012964547,0.00012906056],"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.0000033348651,0.00006279324,0.0008514794,0.0015084613,0.00006260529,0.000043625525,0.0028529041,0.018295823,0.002367493,0.97328866,0.0005631506,0.00009968361],"study_design_scores_gemma":[0.0048117354,0.00025262617,0.001130674,0.003307953,0.00020665803,0.0007799454,0.035360698,0.65291625,0.015798967,0.2062512,0.074558675,0.0046246042],"about_ca_topic_score_codex":0.0000035356682,"about_ca_topic_score_gemma":0.000004292154,"teacher_disagreement_score":0.76703745,"about_ca_system_score_codex":0.000031623185,"about_ca_system_score_gemma":0.0000061730316,"threshold_uncertainty_score":0.6120236},"labels":[],"label_agreement":null},{"id":"W2063616433","doi":"10.1109/cleo.2000.907413","title":"Proof-of-principle demonstration of a wavelength-encoding/time-spreading optical code-division multiple access system using in-fiber chirped Moire gratings","year":2000,"lang":"en","type":"article","venue":"","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":"Fiber Bragg grating; Encoding (memory); Decoding methods; Computer science; Moiré pattern; Code division multiple access; Division (mathematics); Code (set theory); Transmission (telecommunications); Optics; Optical fiber; Wavelength-division multiplexing; Wavelength; Telecommunications; Physics","score_opus":0.018257159428908532,"score_gpt":0.2500964825830501,"score_spread":0.23183932315414157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063616433","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.9741078,0.000049981143,0.0051212697,0.0000026746063,0.00009375936,0.00049623364,0.000010427149,0.0001808539,0.019936975],"genre_scores_gemma":[0.99724597,0.0000018428176,0.0025169237,0.0000016071062,0.000028473305,0.000020729949,0.000007506559,0.000036459613,0.00014048524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830407,0.00007919954,0.0008062889,0.0002511646,0.00025948967,0.00029977347],"domain_scores_gemma":[0.9993296,0.00015223837,0.00010804857,0.0002704896,0.00006088282,0.00007874147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006804,0.00022624478,0.00044757468,0.00020306309,0.00007535374,0.000046723828,0.00024978514,0.00017159407,0.00015538103],"category_scores_gemma":[0.000035107918,0.00021154754,0.00010474641,0.00043180498,0.000053827844,0.00047728547,0.000037377657,0.00017064989,0.0000122168185],"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.0001664345,0.00027113798,0.018980682,0.0031123143,0.00016072296,0.000023582397,0.0020369596,0.59945107,0.32887515,0.012298923,0.000020198508,0.034602843],"study_design_scores_gemma":[0.0004667719,0.00003234084,0.0010675916,0.00073021563,0.000018621362,0.000016718861,0.00017034293,0.8070179,0.19020273,0.000049548158,0.00002024799,0.00020694552],"about_ca_topic_score_codex":0.00005994673,"about_ca_topic_score_gemma":0.000034792545,"teacher_disagreement_score":0.20756687,"about_ca_system_score_codex":0.0000839387,"about_ca_system_score_gemma":0.000023938754,"threshold_uncertainty_score":0.86266583},"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":"W2064483171","doi":"10.1007/s00373-008-0794-8","title":"Equitable Specialized Block-Colourings for Steiner Triple Systems","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Steiner system; Block (permutation group theory); Discrete mathematics","score_opus":0.015253395482545784,"score_gpt":0.19400801973313345,"score_spread":0.17875462425058766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064483171","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.98213005,0.0056776167,0.00045450727,0.000011034224,0.0033140313,0.00064019655,0.000026979304,0.00040389426,0.0073417155],"genre_scores_gemma":[0.9973373,0.00037035072,0.000024435532,0.000011031881,0.00006662875,0.00014765894,0.0000065971267,0.000038402384,0.001997602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896526,0.000023833434,0.0002737312,0.00018885973,0.00014712205,0.00040117066],"domain_scores_gemma":[0.999505,0.000059105198,0.000043216078,0.0002082722,0.00006346573,0.0001209417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025009472,0.00019472504,0.00032792188,0.00013327134,0.0003261435,0.000050365303,0.00013708598,0.00011980953,0.000005328648],"category_scores_gemma":[0.000011746971,0.00018637424,0.00010643718,0.0003252699,0.000050282662,0.00009991154,0.00002539125,0.00010207495,0.0000053978456],"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.00005384132,0.00009488755,0.002007639,0.0005376478,0.00015537278,0.00003062548,0.000642732,0.00055829773,0.0014716043,0.9753405,0.018945936,0.00016093998],"study_design_scores_gemma":[0.014944159,0.0011021075,0.0021030088,0.00028255145,0.0002636658,0.00066544925,0.0018230462,0.022464091,0.006706314,0.34368935,0.60331374,0.002642495],"about_ca_topic_score_codex":0.000021136631,"about_ca_topic_score_gemma":0.0000012547648,"teacher_disagreement_score":0.63165116,"about_ca_system_score_codex":0.000024913896,"about_ca_system_score_gemma":0.000011078559,"threshold_uncertainty_score":0.7600121},"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":"W2064783977","doi":"10.1016/j.disc.2008.05.040","title":"Maximum uniformly resolvable designs with block sizes 2 and 4","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"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 (permutation group theory); Combinatorics; Block size; Pairwise comparison; Class (philosophy); Discrete mathematics; Resolution (logic); Block design; Combinatorial design; Statistics; Computer science","score_opus":0.01656889570623384,"score_gpt":0.1919247001294121,"score_spread":0.17535580442317825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064783977","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.9440436,0.00039462314,0.012739233,0.000016405358,0.00006770903,0.00024630365,0.000011348191,0.00034201736,0.042138763],"genre_scores_gemma":[0.9917814,0.000055845063,0.0074777217,0.000009181287,0.000023966542,0.00001747935,0.0000028145148,0.000041059462,0.0005905126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936527,0.000012804088,0.00017661824,0.00010237721,0.0001298111,0.000213109],"domain_scores_gemma":[0.999577,0.000060820974,0.000029900326,0.00023877525,0.000017979897,0.00007554606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010858415,0.00015846352,0.00020464922,0.000046892572,0.00011070136,0.00002669063,0.00009565768,0.000053425887,0.000018179728],"category_scores_gemma":[0.000009633767,0.00011760032,0.000029512037,0.00012395233,0.00008411531,0.00009397676,0.000016348995,0.00008656083,0.000029363866],"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.00042201075,0.0008009724,0.014919518,0.01749493,0.0030095757,0.0025481926,0.14460295,0.0561149,0.052912507,0.68424195,0.020505393,0.0024270685],"study_design_scores_gemma":[0.010320195,0.0024940795,0.004197537,0.004121703,0.0009703242,0.019420829,0.033668123,0.37701148,0.09980651,0.4031141,0.03633385,0.008541268],"about_ca_topic_score_codex":0.0000024781614,"about_ca_topic_score_gemma":0.0000032299574,"teacher_disagreement_score":0.32089657,"about_ca_system_score_codex":0.000009793726,"about_ca_system_score_gemma":0.000007124943,"threshold_uncertainty_score":0.4795602},"labels":[],"label_agreement":null},{"id":"W2064903887","doi":"10.4153/cmb-2014-068-5","title":"Path Decompositions of Kneser and Generalized Kneser Graphs","year":2014,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.003889440811906455,"score_gpt":0.1667894270043255,"score_spread":0.16289998619241905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064903887","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.95282,0.00021116468,0.003171702,0.0004328682,0.000110858884,0.00019479348,0.00002868309,0.00008737397,0.042942528],"genre_scores_gemma":[0.99836975,0.0000060081607,0.0011663922,0.000111444664,0.000024998062,0.000024894867,0.000005666051,0.000023986335,0.00026686228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00005363863,0.00022705711,0.00010662275,0.000075157826,0.00023513312],"domain_scores_gemma":[0.9993069,0.00010323039,0.00001847308,0.00020914711,0.00002504358,0.0003371819],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022500723,0.000120396835,0.00022801099,0.000116685005,0.000057145844,0.000020729141,0.000099229255,0.00007928801,0.0022687393],"category_scores_gemma":[0.000044908164,0.00011045779,0.000059309805,0.00009840168,0.000075610595,0.00001591606,0.000008587228,0.00007810428,0.0005363982],"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.0000037326365,0.000020109843,0.00022775414,0.00058306643,0.00005817933,0.000008466997,0.00039017192,0.0001276488,0.0020364553,0.9837213,0.012334735,0.00048834865],"study_design_scores_gemma":[0.0015709613,0.00013596119,0.002401709,0.0006912105,0.0001429375,0.00018581226,0.00036152272,0.021635663,0.0026183305,0.7693919,0.19968696,0.0011770483],"about_ca_topic_score_codex":0.00021045793,"about_ca_topic_score_gemma":0.00028223003,"teacher_disagreement_score":0.21432945,"about_ca_system_score_codex":0.00001602377,"about_ca_system_score_gemma":0.00001063544,"threshold_uncertainty_score":0.99864334},"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":"W2065299307","doi":"10.1016/j.ejc.2013.06.020","title":"Forbidden configurations: Boundary cases","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Forb; Mathematics; Combinatorics; Permutation (music); Simple (philosophy); Matrix (chemical analysis); Conjecture; Column (typography); Boundary (topology); Geometry; Mathematical analysis; Physics; Connection (principal bundle)","score_opus":0.009763203030370158,"score_gpt":0.18204344979126452,"score_spread":0.17228024676089437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065299307","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.89209294,0.0028824073,0.0033292605,0.00007926747,0.0030240617,0.00012065283,0.0000024047777,0.00010177101,0.098367244],"genre_scores_gemma":[0.99939984,0.000074462354,0.000051914343,0.000029444307,0.00014465726,9.613422e-7,8.3173575e-7,0.000030979016,0.00026688608],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911606,0.00016581635,0.00038953792,0.000043427197,0.00015389292,0.00013129036],"domain_scores_gemma":[0.9994084,0.000073222895,0.00010937156,0.0001318507,0.0001705839,0.000106562824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042276524,0.00009939906,0.00014936745,0.000101132435,0.00006906793,0.00010984985,0.00021006094,0.000016104235,0.00013369265],"category_scores_gemma":[0.00005682358,0.000086892745,0.00008367477,0.00013985255,0.000029575893,0.00030508553,0.000011358291,0.00019611421,0.00026830897],"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.000060795515,0.0004774843,0.004188705,0.0005644468,0.001008269,0.0047228644,0.0047235787,0.004267854,0.02889985,0.40369695,0.50372577,0.04366347],"study_design_scores_gemma":[0.0042217155,0.0018255976,0.03148303,0.00060527667,0.00016948402,0.0066316747,0.0028051918,0.0016472572,0.006080406,0.093970485,0.849248,0.0013118652],"about_ca_topic_score_codex":6.786592e-7,"about_ca_topic_score_gemma":9.8354874e-8,"teacher_disagreement_score":0.34552228,"about_ca_system_score_codex":0.00002556777,"about_ca_system_score_gemma":0.000014718228,"threshold_uncertainty_score":0.35433835},"labels":[],"label_agreement":null},{"id":"W2065803426","doi":"10.1016/s0378-3758(00)00245-7","title":"Recent progress on the existence of perfect Mendelsohn designs","year":2001,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Measure (data warehouse); Combinatorics; Discrete mathematics; Computer science","score_opus":0.06442741095553374,"score_gpt":0.29843160704067995,"score_spread":0.23400419608514622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065803426","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.9008435,0.0027333412,0.08715967,0.00015311356,0.00032463888,0.00010951734,0.00001998583,0.00002606536,0.008630187],"genre_scores_gemma":[0.9987813,0.00037733832,0.0007715229,0.0000186965,0.000034450397,0.0000016132233,4.9311024e-7,0.0000053799363,0.000009173588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993033,0.00007190913,0.0002820155,0.000052205207,0.00016866063,0.000121928184],"domain_scores_gemma":[0.9990163,0.00068871916,0.00008751146,0.00006845628,0.00007047402,0.00006853813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044193075,0.000080424885,0.00017155104,0.000045948447,0.000046644574,0.000025561887,0.00010150998,0.000031666066,0.000046164518],"category_scores_gemma":[0.00019306374,0.000049145823,0.000020517902,0.00008360772,0.000103419894,0.000058861082,0.0000076014935,0.00021818947,0.0000022219558],"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.0010488685,0.0003043428,0.06425867,0.000490427,0.00045963225,0.0007369879,0.0067909914,0.015200884,0.0046272557,0.646267,0.0076622223,0.2521527],"study_design_scores_gemma":[0.0050579575,0.015402988,0.33801842,0.013181216,0.0006094562,0.0042028013,0.010520949,0.1915139,0.0138787,0.35442168,0.050561287,0.0026306524],"about_ca_topic_score_codex":6.837487e-7,"about_ca_topic_score_gemma":1.4396117e-7,"teacher_disagreement_score":0.29184532,"about_ca_system_score_codex":0.0000103704515,"about_ca_system_score_gemma":0.000014078804,"threshold_uncertainty_score":0.20041084},"labels":[],"label_agreement":null},{"id":"W2066013849","doi":"10.1016/j.laa.2011.10.028","title":"On the dimension of linear spaces of nilpotent matrices","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Linear subspace; Mathematics; Dimension (graph theory); Rank (graph theory); Nilpotent; Subspace topology; Linear space; Combinatorics; Space (punctuation); Field (mathematics); Upper and lower bounds; Discrete mathematics; Vector space; Pure mathematics; Mathematical analysis","score_opus":0.014828176415851779,"score_gpt":0.2028301808255856,"score_spread":0.18800200440973383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066013849","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.9931278,0.0010999704,0.001610885,0.00003881045,0.000038571154,0.00029774537,0.000018566481,0.00004860032,0.0037190532],"genre_scores_gemma":[0.999446,0.00018676408,0.00021395931,0.000012353693,0.000026938576,0.0000434044,0.0000027411652,0.000009616109,0.00005821837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996135,0.000015032635,0.00016039792,0.00007631102,0.00006657938,0.000068163936],"domain_scores_gemma":[0.9996334,0.000076598495,0.000048175374,0.00018062147,0.000034385524,0.00002687318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000964494,0.0000684775,0.00010101678,0.00004226131,0.00005150334,0.0000026133775,0.000094070114,0.000037900063,0.000040248327],"category_scores_gemma":[0.0000069899343,0.000045521047,0.000033436554,0.0001508349,0.000034083852,0.000027177735,0.000014691069,0.000055312445,0.000023152043],"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.000020701846,0.000099859484,0.00015980785,0.00023032403,0.000070096336,2.0494787e-7,0.0015272314,0.00033285382,0.029685134,0.966296,0.00020396929,0.0013737925],"study_design_scores_gemma":[0.000685719,0.0004916612,0.004460501,0.0003435658,0.00020703161,0.000012082133,0.0021097048,0.05633158,0.859195,0.06064763,0.014907248,0.0006083025],"about_ca_topic_score_codex":0.0000066013763,"about_ca_topic_score_gemma":9.0219487e-7,"teacher_disagreement_score":0.9056484,"about_ca_system_score_codex":0.0000017258686,"about_ca_system_score_gemma":0.0000026755813,"threshold_uncertainty_score":0.18562944},"labels":[],"label_agreement":null},{"id":"W2066218472","doi":"10.1023/b:desi.0000029212.52214.71","title":"Constructions for Permutation Codes in Powerline Communications","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":177,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Hamming distance; Permutation (music); Partial permutation; Mathematics; Hamming weight; Hamming code; Discrete mathematics; Combinatorics; Coding theory; Coding (social sciences); Cyclic permutation; Set (abstract data type); Automorphism; Permutation graph; Hamming graph; Block code; Computer science; Algorithm; Symmetric group; Decoding methods; Statistics; Physics","score_opus":0.02147336466098679,"score_gpt":0.2456515097056048,"score_spread":0.224178145044618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066218472","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.55332476,0.0027435948,0.4398288,0.00016225239,0.00020627066,0.00065587426,0.0001266305,0.0002889772,0.0026627993],"genre_scores_gemma":[0.97991246,0.00038797245,0.019435842,0.000025494106,0.000017411177,0.00015261487,0.000049712875,0.000016347041,0.0000021676976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943763,0.000031223368,0.00020705012,0.000114904906,0.0000491584,0.00016004185],"domain_scores_gemma":[0.999565,0.0000974201,0.000024262928,0.00022656097,0.00003673497,0.000050000275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016254524,0.00011432519,0.00015082287,0.00024061675,0.00014830916,0.00004202822,0.00011384101,0.0000656997,0.000004864921],"category_scores_gemma":[0.000008007473,0.00011818671,0.00007288098,0.0003476177,0.0001529178,0.000102128055,0.000009542111,0.00008652829,0.0000015598948],"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.00002601522,0.000083702536,0.004092077,0.00012060944,0.00009324885,0.0000015603124,0.0017142815,0.007885891,0.012995609,0.9678135,0.00009100553,0.005082492],"study_design_scores_gemma":[0.007300362,0.00053791725,0.020116776,0.00054911344,0.00021835718,0.00017130173,0.0130453445,0.029642783,0.008636417,0.89555925,0.022577172,0.001645201],"about_ca_topic_score_codex":0.000022389318,"about_ca_topic_score_gemma":0.0001519005,"teacher_disagreement_score":0.42658764,"about_ca_system_score_codex":0.000013058344,"about_ca_system_score_gemma":0.000009127113,"threshold_uncertainty_score":0.48195145},"labels":[],"label_agreement":null},{"id":"W2066759919","doi":"10.1016/j.dam.2011.12.023","title":"A parallelogram tile fills the plane by translation in at most two distinct ways","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Parallelogram; Polyomino; Substitution tiling; Mathematics; Tile; Square tiling; Conjecture; Hexagonal tiling; Combinatorics; Tessellation (computer graphics); Plane (geometry); Translation (biology); Square (algebra); Grid; Geometry; Regular polygon; Hinge; Physics","score_opus":0.014189761195813425,"score_gpt":0.21222244802066792,"score_spread":0.1980326868248545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066759919","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.8299367,0.0012261664,0.04709289,0.00004156561,0.00029253095,0.0014282889,0.00019650951,0.00047361347,0.11931174],"genre_scores_gemma":[0.998363,0.000012344676,0.0011306024,0.000015799531,0.00005301629,0.00018055268,0.00014275777,0.000040550884,0.000061358005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990703,0.000014615933,0.00030862412,0.00010171168,0.00015398198,0.00035079115],"domain_scores_gemma":[0.99938786,0.00020683666,0.00004936043,0.00028409538,0.0000042296883,0.00006761421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031151823,0.00018960607,0.0002161769,0.000032645858,0.000083740524,0.000025274037,0.00016507567,0.00007221548,0.000103576254],"category_scores_gemma":[0.0000063879,0.00013387257,0.000046868572,0.0001672033,0.0000441984,0.0000637723,0.000019664209,0.00013659362,0.00012370839],"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.0001558455,0.0007595663,0.0025079409,0.002839702,0.0004787841,0.000009723642,0.08995608,0.01271807,0.14304428,0.6940986,0.03380138,0.019630032],"study_design_scores_gemma":[0.014157942,0.0002329909,0.0044963243,0.0011430968,0.0009099331,0.00027599832,0.02589496,0.37749785,0.09619348,0.2345231,0.23680381,0.007870508],"about_ca_topic_score_codex":0.000005651688,"about_ca_topic_score_gemma":0.00003717709,"teacher_disagreement_score":0.45957547,"about_ca_system_score_codex":0.00003063579,"about_ca_system_score_gemma":0.0000021216545,"threshold_uncertainty_score":0.5459165},"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":"W2068079633","doi":"10.1117/12.509844","title":"Optical CDMA and WDMA in the access network","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","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":"Code division multiple access; Computer science; Metric (unit); Wavelength-division multiplexing; Bandwidth (computing); Code (set theory); Computer network; Electronic engineering; Wavelength; Optics; Engineering; Physics","score_opus":0.011489978650821898,"score_gpt":0.2230800415535638,"score_spread":0.2115900629027419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068079633","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.9841924,0.0003582327,0.00004850425,0.0006231797,0.00029632202,0.0005258942,0.0000109116045,0.00008677473,0.013857782],"genre_scores_gemma":[0.9879447,0.00012890171,0.01117592,0.00011875817,0.00033223515,0.00018993481,0.0000030920983,0.00006021756,0.0000462163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980794,4.5437496e-8,0.0006324752,0.0002969793,0.0005022039,0.00048887235],"domain_scores_gemma":[0.9990982,0.00026733297,0.00013210239,0.00007048336,0.00033086378,0.000101022706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013219421,0.0003202876,0.000396065,0.00008393213,0.00008453823,0.00020398162,0.0009959675,0.00020518791,0.000009302955],"category_scores_gemma":[0.0003208027,0.000236435,0.00035248435,0.00049222325,0.00021800969,0.00052670034,0.0000901461,0.00043011853,0.0000011501392],"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.00003314218,0.000057419307,0.0011773723,0.000473658,0.00022678342,2.5868366e-7,0.0003129687,0.0012723295,0.03671907,0.9556947,0.0037891432,0.0002431737],"study_design_scores_gemma":[0.013803175,0.0021012297,0.03687486,0.0048455386,0.001499734,0.00087111286,0.028740458,0.26643103,0.27951324,0.19765905,0.16155805,0.0061025363],"about_ca_topic_score_codex":0.0000029992095,"about_ca_topic_score_gemma":3.500585e-7,"teacher_disagreement_score":0.75803566,"about_ca_system_score_codex":0.00007016467,"about_ca_system_score_gemma":0.000013416762,"threshold_uncertainty_score":0.96415395},"labels":[],"label_agreement":null},{"id":"W2068457180","doi":"10.1006/jctb.2000.1996","title":"Cycle Decompositions of K and K−I","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":261,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Graph; Mathematics; Combinatorics; Order (exchange); Complete graph; Economics","score_opus":0.004295824774612166,"score_gpt":0.20109742396501387,"score_spread":0.19680159919040172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068457180","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.9880575,0.0008902439,0.000630157,0.000031792926,0.0027221476,0.000041202085,0.0000026435207,0.000023403067,0.007600932],"genre_scores_gemma":[0.9994337,0.0001932185,0.00008987056,0.0000064267706,0.00022500794,8.276225e-7,3.0609266e-7,0.000011647517,0.00003899152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999345,0.000087282715,0.00032931054,0.00003573526,0.00010742064,0.00009524781],"domain_scores_gemma":[0.9995456,0.000109905945,0.00010738426,0.00009070192,0.000081008475,0.00006541278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004742698,0.000080928956,0.00022581889,0.000090301124,0.00004419679,0.000016409353,0.00010664944,0.000050496754,0.000053222022],"category_scores_gemma":[0.000028890374,0.00007171052,0.0000746821,0.00011693091,0.00007924925,0.00025875305,0.000012176978,0.000117249925,0.0000013625036],"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.00039369473,0.000050340717,0.00036476197,0.00004434268,0.00012837346,0.000026303398,0.000551719,0.00071449066,0.010307518,0.9861447,0.00027036382,0.001003399],"study_design_scores_gemma":[0.00090794853,0.00034547193,0.00048042604,0.000074738586,0.000044590834,0.00059210404,0.00049870345,0.000044510332,0.009965682,0.9741711,0.012755937,0.000118781056],"about_ca_topic_score_codex":5.017948e-7,"about_ca_topic_score_gemma":2.672277e-7,"teacher_disagreement_score":0.012485573,"about_ca_system_score_codex":0.00001187963,"about_ca_system_score_gemma":0.000009388163,"threshold_uncertainty_score":0.29242703},"labels":[],"label_agreement":null},{"id":"W2069058448","doi":"10.1007/s00026-011-0092-7","title":"Cyclic (v; r, s; λ) Difference Families with Two Base Blocks and v ≤ 50","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary Golay code; Base (topology); Block (permutation group theory); Binary number; Autocorrelation; Difference set; Complementary sequences; Zero (linguistics); Block design","score_opus":0.03562129341861205,"score_gpt":0.22366915148860836,"score_spread":0.1880478580699963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069058448","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.9848805,0.0010941644,0.00035362574,0.000009757333,0.00016156722,0.000076133314,0.000004043798,0.00009497376,0.013325221],"genre_scores_gemma":[0.99947417,0.00032351335,0.000039353527,0.00002430868,0.000008365741,0.0000090707645,0.0000010615996,0.000017380322,0.0001028024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994182,0.000024990662,0.00015777287,0.00010670293,0.00011664295,0.00017568062],"domain_scores_gemma":[0.9995575,0.00004361771,0.00003791508,0.0002222575,0.000059276415,0.000079444384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012334988,0.00013335554,0.0001994913,0.00008716445,0.000035264286,0.000009308764,0.000121718935,0.000045198365,0.00001177118],"category_scores_gemma":[0.0000091188085,0.000111384725,0.00003039152,0.00017715846,0.000073957795,0.00006974122,0.000020118287,0.00009333958,0.0000030329315],"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.00016148268,0.0004499905,0.1265109,0.0007919947,0.00038554784,0.000052710868,0.007482126,0.0001420123,0.0072914017,0.8469612,0.0012352951,0.008535315],"study_design_scores_gemma":[0.0030707193,0.0015181735,0.15806143,0.00059301883,0.0001271437,0.000075433854,0.0020604741,0.002093501,0.29543006,0.5309013,0.004495181,0.0015735589],"about_ca_topic_score_codex":0.000040370855,"about_ca_topic_score_gemma":0.00000494482,"teacher_disagreement_score":0.31605992,"about_ca_system_score_codex":0.000002479053,"about_ca_system_score_gemma":0.0000054244465,"threshold_uncertainty_score":0.45421374},"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":"W2069390698","doi":"10.1007/s10801-009-0191-2","title":"Bounds on permutation codes of distance four","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Hamming distance; Permutation (music); Bit-reversal permutation; Minimum distance; Partial permutation; Permutation graph; Hamming code; Discrete mathematics; Set (abstract data type); Hamming graph; Upper and lower bounds; Cyclic permutation; Hamming bound; Symmetric group; Block code; Algorithm; Decoding methods; Graph; Computer science","score_opus":0.007109176898238282,"score_gpt":0.2014739093087451,"score_spread":0.1943647324105068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069390698","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.99134564,0.0007743452,0.0033525967,0.00008376155,0.0010766281,0.00004856741,0.0000023147375,0.00002801568,0.003288108],"genre_scores_gemma":[0.99973214,0.00006916079,0.00003742978,0.00002257316,0.00006291387,4.3653333e-7,5.9613285e-7,0.000010838655,0.00006391939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990865,0.000037842707,0.00041964735,0.00005207824,0.00028288813,0.00012102932],"domain_scores_gemma":[0.99939644,0.00008402964,0.00019974355,0.00012296316,0.0001323892,0.00006441113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032405206,0.0001048326,0.00025113398,0.00013973232,0.000035217785,0.000020939691,0.00015810282,0.000057035548,0.000008978656],"category_scores_gemma":[0.00005082953,0.00009368948,0.00011669537,0.00026046394,0.000019960382,0.00013700887,0.000003287209,0.00019370375,0.0000032463695],"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.00011445287,0.00026041028,0.0012136422,0.00015843299,0.00012705027,0.00007285335,0.0012596585,0.004620067,0.0064784964,0.97617054,0.0025740433,0.0069503654],"study_design_scores_gemma":[0.0021417583,0.0021533957,0.032740235,0.0005293792,0.00009091273,0.00024169535,0.00049376633,0.0027327603,0.013317517,0.9374582,0.007672091,0.0004282666],"about_ca_topic_score_codex":3.2654486e-7,"about_ca_topic_score_gemma":3.3602714e-7,"teacher_disagreement_score":0.038712308,"about_ca_system_score_codex":0.00006864798,"about_ca_system_score_gemma":0.000018909228,"threshold_uncertainty_score":0.3820546},"labels":[],"label_agreement":null},{"id":"W2069731245","doi":"10.1016/s0024-3795(02)00265-3","title":"Properties of the Brualdi–Li tournament matrix","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Tournament; Mathematics; Combinatorics; Matrix (chemical analysis); Spectral radius; Diagonalizable matrix; Graph; Simple (philosophy); Characteristic polynomial; Discrete mathematics; Polynomial; Computer science; Symmetric matrix; Physics; Mathematical analysis","score_opus":0.014068583642075444,"score_gpt":0.192254655388989,"score_spread":0.17818607174691356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069731245","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.9826257,0.011627103,0.00072858605,0.000388386,0.00010169596,0.0005622954,0.000016145317,0.00011688983,0.0038331721],"genre_scores_gemma":[0.9985449,0.00024391888,0.000034354343,0.000019882988,0.00006305088,0.000091820664,5.748825e-7,0.000009918493,0.0009916344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996414,0.000011756564,0.00013864186,0.00006633726,0.000062188046,0.000079674166],"domain_scores_gemma":[0.9997512,0.000009197602,0.000022567754,0.0001684379,0.00001941362,0.000029155508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004179269,0.00006220058,0.00007466737,0.000020274361,0.00007978789,0.000010076372,0.0001046331,0.000030636205,0.00005196333],"category_scores_gemma":[0.0000033402457,0.000041270607,0.000033022356,0.00012697256,0.000028194565,0.000035944842,0.000017768643,0.00006096016,0.000042391654],"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.00001327945,0.0003302342,0.0011227467,0.0012804213,0.00030533582,6.585186e-7,0.007500025,0.005582957,0.27851158,0.6776547,0.006215205,0.021482898],"study_design_scores_gemma":[0.0010639578,0.00010747058,0.002235062,0.00033811037,0.00018117417,0.00006798267,0.0016212864,0.18982911,0.30497888,0.0070483168,0.49164936,0.0008792903],"about_ca_topic_score_codex":0.0000016021938,"about_ca_topic_score_gemma":0.0000010717843,"teacher_disagreement_score":0.6706064,"about_ca_system_score_codex":0.0000045872785,"about_ca_system_score_gemma":0.0000016577286,"threshold_uncertainty_score":0.16829665},"labels":[],"label_agreement":null},{"id":"W2069955765","doi":"10.1006/jcta.2001.3246","title":"Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Suzhou University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Group (periodic table); Type (biology); Mathematics; Block (permutation group theory); Combinatorics; Block size; Spectrum (functional analysis); Physics; Computer science; Biology","score_opus":0.01417728954953936,"score_gpt":0.1983650972140626,"score_spread":0.18418780766452322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069955765","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.9879359,0.0007542522,0.0001958795,0.000077347744,0.0024865079,0.0003000413,0.0000043707096,0.0001123356,0.008133381],"genre_scores_gemma":[0.99724257,0.00024852532,0.00037670674,0.000074707394,0.0005311825,0.000009160654,6.2935715e-7,0.000093711074,0.0014228207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980408,0.00026586824,0.0005456082,0.00021650197,0.00043171254,0.00049950765],"domain_scores_gemma":[0.99831814,0.0004029001,0.00035348564,0.00039001473,0.00022130663,0.00031415615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011194028,0.00040310324,0.0006369794,0.00014259729,0.00035842435,0.00032811222,0.00043475343,0.00018374389,0.0005151785],"category_scores_gemma":[0.00023964536,0.00027258307,0.000105843574,0.00038135768,0.00017047788,0.00075711793,0.000062183564,0.0005014825,0.000032434775],"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.015421195,0.0004907082,0.0016965463,0.00036112306,0.0011912122,0.0017739726,0.0026114588,0.00028635774,0.0044489703,0.970531,0.00082327897,0.00036420795],"study_design_scores_gemma":[0.02372588,0.03915985,0.0015742839,0.0020242587,0.00076440535,0.01784804,0.006498299,0.00018690681,0.014686579,0.8659281,0.025355456,0.0022479175],"about_ca_topic_score_codex":0.000011416953,"about_ca_topic_score_gemma":0.000017092008,"teacher_disagreement_score":0.10460284,"about_ca_system_score_codex":0.000052405714,"about_ca_system_score_gemma":0.00004898007,"threshold_uncertainty_score":0.99997264},"labels":[],"label_agreement":null},{"id":"W2070639743","doi":"10.1016/j.dam.2009.06.002","title":"2-dimensional optical orthogonal codes from singer groups","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Cardinality (data modeling); Mathematics; Code word; Dimension (graph theory); Code (set theory); Finite geometry; Finite field; Combinatorics; Asymptotically optimal algorithm; Discrete mathematics; Projective test; Algorithm; Pure mathematics; Projective space; Computer science; Decoding methods","score_opus":0.007475241600825216,"score_gpt":0.19862031549488754,"score_spread":0.19114507389406232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070639743","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.925895,0.00015513002,0.025713034,0.00004306655,0.00023906204,0.00023919152,0.000046569916,0.0005011743,0.04716781],"genre_scores_gemma":[0.97726315,0.000003701046,0.022300737,0.00008948366,0.00018877715,0.00001790269,0.00006963779,0.000035361594,0.000031236625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889666,0.000007635592,0.00034476668,0.00018795162,0.00027324492,0.00028974275],"domain_scores_gemma":[0.99937946,0.00013649806,0.000039839088,0.0003090171,0.000016175207,0.0001189963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001504471,0.00023696662,0.0003205286,0.000048447804,0.00007316666,0.000048250353,0.00016863443,0.00012325287,0.000119024415],"category_scores_gemma":[0.000009423996,0.00020626243,0.00009441054,0.00011270679,0.000053299555,0.00005987373,0.000020714746,0.00018008646,0.00022547555],"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.000021630478,0.00010245457,0.000014086702,0.00007922514,0.00010227706,0.000014392551,0.00092859817,0.0027017482,0.1068645,0.8865635,0.0011106881,0.0014969172],"study_design_scores_gemma":[0.0010547319,0.00007296558,0.0014624955,0.00020975947,0.00016916907,0.000036653528,0.0008496195,0.044817496,0.03361203,0.9152863,0.0012740532,0.001154745],"about_ca_topic_score_codex":4.4026677e-7,"about_ca_topic_score_gemma":0.0000011156152,"teacher_disagreement_score":0.07325247,"about_ca_system_score_codex":0.000020180307,"about_ca_system_score_gemma":0.0000069001953,"threshold_uncertainty_score":0.84111375},"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":"W2071495366","doi":"10.1109/jphot.2013.2255033","title":"Chip-Asynchronous Binary Optical CDMA: An Optimum Signaling Scheme for Random Delays","year":2013,"lang":"en","type":"article","venue":"IEEE photonics journal","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":"McGill University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Asynchronous communication; Computer science; Chip; Code division multiple access; Electronic engineering; Robustness (evolution); Channel capacity; Binary number; Channel (broadcasting); Computer network; Telecommunications; Engineering; Mathematics","score_opus":0.011711229698516117,"score_gpt":0.22087000937678103,"score_spread":0.2091587796782649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071495366","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.9332877,0.0009875795,0.062057383,0.000028305532,0.0019161697,0.0005195169,0.000009388906,0.00018058594,0.0010133772],"genre_scores_gemma":[0.9827163,0.00008036476,0.016395634,0.000053648906,0.00050963176,0.00011585951,0.000006180585,0.000088552486,0.000033791872],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982879,0.00006932737,0.0005573683,0.00021462345,0.000234757,0.0006359815],"domain_scores_gemma":[0.9989199,0.0001550632,0.000091956186,0.00027793463,0.00014636785,0.00040879496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008045438,0.000290376,0.0003970476,0.00015486065,0.0003219218,0.00027903315,0.00037272702,0.00019299844,0.00024608523],"category_scores_gemma":[0.000026339918,0.0002645743,0.00027434537,0.00013512252,0.000053676806,0.0005411604,0.000015207922,0.0005994085,0.00009592541],"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.0002576077,0.00018635084,0.000086092645,0.00016797426,0.00040103958,0.000074385964,0.00080819475,0.26760215,0.7250877,0.0013071912,0.002003534,0.0020177944],"study_design_scores_gemma":[0.0048864526,0.0005183132,0.000048434493,0.00016013904,0.00009085683,0.0012342385,0.00040130067,0.90128875,0.08278364,0.006174203,0.001690914,0.00072275277],"about_ca_topic_score_codex":0.0000044180633,"about_ca_topic_score_gemma":0.000001840068,"teacher_disagreement_score":0.64230406,"about_ca_system_score_codex":0.00010045681,"about_ca_system_score_gemma":0.00005833911,"threshold_uncertainty_score":0.9999806},"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":"W2072270436","doi":"10.1016/j.disc.2010.01.003","title":"Generating self-complementary uniform hypergraphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Permutation (music); Isomorphism (crystallography); Order (exchange); Discrete mathematics; Expressive power; Representation (politics); Theoretical computer science; Computer science","score_opus":0.007141301343670306,"score_gpt":0.20805923246738756,"score_spread":0.20091793112371725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072270436","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.9655479,0.000044933917,0.0047554174,0.000019547453,0.00069395447,0.00019638707,0.000023818251,0.00066289713,0.028055152],"genre_scores_gemma":[0.95874316,0.000006452568,0.040905315,0.00002971343,0.00014927832,0.000025012363,0.000022721131,0.000047323705,0.00007103306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918735,0.000010697661,0.00029567917,0.00010882928,0.000145935,0.00025148675],"domain_scores_gemma":[0.9994709,0.00004425821,0.000038215232,0.00034837634,0.000018794406,0.00007947403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023329195,0.00017349524,0.00017988574,0.000067591754,0.00010981069,0.00005539995,0.00020244703,0.00006429125,0.00018659573],"category_scores_gemma":[0.000009000418,0.0001514539,0.00008740258,0.00013700928,0.000025453108,0.00010185479,0.000028121342,0.00021195598,0.00008072282],"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.00000384665,0.00016482321,0.0013845224,0.0017015046,0.0005158055,0.000027901604,0.01393155,0.0037714825,0.27374685,0.6982322,0.0037584691,0.002761105],"study_design_scores_gemma":[0.0010194825,0.000080614314,0.00017743566,0.00015864025,0.00018280644,0.00019172372,0.006097471,0.8386598,0.034843497,0.086407036,0.030671418,0.0015100463],"about_ca_topic_score_codex":0.000003221847,"about_ca_topic_score_gemma":0.000026135227,"teacher_disagreement_score":0.83488834,"about_ca_system_score_codex":0.000009600207,"about_ca_system_score_gemma":0.000005139508,"threshold_uncertainty_score":0.6176111},"labels":[],"label_agreement":null},{"id":"W2073783222","doi":"10.1016/j.disc.2003.11.027","title":"On the chromatic index of path decompositions","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Chromatic scale; Path (computing); Block (permutation group theory); Edge coloring; Windmill graph; Discrete mathematics; Graph power; Line graph; Computer science","score_opus":0.007012095072584522,"score_gpt":0.2003267415899903,"score_spread":0.1933146465174058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073783222","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.9233945,0.00005143391,0.055293676,0.0000654081,0.00010526189,0.00022911777,0.000014537241,0.00012070945,0.020725382],"genre_scores_gemma":[0.9991888,0.0000033651454,0.0007093847,0.000018261346,0.000013110424,0.000023378672,0.0000028385757,0.000019462386,0.000021407084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994804,0.000014412199,0.00021780553,0.000050484206,0.00012679493,0.000110080604],"domain_scores_gemma":[0.99950784,0.0001241926,0.000041866115,0.0002873945,0.000011815778,0.000026867909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012912996,0.00009831787,0.00014116416,0.000034543024,0.00005218314,0.000014971753,0.00014695563,0.00003474159,0.000039552946],"category_scores_gemma":[0.000020571471,0.00006313358,0.00007330991,0.00012040663,0.000042517284,0.000029846335,0.0000107308,0.000078305915,0.00005045056],"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.0000011786818,0.00004532445,0.000008895907,0.00030298662,0.00005146919,0.0000018048521,0.0024473083,0.016033482,0.0024464303,0.9785268,0.00010661335,0.000027724394],"study_design_scores_gemma":[0.00036236757,0.00007167897,0.00023605819,0.0008394947,0.00004228092,0.000021226328,0.0017309554,0.030015621,0.012920002,0.9534804,0.00005328876,0.00022662654],"about_ca_topic_score_codex":0.0000012827941,"about_ca_topic_score_gemma":0.0000014016122,"teacher_disagreement_score":0.07579432,"about_ca_system_score_codex":0.000017444754,"about_ca_system_score_gemma":0.0000052126998,"threshold_uncertainty_score":0.25745127},"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":"W2074500200","doi":"10.1007/s00373-011-1053-y","title":"Super-Simple Twofold Steiner Pentagon Systems","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Mount Saint Vincent University","funders":"","keywords":"Pentagon; Combinatorics; Simple (philosophy); Mathematics; Order (exchange); Multigraph; Steiner system; Path (computing); Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.01590127618815921,"score_gpt":0.1658016935877956,"score_spread":0.1499004173996364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074500200","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.9727758,0.003833775,0.00014031738,0.000002055617,0.0018062145,0.0001774177,0.000010103097,0.00036027408,0.020894011],"genre_scores_gemma":[0.99942714,0.00023330977,0.000006537009,0.0000109459415,0.000019750509,0.000035258352,0.0000066312114,0.000033697703,0.0002267516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916023,0.000034459226,0.00022144709,0.0001704296,0.00013165195,0.00028178733],"domain_scores_gemma":[0.99952424,0.00002193668,0.000024712954,0.00026363845,0.00003362523,0.00013185517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016997539,0.00018708991,0.00021912242,0.000114198054,0.00011277335,0.000047546182,0.00014745112,0.000099832076,0.00002787418],"category_scores_gemma":[0.0000033661274,0.00017166144,0.0000675402,0.00027680644,0.000038605638,0.00012807269,0.000027750404,0.00012937542,0.000020951384],"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.000008301647,0.000055416265,0.016370041,0.00019708877,0.00007526818,0.000024212824,0.0009419346,0.000025435775,0.00050487305,0.9793477,0.0020795765,0.0003701532],"study_design_scores_gemma":[0.0045839907,0.0009550567,0.026663678,0.00025827062,0.0003038716,0.00035619788,0.010462649,0.010090306,0.008476743,0.8418058,0.092978,0.0030654143],"about_ca_topic_score_codex":0.00009286681,"about_ca_topic_score_gemma":0.0000032587018,"teacher_disagreement_score":0.13754188,"about_ca_system_score_codex":0.000013735134,"about_ca_system_score_gemma":0.000004097984,"threshold_uncertainty_score":0.700015},"labels":[],"label_agreement":null},{"id":"W2074982499","doi":"10.1007/s004530010067","title":"Static Frequency Assignment in Cellular Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Frequency assignment; Theory of computation; Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex connectivity; Discrete mathematics; Integer (computer science); Algorithm; Computer science","score_opus":0.004934258321494517,"score_gpt":0.17397404949442233,"score_spread":0.1690397911729278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074982499","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.47558135,0.0022988275,0.4903247,0.00012155871,0.0018282158,0.00050976494,0.000007846699,0.0005683048,0.028759424],"genre_scores_gemma":[0.9991104,0.00005852367,0.0004838658,0.00003721525,0.00011250879,0.000034299417,0.00000818056,0.000024555146,0.00013045478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923253,0.000043544012,0.0002124293,0.00012539943,0.000098037126,0.00028806145],"domain_scores_gemma":[0.9996888,0.000035999976,0.000015822234,0.00018896209,0.000007482756,0.000062927276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016562291,0.00012037787,0.00014182189,0.000071958144,0.0000250796,0.000017938664,0.00012006652,0.000068261295,0.00013620447],"category_scores_gemma":[0.000003520403,0.0001217804,0.000037775473,0.00023267834,0.00001768983,0.00007075986,0.000009642783,0.0001510087,0.00008017796],"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.00003361873,0.000406309,0.014805886,0.0002610974,0.00037191674,0.0021286455,0.002784652,0.7258879,0.02335358,0.033693507,0.008119614,0.18815325],"study_design_scores_gemma":[0.0012059973,0.000109400855,0.0024301575,0.0001710812,0.000030595766,0.000057390207,0.00048110163,0.94731563,0.0036486485,0.026738156,0.016930815,0.0008810206],"about_ca_topic_score_codex":0.000027828384,"about_ca_topic_score_gemma":0.000009614278,"teacher_disagreement_score":0.52352905,"about_ca_system_score_codex":0.00005640128,"about_ca_system_score_gemma":0.000004574591,"threshold_uncertainty_score":0.49660605},"labels":[],"label_agreement":null},{"id":"W2075223139","doi":"10.1016/j.disc.2014.02.009","title":"A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Simple (philosophy); Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.022443692911218813,"score_gpt":0.2276431449358064,"score_spread":0.2051994520245876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075223139","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.49053782,0.00013729141,0.4746294,0.00002124028,0.0006807756,0.00038616103,0.00005729762,0.0009116279,0.032638375],"genre_scores_gemma":[0.87333566,0.000009107369,0.12514836,0.000040954805,0.0004733168,0.00002250199,0.000063320804,0.00012172705,0.0007850643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983613,0.00010466032,0.00055058714,0.00030317804,0.0002576795,0.00042258226],"domain_scores_gemma":[0.9985541,0.00028090485,0.00013509559,0.0007244065,0.000034770823,0.000270715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037105771,0.00033185416,0.0004693104,0.00008630612,0.00018985046,0.00013796901,0.00030100756,0.00017017397,0.0007097263],"category_scores_gemma":[0.000060900613,0.00031833083,0.0001241674,0.00018223988,0.000110764355,0.0002468511,0.000055038967,0.00019539142,0.0001956529],"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.000060424652,0.00006705835,0.0045867157,0.0010111408,0.0005748256,0.000027291826,0.013716918,0.005295937,0.09322504,0.8638301,0.00771263,0.009891898],"study_design_scores_gemma":[0.0027269763,0.0002864678,0.0001495134,0.0008010801,0.00040631887,0.00035958277,0.016864285,0.18266031,0.07713714,0.7041244,0.012106646,0.0023772863],"about_ca_topic_score_codex":0.000044442535,"about_ca_topic_score_gemma":0.000042102663,"teacher_disagreement_score":0.38279784,"about_ca_system_score_codex":0.000065828324,"about_ca_system_score_gemma":0.000020209112,"threshold_uncertainty_score":0.99992687},"labels":[],"label_agreement":null},{"id":"W2075630602","doi":"10.1016/j.jspi.2014.10.004","title":"Mutually orthogonal latin squares with large holes","year":2014,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Latin square; Mathematics; Combinatorics; Order (exchange); Orthogonal array; Row; Least-squares function approximation; Set (abstract data type); Total least squares; Statistics; Computer science","score_opus":0.009328625088272301,"score_gpt":0.23348220135676093,"score_spread":0.2241535762684886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075630602","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.48486698,0.00016604373,0.5129905,0.000010085315,0.000074933756,0.000015662812,0.00001990131,0.000018983286,0.0018369696],"genre_scores_gemma":[0.9967265,0.000008527748,0.0031411077,0.000024188477,0.00007568304,6.068528e-7,0.0000026076045,0.00000795708,0.000012806496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99937284,0.000041601597,0.00023279675,0.000056881723,0.00014985181,0.00014603075],"domain_scores_gemma":[0.99930674,0.00042117198,0.000063031366,0.00004706063,0.00005408051,0.000107900814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030369344,0.00009057097,0.00018729939,0.00007463194,0.000050497114,0.00004685552,0.00006208064,0.00003684707,0.000028373623],"category_scores_gemma":[0.00013336001,0.00006270107,0.000014944756,0.00006026805,0.00006493864,0.00009859369,0.0000076098413,0.00021492745,0.000003158237],"study_design_candidate":"observational","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.00023493286,0.00006334092,0.16762154,0.00037716332,0.00015653169,0.00019607718,0.0021816753,0.013790899,0.0009877806,0.7974717,0.0018261562,0.015092203],"study_design_scores_gemma":[0.004105061,0.0037814383,0.7450763,0.0032832357,0.0001958954,0.0009009595,0.0025774755,0.13649234,0.00052334333,0.08352523,0.018332636,0.0012061021],"about_ca_topic_score_codex":6.1869764e-7,"about_ca_topic_score_gemma":0.0000011289679,"teacher_disagreement_score":0.71394646,"about_ca_system_score_codex":0.000004524007,"about_ca_system_score_gemma":0.0000123312775,"threshold_uncertainty_score":0.2556875},"labels":[],"label_agreement":null},{"id":"W2075649093","doi":"10.1016/s0012-365x(03)00283-8","title":"New combinatorial designs and their applications to authentication codes and secret sharing schemes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Mathematics; Converse; Combinatorial design; Discrete mathematics; Upper and lower bounds; Type (biology); Construct (python library); Combinatorics; Scheme (mathematics); Equivalence (formal languages); Cryptography; Computer science; Algorithm","score_opus":0.018966663341195778,"score_gpt":0.2364626543621001,"score_spread":0.2174959910209043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075649093","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.30702665,0.00039380626,0.68785083,0.00002307341,0.00011540797,0.00055027026,0.000013246794,0.00019113408,0.0038355482],"genre_scores_gemma":[0.9905607,0.000013584479,0.009200746,0.000007070261,0.00003332114,0.000069390335,0.0000056031868,0.000025442383,0.00008410256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947995,0.000014573439,0.0001748028,0.00013320812,0.000061199855,0.00013626223],"domain_scores_gemma":[0.9995463,0.00007017547,0.00002640971,0.00022080661,0.00001569064,0.00012060391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019663812,0.0001299998,0.00015719593,0.00004972143,0.00008219675,0.00008323838,0.00008504464,0.000050712933,0.000013658611],"category_scores_gemma":[0.000028453169,0.000112804424,0.000021896672,0.00011731403,0.000022271704,0.00006508981,0.00002216378,0.000058073667,0.00001068246],"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.0000012746132,0.000008686522,0.00014092006,0.0002044797,0.00003375911,1.2984293e-7,0.0037653395,0.000027509835,0.006557524,0.9887468,0.000067523266,0.00044601638],"study_design_scores_gemma":[0.0004965254,0.00004013452,0.000092042814,0.00017060136,0.000060024122,0.000024420406,0.0033678375,0.01864408,0.023562185,0.9453549,0.00772211,0.00046516772],"about_ca_topic_score_codex":0.0000014298358,"about_ca_topic_score_gemma":0.0000013349069,"teacher_disagreement_score":0.6835341,"about_ca_system_score_codex":0.000010499378,"about_ca_system_score_gemma":0.0000059052204,"threshold_uncertainty_score":0.4600031},"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":"W2078116611","doi":"10.1016/j.disc.2014.11.020","title":"A note on the discrepancy of matrices with bounded row and column sums","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Combinatorics; Lemma (botany); Column (typography); Context (archaeology); Discrete mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Computer science; Connection (principal bundle)","score_opus":0.005801646184660525,"score_gpt":0.19188970979506242,"score_spread":0.1860880636104019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078116611","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.9652225,0.00012393153,0.01224132,0.00008725573,0.000065682216,0.0002923761,0.000014923299,0.00010867489,0.021843353],"genre_scores_gemma":[0.99838376,0.0000140241245,0.0013972691,0.000014731792,0.000024999852,0.000023158665,0.0000019519562,0.000028765715,0.00011135032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999355,0.000035571,0.0002041653,0.000094600175,0.0001636697,0.00014695985],"domain_scores_gemma":[0.99926907,0.00027152643,0.000072638075,0.0003304281,0.00001732991,0.000039033028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002874239,0.00013875292,0.00022211521,0.000036315978,0.00006758543,0.000048969006,0.00013658934,0.000041321313,0.000014169262],"category_scores_gemma":[0.000035517784,0.000079086065,0.000041494826,0.00012375647,0.000092875714,0.000049006034,0.000017716126,0.000084361025,0.000009732556],"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.000025555322,0.0000437115,0.0004508089,0.0013305562,0.00012096576,0.0000019994382,0.00559771,0.00038034958,0.0010579247,0.990204,0.00023998185,0.0005464758],"study_design_scores_gemma":[0.002621516,0.0013407535,0.003154343,0.003854777,0.0005705889,0.00012758673,0.01030962,0.40941238,0.024829973,0.5321064,0.0097101275,0.0019619677],"about_ca_topic_score_codex":0.0000059670865,"about_ca_topic_score_gemma":0.00002082311,"teacher_disagreement_score":0.45809758,"about_ca_system_score_codex":0.000006527443,"about_ca_system_score_gemma":0.0000036102483,"threshold_uncertainty_score":0.32250363},"labels":[],"label_agreement":null},{"id":"W2078168416","doi":"10.1006/jsco.2002.0554","title":"Computing Rational Forms of Integer Matrices","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"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; Integer (computer science); Las vegas; Integer matrix; Matrix (chemical analysis); Combinatorics; Transformation (genetics); Discrete mathematics; Algebra over a field; Pure mathematics; Symmetric matrix; Nonnegative matrix; Computer science; Eigenvalues and eigenvectors","score_opus":0.010251792145755036,"score_gpt":0.21235275661341813,"score_spread":0.2021009644676631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078168416","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.885042,0.0007086206,0.111528225,0.000022671207,0.00037053245,0.000042939202,0.000001102085,0.000022313643,0.002261573],"genre_scores_gemma":[0.9990341,0.000025512592,0.0007521532,0.000008273995,0.00016070444,2.4404216e-7,0.0000010888075,0.000008305487,0.00000962567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919933,0.000026334877,0.00048007062,0.00003540409,0.00018121375,0.00007765223],"domain_scores_gemma":[0.9994903,0.00008845339,0.00022400843,0.000035741647,0.00012749068,0.00003399267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594681,0.00006710092,0.00017564213,0.00019264511,0.000027225804,0.000017709477,0.00007711197,0.000033437937,0.00003753078],"category_scores_gemma":[0.0000136001445,0.000056792393,0.00008409645,0.00018357126,0.00001497385,0.00018218471,0.000006232923,0.0001032695,0.0000084698495],"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.000018970963,0.00009127212,0.002021896,0.00027638098,0.00019870176,0.000010196042,0.0052241343,0.9111633,0.005817017,0.01217188,0.0023089189,0.06069737],"study_design_scores_gemma":[0.0007404726,0.00013144789,0.007579332,0.00026477964,0.000036167046,0.00029526567,0.0005824753,0.9767398,0.0017766615,0.011267464,0.00042877012,0.00015732607],"about_ca_topic_score_codex":6.021233e-7,"about_ca_topic_score_gemma":2.2410444e-7,"teacher_disagreement_score":0.113992065,"about_ca_system_score_codex":0.000022216147,"about_ca_system_score_gemma":0.0000049062364,"threshold_uncertainty_score":0.23159266},"labels":[],"label_agreement":null},{"id":"W2078558807","doi":"10.1016/j.disc.2004.09.014","title":"Pancomponented 2-factorizations of complete graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"University of Vermont; University of Minnesota Duluth","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014412601359995727,"score_gpt":0.21198889922382003,"score_spread":0.1975762978638243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078558807","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.86227435,0.0002735691,0.10784555,0.000039784485,0.00033859254,0.00032053192,0.00015097208,0.0004813044,0.028275345],"genre_scores_gemma":[0.99549234,0.000012779382,0.0043309475,0.000005438735,0.000030029054,0.00000979188,0.0000232101,0.000025988174,0.000069467664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934375,0.000014718205,0.00031550057,0.00006578509,0.00012296367,0.000137281],"domain_scores_gemma":[0.9995753,0.00005337927,0.000052925505,0.00024667903,0.000026767915,0.0000449091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008447235,0.00011371176,0.00020431344,0.00007742563,0.00003486894,0.0000111279915,0.00013256267,0.00004057154,0.00007782778],"category_scores_gemma":[0.000011104022,0.00010236069,0.00008537279,0.0001818361,0.00003796828,0.00006999208,0.000013080353,0.000061230596,0.000047343823],"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.0000050984113,0.00013982084,0.000818926,0.0010902898,0.0002652536,0.0000017581687,0.0062618325,0.016556265,0.08873009,0.8843605,0.0010516185,0.00071857165],"study_design_scores_gemma":[0.0019365927,0.00012619939,0.0032988628,0.00096739247,0.00028599778,0.00005356071,0.0040614745,0.72561294,0.062840484,0.16234855,0.036774494,0.001693446],"about_ca_topic_score_codex":0.0000012458203,"about_ca_topic_score_gemma":0.0000036412878,"teacher_disagreement_score":0.7220119,"about_ca_system_score_codex":0.000010185504,"about_ca_system_score_gemma":0.0000026326659,"threshold_uncertainty_score":0.41741475},"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":"W2078953187","doi":"10.1016/s0012-365x(02)00749-5","title":"Further results on nearly Kirkman triple systems with subsystems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"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","funders":"","keywords":"Mathematics; Combinatorics; Triple system; Discrete mathematics; Steiner system; Pure mathematics","score_opus":0.01098084679741697,"score_gpt":0.19544290743097195,"score_spread":0.18446206063355497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078953187","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.5774221,0.00080315873,0.016344275,0.000035883422,0.0020035761,0.0017458391,0.00014335259,0.0012270563,0.40027475],"genre_scores_gemma":[0.99704814,0.0000063060306,0.00036479865,0.000008408032,0.00007509791,0.00008161066,0.00001201335,0.00010029217,0.0023033463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984233,0.000107754386,0.00051692803,0.00023130643,0.00034275575,0.000377985],"domain_scores_gemma":[0.9989109,0.00011574804,0.000112054266,0.0006925266,0.000041613537,0.0001271442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059947826,0.00031265194,0.00041416517,0.00010457041,0.00008523164,0.00014313355,0.00019742225,0.00011767221,0.000017845825],"category_scores_gemma":[0.000046739377,0.00022592215,0.00008764217,0.00027885067,0.000043834807,0.00010150999,0.0000066805255,0.00017786423,0.00027178202],"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.00022718903,0.0003010974,0.00037209716,0.0045596613,0.0008600508,0.00014684771,0.027535558,0.056078322,0.0022101526,0.8999563,0.0075724684,0.00018025766],"study_design_scores_gemma":[0.0299251,0.0051708617,0.00075106014,0.017003682,0.0011982443,0.0022232854,0.13422355,0.43544677,0.0336086,0.034982193,0.2928435,0.012623159],"about_ca_topic_score_codex":0.000008700226,"about_ca_topic_score_gemma":0.000007352713,"teacher_disagreement_score":0.8649741,"about_ca_system_score_codex":0.000043220964,"about_ca_system_score_gemma":0.00001182786,"threshold_uncertainty_score":0.9212838},"labels":[],"label_agreement":null},{"id":"W2079579769","doi":"10.1023/b:desi.0000029220.27696.d0","title":"Nets of Small Degree Without Ovals","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Degree (music); Construct (python library); Combinatorics; Computer science; Mathematics; Physics; Computer network","score_opus":0.03434175849806045,"score_gpt":0.21365939596047664,"score_spread":0.1793176374624162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079579769","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.87281394,0.0025421646,0.11827955,0.000009636608,0.0001424196,0.00018495515,0.00001320159,0.00018853105,0.0058256183],"genre_scores_gemma":[0.99400544,0.00019352672,0.005701385,0.000025811483,0.00002325349,0.00001788353,0.000004200622,0.00002366807,0.0000048043844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931735,0.000029037803,0.00021590966,0.00013917167,0.00008923618,0.00020927453],"domain_scores_gemma":[0.9996301,0.00002944365,0.000035810066,0.00018837383,0.000030447422,0.00008582331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017148945,0.00016066912,0.00024270952,0.00017372439,0.000053556243,0.000025037116,0.000109054665,0.00008144738,0.00001648424],"category_scores_gemma":[0.0000034199188,0.00014525028,0.000102260805,0.00027908914,0.00009869944,0.00005637534,0.000010787433,0.0000807938,0.000004208641],"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.00018030351,0.0002596626,0.057775542,0.0011709159,0.0010575742,0.000048040496,0.003888672,0.017082766,0.2433544,0.6310944,0.00060863426,0.043479107],"study_design_scores_gemma":[0.010831251,0.0021243026,0.12298741,0.0018716628,0.00070421904,0.00038270783,0.003188066,0.0052546426,0.28584626,0.53426105,0.028220812,0.0043276036],"about_ca_topic_score_codex":0.000030866642,"about_ca_topic_score_gemma":0.00002129128,"teacher_disagreement_score":0.12119154,"about_ca_system_score_codex":0.000004225256,"about_ca_system_score_gemma":0.0000063570615,"threshold_uncertainty_score":0.5923134},"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":"W2080125678","doi":"10.1016/j.dam.2008.07.006","title":"On the complexity of constructing Golomb Rulers","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; University of Toronto; HEC Montréal","funders":"","keywords":"Golomb coding; Ruler; Mathematics; Completeness (order theory); Computational complexity theory; Theoretical computer science; Integer (computer science); Discrete mathematics; Combinatorics; Algorithm; Computer science; Artificial intelligence; Programming language","score_opus":0.03598714576227698,"score_gpt":0.20918483667840654,"score_spread":0.17319769091612955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080125678","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.80276626,0.00002081513,0.008605143,0.000018320578,0.00009257437,0.00025124237,0.000015896903,0.0001464064,0.1880833],"genre_scores_gemma":[0.99530107,0.00000505627,0.0045927907,0.000017739365,0.000017658274,0.000021468608,0.0000031988545,0.000023481158,0.000017547003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932396,0.000011040874,0.00027165978,0.000081149985,0.00015459553,0.00015757121],"domain_scores_gemma":[0.9993527,0.0002117843,0.00007334134,0.00031793746,0.0000124465205,0.000031808875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016919461,0.00013258132,0.0002258958,0.000031808166,0.00009066967,0.000007044916,0.00018037009,0.000046092307,0.00006353377],"category_scores_gemma":[0.000019404159,0.00009096726,0.000066571796,0.00011592406,0.0004184592,0.000017872037,0.000019740828,0.00012787053,0.000047332713],"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.0000033074068,0.000011686093,0.0000093939025,0.0001453877,0.0000409656,0.0000010084041,0.001842098,0.0003650001,0.006255951,0.99098045,0.00027373,0.00007101888],"study_design_scores_gemma":[0.00067388616,0.000045751363,0.00010117256,0.00022657281,0.00005948499,0.00009371778,0.017458495,0.014250915,0.08896983,0.87716824,0.0003517145,0.0006002349],"about_ca_topic_score_codex":7.9977104e-7,"about_ca_topic_score_gemma":4.7016613e-7,"teacher_disagreement_score":0.19253477,"about_ca_system_score_codex":0.000010604042,"about_ca_system_score_gemma":0.000004793121,"threshold_uncertainty_score":0.3709537},"labels":[],"label_agreement":null},{"id":"W2080400420","doi":"10.1016/j.jda.2014.12.001","title":"Constructing non-cyclic pandiagonal Latin squares of prime orders","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Prime (order theory); Latin square; Integer (computer science); Cyclic group; Order (exchange); Combinatorics; Mathematics; Algorithm; Computer science; Chemistry; Organic chemistry","score_opus":0.005259730341367534,"score_gpt":0.20498974070893228,"score_spread":0.19973001036756474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080400420","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.93536675,0.00038989156,0.057538252,0.0000431569,0.0011544479,0.00009784532,0.000017624587,0.00003690638,0.0053551137],"genre_scores_gemma":[0.9949408,0.000018829152,0.0046522985,0.00000807514,0.0003267934,0.0000013168984,0.0000022478746,0.000025051308,0.000024582518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872506,0.00007170743,0.0006412638,0.00007979533,0.00027280697,0.00020938955],"domain_scores_gemma":[0.99918115,0.00016119951,0.00031767,0.00014141283,0.00009221647,0.00010635776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055994635,0.00015017942,0.00040064115,0.00021072631,0.00004073115,0.000024873802,0.00019882954,0.00007820765,0.000045919576],"category_scores_gemma":[0.00006976724,0.00012335705,0.00019318397,0.00021320314,0.00008383906,0.00017329132,0.000017132066,0.00024883568,0.0000052655937],"study_design_candidate":"design_other","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.00045822948,0.0002923518,0.13655058,0.0021361306,0.0037616189,0.00015950488,0.00906446,0.042881206,0.15702207,0.03181567,0.0035713399,0.61228687],"study_design_scores_gemma":[0.018506216,0.004509922,0.06740184,0.0053707683,0.0011592767,0.0027921908,0.020546218,0.4349884,0.37232298,0.048496474,0.019833658,0.0040720375],"about_ca_topic_score_codex":0.000009434369,"about_ca_topic_score_gemma":0.0000032769765,"teacher_disagreement_score":0.6082148,"about_ca_system_score_codex":0.000025539191,"about_ca_system_score_gemma":0.00002005797,"threshold_uncertainty_score":0.5030354},"labels":[],"label_agreement":null},{"id":"W2080714423","doi":"10.1016/j.disc.2008.06.012","title":"Existence of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>r</mml:mi></mml:math>-fold perfect <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Mendelsohn designs with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>K</mml:mi><mml:mo>⊆</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo><mml:mn>7</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Block (permutation group theory); Discrete mathematics; Computer science","score_opus":0.021037681548531122,"score_gpt":0.23780148741442605,"score_spread":0.21676380586589494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080714423","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.8473517,0.009192137,0.006638147,0.0017856869,0.013025134,0.0010717135,0.008747551,0.0038026155,0.10838533],"genre_scores_gemma":[0.9257808,0.009425226,0.014029278,0.0050749145,0.01129922,0.01212481,0.011785829,0.009024174,0.0014558012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9308945,0.0041910126,0.015811836,0.013875608,0.017689306,0.017537741],"domain_scores_gemma":[0.9464475,0.011315487,0.016886832,0.013604463,0.0023953088,0.009350432],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.014814724,0.0103007015,0.004838853,0.0051571373,0.012843768,0.010761648,0.01737938,0.01756084,0.05010842],"category_scores_gemma":[0.010486105,0.017238738,0.01576103,0.009937222,0.013063959,0.010901802,0.013811487,0.014970366,0.0136170145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010726144,0.00382152,0.0000660877,0.010319707,0.014102629,0.008734633,0.009384538,0.013315366,0.012338481,0.7563635,0.15715235,0.0036750284],"study_design_scores_gemma":[0.012820267,0.010030075,0.00013386126,0.011374325,0.014193821,0.016361127,0.01128233,0.29914257,0.5860426,0.005725838,0.01845183,0.014441387],"about_ca_topic_score_codex":0.008558476,"about_ca_topic_score_gemma":0.0055937544,"teacher_disagreement_score":0.7506377,"about_ca_system_score_codex":0.00045947594,"about_ca_system_score_gemma":0.009651302,"threshold_uncertainty_score":0.9980436},"labels":[],"label_agreement":null},{"id":"W2080824882","doi":"10.1016/j.dam.2005.09.009","title":"On constant composition codes","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Constant (computer programming); Code word; Composition (language); Permutation (music); Alphabet; Combinatorics; Discrete mathematics; Block code; Linear code; Binary number; Arithmetic; Algorithm; Computer science; Decoding methods","score_opus":0.00705399009592934,"score_gpt":0.20282023286750203,"score_spread":0.1957662427715727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080824882","genre_codex":"other","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.35765138,0.00008586352,0.0759709,0.00004636375,0.00013739,0.0004417856,0.00004135806,0.0007366775,0.5648883],"genre_scores_gemma":[0.99432075,0.0000072616067,0.0054402165,0.000053546348,0.000053550444,0.000039777355,0.000017464243,0.000030426072,0.000037022608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993865,0.000005426346,0.00021745102,0.00009399831,0.00013001909,0.00016660824],"domain_scores_gemma":[0.9996109,0.00007931625,0.0000315451,0.00021909796,0.000008145667,0.000050967454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010969373,0.00014234982,0.00017965231,0.00004617134,0.00005477332,0.00003063506,0.000097282486,0.000047258512,0.00005909855],"category_scores_gemma":[0.0000021825222,0.00012472684,0.0000446947,0.00007196996,0.00003792154,0.00003392096,0.000009382373,0.00010604324,0.0003913412],"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.0000065987692,0.00003343859,5.880394e-7,0.00013104636,0.000032219177,0.000001111959,0.00063527917,0.006736872,0.023184648,0.9667447,0.000816993,0.0016764922],"study_design_scores_gemma":[0.0018961901,0.000109419176,0.00003338526,0.00054001,0.00015066304,0.000046688412,0.001947574,0.20361522,0.19209038,0.58824086,0.00976173,0.001567861],"about_ca_topic_score_codex":1.305464e-7,"about_ca_topic_score_gemma":8.63115e-7,"teacher_disagreement_score":0.63666934,"about_ca_system_score_codex":0.000027421745,"about_ca_system_score_gemma":0.0000027134704,"threshold_uncertainty_score":0.5086213},"labels":[],"label_agreement":null},{"id":"W2080876227","doi":"10.1016/j.disc.2008.02.040","title":"Linear bound on extremal functions of some forbidden patterns in 0–1 matrices","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.02140650063974825,"score_gpt":0.22544171372958507,"score_spread":0.20403521308983683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080876227","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.991876,0.00015894785,0.002972236,0.000008427557,0.00018068597,0.00014992454,0.000042413754,0.00009102398,0.004520353],"genre_scores_gemma":[0.999185,0.000049447357,0.00033031768,0.0000061121314,0.00006661559,0.000019619023,0.00000957539,0.00002941407,0.00030385656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992327,0.00001707195,0.00033180753,0.00009286704,0.00015422147,0.00017130193],"domain_scores_gemma":[0.9995657,0.00008167339,0.00005354635,0.00024799124,0.0000130677345,0.00003802222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011849132,0.00013152798,0.00023101695,0.0001449734,0.000041325668,0.000008387737,0.00012175612,0.00006400002,0.000053752483],"category_scores_gemma":[0.00001540739,0.000115255985,0.00008331581,0.00015394154,0.00003323121,0.00010083494,0.00001520357,0.000107612956,0.00006534494],"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.00025678013,0.0027568392,0.08173483,0.022913903,0.0014585031,0.00064435916,0.09928356,0.16504294,0.030819466,0.5843823,0.007717273,0.0029892572],"study_design_scores_gemma":[0.009208446,0.0018581129,0.06042753,0.008166518,0.0005608547,0.00079274765,0.036986537,0.61340743,0.062096324,0.19352648,0.0069415695,0.006027466],"about_ca_topic_score_codex":0.000008777611,"about_ca_topic_score_gemma":0.000010626775,"teacher_disagreement_score":0.44836447,"about_ca_system_score_codex":0.00001806735,"about_ca_system_score_gemma":0.0000060412895,"threshold_uncertainty_score":0.47000027},"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":"W2081444314","doi":"10.1016/j.disc.2011.02.005","title":"Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Nokia Foundation; Academy of Finland","keywords":"Triple system; Disjoint sets; Combinatorics; Isomorphism (crystallography); Mathematics; Order (exchange); Steiner system; Discrete mathematics; Pure mathematics; Crystallography","score_opus":0.024616523113820062,"score_gpt":0.2165696212181642,"score_spread":0.19195309810434413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081444314","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.91149336,0.00527148,0.04577443,0.0000043533823,0.0018507236,0.0016900579,0.00020702042,0.00032422086,0.03338436],"genre_scores_gemma":[0.9974454,0.000044893037,0.0013142994,0.0000023083421,0.000045318076,0.000056660254,0.000010617759,0.00007305937,0.0010074357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821997,0.000083919476,0.0009128077,0.00019451737,0.00028561798,0.0003031911],"domain_scores_gemma":[0.99877167,0.00008943465,0.00028233088,0.00057371764,0.00015526553,0.0001275949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057919207,0.00028531003,0.0007719763,0.00016665107,0.000056826153,0.000044855213,0.0002661093,0.0001647566,0.00005991293],"category_scores_gemma":[0.000087009284,0.00023956649,0.00009887037,0.0004361448,0.00011498103,0.00014263767,0.000045004013,0.00012524061,0.000016581424],"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.00018513523,0.000661649,0.0047911447,0.062402673,0.00234994,0.000047396778,0.07813482,0.0058048023,0.02235888,0.81572723,0.007205741,0.00033058558],"study_design_scores_gemma":[0.011857407,0.00197421,0.0023276845,0.010412402,0.0020768752,0.00064002525,0.123602994,0.7761778,0.033582494,0.02115745,0.010868505,0.0053221504],"about_ca_topic_score_codex":0.00031203285,"about_ca_topic_score_gemma":0.000014452049,"teacher_disagreement_score":0.7945698,"about_ca_system_score_codex":0.000019204788,"about_ca_system_score_gemma":0.000022134458,"threshold_uncertainty_score":0.9769238},"labels":[],"label_agreement":null},{"id":"W2081931069","doi":"10.1006/jabr.2000.8494","title":"26 Implies the Bimonster","year":2001,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.006674614665631347,"score_gpt":0.18826773953300116,"score_spread":0.1815931248673698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081931069","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.98866385,0.0014483961,0.0007071355,0.0003426027,0.0008318184,0.000030536346,3.9770086e-7,0.000037861922,0.007937377],"genre_scores_gemma":[0.99930197,0.00011953679,0.00003222609,0.000077134304,0.00031201084,6.5966657e-7,4.5497938e-8,0.00001388706,0.00014250411],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951196,0.000025967649,0.00021926401,0.000025743399,0.00010703948,0.00011003489],"domain_scores_gemma":[0.999724,0.000048077585,0.00005448246,0.00010416002,0.000029555471,0.000039763898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026595968,0.00006329715,0.00010777143,0.00005802761,0.000040430597,0.000033625045,0.00016234873,0.000029613477,0.00009325265],"category_scores_gemma":[0.000008748896,0.000036218804,0.00009706036,0.00010752041,0.000024026189,0.00011839362,0.000007694304,0.0001533168,0.000049240727],"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.0005245788,0.0003086143,0.07670381,0.00038419268,0.0032762603,0.0015079812,0.017597469,0.02621667,0.10967263,0.21892333,0.37349325,0.1713912],"study_design_scores_gemma":[0.001682323,0.00038347408,0.053786397,0.00031737456,0.00018324568,0.008486563,0.0043612067,0.001188526,0.011573088,0.081189975,0.8361975,0.0006503369],"about_ca_topic_score_codex":6.253284e-7,"about_ca_topic_score_gemma":0.000001584848,"teacher_disagreement_score":0.46270424,"about_ca_system_score_codex":0.000010457922,"about_ca_system_score_gemma":0.0000056712784,"threshold_uncertainty_score":0.14769599},"labels":[],"label_agreement":null},{"id":"W2082276697","doi":"10.1007/s10623-007-9105-2","title":"Kirkman frames having hole type h u m 1 for small h","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Program for New Century Excellent Talents in University; Natural Science Foundation of Zhejiang Province; Memorial University of Newfoundland; National Natural Science Foundation of China","keywords":"Type (biology); Combinatorics; Mathematics; Spectrum (functional analysis); Physics; Quantum mechanics; Geology","score_opus":0.025328448796234578,"score_gpt":0.23075111447154312,"score_spread":0.20542266567530854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082276697","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.68372047,0.001905812,0.31184462,0.0000063263956,0.0003088303,0.00023575773,0.000012488676,0.00025655032,0.0017091548],"genre_scores_gemma":[0.9930787,0.00008956206,0.00659337,0.00005399043,0.000098433986,0.000020802629,0.00001186228,0.00003326408,0.000020016518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992515,0.00001585046,0.00018362403,0.00016438185,0.0000643564,0.00032028215],"domain_scores_gemma":[0.9995423,0.00013160521,0.000024034167,0.0001562377,0.000040883326,0.00010495038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033477976,0.00016101467,0.00017376822,0.00018945988,0.0001301214,0.000061544706,0.0001033785,0.0000943285,0.000010405783],"category_scores_gemma":[0.000009667392,0.00015348924,0.00010369848,0.00032542495,0.000056653207,0.000059902082,0.000009620609,0.000092329814,0.0000036703989],"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.0006883603,0.00028581644,0.12985171,0.0020896571,0.0012814105,0.00006740579,0.00650374,0.003959878,0.19338083,0.4872079,0.0118640205,0.16281925],"study_design_scores_gemma":[0.005952104,0.002756581,0.20282501,0.0008738009,0.0007625981,0.000117973665,0.008787213,0.022742443,0.103785,0.17205796,0.47338948,0.0059498334],"about_ca_topic_score_codex":0.0000064656783,"about_ca_topic_score_gemma":0.000042845455,"teacher_disagreement_score":0.46152547,"about_ca_system_score_codex":0.0000048365737,"about_ca_system_score_gemma":0.0000031493041,"threshold_uncertainty_score":0.62591094},"labels":[],"label_agreement":null},{"id":"W2082374751","doi":"10.1007/s00493-011-2595-6","title":"Linear algebra methods for forbidden configurations","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; TRACE (psycholinguistics); Matrix (chemical analysis); Context (archaeology); Permutation (music); Row; Simple (philosophy); Concatenation (mathematics); Physics","score_opus":0.04519378722971197,"score_gpt":0.29338629396375326,"score_spread":0.2481925067340413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082374751","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.023808641,0.0015471353,0.7957018,0.000038937236,0.004499001,0.0009476088,0.000018995353,0.0012019617,0.1722359],"genre_scores_gemma":[0.98427737,0.000011059974,0.015052396,0.000019151315,0.000047273177,0.00016929327,0.0000069914067,0.000032034997,0.00038440354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994748,0.00004131759,0.00016433648,0.00010435784,0.000038377566,0.00017676533],"domain_scores_gemma":[0.9995374,0.00010069487,0.00002123291,0.00022465011,0.000047630325,0.000068384674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022098361,0.000102048994,0.00014477182,0.000055406297,0.000079696365,0.00001050262,0.00015696559,0.000072352224,0.000094377014],"category_scores_gemma":[0.000036381316,0.00010049693,0.00008182358,0.00014493438,0.000019557747,0.00007512747,0.000010151919,0.00007232703,0.00005250935],"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.000006584453,0.00003716308,0.000042618027,0.000047666337,0.000059345086,8.8959615e-7,0.0007724002,0.000009755498,0.0034739668,0.9875236,0.0030432588,0.0049827187],"study_design_scores_gemma":[0.00095260306,0.00021323499,0.0005564241,0.00002725599,0.00007213598,0.0000112283005,0.00027106324,0.011480094,0.10366167,0.61668766,0.26555914,0.0005075151],"about_ca_topic_score_codex":0.0000031459867,"about_ca_topic_score_gemma":3.0960234e-7,"teacher_disagreement_score":0.96046877,"about_ca_system_score_codex":0.000018470191,"about_ca_system_score_gemma":0.000007435807,"threshold_uncertainty_score":0.4098146},"labels":[],"label_agreement":null},{"id":"W2082398801","doi":"10.5539/cis.v3n4p24","title":"Frequency Domain Pseudo-color to Enhance Ultrasound Images","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Computer vision; Color image; Color histogram; Monochrome; Color space; Discrete cosine transform; Color balance; Hadamard transform; Frequency domain; Grayscale; Image processing; Image (mathematics); Mathematics","score_opus":0.002530971025626336,"score_gpt":0.2090679708898163,"score_spread":0.20653699986418997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082398801","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.8684529,0.000006214563,0.118913926,0.000030320884,0.0009643534,0.000098988494,0.0000044926387,0.00010272806,0.01142609],"genre_scores_gemma":[0.9797262,0.0000046712166,0.019966537,0.00022935099,0.000056356588,0.00000784921,0.0000013124675,0.0000020102084,0.000005721814],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999464,0.00000469292,0.00016001094,0.00007597144,0.000138971,0.00015638571],"domain_scores_gemma":[0.9996364,0.000027847364,0.000019373023,0.00015088347,0.00006185494,0.00010361204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040581147,0.00006899036,0.000062892876,0.00014490032,0.00014756796,0.00024553997,0.00022187512,0.000024400579,0.000015927571],"category_scores_gemma":[0.000018462018,0.000060130416,0.000012453867,0.000373655,0.00012207015,0.0031701294,0.00002949384,0.00008417342,0.00012843098],"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.0000028125041,0.000007773269,0.0007596784,0.0000660661,0.0000051779925,6.785293e-7,0.010552037,0.0010693708,0.85557914,0.10445638,0.0020684276,0.02543244],"study_design_scores_gemma":[0.0009124708,0.00036341636,0.20735724,0.00017989796,0.000012076292,0.0005357704,0.0012681154,0.057073902,0.6333142,0.030311793,0.06650723,0.002163881],"about_ca_topic_score_codex":0.0000024406452,"about_ca_topic_score_gemma":0.0000012208683,"teacher_disagreement_score":0.22226495,"about_ca_system_score_codex":0.000008289055,"about_ca_system_score_gemma":0.0000124357475,"threshold_uncertainty_score":0.24520472},"labels":[],"label_agreement":null},{"id":"W2082532526","doi":"10.1016/j.jspi.2006.04.008","title":"Super-simple cyclic designs with small values","year":2006,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Simple (philosophy); Statistics; Combinatorics","score_opus":0.026462738021629687,"score_gpt":0.24657207730258465,"score_spread":0.22010933928095497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082532526","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.58611405,0.00037331207,0.41177723,0.0000057279185,0.000055478304,0.000021237183,0.000011644437,0.000022153034,0.001619157],"genre_scores_gemma":[0.9932582,0.000011511699,0.006608004,0.0000102402755,0.00008056572,8.476454e-7,0.0000032767916,0.000009286629,0.000018094152],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99939084,0.00003305548,0.00025411788,0.000059088063,0.00011028811,0.0001525984],"domain_scores_gemma":[0.99938,0.0003948426,0.00004769862,0.000049067927,0.00004593436,0.00008247409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018112497,0.00009708757,0.000189717,0.00006130782,0.000052037743,0.000054979555,0.00006394996,0.00003753095,0.000020585092],"category_scores_gemma":[0.000050637635,0.00006912802,0.00001618848,0.00005948187,0.0000637085,0.00009446508,0.000005445063,0.00018153523,0.0000024319472],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006606812,0.0002729339,0.45025674,0.0010091739,0.00050329074,0.002084322,0.003918187,0.13657284,0.025328161,0.33185962,0.018513942,0.029020121],"study_design_scores_gemma":[0.003445207,0.0033501908,0.5989851,0.0019162156,0.00034454057,0.0024187632,0.002534868,0.040542204,0.005065606,0.33274645,0.00710645,0.0015444183],"about_ca_topic_score_codex":0.000013876216,"about_ca_topic_score_gemma":0.000002774357,"teacher_disagreement_score":0.40714413,"about_ca_system_score_codex":0.000009299103,"about_ca_system_score_gemma":0.000013572715,"threshold_uncertainty_score":0.2818959},"labels":[],"label_agreement":null},{"id":"W2082637109","doi":"10.1016/j.laa.2012.03.033","title":"Spectrum of Cayley graphs on the symmetric group generated by transpositions","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Symmetric group; Group (periodic table); Cayley's theorem; Alternating group; Graph; Line graph","score_opus":0.007931748767940297,"score_gpt":0.1913867297371422,"score_spread":0.18345498096920193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082637109","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.98581064,0.0036348822,0.0064604455,0.00017225233,0.000077708355,0.00047960703,0.00020509041,0.00012948354,0.003029872],"genre_scores_gemma":[0.99928683,0.00023259463,0.00003682654,0.00005121015,0.000072626084,0.00018645232,0.00006398516,0.000016397918,0.000053088148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995092,0.000026749498,0.00015421025,0.000085253145,0.00006948087,0.0001550744],"domain_scores_gemma":[0.99965036,0.000067420486,0.000022987853,0.00017542228,0.000013699603,0.00007009825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009265973,0.000095403215,0.00009686716,0.00008138756,0.0001270808,0.000008875025,0.00009565073,0.000046087207,0.000034224548],"category_scores_gemma":[0.0000028432335,0.000071664086,0.00004272935,0.00062762917,0.000029835674,0.000056423374,0.0000044879694,0.000099498415,0.000037318307],"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.0000027126396,0.00009121793,0.00024264827,0.000035095763,0.000054229495,4.2660094e-8,0.00020163947,0.00009248975,0.022675153,0.975385,0.000828855,0.00039092638],"study_design_scores_gemma":[0.0023884021,0.00065882877,0.05299506,0.00017477118,0.0008005227,0.00006410576,0.0011952687,0.0414411,0.61992836,0.050779622,0.2270062,0.0025677395],"about_ca_topic_score_codex":0.0000039542037,"about_ca_topic_score_gemma":0.0000034397933,"teacher_disagreement_score":0.92460537,"about_ca_system_score_codex":0.0000052655305,"about_ca_system_score_gemma":0.0000017850257,"threshold_uncertainty_score":0.29223767},"labels":[],"label_agreement":null},{"id":"W2082662222","doi":"10.1016/j.disc.2011.10.010","title":"Existence of 2 SOLS and 2 ISOLS","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"University of New South Wales; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Mathematics; Latin square; Combinatorics; Order (exchange); Discrete mathematics; Chemistry","score_opus":0.02486804389908685,"score_gpt":0.1981370191634325,"score_spread":0.17326897526434565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082662222","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.82358414,0.0003722693,0.015125064,0.0000023910263,0.000116659896,0.00017183555,0.000013336032,0.00013214136,0.16048217],"genre_scores_gemma":[0.99246716,0.000019704668,0.007384623,0.0000027738265,0.000008528746,0.000007903825,6.7317615e-7,0.000014519678,0.00009410854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959725,0.000007798761,0.00018260634,0.000054470365,0.000060347596,0.000097544784],"domain_scores_gemma":[0.99971724,0.000026253507,0.00003292594,0.00017736528,0.000011875164,0.00003436577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010844135,0.000078357676,0.00014964888,0.000026775338,0.000014948127,0.000006167815,0.00008480608,0.00003423012,0.00004420353],"category_scores_gemma":[0.000011459724,0.000065501765,0.00003193118,0.000052321364,0.00005155458,0.00005078815,0.000016307209,0.00003874393,0.000013188349],"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.0000055128467,0.000040553678,0.00054050126,0.002046537,0.00009192763,0.000005840147,0.023459272,0.000017462971,0.008405382,0.96439075,0.00013914143,0.0008571218],"study_design_scores_gemma":[0.000760568,0.00023021837,0.002290239,0.0011149518,0.00015679856,0.00011417181,0.013053517,0.036692932,0.11919941,0.8243383,0.001038268,0.0010106051],"about_ca_topic_score_codex":0.0000021520252,"about_ca_topic_score_gemma":8.1161267e-7,"teacher_disagreement_score":0.16888304,"about_ca_system_score_codex":0.0000023130524,"about_ca_system_score_gemma":0.0000020383634,"threshold_uncertainty_score":0.26710844},"labels":[],"label_agreement":null},{"id":"W2082954953","doi":"10.1142/s0219498808003077","title":"NEAR-DIAGONAL REPRESENTATIVES OF CONJUGACY CLASSES OF ORTHOGONAL MATRICES","year":2008,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Algebraically closed field; Conjugacy class; Zigzag; Combinatorics; Diagonal; Conjecture; Transpose; Matrix (chemical analysis); Orthogonal group; Triangular matrix; Orthogonal matrix; Group (periodic table); Field (mathematics); Pure mathematics; Invertible matrix; Orthogonal basis; Eigenvalues and eigenvectors; Geometry; Physics","score_opus":0.012690240558932486,"score_gpt":0.23927532375060845,"score_spread":0.22658508319167597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082954953","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.99207324,0.004882622,0.0014196653,0.000039232888,0.000042615822,0.00009637104,0.000019880139,0.000009617752,0.0014167776],"genre_scores_gemma":[0.99798226,0.0014340564,0.00046534976,0.000005407386,0.00006758016,0.000007253167,0.0000015334482,0.0000076766255,0.000028863376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992658,0.000024538287,0.00044120202,0.000055861958,0.00013971345,0.00007288211],"domain_scores_gemma":[0.9992982,0.00016095268,0.00024351066,0.000084272215,0.00015384807,0.000059214213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012691405,0.00007005983,0.00021529128,0.00009032856,0.00005827967,0.000007238563,0.00010868988,0.000036576752,0.000052330084],"category_scores_gemma":[0.00001705061,0.00005901516,0.000077139935,0.00019872976,0.00010377695,0.00016366602,0.000011245125,0.00009339669,0.0000020844766],"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.00037104124,0.00088747434,0.06778535,0.0017957973,0.001768023,0.000033761124,0.010192978,0.007547063,0.28950167,0.6025695,0.006941518,0.010605787],"study_design_scores_gemma":[0.0053780214,0.0015801471,0.541803,0.0007881183,0.0006953915,0.0038657964,0.0074287145,0.006309163,0.30613765,0.06559924,0.05906189,0.0013528246],"about_ca_topic_score_codex":0.0000011527691,"about_ca_topic_score_gemma":4.0944502e-7,"teacher_disagreement_score":0.5369703,"about_ca_system_score_codex":0.0000040962527,"about_ca_system_score_gemma":0.00003394885,"threshold_uncertainty_score":0.24065685},"labels":[],"label_agreement":null},{"id":"W2083190948","doi":"10.4153/cjm-2007-027-x","title":"Distance from Idempotents to Nilpotents","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","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 Prince Edward Island","funders":"","keywords":"Mathematics; Idempotence; Norm (philosophy); Construct (python library); Pure mathematics; Set (abstract data type); Zero (linguistics); Combinatorics; Discrete mathematics; Linguistics; Law; Computer science","score_opus":0.009138278624734257,"score_gpt":0.1906377520149413,"score_spread":0.18149947339020703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083190948","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.8822608,0.00042110568,0.11311477,0.00003560808,0.0009772268,0.000065716864,0.000019243716,0.000013981862,0.0030915348],"genre_scores_gemma":[0.9950315,0.0000029398236,0.00465248,0.000060672624,0.00014201543,4.1766458e-7,7.257642e-7,0.000022318056,0.00008694054],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915606,0.000008814652,0.0004056898,0.00004550211,0.00013614714,0.00024777168],"domain_scores_gemma":[0.9989983,0.000057135443,0.00007219441,0.00014786291,0.00006020011,0.0006643339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004514011,0.000095681324,0.0001882521,0.00017150409,0.000042449527,0.000032256772,0.00023588515,0.000051642943,0.000052754138],"category_scores_gemma":[0.00007465816,0.00008874476,0.00006708609,0.00014366678,0.000016561615,0.000071746326,0.0000031656402,0.00012820357,0.00006888589],"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.0001794686,0.0005686819,0.14410019,0.003157901,0.0046305717,0.015285407,0.14098935,0.07697686,0.06506626,0.18683805,0.26186052,0.100346744],"study_design_scores_gemma":[0.0045680064,0.00061588886,0.10937577,0.007807431,0.00058065954,0.0019414627,0.028195696,0.008213812,0.04455178,0.33885774,0.4512483,0.0040434645],"about_ca_topic_score_codex":0.00019814735,"about_ca_topic_score_gemma":0.0063368487,"teacher_disagreement_score":0.18938777,"about_ca_system_score_codex":0.000099741825,"about_ca_system_score_gemma":0.000045082088,"threshold_uncertainty_score":0.36189064},"labels":[],"label_agreement":null},{"id":"W2084600257","doi":"10.1016/j.laa.2007.11.014","title":"Bounds for the Perron root using max eigenvalues","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Tournament; Eigenvalues and eigenvectors; Combinatorics; Diagonal; Matrix (chemical analysis); Diagonal matrix; Root (linguistics); Graph; Upper and lower bounds; Nonnegative matrix; Zero (linguistics); Block matrix; Discrete mathematics; Symmetric matrix; Mathematical analysis","score_opus":0.02808472854615812,"score_gpt":0.24335855135456716,"score_spread":0.21527382280840904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084600257","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.87818587,0.008630483,0.11052206,0.000121600184,0.0001490026,0.00092356117,0.00004817156,0.00022530087,0.0011939781],"genre_scores_gemma":[0.9985544,0.00016278282,0.000395186,0.00002740992,0.0002603947,0.0002686494,0.000010610411,0.000021436046,0.00029912073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958336,0.000008047234,0.0001216064,0.00010584876,0.000051518175,0.00012960637],"domain_scores_gemma":[0.99967515,0.000073478106,0.000016837064,0.00016784476,0.000026840942,0.000039847044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007604931,0.00008504335,0.00008312298,0.000026055171,0.0004474087,0.000018044359,0.000096045515,0.000045029326,0.000013892844],"category_scores_gemma":[0.000005033006,0.000065031956,0.00004358818,0.00011267145,0.000041308875,0.00005572655,0.000011113476,0.00005965851,0.000019824894],"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.000050124967,0.00016300676,0.0019051153,0.0006062216,0.0005647092,0.0000021728997,0.0061563677,0.025442027,0.058171343,0.89004314,0.0043798387,0.012515911],"study_design_scores_gemma":[0.0005117091,0.00005865939,0.002753992,0.000025593048,0.0001517458,0.0001120021,0.00047511264,0.5400032,0.010154201,0.010020994,0.4352485,0.00048429088],"about_ca_topic_score_codex":0.000004248868,"about_ca_topic_score_gemma":0.0000040079703,"teacher_disagreement_score":0.88002217,"about_ca_system_score_codex":0.000008036708,"about_ca_system_score_gemma":0.000008087653,"threshold_uncertainty_score":0.34411514},"labels":[],"label_agreement":null},{"id":"W2084708927","doi":"10.1016/s0012-365x(03)00284-x","title":"Minimum embedding of balanced P4-designs into 5-cycle systems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Università di Catania","keywords":"Mathematics; Embedding; Combinatorics; Discrete mathematics; Value (mathematics); Computer science; Statistics","score_opus":0.012596166783818169,"score_gpt":0.2365351013061136,"score_spread":0.22393893452229544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084708927","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.7832224,0.0010941391,0.1545815,0.000004980231,0.0009182243,0.0005125383,0.000018941098,0.0003608843,0.059286427],"genre_scores_gemma":[0.9957725,0.000012250014,0.0039334144,0.0000027925314,0.000028711042,0.000032477907,0.0000035134497,0.000049367703,0.00016500524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989153,0.00005968551,0.00047208162,0.00012331059,0.00018715621,0.00024244924],"domain_scores_gemma":[0.9992948,0.00012199735,0.000096203235,0.00038059932,0.000032882468,0.000073502284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038770854,0.00018838988,0.00037950516,0.0000804458,0.000049228704,0.000034090397,0.00017074302,0.00008994627,0.00003552822],"category_scores_gemma":[0.00006546428,0.00016919148,0.00010138682,0.0001927489,0.000041985284,0.00008630674,0.000012586528,0.000090579495,0.000041949777],"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.000009835154,0.000115320196,0.00031404907,0.008078599,0.00037245595,0.000015299362,0.01729053,0.07440533,0.13766384,0.7606216,0.00096752006,0.00014562478],"study_design_scores_gemma":[0.0013677719,0.0001538016,0.000048235597,0.0020030285,0.00018968091,0.000090634494,0.019728407,0.779579,0.08690315,0.10586338,0.0026882356,0.0013847068],"about_ca_topic_score_codex":0.0000044855656,"about_ca_topic_score_gemma":0.0000010240568,"teacher_disagreement_score":0.7051736,"about_ca_system_score_codex":0.000026981137,"about_ca_system_score_gemma":0.000008633184,"threshold_uncertainty_score":0.68994284},"labels":[],"label_agreement":null},{"id":"W2085030741","doi":"10.2478/s12175-008-0110-3","title":"A survey of Skolem-type sequences and Rosa’s use of them","year":2009,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sequence (biology); Type (biology); Order (exchange); Combinatorics; Set (abstract data type); Null (SQL); Discrete mathematics; Computer science; Data mining","score_opus":0.05295632401456548,"score_gpt":0.2350264022967314,"score_spread":0.18207007828216593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085030741","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.9967686,0.0003166374,0.00042201174,0.000008691016,0.00005221726,0.0001084196,0.0000161099,0.000055444216,0.0022518563],"genre_scores_gemma":[0.9990183,0.000035263354,0.0008464301,0.0000065751615,0.000005877958,0.0000016685951,0.0000029452603,0.000010198973,0.00007274848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993419,0.000051122886,0.00029950854,0.00008183156,0.00011179709,0.0001138485],"domain_scores_gemma":[0.9994269,0.00020096634,0.00006101072,0.00022194053,0.000052758518,0.00003644493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030965562,0.000103791186,0.0002861274,0.000047318368,0.000014637782,0.000013329777,0.00010449111,0.000055125172,0.000040518345],"category_scores_gemma":[0.000104437364,0.000084414474,0.00003294118,0.0002066081,0.000051462543,0.00008841445,0.000010991036,0.00005350585,0.000009535231],"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.00028480327,0.00093243946,0.03520852,0.008298444,0.0010481745,0.000036043246,0.025031542,0.0031581915,0.3108938,0.5827984,0.008223619,0.024086019],"study_design_scores_gemma":[0.002085576,0.0010616916,0.36643112,0.0029966976,0.00031021828,0.00020600922,0.0018165734,0.059763297,0.23181726,0.3294104,0.0019922538,0.002108921],"about_ca_topic_score_codex":0.000017448941,"about_ca_topic_score_gemma":0.000005466681,"teacher_disagreement_score":0.3312226,"about_ca_system_score_codex":0.000004334631,"about_ca_system_score_gemma":0.0000066384077,"threshold_uncertainty_score":0.34423223},"labels":[],"label_agreement":null},{"id":"W2085363133","doi":"10.1016/j.dam.2014.05.018","title":"Tight lower bounds on broadcast function for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>24</mml:mn></mml:math>and 25","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Monotone polygon; Function (biology); Combinatorics; Upper and lower bounds; Algorithm; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.011757781158669128,"score_gpt":0.21539413493358425,"score_spread":0.20363635377491512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085363133","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.9445982,0.0005433555,0.022449324,0.00012481399,0.0025392752,0.00026575127,0.00039086642,0.00041944627,0.028668942],"genre_scores_gemma":[0.99154603,0.00024239878,0.0038795972,0.00040314338,0.001441219,0.00095310697,0.00057440664,0.00060025736,0.0003598408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944475,0.00010710991,0.0015443059,0.0011874175,0.0012324527,0.0014811745],"domain_scores_gemma":[0.99564034,0.0010347096,0.0010196035,0.0016354905,0.00009720359,0.0005726557],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016091838,0.001008482,0.00064053445,0.0002765567,0.001100592,0.00090340234,0.00086613256,0.0014266558,0.00034564067],"category_scores_gemma":[0.00032379088,0.0012975751,0.00095531496,0.0004903816,0.00055997266,0.0005155384,0.0005021945,0.0011176828,0.0015659838],"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.0006944376,0.0002856795,0.0000022621223,0.003427464,0.00097632775,0.00005075746,0.0025439546,0.0017480348,0.004466701,0.9795765,0.0046899063,0.0015379647],"study_design_scores_gemma":[0.002557328,0.001357952,0.00001902785,0.0018244041,0.0016734636,0.00029363603,0.0023244182,0.9011054,0.041433543,0.025143322,0.020474069,0.0017934041],"about_ca_topic_score_codex":0.000061910236,"about_ca_topic_score_gemma":0.00006402088,"teacher_disagreement_score":0.9544332,"about_ca_system_score_codex":0.00003361874,"about_ca_system_score_gemma":0.0001684561,"threshold_uncertainty_score":0.9998697},"labels":[],"label_agreement":null},{"id":"W2085453797","doi":"10.1016/j.laa.2006.10.001","title":"Potentially nilpotent and spectrally arbitrary even cycle sign patterns","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Sign (mathematics); Mathematics; Nilpotent; Nilpotent matrix; Pure mathematics; Nilpotent group; Conjecture; Jacobian matrix and determinant; Matrix (chemical analysis); Combinatorics; Characteristic polynomial; Polynomial; Discrete mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Matrix function; Symmetric matrix; Physics; Applied mathematics","score_opus":0.0034902341265451984,"score_gpt":0.17743552383600233,"score_spread":0.17394528970945713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085453797","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.9545101,0.0019276972,0.03715163,0.00017215162,0.000064316904,0.00048585422,0.00006752292,0.00030380848,0.005316924],"genre_scores_gemma":[0.9987158,0.00016391338,0.00041560587,0.00005578985,0.00024257421,0.000098062796,0.00004012984,0.00002551463,0.00024257308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993682,0.000014356663,0.00018880516,0.00018189255,0.000075856304,0.00017088192],"domain_scores_gemma":[0.99972165,0.000022993812,0.00002326382,0.00015174541,0.000017311737,0.00006303961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063330815,0.00012771906,0.00012072564,0.000050293063,0.00011190554,0.00004013171,0.00008135407,0.00006486148,0.000029295341],"category_scores_gemma":[0.0000012367469,0.0001257688,0.000035545512,0.000099688135,0.000021827092,0.00008774975,0.000018140463,0.0001016073,0.00003737344],"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.00003093024,0.0003201301,0.0041303807,0.0007085207,0.00024510064,0.000020110348,0.0005877325,0.0046765935,0.113585524,0.85147864,0.0017811109,0.022435227],"study_design_scores_gemma":[0.0039119422,0.00043371104,0.27562,0.00031088103,0.000524694,0.00046129222,0.0007614479,0.13674834,0.06826768,0.32586148,0.18327086,0.003827678],"about_ca_topic_score_codex":0.00001842336,"about_ca_topic_score_gemma":0.00001367289,"teacher_disagreement_score":0.5256172,"about_ca_system_score_codex":0.000006211456,"about_ca_system_score_gemma":0.0000052896107,"threshold_uncertainty_score":0.51287025},"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":"W2085688367","doi":"10.1007/s10623-003-4195-y","title":"Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hadamard transform; Mathematics; Order (exchange); Pure mathematics; Combinatorics; Complex Hadamard matrix; Hadamard matrix; Mathematical analysis; Business","score_opus":0.009775038603313631,"score_gpt":0.20490864356431165,"score_spread":0.19513360496099802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085688367","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.97054404,0.017060434,0.010090744,0.000016461463,0.00009811921,0.00016953258,0.000020180287,0.00012439128,0.0018760945],"genre_scores_gemma":[0.99309844,0.0022686792,0.004464886,0.000050777133,0.000057308403,0.000018308883,0.0000051982456,0.000025378456,0.0000109970715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99913377,0.000054722714,0.00026311263,0.00018359574,0.00013689509,0.00022788519],"domain_scores_gemma":[0.9995725,0.00008342205,0.000050377283,0.00015967927,0.00003574919,0.000098233766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021092896,0.00019452753,0.0002929345,0.00046573684,0.000071653674,0.00005253214,0.0000898602,0.000098996185,0.0000470795],"category_scores_gemma":[0.000005788639,0.00017268512,0.000085946,0.0008687161,0.00008860108,0.00014286394,0.000019070729,0.000082894025,0.000001973965],"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.00031694057,0.0003326663,0.12638123,0.0018212412,0.0016966297,0.00002691634,0.0029155666,0.004749096,0.09384753,0.6438969,0.010481651,0.11353368],"study_design_scores_gemma":[0.019143302,0.002109471,0.34311625,0.0011270916,0.001822889,0.00042421237,0.0028578385,0.15238346,0.05862374,0.10540158,0.3051081,0.007882065],"about_ca_topic_score_codex":0.00002581531,"about_ca_topic_score_gemma":0.000013869407,"teacher_disagreement_score":0.53849524,"about_ca_system_score_codex":0.0000043677496,"about_ca_system_score_gemma":0.0000035100873,"threshold_uncertainty_score":0.7041895},"labels":[],"label_agreement":null},{"id":"W2085908617","doi":"10.1016/s0097-3165(03)00118-3","title":"Boolean and ternary complementary pairs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Ternary operation; Combinatorics; Converse; Autocorrelation; Discrete mathematics; Product (mathematics); Zero (linguistics); Complementary sequences; Computer science; Statistics","score_opus":0.005821087705566269,"score_gpt":0.1904102313786939,"score_spread":0.18458914367312762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085908617","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.9699158,0.0024772375,0.0007231854,0.000051590643,0.010953434,0.00013141909,0.0000071202253,0.000071828676,0.01566839],"genre_scores_gemma":[0.99930596,0.00010901959,0.00017703336,0.000027533011,0.00027430395,0.000001537776,6.1913255e-7,0.000022769778,0.00008123458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989784,0.00023801491,0.0003890058,0.00006362574,0.00016072142,0.0001702351],"domain_scores_gemma":[0.99949825,0.000111382826,0.00010839147,0.00012173994,0.000049348233,0.000110878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290894,0.0001411884,0.00027055762,0.000087426735,0.00007820003,0.00004052427,0.00013458887,0.000051242536,0.00016101534],"category_scores_gemma":[0.00004145817,0.00012309203,0.00009027171,0.000086693515,0.000080018406,0.0003135358,0.000015272493,0.00020104104,0.0000028898678],"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.00023506254,0.000035236968,0.0008978901,0.000055157863,0.0001794492,0.0000630746,0.00062041305,0.000088688,0.0018153888,0.9937695,0.001589118,0.0006510076],"study_design_scores_gemma":[0.001508915,0.00048000805,0.00024786455,0.000081085236,0.000048080557,0.00084311503,0.0025186576,0.000013927762,0.0041902517,0.8709369,0.118916914,0.00021430945],"about_ca_topic_score_codex":6.850095e-7,"about_ca_topic_score_gemma":3.8042197e-7,"teacher_disagreement_score":0.12283264,"about_ca_system_score_codex":0.000026643274,"about_ca_system_score_gemma":0.000014659654,"threshold_uncertainty_score":0.50195473},"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":"W2086234498","doi":"10.1016/s0012-365x(02)00466-1","title":"Bicolour graphs of Steiner triple systems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph","score_opus":0.010595045897118486,"score_gpt":0.20264115917750886,"score_spread":0.19204611328039037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086234498","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.8625928,0.0017845604,0.019437842,0.0000049474697,0.0014130145,0.0006449404,0.000048090493,0.0003631601,0.11371061],"genre_scores_gemma":[0.9984107,0.000016579444,0.0007922486,0.000002558312,0.000014206465,0.000032675198,0.0000033491237,0.000039310897,0.0006883978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906117,0.000051756128,0.0004186992,0.00009359105,0.00017159058,0.0002031948],"domain_scores_gemma":[0.99941707,0.00006372277,0.00007787151,0.00034571203,0.00003405812,0.00006154736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003552006,0.00015823776,0.00032790637,0.00010244674,0.000031489413,0.000024215271,0.00013825363,0.0000797185,0.000041483712],"category_scores_gemma":[0.000043004606,0.00013069111,0.000114348986,0.00025767795,0.000036589798,0.00006012295,0.000007986398,0.000080379126,0.00003591213],"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.000002339986,0.000045239332,0.00018684438,0.0015616344,0.00012619235,0.000003895324,0.0012833951,0.0033040787,0.006754176,0.98569757,0.0010005722,0.00003403979],"study_design_scores_gemma":[0.0066138166,0.00073461194,0.00044127027,0.0034912322,0.00087017554,0.00047070262,0.044476766,0.25364697,0.15241899,0.45906302,0.07320899,0.0045634755],"about_ca_topic_score_codex":0.0000025166385,"about_ca_topic_score_gemma":9.812654e-7,"teacher_disagreement_score":0.5266346,"about_ca_system_score_codex":0.00001162752,"about_ca_system_score_gemma":0.0000068202517,"threshold_uncertainty_score":0.5329429},"labels":[],"label_agreement":null},{"id":"W2087041390","doi":"10.1016/s0012-365x(00)00021-2","title":"On the blocking sets in S(3,6,22) and S(4,7,23)","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Manitoba","funders":"","keywords":"Mathematics; Blocking (statistics); Combinatorics; Discrete mathematics; Statistics","score_opus":0.008277703968288011,"score_gpt":0.20151276103660234,"score_spread":0.19323505706831434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087041390","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.9464417,0.00012639911,0.000105424966,0.000047716774,0.000045381224,0.00014886633,0.00000463824,0.000081561586,0.0529983],"genre_scores_gemma":[0.9994592,0.000026146256,0.00012287077,0.000036341356,0.000013714632,0.000018822251,0.0000014787009,0.000021707749,0.00029971288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994708,0.0000260668,0.00017218881,0.000080298545,0.00009471775,0.00015596507],"domain_scores_gemma":[0.9995831,0.0001593152,0.000014302378,0.00021124247,0.0000034303212,0.00002859057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023304757,0.0001132392,0.0001310556,0.000036988553,0.000045860306,0.00003704477,0.00010240153,0.00004259746,0.00022493118],"category_scores_gemma":[0.000015583806,0.00007549044,0.000029705623,0.000106440624,0.000029191016,0.000035146175,0.000008695091,0.00011637569,0.00009656408],"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.000021989295,0.00010207286,0.0005092581,0.001006344,0.0001307844,0.000050586306,0.02577381,0.014046985,0.001290599,0.94301355,0.0025214949,0.011532538],"study_design_scores_gemma":[0.00095406576,0.00009660282,0.0012818367,0.0015080337,0.000051357252,0.00010069768,0.0045389254,0.37533286,0.0027474265,0.6078654,0.0045632385,0.00095956755],"about_ca_topic_score_codex":0.0000017737942,"about_ca_topic_score_gemma":0.000004523735,"teacher_disagreement_score":0.36128587,"about_ca_system_score_codex":0.000009560371,"about_ca_system_score_gemma":0.0000015522205,"threshold_uncertainty_score":0.3078411},"labels":[],"label_agreement":null},{"id":"W208847948","doi":"10.1023/a:1011212922844","title":"The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs","year":2001,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Hadamard transform; Mathematics; Order (exchange); Type (biology); Lambda; Block (permutation group theory); Graph; Integer (computer science); Matrix (chemical analysis); Physics; Mathematical analysis; Quantum mechanics; Computer science","score_opus":0.027807764892830402,"score_gpt":0.25404811182113607,"score_spread":0.22624034692830566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W208847948","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.94804615,0.018363561,0.031106057,0.00001610589,0.0001466588,0.00029686774,0.0000149979305,0.00005892951,0.001950672],"genre_scores_gemma":[0.9917135,0.0050920737,0.003103749,0.000007613521,0.000021925356,0.0000071011336,0.0000019111512,0.000021376769,0.000030734387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888057,0.0000958164,0.0004438995,0.00015947118,0.00018752806,0.000232746],"domain_scores_gemma":[0.9988402,0.00050778413,0.00014126641,0.00026855545,0.00014864774,0.00009354868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039431354,0.00019295712,0.0003777944,0.00037837008,0.00008312223,0.00003279387,0.0001767823,0.00008325639,0.000010904159],"category_scores_gemma":[0.000048923113,0.00014572631,0.000103775485,0.0018947733,0.00027602256,0.00009236582,0.000026667361,0.000104317325,5.554881e-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.0008793261,0.00021226413,0.16735153,0.0018296081,0.0013754757,0.000019186738,0.0026489238,0.003467703,0.16634952,0.61212915,0.0013046656,0.042432636],"study_design_scores_gemma":[0.016888274,0.009348133,0.20664048,0.004491763,0.002825379,0.0006953352,0.01800893,0.03698912,0.16258593,0.4567506,0.078956634,0.005819408],"about_ca_topic_score_codex":0.000113595015,"about_ca_topic_score_gemma":0.00003341971,"teacher_disagreement_score":0.15537855,"about_ca_system_score_codex":0.0000032529674,"about_ca_system_score_gemma":0.000025630892,"threshold_uncertainty_score":0.5942547},"labels":[],"label_agreement":null},{"id":"W2089627821","doi":"10.1556/sscmath.2010.1155","title":"Small forbidden configurations V: Exact bounds for 4 × 2 cases","year":2010,"lang":"en","type":"article","venue":"Studia Scientiarum Mathematicarum Hungarica","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 British Columbia","funders":"","keywords":"Mathematics; Forb; Row; Combinatorics; Matrix (chemical analysis); Permutation (music); Column (typography); Simple (philosophy); Computer science; Physics; Geometry","score_opus":0.022878985463353017,"score_gpt":0.23665063720351984,"score_spread":0.21377165174016682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089627821","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.7074522,0.00040660307,0.059698034,0.0005051972,0.0076671704,0.0031860555,0.0002994304,0.0018065728,0.21897873],"genre_scores_gemma":[0.9940233,0.000004312992,0.004363024,0.00002934182,0.00017903956,0.00035787313,0.000019427822,0.000055260785,0.00096842134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983841,0.000029375806,0.00043100843,0.00032518854,0.00024030443,0.0005900095],"domain_scores_gemma":[0.9985564,0.00048680833,0.00007829102,0.00058690977,0.000115021205,0.00017660279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042751,0.00026758728,0.0003536015,0.000192999,0.00055603933,0.00025473602,0.00041855656,0.00011946232,0.00018422712],"category_scores_gemma":[0.00028296612,0.0002413981,0.0002150841,0.00039953607,0.00018868517,0.00016426321,0.000053500386,0.00024173614,0.00014512044],"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.00001822791,0.00033173914,0.00028029614,0.00081759144,0.00050393183,0.000018986118,0.0043469914,0.0001557625,0.15970588,0.8032431,0.028256457,0.0023210417],"study_design_scores_gemma":[0.0047534597,0.0008074632,0.003659393,0.00046496402,0.0014481738,0.00077520753,0.008292806,0.05679582,0.076477826,0.31086203,0.5310445,0.004618361],"about_ca_topic_score_codex":0.000005013383,"about_ca_topic_score_gemma":0.00014201649,"teacher_disagreement_score":0.502788,"about_ca_system_score_codex":0.000022722837,"about_ca_system_score_gemma":0.000052415988,"threshold_uncertainty_score":0.9843929},"labels":[],"label_agreement":null},{"id":"W2090014573","doi":"10.1016/j.disc.2006.06.046","title":"When is a partial Latin square uniquely completable, but not its completable product?","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Manitoba","funders":"","keywords":"Latin square; Mathematics; Combinatorics; Product (mathematics); Class (philosophy); Square (algebra); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03146294528738935,"score_gpt":0.23948568130272163,"score_spread":0.20802273601533228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090014573","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.8301565,0.00068829395,0.11722138,0.0002869648,0.0008797693,0.0017361235,0.00037175714,0.0013210356,0.0473382],"genre_scores_gemma":[0.99200857,0.000007837946,0.006313656,0.00010347484,0.0001482573,0.000038629492,0.000032845594,0.00009359777,0.0012531386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980186,0.000043597076,0.00067494216,0.00027407086,0.00036774363,0.00062103005],"domain_scores_gemma":[0.9988904,0.00013536528,0.00011698461,0.0006021999,0.00009095791,0.00016410826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076780724,0.0003416862,0.0004964839,0.00011267685,0.00015171674,0.00009972775,0.00032684425,0.000101931546,0.00039598712],"category_scores_gemma":[0.00005465381,0.00031424724,0.00014227704,0.00025104027,0.00006391118,0.00018326199,0.00006032071,0.00024366229,0.00034110015],"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.00017137143,0.0005797856,0.0013352258,0.012932987,0.0010764204,0.00016117633,0.057038352,0.006696816,0.12596825,0.7591202,0.032923393,0.0019959845],"study_design_scores_gemma":[0.0021830956,0.0002286888,0.0009552139,0.0012363249,0.0003610239,0.00013354044,0.0058094757,0.3179127,0.49190405,0.09813605,0.07817218,0.0029676515],"about_ca_topic_score_codex":0.000015590651,"about_ca_topic_score_gemma":0.00001529905,"teacher_disagreement_score":0.66098416,"about_ca_system_score_codex":0.000040692827,"about_ca_system_score_gemma":0.0000132627265,"threshold_uncertainty_score":0.999931},"labels":[],"label_agreement":null},{"id":"W209002","doi":"","title":"A Decoding Scheme for the 4-ary Lexicodes with dm=4.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Scheme (mathematics); Arithmetic; Algorithm; Mathematical analysis","score_opus":0.009872929036725445,"score_gpt":0.20763178837679228,"score_spread":0.19775885934006682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W209002","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.9892248,0.0015645972,0.001682644,0.0002064555,0.0012449593,0.00042062643,0.0000049419136,0.00038157977,0.0052694026],"genre_scores_gemma":[0.99895203,0.000017004015,0.0006336112,0.000058657395,0.00003697907,0.00011039695,0.000002093993,0.000033748587,0.00015549258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994304,0.000014650814,0.00012799635,0.00011029693,0.000091423746,0.00022521969],"domain_scores_gemma":[0.9994781,0.0001764536,0.000021355185,0.00024080915,0.00002606218,0.000057223704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021584524,0.00012407103,0.000120827324,0.00003326991,0.00014723925,0.00004204423,0.0001871396,0.000048276874,0.000021863829],"category_scores_gemma":[0.000017608829,0.00008532632,0.00005464567,0.00012691306,0.000033154047,0.00012794233,0.0000131825645,0.0001031855,0.000028054963],"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.000038325576,0.000032143333,0.0011674947,0.00007421959,0.00015647348,0.0000020830705,0.000540698,0.003024749,0.0020274003,0.98433644,0.004818498,0.00378145],"study_design_scores_gemma":[0.0065611177,0.00044283905,0.0021840013,0.00039994932,0.00019897401,0.00009777697,0.00166516,0.23919894,0.050884992,0.4232164,0.2735231,0.0016267499],"about_ca_topic_score_codex":0.000002581902,"about_ca_topic_score_gemma":0.000008082501,"teacher_disagreement_score":0.56112003,"about_ca_system_score_codex":0.000028988317,"about_ca_system_score_gemma":0.000010249927,"threshold_uncertainty_score":0.34795064},"labels":[],"label_agreement":null},{"id":"W2090259579","doi":"10.1016/j.disc.2003.11.022","title":"Latin Squares with Self-Orthogonal Conjugates","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Latin square; Mathematics; Idempotence; Combinatorics; Orthogonal array; Conjugate; Transpose; Graph; Idempotent matrix; Discrete mathematics; Order (exchange); Eigenvalues and eigenvectors; Statistics","score_opus":0.005529690822069073,"score_gpt":0.18325978756344172,"score_spread":0.17773009674137263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090259579","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.9702733,0.00013394108,0.012499921,0.00002740821,0.00008516846,0.00019530409,0.000017007005,0.0006441028,0.016123846],"genre_scores_gemma":[0.9903967,0.0000070207916,0.009384713,0.000013397126,0.00004150675,0.00002511728,0.000009093088,0.00004297231,0.000079516125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993214,0.000009149934,0.00020438289,0.00010059873,0.00015987668,0.00020459345],"domain_scores_gemma":[0.99961615,0.000041702704,0.000035300123,0.00022046594,0.00002105643,0.00006534664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097206634,0.00016749173,0.00019066969,0.000059528484,0.000056608875,0.00004550979,0.00011630592,0.000051383333,0.00003947714],"category_scores_gemma":[0.000007218039,0.00012452321,0.000051618856,0.00016170199,0.00003810348,0.000078550096,0.0000118202925,0.000095695286,0.000098922756],"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.000012680379,0.00010656042,0.0015676414,0.0013275843,0.00029668346,0.00003819135,0.013347454,0.032164488,0.0019579611,0.94892186,0.00013458075,0.00012429297],"study_design_scores_gemma":[0.007881157,0.0010425182,0.005712398,0.0035697012,0.0006534187,0.00043799923,0.022224544,0.074710995,0.0707392,0.80089676,0.0075818887,0.0045494107],"about_ca_topic_score_codex":0.0000018971266,"about_ca_topic_score_gemma":0.000009514405,"teacher_disagreement_score":0.14802511,"about_ca_system_score_codex":0.000019746909,"about_ca_system_score_gemma":0.0000106303405,"threshold_uncertainty_score":0.5077909},"labels":[],"label_agreement":null},{"id":"W2090338574","doi":"10.1016/j.disc.2008.07.031","title":"Spanning cubic graph designs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cubic graph; Combinatorics; Mathematics; Graph; Discrete mathematics; Symmetric graph; Line graph; Voltage graph","score_opus":0.03203451386966064,"score_gpt":0.21934337109967816,"score_spread":0.18730885723001753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090338574","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.77378833,0.0005559421,0.16289443,0.000013484894,0.00031246664,0.00024041667,0.00001226752,0.0008211656,0.061361484],"genre_scores_gemma":[0.99520415,0.00003732349,0.0042606397,0.000014522846,0.000046559544,0.000021505606,0.0000062413383,0.000047686433,0.00036135977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992368,0.000018836117,0.0002456266,0.00010175651,0.00015015343,0.00024679673],"domain_scores_gemma":[0.999507,0.00008102893,0.000032969183,0.00028782955,0.00001549382,0.00007569143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014039857,0.00016312643,0.00021115065,0.000084455496,0.0001152223,0.000019318624,0.00016027168,0.00006320525,0.00006540857],"category_scores_gemma":[0.00002246885,0.00014544824,0.00010570655,0.00019947572,0.000057202367,0.00009153969,0.000015706844,0.00011232438,0.00024362197],"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.00003118321,0.0003731105,0.0063038827,0.0051517133,0.0012425645,0.0006964534,0.08469257,0.038329646,0.11255783,0.7208081,0.02850777,0.0013052174],"study_design_scores_gemma":[0.0035935899,0.00043602876,0.0036983322,0.002292334,0.0004385084,0.0029429423,0.016260196,0.42975876,0.08627044,0.41627273,0.031691924,0.006344206],"about_ca_topic_score_codex":0.0000012415236,"about_ca_topic_score_gemma":6.376852e-7,"teacher_disagreement_score":0.39142913,"about_ca_system_score_codex":0.000012774634,"about_ca_system_score_gemma":0.0000051566303,"threshold_uncertainty_score":0.5931207},"labels":[],"label_agreement":null},{"id":"W2091235660","doi":"10.1016/j.ffa.2014.09.011","title":"A finite embedding theorem for partial Steiner 3-designs","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Victoria","keywords":"Steiner system; Mathematics; Combinatorics; Embedding; Steiner tree problem; Prime (order theory); Finite field; Discrete mathematics; Block (permutation group theory); Set (abstract data type); Prime power; Field (mathematics); Pure mathematics; Computer science","score_opus":0.015769703959811483,"score_gpt":0.2272848047400897,"score_spread":0.21151510078027821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091235660","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.0054451213,0.00014999694,0.9858282,0.000086610744,0.00009692054,0.00040226494,0.00006119556,0.0001868462,0.007742826],"genre_scores_gemma":[0.9979257,0.000020130881,0.00058336393,0.00009741882,0.0002682817,0.00084023055,0.00003300016,0.000023503431,0.00020838987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994483,0.000024015646,0.00016485968,0.00015043805,0.000033408513,0.00017897831],"domain_scores_gemma":[0.99904436,0.0005964307,0.000025845393,0.00024649492,0.000023354258,0.000063533014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020380453,0.00012780908,0.00014145268,0.000047821388,0.00015687228,0.000042477055,0.00010790461,0.0001013341,0.000031383635],"category_scores_gemma":[0.00002030769,0.00010441683,0.00006628038,0.00009824819,0.000030882744,0.00004748904,0.000014706832,0.00009386343,0.000019045334],"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.000025420437,0.000036304922,0.00006170747,0.0001753815,0.00008830142,1.3148063e-7,0.0015815627,0.01743155,0.0019687628,0.9421729,0.00097251363,0.035485506],"study_design_scores_gemma":[0.00044603655,0.00010776176,0.00002935533,0.000036791807,0.000027098491,0.0000029781986,0.0002933492,0.48497942,0.0030097084,0.14714324,0.36360097,0.00032325686],"about_ca_topic_score_codex":0.0000017510923,"about_ca_topic_score_gemma":0.0000034920877,"teacher_disagreement_score":0.9924806,"about_ca_system_score_codex":0.0000037568648,"about_ca_system_score_gemma":0.0000034416569,"threshold_uncertainty_score":0.42579946},"labels":[],"label_agreement":null},{"id":"W2091595716","doi":"10.1109/isit.2012.6284108","title":"Rank modulation for translocation error correction","year":2012,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Rank (graph theory); Decoding methods; Algorithm; Modulation (music); Computer science; Fountain code; Error detection and correction; Error floor; Low-density parity-check code; Mathematics; Theoretical computer science; Combinatorics; Physics","score_opus":0.01594296997308819,"score_gpt":0.22293397302059736,"score_spread":0.20699100304750917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091595716","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.2553904,0.00013295986,0.735379,0.000013763802,0.0028277207,0.00023581686,0.0000012587155,0.00029995304,0.005719163],"genre_scores_gemma":[0.9990383,0.000002614152,0.00027324515,0.0000074293553,0.00016477512,0.00005782464,0.000013760227,0.000010963066,0.00043111335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997411,0.000008989086,0.00008389009,0.00003540951,0.000032085416,0.00009853205],"domain_scores_gemma":[0.99988025,0.000019039831,0.00000730475,0.00005532944,0.0000125853785,0.000025496887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014032445,0.00004511824,0.000046461933,0.000032468502,0.000030855288,0.0000056842277,0.000018088092,0.000038141803,0.000035569552],"category_scores_gemma":[0.0000039188867,0.000042890733,0.00003099101,0.00005681886,0.0000032725063,0.00017688064,4.6250264e-7,0.000020240717,0.000024939067],"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.00012526131,0.00013609882,0.0049129413,0.00040680822,0.00014881048,6.8242116e-8,0.007093006,0.24623366,0.18025668,0.103421934,0.01985396,0.43741077],"study_design_scores_gemma":[0.0005024835,0.000023390507,0.008095649,0.00001812192,0.000017154149,0.000005457969,0.00033671613,0.92965466,0.043155987,0.001377053,0.016611652,0.00020168516],"about_ca_topic_score_codex":0.000004071098,"about_ca_topic_score_gemma":0.0000060529806,"teacher_disagreement_score":0.7436479,"about_ca_system_score_codex":0.000012971578,"about_ca_system_score_gemma":9.468662e-7,"threshold_uncertainty_score":0.17490333},"labels":[],"label_agreement":null},{"id":"W2091750613","doi":"10.1006/jabr.2000.8413","title":"New Combinatorial Properties of Linear Groups","year":2001,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Pure mathematics","score_opus":0.010435810141646606,"score_gpt":0.1874494719750577,"score_spread":0.1770136618334111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091750613","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.9943691,0.0014706719,0.00086217065,0.00003565579,0.0021138692,0.00003804134,3.3410862e-7,0.000021714906,0.0010884248],"genre_scores_gemma":[0.9989074,0.00008069494,0.00014513025,0.000007118003,0.00075891556,2.8870437e-7,1.1204437e-7,0.000013945143,0.00008642529],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992992,0.00002596448,0.00036646106,0.00003290117,0.0001710298,0.00010442286],"domain_scores_gemma":[0.9996482,0.00001414877,0.000105998675,0.00008713248,0.000066169676,0.00007833692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021691059,0.000076752556,0.00021452668,0.00008724443,0.00001907149,0.000010518042,0.00014539085,0.000052437666,0.000056106837],"category_scores_gemma":[0.00002152723,0.00005836539,0.000108542605,0.00012570909,0.000016353124,0.00015293159,0.000008205648,0.00014789612,0.0000103511675],"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.0017916524,0.00051755883,0.010189325,0.0011230087,0.0019136237,0.0004408523,0.012113333,0.013707072,0.6358471,0.2654663,0.033669293,0.023220887],"study_design_scores_gemma":[0.013689783,0.003055513,0.0069294735,0.0028824806,0.00045236183,0.0034715687,0.003291439,0.0048943786,0.6956237,0.1422479,0.1219162,0.0015452162],"about_ca_topic_score_codex":0.000004708945,"about_ca_topic_score_gemma":7.8020526e-7,"teacher_disagreement_score":0.12321842,"about_ca_system_score_codex":0.000014508374,"about_ca_system_score_gemma":0.000023413715,"threshold_uncertainty_score":0.23800714},"labels":[],"label_agreement":null},{"id":"W2092933931","doi":"10.1016/j.laa.2011.08.011","title":"Constructions for potentially stable sign patterns","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Sign (mathematics); Mathematics; Eigenvalues and eigenvectors; Combinatorics; Similarity (geometry); Order (exchange); Mathematical analysis; Computer science; Artificial intelligence; Image (mathematics); Physics","score_opus":0.015652387050885,"score_gpt":0.20128049145823948,"score_spread":0.18562810440735447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092933931","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.17965603,0.0006009306,0.80475616,0.000034457196,0.00025252692,0.0012276819,0.00035022397,0.00047378524,0.012648224],"genre_scores_gemma":[0.9960608,0.000066329914,0.0028738931,0.000021894724,0.00011403231,0.0005373224,0.000031556665,0.000021548836,0.00027264762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954885,0.0000073079027,0.00014579158,0.00012353393,0.000036095866,0.00013840685],"domain_scores_gemma":[0.999704,0.000026013251,0.000019871168,0.0001421769,0.000040945317,0.00006699867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055628047,0.0000857729,0.000091162896,0.00004360525,0.00013995358,0.000015354979,0.00007722311,0.000052499345,0.00009936844],"category_scores_gemma":[0.0000030525082,0.00008597885,0.00003812025,0.00008885102,0.000021303302,0.00007838135,0.000009776484,0.000053232296,0.000037307214],"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.000012824824,0.000067805166,0.00048637754,0.0002340334,0.00012834286,4.3556855e-7,0.00068767613,0.00013421084,0.009372504,0.9739833,0.0005160254,0.014376455],"study_design_scores_gemma":[0.003037701,0.00040972992,0.00761238,0.00014483785,0.0005701237,0.00016526216,0.0035982055,0.05694636,0.12662877,0.1819596,0.6166089,0.0023181417],"about_ca_topic_score_codex":0.000005119308,"about_ca_topic_score_gemma":0.000005484669,"teacher_disagreement_score":0.81640476,"about_ca_system_score_codex":0.0000042670085,"about_ca_system_score_gemma":0.000006267531,"threshold_uncertainty_score":0.35061157},"labels":[],"label_agreement":null},{"id":"W2092986775","doi":"10.1016/j.laa.2015.03.023","title":"The enhanced principal rank characteristic sequence","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Iowa State University","keywords":"Sequence (biology); Mathematics; Rank (graph theory); Combinatorics; Order (exchange); Complement (music); Principal (computer security); Computer science","score_opus":0.02146996056406955,"score_gpt":0.24355219107751186,"score_spread":0.2220822305134423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092986775","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.9631259,0.0021111863,0.02464932,0.00022714207,0.00028313106,0.00074000837,0.000036509027,0.0004051146,0.008421695],"genre_scores_gemma":[0.9988445,0.00015094802,0.00006261117,0.000027178916,0.00015991057,0.00029688174,0.000012026914,0.000012801734,0.00043313543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995391,0.000016578362,0.0001380737,0.00010315821,0.00006949252,0.00013361017],"domain_scores_gemma":[0.9995996,0.000054757482,0.000021148375,0.0001857743,0.000042309104,0.00009642573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014264876,0.00008020644,0.00007678841,0.000015954596,0.0001430822,0.00003459572,0.00012371423,0.00003796494,0.0000056088447],"category_scores_gemma":[0.00001881521,0.000059482092,0.00001893363,0.00011931724,0.000036129535,0.00005803349,0.000016503587,0.000083991814,0.0001632689],"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.000038904567,0.000048628706,0.000105242456,0.0001504028,0.000108027125,0.0000018770121,0.0021365227,0.0005187023,0.11533294,0.8504889,0.00070024864,0.030369608],"study_design_scores_gemma":[0.00095759874,0.000101750644,0.0015860244,0.000053381507,0.000070543436,0.000051086256,0.00070336397,0.06105343,0.050680123,0.028122708,0.85586214,0.0007578721],"about_ca_topic_score_codex":0.0000010308573,"about_ca_topic_score_gemma":0.0000021222534,"teacher_disagreement_score":0.85516185,"about_ca_system_score_codex":0.000009740428,"about_ca_system_score_gemma":0.000011114761,"threshold_uncertainty_score":0.24256094},"labels":[],"label_agreement":null},{"id":"W2093225692","doi":"10.1007/s10623-011-9559-0","title":"Cyclic block designs with block size 3 from Skolem-type sequences","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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","funders":"","keywords":"Sequence (biology); Block (permutation group theory); Combinatorics; Type (biology); Mathematics; Extension (predicate logic); Null (SQL); Construct (python library); Discrete mathematics; Computer science; Chemistry","score_opus":0.029368422217057197,"score_gpt":0.20056410939752703,"score_spread":0.17119568718046985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093225692","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.9850976,0.002342918,0.0051300856,0.000007215405,0.00024584512,0.00029500795,0.000035498382,0.00048578548,0.006360034],"genre_scores_gemma":[0.99322116,0.00033561193,0.0061813244,0.00005880305,0.000077722485,0.00004309441,0.000007082007,0.000055032913,0.000020161207],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986101,0.000107073,0.0002867032,0.00036665646,0.00019292173,0.00043653927],"domain_scores_gemma":[0.99913913,0.00017672127,0.00006130373,0.00035778363,0.000057022986,0.00020805212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001877406,0.0003677318,0.00036811476,0.000166899,0.00018014343,0.00008547805,0.00024834336,0.00015638319,0.00012470584],"category_scores_gemma":[0.0000083659625,0.00029723157,0.000115565366,0.0006194167,0.00022097911,0.00016371843,0.00001923174,0.00019432836,0.000022465278],"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.0018109621,0.00082401984,0.30088407,0.0008310512,0.0058847643,0.0007105315,0.02722394,0.0031722246,0.5592014,0.08509316,0.0057583316,0.008605531],"study_design_scores_gemma":[0.010031249,0.007859188,0.21697508,0.0023418104,0.002822574,0.00090422307,0.01707322,0.005471343,0.421651,0.27355674,0.029669423,0.011644156],"about_ca_topic_score_codex":0.00018883983,"about_ca_topic_score_gemma":0.000075462056,"teacher_disagreement_score":0.18846358,"about_ca_system_score_codex":0.000007805003,"about_ca_system_score_gemma":0.000014702928,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W2093541724","doi":"10.1007/s003730050006","title":"Symmetric Graph Designs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Graph; Symmetric graph; Line graph; Discrete mathematics; Voltage graph","score_opus":0.009673629584774029,"score_gpt":0.1783846952900734,"score_spread":0.16871106570529937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093541724","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.94971454,0.0045927716,0.00015580421,0.0000082838815,0.0004861999,0.00011243938,0.0000043370505,0.00041231146,0.044513304],"genre_scores_gemma":[0.9982278,0.0012955216,0.00001813205,0.000024244524,0.000010256231,0.000016843906,0.0000025237093,0.000022038419,0.0003826611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993334,0.000027077314,0.00015226267,0.00013825693,0.0001141012,0.00023491686],"domain_scores_gemma":[0.9996436,0.000036964542,0.000011266474,0.00018075113,0.000016147766,0.00011124078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013229466,0.00014699179,0.00015726517,0.00020858896,0.00010793589,0.000043209442,0.000110965164,0.000083285566,0.00009176445],"category_scores_gemma":[0.000002877155,0.00014153437,0.00006898509,0.0010149454,0.000037481248,0.000084877436,0.000006556672,0.00012172738,0.000036850593],"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.0000069653715,0.000048279322,0.0031714062,0.00007583362,0.000059616294,0.000014398753,0.00017905256,0.0001604277,0.00014080456,0.96613777,0.0018253191,0.028180141],"study_design_scores_gemma":[0.0007402468,0.00013665303,0.007476529,0.00003115214,0.000041661915,0.000045648943,0.00010748565,0.001357577,0.0005745152,0.9646948,0.024260698,0.0005330476],"about_ca_topic_score_codex":0.0000067393635,"about_ca_topic_score_gemma":6.6123147e-7,"teacher_disagreement_score":0.04851323,"about_ca_system_score_codex":0.000008266438,"about_ca_system_score_gemma":0.0000028878399,"threshold_uncertainty_score":0.5771604},"labels":[],"label_agreement":null},{"id":"W2094667324","doi":"10.1006/jctb.2001.2051","title":"A Characterization of Weakly Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Discrete mathematics; Conjecture; Minor (academic); Strong perfect graph theorem; Robertson–Seymour theorem; Edge-transitive graph; Graph; Voltage graph; Line graph; 1-planar graph; Law","score_opus":0.005445700705337558,"score_gpt":0.18846807641930555,"score_spread":0.18302237571396798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094667324","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.98911124,0.00021080347,0.0006589277,0.000020807272,0.007146918,0.00007350973,0.000004735727,0.000041444717,0.0027315803],"genre_scores_gemma":[0.9992424,0.00024199091,0.000018953644,0.000007659924,0.00034338425,0.0000021235523,0.0000020826699,0.00002209789,0.00011930639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.0001515287,0.00057201454,0.000054362175,0.00020841192,0.000150212],"domain_scores_gemma":[0.99926555,0.00006265347,0.00027597797,0.00015128746,0.00016842652,0.00007611908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078207743,0.0001289437,0.00033313432,0.00018966265,0.000041475112,0.000024657596,0.00017936858,0.00008411442,0.00010649799],"category_scores_gemma":[0.0000484428,0.000113658054,0.00015794183,0.0003297054,0.00007409035,0.0004997302,0.000012311172,0.00015773594,0.000004645457],"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.00067637966,0.00005649973,0.00056672783,0.000055329037,0.00013605258,0.000021074284,0.00058006035,0.00010897753,0.34532833,0.6517143,0.000064214364,0.00069201784],"study_design_scores_gemma":[0.0014030308,0.0006970584,0.0023887428,0.00023359984,0.00008647796,0.0003531274,0.00044380414,0.00003796097,0.16249707,0.78872114,0.042843875,0.00029412142],"about_ca_topic_score_codex":4.1295763e-7,"about_ca_topic_score_gemma":2.3505083e-7,"teacher_disagreement_score":0.18283126,"about_ca_system_score_codex":0.00001830006,"about_ca_system_score_gemma":0.00001846577,"threshold_uncertainty_score":0.46348408},"labels":[],"label_agreement":null},{"id":"W2094697984","doi":"10.1007/s10623-007-9060-y","title":"There are no Barker arrays having more than two dimensions","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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; Simon Fraser University","keywords":"Mathematics; Combinatorics","score_opus":0.013349359042528756,"score_gpt":0.22509786505139284,"score_spread":0.21174850600886408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094697984","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.9097877,0.0029498392,0.0764925,0.000014931568,0.00041103488,0.0002386545,0.0000222628,0.00043360778,0.009649422],"genre_scores_gemma":[0.9978074,0.00014810731,0.0017583376,0.00006864139,0.00011505645,0.000018356795,0.0000073581614,0.000048101156,0.000028654487],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988776,0.000046000747,0.00024539218,0.00024270607,0.0001582215,0.00043006978],"domain_scores_gemma":[0.9993134,0.0001141509,0.000045352997,0.0002908306,0.000052218173,0.0001840489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004175933,0.00026125865,0.00025465208,0.00022220393,0.00023132065,0.00007148363,0.00013213133,0.00010568686,0.00005367993],"category_scores_gemma":[0.000007809703,0.00022825997,0.00017002238,0.0003924706,0.00010923534,0.00011496356,0.000020756745,0.00019071143,0.000021560307],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003248416,0.00033854216,0.4485112,0.00081291114,0.0014851511,0.0004524531,0.0065884255,0.0044869427,0.3895995,0.1252012,0.009665358,0.012533472],"study_design_scores_gemma":[0.008438451,0.0009901471,0.63922524,0.0035106034,0.0010214404,0.000538831,0.04076182,0.030113405,0.08538225,0.06976576,0.111449376,0.008802672],"about_ca_topic_score_codex":0.000017631062,"about_ca_topic_score_gemma":0.000048444017,"teacher_disagreement_score":0.30421725,"about_ca_system_score_codex":0.000008004232,"about_ca_system_score_gemma":0.0000035765945,"threshold_uncertainty_score":0.9308171},"labels":[],"label_agreement":null},{"id":"W2095616212","doi":"10.1007/s11590-010-0264-0","title":"New weighing matrices constructed from two circulant submatrices","year":2010,"lang":"en","type":"article","venue":"Optimization Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Circulant matrix; Computational intelligence; Mathematics; Block matrix; Combinatorics; Block (permutation group theory); Matrix (chemical analysis); Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Eigenvalues and eigenvectors; Artificial intelligence; Physics; Chemistry","score_opus":0.0025580334296203483,"score_gpt":0.1698387427357697,"score_spread":0.16728070930614936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095616212","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.6093242,0.00012806685,0.3860427,0.00019738209,0.0022764485,0.000120003286,0.000016601438,0.00051713566,0.001377457],"genre_scores_gemma":[0.9516531,0.000016533982,0.047555745,0.0001517863,0.0004972685,0.0000048569746,0.000067278976,0.00003551616,0.000017915714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930423,0.000025381984,0.00021075421,0.0001576788,0.00012608929,0.00017587251],"domain_scores_gemma":[0.9995768,0.000061379236,0.00005629785,0.00019806922,0.000017681907,0.000089779445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072929295,0.00014043208,0.00013775734,0.000120880104,0.00007342729,0.00012111884,0.00016262868,0.00006487558,0.00068133324],"category_scores_gemma":[0.000009908765,0.00014277107,0.00004950593,0.0002597412,0.0000230001,0.00026185118,0.000011373985,0.00017028704,0.000049962015],"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.000004205942,0.0000024361204,0.004859256,0.000016461729,0.000053580407,0.000007832299,0.00024547457,0.916112,0.074042305,0.000888573,0.0026318305,0.0011360504],"study_design_scores_gemma":[0.0018369368,0.000009523112,0.0020379492,0.000074161246,0.00012406925,0.000045186956,0.00029775003,0.97627264,0.010238097,0.0005283552,0.0075481893,0.0009871615],"about_ca_topic_score_codex":0.00017495369,"about_ca_topic_score_gemma":0.000013351204,"teacher_disagreement_score":0.3423289,"about_ca_system_score_codex":0.0000128265965,"about_ca_system_score_gemma":0.000009640204,"threshold_uncertainty_score":0.7460121},"labels":[],"label_agreement":null},{"id":"W2095879899","doi":"10.1109/tit.2008.2011431","title":"Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"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":"Binary number; Combinatorial design; Coding (social sciences); Code (set theory); Set (abstract data type); Mathematics; Computer science; Sequence (biology); Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Arithmetic","score_opus":0.0055197535792343,"score_gpt":0.2091376246644924,"score_spread":0.2036178710852581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095879899","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.095669754,0.000012482991,0.8921243,0.000045197765,0.0042131166,0.00042668477,0.0002092638,0.00047304324,0.006826176],"genre_scores_gemma":[0.9983598,0.000002120831,0.0012048661,0.00013862256,0.00012297138,0.00008940977,0.000035765155,0.000012181552,0.00003428197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990031,0.000045024015,0.0004204214,0.00009469122,0.00019544561,0.00024133509],"domain_scores_gemma":[0.9993265,0.00024320479,0.00004566986,0.00017079897,0.00010453556,0.00010924509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037409534,0.00018529757,0.00018318882,0.00022647253,0.00030901702,0.000063950385,0.000107416025,0.000120950215,0.00012811083],"category_scores_gemma":[0.000008051766,0.0001865786,0.0001690805,0.00017128255,0.00009580494,0.0007320334,3.794732e-7,0.0002315188,0.00011964057],"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.00027150655,0.000050718118,3.9913022e-7,0.000021267257,0.000063021755,3.4372675e-7,0.00024405589,0.49567896,0.00056174345,0.48805007,0.00023260617,0.014825296],"study_design_scores_gemma":[0.016065905,0.0018522117,0.00020698759,0.00028739602,0.0004588526,0.00059165515,0.002566654,0.30392048,0.18717004,0.4715851,0.012804698,0.002490006],"about_ca_topic_score_codex":4.085245e-7,"about_ca_topic_score_gemma":4.7057523e-7,"teacher_disagreement_score":0.90269005,"about_ca_system_score_codex":0.000053795025,"about_ca_system_score_gemma":0.000033096574,"threshold_uncertainty_score":0.7608454},"labels":[],"label_agreement":null},{"id":"W2095943927","doi":"10.1109/leosst.2009.5226273","title":"On the capacity of SOA-assisted SAC-OCDMA systems: A numerical approach using Multicanonical Monte Carlo","year":2009,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Monte Carlo method; Computer science; Noise (video); Numerical models; Computer simulation; Electronic engineering; Algorithm; Simulation; Engineering; Artificial intelligence; Mathematics; Statistics","score_opus":0.035305711123486995,"score_gpt":0.21532074479408964,"score_spread":0.18001503367060265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095943927","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.956423,0.00014620837,0.02467694,0.000030178377,0.00024452564,0.00038952287,0.000010425153,0.00023387809,0.017845342],"genre_scores_gemma":[0.9991706,0.0000013999646,0.0006307594,0.00004202692,0.000053460713,0.000014527387,7.775249e-7,0.000020362699,0.00006605787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861985,0.00023297376,0.00040432654,0.00019430374,0.00025506038,0.00029350413],"domain_scores_gemma":[0.99915266,0.0002176014,0.000055444692,0.00044092943,0.00004072429,0.00009264366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045992018,0.00020557061,0.00037925874,0.00006265005,0.00008078087,0.00003439834,0.00023000309,0.0001291128,0.000017283448],"category_scores_gemma":[0.000056187786,0.00013249273,0.00015899091,0.0002660158,0.00006820115,0.000057516292,0.00001222077,0.0002407395,0.000009151069],"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.00013384555,0.00059969386,0.0004341589,0.00040320493,0.00045807537,0.000015608424,0.0016917994,0.55211794,0.047319334,0.39446914,0.0012090993,0.0011481077],"study_design_scores_gemma":[0.0003476865,0.000089288216,0.0012977964,0.000101599246,0.00004796814,0.00005539595,0.00074921467,0.995113,0.0015375084,0.00022918457,0.00016401587,0.00026734354],"about_ca_topic_score_codex":0.00017703393,"about_ca_topic_score_gemma":0.0000026809503,"teacher_disagreement_score":0.44299507,"about_ca_system_score_codex":0.000068067326,"about_ca_system_score_gemma":0.000013925357,"threshold_uncertainty_score":0.54028964},"labels":[],"label_agreement":null},{"id":"W2096585470","doi":"10.1080/15598608.2010.10411981","title":"Cyclic Polygonal Designs with Block Size 3 and λ = 1 for Joint Distance α = 6 to 16","year":2010,"lang":"en","type":"article","venue":"Journal of Statistical Theory and Practice","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Mathematics; Joint (building); Block size; Block (permutation group theory); Combinatorics; Sequence (biology); Computer science; Structural engineering","score_opus":0.017138715511262375,"score_gpt":0.27603237473665676,"score_spread":0.25889365922539437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096585470","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.14640619,0.0003471453,0.8493444,0.0004118256,0.00034974483,0.00019340076,0.00007596101,0.00001892139,0.002852428],"genre_scores_gemma":[0.9627435,0.000034679222,0.036749687,0.0001992759,0.00015871148,0.0000062318336,4.4896746e-7,0.000017656062,0.00008980671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991434,0.00019808715,0.0002707466,0.00009483307,0.00012890682,0.00016403184],"domain_scores_gemma":[0.9905043,0.008981073,0.000102359554,0.00008043781,0.000095921045,0.00023587204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002171502,0.00011851649,0.00021941429,0.00003878144,0.00009015556,0.00007103816,0.000059739366,0.000051769097,0.00005431871],"category_scores_gemma":[0.0030806602,0.00008531867,0.00002427892,0.00006222488,0.00010345999,0.00025502688,0.000009355795,0.00033267972,0.000002922463],"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.004460765,0.000057525238,0.00003825082,0.00013691066,0.0001760161,0.00006502911,0.00047524838,0.0000820812,0.031486213,0.9563475,0.00076352013,0.0059109344],"study_design_scores_gemma":[0.0040196115,0.0035555172,0.0051571187,0.00038061923,0.000882439,0.0131529,0.004018285,0.00052580266,0.0060387454,0.7744197,0.18684374,0.0010054947],"about_ca_topic_score_codex":8.348759e-7,"about_ca_topic_score_gemma":0.0000030155024,"teacher_disagreement_score":0.8163373,"about_ca_system_score_codex":0.000009264894,"about_ca_system_score_gemma":0.000017803619,"threshold_uncertainty_score":0.36880606},"labels":[],"label_agreement":null},{"id":"W2096969048","doi":"10.1109/tcomm.2007.896127","title":"Source-Matched Spreading Codes for Optical CDMA","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"McGill University","funders":"Center for High Performance Computing","keywords":"Puncturing; Code division multiple access; Computer science; Bit error rate; Electronic engineering; Convolutional code; Physical layer; Probability of error; Code (set theory); Computer network; Telecommunications; Algorithm; Channel (broadcasting); Decoding methods; Engineering; Wireless; Set (abstract data type)","score_opus":0.026720632724459233,"score_gpt":0.26773194387620675,"score_spread":0.2410113111517475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096969048","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.029459003,0.0001380737,0.9609981,0.00014774191,0.00036636865,0.00032149573,0.00003447674,0.0005309262,0.0080038095],"genre_scores_gemma":[0.9910489,0.00007248217,0.008211684,0.0000339525,0.000031394684,0.00015595077,0.000009410457,0.000041742012,0.0003945099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992148,0.000030270323,0.000294582,0.00011438676,0.00008841906,0.00025753476],"domain_scores_gemma":[0.99800676,0.0008263842,0.000023620129,0.0009949259,0.000047832425,0.00010045574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043094507,0.00013824008,0.0001651425,0.00015579938,0.00041447938,0.000035368164,0.000460406,0.0001082026,0.000026099713],"category_scores_gemma":[0.000006382844,0.00015106353,0.00014383177,0.00023609314,0.00010408879,0.00009709986,0.0000015701618,0.00026900077,0.00006738973],"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.00033887321,0.0018625055,0.0001346008,0.0004995701,0.0014440576,0.0000029826806,0.010639944,0.3769419,0.21883838,0.13722055,0.0021530013,0.24992366],"study_design_scores_gemma":[0.0032025736,0.00039429258,0.00050055137,0.00048262344,0.0005510407,0.00010661767,0.0069802944,0.29234114,0.52779335,0.010497068,0.1551396,0.0020108318],"about_ca_topic_score_codex":0.000009926346,"about_ca_topic_score_gemma":0.00017986566,"teacher_disagreement_score":0.9615899,"about_ca_system_score_codex":0.00005949323,"about_ca_system_score_gemma":0.000009081551,"threshold_uncertainty_score":0.61601925},"labels":[],"label_agreement":null},{"id":"W2097274167","doi":"10.1109/cwit.2007.375729","title":"Source Matching in Optical CDMA in the Presence of Multiple Access Interference and Phase-Induced Intensity Noise","year":2007,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Coherence time; Interference (communication); Coherence (philosophical gambling strategy); Noise (video); Physics; Binary number; Phase noise; Channel (broadcasting); Laser; Phase (matter); Computer science; Optics; Electronic engineering; Telecommunications; Mathematics; Artificial intelligence; Engineering","score_opus":0.02760164016766007,"score_gpt":0.2773114084205982,"score_spread":0.24970976825293814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097274167","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.97591823,0.000025522499,0.021885142,0.000018553807,0.000084155,0.00016063306,6.2025936e-7,0.000034851117,0.0018722828],"genre_scores_gemma":[0.9998543,0.0000028714278,0.000087237786,0.000022199229,0.000012975019,0.000005036577,4.6940482e-7,0.0000070131155,0.000007867017],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993123,0.000040036826,0.00025966,0.000117263924,0.00008669169,0.00018403775],"domain_scores_gemma":[0.9993969,0.00037063682,0.00001984154,0.00016263904,0.000016204833,0.00003373982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008103509,0.00009262764,0.00016151369,0.000105234096,0.0000162355,0.000028814575,0.00025946816,0.000055095355,0.0000059193458],"category_scores_gemma":[0.00007957671,0.000067135115,0.000020214544,0.00020921612,0.000039883907,0.00016502444,0.00006376308,0.00021503765,0.0000014112288],"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.00081267423,0.0006384557,0.2798483,0.0007141695,0.00005835478,0.00010791504,0.055862777,0.010400244,0.5960567,0.014847043,0.000065427485,0.040587906],"study_design_scores_gemma":[0.0043863147,0.00024811062,0.42188698,0.0009284749,0.000018970542,0.00012582014,0.03313509,0.21244441,0.3208273,0.0051413537,0.00007437569,0.00078278553],"about_ca_topic_score_codex":0.0003023835,"about_ca_topic_score_gemma":0.0006950084,"teacher_disagreement_score":0.2752294,"about_ca_system_score_codex":0.000011563154,"about_ca_system_score_gemma":0.0000029647258,"threshold_uncertainty_score":0.27376905},"labels":[],"label_agreement":null},{"id":"W2098345409","doi":"10.1017/s0963548311000575","title":"On Even-Degree Subgraphs of Linear Hypergraphs","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","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 Waterloo","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Bounded function; Conjecture; Degree (music); Vertex (graph theory); Induced subgraph; Constant (computer programming); Discrete mathematics; Graph; Physics; Computer science","score_opus":0.026647026769529934,"score_gpt":0.2237650460045048,"score_spread":0.19711801923497488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098345409","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.9864493,0.0007490696,0.0020449527,0.000007405619,0.0021530932,0.0003142409,0.000004378768,0.00039380524,0.007883757],"genre_scores_gemma":[0.9994835,0.0000060833245,0.00036206527,0.000011071631,0.00007729496,0.000006912195,0.000004162739,0.00003810262,0.000010788485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983297,0.00014693945,0.0005168634,0.00021857837,0.0002822684,0.0005056569],"domain_scores_gemma":[0.9986929,0.0003575245,0.00009842207,0.00057886966,0.00010895177,0.0001633155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012297865,0.0002511197,0.00038155832,0.00016438428,0.00013059191,0.000011530572,0.00031691653,0.00014524724,0.000011029003],"category_scores_gemma":[0.00015336486,0.00025148518,0.0001944626,0.00072436227,0.00008847874,0.00012231024,0.00007000694,0.00032346795,0.000025249645],"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.000020845686,0.0005824763,0.07904784,0.00081683823,0.000099290526,0.0000013102318,0.0013970862,0.006845004,0.0013048337,0.90616053,0.00021915445,0.0035047769],"study_design_scores_gemma":[0.0019911348,0.0005357248,0.058448397,0.00052823394,0.000094552204,0.000030118548,0.00030365484,0.036675207,0.023874799,0.87440777,0.0015696873,0.0015407124],"about_ca_topic_score_codex":0.000006166509,"about_ca_topic_score_gemma":5.5864706e-7,"teacher_disagreement_score":0.031752773,"about_ca_system_score_codex":0.00007412304,"about_ca_system_score_gemma":0.000012680417,"threshold_uncertainty_score":0.99999374},"labels":[],"label_agreement":null},{"id":"W2098996655","doi":"10.1109/lpt.2005.858047","title":"Experimental comparison of coherent versus incoherent sources in a four-user /spl lambda/-t OCDMA system at 1.25 Gb/s","year":2005,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Bit error rate; Code division multiple access; Lambda; Chip; Photodetection; Physics; Source code; Electronic engineering; Optics; Bandwidth (computing); Telecommunications; Photodetector; Engineering; Decoding methods","score_opus":0.013041894273197106,"score_gpt":0.23705722352479633,"score_spread":0.22401532925159923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098996655","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.9953696,0.0012594315,0.00018303662,0.00016026483,0.0011869287,0.00051910605,0.000012404551,0.0007447266,0.0005644745],"genre_scores_gemma":[0.99925745,0.000008387614,0.00032838198,0.00004238743,0.000039929517,0.00024177996,0.0000037429909,0.00006043472,0.000017482653],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981431,0.00006291334,0.00072261953,0.000344537,0.00021044354,0.0005164132],"domain_scores_gemma":[0.9991352,0.000052278854,0.00016855967,0.00056030345,0.00001950696,0.00006417517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019541866,0.00034326973,0.00060840225,0.0005028512,0.00007469295,0.000015396066,0.0005103723,0.00035799225,0.000029108027],"category_scores_gemma":[0.0000057758084,0.0003618567,0.00013208417,0.00042443385,0.00021201256,0.00008442256,0.00009080966,0.00044130362,0.00008121889],"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.00024331387,0.00019734436,0.01368914,0.00026541646,0.00026843825,0.000047502082,0.0014148712,0.0325581,0.9454173,0.0037133673,0.0018246453,0.00036056573],"study_design_scores_gemma":[0.0023248787,0.00015011328,0.00015722719,0.00018549577,0.000032023647,0.00003594596,0.0017579822,0.02115969,0.9666981,0.000010321545,0.0070707877,0.00041740417],"about_ca_topic_score_codex":0.000034874054,"about_ca_topic_score_gemma":0.00018511224,"teacher_disagreement_score":0.021280833,"about_ca_system_score_codex":0.0006571502,"about_ca_system_score_gemma":0.00001036591,"threshold_uncertainty_score":0.99988335},"labels":[],"label_agreement":null},{"id":"W2099497492","doi":"10.37236/841","title":"On Subsequence Sums of a Zero-sum Free Sequence II","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Subsequence; Mathematics; Combinatorics; Zero (linguistics); Longest increasing subsequence; Sequence (biology); Exponent; Abelian group; Group (periodic table); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.011784111557570576,"score_gpt":0.198925030962174,"score_spread":0.18714091940460342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099497492","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.99092776,0.0040045395,0.0026814835,0.000083093364,0.00062467734,0.00008600428,0.000002180426,0.000034501263,0.001555742],"genre_scores_gemma":[0.9986788,0.0010827378,0.0000041177004,0.000019084619,0.000040874722,0.0000021840353,2.9914546e-7,0.000023675448,0.00014820011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998529,0.00010144196,0.00045315627,0.00007299342,0.00041074952,0.0004326323],"domain_scores_gemma":[0.99899167,0.00016718089,0.0002283908,0.00040649725,0.00014088351,0.00006536387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081648864,0.00015891375,0.00030713293,0.00011189004,0.00014829077,0.0000068001023,0.00082249445,0.00007163182,0.000009155291],"category_scores_gemma":[0.00008385517,0.00011362793,0.00015141146,0.00042033172,0.00011847722,0.00012710935,0.000030687388,0.0007108577,0.0000049063756],"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.00005233192,0.000052934392,0.0001339132,0.000027805174,0.00011196548,0.000029748215,0.00058714254,0.0030166525,0.0123929735,0.98249465,0.0010349131,0.000064951324],"study_design_scores_gemma":[0.00080732093,0.0010768883,0.00015066766,0.00009609305,0.000036491765,0.00093788386,0.00005672516,0.00036875467,0.036359232,0.9589149,0.0010246749,0.00017036291],"about_ca_topic_score_codex":0.000005522213,"about_ca_topic_score_gemma":0.0000017650328,"teacher_disagreement_score":0.02396626,"about_ca_system_score_codex":0.00021583513,"about_ca_system_score_gemma":0.00016510405,"threshold_uncertainty_score":0.46336126},"labels":[],"label_agreement":null},{"id":"W2100729666","doi":"10.1364/jon.6.000819","title":"Code-division multiplexing for in-service out-of-band monitoring of live FTTH-PONs","year":2007,"lang":"en","type":"article","venue":"Journal of Optical Networking","topic":"graph theory and CDMA systems","field":"Engineering","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":"Université Laval","funders":"","keywords":"Passive optical network; Time-division multiplexing; Computer network; Wavelength-division multiplexing; Fiber to the x; Optical line termination; Access network; Computer science; Multiplexing; Electronic engineering; Telecommunications; Engineering; Wavelength; Optoelectronics; Physics","score_opus":0.0348798881626936,"score_gpt":0.27908417730700413,"score_spread":0.24420428914431053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100729666","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.87757796,0.00092943956,0.118659474,0.000011666712,0.0022365933,0.00011509816,0.000001786619,0.000013417898,0.0004545378],"genre_scores_gemma":[0.99026686,0.00003898764,0.008902412,0.000003991601,0.0007595335,0.0000011250402,3.684827e-7,0.000024183306,0.0000025243928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985212,0.000022253931,0.0008760326,0.00007810608,0.00021149598,0.00029093004],"domain_scores_gemma":[0.99853766,0.00088272244,0.00023272523,0.00009984001,0.00015182499,0.00009523311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001607098,0.000121686215,0.00039030737,0.00016586889,0.000033231026,0.000014164217,0.00017234625,0.0001113892,0.0000020897426],"category_scores_gemma":[0.000072069895,0.000111558984,0.00014904361,0.00021667742,0.00002491945,0.00012237718,0.000018248451,0.00027876697,5.4583177e-7],"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.0006455255,0.00019907884,0.0892274,0.0008499629,0.00028823997,0.000055905297,0.004508669,0.6303878,0.25368872,0.0019595423,0.000027927576,0.018161276],"study_design_scores_gemma":[0.0144379595,0.002027317,0.15164047,0.030011564,0.00045525195,0.00025035115,0.012552194,0.38535058,0.38837016,0.0066659744,0.0061878087,0.002050362],"about_ca_topic_score_codex":0.000002216652,"about_ca_topic_score_gemma":0.000012652631,"teacher_disagreement_score":0.24503717,"about_ca_system_score_codex":0.00004324722,"about_ca_system_score_gemma":0.0000106372945,"threshold_uncertainty_score":0.45492435},"labels":[],"label_agreement":null},{"id":"W2102196430","doi":"10.37236/1498","title":"Composition sum identities related to the distribution of coordinate values in a discrete simplex","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Dalhousie University","funders":"","keywords":"Mathematics; Bijection; Simplex; Combinatorics; Parameterized complexity; Bounded function; Algebraic number; Integer (computer science); Order (exchange); Class (philosophy); Exponential function; Distribution (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.0029624258169966017,"score_gpt":0.2030677088282066,"score_spread":0.20010528301121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102196430","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.9952264,0.0022917553,0.0014231014,0.00028352323,0.00025316598,0.00013261888,0.000005288382,0.000017764856,0.00036639682],"genre_scores_gemma":[0.9993428,0.00048118472,4.2141542e-7,0.000007781291,0.000020333779,0.0000032566234,0.000004621429,0.000012491161,0.00012711942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878305,0.00020818305,0.00045352365,0.00004851567,0.00021825384,0.00028849574],"domain_scores_gemma":[0.9995376,0.00009712701,0.00010981255,0.00015750832,0.0000674524,0.000030498008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011636951,0.00010350791,0.00020769208,0.0000623791,0.000085056956,0.000023360573,0.00032608263,0.000045244335,0.000022312468],"category_scores_gemma":[0.0000134738575,0.000065654465,0.000096972784,0.0004977116,0.000041711184,0.00012556909,0.0000119212045,0.00041336234,0.0000060800207],"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.00018954127,0.0000828154,0.00039695067,0.000048156126,0.00024616587,0.000009037285,0.002207236,0.065633066,0.0015379762,0.9271847,0.0008785751,0.0015857669],"study_design_scores_gemma":[0.0009783542,0.00043089798,0.0040074284,0.00014015877,0.000085770844,0.0001944047,0.000520516,0.0036114997,0.006264936,0.98126763,0.0023259472,0.00017245131],"about_ca_topic_score_codex":0.000008031623,"about_ca_topic_score_gemma":0.000002938932,"teacher_disagreement_score":0.06202157,"about_ca_system_score_codex":0.00017656902,"about_ca_system_score_gemma":0.000027483064,"threshold_uncertainty_score":0.26773113},"labels":[],"label_agreement":null},{"id":"W2102207023","doi":"10.1016/j.jcta.2013.11.005","title":"Resolvability of infinite designs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Resolution (logic); Mathematics; Contrast (vision); Combinatorics; Discrete mathematics; Pure mathematics; Physics; Computer science; Optics","score_opus":0.009741561019551986,"score_gpt":0.19871775146611279,"score_spread":0.1889761904465608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102207023","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.9864003,0.0004148715,0.00077316415,0.000025283842,0.0052528447,0.00015461596,0.0000030574556,0.000041027874,0.00693484],"genre_scores_gemma":[0.99942124,0.000033526838,0.00016872294,0.000007121721,0.00028363883,0.0000047556555,3.0714276e-7,0.000019082892,0.00006163087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986135,0.00027591345,0.0006694473,0.000058002388,0.0002159617,0.0001672036],"domain_scores_gemma":[0.9988545,0.00030648045,0.00023399622,0.00022626453,0.00028005723,0.00009867275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013262017,0.00013472632,0.0003888792,0.000114396316,0.000038821803,0.000031329677,0.00027230498,0.000097963806,0.00032404935],"category_scores_gemma":[0.000210409,0.00011083652,0.00017612914,0.000195501,0.00013120791,0.0004991269,0.000022134409,0.00023053266,0.000012039847],"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.00056674605,0.0001050394,0.0007755916,0.00019066577,0.00024191322,0.0000069984253,0.0014219204,0.0007314943,0.032891933,0.96003425,0.0015420235,0.0014914086],"study_design_scores_gemma":[0.0007549921,0.0005113156,0.00086590415,0.00008898175,0.00003064209,0.000041793573,0.0007556146,0.000024567878,0.029956523,0.9609508,0.0058719963,0.00014687842],"about_ca_topic_score_codex":0.0000030234958,"about_ca_topic_score_gemma":2.4523123e-7,"teacher_disagreement_score":0.013020919,"about_ca_system_score_codex":0.00002967205,"about_ca_system_score_gemma":0.000029902116,"threshold_uncertainty_score":0.4519782},"labels":[],"label_agreement":null},{"id":"W2102409475","doi":"10.1109/lpt.2008.2006062","title":"Fiber Fault Monitoring for Passive Optical Networks Using Hybrid 1-D/2-D Coding","year":2008,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","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":"Université Laval","funders":"","keywords":"Passive optical network; Computer science; Optical performance monitoring; Encoder; Electronic engineering; Coding (social sciences); Optical fiber; Telecommunications; Optics; Physics; Wavelength-division multiplexing; Engineering; Mathematics","score_opus":0.015285282775350751,"score_gpt":0.21998757537790534,"score_spread":0.2047022926025546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102409475","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.9147061,0.00023740417,0.081865415,0.00014263597,0.0016905313,0.0003617579,0.000010795254,0.0009026196,0.00008275172],"genre_scores_gemma":[0.99477845,0.0000592079,0.0046628127,0.000086682965,0.00017493793,0.00014078047,0.0000033783087,0.00007846085,0.000015300262],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985717,0.00001450114,0.00034895638,0.0003066801,0.0001157434,0.0006424507],"domain_scores_gemma":[0.99934345,0.000103327606,0.000065627995,0.00037803638,0.000040513158,0.000069065194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012156506,0.00027112378,0.00033571798,0.00027312056,0.0002726248,0.000020728781,0.0003203895,0.00027428693,0.0000049895248],"category_scores_gemma":[0.000022328752,0.0003010615,0.00013833633,0.00030234182,0.00021807644,0.000107655374,0.00003064836,0.0004963314,0.000014902932],"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.000029863584,0.000028581131,0.0009006533,0.00009040959,0.00028021034,0.00029410963,0.00013385569,0.379613,0.6139808,0.0010152027,0.0019158475,0.001717444],"study_design_scores_gemma":[0.00068208843,0.000041985422,0.000031546988,0.000109253655,0.000060189286,0.0006787237,0.00008524296,0.30852205,0.68604314,0.00034868735,0.00282004,0.0005770433],"about_ca_topic_score_codex":0.000002217911,"about_ca_topic_score_gemma":3.567049e-7,"teacher_disagreement_score":0.08007235,"about_ca_system_score_codex":0.00014433764,"about_ca_system_score_gemma":0.000011798115,"threshold_uncertainty_score":0.99994415},"labels":[],"label_agreement":null},{"id":"W2102571841","doi":"10.1109/icc.2007.356","title":"Hybrid Power/Overlap Allocation Scheme for a Multirate Overlapped Optical CDMA System","year":2007,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Computer science; Resource allocation; Mathematical optimization; Throughput; Transmission (telecommunications); Optimization problem; Resource management (computing); Quadratic equation; Convex optimization; Computer network; Regular polygon; Algorithm; Mathematics; Telecommunications; Wireless","score_opus":0.006956265521039381,"score_gpt":0.20852106476018195,"score_spread":0.20156479923914258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102571841","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.65731025,0.000109785746,0.30849937,0.000014007739,0.000921109,0.0005656322,0.000011380626,0.00086461427,0.031703886],"genre_scores_gemma":[0.99591523,0.000001317374,0.0034202659,0.000029994531,0.00012121478,0.00004922349,0.000015403366,0.000044081975,0.00040326532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988721,0.000013901399,0.00036379282,0.00020293212,0.00015367077,0.000393601],"domain_scores_gemma":[0.9993858,0.0001196604,0.000032404372,0.00026717124,0.00006475552,0.00013025211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066284544,0.00018343845,0.00021153993,0.00009221004,0.00006825785,0.00004229506,0.00013433158,0.00009276286,0.00002374665],"category_scores_gemma":[0.000027788488,0.00017264098,0.00011730719,0.00010939855,0.000022046825,0.00013711772,0.000013265751,0.00009166763,0.00014378293],"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.00019055285,0.00007316988,0.00045774586,0.00089572446,0.0002078628,0.000027192631,0.00026272354,0.0017012572,0.24635454,0.7454307,0.0022485843,0.0021499107],"study_design_scores_gemma":[0.0047377674,0.00038260286,0.0025692617,0.00044470158,0.000097847624,0.00023067251,0.004640019,0.43746933,0.5094798,0.001192106,0.036982615,0.0017732579],"about_ca_topic_score_codex":0.000006071043,"about_ca_topic_score_gemma":0.0000059952345,"teacher_disagreement_score":0.7442386,"about_ca_system_score_codex":0.00009305967,"about_ca_system_score_gemma":0.000008903902,"threshold_uncertainty_score":0.7040095},"labels":[],"label_agreement":null},{"id":"W2102857168","doi":"10.1016/s0012-365x(99)00247-2","title":"Extremal properties of ray-nonsingular matrices","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Invertible matrix; Mathematics; Matrix (chemical analysis); Combinatorics; Square matrix; Order (exchange); Square (algebra); Row; Involutory matrix; Pure mathematics; Discrete mathematics; Symmetric matrix; Eigenvalues and eigenvectors; Computer science; Geometry; Physics","score_opus":0.011510298309909744,"score_gpt":0.1873934737358378,"score_spread":0.17588317542592807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102857168","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.97592515,0.0015458589,0.0013997167,0.0000070197175,0.000079149504,0.00015117986,0.0000074439276,0.00018761333,0.020696893],"genre_scores_gemma":[0.9974479,0.000054675118,0.0017792087,0.0000030141346,0.00003531428,0.00000950924,0.0000018414247,0.000030866322,0.0006376909],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992868,0.00001892395,0.00030512403,0.00007893612,0.00014719731,0.0001630198],"domain_scores_gemma":[0.99962693,0.00001907824,0.0000355266,0.00025776387,0.000022997934,0.000037723185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014449486,0.00013288355,0.00023271138,0.000051810577,0.000035147477,0.000023397162,0.00014351068,0.0000533679,0.0002862345],"category_scores_gemma":[0.00001183619,0.000103359445,0.000073230134,0.00016800537,0.00005474111,0.00008533704,0.000009229974,0.00006105602,0.00008948056],"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.00021002893,0.0009142852,0.0011510846,0.03804542,0.0019003319,0.000117078096,0.11261924,0.09115916,0.5476341,0.15647766,0.0048051286,0.044966474],"study_design_scores_gemma":[0.0023484007,0.0003072049,0.0005983373,0.006270512,0.00064022356,0.00025721188,0.014125762,0.45213243,0.44884995,0.054389138,0.01690037,0.0031804761],"about_ca_topic_score_codex":0.000002668403,"about_ca_topic_score_gemma":7.934018e-7,"teacher_disagreement_score":0.36097327,"about_ca_system_score_codex":0.000007510724,"about_ca_system_score_gemma":0.000005253836,"threshold_uncertainty_score":0.42148757},"labels":[],"label_agreement":null},{"id":"W2102915841","doi":"10.1016/j.laa.2008.06.001","title":"On the energy of (0,1)-matrices","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Incidence matrix; Energy (signal processing); Upper and lower bounds; Matrix (chemical analysis); Order (exchange); Block (permutation group theory); Discrete mathematics; Graph; Statistics; Mathematical analysis","score_opus":0.009411546547281841,"score_gpt":0.19070399651161818,"score_spread":0.18129244996433633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102915841","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.9698368,0.0031739022,0.009528789,0.00014788423,0.000056275647,0.00022710652,0.00002488193,0.00015038958,0.016854016],"genre_scores_gemma":[0.9991557,0.0004400382,0.000025475103,0.0000473009,0.00005148913,0.00008179649,0.0000032655091,0.000007743642,0.0001871832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972516,0.000009870483,0.00009722074,0.000059315742,0.000048815244,0.000059627357],"domain_scores_gemma":[0.9997083,0.00010253168,0.000017211965,0.00013346632,0.000015346031,0.0000231633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000036541802,0.000051890507,0.000062995394,0.000028270328,0.000090060144,0.0000029785313,0.000078278834,0.000027316653,0.000026845752],"category_scores_gemma":[0.0000041929507,0.00003569137,0.000022830829,0.00014724921,0.000027747197,0.000021593618,0.000006942315,0.000039236907,0.000023654251],"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.000001610012,0.000013097396,0.000017975199,0.000015655887,0.000014796026,1.5146313e-7,0.00012227154,0.00019877026,0.0022953032,0.996058,0.0007471597,0.000515208],"study_design_scores_gemma":[0.00086066435,0.0002630964,0.0026396776,0.00011144117,0.00010240084,0.000104810446,0.0006173689,0.07083719,0.23966768,0.16244788,0.5213806,0.00096714805],"about_ca_topic_score_codex":0.0000025989375,"about_ca_topic_score_gemma":6.821773e-7,"teacher_disagreement_score":0.8336101,"about_ca_system_score_codex":0.000001709409,"about_ca_system_score_gemma":0.0000027072117,"threshold_uncertainty_score":0.14554518},"labels":[],"label_agreement":null},{"id":"W2103307323","doi":"10.1007/s00454-006-1233-3","title":"Colourful Simplicial Depth","year":2006,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Conjecture; Mathematics; Betti number; Bounding overwatch; Combinatorics; Simplicial manifold; Monochrome; Generalization; Simplicial complex; Point (geometry); Pure mathematics; Simplicial set; Geometry; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.004734151466921731,"score_gpt":0.20358803825217633,"score_spread":0.1988538867852546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103307323","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.90668654,0.00026985983,0.057760473,0.000031625677,0.00048610405,0.00012474589,0.000048351794,0.00036785853,0.03422445],"genre_scores_gemma":[0.9986066,9.1094444e-7,0.00065135845,0.000052411197,0.0002970498,0.000012645024,0.00018756642,0.000026988779,0.0001644569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9991382,0.000025401914,0.00023723187,0.0001491804,0.00022179927,0.00022819787],"domain_scores_gemma":[0.99967164,0.000101148835,0.000029859038,0.00010252235,0.00004057779,0.000054246633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010581744,0.00014333107,0.00014978758,0.0001668562,0.00008853529,0.000048196864,0.00012578837,0.00006632694,0.00010520424],"category_scores_gemma":[0.000007122787,0.00014776074,0.00008933961,0.0004281311,0.000038943515,0.00009453733,0.000018152983,0.00010670322,0.000192854],"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.000009646681,0.000020825386,0.006778987,0.000036909776,0.000041557996,0.00000972049,0.000042116473,0.9018204,0.00033753618,0.08547826,0.004145501,0.0012784919],"study_design_scores_gemma":[0.0011853232,0.000087620385,0.50618273,0.000052699354,0.00004596832,0.00007226856,0.00022058273,0.2723418,0.00078761653,0.193867,0.024172693,0.0009837461],"about_ca_topic_score_codex":0.000023288338,"about_ca_topic_score_gemma":0.000013116248,"teacher_disagreement_score":0.6294787,"about_ca_system_score_codex":0.000032965534,"about_ca_system_score_gemma":0.000011694456,"threshold_uncertainty_score":0.6025508},"labels":[],"label_agreement":null},{"id":"W2103621885","doi":"10.1109/glocom.2005.1578005","title":"A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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 British Columbia","funders":"","keywords":"Greedy algorithm; Algorithm; Reuse; Computer science; Code (set theory); Set (abstract data type); Process (computing); Reduction (mathematics); Mathematics; Engineering","score_opus":0.030874760277588568,"score_gpt":0.2722429596859024,"score_spread":0.24136819940831383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103621885","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.37828335,0.0021253757,0.59112906,0.00092977635,0.0016800468,0.0017864376,0.0014839408,0.0018610236,0.020720968],"genre_scores_gemma":[0.796649,0.0002621434,0.20211414,0.00012309966,0.00029854322,0.00018837914,0.00019792991,0.000057853802,0.00010894195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970313,0.00021470882,0.0009643299,0.00046736977,0.00030262917,0.0010197101],"domain_scores_gemma":[0.99680704,0.00026191646,0.00017181231,0.0020426936,0.00036042146,0.00035610897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058822765,0.00053079904,0.0006137231,0.00019061237,0.00064262823,0.00025449978,0.0018712711,0.00037035145,0.00013858397],"category_scores_gemma":[0.00011655575,0.00059202354,0.00028206248,0.00066750427,0.00024876036,0.0004843038,0.00022945052,0.0004748542,0.000112175876],"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.00023206088,0.0022306796,0.0037323374,0.00047109387,0.0028916711,0.000047670095,0.0016615643,0.11541104,0.01952409,0.19641735,0.095024556,0.5623559],"study_design_scores_gemma":[0.0015649206,0.00010399542,0.0011639085,0.00024148668,0.00022409322,0.0004315224,0.00038552473,0.90730166,0.0013009502,0.0048290445,0.08123132,0.0012215972],"about_ca_topic_score_codex":0.00010161396,"about_ca_topic_score_gemma":0.0013518843,"teacher_disagreement_score":0.7918906,"about_ca_system_score_codex":0.000492605,"about_ca_system_score_gemma":0.00024231724,"threshold_uncertainty_score":0.9996531},"labels":[],"label_agreement":null},{"id":"W2103948162","doi":"","title":"On orthogonal matrices","year":2004,"lang":"en","type":"dissertation","venue":"Open ULeth Scholarship (OPUS) (University of Lethbridge)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"University of Lethbridge","keywords":"Circulant matrix; Mathematics; Hadamard matrix; Combinatorics; Orthogonal array; Integer (computer science); Matrix (chemical analysis); Hadamard transform; Complex Hadamard matrix; Orthogonal matrix; Order (exchange); Integer matrix; Block (permutation group theory); Discrete mathematics; Algebra over a field; Orthogonal basis; Pure mathematics; Computer science; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors; Statistics","score_opus":0.013559766009651888,"score_gpt":0.22632228113570738,"score_spread":0.21276251512605548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103948162","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.89911294,0.0007964228,0.000116361654,0.00005549446,0.0013504538,0.00071139575,0.00018839676,0.00020039773,0.097468145],"genre_scores_gemma":[0.98597926,0.00023921602,0.00044222284,0.000046943784,0.000078461686,0.00000280821,0.0008543821,0.00010089603,0.012255806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99789846,0.00019359363,0.00033809527,0.0005603168,0.0005735374,0.00043602285],"domain_scores_gemma":[0.99853987,0.00013420019,0.0003091813,0.00064348185,0.00016184086,0.00021141508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008333207,0.00049749657,0.00076958735,0.000501825,0.0003766925,0.00018403832,0.001960518,0.0006779631,0.00065907347],"category_scores_gemma":[0.000040992276,0.0006435525,0.00035012653,0.000554681,0.00007734294,0.00094215316,0.00010625768,0.0013036341,0.0006006593],"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.009471298,0.0020801052,0.0066722324,0.021909194,0.007252633,0.0034983978,0.032029122,0.027256172,0.048675828,0.68910956,0.052420426,0.09962506],"study_design_scores_gemma":[0.031233057,0.0033671763,0.42048013,0.039773483,0.0046982737,0.00033916658,0.06150338,0.0009486671,0.052923303,0.13419177,0.2301526,0.020388976],"about_ca_topic_score_codex":0.0003219414,"about_ca_topic_score_gemma":0.00048651107,"teacher_disagreement_score":0.55491775,"about_ca_system_score_codex":0.00018862191,"about_ca_system_score_gemma":0.00017087418,"threshold_uncertainty_score":0.9996016},"labels":[],"label_agreement":null},{"id":"W2104410258","doi":"10.1109/lpt.2006.870188","title":"Demonstration of all-photonic spectral label-switching for optical MPLS networks","year":2006,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","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":"McGill University","funders":"","keywords":"Label switching; Optical burst switching; Optical amplifier; Photonics; Optical switch; Extinction ratio; Multiprotocol Label Switching; Optical performance monitoring; Packet switching; Materials science; Optoelectronics; Optical cross-connect; Computer science; Optical fiber; Electronic engineering; Laser; Optics; Wavelength; Wavelength-division multiplexing; Network packet; Physics; Telecommunications; Computer network; Engineering","score_opus":0.006818006925507269,"score_gpt":0.2068415955427291,"score_spread":0.20002358861722183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104410258","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.8741993,0.00026692072,0.12321153,0.00036366694,0.00058175996,0.00042020556,0.000007972755,0.00054502935,0.00040360892],"genre_scores_gemma":[0.9951794,0.000018523733,0.0044453405,0.00011495907,0.000059414917,0.00011820438,0.000010920548,0.000046243316,0.0000069911835],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869096,0.0000130854705,0.0004682824,0.00024066336,0.000102138336,0.00048488326],"domain_scores_gemma":[0.9994362,0.000080765974,0.000087967215,0.00033592715,0.000026760314,0.000032359203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025378726,0.00021606068,0.0003132504,0.00025170244,0.000053401756,0.00001860786,0.00028391567,0.00034630022,0.0000031510124],"category_scores_gemma":[0.000007279354,0.00023495754,0.00011209223,0.0003035565,0.00012899433,0.00008205307,0.000013020895,0.0003634406,0.0000041642115],"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.00001768822,0.000032925695,0.00035004783,0.000052094838,0.00008828461,0.000009370298,0.000018718654,0.056178145,0.90371215,0.038460407,0.0006560525,0.00042409365],"study_design_scores_gemma":[0.00081854017,0.00009298871,0.00007778122,0.00004910146,0.00007702647,0.00007528842,0.0000365487,0.23578826,0.7546773,0.0071725375,0.00076773483,0.0003669038],"about_ca_topic_score_codex":0.000009566898,"about_ca_topic_score_gemma":0.00003479507,"teacher_disagreement_score":0.1796101,"about_ca_system_score_codex":0.000070416056,"about_ca_system_score_gemma":0.000011024851,"threshold_uncertainty_score":0.95812905},"labels":[],"label_agreement":null},{"id":"W2104684538","doi":"10.1007/s00022-003-1705-z","title":"Cyclic polytopes, hyperplanes, and Gray codes","year":2003,"lang":"en","type":"article","venue":"Journal of Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Hyperplane; Polytope; Combinatorics; Mathematics; Order (exchange); Cube (algebra); Face (sociological concept); Discrete mathematics","score_opus":0.0044504905999718045,"score_gpt":0.18158822910988448,"score_spread":0.17713773850991268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104684538","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.9855105,0.009488594,0.00042444572,0.0000119872775,0.00071542535,0.000024021323,0.0000028932225,0.000019975172,0.0038021447],"genre_scores_gemma":[0.99920547,0.00031724962,0.00021075796,0.000020506513,0.000102473925,3.4420862e-7,3.1871423e-7,0.000012175663,0.0001306891],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943805,0.000039128554,0.00023432275,0.000043603595,0.00011573687,0.00012913217],"domain_scores_gemma":[0.99968815,0.00005946921,0.00005937337,0.00007755506,0.00002318963,0.00009223479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038930072,0.00008450221,0.0001923395,0.00021612934,0.000032974724,0.000026853115,0.00007233948,0.00005349471,0.000049867147],"category_scores_gemma":[0.00004350003,0.0000675542,0.000052103285,0.00019687915,0.000021910468,0.00010391402,0.000003939981,0.00016277446,0.00000947889],"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.00020967326,0.0003981856,0.5292629,0.0017909964,0.0021974868,0.00087366445,0.0022013579,0.007853296,0.27405712,0.09210131,0.043770526,0.04528347],"study_design_scores_gemma":[0.004178654,0.0007488292,0.112918176,0.0006808202,0.0003132847,0.020541118,0.002967446,0.00029813073,0.05685868,0.017575841,0.7814986,0.0014203867],"about_ca_topic_score_codex":0.000001592347,"about_ca_topic_score_gemma":8.8931984e-7,"teacher_disagreement_score":0.7377281,"about_ca_system_score_codex":0.000012227683,"about_ca_system_score_gemma":0.0000070041074,"threshold_uncertainty_score":0.27547804},"labels":[],"label_agreement":null},{"id":"W2104806037","doi":"10.1007/s00229-004-0462-0","title":"CM–fields and skew–symmetric matrices","year":2004,"lang":"en","type":"article","venue":"manuscripta mathematica","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Mathematics; Skew-symmetric matrix; Skew; Eigenvalues and eigenvectors; Number theory; Dimension (graph theory); Matrix (chemical analysis); Symmetric matrix; Field (mathematics); Combinatorics; Degree (music); Algebraic geometry; Pure mathematics; Mathematical analysis; Square matrix; Physics","score_opus":0.012858318251559043,"score_gpt":0.19425911299863516,"score_spread":0.18140079474707613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104806037","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.8111868,0.0052615367,0.031051718,0.00033158835,0.0012295414,0.00052010047,0.000012118661,0.0011233613,0.14928326],"genre_scores_gemma":[0.99672353,0.000104239734,0.0023340797,0.00005124421,0.00006432708,0.00002996512,0.0000016353614,0.000032550255,0.00065843924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991777,0.000014828034,0.00025324774,0.00015428064,0.00014778973,0.00025217517],"domain_scores_gemma":[0.99954206,0.000038852933,0.000029359308,0.00028215323,0.000014045099,0.000093522365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002026256,0.00017369998,0.00023123038,0.00020452877,0.00007075578,0.000084628184,0.00016554055,0.0000943929,0.0000616073],"category_scores_gemma":[0.000028012833,0.00015345293,0.000058469217,0.00033434457,0.000037147776,0.00014566818,0.000033853998,0.00012555302,0.00022995893],"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.0000073592987,0.00010697663,0.00010925071,0.002025376,0.00014559712,0.00005457262,0.0027828494,0.00032060558,0.0019116767,0.9836393,0.004510483,0.00438596],"study_design_scores_gemma":[0.0013755548,0.00015452928,0.00134359,0.00039721892,0.00014684108,0.0003472087,0.0012072022,0.0042643654,0.007914476,0.9623212,0.019531611,0.0009961971],"about_ca_topic_score_codex":0.000009860315,"about_ca_topic_score_gemma":0.0000029096639,"teacher_disagreement_score":0.18553674,"about_ca_system_score_codex":0.000022616143,"about_ca_system_score_gemma":0.0000044605436,"threshold_uncertainty_score":0.6257629},"labels":[],"label_agreement":null},{"id":"W2106108365","doi":"10.37236/2264","title":"Perfect 1-Factorisations of Circulants with Small Degree","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Circulant matrix; Combinatorics; Factorization; Degree (music); Trivially perfect graph; Circulant graph; Discrete mathematics; Graph; Chordal graph; Line graph; 1-planar graph; Algorithm","score_opus":0.011802458463249732,"score_gpt":0.16899199817899188,"score_spread":0.15718953971574215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106108365","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.98514926,0.0022615285,0.010473274,0.000039873685,0.00030633245,0.00012365368,4.6283677e-7,0.000021904098,0.0016236914],"genre_scores_gemma":[0.99968493,0.00018570598,0.0000072390835,0.0000044284443,0.000041863266,0.000004041295,3.1353116e-7,0.000020279625,0.000051205796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910015,0.000075684016,0.00029004476,0.000043113014,0.0001974859,0.00029352505],"domain_scores_gemma":[0.9993047,0.00012011977,0.00016142301,0.00019047559,0.00017325656,0.000050011113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004379941,0.00011177973,0.00021732839,0.00008320424,0.000052649764,0.00001787633,0.000307671,0.00004445211,0.000023637751],"category_scores_gemma":[0.00001777158,0.00006790877,0.00008382793,0.0002620224,0.000037177655,0.00010726584,0.00000809797,0.0004046798,0.000008239464],"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.000066928485,0.0002217718,0.010266759,0.0001914361,0.0012756241,0.000009402729,0.002491825,0.0064860913,0.017014576,0.9571678,0.00081810274,0.0039896695],"study_design_scores_gemma":[0.003357071,0.002679807,0.03011513,0.00030538047,0.00043071955,0.0012900103,0.0016209537,0.0024279766,0.026858887,0.9266252,0.003598164,0.0006907355],"about_ca_topic_score_codex":0.000011779158,"about_ca_topic_score_gemma":0.000004969729,"teacher_disagreement_score":0.030542647,"about_ca_system_score_codex":0.00010660822,"about_ca_system_score_gemma":0.00009223392,"threshold_uncertainty_score":0.27692392},"labels":[],"label_agreement":null},{"id":"W2106775840","doi":"10.1109/lpt.2009.2039868","title":"Capacity of SOA-Assisted SAC-OCDMA","year":2010,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","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":"Université Laval","funders":"","keywords":"Computer science; Bit error rate; Code division multiple access; Noise (video); Electronic engineering; Optical amplifier; Wavelength-division multiplexing; Gaussian noise; Monte Carlo method; Algorithm; Telecommunications; Wavelength; Optics; Decoding methods; Physics; Mathematics; Engineering; Laser; Statistics; Artificial intelligence","score_opus":0.006489848406266306,"score_gpt":0.18337223643375056,"score_spread":0.17688238802748424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106775840","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.9951375,0.000043052027,0.0008158548,0.00046710356,0.0017573341,0.00016698398,0.000018170358,0.000865031,0.0007289862],"genre_scores_gemma":[0.99855316,0.0000067535234,0.0011908483,0.00013578574,0.000023017054,0.0000423039,0.0000016877799,0.000036259145,0.000010169047],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900687,0.000016511083,0.00033116003,0.0002009309,0.00011343249,0.00033111486],"domain_scores_gemma":[0.99916494,0.000036317517,0.00007683074,0.0006449912,0.000031598825,0.000045335815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020413057,0.00019042457,0.00029489113,0.00034373446,0.00005417729,0.00000892519,0.0004333647,0.00039286207,0.000028229391],"category_scores_gemma":[0.000022344375,0.00019836168,0.000103537684,0.0004428119,0.00035665795,0.000060167775,0.000021018215,0.0007258564,0.00003980225],"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.0000039874335,0.000019499576,0.00095700694,0.00004831187,0.00006990622,0.0000100004145,0.00006661889,0.00021211326,0.99270684,0.0046221456,0.00066866993,0.0006149064],"study_design_scores_gemma":[0.00030024466,0.000021911119,0.000567481,0.000018933264,0.000024706915,0.0000953427,0.000034085147,0.0016866007,0.9903145,0.0020088484,0.004683863,0.00024351168],"about_ca_topic_score_codex":0.000011870903,"about_ca_topic_score_gemma":0.000049504946,"teacher_disagreement_score":0.004015193,"about_ca_system_score_codex":0.000024404422,"about_ca_system_score_gemma":0.000008692607,"threshold_uncertainty_score":0.80889547},"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":"W2108683550","doi":"10.1007/978-3-540-44400-8_12","title":"On the Face Lattice of the Metric Polytope","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; McMaster University","funders":"","keywords":"Polytope; Enumeration; Combinatorics; Conjecture; Lattice (music); Vertex (graph theory); Face (sociological concept); Mathematics; Computer science; Discrete mathematics; Graph; Physics","score_opus":0.01118062854159397,"score_gpt":0.1971345960277889,"score_spread":0.18595396748619494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108683550","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.0045059095,0.0017644195,0.9444992,0.00051045953,0.004370785,0.0006180372,0.000011268583,0.00009117242,0.04362876],"genre_scores_gemma":[0.99807024,0.000013711542,0.00071031327,0.00072958076,0.00007577526,0.0000032084931,2.3559106e-7,0.000023759863,0.0003732034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987604,0.00004134069,0.00022497795,0.00028038598,0.00045999087,0.00023291672],"domain_scores_gemma":[0.9983998,0.0006795424,0.00007970599,0.0007688796,0.000039895214,0.000032164167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000646522,0.00023261557,0.0002286243,0.00024165768,0.000111081616,0.000058640137,0.0012934393,0.00014045408,0.000027626342],"category_scores_gemma":[0.000085223335,0.0001272937,0.000104099316,0.00064749666,0.00035290228,0.000046493024,0.000114874645,0.00053204794,0.000016362335],"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.000005969319,0.00001841756,0.00005372601,0.0001395875,0.000055549524,0.00000890879,0.0013752247,0.6305332,0.0005504001,0.29847494,0.000276979,0.06850707],"study_design_scores_gemma":[0.00046919184,0.00025625134,0.00056764414,0.0020198636,0.00007636196,0.000104823026,0.0000046391992,0.23191848,0.04222663,0.70457757,0.016161008,0.0016175513],"about_ca_topic_score_codex":0.0000035463152,"about_ca_topic_score_gemma":0.000007832019,"teacher_disagreement_score":0.9935643,"about_ca_system_score_codex":0.00005987429,"about_ca_system_score_gemma":0.00003259798,"threshold_uncertainty_score":0.5190886},"labels":[],"label_agreement":null},{"id":"W2109104984","doi":"10.37236/1545","title":"Hadamard Matrices and Strongly Regular Graphs with the $3$-e.c. Adjacency Property","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"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; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Strongly regular graph; Adjacency matrix; Two-graph; Hadamard transform; Chordal graph; Discrete mathematics; Hadamard matrix; Graph; Pathwidth; Line graph; Graph power","score_opus":0.0025382133385621055,"score_gpt":0.15605113986195523,"score_spread":0.15351292652339313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109104984","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.9718133,0.024201026,0.00035440834,0.0005541504,0.0001525578,0.00017769403,6.3401563e-7,0.000041127638,0.0027050513],"genre_scores_gemma":[0.9959457,0.0031678467,0.000002960502,0.000017191707,0.000052176827,0.000004497706,2.0340116e-7,0.000025684238,0.00078377227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883777,0.00013543379,0.00024660007,0.00007486449,0.00030002565,0.00040529156],"domain_scores_gemma":[0.9994567,0.00007495151,0.0001039716,0.00023568569,0.0000715374,0.000057159723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086851435,0.00016398629,0.00021382346,0.00005587083,0.00018498872,0.00006076944,0.00041918567,0.00004745471,0.000025367435],"category_scores_gemma":[0.0000047601757,0.00006576413,0.000072490904,0.0003732647,0.00009596795,0.00016346315,0.000010052436,0.00060035917,0.0000037462007],"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.00049950037,0.00014169174,0.0010955533,0.00014120052,0.0010639145,0.00004005595,0.0022106874,0.007585478,0.00090270175,0.9646654,0.0066699814,0.014983799],"study_design_scores_gemma":[0.0043691196,0.003875505,0.0027581735,0.00032902177,0.00077464257,0.0035131287,0.002553973,0.0021599147,0.0028032898,0.7217638,0.25411993,0.000979523],"about_ca_topic_score_codex":0.0000046902196,"about_ca_topic_score_gemma":0.0000062784684,"teacher_disagreement_score":0.24744995,"about_ca_system_score_codex":0.00006412111,"about_ca_system_score_gemma":0.0000680438,"threshold_uncertainty_score":0.26817834},"labels":[],"label_agreement":null},{"id":"W2109962273","doi":"10.1109/tcomm.2003.816969","title":"Optimizing spectral efficiency in multiwavelength optical CDMA system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"University of Toronto","funders":"","keywords":"Code division multiple access; Spectral efficiency; Computer science; CDMA spectral efficiency; Electronic engineering; Spread spectrum; Wavelength-division multiplexing; Code (set theory); Prime (order theory); Computer network; Wavelength; Engineering; Mathematics; Optics; Physics; Channel (broadcasting)","score_opus":0.018225540692362013,"score_gpt":0.22876649045114777,"score_spread":0.21054094975878576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109962273","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.10548017,0.0006299443,0.80573153,0.00008245914,0.0010310189,0.0005972811,0.000027710608,0.0009418606,0.085478015],"genre_scores_gemma":[0.99298227,0.00011868149,0.0066236043,0.000008134712,0.000008421978,0.00014032681,0.0000020412572,0.00003464166,0.00008188528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.00019370398,0.00037257496,0.00016212102,0.00012315222,0.00029713902],"domain_scores_gemma":[0.998441,0.00024887803,0.00002381663,0.0011684942,0.000026335118,0.00009150962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003239667,0.00017490155,0.00019958625,0.00025352955,0.0002675999,0.000036789177,0.00046458078,0.000106500316,0.000028321623],"category_scores_gemma":[0.0000057630264,0.00019096662,0.00010979115,0.0005319345,0.000090886206,0.000118100295,0.0000013150325,0.00051516,0.00011534134],"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.000016586528,0.00070978794,0.00002996276,0.00014026073,0.00009909888,0.000009232144,0.0029565922,0.8614998,0.0070057497,0.123507544,0.000028742998,0.003996629],"study_design_scores_gemma":[0.0024626665,0.00016381571,0.0003160792,0.00065549405,0.000117365526,0.00018928754,0.007781917,0.91311544,0.069499925,0.00051713997,0.0039171833,0.0012636762],"about_ca_topic_score_codex":0.000015132369,"about_ca_topic_score_gemma":0.00012400442,"teacher_disagreement_score":0.8875021,"about_ca_system_score_codex":0.00017613253,"about_ca_system_score_gemma":0.000022076316,"threshold_uncertainty_score":0.7787393},"labels":[],"label_agreement":null},{"id":"W2111082420","doi":"10.1109/lpt.2002.805760","title":"A new family of 2-D wavelength-time codes for optical CDMA with differential detection","year":2003,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Antipodal point; Code division multiple access; Computer science; Bit error rate; Coding gain; Coding (social sciences); Electronic engineering; Algorithm; Telecommunications; Mathematics; Decoding methods; Engineering; Statistics","score_opus":0.004285446923828448,"score_gpt":0.17675691741523272,"score_spread":0.17247147049140427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111082420","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.8381011,0.000052709867,0.16055043,0.000062010804,0.0003677351,0.00031134763,0.000007996801,0.0003857379,0.00016094086],"genre_scores_gemma":[0.9945747,0.000007826584,0.005207836,0.000040662155,0.00001865143,0.00008247702,0.0000017335066,0.00004391045,0.000022152777],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910426,0.000014650614,0.0002557545,0.00020718819,0.000099748235,0.00031841605],"domain_scores_gemma":[0.9995159,0.000057400277,0.00005332294,0.0002979658,0.000027724363,0.00004768424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009936767,0.00019377346,0.00030421215,0.00024592385,0.00005013971,0.000010552901,0.00017564607,0.0002468882,0.00000833978],"category_scores_gemma":[0.00001683289,0.000179605,0.00008183647,0.00027888382,0.00012456716,0.00004557135,0.00000664953,0.00022372583,0.000009355156],"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.00004740871,0.000017046994,0.000032798016,0.00004956938,0.00012911501,0.0000038247417,0.000038484144,0.0006923825,0.99287486,0.0040391195,0.00019562915,0.0018797873],"study_design_scores_gemma":[0.0008880621,0.00017283103,0.000031913347,0.000031759286,0.0000605219,0.000050288796,0.000050966806,0.0068312986,0.9892057,0.001259942,0.0011889072,0.00022779142],"about_ca_topic_score_codex":0.0000031710963,"about_ca_topic_score_gemma":0.0000067812953,"teacher_disagreement_score":0.15647367,"about_ca_system_score_codex":0.00004052876,"about_ca_system_score_gemma":0.000016052798,"threshold_uncertainty_score":0.732408},"labels":[],"label_agreement":null},{"id":"W2111826700","doi":"10.1016/s0012-365x(03)00089-x","title":"Embedding Steiner triple systems into Steiner systems S(2,4,v)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner system; Embedding; Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.009964591549771824,"score_gpt":0.22347137955274649,"score_spread":0.21350678800297465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111826700","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.5733933,0.013446915,0.22904108,0.000021333179,0.01134789,0.0028771944,0.000085503205,0.0026132572,0.16717353],"genre_scores_gemma":[0.99467885,0.000026520158,0.0011316942,0.0000064402407,0.00016635064,0.0001731922,0.0000149136295,0.00013957387,0.0036624551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782836,0.00015145697,0.00081203895,0.0002748181,0.00040805593,0.0005252758],"domain_scores_gemma":[0.9987338,0.00013503923,0.00013807246,0.0007333018,0.00007398501,0.00018577656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008174678,0.0004219024,0.00064223836,0.00017945548,0.00015068769,0.0002625018,0.00030123326,0.0001915364,0.000045676858],"category_scores_gemma":[0.00009540307,0.00035438416,0.00016770187,0.00036287852,0.00005104739,0.00022428446,0.000027623415,0.00022780178,0.00027052074],"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.000008486178,0.000096751566,0.00014003566,0.0073887478,0.000502413,0.00004919316,0.0070213485,0.18924433,0.008900314,0.7805979,0.0059467317,0.000103734914],"study_design_scores_gemma":[0.0014435623,0.000108223205,0.0000071007566,0.001595007,0.00022378824,0.00027531953,0.022679234,0.89608175,0.0029544514,0.007870056,0.06503459,0.0017269311],"about_ca_topic_score_codex":0.000018940731,"about_ca_topic_score_gemma":0.0000024262622,"teacher_disagreement_score":0.77272785,"about_ca_system_score_codex":0.00009348444,"about_ca_system_score_gemma":0.000016740352,"threshold_uncertainty_score":0.9998908},"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":"W2114080680","doi":"10.1155/2011/206930","title":"Cayley Graphs of Order <i>27p</i> Are Hamiltonian","year":2011,"lang":"lv","type":"article","venue":"International Journal of Combinatorics","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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.016780788610991342,"score_gpt":0.21359947469598076,"score_spread":0.19681868608498942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114080680","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.9403405,0.0051089693,0.0025368526,0.00016634115,0.028637966,0.00016558287,0.000080102094,0.000041385727,0.022922283],"genre_scores_gemma":[0.9985201,0.0006752198,0.00021677454,0.00004871938,0.00021230483,0.0000018562919,0.0000024256285,0.00004932885,0.0002732748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972056,0.00012893388,0.0012838459,0.0001480751,0.00096426776,0.00026923598],"domain_scores_gemma":[0.996028,0.00011191261,0.0012189264,0.0002707784,0.0021794117,0.0001909512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070317875,0.00029078382,0.00056574296,0.00060244504,0.000043705648,0.000048135968,0.0011829564,0.0002133238,0.0002155704],"category_scores_gemma":[0.0001484861,0.00028641216,0.00040928627,0.0004869728,0.0001114147,0.00036885572,0.000081683145,0.0005682796,0.000030434046],"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.0005085391,0.0014774416,0.06833214,0.00034956445,0.003488678,0.0010263451,0.0071882294,0.0009007226,0.0029128261,0.9078631,0.0042219395,0.0017304937],"study_design_scores_gemma":[0.0094235875,0.0016500792,0.089612536,0.004284556,0.0007658944,0.0021982754,0.004700646,0.0010311411,0.045420345,0.7986896,0.040503852,0.0017194687],"about_ca_topic_score_codex":0.000056554392,"about_ca_topic_score_gemma":0.000008187324,"teacher_disagreement_score":0.109173454,"about_ca_system_score_codex":0.00013811702,"about_ca_system_score_gemma":0.000109714274,"threshold_uncertainty_score":0.9999588},"labels":[],"label_agreement":null},{"id":"W2114661539","doi":"","title":"A note on the completion of partial latin squares","year":2004,"lang":"en","type":"article","venue":"","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 Manitoba","funders":"","keywords":"Latin square; Mathematics; Rectangle; Conjecture; Combinatorics; Square (algebra); Order (exchange); Geometry; Economics; Chemistry","score_opus":0.015030034057524667,"score_gpt":0.2053583098648937,"score_spread":0.19032827580736902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114661539","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.9641448,0.0000129726495,0.009268057,0.00013804308,0.00013382534,0.00007893067,0.0000024896035,0.00008957909,0.026131293],"genre_scores_gemma":[0.99986094,7.720333e-7,0.000039925613,0.000028058366,0.000028478631,0.0000052259684,8.640383e-7,0.000004640476,0.00003108837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997588,0.000014064642,0.00008061748,0.00003213882,0.000057599686,0.000056811023],"domain_scores_gemma":[0.9998456,0.000035786707,0.000008867273,0.00009354344,0.0000059903396,0.000010171028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080455335,0.000038368515,0.00005172235,0.000020317637,0.000020155514,0.0000043936648,0.000044003267,0.000017860182,0.000089206835],"category_scores_gemma":[0.000006004676,0.000023759254,0.000027766306,0.000066319044,0.000014969146,0.000013326259,0.0000029188677,0.00003602944,0.00005376819],"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.0000099480285,0.000015640522,0.000116020245,0.000022470484,0.000011445248,6.0190246e-7,0.00063798466,0.07778138,0.01725783,0.90353835,0.00022522677,0.00038308674],"study_design_scores_gemma":[0.001769178,0.0004216868,0.017390825,0.0003215428,0.000031233318,0.000007789762,0.0011619263,0.03834325,0.8344837,0.084344275,0.021192858,0.0005317243],"about_ca_topic_score_codex":0.000020244506,"about_ca_topic_score_gemma":0.000011056816,"teacher_disagreement_score":0.8191941,"about_ca_system_score_codex":0.000006352895,"about_ca_system_score_gemma":0.0000016125341,"threshold_uncertainty_score":0.097675234},"labels":[],"label_agreement":null},{"id":"W2114726141","doi":"10.1109/glocom.2008.ecp.496","title":"Time-Slotted Optical OV-CDMA Network Using a Fair QoS-Based Resource Management Algorithm","year":2008,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Quality of service; Computer science; Code division multiple access; Transmission (telecommunications); Computer network; Resource management (computing); Resource allocation; Power control; Scheme (mathematics); Power (physics); Algorithm; Class (philosophy); Telecommunications; Mathematics","score_opus":0.009530953802257276,"score_gpt":0.18178139553418304,"score_spread":0.17225044173192577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114726141","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.29411626,0.00045242722,0.51552284,0.0000647781,0.000965802,0.00081098365,0.000008614113,0.0026283355,0.18542995],"genre_scores_gemma":[0.92560124,0.000009574595,0.06896402,0.00032503594,0.00081035506,0.000027061926,0.00002945382,0.00012858147,0.0041046487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987411,0.00005625628,0.00028337605,0.00022914022,0.00022249582,0.0004676136],"domain_scores_gemma":[0.99942464,0.000054919812,0.000022176102,0.00034875126,0.000017486012,0.00013203024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022419391,0.00022049274,0.00023772368,0.000095490344,0.00016672815,0.000025388572,0.00017832464,0.00010351306,0.00025458584],"category_scores_gemma":[0.0000027569024,0.00021013129,0.000111810106,0.00038717952,0.00007711946,0.00006491935,0.000036729292,0.00014421591,0.00025871716],"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.00004106585,0.00008682529,0.00013330414,0.00013244574,0.00029391103,0.0004683933,0.00020632867,0.9518048,0.000763597,0.005492183,0.032451347,0.008125766],"study_design_scores_gemma":[0.0006366677,0.00003618643,0.00027719286,0.00008613508,0.000042064596,0.00006292703,0.00012256959,0.9624668,0.0007086115,0.00014962249,0.035013642,0.00039763376],"about_ca_topic_score_codex":0.0000049350665,"about_ca_topic_score_gemma":7.872327e-7,"teacher_disagreement_score":0.631485,"about_ca_system_score_codex":0.000054873788,"about_ca_system_score_gemma":0.0000068966997,"threshold_uncertainty_score":0.8568905},"labels":[],"label_agreement":null},{"id":"W2115812217","doi":"10.1016/j.ffa.2005.10.004","title":"Optical orthogonal codes and arcs in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"italic\">PG</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2005,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"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","keywords":"Mathematics; Simple (philosophy); Scroll; Algorithm; Discrete mathematics; Theology; Philosophy","score_opus":0.013348596356310975,"score_gpt":0.222142416080965,"score_spread":0.20879381972465402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115812217","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.9657664,0.0029782963,0.0052107316,0.0009784313,0.0012229766,0.0002431269,0.0015150394,0.00047262592,0.021612395],"genre_scores_gemma":[0.9884972,0.0020349412,0.0019795164,0.0010181349,0.0021797477,0.0023242,0.0011968131,0.00063899707,0.00013047423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99094737,0.00040643942,0.0024152645,0.0021953597,0.0015602269,0.0024753269],"domain_scores_gemma":[0.9928451,0.0022713211,0.0012647441,0.0021221337,0.00021197372,0.0012846832],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0020672577,0.0013327936,0.0007283771,0.0006514819,0.0019102783,0.0015633071,0.0018696077,0.003089187,0.0031902005],"category_scores_gemma":[0.0006168755,0.002058022,0.0014163438,0.0013773858,0.0014037781,0.0011803239,0.0013724873,0.0024754244,0.0013029272],"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.0007245786,0.0005696903,0.00006327623,0.0011943307,0.0015060272,0.00028341133,0.003326465,0.004592795,0.0017462511,0.9708098,0.0090510575,0.0061323056],"study_design_scores_gemma":[0.00795089,0.0042927396,0.0005608023,0.0044916947,0.0037554048,0.004110519,0.011472718,0.4350056,0.34337714,0.13790876,0.03959022,0.0074835136],"about_ca_topic_score_codex":0.001139768,"about_ca_topic_score_gemma":0.0014719763,"teacher_disagreement_score":0.83290106,"about_ca_system_score_codex":0.000035070436,"about_ca_system_score_gemma":0.0006832489,"threshold_uncertainty_score":0.9999423},"labels":[],"label_agreement":null},{"id":"W2115835796","doi":"10.1109/4234.917103","title":"Optical CDMA using 2-D codes: the optimal single-user detector","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"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":"Detector; Code division multiple access; Computer science; Bit error rate; Code (set theory); Upper and lower bounds; Dimension (graph theory); Code rate; Algorithm; Channel (broadcasting); Electronic engineering; Mathematics; Telecommunications; Decoding methods","score_opus":0.038797689614729756,"score_gpt":0.24606031573158815,"score_spread":0.2072626261168584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115835796","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.9572506,0.00045084418,0.037660066,0.0017037468,0.00038719372,0.00019647533,0.000005580766,0.00030480232,0.0020406877],"genre_scores_gemma":[0.99445313,0.00005185811,0.004746281,0.00053753005,0.00009760439,0.00004013271,0.000005043055,0.00003807708,0.000030352468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00014670065,0.00024930065,0.00011111887,0.00011910026,0.00026336656],"domain_scores_gemma":[0.99794084,0.00026946285,0.0000334052,0.0016694387,0.000027258002,0.000059602233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023894469,0.00014973886,0.00013901539,0.000073662864,0.0003296683,0.000087860564,0.0010507919,0.0000626723,0.000022907036],"category_scores_gemma":[0.000017330487,0.00012602961,0.00009208981,0.00029963045,0.0002534659,0.00013590392,0.00006989874,0.00030123655,0.00007500363],"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.000016740405,0.00009536755,0.00058154087,0.000024949357,0.00018901407,0.000010866177,0.001254238,0.11887381,0.8695231,0.0034802367,0.0033149375,0.0026351854],"study_design_scores_gemma":[0.0018783712,0.000117452524,0.0027327305,0.00044324587,0.0004224341,0.00092598854,0.0027710842,0.48471877,0.06826665,0.00041612118,0.43501085,0.0022962824],"about_ca_topic_score_codex":0.000014383269,"about_ca_topic_score_gemma":0.000025463298,"teacher_disagreement_score":0.8012565,"about_ca_system_score_codex":0.000075964956,"about_ca_system_score_gemma":0.0000066420016,"threshold_uncertainty_score":0.51393384},"labels":[],"label_agreement":null},{"id":"W2115859130","doi":"10.1007/s00493-005-0010-x","title":"List Colouring When The Chromatic Number Is Close To the Order Of The Graph","year":2004,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Graph; Order (exchange); Discrete mathematics","score_opus":0.005272078131285529,"score_gpt":0.19078437274404528,"score_spread":0.18551229461275975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115859130","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.981311,0.00044663495,0.00017905666,0.00216447,0.0014622862,0.00051959604,0.0000055650057,0.000109288136,0.013802076],"genre_scores_gemma":[0.99929845,0.000010682538,0.00002020548,0.0002324364,0.00003920019,0.000057957157,3.0463312e-7,0.000024748175,0.00031599682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991902,0.00006864823,0.0002153503,0.00010989772,0.00020751398,0.00020839447],"domain_scores_gemma":[0.99909925,0.00008387593,0.00004616095,0.0006797372,0.000047232905,0.000043720578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002534737,0.00013526464,0.00015466622,0.00002286919,0.00022829016,0.000035456636,0.0006496873,0.0000515572,0.00006802844],"category_scores_gemma":[0.000038086484,0.00006752262,0.00010984536,0.0005934356,0.00006681924,0.00004181604,0.000085412765,0.00018152593,0.00009678119],"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.00001524045,0.00019211728,0.004097581,0.00027319347,0.00032269614,0.00000597521,0.02674711,0.004470918,0.0020557728,0.9198275,0.04157763,0.0004142295],"study_design_scores_gemma":[0.0017170344,0.00012104424,0.016419616,0.00049524655,0.00017286054,0.000064532076,0.0019907795,0.0003805451,0.023554673,0.72852224,0.22585331,0.0007081089],"about_ca_topic_score_codex":0.000055585802,"about_ca_topic_score_gemma":0.00001632614,"teacher_disagreement_score":0.19130528,"about_ca_system_score_codex":0.00004983519,"about_ca_system_score_gemma":0.00001654453,"threshold_uncertainty_score":0.27534926},"labels":[],"label_agreement":null},{"id":"W2116093343","doi":"10.1109/jstqe.2007.897671","title":"Increasing the Capacity of SAC-OCDMA: Forward Error Correction or Coherent Sources?","year":2007,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Quantum Electronics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Forward error correction; Error detection and correction; Optics; Electronic engineering; Telecommunications; Algorithm; Physics; Decoding methods; Engineering","score_opus":0.015455652873628847,"score_gpt":0.23739406135043847,"score_spread":0.22193840847680962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116093343","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.98738635,0.0014088039,0.008881023,0.00004020804,0.0018885089,0.00016977187,0.00000143505,0.000038495986,0.00018541118],"genre_scores_gemma":[0.99911934,0.00028812586,0.000120384946,0.00002014283,0.00037550455,0.0000022484583,7.9047334e-7,0.000029146637,0.000044324905],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99792445,0.00019593281,0.00094199606,0.00010571189,0.0003405705,0.0004913278],"domain_scores_gemma":[0.99858826,0.00038245565,0.0004096883,0.00018435754,0.00035816492,0.00007707203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019290029,0.0001979048,0.00041378583,0.0002753543,0.000084982756,0.000025193478,0.00030483308,0.00017879733,0.000012752252],"category_scores_gemma":[0.0002816827,0.00014068386,0.00012854768,0.0009059471,0.00006270169,0.0001407007,0.000008590136,0.0010343429,0.000001157125],"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.0062911096,0.0012064533,0.05610455,0.0011820063,0.0022462176,0.00027585094,0.013910398,0.16008167,0.6992166,0.019647045,0.004086055,0.035752054],"study_design_scores_gemma":[0.0064361948,0.005108294,0.042733088,0.0018514047,0.0006283764,0.008867077,0.0048205922,0.19778222,0.67967576,0.018997278,0.031216694,0.0018830376],"about_ca_topic_score_codex":0.000043296677,"about_ca_topic_score_gemma":0.00075657363,"teacher_disagreement_score":0.03770054,"about_ca_system_score_codex":0.000346703,"about_ca_system_score_gemma":0.00014515205,"threshold_uncertainty_score":0.57369214},"labels":[],"label_agreement":null},{"id":"W2116339841","doi":"10.1109/glocom.1995.502784","title":"New correlator receiver architecture for optical CDMA networks with an increased system capacity","year":2002,"lang":"en","type":"article","venue":"","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code division multiple access; Electronic engineering; Computer science; Transmission (telecommunications); Bit error rate; Optical performance monitoring; Optical fiber; Optical power; Telecommunications; Channel (broadcasting); Wavelength-division multiplexing; Engineering; Physics; Optics","score_opus":0.009098503674452254,"score_gpt":0.1613840454236899,"score_spread":0.15228554174923764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116339841","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.29907227,0.00014102431,0.67632496,0.000017161685,0.0004729737,0.00054790656,0.000010012866,0.0009389085,0.022474758],"genre_scores_gemma":[0.99014217,0.0000013684473,0.00891622,0.000028864888,0.00030189956,0.00003721334,0.000007122546,0.000046448127,0.00051871745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915963,0.000038227667,0.000179462,0.00019941713,0.00011054391,0.00031270817],"domain_scores_gemma":[0.9992746,0.000097665135,0.000021218413,0.0002925076,0.000025739399,0.00028824844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013981365,0.00019930254,0.00023975282,0.000047988065,0.00008225934,0.000043014013,0.00014094735,0.00015921352,0.00016693416],"category_scores_gemma":[0.0000074297745,0.00014862008,0.00006736963,0.0001429546,0.000030477142,0.000092499715,0.000006141016,0.0001974033,0.000036741098],"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.0006873437,0.00014648544,0.002067963,0.0010444587,0.0006888402,0.00005682649,0.0017115766,0.67458594,0.0013198201,0.2706929,0.029982015,0.01701583],"study_design_scores_gemma":[0.0018083279,0.0004373782,0.0006790547,0.00021699454,0.00010354619,0.00024694978,0.000351644,0.98846215,0.0007233269,0.00036588433,0.0059566656,0.00064807374],"about_ca_topic_score_codex":0.00004864278,"about_ca_topic_score_gemma":0.00006094854,"teacher_disagreement_score":0.6910699,"about_ca_system_score_codex":0.000039256505,"about_ca_system_score_gemma":0.000004563405,"threshold_uncertainty_score":0.6060551},"labels":[],"label_agreement":null},{"id":"W2116601704","doi":"10.1145/3532737.3532745","title":"SIGACT News Complexity Theory Column 112","year":2022,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"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":"Blame; Column (typography); Completeness (order theory); Bit (key); Computer science; Operations research; Psychology; Mathematics; Telecommunications; Computer security; Social psychology","score_opus":0.027501235408923044,"score_gpt":0.2247213540626842,"score_spread":0.19722011865376116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116601704","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.93845624,0.0010282535,0.00080924947,0.00030569255,0.00252667,0.00066519366,0.00012770816,0.0011570097,0.054923974],"genre_scores_gemma":[0.99716586,0.000023249891,0.00016790503,0.00055498746,0.00024746306,0.0001470785,0.000051238236,0.000084269814,0.0015579714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979645,0.00044373545,0.00040645537,0.000327747,0.00033591528,0.0005216707],"domain_scores_gemma":[0.99817467,0.00040108562,0.000079695994,0.0011460411,0.000020797763,0.00017771157],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062108535,0.00029919966,0.00039326545,0.00013164335,0.00041502164,0.00007471431,0.00095207756,0.00008159363,0.0030908796],"category_scores_gemma":[0.00011190287,0.0003216308,0.00022553945,0.00044342005,0.00008897281,0.00018780066,0.00029857567,0.0005332197,0.00030537712],"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.0007861384,0.0008122534,0.025571732,0.0006703699,0.0014337982,0.00044787614,0.013692267,0.04231329,0.08927307,0.3904832,0.35339502,0.08112099],"study_design_scores_gemma":[0.0016301249,0.0003540925,0.004977931,0.000039743285,0.000101721205,0.00013791483,0.0073036454,0.0021311683,0.004365695,0.17719105,0.80035216,0.0014147526],"about_ca_topic_score_codex":0.00022244577,"about_ca_topic_score_gemma":0.00015370134,"teacher_disagreement_score":0.44695714,"about_ca_system_score_codex":0.00013476923,"about_ca_system_score_gemma":0.000031794123,"threshold_uncertainty_score":0.9999236},"labels":[],"label_agreement":null},{"id":"W2116924935","doi":"10.1016/s0012-365x(03)00272-3","title":"On group-divisible designs with block size four and group-type 6um1","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Group (periodic table); Block size; Block (permutation group theory); Type (biology); Class (philosophy); Spectrum (functional analysis); Construct (python library); Discrete mathematics; Automorphism group; Automorphism; Computer science","score_opus":0.01639847693871242,"score_gpt":0.20255324714007103,"score_spread":0.18615477020135862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116924935","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.9511483,0.00015131218,0.013165983,0.000013274007,0.00020581171,0.0003681854,0.0000076035303,0.0002575105,0.034682065],"genre_scores_gemma":[0.99293995,0.000017571536,0.006661768,0.00002484831,0.000021959437,0.000019195679,0.0000016053212,0.000064389744,0.00024871298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912757,0.00004051408,0.00021471138,0.0001693555,0.00017987822,0.0002679649],"domain_scores_gemma":[0.99916595,0.00023490688,0.00005596187,0.0004237588,0.000019186202,0.00010021794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027653898,0.00023385054,0.0002607367,0.00004402849,0.00013603388,0.000108690896,0.00013659512,0.000077805,0.000043900844],"category_scores_gemma":[0.00009252387,0.00017895772,0.00004267461,0.00013958842,0.000056444766,0.00009512368,0.000016187807,0.00013563909,0.00004033157],"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.000034328463,0.00010088647,0.0008600742,0.0010800111,0.00023233087,0.000045489465,0.0018620436,0.0015721458,0.0049915733,0.98855954,0.00052352186,0.00013806099],"study_design_scores_gemma":[0.007420957,0.0032233777,0.005499611,0.0033527864,0.0007838989,0.0009911829,0.00817166,0.06617604,0.015932558,0.87676,0.006606278,0.005081649],"about_ca_topic_score_codex":0.0000018206475,"about_ca_topic_score_gemma":0.000007201281,"teacher_disagreement_score":0.11179953,"about_ca_system_score_codex":0.000015478352,"about_ca_system_score_gemma":0.0000040104096,"threshold_uncertainty_score":0.72976846},"labels":[],"label_agreement":null},{"id":"W2117152550","doi":"10.1016/j.disc.2010.03.019","title":"Strong embeddings of minimum genus","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"American Roentgen Ray Society","keywords":"Genus; Mathematics; Combinatorics; Biology; Zoology","score_opus":0.007247097993559703,"score_gpt":0.21757489133790484,"score_spread":0.21032779334434512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117152550","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.960391,0.000041258383,0.0059330165,0.0000050484828,0.0003979852,0.000105295796,0.000017313605,0.00012647317,0.03298264],"genre_scores_gemma":[0.9961263,0.0000022218392,0.0036004325,0.0000022355453,0.000051173465,0.000008627748,0.0000034305758,0.000029223147,0.00017635473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939495,0.0000062987447,0.00025510456,0.00007003349,0.00011719645,0.00015640384],"domain_scores_gemma":[0.99954224,0.000050053848,0.000050265462,0.00028683728,0.000020701376,0.00004991687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016097646,0.0001123246,0.00019024457,0.000048189355,0.000022946226,0.000015427504,0.00016338438,0.000070896655,0.00011107713],"category_scores_gemma":[0.000026141504,0.00009879909,0.000077878896,0.00008506987,0.000046788206,0.00005675328,0.000018194387,0.00013730467,0.00004061971],"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.0000064524897,0.00008021524,0.0005038069,0.0021940689,0.00020079549,0.000008767173,0.010714882,0.0008797506,0.35583997,0.6266569,0.001355583,0.0015587982],"study_design_scores_gemma":[0.0017954154,0.00020386385,0.0009335996,0.0007922224,0.00033894443,0.00017808944,0.013340439,0.43998557,0.3824654,0.14131744,0.016486801,0.002162237],"about_ca_topic_score_codex":0.0000011565703,"about_ca_topic_score_gemma":0.0000031375282,"teacher_disagreement_score":0.48533946,"about_ca_system_score_codex":0.000003759747,"about_ca_system_score_gemma":0.0000037431168,"threshold_uncertainty_score":0.402891},"labels":[],"label_agreement":null},{"id":"W2118264190","doi":"10.1016/j.laa.2006.12.018","title":"Spectrally arbitrary patterns: Reducibility and the 2n conjecture for n=5","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Sign (mathematics); Mathematics; Counterexample; Conjecture; Converse; Combinatorics; Matrix (chemical analysis); Spectrum (functional analysis); Pure mathematics; Geometry; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.006290351665928973,"score_gpt":0.218329590273513,"score_spread":0.21203923860758403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118264190","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.92560506,0.0033966983,0.06679458,0.0004657913,0.00008588614,0.0014181683,0.00007531126,0.00017406793,0.0019844652],"genre_scores_gemma":[0.9989199,0.0001334798,0.00030115433,0.00014239665,0.00021963296,0.00017309496,0.000016474522,0.00001424453,0.00007963032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947965,0.000012623359,0.00016549953,0.00016096613,0.00004198798,0.00013925054],"domain_scores_gemma":[0.9995261,0.00018924884,0.000020527956,0.00019819719,0.000018211576,0.00004772139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037419007,0.000093101495,0.00011436401,0.000023825773,0.00013027932,0.000023048708,0.00007707809,0.00005970105,0.000009127073],"category_scores_gemma":[0.000011024733,0.000065574925,0.00003847806,0.0000793528,0.000059134032,0.000042890733,0.00001076661,0.00010363696,0.000003925835],"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.00008799199,0.00003620883,0.0005296825,0.0003529939,0.00009844855,6.004856e-7,0.0011576081,0.000047407557,0.0032952756,0.9846864,0.0003409465,0.009366434],"study_design_scores_gemma":[0.008711221,0.00030585253,0.049867082,0.00017100274,0.0004371275,0.0002384638,0.0026299632,0.04093527,0.06993156,0.58210367,0.24282636,0.001842435],"about_ca_topic_score_codex":0.0000026906512,"about_ca_topic_score_gemma":0.000011536738,"teacher_disagreement_score":0.40258273,"about_ca_system_score_codex":0.0000044428357,"about_ca_system_score_gemma":0.000004172039,"threshold_uncertainty_score":0.2674068},"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":"W2118881668","doi":"10.1109/avfop.2007.4365731","title":"Novel Secure Platform for Avionic Applications Based on Optical CDMA","year":2007,"lang":"en","type":"article","venue":"","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":"Lockheed Martin (Canada)","funders":"","keywords":"Testbed; Code division multiple access; Computer science; Bit error rate; Transmitter; Transmission (telecommunications); Code (set theory); Avionics; Embedded system; Computer network; Engineering; Telecommunications; Programming language; Channel (broadcasting)","score_opus":0.011868493978242542,"score_gpt":0.2257704763747589,"score_spread":0.21390198239651634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118881668","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.01294667,0.000014827391,0.9301003,0.00002308747,0.00013086392,0.00042291428,0.000013379835,0.000284656,0.056063276],"genre_scores_gemma":[0.99395984,3.7767649e-7,0.005412121,0.000093984745,0.00010544862,0.00014324172,0.000019517394,0.000020550699,0.00024493475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948436,0.000001019356,0.00014178455,0.00010103706,0.000074745156,0.00019702801],"domain_scores_gemma":[0.9995794,0.00014243994,0.000009008761,0.00018005625,0.000018271397,0.000070808455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022074395,0.00008825567,0.00008098208,0.00006137591,0.000056558576,0.000013792791,0.00008546362,0.000082934355,0.000049652583],"category_scores_gemma":[0.0000041674803,0.00007775702,0.00006399739,0.000112413814,0.000013685184,0.00003522461,0.000003472169,0.000077265344,0.00006303781],"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.000036031288,0.00009003352,0.000035904675,0.000093225135,0.000020547905,6.1421906e-7,0.000042584285,0.011991545,0.012189172,0.96907395,0.00065784395,0.005768529],"study_design_scores_gemma":[0.004339856,0.0004088014,0.0024907263,0.00011678857,0.00008398909,0.000034665052,0.0007386537,0.5689776,0.09828423,0.01768964,0.3055128,0.0013222962],"about_ca_topic_score_codex":9.0867246e-7,"about_ca_topic_score_gemma":0.000011345853,"teacher_disagreement_score":0.9810132,"about_ca_system_score_codex":0.000028469472,"about_ca_system_score_gemma":0.0000057914963,"threshold_uncertainty_score":0.3170839},"labels":[],"label_agreement":null},{"id":"W2119055371","doi":"10.13001/1081-3810.1302","title":"Generating potentially nilpotent full sign patterns","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","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":"Redeemer University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics","keywords":"Sign (mathematics); Nilpotent; Mathematics; Nilpotent matrix; Nilpotent group; Matrix (chemical analysis); Construct (python library); Pure mathematics; Computer science; Physics; Mathematical analysis; Square matrix; Eigenvalues and eigenvectors; Symmetric matrix; Chemistry","score_opus":0.004609314179226482,"score_gpt":0.1954632527866797,"score_spread":0.19085393860745323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119055371","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.87180376,0.0032711462,0.123916656,0.00013667943,0.00044394372,0.00007424275,0.0000015767039,0.000070674,0.00028133663],"genre_scores_gemma":[0.998083,0.00024334401,0.0005123632,0.00011450473,0.00094677554,8.184757e-7,0.0000022384834,0.00002739997,0.00006956883],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984638,0.000074676806,0.00055540353,0.00009996263,0.00026492873,0.0005412011],"domain_scores_gemma":[0.99948233,0.000023092038,0.00015172057,0.00015091873,0.00008428039,0.000107635875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063123566,0.00017780182,0.00027666424,0.00013508547,0.00007716516,0.00004294277,0.00025451643,0.00008145912,0.00007073084],"category_scores_gemma":[0.000016840464,0.00015685614,0.00021003112,0.0001424772,0.000009863057,0.0001708574,0.000007499185,0.00057834765,0.000022235665],"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.00021546701,0.0002483487,0.00033268114,0.00010587235,0.0009029341,0.0003089245,0.0011489941,0.22412096,0.6282273,0.033555113,0.0016689218,0.10916447],"study_design_scores_gemma":[0.016791211,0.023264105,0.007814016,0.0020849032,0.0015011717,0.019313205,0.0028923908,0.33067483,0.37937397,0.151469,0.05815635,0.0066648554],"about_ca_topic_score_codex":0.0000011864175,"about_ca_topic_score_gemma":0.000004676902,"teacher_disagreement_score":0.24885336,"about_ca_system_score_codex":0.00010050852,"about_ca_system_score_gemma":0.00007698493,"threshold_uncertainty_score":0.63964075},"labels":[],"label_agreement":null},{"id":"W2119307154","doi":"10.1016/j.ejc.2012.10.008","title":"Resolving sets for Johnson and Kneser graphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Indifference graph; Discrete mathematics; Metric dimension; 1-planar graph; Graph","score_opus":0.014346862872492924,"score_gpt":0.21398185471597825,"score_spread":0.19963499184348532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119307154","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.9746955,0.009003851,0.0030688602,0.000025524592,0.0029270062,0.000085718995,0.000002322406,0.00004805528,0.0101431385],"genre_scores_gemma":[0.9993406,0.00017975496,0.00023128222,0.000013402812,0.0001388631,5.745907e-7,4.018267e-7,0.0000400431,0.000055096836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992047,0.00013945,0.0002924904,0.00004268847,0.00011503204,0.00020562268],"domain_scores_gemma":[0.9994904,0.00008494712,0.000099127494,0.00009758443,0.0000745959,0.00015336128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014460542,0.00010331728,0.00016140853,0.000121075194,0.000063024345,0.000032931315,0.000127844,0.00002012623,0.000004252225],"category_scores_gemma":[0.000053655865,0.000090773494,0.00007955422,0.0001243799,0.00001788786,0.00023821292,0.00001651191,0.00015907519,0.000005668463],"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.00031443598,0.0005063815,0.07604633,0.0016865467,0.0009204532,0.00028332943,0.0111714965,0.0011715791,0.013670051,0.74950296,0.110032074,0.03469434],"study_design_scores_gemma":[0.006356277,0.0013103482,0.086414784,0.00072151853,0.00028422862,0.0014818304,0.0012107918,0.0014014065,0.0038682516,0.05898854,0.83669555,0.001266477],"about_ca_topic_score_codex":7.3794446e-8,"about_ca_topic_score_gemma":2.952265e-8,"teacher_disagreement_score":0.7266635,"about_ca_system_score_codex":0.000015530664,"about_ca_system_score_gemma":0.0000034264133,"threshold_uncertainty_score":0.37016356},"labels":[],"label_agreement":null},{"id":"W2120043069","doi":"10.1109/jlt.2005.856251","title":"2-D optical CDMA networks using MWPM, double hard limiters and modified carrier-hopping prime sequences","year":2005,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","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":"McGill University","funders":"","keywords":"Code division multiple access; Electronic engineering; Modulation (music); Interference (communication); Computer science; Prime (order theory); Limiter; Bit error rate; Demodulation; Wavelength-division multiplexing; Broadband; Optical communication; Code (set theory); Telecommunications; Physics; Engineering; Optics; Wavelength; Mathematics; Decoding methods; Channel (broadcasting)","score_opus":0.01857462231687128,"score_gpt":0.22468566332131598,"score_spread":0.2061110410044447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120043069","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.9809377,0.0031804102,0.013796439,0.0004904142,0.0005519733,0.000096291806,9.4852226e-7,0.00016407312,0.0007817268],"genre_scores_gemma":[0.99508244,0.00014071583,0.004375626,0.000033505567,0.00031663018,0.0000023862872,3.0959575e-7,0.000026841177,0.000021526974],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987582,0.000025575833,0.0005590188,0.00014156553,0.00014689997,0.0003687396],"domain_scores_gemma":[0.999402,0.000044442193,0.00017342482,0.00018524507,0.0000783329,0.00011654867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038690367,0.00019287334,0.00041884207,0.0005036297,0.00008916849,0.00005105077,0.0002470266,0.00035989215,0.000009356788],"category_scores_gemma":[0.000017869563,0.00016707064,0.000098489174,0.00033635023,0.00017401954,0.00026531663,0.000044413886,0.0005667128,0.0000021424637],"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.00032155408,0.00011470035,0.011161252,0.0002104893,0.0012575001,0.00051107095,0.0011104651,0.38455588,0.49279293,0.08002463,0.00054720475,0.027392332],"study_design_scores_gemma":[0.0060246396,0.0010558679,0.0012198224,0.0015062179,0.0005546678,0.010247262,0.0017011939,0.59333634,0.35561427,0.011027934,0.015834022,0.0018777542],"about_ca_topic_score_codex":0.0000012506732,"about_ca_topic_score_gemma":0.0000029010857,"teacher_disagreement_score":0.20878045,"about_ca_system_score_codex":0.00009075763,"about_ca_system_score_gemma":0.000022972836,"threshold_uncertainty_score":0.68129426},"labels":[],"label_agreement":null},{"id":"W2120626205","doi":"10.1109/jlt.2008.927795","title":"An Innovative Receiver for Incoherent SAC-OCDMA Enabling SOA-Based Noise Cleaning: Experimental Validation","year":2009,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"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é Laval","funders":"McGill University","keywords":"Noise (video); Electronic engineering; Computer science; Filter (signal processing); Noise reduction; Signal-to-noise ratio (imaging); Optical amplifier; Optical filter; Telecommunications; Electrical engineering; Engineering; Physics; Laser; Artificial intelligence; Optics","score_opus":0.011910541913373873,"score_gpt":0.25995030006778064,"score_spread":0.24803975815440676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120626205","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.97607535,0.00036872778,0.021840643,0.00034570447,0.0005054427,0.00024058802,0.000003796095,0.00021820987,0.0004015636],"genre_scores_gemma":[0.9957832,0.0000068122536,0.0039038889,0.00007517014,0.00018004884,0.0000112363405,0.000005082522,0.000024934043,0.000009645267],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887747,0.000038849692,0.0005659332,0.00013303795,0.00014661324,0.00023807696],"domain_scores_gemma":[0.99915206,0.000043107906,0.00027964375,0.00019950754,0.00026683573,0.000058853064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038206702,0.00017685613,0.00031961311,0.00075341976,0.00008021567,0.000031439293,0.00026627,0.00023873961,0.000023031273],"category_scores_gemma":[0.00004618496,0.00015907316,0.00008946968,0.0005747321,0.00004545585,0.00026629618,0.000007816427,0.0002957343,0.000004191173],"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.0001895358,0.00021436677,0.00031982918,0.000025617483,0.00008499583,0.000025676234,0.0005931598,0.0040288577,0.97410023,0.012573214,0.0005806169,0.0072638695],"study_design_scores_gemma":[0.001151825,0.0015158468,0.00012586646,0.00009998793,0.000019831767,0.000085959255,0.0008823611,0.0017275215,0.98464185,0.0050332067,0.004517388,0.00019835126],"about_ca_topic_score_codex":4.5864962e-7,"about_ca_topic_score_gemma":4.089023e-7,"teacher_disagreement_score":0.019707857,"about_ca_system_score_codex":0.00013346515,"about_ca_system_score_gemma":0.000039177427,"threshold_uncertainty_score":0.6486815},"labels":[],"label_agreement":null},{"id":"W2121251253","doi":"10.1109/jstqe.2007.897604","title":"Sequence-Inversion-Keyed Optical CDMA Coding/Decoding Scheme Using an Electrooptic Phase Modulator and Fiber Bragg Grating Arrays","year":2007,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Quantum Electronics","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 Ottawa","funders":"","keywords":"Fiber Bragg grating; Decoding methods; Encoder; Computer science; Optics; Optical filter; Code division multiple access; Optical fiber; Electronic engineering; Telecommunications; Physics; Engineering","score_opus":0.02775773181131269,"score_gpt":0.28743826501424025,"score_spread":0.25968053320292755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121251253","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.9740945,0.0012459934,0.023832435,0.000024082345,0.0004710949,0.00016299207,0.0000022251356,0.00007907372,0.00008757124],"genre_scores_gemma":[0.99318266,0.00025636252,0.0059859124,0.000031440068,0.00046859813,0.0000014337159,0.0000033078645,0.000058333677,0.0000119519345],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972998,0.00010455611,0.0010091097,0.00025497706,0.00038770575,0.0009438402],"domain_scores_gemma":[0.9987455,0.00017623788,0.00027461885,0.00020388166,0.00033261426,0.0002671646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013471587,0.00033329253,0.0005363367,0.00051026413,0.0001761587,0.00010128803,0.00028057816,0.00027932037,0.000014303138],"category_scores_gemma":[0.00017411631,0.00034138185,0.00010179002,0.0008957588,0.00007034785,0.00056115206,0.000014444997,0.0013249699,0.0000012920248],"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.00015079329,0.00016639699,0.0004581447,0.00013163047,0.00014704085,0.00017672182,0.00056257204,0.009831612,0.9743097,0.01025087,0.000021278878,0.0037932508],"study_design_scores_gemma":[0.0019937498,0.0008955341,0.00007828834,0.00030578827,0.00007223928,0.0009933155,0.00021269816,0.81040055,0.18034624,0.00394297,0.00024531782,0.00051329564],"about_ca_topic_score_codex":0.000005824292,"about_ca_topic_score_gemma":0.000038971608,"teacher_disagreement_score":0.80056894,"about_ca_system_score_codex":0.0005554425,"about_ca_system_score_gemma":0.0001996806,"threshold_uncertainty_score":0.9999038},"labels":[],"label_agreement":null},{"id":"W2122077663","doi":"10.1109/ismvl.1998.679516","title":"On partial clones containing all idempotent partial operations","year":2002,"lang":"en","type":"article","venue":"","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":"Royal Military College of Canada","funders":"","keywords":"Idempotence; clone (Java method); Combinatorics; Set (abstract data type); Mathematics; Discrete mathematics; Partial function; Pure mathematics; Computer science; Biology; Genetics; Programming language","score_opus":0.026051904785939845,"score_gpt":0.21933439607457056,"score_spread":0.1932824912886307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122077663","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.94610214,0.00021007648,0.012958787,0.00028051698,0.0009836638,0.0002247659,0.0000063062885,0.0007109465,0.03852277],"genre_scores_gemma":[0.9989224,0.000012659513,0.00007981568,0.00020807638,0.0001717764,0.000042357296,0.000004486178,0.000017888937,0.00054053473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993305,0.000039466682,0.0001988625,0.00011915611,0.00009763845,0.00021436447],"domain_scores_gemma":[0.9997062,0.000040496037,0.0000074665923,0.00015560452,0.0000115328,0.00007868902],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011066358,0.000114272916,0.000121850324,0.000039684797,0.00008095281,0.000046256733,0.00007561835,0.00005527497,0.0010716711],"category_scores_gemma":[0.000011091827,0.00009936996,0.000058566075,0.00006120052,0.000016138565,0.00009164367,0.00000810102,0.0000941423,0.00062794157],"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.000036403846,0.00009884193,0.00028933326,0.000023814197,0.00016114675,0.00003165445,0.0019154807,0.4152828,0.007489685,0.56031793,0.011606838,0.0027461157],"study_design_scores_gemma":[0.0009974196,0.0002925617,0.00025290906,0.00004692113,0.000039708477,0.000024521665,0.00045756216,0.9132128,0.018359503,0.0012404867,0.06450257,0.0005730676],"about_ca_topic_score_codex":0.000014357926,"about_ca_topic_score_gemma":0.000024254408,"teacher_disagreement_score":0.55907744,"about_ca_system_score_codex":0.0000151026015,"about_ca_system_score_gemma":0.0000014382381,"threshold_uncertainty_score":0.9998415},"labels":[],"label_agreement":null},{"id":"W2122086768","doi":"10.1109/icc.2008.232","title":"Aperiodic Correlation of Complex Sequences from Difference Sets","year":2008,"lang":"en","type":"article","venue":"","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":"Lakehead University","funders":"","keywords":"Aperiodic graph; Sequence (biology); Correlation; Set (abstract data type); Mathematics; Difference set; Combinatorics; Algorithm; Computer science; Geometry; Chemistry","score_opus":0.02646077434565515,"score_gpt":0.20293668243125842,"score_spread":0.17647590808560326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122086768","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.98174876,0.00012398207,0.006116708,0.000003965789,0.00017207497,0.000046549612,0.0000125427205,0.0001232512,0.01165219],"genre_scores_gemma":[0.9995443,0.000017080358,0.00025374672,0.000008760083,0.000013383204,0.0000030880224,0.000017218728,0.000005117554,0.00013730401],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996429,0.000017967854,0.00013368127,0.00006113999,0.00007524028,0.00006903243],"domain_scores_gemma":[0.99980396,0.000043644854,0.000017899374,0.00009919019,0.000011422736,0.00002389644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000025219268,0.000060767605,0.00010806336,0.00002574108,0.000034568344,0.0000037681634,0.000055105975,0.00003507081,0.000337591],"category_scores_gemma":[0.0000037031905,0.000051702198,0.000027084368,0.00006900372,0.000051532796,0.000042748816,0.000005183403,0.000039165232,0.000042780724],"study_design_candidate":"observational","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.000039070303,0.00009120865,0.30659434,0.00020520929,0.00023157809,0.000060312184,0.012172799,0.03576321,0.5998345,0.03380991,0.0031831576,0.008014706],"study_design_scores_gemma":[0.00041945613,0.000051166066,0.7833209,0.000067773835,0.000015440173,0.000051373758,0.00051160087,0.19423205,0.013312022,0.0068632057,0.0008206514,0.00033434466],"about_ca_topic_score_codex":0.00010759954,"about_ca_topic_score_gemma":0.000016108554,"teacher_disagreement_score":0.58652246,"about_ca_system_score_codex":0.0000061960313,"about_ca_system_score_gemma":0.0000038786343,"threshold_uncertainty_score":0.36963847},"labels":[],"label_agreement":null},{"id":"W2122380585","doi":"10.1109/jlt.2005.857766","title":"Optical CDMA detection by basis selection","year":2005,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","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":"University of Ottawa","funders":"","keywords":"Code division multiple access; Detector; Computer science; Detection theory; Selection (genetic algorithm); Electronic engineering; Multiuser detection; Algorithm; Basis (linear algebra); Computational complexity theory; Code (set theory); Signal-to-noise ratio (imaging); Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.0025229007966380496,"score_gpt":0.17759940548092668,"score_spread":0.17507650468428862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122380585","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.9625049,0.00088477466,0.03308906,0.00067071384,0.0005450537,0.000056566878,0.0000010097347,0.0002983904,0.001949481],"genre_scores_gemma":[0.99845886,0.000054475495,0.0011303717,0.00001738916,0.00024287449,0.0000031561929,2.0158262e-7,0.000018045914,0.0000746381],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992456,0.000019163366,0.00036724444,0.00007154368,0.00011457007,0.00018187934],"domain_scores_gemma":[0.9996621,0.000024006711,0.00009546408,0.00009174576,0.00007558462,0.000051105235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021862968,0.000105104045,0.00020182092,0.00043965253,0.000045338544,0.000013400108,0.00013538211,0.00026705986,0.000049393973],"category_scores_gemma":[0.000032561955,0.00009302142,0.000081556005,0.0003967518,0.000039301813,0.00015017584,0.000009210825,0.00040633016,0.00004245583],"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.000034016186,0.000062893254,0.00047666192,0.000022105954,0.00014872567,0.000013688276,0.000059481827,0.0011360709,0.87082934,0.0043857316,0.0040318747,0.11879941],"study_design_scores_gemma":[0.00032864398,0.00026162114,0.000103901024,0.000021554375,0.000032417818,0.0013258763,0.00006274766,0.0026039118,0.91889143,0.00190989,0.07433145,0.00012653749],"about_ca_topic_score_codex":3.879098e-7,"about_ca_topic_score_gemma":0.000006608826,"teacher_disagreement_score":0.11867287,"about_ca_system_score_codex":0.00010240095,"about_ca_system_score_gemma":0.00000623566,"threshold_uncertainty_score":0.37933034},"labels":[],"label_agreement":null},{"id":"W2123169012","doi":"10.1216/rmjm/1020171574","title":"Improved Upper and Lower Bounds for the Difference $A_n-G_n$","year":2001,"lang":"en","type":"article","venue":"Rocky Mountain Journal of Mathematics","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 Guelph","funders":"","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Mathematical analysis","score_opus":0.010039361335829394,"score_gpt":0.2159674657683748,"score_spread":0.20592810443254542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123169012","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.7581478,0.001492969,0.23920938,0.00012158982,0.0004763802,0.00020695194,0.000004668825,0.000028703913,0.0003115649],"genre_scores_gemma":[0.99717927,0.00024965496,0.0019350022,0.000035693956,0.00019621069,0.000010159678,2.7818888e-7,0.00002889506,0.0003648399],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991731,0.000018484461,0.00040921153,0.000058239297,0.0001434763,0.0001975047],"domain_scores_gemma":[0.99909943,0.000429787,0.00013913748,0.0001738032,0.00008746264,0.00007038686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766913,0.00014361733,0.00024878822,0.00006250655,0.00011833895,0.000081972226,0.00022070791,0.00006375792,0.00002152841],"category_scores_gemma":[0.00008426493,0.00008871975,0.00011242763,0.00008388093,0.000036132296,0.0000928457,0.00002468025,0.00017131215,0.0000021944452],"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.0016554256,0.003002332,0.019913075,0.012777211,0.008403689,0.00036599775,0.07737017,0.019730987,0.36213773,0.27755934,0.021745546,0.19533849],"study_design_scores_gemma":[0.005864969,0.0016151291,0.003867411,0.0014971277,0.0010991502,0.006052862,0.018443339,0.5747181,0.010988612,0.32556766,0.04862236,0.0016632454],"about_ca_topic_score_codex":0.000001099695,"about_ca_topic_score_gemma":0.0000033487022,"teacher_disagreement_score":0.55498713,"about_ca_system_score_codex":0.000029107861,"about_ca_system_score_gemma":0.00001251569,"threshold_uncertainty_score":0.36178866},"labels":[],"label_agreement":null},{"id":"W2123619920","doi":"10.1109/leos.2006.279120","title":"Simulation of Real SAC-OCDMA under Both S-ALOHA and R3T Random Access Protocols","year":2006,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Aloha; Code division multiple access; Computer science; Transmitter; Coding (social sciences); Protocol (science); Throughput; Spread spectrum; Computer network; Algorithm; Telecommunications; Mathematics; Statistics; Wireless","score_opus":0.017496021246376815,"score_gpt":0.2758752350355019,"score_spread":0.25837921378912504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123619920","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.859877,0.00005952076,0.06459568,0.0000118342905,0.00010081396,0.0081904875,0.000006739342,0.00032785354,0.06683009],"genre_scores_gemma":[0.99894446,0.0000016517783,0.00006010895,0.000005785971,0.00005317829,0.0005824779,0.0000038832177,0.0000147746405,0.00033367806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945617,0.00003163376,0.00022105618,0.00009169646,0.00008937013,0.00011007067],"domain_scores_gemma":[0.9996932,0.00010326764,0.00003158295,0.00012736209,0.000019662759,0.00002490588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015512362,0.00009082682,0.00016267791,0.000053824442,0.00002709003,0.000037363276,0.00007002935,0.000060451675,0.000055264747],"category_scores_gemma":[0.0000045014976,0.000076309625,0.000033753055,0.000100697034,0.000023563822,0.0001729897,0.000012409195,0.000040100367,0.000003040825],"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.00009489998,0.000026124473,0.0062222336,0.000247793,0.000028898381,0.0000010039727,0.00007237217,0.96634156,0.005112583,0.020954786,0.0002514223,0.00064632756],"study_design_scores_gemma":[0.010479245,0.00013831211,0.09650417,0.00030086306,0.000057510555,0.000007201411,0.00022033934,0.80172867,0.030416355,0.05505747,0.004293631,0.0007962471],"about_ca_topic_score_codex":0.00011397987,"about_ca_topic_score_gemma":0.000055028053,"teacher_disagreement_score":0.16461289,"about_ca_system_score_codex":0.000009408191,"about_ca_system_score_gemma":0.0000041343787,"threshold_uncertainty_score":0.3111816},"labels":[],"label_agreement":null},{"id":"W2124170870","doi":"10.1016/j.disc.2012.02.025","title":"Friendship 3-hypergraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Friendship; Combinatorics; Discrete mathematics; Social psychology; Psychology","score_opus":0.011234086696318393,"score_gpt":0.20991442903738364,"score_spread":0.19868034234106524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124170870","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.63017,0.0011845628,0.015008567,0.000013943174,0.00096219924,0.00017560094,0.00001659772,0.0006737347,0.3517948],"genre_scores_gemma":[0.99809194,0.000010111753,0.0015940685,0.000013631245,0.00012279663,0.00001954875,0.000004981599,0.00003710723,0.00010579837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993213,0.0000143477255,0.00018375926,0.000056188994,0.00011923343,0.00030520296],"domain_scores_gemma":[0.99955285,0.000045583944,0.000021969612,0.000260794,0.000009131329,0.00010969832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021565057,0.00013147989,0.00015302193,0.000052899446,0.00004022898,0.000021421303,0.00012094245,0.000059030568,0.00011892272],"category_scores_gemma":[0.00001602346,0.00011070204,0.00008112174,0.0001415329,0.000025701524,0.00014145054,0.0000146873035,0.00008616816,0.0003143033],"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.0000015057348,0.000047683257,0.001721521,0.00042822488,0.00007906822,0.0000016081636,0.0043479665,0.00015659622,0.0027431843,0.98885065,0.0012075842,0.00041438174],"study_design_scores_gemma":[0.002593021,0.00020617331,0.008484659,0.0011393597,0.00066101586,0.0005378445,0.031337276,0.07574096,0.08359948,0.56746846,0.22227332,0.0059584337],"about_ca_topic_score_codex":5.163022e-7,"about_ca_topic_score_gemma":3.5407308e-7,"teacher_disagreement_score":0.42138222,"about_ca_system_score_codex":0.000010124095,"about_ca_system_score_gemma":0.0000014951725,"threshold_uncertainty_score":0.4514298},"labels":[],"label_agreement":null},{"id":"W2125862453","doi":"10.1016/s0012-365x(01)00466-6","title":"On the injective chromatic number of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds pour la Formation de Chercheurs et l'Aide à la Recherche; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Injective function; Mathematics; Chromatic scale; Combinatorics; Graph; Discrete mathematics; Monomorphism; Upper and lower bounds; Hypercube; Critical graph; Context (archaeology); Line graph; Voltage graph","score_opus":0.012410563887565994,"score_gpt":0.2081247982007641,"score_spread":0.1957142343131981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125862453","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.86098725,0.00006517881,0.001216257,0.000023718922,0.000118232485,0.00020643242,0.000011243241,0.000109140645,0.13726257],"genre_scores_gemma":[0.9994625,0.000009270313,0.00025481798,0.00001620082,0.000011640926,0.000026174914,8.1265057e-7,0.000025523364,0.00019309849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937844,0.00003230634,0.0002329543,0.00006576638,0.00015617652,0.00013434568],"domain_scores_gemma":[0.99930423,0.00026912097,0.00005283195,0.00033127045,0.000015883781,0.000026634974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537699,0.00012473819,0.00018356851,0.00003453094,0.000043270124,0.00001448844,0.00016555985,0.00004279061,0.0005825274],"category_scores_gemma":[0.0000473065,0.00007834503,0.00009744853,0.00019038477,0.000060904258,0.000037182068,0.000012025276,0.00009728389,0.0002921654],"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.0000012864303,0.000052139916,0.000057759542,0.00041720088,0.00011853923,0.000001828376,0.008427766,0.00041304014,0.0005491009,0.9877007,0.002143387,0.00011724553],"study_design_scores_gemma":[0.0003036033,0.000068690344,0.00014756012,0.0005754982,0.00007313305,0.00003898844,0.0038390004,0.11980241,0.0071757296,0.86740977,0.00018535135,0.0003802759],"about_ca_topic_score_codex":9.683943e-7,"about_ca_topic_score_gemma":5.591323e-7,"teacher_disagreement_score":0.13847522,"about_ca_system_score_codex":0.000009954559,"about_ca_system_score_gemma":9.089104e-7,"threshold_uncertainty_score":0.6378267},"labels":[],"label_agreement":null},{"id":"W2126337683","doi":"10.37236/1777","title":"Class-Uniformly Resolvable Group Divisible Structures II: Frames.","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"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; Mitacs","keywords":"Mathematics; Class (philosophy); Closure (psychology); Combinatorics; Group (periodic table); Frame (networking); Type (biology); Resolution (logic); Discrete mathematics; Lambda; Computer science","score_opus":0.003767506700162956,"score_gpt":0.18282210849146194,"score_spread":0.17905460179129898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126337683","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.9645429,0.014832345,0.013732931,0.0002599318,0.0016770441,0.00015757584,0.0000015765897,0.00010958238,0.0046861167],"genre_scores_gemma":[0.99890643,0.0007098556,0.000014856981,0.000042231397,0.00015365364,0.0000025297466,8.7020106e-7,0.000038266713,0.0001313275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983962,0.000060204286,0.00043926746,0.00008340955,0.00038371724,0.0006371881],"domain_scores_gemma":[0.9992763,0.00006538226,0.00017235785,0.00030409262,0.000091105714,0.000090774905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008851794,0.00019849803,0.00029897396,0.00013466415,0.00025876245,0.00005673189,0.0006357008,0.000115592506,0.000017855971],"category_scores_gemma":[0.00002893964,0.00013650124,0.00016866159,0.00045346064,0.000056902343,0.0002417653,0.000040249768,0.0010939761,0.000007954015],"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.000026417409,0.000040766587,0.00004003197,0.00002328129,0.00014012751,0.000008062722,0.00037710214,0.014417953,0.0009939182,0.9832119,0.00052488846,0.00019556102],"study_design_scores_gemma":[0.0009824757,0.0006084017,0.00016713835,0.00004333674,0.00004802712,0.00025220195,0.0001848664,0.00014163519,0.0035280113,0.9733207,0.020555025,0.00016813821],"about_ca_topic_score_codex":0.000007663534,"about_ca_topic_score_gemma":0.0000075799617,"teacher_disagreement_score":0.034363512,"about_ca_system_score_codex":0.00038722277,"about_ca_system_score_gemma":0.00013153431,"threshold_uncertainty_score":0.5566359},"labels":[],"label_agreement":null},{"id":"W2126578673","doi":"10.1109/68.998735","title":"Design and performance of 2-D codes for wavelength-time optical CDMA","year":2002,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Code division multiple access; Computer science; Bit error rate; Algorithm; Interference (communication); Code (set theory); Chip; Wavelength; Wavelength-division multiplexing; Electronic engineering; Optics; Telecommunications; Decoding methods; Physics; Engineering","score_opus":0.00900347565889971,"score_gpt":0.1797155167589452,"score_spread":0.1707120411000455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126578673","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.982847,0.0002647901,0.015663773,0.00028022006,0.00017655526,0.00033075502,0.000005805418,0.00033875817,0.00009237658],"genre_scores_gemma":[0.99107087,0.00011420417,0.008591505,0.000070490794,0.000010676495,0.00009235658,7.1105245e-7,0.00002842643,0.00002076191],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926484,0.000011756307,0.00022923292,0.0001605304,0.00006188518,0.00027174345],"domain_scores_gemma":[0.99957174,0.00010455527,0.000036246973,0.00023826984,0.000019080508,0.000030103905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018125582,0.0001448065,0.0002461858,0.00018858977,0.000051099563,0.0000072984117,0.00018239705,0.00019346787,0.000008586458],"category_scores_gemma":[0.000012143432,0.00014727129,0.000039436156,0.00016779038,0.00022021233,0.000056657085,0.000012538389,0.00016561951,0.000016854601],"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.000031358562,0.000026586758,0.00014070369,0.00018372317,0.00010635001,0.000005301619,0.0001459741,0.004674332,0.98636353,0.0018280908,0.0011610591,0.005332964],"study_design_scores_gemma":[0.00033373563,0.00013271374,0.000013426963,0.000029123668,0.000021557651,0.000043315235,0.000012703033,0.4593129,0.53907907,0.00036459664,0.0005013285,0.00015553212],"about_ca_topic_score_codex":2.0374752e-7,"about_ca_topic_score_gemma":1.0848368e-7,"teacher_disagreement_score":0.45463854,"about_ca_system_score_codex":0.000019075436,"about_ca_system_score_gemma":0.0000020735047,"threshold_uncertainty_score":0.6005549},"labels":[],"label_agreement":null},{"id":"W2126750116","doi":"10.1016/j.tcs.2006.06.008","title":"A construction method for optimally universal hash families and its consequences for the existence of RBIBDs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Mathematics; Hash function; Prime (order theory); Corollary; Discrete mathematics; Combinatorics; Time complexity; Computer science","score_opus":0.00984109463461909,"score_gpt":0.2334235269196561,"score_spread":0.223582432285037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126750116","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.09728029,0.0001529526,0.9011051,0.00008120896,0.00029504593,0.00030004908,0.000014643886,0.000052586252,0.00071810174],"genre_scores_gemma":[0.8344973,0.000006506205,0.16542003,0.000011888473,0.000041734842,0.000014321978,4.0950658e-7,0.0000042983193,0.0000035336072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993151,0.00003376726,0.00015871073,0.00017440924,0.00012365058,0.00019439265],"domain_scores_gemma":[0.998918,0.0007776411,0.000031145326,0.000121853416,0.00011457212,0.00003679256],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00089180877,0.000088743385,0.00013640789,0.00006420551,0.00020019997,0.000054015214,0.0003012882,0.000031285563,0.0000028165725],"category_scores_gemma":[0.000032204505,0.00006175054,0.000042037853,0.00022975953,0.0028144745,0.0001264879,0.000039372702,0.00004338557,3.5780326e-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.00001817605,0.000003612989,0.000009923441,0.000047474456,0.000005742975,2.423687e-7,0.00011996409,0.003848575,0.01029921,0.98243916,0.000006378198,0.003201559],"study_design_scores_gemma":[0.00020863363,0.00011582748,0.000086712374,0.000030854204,0.000017050002,0.0000325671,0.00016087954,0.7439796,0.034431178,0.2207528,0.000088899964,0.000095037285],"about_ca_topic_score_codex":0.0000040886325,"about_ca_topic_score_gemma":0.0000011718919,"teacher_disagreement_score":0.7616863,"about_ca_system_score_codex":0.000010720548,"about_ca_system_score_gemma":0.000026470563,"threshold_uncertainty_score":0.99989927},"labels":[],"label_agreement":null},{"id":"W2127348678","doi":"10.1016/s0166-218x(03)00367-6","title":"Bichromatic P4-composition schemes for perfect orderability","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Mathematics; Composition (language); Combinatorics","score_opus":0.008604322185913645,"score_gpt":0.21219221978321215,"score_spread":0.2035878975972985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127348678","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.59183794,0.000120205346,0.3798618,0.0000071028207,0.0001711583,0.000926227,0.000016802467,0.00040663464,0.026652155],"genre_scores_gemma":[0.9681205,0.0000043269715,0.031410016,0.000012255931,0.000029807408,0.00032905577,0.000019414892,0.000049372415,0.000025236688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991018,0.000016623482,0.00033673062,0.00016221298,0.00012645421,0.00025613565],"domain_scores_gemma":[0.99933213,0.00017587528,0.000050420243,0.00035683764,0.000022895172,0.000061818195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037911203,0.00020544972,0.0002953451,0.000049467355,0.00010794732,0.000043641903,0.00011393438,0.0000872515,0.00006296837],"category_scores_gemma":[0.000030891155,0.00018374117,0.00010704499,0.00013757721,0.000041278694,0.000055849814,0.000008058694,0.00008619883,0.00005280694],"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.000009170828,0.00009476143,0.000018095943,0.0035607556,0.00012949477,5.9235805e-7,0.0024021785,0.00084483816,0.08979152,0.90226746,0.00027669212,0.000604424],"study_design_scores_gemma":[0.0019664473,0.00010530835,0.000043108023,0.0003018976,0.00025766128,0.000038935465,0.004118998,0.06514085,0.28774652,0.63269037,0.0062848344,0.0013050699],"about_ca_topic_score_codex":3.0061852e-7,"about_ca_topic_score_gemma":5.325782e-7,"teacher_disagreement_score":0.37628257,"about_ca_system_score_codex":0.000033484906,"about_ca_system_score_gemma":0.000008673928,"threshold_uncertainty_score":0.74927473},"labels":[],"label_agreement":null},{"id":"W2127436502","doi":"10.1109/jlt.2006.879207","title":"Optical orthogonal code construction using rejected delays reuse for increasing SubWavelength-switching capacity","year":2006,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","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 British Columbia","funders":"","keywords":"Code (set theory); Reuse; Greedy algorithm; Measure (data warehouse); Computer science; Factor (programming language); Exploit; Set (abstract data type); Algorithm; Representation (politics); Element (criminal law); Electronic engineering; Mathematics; Theoretical computer science; Engineering; Data mining","score_opus":0.012482042774151639,"score_gpt":0.21138913166167952,"score_spread":0.1989070888875279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127436502","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.90849537,0.00023310128,0.089678556,0.00013070626,0.00084724947,0.00013629111,0.000010453512,0.00021691083,0.00025135072],"genre_scores_gemma":[0.9262755,0.000011214576,0.07323988,0.0000066685216,0.00042112442,0.0000033498666,0.0000019158115,0.00003749989,0.0000028799327],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99842215,0.00006278315,0.0008326237,0.00014826689,0.00017661446,0.00035759297],"domain_scores_gemma":[0.9988973,0.00018376762,0.0003202574,0.0002684597,0.0002643088,0.00006588858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073897635,0.00020515821,0.0004532535,0.0006947444,0.00015295783,0.000034500932,0.00029021478,0.0004111412,0.0000061265946],"category_scores_gemma":[0.00030173358,0.00019219115,0.00016628711,0.0004256406,0.00012952682,0.00021357153,0.00003620272,0.0005829618,0.0000016339136],"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.00019130997,0.00006261213,0.006510953,0.000108248976,0.00020438014,0.000083528044,0.00009298701,0.0031788286,0.88184875,0.10581342,0.00016887413,0.0017361216],"study_design_scores_gemma":[0.0045883483,0.000725307,0.0035889365,0.0009178865,0.00056399405,0.040156774,0.0009902386,0.055178553,0.596376,0.28964838,0.0059739174,0.0012916542],"about_ca_topic_score_codex":0.000009478054,"about_ca_topic_score_gemma":0.000020990208,"teacher_disagreement_score":0.28547272,"about_ca_system_score_codex":0.00016916294,"about_ca_system_score_gemma":0.000044546978,"threshold_uncertainty_score":0.7837328},"labels":[],"label_agreement":null},{"id":"W2128898597","doi":"10.1109/lcomm.2006.06432","title":"A general combinatorial sphere decoder and its application","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","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 Alberta","funders":"","keywords":"Computer science; Decoding methods; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics","score_opus":0.008638400910580976,"score_gpt":0.21003532911912678,"score_spread":0.20139692820854582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128898597","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.98905253,0.0013180729,0.0048375293,0.00069874246,0.00038018226,0.00023339981,0.000008594493,0.0002606797,0.0032102708],"genre_scores_gemma":[0.99895453,0.000050281935,0.0005187674,0.00014574375,0.00012874063,0.000118467346,0.000027914668,0.000020553427,0.000035015804],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995006,0.00005851246,0.0001668077,0.000090767535,0.00006099051,0.00012235456],"domain_scores_gemma":[0.9992207,0.000047229503,0.000026695008,0.0006565441,0.000019336932,0.000029476245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000939284,0.00009405745,0.00009251611,0.000041116222,0.00013713447,0.00003037058,0.00032494974,0.00004917491,0.000005033846],"category_scores_gemma":[0.0000020347575,0.000105324514,0.000029556084,0.0001269876,0.000048026643,0.00009537303,0.00002836767,0.000118581775,0.00003067838],"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.000008068285,0.00009189078,0.0017524036,0.00006652336,0.00007311715,0.000001358308,0.0003077714,0.01263903,0.6264904,0.337107,0.018645898,0.0028165183],"study_design_scores_gemma":[0.003975582,0.00005208301,0.024000527,0.00013263526,0.00018446658,0.00009646668,0.00021137149,0.431175,0.055420663,0.031742007,0.45087734,0.0021318702],"about_ca_topic_score_codex":0.000050815503,"about_ca_topic_score_gemma":0.00005567665,"teacher_disagreement_score":0.5710697,"about_ca_system_score_codex":0.000026566282,"about_ca_system_score_gemma":0.000003133817,"threshold_uncertainty_score":0.42950088},"labels":[],"label_agreement":null},{"id":"W2129501821","doi":"10.1109/glocom.2001.965828","title":"Spectral efficiency limit of bipolar signaling in incoherent optical CDMA systems","year":2002,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Code division multiple access; Baseband; Computer science; Electronic engineering; Spectral efficiency; Bit error rate; Channel (broadcasting); Limit (mathematics); Transmission (telecommunications); Telecommunications; Engineering; Mathematics; Bandwidth (computing)","score_opus":0.012920476330001672,"score_gpt":0.18050980615495324,"score_spread":0.16758932982495156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129501821","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.9639847,0.0031426146,0.0018875361,0.000006208237,0.00041115202,0.00018563813,0.000001904703,0.00014785328,0.030232335],"genre_scores_gemma":[0.99960786,0.000025287954,0.00009341525,0.0000025472095,0.000057233294,0.000010808007,5.813337e-7,0.000017431006,0.0001848376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.000040331684,0.0003802499,0.00012391421,0.00015459394,0.0002597257],"domain_scores_gemma":[0.999664,0.00006558269,0.000022473609,0.0001702718,0.000013689373,0.000063971354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002385293,0.00012473475,0.00023488645,0.000149827,0.000017568074,0.000018773162,0.00014154235,0.000080533464,0.00020231593],"category_scores_gemma":[0.00001188635,0.00011052941,0.000064069,0.0002903214,0.000029696681,0.00006248396,0.000012425208,0.00013610806,0.00007499566],"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.000018804505,0.00046308804,0.012639106,0.0011241804,0.00011657984,0.000073597716,0.002345461,0.55811787,0.22777602,0.1939384,0.0004627202,0.0029241657],"study_design_scores_gemma":[0.0013268933,0.00031730742,0.002140632,0.0005998432,0.00003583435,0.00006802197,0.0017335525,0.8809428,0.10864418,0.0004988689,0.0028497283,0.0008423019],"about_ca_topic_score_codex":0.000032691583,"about_ca_topic_score_gemma":0.000009863927,"teacher_disagreement_score":0.32282495,"about_ca_system_score_codex":0.000035674613,"about_ca_system_score_gemma":0.0000023926473,"threshold_uncertainty_score":0.45072582},"labels":[],"label_agreement":null},{"id":"W2130257952","doi":"10.1109/mcom.2002.1031833","title":"The role of optical CDMA in access networks","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":286,"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":"Code division multiple access; Computer science; Computer network; Flexibility (engineering); Access control; Access network; Service (business); Telecommunications","score_opus":0.023200504470224155,"score_gpt":0.24727053386448283,"score_spread":0.22407002939425869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130257952","genre_codex":"other","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.25436765,0.06317826,0.003962378,0.0014087706,0.0012360853,0.00086558645,0.000014857533,0.00050679385,0.6744596],"genre_scores_gemma":[0.9976794,0.0019303096,0.00013934262,0.000009449397,0.000029238963,0.000050979073,0.000002719626,0.000013658154,0.000144874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993904,0.000081338134,0.00026424194,0.000055221837,0.00006188214,0.00014689377],"domain_scores_gemma":[0.99835896,0.0002944331,0.00002949186,0.0012586424,0.000028649405,0.00002979502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022683441,0.00007398495,0.00011138355,0.00005367675,0.00008734634,0.0000327192,0.0011473784,0.00005001032,0.00002514814],"category_scores_gemma":[0.000019174056,0.000061005197,0.00003877246,0.00034940377,0.00013050322,0.00009582823,0.00008967548,0.00021304832,0.00005514027],"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.00003725174,0.0007784786,0.017233372,0.0001059221,0.00025963326,0.0000048477013,0.0019995181,0.29397258,0.017023277,0.40166134,0.019728584,0.2471952],"study_design_scores_gemma":[0.00028281886,0.000017140426,0.0058911988,0.00006259075,0.000013092041,0.000007808702,0.000119044336,0.87680405,0.0008748342,0.004571885,0.11118305,0.00017250994],"about_ca_topic_score_codex":0.0000049790606,"about_ca_topic_score_gemma":0.00014677447,"teacher_disagreement_score":0.74331176,"about_ca_system_score_codex":0.00001607189,"about_ca_system_score_gemma":0.0000019166775,"threshold_uncertainty_score":0.24877197},"labels":[],"label_agreement":null},{"id":"W2130440289","doi":"10.1109/lpt.2005.845659","title":"Multiuser OCDMA system demonstrator with full CDR using a novel OCDMA receiver","year":2005,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","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":"McGill University","funders":"","keywords":"Code division multiple access; Computer science; Pseudorandom binary sequence; Multiuser detection; Pseudorandom number generator; Electronic engineering; Passive optical network; Code (set theory); Binary number; Computer network; Physics; Wavelength-division multiplexing; Engineering; Algorithm; Optics; Mathematics","score_opus":0.0068790658066492745,"score_gpt":0.18072516911609893,"score_spread":0.17384610330944966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130440289","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.96811575,0.00023119195,0.02780114,0.00034335445,0.000650443,0.00045110873,0.000026557836,0.0020619072,0.00031855315],"genre_scores_gemma":[0.98579943,0.000007682603,0.013645344,0.00026427675,0.000080029866,0.00008160682,0.0000023087182,0.000106447886,0.000012880075],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981983,0.00002758099,0.0004519428,0.00044104795,0.00020473388,0.0006764523],"domain_scores_gemma":[0.9989922,0.000037641217,0.00011728974,0.00070446625,0.000050559578,0.000097813165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021537761,0.00041506116,0.00043463724,0.0004974774,0.00015987868,0.00004143429,0.00047932426,0.00044752375,0.0000114057775],"category_scores_gemma":[0.000007175684,0.00039479,0.00010173798,0.0006967834,0.00025891,0.0002054908,0.000028886348,0.00061221595,0.00009223027],"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.000041703202,0.00003922125,0.00084370165,0.00012789015,0.00022520337,0.00006618074,0.00014742435,0.035432085,0.9611152,0.0013716281,0.00027552448,0.00031423147],"study_design_scores_gemma":[0.0029619678,0.00014487584,0.00009791939,0.0006315946,0.00023055953,0.002561774,0.0010498415,0.34690866,0.63000584,0.00004440802,0.013720284,0.0016422557],"about_ca_topic_score_codex":0.0000127457315,"about_ca_topic_score_gemma":0.000050339942,"teacher_disagreement_score":0.33110934,"about_ca_system_score_codex":0.0003159565,"about_ca_system_score_gemma":0.000028092169,"threshold_uncertainty_score":0.9998504},"labels":[],"label_agreement":null},{"id":"W2130929828","doi":"10.1109/jlt.2005.844201","title":"Analysis of the spectral efficiency of frequency-encoded OCDMA systems with incoherent sources","year":2005,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Spectral efficiency; Code division multiple access; Electronic engineering; Computer science; Quadratic equation; Bit error rate; Gaussian; Mathematics; Algorithm; Decoding methods; Telecommunications; Physics; Engineering","score_opus":0.003601745719525955,"score_gpt":0.1778302328698998,"score_spread":0.17422848715037384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130929828","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.9940615,0.0021375234,0.0020082823,0.0001305618,0.00023533756,0.00011485648,0.0000062606623,0.000048871836,0.0012568005],"genre_scores_gemma":[0.99954426,0.000030464575,0.00031911643,0.0000029210273,0.000058636215,0.0000027889994,2.3298283e-7,0.00001358326,0.000027985003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851525,0.000063219006,0.0008289259,0.0000940082,0.0002959265,0.00020264454],"domain_scores_gemma":[0.9987654,0.00005361244,0.0006132501,0.0003669761,0.00016256786,0.000038160444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040014865,0.00015215382,0.00065487664,0.0010347754,0.000038276597,0.00000859047,0.0005704543,0.00016964275,0.00002379749],"category_scores_gemma":[0.000026183146,0.00008786395,0.00025159246,0.0018536847,0.00020713251,0.00007563532,0.000025679274,0.00033123282,0.0000014172712],"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.00011950191,0.00048787598,0.22974293,0.0004302465,0.008352077,0.00005586228,0.0028917168,0.36233175,0.33146188,0.06261756,0.00019770117,0.0013108909],"study_design_scores_gemma":[0.0025016407,0.0021578823,0.02228912,0.0013057339,0.0045557176,0.001300354,0.006051252,0.030466147,0.9225062,0.00405564,0.0019617544,0.00084856834],"about_ca_topic_score_codex":0.000011369842,"about_ca_topic_score_gemma":0.00005474015,"teacher_disagreement_score":0.5910443,"about_ca_system_score_codex":0.00006159962,"about_ca_system_score_gemma":0.000033814078,"threshold_uncertainty_score":0.35829878},"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":"W2131868217","doi":"10.1109/nrc.2004.1316465","title":"Efficient exhaustive search for optimal-peak-sidelobe binary codes","year":2004,"lang":"en","type":"article","venue":"","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":"Lockheed Martin (Canada)","funders":"","keywords":"PSL; Binary number; Code (set theory); Autocorrelation; Binary code; Mathematics; Computer science; Algorithm; Combinatorics; Arithmetic; Statistics; Programming language","score_opus":0.01423813397545795,"score_gpt":0.23581631521420537,"score_spread":0.22157818123874742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131868217","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.90012646,0.00023123113,0.087136574,0.0000403139,0.00028960453,0.00040210047,0.000017408302,0.0004088683,0.011347431],"genre_scores_gemma":[0.99729323,0.0000044891185,0.002137009,0.00002112625,0.00006244398,0.000064370186,0.0000074879495,0.00002886665,0.000380991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992814,0.000010132575,0.00015540801,0.00015136498,0.00010943486,0.00029226704],"domain_scores_gemma":[0.99966055,0.000045955185,0.000008638853,0.00016079121,0.00004535332,0.00007871493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022101177,0.00012846972,0.00014323853,0.00008562235,0.000083028885,0.000024148083,0.00011519625,0.00006155995,0.000055079072],"category_scores_gemma":[0.00000489918,0.00011245843,0.0000802254,0.00015952741,0.00003805947,0.000029978699,0.00001951725,0.00008022912,0.00010108302],"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.000020004984,0.000029973688,0.00002767981,0.000081206155,0.000033763252,0.0000058599708,0.00047818993,0.9420514,0.008223018,0.048611373,0.0002773406,0.00016016101],"study_design_scores_gemma":[0.0043173595,0.0007357466,0.0020139099,0.0003306765,0.00007803216,0.000076092896,0.008403367,0.6311276,0.3425628,0.0037887688,0.0051831165,0.001382552],"about_ca_topic_score_codex":0.000017434246,"about_ca_topic_score_gemma":0.0000027736382,"teacher_disagreement_score":0.33433977,"about_ca_system_score_codex":0.000058856265,"about_ca_system_score_gemma":0.000015468575,"threshold_uncertainty_score":0.45859215},"labels":[],"label_agreement":null},{"id":"W2131891875","doi":"10.5539/jmr.v4n2p28","title":"A Class of Cayley Digraph Structures Induced by Groups","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Cayley graph; Combinatorics; Transitive relation; Generalization; Vertex (graph theory); Algebraic properties; Vertex-transitive graph; Cayley's theorem; Algebraic number; Algebraic structure; Class (philosophy); Discrete mathematics; Graph; Pure mathematics; Voltage graph; Computer science; Line graph","score_opus":0.06299761110496142,"score_gpt":0.33174642610046795,"score_spread":0.2687488149955065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131891875","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.99479026,0.0012751297,0.0007071883,0.00001859326,0.00026269341,0.0000996584,0.0000056301405,0.000012307854,0.0028285256],"genre_scores_gemma":[0.99912024,0.00005674292,0.0006150546,0.000001994761,0.00014265253,0.0000027496685,4.7540348e-7,0.000025208465,0.0000348801],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981175,0.00014469062,0.0005503245,0.000043331176,0.0007882335,0.0003559011],"domain_scores_gemma":[0.99888504,0.00036125167,0.00014312225,0.00021454679,0.00022069878,0.00017532594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029141176,0.00010250808,0.00031365865,0.00036815743,0.000045784323,0.000027923552,0.0003396238,0.00010544527,0.00005887067],"category_scores_gemma":[0.00017114037,0.000076687895,0.00012210466,0.00033729352,0.00005129093,0.00018828081,0.000032983204,0.00057420216,0.000009083609],"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.0000438546,0.00047832736,0.0015392008,0.0021486245,0.00054120464,0.000011116969,0.013205391,0.00021320082,0.86402774,0.09883558,0.017370094,0.0015856773],"study_design_scores_gemma":[0.0026113708,0.0010326513,0.0047730277,0.0014200109,0.00014222269,0.0008358825,0.0270787,0.0034746558,0.6989855,0.24949582,0.0092752995,0.000874827],"about_ca_topic_score_codex":0.0000036270603,"about_ca_topic_score_gemma":0.0000010544059,"teacher_disagreement_score":0.16504219,"about_ca_system_score_codex":0.000038584163,"about_ca_system_score_gemma":0.000019634133,"threshold_uncertainty_score":0.31272414},"labels":[],"label_agreement":null},{"id":"W2132589312","doi":"10.1016/j.jcta.2010.10.003","title":"Divisible design graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adjacency matrix; Combinatorics; Mathematics; Indifference graph; Discrete mathematics; Chordal graph; Adjacency list; Strongly regular graph; Incidence matrix; Generalization; Cograph; Pathwidth; Line graph; Graph","score_opus":0.006352779784245656,"score_gpt":0.19350495685116315,"score_spread":0.1871521770669175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132589312","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.9320276,0.00052984955,0.0069732727,0.000046238605,0.047702324,0.00019244924,0.0000036768909,0.00015295025,0.01237164],"genre_scores_gemma":[0.9986471,0.00003959327,0.00048322257,0.000011271289,0.0006445622,0.0000035224002,2.9730037e-7,0.000031458138,0.00013900391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988689,0.00017747347,0.00043716226,0.00006842594,0.00023070084,0.00021738089],"domain_scores_gemma":[0.99911845,0.00024520696,0.00014597664,0.00021786428,0.00013620839,0.00013632144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018146324,0.00016432905,0.00031327314,0.00016316224,0.00008968486,0.00007229172,0.00035020473,0.00012871421,0.0002476787],"category_scores_gemma":[0.0001383331,0.00013686137,0.000181109,0.00022693032,0.000100131656,0.00046153722,0.000018815284,0.00053408847,0.000015436315],"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.0003338733,0.000038283917,0.000071932554,0.000024346129,0.000115687326,0.000030464242,0.00033940628,0.0003353069,0.035293818,0.9610706,0.0015058564,0.00084040436],"study_design_scores_gemma":[0.0007222516,0.0003085652,0.00008101892,0.000031336633,0.00003224231,0.00023855074,0.0001977994,0.000025605976,0.030615432,0.94432706,0.023249239,0.00017091786],"about_ca_topic_score_codex":3.831957e-7,"about_ca_topic_score_gemma":3.8049436e-7,"teacher_disagreement_score":0.06661947,"about_ca_system_score_codex":0.000012884429,"about_ca_system_score_gemma":0.000031653988,"threshold_uncertainty_score":0.5581045},"labels":[],"label_agreement":null},{"id":"W2132893794","doi":"10.1016/j.disc.2008.02.018","title":"Minimal factorizations of permutations into star transpositions","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Simple (philosophy); Star (game theory); Symmetry (geometry); Parity of a permutation; Discrete mathematics; Cyclic permutation; Symmetric group","score_opus":0.012347586672236626,"score_gpt":0.21153801401279682,"score_spread":0.1991904273405602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132893794","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.8431219,0.000084184416,0.15039262,0.000016351518,0.00009740465,0.00014817205,0.00012221053,0.0001568114,0.0058603766],"genre_scores_gemma":[0.9925959,0.000019756371,0.007175235,0.0000025923162,0.00001952184,0.000022644335,0.00004877886,0.000023609891,0.00009194193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994151,0.000013745427,0.00028070237,0.000064052896,0.000117794174,0.0001086304],"domain_scores_gemma":[0.9996434,0.00006110779,0.000032871343,0.00017592177,0.000039095576,0.000047605863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004125789,0.00010055615,0.00015865348,0.00007780276,0.00011303513,0.000006446258,0.00009570151,0.000044989487,0.0000769014],"category_scores_gemma":[0.000012363075,0.00009612337,0.000085388514,0.0001985699,0.000074346106,0.000090737194,0.0000045574843,0.000058643305,0.00002206991],"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.0000088931965,0.0003380785,0.0012090094,0.0022252419,0.0004349729,0.000021069076,0.19410972,0.022018932,0.110015534,0.6687108,0.0007975109,0.00011020534],"study_design_scores_gemma":[0.0037119642,0.000692723,0.01879188,0.001569547,0.0011237599,0.0004760979,0.057759862,0.40847817,0.17324919,0.3240914,0.0061174384,0.003937966],"about_ca_topic_score_codex":0.0000032523863,"about_ca_topic_score_gemma":0.0000051174525,"teacher_disagreement_score":0.38645926,"about_ca_system_score_codex":0.00001255498,"about_ca_system_score_gemma":0.000011006186,"threshold_uncertainty_score":0.39197972},"labels":[],"label_agreement":null},{"id":"W2133225860","doi":"10.1109/jlt.2004.839984","title":"Experimental verification and capacity prediction of FE-OCDMA using superimposed FBG","year":2005,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Code division multiple access; Decoding methods; Bit error rate; Encoding (memory); Fiber Bragg grating; Computer science; Electronic engineering; Interference (communication); Optical fiber; Code (set theory); Algorithm; Telecommunications; Engineering; Artificial intelligence","score_opus":0.017547513120118114,"score_gpt":0.2128023967833709,"score_spread":0.19525488366325278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133225860","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.9965047,0.0013356222,0.0015359306,0.00005688183,0.00026240636,0.00006336931,0.000005198359,0.00006597499,0.0001699034],"genre_scores_gemma":[0.99766624,0.00003517771,0.0021783554,0.0000034882096,0.00009911972,0.0000013949507,4.5173226e-7,0.000011900163,0.0000038685257],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992958,0.00002251592,0.00040885343,0.00006723188,0.00009737537,0.000108225744],"domain_scores_gemma":[0.9996279,0.000012499211,0.00014441689,0.00012132585,0.000059193757,0.000034647353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001856908,0.00009012591,0.00021472556,0.00033351118,0.000034275443,0.0000070432893,0.00009459861,0.00016921152,0.00001297796],"category_scores_gemma":[0.00001325513,0.000083079,0.000047559573,0.00016924772,0.00009538665,0.00017985165,0.000011683454,0.00017417855,0.0000011847799],"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.000016467913,0.000034855082,0.0011293197,0.000019873802,0.000043584805,0.000002466112,0.00037684847,0.00025436326,0.99497616,0.0024343408,0.00002913109,0.00068256905],"study_design_scores_gemma":[0.00044274665,0.00018458212,0.0011207337,0.00005375112,0.000022753962,0.00058813894,0.00059586274,0.0038664301,0.99131835,0.00047547443,0.0012606463,0.00007054009],"about_ca_topic_score_codex":0.0000014561051,"about_ca_topic_score_gemma":6.032468e-7,"teacher_disagreement_score":0.00365784,"about_ca_system_score_codex":0.000068568865,"about_ca_system_score_gemma":0.000008805812,"threshold_uncertainty_score":0.33878636},"labels":[],"label_agreement":null},{"id":"W2133298523","doi":"10.1007/s00373-014-1518-x","title":"Graph Divisible Designs and Packing Constructions","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Generalization; Joins; Embedding; Constructive; Block (permutation group theory); Class (philosophy); Discrete mathematics; Computer science","score_opus":0.02773550956475689,"score_gpt":0.20157058305288544,"score_spread":0.17383507348812854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133298523","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.9868408,0.0038295153,0.0015422717,0.00001408862,0.0009559961,0.00010551468,0.000005713307,0.00027769053,0.0064284387],"genre_scores_gemma":[0.99956346,0.00028391244,0.0000686817,0.000010436446,0.0000101066635,0.00001203813,0.000001947414,0.00001571739,0.0000336817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994432,0.000027574108,0.00012820275,0.0001259202,0.00009621279,0.00017889723],"domain_scores_gemma":[0.99960494,0.00003291247,0.000018785942,0.00012891988,0.000038227565,0.00017622033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017829612,0.00012459996,0.00014530806,0.00013450877,0.0001209209,0.00006602077,0.000055293272,0.00006810265,0.0000022651152],"category_scores_gemma":[0.000009171331,0.00012146529,0.000031107418,0.0003492384,0.000089012756,0.00011647831,0.000021477852,0.000108556065,0.0000023009861],"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.0000030343745,0.000014732326,0.032014105,0.000049596063,0.000043135136,0.000005687958,0.00049488374,0.000052271724,0.00016562744,0.9647065,0.00081767817,0.0016327578],"study_design_scores_gemma":[0.00068331935,0.00008247552,0.003284137,0.00003162788,0.000032369993,0.00008945188,0.0012077118,0.0007199786,0.00034080842,0.9903473,0.002902543,0.00027823725],"about_ca_topic_score_codex":0.000009667503,"about_ca_topic_score_gemma":0.0000024403578,"teacher_disagreement_score":0.02872997,"about_ca_system_score_codex":0.000008503339,"about_ca_system_score_gemma":0.000006984098,"threshold_uncertainty_score":0.49532107},"labels":[],"label_agreement":null},{"id":"W2134442222","doi":"10.1007/s10623-012-9729-8","title":"Group divisible designs in MOLS of order ten","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Camosun College; University of Victoria","funders":"","keywords":"Counterexample; Conjecture; Mathematics; Dimension (graph theory); Argument (complex analysis); Group (periodic table); Order (exchange); Combinatorics; Rank (graph theory); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.020743893246600247,"score_gpt":0.22038179602817734,"score_spread":0.1996379027815771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134442222","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.91055036,0.0050766817,0.08010442,0.0000048763522,0.00019093961,0.00027652588,0.000015291223,0.00012906757,0.003651852],"genre_scores_gemma":[0.9968306,0.00022840984,0.0027968963,0.00001712673,0.00003917287,0.000048302772,0.000005921402,0.000027808052,0.000005760747],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99901134,0.000084629784,0.00027630143,0.00013058391,0.0001184707,0.00037869407],"domain_scores_gemma":[0.99954516,0.00009192281,0.000036370362,0.00018982396,0.00002327741,0.0001134548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045292417,0.00018139854,0.00027798067,0.00034095274,0.00004448654,0.00002254463,0.000114737464,0.00010202002,0.00004148815],"category_scores_gemma":[0.0000072851035,0.00016469942,0.0000867274,0.00075543387,0.00007897528,0.00020350504,0.000017432445,0.000111447574,0.000004573402],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079265476,0.00036131154,0.5772551,0.0006522593,0.00030264864,0.000008324197,0.0036205999,0.0010394626,0.12575008,0.28037247,0.00088294264,0.009675588],"study_design_scores_gemma":[0.007187825,0.0013989673,0.73213464,0.0014362884,0.00045742592,0.00013280263,0.008222722,0.009991113,0.08866511,0.12676302,0.018885424,0.004724678],"about_ca_topic_score_codex":0.000031486434,"about_ca_topic_score_gemma":0.0000132186815,"teacher_disagreement_score":0.15487956,"about_ca_system_score_codex":0.000005853067,"about_ca_system_score_gemma":0.0000033302917,"threshold_uncertainty_score":0.6716247},"labels":[],"label_agreement":null},{"id":"W2134597069","doi":"10.1109/ccece.2005.1557177","title":"Coding in optical CDMA networks with m-ary modulation: impact of selected physical imperfections","year":2006,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Code division multiple access; Decoding methods; Computer science; Spectral efficiency; Electronic engineering; Coding (social sciences); Bit error rate; Transmission (telecommunications); Channel (broadcasting); Optical communication; Detector; Optical amplifier; Passive optical network; Laser; Telecommunications; Physics; Wavelength-division multiplexing; Optics; Engineering; Wavelength; Mathematics","score_opus":0.0027825856714039916,"score_gpt":0.19025365710528977,"score_spread":0.18747107143388578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134597069","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.96349806,0.000016336753,0.029141834,0.0000023579228,0.00003956209,0.000093410665,0.0000011893083,0.00014249155,0.007064735],"genre_scores_gemma":[0.9997135,9.448404e-7,0.00011540284,7.9608907e-7,0.000109742396,0.000009372417,0.0000084395715,0.000015259953,0.000026559288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995217,0.00002108385,0.00014143708,0.000084501036,0.00006488173,0.00016641837],"domain_scores_gemma":[0.99977326,0.000052607644,0.000013275163,0.00009637067,0.000027560125,0.000036947065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053065294,0.00009744778,0.00015659966,0.000074041985,0.00002297989,0.0000106471825,0.000037792663,0.0000494525,0.000027929364],"category_scores_gemma":[0.0000033184624,0.00007463728,0.000052369454,0.00055402267,0.000023788236,0.000085650834,0.0000045208594,0.00011612764,0.0000022497723],"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.00001598371,0.000043259595,0.019739477,0.000010746317,0.000026834761,0.0000021527737,0.000040465104,0.9636053,0.009260573,0.0070508146,0.00008792574,0.000116480376],"study_design_scores_gemma":[0.00024123704,0.00006824109,0.22718632,0.00002183605,0.000006855025,0.000012943787,0.000016044169,0.7710391,0.0010745181,0.00023928378,0.0000017075384,0.00009191586],"about_ca_topic_score_codex":0.000116304334,"about_ca_topic_score_gemma":0.000056255747,"teacher_disagreement_score":0.20744684,"about_ca_system_score_codex":0.00004207573,"about_ca_system_score_gemma":0.000010280989,"threshold_uncertainty_score":0.304362},"labels":[],"label_agreement":null},{"id":"W2135107686","doi":"10.1109/tsmcb.2002.999810","title":"Assigning cells to switches in cellular mobile networks using taboo search","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Taboo; Computer science; Heuristic; Process (computing); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.02238897447906088,"score_gpt":0.21005568005814026,"score_spread":0.18766670557907938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135107686","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.8012432,0.0028846674,0.18873262,0.000011277995,0.0025768522,0.0012420114,0.0000371344,0.00030515753,0.0029670787],"genre_scores_gemma":[0.99662834,0.00048221543,0.00012324753,0.000033183118,0.00022119182,0.00017863479,0.0000024805936,0.00013589577,0.0021947906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997155,0.00020680061,0.00079605373,0.00058058655,0.0004230689,0.00083848636],"domain_scores_gemma":[0.9987478,0.0001441886,0.00006790584,0.0005658295,0.00006297387,0.00041126317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000490967,0.0005165702,0.000598526,0.00044445254,0.00020092855,0.00023754047,0.00028151373,0.00034275162,0.00013014399],"category_scores_gemma":[0.0000015883764,0.00056560966,0.00013682502,0.0006357885,0.00009798851,0.00011623222,0.0000063011335,0.0006353511,0.0001864739],"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.000014268356,0.00012080573,0.00011344231,0.00016989981,0.000077251025,0.000029038587,0.001672366,0.97766834,0.017628947,0.0001300749,0.0003363578,0.0020391988],"study_design_scores_gemma":[0.0009372892,0.00029300214,0.000057211542,0.00077212503,0.00010140278,0.00005413817,0.0017309939,0.9397421,0.045521807,0.000025645022,0.009680216,0.0010840615],"about_ca_topic_score_codex":0.00019942096,"about_ca_topic_score_gemma":0.00009181193,"teacher_disagreement_score":0.19538517,"about_ca_system_score_codex":0.00013987941,"about_ca_system_score_gemma":0.000010242467,"threshold_uncertainty_score":0.99967957},"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":"W2135393175","doi":"10.1016/s0012-365x(02)00680-5","title":"On Hamilton cycle decompositions of the tensor product of complete graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"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":"Tensor product; Mathematics; Product (mathematics); Tensor (intrinsic definition); Combinatorics; Tensor product of Hilbert spaces; Tensor contraction; Pure mathematics; Geometry","score_opus":0.014568636633819994,"score_gpt":0.199769635454023,"score_spread":0.185200998820203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135393175","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.97890836,0.0001402226,0.0008771965,0.00003185778,0.00016948294,0.00029040597,0.00008231674,0.0000679846,0.019432187],"genre_scores_gemma":[0.99911314,0.00001003833,0.00073320477,0.000007820514,0.000010323836,0.0000118808475,0.000002357516,0.000021225113,0.00009000106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.000030240784,0.00030421847,0.0000785659,0.0001569389,0.00012035843],"domain_scores_gemma":[0.99931294,0.00008685024,0.00008428429,0.00046291205,0.000028573004,0.000024449244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009590036,0.00011135752,0.00021202488,0.00005487797,0.000050316015,0.00000665726,0.0002023118,0.000028055161,0.000058828242],"category_scores_gemma":[0.000020602432,0.00007563896,0.00013619449,0.00020288285,0.00008499668,0.000029538307,0.000013936559,0.00007633488,0.00001920564],"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.000009678073,0.00042281463,0.0003677437,0.0026520335,0.00032187917,0.000002156789,0.01274628,0.02669649,0.10883296,0.8451517,0.0024547544,0.00034145766],"study_design_scores_gemma":[0.0014552618,0.00033197112,0.0039303913,0.0027232748,0.00036808915,0.000077443685,0.002193314,0.34261915,0.21116993,0.43265274,0.0013599836,0.0011184539],"about_ca_topic_score_codex":0.0000016015741,"about_ca_topic_score_gemma":0.0000015269975,"teacher_disagreement_score":0.412499,"about_ca_system_score_codex":0.000006921733,"about_ca_system_score_gemma":0.0000010942465,"threshold_uncertainty_score":0.30844676},"labels":[],"label_agreement":null},{"id":"W2135467874","doi":"10.1109/ccece.2002.1012935","title":"Hadamard-Craigen error correcting codes","year":2003,"lang":"en","type":"article","venue":"","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":"Hadamard transform; BCH code; Block code; Circulant matrix; Hadamard matrix; Decoding methods; Block (permutation group theory); Complex Hadamard matrix; Computer science; Coding (social sciences); Mathematics; Algorithm; Linear code; Arithmetic; Discrete mathematics; Combinatorics; Statistics","score_opus":0.01096690163377879,"score_gpt":0.1988650738485758,"score_spread":0.18789817221479702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135467874","genre_codex":"other","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.46577814,0.0002963527,0.014788761,0.0000072802345,0.001435807,0.000100915124,0.0000015820198,0.00068047777,0.5169107],"genre_scores_gemma":[0.996695,0.0000023583405,0.00039212193,0.000028378705,0.000030053669,0.0000086427735,9.243454e-7,0.000019205025,0.002823313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995301,0.000034026292,0.00011830895,0.00008251398,0.0000606329,0.00017441789],"domain_scores_gemma":[0.9997593,0.000042609616,0.000009318358,0.00012997705,0.000011701633,0.00004706925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019599636,0.00008780467,0.00010229352,0.000035729576,0.000053732147,0.000021080046,0.000059322876,0.00004262858,0.0004285871],"category_scores_gemma":[0.000028095834,0.000079353944,0.00004277724,0.00010911043,0.0000113096285,0.00005504815,0.0000037368195,0.00007108575,0.00018506155],"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.000030078365,0.0001502785,0.06603438,0.0006655695,0.00070430164,0.000088111665,0.006765014,0.072405614,0.068749025,0.66227084,0.07443617,0.04770063],"study_design_scores_gemma":[0.0016048009,0.00011773679,0.0044372045,0.00020509574,0.000087096174,0.0005002216,0.013120318,0.045373134,0.3949883,0.020462072,0.5167351,0.0023689168],"about_ca_topic_score_codex":0.000008870691,"about_ca_topic_score_gemma":0.00002405402,"teacher_disagreement_score":0.64180875,"about_ca_system_score_codex":0.000013196191,"about_ca_system_score_gemma":0.000004233949,"threshold_uncertainty_score":0.46927285},"labels":[],"label_agreement":null},{"id":"W2136339957","doi":"10.1109/lics.2002.1029841","title":"The proof complexity of linear algebra","year":2003,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":30,"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; McMaster University","funders":"","keywords":"Mathematical proof; Algebra over a field; Linear algebra; Proof complexity; Mathematics; Order (exchange); Matrix algebra; Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.02075676942612546,"score_gpt":0.20942962646612118,"score_spread":0.18867285703999573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136339957","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.56434506,0.00074065686,0.0104832025,0.00004287386,0.0005650464,0.0002581615,0.0000034767975,0.00021270601,0.4233488],"genre_scores_gemma":[0.9992307,0.0000041265484,0.00022259164,0.0000062204745,0.000011008494,0.0000046019654,3.36509e-7,0.000006117579,0.00051432604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996931,0.000029904028,0.00010619404,0.000034919034,0.0000501116,0.00008579525],"domain_scores_gemma":[0.99978286,0.000032550182,0.000009610244,0.00014334985,0.000013453007,0.000018192126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018549623,0.00004328544,0.000061963874,0.000009653607,0.00004641957,0.0000047525386,0.000068344816,0.00001934017,0.00007361568],"category_scores_gemma":[0.000012844435,0.000026635598,0.0000309663,0.00007074892,0.00005835822,0.000018803425,0.0000034547563,0.00004029809,0.000019397996],"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.0000015264463,0.000006684707,0.00016563102,0.000026442345,0.000019869882,2.2908372e-7,0.0001165667,0.00041836477,0.0015352463,0.9967147,0.0006414335,0.0003532924],"study_design_scores_gemma":[0.0005482421,0.00007725866,0.0013272644,0.00003663488,0.000018068527,0.000020462507,0.0013042337,0.017652387,0.538081,0.25251225,0.18806365,0.00035858023],"about_ca_topic_score_codex":0.0000029826606,"about_ca_topic_score_gemma":0.000011386399,"teacher_disagreement_score":0.74420244,"about_ca_system_score_codex":0.0000030911049,"about_ca_system_score_gemma":0.0000027776716,"threshold_uncertainty_score":0.108616814},"labels":[],"label_agreement":null},{"id":"W2136422864","doi":"10.1109/glocom.2004.1378290","title":"Optical GMPLS networks with code switch capable layer for sub-wavelength switching","year":2005,"lang":"en","type":"article","venue":"","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 British Columbia","funders":"","keywords":"Multiprotocol Label Switching; Label switching; Computer science; Computer network; Optical switch; Physical layer; Optical burst switching; Layer (electronics); Network topology; Quality of service; Wavelength-division multiplexing; Optical performance monitoring; Electronic engineering; Telecommunications; Engineering; Wavelength; Materials science; Optoelectronics; Wireless","score_opus":0.010831664450368598,"score_gpt":0.2031813229139512,"score_spread":0.1923496584635826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136422864","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.4715457,0.00015097408,0.49628142,0.00009036918,0.00023127708,0.0003923727,0.000004118165,0.00053534337,0.030768437],"genre_scores_gemma":[0.9930764,0.00001213572,0.005635917,0.00010217593,0.00039189996,0.00007815553,0.0000058154587,0.000064205255,0.00063331355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998951,0.000014317398,0.00023602143,0.00020265883,0.00011811725,0.00047789345],"domain_scores_gemma":[0.99944663,0.00012497586,0.000020523761,0.00024243708,0.000036572244,0.00012884359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029279527,0.0002033464,0.00023717205,0.000050735944,0.00010122477,0.00006118621,0.00013625252,0.00011788327,0.000078608944],"category_scores_gemma":[0.000007469651,0.00015840367,0.00007080713,0.00012802002,0.00001281145,0.00017658401,0.000012696605,0.00018550143,0.000040403884],"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.0001689843,0.00009728127,0.0008439096,0.00020350839,0.00033545628,0.000012153081,0.0006219877,0.79752475,0.012745057,0.15191892,0.010015984,0.02551202],"study_design_scores_gemma":[0.0010662032,0.000102136786,0.00021589096,0.00006255306,0.00004944349,0.00005816112,0.00024975685,0.94681686,0.024826158,0.0005305563,0.025484947,0.0005373206],"about_ca_topic_score_codex":0.000007511659,"about_ca_topic_score_gemma":0.00017839903,"teacher_disagreement_score":0.5215307,"about_ca_system_score_codex":0.000037654165,"about_ca_system_score_gemma":0.000009353583,"threshold_uncertainty_score":0.6459514},"labels":[],"label_agreement":null},{"id":"W2136895944","doi":"10.37236/1633","title":"The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Carleton University; Simon Fraser University","funders":"Mitacs; Simon Fraser University","keywords":"Mathematics; Degree (music); Combinatorics; Factorization; Decomposition; Order (exchange); Factor (programming language); Decomposition method (queueing theory); Discrete mathematics; Algorithm; Computer science","score_opus":0.010447136009190892,"score_gpt":0.1896535593282815,"score_spread":0.17920642331909062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136895944","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.94783187,0.03979625,0.007011411,0.00028240014,0.0020589686,0.0003421541,0.000014433376,0.00018639416,0.002476094],"genre_scores_gemma":[0.9952614,0.004528835,0.000006631452,0.0000038586413,0.000043013075,0.0000035715896,0.0000017842115,0.000030087833,0.00012087673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798304,0.00027298008,0.00079690013,0.00007872711,0.0004030839,0.00046527584],"domain_scores_gemma":[0.9982304,0.00040840387,0.00047937522,0.0003573024,0.00046746354,0.000057046338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007265236,0.00018493134,0.0004180918,0.0001414269,0.00024261727,0.000020409965,0.0005660808,0.0000829911,0.000027293829],"category_scores_gemma":[0.00011484133,0.00011845707,0.00020028141,0.0014216407,0.00014247063,0.0001094858,0.000023589453,0.0005645248,0.0000029035705],"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.000054656517,0.0003688665,0.002579696,0.0001320428,0.001356777,0.0000036236754,0.0014831236,0.0036793998,0.025865782,0.9606534,0.0026551923,0.0011673938],"study_design_scores_gemma":[0.006038345,0.0018888398,0.023802744,0.0006554942,0.0011187759,0.00057954196,0.00087618746,0.056350663,0.030527042,0.8268174,0.05000617,0.0013388302],"about_ca_topic_score_codex":0.000007904299,"about_ca_topic_score_gemma":0.000009338139,"teacher_disagreement_score":0.13383608,"about_ca_system_score_codex":0.000095272975,"about_ca_system_score_gemma":0.000051852818,"threshold_uncertainty_score":0.48305392},"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":"W2137385627","doi":"10.46298/dmtcs.295","title":"Performance analysis of demodulation with diversity - A combinatorial approach I : Symmetric function theoretical methods","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Nortel (Canada)","funders":"","keywords":"Diversity (politics); Demodulation; Function (biology); Modulation (music); Computer science; Mathematics; Applied mathematics; Telecommunications; Physics; Political science; Biology","score_opus":0.0135332505756409,"score_gpt":0.22305796636561478,"score_spread":0.2095247157899739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137385627","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.32518724,0.000016183398,0.66426927,0.0000044161234,0.00019180917,0.0001446356,0.0000028317559,0.00009472228,0.010088861],"genre_scores_gemma":[0.91730976,0.0000040702307,0.08261948,0.0000072522416,0.000033358272,0.000007138878,0.0000034538489,0.000013826262,0.0000016577987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980733,0.00014360242,0.00038162703,0.0003460016,0.00069684663,0.0003586439],"domain_scores_gemma":[0.99875855,0.0003250014,0.00009356031,0.0005267985,0.00014174388,0.00015433691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018676729,0.00022219568,0.0004768337,0.0006199272,0.0003359253,0.000078913334,0.00059805665,0.000083668456,0.00011948231],"category_scores_gemma":[0.000051687362,0.00016292832,0.0001470407,0.0040825973,0.0020858317,0.00026888098,0.00025279372,0.00017956369,0.000006421149],"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.000015448748,0.000089780304,0.0006974623,0.00011300408,0.00019443511,5.0489433e-7,0.0012758435,0.012719999,0.00012458327,0.9827306,0.0000020274351,0.0020362884],"study_design_scores_gemma":[0.00020926612,0.00017544121,0.0017351086,0.000028859089,0.00050185365,0.0000056159383,0.00006741069,0.91604996,0.00038540037,0.08063912,0.0000011512573,0.00020079626],"about_ca_topic_score_codex":5.820526e-7,"about_ca_topic_score_gemma":5.4139704e-8,"teacher_disagreement_score":0.90332997,"about_ca_system_score_codex":0.00003992575,"about_ca_system_score_gemma":0.000006206723,"threshold_uncertainty_score":0.7685334},"labels":[],"label_agreement":null},{"id":"W2137654859","doi":"10.1109/ofc.2007.4348663","title":"Network Management Solution for PS/PON, WDM/PON and Hybrid PS/WDM/PON using DS-OCDM","year":2007,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Wavelength-division multiplexing; Passive optical network; Computer science; Computer network; Optoelectronics; Materials science","score_opus":0.013066139602786814,"score_gpt":0.21153176210732122,"score_spread":0.1984656225045344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137654859","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.33632624,0.0011449546,0.63989866,0.000036691392,0.0019618266,0.00075721333,0.0000057471207,0.00046446273,0.0194042],"genre_scores_gemma":[0.9928221,0.00004594981,0.0055812136,0.0000919324,0.00052193383,0.000025000772,0.000016184702,0.00005230617,0.0008433898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985782,0.000033200307,0.00036333827,0.0002731047,0.00014492062,0.00060725235],"domain_scores_gemma":[0.9994813,0.000070410075,0.00005018789,0.00025827502,0.000029793178,0.00011000684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188532,0.00023666664,0.00023200442,0.00012888764,0.00021989435,0.000058502505,0.00011546898,0.00009261239,0.000034239125],"category_scores_gemma":[0.0000054245343,0.00023703295,0.00008749177,0.00019051768,0.000032868233,0.00017418657,0.000045613604,0.000107068525,0.00001830698],"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.0013353096,0.00033943617,0.0055349297,0.004880547,0.0019618587,0.00028572849,0.0016982142,0.25180918,0.035934024,0.47229794,0.079419136,0.14450368],"study_design_scores_gemma":[0.0046921284,0.00037477532,0.007745318,0.00088561105,0.0005769266,0.00026910705,0.0013912662,0.74185306,0.013187628,0.04538842,0.18106313,0.0025726159],"about_ca_topic_score_codex":0.000030006307,"about_ca_topic_score_gemma":0.00004600957,"teacher_disagreement_score":0.65649587,"about_ca_system_score_codex":0.00007642428,"about_ca_system_score_gemma":0.0000036181646,"threshold_uncertainty_score":0.9665923},"labels":[],"label_agreement":null},{"id":"W2139506438","doi":"10.1587/transfun.e93.a.2266","title":"Binary Sequence Pairs with Two-Level Correlation and Cyclic Difference Pairs","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"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":"University of Waterloo","keywords":"Mathematics; Ideal (ethics); Sequence (biology); Conjecture; Combinatorics; Pseudorandom binary sequence; Circulant matrix; Hadamard matrix; Binary number; Hadamard transform; Discrete mathematics; Mathematical analysis; Arithmetic","score_opus":0.026683947954508073,"score_gpt":0.24666497423585781,"score_spread":0.21998102628134975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139506438","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.86382693,0.00081902073,0.134338,0.00018991856,0.000111741734,0.00018354155,0.000017926403,0.00009130974,0.00042159384],"genre_scores_gemma":[0.98821425,0.0008274254,0.010860621,0.000030016716,0.000006011215,0.000032582255,0.000004051166,0.0000086602495,0.000016376838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920696,0.00006408275,0.00020359059,0.00019038675,0.00014192588,0.00019303599],"domain_scores_gemma":[0.99916583,0.000225496,0.000059811944,0.00045256497,0.00003263791,0.00006366361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027317108,0.0001404875,0.00014624425,0.00014413962,0.00052695815,0.000084610285,0.00041555136,0.00004538518,0.000007737691],"category_scores_gemma":[8.9778933e-7,0.00012106793,0.000028929606,0.00034935013,0.0006652377,0.00023679656,0.000014470495,0.00031780615,0.0000012906527],"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.00009343016,0.0009936027,0.009593721,0.00023670205,0.00038566763,0.000002248505,0.005204774,0.0747528,0.16052763,0.21739785,0.000025686428,0.53078586],"study_design_scores_gemma":[0.0008198009,0.0015711746,0.010393233,0.00020209934,0.00006777862,0.0001233242,0.0007838984,0.9759326,0.005346474,0.00363285,0.0005843362,0.0005424589],"about_ca_topic_score_codex":0.000044519773,"about_ca_topic_score_gemma":0.00044743408,"teacher_disagreement_score":0.9011798,"about_ca_system_score_codex":0.000017357701,"about_ca_system_score_gemma":0.000035198493,"threshold_uncertainty_score":0.49370068},"labels":[],"label_agreement":null},{"id":"W2139964171","doi":"10.1016/j.disc.2010.03.007","title":"On the base sequence conjecture","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"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":"Conjecture; Mathematics; Combinatorics; Base (topology); Hadamard transform; Hadamard matrix; Sequence (biology); Graph; Order (exchange); Discrete mathematics","score_opus":0.012978194770711046,"score_gpt":0.21385572170279482,"score_spread":0.20087752693208377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139964171","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.9544487,0.000018976814,0.0033740513,0.00019395912,0.0005175592,0.0002079781,0.000025145704,0.00025095593,0.040962704],"genre_scores_gemma":[0.99914443,0.0000015082088,0.00048650737,0.00007686608,0.00005348347,0.000022579052,0.0000028310228,0.000024669396,0.00018714421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995221,0.000015801057,0.00012938706,0.00007383544,0.000115303235,0.00014356658],"domain_scores_gemma":[0.99928707,0.00022326807,0.00002293344,0.0004152934,0.000010068158,0.00004134652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022447637,0.00011939076,0.000105287036,0.00002186004,0.00006861909,0.0000411673,0.00020582024,0.00006215432,0.0002799861],"category_scores_gemma":[0.00007365479,0.000069294736,0.00005633758,0.00008333031,0.000055341214,0.000031433316,0.000011538553,0.00027973615,0.00021089619],"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":[9.054502e-7,0.000008013669,0.000006854414,0.0000867873,0.000018409284,0.0000050054095,0.0010863254,0.0003842928,0.021146776,0.97583574,0.0013207021,0.00010019453],"study_design_scores_gemma":[0.00031152938,0.00006171774,0.000043835378,0.00022597883,0.000049253587,0.00010758318,0.0016127442,0.1270978,0.056364916,0.8062653,0.00720479,0.00065457774],"about_ca_topic_score_codex":7.639718e-7,"about_ca_topic_score_gemma":0.0000047072695,"teacher_disagreement_score":0.16957046,"about_ca_system_score_codex":0.0000049335295,"about_ca_system_score_gemma":0.0000039290994,"threshold_uncertainty_score":0.30656514},"labels":[],"label_agreement":null},{"id":"W2140257813","doi":"10.1016/j.disc.2011.07.005","title":"Forbidden configurations and repeated induction","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Mathematics; Forb; Simple (philosophy); Matrix (chemical analysis); Conjecture; Permutation (music); Concatenation (mathematics); Discrete mathematics; Physics","score_opus":0.026610481705318167,"score_gpt":0.2025038179924041,"score_spread":0.17589333628708595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140257813","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.8593003,0.000105249535,0.015285375,0.00000808081,0.00021168347,0.00019721505,0.000009383217,0.00034393268,0.124538764],"genre_scores_gemma":[0.99815565,0.000011079801,0.0015823162,0.000003816602,0.000020436206,0.000016609663,0.0000058301493,0.00001645796,0.00018778136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996433,0.000009524398,0.00014957173,0.000061192164,0.00004852437,0.000087860746],"domain_scores_gemma":[0.99976814,0.000012625467,0.000022998936,0.00014559372,0.000014519853,0.000036104087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008736301,0.00007581177,0.00009232397,0.000038585837,0.000043392443,0.000017451275,0.00004413658,0.000046074383,0.00007837768],"category_scores_gemma":[0.000012061552,0.00006610728,0.000021947933,0.00006758096,0.00002772382,0.000088207664,0.00000703466,0.000053614578,0.000029416798],"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.000008810041,0.000058588932,0.00036917554,0.0007912028,0.00023246108,0.000011166405,0.04999051,0.0000773694,0.031299356,0.9134859,0.0011556601,0.002519812],"study_design_scores_gemma":[0.0016907206,0.00028982092,0.009914862,0.00073623,0.00041759468,0.00051788596,0.033805132,0.10789659,0.13161531,0.70561624,0.0053994204,0.0021001736],"about_ca_topic_score_codex":0.000003509223,"about_ca_topic_score_gemma":0.0000026333287,"teacher_disagreement_score":0.20786963,"about_ca_system_score_codex":0.0000051658335,"about_ca_system_score_gemma":0.000001782977,"threshold_uncertainty_score":0.26957765},"labels":[],"label_agreement":null},{"id":"W2140841129","doi":"10.1109/jlt.2002.802224","title":"Optical OOK-CDMA and PPM-CDMA systems with turbo product codes","year":2002,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"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":"Partenariat Canadien Contre Le Cancer; Orta Doğu Teknik Üniversitesi; Texas A and M University","keywords":"Turbo code; Code division multiple access; Electronic engineering; Pulse-position modulation; Computer science; Bit error rate; On-off keying; Turbo; Decoding methods; Telecommunications; Phase-shift keying; Engineering; Detector; Pulse-amplitude modulation; Pulse (music)","score_opus":0.005944930192634994,"score_gpt":0.1608302092349353,"score_spread":0.1548852790423003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140841129","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.98092943,0.012059781,0.0006506676,0.00078238425,0.00066343864,0.00019435698,0.000002769902,0.00027386894,0.0044433074],"genre_scores_gemma":[0.9986156,0.00026902198,0.00063688395,0.000009808405,0.000219204,0.0000050475605,2.244453e-7,0.000033758184,0.0002104062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998831,0.000032547574,0.0004867762,0.00015585117,0.00019696938,0.00029689845],"domain_scores_gemma":[0.99929684,0.000051502873,0.00015768691,0.0002721447,0.000119889,0.000101916696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028046747,0.00020781884,0.000491002,0.0004736562,0.000060604834,0.00004583116,0.00023667412,0.00020782398,0.00002556345],"category_scores_gemma":[0.000043027154,0.00014477514,0.000053531396,0.00032773652,0.000204495,0.00015097453,0.000026341488,0.0005018099,0.000020608475],"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.0007787655,0.0010995701,0.03652137,0.003218278,0.0053046765,0.0075366218,0.004025075,0.009459914,0.28099638,0.5588881,0.030826563,0.061344683],"study_design_scores_gemma":[0.011616447,0.012391071,0.0045297695,0.0049461294,0.0013652096,0.15679124,0.0069726086,0.02331439,0.50609154,0.024483183,0.2429134,0.004585022],"about_ca_topic_score_codex":8.659555e-7,"about_ca_topic_score_gemma":0.0000024860192,"teacher_disagreement_score":0.53440493,"about_ca_system_score_codex":0.00003843717,"about_ca_system_score_gemma":0.000007694378,"threshold_uncertainty_score":0.5903759},"labels":[],"label_agreement":null},{"id":"W2141974261","doi":"10.1109/lpt.2005.857246","title":"Demonstration of encoding and decoding 2-D wavelength-time bipolar codes for OCDMA systems with differential detection","year":2005,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","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":"McGill University","funders":"","keywords":"Decoding methods; Encoder; Computer science; Encoding (memory); Code division multiple access; Differential coding; Multiplexing; Time-division multiplexing; Interference (communication); Wavelength-division multiplexing; Electronic engineering; Division (mathematics); Wavelength; Differential (mechanical device); Code (set theory); Algorithm; Telecommunications; Physics; Optics; Engineering; Arithmetic; Mathematics; Channel (broadcasting); Artificial intelligence","score_opus":0.004465443938764165,"score_gpt":0.18033391205024152,"score_spread":0.17586846811147736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141974261","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.92525494,0.00034490213,0.07325204,0.00007285136,0.0002721,0.00039219676,0.0000141901155,0.00036680367,0.000029982124],"genre_scores_gemma":[0.9986832,0.000050357714,0.0010691102,0.000011591605,0.000044640226,0.00010151706,0.00000293764,0.00003180195,0.0000048475963],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991556,0.000019684327,0.0002992525,0.00019440638,0.00008378126,0.00024728218],"domain_scores_gemma":[0.99959344,0.00006755049,0.000096980155,0.00018094531,0.000031242045,0.000029823988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016371,0.00017346744,0.0002666417,0.00033469038,0.000088299086,0.000024578696,0.00011514206,0.00020536556,0.0000012253773],"category_scores_gemma":[0.000007870697,0.00016688388,0.00004127718,0.00018931543,0.000120577504,0.00012250437,0.000008526967,0.00017088446,0.0000019192953],"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.000025633635,0.000009630622,0.00034262968,0.00013147139,0.00009251994,0.0000011534139,0.0000865273,0.004101552,0.98940974,0.000803562,0.00001707788,0.00497847],"study_design_scores_gemma":[0.00045653197,0.00006892696,0.000026076215,0.000079165206,0.00005339242,0.000077585486,0.00009303191,0.28176987,0.71675485,0.000054939992,0.00037797945,0.00018765077],"about_ca_topic_score_codex":0.0000042619818,"about_ca_topic_score_gemma":0.000020163585,"teacher_disagreement_score":0.27766833,"about_ca_system_score_codex":0.00005563042,"about_ca_system_score_gemma":0.000005620118,"threshold_uncertainty_score":0.6805327},"labels":[],"label_agreement":null},{"id":"W2141983993","doi":"10.1109/tcomm.2002.1006559","title":"Optimum threshold detection in real-time scalable high-speed multi-wavelength optical code-division multiple-access LANs","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"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":"Computer science; Division (mathematics); Code (set theory); Scalability; Code division multiple access; Electronic engineering; Maximization; Wavelength-division multiplexing; Wavelength; Computer network; Optics; Mathematics; Mathematical optimization; Engineering; Physics","score_opus":0.04787473468796925,"score_gpt":0.263618913198702,"score_spread":0.21574417851073274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141983993","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.56922406,0.00026061456,0.41411802,0.00045188583,0.001084198,0.0014115259,0.00025019795,0.0020927764,0.011106747],"genre_scores_gemma":[0.99587977,0.0010455577,0.0022736196,0.000016967902,0.000018312034,0.00017613308,0.000017656303,0.00007142032,0.00050059275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984304,0.00016881531,0.0005270716,0.0002871139,0.00020361974,0.00038301756],"domain_scores_gemma":[0.9976816,0.00041608047,0.00005136861,0.001643187,0.00006694223,0.00014082792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028472824,0.0002782834,0.00031267214,0.0003976071,0.00044354398,0.00010746476,0.00086888985,0.00023215586,0.00021907355],"category_scores_gemma":[0.000010261236,0.00030454202,0.00013562833,0.00076358346,0.00013682082,0.00045139433,0.000010037115,0.00069245824,0.00043187625],"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.00006969664,0.0023116975,0.00024085198,0.00010747516,0.00020644716,0.00000855938,0.0013974423,0.8489156,0.116479635,0.0007131734,0.00025402274,0.029295439],"study_design_scores_gemma":[0.0011525586,0.000060037677,0.0011047715,0.00010637458,0.00003443871,0.000009744957,0.00009786149,0.97201,0.02460225,0.000085956846,0.00038736625,0.0003486251],"about_ca_topic_score_codex":0.00019329131,"about_ca_topic_score_gemma":0.0013466388,"teacher_disagreement_score":0.4266557,"about_ca_system_score_codex":0.0001696922,"about_ca_system_score_gemma":0.000008257629,"threshold_uncertainty_score":0.9999407},"labels":[],"label_agreement":null},{"id":"W2142062721","doi":"10.1016/s0012-365x(99)00359-3","title":"On the problem of a matching orthogonal to a 2-factorization","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Graph factorization; Factorization; Bipartite graph; Enhanced Data Rates for GSM Evolution; Graph; Factor-critical graph; Discrete mathematics; Algorithm; Line graph; Graph power; Computer science; Artificial intelligence","score_opus":0.007633022768852604,"score_gpt":0.1989644467495303,"score_spread":0.19133142398067768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142062721","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.9343497,0.000011165789,0.028478213,0.00004778507,0.00003576633,0.0002920291,0.000016568234,0.00009650179,0.036672242],"genre_scores_gemma":[0.9979034,0.0000023954697,0.0017500868,0.00002528035,0.000019540534,0.000027537637,0.0000033752456,0.000022015627,0.00024639018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944484,0.000020234038,0.00021083823,0.00006309772,0.0001476481,0.00011335328],"domain_scores_gemma":[0.9996447,0.00010029305,0.000025094861,0.00018568819,0.000011943831,0.00003225647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017712703,0.000095446856,0.00012286128,0.00003281552,0.000039367602,0.000019491634,0.0001239202,0.000030105524,0.00033655143],"category_scores_gemma":[0.000007074952,0.00006194268,0.00004910222,0.00015423006,0.000012236893,0.000033988184,0.0000069228463,0.00006478406,0.000102761434],"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.000011010836,0.000036877045,0.000024484492,0.00039308175,0.000057039,0.0000011006703,0.012741977,0.03829768,0.0044545736,0.94162416,0.0003792615,0.0019787739],"study_design_scores_gemma":[0.00036830807,0.0001845896,0.00032329376,0.0013174511,0.00006158839,0.000018009849,0.0025561021,0.034126904,0.011260935,0.94552356,0.0036331688,0.00062607025],"about_ca_topic_score_codex":0.0000011804927,"about_ca_topic_score_gemma":0.0000015107227,"teacher_disagreement_score":0.063553646,"about_ca_system_score_codex":0.000008870753,"about_ca_system_score_gemma":0.0000031714085,"threshold_uncertainty_score":0.3685002},"labels":[],"label_agreement":null},{"id":"W2143080844","doi":"10.1109/glocom.2007.460","title":"Towards Spectrally Efficient 2-D Optical CDMA Transmission with M-ary Symbols and Poisson Noise","year":2007,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Transmission (telecommunications); Computer science; Modulation (music); Spectral efficiency; Code division multiple access; Electronic engineering; Forward error correction; Bit error rate; Noise (video); Probabilistic logic; Chip; Channel (broadcasting); Algorithm; Telecommunications; Physics; Decoding methods; Engineering; Artificial intelligence","score_opus":0.00339969022946433,"score_gpt":0.18173157130984793,"score_spread":0.17833188108038361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143080844","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.8369459,0.0002800305,0.09413786,0.00006544431,0.000091930975,0.00017006524,0.0000010438976,0.00028808517,0.06801963],"genre_scores_gemma":[0.9974301,0.000013623878,0.0022670114,0.0000347263,0.000048449223,0.0000032414089,0.0000016524948,0.000024875459,0.00017633707],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991797,0.0000116128795,0.00017512003,0.00016420824,0.00017092856,0.00029839395],"domain_scores_gemma":[0.99959964,0.00003341191,0.000009009113,0.00013477844,0.000014736735,0.0002084254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032072165,0.0001566093,0.00016121725,0.00007526812,0.000046372643,0.000028773942,0.00007241954,0.00008100867,0.00009046657],"category_scores_gemma":[0.0000032928472,0.00011074947,0.00003790595,0.00013953625,0.00004124089,0.00004562803,0.000006821437,0.00012746667,0.000014212885],"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.0020073263,0.00064899365,0.002879996,0.0015702628,0.00045298363,0.001022517,0.0077155167,0.046445906,0.46220896,0.2887116,0.0012237193,0.18511221],"study_design_scores_gemma":[0.0049951724,0.0013858054,0.088639,0.00084374804,0.00020201088,0.0010194817,0.0024121937,0.0744107,0.80992514,0.0022727204,0.011531998,0.002362048],"about_ca_topic_score_codex":0.0000073504916,"about_ca_topic_score_gemma":0.0000054763577,"teacher_disagreement_score":0.34771618,"about_ca_system_score_codex":0.000020025063,"about_ca_system_score_gemma":0.000008834668,"threshold_uncertainty_score":0.4516232},"labels":[],"label_agreement":null},{"id":"W2143181416","doi":"","title":"Effects of encoder/decoder mismatch on BER performance for 2-D wavelength-time OCDMA","year":2004,"lang":"en","type":"article","venue":"Conference on Lasers and Electro-Optics","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":"McGill University","funders":"","keywords":"Encoder; Computer science; Bit error rate; Decoding methods; Electronic engineering; Telecommunications; Engineering","score_opus":0.006380093510712681,"score_gpt":0.1895461478499271,"score_spread":0.18316605433921443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143181416","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.9930697,0.00009524423,0.0024908485,0.00007667704,0.00019734242,0.00037507518,0.000011220354,0.00008961542,0.0035942919],"genre_scores_gemma":[0.9988192,0.00031704523,0.00035250254,0.00007305516,0.00006193587,0.0000480744,0.000009660099,0.000032834458,0.00028570235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906635,0.000017464106,0.00021598797,0.00020095128,0.00012631407,0.00037293634],"domain_scores_gemma":[0.99948364,0.000133313,0.00004693848,0.00018458595,0.000059165475,0.0000923595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121036,0.00023081923,0.00029890964,0.00008266722,0.000083865,0.0000296048,0.00012291389,0.00013167804,0.000008030923],"category_scores_gemma":[0.000017044093,0.00020908719,0.00006935397,0.00009519117,0.000055350436,0.00007482604,0.000008414761,0.00016934582,0.000023373175],"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.0011102126,0.0006610501,0.00019043991,0.00536215,0.0006303344,0.00002560871,0.003240934,0.026921691,0.42695847,0.4916619,0.0015048072,0.041732393],"study_design_scores_gemma":[0.0027112833,0.0023452553,0.00028008362,0.0006131565,0.00009295299,0.00001236343,0.00009177383,0.13246685,0.84461826,0.015389558,0.00073255284,0.000645924],"about_ca_topic_score_codex":0.0000019902377,"about_ca_topic_score_gemma":0.000001647071,"teacher_disagreement_score":0.47627234,"about_ca_system_score_codex":0.000032705408,"about_ca_system_score_gemma":0.000032729324,"threshold_uncertainty_score":0.85263276},"labels":[],"label_agreement":null},{"id":"W2143668983","doi":"10.46298/dmtcs.317","title":"On Linear Layouts of Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":116,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Discrete mathematics; Mathematical proof","score_opus":0.00802119738390963,"score_gpt":0.2237613964525075,"score_spread":0.21574019906859787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143668983","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.4399654,0.00002566502,0.546449,0.00003688031,0.00037037267,0.00016575286,0.0000071790587,0.00018782167,0.01279195],"genre_scores_gemma":[0.96967304,0.0000022747877,0.030234752,0.000034814308,0.000028302462,0.0000051216534,8.838245e-7,0.000018676552,0.0000021205701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986316,0.00001978468,0.00032991823,0.00022370237,0.00046457016,0.0003304276],"domain_scores_gemma":[0.9991177,0.00013653997,0.00004416515,0.0004975153,0.00006029474,0.00014379548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051320135,0.00017798707,0.00025443005,0.0001602751,0.000102781865,0.000048503458,0.00064679247,0.00005109513,0.000034156095],"category_scores_gemma":[0.000044827426,0.00013560319,0.00010402389,0.0005798976,0.0014167961,0.00010863654,0.000086947766,0.00014263988,0.000060194056],"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.0000032859955,0.000042520907,0.000002652775,0.000083372644,0.000008623246,0.0000033300082,0.0012293844,0.011299633,0.0014472706,0.98571056,0.000004681467,0.00016471019],"study_design_scores_gemma":[0.00018779431,0.00010945236,0.000015781647,0.00018536008,0.000008456031,0.000011629878,0.00006656185,0.15540785,0.013898341,0.82994217,0.0000045828915,0.00016200483],"about_ca_topic_score_codex":4.882962e-7,"about_ca_topic_score_gemma":1.4087857e-7,"teacher_disagreement_score":0.5297077,"about_ca_system_score_codex":0.000019578194,"about_ca_system_score_gemma":0.000017522105,"threshold_uncertainty_score":0.5529737},"labels":[],"label_agreement":null},{"id":"W2143717356","doi":"10.1109/icc.2003.1204601","title":"Comparison of utilization in optical CDMA and WDMA broadcast local-area networks with physical noise","year":2004,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Code division multiple access; Computer science; Interference (communication); Computer network; Throughput; Electronic engineering; Channel (broadcasting); Wavelength-division multiplexing; Margin (machine learning); Telecommunications; Wireless; Engineering; Optoelectronics; Materials science","score_opus":0.016713225934652094,"score_gpt":0.24128035234024822,"score_spread":0.22456712640559612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143717356","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.7382476,0.00011623023,0.25879085,0.000005914601,0.000029661252,0.0000844815,5.3146454e-7,0.000054025462,0.0026707554],"genre_scores_gemma":[0.9997304,0.0000065698882,0.00020743848,0.00000468042,0.000020306166,0.000005856061,0.000004101026,0.000012956636,0.000007677362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995115,0.000012575991,0.00015727314,0.00010131543,0.00008130269,0.00013603407],"domain_scores_gemma":[0.9997934,0.000027131646,0.000015027185,0.000098972894,0.0000150423175,0.000050433948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051633706,0.000098916425,0.00021059152,0.0000446904,0.00001414427,0.000010312523,0.00004316565,0.00005535927,0.000006310573],"category_scores_gemma":[0.0000023331133,0.00007917092,0.000018028823,0.00019342086,0.000077420984,0.00006777215,0.0000097686725,0.00009709822,0.0000021420767],"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.000036377904,0.0001020306,0.008206058,0.000054181462,0.000013413818,0.0000033445838,0.000610411,0.96340984,0.0005063854,0.021864787,0.000013341822,0.0051798215],"study_design_scores_gemma":[0.00097103603,0.00016314395,0.013695034,0.00014490249,0.000015017404,0.000010341332,0.0008739554,0.9759017,0.007449884,0.00054515235,0.000053407548,0.00017641016],"about_ca_topic_score_codex":0.000016947317,"about_ca_topic_score_gemma":0.000046001245,"teacher_disagreement_score":0.26148286,"about_ca_system_score_codex":0.00001706277,"about_ca_system_score_gemma":0.0000044274866,"threshold_uncertainty_score":0.32284963},"labels":[],"label_agreement":null},{"id":"W2143975610","doi":"10.1109/pacrim.1989.48370","title":"Coset code constructions of N-dimensional sphere packings from 1- and 2-dimensional lattices","year":2003,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Coset; Hamming bound; Dimension (graph theory); Hamming distance; Metric (unit); Hamming code; Code (set theory); Combinatorics; Base (topology); Mathematics; Discrete mathematics; Computer science; Block code; Algorithm; Decoding methods; Mathematical analysis","score_opus":0.007439341000288935,"score_gpt":0.1875555532911451,"score_spread":0.18011621229085617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143975610","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.9862445,0.00046000583,0.00014713054,0.000014715555,0.00035427284,0.0000637673,0.00009646404,0.00008707987,0.012532091],"genre_scores_gemma":[0.9973681,0.0000074064874,0.0024165192,0.000027467506,0.000016657368,0.0000032123826,0.000010845869,0.000011961257,0.00013782886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944663,0.00003546135,0.00018122113,0.000117559146,0.000106142514,0.00011298597],"domain_scores_gemma":[0.99963486,0.00013645366,0.000027639659,0.00011279974,0.000025816174,0.00006245305],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009000131,0.00010224372,0.0001541685,0.000031505595,0.000050394887,0.000010193863,0.000036308622,0.000063663356,0.0009971384],"category_scores_gemma":[0.0000125265005,0.00009154746,0.00003588724,0.00007665841,0.00009797851,0.000075917946,0.000009554067,0.00007324742,0.000020073137],"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.000059921596,0.00016576647,0.066072546,0.0002454891,0.00087996013,0.000017153121,0.00082904997,0.019568741,0.17207217,0.72185093,0.015633456,0.0026047966],"study_design_scores_gemma":[0.007839185,0.0003483562,0.05616282,0.0009173614,0.00053240027,0.0007116206,0.004934035,0.05060862,0.35528988,0.36512083,0.15436046,0.0031744605],"about_ca_topic_score_codex":0.000033878016,"about_ca_topic_score_gemma":0.0000916187,"teacher_disagreement_score":0.35673013,"about_ca_system_score_codex":0.000006114395,"about_ca_system_score_gemma":0.000010341522,"threshold_uncertainty_score":0.9999161},"labels":[],"label_agreement":null},{"id":"W2145690369","doi":"10.1109/glocom.2000.891331","title":"Multirate optical fast frequency hopping CDMA system using power control","year":2002,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Interference (communication); Computer science; Code division multiple access; Power control; Quality of service; Frequency-hopping spread spectrum; Electronic engineering; Signal-to-interference ratio; Power (physics); Spread spectrum; Computer network; Variable (mathematics); Telecommunications; Engineering; Mathematics","score_opus":0.012221982270536988,"score_gpt":0.1790603116640902,"score_spread":0.1668383293935532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145690369","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.7279124,0.0007633335,0.10551789,0.000019046029,0.0013902076,0.00035195262,0.000011289253,0.0013047942,0.16272904],"genre_scores_gemma":[0.99882555,0.0000021540593,0.00080347277,0.00002926276,0.000098839155,0.0000076107453,6.140119e-7,0.000040636238,0.00019186105],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989352,0.000050115206,0.00032243633,0.00017886085,0.00014050365,0.00037288302],"domain_scores_gemma":[0.9995117,0.00004897468,0.00002615789,0.00025402833,0.000033950004,0.00012514924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017307453,0.00019740728,0.00026394284,0.00008973865,0.00009055645,0.00006484007,0.0001326316,0.00011694844,0.0003266455],"category_scores_gemma":[0.000011078992,0.0001767223,0.00010181563,0.00015784733,0.000031702824,0.00016769156,0.000010002385,0.00014700745,0.00038310685],"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.000028404009,0.00016320337,0.004156963,0.0012871756,0.0008865249,0.0005181029,0.0030656632,0.12512656,0.513982,0.34644005,0.001014364,0.003330996],"study_design_scores_gemma":[0.0010474882,0.000034283396,0.00021068778,0.0002204872,0.00004155469,0.00015708059,0.0013101402,0.9939639,0.0021790355,0.00006687926,0.00028460787,0.00048384594],"about_ca_topic_score_codex":0.000014460769,"about_ca_topic_score_gemma":0.000002654194,"teacher_disagreement_score":0.86883736,"about_ca_system_score_codex":0.000078558594,"about_ca_system_score_gemma":0.0000025080155,"threshold_uncertainty_score":0.72065264},"labels":[],"label_agreement":null},{"id":"W2145896379","doi":"10.13001/1081-3810.1270","title":"A further look into combinatorial orthogonality","year":2008,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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 Waterloo","funders":"","keywords":"Mathematics; Converse; Unitary state; Block matrix; Orthogonality; Unitary matrix; Matrix (chemical analysis); Degree (music); Circular ensemble; Combinatorics; Pure mathematics; Algebra over a field; Eigenvalues and eigenvectors","score_opus":0.005878386680850079,"score_gpt":0.20296672907733945,"score_spread":0.19708834239648937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145896379","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.9912157,0.003939435,0.002635381,0.0000683843,0.0010794078,0.00006809474,8.6887485e-7,0.000064075226,0.0009286512],"genre_scores_gemma":[0.9986552,0.00026422585,0.00007971512,0.000028956241,0.0008540067,0.000001771788,0.0000012071285,0.00003306475,0.00008185428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986546,0.000096244636,0.0004729827,0.000087076376,0.00027862945,0.00041047545],"domain_scores_gemma":[0.9994545,0.00005190877,0.00012084406,0.00016443973,0.00010157221,0.00010671585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066824444,0.00015418722,0.00030238452,0.0001040496,0.00008510352,0.000010173069,0.00023907101,0.00009395081,0.00010900341],"category_scores_gemma":[0.000030558953,0.00013475338,0.00020244512,0.00020487269,0.000058164478,0.00016188565,0.000013008811,0.00062105467,0.00005633263],"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.0015499223,0.0011051127,0.022279724,0.0005087892,0.004512384,0.0010623189,0.019040823,0.010123288,0.0471822,0.8710644,0.011159218,0.010411804],"study_design_scores_gemma":[0.013415413,0.003844266,0.00616909,0.00036331438,0.0003873227,0.010448565,0.0013707065,0.004743187,0.05551541,0.6942433,0.20713037,0.0023690339],"about_ca_topic_score_codex":0.0000045256447,"about_ca_topic_score_gemma":0.0000060057855,"teacher_disagreement_score":0.19597116,"about_ca_system_score_codex":0.00012157612,"about_ca_system_score_gemma":0.00017953177,"threshold_uncertainty_score":0.54950833},"labels":[],"label_agreement":null},{"id":"W2146303957","doi":"10.1109/lcomm.2003.812170","title":"Comparison of diverse optical CDMA codes using a normalized throughput metric","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","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":"University of Toronto","funders":"","keywords":"Metric (unit); Code division multiple access; Computer science; Throughput; Bit error rate; Measure (data warehouse); Code (set theory); Range (aeronautics); Algorithm; Mathematics; Telecommunications; Data mining; Wireless; Decoding methods; Engineering","score_opus":0.0742782014756051,"score_gpt":0.3219493300186769,"score_spread":0.24767112854307183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146303957","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.9518815,0.0011422242,0.041222576,0.00009491088,0.0003336358,0.00018367682,0.000011293152,0.00014019368,0.004989992],"genre_scores_gemma":[0.9854876,0.000050162012,0.014337126,0.000068277135,0.000011197866,0.000014196264,0.0000065678328,0.000019771156,0.000005097699],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900573,0.0002203353,0.0003659871,0.00009205591,0.00013075353,0.0001851272],"domain_scores_gemma":[0.99846303,0.00025727425,0.000070339716,0.0011201906,0.000039060393,0.000050091712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027564805,0.00012689049,0.00028152156,0.00018886727,0.0001536732,0.00002150861,0.00055584824,0.00005917544,0.000019634997],"category_scores_gemma":[0.00003947075,0.00013505909,0.00009900852,0.00058912823,0.00019977179,0.00012848912,0.00004110079,0.0001975492,0.000020717533],"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.000022197773,0.00042691722,0.024945755,0.00023452852,0.00054944906,0.000004089907,0.004621172,0.17758006,0.7198314,0.06702578,0.0036850618,0.0010735489],"study_design_scores_gemma":[0.004867099,0.00015736524,0.0050248387,0.0005888628,0.0009626795,0.00012657366,0.009214988,0.3935841,0.5226487,0.0013929765,0.058910895,0.0025209032],"about_ca_topic_score_codex":0.000029631423,"about_ca_topic_score_gemma":0.000012854378,"teacher_disagreement_score":0.21600404,"about_ca_system_score_codex":0.000051480725,"about_ca_system_score_gemma":0.000008876508,"threshold_uncertainty_score":0.55075496},"labels":[],"label_agreement":null},{"id":"W2146551015","doi":"10.1016/j.disc.2009.03.047","title":"Hamiltonian decompositions of complete<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Hamiltonian (control theory); Scroll; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.013538983090129991,"score_gpt":0.22829075911196148,"score_spread":0.2147517760218315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146551015","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.9825945,0.00025699582,0.0055592004,0.00007542148,0.00040460555,0.000112603164,0.00025260792,0.000284457,0.010459641],"genre_scores_gemma":[0.99168205,0.00010119509,0.007495997,0.00012100517,0.0001598203,0.00007842663,0.00019118466,0.00012235486,0.000047966656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765325,0.000043719177,0.0008651372,0.00033122147,0.00051665306,0.00059002225],"domain_scores_gemma":[0.998239,0.00022952245,0.00032425468,0.00093496585,0.00005391731,0.0002183815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004105098,0.00040694646,0.00039206166,0.00016730615,0.0003370111,0.00015323311,0.0005514871,0.00032781894,0.00004337176],"category_scores_gemma":[0.00006586158,0.00045062456,0.0005388175,0.00035738293,0.00019388797,0.00029538063,0.00011527914,0.0003631363,0.00034421418],"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.000034835484,0.0001254383,0.000008176461,0.00065849914,0.0002478786,0.00004244113,0.0016962439,0.0030128288,0.007027314,0.9866967,0.00025142892,0.00019818962],"study_design_scores_gemma":[0.0005487252,0.00027119252,0.000121218654,0.00067921245,0.00025226886,0.00020825745,0.0010329965,0.9772614,0.006832686,0.011348041,0.0009449706,0.0004990143],"about_ca_topic_score_codex":0.000027597149,"about_ca_topic_score_gemma":0.00004369454,"teacher_disagreement_score":0.9753487,"about_ca_system_score_codex":0.000016019887,"about_ca_system_score_gemma":0.000048245103,"threshold_uncertainty_score":0.99979454},"labels":[],"label_agreement":null},{"id":"W2147430715","doi":"10.1109/rsp.2005.8","title":"A Rapid System Prototyping Platform for Error Control Coding in Optical CDMA Networks","year":2006,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; Debugging; Emulation; Rapid prototyping; Embedded system; Coding (social sciences); MATLAB; Turbo code; Software prototyping; Communications system; Computer architecture; Computer hardware; Decoding methods; Engineering; Software; Operating system; Computer network; Software development","score_opus":0.010360482984398345,"score_gpt":0.19508030919846994,"score_spread":0.1847198262140716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147430715","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.14838196,0.0007133268,0.79431146,0.000028098822,0.0009477538,0.00465002,0.000009981764,0.0011759636,0.049781423],"genre_scores_gemma":[0.9983421,0.0000014327239,0.00044078045,0.000012963821,0.00023938825,0.0008515893,0.000006086634,0.00003485013,0.00007081287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989548,0.000016717544,0.00038904505,0.00015520133,0.000077732024,0.00040651322],"domain_scores_gemma":[0.999618,0.00014568368,0.000025982059,0.00014060925,0.000019824442,0.000049908343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046307215,0.00016094549,0.00028688717,0.00009602592,0.00005910811,0.000045213885,0.00010421099,0.00013601105,0.000011779485],"category_scores_gemma":[0.000007821275,0.00014416076,0.0000933214,0.00014187054,0.000017209286,0.00011943862,0.0000068153195,0.00012820409,0.000008926237],"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.00020517176,0.000037428887,0.0009523682,0.0010964803,0.000070512375,0.00001894382,0.00010659056,0.28556466,0.0013118677,0.7067366,0.0005684943,0.0033308459],"study_design_scores_gemma":[0.0016412289,0.000040461164,0.00041081972,0.0002496579,0.000013211149,0.000019697829,0.00033070554,0.99466366,0.0005449093,0.00037234274,0.0014872346,0.00022606135],"about_ca_topic_score_codex":0.000016313974,"about_ca_topic_score_gemma":0.00003371176,"teacher_disagreement_score":0.84996015,"about_ca_system_score_codex":0.0000828314,"about_ca_system_score_gemma":0.0000058518963,"threshold_uncertainty_score":0.58787054},"labels":[],"label_agreement":null},{"id":"W2148158683","doi":"10.1002/0471224561.ch4","title":"Channel Assignment and Graph Multicoloring","year":2002,"lang":"en","type":"other","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":98,"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":"Base station; Graph; Channel (broadcasting); Interference (communication); Base (topology); Computer science; Frequency reuse; Reuse; Topology (electrical circuits); Mathematics; Algorithm; Combinatorics; Theoretical computer science; Computer network; Engineering","score_opus":0.009913741816565786,"score_gpt":0.17045795565768482,"score_spread":0.16054421384111903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148158683","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.000051387357,0.0028539528,0.0037935935,0.0000037009863,0.0007311382,0.00018841172,0.000007428451,0.0008092074,0.9915612],"genre_scores_gemma":[0.11294588,0.00069111405,0.000106453575,0.000014848424,0.00022770693,0.000056362056,0.000003185876,0.0004224088,0.885532],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999534,0.000011234492,0.00009234706,0.00013265923,0.00007079853,0.00015897135],"domain_scores_gemma":[0.99976456,0.000010254332,0.000016814078,0.00014704267,0.0000019894057,0.00005931361],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000042160034,0.0001802338,0.00018189698,0.00015269342,0.000015707188,0.00001742109,0.000060842416,0.0001638338,0.0014580801],"category_scores_gemma":[0.0000011890115,0.00015953396,0.00003731481,0.000051230967,0.000018187271,0.000014951655,0.000012639835,0.00009175736,0.00012391599],"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.0000018133443,0.000033477572,0.000037405076,0.0009118544,0.00037087072,0.000027926308,0.00035746713,0.0019816342,0.00020993479,0.0045528617,0.98780346,0.0037112834],"study_design_scores_gemma":[0.00039926652,0.000024900963,0.00002202575,0.00036711057,0.00003991976,0.000012238405,0.00014430966,0.0064632376,0.00025057653,0.00039300657,0.99124575,0.0006376373],"about_ca_topic_score_codex":0.000017886116,"about_ca_topic_score_gemma":0.000011779758,"teacher_disagreement_score":0.11289448,"about_ca_system_score_codex":0.000009356171,"about_ca_system_score_gemma":5.234621e-7,"threshold_uncertainty_score":0.99945474},"labels":[],"label_agreement":null},{"id":"W2148319623","doi":"10.1081/sta-120006078","title":"TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS","year":2002,"lang":"en","type":"article","venue":"Communication in Statistics- Theory and Methods","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":"Lakehead University","funders":"","keywords":"Sampling (signal processing); Block (permutation group theory); Plan (archaeology); Mathematics; Combinatorics; Computer science; Statistics; Geography","score_opus":0.07901378835451411,"score_gpt":0.3608490845190897,"score_spread":0.2818352961645756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148319623","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.076628365,0.008687418,0.90480256,0.00002170011,0.00041503832,0.0002501345,0.00015480423,0.00022092277,0.008819054],"genre_scores_gemma":[0.8413648,0.0003804915,0.15795946,0.000049625643,0.000018849894,0.00003518021,0.000035956105,0.000023401097,0.00013225724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758595,0.0016680686,0.00033992084,0.00013734824,0.000071261136,0.00019746409],"domain_scores_gemma":[0.99637043,0.0030052548,0.00005807818,0.00044328006,0.000053917258,0.00006905661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026443456,0.00014834476,0.0002393343,0.00011464782,0.00017367714,0.000035793728,0.0002188436,0.00006884437,0.000114254086],"category_scores_gemma":[0.00041157164,0.000155469,0.000016905728,0.00023092343,0.00013301335,0.00009222751,0.0000603095,0.00028180756,0.000009397149],"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.00004679952,0.000024706966,0.00034564722,0.00008971702,0.00004497339,0.0000031640568,0.0029680845,0.009153862,0.0047309045,0.9098069,0.00022116907,0.07256406],"study_design_scores_gemma":[0.0023582308,0.000073551266,0.002947596,0.00065908313,0.00007277219,0.00007992877,0.0024015661,0.18803526,0.0028960255,0.79269046,0.006893964,0.0008915658],"about_ca_topic_score_codex":0.0000058501787,"about_ca_topic_score_gemma":0.0000119874685,"teacher_disagreement_score":0.7647364,"about_ca_system_score_codex":0.000025810798,"about_ca_system_score_gemma":0.0000046595574,"threshold_uncertainty_score":0.63398415},"labels":[],"label_agreement":null},{"id":"W2148613230","doi":"10.1016/j.disc.2007.09.036","title":"Existence of HSOLSSOMs of type<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Mount Saint Vincent University; National Science Foundation","keywords":"Type (biology); Mathematics; Combinatorics","score_opus":0.018511940353796677,"score_gpt":0.23985099198396553,"score_spread":0.22133905163016887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148613230","genre_codex":"other","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.31497946,0.0031718006,0.002724876,0.00054503273,0.0053527146,0.00011874604,0.0010988857,0.00056962186,0.6714389],"genre_scores_gemma":[0.97584504,0.002689422,0.0075758607,0.0012227312,0.0037685733,0.0020284452,0.0028610942,0.0026139175,0.0013949363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9768063,0.0011551438,0.0058677653,0.0037852982,0.006269342,0.006116149],"domain_scores_gemma":[0.97989964,0.0044047832,0.0055828732,0.0066536865,0.0006238114,0.002835176],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005577645,0.0024964751,0.0011563977,0.0016956439,0.0026760106,0.0025833412,0.0061130053,0.0059423214,0.75041264],"category_scores_gemma":[0.0046365387,0.0049796063,0.005152197,0.0036729996,0.004398987,0.0032321957,0.004198442,0.0040783784,0.0046022334],"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.0027603689,0.00079278875,0.00003064404,0.006879753,0.004849715,0.0031463483,0.0073092254,0.0040479535,0.0060501816,0.583159,0.37912574,0.0018482596],"study_design_scores_gemma":[0.00398758,0.0033962738,0.00011454958,0.004399771,0.004030025,0.0039527724,0.008689048,0.058640745,0.90185463,0.0004918298,0.0061794505,0.0042633493],"about_ca_topic_score_codex":0.002407609,"about_ca_topic_score_gemma":0.001949113,"teacher_disagreement_score":0.8958044,"about_ca_system_score_codex":0.000052754865,"about_ca_system_score_gemma":0.0028297168,"threshold_uncertainty_score":0.9992644},"labels":[],"label_agreement":null},{"id":"W2148690319","doi":"10.1016/j.disc.2011.01.008","title":"Existence of cyclic <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>λ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-GDD of type <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:math> having prescribed number of short orbits","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Block (permutation group theory); Mathematics; Scroll; Algorithm; Combinatorics; Theology; Philosophy","score_opus":0.021680919208669144,"score_gpt":0.2432433234344426,"score_spread":0.22156240422577345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148690319","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.7424682,0.002496083,0.0020585663,0.0003216961,0.0047844285,0.00020604413,0.001617197,0.00073335867,0.24531442],"genre_scores_gemma":[0.9748508,0.0027086686,0.008504381,0.0010842425,0.0033857361,0.002941397,0.0029509235,0.0029647527,0.0006091005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9740092,0.0012368282,0.007031361,0.004598736,0.0068625887,0.006261267],"domain_scores_gemma":[0.97887146,0.0041647623,0.006662733,0.006541229,0.00083920156,0.0029206206],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005606943,0.003205884,0.0016458402,0.0015153443,0.0030921914,0.0026049002,0.006647016,0.0066124476,0.10375892],"category_scores_gemma":[0.005061189,0.0056591476,0.0058465484,0.003580768,0.004778148,0.0040006917,0.0053448835,0.0047598416,0.0043068053],"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.0039121276,0.0014066708,0.00006067064,0.008747388,0.006230034,0.0025695965,0.0084760655,0.004686139,0.00956315,0.8863613,0.06651505,0.0014718119],"study_design_scores_gemma":[0.003639498,0.0031634178,0.00012633466,0.00582697,0.005141264,0.004024433,0.006053329,0.30215907,0.6620902,0.0012539446,0.0023724425,0.004149099],"about_ca_topic_score_codex":0.0035942302,"about_ca_topic_score_gemma":0.0017832188,"teacher_disagreement_score":0.88510734,"about_ca_system_score_codex":0.00007215724,"about_ca_system_score_gemma":0.0030024282,"threshold_uncertainty_score":0.9987275},"labels":[],"label_agreement":null},{"id":"W2148696860","doi":"10.1109/ccece.2005.1557251","title":"Generation of regular logic cell structures for coding in real-time optical CDMA network","year":2006,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Block (permutation group theory); VHDL; Decoding methods; Convolutional code; Verilog; Code generation; Hardware description language; Computer hardware; Field-programmable gate array; Embedded system; Computer engineering; Algorithm","score_opus":0.016100058319464008,"score_gpt":0.2073668340124716,"score_spread":0.1912667756930076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148696860","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.93705916,0.00014530262,0.035920277,0.000007432011,0.0002095359,0.00023788944,0.0000032860585,0.00010225543,0.026314888],"genre_scores_gemma":[0.9924797,0.0000052206233,0.0069165877,0.000004092023,0.00024729795,0.0000113268015,0.000020843841,0.000012379953,0.0003025423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994816,0.00001907872,0.00021212202,0.000085115855,0.000051854833,0.00015018736],"domain_scores_gemma":[0.9998103,0.00004213242,0.000019293999,0.00009841144,0.000013945887,0.000015942382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016713863,0.00007541523,0.00013646016,0.000037245696,0.000020544228,0.000010552251,0.000050284587,0.000074622636,0.000036796228],"category_scores_gemma":[0.0000032080009,0.0000673241,0.000039467315,0.00008800617,0.000013010109,0.00003575585,0.0000050798794,0.000033092085,0.000002529152],"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.0000067528144,0.000006397568,0.00015337019,0.00005878315,0.0000043312734,9.0045006e-7,0.000017381217,0.40167776,0.2879373,0.30731574,0.0027271647,0.00009410781],"study_design_scores_gemma":[0.00078896194,0.00008217627,0.0028250555,0.00003896209,0.000021836828,0.0000049602413,0.000051362545,0.5341595,0.3644168,0.0967155,0.0005658129,0.00032906796],"about_ca_topic_score_codex":0.000018647577,"about_ca_topic_score_gemma":0.000024416431,"teacher_disagreement_score":0.21060024,"about_ca_system_score_codex":0.000013923472,"about_ca_system_score_gemma":0.0000023471096,"threshold_uncertainty_score":0.2745397},"labels":[],"label_agreement":null},{"id":"W2149617299","doi":"10.1109/glocom.2005.1578019","title":"2D optical CDMA networks using multi-wavelength pulse modulation and modified carrier-hopping prime sequence","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"McGill University","funders":"","keywords":"Code division multiple access; Modulation (music); Computer science; Interference (communication); Prime (order theory); Electronic engineering; Broadband; Optical communication; Telecommunications; Physics; Engineering; Mathematics; Channel (broadcasting)","score_opus":0.05076284663640882,"score_gpt":0.27804686886344787,"score_spread":0.22728402222703906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149617299","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.6106609,0.0017236839,0.37469503,0.00031662153,0.0007614304,0.00095473917,0.00020862314,0.00087105465,0.009807913],"genre_scores_gemma":[0.96942776,0.00062605663,0.029402748,0.00008788694,0.0001646222,0.00006479153,0.0001054028,0.000046118916,0.00007459838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997237,0.00026812984,0.0008660256,0.0004954786,0.00026330494,0.00087004126],"domain_scores_gemma":[0.9977292,0.000117082054,0.00017198245,0.0013900098,0.0002078464,0.00038388013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051208347,0.00051643536,0.0005365315,0.00016221305,0.0005706436,0.00027790916,0.0008674847,0.00040235912,0.000059012204],"category_scores_gemma":[0.000048835307,0.00058402674,0.00014176506,0.000567871,0.00029062794,0.0006472597,0.0001669662,0.0005876712,0.000033469787],"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.00004836728,0.00028692716,0.0022330298,0.000090096204,0.00035885753,0.000010832889,0.0005441163,0.77987266,0.0067165145,0.04191193,0.000573539,0.16735315],"study_design_scores_gemma":[0.00074866106,0.00002379488,0.0030776346,0.00012735164,0.00006919851,0.00013924671,0.00014402717,0.99131644,0.00027578702,0.00055668264,0.0028963892,0.00062477234],"about_ca_topic_score_codex":0.0002328207,"about_ca_topic_score_gemma":0.00071673194,"teacher_disagreement_score":0.35876685,"about_ca_system_score_codex":0.0004916627,"about_ca_system_score_gemma":0.00013030457,"threshold_uncertainty_score":0.9996611},"labels":[],"label_agreement":null},{"id":"W2149865162","doi":"10.1016/j.disc.2007.03.063","title":"Classes of optical orthogonal codes from arcs in root subspaces","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Linear subspace; Mathematics; Projective test; Combinatorics; Projective space; Projective plane; Finite geometry; Projective geometry; Discrete mathematics; Collineation; Pure mathematics; Algebraic geometry; Geometry","score_opus":0.01075960854073414,"score_gpt":0.23306942574860354,"score_spread":0.2223098172078694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149865162","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.96693635,0.00025490543,0.020285115,0.000008267288,0.00013747026,0.000098001095,0.000028327111,0.00007352188,0.012178052],"genre_scores_gemma":[0.99616355,0.000008084016,0.003711333,0.000002674564,0.000049872466,0.000004573884,0.000012470774,0.000023785413,0.000023686016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990805,0.000015534364,0.0004092582,0.00009607975,0.00018113446,0.00021753636],"domain_scores_gemma":[0.9993211,0.00035218793,0.000047480647,0.00020298612,0.000018353343,0.000057869416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038536932,0.0001347496,0.00028952074,0.000089427864,0.000015064899,0.000015530986,0.00014108636,0.00008759833,0.00003798212],"category_scores_gemma":[0.000049165028,0.000116931995,0.000068278525,0.00016382067,0.000067906774,0.00006107384,0.000020264415,0.0001198581,0.000015868784],"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.00008428613,0.00035539834,0.073654436,0.002105102,0.0003482988,0.00011357558,0.0141507555,0.005658383,0.06990321,0.83181393,0.00028036817,0.0015322389],"study_design_scores_gemma":[0.002553094,0.00024331313,0.13558966,0.0023482605,0.00024516977,0.000057518606,0.027372945,0.08413105,0.33982855,0.40409243,0.0014270046,0.0021110184],"about_ca_topic_score_codex":0.000007952087,"about_ca_topic_score_gemma":0.00029706306,"teacher_disagreement_score":0.42772153,"about_ca_system_score_codex":0.000014715286,"about_ca_system_score_gemma":0.000005521342,"threshold_uncertainty_score":0.47683483},"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":"W2150673229","doi":"10.1109/tcomm.2009.06.070334","title":"Performance degradation of source matching in optical CDMA due to source coherence effects","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Université Laval","funders":"","keywords":"Coherence (philosophical gambling strategy); Computer science; Bit error rate; Coherence time; Electronic engineering; Binary number; Channel (broadcasting); Code division multiple access; Source code; Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.012011184077959428,"score_gpt":0.22656550522105787,"score_spread":0.21455432114309844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150673229","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.5486299,0.000041897838,0.4493532,0.00011782838,0.00007989451,0.0002210691,0.000003003192,0.00012401534,0.0014292253],"genre_scores_gemma":[0.99693877,0.00004700775,0.002721474,0.00004135166,0.000006386422,0.000079401034,0.0000031423565,0.000016711761,0.00014574536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992012,0.000096905984,0.000299567,0.00011289131,0.000118914206,0.0001705419],"domain_scores_gemma":[0.99875295,0.00027605152,0.000030162557,0.00084202795,0.00003018711,0.000068645095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020321191,0.0001278432,0.0001865137,0.00022263234,0.000150471,0.000018052302,0.00045656163,0.0000739292,0.000007841272],"category_scores_gemma":[0.000005183198,0.00014216853,0.000057758203,0.00049594353,0.00004364949,0.00014330039,0.0000020907733,0.00031820883,0.00004143816],"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.000028274791,0.0002839915,0.00006330981,0.00009254542,0.00002656511,6.622003e-7,0.0024067252,0.8199493,0.036883626,0.0009961192,0.000020265374,0.13924861],"study_design_scores_gemma":[0.0021802187,0.000996823,0.027529223,0.0023940268,0.00015889622,0.00009991377,0.0020144947,0.58355135,0.37561256,0.0018123109,0.002170216,0.0014799408],"about_ca_topic_score_codex":0.000028023536,"about_ca_topic_score_gemma":0.00007710635,"teacher_disagreement_score":0.4483089,"about_ca_system_score_codex":0.000054174936,"about_ca_system_score_gemma":0.000011309311,"threshold_uncertainty_score":0.5797465},"labels":[],"label_agreement":null},{"id":"W2151936745","doi":"10.1007/978-3-642-13122-6_32","title":"Symmetric Monotone Venn Diagrams with Seven Curves","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Monotone polygon; Diagram; Simple (philosophy); Mathematics; Combinatorics; Stereographic projection; Projection (relational algebra); Point (geometry); Geometry; Algorithm","score_opus":0.006845742146870528,"score_gpt":0.18858550222509537,"score_spread":0.18173976007822484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151936745","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.002907154,0.004379895,0.9827253,0.00005289383,0.0018500112,0.00047901087,0.000010605288,0.0003113516,0.0072837467],"genre_scores_gemma":[0.98974544,0.00023535569,0.008984888,0.0002556124,0.0004705703,0.00002110688,0.000011269155,0.000080424805,0.00019533615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827117,0.000013863255,0.00027032816,0.0005488248,0.0004695449,0.00042627822],"domain_scores_gemma":[0.9988391,0.00019947684,0.00007873268,0.000687052,0.00007100464,0.00012462975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043098064,0.00040867305,0.00042982106,0.0005928142,0.00010280477,0.00011257837,0.00086535973,0.00029245397,0.000025423355],"category_scores_gemma":[0.000023816296,0.0003312421,0.00007756334,0.00061695284,0.00042047154,0.00016069648,0.000110984554,0.0009739995,0.000037913844],"study_design_candidate":"design_other","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.000029102557,0.000064509135,0.0007401646,0.0018139856,0.00016445924,0.00038474056,0.0015662778,0.17995664,0.0021810303,0.022333274,0.00012240079,0.7906434],"study_design_scores_gemma":[0.0018012722,0.001191809,0.0022001232,0.012353759,0.00020932315,0.0010014353,0.0000017308282,0.379266,0.028009793,0.53012174,0.036425017,0.007417982],"about_ca_topic_score_codex":0.0000094882735,"about_ca_topic_score_gemma":0.000090377434,"teacher_disagreement_score":0.9868383,"about_ca_system_score_codex":0.000072769304,"about_ca_system_score_gemma":0.00006231503,"threshold_uncertainty_score":0.999914},"labels":[],"label_agreement":null},{"id":"W2152073783","doi":"10.1007/s10801-006-6924-6","title":"The isometries of the cut, metric and hypermetric cones","year":2006,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Rijksuniversiteit Groningen; Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Cone (formal languages); Metric (unit); Facet (psychology); Symmetry (geometry); Geometry","score_opus":0.002385214030316783,"score_gpt":0.1556970676505155,"score_spread":0.15331185362019872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152073783","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.97055286,0.025533913,0.00012686623,0.000103617815,0.0019652077,0.00007967362,0.0000018746074,0.00001562927,0.0016203383],"genre_scores_gemma":[0.99900144,0.00068322744,0.00000992025,0.0000070212673,0.000060846563,0.000001012818,8.785288e-8,0.000014494829,0.00022196477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884766,0.00008484455,0.0005072726,0.00005269412,0.00034910123,0.00015843954],"domain_scores_gemma":[0.99861264,0.0007217251,0.0002643727,0.00018870474,0.00017055968,0.0000419787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008046202,0.00011577934,0.00026315727,0.0004066647,0.00014750865,0.000049356106,0.00033289392,0.000060768594,0.0000033874176],"category_scores_gemma":[0.00026636754,0.00006355901,0.00014055871,0.0024586492,0.000116851756,0.00010967754,0.000038855436,0.00023783612,0.0000010103048],"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.00003658884,0.00016842518,0.058665685,0.00024088715,0.00039460446,0.000014815719,0.0003053683,0.00081274,0.0019045615,0.9223008,0.008314476,0.0068410523],"study_design_scores_gemma":[0.0028355536,0.00056071253,0.33153835,0.00018693015,0.00036923555,0.0007575264,0.001221954,0.0007956846,0.026187133,0.56165785,0.07334154,0.0005475713],"about_ca_topic_score_codex":0.0000073803303,"about_ca_topic_score_gemma":0.000002996978,"teacher_disagreement_score":0.36064297,"about_ca_system_score_codex":0.00003609467,"about_ca_system_score_gemma":0.000022498562,"threshold_uncertainty_score":0.25918615},"labels":[],"label_agreement":null},{"id":"W2153047381","doi":"10.1016/s0012-365x(01)00429-0","title":"Cyclic BSEC of block size 3","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block (permutation group theory); Automorphism; Generalization; Combinatorics; Block design; Block size; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.010955568007798157,"score_gpt":0.1896627000552109,"score_spread":0.17870713204741276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153047381","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.86537147,0.00044722497,0.0008652316,0.000016516262,0.00019459665,0.00015335064,0.00001711002,0.00022822402,0.1327063],"genre_scores_gemma":[0.9978362,0.000025496023,0.0010798529,0.000006086655,0.00003211937,0.00000896321,7.329146e-7,0.000028335839,0.0009822112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993787,0.00001232686,0.00026957647,0.000067114896,0.00012330429,0.00014897472],"domain_scores_gemma":[0.9995098,0.00010792787,0.000042719876,0.00028302352,0.000012643388,0.000043851767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009188624,0.00011306738,0.00020660726,0.000029430836,0.000021591952,0.000011070805,0.00013808187,0.000053202424,0.00033179094],"category_scores_gemma":[0.000038997536,0.000098759694,0.00008641811,0.00010844121,0.000033443666,0.000031448297,0.000014007115,0.00006757852,0.0001475081],"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.000017913488,0.0009330586,0.0015862318,0.016261091,0.0015322536,0.00008115336,0.07679213,0.017827548,0.21867505,0.62480766,0.03596521,0.0055206926],"study_design_scores_gemma":[0.0033374235,0.0003784793,0.001276994,0.0021597804,0.0005417991,0.00031840813,0.0102177365,0.56528103,0.18299508,0.19780557,0.032362267,0.003325433],"about_ca_topic_score_codex":8.8840363e-7,"about_ca_topic_score_gemma":9.375983e-7,"teacher_disagreement_score":0.54745346,"about_ca_system_score_codex":0.0000074327745,"about_ca_system_score_gemma":7.3974496e-7,"threshold_uncertainty_score":0.40273035},"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":"W2153537785","doi":"10.1109/lcomm.2002.803478","title":"System performance comparison of optical CDMA and WDMA in a broadcast local area network","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"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":"Computer science; Code division multiple access; Wavelength-division multiplexing; Computer network; Network packet; Throughput; Electronic engineering; Wavelength; Telecommunications; Optics; Wireless; Engineering; Physics","score_opus":0.029233353584602658,"score_gpt":0.22064663134310156,"score_spread":0.1914132777584989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153537785","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.9888141,0.0023315635,0.005104609,0.00022800973,0.00015622143,0.00014930083,0.0000028989523,0.00010380835,0.00310947],"genre_scores_gemma":[0.99906456,0.00013073774,0.00068171695,0.000039757775,0.00002284073,0.00003640786,0.0000033145063,0.00001515908,0.0000055179903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992045,0.00008599783,0.000353478,0.0000885376,0.000082243125,0.00018519831],"domain_scores_gemma":[0.9989799,0.0001387528,0.000042561296,0.0007801911,0.000014022471,0.000044534656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017611425,0.00010868429,0.00023402256,0.00008268988,0.00008163211,0.000015969228,0.00039102713,0.000058215363,0.0000047033313],"category_scores_gemma":[0.000003090714,0.0001157052,0.000032571734,0.00025915066,0.00020322039,0.00008525543,0.000045372115,0.00023683693,0.000016648535],"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.000039046736,0.00029449104,0.093922265,0.001274314,0.00019437868,0.000008838077,0.008060316,0.7923114,0.014531208,0.012667233,0.01175728,0.064939275],"study_design_scores_gemma":[0.00032682365,0.000023320137,0.0038098083,0.00039277948,0.000015757025,0.000024420284,0.0005951527,0.9921236,0.00052896864,0.0000060810817,0.0019808034,0.00017245483],"about_ca_topic_score_codex":0.000010509872,"about_ca_topic_score_gemma":0.000022113109,"teacher_disagreement_score":0.19981228,"about_ca_system_score_codex":0.000046887864,"about_ca_system_score_gemma":0.0000015464069,"threshold_uncertainty_score":0.4718321},"labels":[],"label_agreement":null},{"id":"W2153741372","doi":"10.1109/jlt.2005.843524","title":"Spectral efficiency of OCDMA systems with coherent pulsed sources","year":2005,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","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":"Université Laval","funders":"","keywords":"Spectral efficiency; Code division multiple access; Limit (mathematics); Bit error rate; Electronic engineering; Computer science; Optical communication; Code (set theory); Phase (matter); Optics; Physics; Mathematics; Telecommunications; Decoding methods; Engineering","score_opus":0.0037977353554990946,"score_gpt":0.17669861999668562,"score_spread":0.17290088464118653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153741372","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.99069834,0.003330803,0.0029820045,0.00015963375,0.00036457332,0.00012427503,0.00000232339,0.0001282558,0.0022097942],"genre_scores_gemma":[0.9993252,0.00004085735,0.00035713593,0.000003734121,0.00016868897,0.000003404778,2.2622336e-7,0.000021872738,0.0000788458],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987907,0.00002945928,0.0006198991,0.00008892588,0.00021880196,0.00025223297],"domain_scores_gemma":[0.99927163,0.000034543817,0.00030988827,0.00021332629,0.00011247016,0.000058142236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002778175,0.00015817996,0.00045689908,0.0005674406,0.000031913823,0.0000141273795,0.00032957306,0.00017426905,0.000029179615],"category_scores_gemma":[0.000013615314,0.0001107617,0.000092742375,0.00042226797,0.00012531721,0.00009262597,0.000014209476,0.00032876077,0.000011015256],"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.0006262986,0.0011165825,0.038585287,0.0013311087,0.0023437624,0.0006529369,0.0033717176,0.20513457,0.6097563,0.123027295,0.0032573312,0.01079679],"study_design_scores_gemma":[0.004620928,0.004343777,0.0017303581,0.0015256474,0.00032445835,0.008418842,0.004370676,0.013337265,0.91549873,0.0029351902,0.041871566,0.0010225305],"about_ca_topic_score_codex":0.0000017733397,"about_ca_topic_score_gemma":0.0000055180567,"teacher_disagreement_score":0.30574244,"about_ca_system_score_codex":0.00005653276,"about_ca_system_score_gemma":0.00002304281,"threshold_uncertainty_score":0.45167312},"labels":[],"label_agreement":null},{"id":"W2154034711","doi":"10.1109/hpcs.2005.9","title":"A Meta-Software System for the Discovery of Hadamard Matrices","year":2005,"lang":"en","type":"article","venue":"","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":"Wilfrid Laurier University","funders":"","keywords":"Hadamard transform; Computer science; Software engineering; Extensibility; Software; Complex Hadamard matrix; Software system; Theoretical computer science; Hadamard matrix; Programming language; Mathematics","score_opus":0.019450806852581867,"score_gpt":0.20118521280801493,"score_spread":0.18173440595543305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154034711","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.19263706,0.034408085,0.7534213,0.00025428305,0.001822445,0.001706088,0.00022290858,0.0014404189,0.014087414],"genre_scores_gemma":[0.99757475,0.00001669127,0.0010803664,0.000011240791,0.00009189774,0.00011809181,0.000001264131,0.000015425358,0.0010902839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952626,0.000015642141,0.00019553782,0.00006761503,0.000081973245,0.00011299527],"domain_scores_gemma":[0.9994592,0.00027389178,0.00002940458,0.00020301396,0.000018889355,0.000015578165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023993476,0.00008916241,0.00020442669,0.000032272746,0.000038982525,0.00002721901,0.0001511394,0.00003247706,0.000021643691],"category_scores_gemma":[0.000007273337,0.000047445053,0.00021233944,0.0000883701,0.000014065462,0.00014963336,0.000009923681,0.0000315045,0.000010783426],"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.00018267066,0.00011564166,0.0012023733,0.009616541,0.021483855,0.0000043183763,0.0024061538,0.2876295,0.009193695,0.60990727,0.03818565,0.020072317],"study_design_scores_gemma":[0.0035320194,0.00034119518,0.0019194137,0.0005764751,0.015831972,0.00014704549,0.014492598,0.16626398,0.29961368,0.0032609608,0.4916923,0.002328339],"about_ca_topic_score_codex":0.00001308972,"about_ca_topic_score_gemma":0.00001875914,"teacher_disagreement_score":0.80493766,"about_ca_system_score_codex":0.000013223073,"about_ca_system_score_gemma":0.000003483848,"threshold_uncertainty_score":0.1934753},"labels":[],"label_agreement":null},{"id":"W2154661743","doi":"10.1109/jlt.2007.893917","title":"Spectral-Amplitude-Coded OCDMA Optimized for a Realistic FBG Frequency Response","year":2007,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bit error rate; Fiber Bragg grating; Code division multiple access; Encoder; Amplitude; Computer science; Transmission (telecommunications); Electronic engineering; Optics; Optical fiber; Physics; Algorithm; Telecommunications; Decoding methods; Engineering","score_opus":0.01067272240430178,"score_gpt":0.24608346390065367,"score_spread":0.23541074149635188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154661743","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.7988768,0.0010002132,0.19499354,0.00066677376,0.0010973604,0.00033032993,0.000014566094,0.00038775403,0.0026326354],"genre_scores_gemma":[0.9720328,0.00003981445,0.027521232,0.00002494982,0.00020147453,0.000010695218,0.0000010766499,0.000045183242,0.0001227988],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981919,0.000056858386,0.00092104106,0.00014634122,0.00020987178,0.00047396697],"domain_scores_gemma":[0.99854374,0.0004510943,0.00028349218,0.00034117617,0.00026530665,0.00011519628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026824,0.00021685725,0.00053979596,0.0010318517,0.00007269769,0.000023103668,0.00043242122,0.00037477593,0.000040419738],"category_scores_gemma":[0.00058409286,0.00018757289,0.00023389011,0.0005036156,0.00010522758,0.00010827981,0.000019084311,0.00044412888,0.000012356268],"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.004287289,0.00016750697,0.0007931238,0.00018732293,0.00065456174,0.0007913286,0.0006225275,0.0013341212,0.8287765,0.15676963,0.0032436405,0.0023724376],"study_design_scores_gemma":[0.010760815,0.0036033152,0.004541669,0.00063908513,0.0004403348,0.008242116,0.0015091357,0.0013908915,0.4484998,0.48440844,0.034505785,0.0014586243],"about_ca_topic_score_codex":0.0000023434538,"about_ca_topic_score_gemma":0.00000926253,"teacher_disagreement_score":0.3802767,"about_ca_system_score_codex":0.00018841728,"about_ca_system_score_gemma":0.000056100762,"threshold_uncertainty_score":0.7649001},"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":"W2155300358","doi":"10.1504/ijicot.2010.032863","title":"Classes of permutation arrays in finite projective spaces","year":2010,"lang":"en","type":"article","venue":"International Journal of Information and Coding Theory","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":"Projective plane; Permutation (music); Mathematics; Projective test; Finite geometry; Fano plane; Projective space; Combinatorics; Blocking set; Projective geometry; Partial permutation; Finite field; Discrete mathematics; Pairwise comparison; Plane (geometry); Collineation; Cyclic permutation; Geometry; Pure mathematics; Algebraic geometry; Symmetric group; Physics","score_opus":0.0052810935257700305,"score_gpt":0.22175757774078236,"score_spread":0.21647648421501234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155300358","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.96766907,0.00003609362,0.020887326,0.000045799887,0.000996046,0.000049070084,0.0000065309705,0.000012874072,0.01029721],"genre_scores_gemma":[0.9995507,0.000048248352,0.00030322338,0.000023773298,0.00006204138,0.0000015132849,0.0000025037814,0.000002732471,0.0000052535297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994132,0.000026946485,0.00034891182,0.000018969542,0.00014683187,0.000045165125],"domain_scores_gemma":[0.9994219,0.0001493429,0.00018525867,0.000028930488,0.00019514201,0.000019426549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060730707,0.000050310413,0.00008540768,0.00035161755,0.000012531226,0.000042947144,0.000102494676,0.000037072023,0.000020073128],"category_scores_gemma":[0.00016493068,0.000043188003,0.00003215865,0.00006660498,0.000031476833,0.0008091634,0.000007757134,0.0001562467,0.0000019768831],"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.00052709784,0.00005451938,0.009278688,0.00017902369,0.00022472402,0.000008717734,0.03158144,0.018564487,0.026353799,0.8388716,0.00012753828,0.074228376],"study_design_scores_gemma":[0.009056234,0.0006054022,0.09449842,0.0022731104,0.00010103048,0.0014896392,0.072866604,0.14781328,0.12280004,0.52665675,0.020657703,0.001181828],"about_ca_topic_score_codex":0.0000014541561,"about_ca_topic_score_gemma":0.0000030233502,"teacher_disagreement_score":0.31221485,"about_ca_system_score_codex":0.00001505745,"about_ca_system_score_gemma":0.000018123568,"threshold_uncertainty_score":0.17611556},"labels":[],"label_agreement":null},{"id":"W2155476808","doi":"","title":"On the bichromatic k-set problem","year":2008,"lang":"en","type":"article","venue":"","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":"Combinatorics; Conjecture; Upper and lower bounds; Integer (computer science); Set (abstract data type); Mathematics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.01413027951656986,"score_gpt":0.16968609746568855,"score_spread":0.15555581794911869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155476808","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.7620406,0.00003477201,0.0005606321,0.00006526149,0.00010655636,0.000109719,7.675619e-7,0.0002550263,0.23682666],"genre_scores_gemma":[0.99839425,0.0000041252893,0.000044331697,0.000080580816,0.000018884964,0.00001951294,5.5141146e-7,0.000008463807,0.0014292804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971884,0.000018010403,0.000073473035,0.000040715957,0.000061082785,0.00008786936],"domain_scores_gemma":[0.9997616,0.00006641948,0.000005166779,0.00014560485,0.0000036167212,0.000017626022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000823331,0.00005356579,0.00005125218,0.000017909388,0.00005812577,0.0000056475933,0.00007897195,0.000019192556,0.00035103297],"category_scores_gemma":[0.0000045313786,0.000029362105,0.000025229045,0.00007905073,0.000018234372,0.00002044866,0.0000038197354,0.000049791535,0.00059632387],"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.0000034349762,0.000022379889,0.00022555946,0.000089168185,0.00007121922,0.0000178597,0.0021524485,0.005675933,0.0029728955,0.8366135,0.15181647,0.00033916594],"study_design_scores_gemma":[0.00253988,0.0007049796,0.011792737,0.0007466968,0.00007707229,0.0011569319,0.0039793234,0.14994149,0.079015024,0.58959967,0.15761647,0.0028297445],"about_ca_topic_score_codex":0.0000029853352,"about_ca_topic_score_gemma":0.0000016354836,"teacher_disagreement_score":0.2470138,"about_ca_system_score_codex":0.0000055638643,"about_ca_system_score_gemma":0.0000019409267,"threshold_uncertainty_score":0.7664736},"labels":[],"label_agreement":null},{"id":"W2156110989","doi":"10.1098/rspa.2006.1684","title":"Enumerating the bent diagonal squares of Dr Benjamin Franklin FRS","year":2006,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","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 Manitoba","funders":"","keywords":"Magic square; Diagonal; Bent molecular geometry; Mathematics; Combinatorics; Least-squares function approximation; Numbering; Backtracking; Statistics; Algorithm; Geometry; Engineering","score_opus":0.00460321839815817,"score_gpt":0.17971987804382286,"score_spread":0.1751166596456647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156110989","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.997426,0.00024523627,0.0007173003,0.00011528032,0.00006429999,0.00011901398,0.000004103584,0.000055862212,0.0012529293],"genre_scores_gemma":[0.9991571,0.0000029652542,0.00066180376,0.0000056645845,0.0001169037,0.000016293594,1.404774e-7,0.000009753065,0.000029422958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990812,0.0000036003469,0.00024888184,0.00012821027,0.0003231069,0.00021500226],"domain_scores_gemma":[0.9996058,0.00021120592,0.000059552323,0.000056991877,0.00003319405,0.000033268476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003736677,0.00014268799,0.00023217729,0.000013115857,0.00015620876,0.000049197715,0.00031959836,0.00004284916,0.000004057861],"category_scores_gemma":[0.00004624328,0.00007699524,0.00019857154,0.00026814846,0.00038280123,0.00008719244,0.000071563016,0.00015409545,8.166107e-7],"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.000004154734,0.00020147715,0.0013067605,0.0026132178,0.0001208614,9.756309e-8,0.0063960776,0.15050179,0.076346934,0.76094335,0.0010691568,0.00049611536],"study_design_scores_gemma":[0.00011534852,0.000048627295,0.003498344,0.00029190737,0.00004162072,0.0000019587255,0.00085965294,0.8991824,0.027543465,0.06817972,0.000055518325,0.0001814678],"about_ca_topic_score_codex":0.000009586852,"about_ca_topic_score_gemma":1.4540356e-7,"teacher_disagreement_score":0.7486806,"about_ca_system_score_codex":0.000008358178,"about_ca_system_score_gemma":0.000004387841,"threshold_uncertainty_score":0.31397748},"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":"W2156949757","doi":"10.1017/s0963548314000856","title":"The (7, 4)-Conjecture in Finite Groups","year":2015,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","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 British Columbia","funders":"","keywords":"Quasigroup; Conjecture; Mathematics; Order (exchange); Combinatorics; Finite group; Element (criminal law); Discrete mathematics; Group (periodic table); Physics; Political science; Quantum mechanics","score_opus":0.01992793338833089,"score_gpt":0.22215268669550522,"score_spread":0.20222475330717432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156949757","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.973452,0.0058410857,0.0028559535,0.00015121396,0.010168573,0.0013615917,0.000012605371,0.0008847512,0.0052722734],"genre_scores_gemma":[0.9995405,0.000032020835,0.00008761238,0.000012638079,0.0001712878,0.000048124806,0.000020577867,0.00006207531,0.00002516894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727094,0.00038245294,0.0008319862,0.00054879155,0.00035123582,0.00061460934],"domain_scores_gemma":[0.9974987,0.0008302984,0.00016238648,0.0012038756,0.00016682745,0.00013790102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003413387,0.00048472008,0.0005914266,0.00012373597,0.00021063002,0.00022883985,0.0010550424,0.000537175,0.0000019967565],"category_scores_gemma":[0.0004569598,0.00040924744,0.00019013514,0.00051381835,0.00012538148,0.000055085933,0.0008944771,0.0021116734,0.000018378818],"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.000017802624,0.00013827722,0.008462024,0.0019376358,0.00011324196,0.000025404566,0.005461039,0.7783891,0.000009182237,0.19932033,0.0007825391,0.0053434134],"study_design_scores_gemma":[0.00034165295,0.00002400103,0.0008228671,0.0002637714,0.000013051105,0.0000048941665,0.000105796295,0.17748441,0.000032183856,0.81823736,0.0022235569,0.00044645983],"about_ca_topic_score_codex":0.000022672053,"about_ca_topic_score_gemma":0.000028114242,"teacher_disagreement_score":0.618917,"about_ca_system_score_codex":0.0006041622,"about_ca_system_score_gemma":0.00011982541,"threshold_uncertainty_score":0.9998359},"labels":[],"label_agreement":null},{"id":"W2157085031","doi":"10.1007/11809678_39","title":"An Edge Ordering Problem of Regular Hypergraphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Permutation (music); Conjecture; Hypergraph; Mathematics; Integer (computer science); K-edge; Discrete mathematics; Constant (computer programming); Enhanced Data Rates for GSM Evolution; Physics; Computer science; Quantum mechanics","score_opus":0.006256702997084994,"score_gpt":0.18882510219296872,"score_spread":0.18256839919588372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157085031","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.004655107,0.00095127145,0.98071444,0.000008839144,0.0008310464,0.00027977992,0.0000073004508,0.00021027142,0.012341925],"genre_scores_gemma":[0.963073,0.000015456711,0.03646808,0.000025930009,0.00024739592,0.000006168505,0.000006927689,0.00005484373,0.00010220455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843246,0.000015307987,0.00038807146,0.00047716981,0.00034775375,0.0003392318],"domain_scores_gemma":[0.9990658,0.000062094776,0.00008708324,0.0006370452,0.000076321376,0.00007165755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003992639,0.0003276868,0.00040048262,0.0005350458,0.00006933831,0.00006658765,0.0007998173,0.00024044396,0.000011234249],"category_scores_gemma":[0.0000035312632,0.00031322762,0.000093617506,0.00033402987,0.00035963356,0.00017827182,0.000075708835,0.00035619264,0.000004718705],"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.000003610528,0.000016284726,0.0001060156,0.0003185628,0.00001735637,0.000022813334,0.000359749,0.8247771,0.0071741706,0.012959648,0.000026241236,0.15421845],"study_design_scores_gemma":[0.00051858346,0.0003680603,0.0003592891,0.002260552,0.000039848168,0.00012266228,0.0000010015236,0.50622797,0.03260686,0.44807994,0.0074957046,0.0019195486],"about_ca_topic_score_codex":0.000015351585,"about_ca_topic_score_gemma":0.000040537874,"teacher_disagreement_score":0.9584179,"about_ca_system_score_codex":0.000055252738,"about_ca_system_score_gemma":0.00004019548,"threshold_uncertainty_score":0.999932},"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":"W2159272791","doi":"10.1364/ip.2005.ithc3","title":"Demonstration of All-Photonic Code Conversion in a Semiconductor Fiber Ring Laser for OCDMA Networks","year":2005,"lang":"en","type":"article","venue":"Adaptive Optics: Analysis and Methods/Computational Optical Sensing and Imaging/Information Photonics/Signal Recovery and Synthesis Topical Meetings on CD-ROM","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":"McGill University","funders":"","keywords":"Photonics; Code (set theory); Code division multiple access; Computer science; Optoelectronics; Electronic engineering; Materials science; Laser; Optics; Physics; Telecommunications; Engineering","score_opus":0.011604027850582366,"score_gpt":0.24946843534909546,"score_spread":0.2378644074985131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159272791","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.8350494,0.00020763042,0.16311993,0.00019171648,0.00006459035,0.00028916966,0.000033146407,0.000040925104,0.001003481],"genre_scores_gemma":[0.8571905,0.00012814008,0.14241277,0.00017253503,0.00003038206,0.000010015471,0.000030292502,0.00001227353,0.0000131278575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983354,0.00015610478,0.0007515043,0.00028522193,0.00019388345,0.00027788794],"domain_scores_gemma":[0.99663955,0.00274531,0.00019366818,0.000097966156,0.00017224844,0.00015127662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011275066,0.00025784594,0.00056244474,0.00033784137,0.00011696391,0.00013351023,0.000058397378,0.00014327906,0.000016767586],"category_scores_gemma":[0.00022743363,0.0002417498,0.00016042935,0.00026047888,0.00013005768,0.00055844267,0.000029606545,0.00021899195,0.0000015617487],"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.0006201116,0.00010604842,0.00049137976,0.0002486967,0.0010645408,0.0000033609222,0.00089179166,0.66024715,0.008917187,0.010036447,0.000025836795,0.31734744],"study_design_scores_gemma":[0.0005419114,0.000072405746,0.002964057,0.00015805145,0.00039049963,0.000015115084,0.00034068144,0.98668617,0.0070672636,0.000937671,0.00054773805,0.00027846408],"about_ca_topic_score_codex":0.00002454826,"about_ca_topic_score_gemma":0.000022728625,"teacher_disagreement_score":0.326439,"about_ca_system_score_codex":0.00006099186,"about_ca_system_score_gemma":0.000021018475,"threshold_uncertainty_score":0.9858271},"labels":[],"label_agreement":null},{"id":"W2159330890","doi":"10.1007/s00493-006-0030-1","title":"Packing Non-Zero A-Paths In Group-Labelled Graphs","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Abelian group; Zero (linguistics); Induced path; Integer (computer science); Path (computing); Graph; Matching (statistics); Discrete mathematics; Group (periodic table); Longest path problem; Shortest path problem","score_opus":0.0036333433700278684,"score_gpt":0.17088307904416922,"score_spread":0.16724973567414134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159330890","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.95545787,0.0012683392,0.0007906072,0.00001194664,0.0014184834,0.00021907942,0.0000021841452,0.0003660486,0.040465433],"genre_scores_gemma":[0.9996481,0.000024686435,0.00003474448,0.000010729911,0.00003058675,0.000046592508,0.000007873276,0.00003970034,0.0001569691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989975,0.00004242603,0.00028738313,0.00018400673,0.00013937058,0.00034930522],"domain_scores_gemma":[0.9995589,0.000057492478,0.00003083625,0.00027988933,0.000017919217,0.0000549099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021026908,0.00018328687,0.00024713774,0.00020222015,0.00006623653,0.00003201321,0.00019764072,0.00010929508,0.00001898603],"category_scores_gemma":[0.000007363179,0.00019206038,0.0000791352,0.000664852,0.00002434452,0.00010502742,0.000025484884,0.00019897327,0.00007160333],"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.000017419947,0.0003423212,0.045615938,0.00019754676,0.00004491395,0.00014054321,0.0005003359,0.0016220318,0.012724438,0.9283365,0.0084196925,0.0020383033],"study_design_scores_gemma":[0.0043425825,0.00016488414,0.05553648,0.000277285,0.000034376782,0.000027227146,0.00017263317,0.007582218,0.006563864,0.889198,0.034786433,0.0013140322],"about_ca_topic_score_codex":0.00006494675,"about_ca_topic_score_gemma":0.000014376106,"teacher_disagreement_score":0.04419024,"about_ca_system_score_codex":0.000070341724,"about_ca_system_score_gemma":0.0000045346524,"threshold_uncertainty_score":0.7831995},"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":"W2159832387","doi":"10.3233/sat190066","title":"Algorithms and Complexity Results for Input and Unit Resolution","year":2009,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Resolution (logic); Completeness (order theory); Space (punctuation); PSPACE; Computer science; Algorithm; Mathematics; Computational complexity theory; Artificial intelligence; Mathematical analysis","score_opus":0.05055338728897672,"score_gpt":0.27397125337858336,"score_spread":0.22341786608960662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159832387","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.6590968,0.00022655341,0.34006953,0.00016912438,0.00009028042,0.00016707838,0.0000132566265,0.000056678007,0.000110678535],"genre_scores_gemma":[0.9920971,0.000083565166,0.0076295333,0.00005946812,0.00010195283,0.0000033667716,0.000011373085,0.000008663786,0.0000050037775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990735,0.00009727309,0.0003784826,0.00018108227,0.00012071041,0.00014897229],"domain_scores_gemma":[0.9995387,0.00012581579,0.00006341849,0.00007631688,0.000084010884,0.000111708374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089626,0.0001318229,0.00018796792,0.00009621657,0.0002692484,0.000119440185,0.00003152024,0.00007123756,2.9947194e-7],"category_scores_gemma":[0.00005449185,0.00012471856,0.000032374224,0.00006198881,0.000043618886,0.00015883414,0.000007020806,0.0001993644,3.2446283e-7],"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.00028368382,0.000030783835,0.00023227946,0.000088740795,0.000025031855,0.0000014865099,0.00096341985,0.80125135,0.00016612443,0.0053760605,0.00008103355,0.1915],"study_design_scores_gemma":[0.00082648057,0.00026645386,0.0052578184,0.00007569375,0.00001351378,0.000046519337,0.00013122012,0.8579976,0.000011809454,0.13519467,0.00006119217,0.00011705662],"about_ca_topic_score_codex":0.0000061781066,"about_ca_topic_score_gemma":0.0000045324628,"teacher_disagreement_score":0.33300027,"about_ca_system_score_codex":0.000028686578,"about_ca_system_score_gemma":0.0000080554455,"threshold_uncertainty_score":0.5085875},"labels":[],"label_agreement":null},{"id":"W2160085175","doi":"10.26493/1855-3974.170.fd8","title":"Maximum independent sets of the 120-cell and other regular polytopes","year":2012,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Polytope; Antipodal point; Upper and lower bounds; Graph; Dodecahedron; Pairwise comparison; Discrete mathematics; Independent set; Order (exchange); Set (abstract data type); Geometry; Statistics; Computer science; Mathematical analysis","score_opus":0.013342769437347258,"score_gpt":0.1992963778698754,"score_spread":0.18595360843252814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160085175","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.95892805,0.0016893345,0.00034670383,0.000050924562,0.00025257486,0.00034947228,0.000013442808,0.0000832177,0.038286272],"genre_scores_gemma":[0.999304,0.0000062164895,0.00015359688,0.000043477852,0.000019862788,0.000017847127,4.915467e-7,0.000034143046,0.00042036123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991429,0.00006889333,0.0003027662,0.000090553534,0.00017734342,0.00021755304],"domain_scores_gemma":[0.99935716,0.000076137505,0.000082876635,0.00039322648,0.000015150231,0.00007543964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049312203,0.00015306119,0.00025101058,0.000040464383,0.00004494813,0.000015829135,0.00018282051,0.00007657457,0.00006664055],"category_scores_gemma":[0.00001579152,0.00010388925,0.000081237915,0.00008774135,0.00008138322,0.00010048002,0.000039849056,0.00009692883,0.000033137803],"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.00012474932,0.0012358765,0.08211936,0.011052888,0.0012876955,0.000019248655,0.071081094,0.00018862517,0.30219278,0.5170176,0.009228288,0.004451773],"study_design_scores_gemma":[0.006338439,0.00023094285,0.011868868,0.0025795265,0.000584681,0.0005909546,0.014439165,0.004702087,0.56860125,0.31876025,0.06846683,0.0028370218],"about_ca_topic_score_codex":0.000008228216,"about_ca_topic_score_gemma":0.0000024017443,"teacher_disagreement_score":0.26640847,"about_ca_system_score_codex":0.000008856501,"about_ca_system_score_gemma":0.00000532788,"threshold_uncertainty_score":0.42364806},"labels":[],"label_agreement":null},{"id":"W2160434410","doi":"10.1109/lcomm.2008.080726","title":"Native Multicasting in a 2D-OCDMA PON","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Multicast; Code division multiple access; Computer science; Computer network; Code (set theory); Provisioning; Passive optical network; Wavelength-division multiplexing; Wavelength; Physics; Optoelectronics; Set (abstract data type)","score_opus":0.03859797013882393,"score_gpt":0.24261718218485823,"score_spread":0.2040192120460343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160434410","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.9910762,0.00030487808,0.0018189086,0.00075840624,0.00018598993,0.00015534814,0.000004717361,0.00021128984,0.0054842806],"genre_scores_gemma":[0.9980819,0.00007304762,0.0014600867,0.00024380695,0.000024278017,0.00006834474,0.0000063050034,0.00002027335,0.000021929725],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999322,0.00012530245,0.0002186747,0.00008775712,0.00007395154,0.0001722928],"domain_scores_gemma":[0.99888396,0.00023120895,0.000026670437,0.0008064096,0.000017572384,0.000034160134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015985951,0.00010013279,0.0001208085,0.00015755228,0.00014942535,0.000010691355,0.0005054452,0.000039177812,0.0000064977503],"category_scores_gemma":[0.000029091132,0.000112096146,0.0000430116,0.00031842737,0.0001246828,0.00011932582,0.0000371698,0.00026076136,0.00005829319],"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.0000428459,0.00052931544,0.03736708,0.00023944533,0.00036683917,0.00016867783,0.0730774,0.14523888,0.70342106,0.013353755,0.016555771,0.009638914],"study_design_scores_gemma":[0.0066077835,0.000121591285,0.12407785,0.0015255619,0.00010256499,0.0007521419,0.0070316973,0.7353886,0.04471633,0.001730343,0.073952615,0.0039929315],"about_ca_topic_score_codex":0.000041405958,"about_ca_topic_score_gemma":0.00005493678,"teacher_disagreement_score":0.65870476,"about_ca_system_score_codex":0.00006292498,"about_ca_system_score_gemma":0.0000055564838,"threshold_uncertainty_score":0.45711482},"labels":[],"label_agreement":null},{"id":"W2160564268","doi":"10.1007/978-3-642-40313-2_68","title":"Feasible Combinatorial Matrix Theory","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","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":"McMaster University","funders":"","keywords":"Mathematical proof; Equivalence (formal languages); Computer science; Combinatorial proof; Matrix (chemical analysis); Computational complexity theory; Algebra over a field; Discrete mathematics; Algorithm; Mathematics; Pure mathematics","score_opus":0.007842766955186044,"score_gpt":0.20771588873961172,"score_spread":0.19987312178442568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160564268","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.0010305922,0.001430297,0.93456876,0.000028565217,0.011934181,0.00047378,0.0000074105205,0.00040470567,0.05012173],"genre_scores_gemma":[0.9900991,0.000037358885,0.006603124,0.00011945355,0.00131566,0.00001812247,0.000005963836,0.0000929339,0.0017083354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983092,0.000029130444,0.00031565412,0.000493102,0.00041426363,0.0004386445],"domain_scores_gemma":[0.998847,0.00027474723,0.00006579675,0.00062670617,0.00007045291,0.00011530241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006405536,0.00038892223,0.00039560065,0.0004108681,0.00011223908,0.00019918708,0.000942879,0.00033630096,0.00021831527],"category_scores_gemma":[0.000023351316,0.0003517918,0.000108865526,0.00022499962,0.0003710104,0.00019780862,0.00015829012,0.00061387866,0.0003245007],"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.000011404168,0.000014921009,0.000025859752,0.00019219528,0.000037636863,0.000044108583,0.00053162355,0.07318626,0.00050548685,0.7924857,0.00023173037,0.13273305],"study_design_scores_gemma":[0.00024694038,0.000058287886,0.000019495092,0.00029207373,0.000010173537,0.00003472637,2.5707118e-7,0.03863168,0.0011450982,0.95457286,0.0044360394,0.0005523953],"about_ca_topic_score_codex":0.0000044271133,"about_ca_topic_score_gemma":0.0000039256297,"teacher_disagreement_score":0.98906845,"about_ca_system_score_codex":0.00013392916,"about_ca_system_score_gemma":0.00006729951,"threshold_uncertainty_score":0.9998934},"labels":[],"label_agreement":null},{"id":"W2160639448","doi":"10.1016/j.jctb.2005.02.006","title":"A polynomial recognition algorithm for balanced matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Modulo; Combinatorics; Matrix (chemical analysis); Polynomial; Square (algebra); Mathematics; Matrix polynomial; Polynomial matrix; Column (typography); Algorithm; Discrete mathematics","score_opus":0.0069574814401236005,"score_gpt":0.2074521148175733,"score_spread":0.20049463337744972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160639448","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.86725616,0.0056088464,0.049400084,0.0003103209,0.06409579,0.0010324727,0.00017492789,0.0006418913,0.011479488],"genre_scores_gemma":[0.990648,0.00013663936,0.0040691704,0.0000264055,0.0049431697,0.000014827511,0.000004911624,0.000038241236,0.00011868174],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899423,0.0000959339,0.00048257934,0.00007071805,0.00015611817,0.00020039547],"domain_scores_gemma":[0.9992697,0.00018982713,0.00019446602,0.0000997961,0.00015897557,0.0000871859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329009,0.00014761345,0.0003102669,0.00013339455,0.00007935015,0.000055913373,0.00018820766,0.00010750813,0.000058471942],"category_scores_gemma":[0.000058165504,0.00013303781,0.00019531294,0.000127663,0.000040906707,0.0005881006,0.000009487896,0.00016964776,0.000011908399],"study_design_candidate":"design_other","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.0051615024,0.00036701155,0.00003713841,0.00032151272,0.0010921052,0.000037224854,0.002519947,0.0013013965,0.018894428,0.08814993,0.06234317,0.8197746],"study_design_scores_gemma":[0.00899559,0.0018065125,0.000054023734,0.0002971956,0.00025374105,0.0005718259,0.0013847783,0.002375471,0.080655694,0.41452438,0.48824158,0.00083921116],"about_ca_topic_score_codex":2.9037554e-7,"about_ca_topic_score_gemma":2.804241e-7,"teacher_disagreement_score":0.81893545,"about_ca_system_score_codex":0.000059969927,"about_ca_system_score_gemma":0.000024796056,"threshold_uncertainty_score":0.5425125},"labels":[],"label_agreement":null},{"id":"W2161134252","doi":"10.1109/lpt.2006.889104","title":"A New Approach to Achieve High Spectral Efficiency in Wavelength-Time OCDMA Network Transmission","year":2007,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","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":"McGill University","funders":"","keywords":"Computer science; Code division multiple access; Transmission (telecommunications); Bit error rate; Spectral efficiency; Demodulation; Channel (broadcasting); Transmitter; Modulation (music); Interference (communication); Code (set theory); Electronic engineering; Error detection and correction; Reed–Solomon error correction; Data transmission; Forward error correction; Decoding methods; Computer network; Algorithm; Concatenated error correction code; Telecommunications; Physics; Engineering","score_opus":0.004118969888660905,"score_gpt":0.1854326081248422,"score_spread":0.1813136382361813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161134252","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.8360073,0.00013105605,0.15943834,0.0006491544,0.0005954067,0.00049302256,0.0000021741027,0.0008606012,0.001822971],"genre_scores_gemma":[0.98287386,0.000014807434,0.016482724,0.0003588167,0.00010302214,0.000029746201,0.0000037589155,0.00006202005,0.00007121968],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979359,0.000029824887,0.00047237382,0.00043605876,0.00017376812,0.0009520903],"domain_scores_gemma":[0.9992542,0.00005357404,0.000041740037,0.00048635795,0.000009598441,0.00015451366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006468402,0.00031231338,0.00038516024,0.00062524184,0.00007506298,0.000018831292,0.0005677567,0.00040977335,0.00002193685],"category_scores_gemma":[0.000007199049,0.0003251611,0.00009415923,0.0015711207,0.00006908089,0.000064294014,0.00002356444,0.00070445036,0.00011279493],"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.00020201669,0.00014207429,0.00031612007,0.00008443192,0.00009660844,0.00016049376,0.0011210365,0.19581302,0.76552266,0.008020227,0.007944861,0.020576453],"study_design_scores_gemma":[0.006846506,0.00089321175,0.0026419389,0.0006808603,0.00016176434,0.0007638187,0.00056372804,0.21712072,0.6901549,0.025168085,0.05012119,0.0048832777],"about_ca_topic_score_codex":0.000023833318,"about_ca_topic_score_gemma":0.000010786583,"teacher_disagreement_score":0.14686662,"about_ca_system_score_codex":0.00015183765,"about_ca_system_score_gemma":0.000018502293,"threshold_uncertainty_score":0.99992007},"labels":[],"label_agreement":null},{"id":"W2161993469","doi":"10.1109/65.885669","title":"Lighting the local area: optical code-division multiple access and quality of service provisioning","year":2000,"lang":"en","type":"article","venue":"IEEE Network","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":176,"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":"Computer science; Computer network; Asynchronous communication; Code division multiple access; Time division multiple access; Physical layer; Quality of service; Provisioning; Flexibility (engineering); Distributed computing; Telecommunications; Wireless","score_opus":0.02798485384185452,"score_gpt":0.25668734396197,"score_spread":0.2287024901201155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161993469","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.9899213,0.0004369624,0.005044296,0.00004720619,0.0006248589,0.00018518417,0.0000042217307,0.00012467531,0.0036112957],"genre_scores_gemma":[0.9993708,0.000019958297,0.00007836956,0.000069801805,0.0003980018,0.000011892519,0.0000021607225,0.000019232757,0.000029795543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900764,0.00010476807,0.0003310941,0.00015593623,0.00015553363,0.0002450294],"domain_scores_gemma":[0.9991579,0.00046785615,0.000042142074,0.0002394758,0.000031980602,0.00006062737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066083943,0.00012883425,0.00021560454,0.000015096183,0.00014711173,0.000053671338,0.00022180611,0.00008706168,0.000022031008],"category_scores_gemma":[0.000014421686,0.000091233196,0.00004420789,0.00025594982,0.000056223304,0.00012706137,0.00003191189,0.00017959243,0.000009857253],"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.00008100298,0.000020059864,0.0083521,0.00021607723,0.000045732275,0.0000022238423,0.00059166417,0.96662533,0.0011097857,0.0006526384,0.0007784987,0.021524895],"study_design_scores_gemma":[0.0015137902,0.00010016425,0.07172441,0.0013299122,0.000062545456,0.000021542626,0.00046804358,0.9008341,0.008391233,0.0045272615,0.010229932,0.00079708284],"about_ca_topic_score_codex":0.00005205697,"about_ca_topic_score_gemma":0.00014789228,"teacher_disagreement_score":0.06579124,"about_ca_system_score_codex":0.000010136048,"about_ca_system_score_gemma":0.000005430009,"threshold_uncertainty_score":0.3720382},"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":"W2163735025","doi":"10.1016/j.disc.2015.10.011","title":"Matching divisible designs with block size four","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Block size; Clique; Divisibility rule; Block (permutation group theory); Graph; Discrete mathematics; Matching (statistics); Clique graph; Line graph; Computer science; Statistics; Voltage graph","score_opus":0.03406893018427814,"score_gpt":0.22406720160125312,"score_spread":0.18999827141697498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163735025","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.8474965,0.00013519751,0.10099291,0.000028360273,0.000228515,0.00031159743,0.000011001367,0.0006494088,0.05014648],"genre_scores_gemma":[0.98574334,0.0000025727347,0.013541829,0.000013849653,0.00005817327,0.000025070254,0.000001927837,0.00006267286,0.0005505338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913657,0.000026410034,0.00022220642,0.000115039315,0.0002376322,0.0002621238],"domain_scores_gemma":[0.9993264,0.00012243676,0.00004347445,0.0003277047,0.000033929966,0.0001460431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031926684,0.00019114961,0.00023960246,0.000040310686,0.000051187715,0.000075304844,0.00018331203,0.000056697794,0.000019398625],"category_scores_gemma":[0.000027321612,0.00014380667,0.000051273084,0.00016214656,0.000028589315,0.00012042199,0.000025413658,0.00011750639,0.000121512785],"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.00013268352,0.0003932284,0.0022870484,0.006193475,0.00163265,0.00045271844,0.13204914,0.25800246,0.019398408,0.56719327,0.011126446,0.0011385046],"study_design_scores_gemma":[0.0041956455,0.0006609972,0.00035835736,0.0021278828,0.0004747546,0.00097005354,0.041023597,0.12821797,0.017640295,0.79518425,0.005804915,0.0033412972],"about_ca_topic_score_codex":0.000004488239,"about_ca_topic_score_gemma":0.0000066885914,"teacher_disagreement_score":0.22799098,"about_ca_system_score_codex":0.000026114776,"about_ca_system_score_gemma":0.000013387755,"threshold_uncertainty_score":0.58642656},"labels":[],"label_agreement":null},{"id":"W2164365639","doi":"10.1109/leos.2006.279142","title":"A Comparison of Optical Sources for Spectral Amplitude Coding OCDMA","year":2006,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Computer science; Forward error correction; Coding (social sciences); Encoding (memory); Error detection and correction; Electronic engineering; Algorithm; Optics; Decoding methods; Physics; Mathematics; Artificial intelligence; Engineering; Statistics","score_opus":0.01814807236987439,"score_gpt":0.2568775026204583,"score_spread":0.23872943025058388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164365639","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.86846936,0.00013485235,0.10456048,0.000009273841,0.00013572352,0.00012499852,0.000003993133,0.00015572998,0.026405577],"genre_scores_gemma":[0.99749666,4.497158e-7,0.002208554,0.0000026606976,0.00009781197,0.000011361791,0.0000040579066,0.000012088411,0.00016634465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994734,0.0000064729925,0.00021994596,0.000072388284,0.0000639598,0.00016386241],"domain_scores_gemma":[0.99977773,0.00008128444,0.000017260247,0.000085991574,0.000012337569,0.00002541058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097979006,0.00007587141,0.00018623334,0.000039115024,0.000026796748,0.000016412841,0.00007219373,0.000041935862,0.000033070082],"category_scores_gemma":[0.000004645234,0.000067881025,0.000075188334,0.00005755799,0.00002635436,0.000032053627,0.000005469866,0.000042223757,0.000006681662],"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.000022838925,0.00007016999,0.019806305,0.0002382522,0.000045657158,6.3889763e-7,0.0002802477,0.019759703,0.093546465,0.86392784,0.0020182321,0.00028365152],"study_design_scores_gemma":[0.0011345174,0.00019235695,0.016175374,0.00009016288,0.000062420266,0.000010727336,0.0015340562,0.10507812,0.84493273,0.021616336,0.008640759,0.0005324535],"about_ca_topic_score_codex":0.000014658432,"about_ca_topic_score_gemma":0.000021641983,"teacher_disagreement_score":0.8423115,"about_ca_system_score_codex":0.000009164268,"about_ca_system_score_gemma":0.0000019683605,"threshold_uncertainty_score":0.2768108},"labels":[],"label_agreement":null},{"id":"W2164662793","doi":"10.1016/j.disc.2011.11.039","title":"Generalized packing designs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorial design; Generalization; Block (permutation group theory); Block design; Orthogonal array; Packing problems; Combinatorics; Class (philosophy); Block size; Construct (python library); Discrete mathematics; Computer science; Key (lock); Statistics","score_opus":0.0547393547728578,"score_gpt":0.22740142291409257,"score_spread":0.17266206814123478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164662793","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.6662258,0.0002968693,0.16320816,0.00000432375,0.00049556786,0.0002807675,0.000010681525,0.000848903,0.16862893],"genre_scores_gemma":[0.9840621,0.000011550951,0.015591283,0.000011541685,0.000040842282,0.00002264374,0.000003215004,0.000043130258,0.0002137385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938864,0.000020868558,0.00021505928,0.00008153071,0.000094036135,0.00019986057],"domain_scores_gemma":[0.99960774,0.000023751172,0.00002997042,0.00026613238,0.000013206851,0.000059191938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016935097,0.00013375768,0.00017105081,0.00004674445,0.00004364447,0.000021316646,0.00014804577,0.00005469059,0.00024028578],"category_scores_gemma":[0.00001143808,0.000113779235,0.000076349235,0.00009789626,0.000025240492,0.000072530085,0.000015070278,0.00006815968,0.00015333285],"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.000008939602,0.00006554564,0.00047233218,0.0008027604,0.00023465764,0.000033468325,0.029561749,0.00046002492,0.01749322,0.9484662,0.0013983326,0.0010027979],"study_design_scores_gemma":[0.0014673765,0.00013524528,0.0007265546,0.0006203016,0.0002614866,0.00014379292,0.0067516,0.1357495,0.15259258,0.69489837,0.0045805355,0.0020726458],"about_ca_topic_score_codex":0.0000025357365,"about_ca_topic_score_gemma":0.0000016313492,"teacher_disagreement_score":0.31783625,"about_ca_system_score_codex":0.000010691659,"about_ca_system_score_gemma":0.0000027502779,"threshold_uncertainty_score":0.46397826},"labels":[],"label_agreement":null},{"id":"W2165510821","doi":"10.1016/j.jcta.2015.12.002","title":"Inequivalent factorizations of permutations","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Permutation (music); Mathematics; Enumeration; Disjoint sets; Combinatorics; Transitive relation; Equivalence relation; Monotone polygon; Equivalence (formal languages); Discrete mathematics; Relation (database); Series (stratigraphy); Computer science","score_opus":0.016639644029016812,"score_gpt":0.22281031841786625,"score_spread":0.20617067438884945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165510821","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.9622307,0.00087718724,0.009634619,0.000052970052,0.016577221,0.00013308728,0.000020626498,0.0000669542,0.010406675],"genre_scores_gemma":[0.9994612,0.000026039734,0.00011685896,0.0000031070763,0.0002804349,0.0000019906217,0.0000016582289,0.000016712398,0.000092031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900764,0.00012986448,0.00048136374,0.00003929625,0.00023549575,0.00010635238],"domain_scores_gemma":[0.99911064,0.00010088406,0.00018446385,0.00012573529,0.00036037824,0.00011792163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006786236,0.000098140765,0.00025831553,0.00013200514,0.00003355985,0.000019266867,0.0001758049,0.000058693127,0.000045699293],"category_scores_gemma":[0.00021505031,0.00008496764,0.00010951244,0.0002225362,0.00006424118,0.00034660823,0.000014432832,0.00013323277,0.0000033913984],"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.000159693,0.000053167398,0.00023489248,0.000036687914,0.00011950936,0.00000622614,0.0024486901,0.0053145094,0.0026402967,0.9881929,0.0006906419,0.000102745566],"study_design_scores_gemma":[0.0013320661,0.0005618688,0.00018878974,0.00008221839,0.000071163726,0.00010013562,0.0039807027,0.00007521226,0.009472359,0.9661378,0.017835498,0.00016214266],"about_ca_topic_score_codex":6.641968e-7,"about_ca_topic_score_gemma":2.5256136e-7,"teacher_disagreement_score":0.037230507,"about_ca_system_score_codex":0.00004260393,"about_ca_system_score_gemma":0.00006680685,"threshold_uncertainty_score":0.346488},"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":"W2167278060","doi":"10.1109/4234.922767","title":"SIR performance evaluation of a multirate OFFH-CDMA system","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","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":"Université Laval","funders":"","keywords":"Code division multiple access; Computer science; Process gain; Spread spectrum; Interference (communication); Transmission (telecommunications); Signal-to-interference ratio; Electronic engineering; Chip; Telecommunications; Algorithm; Engineering; Physics","score_opus":0.044356240088648545,"score_gpt":0.25416118328838505,"score_spread":0.2098049431997365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167278060","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.9908769,0.00050432474,0.0010879309,0.00017089379,0.00030858314,0.00028186693,0.000005766348,0.00020405458,0.0065596784],"genre_scores_gemma":[0.9993066,0.00010255501,0.0003443361,0.000046568723,0.000029860323,0.00012110655,0.0000132956,0.00001996173,0.00001567417],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990242,0.00023042668,0.00030964534,0.00008384124,0.00021198596,0.0001398994],"domain_scores_gemma":[0.9983645,0.000072329494,0.00007265083,0.0013521304,0.00010637798,0.000031985124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077977363,0.00010534717,0.00014297155,0.000120638564,0.00011566153,0.000014780281,0.0005741401,0.000044128206,0.000009579],"category_scores_gemma":[0.000009950786,0.00011023253,0.000055763318,0.0002950459,0.00008069305,0.00015254258,0.000025862806,0.0001270459,0.00006212762],"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.000032822732,0.00014681967,0.009390478,0.00059915823,0.00035973362,0.000002287328,0.0042242156,0.4445798,0.49338225,0.0035140994,0.0031796882,0.040588625],"study_design_scores_gemma":[0.0007132529,0.000018158928,0.006421386,0.00030808127,0.00010248857,0.000028180324,0.0005696753,0.97693396,0.0097667,0.00001779744,0.0048546977,0.00026565147],"about_ca_topic_score_codex":0.000017593435,"about_ca_topic_score_gemma":0.000014095608,"teacher_disagreement_score":0.5323541,"about_ca_system_score_codex":0.00009973906,"about_ca_system_score_gemma":0.000010489406,"threshold_uncertainty_score":0.44951522},"labels":[],"label_agreement":null},{"id":"W2167304554","doi":"10.1109/tit.2004.839525","title":"Using Directed Hill-Climbing for the Construction of Difference Triangle Sets","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Climbing; Mathematics; Computer science; Combinatorics; Hill climbing; Algorithm; Discrete mathematics; Engineering; Structural engineering","score_opus":0.017309932888172046,"score_gpt":0.2257718704049267,"score_spread":0.20846193751675465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167304554","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.08884928,0.000051790725,0.90864795,0.00001898236,0.0008812988,0.00036319037,0.00007934424,0.00023513912,0.0008730069],"genre_scores_gemma":[0.99859023,0.000024022062,0.0012107859,0.000031906733,0.000029069948,0.00006319584,0.000004487399,0.000010903078,0.000035376615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992361,0.00007138982,0.000404202,0.000050933853,0.00010648085,0.00013089649],"domain_scores_gemma":[0.99920136,0.00042935577,0.00009724856,0.0001756069,0.000066426976,0.00003003179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049204985,0.000112134236,0.00013999805,0.00016626698,0.00020396004,0.000027915914,0.000098007935,0.00007597042,0.000060033784],"category_scores_gemma":[0.000012633391,0.00008931024,0.00011880788,0.00019153529,0.0000665394,0.00046721456,3.7066823e-7,0.000120604534,0.000013670514],"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.00021873809,0.00003190421,0.0000030105525,0.00017000524,0.00017661841,3.917037e-8,0.003239936,0.5776567,0.006159489,0.021942317,0.00004178873,0.39035946],"study_design_scores_gemma":[0.0013210685,0.00006347705,0.00006655763,0.00013228877,0.00014091707,0.000029223103,0.0026866077,0.8224373,0.16584839,0.005305523,0.0016837209,0.00028493092],"about_ca_topic_score_codex":0.0000032938797,"about_ca_topic_score_gemma":0.0000031905277,"teacher_disagreement_score":0.909741,"about_ca_system_score_codex":0.000050857423,"about_ca_system_score_gemma":0.000013202356,"threshold_uncertainty_score":0.3641966},"labels":[],"label_agreement":null},{"id":"W2168980491","doi":"10.1109/ccece.2005.1556866","title":"Two-dimensional optical CDMA systems with multi-wavelength pulse modulation and double hard-limiters","year":2006,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Code division multiple access; Shot noise; Modulation (music); Optics; Limiter; Computer science; Arrayed waveguide grating; Fiber Bragg grating; Wavelength-division multiplexing; Interference (communication); Optical communication; Optical performance monitoring; Electronic engineering; Wavelength; Physics; Detector; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.012309835298697999,"score_gpt":0.1929114485765253,"score_spread":0.1806016132778273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168980491","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.9864922,0.00014356337,0.006710703,0.000015917565,0.00027618272,0.0002582181,0.00000407462,0.0002943929,0.005804707],"genre_scores_gemma":[0.9960451,8.4484094e-7,0.0030360792,0.000010133127,0.00009218815,0.000027741582,0.000020387633,0.00003088136,0.0007366262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991726,0.000020775338,0.00021140145,0.00019399897,0.00016364807,0.00023754036],"domain_scores_gemma":[0.99967307,0.000031875006,0.000020477994,0.00015934378,0.000035281602,0.00007994693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001515885,0.00016938895,0.00017699624,0.00007873511,0.000066677276,0.00007305767,0.00004705854,0.00006892351,0.000017710061],"category_scores_gemma":[0.0000012488852,0.00013180634,0.000028780178,0.00010572256,0.000041571373,0.00017102079,0.000011552672,0.00009166819,0.000023965686],"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.00009352234,0.000068719484,0.006235233,0.00017548166,0.000092271686,0.00002170231,0.00008090888,0.91842616,0.023498643,0.05032826,0.00035721058,0.0006219043],"study_design_scores_gemma":[0.0022168127,0.00004234747,0.014031785,0.00006983945,0.000023392027,0.000075077805,0.000086837324,0.9807244,0.0021355182,0.000086113534,0.00020197475,0.0003058984],"about_ca_topic_score_codex":0.00011472161,"about_ca_topic_score_gemma":0.00003677892,"teacher_disagreement_score":0.06229826,"about_ca_system_score_codex":0.000025909823,"about_ca_system_score_gemma":0.0000051598845,"threshold_uncertainty_score":0.53749067},"labels":[],"label_agreement":null},{"id":"W2169289619","doi":"10.1109/cleo.2006.4628375","title":"Incoherent SAC OCDMA system at 7&amp;#x00D7;622Mbps","year":2006,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Coding (social sciences); Computer science; Transmission (telecommunications); Information transmission; Amplitude; Bit error rate; Electronic engineering; Algorithm; Telecommunications; Physics; Computer network; Optics; Decoding methods; Mathematics; Engineering; Statistics","score_opus":0.0041569647566804145,"score_gpt":0.15136532307393236,"score_spread":0.14720835831725193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169289619","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.64186895,0.0004660748,0.003747519,0.000010377413,0.00094717037,0.00020557255,0.000009656892,0.0012988126,0.35144585],"genre_scores_gemma":[0.9888875,0.0000024460178,0.00017289101,0.00001142232,0.00022580544,0.000040426345,0.000017669176,0.00003918184,0.010602652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902856,0.000042991614,0.00030061963,0.00016884036,0.00016066708,0.00029830827],"domain_scores_gemma":[0.99951315,0.00003304449,0.000025809664,0.00033480796,0.000019672334,0.00007349104],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016372895,0.00018862706,0.00021212385,0.00007445357,0.000085078354,0.000034363766,0.00014624109,0.00010278967,0.0003119519],"category_scores_gemma":[0.0000019789657,0.00016302652,0.00009930771,0.00015318577,0.000020946542,0.00006913822,0.000032224365,0.00008559165,0.0017532055],"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.000054965312,0.00013800255,0.022671496,0.0022855974,0.00029338885,0.000061128165,0.00047145714,0.043533508,0.087445594,0.6639799,0.177044,0.0020209756],"study_design_scores_gemma":[0.0018231631,0.00007308053,0.0123132365,0.00045751684,0.000095843716,0.00025178198,0.0008702788,0.011363595,0.04125883,0.0027630995,0.9268863,0.0018432767],"about_ca_topic_score_codex":0.00017171734,"about_ca_topic_score_gemma":0.00030307137,"teacher_disagreement_score":0.7498423,"about_ca_system_score_codex":0.00015911998,"about_ca_system_score_gemma":0.0000050379776,"threshold_uncertainty_score":0.99902403},"labels":[],"label_agreement":null},{"id":"W2169436926","doi":"","title":"Polynomial Time Construction for Spatially Balanced Latin Squares","year":2012,"lang":"en","type":"article","venue":"eCommons (Cornell University)","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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Engineering research; Research council; Sustainability; Engineering; Library science; Mathematics; Operations research; Computer science; Philosophy; Telecommunications","score_opus":0.01388328295834733,"score_gpt":0.161359407767469,"score_spread":0.14747612480912164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169436926","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.94879043,0.00004165975,0.011925224,0.000008980302,0.0009531141,0.00023359901,0.00006374045,0.0003382616,0.03764499],"genre_scores_gemma":[0.998186,0.0000033382526,0.00034368865,0.0000057800617,0.0001946352,0.0000012440566,0.00002064261,0.000018652314,0.0012260517],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994665,0.000037455156,0.00010106925,0.00010547108,0.00003018033,0.00025933157],"domain_scores_gemma":[0.9996143,0.00007236958,0.000033399432,0.00016373047,0.000018458133,0.00009773371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009333619,0.00011757256,0.0001475626,0.0001697348,0.00009664661,0.000013308029,0.00012641253,0.0000866583,0.00016421895],"category_scores_gemma":[0.000007339581,0.0001406468,0.00009028731,0.00021539001,0.0000412096,0.0002168072,0.000019134499,0.00007927427,0.00014384167],"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.0014845247,0.0006086723,0.38530502,0.00083154807,0.0014627792,0.000053525626,0.0045347363,0.22249179,0.063830495,0.1991237,0.09724202,0.02303121],"study_design_scores_gemma":[0.011054635,0.00059840863,0.0724353,0.0002440118,0.0006175121,0.000103677216,0.002892923,0.31078213,0.03103143,0.0036334768,0.5627334,0.003873098],"about_ca_topic_score_codex":0.000010510082,"about_ca_topic_score_gemma":0.000020300857,"teacher_disagreement_score":0.46549138,"about_ca_system_score_codex":0.000058573267,"about_ca_system_score_gemma":0.000007960982,"threshold_uncertainty_score":0.57354105},"labels":[],"label_agreement":null},{"id":"W2169883084","doi":"10.1109/bsc.2006.1644567","title":"Impact of Component Mismatch on the BER Performance of 2D Wavelength-Time Bipolar OCDMA Systems","year":2006,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Bit error rate; Component (thermodynamics); Computer science; Encoder; Bit rate; Electronic engineering; Photodetector; Wavelength; Wavelength-division multiplexing; Code division multiple access; Decoding methods; Real-time computing; Optoelectronics; Telecommunications; Physics; Engineering","score_opus":0.005675504776042658,"score_gpt":0.17882596060997294,"score_spread":0.1731504558339303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169883084","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.98576045,0.00039178782,0.000038510057,0.000006769133,0.00018960277,0.00022443401,0.00002254142,0.00008334,0.01328256],"genre_scores_gemma":[0.99933416,0.00001602432,0.000011076713,0.0000021973517,0.000059004476,0.000009606912,0.000005901475,0.0000226096,0.0005394068],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990803,0.00006053537,0.00037669094,0.000091991606,0.00019164121,0.00019883504],"domain_scores_gemma":[0.99939877,0.000112344555,0.00007214982,0.00034515685,0.00004036773,0.000031186148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031511448,0.00015961382,0.00028142997,0.000076298486,0.00003802058,0.000011148058,0.000181851,0.00006683904,0.00013578887],"category_scores_gemma":[0.0000029958376,0.00009464663,0.00015014703,0.00016013008,0.000042767468,0.000054064953,0.000011993313,0.00009794806,0.0000883524],"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.00019586361,0.00050779985,0.042689264,0.0017916288,0.00093065243,0.000005168601,0.0010936339,0.37196773,0.501965,0.058689494,0.018670082,0.0014936636],"study_design_scores_gemma":[0.0010962698,0.0007666188,0.12369099,0.00077004434,0.0000838305,0.00005250471,0.0003381032,0.7287795,0.13907349,0.00021470313,0.004355815,0.00077816227],"about_ca_topic_score_codex":0.0003951899,"about_ca_topic_score_gemma":0.0000020314494,"teacher_disagreement_score":0.36289153,"about_ca_system_score_codex":0.00003336943,"about_ca_system_score_gemma":0.00000711133,"threshold_uncertainty_score":0.38595775},"labels":[],"label_agreement":null},{"id":"W2170207118","doi":"10.1006/jcss.1999.1673","title":"Circuits and Expressions with Nonassociative Gates","year":2000,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; McGill University","funders":"Santa Fe Institute; Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Quasigroup; Mathematics; Multiplication (music); Iterated function; Group (periodic table); Abelian group; Semigroup; Counterexample; Expression (computer science); Discrete mathematics; Class (philosophy); Value (mathematics); Algebra over a field; Pure mathematics; Combinatorics; Computer science","score_opus":0.006162769610364968,"score_gpt":0.18186925985654281,"score_spread":0.17570649024617785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170207118","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.9921815,0.0011981787,0.0020963848,0.000019798848,0.00018588048,0.00003754378,0.0000011539909,0.000018256544,0.0042613284],"genre_scores_gemma":[0.9995157,0.000039565995,0.0003026207,0.0000076218885,0.00010345795,6.179637e-7,3.0064147e-8,0.0000026859288,0.00002767401],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994705,0.00004843578,0.00017263924,0.00005980188,0.00015393068,0.00009470501],"domain_scores_gemma":[0.9997415,0.000075600765,0.000056478442,0.000030082405,0.000029542867,0.00006677516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964392,0.000064050706,0.0001642675,0.00006176896,0.00012433153,0.00009123277,0.000085948144,0.000020333777,0.0000053443678],"category_scores_gemma":[8.7330335e-7,0.00003761404,0.000019989226,0.000108798384,0.00007454914,0.00020876067,0.0000052372934,0.000055657347,0.00000102372],"study_design_candidate":"observational","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.00016826372,0.00026444453,0.24909768,0.003023807,0.0016715407,0.0007408786,0.09765932,0.14150354,0.0117590595,0.06489587,0.008564355,0.42065123],"study_design_scores_gemma":[0.009125432,0.0075056655,0.46530902,0.020735323,0.0004032358,0.024387512,0.037866425,0.4035423,0.0048941905,0.006014233,0.017068848,0.0031477897],"about_ca_topic_score_codex":0.0000011982021,"about_ca_topic_score_gemma":6.2404814e-7,"teacher_disagreement_score":0.41750345,"about_ca_system_score_codex":0.000007228685,"about_ca_system_score_gemma":0.000009562734,"threshold_uncertainty_score":0.15338561},"labels":[],"label_agreement":null},{"id":"W2170656436","doi":"10.1109/infocom.2008.4544661","title":"Repetition-based broadcast in vehicular ad hoc networks in Rician channel with capture","year":2008,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"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":"Rician fading; Computer science; Retransmission; Quality of service; Computer network; Throughput; Capture effect; Multimedia Broadcast Multicast Service; Channel (broadcasting); Transmission (telecommunications); Wireless ad hoc network; Fading; Wireless; Telecommunications; Network packet; Multicast","score_opus":0.004979968855715233,"score_gpt":0.15307669331248414,"score_spread":0.1480967244567689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170656436","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.98412585,0.002481149,0.0058503924,0.00005782469,0.00017049075,0.0002400936,0.0000024123049,0.00021691446,0.006854847],"genre_scores_gemma":[0.99948984,0.000062978055,0.000086423606,0.00010109112,0.00003514885,0.000039718485,0.000012912365,0.000023979394,0.0001478837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993115,0.000038328275,0.00017008063,0.00014887172,0.00009214753,0.00023905288],"domain_scores_gemma":[0.99971694,0.000023352055,0.00001554328,0.00018243869,0.000013464552,0.000048234295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001158718,0.00013568813,0.00016747325,0.0001428984,0.000030313005,0.000008176038,0.00007587891,0.00011193263,0.000037579797],"category_scores_gemma":[0.0000032038658,0.00011537926,0.000032931835,0.00043167875,0.00002746008,0.000062234125,0.0000041958624,0.00021167468,0.000012239317],"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.000029915873,0.000032295713,0.004682082,0.00003451491,0.000009378334,0.00031006662,0.00054476113,0.99353045,0.00007374333,0.00027941389,0.00024006866,0.00023332797],"study_design_scores_gemma":[0.0033372357,0.00016075886,0.04600051,0.0007298071,0.000012586031,0.00016227902,0.0014009504,0.9393885,0.00077771425,0.0002553749,0.0067637893,0.0010105039],"about_ca_topic_score_codex":0.00006849461,"about_ca_topic_score_gemma":0.00093803694,"teacher_disagreement_score":0.054141942,"about_ca_system_score_codex":0.00003946184,"about_ca_system_score_gemma":0.000010476292,"threshold_uncertainty_score":0.47050297},"labels":[],"label_agreement":null},{"id":"W2170667309","doi":"10.1109/jsac.2007.070605","title":"Optical CDMA for All-Optical Sub-Wavelength Switching in Core GMPLS Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","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":"University of British Columbia","funders":"","keywords":"Label switching; Multiprotocol Label Switching; Computer science; Optical burst switching; Optical switch; Computer network; Circuit switching; Packet switching; Network packet; Throughput; Granularity; Optical Transport Network; Wavelength-division multiplexing; Topology (electrical circuits); Optical performance monitoring; Electronic engineering; Wavelength; Quality of service; Telecommunications; Optoelectronics; Materials science; Engineering","score_opus":0.037186699507115104,"score_gpt":0.2929329365543196,"score_spread":0.2557462370472045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170667309","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.92810965,0.0006084309,0.06624329,0.00028739206,0.0005899257,0.0004430298,0.000004906947,0.00015206612,0.0035613275],"genre_scores_gemma":[0.9958386,0.00045370575,0.0032712638,0.0001053162,0.00021157882,0.000040907657,0.000017292994,0.000052812946,0.000008552146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804866,0.0001398017,0.00084708957,0.00015550318,0.00019628032,0.0006126404],"domain_scores_gemma":[0.9969463,0.0018906338,0.00009765833,0.0007044963,0.00015131572,0.00020962273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017695503,0.0002242101,0.00033481402,0.0004380493,0.0002112565,0.00008110512,0.00079449144,0.00023884243,0.000005872674],"category_scores_gemma":[0.00026009482,0.00022486642,0.000109163215,0.00082017464,0.00005843312,0.00015356598,0.000036590653,0.0017949786,0.000008340117],"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.0015514141,0.0033423617,0.028062545,0.00021323233,0.0010366737,0.00032095524,0.0060789087,0.39630792,0.0964008,0.30933973,0.004684394,0.15266109],"study_design_scores_gemma":[0.0053504314,0.00058321556,0.07765654,0.0016796532,0.00013239041,0.0013296289,0.0010210602,0.8766669,0.007269822,0.018834045,0.007852478,0.0016238528],"about_ca_topic_score_codex":0.00000516636,"about_ca_topic_score_gemma":0.0005862549,"teacher_disagreement_score":0.48035896,"about_ca_system_score_codex":0.0002840289,"about_ca_system_score_gemma":0.00004595662,"threshold_uncertainty_score":0.91697866},"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":"W2171224738","doi":"10.1016/j.disc.2012.11.016","title":"Nonincident points and blocks in designs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Steiner system; Block (permutation group theory); Projective plane; Integer (computer science); Order (exchange); Discrete mathematics; Set (abstract data type); Upper and lower bounds; Projective test; Blocking set; Projective space; Pure mathematics; Collineation; Geometry; Computer science; Mathematical analysis","score_opus":0.017609548280486755,"score_gpt":0.22740561784222574,"score_spread":0.209796069561739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171224738","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.98354125,0.0005106661,0.0063817822,0.00000905991,0.00013303143,0.00013176343,0.0000029322184,0.00008237911,0.009207134],"genre_scores_gemma":[0.99753356,0.00001520543,0.0022898135,0.0000087914905,0.000034934958,0.000016070708,0.0000013491892,0.000020410249,0.00007985727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945045,0.00001703754,0.00018010642,0.000053840213,0.0000799551,0.00021863285],"domain_scores_gemma":[0.9997103,0.00005285519,0.000019032737,0.00014067067,0.000004855399,0.000072243136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031356758,0.000101675665,0.00014322117,0.000056423647,0.00002034378,0.000018499506,0.00006222198,0.000046985417,0.000035193152],"category_scores_gemma":[0.000017259117,0.00008900943,0.00002485026,0.000078147816,0.00001988528,0.00009650014,0.000019167455,0.000074505486,0.000037562884],"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.000025647445,0.00050071976,0.113535024,0.0043655024,0.00035988507,0.00006201361,0.14141245,0.0016939488,0.02727246,0.7026792,0.0022769321,0.0058161756],"study_design_scores_gemma":[0.005515452,0.000301927,0.07953077,0.0038118605,0.0004491059,0.0010786493,0.040919986,0.35420147,0.08124747,0.418193,0.0090426095,0.005707691],"about_ca_topic_score_codex":0.0000018882678,"about_ca_topic_score_gemma":0.0000035112712,"teacher_disagreement_score":0.35250753,"about_ca_system_score_codex":0.000015705074,"about_ca_system_score_gemma":0.0000016220262,"threshold_uncertainty_score":0.3629699},"labels":[],"label_agreement":null},{"id":"W2171862265","doi":"10.1109/icc.1998.683029","title":"Optical frequency-hop multiple access communications system","year":2002,"lang":"en","type":"article","venue":"","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":"Université Laval","funders":"","keywords":"Code division multiple access; Computer science; Frequency-hopping spread spectrum; Decoding methods; Encoding (memory); Bandwidth (computing); Multi-frequency time division multiple access; Electronic engineering; Radio frequency; Fiber Bragg grating; Computer network; Spread spectrum; Channel access method; Optical fiber; Telecommunications; Orthogonal frequency-division multiplexing; Wireless; MIMO-OFDM; Engineering","score_opus":0.04001347727825082,"score_gpt":0.23127769514634403,"score_spread":0.19126421786809322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171862265","genre_codex":"other","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.10941996,0.0012882552,0.010359218,0.00013551649,0.0005754792,0.00028471596,0.000011571485,0.001873101,0.8760522],"genre_scores_gemma":[0.9983763,0.000032162778,0.0011012694,0.000017971197,0.00003883857,0.00005114979,0.0000038637104,0.000019623532,0.00035882078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994293,0.000036778405,0.0001958122,0.000088285204,0.00007977415,0.00017008193],"domain_scores_gemma":[0.9990429,0.00010733691,0.000012133853,0.0007395537,0.000022139156,0.00007593492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098043325,0.000096422475,0.00012206641,0.000051884985,0.00009221285,0.00006388887,0.00059799047,0.0000659348,0.00022254017],"category_scores_gemma":[0.00001317772,0.00008726024,0.000051464875,0.00016652494,0.000043063475,0.00017667233,0.000057930683,0.000118130054,0.0006167751],"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.0000020631935,0.000099385245,0.006238751,0.00039207982,0.00013931759,0.000013185744,0.0006688906,0.0022626836,0.007153556,0.97144914,0.008539133,0.0030418448],"study_design_scores_gemma":[0.00074495457,0.000028746143,0.0016992666,0.00017929063,0.000042370088,0.00009361962,0.0014133271,0.97313726,0.0048014014,0.0010109643,0.016175602,0.00067321473],"about_ca_topic_score_codex":0.000022953363,"about_ca_topic_score_gemma":0.000040190105,"teacher_disagreement_score":0.97087455,"about_ca_system_score_codex":0.00003526004,"about_ca_system_score_gemma":0.000001324616,"threshold_uncertainty_score":0.79276025},"labels":[],"label_agreement":null},{"id":"W2173160516","doi":"10.1007/10719839_12","title":"The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Computer science; Expressive power; Factorization; Simple (philosophy); Range (aeronautics); Theoretical computer science; Discrete mathematics; Graph; Algorithm; Mathematics","score_opus":0.013625297980357658,"score_gpt":0.20251689179391552,"score_spread":0.18889159381355786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173160516","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.0016425101,0.0025358319,0.9803171,0.0000719567,0.0027226862,0.0003610941,0.000040720774,0.00017657853,0.012131531],"genre_scores_gemma":[0.9977076,0.0003359065,0.0016067971,0.000038720893,0.00016999558,0.000005927214,0.000009357341,0.000032344044,0.00009335299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842626,0.000025297517,0.00044464695,0.00035591458,0.0003891193,0.0003587841],"domain_scores_gemma":[0.9988332,0.00028931524,0.00009952467,0.0006448151,0.00007004502,0.0000631355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032753448,0.00029039555,0.00033952357,0.00029333687,0.000305849,0.0000921416,0.000872555,0.00018051175,0.000032876884],"category_scores_gemma":[0.000012453628,0.00022548546,0.00012893222,0.00042102375,0.0006923963,0.00010868794,0.00007858085,0.0004124153,0.000018616003],"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.00000937378,0.000026632591,0.00043451195,0.00020004794,0.00010663428,0.000017617804,0.0013081508,0.46842653,0.0028054065,0.1638498,0.00009334573,0.36272195],"study_design_scores_gemma":[0.00038595867,0.00012775866,0.0017934144,0.0011348068,0.00004565778,0.00008110991,9.534767e-7,0.27278978,0.0021675415,0.6881715,0.032056622,0.0012448988],"about_ca_topic_score_codex":0.0000091556985,"about_ca_topic_score_gemma":0.000047990678,"teacher_disagreement_score":0.9960651,"about_ca_system_score_codex":0.000052881085,"about_ca_system_score_gemma":0.00005135485,"threshold_uncertainty_score":0.91950303},"labels":[],"label_agreement":null},{"id":"W2181059595","doi":"10.1007/978-1-4613-0245-2_10","title":"Sets of Steiner Triple Systems of Order 9 Revisited","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Order (exchange); Mathematics; Computer science; Business","score_opus":0.010779006020303664,"score_gpt":0.19009549216629643,"score_spread":0.17931648614599277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181059595","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.0003810531,0.006559457,0.0007081856,0.0000017267677,0.00081380183,0.0004478134,0.00010830822,0.00012276391,0.9908569],"genre_scores_gemma":[0.16720986,0.00029407383,0.0001233212,0.000014769289,0.00007686105,0.000013276723,0.00006615275,0.00015885757,0.8320428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987143,0.00002707423,0.0007231973,0.00016793348,0.00021814872,0.00014933544],"domain_scores_gemma":[0.9990699,0.000039916158,0.00018015062,0.00049587875,0.00016092113,0.000053218286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024079077,0.0002967405,0.00080524717,0.00021674568,0.000011387712,0.000007650304,0.00015330267,0.00035828445,0.0006478217],"category_scores_gemma":[0.0000095149635,0.00025714925,0.00017745297,0.00007856228,0.00003876244,0.000036205416,0.000013035999,0.00016663341,0.00004593304],"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.000017544586,0.000013892186,0.000018416731,0.005374365,0.0007101449,0.00000924915,0.00009216527,0.0019549776,0.0015607413,0.95915043,0.030745769,0.00035229395],"study_design_scores_gemma":[0.001168948,0.00016755633,0.000010193401,0.0036799072,0.00034840475,0.000056288678,0.0001161869,0.0016073791,0.002586625,0.004845113,0.98418665,0.0012267528],"about_ca_topic_score_codex":0.000012330426,"about_ca_topic_score_gemma":0.000002420301,"teacher_disagreement_score":0.95430535,"about_ca_system_score_codex":0.000019476638,"about_ca_system_score_gemma":0.000010911799,"threshold_uncertainty_score":0.9999881},"labels":[],"label_agreement":null},{"id":"W2184053848","doi":"","title":"A complete existence theory for Sarvate-Beam triple systems ∗","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","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 Victoria","funders":"","keywords":"Mathematics; Cover (algebra); Block (permutation group theory); Combinatorics; Constant (computer programming); Variation (astronomy); Discrete mathematics; Computer science; Physics; Engineering","score_opus":0.037038494114212867,"score_gpt":0.23667583532448774,"score_spread":0.19963734121027488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184053848","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.94832665,0.0033246467,0.014988816,0.00003435745,0.009575681,0.002016173,0.00032078364,0.0013090858,0.020103835],"genre_scores_gemma":[0.9967831,0.000011016296,0.00013460444,0.00002720939,0.00036355839,0.00023378749,0.000038729664,0.000056003515,0.0023520158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985701,0.000088016364,0.0003613371,0.00017157351,0.00015075816,0.00065825233],"domain_scores_gemma":[0.9990734,0.00023130493,0.000058192345,0.0004015625,0.000041306477,0.00019422919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647242,0.00024814697,0.0003433898,0.0000829984,0.00012093741,0.00006049255,0.00028151856,0.00013160148,0.00005989477],"category_scores_gemma":[0.000027760827,0.00023260464,0.00014904382,0.00017613015,0.00006570827,0.00026233157,0.000021522324,0.00016216762,0.00022536314],"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.00014859451,0.00018874927,0.0065313526,0.0015645688,0.00045732997,0.0000070289548,0.0018694247,0.0041696443,0.030631263,0.9223651,0.030740233,0.0013266891],"study_design_scores_gemma":[0.0054050204,0.0005412467,0.014280745,0.0007593159,0.00039126386,0.00032778882,0.0047760876,0.011755021,0.016547907,0.026571147,0.91561496,0.0030294731],"about_ca_topic_score_codex":0.000012848306,"about_ca_topic_score_gemma":0.0000016706676,"teacher_disagreement_score":0.895794,"about_ca_system_score_codex":0.000047131784,"about_ca_system_score_gemma":0.000007848616,"threshold_uncertainty_score":0.94853413},"labels":[],"label_agreement":null},{"id":"W2188248099","doi":"","title":"A square tile lls the plane by translation in at most two distinct ways I","year":2011,"lang":"en","type":"article","venue":"","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":"Université du Québec à Montréal","funders":"","keywords":"Parallelogram; Polyomino; Substitution tiling; Square tiling; Tile; Square (algebra); Mathematics; Hexagonal tiling; Combinatorics; Conjecture; Plane (geometry); Tessellation (computer graphics); Translation (biology); Grid; Geometry; Regular polygon; Physics; Hinge","score_opus":0.021331574573156167,"score_gpt":0.18375502420027745,"score_spread":0.1624234496271213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188248099","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.83254564,0.00032555975,0.0028798257,0.000012869883,0.00018448972,0.00021953284,0.00003856107,0.00018811716,0.1636054],"genre_scores_gemma":[0.99957335,0.0000028641186,0.00002637937,0.000012034319,0.000017356046,0.000021122692,0.000027215974,0.000012178773,0.00030752041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959725,0.000022291257,0.00012463165,0.00007400909,0.0000564128,0.00012541257],"domain_scores_gemma":[0.99978745,0.000045950263,0.000009287028,0.00012938655,0.000003761026,0.000024181189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011468248,0.00007823611,0.00007495565,0.000021770826,0.000038092843,0.000007487312,0.000082456376,0.00003362881,0.00072749355],"category_scores_gemma":[0.0000021713972,0.000052670417,0.000022863765,0.00009727802,0.000014141243,0.000049263163,0.0000048617726,0.0000614334,0.00010740054],"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.0008168202,0.00075119967,0.18333232,0.0013403009,0.0004972227,0.0001364054,0.15782148,0.011598383,0.19327655,0.19382322,0.15495619,0.10164991],"study_design_scores_gemma":[0.012246283,0.00064926397,0.11330186,0.00068649574,0.00020491268,0.0002243977,0.010744011,0.23303737,0.3005186,0.036019783,0.28790772,0.0044593005],"about_ca_topic_score_codex":0.00017241946,"about_ca_topic_score_gemma":0.0011707017,"teacher_disagreement_score":0.22143899,"about_ca_system_score_codex":0.000013920725,"about_ca_system_score_gemma":0.0000013303085,"threshold_uncertainty_score":0.79655445},"labels":[],"label_agreement":null},{"id":"W2205106594","doi":"","title":"A ring partition construction for bibds","year":2011,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","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 Waterloo","funders":"","keywords":"Partition (number theory); Ring (chemistry); Mathematics; Chemistry; Combinatorics; Organic chemistry","score_opus":0.27318270693068336,"score_gpt":0.4884649468728085,"score_spread":0.21528223994212514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205106594","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.95218295,0.00464262,0.016367733,0.0000070468072,0.0021013597,0.000610518,0.00004264664,0.00017559265,0.023869546],"genre_scores_gemma":[0.99783367,0.0010617181,0.000691601,0.000020858553,0.00016540605,0.00011107799,0.000006591784,0.000047760946,0.00006133924],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986401,0.00008603887,0.0005773483,0.00020403783,0.00020669136,0.0002857412],"domain_scores_gemma":[0.9991178,0.000094663,0.00024993435,0.0002660787,0.00012981171,0.00014172106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007902884,0.00020557312,0.00040918955,0.0005516018,0.00015843964,0.00032904404,0.00079244,0.00010071313,0.003014795],"category_scores_gemma":[0.000057006506,0.00020292796,0.00016508468,0.00051912625,0.0000752237,0.0016321532,0.000098925775,0.00017782663,0.000018222796],"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.00071948534,0.00026594356,0.34332138,0.0014779482,0.0012446218,0.000037327565,0.00223382,0.0031282057,0.5028613,0.02629265,0.030624349,0.08779297],"study_design_scores_gemma":[0.0018477723,0.0000414822,0.2690543,0.0013919426,0.0002837985,0.00012319186,0.00064489024,0.0033787354,0.5362558,0.16273557,0.02287945,0.0013630606],"about_ca_topic_score_codex":0.000077641496,"about_ca_topic_score_gemma":0.000012321863,"teacher_disagreement_score":0.13644293,"about_ca_system_score_codex":0.000043830303,"about_ca_system_score_gemma":0.000020021938,"threshold_uncertainty_score":0.9978966},"labels":[],"label_agreement":null},{"id":"W2224352238","doi":"10.4310/joc.2019.v10.n2.a5","title":"Fractional triangle decompositions of dense $3$-partite graphs","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","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 Victoria","funders":"","keywords":"Combinatorics; Decomposition; Mathematics; Degree (music); Discrete mathematics; Physics","score_opus":0.01095973669627161,"score_gpt":0.22873226548772016,"score_spread":0.21777252879144854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224352238","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.9664661,0.0062474236,0.009095682,0.00004864529,0.014102043,0.00021265858,0.000047527574,0.00004924203,0.003730644],"genre_scores_gemma":[0.9991356,0.00045376056,0.00014158215,0.000008049465,0.00013215884,0.000004150514,0.000006195362,0.000033655284,0.0000848359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982819,0.000108295484,0.00094338786,0.00009590602,0.0004110311,0.00015947415],"domain_scores_gemma":[0.99827904,0.00021677348,0.0007000383,0.0002978044,0.00039786915,0.00010845932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005984257,0.00020704984,0.00069129904,0.00046428354,0.000036798436,0.00003549567,0.00033346724,0.00028181222,0.000045509638],"category_scores_gemma":[0.00004485067,0.00020389432,0.00057766365,0.0002358849,0.000030918178,0.00012595014,0.000059005633,0.00090675807,0.000014922642],"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.00042045207,0.0013620188,0.012354132,0.0037284954,0.0037852488,0.00020286882,0.0013288041,0.5984731,0.010368865,0.33382928,0.03347346,0.00067329186],"study_design_scores_gemma":[0.0034623172,0.00052440783,0.008825511,0.0023788714,0.00069628714,0.000577441,0.00025145416,0.005649597,0.009661399,0.95305896,0.014024799,0.00088895345],"about_ca_topic_score_codex":0.000002321705,"about_ca_topic_score_gemma":6.323283e-7,"teacher_disagreement_score":0.6192297,"about_ca_system_score_codex":0.00010426008,"about_ca_system_score_gemma":0.00010545005,"threshold_uncertainty_score":0.8314569},"labels":[],"label_agreement":null},{"id":"W2230116819","doi":"10.1016/j.disc.2016.04.025","title":"On the chromatic number of Latin square graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"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; Simon Fraser University; Iran National Science Foundation","keywords":"Mathematics; Latin square; Chromatic scale; Combinatorics; Square (algebra); Discrete mathematics; Geometry","score_opus":0.012626269838465693,"score_gpt":0.21597526861001257,"score_spread":0.20334899877154688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230116819","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.96440095,0.000023204148,0.0044215336,0.000070458445,0.00011938775,0.00019819273,0.00002596377,0.00012426256,0.030616036],"genre_scores_gemma":[0.99932855,0.0000058564374,0.00031445394,0.000011264684,0.000013526585,0.000026636677,0.0000012339249,0.00002939328,0.00026909445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993123,0.00003241329,0.00027176194,0.0000697523,0.00016751251,0.00014625466],"domain_scores_gemma":[0.9990508,0.0004406562,0.000062013976,0.00039882434,0.000017086719,0.00003064445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020753499,0.00012874953,0.0001850546,0.00003017437,0.000035752382,0.000011330726,0.0001799301,0.000045483885,0.00035718436],"category_scores_gemma":[0.00006637916,0.000060766528,0.00010307661,0.00012630569,0.000062460065,0.000038428676,0.000014448382,0.000051406143,0.00034749214],"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.0000022464183,0.000021920518,0.00024123599,0.0004493353,0.00006402309,0.000001173862,0.0015804863,0.000045412122,0.0036568865,0.9927053,0.0010281162,0.00020387686],"study_design_scores_gemma":[0.00037787165,0.000046714136,0.0004642461,0.0016051215,0.000047027497,0.000013311759,0.0012910562,0.004494475,0.014573023,0.9764756,0.0002916964,0.00031984647],"about_ca_topic_score_codex":5.955449e-7,"about_ca_topic_score_gemma":8.7941885e-7,"teacher_disagreement_score":0.034927577,"about_ca_system_score_codex":0.000009589557,"about_ca_system_score_gemma":0.0000027228066,"threshold_uncertainty_score":0.44664243},"labels":[],"label_agreement":null},{"id":"W2231642173","doi":"10.1080/03081087.2016.1265062","title":"Generalization of Scarpis’ theorem on Hadamard matrices","year":2016,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","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 Waterloo","funders":"","keywords":"Hadamard transform; Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Hadamard three-lines theorem; Hadamard product; Hadamard three-circle theorem; Complex Hadamard matrix","score_opus":0.007260602651030938,"score_gpt":0.2087422465767668,"score_spread":0.20148164392573586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231642173","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.9923745,0.00050583656,0.0045212833,0.00003332061,0.000294442,0.0001336538,0.000032876018,0.00016493685,0.0019391504],"genre_scores_gemma":[0.9987171,0.00027052002,0.00049187,0.000025677187,0.000162828,0.0000062408226,0.0000057857274,0.00002746795,0.00029248148],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993537,0.000037381524,0.00021580904,0.00014012096,0.00010924906,0.0001437039],"domain_scores_gemma":[0.9996046,0.000081437254,0.000035058154,0.00018433384,0.00003536995,0.000059236525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001516415,0.0001301731,0.00017008462,0.00008740973,0.000033793058,0.00000909918,0.00008136828,0.00008016055,0.000052980235],"category_scores_gemma":[0.000025561492,0.000084415056,0.00005683682,0.00010605938,0.000057035628,0.00007398576,0.0000147904275,0.000045886005,0.000039634713],"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.0005166725,0.00028682483,0.021156965,0.0012103443,0.000531861,0.00002177492,0.0026663982,0.008045297,0.49371713,0.24287942,0.0029837557,0.22598353],"study_design_scores_gemma":[0.0043461975,0.00045312694,0.009833884,0.00074513874,0.00011633118,0.000029174198,0.00026958535,0.13689049,0.8058209,0.007420524,0.032951266,0.0011234264],"about_ca_topic_score_codex":0.0000053703116,"about_ca_topic_score_gemma":0.0000026128669,"teacher_disagreement_score":0.31210372,"about_ca_system_score_codex":0.0000070680553,"about_ca_system_score_gemma":0.000004253092,"threshold_uncertainty_score":0.34423462},"labels":[],"label_agreement":null},{"id":"W2232963440","doi":"10.1007/978-3-642-36675-8_6","title":"Group Embedding of the Projective Plane PG(2, 3)","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Manitoba","funders":"","keywords":"Group (periodic table); Abelian group; Projective plane; Embedding; Line (geometry); Plane (geometry); Real projective plane; Combinatorics; Order (exchange); Blocking set; Point (geometry); Set (abstract data type); Projective space; Mathematics; Computer science; Discrete mathematics; Topology (electrical circuits); Projective test; Collineation; Pure mathematics; Geometry; Physics; Artificial intelligence; Quantum mechanics","score_opus":0.008292215418764315,"score_gpt":0.2005605530395908,"score_spread":0.19226833762082648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232963440","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.007473321,0.00062182004,0.9659047,0.000028480685,0.00394019,0.0007917824,0.000013718573,0.00014998154,0.021076022],"genre_scores_gemma":[0.99489117,0.000007185906,0.004586515,0.00005612529,0.0002258043,0.000010143374,0.0000015030058,0.00002967678,0.00019187077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987683,0.000019357489,0.0002653251,0.0003391984,0.00034306245,0.00026472515],"domain_scores_gemma":[0.9991455,0.00016964432,0.00009542764,0.00049941655,0.000051659576,0.00003833503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030834117,0.00025701075,0.00029459246,0.00022594478,0.00007022621,0.000057188267,0.00086160656,0.00018420977,0.000033417553],"category_scores_gemma":[0.000017958148,0.0001775859,0.00009042373,0.00023082798,0.00037208118,0.00011797217,0.00017250617,0.00046738764,0.000017137443],"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.000016568467,0.000037196212,0.0003041933,0.00090860674,0.00013883723,0.000029312834,0.007898841,0.5223043,0.011181041,0.1073739,0.00019825611,0.34960893],"study_design_scores_gemma":[0.0004838762,0.00021580687,0.0007566846,0.003334228,0.000040507006,0.00015368138,0.000004377728,0.59395486,0.018634614,0.3777992,0.0031756607,0.0014464909],"about_ca_topic_score_codex":0.000017387481,"about_ca_topic_score_gemma":0.000026481908,"teacher_disagreement_score":0.9874179,"about_ca_system_score_codex":0.00008367414,"about_ca_system_score_gemma":0.0000377603,"threshold_uncertainty_score":0.72417426},"labels":[],"label_agreement":null},{"id":"W2240675245","doi":"10.1017/s0025557200172778","title":"87.36 Multiplying with quarter squares","year":2003,"lang":"en","type":"article","venue":"The Mathematical Gazette","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"Quarter (Canadian coin); Mathematics; Arithmetic; Geography","score_opus":0.0072176732949611935,"score_gpt":0.17868845486390952,"score_spread":0.17147078156894832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240675245","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.71220565,0.00027586997,0.07610703,0.00025169362,0.00025095983,0.00058987783,0.0000035033402,0.0007156454,0.20959975],"genre_scores_gemma":[0.99845636,0.0000014844147,0.0009229457,0.000074861986,0.000038361955,0.000055540335,4.6654787e-7,0.00003503208,0.00041497266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916005,0.00008667455,0.00019780287,0.000108942964,0.00016999603,0.00027655414],"domain_scores_gemma":[0.9993074,0.00021983423,0.000020977786,0.00037375832,0.000014388914,0.00006364729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037474188,0.0001630356,0.0001907774,0.00003021774,0.00009035849,0.00004786166,0.00016129477,0.000047410616,0.00029048044],"category_scores_gemma":[0.000034633566,0.00008973204,0.00006085098,0.0001305112,0.00007566407,0.00005971454,0.000007819814,0.000164295,0.0005341699],"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.000052675667,0.00013648522,0.00023271769,0.0008943411,0.00033707215,0.000045694494,0.009620455,0.005290974,0.007035083,0.9684647,0.006791403,0.0010984219],"study_design_scores_gemma":[0.004116433,0.0004811123,0.001148702,0.0016544072,0.0004737908,0.0012045479,0.012120157,0.10059622,0.04205901,0.7623981,0.07073534,0.0030121426],"about_ca_topic_score_codex":6.234979e-7,"about_ca_topic_score_gemma":0.0000012834419,"teacher_disagreement_score":0.28625065,"about_ca_system_score_codex":0.000011515003,"about_ca_system_score_gemma":0.0000034346883,"threshold_uncertainty_score":0.6865852},"labels":[],"label_agreement":null},{"id":"W2246570676","doi":"10.4153/cmb-2016-057-0","title":"Convex-normal (Pairs of) Polytopes","year":2016,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Regular polygon; Mathematics; Lattice (music); Normality; Enhanced Data Rates for GSM Evolution; Physics; Geometry; Computer science; Statistics","score_opus":0.007754329103090948,"score_gpt":0.17944194498746746,"score_spread":0.1716876158843765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246570676","genre_codex":"other","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.20937566,0.0022249585,0.010645735,0.002979669,0.0024429061,0.001397142,0.0010483009,0.0006928565,0.76919276],"genre_scores_gemma":[0.9973426,0.0000154037,0.00024013444,0.00008381282,0.00016219872,0.00006312432,0.0000131657325,0.000071221395,0.0020083736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998515,0.000060588394,0.0005251653,0.00023056664,0.00017376395,0.00049488875],"domain_scores_gemma":[0.998595,0.0001545596,0.000068469155,0.0005779265,0.00004853615,0.0005555119],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003382232,0.00031540616,0.00059136335,0.00022077574,0.000039795592,0.000035166282,0.00045570347,0.00041960532,0.01604449],"category_scores_gemma":[0.00009422119,0.0002696426,0.00020780184,0.000060612558,0.00014962042,0.000013665418,0.000075035525,0.00037115975,0.0057129664],"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.000019141846,0.000055957065,0.00022027169,0.010274187,0.00070078124,0.00021533288,0.0016175963,0.0006161267,0.00076716836,0.8082031,0.17413339,0.003176929],"study_design_scores_gemma":[0.0007941549,0.00007663516,0.00028782611,0.005713751,0.00021186499,0.00012363741,0.00042929605,0.0020043168,0.005963547,0.5357722,0.44630542,0.0023173436],"about_ca_topic_score_codex":0.00033888806,"about_ca_topic_score_gemma":0.0002662831,"teacher_disagreement_score":0.7879669,"about_ca_system_score_codex":0.000112347065,"about_ca_system_score_gemma":0.00013189985,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W2249730235","doi":"","title":"Using Turbo Codes and Non-Gaussian Interference to Improve Spectral Efficiency in M-ary Optical CDMA Networks","year":2006,"lang":"en","type":"article","venue":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","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":"McGill University","funders":"","keywords":"Computer science; Turbo code; Code division multiple access; Turbo; Electronic engineering; Interference (communication); Transmission (telecommunications); Decoding methods; Demodulation; Spectral efficiency; Additive white Gaussian noise; Multiuser detection; Algorithm; Telecommunications; Engineering; White noise; Channel (broadcasting)","score_opus":0.013830258678835928,"score_gpt":0.2348873360896328,"score_spread":0.2210570774107969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249730235","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.9204465,0.00017352928,0.014267138,0.0017233993,0.0037406925,0.00072746904,0.00010830504,0.00029173394,0.058521207],"genre_scores_gemma":[0.99682957,0.00017287185,0.0001908306,0.00029384554,0.00087010884,0.000063962216,0.000096191485,0.00006569383,0.0014169156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966532,0.00008715725,0.0009876628,0.00092271325,0.00060391147,0.00074533536],"domain_scores_gemma":[0.99882317,0.00017348338,0.0002094096,0.00030692478,0.00018351401,0.00030349198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004857818,0.0006770783,0.0005797048,0.00064990623,0.0002098804,0.00049100607,0.0006887241,0.00041702506,0.00013002305],"category_scores_gemma":[0.00005813927,0.00066810555,0.00014647338,0.00032609457,0.0001717951,0.00034347601,0.00018510573,0.0009587894,0.00002910808],"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.0009823157,0.00077151513,0.008976741,0.0002058732,0.0006063134,0.00026541503,0.003779946,0.72783947,0.047145057,0.20008904,0.0006546449,0.008683682],"study_design_scores_gemma":[0.0017738361,0.0004395198,0.003954325,0.0015255442,0.00005544782,0.00013242253,0.00041811744,0.9692065,0.015705997,0.004797105,0.0007570897,0.0012340791],"about_ca_topic_score_codex":0.0003007262,"about_ca_topic_score_gemma":0.000096372896,"teacher_disagreement_score":0.24136706,"about_ca_system_score_codex":0.00039029488,"about_ca_system_score_gemma":0.00003592147,"threshold_uncertainty_score":0.99957705},"labels":[],"label_agreement":null},{"id":"W2254138235","doi":"10.1006/jcta.1999.3031","title":"Truncated Transversal Designs: A New Lower Bound on the Number of Idempotent MOLS of Side n","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"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","funders":"","keywords":"Transversal (combinatorics); Mathematics; Disjoint sets; Combinatorics; Corollary; Idempotence; Type (biology); Upper and lower bounds; Point (geometry); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.011410803374765703,"score_gpt":0.2144298490886143,"score_spread":0.20301904571384857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254138235","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.9875065,0.00029146217,0.0002388289,0.000104329585,0.0028493847,0.00017476473,0.000007439491,0.000025715237,0.008801587],"genre_scores_gemma":[0.9991915,0.00009268772,0.000036388406,0.000023160592,0.00028322046,0.0000023863142,4.80997e-7,0.000031356438,0.00033881655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981947,0.00035519918,0.00079690834,0.000079688936,0.00037219955,0.00020129215],"domain_scores_gemma":[0.99884033,0.00043291342,0.00025185375,0.0002561395,0.00011625469,0.00010252064],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012478015,0.00020040128,0.00051336066,0.000068406756,0.00005498532,0.000026164362,0.00036296275,0.00011908675,0.0011363608],"category_scores_gemma":[0.000082555634,0.00013738078,0.00033346566,0.00024839104,0.00015108155,0.0002407997,0.000007009992,0.00029733975,0.000011589275],"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.0084063765,0.000262683,0.00006500434,0.00010660295,0.00081370457,0.000048520298,0.0031579556,0.0056740385,0.024224197,0.95308477,0.0019816407,0.0021745397],"study_design_scores_gemma":[0.0025946463,0.0011329296,0.00018264382,0.00042792258,0.00016132643,0.00017160627,0.000930493,0.00004235581,0.07264451,0.91142315,0.010022065,0.00026636565],"about_ca_topic_score_codex":0.000008265022,"about_ca_topic_score_gemma":5.687072e-7,"teacher_disagreement_score":0.048420314,"about_ca_system_score_codex":0.00003676541,"about_ca_system_score_gemma":0.00007773445,"threshold_uncertainty_score":0.9997767},"labels":[],"label_agreement":null},{"id":"W2258179867","doi":"10.1007/978-3-319-17729-8_13","title":"A Simple Construction of Complex Equiangular Lines","year":2015,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Equiangular polygon; Combinatorics; Mathematics; Hadamard transform; Set (abstract data type); Norm (philosophy); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.034531160939664074,"score_gpt":0.24841867450991006,"score_spread":0.213887513570246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258179867","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054414594,0.0015973933,0.065132685,0.000008922997,0.0011272609,0.0015817008,0.001462643,0.00063418096,0.92301375],"genre_scores_gemma":[0.14154807,0.0010284946,0.797986,0.000023779789,0.0010921593,0.00013943421,0.00039940266,0.0012032546,0.056579467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980605,0.0000032200373,0.0009843098,0.00023562224,0.0004296063,0.0002867431],"domain_scores_gemma":[0.9988469,0.000084535466,0.00038057406,0.00021337703,0.00037731006,0.00009730609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044721254,0.0004337378,0.0008216765,0.00032892055,0.000029133796,0.000042531356,0.00027297912,0.00031571763,0.0001555748],"category_scores_gemma":[0.000110766574,0.0004678731,0.00008121675,0.00007002561,0.00019269186,0.00007282477,0.00007632182,0.00038096355,0.000042196956],"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.000006069688,0.000020463684,0.000037327267,0.004891902,0.00010574295,0.000011585878,0.0012741903,0.00014004397,0.00062539626,0.98924905,0.0024977613,0.0011404635],"study_design_scores_gemma":[0.00028571696,0.00004959584,0.000011728469,0.0008648363,0.00011235961,0.000032403797,0.00035486917,0.011853303,0.00023954119,0.9496284,0.036047846,0.00051935867],"about_ca_topic_score_codex":0.0000034983434,"about_ca_topic_score_gemma":0.000007742752,"teacher_disagreement_score":0.8664343,"about_ca_system_score_codex":0.0001098562,"about_ca_system_score_gemma":0.0000297089,"threshold_uncertainty_score":0.9997773},"labels":[],"label_agreement":null},{"id":"W2265044263","doi":"10.1016/j.ejc.2016.07.001","title":"On the existence of unparalleled even cycle systems","year":2016,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Disjoint sets; Partition (number theory); Vertex (graph theory); Mathematics; Graph; Class (philosophy); Order (exchange); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.0143087983742838,"score_gpt":0.19419913837809996,"score_spread":0.17989034000381615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265044263","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.85003984,0.005368522,0.007770349,0.000136206,0.013444072,0.0003877118,0.000028659153,0.00009826932,0.12272639],"genre_scores_gemma":[0.99919796,0.00021534051,0.000009777029,0.000009044205,0.00022563843,0.000002178515,6.61797e-7,0.000071359216,0.0002680342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972759,0.0009761029,0.00094884716,0.00012489605,0.00047033463,0.00020395083],"domain_scores_gemma":[0.9979229,0.00032818425,0.00078259147,0.0006010966,0.00026112152,0.000104102066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350095,0.00027039295,0.0005387877,0.00016020023,0.00005049058,0.000054975564,0.0011285613,0.00007263049,0.000013444843],"category_scores_gemma":[0.00012841563,0.00016323222,0.00029195176,0.00013526891,0.00006410193,0.000054123746,0.00013818801,0.0007929257,0.000045848785],"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.00010431804,0.00014330684,0.00014435757,0.0010877104,0.00071889034,0.00035341142,0.0011013541,0.05755762,0.0010313531,0.9254933,0.011781146,0.0004832076],"study_design_scores_gemma":[0.006240599,0.0025617157,0.0044031385,0.027870761,0.0006374259,0.0008638934,0.0015159631,0.007872472,0.0039134067,0.89408934,0.047176514,0.0028547572],"about_ca_topic_score_codex":5.2118077e-7,"about_ca_topic_score_gemma":3.4208785e-8,"teacher_disagreement_score":0.14915815,"about_ca_system_score_codex":0.00007699499,"about_ca_system_score_gemma":0.0000368785,"threshold_uncertainty_score":0.6656417},"labels":[],"label_agreement":null},{"id":"W2267091437","doi":"10.1007/978-3-319-17729-8_6","title":"D-Optimal Matrices of Orders 118, 138, 150, 154 and 174","year":2015,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"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":"Circulant matrix; Type (biology); Mathematics; Computation; Order (exchange); Property (philosophy); Combinatorics; Construct (python library); Pure mathematics; Arithmetic; Discrete mathematics; Computer science; Algorithm; Geology","score_opus":0.016159834737910418,"score_gpt":0.22249481159212986,"score_spread":0.20633497685421945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267091437","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01511016,0.0067829518,0.026435811,0.000012329331,0.0010537147,0.0017245151,0.0009106744,0.00056267926,0.9474072],"genre_scores_gemma":[0.1333679,0.006233773,0.7120461,0.000028911658,0.0007594644,0.0001681161,0.00010731668,0.0015664398,0.14572196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978774,0.000003741481,0.0009553553,0.00031733705,0.0004869739,0.00035918038],"domain_scores_gemma":[0.99882954,0.00015186364,0.00039356278,0.00020986759,0.00027834144,0.0001368007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006444848,0.0005398858,0.0008937392,0.00047339406,0.00004372866,0.0000958498,0.00031198192,0.00037189174,0.000076823875],"category_scores_gemma":[0.00012547434,0.000560408,0.00006669902,0.000104099236,0.0001876105,0.00011522172,0.0001162894,0.0005135886,0.000031756645],"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.000012753523,0.000034100824,0.000052392505,0.010097001,0.00018323942,0.000025434798,0.0032604912,0.00032931432,0.00013652879,0.9796316,0.005236139,0.001001024],"study_design_scores_gemma":[0.0008545603,0.00019651015,0.000022130578,0.0033677185,0.00042348722,0.00007807083,0.001305573,0.019153088,0.00028754267,0.9156634,0.057017837,0.0016300348],"about_ca_topic_score_codex":0.000006352585,"about_ca_topic_score_gemma":0.0000074216227,"teacher_disagreement_score":0.8016852,"about_ca_system_score_codex":0.000086517815,"about_ca_system_score_gemma":0.000036428544,"threshold_uncertainty_score":0.99968475},"labels":[],"label_agreement":null},{"id":"W22740230","doi":"10.1007/s10719-012-9415-0","title":"A note on party switchers","year":2006,"lang":"en","type":"article","venue":"Canadian parliamentary review","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Business; Economics; Financial system; Chemistry","score_opus":0.00909025027837581,"score_gpt":0.20346920273433458,"score_spread":0.19437895245595876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22740230","genre_codex":"review","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.096416555,0.5101602,0.000106678825,0.0032957783,0.002429604,0.0025940277,0.00026917603,0.000734712,0.38399324],"genre_scores_gemma":[0.9857112,0.0069043734,0.000035902653,0.006445591,0.00020022268,0.00010035957,0.00008939718,0.00004711534,0.00046580585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991737,0.000038663908,0.00022677176,0.00014472744,0.00008683528,0.00032929148],"domain_scores_gemma":[0.99942315,0.00001684643,0.000019626603,0.00028100688,0.000008294528,0.00025108524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015565654,0.00016211682,0.00023022934,0.00006682519,0.000054770393,0.000016062224,0.00013358319,0.00004262211,0.00060048944],"category_scores_gemma":[0.0000034457814,0.00015473047,0.00009613305,0.0001826852,0.000018964842,0.000057043577,0.0000028488344,0.00011681286,0.0007415401],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021870396,0.00001341498,0.0011195311,0.0020556783,0.000053922053,0.00011924905,0.000039060647,0.00058117404,0.00010937788,0.0030662469,0.9570011,0.035839073],"study_design_scores_gemma":[0.00009872655,0.000016094933,0.00044300986,0.0015516863,0.000033228145,0.000011799793,0.000014056297,0.000075929114,0.00010925801,0.0003663257,0.99705607,0.00022380093],"about_ca_topic_score_codex":0.030083064,"about_ca_topic_score_gemma":0.12400542,"teacher_disagreement_score":0.8892947,"about_ca_system_score_codex":0.00022963293,"about_ca_system_score_gemma":0.000042397554,"threshold_uncertainty_score":0.9763757},"labels":[],"label_agreement":null},{"id":"W2276998446","doi":"10.1155/2016/2162849","title":"Some Nonexistence and Asymptotic Existence Results for Weighing Matrices","year":2016,"lang":"en","type":"article","venue":"International Journal of Combinatorics","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":"York University","funders":"University of Lethbridge","keywords":"Algorithm; Computer science; Artificial intelligence; Mathematics","score_opus":0.010831190863685116,"score_gpt":0.2323785495239046,"score_spread":0.2215473586602195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276998446","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.95888793,0.0043405383,0.018824864,0.0010168952,0.0142036425,0.00016730672,0.00005927247,0.000080939135,0.002418583],"genre_scores_gemma":[0.9984739,0.0007003336,0.00030867892,0.000018407034,0.0003511347,0.0000027292997,5.0615625e-7,0.000011807202,0.00013250674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.000019279889,0.00040963048,0.0000761071,0.00028159085,0.00011661879],"domain_scores_gemma":[0.9990197,0.0003717661,0.0001865486,0.00007445475,0.0002791045,0.00006843759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043202023,0.00009138458,0.00014469105,0.00015261436,0.000030822343,0.00005381744,0.00032765177,0.000044643497,0.0000015037532],"category_scores_gemma":[0.00016082994,0.000064763495,0.00007130092,0.000059001082,0.000032078053,0.0003942809,0.000022607728,0.00007289676,0.0000035411006],"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.00031410024,0.00007304446,0.0013465263,0.000099307144,0.00033191175,0.00008148099,0.0005454574,0.00023931812,0.00829756,0.97932196,0.0016353545,0.0077139926],"study_design_scores_gemma":[0.0063542947,0.0004894474,0.002565902,0.0013072551,0.00006614361,0.0006405196,0.00024902122,0.0021029066,0.011237476,0.94070256,0.033805262,0.00047919923],"about_ca_topic_score_codex":7.1340287e-7,"about_ca_topic_score_gemma":2.138943e-7,"teacher_disagreement_score":0.039585937,"about_ca_system_score_codex":0.00007455025,"about_ca_system_score_gemma":0.00001567155,"threshold_uncertainty_score":0.26409787},"labels":[],"label_agreement":null},{"id":"W2286047733","doi":"10.46298/dmtcs.3595","title":"Minimal Factorizations of Permutations into Star Transpositions","year":2008,"lang":"fr","type":"book-chapter","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Saint Mary's University; St. Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Star (game theory); Simple (philosophy); Symmetry (geometry); Parity of a permutation; Factorization; Symmetric group; Discrete mathematics; Cyclic permutation; Algorithm; Physics","score_opus":0.013641827223859806,"score_gpt":0.22867255934584396,"score_spread":0.21503073212198415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286047733","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.016086018,0.00022453083,0.9177947,0.00019707577,0.0008832508,0.0006164184,0.00039987054,0.0001606106,0.06363751],"genre_scores_gemma":[0.8358155,0.00009789229,0.16350286,0.000015966765,0.00014900757,0.000019803143,0.000054787033,0.00008317162,0.00026100758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963531,0.000077364384,0.0012698562,0.00065725285,0.0010099369,0.00063250033],"domain_scores_gemma":[0.9972276,0.00069373776,0.0002670662,0.00093713304,0.00044171416,0.00043276043],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006028076,0.000658638,0.0008658434,0.0004903188,0.00086771394,0.00014397212,0.0012517394,0.000314987,0.0008460525],"category_scores_gemma":[0.00006375728,0.0006297091,0.0004716104,0.00053064973,0.009795874,0.00036840892,0.00018472053,0.00052103447,0.0001581783],"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.000005252157,0.00009591167,0.0000054248017,0.0006386875,0.00010344078,0.000017526534,0.013117202,0.002459783,0.002136142,0.98104084,0.000012318433,0.00036749188],"study_design_scores_gemma":[0.00025665178,0.00029802602,0.00006531998,0.0013343117,0.00028220288,0.00012595003,0.0002887441,0.3221381,0.001766659,0.67208296,0.0005002325,0.0008608131],"about_ca_topic_score_codex":0.000007189224,"about_ca_topic_score_gemma":0.0000036564643,"teacher_disagreement_score":0.8197295,"about_ca_system_score_codex":0.00012014139,"about_ca_system_score_gemma":0.00017773894,"threshold_uncertainty_score":0.99961543},"labels":[],"label_agreement":null},{"id":"W2293156574","doi":"","title":"Small Octahedral Systems","year":2011,"lang":"en","type":"article","venue":"","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":"Simon Fraser University; McMaster University","funders":"","keywords":"Cardinality (data modeling); Octahedron; Simplicial complex; Simple (philosophy); Mathematics; Set (abstract data type); Simplicial approximation theorem; Combinatorics; Parity (physics); Computer science; Pure mathematics; Physics; Simplicial set","score_opus":0.039222013453659055,"score_gpt":0.15609925720091172,"score_spread":0.11687724374725267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293156574","genre_codex":"other","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.39051622,0.00029437264,0.0052188938,8.9408024e-7,0.0012067609,0.00008906075,0.0000012963109,0.0006564186,0.6020161],"genre_scores_gemma":[0.9978831,0.000003155727,0.00014378522,0.000007335606,0.00005648739,0.000014057589,7.149752e-7,0.000014522059,0.0018768475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996417,0.0000142943645,0.00010891343,0.00006165963,0.000035608966,0.00013778824],"domain_scores_gemma":[0.9997829,0.0000068716245,0.000006637308,0.00014656996,0.000008777363,0.000048197657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008520177,0.00007137995,0.000082721446,0.000034745863,0.000017733697,0.000011979507,0.00009171122,0.00004224718,0.00019171229],"category_scores_gemma":[0.0000014371818,0.000059627295,0.00003261907,0.000059503906,0.000010189626,0.00004260149,0.000006401915,0.000044594584,0.00039256449],"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.00001471946,0.00004276719,0.007146069,0.00034708937,0.0001632941,0.00004398416,0.0028957524,0.0013586367,0.0053662164,0.97466516,0.0061713704,0.0017849201],"study_design_scores_gemma":[0.005583489,0.0009711921,0.06069077,0.0008945992,0.00032666008,0.0013373969,0.02235682,0.25758615,0.16383366,0.053958263,0.42421922,0.008241775],"about_ca_topic_score_codex":0.000054317883,"about_ca_topic_score_gemma":0.000009170256,"teacher_disagreement_score":0.9207069,"about_ca_system_score_codex":0.0000065668382,"about_ca_system_score_gemma":0.0000015311551,"threshold_uncertainty_score":0.5045753},"labels":[],"label_agreement":null},{"id":"W2296267519","doi":"10.7155/jgaa.00389","title":"Constructive algorithms for the partial directed weighted improper coloring problem","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","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":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Constructive; Computer science; Algorithm; Mathematics; Programming language","score_opus":0.010210136984915599,"score_gpt":0.2204246536533684,"score_spread":0.2102145166684528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296267519","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.038450893,0.0030769857,0.9545612,0.00052665407,0.0011573595,0.0014888316,0.0001559444,0.0001779155,0.00040424487],"genre_scores_gemma":[0.98079216,0.0013298359,0.015242024,0.000027421893,0.0014204208,0.00092266203,0.0000028717752,0.000056292076,0.00020630601],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999141,0.00002440723,0.00039432163,0.00011762884,0.00012418353,0.00019845282],"domain_scores_gemma":[0.99911654,0.00026513328,0.00015177242,0.00014150208,0.00022248841,0.00010256654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032431228,0.00013731865,0.0002110853,0.00009913633,0.00024313355,0.000043726053,0.00016679165,0.00006473838,0.000010652402],"category_scores_gemma":[0.000008153853,0.000070973845,0.00012928306,0.00024242396,0.00015881284,0.00015469496,0.000014009379,0.00011973557,0.0000019518757],"study_design_candidate":"design_other","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.00018428404,0.00011727777,0.0006156948,0.00014004175,0.0014082106,0.00000400832,0.00081639393,0.00019372105,0.04210555,0.07048226,0.0026672678,0.8812653],"study_design_scores_gemma":[0.010688101,0.0011576153,0.0047053243,0.0006249718,0.001164074,0.0012444303,0.0029305927,0.041963045,0.06074493,0.16730326,0.70578456,0.0016891035],"about_ca_topic_score_codex":0.000003102212,"about_ca_topic_score_gemma":0.0000015315476,"teacher_disagreement_score":0.94234127,"about_ca_system_score_codex":0.000019821675,"about_ca_system_score_gemma":0.000020260164,"threshold_uncertainty_score":0.28942293},"labels":[],"label_agreement":null},{"id":"W2301470204","doi":"10.1007/s00026-016-0316-y","title":"Pairwise Balanced Designs Covered by Bounded Flats","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bounded function; Pairwise comparison; Combinatorics; Divisibility rule; Dimension (graph theory); Upper and lower bounds; Constant (computer programming); Point (geometry); Discrete mathematics; Geometry; Mathematical analysis; Statistics; Computer science","score_opus":0.0342408080177925,"score_gpt":0.24268675503997775,"score_spread":0.20844594702218525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301470204","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.9787466,0.0019901013,0.0066552674,0.00023000424,0.0014360992,0.00022018272,0.000072047056,0.00036035484,0.01028937],"genre_scores_gemma":[0.9987951,0.0003247116,0.000009217707,0.000047348705,0.000019104913,0.000012494438,0.0000040982395,0.000028566898,0.00075935293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990903,0.00005625578,0.00026590217,0.00012429628,0.0001883094,0.00027490308],"domain_scores_gemma":[0.9993219,0.000117784475,0.0000614933,0.0003011496,0.000096188945,0.000101503174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026580947,0.00014952882,0.00024690974,0.00005846854,0.00003830556,0.000014480927,0.00020644769,0.000103665465,0.00004134621],"category_scores_gemma":[0.00004677267,0.00011844186,0.000093868264,0.00020781918,0.00004738946,0.00015072557,0.000016269647,0.000060177612,0.000050328574],"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.00011221947,0.0002809108,0.00469646,0.00035163024,0.0003446202,0.000014976785,0.0003965877,0.00008991039,0.19598557,0.42791057,0.3645778,0.0052387537],"study_design_scores_gemma":[0.0015387662,0.00026257074,0.0011016583,0.00020808795,0.000017879449,0.000004488154,0.00004162767,0.00022424737,0.53040797,0.39343983,0.07222617,0.00052671303],"about_ca_topic_score_codex":0.0000030047554,"about_ca_topic_score_gemma":3.8466266e-7,"teacher_disagreement_score":0.3344224,"about_ca_system_score_codex":0.000016584801,"about_ca_system_score_gemma":0.00001264991,"threshold_uncertainty_score":0.48299187},"labels":[],"label_agreement":null},{"id":"W2306066718","doi":"10.5802/alco.103","title":"Parity of transversals of Latin squares","year":2020,"lang":"lv","type":"article","venue":"Algebraic Combinatorics","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Parity (physics); Congruence relation; Modulo; Diagonal; Order (exchange); Matrix (chemical analysis)","score_opus":0.02137300143909144,"score_gpt":0.20338881934325537,"score_spread":0.18201581790416393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2306066718","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.9866687,0.004933697,0.0010267331,0.00035414498,0.0012776827,0.00037635336,0.0001178795,0.00013271924,0.0051120915],"genre_scores_gemma":[0.9995993,0.00015970289,0.000027818229,0.000032431642,0.000054668893,0.0000059882486,0.000012901355,0.00004842839,0.000058801357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997997,0.00017144473,0.00085669605,0.00026723894,0.00038711142,0.00032055154],"domain_scores_gemma":[0.9987222,0.00031350643,0.00023871404,0.00039868106,0.00012227164,0.00020463004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032968933,0.00029734036,0.0007812201,0.00012461476,0.000044993238,0.000013992648,0.00042895798,0.00025104417,0.00017665264],"category_scores_gemma":[0.00014462993,0.00033497906,0.00030673336,0.001197713,0.00012361308,0.00010913892,0.000054999506,0.00032768588,0.00004168409],"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.00007118054,0.00024055998,0.008766245,0.0039338386,0.0003847386,0.000014199225,0.009811356,0.0006586187,0.0076152547,0.9665004,0.0011289261,0.00087466044],"study_design_scores_gemma":[0.012434778,0.0046962965,0.03153979,0.0021998277,0.0017902083,0.00001615443,0.009668839,0.02820841,0.33051574,0.5468264,0.028549315,0.0035542012],"about_ca_topic_score_codex":0.000054897566,"about_ca_topic_score_gemma":0.000002944106,"teacher_disagreement_score":0.41967398,"about_ca_system_score_codex":0.000027649987,"about_ca_system_score_gemma":0.000053514643,"threshold_uncertainty_score":0.99991024},"labels":[],"label_agreement":null},{"id":"W2308744755","doi":"10.14288/1.0051450","title":"Equalizing filter design for high-speed off-chip buses","year":2010,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","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 British Columbia","funders":"","keywords":"Signal integrity; Bandwidth (computing); Bottleneck; Chip; Electronic engineering; Computer science; Printed circuit board; Engineering; Embedded system; Telecommunications; Electrical engineering","score_opus":0.013757991529739791,"score_gpt":0.16935409778490268,"score_spread":0.1555961062551629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308744755","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.98263955,0.00010027994,0.015296378,0.0000118628095,0.0006225079,0.0003072469,0.0001287211,0.00022659164,0.00066684716],"genre_scores_gemma":[0.9974133,0.000021527865,0.002051274,0.000012685084,0.000066516426,0.0000010592772,0.000014258687,0.00002718347,0.0003922465],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992809,0.000036935096,0.00011512202,0.00020504327,0.00011441447,0.00024753847],"domain_scores_gemma":[0.9994187,0.00012047569,0.000048980823,0.00023810781,0.000083566985,0.000090171045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002707669,0.000051030616,0.00022929793,0.000045875993,0.00017080859,0.00007615376,0.00027857022,0.00013556481,0.00013124738],"category_scores_gemma":[0.00002572605,0.00018372523,0.000111613,0.00014243196,0.00010926651,0.00024367581,0.000031085096,0.00014120009,0.00002132504],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008346465,0.0002214193,0.004408531,0.0010786908,0.00047311714,0.0001821533,0.0020524315,0.0023359654,0.15935516,0.00062824244,0.03494131,0.7942395],"study_design_scores_gemma":[0.004278614,0.00025969162,0.959897,0.0004598485,0.00019144986,0.0001490195,0.0027533255,0.0103791235,0.0006408552,0.011930278,0.0078118877,0.0012489373],"about_ca_topic_score_codex":0.005672861,"about_ca_topic_score_gemma":0.03533956,"teacher_disagreement_score":0.95548844,"about_ca_system_score_codex":0.000016810991,"about_ca_system_score_gemma":0.000016205202,"threshold_uncertainty_score":0.98226297},"labels":[],"label_agreement":null},{"id":"W2311329553","doi":"10.46298/dmtcs.2879","title":"Unitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Factorization; Permutation (music); Unitary state; Permutation group; Hierarchy; Unique factorization domain; Symmetric group; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.0078064844100120745,"score_gpt":0.24448053424556881,"score_spread":0.23667404983555673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311329553","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.35994774,0.00043640842,0.6270497,0.0005917739,0.0037969318,0.00058871636,0.00010419612,0.00020037846,0.0072841793],"genre_scores_gemma":[0.8441656,0.000046531157,0.15525709,0.00005311627,0.0002619692,0.000016398948,0.000011845633,0.0000472703,0.00014018003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701095,0.00013696181,0.0007331779,0.00061075453,0.00065766874,0.00085051154],"domain_scores_gemma":[0.99788046,0.00049488066,0.00013870522,0.0007523633,0.00021671261,0.00051686674],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018266692,0.00048118323,0.00048137357,0.00026995543,0.00051918527,0.00058472337,0.0009922704,0.00021506686,0.00041218937],"category_scores_gemma":[0.00020988879,0.0004193292,0.00012502659,0.00089261436,0.004525666,0.0006156312,0.000517337,0.00078246905,0.00012283184],"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.000004083333,0.00009070816,0.00014344054,0.00033585122,0.000044854758,0.000011446251,0.0034729652,0.000058704296,0.0043132375,0.9874273,0.000071361144,0.004026055],"study_design_scores_gemma":[0.0002784166,0.00013846227,0.00029773454,0.0004222241,0.00008931875,0.00010718637,0.0007904718,0.41727325,0.0026924948,0.5766327,0.0007008895,0.0005768877],"about_ca_topic_score_codex":0.000010274015,"about_ca_topic_score_gemma":0.0000052720475,"teacher_disagreement_score":0.48421785,"about_ca_system_score_codex":0.000050944655,"about_ca_system_score_gemma":0.0000791689,"threshold_uncertainty_score":0.99982584},"labels":[],"label_agreement":null},{"id":"W2313514078","doi":"10.4153/cmb-2004-017-9","title":"Suborbit Structure of Permutation <i>p</i>-Groups and an Application to Cayley Digraph Isomorphism","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Peking University; Bulgarian National Science Fund; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Mathematical Society","keywords":"Mathematics; Digraph; Isomorphism (crystallography); Cayley's theorem; Combinatorics; Permutation group; Order (exchange); Cayley graph; Permutation (music); Prime (order theory); Cyclic permutation; Simple (philosophy); Transitive relation; Discrete mathematics; Symmetric group; Crystallography; Chemistry; Crystal structure","score_opus":0.0031880113690952515,"score_gpt":0.1810926494294149,"score_spread":0.17790463806031964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313514078","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.9862655,0.00006779016,0.011487162,0.00039807236,0.000041843407,0.0003308608,0.00006223676,0.00006249595,0.0012840747],"genre_scores_gemma":[0.998967,0.0000019543836,0.00077419553,0.00013878991,0.000036090616,0.000020803942,0.000020229994,0.000024531202,0.000016387232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.000017452883,0.0002106791,0.00014839957,0.000094341594,0.00020268402],"domain_scores_gemma":[0.99929494,0.000025338784,0.000021626174,0.00021515653,0.000031509688,0.0004114154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000895586,0.00012326223,0.00017431095,0.00013418295,0.000048561695,0.000022705983,0.00010549396,0.00009289605,0.00030391396],"category_scores_gemma":[0.000025134479,0.00012371803,0.000027314245,0.00015521038,0.000047253572,0.00003224362,0.0000053718036,0.00008499187,0.00018778765],"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.000013859668,0.00004254465,0.00022979362,0.00082884385,0.000055693064,0.00002039689,0.0057133343,0.0094193565,0.07455443,0.9059844,0.0010636965,0.0020736763],"study_design_scores_gemma":[0.0017788144,0.00037771827,0.0065963557,0.0005678313,0.00013983555,0.00026290183,0.0028886015,0.004299809,0.037148904,0.9241047,0.020186448,0.0016480605],"about_ca_topic_score_codex":0.00070779526,"about_ca_topic_score_gemma":0.0029561357,"teacher_disagreement_score":0.037405528,"about_ca_system_score_codex":0.00005538169,"about_ca_system_score_gemma":0.000022929611,"threshold_uncertainty_score":0.5045075},"labels":[],"label_agreement":null},{"id":"W2319713596","doi":"10.4153/cmb-2006-011-6","title":"PSL(2, 2<i><sup>n</sup></i>)-Extensions Over","year":2006,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Mathematics; Construct (python library); Polynomial; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science; Programming language","score_opus":0.004346947046719541,"score_gpt":0.1646152167021111,"score_spread":0.16026826965539157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319713596","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.639889,0.00047410798,0.0019264647,0.0011640682,0.00023974854,0.00043713357,0.00008245834,0.0005767241,0.3552103],"genre_scores_gemma":[0.9948996,0.000002757883,0.00034894765,0.0003447631,0.00018617538,0.00003421329,0.000015135405,0.000058160753,0.0041103004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876684,0.00003661945,0.0003130855,0.00018417936,0.00015033271,0.0005489628],"domain_scores_gemma":[0.9990309,0.000115093055,0.000016520746,0.00036389247,0.000027470836,0.0004461309],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019939402,0.0002085286,0.00025330274,0.00014355274,0.00011888264,0.000059766106,0.00018839752,0.00014267441,0.014352139],"category_scores_gemma":[0.000053530573,0.00020029822,0.00011389004,0.00016967619,0.000073590054,0.000026656211,0.000012005353,0.00019111548,0.017066859],"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.00000294309,0.000037981692,0.000114464834,0.0002162427,0.000042896823,0.00016666287,0.00020165004,0.0066740853,0.00024720054,0.49797976,0.49402604,0.00029008358],"study_design_scores_gemma":[0.00044849052,0.00002397658,0.0006297121,0.00020112286,0.000046867146,0.00014430143,0.00022500615,0.023786748,0.00028359026,0.119233206,0.8542428,0.0007341742],"about_ca_topic_score_codex":0.0010072362,"about_ca_topic_score_gemma":0.0006219808,"teacher_disagreement_score":0.37874657,"about_ca_system_score_codex":0.00009259081,"about_ca_system_score_gemma":0.000032477066,"threshold_uncertainty_score":0.9865489},"labels":[],"label_agreement":null},{"id":"W2319967356","doi":"10.1017/s1446788714000664","title":"-TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION","year":2015,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","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 Lethbridge","funders":"","keywords":"Transitive relation; Mathematics; Cartesian product; Vertex (graph theory); Cartesian coordinate system; Decomposition; Combinatorics; Transitive closure; Set (abstract data type); Wedge (geometry); Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.02237400526189458,"score_gpt":0.2541157236628497,"score_spread":0.2317417184009551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319967356","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.98092175,0.00012136532,0.013134726,0.0012437066,0.0006107115,0.0002112616,0.000007486255,0.00006865844,0.0036803668],"genre_scores_gemma":[0.9976349,0.0000039837146,0.0019510952,0.00003928482,0.0001370611,0.0000023152354,2.8266822e-7,0.000016043678,0.00021502918],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898034,0.00008092261,0.00038298024,0.00005483072,0.00030916143,0.00019177988],"domain_scores_gemma":[0.9994006,0.000054367323,0.0001061352,0.00017418724,0.00008937528,0.00017529391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006659706,0.00012078378,0.0002306078,0.000019092176,0.000060909006,0.00005125844,0.00031243524,0.00008946729,0.000036831923],"category_scores_gemma":[0.0000329225,0.00007662644,0.00048157046,0.00018019804,0.0000657849,0.00019286093,0.000019006997,0.00030399393,0.0000137428],"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.00024337061,0.0011945942,0.008850047,0.0042130873,0.0053949826,0.00014790763,0.14898726,0.060120184,0.15164816,0.09351686,0.5238716,0.0018119175],"study_design_scores_gemma":[0.0041466295,0.0005226198,0.010425423,0.0032481523,0.0010532783,0.0025571198,0.031298436,0.035258736,0.050810836,0.850163,0.00917906,0.0013367098],"about_ca_topic_score_codex":0.0000012618467,"about_ca_topic_score_gemma":6.707606e-7,"teacher_disagreement_score":0.75664616,"about_ca_system_score_codex":0.00006651314,"about_ca_system_score_gemma":0.000017422535,"threshold_uncertainty_score":0.31247357},"labels":[],"label_agreement":null},{"id":"W2322634158","doi":"10.37236/4634","title":"Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 New Brunswick","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Disjoint sets; Complete bipartite graph; Cograph; Edge-transitive graph; Matching (statistics); Graph; Discrete mathematics; Robertson–Seymour theorem; Line graph; 1-planar graph; Voltage graph","score_opus":0.004331584858769278,"score_gpt":0.18632258496039925,"score_spread":0.18199100010162997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322634158","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.96562815,0.008473733,0.024267215,0.0002856918,0.00073777075,0.00011255215,0.000004126525,0.000044517637,0.00044626548],"genre_scores_gemma":[0.99894404,0.0009394971,0.000010727706,0.000009797787,0.000036669124,0.0000032244855,4.9409255e-7,0.000024134162,0.00003139928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00014204749,0.0005212515,0.00006730106,0.00027316553,0.00038756328],"domain_scores_gemma":[0.9990288,0.00020696498,0.00022390859,0.00029595278,0.00016859699,0.00007580385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008669215,0.00014744153,0.00030533175,0.00021284507,0.00009537551,0.000012911867,0.0004925059,0.000056604902,0.00001603908],"category_scores_gemma":[0.00001951334,0.000085854066,0.00023621011,0.0005018586,0.00012309126,0.00015035235,0.000019800134,0.00027534823,0.0000075963612],"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.00003101347,0.000046349065,0.00039794398,0.000027933711,0.00024783064,0.0000027196845,0.00020077977,0.00021117089,0.06417644,0.9338657,0.00034867483,0.00044339744],"study_design_scores_gemma":[0.0007891192,0.0003366461,0.00041358595,0.00011042713,0.00008406172,0.00013555166,0.0000705133,0.000089301786,0.02372713,0.96917254,0.004934395,0.00013675068],"about_ca_topic_score_codex":0.0000030610297,"about_ca_topic_score_gemma":0.000005553842,"teacher_disagreement_score":0.04044931,"about_ca_system_score_codex":0.00010538861,"about_ca_system_score_gemma":0.000058923288,"threshold_uncertainty_score":0.35010272},"labels":[],"label_agreement":null},{"id":"W2322962730","doi":"10.1515/integ.2010.032","title":"Two New Van Der Waerden Numbers: w(2; 3, 17) and w(2; 3, 18)","year":2010,"lang":"en","type":"article","venue":"Integers","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":"Concordia University","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics","score_opus":0.006968767842967638,"score_gpt":0.21974667115929927,"score_spread":0.21277790331633165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322962730","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.7637824,0.0003191802,0.0010246981,0.00010131484,0.0017288838,0.00012886136,0.0000039130678,0.00040078466,0.23250999],"genre_scores_gemma":[0.9965626,0.0000072199723,0.00036985325,0.0000744018,0.00023999838,0.0000061497017,0.0000020133596,0.00002923509,0.0027085128],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994185,0.00001317118,0.00013893396,0.00013796394,0.000080654005,0.0002107518],"domain_scores_gemma":[0.99955946,0.000043885753,0.000015827605,0.00021463199,0.000014813582,0.00015138002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011675866,0.00013717305,0.00013421079,0.000056857698,0.000038876955,0.000050063627,0.00012751037,0.000082404134,0.0007891962],"category_scores_gemma":[0.000020178484,0.00012749012,0.00005040222,0.00008951327,0.00005139579,0.00011886575,0.000017672453,0.00028894647,0.00021923448],"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.00008669308,0.00007070725,0.011814166,0.0002824957,0.0008148473,0.00013585524,0.012981062,0.0025550593,0.28562438,0.10458286,0.49450877,0.086543076],"study_design_scores_gemma":[0.0032356223,0.000111386486,0.0022284295,0.00025662655,0.00016127646,0.00049923995,0.0038187392,0.007471409,0.0502724,0.06986232,0.86015296,0.0019295723],"about_ca_topic_score_codex":0.00013291308,"about_ca_topic_score_gemma":0.00024590615,"teacher_disagreement_score":0.3656442,"about_ca_system_score_codex":0.00001062695,"about_ca_system_score_gemma":0.000009688454,"threshold_uncertainty_score":0.86411446},"labels":[],"label_agreement":null},{"id":"W2338654235","doi":"10.4169/amer.math.monthly.122.7.684","title":"A Double Binomial Sum: Putnam 35–A4 Revisited","year":2015,"lang":"en","type":"article","venue":"American Mathematical Monthly","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; Binomial approximation; Binomial (polynomial); Binomial theorem; Bernoulli's principle; Context (archaeology); Binomial distribution; Negative binomial distribution; Binomial coefficient; Identity (music); Continuity correction; Gaussian binomial coefficient; Multinomial distribution; Combinatorics; Competition (biology); Beta-binomial distribution; Statistics; Poisson distribution; Physics","score_opus":0.018105871174728345,"score_gpt":0.2308886058794054,"score_spread":0.21278273470467707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338654235","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.50330055,0.0004367409,0.0056335204,0.00015338304,0.00036475097,0.00057310885,0.000025663705,0.0012282621,0.488284],"genre_scores_gemma":[0.9973108,0.000004431004,0.001962569,0.00007595637,0.00015970082,0.000065318214,0.000009031388,0.00005759089,0.0003545861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986659,0.000057285284,0.00039571727,0.0002152791,0.00026478322,0.0004010206],"domain_scores_gemma":[0.99897695,0.000099983845,0.00006484857,0.0004590529,0.000043236407,0.00035596182],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003309921,0.00023762127,0.00050130155,0.000098261924,0.000040512343,0.000061360435,0.00026167507,0.000060417995,0.00008759325],"category_scores_gemma":[0.000062401414,0.00020596667,0.00012321526,0.00044474428,0.00018965155,0.00012241263,0.00004084162,0.00017658893,0.0009088254],"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.0007182402,0.00081075396,0.0019828628,0.0014398331,0.0009207486,0.00031773772,0.010565367,0.010510902,0.005130589,0.8521353,0.10566646,0.009801206],"study_design_scores_gemma":[0.009438387,0.0018015786,0.0014069219,0.0011736453,0.0005297587,0.0002616553,0.009241033,0.20413235,0.006897678,0.62588054,0.13464557,0.004590887],"about_ca_topic_score_codex":0.00003989402,"about_ca_topic_score_gemma":0.0000037594925,"teacher_disagreement_score":0.49401024,"about_ca_system_score_codex":0.00006242606,"about_ca_system_score_gemma":0.000017734554,"threshold_uncertainty_score":0.9998691},"labels":[],"label_agreement":null},{"id":"W2342152738","doi":"10.1007/978-3-319-17729-8_7","title":"Periodic Golay Pairs of Length 72","year":2015,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"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":"Binary Golay code; Ternary Golay code; Mathematics; Prime (order theory); Combinatorics; Algorithm; Hamming code","score_opus":0.02126282312591241,"score_gpt":0.22229584657590865,"score_spread":0.20103302344999624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342152738","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034227006,0.0031911465,0.0120114,0.000006721588,0.0010231809,0.001080786,0.0005057089,0.00047460824,0.97828376],"genre_scores_gemma":[0.46985614,0.0024566255,0.2592457,0.000028466953,0.0009628662,0.00024031158,0.0001306938,0.0018874477,0.26519173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975277,0.000004385584,0.0011240784,0.0003131324,0.0005890473,0.0004416151],"domain_scores_gemma":[0.99872684,0.00012207878,0.0003924869,0.00029705252,0.00031749366,0.00014401492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085987104,0.00058469997,0.0009975737,0.000386296,0.000040542116,0.00006189814,0.0004343702,0.0004264288,0.0001511604],"category_scores_gemma":[0.00014805279,0.0006116818,0.00011427638,0.000076034274,0.00018002279,0.00009436066,0.00010628721,0.00067123224,0.0001111658],"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.0000071993422,0.000037493515,0.00005056274,0.008337012,0.0001447645,0.000024332523,0.004499583,0.00011087967,0.00016838213,0.980619,0.004649051,0.0013516989],"study_design_scores_gemma":[0.0006029297,0.00014471552,0.000036008125,0.0039866343,0.00026156777,0.000043549666,0.00090494147,0.008376687,0.0002885519,0.9240376,0.05992163,0.0013952045],"about_ca_topic_score_codex":0.0000036213457,"about_ca_topic_score_gemma":0.000009686612,"teacher_disagreement_score":0.713092,"about_ca_system_score_codex":0.00017087505,"about_ca_system_score_gemma":0.000057455185,"threshold_uncertainty_score":0.99963343},"labels":[],"label_agreement":null},{"id":"W2364125004","doi":"","title":"The Maximum Jump Number of (0, 1)-Matrices of Order 2k - 2 with Fixed Row and Column Sum k","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Research and Exposition","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":"L'Alliance Boviteq","funders":"","keywords":"Mathematics; Conjecture; Column (typography); Combinatorics; Order (exchange); Jump; Table (database); Discrete mathematics; Geometry; Computer science; Physics","score_opus":0.017084189465842132,"score_gpt":0.29064151586708975,"score_spread":0.27355732640124764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2364125004","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.9948955,0.00087464566,0.0019523979,0.0001700095,0.000015919468,0.00010073566,0.0000025131424,0.000004515544,0.0019837525],"genre_scores_gemma":[0.9979101,0.00039315262,0.0015718917,0.000001938863,0.000048958424,0.0000034706247,2.8996456e-7,0.000008001277,0.00006220772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989892,0.00008207968,0.00033233644,0.000043755572,0.00039713702,0.00015546846],"domain_scores_gemma":[0.9989634,0.00051912834,0.00008130845,0.00008162562,0.00026449718,0.00008999948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011861365,0.000059555838,0.00018462673,0.0000726441,0.00007540376,0.000041028245,0.000082447485,0.0000437452,0.000038287188],"category_scores_gemma":[0.00009643414,0.000034477827,0.00002814651,0.00017112307,0.0001751498,0.0001524512,0.000016495731,0.0001868553,0.0000034017164],"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.009613764,0.0035289773,0.014669226,0.021012612,0.0032907024,0.00020386335,0.021249766,0.002249845,0.34299153,0.42203593,0.026721112,0.13243267],"study_design_scores_gemma":[0.008908477,0.0077653932,0.0098338425,0.008072849,0.0003459213,0.004603984,0.020210387,0.03256979,0.16522098,0.73547196,0.0060406458,0.00095580565],"about_ca_topic_score_codex":0.0000021274707,"about_ca_topic_score_gemma":0.000004394889,"teacher_disagreement_score":0.313436,"about_ca_system_score_codex":0.000012762712,"about_ca_system_score_gemma":0.000015236491,"threshold_uncertainty_score":0.1405965},"labels":[],"label_agreement":null},{"id":"W2384970206","doi":"","title":"Research on Optical Code-division Multiple Access Technology with Bragg Grating Arrasy","year":2004,"lang":"en","type":"article","venue":"Journal of Optoelectronics·laser","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":"L'Alliance Boviteq","funders":"","keywords":"Fiber Bragg grating; Encoder; Code division multiple access; Computer science; Optics; Division (mathematics); Transmission (telecommunications); Code (set theory); Limit (mathematics); Optical fiber; Physics; Telecommunications; Mathematics; Arithmetic","score_opus":0.022992145840689673,"score_gpt":0.31188675870367255,"score_spread":0.2888946128629829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2384970206","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.9849319,0.00037751795,0.0124585,0.0004226176,0.00021847668,0.00017691091,0.0000032972614,0.00009653221,0.0013142504],"genre_scores_gemma":[0.998567,0.000052381052,0.0011029438,0.000022260725,0.00015299355,0.000010956273,0.0000015041107,0.000056302957,0.000033671575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979024,0.00008496172,0.0004919578,0.00019698706,0.00062082027,0.000702907],"domain_scores_gemma":[0.998906,0.00022147516,0.00012762466,0.0002973423,0.00029090603,0.0001566553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193291,0.00021615726,0.00036022312,0.0007054629,0.00019179158,0.00012974071,0.0005893343,0.00020906114,0.000020041032],"category_scores_gemma":[0.00011685532,0.00016285208,0.00010462608,0.0009364016,0.00011850678,0.00036759928,0.000049028033,0.0017338472,0.00002240837],"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.00066930795,0.0003926938,0.0025586807,0.00012822406,0.00037146482,0.0003945427,0.00029104255,0.91177106,0.036773685,0.040153395,0.00065638166,0.0058395453],"study_design_scores_gemma":[0.006722476,0.0067913393,0.0013015454,0.0015358266,0.00006868826,0.0013565856,0.0012491172,0.0087721255,0.93583214,0.03114742,0.004385128,0.00083758944],"about_ca_topic_score_codex":0.0000033332128,"about_ca_topic_score_gemma":0.00004316696,"teacher_disagreement_score":0.9029989,"about_ca_system_score_codex":0.00034540019,"about_ca_system_score_gemma":0.0001607131,"threshold_uncertainty_score":0.75328},"labels":[],"label_agreement":null},{"id":"W2394688611","doi":"","title":"Cube factorizations of complete multipartite graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Cube (algebra); Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.025143166779268332,"score_gpt":0.19915297908471014,"score_spread":0.1740098123054418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394688611","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.9828058,0.00013675811,0.00022564178,0.0000017221365,0.0022806083,0.00012882442,0.000022331333,0.00022341525,0.014174932],"genre_scores_gemma":[0.9998044,0.000011907508,0.00009768362,0.0000045092625,0.0000028770698,0.000014554719,0.000008370166,0.000022715745,0.00003299762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993771,0.000033248558,0.00023097417,0.00009663491,0.00009601473,0.00016608083],"domain_scores_gemma":[0.9995537,0.000032432254,0.000038821472,0.00026290887,0.00004750948,0.00006464343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008752718,0.00011246569,0.0001718387,0.00008807163,0.00004430179,0.0000061971764,0.0001638039,0.000058254172,0.0000959676],"category_scores_gemma":[0.000011661377,0.000115390576,0.000072813345,0.00026181777,0.00004997293,0.00009958919,0.000016340608,0.00008028172,0.000050441013],"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.0000046444447,0.000050265793,0.01565155,0.00004865066,0.00006161388,0.000001864982,0.0013464264,0.000073947784,0.008031206,0.9742943,0.00034700485,0.000088521956],"study_design_scores_gemma":[0.0012049909,0.00012779977,0.053976774,0.00008700584,0.000054305903,0.0000058710134,0.00031685716,0.0025285506,0.046016425,0.89076704,0.0043944106,0.00051995186],"about_ca_topic_score_codex":0.000026238404,"about_ca_topic_score_gemma":0.0000038124824,"teacher_disagreement_score":0.083527245,"about_ca_system_score_codex":0.000009421224,"about_ca_system_score_gemma":0.0000044853587,"threshold_uncertainty_score":0.4705491},"labels":[],"label_agreement":null},{"id":"W2394748596","doi":"","title":"Directed Hamilton cycle decompositions of the tensor product of symmetric digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Tensor product of Hilbert spaces; Combinatorics; Product (mathematics); Symmetric tensor; Tensor (intrinsic definition); Pure mathematics; Tensor contraction; Mathematical analysis; Geometry; Exact solutions in general relativity","score_opus":0.008798207608283664,"score_gpt":0.18263707831808992,"score_spread":0.17383887070980625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394748596","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.9853799,0.0004419637,0.0000041383414,0.0000036715921,0.0015122199,0.00020736459,0.000011444758,0.00014052168,0.012298781],"genre_scores_gemma":[0.9998425,0.000017389048,0.00006244466,0.0000026883808,0.0000035505304,0.000017007906,0.0000017824462,0.00001921906,0.000033394437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928606,0.00006855977,0.0002630235,0.00010945059,0.00012741721,0.0001454676],"domain_scores_gemma":[0.9993321,0.00005060711,0.00007377962,0.00042960103,0.00007882299,0.000035145695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013876506,0.0001081435,0.00019713595,0.00014616086,0.000050175302,0.0000037768941,0.0002566776,0.00004507902,0.00001730761],"category_scores_gemma":[0.000029986819,0.00008374386,0.00011730458,0.0009756597,0.00007537221,0.00006182293,0.000021013646,0.0000923683,0.000005570443],"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.000025239302,0.00039452675,0.04053145,0.0002747301,0.00026611285,0.0000020694206,0.0024438254,0.00015079822,0.04551128,0.9091593,0.0006994409,0.00054122874],"study_design_scores_gemma":[0.0007082131,0.00010488787,0.3244622,0.00016834306,0.000103378625,0.000010587308,0.000129915,0.0005723083,0.41848052,0.25467333,0.00029811577,0.00028819623],"about_ca_topic_score_codex":0.000051400435,"about_ca_topic_score_gemma":0.0000036852869,"teacher_disagreement_score":0.65448594,"about_ca_system_score_codex":0.000011935152,"about_ca_system_score_gemma":0.000006998915,"threshold_uncertainty_score":0.34149754},"labels":[],"label_agreement":null},{"id":"W2394877446","doi":"","title":"On the Disarrangements with k Cycles.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005115654826447854,"score_gpt":0.1832766747649926,"score_spread":0.17816101993854475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394877446","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.9756787,0.000015726406,0.000005486202,0.00005831566,0.0020580832,0.000119744625,0.0000016743228,0.00014625657,0.021916043],"genre_scores_gemma":[0.99978745,0.0000016495617,0.000005637692,0.00005486162,0.000008702372,0.00002935211,0.0000012259923,0.00002134308,0.00008978138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995661,0.000019046664,0.00007079204,0.00008226441,0.00011917131,0.00014262124],"domain_scores_gemma":[0.9995576,0.000071393566,0.000015234061,0.000306128,0.000011444358,0.000038167225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013698173,0.0000957547,0.000078634264,0.00002254103,0.000076120436,0.000028051905,0.00017614778,0.000032805583,0.000090542926],"category_scores_gemma":[0.000009555496,0.000058005055,0.000025756613,0.00010728481,0.000039242303,0.000041743402,0.000009384933,0.00020842078,0.00015681397],"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.000009791096,0.000021297938,0.0015590683,0.000008021014,0.00003288504,0.000003599873,0.0001169433,0.00004419973,0.0030449529,0.99140245,0.003579279,0.0001775385],"study_design_scores_gemma":[0.000930891,0.00012381589,0.017304694,0.000051717998,0.000021127382,0.000009766309,0.000137979,0.0005933188,0.009866719,0.96129197,0.009320052,0.00034796272],"about_ca_topic_score_codex":0.0000029147236,"about_ca_topic_score_gemma":0.0000063439047,"teacher_disagreement_score":0.03011047,"about_ca_system_score_codex":0.0000067054507,"about_ca_system_score_gemma":0.000002628238,"threshold_uncertainty_score":0.23653774},"labels":[],"label_agreement":null},{"id":"W2394988899","doi":"","title":"The optimal pebbling number of square of paths and cycles.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Arithmetic; Geometry","score_opus":0.0045918415482181126,"score_gpt":0.20267200801506943,"score_spread":0.1980801664668513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394988899","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.99492896,0.0003082874,0.000047376558,0.000007258132,0.0006965678,0.000057992867,0.0000019413396,0.000036204463,0.0039153895],"genre_scores_gemma":[0.9998924,0.000027035414,0.000039087332,0.0000017243274,0.00000571938,0.0000046894393,6.8913056e-7,0.000013433904,0.000015223171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950874,0.000043821867,0.00018045127,0.00006504737,0.00008975084,0.00011216673],"domain_scores_gemma":[0.99955416,0.00015459499,0.000041632553,0.00018664778,0.000032743537,0.000030203704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031078848,0.0000737923,0.00013997845,0.000017622013,0.00004741111,0.000010432644,0.00010532367,0.0000451186,0.0000058963287],"category_scores_gemma":[0.000028434757,0.00005777261,0.000039122122,0.00008295737,0.000060644386,0.000041858588,0.00002132458,0.000068828514,0.000004481209],"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.000008831215,0.000014780732,0.012900718,0.00013285891,0.00004732145,4.701571e-7,0.00054450973,0.00042539672,0.0016745309,0.98243845,0.00012818519,0.001683973],"study_design_scores_gemma":[0.00283057,0.00023449674,0.031269744,0.00045927142,0.00009507045,0.000035706347,0.00224202,0.032043282,0.04635762,0.8762467,0.007499055,0.00068644714],"about_ca_topic_score_codex":0.0000068391228,"about_ca_topic_score_gemma":9.248096e-7,"teacher_disagreement_score":0.10619171,"about_ca_system_score_codex":0.0000045621437,"about_ca_system_score_gemma":0.0000030120232,"threshold_uncertainty_score":0.23558986},"labels":[],"label_agreement":null},{"id":"W2395242983","doi":"","title":"A new product construction for large sets of resolvable Mendelsohn triple systems.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Triple product; Product (mathematics); Triple system; Pure mathematics; Geometry","score_opus":0.007003072323383166,"score_gpt":0.20933301408828323,"score_spread":0.20232994176490007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395242983","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.9685622,0.0006702128,0.0008683124,0.000023533565,0.02358451,0.0010204404,0.000060534934,0.00032765526,0.0048826025],"genre_scores_gemma":[0.9988202,0.000005498896,0.00065226003,0.000002120433,0.000040279836,0.00006059776,0.000013515846,0.00003178315,0.0003737681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911875,0.000029244286,0.00030203574,0.00017014248,0.00012578977,0.0002540254],"domain_scores_gemma":[0.9993569,0.000047987356,0.000072842486,0.00035585748,0.000081761216,0.00008460726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044395987,0.00013557207,0.00026075132,0.00008654438,0.000066131775,0.000025094107,0.00014998848,0.00010154552,0.000025417918],"category_scores_gemma":[0.000050696897,0.00013785003,0.000073587355,0.00019707021,0.0000185685,0.00013018127,0.0000143088655,0.00015470578,0.000010539772],"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.000026940863,0.000026969308,0.0005027295,0.0002983419,0.000063494146,7.1817584e-7,0.00019259917,0.00007537275,0.022041734,0.9638675,0.012440094,0.00046350335],"study_design_scores_gemma":[0.0077717258,0.00031957234,0.00061398523,0.00024023403,0.0001497727,0.00011197841,0.00083630026,0.012600006,0.14818844,0.6332729,0.19493866,0.0009564316],"about_ca_topic_score_codex":0.000030649317,"about_ca_topic_score_gemma":0.000009390628,"teacher_disagreement_score":0.3305946,"about_ca_system_score_codex":0.00001730535,"about_ca_system_score_gemma":0.00003529275,"threshold_uncertainty_score":0.5621361},"labels":[],"label_agreement":null},{"id":"W2395292102","doi":"","title":"A non-existence result and large sets for Sarvate-Beam designs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011939420056740696,"score_gpt":0.2308398000720153,"score_spread":0.2189003800152746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395292102","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.9937255,0.000094842995,0.00015206782,0.00001845502,0.0030149973,0.00033025528,0.000022773242,0.00017640009,0.0024647282],"genre_scores_gemma":[0.99946696,0.00000867692,0.0002565906,0.000025761297,0.000015007675,0.000070631046,0.000008803143,0.00003154647,0.000116035495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992596,0.000011578813,0.00017344065,0.0001770441,0.00008523286,0.0002931131],"domain_scores_gemma":[0.9994615,0.00009288621,0.00002778228,0.0002722489,0.00004552801,0.00010007553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004029963,0.00014423484,0.00017362581,0.000049500275,0.00011491518,0.000045356872,0.00015450876,0.00012607174,0.000009761297],"category_scores_gemma":[0.000040127212,0.00014412066,0.000047232046,0.000117368436,0.000035521265,0.000120406796,0.000023729172,0.00018556598,0.000024399307],"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.00005123806,0.00007225272,0.0031544247,0.00026290276,0.000068418696,0.000010846844,0.0009444133,0.000017029557,0.07184613,0.9159687,0.0066964324,0.00090720254],"study_design_scores_gemma":[0.005021437,0.00028142767,0.007789483,0.00012221353,0.00005801596,0.000044895507,0.0003149285,0.009389637,0.06497891,0.85375416,0.057300355,0.00094454753],"about_ca_topic_score_codex":0.0000051772504,"about_ca_topic_score_gemma":0.000009589816,"teacher_disagreement_score":0.062214565,"about_ca_system_score_codex":0.000009575048,"about_ca_system_score_gemma":0.000009153608,"threshold_uncertainty_score":0.587707},"labels":[],"label_agreement":null},{"id":"W2395304930","doi":"","title":"The 2-color Rado Number of x + y + kz = 3w.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.00460549175608964,"score_gpt":0.20794727025486093,"score_spread":0.20334177849877128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395304930","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.96409947,0.0003217885,0.000006567722,0.00006370609,0.0020551756,0.00010487456,0.0000014108103,0.00012994024,0.033217058],"genre_scores_gemma":[0.9996311,0.00002835409,0.000013806305,0.000019013609,0.000009440576,0.000006572554,9.379155e-7,0.000011744122,0.0002790216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940914,0.000037367005,0.00018595597,0.00007510884,0.00011329483,0.00017913677],"domain_scores_gemma":[0.99954534,0.00008383837,0.000030165655,0.00027257905,0.000027608052,0.00004045824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022027087,0.00009529542,0.00013401208,0.00001685989,0.000076535216,0.000018711271,0.0002041072,0.000058105943,0.000021959462],"category_scores_gemma":[0.000017546794,0.000072088566,0.000066579996,0.00015948957,0.00003426946,0.000056487104,0.000009199672,0.00010093963,0.0000924469],"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.000008734613,0.000022364895,0.0006679271,0.000011651075,0.000026003312,0.000002377189,0.00017470628,0.000061802406,0.0015255134,0.99279624,0.003239273,0.0014634221],"study_design_scores_gemma":[0.0006449212,0.00006884822,0.0065209717,0.000036553098,0.000017185086,0.0000138864825,0.0001577965,0.0007376275,0.009677175,0.9599377,0.021986881,0.00020047507],"about_ca_topic_score_codex":0.0000030757851,"about_ca_topic_score_gemma":7.987031e-7,"teacher_disagreement_score":0.035531633,"about_ca_system_score_codex":0.000018260296,"about_ca_system_score_gemma":0.0000056822487,"threshold_uncertainty_score":0.29396862},"labels":[],"label_agreement":null},{"id":"W2395371912","doi":"","title":"Resolvable decompositions of λK n into the union of two 2-paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004925125525984317,"score_gpt":0.21573895806039223,"score_spread":0.2108138325344079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395371912","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.9891554,0.00053345034,0.00011446242,0.00006039759,0.0007417683,0.00010733593,0.000002389076,0.000065585984,0.009219174],"genre_scores_gemma":[0.9998153,0.000019851193,0.000096969845,0.000011026887,0.0000054075385,0.000004870661,0.0000034859586,0.000008807446,0.000034269928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994304,0.00006921028,0.00021760816,0.000067956986,0.00010290519,0.00011192039],"domain_scores_gemma":[0.9995285,0.00006170254,0.00004337419,0.00029416993,0.000043224398,0.000028996157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027864022,0.00007982094,0.00014705682,0.00005481851,0.000055057775,0.0000068054287,0.00018595238,0.000039129052,0.00001171269],"category_scores_gemma":[0.000008625408,0.00006530139,0.00006141445,0.00025458843,0.000038059155,0.00006421439,0.000011938695,0.000087453554,0.000007015625],"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.000005251228,0.000051580057,0.00032611025,0.000027895143,0.000024507053,9.910959e-7,0.0009578275,0.001643153,0.035522547,0.9600362,0.0006347142,0.000769206],"study_design_scores_gemma":[0.0005670853,0.00013613583,0.0025452422,0.000094134,0.00002459909,0.0000038104072,0.00019189798,0.0015453191,0.08088028,0.9127658,0.0011245967,0.000121118246],"about_ca_topic_score_codex":0.000041850395,"about_ca_topic_score_gemma":0.000005729267,"teacher_disagreement_score":0.047270436,"about_ca_system_score_codex":0.00001649872,"about_ca_system_score_gemma":0.000007127248,"threshold_uncertainty_score":0.26629135},"labels":[],"label_agreement":null},{"id":"W2395438483","doi":"","title":"The 2-(v, 13, 1) designs with block transitive automorphism.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Automorphism; Block (permutation group theory); Automorphism group; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.0065916720524819014,"score_gpt":0.1721693952279605,"score_spread":0.16557772317547859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395438483","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.9855113,0.00031798327,0.00013228985,0.00012743812,0.0011787834,0.00040790008,0.0000021172555,0.00038810572,0.011934056],"genre_scores_gemma":[0.9994494,0.000015261881,0.000020865715,0.000028018481,0.0000088818,0.00012076226,0.0000015267923,0.00003466805,0.00032063425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922395,0.00006677742,0.00015026504,0.0001239153,0.00014518913,0.00028989313],"domain_scores_gemma":[0.99941653,0.00014407017,0.000022436507,0.00027448838,0.00005749331,0.000084983076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013292937,0.00015871572,0.00014148898,0.000029695353,0.00019549839,0.00007996362,0.00020070016,0.00006246675,0.000038097107],"category_scores_gemma":[0.0000058931123,0.0001045754,0.00004721641,0.00018912586,0.0000849909,0.00012890284,0.000007902807,0.00016418454,0.00028211542],"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.00003534112,0.00007168398,0.00091403,0.000057651734,0.00038177441,0.00003266536,0.0025663963,0.0017117505,0.010806223,0.9649563,0.01654232,0.0019239092],"study_design_scores_gemma":[0.004231953,0.0007636847,0.02213573,0.00025571467,0.00015639087,0.00016549217,0.002842746,0.02128255,0.029915662,0.89669037,0.01990563,0.0016541007],"about_ca_topic_score_codex":0.000031398173,"about_ca_topic_score_gemma":0.000009488273,"teacher_disagreement_score":0.06826591,"about_ca_system_score_codex":0.000026544765,"about_ca_system_score_gemma":0.000011937383,"threshold_uncertainty_score":0.42644614},"labels":[],"label_agreement":null},{"id":"W2395619758","doi":"","title":"Some Algebraic Properties of Bi-Circulant Digraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Algebraic number; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.008606228150471393,"score_gpt":0.1786170384313558,"score_spread":0.17001081028088438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395619758","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.99310803,0.0037924831,0.0000030711883,0.000026936337,0.0013150038,0.0001362943,0.0000020891534,0.00024384608,0.0013722661],"genre_scores_gemma":[0.99982584,0.00006213303,0.000005199874,0.000027668688,0.000013269608,0.000008961739,0.0000019702647,0.00001702104,0.000037966216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925375,0.00003166349,0.00023828192,0.00011730516,0.00014604881,0.00021295066],"domain_scores_gemma":[0.9995922,0.000011790463,0.000033481218,0.00027538274,0.00002783231,0.000059350215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001327828,0.0001408434,0.00022700959,0.0001064308,0.00003903816,0.000016395134,0.00018444697,0.00007141473,0.000006745237],"category_scores_gemma":[0.000010529948,0.00012349371,0.000093592,0.0002166512,0.000040096216,0.0001486965,0.0000093691915,0.0001002254,0.000027343298],"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.000008491641,0.00006259888,0.00047013484,0.0000968665,0.00005192662,0.000005657129,0.0004762552,0.00012720321,0.10977918,0.8878911,0.00048338703,0.00054720015],"study_design_scores_gemma":[0.0006714566,0.00014356732,0.004708967,0.00018831193,0.00002584312,0.000013026541,0.00012896195,0.0005285451,0.17814225,0.8143875,0.0007210947,0.00034048708],"about_ca_topic_score_codex":0.0000063496927,"about_ca_topic_score_gemma":4.2970908e-7,"teacher_disagreement_score":0.07350362,"about_ca_system_score_codex":0.000015006298,"about_ca_system_score_gemma":0.000007966925,"threshold_uncertainty_score":0.5035927},"labels":[],"label_agreement":null},{"id":"W2395649781","doi":"","title":"Decompositions of graphs into cycles of length seven and single edges","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Discrete mathematics; Chordal graph; Computer science","score_opus":0.013324479199732673,"score_gpt":0.21480825437378137,"score_spread":0.2014837751740487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395649781","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.9955547,0.00096271647,0.000027562357,0.000010199185,0.00065327116,0.000066061686,0.000004842955,0.000056890876,0.0026637982],"genre_scores_gemma":[0.999798,0.000014995594,0.00015373819,0.0000019988615,0.000002859922,0.000005071753,0.000003172569,0.000012495568,0.0000076563765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995453,0.00003580116,0.00017779002,0.000070666145,0.00008270609,0.00008778433],"domain_scores_gemma":[0.9996468,0.000052775762,0.000036750404,0.00014664425,0.00005231993,0.00006474268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013992665,0.00007865857,0.00016988983,0.00008130213,0.0000221423,0.0000064590213,0.00008437341,0.000048484802,0.0000023686823],"category_scores_gemma":[0.0000147066585,0.00008069353,0.000035573972,0.00014041277,0.0000674368,0.00007990158,0.000021049023,0.000048414317,0.0000022012011],"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.000018027647,0.00016385857,0.009120128,0.00025246784,0.00013272502,0.0000024388823,0.0045812298,0.00037136555,0.04501804,0.9376819,0.0009800737,0.0016777427],"study_design_scores_gemma":[0.0006391652,0.00015734031,0.0027369114,0.00009475684,0.000028838838,0.0000074548593,0.0009154731,0.0002676586,0.08778565,0.9068893,0.00032880242,0.00014864565],"about_ca_topic_score_codex":0.00002383275,"about_ca_topic_score_gemma":0.0000059013173,"teacher_disagreement_score":0.042767607,"about_ca_system_score_codex":0.000011604396,"about_ca_system_score_gemma":0.000006870412,"threshold_uncertainty_score":0.32905868},"labels":[],"label_agreement":null},{"id":"W2395803651","doi":"","title":"Union Distinct Families Of Sets, With An Application To Cryptography.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cryptography; Theoretical computer science; Computer science; Algorithm","score_opus":0.0037222043483265163,"score_gpt":0.18728487938225755,"score_spread":0.18356267503393103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395803651","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.99542636,0.000037737223,0.0014382533,0.0000105832805,0.00025550427,0.00032645086,0.0000039215993,0.00017235798,0.0023288578],"genre_scores_gemma":[0.9995747,0.000003171484,0.00024750462,0.0000065788076,0.0000037597133,0.00012248236,0.000014020787,0.000021345264,0.000006389038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945813,0.000036285015,0.00014331963,0.00012078851,0.00010638111,0.00013509014],"domain_scores_gemma":[0.9995057,0.000021866968,0.000027410511,0.0003098955,0.00005246596,0.00008264478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010432825,0.00010763873,0.00013367998,0.00009136654,0.00003557798,0.000017015696,0.00013967132,0.00004345216,0.00001258975],"category_scores_gemma":[0.0000033230024,0.00009389486,0.000025460411,0.0003491198,0.000029929333,0.00014097047,0.00001100415,0.00005539223,0.000038755505],"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.000021614485,0.000119597775,0.04923627,0.00017498014,0.00007320169,7.528166e-7,0.0010443373,0.0012133144,0.018603306,0.9176039,0.00075250363,0.011156212],"study_design_scores_gemma":[0.0012486519,0.00091724197,0.36544424,0.00015418802,0.000046429584,0.0000073920037,0.0018112588,0.0053622522,0.019632347,0.60091436,0.0036593885,0.0008022618],"about_ca_topic_score_codex":0.00011361911,"about_ca_topic_score_gemma":0.000016371163,"teacher_disagreement_score":0.31668958,"about_ca_system_score_codex":0.000010718945,"about_ca_system_score_gemma":0.0000031313607,"threshold_uncertainty_score":0.38289213},"labels":[],"label_agreement":null},{"id":"W2395845705","doi":"","title":"The full metamorphosis of λ-fold block designs with block size four into λ-fold 4-cycle systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Mathematics; Metamorphosis; Block size; Block (permutation group theory); Combinatorics; Computer science; Biology; Programming language; Operating system","score_opus":0.010631018100239835,"score_gpt":0.1924355675773135,"score_spread":0.18180454947707367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395845705","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.98952705,0.0039595827,0.00003844036,0.000027613405,0.0034074408,0.00045141083,0.0000057606026,0.00023881509,0.002343865],"genre_scores_gemma":[0.9994009,0.00004887295,0.00008123483,0.000008719061,0.000042501197,0.000119648226,0.0000011321977,0.000077452125,0.00021952452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981739,0.00020403978,0.00047071298,0.00019302918,0.00037643564,0.00058189285],"domain_scores_gemma":[0.9982643,0.0005763769,0.00014346557,0.0007081063,0.000104818675,0.00020289725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091210287,0.0003182348,0.0004502347,0.00006773412,0.0002200299,0.00006560698,0.00044987732,0.00014363306,0.000011674321],"category_scores_gemma":[0.00006099224,0.0002264433,0.00013651776,0.00044370678,0.000094396724,0.0002135173,0.00005240586,0.00022684199,0.00005430062],"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.000261497,0.00041162816,0.01874892,0.0010567434,0.0023225362,0.000020661973,0.0035012548,0.006331777,0.069907926,0.88802975,0.009085593,0.0003217057],"study_design_scores_gemma":[0.020512719,0.00444959,0.025794895,0.0033911308,0.0044896365,0.00128041,0.01626784,0.021795541,0.539326,0.23243408,0.12043132,0.009826817],"about_ca_topic_score_codex":0.00010637074,"about_ca_topic_score_gemma":0.000014849556,"teacher_disagreement_score":0.65559566,"about_ca_system_score_codex":0.000070638736,"about_ca_system_score_gemma":0.000020459649,"threshold_uncertainty_score":0.923409},"labels":[],"label_agreement":null},{"id":"W2395902960","doi":"","title":"Minimum many-to-many matchings for computing the distance between two sequences","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.03947693002219832,"score_gpt":0.2458477516972585,"score_spread":0.20637082167506018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395902960","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.62449944,0.0000826194,0.35366386,0.0005416888,0.0009015723,0.0006595491,0.00041546015,0.00017391938,0.019061862],"genre_scores_gemma":[0.99719584,7.3716313e-7,0.0019296599,0.00046553655,0.00018050255,0.000031070667,0.00005130708,0.000027189926,0.00011817124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881333,0.00004016276,0.00027938624,0.0002547603,0.00018272347,0.00042961657],"domain_scores_gemma":[0.99897623,0.000328688,0.00005118799,0.00018571723,0.000120734025,0.0003374207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033322608,0.00020017364,0.00020916341,0.00029152568,0.00029757564,0.00009951384,0.00045048047,0.00006066802,0.0000892998],"category_scores_gemma":[0.000031520074,0.00017829274,0.0000726136,0.00040010095,0.00007802052,0.000081161204,0.000015696649,0.00017398363,0.00011476591],"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.000017273222,0.000011498059,0.006990543,0.00011518734,0.00015369752,0.000015130379,0.0031640301,0.060718074,0.000036116464,0.9071828,0.0025398992,0.019055732],"study_design_scores_gemma":[0.001318371,0.000349773,0.12631944,0.0006767565,0.00008944491,0.000032994765,0.0032925059,0.49311712,0.00036437652,0.34579897,0.026668703,0.0019715696],"about_ca_topic_score_codex":0.0023174558,"about_ca_topic_score_gemma":0.0027149168,"teacher_disagreement_score":0.56138384,"about_ca_system_score_codex":0.0001112598,"about_ca_system_score_gemma":0.00014863268,"threshold_uncertainty_score":0.72705674},"labels":[],"label_agreement":null},{"id":"W2396025375","doi":"","title":"Simple Kirkman Packing Designs SKPD({3, 4}, v) with index two.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Index (typography); Combinatorics; Computer science; Programming language","score_opus":0.0201498359773477,"score_gpt":0.206391089510782,"score_spread":0.1862412535334343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396025375","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.9620661,0.00008735247,0.00076480425,0.0000020629016,0.0009941774,0.00020213045,0.0000098795645,0.00055704266,0.03531644],"genre_scores_gemma":[0.99969393,0.0000028335203,0.00008655863,0.000019785584,0.0000134801985,0.00004336123,0.0000111201525,0.000059525486,0.00006943094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990587,0.000054697437,0.00018817894,0.00018389878,0.0001559559,0.00035854263],"domain_scores_gemma":[0.9993741,0.000053886273,0.0000393455,0.00037124363,0.000038788072,0.0001226518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018103514,0.00020486035,0.00020674591,0.00008851307,0.000098196804,0.0000320812,0.00022953047,0.00007590627,0.0004130434],"category_scores_gemma":[0.000010363578,0.00018517267,0.000052121715,0.00027216645,0.000047729827,0.00018395473,0.00002468588,0.00018609628,0.00011659106],"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.00007182046,0.00012458747,0.06403383,0.0001126729,0.00026075292,0.00011688284,0.0031842848,0.00068458746,0.0015671487,0.922939,0.0057398602,0.0011645538],"study_design_scores_gemma":[0.0031299095,0.00042213683,0.028210972,0.00019396556,0.0000668461,0.000066154746,0.00097322284,0.0036324244,0.016891833,0.9362774,0.00888151,0.0012536476],"about_ca_topic_score_codex":0.000053490952,"about_ca_topic_score_gemma":0.00002712298,"teacher_disagreement_score":0.037627798,"about_ca_system_score_codex":0.000035161625,"about_ca_system_score_gemma":0.00001328313,"threshold_uncertainty_score":0.75511223},"labels":[],"label_agreement":null},{"id":"W2396043225","doi":"","title":"Finite Groups of Derangements on the n-Cube.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Derangement; Pure mathematics; Combinatorics","score_opus":0.00814245759577872,"score_gpt":0.18607401241904867,"score_spread":0.17793155482326994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396043225","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.9716634,0.000054778546,0.00008187332,0.000036865775,0.0018284927,0.000105359235,0.0000019119686,0.00008611423,0.026141204],"genre_scores_gemma":[0.9998236,0.000005424176,0.0000046569594,0.000058525948,0.000009378243,0.000016496573,0.0000015927451,0.000016219183,0.00006412536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994649,0.00007102213,0.00013993615,0.000074256066,0.00012152427,0.0001283607],"domain_scores_gemma":[0.9994136,0.00022912961,0.000026313468,0.00028591556,0.000017462764,0.000027545544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030536193,0.000089349625,0.0001145267,0.000035182908,0.00004735821,0.000011250037,0.00017911731,0.000039261176,0.000041980504],"category_scores_gemma":[0.000039485283,0.000065741944,0.000048942242,0.000117049975,0.000025001036,0.000033005963,0.000014628645,0.000089066445,0.00010410273],"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.0000052353043,0.000022702869,0.00072890765,0.000030666695,0.000035453435,4.6164686e-7,0.00019667218,0.0005136926,0.00061444147,0.9955255,0.0018936824,0.0004326137],"study_design_scores_gemma":[0.000931616,0.00018036709,0.0047801384,0.000119674856,0.000023595974,0.0000012029373,0.00013191707,0.008214017,0.014056487,0.95527166,0.016036037,0.00025325696],"about_ca_topic_score_codex":0.0000028451966,"about_ca_topic_score_gemma":8.5435175e-7,"teacher_disagreement_score":0.04025378,"about_ca_system_score_codex":0.000009131992,"about_ca_system_score_gemma":0.0000015557105,"threshold_uncertainty_score":0.26808786},"labels":[],"label_agreement":null},{"id":"W2396189861","doi":"","title":"Note On (m, 2, m-1, m-2/2) Relative Difference Sets.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics; Combinatorics","score_opus":0.007764796662602648,"score_gpt":0.2137237932176288,"score_spread":0.20595899655502614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396189861","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.9478271,0.000120884775,0.00004785787,0.00007535335,0.0018389324,0.000120586235,0.0000036458307,0.00038218955,0.04958344],"genre_scores_gemma":[0.999578,0.000009803833,0.000026400914,0.000084809464,0.0000054782836,0.000007291312,0.0000038468543,0.000016097933,0.00026825521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992933,0.00004380811,0.00015277146,0.00015019331,0.00013900202,0.00022088086],"domain_scores_gemma":[0.99952364,0.000082387895,0.00002303512,0.0002754374,0.000018777373,0.000076722456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010464866,0.0001586711,0.00016676847,0.00006220023,0.00006643307,0.000022033331,0.0001600966,0.000094631156,0.00002008216],"category_scores_gemma":[0.000022007694,0.00014994643,0.0000600286,0.00018079783,0.000020396565,0.00008675608,0.000007660884,0.0002248659,0.00022495302],"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.000011110139,0.000038127233,0.00013110528,0.000008079945,0.000014711752,0.000010674982,0.00057569053,0.00017259477,0.0016003539,0.99362236,0.0007803702,0.0030348338],"study_design_scores_gemma":[0.00047443368,0.00019275103,0.012421989,0.000063678526,0.000009091837,0.0000038721723,0.00002893088,0.0011706755,0.0036554802,0.98064286,0.0010982327,0.00023798503],"about_ca_topic_score_codex":0.000001407872,"about_ca_topic_score_gemma":5.128564e-7,"teacher_disagreement_score":0.051750902,"about_ca_system_score_codex":0.000045266246,"about_ca_system_score_gemma":0.0000051526445,"threshold_uncertainty_score":0.6114638},"labels":[],"label_agreement":null},{"id":"W2396453406","doi":"","title":"On B 5 -Groups.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.004271150010058413,"score_gpt":0.1785782616277607,"score_spread":0.1743071116177023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396453406","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.9230112,0.00004131197,0.000077009376,0.000014306385,0.0033955886,0.00005279215,6.652716e-7,0.00033005574,0.073077075],"genre_scores_gemma":[0.99977106,0.0000021906578,0.000007047899,0.000048803595,0.0000120480945,0.000010633084,0.000001844091,0.000021479495,0.00012491077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954236,0.000034155964,0.000095748925,0.000089505884,0.0000880097,0.00015023969],"domain_scores_gemma":[0.9996196,0.00007417789,0.000010372868,0.00023296503,0.000009477919,0.00005337786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015881643,0.00009175921,0.00010421534,0.0000411704,0.00003897398,0.00001692554,0.00011692426,0.000051674495,0.0000400586],"category_scores_gemma":[0.000019712812,0.000088862274,0.00003956915,0.00009475867,0.000013540705,0.000040537798,0.000008064696,0.00009570923,0.0005016167],"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.0000026104453,0.000012599344,0.00015595776,0.000014287366,0.000010527462,0.0000010351586,0.00006222185,0.0002987247,0.00042070975,0.99467796,0.0036862127,0.0006571412],"study_design_scores_gemma":[0.00039158616,0.00007492921,0.00084039633,0.00002379266,0.0000044257945,0.0000021688923,0.000017581837,0.0025236607,0.0023314161,0.98349726,0.010136657,0.00015614979],"about_ca_topic_score_codex":0.0000013657766,"about_ca_topic_score_gemma":4.6496854e-7,"teacher_disagreement_score":0.076759845,"about_ca_system_score_codex":0.000015354693,"about_ca_system_score_gemma":0.0000013761273,"threshold_uncertainty_score":0.6447435},"labels":[],"label_agreement":null},{"id":"W2396479523","doi":"","title":"The t-Pebbling Number And 2t-Pebbling Property On The Graph D n , C 2m .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Property (philosophy); Graph; Discrete mathematics","score_opus":0.018688157710293724,"score_gpt":0.20891783927471635,"score_spread":0.19022968156442263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396479523","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.9642347,0.00062428083,0.00001651757,0.0003538623,0.003367813,0.00028236798,0.0000015381661,0.0002324268,0.030886464],"genre_scores_gemma":[0.99937314,0.000052352916,0.0000071977997,0.000069676105,0.000029885961,0.00004783731,0.0000010653105,0.00003559172,0.0003832685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989957,0.00012886463,0.0001980669,0.0001600235,0.00022503383,0.00029226457],"domain_scores_gemma":[0.9991327,0.00026642423,0.000034823046,0.0003977271,0.000059537964,0.00010881045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841322,0.00017667993,0.00014595452,0.000031177176,0.0003368466,0.00015520162,0.00027171316,0.000073155046,0.0000066208972],"category_scores_gemma":[0.00010643453,0.000083675135,0.000054882574,0.00026017832,0.00008736638,0.00010540191,0.000042168656,0.00028216577,0.00010733152],"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.000020392421,0.00001778899,0.0014701913,0.000017850056,0.000060341943,0.0000046859845,0.0009290715,0.00026918665,0.0001665015,0.9885625,0.00764339,0.00083804753],"study_design_scores_gemma":[0.0010279425,0.00009262185,0.00049154635,0.00013512185,0.000031324656,0.000035634297,0.0020790726,0.0047775167,0.0018564208,0.91833925,0.07070108,0.000432438],"about_ca_topic_score_codex":0.000017831777,"about_ca_topic_score_gemma":0.0000048521297,"teacher_disagreement_score":0.07022327,"about_ca_system_score_codex":0.000027762915,"about_ca_system_score_gemma":0.000013552835,"threshold_uncertainty_score":0.34121728},"labels":[],"label_agreement":null},{"id":"W2396497375","doi":"10.5539/jmr.v8n3p44","title":"Strong Masting Conjecture for Multiple Size Hexagonal Tessellation in GSM Network Design","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; GSM; Hexagonal crystal system; Mathematics; Tessellation (computer graphics); Combinatorics; Range (aeronautics); Cell size; Discrete mathematics; Geometry; Telecommunications; Computer science; Crystallography; Engineering; Chemistry","score_opus":0.1089313906772318,"score_gpt":0.3294964701842462,"score_spread":0.22056507950701443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396497375","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.34009254,0.00033928305,0.6584352,0.000091479196,0.00025214482,0.0004287895,0.000004262286,0.00002077784,0.00033547974],"genre_scores_gemma":[0.9701644,0.000014814439,0.029376108,0.000001426391,0.00030862045,0.000012572854,2.1114013e-7,0.000027471586,0.00009434317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984943,0.00017909537,0.00050518505,0.00006789633,0.0003930644,0.00036045533],"domain_scores_gemma":[0.9923718,0.007134125,0.00010946602,0.00011171437,0.0001986807,0.00007420841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055878316,0.00009355191,0.00023702742,0.00016386546,0.00006729458,0.00004065177,0.00019454394,0.00009556593,0.00004274337],"category_scores_gemma":[0.0013531619,0.00006134305,0.0000746823,0.00021048862,0.000034154866,0.000120330784,0.000017561299,0.0003062236,0.0000064687506],"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.00050609617,0.00039126334,0.007773233,0.0029325334,0.000469905,0.00009869444,0.0069874777,0.74422246,0.17645517,0.027037242,0.0127546815,0.020371228],"study_design_scores_gemma":[0.006821339,0.00090298196,0.0018921262,0.006120245,0.000043028096,0.00034739234,0.0044967723,0.68498343,0.02629008,0.26578665,0.0016748272,0.0006411151],"about_ca_topic_score_codex":5.6075675e-7,"about_ca_topic_score_gemma":0.0000028222414,"teacher_disagreement_score":0.6300719,"about_ca_system_score_codex":0.000095608644,"about_ca_system_score_gemma":0.000043635977,"threshold_uncertainty_score":0.25014973},"labels":[],"label_agreement":null},{"id":"W2396519162","doi":"","title":"On cycle resonant outerplanar graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Outerplanar graph; Combinatorics; 1-planar graph; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.004088020985194442,"score_gpt":0.1838476270716802,"score_spread":0.17975960608648575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396519162","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.9672842,0.00009791904,0.00005825415,0.000028290257,0.0034210607,0.00008805879,0.0000033489368,0.00038266517,0.028636187],"genre_scores_gemma":[0.99974024,0.000007465137,0.000014127086,0.0000735144,0.000010247167,0.000015479394,0.000004419146,0.000030738076,0.0001037775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992668,0.00005907865,0.00015423201,0.00014665548,0.00013871542,0.00023453186],"domain_scores_gemma":[0.999449,0.00009062675,0.000019290268,0.00034197225,0.000013539107,0.00008555227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002343964,0.00014019525,0.00016062723,0.000082241895,0.0000674154,0.000025070887,0.00018019661,0.00007508567,0.000027515245],"category_scores_gemma":[0.000020732201,0.00013102198,0.00006799336,0.00014473441,0.000022877886,0.000054923006,0.000012548946,0.00013701986,0.00031955287],"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.000007747148,0.000022611719,0.00042120283,0.000021413034,0.000020046175,0.0000043982945,0.00011649702,0.00025588323,0.00029601765,0.99238783,0.005007721,0.0014386309],"study_design_scores_gemma":[0.00051157275,0.000106294385,0.0016886857,0.00004868919,0.0000075527964,0.0000046174678,0.00002054789,0.0041514896,0.0012991359,0.9758373,0.016104857,0.00021927162],"about_ca_topic_score_codex":0.0000070228084,"about_ca_topic_score_gemma":0.0000020138723,"teacher_disagreement_score":0.032456014,"about_ca_system_score_codex":0.000018449004,"about_ca_system_score_gemma":0.0000024361361,"threshold_uncertainty_score":0.5342921},"labels":[],"label_agreement":null},{"id":"W2396534911","doi":"","title":"On 3-chromatically unique and 3-chromatically equivalent hypergraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.005373679332127583,"score_gpt":0.19919617429079325,"score_spread":0.19382249495866566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396534911","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.97124934,0.00022140564,0.00011075839,0.00012198378,0.0007045581,0.00021707326,0.0000026818643,0.0004516836,0.026920496],"genre_scores_gemma":[0.99950236,0.000037923975,0.00017778324,0.00017785584,0.000007760508,0.000013529357,0.0000038216613,0.000026677457,0.000052308274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998911,0.00006935943,0.00029674015,0.00019952716,0.0002083879,0.0003149592],"domain_scores_gemma":[0.9992708,0.00014871536,0.00002709502,0.0003477288,0.000027907476,0.00017778491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024962032,0.00022762117,0.00027762665,0.00010630952,0.00008079631,0.00005660683,0.00017578487,0.00012577872,0.00003587953],"category_scores_gemma":[0.00003899866,0.0002126172,0.00007118026,0.00020040075,0.000058049474,0.0000988217,0.000017265185,0.00019193561,0.00007634979],"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.00001039317,0.00007503609,0.000067049674,0.00006874064,0.000033843895,0.000020579731,0.00014817498,0.000056026158,0.006055211,0.99159867,0.0008245171,0.0010417734],"study_design_scores_gemma":[0.00062123017,0.0003984806,0.0047253887,0.00017243666,0.00002058646,0.00002632965,0.00003088778,0.0015596573,0.002291524,0.9896087,0.0002476709,0.00029709435],"about_ca_topic_score_codex":0.0000012359644,"about_ca_topic_score_gemma":4.907018e-7,"teacher_disagreement_score":0.02825298,"about_ca_system_score_codex":0.00003330456,"about_ca_system_score_gemma":0.000008690069,"threshold_uncertainty_score":0.8670278},"labels":[],"label_agreement":null},{"id":"W2396716783","doi":"","title":"A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Linear subspace; Bounded function; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.008187617173141315,"score_gpt":0.1793967551282531,"score_spread":0.17120913795511178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396716783","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.99145633,0.0017664257,0.0003268105,0.0000064326186,0.0029983197,0.00027876874,0.00004720141,0.00021212219,0.0029075865],"genre_scores_gemma":[0.99942243,0.00010086095,0.00032286486,0.000003796367,0.000006761882,0.00005012821,0.000024890676,0.000046836987,0.00002140879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998376,0.00012122691,0.00053839356,0.00032621302,0.000267417,0.0003707459],"domain_scores_gemma":[0.999057,0.00006092277,0.00013969965,0.00057336706,0.00006209016,0.00010691584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002533901,0.00030336302,0.0005041837,0.00024252612,0.000071236005,0.00002617887,0.00032309818,0.0001892709,0.00006419604],"category_scores_gemma":[0.00001567857,0.00031965147,0.00017409843,0.00074494886,0.00032098513,0.00027908914,0.0000262074,0.00021650382,0.000010357522],"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.000074126016,0.000086564156,0.05760161,0.00009613266,0.00012343546,0.00001656675,0.0015736673,0.000017651728,0.0030148216,0.93694764,0.000093977265,0.00035381454],"study_design_scores_gemma":[0.0012441,0.000053995544,0.017536666,0.00019088926,0.000039057555,0.000003925093,0.0009403659,0.0002002061,0.023331776,0.9555612,0.0005419544,0.00035583592],"about_ca_topic_score_codex":0.00029663809,"about_ca_topic_score_gemma":0.00024678704,"teacher_disagreement_score":0.040064942,"about_ca_system_score_codex":0.000059144044,"about_ca_system_score_gemma":0.000016612787,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W2396784877","doi":"","title":"H-equipackable paths and cycles for H = P 4 and H = M 3 .","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006656786457512131,"score_gpt":0.20383614986685666,"score_spread":0.19717936340934453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396784877","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.9954995,0.0013381836,0.000056838882,0.000044768945,0.0005206259,0.00014789621,0.000004377583,0.00013149936,0.002256306],"genre_scores_gemma":[0.999726,0.000057660556,0.00009414908,0.000027117165,0.0000077980285,0.000012060574,0.0000020492714,0.00001094022,0.00006220291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996164,0.000009828526,0.00008979554,0.000097818105,0.00003885864,0.00014729748],"domain_scores_gemma":[0.9997777,0.000043724565,0.0000107572505,0.000098519595,0.000011823669,0.0000574981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115823845,0.00008613367,0.0001167891,0.00003036914,0.000059801958,0.000031087886,0.000042751028,0.0000501487,0.000002514515],"category_scores_gemma":[0.000010360796,0.00008523576,0.000019294328,0.00004903658,0.000018406734,0.0000850317,0.0000065897807,0.00004306838,0.0000028107827],"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.000009553464,0.000014111121,0.00089996436,0.00006027235,0.000016267366,0.0000020209193,0.00026658864,0.000013759165,0.0038868852,0.98840296,0.0013937876,0.0050338353],"study_design_scores_gemma":[0.00067466596,0.0001150265,0.0055429237,0.000029021461,0.000011815419,0.000009155099,0.00007642651,0.0012671532,0.0023994427,0.9860206,0.003693856,0.00015988883],"about_ca_topic_score_codex":0.0000014268716,"about_ca_topic_score_gemma":5.709676e-7,"teacher_disagreement_score":0.0048739463,"about_ca_system_score_codex":0.0000062108957,"about_ca_system_score_gemma":0.0000020064217,"threshold_uncertainty_score":0.34758136},"labels":[],"label_agreement":null},{"id":"W2396805066","doi":"","title":"Caterpillar Factorizations of Crowns.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Caterpillar; Mathematics; Biology; Botany; Lepidoptera genitalia","score_opus":0.004459163025853725,"score_gpt":0.18773826536373572,"score_spread":0.183279102337882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396805066","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.9861592,0.00004256802,0.00004698591,0.0000067280916,0.0048887813,0.00006597785,0.000007370645,0.00014377058,0.008638632],"genre_scores_gemma":[0.9998632,0.0000046596524,0.000030007262,0.0000032060211,0.000007963494,0.000006891534,0.0000054782377,0.000017531927,0.00006103363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995853,0.000011850872,0.00014547996,0.00006689081,0.00007663695,0.00011385907],"domain_scores_gemma":[0.99963546,0.000027913398,0.000021502381,0.00023123756,0.000037785303,0.000046097382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007795708,0.00007720975,0.000110463065,0.000050771447,0.0000341177,0.000010627536,0.00012937411,0.00007352969,0.00007310676],"category_scores_gemma":[0.000017710134,0.0000767833,0.00003947225,0.00015374827,0.00003219014,0.00006571065,0.000011064951,0.00011861647,0.000035472756],"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.00000113915,0.000020700996,0.006456304,0.000035610636,0.000024486317,0.0000011025147,0.00030263918,0.00007722009,0.124405354,0.8679195,0.0006267331,0.00012919484],"study_design_scores_gemma":[0.00089106796,0.000070425114,0.019829093,0.000037798192,0.00003567659,0.000012961102,0.00014495861,0.0011444823,0.31620654,0.6307134,0.030399187,0.0005143752],"about_ca_topic_score_codex":0.000008594978,"about_ca_topic_score_gemma":0.000005058201,"teacher_disagreement_score":0.23720609,"about_ca_system_score_codex":0.000005417897,"about_ca_system_score_gemma":0.000006750418,"threshold_uncertainty_score":0.31311318},"labels":[],"label_agreement":null},{"id":"W2397017387","doi":"","title":"Isomorphisms of directed P 3 -graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011835137230630415,"score_gpt":0.17962634667421892,"score_spread":0.1677912094435885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397017387","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.9558794,0.00031255404,0.000011073708,0.0000013459519,0.002114264,0.00008937784,0.0000041966728,0.00040348672,0.041184295],"genre_scores_gemma":[0.99980104,0.000016718332,0.0000747589,0.0000046136765,0.0000021518176,0.000012169573,0.0000024458031,0.000022873133,0.000063240295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994334,0.000031838186,0.00019656905,0.00009074855,0.000090724854,0.00015674242],"domain_scores_gemma":[0.99959993,0.00002418116,0.000032628024,0.00025166592,0.000036643392,0.000054964024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011553175,0.00010699164,0.0001774611,0.000085016276,0.00002375638,0.0000038159874,0.00016258207,0.000068568064,0.0001406401],"category_scores_gemma":[0.000009348248,0.0001071594,0.00007026666,0.00026690733,0.00004705603,0.00006603074,0.0000136020835,0.00008077656,0.00004754908],"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.000011689565,0.00006170328,0.006817578,0.0000570743,0.00007899309,0.0000067091737,0.0009810397,0.000007068124,0.006493716,0.98368376,0.0015337901,0.0002668765],"study_design_scores_gemma":[0.0006928943,0.000098697295,0.019758713,0.000057842302,0.000029691308,0.00000778025,0.00012079526,0.0003535288,0.07309894,0.90441287,0.001081763,0.00028647922],"about_ca_topic_score_codex":0.000023198136,"about_ca_topic_score_gemma":0.0000017284548,"teacher_disagreement_score":0.07927089,"about_ca_system_score_codex":0.000008425074,"about_ca_system_score_gemma":0.0000041930657,"threshold_uncertainty_score":0.43698335},"labels":[],"label_agreement":null},{"id":"W2397368910","doi":"","title":"More General Identities Involving The Terms Of {W n (a, b;p, q)}.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0057556765555992215,"score_gpt":0.19906240242226816,"score_spread":0.19330672586666894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397368910","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.99003404,0.0006654829,0.000008536423,0.000041792668,0.0014909592,0.00008347443,0.0000019688682,0.00010944415,0.007564301],"genre_scores_gemma":[0.99961543,0.000031018633,0.000012775313,0.000044112894,0.00001733066,0.0000052776595,0.0000019607676,0.000011308449,0.0002607651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.000029300301,0.00018208456,0.00007310863,0.00012700546,0.00015204206],"domain_scores_gemma":[0.99963796,0.00002911198,0.00003066627,0.00025529662,0.00001862428,0.000028339002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015588234,0.000098343226,0.0001367347,0.00004455188,0.000061160645,0.00002574219,0.00022288653,0.000045474953,0.000015673697],"category_scores_gemma":[0.00001017083,0.00007480235,0.0000666771,0.00014003039,0.000043775533,0.00011127878,0.000013723086,0.000096838245,0.000010065776],"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.000002857606,0.000015774716,0.0019092675,0.00003154971,0.00002973442,0.0000041766125,0.0011474276,0.0005036043,0.010190178,0.98299265,0.0027975969,0.00037516776],"study_design_scores_gemma":[0.00034312328,0.000053213284,0.018778251,0.000054967877,0.000018707093,0.000010523498,0.00037497745,0.0019000681,0.017377038,0.9603843,0.00052731147,0.00017749291],"about_ca_topic_score_codex":0.000007301659,"about_ca_topic_score_gemma":0.0000010393198,"teacher_disagreement_score":0.02260834,"about_ca_system_score_codex":0.000014640329,"about_ca_system_score_gemma":0.0000033566414,"threshold_uncertainty_score":0.30503514},"labels":[],"label_agreement":null},{"id":"W2397378149","doi":"","title":"Large sets of t-designs from t-homogeneous groups.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation group; Divisibility rule; Orbit (dynamics); Homogeneous; Set (abstract data type); Permutation (music); Block (permutation group theory); Simple (philosophy); Combinatorics; Group (periodic table); Discrete mathematics; Computer science","score_opus":0.007412164735808028,"score_gpt":0.20132374181516868,"score_spread":0.19391157707936066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397378149","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.9909496,0.00019392345,0.000062189625,0.000005917922,0.0052939476,0.00010696232,0.000048876827,0.0002041317,0.0031345014],"genre_scores_gemma":[0.99981177,0.0000058877563,0.00006397666,0.000010376691,0.000017100312,0.000011656903,0.000017308634,0.0000347363,0.000027202328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992541,0.00003423647,0.0002171179,0.00013437461,0.00013106066,0.00022913079],"domain_scores_gemma":[0.9993778,0.00008446431,0.000037891292,0.00038647372,0.000030669144,0.00008272168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018780194,0.00013813748,0.00021187338,0.000052128467,0.000043298565,0.0000142405825,0.00022921024,0.00013910892,0.00017574996],"category_scores_gemma":[0.000019056035,0.00014218212,0.00007849313,0.00013547826,0.000029770772,0.000069181915,0.00002684043,0.00021586403,0.00008861857],"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.00001211881,0.00010039824,0.003707725,0.00004692139,0.00010842081,0.000031030853,0.0010009783,0.000048624275,0.1822849,0.81061983,0.0016046048,0.0004344501],"study_design_scores_gemma":[0.0013332642,0.000079528145,0.0059522926,0.00003828507,0.000041462437,0.00001900097,0.0002374641,0.0016937833,0.11065194,0.87496656,0.0045544216,0.0004320099],"about_ca_topic_score_codex":0.000021925873,"about_ca_topic_score_gemma":0.000025696008,"teacher_disagreement_score":0.07163297,"about_ca_system_score_codex":0.000009125912,"about_ca_system_score_gemma":0.000008066143,"threshold_uncertainty_score":0.57980186},"labels":[],"label_agreement":null},{"id":"W2397389769","doi":"","title":"Multidecompositions of complete bipartite graphs into cycles and stars.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Stars; Complete bipartite graph; Combinatorics; Cograph; 1-planar graph; Astrophysics; Graph; Chordal graph; Physics","score_opus":0.007414974807594172,"score_gpt":0.2011813851917039,"score_spread":0.19376641038410972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397389769","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.99767774,0.00044677695,0.000026560603,0.000024776498,0.0005786253,0.0001761868,0.000009078984,0.00012438153,0.0009358552],"genre_scores_gemma":[0.9996339,0.000033713626,0.0002480832,0.000010241326,0.0000024722956,0.00003593337,0.000007392892,0.000017831588,0.000010408628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940646,0.0000380273,0.00021850782,0.00010514484,0.00008122281,0.00015061753],"domain_scores_gemma":[0.99957955,0.00007057542,0.000031634965,0.00019344568,0.00004316373,0.000081660626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008215854,0.00011270932,0.00018217393,0.00009628369,0.0000669486,0.000024761548,0.00009910308,0.000046935897,0.000040775976],"category_scores_gemma":[0.000006370041,0.00011336299,0.000046876314,0.00015273405,0.00008246645,0.00015536552,0.000025575753,0.00007821752,0.00004525246],"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.0000047980952,0.000063112246,0.01507563,0.00019915384,0.00011848599,0.000002121646,0.0012115161,0.00028009177,0.1419296,0.83846784,0.0017252377,0.0009224307],"study_design_scores_gemma":[0.000768285,0.00007622519,0.06160468,0.00009546139,0.000024768338,0.000006821959,0.00029378908,0.005739759,0.010149264,0.9201346,0.00081668043,0.00028966583],"about_ca_topic_score_codex":0.00013908798,"about_ca_topic_score_gemma":0.0000098581595,"teacher_disagreement_score":0.13178033,"about_ca_system_score_codex":0.000009455609,"about_ca_system_score_gemma":0.000002733571,"threshold_uncertainty_score":0.46228087},"labels":[],"label_agreement":null},{"id":"W2397430903","doi":"10.1016/j.disc.2016.04.009","title":"Decompositions of complete graphs into circulants","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012335997762790976,"score_gpt":0.22011929591447954,"score_spread":0.20778329815168856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397430903","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.8498498,0.0002092425,0.1354414,0.00004187951,0.0002510044,0.00020893886,0.000104473416,0.00025660862,0.013636613],"genre_scores_gemma":[0.99709547,0.000015033759,0.0027979757,0.000004540108,0.000012999643,0.000013568797,0.0000048758993,0.000022972376,0.000032560612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993852,0.000017725972,0.00027406504,0.00007436468,0.00011081197,0.00013786991],"domain_scores_gemma":[0.99950665,0.00009658922,0.00004551652,0.00027662542,0.000023883047,0.000050742296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010667722,0.000107843334,0.00020016622,0.00007461265,0.000037275877,0.000008498757,0.00014786063,0.00004007943,0.000063907806],"category_scores_gemma":[0.000011861183,0.000073225376,0.00009488097,0.000110029796,0.00006377727,0.00006102086,0.000017044498,0.00003271864,0.00007301692],"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.000004605604,0.00006216734,0.00062518957,0.0010932029,0.0002303217,0.000005792754,0.003286341,0.00018264572,0.39700687,0.5951851,0.0005600621,0.0017576894],"study_design_scores_gemma":[0.0010113609,0.00008175485,0.0013020666,0.0015115368,0.00011895391,0.000065454275,0.0011617817,0.0126573555,0.046704832,0.93324673,0.0014104043,0.0007277492],"about_ca_topic_score_codex":0.0000018172701,"about_ca_topic_score_gemma":0.0000028558914,"teacher_disagreement_score":0.35030204,"about_ca_system_score_codex":0.000011753836,"about_ca_system_score_gemma":0.0000029333037,"threshold_uncertainty_score":0.29860443},"labels":[],"label_agreement":null},{"id":"W2397693298","doi":"","title":"G-designs without blocking sets, Note.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Partition (number theory); Blocking (statistics); Discrete mathematics; Graph; Undirected graph","score_opus":0.010217725601475497,"score_gpt":0.21598961882524287,"score_spread":0.20577189322376738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397693298","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.9658514,0.00015570153,0.0012007848,0.000022384493,0.0042222925,0.00014215731,0.0000017467162,0.0007024646,0.027701022],"genre_scores_gemma":[0.9996385,0.0000053232884,0.000118644115,0.000034437373,0.000021891985,0.000016857415,0.0000032011997,0.000045031557,0.00011611122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916726,0.00007545461,0.0001834413,0.0001535919,0.00014149443,0.00027877415],"domain_scores_gemma":[0.99944645,0.00007874771,0.000027424534,0.00033166172,0.00002461937,0.000091114984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035064673,0.0001619266,0.00019978394,0.00006449654,0.00008877965,0.000041150386,0.0001970109,0.00009807528,0.000030594692],"category_scores_gemma":[0.000028571361,0.00016484004,0.00006215334,0.00016007855,0.000026450807,0.000090204296,0.000021116266,0.00016462742,0.00020113582],"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.0000076268802,0.000030924177,0.0052278438,0.000090992624,0.000052322273,0.0000050238846,0.0005628547,0.0010067319,0.00803916,0.9791266,0.0028764561,0.0029734706],"study_design_scores_gemma":[0.0016594882,0.00013909758,0.0032990167,0.00017733834,0.000054144242,0.000030376288,0.00010794062,0.040618453,0.020590212,0.8904759,0.041965213,0.00088277087],"about_ca_topic_score_codex":0.000006665829,"about_ca_topic_score_gemma":0.000002277469,"teacher_disagreement_score":0.088650644,"about_ca_system_score_codex":0.000030360457,"about_ca_system_score_gemma":0.000006012415,"threshold_uncertainty_score":0.6721982},"labels":[],"label_agreement":null},{"id":"W2397696069","doi":"","title":"On 2-Factors with Chorded Quadrilaterals in Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quadrilateral; Combinatorics; Structural engineering; Engineering; Finite element method","score_opus":0.011865795706753474,"score_gpt":0.18369159528163095,"score_spread":0.17182579957487748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397696069","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.9796808,0.000042616077,0.0000024249005,0.0000018895756,0.001115139,0.00014087465,0.0000015907126,0.00019985285,0.018814828],"genre_scores_gemma":[0.9998629,0.0000051248544,0.000012316837,0.000011916713,0.0000016360834,0.00002145621,0.0000029172625,0.000032661315,0.00004903262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992984,0.00004060364,0.00016698209,0.00014677286,0.00010702887,0.00024021292],"domain_scores_gemma":[0.9996051,0.00003838779,0.000022273933,0.00025453922,0.000012981928,0.00006667896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011626925,0.00016862944,0.00018960133,0.00015724325,0.000028935587,0.000013078807,0.00014717465,0.000075861186,0.0000749461],"category_scores_gemma":[0.000005955289,0.00013671897,0.000040194987,0.00029081936,0.00002688395,0.00010110772,0.000007731727,0.00015741323,0.00004833193],"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.0000489111,0.00008166905,0.06195419,0.000028953811,0.000042826603,0.00002669077,0.0022109183,0.000100363024,0.00034849686,0.93485975,0.00024338275,0.000053822943],"study_design_scores_gemma":[0.0014286658,0.00033822344,0.1429414,0.00014753459,0.00001229703,0.000004906333,0.00025245466,0.00012242605,0.014132889,0.83990407,0.00023326656,0.00048187707],"about_ca_topic_score_codex":0.000056362223,"about_ca_topic_score_gemma":0.000023161752,"teacher_disagreement_score":0.09495572,"about_ca_system_score_codex":0.000024438677,"about_ca_system_score_gemma":0.0000043592545,"threshold_uncertainty_score":0.5575238},"labels":[],"label_agreement":null},{"id":"W2397737544","doi":"","title":"On Super-simple Cyclic 2-designs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Pure mathematics; Arithmetic; Epistemology","score_opus":0.013576868473093614,"score_gpt":0.2168128638351721,"score_spread":0.20323599536207848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397737544","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.96929944,0.0003626057,0.000028888313,0.000008818478,0.0038141136,0.00011383424,0.0000029602934,0.00036293842,0.026006404],"genre_scores_gemma":[0.9997233,0.000008050416,0.000009426132,0.000045669745,0.000029184013,0.000026304047,0.000006375921,0.0000394883,0.00011216773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919003,0.00005344456,0.0001498085,0.000098254444,0.0001308443,0.00037764246],"domain_scores_gemma":[0.99944186,0.000095478026,0.0000139354015,0.00029855917,0.000011546427,0.00013861498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023554021,0.00014865011,0.00015391097,0.00006437518,0.00006859221,0.000020296013,0.00014732387,0.00008527774,0.00015356556],"category_scores_gemma":[0.000019265572,0.00014522568,0.00006470411,0.00016131054,0.000019460527,0.00015713877,0.000014164039,0.00014223972,0.0007730509],"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.0000056828794,0.000060416478,0.0033281432,0.000024327162,0.00003110745,0.000002147032,0.00033342675,0.00008076401,0.00310268,0.9815607,0.011068554,0.00040202696],"study_design_scores_gemma":[0.0011465334,0.00014571314,0.010151491,0.0000475572,0.000029875871,0.000017508835,0.00020186209,0.00038261875,0.029163836,0.9262589,0.03177934,0.0006747346],"about_ca_topic_score_codex":0.000005081601,"about_ca_topic_score_gemma":5.3408024e-7,"teacher_disagreement_score":0.055301797,"about_ca_system_score_codex":0.000039326427,"about_ca_system_score_gemma":0.000003381456,"threshold_uncertainty_score":0.9936263},"labels":[],"label_agreement":null},{"id":"W2397759904","doi":"","title":"The Mod Sum Number of Even Fans and Symmetric Complete Bipartite Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Mod; Discrete mathematics; Graph","score_opus":0.006805093739342697,"score_gpt":0.20553669702846988,"score_spread":0.19873160328912717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397759904","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.990852,0.00029799063,0.0000067590818,0.000023860533,0.0025454618,0.000121704754,0.000010467173,0.00008578552,0.0060559986],"genre_scores_gemma":[0.99981713,0.0000482383,0.000019115834,0.0000059358867,0.0000070071887,0.000016362257,0.0000021601118,0.000021612179,0.00006245184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992899,0.00004191155,0.00021167143,0.00011045361,0.0001330171,0.00021304922],"domain_scores_gemma":[0.99933,0.00019525866,0.000041388397,0.00032088556,0.00004164296,0.00007082772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031572842,0.0001210021,0.000171142,0.00006793109,0.00011650691,0.000032186043,0.00019729088,0.00007533115,0.000014014615],"category_scores_gemma":[0.000031860825,0.00009474856,0.00006083419,0.00041334602,0.0001095882,0.000073712865,0.000031105603,0.00021237571,0.00002698559],"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.0000046740993,0.000015520822,0.017097998,0.000031694937,0.000043733104,0.0000011573992,0.00014044643,0.0000109307375,0.0063502337,0.975276,0.00046042234,0.000567213],"study_design_scores_gemma":[0.00079055474,0.00003937868,0.037335295,0.000029056273,0.00003524148,0.000026292233,0.00011292664,0.0026111647,0.0037806793,0.9394863,0.015466884,0.00028617296],"about_ca_topic_score_codex":0.000026302007,"about_ca_topic_score_gemma":0.000018698845,"teacher_disagreement_score":0.03578962,"about_ca_system_score_codex":0.000005157575,"about_ca_system_score_gemma":0.0000050452327,"threshold_uncertainty_score":0.3863734},"labels":[],"label_agreement":null},{"id":"W2397864841","doi":"","title":"On Cyclic (C 2m +e)-designs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.009104513636449119,"score_gpt":0.20638381933591704,"score_spread":0.19727930569946792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397864841","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.9385501,0.0001815483,0.00003769667,0.000046172732,0.002192734,0.00011446461,0.0000012569345,0.0004984773,0.058377523],"genre_scores_gemma":[0.9996351,0.0000096744825,0.0000127792655,0.00012071346,0.00001168914,0.000007404785,0.0000025149009,0.000019054842,0.0001810886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935174,0.00003483069,0.00014328955,0.0001260963,0.00012210592,0.00022194127],"domain_scores_gemma":[0.99956495,0.000051854906,0.000016023687,0.00027898935,0.000012045523,0.00007613914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012702314,0.00013700893,0.0001454747,0.000069345515,0.000055027103,0.000026218595,0.00015878261,0.00007734997,0.00004446942],"category_scores_gemma":[0.000013654859,0.00013587186,0.00006093259,0.00017501283,0.000012677035,0.00006964042,0.000004675981,0.00014080766,0.00038784035],"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.000007633323,0.00003979451,0.000050274073,0.000008292038,0.00001464494,0.000010899678,0.00010606024,0.0003970728,0.0037149137,0.987242,0.0069451216,0.0014632805],"study_design_scores_gemma":[0.00046955814,0.00017241649,0.0018635779,0.000035884812,0.00000726154,0.0000051736383,0.000020117337,0.00047144011,0.007344461,0.9866632,0.0027280962,0.00021880612],"about_ca_topic_score_codex":0.0000013112009,"about_ca_topic_score_gemma":2.3416133e-7,"teacher_disagreement_score":0.061084956,"about_ca_system_score_codex":0.00003137532,"about_ca_system_score_gemma":0.0000036967708,"threshold_uncertainty_score":0.55406934},"labels":[],"label_agreement":null},{"id":"W2397981965","doi":"","title":"On a well-spread halving of directed multigraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00985249971436289,"score_gpt":0.18585298001840053,"score_spread":0.17600048030403764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397981965","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.9361813,0.00019189387,0.00001246464,0.0000012770029,0.0018270509,0.00011677887,0.0000029124658,0.00041227348,0.061254054],"genre_scores_gemma":[0.999799,0.000011928253,0.00006511754,0.0000068558334,0.0000030789067,0.0000165105,0.000001948365,0.000028769315,0.00006680492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930274,0.00004769334,0.00021412101,0.00012866363,0.00011459928,0.00019218783],"domain_scores_gemma":[0.999475,0.000081913124,0.000041123552,0.0003058652,0.00003331775,0.00006278882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013981295,0.00014097945,0.00020019885,0.000121183395,0.00003494191,0.0000060241073,0.00017419034,0.00008057691,0.0001062465],"category_scores_gemma":[0.0000267763,0.00013920008,0.00008832903,0.00024894104,0.000037045003,0.00006405269,0.000014441215,0.00011966483,0.000070599854],"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.000041440115,0.00015913552,0.005606166,0.00011537174,0.00013293755,0.000013450838,0.0021549119,0.00006927021,0.0065755644,0.9827832,0.0018050618,0.0005435165],"study_design_scores_gemma":[0.0022198376,0.00036545555,0.03750618,0.00047018338,0.00006548784,0.00000999501,0.0003649274,0.004053946,0.15825047,0.7947712,0.0011544115,0.0007679056],"about_ca_topic_score_codex":0.00005487464,"about_ca_topic_score_gemma":0.0000045841152,"teacher_disagreement_score":0.18801196,"about_ca_system_score_codex":0.000013022494,"about_ca_system_score_gemma":0.0000039423344,"threshold_uncertainty_score":0.56764144},"labels":[],"label_agreement":null},{"id":"W2397985948","doi":"","title":"Connected M 2 -equicoverable graphs with circumference at most 5.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circumference; Combinatorics; Geometry","score_opus":0.011446697726952152,"score_gpt":0.17002167467421375,"score_spread":0.1585749769472616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397985948","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.93751955,0.0001903505,0.000030804822,0.0000023756818,0.001272229,0.00015112484,0.000006124086,0.00043035523,0.060397096],"genre_scores_gemma":[0.9995742,0.000016152697,0.000034586632,0.000021561718,0.0000031882907,0.000034994402,0.0000084157045,0.000038904087,0.0002679976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999142,0.00003935569,0.0001701539,0.00019219963,0.000141773,0.0003145113],"domain_scores_gemma":[0.9993888,0.000041711053,0.000034002485,0.00037207108,0.00005266048,0.0001107328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010883704,0.00018844154,0.00020230033,0.000073421106,0.00010885083,0.00002096048,0.00021684603,0.000087103355,0.0002929052],"category_scores_gemma":[0.0000093939425,0.00017035478,0.00003962035,0.00037249387,0.000057173755,0.0001572435,0.000027669934,0.00013530454,0.0001642124],"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.000049974507,0.000053043193,0.020981027,0.00005991741,0.00011003918,0.00003699465,0.0009109432,0.00005340122,0.0044700596,0.97176737,0.0014155115,0.00009171336],"study_design_scores_gemma":[0.0026801873,0.00045036798,0.024868777,0.00017044766,0.00007149024,0.0000978066,0.0003236116,0.00076296506,0.051383886,0.91522473,0.002915133,0.0010505847],"about_ca_topic_score_codex":0.0000470172,"about_ca_topic_score_gemma":0.000019821056,"teacher_disagreement_score":0.062054656,"about_ca_system_score_codex":0.00004422353,"about_ca_system_score_gemma":0.000012216638,"threshold_uncertainty_score":0.6946866},"labels":[],"label_agreement":null},{"id":"W2398030542","doi":"","title":"On the maximum packing problem of MP λ (3, K(3)4 - e, v).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Packing problems; Combinatorics; Mathematical optimization","score_opus":0.006050689934521276,"score_gpt":0.1792347300021674,"score_spread":0.17318404006764612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398030542","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.93336385,0.000057557263,0.000084811654,0.0000452126,0.0010560967,0.00014452623,0.0000014399911,0.00013311308,0.06511337],"genre_scores_gemma":[0.99985176,0.0000032696776,0.000019666883,0.000029442992,0.0000073347987,0.0000174902,0.0000010648872,0.000022143593,0.000047848705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993761,0.00007549834,0.00016803348,0.00009024576,0.00012955593,0.00016054552],"domain_scores_gemma":[0.99939716,0.00020867337,0.000036875153,0.0003036596,0.000022265569,0.00003138504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004207342,0.00010450911,0.00013938195,0.00003913595,0.000054232176,0.000015147544,0.00019471975,0.000051778075,0.000035038236],"category_scores_gemma":[0.000025115314,0.00007530299,0.000056092238,0.00014488357,0.00003342109,0.00003917249,0.000016782868,0.00012635902,0.00006742087],"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.0000036477272,0.000016555969,0.00028394637,0.00004630691,0.000023116263,4.3883873e-7,0.00020145706,0.00033010455,0.0012722235,0.99557465,0.0015248735,0.000722695],"study_design_scores_gemma":[0.00023121071,0.00006337867,0.00035359204,0.00007471356,0.000007003483,0.0000015087334,0.000056920544,0.0009042759,0.007258533,0.9875217,0.0034230417,0.000104124476],"about_ca_topic_score_codex":0.0000050792187,"about_ca_topic_score_gemma":9.4945494e-7,"teacher_disagreement_score":0.06648786,"about_ca_system_score_codex":0.000011967192,"about_ca_system_score_gemma":0.0000031699021,"threshold_uncertainty_score":0.3070767},"labels":[],"label_agreement":null},{"id":"W2398093189","doi":"","title":"Cubic symmetric graphs of order 4p 3 .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Combinatorics; Business","score_opus":0.004886694302722183,"score_gpt":0.18423432331513023,"score_spread":0.17934762901240806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398093189","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.96773773,0.0003946536,0.000079966005,0.000006633927,0.0026902836,0.000089160174,0.0000017575078,0.0001830288,0.028816802],"genre_scores_gemma":[0.999804,0.000016921485,0.000041402916,0.000011552091,0.0000062316303,0.000010447711,0.0000026222096,0.00002616682,0.000080647165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992891,0.000055649798,0.00021558827,0.00011070892,0.0001389972,0.00018997473],"domain_scores_gemma":[0.99943995,0.00010281886,0.000036463174,0.00030334154,0.000056264344,0.00006113539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027413637,0.000120856246,0.00021305314,0.0002067956,0.000032964017,0.000010773679,0.00018478073,0.000078081204,0.000034372457],"category_scores_gemma":[0.000055899163,0.000119261036,0.0000708836,0.0009049973,0.000033054694,0.00006660689,0.000017177317,0.00010453687,0.00007127745],"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.0000025917725,0.000025745818,0.0021650805,0.00008211636,0.00003773501,6.9700013e-7,0.00007671475,0.00017613258,0.001509805,0.994089,0.000824078,0.001010304],"study_design_scores_gemma":[0.0007699388,0.00009735476,0.0038379384,0.000047350084,0.000026250254,0.000004706889,0.000045900375,0.0030222728,0.009869262,0.97594976,0.006070682,0.00025859216],"about_ca_topic_score_codex":0.000010616892,"about_ca_topic_score_gemma":0.00000105805,"teacher_disagreement_score":0.032066293,"about_ca_system_score_codex":0.000011488382,"about_ca_system_score_gemma":0.000004722593,"threshold_uncertainty_score":0.4863324},"labels":[],"label_agreement":null},{"id":"W2398093384","doi":"","title":"Decomposition of a 2K 10t into H 3 Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decomposition; Mathematics; Chemistry; Organic chemistry","score_opus":0.0036731793784347453,"score_gpt":0.19592764052687295,"score_spread":0.1922544611484382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398093384","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.99311787,0.0002452301,0.00005103502,0.000014030562,0.0013668506,0.00014956931,9.713599e-7,0.00015021105,0.0049042036],"genre_scores_gemma":[0.99980867,0.000010671131,0.000085751366,0.000008913568,0.000003715825,0.000038634436,0.000004485166,0.00001744897,0.000021710346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999468,0.00003145572,0.00018977643,0.000084694715,0.00009276996,0.00013326293],"domain_scores_gemma":[0.99964005,0.000032936336,0.000028770182,0.00019899495,0.000044541513,0.00005472461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009078114,0.000096162126,0.00014592493,0.00008344518,0.00003351047,0.000015941265,0.00012409326,0.000063000174,0.00008507213],"category_scores_gemma":[0.0000054226944,0.000097125885,0.00006408914,0.00019099015,0.000024322735,0.00014337276,0.000014057068,0.000073903655,0.00014464026],"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.000004534251,0.000052154795,0.0021451712,0.00014240858,0.00006789807,0.0000016903743,0.0006303152,0.00023314997,0.05496,0.9373943,0.0026874829,0.0016808797],"study_design_scores_gemma":[0.00037239108,0.000055180626,0.0046126535,0.000048435963,0.000010569712,0.0000038217386,0.00009123487,0.0014608294,0.02665442,0.96614015,0.00040025183,0.00015007281],"about_ca_topic_score_codex":0.000061961895,"about_ca_topic_score_gemma":0.0000026420596,"teacher_disagreement_score":0.028745826,"about_ca_system_score_codex":0.000016691676,"about_ca_system_score_gemma":0.0000033774334,"threshold_uncertainty_score":0.39606786},"labels":[],"label_agreement":null},{"id":"W2398122456","doi":"","title":"Two Results on the Hamiltonicity of L 1 -Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008586145487718907,"score_gpt":0.2003482098858403,"score_spread":0.19176206439812138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398122456","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.92487127,0.00004838,0.000008663312,0.000051387884,0.0015547841,0.00010046213,0.0000059486715,0.00011489295,0.07324421],"genre_scores_gemma":[0.99985486,0.0000061186447,0.000007668084,0.00003839284,0.0000068740655,0.000010173088,0.0000020862149,0.000015797692,0.000058011337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992688,0.00011071693,0.00021609364,0.000107346015,0.00014123894,0.00015580663],"domain_scores_gemma":[0.9991304,0.00029993991,0.000043376695,0.00046136562,0.000027922128,0.00003699203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006324886,0.000107729764,0.00015080726,0.00004608801,0.000057228273,0.000011552403,0.00023617601,0.00004553055,0.0000097991],"category_scores_gemma":[0.00008263466,0.000077481156,0.000075028605,0.0001945841,0.00005306806,0.000032331478,0.000016664857,0.00014273362,0.000047612215],"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.000017535553,0.000020792979,0.00019945331,0.000014979984,0.000025414598,4.1793425e-7,0.0001646415,0.00047474593,0.0011418915,0.9954711,0.0022474355,0.00022159301],"study_design_scores_gemma":[0.0011902773,0.00013836952,0.0031672118,0.00008045064,0.000013683027,0.0000017813996,0.000078246514,0.003174387,0.029961085,0.9554683,0.006536669,0.00018951624],"about_ca_topic_score_codex":0.000018123448,"about_ca_topic_score_gemma":0.0000037871062,"teacher_disagreement_score":0.074983604,"about_ca_system_score_codex":0.000011005924,"about_ca_system_score_gemma":0.0000035257178,"threshold_uncertainty_score":0.315959},"labels":[],"label_agreement":null},{"id":"W2398135063","doi":"","title":"Groups PSL(n, q) and 3-(v, k, 1) designs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Mathematics; Pure mathematics; Combinatorics; Arithmetic","score_opus":0.00822638451153345,"score_gpt":0.18114899741027551,"score_spread":0.17292261289874206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398135063","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.98946047,0.00057613035,0.000048976977,0.000022177423,0.0012951876,0.00016218646,6.73869e-7,0.00025667853,0.008177537],"genre_scores_gemma":[0.99970436,0.00002559725,0.000046622998,0.000024889316,0.000008163571,0.00004492065,0.0000014810057,0.00002301024,0.00012093455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994797,0.000029973959,0.00012439686,0.00010759858,0.00007235496,0.00018595197],"domain_scores_gemma":[0.999662,0.000044293625,0.000012816192,0.00017253084,0.000020462458,0.00008791992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010470017,0.00011154773,0.00012365036,0.00004321075,0.000051298903,0.000050758692,0.000094138784,0.00006493311,0.000090145986],"category_scores_gemma":[0.000008414412,0.00010778996,0.000026405507,0.00010424409,0.000030694257,0.00016930516,0.000017766273,0.00009275499,0.0002808055],"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.0000018832665,0.000018428036,0.0033827329,0.000062929554,0.000040894683,0.0000044339954,0.00037023524,0.000029206878,0.007613548,0.9792081,0.007072394,0.0021952153],"study_design_scores_gemma":[0.000521225,0.000050210645,0.012220532,0.000028426663,0.000010905814,0.000017701665,0.0001642648,0.0017423098,0.003139154,0.9800862,0.0017431554,0.0002759321],"about_ca_topic_score_codex":0.000017577071,"about_ca_topic_score_gemma":6.8873703e-7,"teacher_disagreement_score":0.010243928,"about_ca_system_score_codex":0.000012786778,"about_ca_system_score_gemma":0.000002787748,"threshold_uncertainty_score":0.4395547},"labels":[],"label_agreement":null},{"id":"W2398257445","doi":"","title":"A few remarks on avoiding partial Latin squares.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Applied mathematics; Food science; Chemistry","score_opus":0.011283151182518117,"score_gpt":0.2115824820747736,"score_spread":0.2002993308922555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398257445","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.9624379,0.00038392565,0.00003955211,0.000018389594,0.0058601117,0.00012891872,0.0000024316664,0.00033593184,0.030792795],"genre_scores_gemma":[0.9996604,0.000007212453,0.00001407739,0.000029178902,0.0000684118,0.000027071486,0.000004277975,0.000037147944,0.0001522224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904555,0.000105633764,0.00019052906,0.00011319969,0.0001546903,0.00039041525],"domain_scores_gemma":[0.99942076,0.00012764479,0.000027760454,0.0002732402,0.000013540482,0.00013703994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047550813,0.00015567323,0.00016998862,0.00008867121,0.000114939015,0.00002843642,0.0001257488,0.0001010482,0.00008221542],"category_scores_gemma":[0.000047038302,0.00015484387,0.000071900686,0.00022131915,0.00001858396,0.00014604125,0.000018971365,0.00025848037,0.0003507029],"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.000015039709,0.00005815676,0.0056237,0.000051665862,0.000039763767,0.0000042058828,0.0009560761,0.00023307893,0.00182765,0.9860187,0.004571579,0.0006003567],"study_design_scores_gemma":[0.0066960426,0.0006940788,0.03768767,0.0011347365,0.00020232881,0.00006294426,0.0022483962,0.011744129,0.15161653,0.58157694,0.2026604,0.0036758233],"about_ca_topic_score_codex":0.000004792274,"about_ca_topic_score_gemma":6.4495083e-7,"teacher_disagreement_score":0.4044418,"about_ca_system_score_codex":0.000046390433,"about_ca_system_score_gemma":0.00000438869,"threshold_uncertainty_score":0.631435},"labels":[],"label_agreement":null},{"id":"W2398513543","doi":"","title":"On The Power Subgroups Of The Modular Group.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Modular design; Group (periodic table); Modular group; Power (physics); Arithmetic; Pure mathematics; Computer science; Programming language; Chemistry","score_opus":0.004531171793854733,"score_gpt":0.17307748140279858,"score_spread":0.16854630960894385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398513543","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.9858247,0.00015863356,0.000010346061,0.00016651844,0.0018139369,0.0001519342,0.0000017768778,0.0000743297,0.011797801],"genre_scores_gemma":[0.9997835,0.0000034787868,0.000001807212,0.00013500478,0.0000046365853,0.0000060579337,5.0578024e-7,0.000012466505,0.00005251988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993878,0.00007129232,0.00014415392,0.00008431859,0.00016382504,0.00014859515],"domain_scores_gemma":[0.99935704,0.00008195303,0.00002968979,0.00048945803,0.000016730983,0.000025104971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024227897,0.00010577247,0.00011473012,0.000022824424,0.00007218782,0.000013240406,0.0003322514,0.00005481365,0.00003155531],"category_scores_gemma":[0.000023668415,0.000060542978,0.00009695875,0.00020736954,0.000035416466,0.000039369188,0.000013876281,0.0001554866,0.000024176727],"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.000004659064,0.000032740572,0.00013803293,0.0000051245897,0.000017560309,9.174645e-7,0.00021422586,0.00029918118,0.0045649237,0.993242,0.0014108188,0.000069787326],"study_design_scores_gemma":[0.00025950026,0.000093587085,0.01815108,0.000044454027,0.000008924709,0.0000025775596,0.00007862929,0.00045505023,0.006579682,0.9730255,0.0011867337,0.00011429378],"about_ca_topic_score_codex":0.0000025224376,"about_ca_topic_score_gemma":5.063407e-7,"teacher_disagreement_score":0.020216541,"about_ca_system_score_codex":0.00001631847,"about_ca_system_score_gemma":0.0000026407013,"threshold_uncertainty_score":0.2468871},"labels":[],"label_agreement":null},{"id":"W2398513767","doi":"","title":"A necessary and sufficient condition for a graph to be E 2 -cordial.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01591441386425326,"score_gpt":0.23080538035631717,"score_spread":0.2148909664920639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398513767","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.9945617,0.00022958445,0.00035162776,0.0000927764,0.002514077,0.0003571773,0.000020898276,0.00016433648,0.0017078789],"genre_scores_gemma":[0.9996476,0.0000035157982,0.000053116855,0.000086666914,0.000012290857,0.00011851915,0.000015110719,0.000019872812,0.00004328843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994553,0.000022836426,0.00012672195,0.00012708356,0.00009422106,0.00017386978],"domain_scores_gemma":[0.9995823,0.000050380862,0.00001545462,0.0001378827,0.000049257083,0.00016475498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002518226,0.000101428566,0.0001357732,0.00008726612,0.000047166617,0.00003231084,0.00007530629,0.000052513667,0.0000034506302],"category_scores_gemma":[0.00003229891,0.00010508995,0.000035442652,0.00017210614,0.00001962357,0.00007781675,0.000016627011,0.000049695333,0.000010936239],"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.000053923108,0.000060918628,0.0007484482,0.00009913581,0.000050458326,0.0000048636707,0.0024802429,0.001059014,0.0016060063,0.9493191,0.04416193,0.00035590766],"study_design_scores_gemma":[0.0037532146,0.0007806768,0.0019458832,0.00008432061,0.00006088636,0.000023755736,0.0024159004,0.004325352,0.00491992,0.9195173,0.06148263,0.0006902066],"about_ca_topic_score_codex":0.0000088639235,"about_ca_topic_score_gemma":0.0000041132234,"teacher_disagreement_score":0.029801896,"about_ca_system_score_codex":0.000023222176,"about_ca_system_score_gemma":0.000008968385,"threshold_uncertainty_score":0.42854437},"labels":[],"label_agreement":null},{"id":"W2398560034","doi":"","title":"The result on (3, 1)*-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01634810962439791,"score_gpt":0.22987941106714072,"score_spread":0.2135313014427428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398560034","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.9961651,0.0001855965,0.0000044127437,0.000017720791,0.0014068192,0.00018476027,0.000010415007,0.00004612914,0.00197905],"genre_scores_gemma":[0.9999285,0.000013092627,0.00001004979,0.0000026326127,0.000005926376,0.000012222175,0.0000015236809,0.000014567245,0.000011539834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991102,0.00014623142,0.00034362767,0.00012308752,0.00014218282,0.0001346522],"domain_scores_gemma":[0.99902767,0.00041511815,0.00012360714,0.00027398876,0.0000931875,0.00006641054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081052457,0.00012036517,0.0002607796,0.000053164615,0.00005139093,0.000015952486,0.00014194087,0.000055902165,0.0000010722546],"category_scores_gemma":[0.00041873456,0.000089582005,0.000053069372,0.00016242883,0.0001654493,0.00007020788,0.000026914622,0.0001377132,0.0000018096125],"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.0010407089,0.00021581633,0.05672,0.00043545789,0.00039347738,0.0000046915866,0.022678977,0.00018112341,0.010157415,0.9027514,0.00033477266,0.005086176],"study_design_scores_gemma":[0.0036266672,0.00070886203,0.050388247,0.00047233808,0.00006384882,0.000008859416,0.012185221,0.0015365852,0.043123834,0.88726914,0.00023243108,0.00038397856],"about_ca_topic_score_codex":0.000033767876,"about_ca_topic_score_gemma":0.00001025709,"teacher_disagreement_score":0.03296642,"about_ca_system_score_codex":0.000027286193,"about_ca_system_score_gemma":0.000011258857,"threshold_uncertainty_score":0.3653048},"labels":[],"label_agreement":null},{"id":"W2398687409","doi":"","title":"k-Connected Graphs Without K 4 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012771128039274833,"score_gpt":0.20748709116971883,"score_spread":0.194715963130444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398687409","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.9631537,0.00035622547,0.000022024547,0.000012152003,0.004273038,0.000110638066,0.0000020864777,0.0006670908,0.031403013],"genre_scores_gemma":[0.99973744,0.0000044025173,0.000026982654,0.000018328547,0.0000086094715,0.000020153486,0.000005256358,0.000032094624,0.00014675265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932206,0.00004656523,0.00015325996,0.000119442426,0.00014210085,0.00021655216],"domain_scores_gemma":[0.99947053,0.000025355725,0.000018651397,0.00027224232,0.000052331605,0.00016090841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021942773,0.0001328275,0.00016828357,0.000075374504,0.000035467954,0.00002768649,0.0001617902,0.0000774648,0.000018388877],"category_scores_gemma":[0.000029515817,0.0001315019,0.00005136119,0.00027130713,0.0000283271,0.00011126171,0.000016421665,0.00011925428,0.00022613184],"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.000011329941,0.00002419544,0.006878888,0.000022046244,0.000058014743,0.000010228243,0.00052969076,0.00021174771,0.0010975444,0.9823997,0.008518059,0.00023856609],"study_design_scores_gemma":[0.0012632271,0.00006800189,0.0011936743,0.000028073386,0.000018036173,0.000018723114,0.0002684827,0.001454611,0.0041547576,0.98204046,0.009176685,0.00031529163],"about_ca_topic_score_codex":0.000010048919,"about_ca_topic_score_gemma":0.0000027913832,"teacher_disagreement_score":0.036583688,"about_ca_system_score_codex":0.000028484936,"about_ca_system_score_gemma":0.000011531228,"threshold_uncertainty_score":0.53624916},"labels":[],"label_agreement":null},{"id":"W2398755068","doi":"","title":"Minimum embedding of a K 3 -design into a balanced incomplete block design of index λ ≥ 2.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Lambda; Embedding; Order (exchange); Block design; Index (typography); Value (mathematics); Discrete mathematics; Statistics; Physics; Computer science","score_opus":0.011524283810214756,"score_gpt":0.21236349903291923,"score_spread":0.20083921522270448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398755068","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.9833535,0.00023607988,0.0140062515,0.000008529847,0.0010126972,0.0005762912,0.0000021130638,0.00014398199,0.00066054775],"genre_scores_gemma":[0.99836606,0.0000079278525,0.0014894782,0.000006331058,0.0000068271233,0.00006019623,0.0000012150531,0.000036562433,0.000025396002],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877906,0.00016108894,0.00045951566,0.00016053951,0.00019204764,0.00024776626],"domain_scores_gemma":[0.9990612,0.00027824228,0.00011509428,0.0003624021,0.0001047593,0.00007827675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003948617,0.00018871625,0.0004070391,0.00015142023,0.000036739893,0.000015926375,0.00029174256,0.000116196024,0.000045963156],"category_scores_gemma":[0.000047688667,0.00019067565,0.000078941055,0.00034343672,0.000064219246,0.00014455942,0.00003862818,0.00012732585,0.00003409575],"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.00013135208,0.0002459037,0.003493988,0.0010672997,0.0005593521,0.000010423724,0.007110326,0.10466192,0.7335932,0.14155678,0.0061902627,0.0013791488],"study_design_scores_gemma":[0.0022360438,0.00039525167,0.0019180026,0.0003911427,0.000041589286,0.0000105920735,0.0006860647,0.29406753,0.09184064,0.60773575,0.00011291426,0.00056450523],"about_ca_topic_score_codex":0.000051373154,"about_ca_topic_score_gemma":4.2490478e-7,"teacher_disagreement_score":0.6417526,"about_ca_system_score_codex":0.000032331587,"about_ca_system_score_gemma":0.00001940625,"threshold_uncertainty_score":0.7775527},"labels":[],"label_agreement":null},{"id":"W2399042833","doi":"","title":"Perfect T(G)-triple system for each graph G with five vertices and seven edges.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.005249714212594095,"score_gpt":0.1757565902402147,"score_spread":0.1705068760276206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399042833","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.9930302,0.00079598336,0.00009900279,0.000014156863,0.003308233,0.000872589,0.000007258514,0.00029749077,0.0015751027],"genre_scores_gemma":[0.9992175,0.000008592377,0.0000590062,0.000007334316,0.000033635453,0.0004425179,0.000005948325,0.000038546146,0.00018689029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924725,0.00004088549,0.0001595523,0.00018207877,0.00011041003,0.0002598036],"domain_scores_gemma":[0.999483,0.00009816069,0.000031937598,0.00021665539,0.000071063536,0.00009916738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018137475,0.00017332436,0.00023121372,0.00007094315,0.00011292572,0.000076162476,0.00012700012,0.00008852817,0.000005676328],"category_scores_gemma":[0.000010278387,0.00014345122,0.000048765873,0.00015316243,0.000038893995,0.00020824152,0.000015932968,0.0001005478,0.00003689627],"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.00022674854,0.00019001054,0.025730848,0.0051758313,0.0013838056,0.000019109355,0.0089965835,0.0011982888,0.0106113255,0.88283634,0.0588868,0.0047443355],"study_design_scores_gemma":[0.03778659,0.0055386494,0.04876585,0.0039448133,0.00144171,0.0005324574,0.03774457,0.09205887,0.06405806,0.6130912,0.08715527,0.007882011],"about_ca_topic_score_codex":0.000053678737,"about_ca_topic_score_gemma":0.0000052621845,"teacher_disagreement_score":0.26974517,"about_ca_system_score_codex":0.000029536479,"about_ca_system_score_gemma":0.000007887917,"threshold_uncertainty_score":0.5849771},"labels":[],"label_agreement":null},{"id":"W2399045001","doi":"","title":"On the existence of well-ordered Steiner triple systems.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Steiner tree problem; Combinatorics","score_opus":0.007221895857537034,"score_gpt":0.19084084095041395,"score_spread":0.1836189450928769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399045001","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.95750815,0.00014879084,0.00000860842,0.000028038588,0.007648356,0.0002482118,0.0000050683566,0.0001240924,0.034280676],"genre_scores_gemma":[0.9993454,0.000005014407,0.000005853744,0.000012952263,0.000013521435,0.000038543352,0.0000016924372,0.000024771647,0.00055225636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.00006492364,0.00024340519,0.000118820746,0.00017931123,0.0001820043],"domain_scores_gemma":[0.99912083,0.00020106682,0.00005387399,0.0005280285,0.000047293324,0.000048885715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038583676,0.0001344599,0.00019446008,0.000050388764,0.00006425799,0.00002560124,0.00031465897,0.00009223465,0.000071357674],"category_scores_gemma":[0.000054478034,0.00009549158,0.00006789786,0.00020497954,0.000058548598,0.000051094517,0.000018211562,0.0002629532,0.00010878993],"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.000008532551,0.000027176973,0.00015879759,0.000060310984,0.00003035928,0.0000020055625,0.00013648588,0.00018091053,0.009959648,0.9867366,0.0026564747,0.000042689477],"study_design_scores_gemma":[0.0028455537,0.00039287898,0.0024932323,0.00037696207,0.000071690956,0.000038806455,0.0013153676,0.013518009,0.055264745,0.88130563,0.04140944,0.0009676719],"about_ca_topic_score_codex":0.000022249176,"about_ca_topic_score_gemma":0.0000044049443,"teacher_disagreement_score":0.10543097,"about_ca_system_score_codex":0.000009740768,"about_ca_system_score_gemma":0.000008711821,"threshold_uncertainty_score":0.38940337},"labels":[],"label_agreement":null},{"id":"W2399137304","doi":"","title":"A sharp lower bound of index of the cacti with perfect matchings.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Upper and lower bounds; Combinatorics; Computer science; Mathematical analysis","score_opus":0.004872046313962504,"score_gpt":0.1824899825303213,"score_spread":0.1776179362163588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399137304","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.9925372,0.00026894952,0.000012373612,0.000005511175,0.0018174972,0.00011977242,0.0000033915483,0.0000380187,0.0051972866],"genre_scores_gemma":[0.9998777,0.0000020849423,0.000006006709,0.0000059190183,0.000008503698,0.000007974651,4.6982592e-7,0.00002186954,0.000069482536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994112,0.000041641688,0.00015179065,0.00006274714,0.00015686352,0.00017574024],"domain_scores_gemma":[0.9995283,0.000042128726,0.00005777684,0.00030160203,0.000028620523,0.000041610307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022942174,0.000103770806,0.0001707794,0.000032501448,0.000036660167,0.0000072651833,0.00017327924,0.00005553961,0.000035041077],"category_scores_gemma":[0.000009689673,0.00006925304,0.00006428933,0.00019091433,0.000057149486,0.00012289672,0.000024743586,0.0001289968,0.000006419799],"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.00008127608,0.00026033475,0.2353597,0.00043665504,0.00029934014,0.0000020710531,0.004369761,0.0003622395,0.018141173,0.73938555,0.00093429326,0.00036760632],"study_design_scores_gemma":[0.0044959793,0.00057424576,0.5881536,0.0010284245,0.0002636398,0.00014173653,0.0016917684,0.00091665576,0.14578359,0.24830683,0.007398001,0.0012455689],"about_ca_topic_score_codex":0.00004217387,"about_ca_topic_score_gemma":0.0000041969033,"teacher_disagreement_score":0.49107873,"about_ca_system_score_codex":0.00001875201,"about_ca_system_score_gemma":0.000010176323,"threshold_uncertainty_score":0.2824057},"labels":[],"label_agreement":null},{"id":"W2399152852","doi":"","title":"Completing the Spectrum of Resolvable (K 4 -e)-Designs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectrum (functional analysis); Combinatorics; Physics; Quantum mechanics","score_opus":0.016407215714548735,"score_gpt":0.20716864664477389,"score_spread":0.19076143093022516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399152852","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.9644156,0.0012095502,0.00007860945,0.000041176543,0.002618267,0.00014003698,0.0000022974434,0.00014628147,0.031348146],"genre_scores_gemma":[0.9998056,0.000008744044,0.00003226281,0.000013579264,0.00002510916,0.000009800113,0.000001394443,0.000021930968,0.00008152912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.000074573414,0.00019292043,0.00006116018,0.00012364487,0.00029255133],"domain_scores_gemma":[0.9994718,0.00013597548,0.000038745307,0.00028724177,0.000013546952,0.0000526853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754611,0.00009980232,0.00015049479,0.000034892873,0.00008101421,0.000012343043,0.0002041081,0.000044019474,0.000060352017],"category_scores_gemma":[0.000018220728,0.00007686222,0.000057265635,0.00018944411,0.000044343396,0.00009274461,0.000025622669,0.00012540855,0.000066559056],"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.00000463188,0.000027404612,0.007812106,0.000048355632,0.000037980266,5.5818134e-7,0.00064340734,0.00017787173,0.004416707,0.98340786,0.0033465584,0.000076593205],"study_design_scores_gemma":[0.0013556118,0.00014176725,0.027706936,0.00018718108,0.00008387674,0.00003845762,0.0016216263,0.00322299,0.11268247,0.79963607,0.052565902,0.00075712404],"about_ca_topic_score_codex":0.000016006794,"about_ca_topic_score_gemma":9.69964e-7,"teacher_disagreement_score":0.18377176,"about_ca_system_score_codex":0.000018915323,"about_ca_system_score_gemma":0.0000038764597,"threshold_uncertainty_score":0.31343505},"labels":[],"label_agreement":null},{"id":"W2399224012","doi":"","title":"Matroids With Every Two Elements In A 4-Circuit.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.005286969072210409,"score_gpt":0.18507687910867732,"score_spread":0.1797899100364669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399224012","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.9868267,0.00011439155,0.000015144459,0.000008526369,0.00080875005,0.00025380802,0.000001135321,0.00016227654,0.01180923],"genre_scores_gemma":[0.9996368,0.0000041735498,0.000030276102,0.000021919906,0.0000063648763,0.000112009235,0.0000032543903,0.000030265512,0.00015491639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922824,0.000035198515,0.00019867979,0.00012891868,0.00013201493,0.0002769328],"domain_scores_gemma":[0.9996331,0.000025051359,0.000021874825,0.00023373263,0.000021958067,0.000064284985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013634881,0.0001357369,0.00015873926,0.00009168766,0.000027081978,0.0000375989,0.00014884108,0.00004247314,0.000118796874],"category_scores_gemma":[0.0000041065077,0.00012367456,0.000027696766,0.000244831,0.000019109799,0.00020627242,0.000014870335,0.0001330922,0.00032493845],"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.00001713835,0.00015093425,0.20939203,0.00016297227,0.00014672447,0.00004804969,0.000993917,0.0013557567,0.007180077,0.774168,0.004334985,0.0020494],"study_design_scores_gemma":[0.005543376,0.00022981345,0.08340276,0.0002731158,0.000025891663,0.000036885478,0.0006520673,0.0052797394,0.00368322,0.89758664,0.0023701487,0.00091634627],"about_ca_topic_score_codex":0.000077815006,"about_ca_topic_score_gemma":0.00001562538,"teacher_disagreement_score":0.12598927,"about_ca_system_score_codex":0.000050845516,"about_ca_system_score_gemma":0.000007763584,"threshold_uncertainty_score":0.50433016},"labels":[],"label_agreement":null},{"id":"W2399542500","doi":"","title":"Upper Chromatic Number of Steiner Triple Systems.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Steiner system; Discrete mathematics","score_opus":0.004436352990145917,"score_gpt":0.20161704418746057,"score_spread":0.19718069119731466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399542500","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.9702181,0.00013809612,0.00000984722,0.0000048538955,0.009190222,0.00018178335,0.0000059599006,0.00018781403,0.020063316],"genre_scores_gemma":[0.9993552,0.0000034491293,0.00003566321,0.000003682515,0.000020033634,0.00003172185,0.0000038733856,0.00003565337,0.00051070866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991766,0.000039638006,0.00031040382,0.000111204856,0.00016118438,0.0002009204],"domain_scores_gemma":[0.99937695,0.000054874006,0.00005069485,0.00039750594,0.000046747027,0.00007321588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025197468,0.0001415611,0.00027113257,0.000053981563,0.000034679702,0.000022607204,0.00019411226,0.00012197138,0.00016536452],"category_scores_gemma":[0.00002365333,0.00013128885,0.00007998219,0.0001937183,0.000039540384,0.00010370454,0.00001789635,0.00019331295,0.00023673635],"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.000004702473,0.00005132211,0.0077743605,0.00037413204,0.00008232949,0.000004401994,0.00029227452,0.000081846905,0.02955133,0.95845807,0.0032303042,0.00009492856],"study_design_scores_gemma":[0.010384366,0.0003138178,0.031502124,0.0010608246,0.00034236093,0.0004802549,0.0017298496,0.033506114,0.10302637,0.7387272,0.07577901,0.0031477201],"about_ca_topic_score_codex":0.00002361835,"about_ca_topic_score_gemma":0.0000021186243,"teacher_disagreement_score":0.21973087,"about_ca_system_score_codex":0.000012628263,"about_ca_system_score_gemma":0.000009628574,"threshold_uncertainty_score":0.53538036},"labels":[],"label_agreement":null},{"id":"W2399589791","doi":"","title":"Two results on BCI-subset of finite groups.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Brain–computer interface; Psychology; Electroencephalography; Neuroscience","score_opus":0.00852041773830257,"score_gpt":0.21223580436653178,"score_spread":0.20371538662822922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399589791","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.9555675,0.0001244065,0.000009163277,0.000038574843,0.0018019775,0.00010670648,0.000021270618,0.00019151962,0.04213892],"genre_scores_gemma":[0.99980026,0.000012924351,0.000017176966,0.000041530304,0.000013227061,0.0000037386644,0.000014130175,0.000014864605,0.000082144994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992073,0.000042875192,0.00027226075,0.00013482377,0.00015190501,0.0001908448],"domain_scores_gemma":[0.99940336,0.0001103839,0.000045537323,0.00035516376,0.000025742842,0.00005979435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023506573,0.0001344917,0.00019577051,0.00008315298,0.00003311561,0.000011728331,0.00017450265,0.0000650362,0.000010717633],"category_scores_gemma":[0.000039602062,0.00013391298,0.00007172067,0.00022820826,0.000020427038,0.00006738777,0.000007926719,0.00013588628,0.000079600795],"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.00008465709,0.000077908655,0.00014196393,0.00002361863,0.000028091503,0.000011713983,0.00038076556,0.0025853938,0.002027494,0.99053377,0.0030957013,0.00100892],"study_design_scores_gemma":[0.004305799,0.0007027152,0.008586437,0.0002148674,0.000026058002,0.0000059846125,0.00013271523,0.002531448,0.028911266,0.94956994,0.004530146,0.0004826328],"about_ca_topic_score_codex":0.0000052058313,"about_ca_topic_score_gemma":0.0000012204861,"teacher_disagreement_score":0.0442328,"about_ca_system_score_codex":0.000020850155,"about_ca_system_score_gemma":0.0000047277763,"threshold_uncertainty_score":0.5460813},"labels":[],"label_agreement":null},{"id":"W2399649604","doi":"","title":"Pseudo-Complements In Finite Projective Planes.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective test; Pure mathematics; Projective plane; Geometry","score_opus":0.007556754858960246,"score_gpt":0.21333717967388943,"score_spread":0.2057804248149292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399649604","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.9829952,0.000020059622,0.0000054697302,0.0000083030345,0.003760247,0.0002212225,0.000008386045,0.00016341287,0.012817708],"genre_scores_gemma":[0.99978524,0.0000025878394,0.000039145136,0.000012610167,0.00001168226,0.000053809403,0.000010515622,0.00002274957,0.00006167481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.000030711948,0.000185347,0.00013854375,0.00010775609,0.00024204848],"domain_scores_gemma":[0.9996154,0.00007313719,0.000021251228,0.00022230257,0.000017645423,0.000050310355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021352877,0.00012842951,0.00014997067,0.00011587299,0.0000378977,0.000022349825,0.00017108434,0.00008238213,0.000074839234],"category_scores_gemma":[0.000023221437,0.00013248758,0.000032621505,0.00022616971,0.000023549299,0.00009960407,0.000020593532,0.00030854635,0.000117688076],"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.000024982148,0.00012758272,0.06196778,0.000092064634,0.000064010455,0.00004815914,0.0025826795,0.0003444657,0.0122021055,0.91986656,0.0018633943,0.00081619155],"study_design_scores_gemma":[0.003947455,0.00013977052,0.07381539,0.00010547469,0.000020040528,0.000031859636,0.0007766584,0.009024689,0.010112865,0.8835774,0.017505882,0.00094253547],"about_ca_topic_score_codex":0.000038022266,"about_ca_topic_score_gemma":0.00007810891,"teacher_disagreement_score":0.036289208,"about_ca_system_score_codex":0.000021547932,"about_ca_system_score_gemma":0.000009534007,"threshold_uncertainty_score":0.54026866},"labels":[],"label_agreement":null},{"id":"W2399766084","doi":"","title":"On (64, 28, 12) Difference Sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00696582238213507,"score_gpt":0.18579112621530564,"score_spread":0.17882530383317058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399766084","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.9699549,0.000088011635,0.0000091369975,0.000027788165,0.0028404077,0.00017099315,0.0000022669774,0.00033241193,0.026574051],"genre_scores_gemma":[0.9993269,0.00000854023,0.000009664095,0.000051437797,0.0000052672017,0.000060877977,0.000003756413,0.000027703607,0.0005058534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992961,0.000037054062,0.00014948407,0.00014022614,0.00013227545,0.0002448113],"domain_scores_gemma":[0.9994609,0.00008413087,0.000018826242,0.00032074848,0.000021382119,0.000094060626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007573509,0.00015263603,0.00015639146,0.00005377374,0.000056528403,0.000046574736,0.00019849843,0.00008220862,0.00022725681],"category_scores_gemma":[0.000016994923,0.00013973303,0.000052429452,0.00010253195,0.000024507528,0.000083388506,0.000019011537,0.00016196215,0.0013367491],"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.0000032588307,0.00004131764,0.0010562246,0.00004051006,0.00003338044,0.0000045292372,0.00031550063,0.0001226957,0.0025171565,0.98266613,0.011571384,0.0016278826],"study_design_scores_gemma":[0.0004191149,0.00007690484,0.014194001,0.000052026266,0.000006407305,0.000003682938,0.00006745016,0.0018249942,0.002346256,0.97981524,0.00093621004,0.00025772408],"about_ca_topic_score_codex":0.000017580818,"about_ca_topic_score_gemma":0.0000015346322,"teacher_disagreement_score":0.029371966,"about_ca_system_score_codex":0.000028292061,"about_ca_system_score_gemma":0.000004015011,"threshold_uncertainty_score":0.99944085},"labels":[],"label_agreement":null},{"id":"W2399847103","doi":"","title":"On The Possible Automorphisms Of A 3-(16, 7, 5) Design.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Pure mathematics","score_opus":0.009452743701632764,"score_gpt":0.19324766696118817,"score_spread":0.1837949232595554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399847103","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.984426,0.000046261313,0.00014735431,0.000050693005,0.0032412452,0.00018126743,0.0000026440207,0.00016434683,0.011740169],"genre_scores_gemma":[0.9997301,0.0000021470466,0.00005793171,0.00002393807,0.0000068094505,0.000025329413,8.8420666e-7,0.000022080189,0.00013079715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994085,0.000054545908,0.00015517334,0.00008925612,0.00013206183,0.00016045738],"domain_scores_gemma":[0.9992457,0.000269904,0.0000323734,0.0003802286,0.00002796039,0.000043835476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041042152,0.00010882005,0.0001327971,0.00004919076,0.00006138032,0.000017577266,0.00025332932,0.000079610036,0.0001638974],"category_scores_gemma":[0.00004754906,0.00007829416,0.000058390724,0.0001873484,0.00005930417,0.000043711287,0.000014093358,0.00024306343,0.00009405541],"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.0000066609896,0.000028779818,0.000103558086,0.000013892536,0.000026419226,0.0000018318558,0.00015938483,0.00022821134,0.025021192,0.9692312,0.004980332,0.00019856311],"study_design_scores_gemma":[0.00030193053,0.000083230225,0.0004508269,0.000027430591,0.000009903219,0.0000057498532,0.000035822595,0.0018106343,0.087913916,0.90840113,0.0008433989,0.00011603411],"about_ca_topic_score_codex":0.000007527014,"about_ca_topic_score_gemma":0.0000020160744,"teacher_disagreement_score":0.06289273,"about_ca_system_score_codex":0.000011671919,"about_ca_system_score_gemma":0.000011066288,"threshold_uncertainty_score":0.3192743},"labels":[],"label_agreement":null},{"id":"W2400004606","doi":"","title":"G-decomposition of λK v , where G has six vertices and nine edges.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Combinatorics; Chemistry","score_opus":0.006533967915192315,"score_gpt":0.2028833834597192,"score_spread":0.1963494155445269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400004606","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.99397624,0.00057929754,0.000011399512,0.000038344864,0.0024316304,0.000077144054,0.000003060002,0.000098368844,0.0027845274],"genre_scores_gemma":[0.9998368,0.000022343163,0.00005242533,0.000004467803,0.000013038046,0.000006965044,0.000003142946,0.000016020407,0.000044822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.000019047457,0.00015106189,0.000092618466,0.00007685119,0.00011710405],"domain_scores_gemma":[0.9996647,0.00004845523,0.000028258886,0.00017379913,0.000029663785,0.000055108685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001256053,0.00009365587,0.0001422051,0.000044908145,0.000050505645,0.000027238711,0.00009064496,0.000080686055,0.00005608143],"category_scores_gemma":[0.0000095995965,0.00009364344,0.000029892055,0.000089269,0.00006335663,0.00011888964,0.000016765169,0.00013992401,0.000015242755],"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.000022523122,0.000077661105,0.009472399,0.00032706882,0.00008555816,0.0000056789568,0.00078176335,0.00009245078,0.4380256,0.54611105,0.0030530368,0.0019452211],"study_design_scores_gemma":[0.005042026,0.00046424722,0.06298391,0.0004637564,0.00018816095,0.00009048164,0.00054933137,0.0061027887,0.41568634,0.4594118,0.047709744,0.0013074038],"about_ca_topic_score_codex":0.000016125794,"about_ca_topic_score_gemma":0.000019562569,"teacher_disagreement_score":0.08669924,"about_ca_system_score_codex":0.000005269423,"about_ca_system_score_gemma":0.0000048230045,"threshold_uncertainty_score":0.38186684},"labels":[],"label_agreement":null},{"id":"W2400293693","doi":"10.37236/5714","title":"Embedding Factorizations for 3-Uniform Hypergraphs II: $r$-Factorizations into $s$-Factorizations","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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":"Hypergraph; Mathematics; Embedding; Combinatorics; Factorization; Discrete mathematics; Computer science; Algorithm","score_opus":0.005711901721585466,"score_gpt":0.2157531010495806,"score_spread":0.21004119932799512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400293693","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.17310512,0.0010524656,0.8213871,0.0004548714,0.0029828625,0.00035683895,0.000023688015,0.00015317793,0.00048386503],"genre_scores_gemma":[0.9983751,0.00078236597,0.000048104706,0.000012665635,0.00025501012,0.000024748255,0.0000068905683,0.000065372515,0.00042970566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982501,0.00007262567,0.00063675584,0.00012243896,0.00031924673,0.00059882726],"domain_scores_gemma":[0.99838525,0.00045608648,0.00026794328,0.00033202578,0.00043004632,0.000128647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750144,0.00024831368,0.0003197212,0.00028153436,0.0006398505,0.000054367374,0.0005825746,0.00012857863,0.000024904684],"category_scores_gemma":[0.0002112097,0.00015410547,0.00024829805,0.00077028567,0.0000657699,0.0004629244,0.00003241475,0.00033418337,0.000005135156],"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.000015501808,0.00006686264,0.00038899353,0.000027790766,0.00026224786,5.237944e-7,0.0009422198,0.0030594775,0.0120595945,0.98218435,0.00052501506,0.0004673996],"study_design_scores_gemma":[0.001381388,0.0005492871,0.0001358144,0.00011230974,0.00018902512,0.000056183908,0.0003722593,0.0016009241,0.008140586,0.9472832,0.03978532,0.0003936809],"about_ca_topic_score_codex":0.0000017000498,"about_ca_topic_score_gemma":0.0000066410303,"teacher_disagreement_score":0.82527,"about_ca_system_score_codex":0.00040602213,"about_ca_system_score_gemma":0.00021582823,"threshold_uncertainty_score":0.62842387},"labels":[],"label_agreement":null},{"id":"W2400588332","doi":"","title":"Cycle-Partitions with Specified Vertices and Edges.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006877211193968934,"score_gpt":0.18494699605143108,"score_spread":0.17806978485746214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400588332","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.97970766,0.0003923889,0.000028571227,0.00007458296,0.00048049944,0.00008142979,0.0000015771287,0.00021823675,0.019015059],"genre_scores_gemma":[0.99983,0.000027561691,0.00003602584,0.00003446954,0.000010106254,0.000007032359,0.0000021556032,0.000010724617,0.000041917163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956787,0.000015409829,0.00009392891,0.00009953515,0.000072998584,0.00015028018],"domain_scores_gemma":[0.9997297,0.000023402199,0.000008572178,0.00015317068,0.0000149034,0.00007028728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058517755,0.00009510747,0.00010774125,0.000038336464,0.00006710363,0.000037528407,0.000065589,0.000038252947,0.00001515587],"category_scores_gemma":[0.000003622619,0.000084612606,0.000017241431,0.00012418958,0.000030116898,0.00012432224,0.0000047965927,0.000078882615,0.000025755871],"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.00002420626,0.000053985405,0.0010598231,0.000028099379,0.000043071155,0.000017632065,0.00043178527,0.00039108435,0.002646613,0.990788,0.0024387105,0.0020770347],"study_design_scores_gemma":[0.0013615901,0.00035454132,0.051278297,0.00010396736,0.000057384863,0.000045773522,0.00025753235,0.00092568155,0.011995053,0.91870487,0.014364685,0.0005506572],"about_ca_topic_score_codex":0.0000016268053,"about_ca_topic_score_gemma":0.0000020936318,"teacher_disagreement_score":0.072083116,"about_ca_system_score_codex":0.0000110617075,"about_ca_system_score_gemma":0.0000030879614,"threshold_uncertainty_score":0.3450402},"labels":[],"label_agreement":null},{"id":"W2400596871","doi":"10.5539/jmr.v8n3p61","title":"Computing of Z- valued Characters for the Projective Special Linear Group L2 (2m) and the Conway Group Co3","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjugacy class; Combinatorics; Group (periodic table); Special linear group; Classical group; Geometry; Lie group; Physics; Quantum mechanics","score_opus":0.06065161417579506,"score_gpt":0.32683807242058566,"score_spread":0.2661864582447906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400596871","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.91510344,0.0006105272,0.08030752,0.0005539102,0.0008436142,0.0016438572,0.000018436122,0.00001846224,0.0009002066],"genre_scores_gemma":[0.9978492,0.00011062646,0.0009933084,0.000005305742,0.000942517,0.000013999275,2.0748877e-7,0.000023217382,0.00006159201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998368,0.0002597881,0.0005350755,0.000069511356,0.0005211266,0.00024645656],"domain_scores_gemma":[0.9944638,0.0047671124,0.00021875846,0.00018213801,0.00031599784,0.000052174008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008702633,0.00010007786,0.0003315031,0.0001396302,0.00016667071,0.000045320536,0.00035912212,0.000055837012,0.000012133417],"category_scores_gemma":[0.00060272164,0.00004157768,0.00014140703,0.00015753137,0.00037548566,0.00009401082,0.000057594007,0.00031958442,0.0000030083331],"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.0021555678,0.0005348691,0.00041511434,0.003613185,0.0024414903,0.000025219897,0.054372266,0.00040481586,0.06832139,0.8370349,0.004799939,0.025881253],"study_design_scores_gemma":[0.043764032,0.0040768227,0.0049364613,0.0096559,0.0007037852,0.0014609344,0.075234726,0.36339054,0.046553183,0.43276164,0.016049882,0.0014121113],"about_ca_topic_score_codex":0.000002141523,"about_ca_topic_score_gemma":0.000002174813,"teacher_disagreement_score":0.40427324,"about_ca_system_score_codex":0.000039534265,"about_ca_system_score_gemma":0.000023471179,"threshold_uncertainty_score":0.30161762},"labels":[],"label_agreement":null},{"id":"W2400633270","doi":"","title":"Decomposition of complete graphs into paths of length three and triangles","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Combinatorics; Chemistry","score_opus":0.01051958680036838,"score_gpt":0.21637391656786814,"score_spread":0.20585432976749976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400633270","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.9960558,0.0017788503,0.00008315065,0.000004169459,0.0009806475,0.000116914096,0.000007970736,0.000049876635,0.00092264713],"genre_scores_gemma":[0.99980706,0.00003169717,0.00012369684,0.0000024101264,0.000005691868,0.000007716375,0.0000056291756,0.000014551086,0.0000015328344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942195,0.000043691318,0.00023577466,0.000065527245,0.0000936086,0.00013944172],"domain_scores_gemma":[0.99960786,0.00008332614,0.000057849225,0.00016321303,0.000029173725,0.000058549893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024831758,0.0000980538,0.0002243609,0.00008442364,0.000030697658,0.000004723137,0.00008149539,0.000058519177,0.000008231176],"category_scores_gemma":[0.000008988887,0.00009677331,0.000055467426,0.00013614721,0.000058112073,0.00012676902,0.000018966748,0.000061347986,0.0000030821373],"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.00002059699,0.000066127795,0.028895754,0.00024098842,0.00007802044,4.807015e-7,0.0010484679,0.000018361665,0.036326207,0.9316891,0.00008931779,0.0015266048],"study_design_scores_gemma":[0.0015750575,0.00017833083,0.06575201,0.00015093749,0.00006429013,0.000009716816,0.00030508885,0.00074170996,0.03614624,0.8943955,0.0004055441,0.00027559645],"about_ca_topic_score_codex":0.000023108523,"about_ca_topic_score_gemma":0.0000050733584,"teacher_disagreement_score":0.03729359,"about_ca_system_score_codex":0.000009139341,"about_ca_system_score_gemma":0.0000025768004,"threshold_uncertainty_score":0.3946301},"labels":[],"label_agreement":null},{"id":"W2400734371","doi":"","title":"The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.004876077485805058,"score_gpt":0.2126831161420811,"score_spread":0.20780703865627603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400734371","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.9946683,0.0002567073,0.00006559614,0.00005193574,0.0006522541,0.00016954872,0.0000023242658,0.000057142308,0.00407618],"genre_scores_gemma":[0.99984765,0.000023408666,0.000029251527,0.000006498779,0.000004652667,0.000013280048,0.0000021317524,0.000006559209,0.00006659502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966896,0.00001831308,0.00012067083,0.00005323932,0.000048036803,0.00009081227],"domain_scores_gemma":[0.9996507,0.0001631659,0.000023953036,0.000104066894,0.000037842627,0.000020281179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013476335,0.000057435223,0.00008806826,0.000014181975,0.000060009188,0.0000135217315,0.00006156382,0.00003786163,0.0000022501067],"category_scores_gemma":[0.000033454915,0.00004470906,0.000027384807,0.000073982046,0.00002225112,0.000043983706,0.0000031875054,0.000032942567,0.0000020163723],"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.000016425241,0.00000990188,0.00024787599,0.000016633723,0.000015951544,1.7956481e-7,0.00015098238,0.00000987514,0.0026923397,0.9892275,0.00081240415,0.0067999824],"study_design_scores_gemma":[0.0011046521,0.00007243598,0.008729811,0.000021542153,0.000015901374,0.000004888581,0.00011742087,0.0026894803,0.010610618,0.973711,0.0028182897,0.00010392403],"about_ca_topic_score_codex":0.0000010620655,"about_ca_topic_score_gemma":0.0000017007526,"teacher_disagreement_score":0.0155164115,"about_ca_system_score_codex":0.0000072169964,"about_ca_system_score_gemma":0.0000024074723,"threshold_uncertainty_score":0.18231826},"labels":[],"label_agreement":null},{"id":"W2400888710","doi":"","title":"Some Classes of Extended Directed Triple Systems and Numbers of Common Blocks.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.005291433470263331,"score_gpt":0.20412562834629888,"score_spread":0.19883419487603554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400888710","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.9920422,0.0009730656,0.0000010964342,0.000003666807,0.0045059975,0.0001859261,0.000014071767,0.00017585063,0.0020981373],"genre_scores_gemma":[0.9998085,0.000038959475,0.000016431999,0.0000014974297,0.00001273109,0.000014900343,0.000004287653,0.000023556275,0.00007912949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991852,0.000053802112,0.000344263,0.00011727381,0.00013808324,0.00016138834],"domain_scores_gemma":[0.999364,0.00011746424,0.00009223286,0.00030208562,0.00005378442,0.00007042725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023494055,0.00013544536,0.00037589303,0.00008855722,0.000031841024,0.000013467903,0.00014595667,0.00012744746,0.000008880608],"category_scores_gemma":[0.00002988484,0.0001335271,0.000054164884,0.00019055893,0.00009067898,0.00010222727,0.000022688431,0.00017689264,0.0000021879232],"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.000027659293,0.00014232997,0.009923121,0.00056764274,0.00016161523,0.0000048035163,0.00047407806,0.00006794282,0.14993536,0.8372258,0.0012432548,0.0002263633],"study_design_scores_gemma":[0.007981904,0.0005674218,0.06562209,0.00076362374,0.00029643142,0.00011654098,0.0017730986,0.017341392,0.30658397,0.59072125,0.0066760117,0.0015562592],"about_ca_topic_score_codex":0.00010130768,"about_ca_topic_score_gemma":0.00001622997,"teacher_disagreement_score":0.24650456,"about_ca_system_score_codex":0.0000090797475,"about_ca_system_score_gemma":0.00000956091,"threshold_uncertainty_score":0.5445077},"labels":[],"label_agreement":null},{"id":"W2400973841","doi":"","title":"Multidecomposition of K n - F into Graph-Pairs of Order 5 where F is a Hamilton Cycle or an (almost) 1-Factor.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Factor (programming language); Order (exchange); Graph; Hamiltonian path; Discrete mathematics; Computer science","score_opus":0.00560351716376274,"score_gpt":0.22408171926445875,"score_spread":0.21847820210069602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400973841","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.99691606,0.00009918699,0.00004302467,0.000009392916,0.0020110847,0.00019373013,0.000020309119,0.00014100384,0.0005662129],"genre_scores_gemma":[0.9994372,0.000022450107,0.0004281061,0.000008048236,0.000009791237,0.000015145981,0.000010622387,0.000040140087,0.000028483262],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990185,0.000055571636,0.000373371,0.00017834853,0.00018214568,0.00019210187],"domain_scores_gemma":[0.99914205,0.00006598526,0.000095168165,0.0004692013,0.00012791943,0.00009969713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017217177,0.00018370179,0.00030352332,0.00013155305,0.000046452817,0.000014140426,0.0002406273,0.00017051457,0.00020301456],"category_scores_gemma":[0.000017260989,0.00016996863,0.00009218449,0.0003768123,0.000080214304,0.00025461247,0.000019479987,0.00021065594,0.000012550879],"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.00017518106,0.0005387539,0.01595066,0.00088009256,0.00023978078,0.000011089726,0.013525145,0.00045099048,0.8418729,0.1231889,0.0007211349,0.0024454081],"study_design_scores_gemma":[0.0044259867,0.0010639594,0.02605586,0.0004419212,0.0001097519,0.000033520384,0.001612279,0.012988835,0.6222923,0.32676917,0.0030218158,0.001184589],"about_ca_topic_score_codex":0.00022878505,"about_ca_topic_score_gemma":0.00017756388,"teacher_disagreement_score":0.21958056,"about_ca_system_score_codex":0.000014711681,"about_ca_system_score_gemma":0.000017977543,"threshold_uncertainty_score":0.69311196},"labels":[],"label_agreement":null},{"id":"W2401118672","doi":"","title":"Second factorization of the Generalized Lah Matrix.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Pure mathematics; Matrix (chemical analysis); Algorithm; Chemistry","score_opus":0.004399444064054874,"score_gpt":0.19392166254814738,"score_spread":0.1895222184840925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401118672","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.9880911,0.000048993687,0.000033913555,0.000008680932,0.00751042,0.00010758413,0.0000075854973,0.000082458726,0.004109231],"genre_scores_gemma":[0.9996056,0.000002231665,0.000020756219,0.00000574185,0.000013208054,0.0000070464193,0.0000029347596,0.000016644733,0.00032584308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.00003073651,0.00015077193,0.00006645305,0.00009438476,0.000103539314],"domain_scores_gemma":[0.99960136,0.00002592197,0.000036575577,0.0002781571,0.00002944045,0.00002852977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011438087,0.00007945712,0.00010742514,0.000027829596,0.000041833977,0.000012354663,0.00018187241,0.00008008089,0.0001782674],"category_scores_gemma":[0.00001533646,0.0000609121,0.000058838425,0.00015991465,0.000026584425,0.000060473856,0.000017569913,0.00014275959,0.0000148001145],"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.0000020207003,0.000010770084,0.0042138644,0.000036668025,0.000019965373,2.4987688e-7,0.00019209328,0.00007236055,0.20639934,0.7882426,0.0007551146,0.000054991702],"study_design_scores_gemma":[0.0011293984,0.000024906823,0.020863922,0.000025352012,0.00002546613,0.000007354142,0.000053560787,0.0012368369,0.34505364,0.60752773,0.02376514,0.000286701],"about_ca_topic_score_codex":0.0000046541245,"about_ca_topic_score_gemma":0.000011718521,"teacher_disagreement_score":0.18071485,"about_ca_system_score_codex":0.000007116845,"about_ca_system_score_gemma":0.000007098362,"threshold_uncertainty_score":0.24839234},"labels":[],"label_agreement":null},{"id":"W2401158721","doi":"10.46298/dmtcs.604","title":"Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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 Winnipeg","funders":"","keywords":"Combinatorics; Hypergraph; Partition (number theory); Mathematics; Multipartite; Vertex (graph theory); Permutation (music); Discrete mathematics; Graph; Physics","score_opus":0.01190850429495624,"score_gpt":0.21350294115809273,"score_spread":0.2015944368631365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401158721","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.79739195,0.00009485859,0.19330108,0.00009986814,0.00028471995,0.0005298632,0.00004943504,0.00024275099,0.00800546],"genre_scores_gemma":[0.96762246,0.000017632365,0.03218923,0.00005168999,0.00003401105,0.000047830275,0.000004931567,0.000028014081,0.000004179772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979911,0.00005309363,0.0005952052,0.00034848182,0.00044731385,0.0005648016],"domain_scores_gemma":[0.9985298,0.00029852343,0.00008805373,0.0006263836,0.00014285096,0.00031439666],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00057923264,0.00029053242,0.00045759426,0.00024948758,0.00029068053,0.00019538755,0.00064554845,0.00006773184,0.00013346171],"category_scores_gemma":[0.000038258957,0.00023399823,0.000133449,0.0007212046,0.0032891391,0.0003736262,0.00020752496,0.00018157736,0.000089304514],"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.0000020787977,0.000046009725,0.00015821561,0.00018656705,0.000029587076,0.0000015317299,0.0010315714,0.00047411877,0.030081978,0.9674153,0.000037483776,0.0005355619],"study_design_scores_gemma":[0.00026949195,0.00009585335,0.0013135625,0.00016622449,0.00002997766,0.000041318464,0.00021891299,0.62631065,0.001990179,0.36913002,0.00008595635,0.00034785926],"about_ca_topic_score_codex":0.000006645597,"about_ca_topic_score_gemma":0.000001877848,"teacher_disagreement_score":0.62583655,"about_ca_system_score_codex":0.000013139678,"about_ca_system_score_gemma":0.000011323269,"threshold_uncertainty_score":0.9994233},"labels":[],"label_agreement":null},{"id":"W2401163254","doi":"","title":"On Schematic Orthogonal Arrays of Strength Two.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Schematic; Mathematics; Electrical engineering; Engineering","score_opus":0.0061459938701997185,"score_gpt":0.20747073878517822,"score_spread":0.2013247449149785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401163254","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.9785847,0.00008570339,0.000056307093,0.000010222977,0.0008998696,0.000087951346,0.0000029286637,0.00013838058,0.02013395],"genre_scores_gemma":[0.9998277,0.0000033202987,0.00008827923,0.000017673805,0.0000072944677,0.0000044926346,0.0000036829488,0.000013001123,0.00003455755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993384,0.0000287907,0.0002164775,0.000098235774,0.00015571712,0.00016237092],"domain_scores_gemma":[0.9995621,0.00007224064,0.000037042926,0.00024994076,0.00002254212,0.000056176992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001452547,0.00012273544,0.00019757044,0.000069240996,0.000028275215,0.000009254179,0.00013358517,0.000048285925,0.000044365825],"category_scores_gemma":[0.000023695517,0.000118359465,0.00006903869,0.00017470424,0.000018394756,0.000055938996,0.0000051200477,0.00012215921,0.000050797917],"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.000007816263,0.00007216293,0.00010505125,0.000042452768,0.000025152223,0.00000339005,0.00012384939,0.0010836257,0.0033819906,0.9941179,0.00047576436,0.00056085404],"study_design_scores_gemma":[0.000753427,0.0001638366,0.0007355191,0.00012718524,0.0000126036775,0.0000038461476,0.00004686604,0.0022297234,0.020747086,0.9749008,0.000110146735,0.00016899608],"about_ca_topic_score_codex":7.878174e-7,"about_ca_topic_score_gemma":3.8626516e-7,"teacher_disagreement_score":0.021243012,"about_ca_system_score_codex":0.000016216029,"about_ca_system_score_gemma":0.0000067318874,"threshold_uncertainty_score":0.4826559},"labels":[],"label_agreement":null},{"id":"W2401272786","doi":"","title":"A family of tetravalent Frobenius graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006307893223515486,"score_gpt":0.1901866286951752,"score_spread":0.1838787354716597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401272786","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.9807511,0.0011703641,0.000023633249,0.000008925581,0.0016093114,0.00010725745,0.000004204492,0.00020275064,0.016122473],"genre_scores_gemma":[0.9998289,0.000046161807,0.000036151872,0.00002364665,0.0000042134884,0.0000045824445,0.000002361029,0.000013965896,0.00004003107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993132,0.000026027243,0.00022806301,0.00010647839,0.00014108402,0.00018519332],"domain_scores_gemma":[0.99959433,0.00002473769,0.000029708697,0.00025956318,0.000029609795,0.00006205078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001312779,0.0001242012,0.00020025544,0.00009463704,0.00002682993,0.000009800644,0.00016844556,0.00007118201,0.000014199845],"category_scores_gemma":[0.000007207273,0.00012492694,0.000093514405,0.0002517238,0.000024251933,0.00006347729,0.0000068396776,0.00010379947,0.000024834955],"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.000009623813,0.00007315912,0.0011121302,0.000045764926,0.000043442975,0.000007380624,0.0002544333,0.00021142706,0.033503324,0.960273,0.0023942909,0.0020720165],"study_design_scores_gemma":[0.0008511936,0.00020157862,0.039161406,0.00007717419,0.000024941499,0.000006302168,0.000119076045,0.00041758912,0.020941895,0.9363481,0.0015699903,0.00028075709],"about_ca_topic_score_codex":0.0000069491653,"about_ca_topic_score_gemma":4.7585732e-7,"teacher_disagreement_score":0.038049277,"about_ca_system_score_codex":0.0000147714445,"about_ca_system_score_gemma":0.000005510543,"threshold_uncertainty_score":0.50943726},"labels":[],"label_agreement":null},{"id":"W2401422031","doi":"","title":"Maximum packing of dt - p and dtu p with mendelsohn triples","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006313744226266193,"score_gpt":0.18564042764562397,"score_spread":0.17932668341935779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401422031","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.98964447,0.00064039626,0.000049498674,0.00002059871,0.00036522787,0.00009569578,0.0000021527915,0.00011694139,0.009065024],"genre_scores_gemma":[0.99983907,0.000030241825,0.00006507627,0.000010856576,0.000004777938,0.0000034411396,0.0000016651971,0.000013426339,0.000031473006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994743,0.000022263563,0.00014836034,0.00010132973,0.00010220705,0.00015153573],"domain_scores_gemma":[0.9997034,0.000029813193,0.000031128267,0.0001639118,0.000021360149,0.000050408573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013073006,0.000112075635,0.00018391116,0.000059588445,0.00003514913,0.000015909942,0.00007896556,0.00004963764,0.000007955759],"category_scores_gemma":[0.0000055302744,0.00009700885,0.000025148236,0.00014779858,0.000029637338,0.00009317398,0.000007111087,0.000079129066,0.000002517402],"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.000041902695,0.000049290207,0.0033600405,0.000103727165,0.000079608464,0.0000155788,0.00090004224,0.00021912702,0.0077620354,0.981666,0.00039729042,0.0054053166],"study_design_scores_gemma":[0.0020962243,0.0004876757,0.014153442,0.00021810518,0.00005022213,0.00004072571,0.0005180538,0.0008891155,0.025479065,0.9538325,0.0018052192,0.00042964894],"about_ca_topic_score_codex":0.0000037865489,"about_ca_topic_score_gemma":0.0000014025878,"teacher_disagreement_score":0.027833538,"about_ca_system_score_codex":0.000010474961,"about_ca_system_score_gemma":0.000004968676,"threshold_uncertainty_score":0.39559063},"labels":[],"label_agreement":null},{"id":"W2401510322","doi":"","title":"Multidecomposition of the complete graph into graph pairs of order 4 with various leaves.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.005079587936764796,"score_gpt":0.18563951893260772,"score_spread":0.18055993099584292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401510322","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.99685836,0.0002023645,0.00040469985,0.000041832838,0.00068724295,0.00023900658,0.0000060174007,0.00009397245,0.0014665122],"genre_scores_gemma":[0.99969745,0.000011508693,0.00022662614,0.000022782593,0.0000034317666,0.0000070804035,0.0000042081097,0.000018021288,0.00000887009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991373,0.000077544595,0.0002937263,0.00012746087,0.0001971468,0.00016683273],"domain_scores_gemma":[0.9993237,0.00005162194,0.00009836666,0.00038608487,0.00009646067,0.000043717282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016465738,0.00015823886,0.00026426898,0.00010150343,0.000070816175,0.000008952199,0.00024500064,0.000068668494,0.0000076049937],"category_scores_gemma":[0.000008308647,0.000116535026,0.00010264387,0.00060596614,0.000105988634,0.00008075407,0.000015054198,0.0001412433,0.0000024392607],"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.00010520559,0.00030034874,0.0101240445,0.00027242428,0.00027611322,0.000006491152,0.002872243,0.011125399,0.074419096,0.8986503,0.0006852568,0.0011631157],"study_design_scores_gemma":[0.0025161905,0.0005884294,0.06983964,0.00038399044,0.000103489634,0.000023039878,0.00035527788,0.0019789012,0.047979157,0.8754831,0.00027861228,0.00047017308],"about_ca_topic_score_codex":0.00006599126,"about_ca_topic_score_gemma":0.000016464031,"teacher_disagreement_score":0.0597156,"about_ca_system_score_codex":0.000016688804,"about_ca_system_score_gemma":0.000011560541,"threshold_uncertainty_score":0.47521603},"labels":[],"label_agreement":null},{"id":"W2401528282","doi":"","title":"The Triangle Intersection Problem For Hexagon Triple Systems","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Mathematics; Combinatorics; Geography; Cartography","score_opus":0.016411030033308262,"score_gpt":0.19598029637701728,"score_spread":0.179569266343709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401528282","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.9100449,0.0020408928,0.0012720557,0.000020751073,0.03959352,0.0022980587,0.000013602518,0.0008862706,0.043829933],"genre_scores_gemma":[0.99881935,0.000013045084,0.00001931664,0.0000032127175,0.000025881893,0.00037834616,0.0000035129967,0.000031597778,0.0007057123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992554,0.00006307192,0.00025353956,0.00011765228,0.00007776506,0.00023252665],"domain_scores_gemma":[0.99952435,0.000093767805,0.000048196314,0.0002390645,0.00004546435,0.000049133527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054962223,0.000120196826,0.00015791366,0.000046240308,0.00017515589,0.000052147163,0.00018629349,0.0000768421,0.0000055745136],"category_scores_gemma":[0.000022075412,0.00009110913,0.00009641737,0.0001407099,0.000024307836,0.000102924205,0.000011675802,0.0000921116,0.0000303397],"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.00007667753,0.000032555956,0.00010253408,0.00011372226,0.000092211456,9.82005e-7,0.0011360123,0.000057844532,0.0006710467,0.9892091,0.0075139576,0.0009933538],"study_design_scores_gemma":[0.004075304,0.00067724264,0.00033062365,0.0001927807,0.000086967564,0.000033004853,0.0037737219,0.012366958,0.013098319,0.8426178,0.12209717,0.0006501004],"about_ca_topic_score_codex":0.00003429636,"about_ca_topic_score_gemma":0.000009063336,"teacher_disagreement_score":0.1465913,"about_ca_system_score_codex":0.000053008804,"about_ca_system_score_gemma":0.000007913063,"threshold_uncertainty_score":0.37153223},"labels":[],"label_agreement":null},{"id":"W2401554060","doi":"","title":"On the Existence of Simple 3-(30, 7, 15) and 3-(26, 12, 55) Designs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Epistemology; Philosophy","score_opus":0.0130907199409047,"score_gpt":0.2059037535218716,"score_spread":0.1928130335809669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401554060","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.99102855,0.00008914178,0.000013310777,0.000021186657,0.0012499607,0.00014263214,0.0000029507596,0.000110209236,0.0073420824],"genre_scores_gemma":[0.9998532,0.000007965944,0.000017887258,0.00002651126,0.000007807356,0.000016449476,6.7469523e-7,0.00002401887,0.000045508816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940467,0.000044542638,0.00015717096,0.00011199193,0.00011803282,0.00016357865],"domain_scores_gemma":[0.99924594,0.00030187273,0.000033637436,0.00034102754,0.000023655906,0.0000538684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003250934,0.000116434865,0.00014420308,0.00003484028,0.000071491486,0.000021499469,0.00019605365,0.000074736556,0.00010341469],"category_scores_gemma":[0.00006589611,0.00008697298,0.000039152477,0.00009595222,0.000086383305,0.0000514007,0.000022702985,0.00021479663,0.00005566705],"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.000005082284,0.00002356847,0.0006735906,0.00003095767,0.000020680809,0.0000022454833,0.0003276498,0.000024508814,0.017100107,0.9796393,0.0018152102,0.00033708665],"study_design_scores_gemma":[0.00036086512,0.00007225655,0.003451194,0.000030896652,0.000012551449,0.000006940276,0.00015416725,0.00067428267,0.025616884,0.9675744,0.0018715686,0.00017398884],"about_ca_topic_score_codex":0.000011131196,"about_ca_topic_score_gemma":0.0000057172438,"teacher_disagreement_score":0.012064908,"about_ca_system_score_codex":0.0000057348925,"about_ca_system_score_gemma":0.000006608711,"threshold_uncertainty_score":0.35466552},"labels":[],"label_agreement":null},{"id":"W2401555278","doi":"","title":"Decompositions of K v into the graphs with 7 points, 7 edges and a 5-circle.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0048980743361482035,"score_gpt":0.19031999350587436,"score_spread":0.18542191916972617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401555278","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.9956528,0.0015917693,0.00004389078,0.00004940028,0.000598898,0.00010105927,0.0000015831448,0.00006449476,0.001896124],"genre_scores_gemma":[0.9998379,0.00003067992,0.00007026511,0.000012716618,0.0000054634734,0.000019013318,0.0000016013126,0.000014190667,0.000008191541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957997,0.000039645744,0.00010653151,0.00005744984,0.000073522344,0.00014286186],"domain_scores_gemma":[0.9996394,0.000075574026,0.000022241644,0.00018480328,0.000020906135,0.0000570912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017860561,0.000079810925,0.00010945098,0.000044117063,0.000079792044,0.000011706447,0.00008899785,0.000034180695,0.000007020422],"category_scores_gemma":[0.0000044479452,0.00005845441,0.00002687869,0.00016260365,0.0000831468,0.00011298816,0.000015844114,0.000080728234,0.0000066253992],"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.000008614064,0.000044212255,0.01440778,0.000067221314,0.00008899072,6.1716196e-7,0.0030578393,0.000017144604,0.0016290213,0.9790671,0.00029840597,0.0013130405],"study_design_scores_gemma":[0.0010813063,0.00016287388,0.10268876,0.00017331362,0.00010763959,0.000059608203,0.0016545731,0.00011908293,0.031394836,0.85946006,0.002718533,0.0003794272],"about_ca_topic_score_codex":0.000013286384,"about_ca_topic_score_gemma":0.0000042700963,"teacher_disagreement_score":0.11960707,"about_ca_system_score_codex":0.0000069531247,"about_ca_system_score_gemma":0.0000030777894,"threshold_uncertainty_score":0.23837017},"labels":[],"label_agreement":null},{"id":"W2401576146","doi":"","title":"A computer search for minimal blocking sets in PG(2, q).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Blocking (statistics); Mathematics; Blocking effect; Arithmetic; Statistics; Psychology","score_opus":0.00934692375478404,"score_gpt":0.22786158629401482,"score_spread":0.21851466253923077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401576146","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.9950329,0.000031432122,0.00006964962,0.000019472887,0.0032654214,0.00024902218,0.0000035889245,0.00013899089,0.0011895434],"genre_scores_gemma":[0.9994976,0.0000011183658,0.00034963657,0.000015183178,0.000031414915,0.000045631416,0.000004914262,0.00003007613,0.000024430474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992459,0.000025462701,0.00018124894,0.00014950338,0.000098901255,0.00029899043],"domain_scores_gemma":[0.99956757,0.00012325154,0.000013025727,0.00020243993,0.000029594148,0.000064121596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628393,0.000118830074,0.00016303714,0.00010671598,0.000047108086,0.000035994985,0.00017955746,0.00010967923,0.000017560773],"category_scores_gemma":[0.000007617441,0.00012692114,0.0000575968,0.00016049788,0.000024933997,0.00007526008,0.000027085502,0.00026651518,0.000027961129],"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.00004548149,0.00013241413,0.024893846,0.000277966,0.000066495806,0.00002964358,0.0020336497,0.0012030643,0.018517125,0.9433303,0.0029970298,0.0064729657],"study_design_scores_gemma":[0.013735743,0.0007361672,0.053434003,0.00036805528,0.00004713639,0.00011083656,0.0004204646,0.3585565,0.06933227,0.47878343,0.02242881,0.0020465814],"about_ca_topic_score_codex":0.000008990465,"about_ca_topic_score_gemma":0.000017301216,"teacher_disagreement_score":0.4645469,"about_ca_system_score_codex":0.000016946673,"about_ca_system_score_gemma":0.000010401023,"threshold_uncertainty_score":0.51756936},"labels":[],"label_agreement":null},{"id":"W2401706236","doi":"","title":"Avoidable Partial Latin Squares Of Order 4m+1.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; Order (exchange); Applied mathematics; Biology; Business","score_opus":0.005544354896186742,"score_gpt":0.19524001208850691,"score_spread":0.18969565719232018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401706236","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.9839078,0.00005887329,0.000023332446,0.000011495325,0.004056922,0.00010342376,0.000004209086,0.00015547013,0.011678433],"genre_scores_gemma":[0.99965245,0.000002356397,0.0000746775,0.0000059121553,0.000017767416,0.000017972541,0.000003039777,0.000022951088,0.00020285901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993712,0.000026840054,0.00020177994,0.000098234916,0.00011604081,0.00018593301],"domain_scores_gemma":[0.9995259,0.000060238723,0.00003194571,0.0002738708,0.000050048344,0.000058002457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019209064,0.00010555565,0.00016499216,0.00006568439,0.000043456443,0.000015395128,0.00015089157,0.00009876344,0.00021265815],"category_scores_gemma":[0.00004049995,0.000103967985,0.000047381112,0.00026290657,0.000041405434,0.0000792152,0.000017907367,0.00020042172,0.000073604046],"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.000008983739,0.000049405175,0.007405858,0.00007483698,0.000036937912,0.0000029974149,0.00038076384,0.00040513222,0.061433535,0.92798156,0.0018941961,0.00032580568],"study_design_scores_gemma":[0.0022001474,0.00018706366,0.009309233,0.00008424057,0.000050506234,0.000010323878,0.00032441466,0.008688973,0.3320196,0.5999326,0.04645798,0.000734873],"about_ca_topic_score_codex":0.000021241258,"about_ca_topic_score_gemma":0.000013019322,"teacher_disagreement_score":0.3280489,"about_ca_system_score_codex":0.000005653478,"about_ca_system_score_gemma":0.0000113021,"threshold_uncertainty_score":0.42396915},"labels":[],"label_agreement":null},{"id":"W2401811066","doi":"","title":"Large sets of oriented P 3 -decompositions of directed complete bipartite graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.006911160097572999,"score_gpt":0.2030696047446677,"score_spread":0.1961584446470947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401811066","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.99534106,0.00019680473,0.000050480794,0.000010122269,0.0011585235,0.00023805974,0.00007698946,0.00024140527,0.0026865588],"genre_scores_gemma":[0.9997706,0.0000106657635,0.00008879774,0.000006324626,0.0000020633017,0.000037987735,0.000039253737,0.00002291102,0.00002140549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990881,0.00006880778,0.00036526078,0.00011274415,0.00013969805,0.0002253534],"domain_scores_gemma":[0.9993316,0.00007350148,0.00007698999,0.00030488893,0.00013704563,0.000075997035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119537544,0.00013240948,0.0002876241,0.00014428436,0.000049074104,0.000008218825,0.00014853112,0.00006634694,0.00016347691],"category_scores_gemma":[0.000013004634,0.00013455881,0.000103815066,0.00049671275,0.000054905366,0.000119019314,0.000026261938,0.00009464361,0.00005777609],"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.000009052474,0.00021354039,0.01047452,0.00019662386,0.00019651478,0.0000018210307,0.00071958493,0.00013641469,0.09231806,0.89178145,0.003891445,0.000060989212],"study_design_scores_gemma":[0.0042594373,0.00034944358,0.12470306,0.00048705062,0.0001381249,0.00001531656,0.0006127069,0.020982867,0.08495822,0.7567572,0.005829156,0.0009074059],"about_ca_topic_score_codex":0.000038418468,"about_ca_topic_score_gemma":0.000004627127,"teacher_disagreement_score":0.13502422,"about_ca_system_score_codex":0.000011967844,"about_ca_system_score_gemma":0.000005533673,"threshold_uncertainty_score":0.5487149},"labels":[],"label_agreement":null},{"id":"W2401910275","doi":"","title":"Large sets of K 2, 2 -decomposition of complete bipartite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Decomposition; Combinatorics; Robertson–Seymour theorem; Discrete mathematics; 1-planar graph; Chordal graph; Graph; Chemistry; Organic chemistry","score_opus":0.01044846602814215,"score_gpt":0.2289350486980887,"score_spread":0.21848658266994656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401910275","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.99443763,0.00067200646,0.000050425715,0.000003399934,0.0017746123,0.0001006276,0.00003688337,0.00007828497,0.002846133],"genre_scores_gemma":[0.9998902,0.000013157733,0.00003718163,0.00000535566,0.00000492207,0.000007979166,0.000017019032,0.000017819535,0.000006367928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992567,0.000054653858,0.00026948264,0.00006334844,0.00012372303,0.00023209461],"domain_scores_gemma":[0.99956805,0.000044238495,0.00006540772,0.00021699224,0.00003759429,0.00006769858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002851037,0.00010155798,0.00022101407,0.00009602788,0.000028466357,0.0000036510178,0.00010848748,0.000059775077,0.000041091],"category_scores_gemma":[0.000005529079,0.000105454805,0.000087057815,0.00022195508,0.00003215273,0.00013942059,0.000018883922,0.000071599854,0.00002560483],"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.00001017674,0.00013259418,0.021232096,0.00019336455,0.000075132404,5.263041e-7,0.0007888644,0.000063257925,0.043339286,0.93338835,0.00070531055,0.000071011935],"study_design_scores_gemma":[0.0034155939,0.0002808694,0.122067906,0.0003807216,0.00014392985,0.000023698396,0.00055127474,0.0029197983,0.22899136,0.6315745,0.008842717,0.0008076282],"about_ca_topic_score_codex":0.000005001541,"about_ca_topic_score_gemma":8.646884e-7,"teacher_disagreement_score":0.30181387,"about_ca_system_score_codex":0.000010496231,"about_ca_system_score_gemma":0.0000025986387,"threshold_uncertainty_score":0.43003222},"labels":[],"label_agreement":null},{"id":"W2401943296","doi":"","title":"The existence for large sets of disjoint pure directed triple systems with even orders.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics","score_opus":0.0066843686227352,"score_gpt":0.20485303100480218,"score_spread":0.19816866238206698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401943296","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.98989034,0.0022350543,0.0003506593,0.00008962704,0.002955981,0.001164007,0.000049079237,0.00044008857,0.0028251652],"genre_scores_gemma":[0.999662,0.000018374672,0.000029790584,0.0000069819125,0.000008598126,0.00007985575,0.0000099269855,0.000022447482,0.00016205735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990861,0.000058081117,0.00026006985,0.00013835599,0.00016273883,0.0002946888],"domain_scores_gemma":[0.99930125,0.00012477803,0.00007461105,0.000348213,0.000095168245,0.00005595388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036682267,0.00015222361,0.00025235707,0.000035858706,0.00014532916,0.000037468682,0.00022908334,0.00007059143,0.000001679443],"category_scores_gemma":[0.00003929726,0.00010289136,0.000068060726,0.00025937447,0.000025010688,0.00007737977,0.000009037422,0.00009919035,0.0000031727454],"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.00009576838,0.00007482033,0.00035826367,0.00018881202,0.00010748439,0.000004431145,0.00044168887,0.00031873162,0.0007583517,0.99433553,0.0029708997,0.0003452378],"study_design_scores_gemma":[0.013826083,0.0027777832,0.015384861,0.0016082454,0.00029825888,0.00010576041,0.0043273605,0.075575806,0.009907892,0.795245,0.07889593,0.0020470286],"about_ca_topic_score_codex":0.0000073346805,"about_ca_topic_score_gemma":0.000008903865,"teacher_disagreement_score":0.19909051,"about_ca_system_score_codex":0.000027591348,"about_ca_system_score_gemma":0.000014639516,"threshold_uncertainty_score":0.4195788},"labels":[],"label_agreement":null},{"id":"W2401945582","doi":"10.4153/cmb-2016-036-8","title":"On the Dual König Property of the Order-interval Hypergraph of Two Classes of <i>N</i>-free Posets","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Order (exchange); Dual (grammatical number); Partially ordered set; Property (philosophy); Class (philosophy); Discrete mathematics","score_opus":0.00931649696014747,"score_gpt":0.17919703165320888,"score_spread":0.1698805346930614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401945582","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.9606878,0.000068740206,0.00019744203,0.004872113,0.00018085753,0.00040446105,0.00014244475,0.000023956003,0.033422187],"genre_scores_gemma":[0.999051,0.0000034633963,0.00006639753,0.00010489577,0.000019524685,0.000017904453,3.099922e-7,0.000024164952,0.0007123559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893326,0.000116685296,0.00039796575,0.00010572758,0.00020691943,0.00023942043],"domain_scores_gemma":[0.9985592,0.0004989029,0.00007423156,0.00067204697,0.0000766525,0.00011900313],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038140453,0.00014288908,0.0002891504,0.000067761386,0.000039069717,0.0000064166074,0.00043481425,0.000066256594,0.001776285],"category_scores_gemma":[0.0005558206,0.000056002198,0.00014724153,0.00017548504,0.0002911046,0.000010348575,0.000035434077,0.00010049814,0.0001307287],"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.00003243855,0.00009244564,0.00030286243,0.0007432796,0.00020048146,0.000009448772,0.0006293107,0.000061737526,0.028954882,0.91242355,0.05581428,0.00073525845],"study_design_scores_gemma":[0.004256726,0.00080948207,0.0019063929,0.008933507,0.00031612813,0.0001823546,0.0016404903,0.0013256075,0.24500927,0.6239871,0.11019346,0.0014395238],"about_ca_topic_score_codex":0.00038746797,"about_ca_topic_score_gemma":0.0009958232,"teacher_disagreement_score":0.2884365,"about_ca_system_score_codex":0.000027448745,"about_ca_system_score_gemma":0.000060684048,"threshold_uncertainty_score":0.9991362},"labels":[],"label_agreement":null},{"id":"W2402241619","doi":"","title":"3-Designs and Large Sets of PSL(2, 2 n ) with Block Sizes 6.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Mathematics; Block (permutation group theory); Arithmetic; Combinatorics","score_opus":0.00525501267162622,"score_gpt":0.1935134460846881,"score_spread":0.18825843341306187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402241619","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.9955327,0.00011831566,0.000011081852,0.00000900937,0.00085527817,0.00009951769,0.00000679781,0.00010732747,0.0032599617],"genre_scores_gemma":[0.9998289,0.000006422913,0.00007751744,0.0000058138503,0.0000049715673,0.00000856342,0.0000015279992,0.00002147413,0.000044838125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950886,0.000019186216,0.00012017008,0.00009859765,0.00009051911,0.00016266618],"domain_scores_gemma":[0.9996217,0.000056460933,0.000025776872,0.00020595366,0.000027710585,0.000062428255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016312787,0.000106982756,0.00016051049,0.000042417072,0.00003964344,0.000013236962,0.0000906178,0.000072902614,0.00002142204],"category_scores_gemma":[0.000010507324,0.00009163952,0.000022248902,0.00011153988,0.000043691784,0.000066333494,0.000014894863,0.00015197026,0.00000770854],"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.000024802352,0.000081430444,0.023715574,0.00016744941,0.00008951434,0.000011946982,0.0008387863,0.000034644738,0.0379314,0.9360259,0.0008473873,0.00023115044],"study_design_scores_gemma":[0.009234809,0.00096857076,0.07147679,0.00033050956,0.00020202281,0.00023095506,0.001137492,0.0043324605,0.18798326,0.70530635,0.017065726,0.0017310485],"about_ca_topic_score_codex":0.000004864447,"about_ca_topic_score_gemma":0.000012074827,"teacher_disagreement_score":0.23071955,"about_ca_system_score_codex":0.0000032343594,"about_ca_system_score_gemma":0.0000064810542,"threshold_uncertainty_score":0.37369514},"labels":[],"label_agreement":null},{"id":"W2402343526","doi":"10.1609/aaai.v26i1.8147","title":"From Streamlined Combinatorial Search to Efficient Constructive Procedures","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorial explosion; Constructive; Constraint satisfaction problem; Computation; Combinatorial search; Combinatorial optimization; Computer science; Mathematics; Theoretical computer science; Series (stratigraphy); Algebra over a field; Combinatorics; Search algorithm; Algorithm; Artificial intelligence; Pure mathematics; Beam search","score_opus":0.032262152350743464,"score_gpt":0.26282477656972864,"score_spread":0.23056262421898516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402343526","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.9871877,0.000039168368,0.0007618819,0.00031821307,0.0014840651,0.000378412,0.000056205336,0.00011650113,0.00965786],"genre_scores_gemma":[0.99945277,0.000008840355,0.00020343665,0.000033288583,0.00019136269,0.000030930354,0.000002226192,0.000021727337,0.000055402717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847996,0.000020949728,0.00042824604,0.00035170236,0.00041039073,0.00030873605],"domain_scores_gemma":[0.9988317,0.00010108118,0.00007304575,0.00020036423,0.00067009946,0.00012369163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022313766,0.00021654804,0.00028826835,0.000086521286,0.000119180535,0.00012363994,0.00056194764,0.00010119201,0.0001700288],"category_scores_gemma":[0.00035703328,0.00017834017,0.00010621811,0.00060449477,0.00017745442,0.00006632999,0.00012806205,0.00027510265,0.00012947594],"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.00015200436,0.00013223369,0.00013853276,0.00009937665,0.00006514175,0.0000016716873,0.0034302452,0.0037927555,0.29396722,0.6911204,0.00021349185,0.006886934],"study_design_scores_gemma":[0.000043821037,0.000068032496,0.00009753028,0.0003326998,0.000017166907,0.000003431503,0.0045440816,0.013863939,0.9102246,0.070550635,0.000051819123,0.00020223498],"about_ca_topic_score_codex":0.00003764513,"about_ca_topic_score_gemma":0.000011660084,"teacher_disagreement_score":0.62056977,"about_ca_system_score_codex":0.000049660077,"about_ca_system_score_gemma":0.0001027262,"threshold_uncertainty_score":0.7272501},"labels":[],"label_agreement":null},{"id":"W2402344555","doi":"","title":"An upper bound for the radio number of generalized gear graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Upper and lower bounds; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.010190145980269096,"score_gpt":0.23731541052172633,"score_spread":0.22712526454145723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402344555","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.993077,0.0011404149,0.00019856966,0.000011740062,0.0041037234,0.00025276543,0.000009492626,0.00009968408,0.001106621],"genre_scores_gemma":[0.999595,0.000027813696,0.00012248608,0.000017486835,0.000047791495,0.000068968744,0.000006382882,0.000035877623,0.0000782212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992965,0.000055873592,0.00018511145,0.000081917824,0.000105523184,0.00027506062],"domain_scores_gemma":[0.9993818,0.00010711573,0.000033371074,0.00036492912,0.000033680884,0.000079130514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041771994,0.00012107365,0.00017458842,0.000030258068,0.00009390218,0.000021161371,0.00020875719,0.00007428136,0.0000659307],"category_scores_gemma":[0.000009995062,0.00009201148,0.000118784636,0.00013491392,0.000050367777,0.00017600646,0.000009337913,0.00007614984,0.000021944732],"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.000017319366,0.000055295743,0.014883542,0.00004852312,0.00011735253,1.9234845e-7,0.0008079527,0.00011514474,0.0038200144,0.97733593,0.002612416,0.0001863315],"study_design_scores_gemma":[0.0034314573,0.00012095155,0.022457985,0.00004946218,0.00021269373,0.00003781451,0.00069048617,0.004011361,0.030718692,0.88008887,0.057442613,0.0007376425],"about_ca_topic_score_codex":0.000018467548,"about_ca_topic_score_gemma":0.0000010349343,"teacher_disagreement_score":0.09724707,"about_ca_system_score_codex":0.000014001735,"about_ca_system_score_gemma":0.0000051835136,"threshold_uncertainty_score":0.37521195},"labels":[],"label_agreement":null},{"id":"W2402459166","doi":"","title":"Embeddings of resolvable group divisible designs with block size 3 and for all λ.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Block size; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.01089984610242698,"score_gpt":0.21817587972434235,"score_spread":0.20727603362191538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402459166","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.9964473,0.00036832772,0.00020398312,0.000020667892,0.0002627809,0.00028701776,0.000004522811,0.00012359138,0.002281763],"genre_scores_gemma":[0.9991432,0.000014561592,0.0006718661,0.000023842978,0.0000055187147,0.000019840716,0.0000019617305,0.00002083143,0.000098402554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993807,0.000016988006,0.00016165913,0.00013410734,0.000091602145,0.00021496303],"domain_scores_gemma":[0.999546,0.00014487086,0.00003591679,0.00017584609,0.000032874275,0.0000644955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021220051,0.00012731421,0.00021101706,0.00004113776,0.000044797223,0.000021933882,0.00010248507,0.00006251476,0.0000041185435],"category_scores_gemma":[0.000019508358,0.00011469135,0.000035764384,0.00012970694,0.000026764366,0.00010230984,0.000008309865,0.000064501924,0.0000014159965],"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.00014817173,0.000116077994,0.0013320905,0.00026711848,0.00013954697,0.0000060902134,0.00091246096,0.00057183206,0.055341534,0.93809044,0.0026866533,0.00038797842],"study_design_scores_gemma":[0.0046932185,0.0022849545,0.0061240485,0.00031223646,0.0001293376,0.000031865107,0.0002960999,0.0036168105,0.04783977,0.9277212,0.006247004,0.00070345926],"about_ca_topic_score_codex":0.000005352566,"about_ca_topic_score_gemma":0.0000016068526,"teacher_disagreement_score":0.010369246,"about_ca_system_score_codex":0.0000124332,"about_ca_system_score_gemma":0.0000045041224,"threshold_uncertainty_score":0.46769774},"labels":[],"label_agreement":null},{"id":"W2402513589","doi":"","title":"Decompositions of complete graphs into paths and cycles","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.005252879354272561,"score_gpt":0.2022782413432858,"score_spread":0.19702536198901321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402513589","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.99606866,0.000161335,0.000021374653,0.000015029876,0.0014783384,0.00007901747,0.000008841624,0.000107143474,0.0020602827],"genre_scores_gemma":[0.9997047,0.000013714137,0.0002363693,0.0000063356024,0.0000038888134,0.000010579503,0.0000054432535,0.000014975648,0.0000039546762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995544,0.00002131444,0.00015724535,0.00008790994,0.00006723581,0.00011188522],"domain_scores_gemma":[0.9996304,0.00006497785,0.00002381089,0.00019142879,0.000026223626,0.000063150575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010840551,0.000091286405,0.00014402281,0.00007352589,0.0000672085,0.000014476495,0.000101715836,0.000060440154,0.000016617882],"category_scores_gemma":[0.0000074381583,0.00009386159,0.000042173448,0.00011919882,0.000081402504,0.00006854552,0.000020197842,0.00013702583,0.000008985704],"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.0000023108207,0.00002081884,0.00418808,0.00005159111,0.00002619643,0.0000016457518,0.0003448182,0.000012782517,0.13738973,0.8574007,0.00013894388,0.0004223815],"study_design_scores_gemma":[0.0003835428,0.000036184236,0.016254487,0.00002855753,0.000015624335,0.000013161462,0.00009462754,0.000679861,0.011041644,0.97038776,0.00090892176,0.00015561799],"about_ca_topic_score_codex":0.0000192027,"about_ca_topic_score_gemma":0.000021444444,"teacher_disagreement_score":0.1263481,"about_ca_system_score_codex":0.0000034963666,"about_ca_system_score_gemma":0.0000032181683,"threshold_uncertainty_score":0.38275647},"labels":[],"label_agreement":null},{"id":"W2402699812","doi":"","title":"The existence of doubly disjoint (mt+1, m, m-1) difference families.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics","score_opus":0.01082447369872883,"score_gpt":0.2015718169925771,"score_spread":0.19074734329384826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402699812","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.9814957,0.0017870292,0.000042032236,0.0000142548015,0.004003761,0.00012252045,0.000003354284,0.00011706455,0.012414316],"genre_scores_gemma":[0.9996345,0.000105519954,0.000014098755,0.0000068771255,0.000014433752,0.0000270152,0.0000012987739,0.00001803411,0.00017820741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914044,0.000050877534,0.00023768462,0.0000838568,0.00016875003,0.00031836503],"domain_scores_gemma":[0.99927896,0.00015900086,0.000045729983,0.0003983775,0.00003210657,0.00008580936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032214803,0.00013184395,0.00016812888,0.000031979544,0.000103340724,0.000020130561,0.0002913858,0.000056463658,0.000008051261],"category_scores_gemma":[0.000029660985,0.000093619376,0.00007007911,0.00018965236,0.000105841485,0.000101691076,0.000041336538,0.00012896581,0.00003735171],"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.000007942259,0.000034602195,0.0074886377,0.000053616423,0.00003351842,5.338082e-7,0.0008511939,0.000019331406,0.0041010207,0.9854871,0.0003427971,0.0015797154],"study_design_scores_gemma":[0.0017161486,0.00018773954,0.17412546,0.00027348835,0.000079498066,0.000027676388,0.002632437,0.001724397,0.048557084,0.7470197,0.022623321,0.0010330586],"about_ca_topic_score_codex":0.0000143897,"about_ca_topic_score_gemma":0.000002836149,"teacher_disagreement_score":0.23846741,"about_ca_system_score_codex":0.000024045883,"about_ca_system_score_gemma":0.0000063026073,"threshold_uncertainty_score":0.38176873},"labels":[],"label_agreement":null},{"id":"W2402778774","doi":"","title":"The smallest realization of a given vector.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realization (probability); Mathematics; Pure mathematics; Statistics","score_opus":0.01296705521771443,"score_gpt":0.2043762451340071,"score_spread":0.19140918991629266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402778774","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.97214967,0.00079638476,0.00010857331,0.000034095316,0.003358064,0.00013971019,0.0000026952755,0.00013412563,0.023276694],"genre_scores_gemma":[0.9998559,0.000018649487,0.00000440216,0.0000026924024,0.0000072218577,0.000010174636,0.000003211425,0.00001217065,0.00008561949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956566,0.00004324441,0.000135775,0.000051526196,0.0001036284,0.00010013552],"domain_scores_gemma":[0.99962395,0.000051031588,0.000028288723,0.0001953438,0.000055757475,0.000045646535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026772555,0.00005901449,0.00008386548,0.00002012131,0.000038514816,0.000013443879,0.00013251706,0.000038761966,0.0000029437276],"category_scores_gemma":[0.000039704417,0.0000470183,0.000026990658,0.00014103636,0.00002896659,0.000033571887,0.0000129305245,0.00004748015,0.00001641014],"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.0000073988012,0.000008241419,0.0013188166,0.00001499643,0.000022407661,9.522069e-7,0.0004918894,0.0004775834,0.0003698713,0.9919028,0.0052074203,0.00017761767],"study_design_scores_gemma":[0.0008086971,0.00010188964,0.0034622867,0.000047261212,0.00001731888,0.000005637213,0.0005978725,0.0022805417,0.004209727,0.96555877,0.022731876,0.0001780951],"about_ca_topic_score_codex":0.000017888111,"about_ca_topic_score_gemma":0.000008963036,"teacher_disagreement_score":0.027706202,"about_ca_system_score_codex":0.000021300933,"about_ca_system_score_gemma":0.000010755549,"threshold_uncertainty_score":0.19173506},"labels":[],"label_agreement":null},{"id":"W2402855873","doi":"","title":"Critical Sets in F-squares.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01530497556825815,"score_gpt":0.2428644408379148,"score_spread":0.22755946526965665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402855873","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.97081363,0.00048612087,0.000012371924,0.00004666233,0.003644921,0.00007059706,0.0000019707386,0.00020215414,0.024721546],"genre_scores_gemma":[0.9998854,0.0000025495565,0.000022298702,0.000018953448,0.0000065018517,0.000015882684,0.0000020388222,0.000018065388,0.00002832086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993776,0.00004894749,0.00014753142,0.000096704425,0.000119846285,0.00020935628],"domain_scores_gemma":[0.99960124,0.00006483507,0.0000057254983,0.00017669173,0.000030177349,0.00012133246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002638109,0.0000903233,0.00012859747,0.00006735608,0.00001483377,0.000022828242,0.000117275486,0.00007285718,0.000017523978],"category_scores_gemma":[0.00009519045,0.000095495576,0.000026549124,0.00018121864,0.000028419148,0.00012050597,0.000016226024,0.00013325662,0.00017909675],"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.000006586881,0.0000364429,0.0041681062,0.00003470318,0.000007195438,0.00004490143,0.00059015374,0.00027829641,0.000120988574,0.9889204,0.0054617273,0.0003304943],"study_design_scores_gemma":[0.00081717235,0.000050530016,0.0024100814,0.000046330955,0.000004477913,0.000012788041,0.00030775322,0.0028661261,0.0007342499,0.9875526,0.0049826084,0.00021530807],"about_ca_topic_score_codex":0.0000130851195,"about_ca_topic_score_gemma":0.000005889139,"teacher_disagreement_score":0.029071733,"about_ca_system_score_codex":0.000047623875,"about_ca_system_score_gemma":0.000011317962,"threshold_uncertainty_score":0.38941965},"labels":[],"label_agreement":null},{"id":"W2402967678","doi":"","title":"Complete Arcs In Moulton Planes Of Odd Order.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Geometry; Combinatorics; Pure mathematics; Business","score_opus":0.017923349833763303,"score_gpt":0.19105474725886565,"score_spread":0.17313139742510233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402967678","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.9800258,0.0001974556,0.000011364461,0.0000020195487,0.0011051075,0.000099088786,0.000008332777,0.00008962457,0.018461185],"genre_scores_gemma":[0.9998608,0.000013508108,0.000055551904,0.0000049010723,0.0000030368003,0.000010190573,0.0000064774563,0.000017583701,0.00002790345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993935,0.000037166345,0.00022441393,0.000092384704,0.0000844674,0.00016805973],"domain_scores_gemma":[0.99966854,0.00003787942,0.000029219818,0.00020357595,0.000023268925,0.00003751088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001451869,0.0001042366,0.00019518146,0.0000877446,0.000015717935,0.0000040527257,0.00016122543,0.000064670014,0.000061806626],"category_scores_gemma":[0.000011078018,0.00010649525,0.000031109983,0.00022330132,0.00003355045,0.00005993047,0.000016238295,0.00010270964,0.000037202117],"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.000029168075,0.000098602,0.023377012,0.00019312723,0.000045767825,0.000021160062,0.0027898434,0.00023074918,0.008108811,0.96436226,0.00042825777,0.00031525083],"study_design_scores_gemma":[0.002693728,0.00025006686,0.06241536,0.00027371573,0.00002734598,0.00002408345,0.0009273021,0.0039002178,0.03302366,0.89095366,0.0047957753,0.0007150594],"about_ca_topic_score_codex":0.000098896664,"about_ca_topic_score_gemma":0.000017823264,"teacher_disagreement_score":0.07340857,"about_ca_system_score_codex":0.000012780999,"about_ca_system_score_gemma":0.000005108044,"threshold_uncertainty_score":0.43427503},"labels":[],"label_agreement":null},{"id":"W2403150329","doi":"","title":"Enumeration of isomorphism classes of self-orthogonal Latin squares.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enumeration; Isomorphism (crystallography); Latin square; Combinatorics; Orthogonal array; Statistics; Crystallography; Biology; Food science","score_opus":0.005106526150668462,"score_gpt":0.1909686889281681,"score_spread":0.18586216277749965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403150329","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.9938546,0.00007773394,0.00002629888,0.000008193006,0.0022117426,0.000098257566,0.000009376113,0.0001055911,0.0036082088],"genre_scores_gemma":[0.99977344,0.0000064737264,0.00014504464,0.000003176199,0.000011633607,0.0000087941935,0.000007998676,0.000016884704,0.000026568214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993594,0.00002989965,0.00027342627,0.0000840158,0.00014174578,0.00011146012],"domain_scores_gemma":[0.9995334,0.0000734952,0.000070693335,0.0002141219,0.00007010567,0.000038149767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018156713,0.00009600475,0.0001814352,0.00009078126,0.000025379219,0.0000070719293,0.000115273426,0.0001006847,0.00006600921],"category_scores_gemma":[0.000022248552,0.00009954144,0.00006055647,0.00019185459,0.000036250065,0.00008753249,0.0000121327175,0.00015547925,0.0000114385275],"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.000005773063,0.00006219581,0.011844255,0.00011234262,0.000043500488,0.0000011569065,0.00039198707,0.000118598626,0.13054386,0.85629714,0.00036160287,0.00021757623],"study_design_scores_gemma":[0.0021260064,0.00026731432,0.059433106,0.00011970586,0.00008416277,0.000015246474,0.00020814026,0.00721797,0.45979005,0.46347782,0.0066821966,0.0005782521],"about_ca_topic_score_codex":0.000007442257,"about_ca_topic_score_gemma":0.000008273361,"teacher_disagreement_score":0.39281932,"about_ca_system_score_codex":0.0000064874125,"about_ca_system_score_gemma":0.000015575597,"threshold_uncertainty_score":0.4059182},"labels":[],"label_agreement":null},{"id":"W2403255229","doi":"10.1016/j.jda.2016.05.003","title":"Corrigendum to “On a lemma of Crochemore and Rytter” [Journal of Discrete Algorithms 34 (2015) 18–22]","year":2016,"lang":"en","type":"erratum","venue":"Journal of Discrete Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Lemma (botany); Algorithm; Mathematics; Computer science; Biology","score_opus":0.014457780096897379,"score_gpt":0.25190660296500295,"score_spread":0.23744882286810556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403255229","genre_codex":"editorial","genre_gemma":"empirical","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.056169722,0.14265901,0.17968747,0.004036313,0.541864,0.00450127,0.008566602,0.00046380726,0.062051855],"genre_scores_gemma":[0.43658727,0.048486594,0.04227552,0.0013032246,0.11010662,0.00014465224,0.0004206604,0.0038687827,0.35680667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941127,0.0002538971,0.002837067,0.00041745516,0.0015498456,0.0008290637],"domain_scores_gemma":[0.9950386,0.00015355714,0.0024355913,0.00070281356,0.0008426065,0.00082678464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016070298,0.0009886981,0.0024660255,0.0012689847,0.00012032911,0.00014997253,0.001254458,0.00080794696,0.00027210315],"category_scores_gemma":[0.00018294866,0.000700242,0.0010602443,0.00046201193,0.0002512282,0.00053276843,0.0001604934,0.0020938655,0.000020372509],"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.00043460136,0.00009114905,0.000070107,0.0011018321,0.0018084031,0.00065238203,0.00097165734,0.00018101929,0.0034452332,0.000120689576,0.9705235,0.020599423],"study_design_scores_gemma":[0.007014818,0.0073527894,0.0012070666,0.018877357,0.0016585976,0.0069491873,0.002555471,0.0025941136,0.0112563735,0.0035536764,0.9337965,0.003184041],"about_ca_topic_score_codex":0.000014995222,"about_ca_topic_score_gemma":0.0000055727737,"teacher_disagreement_score":0.43175733,"about_ca_system_score_codex":0.00025143794,"about_ca_system_score_gemma":0.0002752724,"threshold_uncertainty_score":0.99954486},"labels":[],"label_agreement":null},{"id":"W2403262110","doi":"","title":"Block transitive 2-(v, 13, 1) Designs and Suzuki Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Block (permutation group theory); Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.010797301673421163,"score_gpt":0.19561830157523655,"score_spread":0.18482099990181539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403262110","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.99284106,0.0014045476,0.00008107001,0.0000146945495,0.0018933581,0.00013688313,0.0000043479313,0.00021827321,0.0034057507],"genre_scores_gemma":[0.9998066,0.000030904626,0.000015440746,0.0000200044,0.000024009643,0.000019240699,0.0000026725754,0.000030210529,0.00005090709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993174,0.000033090317,0.00013767881,0.000103426886,0.00009252808,0.00031588043],"domain_scores_gemma":[0.9996011,0.00007001005,0.000014988914,0.00015052377,0.000016520726,0.00014682485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020089927,0.00014710875,0.0001662063,0.000051917574,0.00006970593,0.000021187183,0.00007778071,0.00008792666,0.000017485572],"category_scores_gemma":[0.0000070169026,0.00014884207,0.00004385056,0.0001308791,0.000040348543,0.00020114091,0.000010897649,0.00012645665,0.000052459312],"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.000017279019,0.00008655524,0.009722817,0.00011076438,0.00013305803,0.000009323262,0.005251284,0.000059243655,0.027560415,0.95514035,0.0013025003,0.00060638966],"study_design_scores_gemma":[0.0065471563,0.0005163039,0.12077335,0.0003334167,0.00036341872,0.00038840502,0.0047864406,0.0034408362,0.14772627,0.6995858,0.012537111,0.0030014908],"about_ca_topic_score_codex":0.0000070101705,"about_ca_topic_score_gemma":0.0000018026241,"teacher_disagreement_score":0.25555456,"about_ca_system_score_codex":0.000020551919,"about_ca_system_score_gemma":0.0000033390747,"threshold_uncertainty_score":0.6069603},"labels":[],"label_agreement":null},{"id":"W2403274737","doi":"","title":"On Candelabra Quadruple Systems.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012417371335014547,"score_gpt":0.18369782579320332,"score_spread":0.17128045445818876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403274737","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.8914165,0.00031963503,0.000027187449,0.0000021865885,0.006351018,0.000142918,0.0000042752636,0.00044875455,0.10128755],"genre_scores_gemma":[0.99957347,0.0000071853456,0.000006492988,0.000013957686,0.000008714867,0.00003571622,0.000002645409,0.000036069883,0.0003157309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929875,0.000044916098,0.00017767042,0.00013049527,0.00012115659,0.00022701298],"domain_scores_gemma":[0.99950534,0.000039936567,0.000023155837,0.0003192834,0.00002274867,0.000089517795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016869961,0.00014205986,0.00016733195,0.00007118015,0.00005588514,0.00002055996,0.00017391663,0.00008385247,0.00008985007],"category_scores_gemma":[0.00001004011,0.0001362332,0.000049449965,0.00014760093,0.000019590287,0.00007573548,0.000011813221,0.00012985151,0.00042335922],"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.000009366371,0.000030436782,0.00043783177,0.000044913875,0.000037840666,0.000012968857,0.0005423651,0.00017835473,0.0001429315,0.9945396,0.003951879,0.00007152174],"study_design_scores_gemma":[0.0018518692,0.0003904539,0.003484235,0.00024643374,0.000047545014,0.000038561597,0.00087572995,0.0054228,0.007272455,0.96961606,0.009757199,0.0009966374],"about_ca_topic_score_codex":0.00011749639,"about_ca_topic_score_gemma":0.000004648966,"teacher_disagreement_score":0.10815702,"about_ca_system_score_codex":0.00003753931,"about_ca_system_score_gemma":0.00000697667,"threshold_uncertainty_score":0.5555429},"labels":[],"label_agreement":null},{"id":"W2403310330","doi":"","title":"Chromaticity of Bipartite Graphs With Seven Edges Deleted.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Chromaticity; Mathematics; Combinatorics; Complete bipartite graph; Graph; Computer science; Artificial intelligence","score_opus":0.012873559486165883,"score_gpt":0.18141902152911832,"score_spread":0.16854546204295243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403310330","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.98612887,0.0001895392,0.000058067897,0.0000017577191,0.0005902688,0.00012128873,0.000003841501,0.00018157782,0.012724781],"genre_scores_gemma":[0.99978167,0.000009983644,0.00012990697,0.000004853925,0.000002659185,0.000018950212,0.0000018475146,0.000024681744,0.00002542415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993617,0.000036890393,0.00019808799,0.00010264126,0.00011450373,0.0001861719],"domain_scores_gemma":[0.99954677,0.00002773154,0.000046681784,0.00027300732,0.00004161493,0.000064196385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014084192,0.00012978613,0.00020942923,0.00007863356,0.000032990265,0.000006409982,0.00016226762,0.000060110353,0.00004998148],"category_scores_gemma":[0.0000066854736,0.00011072873,0.000050625073,0.00027257422,0.000066092565,0.000102542646,0.000014268844,0.00008475627,0.000026252783],"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.000039048362,0.00013495637,0.02414163,0.00033431884,0.0002752573,0.000015944443,0.003495574,0.00010409759,0.0057077813,0.9644253,0.00087272946,0.00045336309],"study_design_scores_gemma":[0.001396649,0.00046940442,0.042940162,0.0003031343,0.000099903395,0.000029198536,0.00049798965,0.0007883937,0.2002797,0.7519844,0.0006108185,0.00060020626],"about_ca_topic_score_codex":0.000026716347,"about_ca_topic_score_gemma":0.000007737463,"teacher_disagreement_score":0.21244086,"about_ca_system_score_codex":0.000010215801,"about_ca_system_score_gemma":0.000007536816,"threshold_uncertainty_score":0.45153865},"labels":[],"label_agreement":null},{"id":"W2403552696","doi":"","title":"On The Cyclomatic Number Of Linear Hypergraphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Discrete mathematics; Computer science; Programming language; Software","score_opus":0.007735980619098375,"score_gpt":0.21010511163555218,"score_spread":0.2023691310164538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403552696","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.96941185,0.00014798662,0.0000062813483,0.000016444486,0.0020097482,0.00009446356,0.0000018161413,0.0000915121,0.02821992],"genre_scores_gemma":[0.9998391,0.0000071639747,0.000015677502,0.000024845716,0.000012110247,0.000016842125,0.0000010141498,0.000020707832,0.000062525774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994255,0.000056036435,0.00015675616,0.000050404095,0.00012365646,0.00018768119],"domain_scores_gemma":[0.99943775,0.00018462671,0.000027468339,0.00028575168,0.00001527706,0.00004912682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002726616,0.00009880699,0.00013093086,0.000026933603,0.00004800519,0.000005245239,0.00014815218,0.000050779818,0.00011320781],"category_scores_gemma":[0.000028297103,0.0000691798,0.000070521346,0.00017750247,0.000033478318,0.00006208504,0.000012129691,0.00010696443,0.00029049735],"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.0000027205929,0.000043227414,0.005768056,0.000037267913,0.000040460727,3.402348e-7,0.00041000964,0.000047645015,0.000548013,0.99147576,0.0015658662,0.000060632527],"study_design_scores_gemma":[0.0005463312,0.000045547236,0.00838583,0.00013059287,0.000040994717,0.000017027156,0.0003596552,0.0010543292,0.016223384,0.9697008,0.0031735764,0.0003219332],"about_ca_topic_score_codex":0.0000036905824,"about_ca_topic_score_gemma":1.663678e-7,"teacher_disagreement_score":0.030427285,"about_ca_system_score_codex":0.000009448637,"about_ca_system_score_gemma":0.0000022681218,"threshold_uncertainty_score":0.37338528},"labels":[],"label_agreement":null},{"id":"W2403885105","doi":"","title":"Packings and coverings for ten graphs with seven points, seven edges and an even-cycle.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005329090428732821,"score_gpt":0.20027643113216984,"score_spread":0.19494734070343703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403885105","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.99793094,0.00041910072,0.00007137219,0.00008454574,0.00031154996,0.0003144572,0.000012716863,0.00021205671,0.00064327865],"genre_scores_gemma":[0.9995632,0.000043168617,0.00019311241,0.0000700281,0.00001345628,0.000025626738,0.00000890842,0.000035845245,0.000046610894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919456,0.00002816867,0.00015944891,0.00024008704,0.00010335234,0.0002743881],"domain_scores_gemma":[0.99951774,0.00005585232,0.00003850952,0.00021255208,0.00003650668,0.00013882651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022715334,0.00020743103,0.00024902012,0.00008010291,0.000114138005,0.00007392094,0.00011153144,0.000093884606,0.000002724746],"category_scores_gemma":[0.000012105113,0.00018898406,0.00003360807,0.000135902,0.000050253366,0.0003029466,0.000014822772,0.00010890901,0.0000016366492],"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.00020393469,0.000119802615,0.012790705,0.00032933036,0.00020849795,0.000020128244,0.005165216,0.00013303402,0.0037086373,0.96223336,0.0015969122,0.013490443],"study_design_scores_gemma":[0.0022704895,0.00082149555,0.032849398,0.00015591385,0.00006167817,0.00007000356,0.00054102315,0.0010207661,0.0021473987,0.95623076,0.0032616388,0.00056945713],"about_ca_topic_score_codex":0.000009727936,"about_ca_topic_score_gemma":0.0000053261024,"teacher_disagreement_score":0.02005869,"about_ca_system_score_codex":0.0000161471,"about_ca_system_score_gemma":0.000007211386,"threshold_uncertainty_score":0.7706547},"labels":[],"label_agreement":null},{"id":"W2404211923","doi":"10.2174/1386207319666160408150649","title":"An Analysis of the Practicalities of Multi-Color Nanoparticle Cellular Bar-Coding","year":2016,"lang":"en","type":"article","venue":"Combinatorial Chemistry & High Throughput Screening","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":"Health Canada","funders":"Biotechnology and Biological Sciences Research Council; Engineering and Physical Sciences Research Council","keywords":"Bar (unit); Coding (social sciences); Color-coding; Computer science; Nanoparticle; Nanotechnology; Materials science; Artificial intelligence; Mathematics; Physics; Statistics","score_opus":0.013740014621358416,"score_gpt":0.2287628188804113,"score_spread":0.2150228042590529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404211923","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.99093115,0.000107992724,0.0075933086,0.000033688222,0.000789263,0.00011156527,0.000038876122,0.0001177321,0.0002764056],"genre_scores_gemma":[0.9994474,0.000006409801,0.00029379854,0.0000035023074,0.00014246526,0.000013724371,0.00000590001,0.00002947166,0.000057321817],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847585,0.00011964853,0.0005343572,0.00025078174,0.00032197815,0.00029738506],"domain_scores_gemma":[0.9986248,0.00026684318,0.00020082307,0.0006944545,0.00012307013,0.000090006535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049954915,0.00020758627,0.0004843915,0.000042100488,0.00011102119,0.000022898905,0.0004598273,0.00015515521,0.00011397793],"category_scores_gemma":[0.00017561734,0.00014478342,0.00025602817,0.00056689297,0.0002070773,0.00028299566,0.00007601665,0.00013325337,0.0000019123008],"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.000043308668,0.00008087039,0.0033034629,0.00011671714,0.0005158316,0.0000018354563,0.0003078932,0.002648888,0.9766213,0.016245114,0.000016194348,0.00009858315],"study_design_scores_gemma":[0.0008666484,0.000027666885,0.0011500451,0.00011350936,0.0004573083,0.0000010896631,0.00040070075,0.008044813,0.9876344,0.00094549375,0.00016076202,0.00019752806],"about_ca_topic_score_codex":0.000055437395,"about_ca_topic_score_gemma":0.0000018085699,"teacher_disagreement_score":0.015299619,"about_ca_system_score_codex":0.00004849279,"about_ca_system_score_gemma":0.000020105366,"threshold_uncertainty_score":0.59040964},"labels":[],"label_agreement":null},{"id":"W2404625738","doi":"","title":"Cubic edge-transitive graphs of order 12p or 12p 2 .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.00572214854852661,"score_gpt":0.19595199841861674,"score_spread":0.19022984987009012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404625738","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.97935474,0.00031881602,0.00036343324,0.00003248235,0.0033894952,0.00019295064,0.000008545642,0.0002542108,0.01608531],"genre_scores_gemma":[0.9995359,0.000032215856,0.00009979599,0.000036725007,0.000013360163,0.000020714868,0.0000044464346,0.000039433493,0.00021739985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901336,0.00008452574,0.00030905954,0.00016618679,0.00017188185,0.00025497656],"domain_scores_gemma":[0.9992538,0.00012214431,0.000046224017,0.00033162287,0.00016030809,0.0000859183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003407041,0.00018463156,0.0003122071,0.00010765957,0.00005295569,0.000014538294,0.00020563013,0.00011546333,0.00008769504],"category_scores_gemma":[0.0000745443,0.00016176881,0.00009645055,0.00044737363,0.00006673815,0.000101476566,0.000015760746,0.00015142362,0.00006350143],"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.00003900154,0.00005132667,0.0006422596,0.00019409554,0.0001330456,0.0000055522446,0.0007224134,0.00028084847,0.006901561,0.9866638,0.0028027603,0.0015633283],"study_design_scores_gemma":[0.0029660726,0.00044952144,0.0038721436,0.00041859166,0.00011026876,0.000024241424,0.00048314492,0.004090078,0.05024642,0.91883034,0.01766473,0.0008444304],"about_ca_topic_score_codex":0.000014162213,"about_ca_topic_score_gemma":0.000007408699,"teacher_disagreement_score":0.06783345,"about_ca_system_score_codex":0.000015357693,"about_ca_system_score_gemma":0.0000139224385,"threshold_uncertainty_score":0.65967405},"labels":[],"label_agreement":null},{"id":"W2404964284","doi":"","title":"Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Upper and lower bounds; Combinatorics; Mathematical analysis","score_opus":0.007207518043931618,"score_gpt":0.22117580593495964,"score_spread":0.213968287891028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404964284","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.98983276,0.0013394753,0.00017540024,0.000056174304,0.0033038238,0.00061073434,0.000009068813,0.00015661129,0.0045159683],"genre_scores_gemma":[0.9995304,0.000017398168,0.000024733192,0.000028859788,0.000024743724,0.00007606079,0.0000036531671,0.000026823267,0.00026734418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907583,0.000044636847,0.00033502263,0.0001256631,0.00015016789,0.0002686663],"domain_scores_gemma":[0.999224,0.0002002736,0.00005967695,0.00041355085,0.000052776602,0.000049717146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032687394,0.00016363319,0.00027088524,0.000039283786,0.00010258985,0.000044154865,0.0002580085,0.00009319538,0.000038275015],"category_scores_gemma":[0.000024802348,0.00012317719,0.00013662431,0.00016522834,0.000045947196,0.00010137499,0.000010390326,0.000100254365,0.000074003874],"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.000015032636,0.00005341296,0.0014367081,0.00025759544,0.0001300283,0.0000013769368,0.00050937984,0.000710397,0.0029986517,0.9871524,0.0064899023,0.0002451445],"study_design_scores_gemma":[0.003240756,0.0003115437,0.015933765,0.00054795743,0.000271326,0.000111484136,0.0012417714,0.03285629,0.008964751,0.91134286,0.02425981,0.00091770623],"about_ca_topic_score_codex":0.0000098891705,"about_ca_topic_score_gemma":6.2485896e-7,"teacher_disagreement_score":0.07580953,"about_ca_system_score_codex":0.00003577364,"about_ca_system_score_gemma":0.000011834985,"threshold_uncertainty_score":0.50230205},"labels":[],"label_agreement":null},{"id":"W2404970681","doi":"","title":"The existence of block-transitive 2-(q, 8, 1) designs with q a prime power.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Prime (order theory); Prime power; Block (permutation group theory); Combinatorics; Power (physics); Discrete mathematics; Physics; Thermodynamics","score_opus":0.014607962313856556,"score_gpt":0.1864460365266482,"score_spread":0.17183807421279165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404970681","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.9721487,0.0003407287,0.00017320586,0.000005182557,0.0006597602,0.0002077416,0.000002795478,0.00011827457,0.026343573],"genre_scores_gemma":[0.9997886,0.0000119453525,0.000084994164,0.000004313496,0.0000019984466,0.000022342716,3.6243136e-7,0.000021461723,0.00006400899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934965,0.00005628836,0.00016561575,0.00010390248,0.0001270633,0.00019749586],"domain_scores_gemma":[0.99947,0.00008166621,0.000040424195,0.00029485582,0.00006242197,0.000050617793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022751468,0.00012137803,0.00014597368,0.000027428743,0.00008167041,0.000010167624,0.00021909195,0.00004790632,0.000010105204],"category_scores_gemma":[0.000008704799,0.00008204581,0.000045717,0.0001807716,0.00012158872,0.00006775833,0.000010255144,0.0001068508,0.000014368066],"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.00008941667,0.000056888082,0.0012463194,0.000033877757,0.00015776872,0.000017238248,0.0064336155,0.000021524225,0.007264817,0.9844039,0.000105708925,0.0001689073],"study_design_scores_gemma":[0.0024286674,0.0015224869,0.022425942,0.00042720442,0.00014261174,0.00010638683,0.0049917623,0.00051827694,0.42015973,0.5450384,0.0012874963,0.0009510177],"about_ca_topic_score_codex":0.000013723991,"about_ca_topic_score_gemma":0.0000048589177,"teacher_disagreement_score":0.4393655,"about_ca_system_score_codex":0.000013367842,"about_ca_system_score_gemma":0.000015513082,"threshold_uncertainty_score":0.33457312},"labels":[],"label_agreement":null},{"id":"W2404980147","doi":"","title":"Right Triangular Dihedral f-Tilings of the Sphere: (α, β, π/2) and (γ, γ, π/2).","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dihedral angle; Combinatorics; Substitution tiling; Physics","score_opus":0.0072891501717525994,"score_gpt":0.1857004984515574,"score_spread":0.1784113482798048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404980147","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.990192,0.0010272119,0.00001015543,0.000023962572,0.0024754861,0.00013765592,0.0000027374197,0.00007640173,0.0060543804],"genre_scores_gemma":[0.99973917,0.000005106502,0.000024237639,0.000010714934,0.000010326815,0.0000068430472,7.686383e-7,0.000017700568,0.00018512225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993702,0.000060957762,0.00018201197,0.0000950432,0.0001492367,0.00014254861],"domain_scores_gemma":[0.9995418,0.00003473091,0.00003663484,0.0002703619,0.000038633923,0.00007783766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029641818,0.00010663251,0.0001708112,0.000022754835,0.00003749753,0.000014244181,0.00018083127,0.00006931402,0.000014339031],"category_scores_gemma":[0.00003732327,0.00007718978,0.000056722194,0.0001776724,0.000068132824,0.000078238256,0.000038730926,0.00009827164,0.00000889309],"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.0000249035,0.000041713138,0.013534895,0.00009767688,0.00008535626,0.000006119852,0.0011270738,0.00015571203,0.0026821129,0.97717696,0.0044859913,0.0005815109],"study_design_scores_gemma":[0.0028067003,0.00010262909,0.0059489175,0.000091645015,0.000057366662,0.000020508518,0.00047558086,0.0016741379,0.029875012,0.94232696,0.01629326,0.00032726108],"about_ca_topic_score_codex":0.000016736478,"about_ca_topic_score_gemma":0.000004243414,"teacher_disagreement_score":0.034849953,"about_ca_system_score_codex":0.000018077053,"about_ca_system_score_gemma":0.000013935709,"threshold_uncertainty_score":0.3147708},"labels":[],"label_agreement":null},{"id":"W2405204346","doi":"","title":"Packings and coverings of λK v by the graphs with seven points, seven edges and one 5-circle.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.0056100501551344245,"score_gpt":0.17476534877298783,"score_spread":0.1691552986178534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405204346","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.9959906,0.0023930212,0.000019604793,0.000058666134,0.00035152334,0.00015426097,0.000010272061,0.000066212575,0.0009558618],"genre_scores_gemma":[0.9997622,0.000098381555,0.000024845836,0.00002500824,0.0000069002867,0.000013523989,0.0000027857036,0.000027765887,0.000038606904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933755,0.000044120297,0.00014662235,0.000109788496,0.00013072362,0.00023119689],"domain_scores_gemma":[0.9995489,0.00009178097,0.0000491199,0.0001996633,0.000023471976,0.000087044566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273323,0.00013512002,0.00020329196,0.00003788696,0.00007101213,0.000024612753,0.00010242597,0.00006512992,0.000005916726],"category_scores_gemma":[0.000010869252,0.00010838821,0.000024393536,0.0001447693,0.00011923005,0.00019298647,0.00003548641,0.00012661361,0.00000293868],"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.00008361808,0.0001738997,0.10964731,0.0006917707,0.00058612536,0.000002799338,0.01252225,0.000015194597,0.017870259,0.8485373,0.0046014143,0.0052680643],"study_design_scores_gemma":[0.005187133,0.0006291127,0.23991878,0.0007824629,0.00036324008,0.00022912196,0.004281113,0.00017646418,0.092348576,0.63821006,0.016299743,0.0015741758],"about_ca_topic_score_codex":0.000029948116,"about_ca_topic_score_gemma":0.0000025776915,"teacher_disagreement_score":0.21032722,"about_ca_system_score_codex":0.000009732833,"about_ca_system_score_gemma":0.000004487014,"threshold_uncertainty_score":0.44199428},"labels":[],"label_agreement":null},{"id":"W2405206777","doi":"","title":"Multicompetition numbers of some multigraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.0039240321351050765,"score_gpt":0.18986575783975831,"score_spread":0.18594172570465323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405206777","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.9900216,0.000065507964,0.000007702235,0.000007126691,0.004865971,0.00010182558,0.0000055088162,0.00019629217,0.0047284984],"genre_scores_gemma":[0.9997831,0.000008837194,0.000121548735,0.0000069442053,0.0000114027125,0.000010163255,0.000005239459,0.000020862017,0.00003192218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943,0.000020555068,0.00019047693,0.00009671919,0.00010817573,0.00015410078],"domain_scores_gemma":[0.9995734,0.000048964317,0.000032843738,0.000251195,0.00003149335,0.00006208835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013978369,0.00010654349,0.0001517142,0.00007789658,0.000033127133,0.000009654181,0.00013877779,0.00009521201,0.00005739873],"category_scores_gemma":[0.000016873777,0.00011061798,0.00007653296,0.00013262332,0.000058692618,0.00013062712,0.000011034881,0.00019174394,0.00005008029],"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.0000039443503,0.000041628948,0.0027893062,0.000057537753,0.00002846732,0.0000018542295,0.00021906574,0.00007088731,0.12732238,0.8689833,0.00021531279,0.00026629772],"study_design_scores_gemma":[0.0024651662,0.00007882737,0.023211928,0.000097231125,0.000042005355,0.00001692497,0.00030449987,0.005098594,0.21139792,0.75020665,0.0064515206,0.00062874774],"about_ca_topic_score_codex":0.000023407776,"about_ca_topic_score_gemma":0.000014445918,"teacher_disagreement_score":0.11877668,"about_ca_system_score_codex":0.0000066214907,"about_ca_system_score_gemma":0.00000593365,"threshold_uncertainty_score":0.45108703},"labels":[],"label_agreement":null},{"id":"W2405246703","doi":"","title":"Bases of primitive non-powerful signed symmetric digraphs with loops.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.003676281788547389,"score_gpt":0.180556490818496,"score_spread":0.1768802090299486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405246703","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.96975785,0.00040002863,0.00014390568,0.000011097277,0.00074173254,0.00023830161,0.000007080639,0.00017035489,0.028529653],"genre_scores_gemma":[0.99979687,0.000016369026,0.00005637392,0.000024852256,0.0000059444724,0.000007660533,0.000005522009,0.000024013718,0.00006238021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990895,0.000037608366,0.00023924555,0.00017053145,0.00020624972,0.00025688802],"domain_scores_gemma":[0.999355,0.00010952883,0.00006198532,0.000303661,0.00008155695,0.000088266555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015352336,0.00019773617,0.00030750895,0.00025840258,0.000038462564,0.000018012188,0.00018831903,0.000079403406,0.000019489013],"category_scores_gemma":[0.000022550468,0.0001735378,0.00008294789,0.0009984423,0.000049405447,0.000139388,0.000009366876,0.00012303721,0.000019749808],"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.00013751144,0.0003886166,0.0072577125,0.0001847707,0.00026627412,0.00005869346,0.00092308986,0.0006039211,0.01590476,0.9693895,0.0021015585,0.0027836212],"study_design_scores_gemma":[0.00905742,0.0054729115,0.1541423,0.0011027326,0.00036982275,0.00007613297,0.0015243262,0.0030208507,0.3439828,0.47674388,0.0020457471,0.002461082],"about_ca_topic_score_codex":0.000008403565,"about_ca_topic_score_gemma":0.0000010934797,"teacher_disagreement_score":0.4926456,"about_ca_system_score_codex":0.000024302963,"about_ca_system_score_gemma":0.0000154746,"threshold_uncertainty_score":0.70766664},"labels":[],"label_agreement":null},{"id":"W2405330168","doi":"","title":"A New Sufficient Condition for Graphs to Have (g, f)-Factors.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011438246691691752,"score_gpt":0.22834143345803912,"score_spread":0.21690318676634737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405330168","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.9905737,0.0001878677,0.0012224903,0.000017330069,0.0056684017,0.00040277696,0.00001623968,0.0002341445,0.0016770182],"genre_scores_gemma":[0.9995568,0.0000015918511,0.00010486526,0.000022983308,0.00002807519,0.00005573353,0.00002286709,0.00003200452,0.0001750793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923825,0.000019502211,0.0001648951,0.000111067966,0.00011089696,0.0003554064],"domain_scores_gemma":[0.9994215,0.00007048682,0.000021393218,0.00020216408,0.000027938939,0.0002565443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018198405,0.00014284655,0.00015643574,0.00010129048,0.00006944615,0.000026151763,0.00011441704,0.00007384043,0.000039842456],"category_scores_gemma":[0.000022617613,0.00014147529,0.00009154658,0.0001546676,0.000009151832,0.00013188233,0.00001308824,0.00006797107,0.000073310555],"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.000009920273,0.000051702445,0.008367964,0.000041763808,0.000041060746,3.327792e-7,0.0018978147,0.00021317047,0.0024525782,0.9674679,0.019269966,0.0001858226],"study_design_scores_gemma":[0.0029830907,0.0005831697,0.037140384,0.00015146653,0.00013079974,0.000012690096,0.0030487194,0.000978083,0.0801831,0.7604856,0.11282459,0.0014783181],"about_ca_topic_score_codex":0.000013638349,"about_ca_topic_score_gemma":0.0000024179885,"teacher_disagreement_score":0.20698233,"about_ca_system_score_codex":0.00004431204,"about_ca_system_score_gemma":0.000007536887,"threshold_uncertainty_score":0.5769195},"labels":[],"label_agreement":null},{"id":"W2405364265","doi":"","title":"Combinatorial Aspects of Mixed Arrangements.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0064617018763778915,"score_gpt":0.18691422422824985,"score_spread":0.18045252235187195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405364265","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.9162414,0.00020237776,0.000011720963,0.000013484991,0.010127951,0.000292909,0.0000032339817,0.00022764372,0.07287929],"genre_scores_gemma":[0.99981606,0.000008729027,0.000013104771,0.0000070600563,0.00001985987,0.000058967405,0.0000060490274,0.000034844612,0.000035320038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990189,0.00005510798,0.00030635556,0.00014122338,0.00021219923,0.0002662136],"domain_scores_gemma":[0.99937004,0.000058428155,0.000053944903,0.0003439363,0.00007860342,0.00009504515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016200941,0.00017070006,0.0002737118,0.0000903344,0.000043301552,0.00002670078,0.0002498726,0.00009807704,0.0002307428],"category_scores_gemma":[0.000020919022,0.00017410489,0.00009038632,0.00025208597,0.000050067385,0.00018056761,0.000029847777,0.00012850214,0.0003176465],"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.0000040380028,0.00006325358,0.0010123658,0.000077523444,0.00008153822,0.0000021963556,0.00013019,0.000034865294,0.009399348,0.9853153,0.0034570536,0.0004223114],"study_design_scores_gemma":[0.0011652401,0.00008137893,0.0046350723,0.000039312992,0.000017359213,0.000002188996,0.000096685406,0.00024775253,0.029561535,0.9622557,0.0016784557,0.00021930276],"about_ca_topic_score_codex":0.000035604477,"about_ca_topic_score_gemma":0.0000012725181,"teacher_disagreement_score":0.08357468,"about_ca_system_score_codex":0.000031852767,"about_ca_system_score_gemma":0.000009649673,"threshold_uncertainty_score":0.7099792},"labels":[],"label_agreement":null},{"id":"W2405458804","doi":"","title":"Doubly resolvable designs with small parameters.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Correctness; Mathematics; Isomorphism (crystallography); Range (aeronautics); Algorithm; Combinatorics; Discrete mathematics; Geometry; Crystallography","score_opus":0.017414890843408783,"score_gpt":0.18680161939479156,"score_spread":0.1693867285513828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405458804","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.9725523,0.000107879045,0.0017177719,0.00001574935,0.001152434,0.0001603244,0.0000010593856,0.0004293378,0.02386316],"genre_scores_gemma":[0.9988328,0.0000038483718,0.0008315422,0.000032694436,0.000008143835,0.000034590954,0.0000031130978,0.00004165452,0.00021160427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992185,0.00006794152,0.00014936084,0.00016305885,0.00011166873,0.000289451],"domain_scores_gemma":[0.99938166,0.000097200864,0.000025642485,0.00036954257,0.000028163242,0.00009779509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918115,0.00016024958,0.00019000348,0.000059415728,0.000070236616,0.00004944098,0.000196906,0.00007840096,0.000015627744],"category_scores_gemma":[0.000013938017,0.00013957199,0.000042528183,0.00019231871,0.00003743167,0.0000833887,0.000013945317,0.00014148762,0.00011508502],"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.000053226668,0.000049345705,0.0031295563,0.00010630342,0.00010988455,0.000013970426,0.00039388743,0.0058788443,0.002094405,0.9843703,0.002625751,0.0011745497],"study_design_scores_gemma":[0.00462679,0.0010304198,0.0025757952,0.0002857201,0.00011131352,0.00005953311,0.00023177918,0.011975198,0.04379364,0.8803325,0.053509388,0.0014678695],"about_ca_topic_score_codex":0.000019918281,"about_ca_topic_score_gemma":0.000009185256,"teacher_disagreement_score":0.10403772,"about_ca_system_score_codex":0.000023609835,"about_ca_system_score_gemma":0.0000069845887,"threshold_uncertainty_score":0.5691581},"labels":[],"label_agreement":null},{"id":"W2405593239","doi":"","title":"Orthogonal (g, f)-Factorization in Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Combinatorics; Algorithm","score_opus":0.007537132509937611,"score_gpt":0.1967244218576037,"score_spread":0.18918728934766607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405593239","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.98650765,0.000418931,0.00004120732,0.0000036842482,0.0042767585,0.00008680163,0.0000017981549,0.00016112477,0.008502039],"genre_scores_gemma":[0.9998787,0.000013851101,0.000013689986,0.0000085524625,0.000012808262,0.000017297132,0.000009125995,0.00001974024,0.00002624006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993862,0.000037892616,0.00015421292,0.00006874416,0.00010073367,0.00025223897],"domain_scores_gemma":[0.99973893,0.000029140481,0.000015456953,0.00013227474,0.000011645476,0.00007254121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020732702,0.00009783172,0.000108346845,0.00010244148,0.000025728365,0.000011393188,0.000080568694,0.00007276518,0.000036942216],"category_scores_gemma":[0.000010472995,0.00010258051,0.00003555334,0.00030914493,0.000012910943,0.00022721307,0.000009595713,0.00010956661,0.00007076834],"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.0000021706294,0.000030623432,0.18621483,0.000017856031,0.000009157008,9.945453e-7,0.0003146977,0.00008353871,0.0009261975,0.81195587,0.00021329362,0.00023077437],"study_design_scores_gemma":[0.0010510627,0.000034013745,0.36886683,0.0000573391,0.000013248387,0.000010647366,0.00017108952,0.000543887,0.0037534027,0.6168077,0.008185511,0.00050526223],"about_ca_topic_score_codex":0.000003848189,"about_ca_topic_score_gemma":0.0000025669278,"teacher_disagreement_score":0.19514814,"about_ca_system_score_codex":0.000030453968,"about_ca_system_score_gemma":0.0000037969262,"threshold_uncertainty_score":0.41831118},"labels":[],"label_agreement":null},{"id":"W2405638771","doi":"","title":"Uniformly Least Reliable Graphs in Class Ω(n, e) as e ≤ n+1.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.003918950575033811,"score_gpt":0.18814208400397403,"score_spread":0.18422313342894023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405638771","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.92468303,0.00008370331,0.0000014239491,0.000028865827,0.005173272,0.00013450446,0.000001915875,0.00025882767,0.069634445],"genre_scores_gemma":[0.9994483,0.00001521166,0.000023717801,0.000028774866,0.000009548181,0.000027759299,0.0000051077595,0.00003718777,0.00040440707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910134,0.000021926393,0.0002387684,0.00016497454,0.00014118705,0.0003317921],"domain_scores_gemma":[0.9994262,0.00003785359,0.000025308653,0.00037864735,0.000029461999,0.000102545564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030706404,0.0001644885,0.00019110361,0.00016113381,0.000055528297,0.000037455244,0.00025248586,0.00016822989,0.00009540236],"category_scores_gemma":[0.00002348876,0.00017145312,0.000063107895,0.00044357305,0.000044724846,0.0001821022,0.000024375084,0.0004891046,0.0003604545],"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.000007910212,0.000036137306,0.008459454,0.000032782646,0.000014238371,0.000017394837,0.00017523806,0.00017056812,0.007440268,0.98169374,0.0017441104,0.00020814512],"study_design_scores_gemma":[0.00094405457,0.00005316364,0.0056105074,0.000045848978,0.0000075462112,0.00002623064,0.00017060353,0.0011164927,0.0056198393,0.95507723,0.030985145,0.00034334513],"about_ca_topic_score_codex":0.00007691176,"about_ca_topic_score_gemma":0.000102815095,"teacher_disagreement_score":0.07476524,"about_ca_system_score_codex":0.000022627799,"about_ca_system_score_gemma":0.00001824608,"threshold_uncertainty_score":0.6991656},"labels":[],"label_agreement":null},{"id":"W2405675654","doi":"","title":"Noncrossing partitions with fixed points having specific properties.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fixed point; Combinatorics; Mathematical analysis","score_opus":0.02552286593011667,"score_gpt":0.1974335337472431,"score_spread":0.17191066781712644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405675654","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.988336,0.00049171137,0.00011530171,0.000032306114,0.0017748814,0.0001600886,0.0000026024723,0.00039517155,0.008691907],"genre_scores_gemma":[0.99957854,0.000004350432,0.00013781866,0.000013811352,0.00001965929,0.00003488056,0.000004775425,0.000040353705,0.00016581675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917763,0.000043047785,0.00017831005,0.00015194368,0.0001776263,0.0002714348],"domain_scores_gemma":[0.99945563,0.000016430075,0.000026686672,0.00028329296,0.00006924786,0.00014868246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019550802,0.00015042866,0.00016410007,0.00005524972,0.0001268513,0.00012293248,0.00013343626,0.000057215908,0.000018001003],"category_scores_gemma":[0.000013336158,0.00012746158,0.00003481355,0.0002296883,0.00007301845,0.00023829061,0.000019529087,0.00014462206,0.00016338279],"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.00032779123,0.0005637049,0.053332534,0.0005332124,0.00052507076,0.0003271897,0.019580433,0.01602733,0.05201926,0.781817,0.07160594,0.0033405349],"study_design_scores_gemma":[0.01602972,0.0012330983,0.016580932,0.0029018072,0.00021048036,0.00054224144,0.010629431,0.012015835,0.16348264,0.6003882,0.1710723,0.0049133096],"about_ca_topic_score_codex":0.000008659947,"about_ca_topic_score_gemma":0.0000049255445,"teacher_disagreement_score":0.18142879,"about_ca_system_score_codex":0.00007296161,"about_ca_system_score_gemma":0.000024537896,"threshold_uncertainty_score":0.5197732},"labels":[],"label_agreement":null},{"id":"W2405684560","doi":"","title":"Some lower bounds for constant weight codes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Constant (computer programming); Computer science","score_opus":0.006075279834648352,"score_gpt":0.2026145908808941,"score_spread":0.19653931104624575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405684560","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.9637307,0.0026381656,0.00022765154,0.00015495486,0.012339068,0.0005231175,0.00003355444,0.00073542586,0.019617347],"genre_scores_gemma":[0.99946314,0.00003590587,0.000049567436,0.000104711704,0.000043126187,0.000027665808,0.000009117222,0.00002418532,0.00024259143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921775,0.000017618691,0.00020806675,0.00014790284,0.00010797943,0.00030069702],"domain_scores_gemma":[0.999529,0.00006203067,0.000025393674,0.0002589531,0.000036191002,0.00008844497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018784759,0.00015880239,0.00021707315,0.000058660124,0.00009034291,0.00004471923,0.0001618583,0.00009890454,0.00002323223],"category_scores_gemma":[0.000012589012,0.00015708985,0.00010108612,0.00012006272,0.00003610943,0.000146732,0.0000069295847,0.00010055727,0.000048352813],"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.000018969698,0.00004381071,0.00005806668,0.000024294655,0.000034277706,0.000007291466,0.00007749159,0.00003894682,0.0024860876,0.9859487,0.010827147,0.00043492758],"study_design_scores_gemma":[0.0009825577,0.0001561629,0.00016438568,0.0000351896,0.000018445051,0.0000071533964,0.000023686054,0.0009684658,0.0042724432,0.95455384,0.038563445,0.00025425016],"about_ca_topic_score_codex":0.0000010061608,"about_ca_topic_score_gemma":5.0616774e-7,"teacher_disagreement_score":0.035732415,"about_ca_system_score_codex":0.000044800887,"about_ca_system_score_gemma":0.0000132140985,"threshold_uncertainty_score":0.6405938},"labels":[],"label_agreement":null},{"id":"W2405750571","doi":"","title":"On pairs of graphs having n-2 cards in common.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.0055266059417526745,"score_gpt":0.1902429468726312,"score_spread":0.18471634093087855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405750571","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.98856705,0.0001691733,0.0000018593043,0.000008748583,0.0012758307,0.00016981704,0.0000019218094,0.00010220692,0.00970338],"genre_scores_gemma":[0.9998859,0.000007022185,0.000007765902,0.000010602168,0.0000019283477,0.000038770017,0.0000020543525,0.000021515525,0.000024399655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992911,0.000056781937,0.00024195714,0.000099843965,0.00012190668,0.0001883602],"domain_scores_gemma":[0.99954236,0.00009554429,0.000028251778,0.00026452093,0.000021642461,0.000047703496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018555176,0.0001161293,0.00023052866,0.00013829624,0.000021596998,0.00001276138,0.00015521588,0.000074734824,0.000046263096],"category_scores_gemma":[0.000012261606,0.000116769304,0.00006601811,0.00025024242,0.00002932698,0.00009114873,0.000015733212,0.00015051624,0.000054551612],"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.000004557637,0.000060912345,0.035200253,0.00008880224,0.00003068424,0.0000056484782,0.00051431597,0.0010403431,0.0023456588,0.9577973,0.0021470156,0.00076453306],"study_design_scores_gemma":[0.000600656,0.00007970517,0.044912737,0.00014281685,0.000005949193,0.0000019436998,0.00023944922,0.0013411063,0.0044760224,0.9478964,0.00010429447,0.00019887953],"about_ca_topic_score_codex":0.00016235794,"about_ca_topic_score_gemma":0.000013689716,"teacher_disagreement_score":0.011318879,"about_ca_system_score_codex":0.00002740054,"about_ca_system_score_gemma":0.0000040762475,"threshold_uncertainty_score":0.4761714},"labels":[],"label_agreement":null},{"id":"W2405826658","doi":"","title":"Flag-transitive 2-(v, k, 4) symmetric designs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flag (linear algebra); Mathematics; Transitive relation; Combinatorics; Pure mathematics; Algebra over a field","score_opus":0.007775203233054368,"score_gpt":0.19661416787257907,"score_spread":0.1888389646395247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405826658","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.963121,0.00015544194,0.00021486267,0.000014958065,0.0065636775,0.00015856238,0.0000043547143,0.0004417594,0.029325403],"genre_scores_gemma":[0.99970645,0.000008851664,0.00006180364,0.000020548927,0.000020825015,0.000024145675,0.0000040826876,0.00003728035,0.00011602485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992296,0.000039328806,0.00016985639,0.00015276055,0.0001399679,0.0002684946],"domain_scores_gemma":[0.99943113,0.000104638835,0.000018857963,0.0002909749,0.00004288657,0.00011153558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027157925,0.0001578635,0.00017325119,0.0001569683,0.00007451273,0.000035577825,0.00019716063,0.00013588094,0.00008045743],"category_scores_gemma":[0.000031941752,0.00016144526,0.00007623445,0.0005102518,0.000041777308,0.00012622605,0.000011288034,0.00034760757,0.00027961464],"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.0000057855505,0.00003203608,0.0006233218,0.000034421344,0.00005018839,0.000017304055,0.0003026131,0.000052074483,0.05127153,0.94507754,0.0012102614,0.0013229349],"study_design_scores_gemma":[0.0016819555,0.00013871842,0.008944574,0.00005052186,0.00006472044,0.00006206915,0.00023201585,0.0037821883,0.1298844,0.8414274,0.012801134,0.00093029975],"about_ca_topic_score_codex":0.000007952507,"about_ca_topic_score_gemma":0.000005210473,"teacher_disagreement_score":0.10365013,"about_ca_system_score_codex":0.000016995727,"about_ca_system_score_gemma":0.000010043442,"threshold_uncertainty_score":0.6583547},"labels":[],"label_agreement":null},{"id":"W2405894551","doi":"10.1007/978-3-319-30000-9_17","title":"Parallelogram Morphisms and Circular Codes","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Université du Québec à Montréal","funders":"","keywords":"Parallelogram; Polyomino; Morphism; Conjecture; Mathematics; Combinatorics; Combinatorics on words; Discrete mathematics; Topology (electrical circuits); Computer science; Geometry; Artificial intelligence","score_opus":0.009193571575240474,"score_gpt":0.1955154666855668,"score_spread":0.18632189511032632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405894551","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.0014808445,0.0023220242,0.9878485,0.000057662663,0.0011742371,0.00020449702,0.000007843906,0.00019923584,0.006705136],"genre_scores_gemma":[0.9929089,0.00013649534,0.006296603,0.00012808428,0.00028672704,0.0000076044466,0.0000018569299,0.000039819766,0.00019389972],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987091,0.000012271712,0.00022134499,0.0004673501,0.0002568564,0.00033312183],"domain_scores_gemma":[0.99926627,0.00013875049,0.00004309495,0.00042018713,0.00003432724,0.000097353884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032529872,0.0003026125,0.0003239122,0.00029034587,0.00008427804,0.00010478275,0.00046132586,0.00022880815,0.00002328222],"category_scores_gemma":[0.000010965796,0.0002381482,0.00006081629,0.000107721775,0.0005357859,0.00011735149,0.000109265784,0.00028472694,0.000025397168],"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.000006592866,0.000009268423,0.00023900722,0.00027633744,0.00006259299,0.00015601641,0.0007104334,0.049884852,0.0025584812,0.05501159,0.00003620225,0.8910486],"study_design_scores_gemma":[0.00049853703,0.00012808184,0.0002963528,0.0013669506,0.000026372447,0.00027834112,3.6966034e-7,0.10847308,0.0021828671,0.87395215,0.0113197295,0.0014771968],"about_ca_topic_score_codex":0.0000019301874,"about_ca_topic_score_gemma":0.000008668837,"teacher_disagreement_score":0.9914281,"about_ca_system_score_codex":0.000056132525,"about_ca_system_score_gemma":0.000026995269,"threshold_uncertainty_score":0.97114015},"labels":[],"label_agreement":null},{"id":"W2405993510","doi":"","title":"Randomly r-Orthogonal (0, f)-Factorizations of Bipartite (0, mf-(m-1)r)-Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.004848225536207917,"score_gpt":0.19210333891340617,"score_spread":0.18725511337719825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405993510","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.98498565,0.000115904506,0.000095696225,0.000015255161,0.0062864698,0.0001678076,0.000022029652,0.00024421245,0.008066967],"genre_scores_gemma":[0.9997414,0.000015986689,0.000050563624,0.0000070766137,0.0000153157,0.000027468512,0.00001620909,0.00003343442,0.000092596674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907184,0.000037586753,0.00033239435,0.00014177343,0.00018325952,0.00023313612],"domain_scores_gemma":[0.9992867,0.000107974476,0.000057528123,0.0003579972,0.0000814846,0.000108311535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024297935,0.00016299821,0.0002561846,0.00014509806,0.00007481545,0.000022456567,0.00021337929,0.00012937195,0.00015333526],"category_scores_gemma":[0.000048581776,0.00016238133,0.00013082766,0.00043525238,0.000087642205,0.00014702576,0.000019668716,0.00026058534,0.000045281504],"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.000014863252,0.0000476193,0.01602091,0.000044907138,0.000065911416,0.0000021133687,0.00019883674,0.00014842534,0.06088119,0.9215398,0.00084340374,0.00019204132],"study_design_scores_gemma":[0.0043539647,0.00010999922,0.029530667,0.000070178074,0.000091136804,0.000022986802,0.00009236198,0.0017257446,0.06980135,0.8708893,0.022577126,0.00073520164],"about_ca_topic_score_codex":0.00000608677,"about_ca_topic_score_gemma":0.000014204923,"teacher_disagreement_score":0.050650496,"about_ca_system_score_codex":0.0000066965563,"about_ca_system_score_gemma":0.000018123917,"threshold_uncertainty_score":0.66217184},"labels":[],"label_agreement":null},{"id":"W2406017096","doi":"","title":"On resolvable packing RMP(3, 3, v) and covering RMC(3, 3, v).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011970310693283286,"score_gpt":0.18032626804368657,"score_spread":0.1683559573504033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406017096","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.92336655,0.00034198796,0.000026156653,0.0000028374434,0.0017229359,0.00010036443,0.00000201316,0.00028924775,0.07414792],"genre_scores_gemma":[0.9997318,0.00003267262,0.00004010079,0.000024929412,0.0000075572993,0.000013320439,0.0000013544143,0.000037354974,0.000110903995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927527,0.000031663145,0.00016010505,0.00016732854,0.0001068473,0.00025879976],"domain_scores_gemma":[0.99954015,0.000059796123,0.00002422858,0.0002717166,0.00001578978,0.00008830954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019387431,0.00015557917,0.00016754148,0.000076108954,0.000090096335,0.000030466375,0.00012541295,0.00008167371,0.00007062011],"category_scores_gemma":[0.000020253045,0.00015955088,0.000037413643,0.00012585791,0.000032247364,0.00013274618,0.000031610438,0.00015726352,0.00009464571],"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.000023331773,0.000029313213,0.0021881466,0.00006336486,0.0000413421,0.000021015567,0.0010674329,0.000068190864,0.0010276511,0.99400854,0.0010612607,0.00040042555],"study_design_scores_gemma":[0.0013068056,0.0001893259,0.0050295806,0.00019409019,0.000022258311,0.000021222291,0.00025663918,0.0012229548,0.013553318,0.9746131,0.0031057524,0.00048496478],"about_ca_topic_score_codex":0.000022281949,"about_ca_topic_score_gemma":0.0000038738135,"teacher_disagreement_score":0.07636526,"about_ca_system_score_codex":0.000025430474,"about_ca_system_score_gemma":0.0000040433306,"threshold_uncertainty_score":0.65062964},"labels":[],"label_agreement":null},{"id":"W2406159084","doi":"","title":"Maximum Hexagon Packing of K v -L Where L is a 2-regular Subgraph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005187919504921489,"score_gpt":0.17967688053724337,"score_spread":0.1744889610323219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406159084","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.99155426,0.0013474768,0.000029196066,0.000041256175,0.0016567154,0.00022095494,0.0000045561187,0.00019811321,0.0049474854],"genre_scores_gemma":[0.99968,0.00004470363,0.00004216941,0.000019364421,0.000009108624,0.00003444663,0.000002825163,0.000039910497,0.00012748034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990755,0.00004315814,0.0002765326,0.00015522788,0.00017375767,0.00027587364],"domain_scores_gemma":[0.99933946,0.000038917962,0.000051337018,0.00041515398,0.0000687613,0.00008636677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001531361,0.00017401417,0.00025675577,0.00010285886,0.00004619855,0.00003384431,0.00022773922,0.00011478463,0.00029391772],"category_scores_gemma":[0.0000074914788,0.00017388063,0.0001186752,0.00030085602,0.000047481542,0.00019545663,0.000027774617,0.00013228638,0.00016325769],"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.000014926266,0.00016018443,0.03146943,0.0009955573,0.00043043727,0.000014608478,0.0033405907,0.00019394574,0.0687233,0.84811485,0.040292673,0.0062495167],"study_design_scores_gemma":[0.00085806375,0.0000882324,0.006008496,0.00022504007,0.000032566953,0.0000107328415,0.000592604,0.0011049564,0.046008404,0.938245,0.0063808947,0.00044500362],"about_ca_topic_score_codex":0.00008537452,"about_ca_topic_score_gemma":0.0000034300992,"teacher_disagreement_score":0.09013017,"about_ca_system_score_codex":0.000019726453,"about_ca_system_score_gemma":0.0000068255995,"threshold_uncertainty_score":0.70906466},"labels":[],"label_agreement":null},{"id":"W2406267159","doi":"","title":"The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Degree (music); Discrete mathematics","score_opus":0.009551465894280459,"score_gpt":0.1904916603778103,"score_spread":0.18094019448352983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406267159","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.99196184,0.002067631,0.0000041694216,0.000053906377,0.001299997,0.00021578463,0.0000015908753,0.000071240815,0.0043238294],"genre_scores_gemma":[0.9997381,0.00008679625,0.000016021002,0.0000075467206,0.000005035005,0.000035346955,6.8096267e-7,0.000015243874,0.000095225885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993241,0.000057119185,0.00020491696,0.00010460746,0.00011434351,0.00019491145],"domain_scores_gemma":[0.9993961,0.00014756326,0.000028534769,0.00031181294,0.0000472217,0.000068753994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002204959,0.00010762834,0.00014028957,0.000022790115,0.00007967777,0.00003626886,0.00015522748,0.000054719032,0.000037413218],"category_scores_gemma":[0.000033324843,0.00007644521,0.000042813685,0.00010141433,0.00008941653,0.00010983542,0.00003394253,0.00009967209,0.00004267426],"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.000024265897,0.00009912269,0.05548092,0.00033681127,0.00020214911,0.0000018749897,0.0015347418,0.00014207822,0.0064573027,0.9143019,0.0062218504,0.015197016],"study_design_scores_gemma":[0.0016563467,0.00021180704,0.17088233,0.00014226366,0.00006223191,0.000013914914,0.0015233867,0.009828726,0.016386865,0.77046776,0.028219711,0.00060465717],"about_ca_topic_score_codex":0.00004380109,"about_ca_topic_score_gemma":0.0000070940437,"teacher_disagreement_score":0.1438341,"about_ca_system_score_codex":0.00001644802,"about_ca_system_score_gemma":0.0000062699396,"threshold_uncertainty_score":0.31173453},"labels":[],"label_agreement":null},{"id":"W2406279947","doi":"","title":"Hamilton cycles in claw-heavy graphs with Fan-type condition restricted to two induced subgraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Type (biology); Structural engineering; Biology; Engineering; Ecology","score_opus":0.017130595200870645,"score_gpt":0.2411993602845563,"score_spread":0.22406876508368564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406279947","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.99360055,0.00011357453,0.000009256892,0.000022628246,0.002016652,0.00039083976,0.0000050583003,0.00036259924,0.003478843],"genre_scores_gemma":[0.99974936,0.000011914007,0.000035287852,0.00004079067,0.000009982396,0.00005138878,0.000031535896,0.000049623257,0.00002013064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986806,0.000120224984,0.0002964217,0.00026073246,0.00026953235,0.00037251707],"domain_scores_gemma":[0.9991614,0.00005511086,0.000044408935,0.0003784077,0.00011483417,0.0002458368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021715432,0.00024076806,0.0002937534,0.0004328183,0.000050448652,0.00004849349,0.00021930157,0.00013558599,0.000005480959],"category_scores_gemma":[0.00003291673,0.00023373157,0.00004136031,0.001637414,0.000035853544,0.00021080479,0.000018596253,0.0002746148,0.00006477789],"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.00057811616,0.0002637108,0.043276686,0.00009922227,0.00016301453,0.0001543475,0.0050947065,0.0031035903,0.03240186,0.9092875,0.004988296,0.00058892334],"study_design_scores_gemma":[0.009746278,0.0017675156,0.12558833,0.00051847746,0.00007154757,0.000057889112,0.0019230628,0.00092077104,0.04532906,0.80952543,0.002845549,0.001706081],"about_ca_topic_score_codex":0.00020413671,"about_ca_topic_score_gemma":0.00017423343,"teacher_disagreement_score":0.09976209,"about_ca_system_score_codex":0.000092472794,"about_ca_system_score_gemma":0.000033300526,"threshold_uncertainty_score":0.9531297},"labels":[],"label_agreement":null},{"id":"W2406529202","doi":"","title":"The local bases of primitive non-powerfull signed symmetric digraphs with loops.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0029945307393601348,"score_gpt":0.17497462976232142,"score_spread":0.1719800990229613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406529202","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.97857094,0.0009376043,0.0008917207,0.000031005486,0.00085593574,0.0003082675,0.0000055705896,0.00015428873,0.018244654],"genre_scores_gemma":[0.9998235,0.00003299706,0.0000210661,0.000022661117,0.0000058785636,0.000012699333,0.0000028229113,0.000021053324,0.000057310655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904585,0.000054395005,0.00024195893,0.00015011811,0.00022524696,0.00028245838],"domain_scores_gemma":[0.9991741,0.00026028437,0.0000617727,0.0003406164,0.00008585076,0.000077386736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023979857,0.00018523748,0.0002402839,0.00012864634,0.00010362447,0.00002838428,0.00025300516,0.00007128475,0.000006351035],"category_scores_gemma":[0.000025485444,0.00012715954,0.00008329541,0.0008425135,0.00012146636,0.000099263394,0.0000120169025,0.00014661773,0.000013162376],"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.00015216527,0.0001689785,0.0017631388,0.00006568828,0.00019649748,0.00002733911,0.0004686523,0.00084884086,0.0025708266,0.9831918,0.0014933533,0.009052747],"study_design_scores_gemma":[0.008476632,0.005997533,0.07592055,0.00086646475,0.00036944787,0.00008902762,0.0040055467,0.012876111,0.2055764,0.6773112,0.006229417,0.002281671],"about_ca_topic_score_codex":0.000009734188,"about_ca_topic_score_gemma":0.0000033085832,"teacher_disagreement_score":0.30588058,"about_ca_system_score_codex":0.000028232202,"about_ca_system_score_gemma":0.000018490613,"threshold_uncertainty_score":0.5185416},"labels":[],"label_agreement":null},{"id":"W2406857893","doi":"","title":"λ-Designs with Two Block Sizes II.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics","score_opus":0.007694619601587805,"score_gpt":0.20159603403396145,"score_spread":0.19390141443237366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406857893","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.9743698,0.00023166987,0.000024790224,0.00004942398,0.00083935744,0.00013241154,0.0000013001984,0.0004819564,0.023869252],"genre_scores_gemma":[0.99950737,0.0000060461125,0.00006279195,0.000045733574,0.0000146575585,0.000009388923,0.0000018197392,0.000022189028,0.00033000467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993348,0.000027991153,0.00013390297,0.0001323715,0.00012929089,0.00024161479],"domain_scores_gemma":[0.99958104,0.000031174142,0.000020026186,0.00026262764,0.00002494088,0.00008017343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011527992,0.00015440739,0.00017034991,0.00005049457,0.00010419463,0.000026952644,0.00015511464,0.000049833438,0.000021836633],"category_scores_gemma":[0.0000055475557,0.0001341905,0.000041049072,0.0002136663,0.000022175695,0.00009818638,0.00000872362,0.00012541375,0.000054114356],"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.000024026212,0.00007759559,0.00069083937,0.000018620312,0.000060193233,0.00003078899,0.00047939311,0.0014974378,0.006517703,0.9866757,0.003349864,0.00057783374],"study_design_scores_gemma":[0.003661757,0.0011590696,0.0049952096,0.00017031013,0.00007233025,0.000090764974,0.00016648804,0.0016313479,0.030837711,0.94447386,0.011747197,0.0009939722],"about_ca_topic_score_codex":0.0000036502988,"about_ca_topic_score_gemma":0.000001926013,"teacher_disagreement_score":0.04220186,"about_ca_system_score_codex":0.00002299026,"about_ca_system_score_gemma":0.000008205386,"threshold_uncertainty_score":0.54721296},"labels":[],"label_agreement":null},{"id":"W2407064758","doi":"","title":"A Family of Chromatically Unique 6-bridge Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bridge (graph theory); Combinatorics; Medicine","score_opus":0.006194934746990607,"score_gpt":0.19794748961370587,"score_spread":0.19175255486671527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407064758","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.981058,0.00007495575,0.00004274588,0.000009216234,0.0025490979,0.00013143146,0.0000055476885,0.00022590214,0.015903115],"genre_scores_gemma":[0.99976903,0.0000087166245,0.00012940429,0.000014453743,0.00000545241,0.000018026914,0.0000030796882,0.000027307357,0.000024528676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992848,0.00003294382,0.00025716226,0.00010539377,0.0001338924,0.0001857805],"domain_scores_gemma":[0.9994094,0.000068078785,0.000034168625,0.0003578337,0.000047706344,0.00008281175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025794245,0.00012891693,0.00021603839,0.00008561804,0.000030568182,0.000013042647,0.0002256581,0.000116849915,0.000031374813],"category_scores_gemma":[0.000027956801,0.00012681636,0.00008521704,0.00024399754,0.000071888026,0.000077103505,0.000019941597,0.00023157017,0.00003625154],"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.0000029350392,0.00003146336,0.001102962,0.00007372594,0.00003475465,0.000003826722,0.00013368078,0.000009055946,0.15222992,0.845443,0.0007477324,0.00018692114],"study_design_scores_gemma":[0.0005706215,0.00007262419,0.04046984,0.000052334595,0.000021193799,0.000012633608,0.00003509789,0.00070932327,0.038813196,0.9174883,0.0014912712,0.00026361307],"about_ca_topic_score_codex":0.00001754511,"about_ca_topic_score_gemma":0.0000054900083,"teacher_disagreement_score":0.11341673,"about_ca_system_score_codex":0.000006900185,"about_ca_system_score_gemma":0.000012946599,"threshold_uncertainty_score":0.5171421},"labels":[],"label_agreement":null},{"id":"W2407176354","doi":"","title":"On Finding Lagrangians of 3-uniform Hypergraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.013276416988822702,"score_gpt":0.20700683761048091,"score_spread":0.1937304206216582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407176354","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.95934135,0.000068189365,0.000037410573,0.0000154216,0.0021867116,0.000107497326,0.0000048721918,0.00014737324,0.038091157],"genre_scores_gemma":[0.9998117,0.000002126163,0.000041669988,0.00002252521,0.000005194844,0.000009894496,0.0000022915917,0.00002205572,0.00008255759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994012,0.000020100451,0.00015758838,0.000090665104,0.00015628187,0.00017414884],"domain_scores_gemma":[0.99953693,0.00004586998,0.0000198836,0.00022767634,0.000036374022,0.00013325196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002232317,0.000105642044,0.0001604472,0.00014819925,0.000023735458,0.0000095974765,0.0001590039,0.000058600584,0.000009261472],"category_scores_gemma":[0.000032549266,0.000103046885,0.0000559614,0.00033839582,0.000015712178,0.000053573935,0.000013642428,0.00008405674,0.0001202892],"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.00001729737,0.000033755103,0.0007066787,0.000034019835,0.00003453179,0.00000469157,0.00095925294,0.0027425445,0.0018187913,0.98854613,0.0047728755,0.0003294317],"study_design_scores_gemma":[0.0017380038,0.0005549326,0.001284925,0.00020165143,0.000028310249,0.00001053184,0.00083730544,0.0013359052,0.027702838,0.9579682,0.00782075,0.0005166593],"about_ca_topic_score_codex":0.000009120203,"about_ca_topic_score_gemma":0.000002512893,"teacher_disagreement_score":0.040470317,"about_ca_system_score_codex":0.00002898534,"about_ca_system_score_gemma":0.000007644744,"threshold_uncertainty_score":0.420213},"labels":[],"label_agreement":null},{"id":"W2407266695","doi":"","title":"Sign-Imbalance Of Alternating Permutations Avoiding A Pattern Of Length Three.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sign (mathematics); Combinatorics; Mathematical analysis","score_opus":0.0076332010010652035,"score_gpt":0.196673426288001,"score_spread":0.1890402252869358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407266695","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.9949703,0.00018059403,0.001171364,0.000007729998,0.00084489735,0.00016574292,0.000005817164,0.00008187363,0.0025716543],"genre_scores_gemma":[0.9998693,0.0000070053766,0.000035127032,0.0000043626283,0.000007909475,0.00003180983,0.0000028031814,0.00002248628,0.000019212639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992625,0.000042143503,0.0003048653,0.000097413,0.00013519914,0.00015788375],"domain_scores_gemma":[0.9994564,0.00013894681,0.00008801951,0.00020359768,0.00007375688,0.000039262395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017344939,0.00010593122,0.00020255016,0.000067742425,0.00004396524,0.000012669502,0.00017180176,0.000046116555,0.000054526365],"category_scores_gemma":[0.000029904058,0.00010902103,0.00006382891,0.00015116823,0.000031116255,0.0001449643,0.000020968238,0.00012266134,0.0000273386],"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.0000051075303,0.00015098054,0.14895308,0.00091619056,0.00031608992,0.0000049364585,0.00630271,0.006273075,0.17248876,0.6571034,0.00052466,0.0069609657],"study_design_scores_gemma":[0.0019392545,0.00021151922,0.077183455,0.000758634,0.00006296794,0.0000137345305,0.0025090254,0.092473775,0.11738943,0.7066394,0.000104042985,0.0007147647],"about_ca_topic_score_codex":0.00013450491,"about_ca_topic_score_gemma":0.000008005045,"teacher_disagreement_score":0.0862007,"about_ca_system_score_codex":0.000016132319,"about_ca_system_score_gemma":0.000005860553,"threshold_uncertainty_score":0.44457483},"labels":[],"label_agreement":null},{"id":"W2407269589","doi":"","title":"Nonexistence of Some (945, 177, 33)-difference Sets.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.007304961951530924,"score_gpt":0.20191479449025918,"score_spread":0.19460983253872824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407269589","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.98752147,0.00013553465,0.000006188862,0.000012528498,0.0052262456,0.000110481276,0.000012143582,0.00018821684,0.0067871916],"genre_scores_gemma":[0.9997155,0.000012811602,0.00006788537,0.000012597202,0.000009961198,0.000016349226,0.000003720251,0.000024905978,0.00013627886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991741,0.000027253038,0.00024622417,0.00015121029,0.0001641704,0.00023702323],"domain_scores_gemma":[0.99930406,0.00007381413,0.00004781189,0.00044442888,0.000040394254,0.00008948042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019205347,0.0001537067,0.00023326305,0.00006833818,0.000045406712,0.000017422477,0.00032851487,0.00012173541,0.000047396476],"category_scores_gemma":[0.000028715685,0.00015204247,0.00007311432,0.00017196414,0.00008601688,0.00010287448,0.00003355504,0.00029015064,0.000081875995],"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.0000049364894,0.00003641076,0.0018409757,0.00009412135,0.000026180696,0.0000048380557,0.00042986774,0.000023891393,0.09576022,0.90106016,0.00027028378,0.00044811578],"study_design_scores_gemma":[0.0006699208,0.00007936142,0.013082415,0.00007505303,0.000021421263,0.000018781973,0.00015487822,0.001543147,0.060059823,0.9224884,0.0014142338,0.0003925816],"about_ca_topic_score_codex":0.000014016206,"about_ca_topic_score_gemma":0.0000060455095,"teacher_disagreement_score":0.0357004,"about_ca_system_score_codex":0.000010209581,"about_ca_system_score_gemma":0.00001282987,"threshold_uncertainty_score":0.6200112},"labels":[],"label_agreement":null},{"id":"W2407401989","doi":"","title":"Packings and coverings for four particular graphs each with six vertices and nine edges (λ = 1).","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009350327919304222,"score_gpt":0.19242279357565728,"score_spread":0.18307246565635305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407401989","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.99637556,0.0022649982,0.0000894387,0.000025472731,0.000618596,0.00022052837,0.0000035158714,0.00012317013,0.00027870017],"genre_scores_gemma":[0.9996715,0.00004922007,0.00010949449,0.000020270456,0.000014059069,0.00006230377,0.0000026533764,0.000032014355,0.000038488957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.000020282578,0.00012523883,0.00013037975,0.00008882765,0.00030761777],"domain_scores_gemma":[0.9995765,0.00009355621,0.000028226037,0.00013822777,0.000027594997,0.0001358719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023395952,0.00015691738,0.00018878271,0.000045409182,0.00009085715,0.00004952299,0.000057846122,0.000061546,0.000004227864],"category_scores_gemma":[0.000019887957,0.0001328303,0.000027543541,0.00009767059,0.000060211278,0.00028614234,0.00001962745,0.00007330002,0.0000026314162],"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.00009781835,0.000075037584,0.23754756,0.0006736375,0.00030866478,0.000006049242,0.002710108,0.00006664259,0.008201445,0.74754626,0.0014363944,0.0013303973],"study_design_scores_gemma":[0.017366152,0.002284488,0.30965516,0.001051486,0.0011515759,0.0004539729,0.003361644,0.008050326,0.08892561,0.4396833,0.1239637,0.004052598],"about_ca_topic_score_codex":0.0000071197337,"about_ca_topic_score_gemma":0.0000020696689,"teacher_disagreement_score":0.30786294,"about_ca_system_score_codex":0.000009056821,"about_ca_system_score_gemma":0.0000028451607,"threshold_uncertainty_score":0.54166627},"labels":[],"label_agreement":null},{"id":"W2407657421","doi":"","title":"Embedding handcuffed designs into a maximum packing of the complete graph with 4-cycles.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Graph; Combinatorics; Computer science; Artificial intelligence","score_opus":0.012411224007322084,"score_gpt":0.21391384295560992,"score_spread":0.20150261894828783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407657421","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.995794,0.0002896263,0.00083458645,0.000040749754,0.0008173849,0.00023670186,0.0000023925074,0.00016769338,0.0018168889],"genre_scores_gemma":[0.99973553,0.0000060360735,0.00017182616,0.000030542295,0.0000071312857,0.000009605128,0.0000016867338,0.00002529372,0.000012338994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907273,0.00008015231,0.00023693047,0.00014890326,0.00020609375,0.00025517363],"domain_scores_gemma":[0.99936926,0.00006349944,0.00007110826,0.00039322866,0.000042860604,0.000060066475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022132322,0.00018351397,0.00025456044,0.00008048952,0.00014494009,0.00003331439,0.00030560445,0.00006823558,0.0000079902275],"category_scores_gemma":[0.000012296576,0.00013250933,0.00012224831,0.00042100105,0.00007359889,0.000103693106,0.000020697425,0.00017443098,0.0000052072096],"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.00011181106,0.00015193585,0.010180792,0.00028124385,0.00036837207,0.00002078789,0.005343553,0.011281394,0.096662894,0.87139076,0.0008640404,0.0033424378],"study_design_scores_gemma":[0.0014432675,0.00021580451,0.010499867,0.00043858142,0.000066168395,0.000023632118,0.0004251353,0.0031931158,0.02259234,0.9603433,0.00035341916,0.00040536653],"about_ca_topic_score_codex":0.000014282878,"about_ca_topic_score_gemma":0.000006478538,"teacher_disagreement_score":0.08895256,"about_ca_system_score_codex":0.000032382486,"about_ca_system_score_gemma":0.0000112712605,"threshold_uncertainty_score":0.54035735},"labels":[],"label_agreement":null},{"id":"W2407746905","doi":"","title":"Cyclic m-Cycle Systems of K n, n for m ≤ 30.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.00655382706042493,"score_gpt":0.20567951379392013,"score_spread":0.1991256867334952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407746905","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.9887005,0.0010038164,0.0001796449,0.000009974433,0.0028368738,0.00032197748,0.000009322599,0.00021249687,0.0067253793],"genre_scores_gemma":[0.99982435,0.000009376047,0.000020687095,0.0000086265445,0.000014890642,0.000028059123,0.000004049921,0.000017825667,0.00007213504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993531,0.000022077822,0.00024261254,0.00010013175,0.00009250465,0.00018959],"domain_scores_gemma":[0.99957675,0.000056039735,0.000039523165,0.00023802857,0.000037504706,0.000052179766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018247643,0.00010875037,0.00022070641,0.000055357166,0.00003548027,0.000015080912,0.00014923456,0.0000749642,0.000007346501],"category_scores_gemma":[0.000014818607,0.000110308836,0.00007845144,0.00012544499,0.0000145986005,0.000065405446,0.000004871903,0.000056789384,0.000021198664],"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.000008711542,0.000040081333,0.00020165762,0.00014508526,0.000035332967,0.0000012238643,0.00016506283,0.0018959953,0.009187714,0.9856278,0.0021607592,0.0005305969],"study_design_scores_gemma":[0.0023902378,0.00046594677,0.0032729157,0.00023265959,0.000056718385,0.000012522485,0.00033368837,0.012599128,0.02460118,0.9450584,0.010417704,0.00055892236],"about_ca_topic_score_codex":0.000005426294,"about_ca_topic_score_gemma":2.4876073e-7,"teacher_disagreement_score":0.040569402,"about_ca_system_score_codex":0.000019390469,"about_ca_system_score_gemma":0.0000048205497,"threshold_uncertainty_score":0.4498264},"labels":[],"label_agreement":null},{"id":"W2407813301","doi":"","title":"On flag-transitive 6 - (v, k, λ) designs with λ ≤ 5.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flag (linear algebra); Mathematics; Transitive relation; Combinatorics; Arithmetic; Pure mathematics; Algebra over a field","score_opus":0.005895360350289094,"score_gpt":0.1853010819631754,"score_spread":0.17940572161288632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407813301","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.9713807,0.00001961139,0.00017279478,0.000013090655,0.0021037988,0.000138922,0.0000033297636,0.00029195938,0.025875775],"genre_scores_gemma":[0.9997321,0.000001279293,0.00005075897,0.000027184884,0.0000102567055,0.000023762395,0.0000030302112,0.000034152035,0.000117471245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994285,0.000026254007,0.00009545776,0.00013087312,0.00012096951,0.00019794772],"domain_scores_gemma":[0.9995457,0.0000828399,0.000013449282,0.0002521639,0.000026131458,0.000079717225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012402647,0.00014027518,0.00013021451,0.000054472213,0.00006289129,0.000024163384,0.00012211267,0.00008353609,0.00006095437],"category_scores_gemma":[0.000008236353,0.000119071454,0.000035745135,0.00014459334,0.000043118915,0.000076983306,0.000004222568,0.00029540402,0.00015066074],"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.000028454331,0.000033677818,0.00022168433,0.000017584041,0.00004373508,0.000022403714,0.0003943803,0.0002062354,0.023858044,0.9742172,0.000766975,0.00018965083],"study_design_scores_gemma":[0.0022575913,0.0005911493,0.0037774951,0.00011738329,0.000048240985,0.00005342548,0.00023200685,0.0014898473,0.10280517,0.88400096,0.003820604,0.0008061388],"about_ca_topic_score_codex":0.000004354861,"about_ca_topic_score_gemma":0.000012010456,"teacher_disagreement_score":0.09021623,"about_ca_system_score_codex":0.000011258148,"about_ca_system_score_gemma":0.000008466677,"threshold_uncertainty_score":0.48555928},"labels":[],"label_agreement":null},{"id":"W2407919410","doi":"","title":"(2, t)-choosasble graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004380206951899161,"score_gpt":0.1767560710955668,"score_spread":0.17237586414366762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407919410","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.9235546,0.00019509632,0.00010611183,0.000015064058,0.0040432564,0.00007992165,0.0000012271743,0.0005456653,0.07145903],"genre_scores_gemma":[0.99968445,0.000009275542,0.000030944768,0.000032330503,0.000010258487,0.000016900294,0.00000319678,0.000028116148,0.00018454023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937254,0.000043245873,0.00014430366,0.00011631414,0.00010468999,0.0002188875],"domain_scores_gemma":[0.9995411,0.00004817605,0.000015746353,0.00029311134,0.00001883836,0.00008302214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002294182,0.000119112294,0.00014394998,0.0000644841,0.0000590249,0.000027268032,0.00016716003,0.00006775326,0.00005216525],"category_scores_gemma":[0.000016532198,0.00012036937,0.00006438141,0.00019031246,0.000024168765,0.00008618559,0.000014014933,0.00011372215,0.00030894636],"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.0000017762258,0.000012905813,0.0013282103,0.00002642825,0.000020305602,0.0000012803665,0.00008010324,0.00013916208,0.0009785702,0.9912382,0.0051904013,0.0009826949],"study_design_scores_gemma":[0.00044451567,0.00003684355,0.0017240245,0.000019920875,0.000008991895,0.0000053387807,0.000028667582,0.0017364935,0.0030917013,0.9533246,0.039367158,0.00021174426],"about_ca_topic_score_codex":0.0000051928555,"about_ca_topic_score_gemma":0.0000012738485,"teacher_disagreement_score":0.07612982,"about_ca_system_score_codex":0.000013253508,"about_ca_system_score_gemma":0.0000027771853,"threshold_uncertainty_score":0.49085203},"labels":[],"label_agreement":null},{"id":"W2407981316","doi":"","title":"Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reversing; Mathematics; Transitive relation; Combinatorics","score_opus":0.0065398971124581585,"score_gpt":0.21563064596938306,"score_spread":0.20909074885692489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407981316","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.9908766,0.00005096838,0.00012384419,0.000039902538,0.0008627127,0.00026223087,0.0000024115623,0.00006040757,0.0077209235],"genre_scores_gemma":[0.9996826,0.0000042774636,0.00019125604,0.00002507019,0.000005493432,0.000022745166,0.0000016362844,0.000025165113,0.00004177459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991275,0.000060056213,0.00028044023,0.00013037452,0.00013724514,0.00026434692],"domain_scores_gemma":[0.99962914,0.00004746653,0.000030786847,0.00016461682,0.000037347607,0.0000906676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021627393,0.0001307466,0.00023692164,0.00010912071,0.00003346488,0.000019843801,0.00012255594,0.00007003452,0.000077965444],"category_scores_gemma":[0.000015371783,0.00014600922,0.00005601317,0.00030651587,0.000019802832,0.00017602145,0.000017097967,0.00014926992,0.00011331339],"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.00017975352,0.0007235447,0.25221694,0.0013579883,0.0006482137,0.00022710167,0.061489128,0.018287541,0.16907912,0.46291146,0.008542118,0.024337085],"study_design_scores_gemma":[0.0040259142,0.00016018222,0.12287512,0.0019562463,0.00003994443,0.000043953183,0.0067838947,0.004661892,0.044922482,0.81193966,0.0013425237,0.0012481994],"about_ca_topic_score_codex":0.00013189338,"about_ca_topic_score_gemma":0.0000051598813,"teacher_disagreement_score":0.3490282,"about_ca_system_score_codex":0.00008000771,"about_ca_system_score_gemma":0.000005970178,"threshold_uncertainty_score":0.5954083},"labels":[],"label_agreement":null},{"id":"W2408046040","doi":"","title":"Groups With Restricted Squaring Properties.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.010133294088683555,"score_gpt":0.1755435700132,"score_spread":0.16541027592451646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408046040","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.98675704,0.000742649,0.00003124957,0.0000063795155,0.0017277611,0.00014623722,5.9762266e-7,0.00045216442,0.0101359],"genre_scores_gemma":[0.9997664,0.0000071249306,0.000026244184,0.000008954376,0.000023585208,0.000037667603,0.000002227441,0.000038565428,0.00008925017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99926406,0.00003327282,0.0001357262,0.00009093695,0.00013424717,0.00034174375],"domain_scores_gemma":[0.99958974,0.000014342552,0.000019942998,0.00024219819,0.000022632075,0.000111144866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012080052,0.00013752544,0.0001380042,0.000060162944,0.0000694642,0.000026830474,0.00012491838,0.00006340403,0.000014853565],"category_scores_gemma":[0.000009058241,0.00010922445,0.000028354943,0.00026918403,0.00002653077,0.00025765796,0.00001751861,0.00014632262,0.00008640558],"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.000048861955,0.000130338,0.050261617,0.00020465098,0.0001477743,0.000011364047,0.0022581639,0.0005421802,0.011675594,0.93255126,0.0014287333,0.00073945883],"study_design_scores_gemma":[0.016955933,0.0016837454,0.38579002,0.0022474395,0.00057453645,0.00066124735,0.006143732,0.013481532,0.19871457,0.28244573,0.08310909,0.008192413],"about_ca_topic_score_codex":0.000010993552,"about_ca_topic_score_gemma":0.0000011778175,"teacher_disagreement_score":0.65010554,"about_ca_system_score_codex":0.000039256913,"about_ca_system_score_gemma":0.000005766389,"threshold_uncertainty_score":0.44540438},"labels":[],"label_agreement":null},{"id":"W2408065670","doi":"","title":"On bipartite factorization of complete bipartite multigraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Factorization; Complete bipartite graph; Combinatorics; Algorithm; Graph","score_opus":0.009828748261300205,"score_gpt":0.1919110959007925,"score_spread":0.1820823476394923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408065670","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.99393255,0.00010676449,0.00026359977,0.000012306877,0.0020522827,0.00027009821,0.0000122527645,0.00022574498,0.0031244077],"genre_scores_gemma":[0.99979687,0.0000127066205,0.000025950763,0.00001684117,0.000006836397,0.000044554745,0.000014717494,0.000028806979,0.000052736876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912703,0.00005191055,0.0002907523,0.00013903303,0.00016949652,0.00022176557],"domain_scores_gemma":[0.9993875,0.00009339149,0.000058355065,0.00030764233,0.00006805578,0.00008504739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009981696,0.0001581392,0.00021636793,0.0001402637,0.00004748573,0.0000260171,0.00015394845,0.000079992904,0.00014647454],"category_scores_gemma":[0.000024423636,0.00015211185,0.00008003888,0.00032813376,0.00004348219,0.00016484474,0.000013582605,0.000107023996,0.0003279269],"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.000009700268,0.000090134825,0.008392624,0.000121238314,0.000091006965,0.0000013405328,0.0005130288,0.0022892477,0.07388958,0.9102277,0.0037774874,0.00059689506],"study_design_scores_gemma":[0.0019048396,0.00033273248,0.05425182,0.00023511024,0.000036965557,0.000002920464,0.00014678185,0.01873175,0.0675874,0.8502997,0.005726877,0.00074306136],"about_ca_topic_score_codex":0.000040353832,"about_ca_topic_score_gemma":0.0000024519998,"teacher_disagreement_score":0.059927966,"about_ca_system_score_codex":0.000017890112,"about_ca_system_score_gemma":0.000003986385,"threshold_uncertainty_score":0.6202941},"labels":[],"label_agreement":null},{"id":"W2408266333","doi":"","title":"Simple 3-designs of PSL(2, 2 n ) with block size 7.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; PSL; Simple (philosophy); Block (permutation group theory); Block size; Arithmetic; Combinatorics; Computer science","score_opus":0.005800393458211768,"score_gpt":0.19325128901077432,"score_spread":0.18745089555256256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408266333","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.9900222,0.000033249984,0.0000142985455,0.000009348561,0.0012375786,0.000120583034,0.0000044218114,0.00017479924,0.008383559],"genre_scores_gemma":[0.9997493,0.0000020217951,0.00008826183,0.0000093328945,0.00001036955,0.000013436498,0.0000015763632,0.00003146682,0.00009424387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.000021404901,0.00016608923,0.00010938567,0.00012865159,0.00018948497],"domain_scores_gemma":[0.9993924,0.00012261413,0.000034845838,0.00033593577,0.000042216925,0.00007197795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001536219,0.00012687694,0.00018706304,0.00003713031,0.000037772556,0.000012753089,0.00017515992,0.00008408547,0.00008025382],"category_scores_gemma":[0.000024634577,0.000111129666,0.0000445102,0.00019165737,0.000052141906,0.0000679645,0.00001325529,0.00019558528,0.0000274927],"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.000027931035,0.000086195665,0.007284546,0.00011926214,0.00010824621,0.0000123446525,0.00040943592,0.00043223795,0.15359119,0.83553106,0.0022263357,0.00017120548],"study_design_scores_gemma":[0.0030239522,0.000475434,0.015811197,0.00008199911,0.00008546352,0.00006216072,0.00033368618,0.0013908299,0.2600031,0.70658743,0.0112794135,0.0008653077],"about_ca_topic_score_codex":0.0000121402545,"about_ca_topic_score_gemma":0.000012202678,"teacher_disagreement_score":0.1289436,"about_ca_system_score_codex":0.000006774135,"about_ca_system_score_gemma":0.000011805792,"threshold_uncertainty_score":0.45317364},"labels":[],"label_agreement":null},{"id":"W2408325732","doi":"","title":"New Class of Difference Systems of Sets with Three Blocks.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.01285769250195031,"score_gpt":0.19633251520455713,"score_spread":0.18347482270260682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408325732","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.99253803,0.0008686031,0.00032220443,0.0000042078773,0.0016510373,0.00016381446,0.00000561131,0.0000908479,0.004355642],"genre_scores_gemma":[0.9997804,0.0000033722608,0.000046718775,0.0000011376461,0.000006603903,0.000007773473,0.0000019607726,0.000020871674,0.00013112283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.000030550138,0.00025218123,0.00010501135,0.00023178864,0.00015676243],"domain_scores_gemma":[0.9993282,0.000044420558,0.00007779926,0.0003345674,0.00008827456,0.00012673416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016467378,0.0001324516,0.00031279723,0.00005938933,0.000011827657,0.000009709802,0.00020962254,0.0000756585,0.000004614439],"category_scores_gemma":[0.000011666103,0.00010950279,0.000035716068,0.00021424267,0.000037253347,0.00005248764,0.000020214788,0.000090012676,0.00000630811],"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.000076713004,0.00007120216,0.05126014,0.000473989,0.00023159546,0.000010398143,0.0011493999,0.004573411,0.0037192176,0.9341426,0.003727262,0.00056406733],"study_design_scores_gemma":[0.013640657,0.0027150468,0.047996465,0.0027861493,0.000356767,0.000141965,0.0027483923,0.031137109,0.057387467,0.83556086,0.0034856517,0.002043459],"about_ca_topic_score_codex":0.0001482623,"about_ca_topic_score_gemma":0.000018447461,"teacher_disagreement_score":0.09858174,"about_ca_system_score_codex":0.000022588536,"about_ca_system_score_gemma":0.000040790786,"threshold_uncertainty_score":0.44653943},"labels":[],"label_agreement":null},{"id":"W2408497445","doi":"","title":"On the Cordiality of D(1, 3) Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0068320472596349185,"score_gpt":0.18611630280488478,"score_spread":0.17928425554524985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408497445","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.96593446,0.00003480659,0.000023111603,0.00003068758,0.0019245251,0.00008181924,0.0000019605009,0.000092271126,0.03187638],"genre_scores_gemma":[0.9999052,0.000003024152,0.0000022389809,0.000036543806,0.000003952664,0.000010276562,8.9489845e-7,0.000011677334,0.000026159736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994871,0.00008987844,0.00013542948,0.00006945128,0.00010676922,0.00011136959],"domain_scores_gemma":[0.99935967,0.00023988595,0.000025970576,0.00032681672,0.00001917406,0.00002847798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041692806,0.00007965678,0.00012382188,0.000030278794,0.000041829353,0.000008148277,0.00017132562,0.000042366006,0.000031959396],"category_scores_gemma":[0.000050796676,0.00005689984,0.0000644377,0.00014800685,0.000046740537,0.000023503233,0.000010646282,0.00009457821,0.0000396435],"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.000004159858,0.000014887965,0.00063020195,0.000019044235,0.000018922643,1.7664858e-7,0.000085205065,0.000087807544,0.0006454582,0.9960044,0.0022594656,0.00023027092],"study_design_scores_gemma":[0.00018785594,0.00004922759,0.002741058,0.00002008825,0.0000060514294,5.249863e-7,0.000026725073,0.0005350721,0.005532926,0.9891811,0.0016439436,0.00007544621],"about_ca_topic_score_codex":0.000008203495,"about_ca_topic_score_gemma":0.000001065643,"teacher_disagreement_score":0.033970796,"about_ca_system_score_codex":0.0000067003166,"about_ca_system_score_gemma":0.0000022047018,"threshold_uncertainty_score":0.23203081},"labels":[],"label_agreement":null},{"id":"W2408511417","doi":"","title":"Unitals, projective planes and other combinatorial structures constructed from the unitary groups U(3, q), q=3, 4, 5, 7","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unitary state; Projective test; Combinatorics; Pure mathematics","score_opus":0.0064065578484836655,"score_gpt":0.18075602623768952,"score_spread":0.17434946838920584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408511417","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.9907576,0.0006969947,0.000004117757,0.000039150458,0.004729613,0.0005717911,0.00008040298,0.00031055819,0.0028097765],"genre_scores_gemma":[0.9996703,0.000010010264,0.000020955367,0.00007490118,0.00006500614,0.000062817504,0.00003176679,0.000049725473,0.000014466708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988508,0.00018977316,0.00025297643,0.00022898283,0.00018510102,0.00029236477],"domain_scores_gemma":[0.9990234,0.0004000314,0.00005346897,0.00035778095,0.00006697932,0.000098383076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012991113,0.00027916557,0.00027160984,0.00005761174,0.000197569,0.00012565576,0.00029209864,0.00016650886,0.00015703692],"category_scores_gemma":[0.000035945122,0.00020457616,0.00004709604,0.00022803446,0.00022898892,0.00020497375,0.000058642567,0.0003112466,0.000040486175],"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.000023457074,0.00002339193,0.033237,0.000027946891,0.00024920207,0.0000057719294,0.0017327252,0.000027081182,0.0008750252,0.9582088,0.0052569136,0.0003327052],"study_design_scores_gemma":[0.0013076732,0.000060396953,0.036692824,0.000037139187,0.000039383245,0.000022610455,0.0037048194,0.00037962748,0.00080837053,0.9550217,0.0015845597,0.00034092757],"about_ca_topic_score_codex":0.0012221215,"about_ca_topic_score_gemma":0.000024647452,"teacher_disagreement_score":0.008912755,"about_ca_system_score_codex":0.000027710455,"about_ca_system_score_gemma":0.000017993312,"threshold_uncertainty_score":0.8342374},"labels":[],"label_agreement":null},{"id":"W2408683892","doi":"","title":"On Kirkman Packing Designs KPD({3, 4*, 5*}, v)s.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.012045804226535575,"score_gpt":0.21071840586004437,"score_spread":0.1986726016335088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408683892","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.95781386,0.00018072121,0.00012321112,0.000042594536,0.002264079,0.00014378739,0.0000015112408,0.00060899643,0.038821224],"genre_scores_gemma":[0.99968106,0.000008748163,0.000029221286,0.00012130506,0.000015853275,0.000007997688,0.000003443928,0.000025320955,0.00010707433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991724,0.000050285616,0.00017442087,0.00015595065,0.00015400001,0.0002929365],"domain_scores_gemma":[0.9994805,0.00007174898,0.000022831868,0.00031090938,0.00001879131,0.00009525223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002083428,0.0001709687,0.00017341848,0.000089589084,0.00008857991,0.000042683627,0.00018406965,0.00008862548,0.000040391686],"category_scores_gemma":[0.000021962911,0.00017210793,0.000074299074,0.00021033648,0.00001594984,0.00009992155,0.000006865784,0.00017885471,0.00022314253],"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.000008885914,0.000043294687,0.00014495074,0.000013009835,0.00002079532,0.000019079785,0.00022239315,0.00065493165,0.0034748958,0.9890463,0.004253941,0.00209754],"study_design_scores_gemma":[0.00057905656,0.00022418534,0.0025434433,0.00008207719,0.000011402934,0.000007893588,0.00005221969,0.0009713324,0.008946311,0.98409784,0.0021636127,0.00032060093],"about_ca_topic_score_codex":0.000001720675,"about_ca_topic_score_gemma":5.276469e-7,"teacher_disagreement_score":0.04186716,"about_ca_system_score_codex":0.000045674336,"about_ca_system_score_gemma":0.000005425557,"threshold_uncertainty_score":0.70183575},"labels":[],"label_agreement":null},{"id":"W2415869271","doi":"","title":"Drawing the Horton Set in an Integer Grid of Minimun Size.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Computer science; Set (abstract data type); Integer (computer science); Grid; Mathematics; Geometry; Programming language","score_opus":0.017186325880671184,"score_gpt":0.22372259275893402,"score_spread":0.20653626687826285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415869271","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.9884331,0.000035918856,0.0018121275,0.00016572485,0.0004715966,0.000110079745,0.000056457066,0.000030287767,0.008884708],"genre_scores_gemma":[0.99956274,0.0000012234749,0.000078888035,0.00018845404,0.00007662247,0.000008678896,0.000039189392,0.000012968228,0.000031229283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921626,0.00008433759,0.00021883244,0.00013342092,0.00014057785,0.00020658565],"domain_scores_gemma":[0.99922156,0.00035238403,0.00003076977,0.00017057135,0.000072718736,0.00015199187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032343707,0.00011343769,0.00015307197,0.0003111345,0.00005323793,0.0000398212,0.0002315602,0.00006518105,0.0001572093],"category_scores_gemma":[0.00007383054,0.00010038512,0.00003636956,0.00037333713,0.00005937119,0.000072773335,0.00000684287,0.00017367763,0.000028430808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019837898,0.000030312704,0.018703403,0.00012504641,0.000059949652,0.000014524253,0.0023606524,0.69424176,0.00034780792,0.26329902,0.0014633635,0.01933434],"study_design_scores_gemma":[0.00064951734,0.00019538759,0.18666661,0.00030601225,0.000013482225,0.000016152908,0.0017750541,0.7679946,0.0003140538,0.035412755,0.006084619,0.0005717629],"about_ca_topic_score_codex":0.0026787983,"about_ca_topic_score_gemma":0.020107858,"teacher_disagreement_score":0.22788626,"about_ca_system_score_codex":0.000059795748,"about_ca_system_score_gemma":0.00011707428,"threshold_uncertainty_score":0.99777263},"labels":[],"label_agreement":null},{"id":"W245591216","doi":"","title":"Packing the Cartesian product of two complete graphs with hexagons","year":2005,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Product (mathematics); Cartesian coordinate system; Arithmetic; Geometry","score_opus":0.014407930322415816,"score_gpt":0.21542326645749538,"score_spread":0.20101533613507955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W245591216","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.93750036,0.0012810118,0.003526719,0.0003677591,0.00013454311,0.00079905696,0.000036350844,0.0003885099,0.055965703],"genre_scores_gemma":[0.9977986,0.0000033122926,0.001999971,0.000016062328,0.00004679965,0.00003732164,0.0000023066855,0.000029942423,0.00006567871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910367,0.000054225766,0.0002886482,0.00013410744,0.00017987422,0.00023947381],"domain_scores_gemma":[0.99915034,0.00014464294,0.000049956667,0.0005727919,0.00003420115,0.000048098398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037544774,0.00016085034,0.00025106544,0.000060128736,0.000082507904,0.000018609197,0.00022455346,0.000020820502,0.00010113775],"category_scores_gemma":[0.000020188741,0.00009799108,0.00007949362,0.00023558417,0.00014235685,0.00007734714,0.00001659911,0.00011538247,0.000049003695],"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.000026820877,0.00019251091,0.0009801249,0.0015638823,0.0005267001,0.000006812058,0.017771006,0.0035924606,0.012253249,0.9547749,0.002217695,0.0060938224],"study_design_scores_gemma":[0.0052277683,0.0007536363,0.009059439,0.0041819667,0.0012969185,0.0011286687,0.02126393,0.14230509,0.097136,0.646395,0.06760337,0.0036482087],"about_ca_topic_score_codex":0.000005209178,"about_ca_topic_score_gemma":0.000028585016,"teacher_disagreement_score":0.30837992,"about_ca_system_score_codex":0.00001213977,"about_ca_system_score_gemma":0.000007934691,"threshold_uncertainty_score":0.39959604},"labels":[],"label_agreement":null},{"id":"W2460265449","doi":"10.1016/j.laa.2016.05.013","title":"Refined inertias of strongly connected orientations of the Petersen graph","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Sign (mathematics); Eigenvalues and eigenvectors; Zero (linguistics); Combinatorics; Graph; Signed graph; Orientation (vector space); Order (exchange); Connectivity; Pure mathematics; Mathematical analysis; Geometry; Physics","score_opus":0.007037926367069058,"score_gpt":0.198279000806962,"score_spread":0.19124107443989294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460265449","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.9911849,0.00021656336,0.0066605336,0.00014652299,0.000064480104,0.0003085492,0.00011567905,0.00006266593,0.0012400933],"genre_scores_gemma":[0.999582,0.000036417125,0.00010682395,0.0000073529213,0.000026582637,0.00007447084,0.0000057156044,0.000010116163,0.00015049863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954337,0.000020128256,0.00020977923,0.000083270956,0.000064441185,0.00007901816],"domain_scores_gemma":[0.9995497,0.000082698825,0.000054143715,0.0002188741,0.000062850435,0.000031719963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050676237,0.00006720132,0.00010238522,0.000045793462,0.000048400998,0.000002784651,0.00010697854,0.000035719724,0.000022721631],"category_scores_gemma":[0.000017782246,0.000040411232,0.000044871642,0.00026852242,0.000062407606,0.000046750924,0.000016495569,0.000034918106,0.000006308958],"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.000012143877,0.00004792242,0.0012538249,0.00011121667,0.00009706664,6.922445e-8,0.0004723855,0.00020694947,0.37547797,0.6202435,0.00020870358,0.0018682688],"study_design_scores_gemma":[0.00427315,0.0003188132,0.123264715,0.0005111056,0.00043783465,0.000027951546,0.0019369861,0.006867603,0.76338965,0.04245801,0.05543335,0.0010808171],"about_ca_topic_score_codex":0.0000032072026,"about_ca_topic_score_gemma":0.000007529529,"teacher_disagreement_score":0.57778543,"about_ca_system_score_codex":0.0000036337867,"about_ca_system_score_gemma":0.0000074622294,"threshold_uncertainty_score":0.16479222},"labels":[],"label_agreement":null},{"id":"W2463863510","doi":"10.1556/012.2016.53.2.1335","title":"Large forbidden configurations and design theory","year":2016,"lang":"en","type":"article","venue":"Studia Scientiarum Mathematicarum Hungarica","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 British Columbia","funders":"","keywords":"Mathematics; Concatenation (mathematics); Combinatorics; Permutation (music); Column (typography); Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Geometry; Connection (principal bundle); Mathematical analysis","score_opus":0.012762303367236008,"score_gpt":0.21214736329904874,"score_spread":0.1993850599318127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463863510","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.028653687,0.0008902855,0.88867486,0.00041107592,0.00077195535,0.0008836977,0.00005808034,0.0007319517,0.078924425],"genre_scores_gemma":[0.9971493,0.000037170244,0.0013647851,0.000027919848,0.00004302857,0.0000956896,0.000001113599,0.00003355601,0.001247436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858564,0.00013469707,0.0003010906,0.00026835006,0.00023851142,0.00047171925],"domain_scores_gemma":[0.99885195,0.0005343131,0.000048931397,0.0003833272,0.00004640811,0.00013506571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013397477,0.00020400471,0.00026394898,0.00014626826,0.00032050218,0.000092117836,0.0002297026,0.00006931898,0.00024140009],"category_scores_gemma":[0.00014263329,0.00013447292,0.00007369977,0.00028097696,0.00017646047,0.00021256061,0.00007405653,0.00007867469,0.00027413236],"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.000007954565,0.000066393404,0.00007986879,0.00010199146,0.00017952186,0.0000051342854,0.0026561555,0.000012407324,0.024629185,0.9646429,0.0060168295,0.0016016738],"study_design_scores_gemma":[0.002525935,0.00019461037,0.0017351051,0.00055902253,0.00035864676,0.00010012352,0.004714512,0.004761217,0.02075692,0.9369763,0.025905399,0.0014122133],"about_ca_topic_score_codex":2.3980908e-7,"about_ca_topic_score_gemma":0.0000021126023,"teacher_disagreement_score":0.9684956,"about_ca_system_score_codex":0.00002489236,"about_ca_system_score_gemma":0.000021074964,"threshold_uncertainty_score":0.5483647},"labels":[],"label_agreement":null},{"id":"W2467956386","doi":"10.1017/s0025557200006483","title":"An unexpected use of primes: solving sudokus by calculator","year":2010,"lang":"en","type":"article","venue":"The Mathematical Gazette","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":"Divisibility rule; Calculator; Prime factor; Mathematics; Number theory; Prime number; Arithmetic; Factoring; Factorization; Prime (order theory); Field (mathematics); Order (exchange); Perfect number; Discrete mathematics; Algebra over a field; Computer science; Combinatorics; Pure mathematics; Algorithm","score_opus":0.009192459297603695,"score_gpt":0.21013360049275132,"score_spread":0.2009411411951476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467956386","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.989965,0.000040639712,0.007666893,0.00003821421,0.00018615884,0.0001956042,0.0000123586215,0.00025873256,0.0016363797],"genre_scores_gemma":[0.998556,0.0000012936576,0.0011070258,0.000027658698,0.000060308244,0.000016969674,0.0000037336597,0.00003829457,0.00018868812],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991057,0.0000636368,0.00030994878,0.00011255671,0.00017494858,0.00023321032],"domain_scores_gemma":[0.99895847,0.00028410135,0.000042521817,0.0005922429,0.000028503058,0.00009414339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034048912,0.00015117147,0.0002407736,0.0000337123,0.00005375908,0.00004735261,0.00027745977,0.000096949625,0.00018652594],"category_scores_gemma":[0.00010138755,0.00009967029,0.00007917339,0.00013966425,0.00012973826,0.00012876236,0.000021274569,0.00026086348,0.00007377912],"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.0000067401547,0.00007744309,0.00005571182,0.00015664015,0.00006741726,0.0000021016049,0.0012529037,0.0001825473,0.9161227,0.07999126,0.0018343189,0.00025027504],"study_design_scores_gemma":[0.0011732032,0.00020345129,0.0013852039,0.00039877908,0.00030672722,0.00016644404,0.0009883791,0.26879087,0.61056507,0.10053364,0.014008629,0.0014796306],"about_ca_topic_score_codex":0.0000068663544,"about_ca_topic_score_gemma":0.0000031480806,"teacher_disagreement_score":0.30555758,"about_ca_system_score_codex":0.0000062692166,"about_ca_system_score_gemma":0.000005143705,"threshold_uncertainty_score":0.40644363},"labels":[],"label_agreement":null},{"id":"W2472686974","doi":"10.1007/978-3-319-38851-9_13","title":"On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Circulant matrix; Computer science; Core (optical fiber); Algorithm; Metaheuristic; Multi-core processor; Quality (philosophy); Mathematical optimization; Theoretical computer science; Parallel computing; Mathematics","score_opus":0.02593344252193497,"score_gpt":0.22819292685329495,"score_spread":0.20225948433135998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472686974","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.0046783723,0.00042943846,0.99194944,0.000027286025,0.0012997371,0.00049079605,0.000014540734,0.000105317464,0.0010050825],"genre_scores_gemma":[0.98860383,0.000036013047,0.010891952,0.00007880291,0.00027850803,0.000011285686,0.0000018504379,0.000052276962,0.000045469256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982177,0.000020198791,0.00039100184,0.00047786505,0.00052833656,0.00036489716],"domain_scores_gemma":[0.9989153,0.00027112005,0.0002148114,0.00046034748,0.0000858366,0.00005254008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006607431,0.00035470093,0.0003405569,0.00048494886,0.00016298464,0.0000670657,0.0006526501,0.00021267064,0.000010592115],"category_scores_gemma":[0.000028068436,0.00021933927,0.000099932186,0.00028393563,0.00027475948,0.00012891625,0.00008351842,0.00042274295,0.00000991269],"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.000010441115,0.000043553395,0.000033884335,0.0005225342,0.00006166617,0.00003432038,0.0016412094,0.7167086,0.006683466,0.019923681,0.000007768795,0.25432885],"study_design_scores_gemma":[0.0001825884,0.000090225185,0.000020627524,0.0035988716,0.000014855597,0.00003272054,7.9051654e-7,0.9374564,0.00406027,0.054049,0.00007486847,0.00041874836],"about_ca_topic_score_codex":0.000008855552,"about_ca_topic_score_gemma":0.000006498456,"teacher_disagreement_score":0.98392546,"about_ca_system_score_codex":0.00015241008,"about_ca_system_score_gemma":0.000064234475,"threshold_uncertainty_score":0.8944396},"labels":[],"label_agreement":null},{"id":"W2473648675","doi":"10.1016/j.jsc.2016.07.004","title":"On the arithmetic complexity of Strassen-like matrix multiplications","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Strassen algorithm; Mathematics; Matrix multiplication; Arithmetic; Dimension (graph theory); Multiplication (music); Matrix (chemical analysis); Combinatorics; Discrete mathematics","score_opus":0.023035962756195308,"score_gpt":0.2515946496593419,"score_spread":0.22855868690314662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473648675","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.8861207,0.00008414781,0.112531394,0.00040368192,0.00031561565,0.00009989955,0.0000073618526,0.000023474004,0.00041373677],"genre_scores_gemma":[0.9994198,0.0000135777445,0.00045842305,0.000012211292,0.000066642606,0.000002044765,5.607286e-7,0.00000931787,0.000017433387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992451,0.00007440407,0.00038071786,0.00004537584,0.00017310421,0.00008126427],"domain_scores_gemma":[0.99911886,0.00042454523,0.00019032962,0.00010508469,0.00012411646,0.00003705812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035368995,0.00007227629,0.00015328896,0.000115199684,0.000041201445,0.000011897323,0.0001280786,0.000030396292,0.000021004438],"category_scores_gemma":[0.000040044153,0.00004049507,0.000086559805,0.00014326387,0.00006481545,0.00007142455,0.000006240924,0.00008794626,0.000013832578],"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.00012257522,0.00039565313,0.0017762315,0.00024420905,0.00058569165,0.000009230612,0.0028113034,0.17238739,0.19760075,0.5680021,0.005349363,0.0507155],"study_design_scores_gemma":[0.0038924634,0.0007227904,0.19745459,0.0015954028,0.00020496518,0.00042561736,0.0011868126,0.13795617,0.023090389,0.6313129,0.0015222247,0.0006356847],"about_ca_topic_score_codex":0.0000022903937,"about_ca_topic_score_gemma":0.0000015017088,"teacher_disagreement_score":0.19567835,"about_ca_system_score_codex":0.000029716128,"about_ca_system_score_gemma":0.000012679109,"threshold_uncertainty_score":0.1651341},"labels":[],"label_agreement":null},{"id":"W2476608074","doi":"10.1142/9789814719261_0020","title":"On the existence of aperiodic complementary hexagonal lattice arrays","year":2016,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Hexagonal crystal system; Hexagonal lattice; Lattice (music); Condensed matter physics; Materials science; Crystallography; Mathematics; Combinatorics; Physics; Chemistry","score_opus":0.0285980824925664,"score_gpt":0.20687555701666208,"score_spread":0.17827747452409567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476608074","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.0016935054,0.0002017227,0.00008247047,0.0000483872,0.0026892014,0.00037139843,0.00024028294,0.000116851064,0.9945562],"genre_scores_gemma":[0.19699572,6.295738e-7,0.000035846788,0.000075116805,0.00012041941,0.000020060812,0.000015805303,0.000050695122,0.80268574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982735,0.00003993709,0.000463665,0.00038474626,0.00053275126,0.00030542945],"domain_scores_gemma":[0.99850637,0.00031442006,0.00014410916,0.0008879289,0.00006101498,0.00008614079],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007479033,0.00033083343,0.00035112913,0.0002942829,0.0002989748,0.00009170357,0.0006265366,0.00007963031,0.001816954],"category_scores_gemma":[0.0000042794654,0.00021997667,0.00022660509,0.000044424676,0.0007689941,0.000029698287,0.00006611632,0.0003162568,0.00046183588],"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.000010558029,0.00000432457,0.0000016703068,0.00009945839,0.00008298692,0.0000061453184,0.00032019787,0.000012704256,0.0021140897,0.9807497,0.015636733,0.000961381],"study_design_scores_gemma":[0.00016773258,0.00002529157,0.0000043858727,0.0010691991,0.00004724298,0.0000061337496,0.000043253738,0.00006345439,0.0017753465,0.15634471,0.84008497,0.00036826698],"about_ca_topic_score_codex":9.304607e-7,"about_ca_topic_score_gemma":0.00018253426,"teacher_disagreement_score":0.8244482,"about_ca_system_score_codex":0.000055526612,"about_ca_system_score_gemma":0.000033974848,"threshold_uncertainty_score":0.9990955},"labels":[],"label_agreement":null},{"id":"W2478399918","doi":"10.1007/s10623-016-0259-7","title":"Twofold triple systems without 2-intersecting Gray codes","year":2016,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Modulo; Vertex (graph theory); Mathematics; Graph; Hamiltonian path; Discrete mathematics","score_opus":0.015457978594454434,"score_gpt":0.2104273174880232,"score_spread":0.19496933889356877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478399918","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.73863286,0.0044070217,0.24797927,0.000021599355,0.0018109969,0.00051560893,0.000064833446,0.0009561826,0.005611613],"genre_scores_gemma":[0.9989599,0.0002860612,0.00035017796,0.000015876798,0.00016024272,0.00008542734,0.0000033161534,0.000053342097,0.00008564859],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986248,0.00012463715,0.00034527516,0.0002988681,0.00016758809,0.0004388413],"domain_scores_gemma":[0.9992824,0.00015180679,0.00006379435,0.00028938445,0.00004534302,0.0001672541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046024896,0.0002992815,0.00038626083,0.00028420196,0.00017428937,0.0001335276,0.00017204684,0.00012370256,0.000028300296],"category_scores_gemma":[0.000013501912,0.0002057229,0.00016847046,0.00033950852,0.00012219221,0.00019234179,0.000020531383,0.00010847956,0.000018396804],"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.00031554958,0.00015438854,0.18161167,0.0015953134,0.0017323031,0.000052520325,0.003383589,0.0007989133,0.48421296,0.29175553,0.0115445275,0.022842739],"study_design_scores_gemma":[0.03716146,0.0055559687,0.046767954,0.020396998,0.0026037137,0.0027047244,0.05177175,0.07019761,0.21312793,0.13854298,0.38922384,0.021945085],"about_ca_topic_score_codex":0.000038421487,"about_ca_topic_score_gemma":0.000017080696,"teacher_disagreement_score":0.37767932,"about_ca_system_score_codex":0.000015788224,"about_ca_system_score_gemma":0.00000558084,"threshold_uncertainty_score":0.8389136},"labels":[],"label_agreement":null},{"id":"W2480068526","doi":"10.1155/2016/7092474","title":"A New Relationship between Block Designs","year":2016,"lang":"en","type":"article","venue":"International Journal of Combinatorics","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":"Block (permutation group theory); Set (abstract data type); Computer science; Algorithm; Order (exchange); Type (biology); Mathematics; Combinatorics","score_opus":0.0327433514048982,"score_gpt":0.2546510512809855,"score_spread":0.22190769987608727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480068526","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.8497425,0.00046373217,0.13762516,0.0008198671,0.0066650873,0.00006403528,0.0000090903295,0.0000874188,0.0045231283],"genre_scores_gemma":[0.99877155,0.00002095016,0.00018316807,0.0000088406805,0.00047479017,5.691423e-7,4.4433898e-7,0.000014926409,0.0005247703],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909425,0.00003612917,0.00036622598,0.000045839024,0.0003600145,0.00009757125],"domain_scores_gemma":[0.9990674,0.000405562,0.00012464152,0.00008021725,0.00021220437,0.00010993667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027561805,0.0000822632,0.00012712227,0.00019648361,0.000019475945,0.00003028398,0.00037086342,0.000060596107,0.000031780124],"category_scores_gemma":[0.00014795543,0.00005986577,0.00009674536,0.00011093869,0.00001226536,0.00023381201,0.000014284807,0.00012745302,0.000044234952],"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.000041095453,0.00004558474,0.49686778,0.000013563778,0.00043747356,0.000081808765,0.0003155421,0.00041180264,0.0022263862,0.47372472,0.018074753,0.007759473],"study_design_scores_gemma":[0.0025208483,0.00016027014,0.1718499,0.00033833834,0.000058434223,0.00030906187,0.00003919475,0.00003413636,0.006844514,0.7792052,0.038345926,0.0002941401],"about_ca_topic_score_codex":0.0000010516477,"about_ca_topic_score_gemma":2.6468632e-7,"teacher_disagreement_score":0.32501787,"about_ca_system_score_codex":0.00011736926,"about_ca_system_score_gemma":0.000041707208,"threshold_uncertainty_score":0.24412555},"labels":[],"label_agreement":null},{"id":"W2483074210","doi":"10.1090/coll/057/08","title":"Sieving by many residue classes","year":2010,"lang":"en","type":"book-chapter","venue":"Colloquium Publications - American Mathematical Society/Colloquium Publications","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Residue (chemistry); Computer science; Environmental science; Chemistry; Organic chemistry","score_opus":0.011135445533794003,"score_gpt":0.22827736874568075,"score_spread":0.21714192321188674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483074210","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.00044327686,0.0011501515,0.03567493,0.00891639,0.0008037171,0.0031978406,0.0018298073,0.0053000106,0.9426839],"genre_scores_gemma":[0.031766377,0.0010343828,0.021118011,0.0011181158,0.0012146936,0.005919875,0.0029148078,0.0012632898,0.93365043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99285996,0.000120236444,0.0023719121,0.0016588421,0.001370177,0.0016188518],"domain_scores_gemma":[0.9913237,0.001302249,0.0011217017,0.0038786433,0.0011699434,0.0012037789],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0012045713,0.0016236278,0.0019600769,0.0008368665,0.0014099011,0.0014321583,0.002769241,0.0014662667,0.0044781975],"category_scores_gemma":[0.00061535655,0.0017591363,0.0015584865,0.0022700692,0.0023660406,0.0010281655,0.0004287025,0.0027693445,0.0018535285],"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.000004000728,0.00021768754,0.000030029032,0.00032824336,0.00065127364,7.059373e-7,0.00037968784,0.000019827101,0.0028101252,0.58541214,0.409551,0.0005952806],"study_design_scores_gemma":[0.00038697288,0.00008879546,0.000111320114,0.00017799511,0.00047186867,0.0000599847,0.0005113453,0.0017647827,0.00034513813,0.06262783,0.93152547,0.001928487],"about_ca_topic_score_codex":0.000023361408,"about_ca_topic_score_gemma":0.00005216788,"teacher_disagreement_score":0.5227843,"about_ca_system_score_codex":0.0008191974,"about_ca_system_score_gemma":0.0006727302,"threshold_uncertainty_score":0.99989015},"labels":[],"label_agreement":null},{"id":"W2493288549","doi":"10.1017/cbo9780511751684.010","title":"Sums of Two, Four and Six Squares","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"Mathematics","score_opus":0.012669058301096187,"score_gpt":0.16680154223471025,"score_spread":0.15413248393361406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493288549","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.016212348,0.00017241304,0.00016741922,0.0000011751098,0.0004239684,0.0002132727,0.00020247395,0.00013496002,0.98247194],"genre_scores_gemma":[0.32219148,0.0000530428,0.000043372445,0.0000032768671,0.00008115368,3.6577154e-7,0.000007698344,0.000046912905,0.6775727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999319,0.000014846997,0.00015404096,0.00022021869,0.0001255885,0.00016629789],"domain_scores_gemma":[0.99918336,0.000047619036,0.00010517801,0.0004951067,0.000058580088,0.00011013587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007701854,0.0002702405,0.0003665192,0.0001301786,0.00011074697,0.000026733971,0.00032778838,0.00033073415,0.0000049894475],"category_scores_gemma":[0.0000035445848,0.00031900805,0.00013338956,0.0000033370145,0.00026328195,0.00006301637,0.00015131058,0.00042046097,0.0000036625925],"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.000026439215,0.0000014954678,0.000028110033,0.00034021278,0.0001611614,0.0000871848,0.000053292573,0.000010416995,0.0024199893,0.9952548,0.0011560839,0.00046077959],"study_design_scores_gemma":[0.0011859969,0.000053886484,0.00016035026,0.00041387512,0.0003269493,0.00004286542,0.0000494677,0.00021481096,0.010091806,0.00019836763,0.9864729,0.0007887388],"about_ca_topic_score_codex":0.00008442802,"about_ca_topic_score_gemma":0.000013024125,"teacher_disagreement_score":0.99505645,"about_ca_system_score_codex":0.000022465569,"about_ca_system_score_gemma":0.000011975099,"threshold_uncertainty_score":0.9999262},"labels":[],"label_agreement":null},{"id":"W2501921681","doi":"10.1017/s0025557200184165","title":"Integral powers of order three Latin square matrices","year":2009,"lang":"en","type":"article","venue":"The Mathematical Gazette","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":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"","keywords":"Latin square; Permutation (music); Permutation matrix; Mathematics; Matrix (chemical analysis); Square matrix; Permutation group; Order (exchange); Combinatorics; Euler's formula; Group (periodic table); Set (abstract data type); Algebra over a field; Pure mathematics; Computer science; Symmetric matrix; Physics; Mathematical analysis","score_opus":0.009869813374617042,"score_gpt":0.21048907971312944,"score_spread":0.2006192663385124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501921681","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.8848136,0.000367144,0.033858933,0.00092445494,0.00020548998,0.00042592364,0.00000904152,0.00042346126,0.07897197],"genre_scores_gemma":[0.9987096,0.000004523496,0.000977418,0.00006208025,0.000044033644,0.0000068971967,0.0000010785508,0.000016554959,0.00017778248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991988,0.000033120043,0.00029886962,0.000083319275,0.00018151567,0.00020438452],"domain_scores_gemma":[0.99941057,0.00015088532,0.000040945524,0.00032518958,0.000028392942,0.000043989807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029287333,0.00014199558,0.00023978611,0.000047836387,0.000035778747,0.00002040739,0.0002676111,0.000060959934,0.00026995028],"category_scores_gemma":[0.000049414117,0.00008502165,0.00009451534,0.0002682677,0.00006381717,0.000050188068,0.000014926201,0.00015837992,0.00017356934],"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.000039791787,0.00012809399,0.00016488378,0.0006168644,0.0001420145,0.000009819741,0.0036891403,0.0023114951,0.004975133,0.9758744,0.0039021196,0.008146238],"study_design_scores_gemma":[0.00048728933,0.00017130858,0.002236727,0.0004537865,0.000102655016,0.000030059475,0.00096513977,0.031168278,0.004662874,0.9579812,0.0013039227,0.0004367539],"about_ca_topic_score_codex":0.0000019090446,"about_ca_topic_score_gemma":0.000001143184,"teacher_disagreement_score":0.11389604,"about_ca_system_score_codex":0.000009335371,"about_ca_system_score_gemma":0.0000035356513,"threshold_uncertainty_score":0.34670824},"labels":[],"label_agreement":null},{"id":"W2502575022","doi":"10.1142/9789812772022_0004","title":"Optical orthogonal codes from Singer groups","year":2007,"lang":"en","type":"article","venue":"Series on coding theory and cryptology","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 New Brunswick","funders":"","keywords":"Conic section; Construct (python library); Mathematics; Projective test; Discrete mathematics; Pure mathematics; Algebra over a field; Computer science; Geometry","score_opus":0.007268584986179007,"score_gpt":0.20920628928299198,"score_spread":0.201937704296813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502575022","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.9635321,0.00042756845,0.016837252,0.000045165594,0.001052911,0.000065801745,0.000014521177,0.000270116,0.017754598],"genre_scores_gemma":[0.99918205,0.000047954243,0.0002681858,0.00015592342,0.00024633823,0.0000057417187,0.000012476945,0.000024156227,0.000057201516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903333,0.00013117921,0.00022228128,0.00020622266,0.0000777763,0.00032919043],"domain_scores_gemma":[0.9988617,0.00082813477,0.00002404329,0.0001715762,0.00001581892,0.00009877482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086338405,0.0001815168,0.00025355848,0.00007741193,0.0001498123,0.000028965176,0.00010621376,0.00017654065,0.00016194886],"category_scores_gemma":[0.000062750936,0.00016644373,0.000050298855,0.000080303675,0.00028984886,0.00010306295,0.000026559894,0.00022259311,0.00004267583],"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.0004668377,0.000016267657,0.0006154005,0.000022524564,0.000066311746,0.000048898277,0.0005124937,0.000036510693,0.011202809,0.98271674,0.00007141912,0.0042238045],"study_design_scores_gemma":[0.0007218503,0.00034988308,0.008539276,0.00010527284,0.000060187915,0.00021711623,0.0029830786,0.00009544114,0.0368834,0.93650055,0.01290889,0.0006350391],"about_ca_topic_score_codex":9.2386335e-7,"about_ca_topic_score_gemma":0.000019545763,"teacher_disagreement_score":0.046216156,"about_ca_system_score_codex":0.000013348722,"about_ca_system_score_gemma":0.000004400649,"threshold_uncertainty_score":0.6787378},"labels":[],"label_agreement":null},{"id":"W2504074656","doi":"10.1137/1.9781611974775.3","title":"An Exact Enumeration of Distance-Hereditary Graphs","year":2017,"lang":"en","type":"preprint","venue":"","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Enumeration; Mathematics; Bounded function; Enumerative combinatorics; Discrete mathematics; Chordal graph; Graph","score_opus":0.012045078478517287,"score_gpt":0.23173895615224285,"score_spread":0.21969387767372556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504074656","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.83333415,0.0018944633,0.05820997,0.000014158769,0.0064739794,0.0005534275,0.0002229784,0.000729151,0.09856775],"genre_scores_gemma":[0.9991975,0.000066865476,0.00020823278,0.000002615834,0.00017052182,0.000030364878,0.00012888653,0.000029677009,0.00016537326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924725,0.000041740022,0.00026300846,0.00019263886,0.00012856322,0.00012677244],"domain_scores_gemma":[0.99889314,0.0000145883705,0.00009043402,0.000908109,0.000036991347,0.000056706915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019292702,0.00019103916,0.00028522965,0.00008032827,0.000050775227,0.00005171713,0.00036429826,0.00022610315,0.00011583464],"category_scores_gemma":[0.000005981017,0.00018114138,0.0001231061,0.000024534611,0.00004100526,0.00014284893,0.000036750127,0.0002397379,0.0000096074045],"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.00020968399,0.00056947797,0.019264312,0.01391439,0.002485389,0.00014344908,0.008207198,0.2677401,0.046525594,0.5347575,0.028019236,0.07816365],"study_design_scores_gemma":[0.001590941,0.0003727141,0.03568134,0.0027413138,0.00042380515,0.000041721716,0.0013444241,0.18599674,0.07583159,0.66952276,0.02220159,0.0042510247],"about_ca_topic_score_codex":0.00008156653,"about_ca_topic_score_gemma":0.00008035038,"teacher_disagreement_score":0.16586334,"about_ca_system_score_codex":0.000015144311,"about_ca_system_score_gemma":0.000013259848,"threshold_uncertainty_score":0.73867315},"labels":[],"label_agreement":null},{"id":"W2513299842","doi":"10.1088/1751-8113/49/8/085301","title":"Quantum conical designs","year":2016,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Combinatorics; Simplex; Mathematics; Rank (graph theory); Conical surface; Quantum entanglement; Discrete mathematics; Quantum; Geometry; Quantum mechanics; Physics","score_opus":0.013462679812397798,"score_gpt":0.21542436397451828,"score_spread":0.2019616841621205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513299842","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.7340589,0.0001352485,0.2628871,0.00028867787,0.0001676822,0.000060614693,0.0000035258965,0.000037639522,0.0023606345],"genre_scores_gemma":[0.9991531,0.000034473913,0.0005601223,0.000018587554,0.00020192185,0.0000016911754,5.5686986e-8,0.000017394817,0.000012675805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912524,0.00006194644,0.00037953194,0.00006575516,0.00018599481,0.00018151518],"domain_scores_gemma":[0.99902153,0.0005904812,0.0000514599,0.00010847741,0.000050524875,0.00017752884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045774283,0.00011954435,0.0003149071,0.000026098141,0.000025664207,0.000024825047,0.00011935154,0.00006499762,0.0001789172],"category_scores_gemma":[0.000103679115,0.0000612987,0.00012590198,0.000056432356,0.00042499913,0.00010154109,0.00002021457,0.00013887501,0.00004464465],"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.00002429192,0.000054438624,0.000013832267,0.000057582703,0.000053005766,0.000015578822,0.000087552406,0.000003082476,0.007221973,0.98942596,0.000100226265,0.0029424862],"study_design_scores_gemma":[0.00039798344,0.00013176168,0.00001660473,0.00020284101,0.000037325965,0.00020947296,0.00003674317,0.0019260618,0.005191864,0.99161637,0.00013058716,0.00010237634],"about_ca_topic_score_codex":1.4972283e-8,"about_ca_topic_score_gemma":6.715657e-9,"teacher_disagreement_score":0.2650942,"about_ca_system_score_codex":0.000011423382,"about_ca_system_score_gemma":0.000009959824,"threshold_uncertainty_score":0.24996884},"labels":[],"label_agreement":null},{"id":"W2521876311","doi":"10.46298/dmtcs.2463","title":"Walks in the Quarter Plane with Multiple Steps","year":2015,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"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":"Austrian Science Fund","keywords":"Mathematics; Combinatorics; Nearest neighbour; Quarter (Canadian coin); Cover (algebra); Humanities; Plane (geometry); Geometry; Geography; Art; Artificial intelligence","score_opus":0.013173340214985573,"score_gpt":0.2220642555682592,"score_spread":0.20889091535327364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521876311","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.22267649,0.0005158777,0.7491011,0.0021046945,0.0015552551,0.00084006257,0.000026827596,0.00013615628,0.023043526],"genre_scores_gemma":[0.95903826,0.000004025212,0.040521573,0.00013257998,0.0002017288,0.00003089792,0.0000036239114,0.00003265969,0.000034624987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967246,0.0002995111,0.00054462545,0.00048073137,0.0010464208,0.0009041103],"domain_scores_gemma":[0.99772066,0.0007631714,0.00008748319,0.00096322095,0.00011678167,0.00034871313],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039577824,0.00039551576,0.00043613443,0.00016792875,0.00019321531,0.00052758044,0.0015855461,0.00012622886,0.00005912169],"category_scores_gemma":[0.00010312859,0.00024180328,0.00008603835,0.0010624871,0.0033237152,0.00039638646,0.00018174178,0.00050879153,0.00022559667],"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.00002187082,0.00013421441,0.00023302768,0.00019679316,0.000017768438,0.000080968595,0.02702826,0.0024421306,0.000051879422,0.96883947,0.00026250226,0.0006911218],"study_design_scores_gemma":[0.0007339094,0.0004230844,0.00023903768,0.00059443957,0.00003511601,0.0003391386,0.0048534595,0.69857115,0.0001849888,0.29312462,0.00044595517,0.00045510003],"about_ca_topic_score_codex":0.000019385505,"about_ca_topic_score_gemma":0.000021426005,"teacher_disagreement_score":0.7363618,"about_ca_system_score_codex":0.00008299996,"about_ca_system_score_gemma":0.00008528854,"threshold_uncertainty_score":0.9993887},"labels":[],"label_agreement":null},{"id":"W2528132967","doi":"","title":"Equitably coloured balanced incomplete block designs","year":2016,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","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; Memorial University of Newfoundland","keywords":"Block (permutation group theory); Mathematics; Integer (computer science); Block design; Computer science; Mathematical economics; Combinatorics","score_opus":0.027870048693407194,"score_gpt":0.2458250893732558,"score_spread":0.2179550406798486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528132967","genre_codex":"other","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.42410702,0.00016603002,0.0001714322,0.000030695297,0.039385956,0.0017754745,0.0002686736,0.0013093426,0.5327854],"genre_scores_gemma":[0.7852413,0.00023343903,0.000062387575,0.0000025399327,0.0067925407,0.0000022927443,0.00026237697,0.00015474606,0.20724835],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938404,0.0016107551,0.00047605069,0.0011073109,0.0014802039,0.0014852674],"domain_scores_gemma":[0.99638003,0.0006433838,0.00024149701,0.0010746691,0.0009666828,0.0006937515],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011034157,0.0007586959,0.0010514194,0.0021894742,0.0019765038,0.00021865693,0.0023581842,0.0013222018,0.00018692233],"category_scores_gemma":[0.00012632005,0.000880408,0.0005564443,0.0020099068,0.0003991672,0.00076761656,0.00030851117,0.0016529402,0.00029088595],"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.024989484,0.0005083757,0.000277252,0.0023625134,0.00357418,0.01537147,0.004446442,0.0010479589,0.8026548,0.042284004,0.100165166,0.0023183676],"study_design_scores_gemma":[0.013602168,0.0013649352,0.00052748056,0.001731913,0.00088780915,0.00010021818,0.015098407,0.00043023867,0.087029085,0.0012842115,0.8741328,0.0038107203],"about_ca_topic_score_codex":0.00041507534,"about_ca_topic_score_gemma":0.00037253136,"teacher_disagreement_score":0.7739676,"about_ca_system_score_codex":0.0021374756,"about_ca_system_score_gemma":0.0009074075,"threshold_uncertainty_score":0.9999743},"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":"W2529571702","doi":"10.1515/spma-2016-0029","title":"A class of cyclic (v; k<sub>1</sub>, k<sub>2</sub>, k<sub>3</sub>; λ) differencefamilies with v ≡ 3 (mod 4) a prime","year":2016,"lang":"en","type":"article","venue":"Special Matrices","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Prime (order theory); Mod; Hadamard transform; Skew; Class (philosophy); Combinatorics; Order (exchange); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.005134327060679731,"score_gpt":0.17215868667192666,"score_spread":0.16702435961124693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529571702","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.9889924,0.0009707896,0.00078073837,0.00007739632,0.0015724291,0.0008120411,0.00019403118,0.00064101565,0.0059591713],"genre_scores_gemma":[0.99583715,0.0010896962,0.000052432333,0.000030196165,0.0026017937,0.00015347237,0.000018593939,0.00017857784,0.000038097613],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958596,0.00022304131,0.0010660585,0.00082955585,0.0008905693,0.0011311453],"domain_scores_gemma":[0.9976773,0.0004151921,0.00044205098,0.0009338448,0.0001815064,0.0003500866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004284996,0.0008850829,0.001174502,0.0006629284,0.00024481877,0.00014954412,0.000789463,0.0004623211,0.000038156482],"category_scores_gemma":[0.0000840696,0.00066547026,0.00039128764,0.0011409735,0.00040678793,0.00061567716,0.00015826256,0.0004461798,0.0005146534],"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.00032795902,0.00014872158,0.002454139,0.00046424344,0.0003108611,0.000053231037,0.00090797193,0.00009365181,0.95701903,0.004248481,0.0009861556,0.032985546],"study_design_scores_gemma":[0.001730243,0.00038616848,0.02016909,0.0006804398,0.0002093665,0.000051209347,0.0005163089,0.000110666646,0.9685511,0.0049098115,0.0015478452,0.0011377274],"about_ca_topic_score_codex":0.000024498226,"about_ca_topic_score_gemma":0.00040019106,"teacher_disagreement_score":0.03184782,"about_ca_system_score_codex":0.00020560616,"about_ca_system_score_gemma":0.00010965343,"threshold_uncertainty_score":0.99957967},"labels":[],"label_agreement":null},{"id":"W2549794674","doi":"","title":"Thickly-resolvable block designs","year":2016,"lang":"en","type":"article","venue":"UVic’s Research and Learning Repository (University of Victoria)","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 Victoria","funders":"","keywords":"Block (permutation group theory); Computer science; Mathematics; Combinatorics","score_opus":0.024245724471127342,"score_gpt":0.2313854311638584,"score_spread":0.20713970669273107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549794674","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.9708874,0.0007237285,0.0009376677,0.00006496381,0.0004185009,0.0001502256,0.0000025605202,0.00022247976,0.026592433],"genre_scores_gemma":[0.9860064,0.00018499648,0.00010643184,8.237014e-7,0.00015342851,6.5207274e-7,8.2195766e-7,0.00001812042,0.013528356],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985406,0.00036252005,0.000112072245,0.00022915007,0.0003744938,0.0003811968],"domain_scores_gemma":[0.99893016,0.00042207426,0.00003575903,0.00023602346,0.00018119057,0.00019478759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702537,0.000112507594,0.00019006015,0.0001924116,0.0006148421,0.000036975965,0.00025684616,0.00014369194,0.00008421582],"category_scores_gemma":[0.000064708925,0.000105693805,0.000058241065,0.0002692285,0.00027676742,0.0002176099,0.00008067936,0.00044515936,0.0000644084],"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.00043096318,0.00012332041,0.037118334,0.0005740298,0.00040933109,0.00029963948,0.008018434,0.0012138096,0.92962986,0.0062528863,0.010537332,0.0053920695],"study_design_scores_gemma":[0.004976307,0.0028134112,0.032986835,0.0016851969,0.000096961,0.00021804239,0.019589068,0.005268378,0.04656109,0.0041774237,0.88008696,0.0015403484],"about_ca_topic_score_codex":0.00011441439,"about_ca_topic_score_gemma":0.000015745907,"teacher_disagreement_score":0.88306874,"about_ca_system_score_codex":0.00006931874,"about_ca_system_score_gemma":0.000037063706,"threshold_uncertainty_score":0.47289306},"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":"W2553698168","doi":"10.1016/j.disc.2016.08.014","title":"Zero-sum flows for triple systems","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zero (linguistics); Mathematics; Combinatorics; Flow (mathematics); Zero-point energy; Discrete mathematics; Physics; Geometry","score_opus":0.013657764512558332,"score_gpt":0.21520396694117505,"score_spread":0.2015462024286167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553698168","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.10642807,0.00056087156,0.8758946,0.000049842725,0.0020731557,0.0010983229,0.00021095127,0.0007160053,0.012968189],"genre_scores_gemma":[0.9947822,0.000016417698,0.00207783,0.0000052745045,0.00013594552,0.00023075398,0.0000065495565,0.00006777189,0.0026772763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913037,0.000017365579,0.00033298583,0.00012181556,0.00012363186,0.00027381035],"domain_scores_gemma":[0.99931914,0.00017696366,0.000047390473,0.00035149226,0.00003054145,0.00007450509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002885948,0.00016854818,0.00027073736,0.000054384745,0.000054796434,0.000043153777,0.00018044226,0.00008245661,0.0000233495],"category_scores_gemma":[0.000053188764,0.000106576816,0.00012372027,0.00007789595,0.000021081261,0.00009479386,0.000014049187,0.000037167305,0.000137864],"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.000029713612,0.000074446994,0.000081981016,0.004921111,0.00040225143,0.000006894934,0.002590092,0.0016780657,0.061532613,0.8979313,0.027530009,0.0032215582],"study_design_scores_gemma":[0.0052186,0.00031128796,0.000041078132,0.0030815192,0.0003206806,0.00011232446,0.0030873276,0.4506695,0.027041545,0.2979763,0.20970103,0.002438817],"about_ca_topic_score_codex":8.828608e-7,"about_ca_topic_score_gemma":0.0000011619155,"teacher_disagreement_score":0.8883541,"about_ca_system_score_codex":0.000027908249,"about_ca_system_score_gemma":0.000005008783,"threshold_uncertainty_score":0.43460765},"labels":[],"label_agreement":null},{"id":"W2559961335","doi":"10.1016/j.laa.2017.01.013","title":"Total positivity of sums, Hadamard products and Hadamard powers: Results and counterexamples","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Hadamard transform; Counterexample; Hadamard product; Exponent; Hadamard matrix; Complex Hadamard matrix; Hadamard three-lines theorem; Hadamard's maximal determinant problem; Order (exchange); Hankel matrix; Hadamard's inequality; Combinatorics; Product (mathematics); Matrix (chemical analysis); Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.012337896371283413,"score_gpt":0.22564606289594563,"score_spread":0.21330816652466222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559961335","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.9946633,0.0016310012,0.00030116618,0.0003204735,0.000058402158,0.00039351374,0.00022886801,0.00006260368,0.0023406772],"genre_scores_gemma":[0.9991218,0.0003287537,0.00019629438,0.000009955146,0.00008417922,0.000037939637,0.000022364007,0.000014289261,0.00018442873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993831,0.00001618779,0.0001870205,0.00021735312,0.00007153952,0.0001247859],"domain_scores_gemma":[0.99939525,0.00005940288,0.00007031281,0.00034619315,0.00005694159,0.00007188212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017536017,0.000118089076,0.00017393088,0.000036519185,0.00023843134,0.00007443625,0.00008838017,0.00006247978,0.0000019119393],"category_scores_gemma":[0.000045362176,0.00011133878,0.000016988846,0.000043835313,0.00012321767,0.0001736539,0.00005525672,0.00008064118,0.000003187116],"study_design_candidate":"observational","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.00061044534,0.0004714813,0.01855932,0.004330903,0.0009509519,0.000013450253,0.0076087913,0.00016346155,0.2970649,0.61226404,0.0062624263,0.05169987],"study_design_scores_gemma":[0.00712851,0.0007913862,0.6441917,0.00089252286,0.0005330549,0.00043509918,0.0020035899,0.020427575,0.12531032,0.020904128,0.17457314,0.0028089934],"about_ca_topic_score_codex":0.000032471908,"about_ca_topic_score_gemma":0.000015414798,"teacher_disagreement_score":0.62563235,"about_ca_system_score_codex":0.0000040628142,"about_ca_system_score_gemma":0.000007752796,"threshold_uncertainty_score":0.45402637},"labels":[],"label_agreement":null},{"id":"W2560327409","doi":"10.1515/rmm-2016-0010","title":"The Maximum Queens Problem with Pawns","year":2016,"lang":"en","type":"article","venue":"Recreational mathematics magazine","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"Quarter (Canadian coin); Square (algebra); Combinatorics; Mathematics; Computer science; Telecommunications; Geography; Geometry","score_opus":0.006041716266167615,"score_gpt":0.18106495863373456,"score_spread":0.17502324236756694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560327409","genre_codex":"other","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.12142733,0.0010378265,0.27407736,0.0027076348,0.00047768318,0.0017070132,0.000102069775,0.0014241807,0.5970389],"genre_scores_gemma":[0.96843517,0.00021925056,0.015933238,0.000020053509,0.00018830554,0.00024398444,0.000011702227,0.000087641965,0.0148606505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999253,0.000021042351,0.00022395262,0.000096346375,0.00021150445,0.00019419238],"domain_scores_gemma":[0.99921215,0.00037281984,0.000047314228,0.0002487119,0.0000674654,0.00005153754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000260247,0.00013595608,0.00012804885,0.0000358497,0.00010587421,0.000038478753,0.00014157806,0.000039957096,0.0000831534],"category_scores_gemma":[0.000028702802,0.00006155114,0.00004056095,0.00012185954,0.00006959041,0.0000829148,0.0000124562,0.00005328817,0.0004727846],"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.000028070306,0.00006750594,0.0005079888,0.00024650505,0.0002154731,0.0000068177133,0.00036176032,0.00049222773,0.009745398,0.97063446,0.005810082,0.011883735],"study_design_scores_gemma":[0.0015309112,0.00019197844,0.0029155647,0.0014856829,0.000099605044,0.0002858696,0.0002736039,0.0065542003,0.0034063999,0.8285917,0.15385045,0.0008140028],"about_ca_topic_score_codex":4.4479418e-7,"about_ca_topic_score_gemma":0.000009511861,"teacher_disagreement_score":0.8470079,"about_ca_system_score_codex":0.000035085475,"about_ca_system_score_gemma":0.000015234977,"threshold_uncertainty_score":0.60768473},"labels":[],"label_agreement":null},{"id":"W2563260604","doi":"10.1016/j.disc.2017.10.032","title":"New existence and nonexistence results for strong external difference families","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Shanghai Education Development Foundation; National Natural Science Foundation of China","keywords":"Mathematics; Character (mathematics); Combinatorics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.0303471063625325,"score_gpt":0.26113389886225996,"score_spread":0.23078679249972747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563260604","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.602324,0.00049345574,0.35772914,0.000056811154,0.00054185465,0.00056476495,0.00014176585,0.00022839977,0.03791976],"genre_scores_gemma":[0.9653491,0.00005546195,0.032985475,0.00000386946,0.000088902394,0.000025551482,0.0000031104912,0.000023301956,0.0014652446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920547,0.000007731676,0.00026808397,0.0001675286,0.00012510018,0.0002260966],"domain_scores_gemma":[0.9990791,0.0001139874,0.000108588865,0.0005765773,0.000020703183,0.00010100878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017991257,0.00017018126,0.00022929933,0.000031318756,0.0002363324,0.00022548567,0.00037391286,0.000056213663,0.000002627604],"category_scores_gemma":[0.0001237738,0.00014357032,0.000058317662,0.000020237896,0.00009021481,0.00012992232,0.000058417067,0.00007845362,0.000007069083],"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.00011841468,0.00003912671,0.0010604595,0.00305886,0.00014800695,0.000017571023,0.015633198,0.00025494967,0.012781857,0.9412527,0.00064908,0.024985764],"study_design_scores_gemma":[0.0051145875,0.0004209119,0.025931079,0.00424398,0.00024688191,0.00013621977,0.009742397,0.32229847,0.016264193,0.61077297,0.0025427795,0.0022855666],"about_ca_topic_score_codex":0.00001484504,"about_ca_topic_score_gemma":0.000017045344,"teacher_disagreement_score":0.36302504,"about_ca_system_score_codex":0.000009740423,"about_ca_system_score_gemma":0.0000078345165,"threshold_uncertainty_score":0.58546275},"labels":[],"label_agreement":null},{"id":"W2566154556","doi":"10.37236/5435","title":"Resolvable Group Divisible Designs with Large Groups","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Divisibility rule; Group (periodic table); Multipartite; Transversal (combinatorics); Graph; Recursion (computer science); Product (mathematics); Discrete mathematics; Algorithm","score_opus":0.005410453130396551,"score_gpt":0.17726924697395124,"score_spread":0.17185879384355468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566154556","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.71522987,0.008007287,0.27237126,0.00023897756,0.00079750083,0.0001859278,0.0000023061132,0.0001142814,0.0030525888],"genre_scores_gemma":[0.9989231,0.00059568364,0.0000065768836,0.000016276741,0.000098715034,0.000004487822,2.1967318e-7,0.00003837883,0.00031652435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985332,0.00012409152,0.00030242954,0.00007622216,0.00030986738,0.00065417145],"domain_scores_gemma":[0.99924165,0.0001890618,0.00013655805,0.00026612586,0.00008771914,0.00007890697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014781426,0.00015912789,0.0002425005,0.00009491947,0.00012175313,0.000029973487,0.00045542815,0.00005828075,0.000024343988],"category_scores_gemma":[0.000019727862,0.000076212804,0.00009231437,0.00034853906,0.000039623366,0.00023799718,0.000019431101,0.00039025076,0.000017065735],"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.000081809565,0.0000614965,0.00057342363,0.00001843157,0.00017487636,0.000012835509,0.00015519756,0.00011699737,0.003466502,0.9941218,0.000945598,0.0002710667],"study_design_scores_gemma":[0.0033196006,0.0018114569,0.00054983725,0.00023458175,0.000119699274,0.00056274957,0.0002569288,0.00017542117,0.00742976,0.9516269,0.033552255,0.00036083665],"about_ca_topic_score_codex":9.3199924e-7,"about_ca_topic_score_gemma":0.000006470786,"teacher_disagreement_score":0.28369325,"about_ca_system_score_codex":0.00020955286,"about_ca_system_score_gemma":0.000065509164,"threshold_uncertainty_score":0.31078678},"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":"W2571863560","doi":"","title":"D-Graphs For Graphs With Cyclomatic Number 1.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Discrete mathematics; Combinatorics; Computer science; Programming language","score_opus":0.005566835813694077,"score_gpt":0.1961091470847512,"score_spread":0.1905423112710571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571863560","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.9899471,0.00006916355,0.00047780114,0.00004264308,0.0015496988,0.0003376918,0.000011152675,0.00042491476,0.007139854],"genre_scores_gemma":[0.9993465,0.000012909285,0.00015309725,0.000015757487,0.000005988183,0.00016820738,0.000002445562,0.000053101307,0.00024201308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999202,0.000026652151,0.00018468092,0.00016216454,0.00012487128,0.00029963822],"domain_scores_gemma":[0.9993649,0.0001538126,0.000032948134,0.00031538625,0.000042577627,0.00009037171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015621577,0.00017767526,0.00020493276,0.00006277105,0.000070227994,0.000022433805,0.00016820084,0.000074678865,0.000049572292],"category_scores_gemma":[0.000012735622,0.000115275194,0.00009328231,0.00021343998,0.000053279884,0.0001420211,0.000009500189,0.000051959505,0.00011713682],"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.0000218665,0.000025266248,0.0073072836,0.0000929775,0.000102861755,0.000003532236,0.00010656336,0.000008393706,0.0017295503,0.98706585,0.0027577933,0.0007780819],"study_design_scores_gemma":[0.0015185759,0.00007845246,0.0017189871,0.00014536653,0.00002941034,0.000017460281,0.00004601504,0.00006612781,0.003372398,0.9898849,0.0028448852,0.00027739513],"about_ca_topic_score_codex":0.0000026658722,"about_ca_topic_score_gemma":0.0000033262559,"teacher_disagreement_score":0.0093994,"about_ca_system_score_codex":0.000021454269,"about_ca_system_score_gemma":0.0000072437215,"threshold_uncertainty_score":0.4700786},"labels":[],"label_agreement":null},{"id":"W2572140781","doi":"","title":"On group choosability of graphs, I.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Combinatorics; Physics","score_opus":0.005379754511129551,"score_gpt":0.18656325268210305,"score_spread":0.1811834981709735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572140781","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.9915607,0.000076902455,0.000025821306,0.000015091024,0.0018686175,0.00009465495,0.0000072700295,0.00015599678,0.0061949654],"genre_scores_gemma":[0.999907,0.0000109808125,0.000007090507,0.0000064698856,0.0000031702143,0.000013248746,8.46717e-7,0.000015879155,0.00003530775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939245,0.000045577057,0.00018092134,0.000116492476,0.00011490776,0.00014963916],"domain_scores_gemma":[0.9994227,0.0001413785,0.000025366882,0.00033811745,0.000019828589,0.000052600262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021973765,0.0001015531,0.00015493941,0.00005439911,0.000021785507,0.000004071528,0.00014267463,0.000061448314,0.00006143663],"category_scores_gemma":[0.00003483261,0.00007197444,0.00007702165,0.00014092676,0.00005345644,0.0000654254,0.0000115944285,0.000055698358,0.00005988254],"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.0000118062535,0.00004631418,0.004740691,0.000037421814,0.00002408748,8.910528e-7,0.000040562958,0.000006029294,0.010132879,0.98303306,0.0007354201,0.0011908273],"study_design_scores_gemma":[0.0005613531,0.00008227919,0.01093898,0.00006913744,0.0000052364153,9.448333e-7,0.000011253473,0.0000140746715,0.013968988,0.97358024,0.0006520194,0.00011548507],"about_ca_topic_score_codex":0.000003928755,"about_ca_topic_score_gemma":0.0000011307043,"teacher_disagreement_score":0.009452821,"about_ca_system_score_codex":0.000023616236,"about_ca_system_score_gemma":0.0000026836,"threshold_uncertainty_score":0.29350325},"labels":[],"label_agreement":null},{"id":"W2572211324","doi":"","title":"Flag-transitive symmetric (v, k, λ) designs admitting primitive automorphism groups with socle PSL(12, 2).","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Socle; Mathematics; Flag (linear algebra); Combinatorics; Transitive relation; Automorphism; Inner automorphism; Automorphism group; Pure mathematics; Algebra over a field; Inversion (geology)","score_opus":0.010808875956459124,"score_gpt":0.1895865507763271,"score_spread":0.17877767481986798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572211324","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.9799015,0.00026052617,0.0043758284,0.00006610806,0.001747868,0.00045467514,0.000019912899,0.0008718815,0.012301736],"genre_scores_gemma":[0.9993721,0.000023855318,0.000120259596,0.000037985377,0.000029064364,0.00007660699,0.000004510203,0.0000923878,0.00024323454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983378,0.00015138969,0.00031069096,0.00035194616,0.00029957358,0.0005485888],"domain_scores_gemma":[0.9989066,0.00037078754,0.00007672192,0.00035557008,0.00010000774,0.00019028097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310106,0.000329247,0.0003655974,0.0002315144,0.00016112455,0.000043980854,0.0002519154,0.0001564772,0.000049459588],"category_scores_gemma":[0.000054293956,0.00024312129,0.0001072348,0.0005671482,0.00011454633,0.00034260566,0.000026468642,0.000214497,0.00015881241],"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.00009816298,0.00013333252,0.0043318486,0.00012085787,0.00044071334,0.0001518289,0.0019715615,0.00008153734,0.028204272,0.9581418,0.0009657231,0.0053583747],"study_design_scores_gemma":[0.018714918,0.002559092,0.07905332,0.0028792932,0.00060534634,0.00040672402,0.0030929549,0.003650018,0.286417,0.59393126,0.003900106,0.004789981],"about_ca_topic_score_codex":0.0000103377315,"about_ca_topic_score_gemma":0.0000048754505,"teacher_disagreement_score":0.36421055,"about_ca_system_score_codex":0.00015412303,"about_ca_system_score_gemma":0.00003837615,"threshold_uncertainty_score":0.99141985},"labels":[],"label_agreement":null},{"id":"W2572460349","doi":"","title":"Packing and covering λ-fold complete symmetric digraphs with 6-circuits.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Mathematics; Combinatorics; Electronic circuit; Computer science; Engineering; Electrical engineering","score_opus":0.008648952972416793,"score_gpt":0.17544454032885357,"score_spread":0.16679558735643676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572460349","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.9915028,0.00067197514,0.0002935535,0.000017034497,0.000869527,0.00014005053,0.0000093638755,0.00031357675,0.0061820913],"genre_scores_gemma":[0.9997868,0.00006959868,0.000014403616,0.000014669842,0.000009168508,0.000017451921,0.0000012587287,0.000042154046,0.00004449602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912727,0.000033464494,0.00017194917,0.000200534,0.00015994746,0.00030684835],"domain_scores_gemma":[0.99940366,0.00016195433,0.00003607345,0.0002581515,0.000028773531,0.000111395006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016988323,0.00018793026,0.0002253223,0.00017561328,0.0000906701,0.000050097387,0.00013360668,0.000062994826,0.000012322977],"category_scores_gemma":[0.000017506909,0.00013303579,0.000039655235,0.00043368514,0.00006159359,0.00020482203,0.000026733916,0.000091392096,0.00002707614],"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.000010027607,0.000020042342,0.04776194,0.00011747986,0.00013936631,0.00002629613,0.00022450495,0.00003138646,0.013714663,0.93139416,0.00020456851,0.0063555385],"study_design_scores_gemma":[0.011864069,0.00093453424,0.18380411,0.002306059,0.00023289131,0.0003753207,0.00060391653,0.0015074472,0.024306946,0.74481964,0.025918983,0.0033260856],"about_ca_topic_score_codex":0.0000090674175,"about_ca_topic_score_gemma":0.0000034981554,"teacher_disagreement_score":0.18657455,"about_ca_system_score_codex":0.00003369657,"about_ca_system_score_gemma":0.0000055289797,"threshold_uncertainty_score":0.54250425},"labels":[],"label_agreement":null},{"id":"W2572870995","doi":"","title":"G-Designs Having a Prescribed Number of Blocks in Common.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.011482701678432126,"score_gpt":0.22335911755899074,"score_spread":0.2118764158805586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572870995","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.99064547,0.000096393414,0.000044013985,0.000015852707,0.00091873313,0.00012477205,0.000004352285,0.00011518835,0.008035223],"genre_scores_gemma":[0.9997272,0.000009093286,0.0000267268,0.0000044533303,0.000004516924,0.000022901397,6.465883e-7,0.000023720158,0.00018073338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992231,0.000064825355,0.000278765,0.00011229893,0.000108940236,0.0002120742],"domain_scores_gemma":[0.999488,0.00013216957,0.00003455884,0.00027543705,0.00002119828,0.000048665162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024221271,0.00011611938,0.00023050437,0.00006233306,0.000018047058,0.000007671053,0.00017957181,0.00008242514,0.00009516592],"category_scores_gemma":[0.00001896953,0.000093868424,0.00005314536,0.0001748916,0.000036872338,0.000103072016,0.000025774838,0.00008344038,0.000041607473],"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.0000335665,0.00013307475,0.19632451,0.00012351065,0.000074888914,0.000025777486,0.0010309217,0.00009644689,0.06687863,0.73069805,0.0021953103,0.0023853092],"study_design_scores_gemma":[0.002857385,0.000068644054,0.026493065,0.0007402051,0.00002402145,0.00002221541,0.0001781733,0.0005180867,0.06648866,0.9006729,0.0014187177,0.0005179093],"about_ca_topic_score_codex":0.000029894398,"about_ca_topic_score_gemma":0.000011274332,"teacher_disagreement_score":0.16997486,"about_ca_system_score_codex":0.000036181013,"about_ca_system_score_gemma":0.000007216756,"threshold_uncertainty_score":0.38278434},"labels":[],"label_agreement":null},{"id":"W2573809857","doi":"","title":"Construction of super edge-connected multigraphs with prescribed degrees.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.005646108330770707,"score_gpt":0.16990715226698636,"score_spread":0.16426104393621566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573809857","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.99555343,0.00018372416,0.00017965301,0.0000125292,0.0013754194,0.00017297891,0.000010686971,0.0002457893,0.002265758],"genre_scores_gemma":[0.99965596,0.000015339963,0.00021351651,0.000002316498,0.0000064591613,0.000022803652,0.0000023090697,0.00002692309,0.00005439426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927473,0.00004767133,0.00021012881,0.00014410361,0.0001285125,0.00019487247],"domain_scores_gemma":[0.9994315,0.000090921945,0.00004011441,0.0002849542,0.00008654495,0.00006598558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101435406,0.00014599708,0.00020581088,0.000099509976,0.000034645444,0.000008625569,0.00012612158,0.00008658293,0.00006121624],"category_scores_gemma":[0.000023496237,0.00009863576,0.00005415031,0.0002289327,0.00013082125,0.00015527605,0.000010857497,0.00006718669,0.000019078176],"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.00011805567,0.000071106195,0.053812023,0.00014153053,0.00028197706,0.000008274498,0.0006372371,0.00007192797,0.10673933,0.8332017,0.00080909,0.0041077584],"study_design_scores_gemma":[0.014583679,0.0008008991,0.0703581,0.001282786,0.00021364413,0.00013914911,0.0009170148,0.0011561532,0.5768048,0.32635304,0.0057060774,0.0016846446],"about_ca_topic_score_codex":0.000015151794,"about_ca_topic_score_gemma":0.000009200985,"teacher_disagreement_score":0.50684863,"about_ca_system_score_codex":0.000019237254,"about_ca_system_score_gemma":0.000011260381,"threshold_uncertainty_score":0.402225},"labels":[],"label_agreement":null},{"id":"W2574325694","doi":"","title":"A note on the intersection graph of subspaces of a vector space.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Mathematics; Intersection (aeronautics); Vector space; Graph; Combinatorics; Space (punctuation); Pure mathematics; Computer science; Geography; Cartography","score_opus":0.00667989212937458,"score_gpt":0.19173352667101515,"score_spread":0.18505363454164056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574325694","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.9952516,0.00005861157,0.0000954792,0.00010440867,0.0017993253,0.00010681158,0.0000049527157,0.00005655714,0.002522274],"genre_scores_gemma":[0.9999046,0.000011929864,0.000004156236,0.0000035401813,0.000005778743,0.000011668074,2.2217111e-7,0.000013386352,0.000044743687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950975,0.000055831115,0.00014783634,0.0000748251,0.000107950495,0.000103786595],"domain_scores_gemma":[0.99944943,0.00020335101,0.000055458084,0.00023715825,0.00003201042,0.000022619357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019728795,0.000086567896,0.0001383937,0.000058701386,0.000020699292,0.0000038189382,0.0001242052,0.000047817124,0.000028305827],"category_scores_gemma":[0.000039446397,0.00004938338,0.00008011953,0.00018561246,0.00006048848,0.000046667526,0.000010849233,0.000057166348,0.000014502336],"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.000033261567,0.000027001259,0.0008770603,0.000045098313,0.000050856506,6.037567e-7,0.0006193791,0.000019429788,0.117437795,0.87993807,0.0006284648,0.00032296384],"study_design_scores_gemma":[0.0008239474,0.00033453526,0.0062218364,0.00047843976,0.000024495459,0.0000030781544,0.00036089594,0.00013676484,0.59852,0.3921989,0.00071560865,0.0001814987],"about_ca_topic_score_codex":0.000015161367,"about_ca_topic_score_gemma":0.000008423331,"teacher_disagreement_score":0.48773918,"about_ca_system_score_codex":0.00001995714,"about_ca_system_score_gemma":0.000004769237,"threshold_uncertainty_score":0.20137957},"labels":[],"label_agreement":null},{"id":"W2574536825","doi":"","title":"Some Families of Combination and Permutation Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Art","score_opus":0.005091354909450043,"score_gpt":0.1869745389177904,"score_spread":0.18188318400834036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574536825","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.99753153,0.00049968786,0.000027119015,0.00002664984,0.0009626615,0.000087194625,0.000004584428,0.000104159495,0.00075643195],"genre_scores_gemma":[0.9997243,0.00019475108,0.000008735474,0.0000044194203,0.0000031767124,0.000011022331,0.0000021188857,0.00001284736,0.000038624054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995441,0.000030306928,0.00015320562,0.00008312589,0.0000917212,0.00009753907],"domain_scores_gemma":[0.9997167,0.00007227956,0.000030654403,0.00011378902,0.000034987755,0.000031609325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012815307,0.00008087438,0.00011960468,0.00010060556,0.00002968067,0.00000758994,0.0000575416,0.000050464998,0.000005516421],"category_scores_gemma":[0.000017169294,0.00006341875,0.000028668583,0.000104808,0.000058539732,0.00021242099,0.000009909781,0.00003077165,0.000008188342],"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.0000042418533,0.000015730295,0.0053407177,0.00005443649,0.000020459796,5.87243e-7,0.0002815545,0.0000040729906,0.024981853,0.9668615,0.00011906163,0.002315813],"study_design_scores_gemma":[0.0007897156,0.00005836871,0.025704091,0.00005996067,0.000010000999,0.0000025441059,0.00012751757,0.00015589852,0.02107676,0.95175827,0.00014664052,0.00011024994],"about_ca_topic_score_codex":0.000004088032,"about_ca_topic_score_gemma":7.28904e-7,"teacher_disagreement_score":0.020363374,"about_ca_system_score_codex":0.000012946992,"about_ca_system_score_gemma":0.0000032834241,"threshold_uncertainty_score":0.25861415},"labels":[],"label_agreement":null},{"id":"W2574657350","doi":"","title":"Modular Multiplicative Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicative function; Modular design; Combinatorics; Programming language; Computer science; Mathematical analysis","score_opus":0.006223955484041117,"score_gpt":0.18980167869536704,"score_spread":0.18357772321132593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574657350","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.99084866,0.00023677736,0.0002319782,0.000040900664,0.0015706974,0.00013087486,0.0000069637417,0.00043276604,0.0065003824],"genre_scores_gemma":[0.99965906,0.000028256087,0.000028886692,0.000011895369,0.0000053954136,0.00004558399,0.0000011024223,0.000027366379,0.00019244773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993876,0.00003256562,0.0001373435,0.0001421832,0.00009549771,0.00020480769],"domain_scores_gemma":[0.9994863,0.0000666176,0.000019300755,0.0003222692,0.000029205792,0.00007625782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110085064,0.00012291702,0.00013126322,0.000058653543,0.000044689103,0.00001048917,0.00017459413,0.00006592082,0.000038938524],"category_scores_gemma":[0.00001703855,0.00008879364,0.00006636226,0.0001563688,0.000045004916,0.00011076736,0.000017777082,0.000058834637,0.00029091325],"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.000004725873,0.000019118761,0.0014574111,0.000013600145,0.000048446134,0.0000038157527,0.00014811369,0.000021001111,0.052521326,0.9426068,0.00095419615,0.0022014384],"study_design_scores_gemma":[0.00089658727,0.000031759777,0.005333204,0.000051695188,0.000008792857,0.000004491049,0.0000382076,0.00027298334,0.036043048,0.9506857,0.006381676,0.00025186024],"about_ca_topic_score_codex":0.000002643643,"about_ca_topic_score_gemma":6.3059707e-7,"teacher_disagreement_score":0.016478276,"about_ca_system_score_codex":0.000027415002,"about_ca_system_score_gemma":0.0000032642015,"threshold_uncertainty_score":0.3739198},"labels":[],"label_agreement":null},{"id":"W2575176279","doi":"","title":"Graph Decompositions of K(v, λ) into Modified Triangles Using Langford and Skolem Sequences.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.013257068528164091,"score_gpt":0.22423441705597388,"score_spread":0.2109773485278098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575176279","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.99699295,0.00044580846,0.0007688276,0.000022438171,0.00067122804,0.00009803891,0.0000100396,0.0000996484,0.00089103595],"genre_scores_gemma":[0.99967813,0.00003721414,0.0002344851,0.0000044022017,0.000006085404,0.000008401887,0.0000016094375,0.000015472791,0.000014206965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994444,0.000041177915,0.0001932784,0.00010472381,0.000079683305,0.0001367068],"domain_scores_gemma":[0.99963063,0.00008275086,0.000037102975,0.00016170806,0.000028859944,0.000058953592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014071265,0.00010264168,0.00017269679,0.000103578626,0.00005768529,0.000012052235,0.0000967344,0.000063723244,0.00000834046],"category_scores_gemma":[0.00001045286,0.00007960453,0.000049381957,0.00015768134,0.00007737608,0.00012729772,0.000017872055,0.000042759035,0.0000035583018],"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.000014042522,0.000025147265,0.0020803,0.00009002501,0.00007881197,0.0000050695694,0.00043470747,0.00020590158,0.16576831,0.8296532,0.00010257379,0.0015418901],"study_design_scores_gemma":[0.0011369752,0.000051970404,0.00093506067,0.00020157188,0.00003299399,0.0000154174,0.00013100507,0.00091234705,0.039857246,0.95637214,0.00013597596,0.00021729397],"about_ca_topic_score_codex":0.00003991337,"about_ca_topic_score_gemma":0.000006942328,"teacher_disagreement_score":0.12671892,"about_ca_system_score_codex":0.000024099087,"about_ca_system_score_gemma":0.000008111413,"threshold_uncertainty_score":0.32461786},"labels":[],"label_agreement":null},{"id":"W2575238872","doi":"","title":"The 2-color Rado number of x 1 +x 2 +...+x n = y 1 +y 2 +...+y k .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004983878370192777,"score_gpt":0.20081233706500365,"score_spread":0.19582845869481086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575238872","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.9782563,0.00020428842,0.000022372164,0.00008782158,0.002984411,0.000104812774,0.0000045563565,0.00013817509,0.018197248],"genre_scores_gemma":[0.9991728,0.000055245207,0.000010047907,0.000006028325,0.000009545838,0.000023277937,3.5675293e-7,0.000021296699,0.0007014092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933326,0.00004825186,0.00020659415,0.00008609853,0.00012395099,0.00020184947],"domain_scores_gemma":[0.99930584,0.00024832704,0.000035806584,0.00032709356,0.00003658779,0.000046338504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002645291,0.000101194935,0.00013435046,0.000017417005,0.000072970404,0.000012195289,0.000238118,0.00005944983,0.00006783864],"category_scores_gemma":[0.00003600633,0.00005534262,0.00007116749,0.00012767389,0.00008264762,0.000074073774,0.000022749227,0.000056381934,0.00024860815],"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.000010373901,0.000012849198,0.0030553595,0.000016455706,0.00004778588,0.0000016431885,0.00008228648,0.000004167235,0.0066163787,0.9830173,0.0043844553,0.0027509134],"study_design_scores_gemma":[0.0011369657,0.00004387486,0.0037484318,0.000093328126,0.000018817513,0.0000166346,0.00011476333,0.00010183877,0.031565275,0.89368004,0.06922206,0.00025796614],"about_ca_topic_score_codex":0.0000031167408,"about_ca_topic_score_gemma":0.0000013574154,"teacher_disagreement_score":0.08933729,"about_ca_system_score_codex":0.00002273409,"about_ca_system_score_gemma":0.0000074303102,"threshold_uncertainty_score":0.31954378},"labels":[],"label_agreement":null},{"id":"W2575390771","doi":"","title":"Some Notes on Combination Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00798137006028041,"score_gpt":0.19765791428804752,"score_spread":0.1896765442277671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575390771","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.99128205,0.0001941926,0.000024764282,0.00014981788,0.004345775,0.00012975352,0.0000054959755,0.00046685166,0.0034012916],"genre_scores_gemma":[0.99970603,0.000048740698,0.0000051010516,0.000040971267,0.000014268059,0.000027422384,0.0000026613639,0.000031565763,0.00012321198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992585,0.00004489649,0.0001671641,0.00014825682,0.00015975394,0.0002214056],"domain_scores_gemma":[0.9994003,0.0001947105,0.000026298385,0.00028035603,0.000027901324,0.00007039521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017093838,0.00015307542,0.00015066579,0.00012036111,0.0000634584,0.000020909863,0.00015740954,0.00008595526,0.00003201532],"category_scores_gemma":[0.00003940268,0.000109800174,0.00007277318,0.0001568484,0.00003766654,0.00019468606,0.0000127431185,0.000078227255,0.00041151617],"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.0000071139148,0.0000420511,0.00105643,0.000015919755,0.000026137908,0.0000033487502,0.000053244567,0.000013999623,0.0072981343,0.9881188,0.0012110877,0.0021537181],"study_design_scores_gemma":[0.00090871577,0.00010290522,0.0037376615,0.00007757579,0.0000068495137,0.000002156642,0.000009693683,0.00006820802,0.027600596,0.96577716,0.0015097347,0.00019871992],"about_ca_topic_score_codex":0.000002384645,"about_ca_topic_score_gemma":5.8637676e-7,"teacher_disagreement_score":0.02234163,"about_ca_system_score_codex":0.00004297096,"about_ca_system_score_gemma":0.0000043092436,"threshold_uncertainty_score":0.5289345},"labels":[],"label_agreement":null},{"id":"W2575829591","doi":"","title":"On Holey Schroder Designs of Type 2 n u 1 .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Geology","score_opus":0.013861276166547809,"score_gpt":0.21018713694037852,"score_spread":0.1963258607738307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575829591","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.9884119,0.00011865801,0.00010633606,0.000020047511,0.0021159062,0.00006796084,0.000002751973,0.00012442203,0.0090320045],"genre_scores_gemma":[0.9997051,0.000012305636,0.0000139692465,0.000012367591,0.000005150637,0.0000045684337,5.423822e-7,0.000019841886,0.00022618116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995352,0.000030651318,0.0001237973,0.00008477422,0.000094263596,0.00013128888],"domain_scores_gemma":[0.9995771,0.00009177484,0.00001948234,0.00023702477,0.000033646713,0.000040951716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012077937,0.00008512141,0.00011954145,0.000050909362,0.000019015653,0.000004705847,0.00011638107,0.000056569163,0.000087089706],"category_scores_gemma":[0.000032178013,0.00006093056,0.000035480116,0.00012957142,0.000028538463,0.000053959968,0.000009067084,0.00004571029,0.00021705848],"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.00001602068,0.000023968147,0.00039196375,0.00002359554,0.000030990417,0.0000022785277,0.000063181134,0.000070776194,0.035067536,0.960462,0.0031931829,0.0006545488],"study_design_scores_gemma":[0.0010247186,0.00024820122,0.0014282095,0.00020728218,0.000013557095,0.0000029874216,0.00002337373,0.00012877966,0.10799485,0.8859618,0.0027247474,0.00024155123],"about_ca_topic_score_codex":0.0000014371536,"about_ca_topic_score_gemma":2.781646e-7,"teacher_disagreement_score":0.07450022,"about_ca_system_score_codex":0.000018121833,"about_ca_system_score_gemma":0.000006921712,"threshold_uncertainty_score":0.278992},"labels":[],"label_agreement":null},{"id":"W2576301321","doi":"","title":"Intersections Of Sets Expressible As Unions Of k Starshaped Sets.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009149818768164878,"score_gpt":0.22147172630488673,"score_spread":0.21232190753672187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576301321","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.99001807,0.00010555282,0.000052569518,0.000015838295,0.0015896686,0.00009796389,0.00003529284,0.00011006556,0.007975005],"genre_scores_gemma":[0.99975485,0.00002068331,0.000024083594,0.000003542839,0.0000019610777,0.00001471277,0.0000030442968,0.000020002311,0.00015710774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934506,0.00005084949,0.00025397775,0.00009722417,0.000107287975,0.00014558874],"domain_scores_gemma":[0.9994326,0.00010371335,0.000056843204,0.00029368006,0.00005694486,0.000056190056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013180997,0.00010099797,0.00018703497,0.00011022518,0.000028726572,0.000003987372,0.00015901116,0.00006783068,0.00012860155],"category_scores_gemma":[0.000025515117,0.00008111805,0.000077527104,0.0001993945,0.0000610791,0.00011370892,0.00002889086,0.00006165551,0.000033311764],"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.000023207147,0.00010142248,0.0024764002,0.00015904993,0.0001587655,0.0000030236763,0.0013040869,0.000092746304,0.23734383,0.7557438,0.0018700883,0.00072357635],"study_design_scores_gemma":[0.001616535,0.00023119707,0.0023175534,0.00066366803,0.00004356426,0.00001208296,0.0010915251,0.00024589652,0.29271507,0.6986494,0.0021055527,0.00030791335],"about_ca_topic_score_codex":0.000026388605,"about_ca_topic_score_gemma":0.000006172701,"teacher_disagreement_score":0.05709437,"about_ca_system_score_codex":0.00002259871,"about_ca_system_score_gemma":0.00001391542,"threshold_uncertainty_score":0.3307898},"labels":[],"label_agreement":null},{"id":"W2577380394","doi":"","title":"Hamiltonicity of L 1 -Graphs with Bounded Dilworth Numbers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Combinatorics; Discrete mathematics","score_opus":0.004813174688535074,"score_gpt":0.17729504520789352,"score_spread":0.17248187051935845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577380394","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.985936,0.00014043169,0.00008674321,0.00001498204,0.0008972996,0.000118524564,0.00000752968,0.00020256001,0.012595916],"genre_scores_gemma":[0.99973065,0.000024126013,0.000041216015,0.0000068716645,0.0000034043715,0.000015381422,0.000001248402,0.00002833207,0.00014875866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00003569661,0.0001977986,0.00013794645,0.00016326238,0.00022454612],"domain_scores_gemma":[0.9994174,0.00007059642,0.0000463806,0.00034737348,0.000045985227,0.00007225538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014761333,0.00014417,0.00021964018,0.00006205871,0.00004083836,0.000010933062,0.00017282396,0.00006864812,0.000047627986],"category_scores_gemma":[0.00001006981,0.00009564995,0.000066321285,0.00023861637,0.00010420925,0.00012477279,0.000016059086,0.00007166916,0.000030669322],"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.000032852557,0.00004228641,0.026616491,0.000065575325,0.00012024819,0.0000069159855,0.00017623967,0.00001680763,0.0045064376,0.96732837,0.0006243373,0.00046344992],"study_design_scores_gemma":[0.0028580776,0.00024484916,0.021105554,0.0003948345,0.00005078072,0.000021551039,0.000109341636,0.00007447319,0.04574745,0.9251937,0.003661625,0.0005377148],"about_ca_topic_score_codex":0.000021117956,"about_ca_topic_score_gemma":0.000019319146,"teacher_disagreement_score":0.042134613,"about_ca_system_score_codex":0.000027395126,"about_ca_system_score_gemma":0.000013730691,"threshold_uncertainty_score":0.39004916},"labels":[],"label_agreement":null},{"id":"W2578247564","doi":"","title":"Bases of primitive nonpowerful zero-symmetric sign pattern matrices without nonzero diagonal entry.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Diagonal; Sign (mathematics); Zero (linguistics); Combinatorics; Pure mathematics; Diagonal matrix; Mathematical analysis; Geometry","score_opus":0.0064924286063905426,"score_gpt":0.19799549467200644,"score_spread":0.1915030660656159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578247564","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.9896554,0.0006314057,0.00130025,0.000023997654,0.0022694843,0.0002465823,0.0000563239,0.00020111889,0.005615438],"genre_scores_gemma":[0.9995613,0.00010539235,0.000027750217,0.000018524013,0.000020978128,0.00003228043,0.000004547517,0.00004734104,0.00018188532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986374,0.00009905309,0.00037899776,0.00023878408,0.00029857855,0.0003471988],"domain_scores_gemma":[0.998868,0.0004681571,0.000115608236,0.00033694776,0.00009179942,0.00011949753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027542998,0.0002475222,0.00036191253,0.00025929377,0.000046332778,0.000021818,0.00029104642,0.000116922165,0.00013534233],"category_scores_gemma":[0.00007138169,0.00018871091,0.00012738784,0.00046819216,0.00007559231,0.00021161232,0.000047059082,0.000107917345,0.00015024327],"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.00020473468,0.00083877466,0.29606932,0.00097267586,0.0010442579,0.00010465205,0.0014861531,0.00017676933,0.098900415,0.505766,0.013515341,0.08092095],"study_design_scores_gemma":[0.010799598,0.0012706686,0.102988176,0.0020030648,0.0003627243,0.00007219015,0.00046322116,0.00085213024,0.65787596,0.20937821,0.011217764,0.0027163064],"about_ca_topic_score_codex":0.000021111076,"about_ca_topic_score_gemma":0.0000014971245,"teacher_disagreement_score":0.5589755,"about_ca_system_score_codex":0.000056871228,"about_ca_system_score_gemma":0.000020122132,"threshold_uncertainty_score":0.7695408},"labels":[],"label_agreement":null},{"id":"W2579153743","doi":"","title":"Turan-type problem for a cycle of length 6 in bipartite Eulerian digraph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Bipartite graph; Eulerian path; Type (biology); Combinatorics; Pure mathematics; Graph; Biology","score_opus":0.007220281594415526,"score_gpt":0.20223398233574424,"score_spread":0.19501370074132873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579153743","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.9959941,0.0002900469,0.000039569786,0.000033059725,0.0012215251,0.00032947236,0.000011428843,0.00011049152,0.0019703193],"genre_scores_gemma":[0.9997596,0.00003150353,0.00006178208,0.0000042971865,0.000007358714,0.00005791456,0.00000209254,0.000027786777,0.000047634494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.000032887805,0.0002707124,0.00013345077,0.00008097651,0.00024124273],"domain_scores_gemma":[0.999542,0.000104841725,0.000039670118,0.00022162919,0.000041541858,0.00005032562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023988965,0.00012122514,0.00021450783,0.00010992021,0.00002188933,0.000008679488,0.00014834375,0.00007509349,0.00001821472],"category_scores_gemma":[0.000025735226,0.00009370133,0.000069691305,0.0002834006,0.000034576922,0.00012728707,0.000012521758,0.00004905325,0.000015705915],"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.00011924663,0.000124636,0.014226209,0.0003763011,0.000103875485,0.0000039349816,0.0010568855,0.00013447352,0.14549428,0.8334921,0.00095972646,0.003908347],"study_design_scores_gemma":[0.0041440423,0.0003357711,0.00773565,0.00054853346,0.000025340454,0.0000043519003,0.00013902974,0.0006924068,0.1196341,0.8566709,0.0095624095,0.00050747086],"about_ca_topic_score_codex":0.000008885743,"about_ca_topic_score_gemma":0.000016750755,"teacher_disagreement_score":0.025860189,"about_ca_system_score_codex":0.000021694099,"about_ca_system_score_gemma":0.000009320076,"threshold_uncertainty_score":0.38210294},"labels":[],"label_agreement":null},{"id":"W2579257756","doi":"","title":"The goodness of path or cycle with respect to multiple copies of complete graphs of order three.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Goodness of fit; Order (exchange); Combinatorics; Discrete mathematics; Statistics; Computer science; Computer network; Business","score_opus":0.011488446934773185,"score_gpt":0.2046277397163393,"score_spread":0.1931392927815661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579257756","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.9981788,0.00015669204,0.00021527625,0.000024735558,0.0005495959,0.00026089026,0.000038011724,0.000044945362,0.0005310532],"genre_scores_gemma":[0.9998041,0.00001752689,0.000086618886,0.0000025546162,0.0000027306228,0.000023968205,6.961733e-7,0.000023796616,0.00003804525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915206,0.00005208763,0.00031207656,0.00011136324,0.0001933254,0.00017910132],"domain_scores_gemma":[0.9988297,0.00044908657,0.00009727612,0.00043122287,0.00014622766,0.000046470323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024723323,0.00012705688,0.00029705165,0.000060903367,0.000048429774,0.000005529181,0.00027573804,0.000041754978,0.000013262743],"category_scores_gemma":[0.00007186398,0.00006437872,0.00005205882,0.00040271078,0.00014815852,0.000055112934,0.00003471446,0.000047288628,0.0000041177263],"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.00061290344,0.00009915281,0.046626024,0.00027184768,0.00027479173,0.0000039874167,0.0010647291,0.0003300158,0.059241686,0.8899182,0.00041991865,0.0011367189],"study_design_scores_gemma":[0.009497199,0.0025772604,0.112454385,0.002346379,0.00012688467,0.000017778419,0.0022487466,0.00090978766,0.23993687,0.6247702,0.0041301847,0.0009842783],"about_ca_topic_score_codex":0.00005572956,"about_ca_topic_score_gemma":0.00020087212,"teacher_disagreement_score":0.26514798,"about_ca_system_score_codex":0.000011323821,"about_ca_system_score_gemma":0.00001812098,"threshold_uncertainty_score":0.2625288},"labels":[],"label_agreement":null},{"id":"W2579393861","doi":"","title":"A Combinatorial Identity And Its Related Conjecture.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Identity (music); Combinatorics; Pure mathematics; Aesthetics","score_opus":0.007059196975863847,"score_gpt":0.20324724939189034,"score_spread":0.1961880524160265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579393861","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.98493177,0.0009423937,0.000015278336,0.00006112222,0.008678791,0.00018006121,0.0000076074493,0.00042910967,0.0047538746],"genre_scores_gemma":[0.9996903,0.00007659338,0.000001989628,0.000009029777,0.000015837286,0.000017456223,0.0000015186287,0.00003341874,0.0001538879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990639,0.00007365384,0.00024060834,0.00019522324,0.00016406593,0.00026251486],"domain_scores_gemma":[0.9994711,0.00011285832,0.00003661237,0.00021881238,0.00003734907,0.00012324571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000288021,0.00017779102,0.0002242181,0.00007559325,0.00008371731,0.000039770595,0.0001703638,0.00016256722,0.00008045929],"category_scores_gemma":[0.00005928917,0.00013748916,0.00005537693,0.0002006979,0.000048229987,0.0003824695,0.0000431232,0.0001281024,0.00017759521],"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.000008536366,0.000016897278,0.0009057877,0.00003275322,0.000059329923,0.000012403333,0.000117970994,0.0000023806435,0.008593964,0.9894994,0.0004728222,0.00027778276],"study_design_scores_gemma":[0.002139752,0.00006378817,0.0018914808,0.000076069344,0.00002142505,0.000028527895,0.000018446764,0.00010244664,0.007061846,0.9862949,0.002037792,0.00026350326],"about_ca_topic_score_codex":0.0000032126982,"about_ca_topic_score_gemma":0.0000017767502,"teacher_disagreement_score":0.014758507,"about_ca_system_score_codex":0.00004169964,"about_ca_system_score_gemma":0.000009050583,"threshold_uncertainty_score":0.56066453},"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":"W2586722437","doi":"10.1139/tcsme-2013-0031","title":"PERFORMANCE ANALYSIS OF SEVERAL QUASI-ORTHOGONAL CODES OPTICAL CDMA FOR RADIO-OVER-FIBER SYSTEM","year":2013,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Code division multiple access; Radio over fiber; Codec; Electronic engineering; Arrayed waveguide grating; Encoder; Coding (social sciences); Hadamard transform; Computer network; Telecommunications; Optical fiber; Wavelength-division multiplexing; Engineering; Optics; Physics; Mathematics","score_opus":0.005996644231244309,"score_gpt":0.17540518007022954,"score_spread":0.16940853583898524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586722437","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.3925295,0.00007811093,0.6052317,0.000043626736,0.00053093734,0.0008261341,0.0005614423,0.00011868224,0.000079846264],"genre_scores_gemma":[0.99257326,0.000004628694,0.0070268963,0.000008573162,0.000036111738,0.00022375415,0.000013646709,0.000037583453,0.00007555317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989315,0.000008885404,0.00039627857,0.00014806037,0.00015154625,0.0003637055],"domain_scores_gemma":[0.9992342,0.00015569435,0.000043501197,0.00027968138,0.00008655429,0.00020035889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002693039,0.00017674975,0.00042206858,0.000119393124,0.00014689995,0.00001786441,0.000262643,0.00018612346,0.00005756703],"category_scores_gemma":[0.000010140096,0.00015997438,0.0012286163,0.00053308945,0.00003801036,0.00011888478,0.00000317293,0.00015916293,0.0000012701302],"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.000008036379,0.000015663752,0.000017389459,0.00096580654,0.0023899062,5.7954725e-8,0.00018474676,0.97577965,0.0050699688,0.014781118,0.00011248871,0.0006751898],"study_design_scores_gemma":[0.0002912671,0.000044570206,0.00038799524,0.0000722772,0.0008049795,0.0000032667308,0.00014347765,0.9926587,0.0050620884,0.000028650033,0.000325402,0.0001773649],"about_ca_topic_score_codex":0.0012028051,"about_ca_topic_score_gemma":0.0016700361,"teacher_disagreement_score":0.6000438,"about_ca_system_score_codex":0.00024565746,"about_ca_system_score_gemma":0.000052914715,"threshold_uncertainty_score":0.65235656},"labels":[],"label_agreement":null},{"id":"W2590639784","doi":"10.71781/17217","title":"Cryptographie quantique à plusieurs participants par multiplexage en longueur d'onde","year":2003,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"graph theory and CDMA systems","field":"Engineering","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":"Physics; Humanities; Philosophy","score_opus":0.03999077420065272,"score_gpt":0.3038944566063305,"score_spread":0.2639036824056778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590639784","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.9617178,0.001855763,0.00038366034,0.000036358007,0.004208663,0.0016912107,0.0001849087,0.000017965041,0.02990369],"genre_scores_gemma":[0.97541445,0.00025719323,0.0049600047,0.000018980747,0.00019575917,0.00027083844,0.00076366577,0.00021160935,0.0179075],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9954856,0.00078312313,0.0011934568,0.0009583315,0.00036896113,0.0012105114],"domain_scores_gemma":[0.9978447,0.00031971006,0.0003729037,0.0008826175,0.00011483271,0.00046521868],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013301392,0.00092617876,0.0011072491,0.0003732321,0.00035143454,0.000495089,0.0012096192,0.0010127013,0.00603837],"category_scores_gemma":[0.00021475773,0.0010282274,0.00041234068,0.000780007,0.00012526971,0.0004956165,0.00009080711,0.0008862688,0.00310916],"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.0019827567,0.0035516229,0.10379268,0.0063120592,0.008588199,0.002318922,0.2855184,0.06670985,0.32481384,0.042717878,0.0070674177,0.14662635],"study_design_scores_gemma":[0.008822743,0.0008724702,0.092994906,0.008431258,0.0029986333,0.00020854935,0.091150895,0.009295089,0.5423309,0.0031158905,0.23009817,0.009680481],"about_ca_topic_score_codex":0.00059912156,"about_ca_topic_score_gemma":0.0040746857,"teacher_disagreement_score":0.22303075,"about_ca_system_score_codex":0.00009228201,"about_ca_system_score_gemma":0.00015684692,"threshold_uncertainty_score":0.9992168},"labels":[],"label_agreement":null},{"id":"W2591699638","doi":"","title":"Vertex-disjoint cycles containing specified edges in a bipartite graph","year":2001,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Disjoint sets; Complete bipartite graph; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.01967958250240626,"score_gpt":0.224978922846505,"score_spread":0.20529934034409875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591699638","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.99202496,0.00090121187,0.00039292566,0.00024126194,0.0014779379,0.00009764457,9.990207e-7,0.000043446184,0.0048196227],"genre_scores_gemma":[0.9994827,0.00030391253,0.0000136067365,0.0000140157445,0.000096030926,0.0000028184102,3.9734354e-7,0.000025933357,0.0000605837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864084,0.00012203829,0.00058965606,0.00007925843,0.00023872481,0.00032947084],"domain_scores_gemma":[0.9993178,0.00011523439,0.00015800165,0.00022410095,0.000063119645,0.00012171962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007818512,0.00017858675,0.0003382675,0.0002506204,0.000067303125,0.00005852,0.00039621655,0.00007941693,0.000037369096],"category_scores_gemma":[0.00003383104,0.00013298028,0.00015524407,0.0005800316,0.0000691503,0.00021223247,0.000016860777,0.0005093257,0.000016080552],"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.0012111411,0.00080542796,0.20390284,0.00036230215,0.0010645135,0.00333076,0.021971624,0.029259482,0.015114319,0.69910806,0.008050591,0.015818937],"study_design_scores_gemma":[0.007991845,0.0014799931,0.2176648,0.0016200984,0.00023617512,0.0042838943,0.019018784,0.0015913479,0.026232306,0.70117235,0.017289765,0.0014186294],"about_ca_topic_score_codex":0.000003153588,"about_ca_topic_score_gemma":0.00000668702,"teacher_disagreement_score":0.027668135,"about_ca_system_score_codex":0.000068224224,"about_ca_system_score_gemma":0.000019932926,"threshold_uncertainty_score":0.5422778},"labels":[],"label_agreement":null},{"id":"W2592163388","doi":"","title":"A characterization of the degree sequence of the graph with cyclomatic number k.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Characterization (materials science); Sequence (biology); Graph; Degree (music); Discrete mathematics; Combinatorics; Computer science; Programming language","score_opus":0.01655548113204055,"score_gpt":0.20695108802463355,"score_spread":0.190395606892593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592163388","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.9956091,0.0000069483094,0.000014739546,0.00002670508,0.0010293474,0.00017158415,0.0000075754633,0.000021594007,0.0031124093],"genre_scores_gemma":[0.99990034,0.000003299909,0.000006317836,0.000004699986,0.000002908547,0.0000117749805,7.959737e-7,0.000012322805,0.00005755506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99951744,0.000044415556,0.00014752614,0.00006179741,0.00014006787,0.00008873435],"domain_scores_gemma":[0.9990547,0.000018517512,0.00016329368,0.0007082716,0.000039542967,0.000015678146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011863071,0.00007990691,0.0001248336,0.000011356769,0.00012833197,0.000016953607,0.00047553584,0.00003821427,0.000006990987],"category_scores_gemma":[0.000021020756,0.00004421882,0.00005638069,0.00010714265,0.00013392375,0.000107289496,0.000038809398,0.00007337019,0.0000029676912],"study_design_candidate":"observational","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.000011851086,0.00003941622,0.20902689,0.000299596,0.000103576094,0.0000010780963,0.0010417285,0.00007167437,0.25405666,0.53502285,0.000032790398,0.0002918756],"study_design_scores_gemma":[0.00058238755,0.000024330044,0.7170766,0.0005506177,0.000050990337,0.000015612855,0.000063655505,0.00044726214,0.1274312,0.15349515,0.00009741825,0.00016475117],"about_ca_topic_score_codex":0.000019476993,"about_ca_topic_score_gemma":0.000008110321,"teacher_disagreement_score":0.5080497,"about_ca_system_score_codex":0.000008980041,"about_ca_system_score_gemma":0.000010822668,"threshold_uncertainty_score":0.18031912},"labels":[],"label_agreement":null},{"id":"W2592351776","doi":"10.1090/stml/080/05","title":"Zero-sum matrix games","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"graph theory and CDMA systems","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Zero (linguistics); Zero-sum game; Matrix (chemical analysis); Mathematics; Computer science; Mathematical economics; Philosophy; Linguistics; Game theory; Chemistry","score_opus":0.007712758680659836,"score_gpt":0.2130863539588676,"score_spread":0.20537359527820775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592351776","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.00018801533,0.0019518955,0.0011155258,0.00008099296,0.00057423074,0.00043434039,0.00010285264,0.0011885479,0.9943636],"genre_scores_gemma":[0.016094707,0.00029913607,0.0003852855,0.000054885717,0.0004790427,0.000049200728,0.00002261044,0.0003069049,0.9823082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982824,0.000019891437,0.0006067297,0.00030921496,0.00042486624,0.00035691788],"domain_scores_gemma":[0.9988403,0.00025256164,0.00008018918,0.000625193,0.0000098331475,0.00019193869],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000108161454,0.00052702473,0.0006970025,0.00015062124,0.000037148748,0.000112443406,0.00056431117,0.00038667498,0.005756657],"category_scores_gemma":[0.000006883028,0.00038403098,0.00034054086,0.0000280773,0.00010563677,0.00027480657,0.00020100208,0.00033297745,0.007241817],"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.0000049865216,0.000019333507,0.0000071801924,0.0006702372,0.00024018715,0.00005087051,0.000117766904,0.0000024131568,0.00003732052,0.96885395,0.029326333,0.0006693934],"study_design_scores_gemma":[0.00017439062,0.000029080697,0.0000043263644,0.0010969373,0.00006720311,0.000022773484,0.00001526964,0.000021419342,0.00008768536,0.75712204,0.24086855,0.00049031834],"about_ca_topic_score_codex":1.7855436e-8,"about_ca_topic_score_gemma":2.523847e-8,"teacher_disagreement_score":0.21173194,"about_ca_system_score_codex":0.000021229172,"about_ca_system_score_gemma":0.000013807926,"threshold_uncertainty_score":0.9998612},"labels":[],"label_agreement":null},{"id":"W2594198481","doi":"","title":"Existence of equitable h-edge-colorings of type s = 2, 3 of K t .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science; Geology","score_opus":0.024925810736014468,"score_gpt":0.25022292411926217,"score_spread":0.2252971133832477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594198481","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.9538251,0.00029630834,0.0000033940892,0.0000029266903,0.0013502528,0.00007393604,0.0000040095083,0.000024753708,0.044419285],"genre_scores_gemma":[0.9997145,0.00002120197,0.000050554212,7.3880017e-7,0.0000027709648,0.0000034847776,6.539672e-7,0.000012834888,0.00019325974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939126,0.000014569691,0.00025252652,0.00007737248,0.00011697223,0.0001472794],"domain_scores_gemma":[0.99914455,0.000041596853,0.00015569183,0.00052715983,0.00009931473,0.00003170298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026272205,0.00008021656,0.00026227222,0.000043203705,0.000044651926,0.0000068679624,0.00037965132,0.00005982233,0.0000203282],"category_scores_gemma":[0.000073023504,0.000081779115,0.000055491244,0.0000820946,0.00010535167,0.000120715165,0.00006407951,0.000060382732,0.000007599256],"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.000020508996,0.000040200277,0.00903434,0.00042357255,0.0000524159,0.0000013795607,0.00026625508,0.000068163,0.05133642,0.9384511,0.00015422134,0.0001514216],"study_design_scores_gemma":[0.0011003825,0.0003275848,0.020753942,0.00042486316,0.00004813425,0.0000032267405,0.00022366043,0.0004955353,0.508497,0.46657646,0.001291539,0.00025767458],"about_ca_topic_score_codex":0.000044725923,"about_ca_topic_score_gemma":0.0000013354488,"teacher_disagreement_score":0.47187465,"about_ca_system_score_codex":0.000009628891,"about_ca_system_score_gemma":0.000012574988,"threshold_uncertainty_score":0.33348554},"labels":[],"label_agreement":null},{"id":"W2594363149","doi":"10.1016/j.disc.2012.12.022","title":"On unit weighing matrices with small weight","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Unit (ring theory); Combinatorics; Order (exchange); Decomposition; Multiple; Discrete mathematics; Arithmetic","score_opus":0.010316773478450647,"score_gpt":0.1849298849536345,"score_spread":0.17461311147518385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594363149","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.8819564,0.0001451708,0.026629532,0.000036043995,0.0002049325,0.00036976434,0.0000068910813,0.00048486717,0.09016641],"genre_scores_gemma":[0.9908215,0.000014484803,0.008285558,0.000026214248,0.0000611528,0.000066116714,0.00000632354,0.00006466324,0.0006540227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925745,0.000018928386,0.00021302472,0.00011579904,0.00015075179,0.00024405125],"domain_scores_gemma":[0.999399,0.00012507792,0.000047321162,0.00032215915,0.000026179408,0.00008027443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010595315,0.00019825913,0.00020463161,0.000085991516,0.00006643772,0.00009474887,0.00019544773,0.000060785118,0.0002447011],"category_scores_gemma":[0.000009312875,0.00013593076,0.000049601087,0.00017761171,0.000028458631,0.000117028,0.000015922406,0.00013654194,0.000670228],"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.000016653994,0.00013715704,0.00053762255,0.0026204048,0.0004364172,0.000036543064,0.007641035,0.005414958,0.0021697194,0.9740953,0.003423262,0.0034709156],"study_design_scores_gemma":[0.002840833,0.0007960289,0.0011706423,0.004243299,0.00041194478,0.00017658973,0.011342637,0.30079454,0.021626996,0.6290734,0.023616858,0.00390624],"about_ca_topic_score_codex":0.000006636231,"about_ca_topic_score_gemma":0.0000040815994,"teacher_disagreement_score":0.3450219,"about_ca_system_score_codex":0.00001244365,"about_ca_system_score_gemma":0.000003710488,"threshold_uncertainty_score":0.86146486},"labels":[],"label_agreement":null},{"id":"W2599474588","doi":"10.1090/crmp/048/01","title":"On combinatorial properties of linear program digraphs","year":2009,"lang":"en","type":"article","venue":"CRM proceedings & lecture notes","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":"McGill University","funders":"","keywords":"Combinatorics; Digraph; Polytope; Mathematics; Directed graph; Simplex; Bounded function; Discrete mathematics; Regular polygon; Property (philosophy)","score_opus":0.008437755765550543,"score_gpt":0.2042983752986322,"score_spread":0.19586061953308168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599474588","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.9842163,0.0006507031,0.00011409634,0.000084385356,0.0005446316,0.00046517406,0.000001966829,0.000756456,0.01316632],"genre_scores_gemma":[0.99957037,0.000011018226,0.0000356306,0.000046533896,0.00026718937,0.000037219947,0.0000020411144,0.000029024046,9.614513e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990623,0.00000574256,0.00024775727,0.00019217294,0.00021028826,0.0002817143],"domain_scores_gemma":[0.99962956,0.000023358629,0.000056403795,0.000102223465,0.00012085694,0.000067607805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012609156,0.00023735892,0.00028461425,0.0001354111,0.000082335304,0.000047097023,0.00018833039,0.00017253363,0.0000065544436],"category_scores_gemma":[0.00012610007,0.00018430143,0.00011410038,0.00036240293,0.00005399693,0.00010930678,0.00000799056,0.00025857828,0.000008093679],"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.00030052202,0.0004100098,0.00069787714,0.0007971908,0.0001301709,0.000002868532,0.0046266546,0.0012560245,0.3456485,0.6140726,0.0001283003,0.031929262],"study_design_scores_gemma":[0.00057478854,0.0010741979,0.0004042942,0.0004066657,0.000038066337,0.000009114223,0.000072550414,0.0015500147,0.69921213,0.2951273,0.001148271,0.00038260556],"about_ca_topic_score_codex":0.00000220447,"about_ca_topic_score_gemma":3.6689545e-7,"teacher_disagreement_score":0.35356364,"about_ca_system_score_codex":0.000016569396,"about_ca_system_score_gemma":0.000008537204,"threshold_uncertainty_score":0.75155944},"labels":[],"label_agreement":null},{"id":"W2599695802","doi":"10.24330/ieja.296156","title":"CENTRAL TORSION UNITS OF INTEGRAL REALITY-BASED ALGEBRAS WITH A POSITIVE DEGREE MAP","year":2017,"lang":"en","type":"article","venue":"International Electronic Journal of Algebra","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 Regina","funders":"","keywords":"Mathematics; Degree (music); Pure mathematics; Integer (computer science); Torsion (gastropod); Algebraic number; Unit (ring theory); Algebra over a field; Mathematical analysis; Computer science","score_opus":0.012039791938685991,"score_gpt":0.22666805147796565,"score_spread":0.21462825953927966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599695802","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.982655,0.00036608093,0.0131567,0.00042436057,0.0008044,0.00009393595,0.000024066303,0.000026437829,0.0024490382],"genre_scores_gemma":[0.999486,0.000030052322,0.00014422226,0.000025916399,0.00020526827,0.0000018395897,0.00001081899,0.000022897675,0.00007295846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868387,0.000053979667,0.000415119,0.00009752912,0.00040351672,0.0003459904],"domain_scores_gemma":[0.99878854,0.000056469053,0.00042705185,0.00020953511,0.00042835498,0.00009005753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038676348,0.00016117124,0.00025349247,0.00018213525,0.000078746256,0.000062372776,0.0006574609,0.00006993064,0.0000551962],"category_scores_gemma":[0.000062455016,0.00012724854,0.0001235882,0.000073303156,0.00009881674,0.00035393654,0.000021273156,0.0004350711,0.0000030350138],"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.00314863,0.0002975934,0.012751058,0.00018943529,0.0035986693,0.00024809074,0.0013803454,0.022859031,0.017165162,0.92232966,0.0021717607,0.013860589],"study_design_scores_gemma":[0.019190414,0.008445257,0.17206095,0.0067523164,0.0008600125,0.0029271035,0.0019949302,0.048047077,0.5394018,0.17623673,0.021596063,0.0024873165],"about_ca_topic_score_codex":0.00007917421,"about_ca_topic_score_gemma":0.00012312183,"teacher_disagreement_score":0.7460929,"about_ca_system_score_codex":0.0003243894,"about_ca_system_score_gemma":0.0003068702,"threshold_uncertainty_score":0.5189045},"labels":[],"label_agreement":null},{"id":"W2600807309","doi":"","title":"On Short Zero-Sum Subsequences.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subsequence; Mathematics; Combinatorics; Longest increasing subsequence; Zero (linguistics); Sequence (biology); Rank (graph theory); Exponent; Abelian group; Integer (computer science); Longest common subsequence problem; Discrete mathematics; Mathematical analysis","score_opus":0.008764179171844001,"score_gpt":0.20620182779831142,"score_spread":0.19743764862646743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600807309","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.9530278,0.00025261543,0.000028502816,0.00003559523,0.0024291691,0.000103861064,0.000002540052,0.0003853446,0.04373456],"genre_scores_gemma":[0.99954975,0.000011290067,0.00002252869,0.000058257545,0.00002043146,0.000021323165,0.0000039739057,0.000028515253,0.0002839142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992536,0.000027796703,0.00017080308,0.00014411232,0.00015498677,0.00024873702],"domain_scores_gemma":[0.9995559,0.000046827477,0.000011117558,0.000283194,0.00001745553,0.00008554188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017102416,0.0001450744,0.00014785577,0.00006365145,0.00005855371,0.000028165974,0.00019461935,0.00008281965,0.00007334867],"category_scores_gemma":[0.000010421418,0.00014316243,0.00006236189,0.00016084798,0.000029235569,0.0001180456,0.000011274125,0.00016016961,0.0004844294],"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.0000051078305,0.00003345939,0.0007798951,0.000016208154,0.000029297253,0.000009087418,0.00013557416,0.001976479,0.001721567,0.98621523,0.007436449,0.0016416217],"study_design_scores_gemma":[0.0007157984,0.00013770605,0.0019026082,0.00009426984,0.000023324601,0.00002238419,0.000061664185,0.003858784,0.034415588,0.9202769,0.037818,0.000673009],"about_ca_topic_score_codex":0.0000033028814,"about_ca_topic_score_gemma":0.0000031740556,"teacher_disagreement_score":0.06593839,"about_ca_system_score_codex":0.00005745371,"about_ca_system_score_gemma":0.0000061159017,"threshold_uncertainty_score":0.6226521},"labels":[],"label_agreement":null},{"id":"W2604989626","doi":"10.1016/j.dam.2017.02.016","title":"On well-covered pentagonalizations of the plane","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar graph; Mathematics; Pentagon; Combinatorics; Planar straight-line graph; Planar; Outerplanar graph; Bounded function; Cardinality (data modeling); Plane (geometry); Graph; Simple (philosophy); Polyhedral graph; Discrete mathematics; Graph power; 1-planar graph; Geometry; Line graph; Pathwidth; Computer science; Mathematical analysis","score_opus":0.009028486833592104,"score_gpt":0.21081293991815991,"score_spread":0.2017844530845678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604989626","genre_codex":"other","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.39542037,0.00002351875,0.008326211,0.000039398594,0.00041716426,0.0004977261,0.0000786196,0.00011356239,0.5950834],"genre_scores_gemma":[0.9993302,0.0000042202632,0.00028784215,0.000011372231,0.000022728795,0.000022281372,0.0000065010195,0.000022436197,0.00029236713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994825,0.0000047221793,0.00018801288,0.00006983481,0.00014739539,0.00010749793],"domain_scores_gemma":[0.9990747,0.00005548952,0.000107328044,0.00072898756,0.000008720604,0.000024759256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008920236,0.00010401631,0.00014857446,0.000019644407,0.0001757401,0.000036691952,0.0003980332,0.00004422581,0.00007745803],"category_scores_gemma":[0.000018482258,0.00007131663,0.000061625105,0.000033743534,0.00006847591,0.000028914947,0.00004066932,0.00007049575,0.000065742664],"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.0000040551786,0.000022272738,0.00003325186,0.000222052,0.00004357924,3.205156e-7,0.0005483035,0.0019836675,0.0075107864,0.9884542,0.0011337551,0.000043739838],"study_design_scores_gemma":[0.00151044,0.000045197183,0.0026910873,0.00062297203,0.00019455052,0.0000142231265,0.0017784683,0.020718109,0.17616598,0.7895175,0.0059545846,0.00078683416],"about_ca_topic_score_codex":0.0000014549778,"about_ca_topic_score_gemma":0.0000029662729,"teacher_disagreement_score":0.60390985,"about_ca_system_score_codex":0.000008344041,"about_ca_system_score_gemma":0.00000431731,"threshold_uncertainty_score":0.29082078},"labels":[],"label_agreement":null},{"id":"W2609192187","doi":"10.1090/crmp/034/03","title":"Congruence subgroups of PSL(2,ℤ)","year":2004,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University","funders":"","keywords":"PSL; Congruence (geometry); Psychology; Mathematics; Combinatorics; Social psychology","score_opus":0.0077135412819637275,"score_gpt":0.18543234426857164,"score_spread":0.17771880298660792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609192187","genre_codex":"other","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.009893086,0.0050401217,0.0011463265,0.000054175696,0.0008681662,0.00049018866,0.000049204682,0.0006570386,0.9818017],"genre_scores_gemma":[0.9986668,0.0001515416,0.000039165316,0.00004413075,0.00040037656,0.000017202823,0.00001744483,0.00015795273,0.00050535024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849415,0.000001798453,0.000475941,0.00037919782,0.00030323665,0.00034567912],"domain_scores_gemma":[0.9992091,0.000064752014,0.00019708225,0.00019418959,0.00022429087,0.00011060201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014913833,0.00057216827,0.0006858488,0.00023668696,0.00006547927,0.000053471565,0.0003769629,0.0007287657,0.00026859762],"category_scores_gemma":[0.0000603496,0.000544758,0.00025164106,0.00009147387,0.00015559173,0.000121259385,0.0000351727,0.00067330693,0.0000617208],"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.000017340075,0.0000064037085,0.00006730192,0.00140373,0.0001584262,0.0000071382797,0.00078393397,0.0004654486,0.0090948315,0.9863423,0.000056537585,0.0015965797],"study_design_scores_gemma":[0.00026165057,0.00009889635,0.000041366726,0.0014306357,0.0001404463,0.000053101165,0.00001894928,0.00005917028,0.03787737,0.94822043,0.011059838,0.00073816814],"about_ca_topic_score_codex":0.000009567516,"about_ca_topic_score_gemma":0.0000052022565,"teacher_disagreement_score":0.98877376,"about_ca_system_score_codex":0.00009354142,"about_ca_system_score_gemma":0.0000392213,"threshold_uncertainty_score":0.99970037},"labels":[],"label_agreement":null},{"id":"W2611371158","doi":"","title":"Classification of resolvablr 2-(14,7,12) and 3-(14,7,5) designs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Equidistant; Mathematics; Point (geometry); Class (philosophy); Automorphism group; Arithmetic; Automorphism; Binary number; Versa; Combinatorics; Computer science; Artificial intelligence; Database","score_opus":0.02145770361720544,"score_gpt":0.23173843100107105,"score_spread":0.2102807273838656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611371158","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.9769639,0.001027045,0.005667817,0.000013057856,0.010718275,0.00023195444,0.0000017465147,0.00004729947,0.005328931],"genre_scores_gemma":[0.99765545,0.00007324381,0.0019047377,0.0000030292865,0.00031781074,0.0000014979363,4.709443e-7,0.000037059104,0.000006717807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791586,0.00016236119,0.0011167742,0.00013931554,0.00041255413,0.0002531155],"domain_scores_gemma":[0.9981479,0.0005526467,0.00061222666,0.00020909481,0.00031417585,0.00016393363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001999698,0.00024707575,0.0006902659,0.00020173052,0.00013946666,0.0000939689,0.00019931726,0.00018377985,0.000006197326],"category_scores_gemma":[0.00038771756,0.00022909745,0.00012233242,0.00022762212,0.000098163924,0.000168863,0.000037249854,0.00035780878,8.6750543e-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.000038032358,0.00016754211,0.00038327862,0.00046090691,0.00012358035,0.0000067432666,0.0011867735,0.000109533765,0.0071735047,0.9896136,0.00019880278,0.00053771806],"study_design_scores_gemma":[0.0050711515,0.00084149983,0.0005758623,0.00075150875,0.00018964363,0.00026420533,0.0011191778,0.007756944,0.008071926,0.9728257,0.0020330085,0.00049937656],"about_ca_topic_score_codex":0.0000012154595,"about_ca_topic_score_gemma":1.9297043e-7,"teacher_disagreement_score":0.020691559,"about_ca_system_score_codex":0.000040260406,"about_ca_system_score_gemma":0.00004601637,"threshold_uncertainty_score":0.9342323},"labels":[],"label_agreement":null},{"id":"W2613674630","doi":"","title":"Toughness and [a, b]-factors with prescribed properties.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toughness; Mathematics; Composite material; Materials science","score_opus":0.013168848004242013,"score_gpt":0.1890914299761257,"score_spread":0.1759225819718837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613674630","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.99209875,0.00032456237,0.000004960535,0.000016114214,0.0011202265,0.00015062561,0.0000018202219,0.0001630046,0.006119932],"genre_scores_gemma":[0.99967533,0.000010473632,0.000007803482,0.0000038727326,0.0000067385154,0.000019496412,0.0000010494167,0.000026981334,0.0002482566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994912,0.000016411786,0.000092215174,0.0001287354,0.000095568146,0.0001758591],"domain_scores_gemma":[0.99942684,0.000012224064,0.000030974978,0.0004334355,0.00002369471,0.00007281263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008064909,0.00013427979,0.00015262357,0.000024971314,0.00024152694,0.00014547555,0.00020854102,0.000054985765,0.000007647615],"category_scores_gemma":[0.000016017035,0.000098200086,0.000019225103,0.000027460748,0.000092217895,0.0002589954,0.00003491112,0.00009490453,0.000008103467],"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.00013721688,0.0001198456,0.25380674,0.00070584595,0.00042847396,0.000063650186,0.0063418406,0.0002930052,0.012366654,0.72144824,0.0020670055,0.0022214507],"study_design_scores_gemma":[0.008597844,0.00077439373,0.5543597,0.0012204004,0.00023054342,0.00008013612,0.0019491311,0.006935724,0.15985717,0.23735178,0.025576005,0.0030672078],"about_ca_topic_score_codex":0.000038272363,"about_ca_topic_score_gemma":0.000009153152,"teacher_disagreement_score":0.4840965,"about_ca_system_score_codex":0.000012248454,"about_ca_system_score_gemma":0.0000062979207,"threshold_uncertainty_score":0.40044832},"labels":[],"label_agreement":null},{"id":"W2613824215","doi":"","title":"Proof of a conjecture on intersection graph of finite abelian groups.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Abelian group; Conjecture; Intersection (aeronautics); Combinatorics; Graph; Discrete mathematics; Pure mathematics","score_opus":0.008138186142182813,"score_gpt":0.20859995858999603,"score_spread":0.2004617724478132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613824215","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.9909662,0.00007409317,0.000055228615,0.000013446376,0.0028187695,0.00015136976,0.000008718473,0.000050865194,0.005861293],"genre_scores_gemma":[0.9999151,0.0000051411685,0.0000063302687,0.000003897262,0.0000075730627,0.000011575057,0.0000025100726,0.000017329374,0.000030546347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994416,0.000028194503,0.0002042471,0.00010188625,0.00010785957,0.000116201605],"domain_scores_gemma":[0.9993042,0.00004287537,0.00012488727,0.00045678703,0.000037174817,0.000034090197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015666182,0.00011157261,0.00021041356,0.0001048648,0.00006558319,0.000014869825,0.00022784172,0.00009020318,0.000013097119],"category_scores_gemma":[0.00004173699,0.00010456558,0.00009065139,0.000078939156,0.000073674855,0.00008688413,0.000019512872,0.00012578203,0.0000046130135],"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.0000836041,0.00013720959,0.005804332,0.0004963717,0.00020194631,0.000006604283,0.0014712216,0.0013716487,0.0132499235,0.9746488,0.00062048633,0.0019078584],"study_design_scores_gemma":[0.001985213,0.00077723985,0.013407923,0.00062969147,0.00004833418,0.000006422011,0.00029062454,0.001334352,0.28676948,0.6938546,0.00054641935,0.0003497216],"about_ca_topic_score_codex":0.000024592395,"about_ca_topic_score_gemma":0.000009293971,"teacher_disagreement_score":0.28079423,"about_ca_system_score_codex":0.000013497664,"about_ca_system_score_gemma":0.000004995318,"threshold_uncertainty_score":0.42640606},"labels":[],"label_agreement":null},{"id":"W2623089137","doi":"10.1002/jgt.22162","title":"Configurations containing a given linear hypergraph","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Combinatorics; Vertex (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.013624443440958138,"score_gpt":0.2366006672075691,"score_spread":0.22297622376661094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623089137","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.9373715,0.0021734876,0.013272989,0.00018779426,0.0026766316,0.0001458378,0.000015693613,0.000106692554,0.04404938],"genre_scores_gemma":[0.9992072,0.00011473998,0.00020450614,0.000034717912,0.00029775416,0.0000031841446,7.3896774e-7,0.000025912777,0.00011127514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902254,0.00011301543,0.00042943913,0.000073765055,0.0001688226,0.00019244255],"domain_scores_gemma":[0.99891096,0.00014347352,0.0003162574,0.00037245278,0.00013578696,0.00012107642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011489379,0.00014339582,0.00029932134,0.00024577905,0.00036294828,0.00010209555,0.00047939687,0.00008444599,0.00008030021],"category_scores_gemma":[0.0001436096,0.00012053873,0.0002881624,0.00007304937,0.00016098798,0.0003882491,0.000016369926,0.00031232726,0.000017075898],"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.0005901621,0.00012187927,0.006790347,0.00016069002,0.0016438826,0.00036101782,0.0038609742,0.004669034,0.0669826,0.8967898,0.0033053926,0.014724261],"study_design_scores_gemma":[0.0052042413,0.0011254168,0.03315395,0.0011449866,0.000528912,0.0016451465,0.0064868536,0.00186747,0.019279934,0.87180114,0.056437925,0.0013240476],"about_ca_topic_score_codex":0.00000198337,"about_ca_topic_score_gemma":0.000002961583,"teacher_disagreement_score":0.061835676,"about_ca_system_score_codex":0.000013672962,"about_ca_system_score_gemma":0.00002046656,"threshold_uncertainty_score":0.49154267},"labels":[],"label_agreement":null},{"id":"W26510543","doi":"10.1111/apt.13420","title":"Every abelian group of odd order has a narcissistic terrace","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Diabetes and Digestive and Kidney Diseases; National Institute of Nursing Research","keywords":"Mathematics; Abelian group; Terrace (agriculture); Order (exchange); Group (periodic table); Pure mathematics; Combinatorics; Geography; Archaeology; Chemistry","score_opus":0.009076126765505716,"score_gpt":0.19793842368096626,"score_spread":0.18886229691546055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26510543","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.991808,0.0009439692,0.00015287563,0.000066012,0.0018312465,0.00014212601,0.0000056491695,0.00022435938,0.0048257387],"genre_scores_gemma":[0.9994573,0.000013492593,0.0001846947,0.000023775614,0.000020176516,0.000018275612,0.000005135532,0.000034729903,0.00024241798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999143,0.000041657186,0.0002770247,0.00014358763,0.00015652641,0.00023817086],"domain_scores_gemma":[0.999447,0.00006065832,0.00004282473,0.0003279479,0.00004132462,0.000080252066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019622194,0.00015543509,0.00022900851,0.00009447514,0.00006404473,0.000024670435,0.0002026242,0.00009245498,0.00009200722],"category_scores_gemma":[0.000027540487,0.00015781217,0.0000690307,0.00031015853,0.000058883725,0.0001365956,0.00002365682,0.00013537175,0.00009072784],"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.00007406748,0.0004974441,0.0064017484,0.0006722328,0.00038142435,0.000031264935,0.0033670256,0.0044508753,0.034921534,0.9165808,0.023302156,0.009319401],"study_design_scores_gemma":[0.008365941,0.0007894656,0.03457992,0.0011549446,0.0003158782,0.00013416054,0.0012433912,0.035340138,0.04575163,0.6215908,0.24766725,0.0030665118],"about_ca_topic_score_codex":0.000013883274,"about_ca_topic_score_gemma":0.000008692163,"teacher_disagreement_score":0.29499006,"about_ca_system_score_codex":0.000037554888,"about_ca_system_score_gemma":0.000012170117,"threshold_uncertainty_score":0.64353937},"labels":[],"label_agreement":null},{"id":"W2676800707","doi":"10.1016/s0304-3975(02)00650-3","title":"The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Simple (philosophy); Factorization; Mathematics; Expressive power; Range (aeronautics); Discrete mathematics; Combinatorics; Computer science; Graph; Theoretical computer science; Algorithm","score_opus":0.010286011854412915,"score_gpt":0.20471116056560285,"score_spread":0.19442514871118993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2676800707","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.26606277,0.00024488824,0.7188948,0.00005908157,0.0016105104,0.00017561787,0.0000064664446,0.00017707894,0.012768823],"genre_scores_gemma":[0.99853754,0.000018972807,0.0013837558,0.000015629252,0.00002618501,0.000004679847,6.1280804e-7,0.000008330667,0.00000432121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882144,0.00010856942,0.0002582395,0.00017577804,0.00029197408,0.00034402753],"domain_scores_gemma":[0.9991573,0.00021920732,0.000031171785,0.00041029463,0.00008123787,0.0001007686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008926845,0.000112071975,0.00014350555,0.00007295727,0.00048415648,0.0000744137,0.00053587166,0.000032884895,0.000027538956],"category_scores_gemma":[0.000046515044,0.00007772592,0.00006354804,0.00086276326,0.0023355149,0.00011529102,0.00004766572,0.0001141161,0.000020492962],"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":[8.464305e-7,0.000009925005,0.00023436907,0.000008453644,0.000006141838,4.3485468e-7,0.000121163175,0.001014902,0.00386017,0.9939076,0.00002532161,0.000810682],"study_design_scores_gemma":[0.00031051255,0.00011368193,0.0061710197,0.00007484538,0.000019727886,0.00004843583,0.000056432225,0.21157882,0.020020055,0.75771636,0.0034770404,0.00041308432],"about_ca_topic_score_codex":7.0737326e-7,"about_ca_topic_score_gemma":4.6845872e-7,"teacher_disagreement_score":0.73247474,"about_ca_system_score_codex":0.000014908651,"about_ca_system_score_gemma":0.000019855323,"threshold_uncertainty_score":0.8605302},"labels":[],"label_agreement":null},{"id":"W26881231","doi":"10.1155/2016/9053578","title":"Cycles of length four through a given arc in almost regular multipartite tournaments.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Multipartite; Mathematics; Arc (geometry); Combinatorics; Geometry; Physics","score_opus":0.014096283718020746,"score_gpt":0.21736989073968446,"score_spread":0.20327360702166372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26881231","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.9897411,0.00059313554,0.000034941902,0.000015995776,0.0012065202,0.0001887897,0.000004344592,0.00007368761,0.008141511],"genre_scores_gemma":[0.99961495,0.000052574458,0.00018714809,0.000010189134,0.0000047444105,0.000024010124,0.000002092585,0.000030517895,0.00007379084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989615,0.00012050853,0.00033775208,0.00015097947,0.00015867896,0.0002705819],"domain_scores_gemma":[0.99949646,0.00006309548,0.00005706105,0.00030420616,0.000027902153,0.000051302046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030272585,0.00015656633,0.00027116176,0.00007542443,0.000033960303,0.000013397839,0.0001604786,0.00008813239,0.000034166398],"category_scores_gemma":[0.0000504017,0.00016370234,0.000076413315,0.00026595723,0.000040712224,0.00016548333,0.000016055721,0.00015286132,0.000023591638],"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.000027683538,0.00022162104,0.032610975,0.00021808996,0.00015837589,0.00006486904,0.00328216,0.0034746919,0.0136582395,0.94446623,0.0012989318,0.0005181191],"study_design_scores_gemma":[0.0036603478,0.00013898243,0.011174007,0.0004157065,0.000035642766,0.000033643304,0.0012500488,0.0015641213,0.07509224,0.8901953,0.015824411,0.0006155216],"about_ca_topic_score_codex":0.000028327282,"about_ca_topic_score_gemma":0.0000099972485,"teacher_disagreement_score":0.061434004,"about_ca_system_score_codex":0.000048062397,"about_ca_system_score_gemma":0.00001048891,"threshold_uncertainty_score":0.6675587},"labels":[],"label_agreement":null},{"id":"W2736933689","doi":"10.1145/3087604.3087664","title":"Algorithmic Approaches for Lattice Path Combinatorics","year":2017,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Lattice (music); Computer science; Path (computing); Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Physics; Programming language","score_opus":0.04131239697934742,"score_gpt":0.22180156573600432,"score_spread":0.1804891687566569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736933689","genre_codex":"other","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.30453587,0.00074148795,0.23311101,0.00017966403,0.005024357,0.001307244,0.000046128338,0.0013074586,0.45374677],"genre_scores_gemma":[0.9975332,0.0000052820374,0.00083338085,0.000006598262,0.000079430225,0.00005453734,0.000002860081,0.000018857096,0.0014658296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996347,0.0000065365953,0.000084720734,0.00008339927,0.000047905287,0.00014275621],"domain_scores_gemma":[0.9995612,0.000031008814,0.000020482103,0.0003352945,0.000012775706,0.000039259423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016482982,0.000079022335,0.00009916059,0.000017729497,0.00018211194,0.00007547171,0.0002099678,0.00005256432,0.000008797177],"category_scores_gemma":[0.000016513506,0.00007000838,0.000048686306,0.000015885418,0.00002112304,0.00010999922,0.000015875876,0.00004781571,0.000025560234],"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.00000453613,0.000027444734,0.0006306791,0.00021618787,0.00006119297,0.0000020488262,0.00021538,0.00026080213,0.00015721488,0.98675656,0.0025813696,0.0090866005],"study_design_scores_gemma":[0.0023743173,0.00013575397,0.0057288813,0.000071939074,0.00008051867,0.000020475762,0.00091047515,0.56832314,0.008137612,0.31616244,0.09706152,0.0009929404],"about_ca_topic_score_codex":0.0000044568565,"about_ca_topic_score_gemma":0.0000016322716,"teacher_disagreement_score":0.69299734,"about_ca_system_score_codex":0.00000970027,"about_ca_system_score_gemma":0.000002631144,"threshold_uncertainty_score":0.2854859},"labels":[],"label_agreement":null},{"id":"W2737456378","doi":"10.1016/j.disc.2017.11.003","title":"Orthogonally Resolvable Matching Designs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Matching (statistics); Partition (number theory); Vertex (graph theory); Mathematics; Graph; Bipartite graph; Square (algebra); Discrete mathematics; Geometry; Statistics","score_opus":0.036232110511950265,"score_gpt":0.2616340832965543,"score_spread":0.22540197278460403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737456378","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.26786768,0.0027385007,0.36598024,0.00008483144,0.004129899,0.0016735059,0.00038638315,0.002297679,0.3548413],"genre_scores_gemma":[0.9775459,0.00012940161,0.019293493,0.000014310482,0.00030998827,0.0001472245,0.00009760319,0.00021388756,0.0022481487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983299,0.000048580747,0.0005590682,0.00031360553,0.00032749775,0.00042138898],"domain_scores_gemma":[0.9979147,0.00010106375,0.00024393725,0.0015667785,0.000047138416,0.0001263876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006558384,0.00048048058,0.0006645949,0.00011521898,0.00021825821,0.00041135313,0.0009496587,0.00039325285,0.00008810261],"category_scores_gemma":[0.000053395237,0.00044893968,0.00029556267,0.000041705025,0.000067507186,0.00010876453,0.00037439528,0.00072716136,0.0001958471],"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.000043253065,0.00025624537,0.00033890438,0.0455593,0.0028797786,0.00042698113,0.035753682,0.24920705,0.00846814,0.63824934,0.015683979,0.0031333754],"study_design_scores_gemma":[0.00029076735,0.000024201461,0.00008970836,0.003627631,0.0002501259,0.000049367547,0.00087929465,0.07136214,0.0013915126,0.91661155,0.0039561563,0.001467552],"about_ca_topic_score_codex":0.000011116752,"about_ca_topic_score_gemma":0.000013947246,"teacher_disagreement_score":0.7096783,"about_ca_system_score_codex":0.000050832765,"about_ca_system_score_gemma":0.00004015415,"threshold_uncertainty_score":0.9997962},"labels":[],"label_agreement":null},{"id":"W2739856746","doi":"","title":"Quasi-embeddings and intersections of latin squares of different orders.","year":2009,"lang":"en","type":"article","venue":"","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 Toronto; University of Victoria","funders":"","keywords":"Mathematics; Latin square; Idempotence; Embedding; Combinatorics; Intersection (aeronautics); Generalization; Discrete mathematics; Computer science; Geography; Artificial intelligence; Mathematical analysis; Cartography","score_opus":0.006817929650562833,"score_gpt":0.19971841799431275,"score_spread":0.19290048834374993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739856746","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.9909978,0.00007104239,0.0024064952,0.000016897586,0.000067143286,0.000044192304,0.0000019205215,0.00005413439,0.006340361],"genre_scores_gemma":[0.9998454,0.000007875078,0.00004222038,0.0000045273,0.000008831402,0.0000012576345,7.8042007e-7,0.0000037672778,0.00008536007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971753,0.000009050697,0.00013459938,0.000044148357,0.000037782043,0.000056893983],"domain_scores_gemma":[0.99986035,0.000022963135,0.000017234614,0.00006859646,0.000011783186,0.000019090805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000033200587,0.000053612952,0.00011528981,0.00007903389,0.00000996555,0.0000032200255,0.0000311388,0.00002587996,0.000043089243],"category_scores_gemma":[0.0000033183399,0.000043383385,0.000029715296,0.000081015656,0.000018341932,0.000028763408,0.000004082648,0.00003347699,9.3774526e-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.00007679966,0.0006203325,0.01967067,0.00093960855,0.00028899286,0.0000022484212,0.014458494,0.0028346977,0.392683,0.5462077,0.0024054435,0.019811967],"study_design_scores_gemma":[0.0033962654,0.0041359705,0.1924234,0.0010890682,0.00018975511,0.00004142061,0.02615218,0.14450704,0.5548956,0.06877799,0.002966354,0.0014249961],"about_ca_topic_score_codex":0.00001741367,"about_ca_topic_score_gemma":0.000017173967,"teacher_disagreement_score":0.47742975,"about_ca_system_score_codex":0.0000033015554,"about_ca_system_score_gemma":7.159899e-7,"threshold_uncertainty_score":0.17691231},"labels":[],"label_agreement":null},{"id":"W2740487357","doi":"","title":"Algebraic design theory with Hadamard matrices: applications, current trends and future directions (14w2199)","year":2014,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","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":"Session (web analytics); Political science; Library science; Media studies; Sociology; Computer science","score_opus":0.005393317817352175,"score_gpt":0.19214407412505663,"score_spread":0.18675075630770446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740487357","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.0072649703,0.017171724,0.9233031,0.00016003668,0.0006030396,0.00047401973,0.000010988318,0.0014987784,0.049513325],"genre_scores_gemma":[0.9945537,0.0011477032,0.002226652,0.000034988225,0.0006249959,0.0004389436,0.000014607622,0.000052024185,0.00090641325],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993704,0.00009505983,0.00012950068,0.00016533992,0.00008340997,0.00015629194],"domain_scores_gemma":[0.99954677,0.000102102036,0.000022387581,0.00023012367,0.000017321085,0.0000812966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002857953,0.0001474965,0.00013531907,0.00014798513,0.00012000176,0.000045461253,0.000088954686,0.000051806106,0.000103336875],"category_scores_gemma":[0.0000016958508,0.000107643435,0.00003083586,0.00036348306,0.00003500947,0.000092506714,0.000008433307,0.00010928367,0.000027725551],"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.000017789687,0.000028960148,0.00025271394,0.000089871515,0.00006715232,2.7788778e-7,0.00026710285,0.00038402822,0.00009933046,0.2950043,0.0022739847,0.7015145],"study_design_scores_gemma":[0.00033677902,0.00006016532,0.0016591247,0.000029657524,0.00006946778,0.000029783017,0.00027370115,0.0027797453,0.00026393996,0.01162746,0.9825361,0.00033410496],"about_ca_topic_score_codex":0.0000024264878,"about_ca_topic_score_gemma":0.000007068495,"teacher_disagreement_score":0.9872887,"about_ca_system_score_codex":0.000012479272,"about_ca_system_score_gemma":0.000004004233,"threshold_uncertainty_score":0.4389572},"labels":[],"label_agreement":null},{"id":"W2740724818","doi":"10.3150/16-bej891","title":"Designs from good Hadamard matrices","year":2017,"lang":"en","type":"article","venue":"Bernoulli","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Hadamard matrix; Mathematics; Complex Hadamard matrix; Hadamard's maximal determinant problem; Fractional factorial design; Hadamard's inequality; Factorial experiment; Hadamard three-lines theorem; Algebra over a field; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.02308070541843568,"score_gpt":0.2258248828653039,"score_spread":0.2027441774468682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740724818","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.9041975,0.0014681986,0.0027109846,0.00006443917,0.0014124928,0.00013013667,0.000053484368,0.00038700958,0.08957576],"genre_scores_gemma":[0.99842995,0.000054468135,0.00034880338,0.000012055621,0.00024862023,0.000013485656,0.0000063110524,0.000025614272,0.00086070533],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994625,0.000018234923,0.00012094845,0.00012206791,0.00009958183,0.0001766666],"domain_scores_gemma":[0.9993132,0.00003827905,0.000040759554,0.0005332896,0.000010568456,0.00006392862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101052916,0.000112944756,0.00013731289,0.000027485998,0.00020040893,0.00015040957,0.00036620017,0.00007692259,0.00017064495],"category_scores_gemma":[0.000013814586,0.00010716467,0.000062203275,0.000023587745,0.00003066193,0.00015997497,0.000028508517,0.00008622931,0.0005443931],"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.00017725505,0.00035448535,0.39653352,0.0008524644,0.0023138674,0.00060683466,0.006827862,0.007127218,0.15863062,0.16131663,0.11892855,0.14633068],"study_design_scores_gemma":[0.002236895,0.00012529998,0.27975407,0.00043109176,0.0002337274,0.000031649266,0.00063257286,0.008247447,0.057187594,0.05372799,0.5954257,0.001965921],"about_ca_topic_score_codex":0.0001906224,"about_ca_topic_score_gemma":0.000046484543,"teacher_disagreement_score":0.47649717,"about_ca_system_score_codex":0.000012941057,"about_ca_system_score_gemma":0.0000044924295,"threshold_uncertainty_score":0.6997254},"labels":[],"label_agreement":null},{"id":"W2741101148","doi":"","title":"Optical code-division multiple access networks, quantifying and achieving the ultimate performance","year":2000,"lang":"en","type":"dissertation","venue":"TSpace","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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":"Code division multiple access; Electronic engineering; Computer science; Implementation; Bandwidth (computing); Spectral efficiency; Flexibility (engineering); Code (set theory); Baseband; Computer engineering; Computer architecture; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.026449312677491107,"score_gpt":0.3067265939905695,"score_spread":0.2802772813130784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741101148","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.987516,0.0031936965,0.0005350511,0.000013447434,0.0008284712,0.000296208,0.0000031273614,0.0002633608,0.0073506352],"genre_scores_gemma":[0.99711335,0.0014689637,0.00005888038,0.0000095564,0.00012406542,0.000036722595,0.00011391473,0.00007426943,0.0010003054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989739,0.00004861926,0.00024329688,0.00024146037,0.0001670271,0.0003257076],"domain_scores_gemma":[0.9993744,0.00017960035,0.000061865634,0.00029477934,0.000021821703,0.00006755902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028944085,0.0002962473,0.00028941923,0.00007177484,0.00028741,0.00022811533,0.00031373024,0.00023471536,0.000048993297],"category_scores_gemma":[0.000018473018,0.00022678828,0.00006750571,0.00016758505,0.00003184681,0.00018685232,0.00002614117,0.0005004796,0.000025343417],"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.0006827173,0.00006656025,0.013734813,0.0050060656,0.00043540538,0.00002903874,0.021024061,0.7688339,0.0052694217,0.001297314,0.0014767512,0.18214394],"study_design_scores_gemma":[0.0004319484,0.000037214108,0.08756695,0.0015461667,0.00010065434,0.00001773631,0.002592818,0.90136814,0.0015490222,0.000023067916,0.0040198304,0.0007464236],"about_ca_topic_score_codex":0.000019825999,"about_ca_topic_score_gemma":0.00010261024,"teacher_disagreement_score":0.18139753,"about_ca_system_score_codex":0.000020989697,"about_ca_system_score_gemma":0.000008398915,"threshold_uncertainty_score":0.9248158},"labels":[],"label_agreement":null},{"id":"W2741239897","doi":"","title":"Palettes in block colourings of designs.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","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":"McMaster University","funders":"","keywords":"Block (permutation group theory); Palette (painting); Combinatorics; Set (abstract data type); Steiner system; Computer science; Mathematics; Programming language; Operating system","score_opus":0.010623943380705287,"score_gpt":0.1830472357789416,"score_spread":0.1724232923982363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741239897","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.9947377,0.000085444044,0.000019786205,0.000042433447,0.00014557643,0.00019980884,0.0000017808002,0.00009335053,0.004674149],"genre_scores_gemma":[0.99950844,0.000006812246,0.000093735114,0.000023647686,0.000021105996,0.00002873563,0.0000013233484,0.000016229858,0.00029998508],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99934274,0.000029843895,0.00023888452,0.00009108741,0.000080854,0.00021660046],"domain_scores_gemma":[0.9996765,0.000061274426,0.000026870493,0.00016808044,0.000018809122,0.000048415706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010867713,0.0001094603,0.00018206837,0.00008886486,0.000011797434,0.00001437415,0.00014405808,0.00007718766,0.00015586468],"category_scores_gemma":[0.000007779501,0.000108325876,0.00004502489,0.0001665098,0.000038218983,0.000096396885,0.000012233661,0.00012424495,0.00015285789],"study_design_candidate":"observational","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.000033901673,0.00038993687,0.3223766,0.0014466183,0.0003373691,0.00010763454,0.0033012726,0.03487237,0.53268915,0.023457503,0.0770735,0.003914106],"study_design_scores_gemma":[0.00235804,0.000320495,0.615798,0.00058317516,0.000047917998,0.00005788871,0.0010107822,0.0057737133,0.34948078,0.016168468,0.0071727387,0.0012280343],"about_ca_topic_score_codex":0.00006225003,"about_ca_topic_score_gemma":0.00000977952,"teacher_disagreement_score":0.29342136,"about_ca_system_score_codex":0.000013870539,"about_ca_system_score_gemma":0.0000039186743,"threshold_uncertainty_score":0.44174013},"labels":[],"label_agreement":null},{"id":"W2741567607","doi":"","title":"A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","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 Manitoba","funders":"","keywords":"Hypergraph; Combinatorics; Element (criminal law); Friendship; Mathematics; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Law; Social psychology","score_opus":0.013924922391757334,"score_gpt":0.21376289317708466,"score_spread":0.19983797078532733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741567607","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.9632745,0.000055264423,0.00000340589,0.00016731203,0.00036253087,0.00022425373,0.00000761474,0.00007276179,0.03583236],"genre_scores_gemma":[0.9993509,0.000009244558,0.000012302668,0.000055004122,0.000037757047,0.00008137464,0.0000023902874,0.00002532224,0.00042567466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99911726,0.000058944355,0.00025914807,0.00013994171,0.00014199379,0.0002827229],"domain_scores_gemma":[0.99936324,0.0001571308,0.00003248892,0.00036448194,0.000025828356,0.000056833625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017445776,0.0001654813,0.00020785273,0.0000713922,0.000034947883,0.00003777271,0.00025343942,0.00009937615,0.0011787607],"category_scores_gemma":[0.000019674495,0.0001192937,0.00009505569,0.00029344374,0.000082070525,0.000109565604,0.000017813696,0.00023882174,0.00050660357],"study_design_candidate":"observational","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.000098714634,0.0007183132,0.30576652,0.00051079644,0.00045538365,0.000055060587,0.0034093773,0.0030282144,0.030602181,0.61151576,0.040331908,0.0035077594],"study_design_scores_gemma":[0.0031523255,0.00043795205,0.779898,0.0011773739,0.00009192668,0.000120300385,0.0039107967,0.0033707786,0.035769247,0.14176363,0.028334634,0.001973023],"about_ca_topic_score_codex":0.00012414232,"about_ca_topic_score_gemma":0.000024146488,"teacher_disagreement_score":0.4741315,"about_ca_system_score_codex":0.000016802505,"about_ca_system_score_gemma":0.0000064642973,"threshold_uncertainty_score":0.9997343},"labels":[],"label_agreement":null},{"id":"W2743229192","doi":"10.4153/cmb-2017-050-9","title":"Enumerating Unlabelled Embeddings of Digraphs","year":2017,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Embedding; Eulerian path; Combinatorics; Directed graph; Boundary (topology); Class (philosophy); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.006905180225008065,"score_gpt":0.19236055588725276,"score_spread":0.18545537566224468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743229192","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.6203046,0.00021278836,0.0008051861,0.00050250534,0.00026905836,0.00024773588,0.000026312695,0.00011193476,0.3775199],"genre_scores_gemma":[0.99838257,0.00000442952,0.00043664177,0.00003587096,0.00004005968,0.000015421725,0.0000016602594,0.000027002354,0.0010563327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991996,0.000018821669,0.00026864445,0.00011071333,0.000100540405,0.00030163172],"domain_scores_gemma":[0.9990636,0.00007644811,0.000057758243,0.00047867023,0.000029600398,0.00029393265],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027519307,0.0001302617,0.00025406387,0.0000882256,0.00022625967,0.000079625046,0.0003391526,0.00008823071,0.003526112],"category_scores_gemma":[0.0002390267,0.00012587728,0.000084767176,0.000040117124,0.00010992094,0.00003364389,0.000016561673,0.000119587814,0.0014838042],"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.000008107109,0.000038703416,0.0007590756,0.0014186595,0.00022261876,0.00009414752,0.0023214563,0.0002645727,0.00544835,0.95495576,0.029726585,0.004741951],"study_design_scores_gemma":[0.002976485,0.00021278775,0.0027146973,0.0033186171,0.00025899571,0.00020350236,0.0024070058,0.03144841,0.034755748,0.35426664,0.5643786,0.0030584815],"about_ca_topic_score_codex":0.00038749372,"about_ca_topic_score_gemma":0.00039074183,"teacher_disagreement_score":0.6006891,"about_ca_system_score_codex":0.000026646077,"about_ca_system_score_gemma":0.000021840791,"threshold_uncertainty_score":0.9992937},"labels":[],"label_agreement":null},{"id":"W2744404471","doi":"","title":"Frequency squares of orders 7 and 8","year":2007,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Least-squares function approximation; Arithmetic; Statistics; Algorithm","score_opus":0.006160675756720137,"score_gpt":0.2037454237497888,"score_spread":0.19758474799306866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744404471","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.9372612,0.00084272795,0.006945438,0.000006381873,0.00008024838,0.00011401132,0.0000048051793,0.00011803683,0.0546271],"genre_scores_gemma":[0.9979909,0.0000060524194,0.0019472224,0.000003988222,0.000010086586,0.0000033330477,6.700791e-7,0.00001224089,0.000025502168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994806,0.000009659773,0.0002253177,0.000065583874,0.0000797108,0.00013912772],"domain_scores_gemma":[0.9996128,0.00013932765,0.000020043712,0.00016784837,0.00001534014,0.000044659555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689741,0.00007928729,0.00014479905,0.00006201152,0.000018881858,0.0000049364617,0.00006460407,0.00004213572,0.00011024561],"category_scores_gemma":[0.00004079268,0.00006922004,0.000031738025,0.00009442003,0.000063386055,0.00004248475,0.000008444504,0.000045141565,0.000017913573],"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.000007953471,0.00006842783,0.0017906429,0.0026436176,0.00012164438,0.000009722384,0.005880249,0.000023268945,0.021203069,0.9629705,0.0006432705,0.0046376223],"study_design_scores_gemma":[0.00069405604,0.00013724047,0.00961818,0.00054809113,0.00008448988,0.00007170708,0.0072368025,0.0035809688,0.037996348,0.93765867,0.0017859428,0.0005874887],"about_ca_topic_score_codex":0.0000045095235,"about_ca_topic_score_gemma":0.000004533136,"teacher_disagreement_score":0.060729653,"about_ca_system_score_codex":0.000005402675,"about_ca_system_score_gemma":0.000002259422,"threshold_uncertainty_score":0.28227115},"labels":[],"label_agreement":null},{"id":"W2749014923","doi":"10.15217/issn1684-8853.2017.5.2","title":"CONSTRUCTION OF SYMMETRIC HADAMARD MATRICES","year":2017,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"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; Compute Canada","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard's inequality; Hadamard matrix; Hadamard product; Order (exchange); Hadamard three-lines theorem; Hadamard's maximal determinant problem; Mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.0037901574161050867,"score_gpt":0.17382873416527453,"score_spread":0.17003857674916945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749014923","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.862455,0.0031609267,0.022170488,0.000054070315,0.0039122608,0.0007597691,0.000088631365,0.00029764418,0.10710118],"genre_scores_gemma":[0.99982667,0.00006772278,0.0000148425315,0.0000064207948,0.000043575892,0.000017435903,0.0000025333452,0.0000033175102,0.000017460528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994383,0.000017313527,0.00032578793,0.00003191353,0.00010370145,0.00008298433],"domain_scores_gemma":[0.99950147,0.000026084319,0.00020279948,0.00017584184,0.000056929795,0.000036858954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023679425,0.00007087366,0.00016917658,0.00014556717,0.00012146628,0.00018232007,0.00009551891,0.000058106853,0.0000036329695],"category_scores_gemma":[0.000027014688,0.000062284686,0.000030588053,0.000050212504,0.000041039802,0.0008483557,0.000006424808,0.000041289746,0.000020278396],"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.00011266695,0.000015970061,0.039526265,0.0034531723,0.00045833515,0.0000019457218,0.001388393,0.008154144,0.0016196384,0.79490024,0.0010997768,0.14926945],"study_design_scores_gemma":[0.009815249,0.0002165815,0.0785137,0.00074731314,0.00020253133,0.00032556383,0.006177995,0.73011255,0.0014191377,0.0024981203,0.16890883,0.0010624082],"about_ca_topic_score_codex":0.00007100563,"about_ca_topic_score_gemma":0.0000013397067,"teacher_disagreement_score":0.79240215,"about_ca_system_score_codex":0.000009070524,"about_ca_system_score_gemma":0.0000048432235,"threshold_uncertainty_score":0.25398958},"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":"W2750192925","doi":"","title":"Simple Permutations, Alternating Permutations, and the Superpatterns that Contain Them","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Mathematics; Combinatorics; Parity of a permutation; Symmetric group; Cyclic permutation","score_opus":0.009569688153377116,"score_gpt":0.20606062333873582,"score_spread":0.1964909351853587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750192925","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.99366504,0.00021473676,0.00078903796,0.00013317233,0.0007564033,0.00020748253,0.000006483277,0.00017922178,0.0040484197],"genre_scores_gemma":[0.9996672,0.000025545618,0.000012284189,0.000105315805,0.000020383448,0.000063144704,0.000014630954,0.000029813613,0.000061635285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991391,0.00018639085,0.00018957937,0.00014136979,0.00014607326,0.00019749474],"domain_scores_gemma":[0.9991618,0.0004800544,0.000036506914,0.00023560901,0.000030433346,0.00005559132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056103966,0.00014461495,0.00018374484,0.00003702836,0.00022942144,0.000106636144,0.0001741124,0.000048286955,0.000037712573],"category_scores_gemma":[0.00006834316,0.00011013943,0.000056309862,0.0000860975,0.000084866995,0.00014154465,0.000029114055,0.00014550496,0.000038497354],"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.0000068026134,0.000008088331,0.021726137,0.000031640873,0.00004323103,0.0000015193763,0.0021090407,0.00031314787,0.00017584788,0.9747218,0.00025799323,0.00060476444],"study_design_scores_gemma":[0.002597159,0.000024890447,0.0106937615,0.000034345645,0.0000416346,0.00003518209,0.0026724269,0.046568923,0.0010786405,0.93369997,0.002267471,0.00028559042],"about_ca_topic_score_codex":0.000059100894,"about_ca_topic_score_gemma":0.000012150526,"teacher_disagreement_score":0.046255775,"about_ca_system_score_codex":0.000021296433,"about_ca_system_score_gemma":0.0000050169365,"threshold_uncertainty_score":0.44913557},"labels":[],"label_agreement":null},{"id":"W2752228870","doi":"10.48550/arxiv.1709.00075","title":"Improved bounds for Rota's Basis Conjecture","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Waterloo","funders":"","keywords":"Matroid; Disjoint sets; Combinatorics; Conjecture; Rank (graph theory); Mathematics; Basis (linear algebra); Discrete mathematics; Geometry","score_opus":0.04055420120260328,"score_gpt":0.16814202360055955,"score_spread":0.12758782239795627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752228870","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.83146703,0.00048505707,0.14720863,0.000035760066,0.004444673,0.0014304244,0.000426085,0.00096282596,0.013539537],"genre_scores_gemma":[0.9962546,0.00008736589,0.000078720965,0.000013973426,0.0002357027,0.000008528052,0.00005720687,0.000064751555,0.0031991557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988108,0.000041987263,0.00016726757,0.0005689027,0.000037064576,0.0003739742],"domain_scores_gemma":[0.9984398,0.000069890324,0.00013974517,0.0011345332,0.00007639045,0.00013967947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020653146,0.0003828313,0.00044170613,0.00015901287,0.0002579164,0.00013426102,0.00084328733,0.00055315637,0.000048349266],"category_scores_gemma":[0.000027962904,0.00044478406,0.0004049033,0.00008499591,0.0001012793,0.0001321173,0.00022095355,0.00048175463,0.000025100288],"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.00049147144,0.00015369918,0.0031488265,0.0050100144,0.0030981125,0.00036011607,0.0013427716,0.69869345,0.0032961818,0.27085567,0.009900787,0.003648922],"study_design_scores_gemma":[0.0025708897,0.00014457895,0.0005646978,0.00046548256,0.0006965577,0.000013512759,0.00030260003,0.7628268,0.0031403631,0.19085382,0.036314182,0.00210652],"about_ca_topic_score_codex":0.000060720555,"about_ca_topic_score_gemma":0.000080341364,"teacher_disagreement_score":0.16478759,"about_ca_system_score_codex":0.00013047025,"about_ca_system_score_gemma":0.000054606357,"threshold_uncertainty_score":0.9998004},"labels":[],"label_agreement":null},{"id":"W2753058904","doi":"10.1287/moor.2017.0871","title":"Ideal Clutters That Do Not Pack","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics; National Science Foundation","keywords":"Ideal (ethics); Clutter; Mathematics; Combinatorics; Characterization (materials science); Set (abstract data type); Class (philosophy); Identification (biology); Discrete mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.13337599221911664,"score_gpt":0.3748297048317479,"score_spread":0.24145371261263124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753058904","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.96056414,0.000070073394,0.0036828388,0.00035282213,0.0001692766,0.00037677784,0.000033983084,0.000057686306,0.0346924],"genre_scores_gemma":[0.9970089,0.000026681118,0.0021388507,0.000004148255,0.000042227184,0.00005077388,0.0000038359467,0.000022054157,0.00070250867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.00005107881,0.00021697841,0.00009721675,0.000401935,0.00023033906],"domain_scores_gemma":[0.9988554,0.00010876634,0.000017549211,0.00082584843,0.0001295647,0.00006283002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012403295,0.00008227401,0.00016457874,0.00014391389,0.00049540156,0.0003182066,0.00051950454,0.00005905948,0.00012866095],"category_scores_gemma":[0.00018584992,0.000072220726,0.00005184824,0.000070998176,0.00017653551,0.00020997364,0.00008485214,0.00019721378,0.0001666801],"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.00002146168,0.0004135829,0.00042520024,0.0016898828,0.00025875092,0.000019401872,0.013478538,0.018106986,0.1141245,0.8336605,0.012288816,0.0055123726],"study_design_scores_gemma":[0.002876477,0.00036837536,0.0031104367,0.0010447535,0.000047730882,0.00005205079,0.010497992,0.61321056,0.30738813,0.053128228,0.007282987,0.0009922414],"about_ca_topic_score_codex":0.000029128185,"about_ca_topic_score_gemma":0.000030759238,"teacher_disagreement_score":0.7805323,"about_ca_system_score_codex":0.000021564505,"about_ca_system_score_gemma":0.00001856737,"threshold_uncertainty_score":0.38102785},"labels":[],"label_agreement":null},{"id":"W2753908926","doi":"","title":"Resolving P(v, 3, λ) designs into regular P 3 -configurations.","year":2003,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013488460348556284,"score_gpt":0.21520820202965218,"score_spread":0.2017197416810959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753908926","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.93931353,0.0031794927,0.02567778,0.0006431796,0.004695577,0.0003058873,0.0000014675004,0.0001422979,0.026040796],"genre_scores_gemma":[0.9993374,0.000049485116,0.00023695602,0.000012632514,0.00006876068,0.0000020797675,2.6184316e-7,0.000024538418,0.00026790085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988299,0.00020875,0.0004530892,0.00005994315,0.00023673342,0.00021155553],"domain_scores_gemma":[0.99925345,0.00010061074,0.00014703796,0.00026681335,0.000121991194,0.00011007141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010397595,0.00014100841,0.0002099533,0.000119563585,0.00015176582,0.0000650119,0.00033786843,0.0000767235,0.000045802393],"category_scores_gemma":[0.000098238255,0.00010402667,0.00012526533,0.00036869178,0.00005798093,0.0002083784,0.0000054522466,0.00037916529,0.000017104363],"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.000017303008,0.00005671694,0.00059804576,0.000075565615,0.00018884327,0.00008552256,0.002721442,0.0066752713,0.013583351,0.96704865,0.008308547,0.0006407222],"study_design_scores_gemma":[0.0014133939,0.0003699602,0.0014579851,0.00025054807,0.00016979169,0.0014973809,0.0038168272,0.00036399745,0.06964899,0.8553104,0.0651954,0.00050532597],"about_ca_topic_score_codex":6.2782084e-7,"about_ca_topic_score_gemma":4.0294495e-7,"teacher_disagreement_score":0.111738265,"about_ca_system_score_codex":0.000066700726,"about_ca_system_score_gemma":0.000039379327,"threshold_uncertainty_score":0.42420846},"labels":[],"label_agreement":null},{"id":"W2755994256","doi":"10.1016/j.disc.2017.08.039","title":"Constructions for orthogonal designs using signed group orthogonal designs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Lethbridge","keywords":"Mathematics; Hadamard matrix; Hadamard transform; Orthogonal array; Orthogonal matrix; Group (periodic table); Combinatorics; Orthogonal group; Combinatorial design; Complex Hadamard matrix; Discrete mathematics; Orthogonal basis; Mathematical analysis; Statistics; Taguchi methods","score_opus":0.07403725507723834,"score_gpt":0.2900789309838628,"score_spread":0.21604167590662443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755994256","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.26718688,0.000056141493,0.72751784,0.000013563748,0.00056107633,0.000524288,0.00013875765,0.0002015989,0.0037998552],"genre_scores_gemma":[0.9391624,0.000003943368,0.060362406,0.000008351432,0.00017794441,0.00008932724,0.00002351728,0.00007729213,0.000094818686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987191,0.000034924466,0.00043835654,0.00021136897,0.00019451731,0.0004017199],"domain_scores_gemma":[0.9988356,0.00016200182,0.0001797994,0.0006270707,0.00006377095,0.00013174883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041594848,0.00028026395,0.00036868767,0.00008810141,0.0007741812,0.00023440403,0.00038172782,0.0001393437,0.00007669453],"category_scores_gemma":[0.00010403288,0.00026401665,0.00023225824,0.00006659343,0.00019571958,0.00027413078,0.000043703847,0.00013221342,0.000022434493],"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.000039788814,0.000094484465,0.00072420645,0.0012653283,0.00048961246,0.00001731022,0.0015975527,0.004399895,0.07847216,0.9108571,0.00030050523,0.0017420682],"study_design_scores_gemma":[0.0020982742,0.00018945329,0.0005906909,0.00069918984,0.00056072115,0.00035255903,0.002606233,0.67359895,0.007996622,0.30814546,0.0014891645,0.0016726733],"about_ca_topic_score_codex":0.0000025610086,"about_ca_topic_score_gemma":0.000011771988,"teacher_disagreement_score":0.6719755,"about_ca_system_score_codex":0.000037122558,"about_ca_system_score_gemma":0.000027182286,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2756845570","doi":"","title":"Decompositions of λK n into LOE and OLE Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.005701048686951299,"score_gpt":0.21503629699640786,"score_spread":0.20933524830945657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756845570","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.99085,0.00036103936,0.00001993637,0.000023809307,0.0011562054,0.00006670093,0.0000032913626,0.0000624669,0.007456589],"genre_scores_gemma":[0.99984807,0.000030704556,0.00006508126,0.0000040561717,0.0000034779425,0.000008543658,0.000001882248,0.000012203124,0.000026000198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996216,0.000015700565,0.000121913814,0.00008095793,0.000059215992,0.00010059735],"domain_scores_gemma":[0.9995148,0.000025516958,0.00003859069,0.00034630942,0.000022347642,0.000052397223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010145032,0.00007820474,0.00013202711,0.00004828889,0.00017914268,0.00003704495,0.00016802781,0.00004882746,0.000009395517],"category_scores_gemma":[0.000011163524,0.000081463506,0.000039051803,0.0000379304,0.00008292439,0.00012345673,0.00003337564,0.00006513068,0.000009961085],"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.0000036994172,0.000028044897,0.008863854,0.00008005389,0.000046664918,0.0000031689478,0.00038963667,0.000021669337,0.007733456,0.98172885,0.00050173,0.0005991568],"study_design_scores_gemma":[0.00049937825,0.00004765629,0.026185837,0.00006640305,0.000018892666,0.0000062234803,0.00007484582,0.00038390496,0.012889824,0.95893186,0.00075061317,0.00014456021],"about_ca_topic_score_codex":0.000035211116,"about_ca_topic_score_gemma":0.00000941294,"teacher_disagreement_score":0.022797003,"about_ca_system_score_codex":0.000006929966,"about_ca_system_score_gemma":0.0000032836983,"threshold_uncertainty_score":0.33219853},"labels":[],"label_agreement":null},{"id":"W2756975744","doi":"10.37236/5357","title":"Internally Fair Factorizations and Internally Fair Holey Factorizations with Prescribed Regularity","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Ottawa","funders":"","keywords":"Multigraph; Mathematics; Combinatorics; Factorization; Multipartite; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Decomposition; Algorithm; Computer science; Graph","score_opus":0.004012664316105553,"score_gpt":0.18156756950863237,"score_spread":0.1775549051925268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756975744","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.789021,0.0017280243,0.20572014,0.0003905286,0.0012488265,0.00022242853,0.000008284694,0.000082453174,0.001578328],"genre_scores_gemma":[0.99907327,0.00027848498,0.000013973002,0.000011879897,0.000117493146,0.000004328475,0.000001708871,0.000038630358,0.0004602319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986716,0.00009223245,0.00039573686,0.000115487754,0.00032695997,0.00039798146],"domain_scores_gemma":[0.99866456,0.000082621336,0.00038861303,0.0004894067,0.00025897616,0.00011583065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051768014,0.00021714061,0.0003003122,0.00010953386,0.00042047273,0.00028547854,0.0009160118,0.00008706762,0.000008374061],"category_scores_gemma":[0.00009313299,0.00014781408,0.00009434288,0.00012782915,0.0001301097,0.00052215595,0.00007096946,0.00078399543,0.000002174842],"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.00014593297,0.00013920583,0.019174619,0.00008632665,0.0010341282,0.000027561638,0.0023772279,0.0016136552,0.0030100385,0.9708647,0.00065009337,0.00087652385],"study_design_scores_gemma":[0.0061783106,0.0027285577,0.08118519,0.000940325,0.0007580914,0.0014218964,0.0010604654,0.0040469724,0.010610548,0.84280777,0.04683654,0.0014253274],"about_ca_topic_score_codex":0.0000139753365,"about_ca_topic_score_gemma":0.0000474272,"teacher_disagreement_score":0.21005228,"about_ca_system_score_codex":0.0001668956,"about_ca_system_score_gemma":0.00012804708,"threshold_uncertainty_score":0.6027683},"labels":[],"label_agreement":null},{"id":"W2757261819","doi":"10.37236/5641","title":"Relative Difference Sets Partitioned by Cosets","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Victoria","funders":"","keywords":"Coset; Mathematics; Intersection (aeronautics); Combinatorics; Group (periodic table); Diophantine equation; Class (philosophy); Quadratic equation; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.006520478916777124,"score_gpt":0.21377201144028207,"score_spread":0.20725153252350495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757261819","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.97887164,0.0060336147,0.009182702,0.0004014358,0.001173518,0.00010865763,0.000004189241,0.00003990811,0.004184335],"genre_scores_gemma":[0.9989993,0.0006223469,9.666052e-7,0.000011777079,0.000039685856,0.0000029048629,7.691063e-7,0.000016095082,0.0003061422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905026,0.00008734216,0.00025935855,0.000053842625,0.00021373149,0.00033549286],"domain_scores_gemma":[0.9991729,0.0000990346,0.00026325558,0.00032240228,0.000082316226,0.00006004632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389679,0.00011758643,0.00019910665,0.00003157221,0.00033426288,0.00007212161,0.0005926235,0.000058278132,0.0000093065555],"category_scores_gemma":[0.00006414978,0.00008127747,0.00008695895,0.000060347757,0.0000716664,0.00021678356,0.000021530526,0.0005824994,0.000012037151],"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.000035298865,0.00005685183,0.00059756596,0.000017938342,0.00024087414,0.000008157775,0.00045690584,0.00015444832,0.0023992714,0.9919289,0.003460885,0.00064290146],"study_design_scores_gemma":[0.0007208721,0.00024394807,0.0019934408,0.00005222891,0.00005483514,0.00009819586,0.00006967226,0.0005196485,0.0045389687,0.9868288,0.0047336784,0.00014573081],"about_ca_topic_score_codex":0.000001908476,"about_ca_topic_score_gemma":0.0000020515113,"teacher_disagreement_score":0.020127673,"about_ca_system_score_codex":0.0001306084,"about_ca_system_score_gemma":0.000046901572,"threshold_uncertainty_score":0.33143988},"labels":[],"label_agreement":null},{"id":"W2757993765","doi":"","title":"The truncated determinants of combinatorial rectangular arrays.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009150823117338606,"score_gpt":0.2228268114721719,"score_spread":0.21367598835483329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757993765","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.979258,0.00032914378,0.000003971539,0.000016256283,0.013915105,0.0001901726,0.0000051735624,0.00012760962,0.0061545763],"genre_scores_gemma":[0.9997445,0.00006319625,0.000008689344,0.0000024083915,0.000025520276,0.00002402404,0.0000014882692,0.000034869307,0.00009533816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989302,0.00007060831,0.00034091223,0.0001469019,0.00021246624,0.00029891246],"domain_scores_gemma":[0.99850816,0.00012381416,0.00016563604,0.0010519777,0.00007565466,0.00007478478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005382329,0.00017569795,0.00028642474,0.00003637578,0.0006016136,0.00011078833,0.0008264806,0.00012117151,0.0000069106327],"category_scores_gemma":[0.0001651988,0.00013824122,0.00011169093,0.00008024525,0.00019593032,0.00015508471,0.00006055648,0.00016646468,0.000029407553],"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.000078130644,0.00006871062,0.022420514,0.00010366614,0.00014773187,0.000024964935,0.00046621554,0.000030219255,0.0063196067,0.9644753,0.0020151276,0.0038498596],"study_design_scores_gemma":[0.002266976,0.0001569971,0.020065594,0.00013705216,0.00005105913,0.000014184125,0.00015725446,0.0023147487,0.06404012,0.9022752,0.008073422,0.000447377],"about_ca_topic_score_codex":0.000037610433,"about_ca_topic_score_gemma":0.000008756902,"teacher_disagreement_score":0.062200032,"about_ca_system_score_codex":0.000028244322,"about_ca_system_score_gemma":0.000017674409,"threshold_uncertainty_score":0.5637313},"labels":[],"label_agreement":null},{"id":"W2758605595","doi":"10.1016/j.disc.2017.08.043","title":"Fair and internally fair (holey) hamiltonian decompositions of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2017,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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","funders":"Division of Mathematical Sciences","keywords":"Hamiltonian (control theory); Mathematics; Combinatorics; Hamiltonian path; Partition (number theory); Graph; Discrete mathematics","score_opus":0.015872258556416396,"score_gpt":0.2392087625630316,"score_spread":0.22333650400661523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758605595","genre_codex":"other","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.21714158,0.0076370225,0.0044177496,0.002592624,0.013780558,0.00035374836,0.0045678588,0.0020399643,0.7474689],"genre_scores_gemma":[0.93052197,0.008870352,0.009054162,0.005966808,0.011879468,0.011651938,0.011410819,0.008735912,0.0019086021],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9382001,0.004457592,0.013239162,0.011794394,0.015829496,0.016479233],"domain_scores_gemma":[0.94853866,0.010669846,0.015542114,0.013596883,0.0018636599,0.009788858],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.013395005,0.0071981936,0.0027088393,0.0059331288,0.011799681,0.013131463,0.01825068,0.017208932,0.89838904],"category_scores_gemma":[0.012528269,0.015798723,0.014585755,0.009197172,0.014230515,0.010810823,0.01539499,0.012984373,0.01138174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00933795,0.0022318463,0.00008769295,0.008246878,0.013579076,0.008809934,0.0075165173,0.007496386,0.01127944,0.24385023,0.6818555,0.005708544],"study_design_scores_gemma":[0.011471961,0.008743493,0.00026781528,0.009698329,0.012913771,0.0133772725,0.010914128,0.0142087685,0.8869827,0.0020500373,0.015858864,0.01351287],"about_ca_topic_score_codex":0.01281424,"about_ca_topic_score_gemma":0.0149835665,"teacher_disagreement_score":0.8870073,"about_ca_system_score_codex":0.00019228985,"about_ca_system_score_gemma":0.010009289,"threshold_uncertainty_score":0.99578965},"labels":[],"label_agreement":null},{"id":"W2759187772","doi":"","title":"On the Semisymmetric Graphs of Order 2p 3 : faithful and primitive case.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange)","score_opus":0.00921065686169387,"score_gpt":0.2061890913905993,"score_spread":0.19697843452890543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759187772","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.9799726,0.00021609454,0.0000047880803,0.00003483907,0.0008906844,0.00015242388,0.000006947758,0.000043984423,0.01867762],"genre_scores_gemma":[0.9998636,0.000024705136,0.0000060840985,0.0000130873295,0.000003449087,0.000014395379,6.012482e-7,0.000016678192,0.00005736948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994677,0.000044777727,0.00013042119,0.00011285454,0.00010279488,0.00014146614],"domain_scores_gemma":[0.99912655,0.0002483952,0.00006409813,0.00046686895,0.00005031876,0.00004374248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026049017,0.000116601695,0.00015525421,0.00007926381,0.00023229762,0.00004667172,0.00019484905,0.000062918516,0.000014473797],"category_scores_gemma":[0.00015481247,0.00008528027,0.000041561667,0.00015756849,0.00010358557,0.00007710074,0.00003731572,0.00013592465,0.000008287087],"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.000006447187,0.000020488676,0.0014865887,0.000039156203,0.000068390174,0.00004962821,0.00037136365,0.000014771038,0.00045073984,0.99622715,0.00066561153,0.0005996805],"study_design_scores_gemma":[0.0012636546,0.00019995592,0.02068037,0.00015141221,0.00006195043,0.00020227398,0.00093253236,0.0010581767,0.014039907,0.9603279,0.0006921138,0.00038971545],"about_ca_topic_score_codex":0.000034385732,"about_ca_topic_score_gemma":0.000004569106,"teacher_disagreement_score":0.035899196,"about_ca_system_score_codex":0.000009654759,"about_ca_system_score_gemma":0.000005099451,"threshold_uncertainty_score":0.34776285},"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":"W2762977785","doi":"10.1515/spma-2018-0002","title":"Construction of symmetric Hadamard matrices of order 4v for v = 47, 73, 113","year":2018,"lang":"en","type":"article","venue":"Special Matrices","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 Waterloo","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Hadamard product; Cover (algebra)","score_opus":0.006837211532872308,"score_gpt":0.21052993587872315,"score_spread":0.20369272434585084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762977785","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.9373728,0.001542309,0.0025193738,0.000019166497,0.0038211788,0.00043651336,0.000095263604,0.00013212644,0.05406126],"genre_scores_gemma":[0.9940965,0.00011293656,0.0033440883,0.000003866445,0.0023027528,0.000014326927,0.0000047552144,0.000024266172,0.00009647263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990488,0.000025491954,0.00042249542,0.0001367266,0.00017643966,0.00019001035],"domain_scores_gemma":[0.9992733,0.00013859938,0.00017564662,0.00016834839,0.00020418114,0.000039922175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022600121,0.00013411428,0.00030154415,0.00043874866,0.000055605527,0.000018899778,0.00018014775,0.00010323975,0.00019424362],"category_scores_gemma":[0.00006187766,0.00012643955,0.0001051143,0.001196202,0.00012661723,0.00014332519,0.000017321607,0.000053530883,0.000027092656],"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.00063771725,0.00022860774,0.02450273,0.005748584,0.00086273334,0.0000048273787,0.0022828267,0.00077702524,0.0257799,0.7860856,0.03273911,0.12035033],"study_design_scores_gemma":[0.0054161437,0.0022021774,0.02185904,0.0006689922,0.0008515389,0.000088777735,0.00559543,0.005815549,0.2654973,0.093634635,0.59617585,0.0021945997],"about_ca_topic_score_codex":0.000040725037,"about_ca_topic_score_gemma":0.00003004946,"teacher_disagreement_score":0.692451,"about_ca_system_score_codex":0.000018716137,"about_ca_system_score_gemma":0.000016729076,"threshold_uncertainty_score":0.5156055},"labels":[],"label_agreement":null},{"id":"W2764594488","doi":"","title":"Full Friendly Index Sets Of Spiders.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Statistics; Computer science; World Wide Web","score_opus":0.011241549441008367,"score_gpt":0.21298683117891287,"score_spread":0.2017452817379045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764594488","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.9779641,0.0003517434,0.000067105175,0.000011864019,0.003058873,0.00008714702,0.000003670483,0.00016161594,0.018293869],"genre_scores_gemma":[0.99987656,0.000003184809,0.000031428524,0.000007718029,0.00000687396,0.000007690049,0.0000029537598,0.000021237423,0.000042325802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933386,0.00003612688,0.00019957568,0.000096246506,0.00016083391,0.00017338345],"domain_scores_gemma":[0.99951494,0.000028616581,0.00003427968,0.0002564637,0.000054351443,0.00011137847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025062726,0.0001088835,0.00018207522,0.000067169465,0.000017229006,0.00001017268,0.000158933,0.000082020124,0.00001962988],"category_scores_gemma":[0.000026917709,0.00011117405,0.000049735987,0.00019212221,0.000033368848,0.000098211196,0.000022194827,0.000103421924,0.00007418876],"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.00007584595,0.00008397345,0.008612575,0.0001582406,0.00012333642,0.000022846318,0.0016524364,0.0018171989,0.0022054906,0.9610766,0.023322454,0.0008489649],"study_design_scores_gemma":[0.0024923217,0.00051453325,0.0023449117,0.000089864894,0.000029235398,0.000027948452,0.0012356516,0.004541085,0.009396568,0.9637545,0.015065818,0.00050757814],"about_ca_topic_score_codex":0.000017097196,"about_ca_topic_score_gemma":0.0000031557352,"teacher_disagreement_score":0.021912474,"about_ca_system_score_codex":0.00002652225,"about_ca_system_score_gemma":0.000015521517,"threshold_uncertainty_score":0.45335463},"labels":[],"label_agreement":null},{"id":"W2765403799","doi":"10.1007/pl00011389","title":"The packing property","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Clutter; Matrix (chemical analysis); Disjoint sets; Incidence matrix; Vertex (graph theory); Set (abstract data type); Matching (statistics); Algorithm; Graph; Computer science; Radar","score_opus":0.008940437827761731,"score_gpt":0.19750033978610437,"score_spread":0.18855990195834263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765403799","genre_codex":"other","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.42674854,0.0021620307,0.022416685,0.00053878,0.0006264073,0.002088277,0.0000021283208,0.004182384,0.54123473],"genre_scores_gemma":[0.996053,0.000013409821,0.0012407462,0.000012723948,0.000075465534,0.00010117622,5.9470443e-7,0.00002998557,0.002472938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992099,0.000030990454,0.00021512042,0.00009067671,0.00013705599,0.00031627814],"domain_scores_gemma":[0.9995801,0.00010817366,0.000010253376,0.0002292713,0.000009909799,0.00006231802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858139,0.00011087568,0.000116122115,0.000012338282,0.00021465479,0.0001471353,0.0001699276,0.00004378407,0.00027447878],"category_scores_gemma":[0.000026801587,0.000053310778,0.00006633321,0.00012392174,0.00007013761,0.00006381506,0.000009707261,0.00013141487,0.0006276844],"study_design_candidate":"design_other","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.000004260548,0.000023559682,0.000017853983,0.00014226483,0.000031576266,0.0000055808937,0.0005427032,0.00014303465,0.00012092192,0.03166063,0.0003329089,0.9669747],"study_design_scores_gemma":[0.00025494507,0.000050872583,0.00003161365,0.00023443233,0.000029860435,0.00008778555,0.0006346258,0.044835526,0.0008949037,0.08978018,0.8627369,0.00042837652],"about_ca_topic_score_codex":8.428077e-7,"about_ca_topic_score_gemma":0.0000011266678,"teacher_disagreement_score":0.96654636,"about_ca_system_score_codex":0.000013183948,"about_ca_system_score_gemma":0.0000025203665,"threshold_uncertainty_score":0.80678225},"labels":[],"label_agreement":null},{"id":"W2767821434","doi":"","title":"Toughness for the existence of k-Hamiltonian [a, b]-factors.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Pure mathematics; Combinatorics; Composite material; Materials science","score_opus":0.0199986193085299,"score_gpt":0.23854463028299733,"score_spread":0.21854601097446744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767821434","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.98989767,0.000302126,0.00008770263,0.000031031417,0.004606323,0.00024072596,0.000012741441,0.00006715736,0.0047545503],"genre_scores_gemma":[0.9997099,0.000014785424,0.000021931468,0.0000041528033,0.0000123756745,0.000036598576,0.000001364781,0.000019235074,0.00017967846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948484,0.000013598169,0.00015348059,0.00009273937,0.000091840986,0.00016347581],"domain_scores_gemma":[0.9989784,0.00017156905,0.00007058896,0.0007010815,0.000043947064,0.000034409342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021622446,0.00010347703,0.00015978327,0.000019006024,0.00028989904,0.000050469214,0.0005750803,0.0000550814,0.000008243369],"category_scores_gemma":[0.00006757281,0.000074659525,0.000089197914,0.00003525607,0.00009685329,0.000114118084,0.00003227339,0.00006963391,0.000005539083],"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.000010472894,0.000019379702,0.006901807,0.00012188862,0.00007419382,9.3845495e-7,0.00062501023,0.000081565406,0.0016589301,0.98900783,0.0006965172,0.00080144295],"study_design_scores_gemma":[0.0016871912,0.00014541233,0.15212807,0.0001743295,0.00009305978,0.0000047944777,0.00090524333,0.0037023546,0.05098018,0.7668922,0.022742974,0.0005441985],"about_ca_topic_score_codex":0.000029198754,"about_ca_topic_score_gemma":0.000008469256,"teacher_disagreement_score":0.22211567,"about_ca_system_score_codex":0.0000120951645,"about_ca_system_score_gemma":0.000007340977,"threshold_uncertainty_score":0.30445272},"labels":[],"label_agreement":null},{"id":"W2767886354","doi":"","title":"Rainbow connection of the join of two paths.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Connection (principal bundle); Rainbow; Mathematics; Combinatorics; Geometry; Optics; Physics","score_opus":0.0095216467594191,"score_gpt":0.21525377051835906,"score_spread":0.20573212375893996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767886354","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.98781216,0.0000819542,0.0000075847156,0.000017809238,0.003750743,0.0000962089,0.0000038390262,0.00003114197,0.008198549],"genre_scores_gemma":[0.9998851,0.0000050427993,0.000005540362,0.000002950625,0.000007014067,0.00000537132,4.2541487e-7,0.000010651935,0.00007790522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995628,0.000038621696,0.0001585404,0.00005985208,0.00009328176,0.000086891254],"domain_scores_gemma":[0.9992921,0.00003295343,0.000104736544,0.0005159936,0.000035109653,0.000019143483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022760639,0.000066429566,0.00013887392,0.00002216795,0.00009607427,0.000011568431,0.00026799727,0.000040184044,0.000012948026],"category_scores_gemma":[0.00005341909,0.00005202126,0.00007541524,0.00004828411,0.00007122416,0.00006848091,0.000032813732,0.00007248488,0.0000046112677],"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.0000058468477,0.00002608011,0.015238807,0.00008884336,0.000047418485,7.306296e-7,0.00037150376,0.0002058425,0.029349787,0.95358425,0.0005625072,0.0005183973],"study_design_scores_gemma":[0.0014320463,0.000053806245,0.04789543,0.00016016862,0.000029827263,0.000005132257,0.0001426358,0.0012514377,0.22904651,0.7188223,0.0009946417,0.00016607177],"about_ca_topic_score_codex":0.000042620144,"about_ca_topic_score_gemma":0.000006617737,"teacher_disagreement_score":0.23476195,"about_ca_system_score_codex":0.000010224808,"about_ca_system_score_gemma":0.000006295869,"threshold_uncertainty_score":0.21213655},"labels":[],"label_agreement":null},{"id":"W2767949670","doi":"","title":"Constructions of pairs of Tutte-equivalent graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010910265649889409,"score_gpt":0.21733527907669373,"score_spread":0.2064250134268043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767949670","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.97826874,0.0001513014,0.000015922617,0.000010773995,0.0031417545,0.00009183336,0.00001368359,0.000062183644,0.01824381],"genre_scores_gemma":[0.999867,0.00002594529,0.00004663365,0.0000012158715,0.0000037029006,0.000007840435,0.0000013904607,0.000013355976,0.00003289124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940723,0.000023562978,0.0002441907,0.00008375007,0.00011279026,0.00012846282],"domain_scores_gemma":[0.9992083,0.00003371714,0.00011329564,0.0005472937,0.000052535175,0.00004490992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016224939,0.000092550334,0.00021438021,0.00006964398,0.00009877572,0.000012293427,0.0002664242,0.00006006544,0.00003215108],"category_scores_gemma":[0.000030266121,0.000095203504,0.000105282554,0.00006411778,0.00020209418,0.0001017546,0.00003051224,0.00007804334,0.0000068761656],"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.00000464579,0.00002854883,0.018095031,0.00012323658,0.00008078456,0.0000016309094,0.00016331709,0.00006883105,0.005953329,0.9745674,0.00043595172,0.00047726615],"study_design_scores_gemma":[0.0011361847,0.00009778479,0.041305445,0.00018513908,0.000058068945,0.0000137703355,0.0003935748,0.00037591258,0.06920427,0.885866,0.0011035406,0.00026035274],"about_ca_topic_score_codex":0.000024164834,"about_ca_topic_score_gemma":0.0000025678694,"teacher_disagreement_score":0.08870147,"about_ca_system_score_codex":0.000009036544,"about_ca_system_score_gemma":0.000008727925,"threshold_uncertainty_score":0.38822863},"labels":[],"label_agreement":null},{"id":"W2767999306","doi":"10.37236/1898","title":"Sequentially Perfect and Uniform One-Factorizations of the Complete Graph","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"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; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Factorization; Disjoint sets; Graph; Hamiltonian path; Complete graph; Discrete mathematics; Perfect power; Integer (computer science); Algorithm; Computer science","score_opus":0.007111906554473927,"score_gpt":0.17972801566762212,"score_spread":0.17261610911314818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767999306","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.9831001,0.004413578,0.009527541,0.00024632085,0.00057529815,0.00014101,0.0000035063003,0.00002345604,0.001969163],"genre_scores_gemma":[0.9992205,0.00062176806,0.0000058398423,0.000013117858,0.0000686175,9.927271e-7,3.36632e-7,0.000015556703,0.00005325306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990699,0.0000936178,0.00032420558,0.00004244115,0.00022532475,0.00024446775],"domain_scores_gemma":[0.9994332,0.000075507014,0.00016929432,0.00018532827,0.00009920646,0.000037418537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868995,0.000102294725,0.00018796281,0.00007007319,0.00012259523,0.000018996696,0.0003479777,0.000043169566,0.000009108058],"category_scores_gemma":[0.000017667417,0.00006257041,0.00011484964,0.00033676554,0.00007067228,0.00011000374,0.00002231139,0.00042769703,0.0000010377014],"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.000010987306,0.00003461542,0.00040694152,0.000028043585,0.00018016527,2.909948e-7,0.00046931018,0.004734904,0.006371077,0.98747176,0.00007427903,0.00021761715],"study_design_scores_gemma":[0.0020139646,0.0006430244,0.004503774,0.00018534971,0.00041207857,0.0004459748,0.0004369079,0.004261492,0.023247022,0.9439142,0.019548021,0.00038818843],"about_ca_topic_score_codex":0.000002337071,"about_ca_topic_score_gemma":0.000011995914,"teacher_disagreement_score":0.043557566,"about_ca_system_score_codex":0.00010554903,"about_ca_system_score_gemma":0.000083749765,"threshold_uncertainty_score":0.25515473},"labels":[],"label_agreement":null},{"id":"W2768031719","doi":"","title":"The chromatic equivalence class of graph ψ n 3 (n-3, 1).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Friendship graph; Class (philosophy); Combinatorics; Graph; Equivalence class (music); Equivalence (formal languages); Discrete mathematics; Line graph; Computer science; Voltage graph; Artificial intelligence","score_opus":0.010283100021472258,"score_gpt":0.2216079274647311,"score_spread":0.21132482744325884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768031719","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.97781485,0.00059768505,0.000014262979,0.00004212655,0.0034002967,0.00011321577,0.0000022667502,0.00008653574,0.017928757],"genre_scores_gemma":[0.9997372,0.00007752183,0.0000071793743,0.0000031663542,0.000006854214,0.000015556943,4.1553392e-7,0.00001531342,0.00013676066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.000033183835,0.00019468708,0.000081996994,0.00013947187,0.00018789718],"domain_scores_gemma":[0.9989209,0.00010364037,0.00008805233,0.0008145386,0.00003064254,0.00004222253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032733442,0.0000981085,0.0001444512,0.000024414236,0.0003569258,0.000069051224,0.00064182957,0.00004950215,0.000008286469],"category_scores_gemma":[0.000060490325,0.00007298912,0.00007360072,0.000052975432,0.00016768686,0.00012033736,0.00004746689,0.0000964632,0.000034511362],"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.000004221639,0.000013262475,0.0019317863,0.0001052213,0.000055164655,0.0000028845568,0.00016451904,0.00004916251,0.0036489114,0.9919311,0.0012021665,0.0008916034],"study_design_scores_gemma":[0.000472213,0.000051198567,0.015492875,0.00013187065,0.000020461688,0.000005606077,0.00012958776,0.0013987516,0.010674289,0.96910644,0.0023351952,0.0001815416],"about_ca_topic_score_codex":0.000009212406,"about_ca_topic_score_gemma":0.000004032632,"teacher_disagreement_score":0.022824688,"about_ca_system_score_codex":0.000011634517,"about_ca_system_score_gemma":0.000007045677,"threshold_uncertainty_score":0.29764098},"labels":[],"label_agreement":null},{"id":"W2770598256","doi":"10.23919/ursigass.2017.8105123","title":"Characterization of dispersion code multiplexing (DCM) in incoherent radio channels","year":2017,"lang":"en","type":"article","venue":"","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Multiplexing; Code (set theory); Interference (communication); Dispersion (optics); Bit error rate; Electronic engineering; Algorithm; Theoretical computer science; Telecommunications; Physics; Decoding methods; Optics; Channel (broadcasting); Programming language; Engineering","score_opus":0.015524362776390995,"score_gpt":0.21899004751440743,"score_spread":0.20346568473801643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770598256","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.99368405,0.00001983174,0.003021332,0.000015178129,0.0004969404,0.0001385444,0.000007916601,0.00005562883,0.002560581],"genre_scores_gemma":[0.99968123,0.000020922587,0.000029448407,0.0000027825297,0.000046380726,0.000009893124,0.000012132746,0.000012054394,0.00018513485],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995701,0.000016701275,0.00016688093,0.000078483856,0.00006200722,0.00010584267],"domain_scores_gemma":[0.999676,0.000009508342,0.00004830698,0.00022907033,0.0000106292455,0.000026523721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013175281,0.00007327938,0.0001291883,0.00006348734,0.00005164213,0.000026165344,0.00013935633,0.00004850464,0.000039541526],"category_scores_gemma":[0.000011959064,0.00006703579,0.000029969045,0.0000328705,0.000020050511,0.00018358504,0.000021334508,0.0000500175,0.000009595592],"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.0000141886985,0.000024889425,0.01797701,0.000113850416,0.000016645292,0.0000024055987,0.0009265976,0.002490268,0.97312593,0.0026462635,0.000013216561,0.002648741],"study_design_scores_gemma":[0.0013989118,0.000043650623,0.19858152,0.0004372391,0.000008901745,0.0000042957913,0.0003076845,0.23090683,0.5655325,0.00042428568,0.0019593223,0.000394876],"about_ca_topic_score_codex":0.00003736657,"about_ca_topic_score_gemma":0.00004781936,"teacher_disagreement_score":0.40759343,"about_ca_system_score_codex":0.000018313047,"about_ca_system_score_gemma":0.000002022287,"threshold_uncertainty_score":0.273364},"labels":[],"label_agreement":null},{"id":"W2771217056","doi":"10.1007/s11786-018-0364-2","title":"Minimal Height Companion Matrices for Euclid Polynomials","year":2018,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambda; Mathematics; Integer (computer science); Combinatorics; Algebra over a field; Pure mathematics; Physics; Quantum mechanics; Computer science","score_opus":0.018778867631176904,"score_gpt":0.2507788742923151,"score_spread":0.2320000066611382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771217056","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.521409,0.00004416102,0.4757363,0.000019823667,0.0011407317,0.00022129428,0.0000034310196,0.00011725761,0.0013080266],"genre_scores_gemma":[0.87742454,0.0000027709243,0.12224502,0.000025388923,0.00026193555,0.000015666916,3.929565e-7,0.000011292542,0.000012991445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903697,0.00001167771,0.00029371036,0.00018870727,0.00017609193,0.00029282036],"domain_scores_gemma":[0.9994277,0.00014958845,0.000045752135,0.00026711967,0.000054047137,0.000055820834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009445379,0.00011342186,0.00018543503,0.00019662778,0.000117690404,0.00012268523,0.000528901,0.00003616238,0.0000104452565],"category_scores_gemma":[0.000016534696,0.0001005456,0.00003752825,0.00047004534,0.00022281654,0.00019420782,0.000069676105,0.00004802374,0.0000505579],"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.00006437628,0.0011479607,0.0035195015,0.005376779,0.000138533,0.000030147607,0.065723754,0.02331372,0.12275715,0.6679043,0.019915842,0.090107895],"study_design_scores_gemma":[0.0002402875,0.000087807246,0.00037302537,0.00014777071,0.000003994815,0.00001897282,0.000061914194,0.96231115,0.016772892,0.018865598,0.0009056621,0.00021089657],"about_ca_topic_score_codex":0.0000014148821,"about_ca_topic_score_gemma":0.0000041415055,"teacher_disagreement_score":0.93899745,"about_ca_system_score_codex":0.000036434256,"about_ca_system_score_gemma":0.000015917249,"threshold_uncertainty_score":0.41001305},"labels":[],"label_agreement":null},{"id":"W2774144053","doi":"10.1007/s00493-017-3396-3","title":"Extending Factorizations of Complete Uniform Hypergraphs","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"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; Hypergraph; Discrete mathematics","score_opus":0.019760809228066133,"score_gpt":0.22312220478638162,"score_spread":0.20336139555831548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774144053","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.82226276,0.0006897714,0.0051394454,0.000041534688,0.00455086,0.00026761254,0.000050834085,0.00045435084,0.16654283],"genre_scores_gemma":[0.99974346,0.000041399388,0.000043343603,0.000001882074,0.000020858617,0.000007654474,0.0000045201614,0.000018024266,0.00011884458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.000012031957,0.00016489055,0.00008372731,0.00009725452,0.00014884483],"domain_scores_gemma":[0.99929565,0.00003113283,0.00006727946,0.00051124726,0.000038462513,0.000056201916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007866945,0.00009573535,0.00016780874,0.00007591847,0.00026730754,0.000037791,0.00035285347,0.000047868372,0.000026969832],"category_scores_gemma":[0.000029235256,0.00009527597,0.00006667384,0.00009311205,0.00005719624,0.00014020331,0.00003543591,0.00007802871,0.000019210785],"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.0000022160787,0.000031136336,0.009965583,0.000073217445,0.000052966345,0.000003120875,0.00018399346,0.00016175827,0.009257763,0.97893983,0.00044823534,0.0008801806],"study_design_scores_gemma":[0.0036040288,0.00032871866,0.23185346,0.00048108786,0.00016561165,0.000037367863,0.000675312,0.014266315,0.041406345,0.46364287,0.2416588,0.0018800898],"about_ca_topic_score_codex":0.000009839713,"about_ca_topic_score_gemma":0.0000010538839,"teacher_disagreement_score":0.515297,"about_ca_system_score_codex":0.000020472964,"about_ca_system_score_gemma":0.0000049244086,"threshold_uncertainty_score":0.38852414},"labels":[],"label_agreement":null},{"id":"W2775536822","doi":"10.1007/s10623-018-0499-9","title":"Covers and partial transversals of Latin squares","year":2018,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","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; National Natural Science Foundation of China","keywords":"Transversal (combinatorics); Latin square; Cover (algebra); Mathematics; Combinatorics; Square (algebra); Order (exchange); Bar (unit); Discrete mathematics; Physics; Geometry; Mathematical analysis","score_opus":0.024702778303927263,"score_gpt":0.22075161584219583,"score_spread":0.19604883753826857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775536822","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.94391924,0.0043579633,0.048727848,0.000009710028,0.00043487284,0.00037437797,0.0002497562,0.00017827818,0.001747929],"genre_scores_gemma":[0.99799794,0.0010134125,0.00079871475,0.000010640054,0.0000798411,0.0000356546,0.000026951304,0.000032991946,0.0000038444336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989472,0.00008705818,0.00032462142,0.00027942433,0.00013965595,0.00022203951],"domain_scores_gemma":[0.99943846,0.00008905352,0.00007679505,0.00025229924,0.0000391442,0.0001042685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025543675,0.00029066642,0.0004618099,0.0003073411,0.000062836305,0.00006171508,0.00012679829,0.00027313095,0.000034203273],"category_scores_gemma":[0.0000050189005,0.00028137222,0.00017634498,0.00018914006,0.00029799403,0.000048700804,0.000042708645,0.0001993177,0.0000014389295],"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.0018705603,0.00061767094,0.13663256,0.028033262,0.011087211,0.00011694373,0.048805658,0.0328713,0.18187095,0.5047603,0.018880263,0.034453306],"study_design_scores_gemma":[0.011929567,0.004341111,0.05757946,0.009713042,0.0046648695,0.00011837855,0.011227317,0.10451037,0.24895711,0.46198723,0.07291523,0.012056322],"about_ca_topic_score_codex":0.000028396815,"about_ca_topic_score_gemma":0.000007921992,"teacher_disagreement_score":0.07905309,"about_ca_system_score_codex":0.0000038960757,"about_ca_system_score_gemma":0.000009831998,"threshold_uncertainty_score":0.9999638},"labels":[],"label_agreement":null},{"id":"W2784467519","doi":"10.1016/j.laa.2018.04.019","title":"The sum of nonsingular matrices is often nonsingular","year":2018,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Hungarian Scientific Research Fund","keywords":"Invertible matrix; Mathematics; Statement (logic); Set (abstract data type); Combinatorics; Pure mathematics; Computer science","score_opus":0.008915310262890285,"score_gpt":0.2286412445350837,"score_spread":0.21972593427219342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784467519","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.8431623,0.099221274,0.03268226,0.001751592,0.001976334,0.0048458586,0.0010994662,0.0011499297,0.014110969],"genre_scores_gemma":[0.99490064,0.0025273617,0.0009737543,0.0000926111,0.00066150073,0.00026447815,0.000065029206,0.00007402984,0.0004406029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988822,0.000035938156,0.00042263276,0.00028592575,0.00015889449,0.00021440939],"domain_scores_gemma":[0.99877757,0.00015212916,0.00013935378,0.00069996243,0.00015211735,0.00007888396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027026166,0.00023857589,0.00029119375,0.00009114871,0.00025932453,0.00007242164,0.00037047698,0.00024539107,0.00002249499],"category_scores_gemma":[0.00002039492,0.00019073024,0.0001209439,0.00021613266,0.00014279305,0.00003944973,0.00018085397,0.0002856325,0.00006676415],"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.00015720178,0.00059652183,0.0011797554,0.011730408,0.0049364152,0.000010922856,0.012990594,0.0037624175,0.036361016,0.7918314,0.07202323,0.06442015],"study_design_scores_gemma":[0.00042567094,0.00007974437,0.0005012686,0.00050897105,0.0005155771,0.000030065698,0.00042554774,0.057014402,0.03731579,0.08709157,0.81495416,0.001137209],"about_ca_topic_score_codex":0.000010149899,"about_ca_topic_score_gemma":0.0000036226138,"teacher_disagreement_score":0.74293095,"about_ca_system_score_codex":0.000012275592,"about_ca_system_score_gemma":0.000029734383,"threshold_uncertainty_score":0.77777535},"labels":[],"label_agreement":null},{"id":"W2784736218","doi":"10.1016/j.disc.2018.02.020","title":"On the Hamilton–Waterloo Problem with cycle lengths of distinct parities","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Mathematics; Factorization; Graph; BETA (programming language); Hamiltonian path; Complete graph; Computer science; Algorithm","score_opus":0.0105022115662468,"score_gpt":0.20158907679462257,"score_spread":0.19108686522837576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784736218","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.94091135,0.00013906322,0.0061968546,0.00003713509,0.00030158824,0.0008995695,0.00020227296,0.00029102663,0.051021166],"genre_scores_gemma":[0.99762726,0.000017773313,0.0015465851,0.00000871273,0.00008211912,0.0001667534,0.000032402168,0.00009390487,0.00042451717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986629,0.0000626005,0.00048004815,0.00021406227,0.0003131667,0.00026720556],"domain_scores_gemma":[0.9985203,0.00024983776,0.00019088219,0.00093107764,0.00006042365,0.000047492525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040071472,0.0003846148,0.0005111791,0.00006391122,0.000080546466,0.000081799175,0.0005076754,0.00017383105,0.00007459654],"category_scores_gemma":[0.00002459665,0.00021886732,0.00014741592,0.00008182095,0.00024387975,0.0000349797,0.000117387186,0.00038541033,0.000042990658],"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.00008934838,0.0002878803,0.00026823388,0.028880887,0.0018320372,0.000021692165,0.06731706,0.027848648,0.000344731,0.868526,0.004244293,0.00033921326],"study_design_scores_gemma":[0.00048766824,0.0003430262,0.00014284573,0.009132229,0.0003741324,0.000028989825,0.005311154,0.063345805,0.00949654,0.90918076,0.0008248202,0.0013320183],"about_ca_topic_score_codex":0.000014916422,"about_ca_topic_score_gemma":0.000019632214,"teacher_disagreement_score":0.06200591,"about_ca_system_score_codex":0.000025948122,"about_ca_system_score_gemma":0.000015226212,"threshold_uncertainty_score":0.892515},"labels":[],"label_agreement":null},{"id":"W2789389310","doi":"","title":"The 4-cube as a D-levels locally homogeneous graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homogeneous; Cube (algebra); Graph; Combinatorics; Discrete mathematics","score_opus":0.006913546405824411,"score_gpt":0.20342517438081786,"score_spread":0.19651162797499344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789389310","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.960256,0.0009037868,0.000090293506,0.00005813088,0.006561513,0.00019877059,0.000004386061,0.00041665495,0.031510502],"genre_scores_gemma":[0.99926674,0.000033525357,0.000014725181,0.00005921019,0.00004638375,0.000032815784,0.000001189389,0.000040328152,0.00050510536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989996,0.00006639495,0.0002180436,0.00016276391,0.00018766536,0.00036553977],"domain_scores_gemma":[0.99917614,0.00011800015,0.000029307628,0.0004915476,0.00008173391,0.000103278755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032813614,0.0001737921,0.00014923191,0.00004928498,0.00032973386,0.00008431147,0.00039729645,0.000096170625,0.000056371242],"category_scores_gemma":[0.000036464415,0.00013418484,0.0000916687,0.00031111162,0.00017743406,0.00007000729,0.000038402886,0.00014741837,0.00075147045],"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.000017992426,0.00002288207,0.00021031593,0.000017922066,0.00011639821,0.000022639684,0.00048338072,0.000049180184,0.002309389,0.9866395,0.006757586,0.0033528288],"study_design_scores_gemma":[0.0005031241,0.00020020381,0.0007415672,0.00003704463,0.000020307227,0.00006723672,0.00016576501,0.000558385,0.012766458,0.929191,0.055434167,0.0003147713],"about_ca_topic_score_codex":0.000013588582,"about_ca_topic_score_gemma":0.000018067622,"teacher_disagreement_score":0.057448518,"about_ca_system_score_codex":0.000027351045,"about_ca_system_score_gemma":0.000019072722,"threshold_uncertainty_score":0.9658883},"labels":[],"label_agreement":null},{"id":"W2789570525","doi":"","title":"Simple 3-(q+1, 5, 3) designs admitting an automorphism group PSL(2, q) with q ≅ 1 (mod 4).","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; PSL; Simple (philosophy); Automorphism; Simple group; Automorphism group; Combinatorics; p-group; Discrete mathematics","score_opus":0.013461414608947434,"score_gpt":0.2171061277718867,"score_spread":0.20364471316293928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789570525","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.9901828,0.000086048894,0.0009170157,0.000007627621,0.0016018498,0.00022097325,0.000005330207,0.00092519535,0.0060531124],"genre_scores_gemma":[0.999363,0.000002293465,0.00031768534,0.000046507226,0.00006929051,0.00003907712,0.000016915703,0.00008070326,0.00006452942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872905,0.00009514317,0.00024419057,0.00027693744,0.00020789061,0.000446793],"domain_scores_gemma":[0.9991161,0.00006062827,0.000050554216,0.0005039583,0.000070908296,0.00019783167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037417962,0.0002479065,0.00024962248,0.00009338468,0.00021901996,0.00007290605,0.00029851033,0.00011922566,0.00011584833],"category_scores_gemma":[0.00001543883,0.00022994347,0.000049964434,0.00033693385,0.00010866397,0.0003276437,0.000027827606,0.00018678416,0.00015340807],"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.00007685007,0.00019017853,0.008591889,0.00010144612,0.00019556846,0.000066451474,0.0019075747,0.00026607554,0.01383944,0.96880037,0.0039086654,0.0020554864],"study_design_scores_gemma":[0.005729302,0.0038218023,0.019333927,0.00031022125,0.00018417733,0.00021048162,0.0014090397,0.04534468,0.040357005,0.85803443,0.022701364,0.0025635862],"about_ca_topic_score_codex":0.000026406684,"about_ca_topic_score_gemma":0.000026124988,"teacher_disagreement_score":0.110765964,"about_ca_system_score_codex":0.0000499963,"about_ca_system_score_gemma":0.000017124396,"threshold_uncertainty_score":0.9376823},"labels":[],"label_agreement":null},{"id":"W2790036744","doi":"10.1016/j.endm.2018.02.017","title":"New Constant Weight Codes and Packing Numbers","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Combinatorics; Constant (computer programming); Code (set theory); Binary code; Binary number; Discrete mathematics; Arithmetic; Computer science; Set (abstract data type)","score_opus":0.005941041425367322,"score_gpt":0.21918699064126726,"score_spread":0.21324594921589993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790036744","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.8583342,0.002465869,0.11564943,0.000072527,0.00030290306,0.0003421615,0.00000773686,0.00033806777,0.022487136],"genre_scores_gemma":[0.9965127,0.00010988476,0.0031202945,0.000012906567,0.000109137414,0.000007616275,0.0000023121652,0.00003606304,0.00008905123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989985,0.000025329142,0.00027057916,0.00014488817,0.0001138585,0.00044683766],"domain_scores_gemma":[0.9994716,0.00017970987,0.000039124763,0.00022867092,0.000011853813,0.00006906094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027729393,0.0001781737,0.00024373127,0.00007238842,0.000053314532,0.00004480871,0.00013349883,0.000076106815,0.00009520551],"category_scores_gemma":[0.000043545926,0.00015975366,0.000037176236,0.00018464454,0.00010224346,0.000084999345,0.000027445425,0.0001825511,0.00003150221],"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.000023613617,0.00002733464,0.0022932545,0.0004563313,0.00017590215,0.000011327094,0.006719261,0.00013864707,0.008626729,0.9721053,0.00047845853,0.008943835],"study_design_scores_gemma":[0.0012678005,0.00022921419,0.0001682015,0.00083759805,0.000077712175,0.00015587526,0.00095778715,0.05821368,0.040134273,0.89295787,0.004015057,0.0009849414],"about_ca_topic_score_codex":0.000018977567,"about_ca_topic_score_gemma":0.00026247394,"teacher_disagreement_score":0.13817857,"about_ca_system_score_codex":0.00006740126,"about_ca_system_score_gemma":0.000035796056,"threshold_uncertainty_score":0.65145653},"labels":[],"label_agreement":null},{"id":"W2790441935","doi":"","title":"Costas Cubes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Permutation (music); Mathematics; Order (exchange); Cube (algebra); Discrete mathematics; Physics","score_opus":0.005618808715518931,"score_gpt":0.19095043561900055,"score_spread":0.18533162690348162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790441935","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.023008756,0.000013342549,0.9105064,0.000013571115,0.0017483524,0.00013562625,0.000037120084,0.0005647051,0.06397207],"genre_scores_gemma":[0.99938107,0.000014829333,0.00006923078,0.000176173,0.000055388075,0.00003704967,0.00000397485,0.000011307924,0.00025099557],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942577,0.000040217186,0.00022915725,0.00004692285,0.000111085246,0.00014684543],"domain_scores_gemma":[0.99962366,0.0000528971,0.00002327055,0.00019507938,0.000051708594,0.000053381824],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025226263,0.00010940644,0.00008350028,0.00018912638,0.00016730605,0.000044204342,0.00009939058,0.00007035823,0.0006697886],"category_scores_gemma":[0.000002326173,0.000104363964,0.000060894676,0.00018911403,0.00007663463,0.0007656384,2.2576393e-7,0.00011950488,0.00291656],"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.00041327527,0.00009836657,0.0000046566597,0.00027258793,0.00036534856,0.0000014108955,0.017981058,0.1235227,0.0026892177,0.26628765,0.0067763245,0.5815874],"study_design_scores_gemma":[0.0021934074,0.00060133904,0.00013970268,0.00022573004,0.000117326934,0.000089222056,0.005683163,0.11034714,0.5858738,0.039826747,0.25353572,0.0013666924],"about_ca_topic_score_codex":0.0000014112608,"about_ca_topic_score_gemma":0.000002206663,"teacher_disagreement_score":0.9763723,"about_ca_system_score_codex":0.000036396483,"about_ca_system_score_gemma":0.000007385734,"threshold_uncertainty_score":0.9978598},"labels":[],"label_agreement":null},{"id":"W2790670964","doi":"","title":"P m ∪ P k -equicoverable paths and cycles.","year":2018,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006491125323273392,"score_gpt":0.20939201099883772,"score_spread":0.20290088567556433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790670964","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.9462205,0.0022812006,0.000016715636,0.00005584437,0.006321718,0.0001879674,0.000014669052,0.00019430008,0.04470709],"genre_scores_gemma":[0.99910605,0.00023085272,0.000031587235,0.000050114064,0.0000879784,0.000012460102,0.0000034988984,0.00005802479,0.00041944816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986921,0.00009258618,0.00028631496,0.0003109268,0.0001769065,0.00044117993],"domain_scores_gemma":[0.99917513,0.00008991015,0.000059209426,0.00043760182,0.000067515146,0.00017064405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034723373,0.00027730627,0.00032023934,0.00009345792,0.00021687863,0.00018575498,0.00020491713,0.00020886246,0.0001424261],"category_scores_gemma":[0.000036262907,0.00029644652,0.00007294706,0.00024496502,0.00018663515,0.00022528028,0.000088211615,0.00021478707,0.000529667],"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.000019536332,0.00005080519,0.008572976,0.0001991756,0.00010215364,0.000015756896,0.00054927636,0.0000058900955,0.0029820767,0.9832257,0.0025175312,0.0017591077],"study_design_scores_gemma":[0.0020818536,0.0005415216,0.018732987,0.00053322845,0.000110225206,0.000046541514,0.00024975324,0.0020694535,0.013040053,0.8794586,0.082193814,0.00094197347],"about_ca_topic_score_codex":0.000040498326,"about_ca_topic_score_gemma":0.0000018732611,"teacher_disagreement_score":0.10376712,"about_ca_system_score_codex":0.00004287056,"about_ca_system_score_gemma":0.000019674457,"threshold_uncertainty_score":0.99994874},"labels":[],"label_agreement":null},{"id":"W2791620683","doi":"","title":"Two-dimensional projective linear group and flag-transitive 4-(v, k, 2) Designs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flag (linear algebra); Mathematics; Projective test; Transitive relation; Projective linear group; Combinatorics; Group (periodic table); Classical group; General linear group; Pure mathematics; Discrete mathematics; Projective space; Collineation; Algebra over a field; Symmetric group; Lie group; Physics","score_opus":0.010761320979537196,"score_gpt":0.2217054107169741,"score_spread":0.21094408973743692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791620683","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.9916966,0.00023112043,0.00017047294,0.000010776275,0.0017563167,0.00027025235,0.0000071761533,0.00024818952,0.0056090807],"genre_scores_gemma":[0.9995175,0.000003840911,0.00027665755,0.000037412225,0.000050101065,0.000028095512,0.0000057348384,0.00003359412,0.000047090274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991548,0.000084711304,0.00016019863,0.00021777701,0.00013631949,0.00024620938],"domain_scores_gemma":[0.9995608,0.000088543,0.00002214196,0.00016649271,0.00007062279,0.00009144593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002622772,0.00017597713,0.0001861488,0.00007711522,0.00013071996,0.000021634243,0.00008756548,0.00008359317,0.00002614584],"category_scores_gemma":[0.000013487618,0.00017128086,0.00004315906,0.0001985654,0.00014502136,0.00014644701,0.000022747976,0.000151355,0.00007179513],"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.0001639719,0.00012281894,0.0013821053,0.00009991523,0.00030550337,0.0000475219,0.004491248,0.00020380477,0.059837513,0.9305857,0.0015320873,0.0012278458],"study_design_scores_gemma":[0.006523137,0.0015378084,0.008505044,0.000362049,0.00015032574,0.000178874,0.0011069546,0.036912996,0.1092167,0.83163476,0.0022223417,0.0016490364],"about_ca_topic_score_codex":0.000021211255,"about_ca_topic_score_gemma":0.000008766842,"teacher_disagreement_score":0.09895093,"about_ca_system_score_codex":0.00003066668,"about_ca_system_score_gemma":0.000011627444,"threshold_uncertainty_score":0.6984631},"labels":[],"label_agreement":null},{"id":"W2791709901","doi":"10.1016/j.laa.2018.01.031","title":"Sign patterns requiring a unique inertia","year":2018,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"Sign (mathematics); Inertia; Mathematics; Moment of inertia; Skew; Sylvester's law of inertia; Computer science; Mathematical analysis; Symmetric matrix; Physics; Classical mechanics","score_opus":0.009396808813619423,"score_gpt":0.2203461842629879,"score_spread":0.21094937544936848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791709901","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.87387973,0.000585395,0.115289,0.000106483574,0.0001242103,0.00048005214,0.00003147024,0.0005517634,0.008951879],"genre_scores_gemma":[0.9989208,0.000063326974,0.00018678045,0.000067896166,0.00034980572,0.00015954844,0.000011916403,0.000022693433,0.00021725986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995113,0.000014073382,0.00014624436,0.00013641026,0.000048284357,0.00014368686],"domain_scores_gemma":[0.9996572,0.000027094504,0.000017034066,0.00018929184,0.000036445796,0.00007293021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007799271,0.00009580068,0.000090210895,0.000049303173,0.00011232698,0.00002270991,0.000097332,0.000059087786,0.00006049161],"category_scores_gemma":[0.000004764334,0.000091884714,0.00002333818,0.0001572696,0.000030361887,0.00008152644,0.000020959515,0.00007994125,0.00016270799],"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.000019537205,0.00009080438,0.0021581003,0.00044712186,0.00016973865,0.0000029565217,0.0024092037,0.00026027,0.13111238,0.834376,0.0016639379,0.027289983],"study_design_scores_gemma":[0.0013470261,0.0003866345,0.00920123,0.00030342012,0.0001493738,0.000102195714,0.0008720198,0.1338508,0.24154206,0.040354554,0.5699924,0.0018982652],"about_ca_topic_score_codex":0.0000039372044,"about_ca_topic_score_gemma":0.000007947088,"teacher_disagreement_score":0.7940214,"about_ca_system_score_codex":0.000006563874,"about_ca_system_score_gemma":0.0000042711226,"threshold_uncertainty_score":0.37469497},"labels":[],"label_agreement":null},{"id":"W2792110981","doi":"","title":"Cayley graphs of a group of order 6n.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Order (exchange); Group (periodic table); Combinatorics; Pure mathematics; Graph; Chemistry; Business","score_opus":0.005739330684666146,"score_gpt":0.19573053425136738,"score_spread":0.18999120356670124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792110981","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.9868806,0.00022327946,0.000037738402,0.0000024408578,0.0020038811,0.000090332614,0.0000047376902,0.0000799481,0.010677039],"genre_scores_gemma":[0.99985456,0.000009585582,0.00005857457,0.0000047298086,0.0000071336513,0.0000072130306,0.0000021151238,0.000019632098,0.00003645864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993717,0.000032878037,0.00023833153,0.00009259753,0.00011809559,0.00014641558],"domain_scores_gemma":[0.9994957,0.000036157602,0.000048793947,0.00028263422,0.00009586082,0.000040888546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001820535,0.00009860146,0.0002056117,0.00008939404,0.000023509027,0.000003915048,0.00016238776,0.00006982468,0.00006023901],"category_scores_gemma":[0.000017774593,0.00009705965,0.00006211587,0.00039861642,0.00010668811,0.000059557427,0.000019252537,0.000064284584,0.000021605572],"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.000013205868,0.000050522038,0.0044472436,0.000119995086,0.000074753916,0.0000012310132,0.0005712162,0.000015254716,0.021425497,0.9721617,0.0008836314,0.00023573104],"study_design_scores_gemma":[0.0013099024,0.00041265847,0.009649917,0.00015742047,0.000042859,0.000006393033,0.0003006994,0.0006520986,0.08774379,0.89660984,0.0027925763,0.00032181919],"about_ca_topic_score_codex":0.000036204525,"about_ca_topic_score_gemma":0.0000085075335,"teacher_disagreement_score":0.07555185,"about_ca_system_score_codex":0.000007591441,"about_ca_system_score_gemma":0.000006000362,"threshold_uncertainty_score":0.39579776},"labels":[],"label_agreement":null},{"id":"W2792222475","doi":"","title":"Sporadic simple groups and block-transitive symmetric designs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Simple (philosophy); Block (permutation group theory); Combinatorics; Pure mathematics; Epistemology","score_opus":0.009348833800893632,"score_gpt":0.20148729052887798,"score_spread":0.19213845672798435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792222475","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.9920588,0.0005861346,0.0001531857,0.0000096081985,0.0013473593,0.00015929971,0.0000055549162,0.00025861716,0.0054214164],"genre_scores_gemma":[0.99981254,0.000026372909,0.000022244207,0.000027698607,0.000032728152,0.000011960199,0.000003980138,0.00003317684,0.000029298188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922,0.00005042876,0.00016906828,0.00017819228,0.00011731636,0.00026496185],"domain_scores_gemma":[0.9995304,0.00008449764,0.000022865152,0.00020337937,0.000044363886,0.00011451546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024449572,0.00016074495,0.000195371,0.00015773404,0.000112529175,0.000034853165,0.00011559544,0.00009179752,0.00002677055],"category_scores_gemma":[0.000017357654,0.00016379652,0.0000416363,0.00052092253,0.00010162165,0.00011661046,0.000015898318,0.000118197626,0.00007885329],"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.000029115407,0.000057321387,0.0042265286,0.0001105857,0.00014891666,0.000040123654,0.001697137,0.000029203413,0.0061825304,0.98249614,0.002699699,0.0022827098],"study_design_scores_gemma":[0.0020913137,0.00054587226,0.022259068,0.00008465273,0.00009555064,0.00009931659,0.0005986081,0.0047783763,0.026312442,0.93637955,0.00590286,0.00085240713],"about_ca_topic_score_codex":0.000014674314,"about_ca_topic_score_gemma":0.0000036533027,"teacher_disagreement_score":0.046116598,"about_ca_system_score_codex":0.00002726973,"about_ca_system_score_gemma":0.000006869249,"threshold_uncertainty_score":0.6679428},"labels":[],"label_agreement":null},{"id":"W2792309580","doi":"","title":"Decompositions Of λK v Into Multigraphs With Four Vertices And Five Edges.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006156090117232502,"score_gpt":0.19920060403076142,"score_spread":0.19304451391352892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792309580","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.99697113,0.0002927331,0.000099461344,0.00001257154,0.00060505327,0.000097760596,0.0000027908234,0.00008538143,0.0018331085],"genre_scores_gemma":[0.9995953,0.000014301157,0.00032556313,0.000007768501,0.000008375545,0.000012738196,0.0000016316205,0.000014610204,0.000019713465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995501,0.000025617343,0.00012457166,0.00010295594,0.00007560174,0.00012117634],"domain_scores_gemma":[0.99962884,0.00005755035,0.000026432324,0.00016579164,0.00006177181,0.000059600505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007762487,0.00009792477,0.00013798327,0.00007033736,0.00007765368,0.000015061916,0.00008942329,0.000045598146,0.000010386339],"category_scores_gemma":[0.0000070657666,0.00008662462,0.000024783414,0.00016892343,0.00013649132,0.00010563205,0.00001572531,0.000060716477,0.000010339437],"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.00017513621,0.00021985733,0.047325153,0.0006149399,0.00070771493,0.000024749252,0.014938222,0.00031214987,0.053553633,0.8756931,0.0025886,0.0038467639],"study_design_scores_gemma":[0.005744798,0.0019376804,0.08071594,0.0008463016,0.00027987277,0.00008470843,0.0027781203,0.011292989,0.17350547,0.7173761,0.0041694897,0.001268524],"about_ca_topic_score_codex":0.000045160563,"about_ca_topic_score_gemma":0.00004023113,"teacher_disagreement_score":0.15831698,"about_ca_system_score_codex":0.0000086295,"about_ca_system_score_gemma":0.0000055992787,"threshold_uncertainty_score":0.35324496},"labels":[],"label_agreement":null},{"id":"W2792677171","doi":"","title":"Face labelings of type (1, 1, 1) for generalized prism.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prism; Type (biology); Face (sociological concept); Combinatorics; Optics; Linguistics; Physics; Geology","score_opus":0.011717024611629483,"score_gpt":0.22818175632110635,"score_spread":0.21646473170947686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792677171","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.99402684,0.00027973592,0.00033795703,0.000011372589,0.0032781418,0.00019090778,0.0000045088677,0.00013343086,0.0017371251],"genre_scores_gemma":[0.99933064,0.000011628188,0.0003371195,0.0000152235925,0.000020448217,0.000015175556,0.0000058132655,0.000024735278,0.00023921813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994956,0.000016993921,0.00017085328,0.00009217512,0.000070103786,0.00015424204],"domain_scores_gemma":[0.99961853,0.000037511298,0.000031351254,0.00019506346,0.000079160185,0.00003836566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013830609,0.00008992599,0.00015714728,0.000038720846,0.000038250124,0.0000080724585,0.00013786796,0.00006072032,0.000013301097],"category_scores_gemma":[0.000028962093,0.00008938197,0.000045420693,0.00017571969,0.000038879556,0.000045948414,0.00001241475,0.00004198152,0.000035253255],"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.00008573244,0.000053695512,0.0009371392,0.00024574585,0.00015986443,9.306859e-7,0.0015427005,0.00018423404,0.034767684,0.9383271,0.022459002,0.0012361689],"study_design_scores_gemma":[0.003632983,0.0007341186,0.001000356,0.000105515086,0.00009962581,0.000005337354,0.0001627088,0.021782394,0.25999123,0.63196814,0.079869434,0.00064817077],"about_ca_topic_score_codex":0.0000045746847,"about_ca_topic_score_gemma":0.0000014342588,"teacher_disagreement_score":0.30635896,"about_ca_system_score_codex":0.000011750408,"about_ca_system_score_gemma":0.000007572188,"threshold_uncertainty_score":0.36448908},"labels":[],"label_agreement":null},{"id":"W2794297345","doi":"10.48550/arxiv.1803.04931","title":"A polynomial ideal associated to any $t$-$(v,k,\\lambda)$ design","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Regional Municipality of Waterloo","funders":"","keywords":"Ideal (ethics); Combinatorics; Degree (music); Lambda; Integer (computer science); Polynomial; Zero (linguistics); Mathematics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.05830396874456216,"score_gpt":0.1631413431870039,"score_spread":0.10483737444244175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794297345","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.89694893,0.00006275714,0.090839766,0.000013089199,0.0022128394,0.00063981465,0.00008345909,0.0009801015,0.008219261],"genre_scores_gemma":[0.99778366,0.000026008514,0.00013591719,0.00004545915,0.0002999456,0.0000036389954,0.000025838282,0.000078975994,0.0016005347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981016,0.0002502988,0.00027057886,0.00070468505,0.000093402545,0.00057943753],"domain_scores_gemma":[0.99860924,0.00010403754,0.00010769248,0.0007436371,0.00011272295,0.00032267108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005034912,0.00046208937,0.00050705776,0.00037466703,0.00013850657,0.00007742856,0.0007974384,0.00059264177,0.00013763024],"category_scores_gemma":[0.000054327083,0.0005808357,0.0002672586,0.0005697229,0.000084528525,0.00011575217,0.000384621,0.0005587523,0.0006358387],"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.00022242461,0.000083161714,0.0019491912,0.00015819074,0.00075975707,0.0003445407,0.00074452325,0.9417893,0.0010505907,0.0023510838,0.050424453,0.00012273334],"study_design_scores_gemma":[0.004330642,0.000864481,0.01342219,0.0017144068,0.0012193238,0.000031970507,0.0009808365,0.91514647,0.0071228067,0.029554112,0.019104159,0.006508588],"about_ca_topic_score_codex":0.000093635375,"about_ca_topic_score_gemma":0.0000633619,"teacher_disagreement_score":0.10083477,"about_ca_system_score_codex":0.0003993771,"about_ca_system_score_gemma":0.000082117294,"threshold_uncertainty_score":0.9996643},"labels":[],"label_agreement":null},{"id":"W2796905926","doi":"10.1007/978-3-319-77649-1_6","title":"Symmetric and Alternating Groups","year":2018,"lang":"en","type":"book-chapter","venue":"Springer undergraduate mathematics series","topic":"graph theory and CDMA systems","field":"Engineering","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":"Lakehead University","funders":"","keywords":"Alternating group; Symmetric group; Group (periodic table); Covering groups of the alternating and symmetric groups; Construct (python library); Mathematics; Combinatorics; Pure mathematics; Algebra over a field; Physics; Computer science; Non-abelian group; Cyclic group; Quantum mechanics","score_opus":0.012351659765640389,"score_gpt":0.19016376808017962,"score_spread":0.17781210831453922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796905926","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.00859319,0.0024256066,0.0015623419,0.00006654632,0.0011629277,0.00040463757,0.000028781315,0.0008748823,0.9848811],"genre_scores_gemma":[0.36064214,0.0038256194,0.007352573,0.000031815547,0.0011190503,0.00005399201,0.000031011823,0.00076939183,0.6261744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844915,0.000010840636,0.00055830885,0.0003272407,0.00030772158,0.0003467434],"domain_scores_gemma":[0.99901253,0.00010661282,0.00018454737,0.0005126871,0.000062588726,0.00012105593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026536733,0.00057500286,0.0006201867,0.00036229315,0.00013780687,0.0001814678,0.00025522299,0.00027205615,0.00012715058],"category_scores_gemma":[0.000025852822,0.00056644133,0.00014077939,0.00007589365,0.0002029977,0.00018070076,0.00013494957,0.0003409154,0.0002914723],"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.0000029591595,0.0000069323837,0.0000051106445,0.0017554972,0.00029265275,0.000021218344,0.00068063964,0.000022742142,0.000120817735,0.996064,0.0005096359,0.0005177734],"study_design_scores_gemma":[0.0001464735,0.000061001694,0.000003806865,0.00086992694,0.00012217721,0.00012379653,0.00014265235,0.0012103493,0.00049485225,0.9688839,0.027199987,0.0007411332],"about_ca_topic_score_codex":0.0000016198911,"about_ca_topic_score_gemma":0.0000149568905,"teacher_disagreement_score":0.35870668,"about_ca_system_score_codex":0.00005932636,"about_ca_system_score_gemma":0.000010520238,"threshold_uncertainty_score":0.99967873},"labels":[],"label_agreement":null},{"id":"W2798712513","doi":"","title":"Cayley graphs of order kp are hamiltonian for k < 48","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Lethbridge","funders":"","keywords":"Cayley graph; Hamiltonian (control theory); Combinatorics; Mathematics; Vertex-transitive graph; Graph; Discrete mathematics; Voltage graph; Line graph","score_opus":0.041426736460604296,"score_gpt":0.1623422025175337,"score_spread":0.1209154660569294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798712513","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.96146387,0.00017867655,0.02939142,0.0000059721297,0.0017469005,0.00056180987,0.00022700429,0.00031719072,0.0061071464],"genre_scores_gemma":[0.9983598,0.00008563835,0.00016122591,0.000010477294,0.00008969816,0.000003821523,0.00003386846,0.000056236127,0.001199244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884653,0.000055632594,0.00023897336,0.00048640682,0.000054397893,0.00031804031],"domain_scores_gemma":[0.99865675,0.000057030604,0.00017310708,0.00076879736,0.00022998167,0.00011434708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019917617,0.00032595653,0.00046884126,0.0003001161,0.00008044559,0.000019277342,0.0005730865,0.00040035887,0.00007244985],"category_scores_gemma":[0.000022221688,0.00038603877,0.00032195117,0.00040984206,0.00015310071,0.00008433184,0.00017312192,0.00028343886,0.000046898225],"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.00036348123,0.00023320255,0.02527799,0.005961121,0.0021280118,0.00015755942,0.0014995704,0.6636111,0.001318439,0.2860763,0.013062268,0.00031094885],"study_design_scores_gemma":[0.0052634715,0.00038114228,0.012498951,0.002934464,0.001625728,0.000021033933,0.0031620818,0.38134766,0.010471788,0.54587066,0.031615704,0.004807336],"about_ca_topic_score_codex":0.00005960045,"about_ca_topic_score_gemma":0.00013062978,"teacher_disagreement_score":0.28226346,"about_ca_system_score_codex":0.000066585286,"about_ca_system_score_gemma":0.000038305705,"threshold_uncertainty_score":0.99985915},"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":"W2801188728","doi":"10.48550/arxiv.1805.01557","title":"The genus of complete 3-uniform hypergraphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Hypergraph; Combinatorics; Conjecture; Genus; Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Botany; Biology","score_opus":0.04487078155628077,"score_gpt":0.15361377028163498,"score_spread":0.1087429887253542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801188728","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.96622133,0.0003659784,0.006555247,0.0000061097594,0.001466043,0.00025853506,0.00007994758,0.00023398339,0.024812823],"genre_scores_gemma":[0.9989177,0.0003728819,0.000025051702,0.0000055567434,0.000089233574,9.5170657e-7,0.0000128429165,0.000030963893,0.0005448392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990708,0.00007252582,0.00021894762,0.0002967005,0.00006229322,0.00027872884],"domain_scores_gemma":[0.99872786,0.000101009,0.000118993594,0.00087118737,0.000097650365,0.00008332019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002528423,0.00024810142,0.00029461837,0.00013502166,0.00016424782,0.000026839505,0.00082076027,0.00022011039,0.000035703302],"category_scores_gemma":[0.000009500059,0.0002243541,0.00026410172,0.00029616477,0.00029202094,0.000058061887,0.00027090602,0.00034774502,0.00007991285],"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.00015610836,0.00006619077,0.004443925,0.0009475199,0.0013984601,0.0001233426,0.00070877146,0.46514082,0.00081637804,0.5215565,0.003513366,0.001128597],"study_design_scores_gemma":[0.0016181913,0.00024191555,0.0043141074,0.000755434,0.0006709072,0.00003202265,0.0016975581,0.59382033,0.002333454,0.28735995,0.104903236,0.0022528993],"about_ca_topic_score_codex":0.000047608373,"about_ca_topic_score_gemma":0.000058763806,"teacher_disagreement_score":0.23419657,"about_ca_system_score_codex":0.00005386185,"about_ca_system_score_gemma":0.000024716397,"threshold_uncertainty_score":0.9148894},"labels":[],"label_agreement":null},{"id":"W2807776107","doi":"10.1515/9783110642094-006","title":"6. A new structure for difference matrices over abelian p-groups","year":2019,"lang":"en","type":"book-chapter","venue":"","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":"Simon Fraser University","funders":"","keywords":"Abelian group; Mathematics; Constructive; Difference set; Matrix (chemical analysis); Matrix difference equation; Pure mathematics; Group (periodic table); Elementary abelian group; Orthogonal group; Combinatorics; Algebra over a field; Discrete mathematics; Mathematical analysis; Computer science; Differential equation; Physics","score_opus":0.006773226661472054,"score_gpt":0.1838005664377263,"score_spread":0.17702733977625423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807776107","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.0020866804,0.00413243,0.012483889,0.00001717135,0.0033727004,0.001300455,0.00053318625,0.00073917775,0.9753343],"genre_scores_gemma":[0.061395455,0.000098751516,0.0005021495,0.000045647168,0.00054439326,0.0000071020427,0.00007015836,0.00013796774,0.9371984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991241,0.0000031709599,0.00024434854,0.00025740755,0.00014325873,0.00022770064],"domain_scores_gemma":[0.99938077,0.00006241594,0.000060787224,0.00038125124,0.000020359186,0.000094426876],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003343711,0.00038473474,0.00041207555,0.00013137906,0.000029195375,0.000056994817,0.00025892828,0.00045658436,0.0021281803],"category_scores_gemma":[0.000001813453,0.0003158913,0.00019216942,0.000022151435,0.000011713416,0.000053354775,0.000023352495,0.00022597231,0.00014370786],"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.000014139801,0.0000011202349,0.00001989946,0.0007096288,0.00019133656,0.0000020129326,0.000086825996,0.000112676316,0.00065278326,0.96739763,0.024740024,0.006071899],"study_design_scores_gemma":[0.0006626013,0.00008699037,0.00019323613,0.0004496546,0.00014552019,0.000014879215,0.000017467566,0.00096121524,0.0002533136,0.2807104,0.71537834,0.0011263727],"about_ca_topic_score_codex":0.000011878408,"about_ca_topic_score_gemma":0.00005265751,"teacher_disagreement_score":0.6906383,"about_ca_system_score_codex":0.00002969252,"about_ca_system_score_gemma":0.000023573444,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W2810681272","doi":"10.37236/7969","title":"Decomposable Twofold Triple Systems with Non-Hamiltonian 2-Block Intersection Graphs","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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; Memorial University of Newfoundland; Western Canada Research Grid; Compute Canada","keywords":"Bipartite graph; Combinatorics; Mathematics; Conjecture; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.006071709927877415,"score_gpt":0.19170719501893446,"score_spread":0.18563548509105704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810681272","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.9372506,0.015749259,0.029842576,0.00023590752,0.012218783,0.001001263,0.000010091881,0.0002596218,0.0034318855],"genre_scores_gemma":[0.9984025,0.0010103915,0.000005572911,0.000016173446,0.00029958703,0.00002634537,0.000004558809,0.000105200794,0.00012969734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974192,0.00024262222,0.0008599597,0.00022536707,0.00054198416,0.00071090256],"domain_scores_gemma":[0.99830735,0.000103032755,0.00064769597,0.0005239408,0.00024850696,0.00016945039],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012191064,0.00048053727,0.00086578104,0.000279876,0.00014674924,0.00017735161,0.0010433961,0.0002705032,0.000003950238],"category_scores_gemma":[0.000017109056,0.00033795668,0.00035832217,0.000593251,0.000057692716,0.00013482093,0.00011046338,0.0031776433,0.000010581347],"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.00087387906,0.00030177855,0.00068714056,0.0022277888,0.005056054,0.00016202922,0.0036947138,0.3609552,0.0024149122,0.6152267,0.008219228,0.00018058783],"study_design_scores_gemma":[0.00503077,0.0036767838,0.00028602767,0.002461462,0.0014634051,0.0032281042,0.002466226,0.047255483,0.0036672165,0.9124409,0.01620052,0.0018231298],"about_ca_topic_score_codex":0.000029922334,"about_ca_topic_score_gemma":0.000016111453,"teacher_disagreement_score":0.31369975,"about_ca_system_score_codex":0.0006964644,"about_ca_system_score_gemma":0.00036543186,"threshold_uncertainty_score":0.99990726},"labels":[],"label_agreement":null},{"id":"W2883424302","doi":"10.1016/j.laa.2020.07.034","title":"On the almost-principal minors of a symmetric matrix","year":2020,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Rank (graph theory); Invertible matrix; Sequence (biology); Mathematics; Matrix (chemical analysis); Order (exchange); Diagonal; Symmetric matrix; Field (mathematics); Physics; Pure mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.01800846087265949,"score_gpt":0.24117982441533778,"score_spread":0.2231713635426783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883424302","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.9632032,0.006819071,0.0071628825,0.0011496193,0.0004130663,0.002891465,0.00061461114,0.0004976376,0.017248457],"genre_scores_gemma":[0.99867696,0.0002474362,0.0001233983,0.000059075148,0.00017224897,0.00047880335,0.000048741862,0.000034862856,0.00015847474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991267,0.00003578447,0.000309621,0.0002491451,0.00013931321,0.00013948847],"domain_scores_gemma":[0.999123,0.00022610948,0.000085100306,0.00043890643,0.000043959117,0.000082958795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012882591,0.00020343564,0.00025992142,0.00011367972,0.00007669409,0.00002439342,0.0003308044,0.0001680957,0.000045247813],"category_scores_gemma":[0.000037981514,0.00015766548,0.000108709486,0.0003933615,0.00003827318,0.000016888032,0.00014179693,0.00041058936,0.00011212813],"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.000008453479,0.000032793057,0.000019104726,0.00056915585,0.00013493093,6.3185536e-7,0.00033493538,0.002298248,0.0008586952,0.99419093,0.00070453505,0.00084761396],"study_design_scores_gemma":[0.0010951293,0.00033797693,0.0022177417,0.00072510185,0.0007977874,0.00003410825,0.0010588577,0.41298836,0.033649247,0.40315315,0.14159794,0.002344587],"about_ca_topic_score_codex":0.0000056539784,"about_ca_topic_score_gemma":0.0000010393635,"teacher_disagreement_score":0.59103775,"about_ca_system_score_codex":0.000011032809,"about_ca_system_score_gemma":0.000016964872,"threshold_uncertainty_score":0.6429412},"labels":[],"label_agreement":null},{"id":"W2883701212","doi":"10.1080/03081087.2019.1570067","title":"The sepr-sets of sign patterns","year":2019,"lang":"en","type":"preprint","venue":"Linear and Multilinear Algebra","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sign (mathematics); Sequence (biology); Mathematics; Combinatorics; Order (exchange); Zero (linguistics); Matrix (chemical analysis); Pure mathematics; Mathematical analysis","score_opus":0.010571352513588326,"score_gpt":0.2306464952240878,"score_spread":0.2200751427104995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883701212","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.9891505,0.003727603,0.002348891,0.000032384363,0.0022066408,0.0006578426,0.00026399258,0.00022293106,0.0013891936],"genre_scores_gemma":[0.9980882,0.0008955784,0.00019149028,0.000019375937,0.00023166844,0.000029881707,0.000059391754,0.000068059024,0.0004163826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986694,0.00008364613,0.00046957933,0.00030086157,0.00019010987,0.00028638777],"domain_scores_gemma":[0.9988191,0.00022513379,0.00010418247,0.0006996543,0.00006581034,0.000086091786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037420308,0.0003254607,0.00044201806,0.000067541085,0.00007439841,0.000050339473,0.00034353838,0.0003297849,0.000026888581],"category_scores_gemma":[0.000032537406,0.0002391459,0.00019616894,0.000061998995,0.00008577264,0.00003695261,0.00023517832,0.0005881172,0.000052085717],"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.0010083921,0.0008021214,0.08373241,0.039984494,0.008028021,0.00014354139,0.024948614,0.403329,0.023036182,0.022528159,0.012263149,0.3801959],"study_design_scores_gemma":[0.0017898673,0.0001580503,0.012332601,0.0011708904,0.00026566233,0.000028066886,0.0010081375,0.91731316,0.02464695,0.0036843326,0.03605315,0.0015491109],"about_ca_topic_score_codex":0.000044624932,"about_ca_topic_score_gemma":0.000018218034,"teacher_disagreement_score":0.51398414,"about_ca_system_score_codex":0.000011734928,"about_ca_system_score_gemma":0.000023397268,"threshold_uncertainty_score":0.9752087},"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":"W2896540235","doi":"","title":"User-interactive wirelessly-communicating “smart” textiles made from multimaterial fibers","year":2016,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","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":"Human–computer interaction; Computer science; World Wide Web; Multimedia; Computer graphics (images)","score_opus":0.006933875100731779,"score_gpt":0.20400526000403713,"score_spread":0.19707138490330534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896540235","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.9863367,0.00005389989,0.0023334848,0.00006565071,0.0007373755,0.000111689435,0.000054873446,0.0005249913,0.009781308],"genre_scores_gemma":[0.99814504,0.000019408924,0.0010632914,0.000026204998,0.00011510087,0.000028414886,0.0000059051363,0.000038500304,0.00055813114],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992026,0.000078260506,0.00024117659,0.00016116782,0.00008538378,0.00023143149],"domain_scores_gemma":[0.9990898,0.00032490838,0.000052483898,0.00044720396,0.00001826836,0.00006735106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096383745,0.00016882137,0.00020676889,0.000043991164,0.00006614224,0.00004653503,0.0002942516,0.000082961895,0.0008153514],"category_scores_gemma":[0.000023770122,0.00011496394,0.000073995,0.000050697734,0.000047332767,0.00025501524,0.00006330396,0.00008516044,0.00040729978],"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.0000832607,0.000040177412,0.0043872623,0.000036153484,0.00023835344,0.000008552078,0.0014437466,0.0002144565,0.9731481,0.0027273386,0.0020868236,0.015585744],"study_design_scores_gemma":[0.0039431266,0.000079366735,0.04127395,0.0015450374,0.000080058686,0.000017728386,0.004812965,0.01779727,0.8932339,0.005211544,0.030267144,0.0017379157],"about_ca_topic_score_codex":0.00019600146,"about_ca_topic_score_gemma":0.000077036115,"teacher_disagreement_score":0.07991424,"about_ca_system_score_codex":0.00004174993,"about_ca_system_score_gemma":0.00000312955,"threshold_uncertainty_score":0.8927526},"labels":[],"label_agreement":null},{"id":"W28972128","doi":"10.1523/jneurosci.1188-17.2017","title":"Some equitably 2-colourable cycle decompositions of multipartite graphs","year":2006,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Quantum; Physics","score_opus":0.006941888503866154,"score_gpt":0.20829668525068254,"score_spread":0.2013547967468164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28972128","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.9669526,0.0011566317,0.0010937057,0.000023463806,0.00019560382,0.00028171594,0.000054250937,0.00035202043,0.029889992],"genre_scores_gemma":[0.9978025,0.0000074209447,0.0018803818,0.0000067909637,0.000025608742,0.00005435527,0.000009883809,0.000028155191,0.0001849276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897575,0.00003365388,0.00042996957,0.00012359628,0.00014445077,0.00029256725],"domain_scores_gemma":[0.9993986,0.00012248052,0.000048851885,0.00034304397,0.000031387877,0.000055632594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023535473,0.00015021143,0.00027584148,0.000115986026,0.00007469429,0.000018564626,0.00016009291,0.00006638238,0.00016161916],"category_scores_gemma":[0.000015776624,0.00014251177,0.00013642489,0.00020126237,0.000076535,0.00016362942,0.000021180504,0.00007798143,0.00015704703],"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.0000077191435,0.00022700637,0.00016046847,0.00072040356,0.0000814433,0.0000046595546,0.00044828528,0.0043451875,0.038702115,0.9526471,0.002490142,0.00016549633],"study_design_scores_gemma":[0.00039503342,0.000043006985,0.0008557604,0.00019969864,0.00006190345,0.000018303726,0.0002751295,0.036087077,0.022965418,0.9382336,0.0005934623,0.00027161033],"about_ca_topic_score_codex":0.000017614737,"about_ca_topic_score_gemma":0.0000069500716,"teacher_disagreement_score":0.031741887,"about_ca_system_score_codex":0.000017681044,"about_ca_system_score_gemma":0.0000057314624,"threshold_uncertainty_score":0.5811461},"labels":[],"label_agreement":null},{"id":"W2899909005","doi":"","title":"Bipartite graphs decomposable into closed trails","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.0068613893645562765,"score_gpt":0.2215488074583204,"score_spread":0.21468741809376413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899909005","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.9628911,0.00024586858,0.0011462747,0.000028125365,0.033673078,0.00018540357,0.0000012809118,0.000111940826,0.0017169239],"genre_scores_gemma":[0.99528825,0.000025944484,0.003345013,0.0000088190645,0.001270315,0.0000021615615,9.129061e-7,0.00005508129,0.0000034883178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977536,0.00007145148,0.0011600492,0.00016226471,0.0004712007,0.00038138867],"domain_scores_gemma":[0.99823743,0.00045130946,0.00045785654,0.00028010915,0.00028597622,0.0002873283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016701516,0.00032800544,0.0007619987,0.00026996425,0.00024890268,0.00024199433,0.0004429822,0.00023887084,0.000017405477],"category_scores_gemma":[0.00017354883,0.0002989633,0.00024311309,0.00036583995,0.00010745865,0.00027230242,0.00007450021,0.0008734589,0.000006768654],"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.00004247694,0.0002529971,0.00027414103,0.0003413057,0.00015436622,0.000025144924,0.0017832973,0.00014301752,0.03219246,0.96227974,0.00040401777,0.0021070126],"study_design_scores_gemma":[0.0031683843,0.00035072587,0.00012572626,0.00022666149,0.000092809045,0.000197356,0.00029468306,0.008496531,0.007038022,0.9763011,0.0032823246,0.0004256857],"about_ca_topic_score_codex":0.0000045014376,"about_ca_topic_score_gemma":0.0000014544489,"teacher_disagreement_score":0.032402765,"about_ca_system_score_codex":0.000029708794,"about_ca_system_score_gemma":0.00004989861,"threshold_uncertainty_score":0.99994624},"labels":[],"label_agreement":null},{"id":"W2901962989","doi":"10.1016/j.jctb.2018.10.006","title":"Deltas, extended odd holes and their blockers","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Combinatorics; Set (abstract data type); Clutter; Physics; Delta; Element (criminal law); Mathematics; Geometry; Telecommunications; Computer science; Law; Political science; Radar","score_opus":0.0047313300477104005,"score_gpt":0.19036915651607395,"score_spread":0.18563782646836355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901962989","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.98203665,0.0019522401,0.0008098532,0.00006235439,0.010891032,0.00009044368,0.0000067727938,0.000087108245,0.004063516],"genre_scores_gemma":[0.9983789,0.00012306028,0.000086272026,0.000020736834,0.0012805484,0.0000016380734,4.809041e-7,0.00002846197,0.000079936144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901825,0.00016708966,0.00038707492,0.00008312007,0.00013946262,0.00020499599],"domain_scores_gemma":[0.9992772,0.0001296815,0.00013565189,0.00017016748,0.00015975724,0.00012753786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096650206,0.00018490755,0.00032952733,0.00011749757,0.00012155172,0.00006481799,0.00021922667,0.000101855956,0.000064282875],"category_scores_gemma":[0.00007200613,0.00013942269,0.00010568388,0.00014135292,0.00036959656,0.00035166924,0.000029262603,0.00021778446,0.000006370861],"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.00091658783,0.000049661543,0.00010018597,0.000058824935,0.00033664677,0.000025046462,0.002745496,0.000019307958,0.013011216,0.9750633,0.0023917495,0.0052819583],"study_design_scores_gemma":[0.001102073,0.00074453314,0.00016251775,0.00010448424,0.00003753818,0.00038360676,0.0023937456,0.000034925353,0.045271993,0.89838266,0.051147077,0.0002348364],"about_ca_topic_score_codex":4.6111958e-7,"about_ca_topic_score_gemma":6.3102544e-7,"teacher_disagreement_score":0.07668065,"about_ca_system_score_codex":0.000023622162,"about_ca_system_score_gemma":0.000021821696,"threshold_uncertainty_score":0.5685492},"labels":[],"label_agreement":null},{"id":"W29035179","doi":"10.7812/tpp/16-183","title":"Vertex-neighbor-scattering number of graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Discrete mathematics; Graph","score_opus":0.005888634782495574,"score_gpt":0.21356273962100136,"score_spread":0.2076741048385058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29035179","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.95503324,0.00013931977,0.00007857004,0.0000043820555,0.0030778875,0.00007668948,0.0000023214945,0.00019026571,0.041397303],"genre_scores_gemma":[0.9998326,0.000008927767,0.000049475897,0.000012247064,0.0000056442827,0.0000046592336,0.0000026175476,0.00003104337,0.000052828243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917996,0.000017897264,0.00027819586,0.000114757764,0.00014273479,0.00026646387],"domain_scores_gemma":[0.9995128,0.00007080156,0.000035199686,0.00027093376,0.000032447315,0.000077810335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359552,0.00013418513,0.00019509395,0.0000780162,0.000035989306,0.00001016225,0.00017579594,0.00008578339,0.00008921962],"category_scores_gemma":[0.000008953845,0.00014175537,0.00008803153,0.00029087457,0.000044517445,0.000093379495,0.000020924925,0.00012049122,0.000098352706],"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.000010851735,0.000033078868,0.02516102,0.00010213547,0.000065578846,0.000012369904,0.0003069333,0.00003581364,0.013270398,0.95924044,0.0006857168,0.001075648],"study_design_scores_gemma":[0.00097616145,0.000042052485,0.032220203,0.0001286454,0.000029478757,0.00003931677,0.00022315212,0.00026629024,0.07053303,0.89244586,0.0026518772,0.0004439321],"about_ca_topic_score_codex":0.000013141,"about_ca_topic_score_gemma":0.0000026805317,"teacher_disagreement_score":0.06679459,"about_ca_system_score_codex":0.000022168704,"about_ca_system_score_gemma":0.0000041246085,"threshold_uncertainty_score":0.57806164},"labels":[],"label_agreement":null},{"id":"W2903758214","doi":"10.1016/j.disc.2019.05.021","title":"Constructions of optimal orthogonal arrays with repeated rows","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Mathematics; Hadamard matrix; Conjecture; Combinatorics; Modulo; Hadamard transform; Row; Matrix (chemical analysis); Construct (python library); Order (exchange); Block (permutation group theory); Orthogonal array; Discrete mathematics; Computer science","score_opus":0.004278981230616464,"score_gpt":0.17707261635291874,"score_spread":0.17279363512230228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903758214","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.9252033,0.000027317445,0.022580763,0.000003743001,0.000119450204,0.00018258934,0.000026698615,0.00013190495,0.051724207],"genre_scores_gemma":[0.9862836,0.0000023612909,0.013408472,0.0000018931842,0.000014630161,0.000009759207,0.000010747313,0.000026839061,0.0002417236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938416,0.000012024846,0.00024707252,0.00008848919,0.00013239676,0.00013585045],"domain_scores_gemma":[0.999544,0.0000381398,0.00006171945,0.0002813074,0.000034660734,0.000040120405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009868872,0.0001186251,0.00022418873,0.000052975498,0.000022792063,0.000012670791,0.00009340114,0.000047631653,0.00018754334],"category_scores_gemma":[0.000006158079,0.00009184944,0.000059444093,0.00014776006,0.0000581713,0.000065390705,0.000010323079,0.00008552866,0.000058113368],"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.00005827591,0.0001067213,0.005462346,0.0028363008,0.00077533256,0.000015418007,0.008124581,0.1318192,0.041914597,0.8080753,0.0004104286,0.00040151182],"study_design_scores_gemma":[0.0059516323,0.0011433766,0.0024978942,0.0036550688,0.00075939676,0.0016021446,0.04868767,0.72877663,0.14083181,0.05850094,0.0041367062,0.0034567264],"about_ca_topic_score_codex":7.6392826e-7,"about_ca_topic_score_gemma":0.0000012462569,"teacher_disagreement_score":0.74957436,"about_ca_system_score_codex":0.000007786771,"about_ca_system_score_gemma":0.000009009511,"threshold_uncertainty_score":0.37455115},"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":"W2911394913","doi":"10.1007/s00373-008-0799-3","title":"Silver Cubes","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Prime power; Vertex (graph theory); Neighbourhood (mathematics); Algebraic number; Discrete mathematics; Graph; Prime (order theory)","score_opus":0.008022328700756318,"score_gpt":0.1595524250601304,"score_spread":0.1515300963593741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911394913","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.9832342,0.0024286292,0.00008146586,0.00000640263,0.0006302605,0.00005012339,0.0000019817523,0.0002540822,0.01331281],"genre_scores_gemma":[0.9990415,0.0006569339,0.000008453782,0.000017204045,0.000010261068,0.000008103144,0.0000013798664,0.000013713381,0.00024245714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958277,0.000010907512,0.00009584283,0.000086392254,0.000080112724,0.00014399375],"domain_scores_gemma":[0.9997693,0.000017756327,0.00000870367,0.00012239453,0.000015569449,0.000066304354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050833627,0.00009569835,0.0001099849,0.00006307048,0.00011074202,0.000011161846,0.00006439667,0.00005400482,0.000010757896],"category_scores_gemma":[0.0000025358033,0.00008988084,0.000041977975,0.00021007983,0.000045506953,0.000064285865,0.000010964609,0.00008237445,0.000014383366],"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.000003923352,0.000039346676,0.029291978,0.000072773575,0.000049290764,0.000040919553,0.00067722466,0.000078049714,0.00065778336,0.96193624,0.006350771,0.0008017083],"study_design_scores_gemma":[0.0015549818,0.00018961713,0.055285532,0.000052569805,0.000041541585,0.00035511656,0.0004542955,0.0060147485,0.0033689549,0.8530667,0.07860306,0.0010129198],"about_ca_topic_score_codex":0.0000040965842,"about_ca_topic_score_gemma":4.74e-7,"teacher_disagreement_score":0.10886957,"about_ca_system_score_codex":0.000005313457,"about_ca_system_score_gemma":0.0000027164142,"threshold_uncertainty_score":0.36652344},"labels":[],"label_agreement":null},{"id":"W2911989380","doi":"10.1016/j.tcs.2006.06.021","title":"Coloring octrees","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Octree; Partition (number theory); Unit cube; Cube (algebra); Mathematics; Combinatorics; Computer science; Hypercube; Algorithm","score_opus":0.003326963702036951,"score_gpt":0.1764818607435589,"score_spread":0.17315489704152195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911989380","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.68378365,0.000049405626,0.26316306,0.000024295594,0.0007689727,0.000062412284,7.804354e-7,0.0004252695,0.051722147],"genre_scores_gemma":[0.99720824,7.2449814e-7,0.002548923,0.00002220043,0.00019790386,0.00000373306,3.1945288e-7,0.0000075139556,0.000010472228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991719,0.00001868978,0.0001271156,0.00016797692,0.00020670463,0.0003076104],"domain_scores_gemma":[0.9996267,0.000059992803,0.000008026533,0.00020820819,0.000025443464,0.000071616014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043917837,0.00008934464,0.00009379886,0.000077580844,0.0001388826,0.00009632112,0.00039305902,0.000024970013,0.000043842938],"category_scores_gemma":[0.000005115573,0.000075827826,0.000030401943,0.00041414853,0.0010103018,0.00013772708,0.00006216601,0.000077665754,0.000089194145],"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.0000013268075,0.0000065384506,0.00012308087,0.000005992017,0.0000011740699,0.000003895341,0.00003626585,0.00502326,0.0032765511,0.9895863,0.00006672277,0.0018689227],"study_design_scores_gemma":[0.00016833573,0.000062097795,0.0038401466,0.000034494675,0.0000049511123,0.00003686139,0.000011242123,0.5448751,0.035568323,0.4141628,0.00093329,0.00030234724],"about_ca_topic_score_codex":0.000001950666,"about_ca_topic_score_gemma":6.1305616e-7,"teacher_disagreement_score":0.5754235,"about_ca_system_score_codex":0.00002278596,"about_ca_system_score_gemma":0.000007026494,"threshold_uncertainty_score":0.37224987},"labels":[],"label_agreement":null},{"id":"W2912680787","doi":"10.1016/j.tcs.2003.06.004","title":"Packing arrays","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Alphabet; Upper and lower bounds; Row; Packing problems; Row and column spaces; Set (abstract data type); Equivalence (formal languages); Matching (statistics); Class (philosophy); Discrete mathematics; Computer science","score_opus":0.005519304663409126,"score_gpt":0.19487625343632034,"score_spread":0.1893569487729112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912680787","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.28266567,0.000022159567,0.70268893,0.000046504138,0.0006571916,0.000050302704,4.7280665e-7,0.00030843297,0.0135603305],"genre_scores_gemma":[0.9926018,0.000001460688,0.0071889614,0.00007268386,0.00012234808,0.0000025838056,1.9995953e-7,0.00000873539,0.0000012385924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913806,0.0000145304475,0.000118519594,0.00018060002,0.00022477524,0.00032349615],"domain_scores_gemma":[0.99954814,0.000031221276,0.000008165105,0.00025487845,0.000026464822,0.00013115817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004973203,0.00009485189,0.00009628234,0.00007450091,0.00015090768,0.000095715084,0.00043964808,0.000027263106,0.00003274233],"category_scores_gemma":[0.000010709974,0.000079219004,0.00003478786,0.00044539358,0.0011055348,0.00016447136,0.000060079812,0.000107075306,0.00013822025],"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.000001041565,0.00000610256,0.000010951782,0.000006700319,0.0000018445463,0.000005110538,0.00028599313,0.01692516,0.0031195316,0.9768834,0.000005099354,0.0027490475],"study_design_scores_gemma":[0.0002455756,0.000064272,0.000307883,0.00006454773,0.0000037242528,0.00005531897,0.000022612207,0.09109101,0.03669578,0.87103266,0.00016225828,0.00025436704],"about_ca_topic_score_codex":5.192024e-7,"about_ca_topic_score_gemma":1.644477e-7,"teacher_disagreement_score":0.70993614,"about_ca_system_score_codex":0.000037476846,"about_ca_system_score_gemma":0.000014697256,"threshold_uncertainty_score":0.40733892},"labels":[],"label_agreement":null},{"id":"W2914098655","doi":"10.1016/j.jctb.2008.06.009","title":"Lehman matrices","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Matrix (chemical analysis); Integer (computer science); Integer matrix; Class (philosophy); Complex matrix; Pure mathematics; Discrete mathematics; Nonnegative matrix; Symmetric matrix; Physics; Eigenvalues and eigenvectors; Computer science; Materials science","score_opus":0.006861563315849809,"score_gpt":0.18614867137685437,"score_spread":0.17928710806100456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914098655","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.96563864,0.0022828425,0.00036085918,0.000023713093,0.014075468,0.00006555691,0.0000022799475,0.00010218009,0.017448436],"genre_scores_gemma":[0.99827135,0.00035951106,0.00007013677,0.000010360771,0.00097632915,0.0000014493221,3.8833437e-7,0.000024625086,0.00028584246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989698,0.00013230288,0.00043436803,0.000054869,0.00023407476,0.0001746122],"domain_scores_gemma":[0.9993865,0.00011329126,0.00014497108,0.000148789,0.00010695347,0.00009949367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634288,0.00013906926,0.00030582567,0.00013770348,0.00011362555,0.000023724764,0.0002726818,0.0000831302,0.00011898515],"category_scores_gemma":[0.000051782816,0.0001172378,0.0001597829,0.00019471443,0.00009893726,0.00048420855,0.000015621343,0.000236003,0.000020692916],"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.0005708763,0.00006463768,0.00042252688,0.00007073672,0.00021757341,0.00025726625,0.0016086048,0.0006495291,0.0035149078,0.9862078,0.0058067427,0.000608813],"study_design_scores_gemma":[0.0016458023,0.0006192409,0.00050919154,0.0000995867,0.00005684654,0.0024904308,0.0008900083,0.000018928677,0.019182628,0.84516525,0.12894846,0.00037359],"about_ca_topic_score_codex":4.8580716e-7,"about_ca_topic_score_gemma":1.2087222e-7,"teacher_disagreement_score":0.1410425,"about_ca_system_score_codex":0.000031100433,"about_ca_system_score_gemma":0.00002622847,"threshold_uncertainty_score":0.47808188},"labels":[],"label_agreement":null},{"id":"W2917622917","doi":"10.1145/3313880.3313889","title":"The SAT+CAS paradigm and the Williamson conjecture","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Conjecture; Preprint; Construct (python library); Symbolic computation; Set (abstract data type); Order (exchange); Satisfiability; Computer science; Computation; Mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics; Algorithm; Programming language","score_opus":0.009385561501334055,"score_gpt":0.22276111223814815,"score_spread":0.2133755507368141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917622917","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.95312023,0.022791123,0.0050386763,0.012404392,0.0010443083,0.0012180608,0.000006913852,0.00034056956,0.004035734],"genre_scores_gemma":[0.99765193,0.0010569422,0.0009562815,0.00018668013,0.000038849237,0.000054051052,0.0000070436754,0.000015531603,0.000032663593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991787,0.0002721999,0.00021772138,0.0001017937,0.00007212057,0.00015747883],"domain_scores_gemma":[0.9954531,0.0016625047,0.00003260245,0.002816964,0.000011255661,0.00002356419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000537843,0.00011428718,0.00014975389,0.000037031707,0.00022852333,0.00010942655,0.0016559137,0.00005713113,0.0000050784256],"category_scores_gemma":[0.00001733358,0.00006859902,0.000045424098,0.00019379893,0.000246569,0.000077455,0.00044515906,0.00033389777,0.00005918889],"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.000019483943,0.000022672859,0.007781253,0.00003609254,0.00012844967,8.5102135e-7,0.0050369147,0.0036378014,0.000026752026,0.9468053,0.001776409,0.03472802],"study_design_scores_gemma":[0.0027411135,0.000051531006,0.038739916,0.00017556449,0.000034334575,0.000089463225,0.00039912385,0.33873636,0.000053145206,0.41991398,0.198573,0.0004925079],"about_ca_topic_score_codex":0.000018145063,"about_ca_topic_score_gemma":0.000093246905,"teacher_disagreement_score":0.52689135,"about_ca_system_score_codex":0.000020610021,"about_ca_system_score_gemma":0.0000068491727,"threshold_uncertainty_score":0.3077127},"labels":[],"label_agreement":null},{"id":"W2917625227","doi":"","title":"Packing and Covering Complete Bipartite Multidigraphs with 6-circuits.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Electronic circuit; Combinatorics; Electrical engineering; Engineering; Graph","score_opus":0.006993839577240863,"score_gpt":0.18290169322766686,"score_spread":0.175907853650426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917625227","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.9949439,0.0001522331,0.00008640669,0.000007905705,0.0015333496,0.00013865471,0.0000061543656,0.00030973824,0.0028216431],"genre_scores_gemma":[0.9998211,0.000013057918,0.00006267852,0.000013960187,0.000011522743,0.000018781859,0.0000035857558,0.00003906223,0.00001624726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925935,0.00002037757,0.00015303055,0.0001752526,0.00012238526,0.00026962138],"domain_scores_gemma":[0.99949664,0.00006619444,0.000029992281,0.00026462373,0.000028161043,0.00011438338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016627449,0.00017223539,0.00018949092,0.000081097154,0.00011477688,0.000069037065,0.00011582493,0.00007443185,0.0000151632275],"category_scores_gemma":[0.000011120296,0.00015897269,0.00003304515,0.00019620982,0.00007934165,0.00016868966,0.0000216671,0.0002755266,0.000020471105],"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.000011806459,0.00003390542,0.06988427,0.00016308004,0.00012701147,0.000031725438,0.0010825421,0.00022475356,0.24276021,0.6838456,0.00012983724,0.0017052648],"study_design_scores_gemma":[0.014228954,0.0008615439,0.25788194,0.0010801767,0.00031176256,0.0007986842,0.0017132687,0.041335274,0.10260442,0.49854195,0.07518581,0.005456196],"about_ca_topic_score_codex":0.000018116905,"about_ca_topic_score_gemma":0.000038365353,"teacher_disagreement_score":0.18799767,"about_ca_system_score_codex":0.000007864909,"about_ca_system_score_gemma":0.0000053900426,"threshold_uncertainty_score":0.6482718},"labels":[],"label_agreement":null},{"id":"W2918178814","doi":"","title":"Perfect 3-colorings of the Johnson graphs J(4, 2), J(5, 2), J(6, 2) and Petersen graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Petersen graph; Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.005587126409057125,"score_gpt":0.18520435595357926,"score_spread":0.17961722954452214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918178814","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.98664665,0.000352018,0.0000023288148,0.000018573344,0.00208866,0.00016818751,0.0000033823299,0.00012720758,0.010593007],"genre_scores_gemma":[0.99981105,0.00004922889,0.000012627265,0.000016396174,0.0000068739237,0.000013597551,5.405708e-7,0.000024989044,0.00006467856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923384,0.000062734674,0.00019366547,0.00014994066,0.00014465716,0.00021513205],"domain_scores_gemma":[0.9994498,0.00005668245,0.000046247693,0.00034302723,0.000044891225,0.000059362777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022943002,0.00015060348,0.00018954164,0.00008872185,0.00012430894,0.000021388842,0.00022267259,0.00007822452,0.00001632964],"category_scores_gemma":[0.000019189409,0.00011603759,0.0000995469,0.00036031255,0.0002477323,0.00009188289,0.000051580773,0.00013177178,0.000012063996],"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.000023711369,0.00003230003,0.015172861,0.0001375797,0.000112885806,0.0000023501975,0.0012460381,0.000014350792,0.023499623,0.95789665,0.0013842146,0.00047745073],"study_design_scores_gemma":[0.0013554316,0.00040840762,0.08978393,0.00020346846,0.00008858058,0.00004024987,0.00033448217,0.00038037173,0.07683954,0.82094395,0.009109379,0.0005121983],"about_ca_topic_score_codex":0.000024736279,"about_ca_topic_score_gemma":0.000009569129,"teacher_disagreement_score":0.13695267,"about_ca_system_score_codex":0.000012925955,"about_ca_system_score_gemma":0.0000066271696,"threshold_uncertainty_score":0.47318757},"labels":[],"label_agreement":null},{"id":"W2919154739","doi":"","title":"Group divisible designs with block size 4 and number of groups 2 or 3.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Group (periodic table); Combinatorics; Arithmetic; Computer science; Chemistry","score_opus":0.009805692926298095,"score_gpt":0.21445261662301787,"score_spread":0.20464692369671977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919154739","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.9939155,0.00006249885,0.000058808946,0.0000043394493,0.00064554217,0.00012801168,0.0000027616763,0.00012474418,0.00505782],"genre_scores_gemma":[0.99955034,0.000010053966,0.00021781579,0.000009760582,0.000016091313,0.000013902206,7.84797e-7,0.000030664258,0.0001506106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935794,0.00003667743,0.00015997242,0.00013538719,0.00011755466,0.00019249353],"domain_scores_gemma":[0.9994973,0.00013222138,0.000033248634,0.00022363411,0.000041811556,0.00007179276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016360368,0.00013600585,0.00020120948,0.000027268223,0.000058541696,0.000019749585,0.00011127766,0.00006559571,0.000086716966],"category_scores_gemma":[0.00001731336,0.00010424342,0.000023810651,0.00023295092,0.0001137591,0.00010502284,0.000024228784,0.000075671414,0.000029988805],"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.00020845265,0.00012348677,0.04392139,0.00029689595,0.00022942902,0.000023240062,0.0014840257,0.000012817134,0.011238798,0.9408055,0.0013396052,0.00031635762],"study_design_scores_gemma":[0.00862826,0.0028193835,0.06552251,0.0007628965,0.00023899367,0.0004232588,0.0012169919,0.001211612,0.05671271,0.85549235,0.0052508144,0.0017202032],"about_ca_topic_score_codex":0.000013209539,"about_ca_topic_score_gemma":0.000012402796,"teacher_disagreement_score":0.085313134,"about_ca_system_score_codex":0.000011047253,"about_ca_system_score_gemma":0.0000067094666,"threshold_uncertainty_score":0.42509234},"labels":[],"label_agreement":null},{"id":"W2919880351","doi":"","title":"On The Genus Two Characterizations Of Unit, Unitary Cayley And Co-Maximal Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Unitary state; Genus; Unit (ring theory); Combinatorics; Discrete mathematics; Graph; Botany","score_opus":0.010531919674189488,"score_gpt":0.21468622263424525,"score_spread":0.20415430296005577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919880351","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.9918948,0.0000691127,0.00000926933,0.000029963418,0.00096655113,0.00012914289,0.000022200296,0.00007843842,0.006800526],"genre_scores_gemma":[0.99984896,0.000015303527,0.00000441907,0.000043784155,0.000011368226,0.000011973887,0.000011929094,0.000019402045,0.000032832595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945486,0.000070909926,0.00014935863,0.00009327565,0.00009256366,0.00013906317],"domain_scores_gemma":[0.9994903,0.00012005389,0.00003210409,0.00026137245,0.000049831353,0.00004633735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017911148,0.00010795793,0.0001232572,0.000077618104,0.00012348447,0.000015272375,0.0001386676,0.000042512336,0.000047800466],"category_scores_gemma":[0.000020289077,0.00008617881,0.00003004612,0.00025142005,0.00014968283,0.000062073756,0.000016561184,0.000105411935,0.000027211154],"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.000010313785,0.000023532668,0.002897528,0.000018695742,0.000047753252,0.000001941808,0.000547424,0.000010677509,0.0039264397,0.9918696,0.0004289422,0.00021714786],"study_design_scores_gemma":[0.0015900871,0.00049969024,0.04963028,0.00017026423,0.00006880916,0.00002746227,0.00058870617,0.0020064095,0.04357275,0.89541835,0.005885613,0.0005416074],"about_ca_topic_score_codex":0.000018510314,"about_ca_topic_score_gemma":0.0000046558694,"teacher_disagreement_score":0.09645128,"about_ca_system_score_codex":0.000006240075,"about_ca_system_score_gemma":0.000007163931,"threshold_uncertainty_score":0.35142696},"labels":[],"label_agreement":null},{"id":"W2920179048","doi":"","title":"On k-resonance of plane 4-8 lattices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Plane (geometry); Resonance (particle physics); Geometry; Physics; Atomic physics","score_opus":0.006982278443218453,"score_gpt":0.20200534809098328,"score_spread":0.19502306964776484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920179048","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.96667254,0.00026304784,0.0000057642055,0.000005739551,0.0023472935,0.000059870465,0.0000053811086,0.000112884656,0.030527502],"genre_scores_gemma":[0.99979633,0.00000686481,0.000013557279,0.000016847129,0.000014308369,0.0000049552877,0.0000016393745,0.000015542737,0.00012992774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995271,0.000019382183,0.00013234,0.00008514326,0.000102104415,0.00013392327],"domain_scores_gemma":[0.99962777,0.00006345834,0.000023849601,0.00022330969,0.000025883615,0.00003572565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110677705,0.00008342532,0.00012521759,0.000041480147,0.000028632981,0.0000061465485,0.00013477214,0.000051722418,0.00007163396],"category_scores_gemma":[0.000014195376,0.00008075465,0.000029258905,0.00013053369,0.00005408724,0.000041446943,0.000009617244,0.000068386646,0.00019289157],"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.000016443682,0.000027099157,0.0005573125,0.00003866235,0.000019302883,0.0000028046102,0.00023156738,0.00003135429,0.0020950974,0.9924292,0.0038095585,0.0007416032],"study_design_scores_gemma":[0.0013413044,0.0005312967,0.007914627,0.00024472296,0.000019366109,0.000007107209,0.00007101107,0.0014057887,0.109765306,0.8512044,0.027099714,0.00039533857],"about_ca_topic_score_codex":0.0000053327008,"about_ca_topic_score_gemma":0.0000021533335,"teacher_disagreement_score":0.14122477,"about_ca_system_score_codex":0.000010769709,"about_ca_system_score_gemma":0.0000037209948,"threshold_uncertainty_score":0.32930794},"labels":[],"label_agreement":null},{"id":"W2920387528","doi":"","title":"The degree sequence of the graph with cyclomatic number less than four.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Degree (music); Graph; Sequence (biology); Discrete mathematics; Computer science; Programming language; Software","score_opus":0.0243412446848802,"score_gpt":0.2135070677587121,"score_spread":0.1891658230738319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920387528","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.98485583,0.00007245651,0.00003404727,0.000037468682,0.0018044583,0.00017603065,0.0000028636346,0.00008293947,0.012933889],"genre_scores_gemma":[0.99977326,0.000008238073,0.00001971076,0.000009968247,0.000012716452,0.000023454057,3.7548708e-7,0.00002368971,0.00012855776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921775,0.00008832485,0.00017640153,0.00010042224,0.00020235886,0.00021472297],"domain_scores_gemma":[0.99915385,0.000119380624,0.00006197474,0.000560854,0.000065823,0.000038095503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027357883,0.00012960653,0.00013679353,0.000016097778,0.00021715766,0.000029027913,0.0004624846,0.0000499526,0.000008151616],"category_scores_gemma":[0.000017291264,0.00006832308,0.000064837266,0.0003402746,0.00030596546,0.00007099409,0.00003439876,0.00012283654,0.000030067753],"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.000018435214,0.000019962616,0.036406312,0.00008014571,0.00013562501,0.000003528698,0.000934491,0.000058168796,0.0016907268,0.95911187,0.0007833898,0.00075733877],"study_design_scores_gemma":[0.0008110818,0.00011688874,0.04306362,0.00035689573,0.0000639431,0.00008532319,0.00087854866,0.00091467483,0.014837296,0.93698967,0.0015166437,0.00036540077],"about_ca_topic_score_codex":0.000033567576,"about_ca_topic_score_gemma":0.00008698816,"teacher_disagreement_score":0.02212219,"about_ca_system_score_codex":0.000017255239,"about_ca_system_score_gemma":0.000014589749,"threshold_uncertainty_score":0.27861345},"labels":[],"label_agreement":null},{"id":"W2920454506","doi":"","title":"The pancyclic properties of d-ary n-dimensional cube.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cube (algebra); Pure mathematics; Combinatorics","score_opus":0.009062265075893937,"score_gpt":0.1860738171771643,"score_spread":0.17701155210127037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920454506","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.9906334,0.0014674121,0.0000012822785,0.00003089781,0.0032656942,0.000095743635,0.0000011237403,0.00010314184,0.0044012726],"genre_scores_gemma":[0.9997158,0.000015901986,0.0000058309424,0.000014759252,0.000021754176,0.000014639052,5.819447e-7,0.00001679506,0.0001939039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994032,0.000042849748,0.00017917361,0.00007870836,0.00013114625,0.00016495529],"domain_scores_gemma":[0.99957544,0.00004338343,0.000026505744,0.00025523605,0.000056480992,0.00004295199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020285067,0.00008998082,0.000112447386,0.000025241938,0.00013348364,0.000013165948,0.00017267796,0.00004541216,0.000016634902],"category_scores_gemma":[0.000026646107,0.000059535498,0.00004661612,0.000121874444,0.00015788978,0.00005901738,0.000027742039,0.00007784205,0.000080162274],"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.000047678917,0.0000511903,0.0011365304,0.000095859665,0.00014726966,0.0000026299103,0.0008478699,0.00006762241,0.0937781,0.8935676,0.008803233,0.0014543748],"study_design_scores_gemma":[0.0009797649,0.00026415478,0.0038851954,0.0002914782,0.00003609282,0.000022048187,0.00036597476,0.0037075707,0.4146424,0.54461694,0.03073268,0.00045568586],"about_ca_topic_score_codex":0.000007029331,"about_ca_topic_score_gemma":0.0000030747951,"teacher_disagreement_score":0.34895068,"about_ca_system_score_codex":0.000011134831,"about_ca_system_score_gemma":0.000011921722,"threshold_uncertainty_score":0.24277872},"labels":[],"label_agreement":null},{"id":"W2920649362","doi":"","title":"Hamilton Cycles in n-Extendable Bipartite Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Discrete mathematics; Graph","score_opus":0.007572838735499005,"score_gpt":0.20994394999402358,"score_spread":0.20237111125852458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920649362","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.9778398,0.00038237372,0.000007469196,0.000009980758,0.0029604617,0.00010965716,0.0000024534002,0.0002751252,0.018412655],"genre_scores_gemma":[0.9997139,0.0000352705,0.000022066559,0.000023150074,0.00001536588,0.000024203222,0.0000029355708,0.00002966578,0.00013345646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991595,0.00004280163,0.00021182247,0.00015998857,0.0001109466,0.000314931],"domain_scores_gemma":[0.9995638,0.000030983683,0.000020503174,0.00028765382,0.000027649026,0.00006938717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024193771,0.00014038922,0.00017341803,0.00015997382,0.000061651226,0.000030255715,0.0001774275,0.00008504671,0.000059226913],"category_scores_gemma":[0.000009968152,0.00014397211,0.000050925653,0.000452311,0.000076597215,0.00015142481,0.000016513659,0.00012573876,0.00031025062],"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.0000168416,0.000067182336,0.020307483,0.00006095605,0.000039018872,0.000018989826,0.001181644,0.00019766756,0.0063454555,0.9667765,0.0040606735,0.0009276174],"study_design_scores_gemma":[0.0010244913,0.00012215298,0.027884567,0.00012497818,0.000011185598,0.000010033606,0.00016466819,0.0033685237,0.02156075,0.9234935,0.021788975,0.00044615899],"about_ca_topic_score_codex":0.000036667567,"about_ca_topic_score_gemma":0.00004893065,"teacher_disagreement_score":0.043282956,"about_ca_system_score_codex":0.000029548879,"about_ca_system_score_gemma":0.0000056932286,"threshold_uncertainty_score":0.5871012},"labels":[],"label_agreement":null},{"id":"W2921963619","doi":"10.1007/s10472-019-09681-3","title":"The SAT+CAS method for combinatorial search with applications to best matrices","year":2019,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Satisfiability; Computer science; DPLL algorithm; Variety (cybernetics); Mathematics; Theoretical computer science; Combinatorics; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.08461102999157805,"score_gpt":0.36037610158704764,"score_spread":0.2757650715954696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921963619","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.22336413,0.00050892454,0.77310836,0.00029841278,0.00018284815,0.0012999548,0.000027141119,0.000040901767,0.0011693136],"genre_scores_gemma":[0.9855304,0.00012043592,0.014053555,0.00001649955,0.00006955815,0.0001313691,0.0000014217248,0.000018390978,0.00005839346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993595,0.000013899981,0.0002535612,0.00009953175,0.0001164038,0.00015712022],"domain_scores_gemma":[0.9990415,0.0005504162,0.00003974125,0.00019801994,0.000118927754,0.000051381645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691305,0.00008490871,0.00015153759,0.000034853223,0.00009959754,0.000058573507,0.00016352527,0.000032837695,0.000005904677],"category_scores_gemma":[0.000018950956,0.00005706974,0.00003719423,0.00016770542,0.000037716676,0.000035887846,0.000019132227,0.000051493447,0.000042959495],"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.000021531181,0.000053836728,0.000011583277,0.00030834405,0.000038018345,1.0602649e-7,0.0010321086,0.0029241266,0.0024750605,0.9630966,0.000050203762,0.029988488],"study_design_scores_gemma":[0.000043837055,0.00046930555,0.0000070149244,0.00018636239,0.000029789717,0.0000055518685,0.0076823365,0.08887771,0.2515309,0.6427016,0.008192424,0.00027316826],"about_ca_topic_score_codex":0.000007563897,"about_ca_topic_score_gemma":0.000010020825,"teacher_disagreement_score":0.76216626,"about_ca_system_score_codex":0.0000022343338,"about_ca_system_score_gemma":0.0000072016105,"threshold_uncertainty_score":0.23272365},"labels":[],"label_agreement":null},{"id":"W29361179","doi":"10.3382/ps/pex441","title":"A Few More RPMDs with k = 4.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.004310950935722856,"score_gpt":0.18520250813181502,"score_spread":0.18089155719609215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29361179","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.97608596,0.0003496783,0.000028624429,0.000081135055,0.0006569422,0.00009790818,0.0000016652997,0.0003858745,0.022312228],"genre_scores_gemma":[0.9994852,0.000007095064,0.000083423736,0.00004153672,0.000018493325,0.000021401425,0.0000025840714,0.00003016403,0.00031013275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946153,0.000014945226,0.00010922204,0.00010484468,0.00011315221,0.00019628102],"domain_scores_gemma":[0.9996479,0.000018656894,0.000013949862,0.0002306191,0.000018319897,0.00007051627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008304635,0.00012030534,0.00012640674,0.00004487163,0.0000451544,0.000022735956,0.0001264227,0.00005292788,0.00006131424],"category_scores_gemma":[0.0000029788214,0.00010378282,0.000033248194,0.00017364442,0.000027834283,0.00011341668,0.000009936418,0.00011038141,0.0001571046],"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.000024259969,0.00007377135,0.0028272218,0.000081189464,0.00012814657,0.000028763148,0.0014304825,0.0033781829,0.0016331467,0.97640246,0.009223604,0.0047687436],"study_design_scores_gemma":[0.011074761,0.00082741195,0.026351774,0.000690909,0.00022977071,0.00040204602,0.0020380525,0.025872814,0.063117266,0.35266787,0.5129869,0.003740433],"about_ca_topic_score_codex":0.0000033263912,"about_ca_topic_score_gemma":0.0000035540977,"teacher_disagreement_score":0.62373465,"about_ca_system_score_codex":0.000029652407,"about_ca_system_score_gemma":0.0000064220367,"threshold_uncertainty_score":0.42321405},"labels":[],"label_agreement":null},{"id":"W2939361237","doi":"10.48550/arxiv.1904.09395","title":"Improved Upper Bounds on the Hermite and KZ Constants","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"McGill University","funders":"","keywords":"Upper and lower bounds; Constant (computer programming); Bounding overwatch; Hermite polynomials; Mathematics; Orthogonality; Lattice reduction; Lattice (music); Reduction (mathematics); Pure mathematics; Mathematical analysis; Computer science; Physics; Geometry; MIMO; Statistics","score_opus":0.03164279652583337,"score_gpt":0.14719210795223148,"score_spread":0.1155493114263981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939361237","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.968466,0.00017539805,0.0012641548,0.000019775009,0.00095772196,0.0003750749,0.00004534007,0.00020041817,0.028496152],"genre_scores_gemma":[0.9972898,0.0001777917,0.0000036273434,0.00005856864,0.000049883743,0.0000012367304,0.000006627415,0.00003434043,0.0023781767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999073,0.00008988072,0.0001260723,0.00041489606,0.00004256819,0.00025352713],"domain_scores_gemma":[0.99900097,0.0001331219,0.00006139531,0.00069185585,0.00003211703,0.000080520505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019933455,0.0002828023,0.0002657126,0.00011162798,0.0001041481,0.000072031944,0.00036500575,0.00026454308,0.00007085782],"category_scores_gemma":[0.000010369698,0.00024583904,0.00012919438,0.00014770895,0.00013115199,0.00007080299,0.00020561038,0.0005527224,0.00009959437],"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.00026326318,0.00009384381,0.016850393,0.0010617218,0.0012847092,0.00023800437,0.0012471256,0.24348095,0.0025204183,0.73025495,0.0019936278,0.0007109928],"study_design_scores_gemma":[0.00251297,0.00022589669,0.007329649,0.0012345256,0.00048117447,0.00003377586,0.002659409,0.8890928,0.0021440783,0.07528041,0.016260061,0.002745269],"about_ca_topic_score_codex":0.000021054026,"about_ca_topic_score_gemma":0.000011416885,"teacher_disagreement_score":0.6549745,"about_ca_system_score_codex":0.000070119284,"about_ca_system_score_gemma":0.000026997453,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W2940975645","doi":"10.46298/dmtcs.6340","title":"Parking functions, tree depth and factorizations of the full cycle into transpositions","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Saint Mary's University","funders":"","keywords":"Factorization; Bijection; Combinatorics; Sequence (biology); Mathematics; Set (abstract data type); Upper and lower bounds; Tree (set theory); Simple (philosophy); Discrete mathematics; Computer science; Algorithm; Biology","score_opus":0.008808573795939184,"score_gpt":0.20529652663098608,"score_spread":0.1964879528350469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940975645","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.19197874,0.000033180142,0.8050004,0.00024009234,0.00016079884,0.00014049433,0.000009548846,0.000088573455,0.002348153],"genre_scores_gemma":[0.98954666,0.0000030420915,0.010352867,0.000037205482,0.000038830643,0.00000720685,0.0000013746037,0.000011716591,0.0000010708344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912065,0.00003742328,0.00024976477,0.0001727909,0.0002447809,0.00017461099],"domain_scores_gemma":[0.999427,0.00012258526,0.00003504637,0.00024822517,0.00004060052,0.00012650107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021866267,0.00011872696,0.00015636034,0.000041827734,0.0002775555,0.00007871124,0.00039606434,0.000032811975,0.00001839881],"category_scores_gemma":[0.00003292503,0.000081916536,0.00006674726,0.0005777056,0.0010477953,0.00013254088,0.000083069666,0.0001132307,0.000004986249],"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.0000022474783,0.000014610861,0.000100923964,0.00012573625,0.000013037799,3.775256e-7,0.005827581,0.001958425,0.010602087,0.98026174,0.000008585398,0.0010846725],"study_design_scores_gemma":[0.00012758301,0.00006397057,0.0006512469,0.0001070993,0.000040824183,0.00000971505,0.0004344605,0.84436786,0.0049041254,0.14908755,0.000037863265,0.00016767747],"about_ca_topic_score_codex":5.87865e-7,"about_ca_topic_score_gemma":0.0000019607874,"teacher_disagreement_score":0.8424095,"about_ca_system_score_codex":0.000009316639,"about_ca_system_score_gemma":0.000013165055,"threshold_uncertainty_score":0.38606456},"labels":[],"label_agreement":null},{"id":"W2944207671","doi":"10.1016/j.jpaa.2019.05.001","title":"Möbius-like maps on irreducible polynomials and rational transformations","year":2019,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Monic polynomial; Fixed point; Action (physics); Pure mathematics; Set (abstract data type); Algebra over a field; Discrete mathematics; Combinatorics; Polynomial; Mathematical analysis","score_opus":0.005844173865516722,"score_gpt":0.18930729994293138,"score_spread":0.18346312607741466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944207671","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.9867626,0.000519902,0.00026932583,0.00015427422,0.00033244118,0.00012077845,0.000010583568,0.000017094308,0.011813002],"genre_scores_gemma":[0.9994902,0.00008315589,0.00008361427,0.00008698103,0.00014941169,0.0000029765608,0.000003243674,0.000009832197,0.0000906126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999473,0.000010703156,0.00024890216,0.000057934805,0.00011212078,0.000097342956],"domain_scores_gemma":[0.9997582,0.000040567716,0.00005529114,0.000060393715,0.000015241315,0.00007034188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020890239,0.00009046153,0.00017223172,0.000101843136,0.00004642807,0.000045909856,0.000051285777,0.0000549613,0.00005728865],"category_scores_gemma":[0.0000013767208,0.000073006726,0.000041101823,0.000063297586,0.000015259022,0.00013882536,0.0000037102936,0.00014446293,0.000021365133],"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.00029518726,0.00012987756,0.0006484665,0.00050965796,0.0004925414,0.000009417455,0.004901392,0.00819624,0.19532864,0.74266034,0.027166786,0.019661447],"study_design_scores_gemma":[0.020445526,0.0021954349,0.029485242,0.0013052478,0.0006588683,0.0025604356,0.014582936,0.003356505,0.16980569,0.36906433,0.3832297,0.0033100855],"about_ca_topic_score_codex":1.7234258e-7,"about_ca_topic_score_gemma":5.984121e-7,"teacher_disagreement_score":0.37359604,"about_ca_system_score_codex":0.0000081321,"about_ca_system_score_gemma":0.0000107882925,"threshold_uncertainty_score":0.2977128},"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":"W2945315668","doi":"10.1515/ms-2017-0241","title":"Perfect 1-factorizations","year":2019,"lang":"en","type":"article","venue":"Mathematica Slovaca","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":"McMaster University","funders":"","keywords":"Combinatorics; Mathematics; Hamiltonian path; Discrete mathematics; Cograph; Partition (number theory); Factorization; Trivially perfect graph; Vertex (graph theory); Graph; Chordal graph; 1-planar graph; Algorithm","score_opus":0.003942235515549595,"score_gpt":0.1677211061248968,"score_spread":0.1637788706093472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945315668","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.8064795,0.00014637888,0.0059384424,0.0000149572825,0.00053247344,0.00024602484,0.000003872101,0.0005100332,0.18612833],"genre_scores_gemma":[0.99790573,0.0000044629014,0.000305345,0.000010870445,0.000040406034,0.000018951509,0.0000035192413,0.000029299299,0.0016814248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949795,0.000015395672,0.00015184449,0.00008848683,0.00009942134,0.00014690743],"domain_scores_gemma":[0.99958014,0.000063271946,0.0000146513,0.00028581452,0.000012787072,0.000043302254],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000083194114,0.000102072896,0.00014851538,0.000056950852,0.000028766834,0.000025777748,0.00012277858,0.000050385046,0.0012229703],"category_scores_gemma":[0.0000123880045,0.000089507026,0.000059075814,0.00015616562,0.000009706736,0.000076138516,0.000012056113,0.00007536428,0.0036324856],"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.000006656149,0.00011817873,0.0024630697,0.002040166,0.00026096342,0.0000067623337,0.0055781673,0.004785662,0.07483334,0.90008765,0.0081174625,0.0017018991],"study_design_scores_gemma":[0.0033112646,0.0003347405,0.007009018,0.0013991384,0.0002800859,0.00023404238,0.0049502356,0.26642463,0.073724836,0.332359,0.30596468,0.0040083565],"about_ca_topic_score_codex":3.2317513e-7,"about_ca_topic_score_gemma":2.2436545e-7,"teacher_disagreement_score":0.5677287,"about_ca_system_score_codex":0.0000146000875,"about_ca_system_score_gemma":0.000003472608,"threshold_uncertainty_score":0.99969006},"labels":[],"label_agreement":null},{"id":"W2949183821","doi":"10.26493/1855-3974.1426.212","title":"On the generalized Oberwolfach problem","year":2019,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","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":"Toronto Metropolitan University; 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":"Mathematics; Combinatorics; Factorization; Graph; Discrete mathematics; Algorithm","score_opus":0.012920302364196869,"score_gpt":0.1901795957811386,"score_spread":0.17725929341694174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949183821","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.7642911,0.00012194598,0.00041426028,0.00026368306,0.0002503754,0.00081408885,0.000005388865,0.00032508286,0.23351404],"genre_scores_gemma":[0.99639356,0.0000042386077,0.00019477645,0.00016648682,0.000018764344,0.00010477259,0.000003737083,0.0000457736,0.0030679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898124,0.000084947205,0.0003344138,0.00015813837,0.000204968,0.00023626907],"domain_scores_gemma":[0.9989852,0.00031253957,0.000054417196,0.0005710724,0.000022826014,0.0000539997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055671023,0.0001971589,0.0002797429,0.00004767566,0.00005918207,0.000051980587,0.00028307777,0.0000670289,0.0006581925],"category_scores_gemma":[0.00002323484,0.00012396865,0.00012084724,0.00013417221,0.00003392347,0.00006999751,0.000017023456,0.00015690764,0.0025141337],"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.000014063554,0.000035648744,0.000061026916,0.00029110094,0.00010192375,0.0000045273678,0.0011037311,0.00044524693,0.0060136286,0.9846958,0.007102175,0.00013114301],"study_design_scores_gemma":[0.0022316747,0.00020915366,0.00008252116,0.0008278882,0.000060113092,0.000065289845,0.0011703394,0.032020167,0.012534359,0.92098206,0.028747397,0.0010690538],"about_ca_topic_score_codex":0.0000034653858,"about_ca_topic_score_gemma":0.0000014175087,"teacher_disagreement_score":0.23210242,"about_ca_system_score_codex":0.000017289995,"about_ca_system_score_gemma":0.00000734759,"threshold_uncertainty_score":0.9982625},"labels":[],"label_agreement":null},{"id":"W2949193546","doi":"10.48550/arxiv.1501.02502","title":"On generalized Howell designs with block size three","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Permutation (music); Lambda; Block (permutation group theory); Column (typography); Steiner system; Constant (computer programming); Discrete mathematics; Connection (principal bundle); Geometry; Computer science; Physics","score_opus":0.06935866646492546,"score_gpt":0.16082523665672965,"score_spread":0.0914665701918042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949193546","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.9623311,0.000118260155,0.016784249,0.0000072870657,0.00066337147,0.0004315808,0.000035904282,0.00062878296,0.018999428],"genre_scores_gemma":[0.9976979,0.00004374933,0.00011629282,0.000025213452,0.000105716485,0.000002734793,0.000014228407,0.000077648525,0.0019165416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986339,0.00011234217,0.00016579339,0.00060642714,0.00010345728,0.0003780517],"domain_scores_gemma":[0.99852324,0.000119725286,0.00009301757,0.00092837523,0.00009926852,0.00023637207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022958906,0.0004651401,0.0004555599,0.00016739567,0.00007796756,0.000050583545,0.0005969677,0.0003701604,0.00008458634],"category_scores_gemma":[0.000016679805,0.0004629435,0.00017339605,0.00031822015,0.00008868568,0.00008376464,0.00015639188,0.0005929999,0.00019251635],"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.0001941442,0.000040043917,0.00057334534,0.00012535971,0.0002848237,0.00033041477,0.00011066275,0.95209897,0.000120153905,0.044385117,0.0017174532,0.000019538635],"study_design_scores_gemma":[0.0075056087,0.0008111511,0.0013549168,0.0012443246,0.0011326718,0.00006334507,0.00045439988,0.5662849,0.0022106918,0.4095855,0.0047719763,0.0045805033],"about_ca_topic_score_codex":0.000057925456,"about_ca_topic_score_gemma":0.00012293344,"teacher_disagreement_score":0.38581404,"about_ca_system_score_codex":0.0001956319,"about_ca_system_score_gemma":0.00007107663,"threshold_uncertainty_score":0.9997822},"labels":[],"label_agreement":null},{"id":"W2949204298","doi":"10.48550/arxiv.1209.4581","title":"On unit weighing matrices with small weight","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Lethbridge","funders":"","keywords":"Unit (ring theory); Mathematics; Combinatorics; Order (exchange); Multiple; Arithmetic","score_opus":0.04582429535021947,"score_gpt":0.14635032671715292,"score_spread":0.10052603136693344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949204298","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.930528,0.0003399119,0.02753865,0.000005036997,0.0011445421,0.0002653983,0.000025623794,0.0006405066,0.03951235],"genre_scores_gemma":[0.99813193,0.00016736977,0.00012697565,0.000014968431,0.00018587595,0.0000017012208,0.000023859955,0.000069803624,0.0012775179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987911,0.000096124044,0.0001576651,0.00046011727,0.000069129965,0.00042583587],"domain_scores_gemma":[0.99884415,0.0001090349,0.00010458505,0.0007056114,0.000046877307,0.00018974095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018487692,0.00041996574,0.000352943,0.00031717858,0.000113329865,0.00005134312,0.0005761947,0.0003329202,0.00012977787],"category_scores_gemma":[0.0000040165683,0.00041191332,0.00014599896,0.00038917485,0.00006139701,0.00014672091,0.00017293061,0.00073722424,0.00027840526],"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.00014450913,0.00008798731,0.0059864367,0.0007606621,0.0005600323,0.00034527096,0.00045827113,0.6193153,0.0000563853,0.3716314,0.00028979577,0.0003639283],"study_design_scores_gemma":[0.010358029,0.00102725,0.014448439,0.01034985,0.005261831,0.0001723259,0.004028319,0.46999,0.0068778866,0.34351528,0.11705602,0.016914792],"about_ca_topic_score_codex":0.0000480535,"about_ca_topic_score_gemma":0.00004139426,"teacher_disagreement_score":0.14932533,"about_ca_system_score_codex":0.00010358229,"about_ca_system_score_gemma":0.000025310574,"threshold_uncertainty_score":0.9998333},"labels":[],"label_agreement":null},{"id":"W2949219890","doi":"10.5539/mas.v13n7p15","title":"The Optimal Size of {b, t} - Blocking Set When t = 3,4 by Intersection the Tangent in PG (2, q)","year":2019,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Chemistry","score_opus":0.004400377255277449,"score_gpt":0.18070757292323017,"score_spread":0.17630719566795272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949219890","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.98336107,0.00012678187,0.008694517,0.00003325943,0.00030821722,0.00025319285,0.0000025421684,0.00003925119,0.0071811704],"genre_scores_gemma":[0.99979454,0.000004427171,0.000040494422,0.000016987227,0.000012035905,0.000026641392,2.7228862e-7,0.000007660373,0.00009695771],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921995,0.000016228423,0.00015718058,0.00015216068,0.00023360997,0.00022084928],"domain_scores_gemma":[0.999552,0.00009781018,0.000034358865,0.00027814615,0.000013216947,0.000024434088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085885,0.00007853154,0.000085049935,0.00003367487,0.00011723187,0.000054179698,0.00046489167,0.00002657639,0.000012140014],"category_scores_gemma":[0.000009691216,0.000048375983,0.000023410139,0.00024969998,0.00017696702,0.000074138785,0.00005421396,0.00012317633,0.000015385349],"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.00001647357,0.000008527884,0.0002920287,0.00001654046,0.0000071025943,1.8429084e-7,0.0063458188,0.042036522,0.9436496,0.004351464,0.00018882596,0.003086932],"study_design_scores_gemma":[0.00033127438,0.000028736766,0.0008409122,0.00003985396,0.0000055328087,0.000004981406,0.003386366,0.89730394,0.08894787,0.006727967,0.0021787558,0.00020378044],"about_ca_topic_score_codex":0.000017811797,"about_ca_topic_score_gemma":0.00001799688,"teacher_disagreement_score":0.85526747,"about_ca_system_score_codex":0.000051853964,"about_ca_system_score_gemma":0.000012736732,"threshold_uncertainty_score":0.19727154},"labels":[],"label_agreement":null},{"id":"W2949375491","doi":"10.48550/arxiv.1207.1336","title":"Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Waterloo","funders":"","keywords":"Alice (programming language); Alice and Bob; Computer science; Set (abstract data type); Characterization (materials science); Theoretical computer science; Computer security; Mathematical economics; Mathematics; Programming language","score_opus":0.04513242325152396,"score_gpt":0.1723772293464331,"score_spread":0.12724480609490912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949375491","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.70818007,0.003221604,0.23523636,0.00015380234,0.0246133,0.008653841,0.0007935718,0.0024247856,0.01672265],"genre_scores_gemma":[0.99882,0.00009414638,0.00006765477,0.000008068088,0.00062404404,0.00004470036,0.000050395083,0.000060299553,0.00023071427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985169,0.00013637578,0.00024367585,0.00044416703,0.0000625003,0.00059633976],"domain_scores_gemma":[0.9987796,0.00012946477,0.00013093314,0.00072870776,0.00007551717,0.00015581094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059897,0.00037404266,0.0003865565,0.00011484828,0.00045746614,0.00008272567,0.0006612781,0.00042577775,0.000019204386],"category_scores_gemma":[0.000015615766,0.000347641,0.0004214932,0.0002396479,0.00010164849,0.00016980726,0.00033187776,0.0006009812,0.000011819254],"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.000074567855,0.00005349683,0.00019025484,0.0005641274,0.00047400987,0.000004695272,0.0007308262,0.07959231,0.00044202473,0.91713274,0.00068384386,0.00005711169],"study_design_scores_gemma":[0.0022690536,0.00004850764,0.00011669792,0.00015844661,0.0009061325,0.0000054584725,0.00045162666,0.61941993,0.00067116425,0.3622853,0.012576167,0.0010915167],"about_ca_topic_score_codex":0.0002011285,"about_ca_topic_score_gemma":0.000057647758,"teacher_disagreement_score":0.5548474,"about_ca_system_score_codex":0.0002469139,"about_ca_system_score_gemma":0.000082352526,"threshold_uncertainty_score":0.99989754},"labels":[],"label_agreement":null},{"id":"W2949427483","doi":"10.48550/arxiv.1101.4322","title":"Cayley graphs of order 27p are hamiltonian","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Lethbridge","funders":"","keywords":"Cayley graph; Hamiltonian (control theory); Hamiltonian path; Combinatorics; Mathematics; Vertex-transitive graph; Graph; Cayley's theorem; Discrete mathematics; Voltage graph; Line graph","score_opus":0.04734795368095511,"score_gpt":0.14495437468056682,"score_spread":0.09760642099961171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949427483","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.9644903,0.0002923937,0.004872643,0.0000022748522,0.0011031884,0.00026554678,0.00006989094,0.000366675,0.028537104],"genre_scores_gemma":[0.9986262,0.00021545506,0.0000532855,0.000007963186,0.000034153083,0.0000013204426,0.000016213533,0.00005181413,0.0009936491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881953,0.00008604388,0.00024603674,0.00048208868,0.000059598227,0.00030668394],"domain_scores_gemma":[0.99860793,0.000031527165,0.00017507492,0.0009184345,0.00013147635,0.00013557778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015730273,0.00035287638,0.0004912843,0.0003469487,0.000056674147,0.0000141468845,0.0006535089,0.00042112134,0.0001625969],"category_scores_gemma":[0.000011147184,0.00041853293,0.00028243018,0.00050356006,0.00013491602,0.0000972608,0.00024239197,0.00051008,0.00007994366],"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.000119105134,0.00018448972,0.038010538,0.0022926426,0.0012781814,0.00049505377,0.0017156523,0.5545615,0.00083226233,0.3990341,0.0012614691,0.0002149679],"study_design_scores_gemma":[0.004280985,0.00029688847,0.058934383,0.0038744258,0.0019187675,0.000049940627,0.0051900325,0.11631113,0.013562913,0.7808005,0.008014594,0.0067653996],"about_ca_topic_score_codex":0.00021893645,"about_ca_topic_score_gemma":0.00017248897,"teacher_disagreement_score":0.4382504,"about_ca_system_score_codex":0.000057826823,"about_ca_system_score_gemma":0.00003458895,"threshold_uncertainty_score":0.99982667},"labels":[],"label_agreement":null},{"id":"W2949505605","doi":"10.48550/arxiv.1406.6920","title":"On tight bounds for binary frameproof codes","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Combinatorics; Binary number; Mathematics; Permutation (music); Binary code; Hash function; Discrete mathematics; Degree (music); Permutation matrix; Arithmetic; Physics; Computer science; Philosophy","score_opus":0.03572200341129734,"score_gpt":0.16378941797204338,"score_spread":0.12806741456074605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949505605","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.8787136,0.00013495074,0.104556,0.000012245644,0.0017512874,0.00053736364,0.00010131424,0.0006146618,0.013578563],"genre_scores_gemma":[0.9975143,0.000045279536,0.00006224204,0.000036527006,0.00016032578,0.00000649334,0.000064870605,0.0000613265,0.0020486042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883085,0.00007216267,0.00017126555,0.0005514475,0.00005184618,0.0003224304],"domain_scores_gemma":[0.99879587,0.00019121698,0.00007949887,0.0007558939,0.000056504778,0.00012098916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023157943,0.00034601812,0.0003962276,0.00023709115,0.00012541439,0.00004994836,0.0005188156,0.00045653456,0.000059047274],"category_scores_gemma":[0.000020487634,0.00039393365,0.0002938666,0.00016670623,0.00008202784,0.000068291265,0.00013623096,0.00046880942,0.0001161331],"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.00008552338,0.000040213356,0.00019499802,0.0005702369,0.00019065944,0.00003346236,0.00008729832,0.70267266,0.00013416228,0.29251012,0.00337154,0.00010911868],"study_design_scores_gemma":[0.00089530845,0.00021792806,0.00026509026,0.00047789613,0.00019429218,0.0000029538762,0.000091965536,0.63106537,0.0007580728,0.3474889,0.01752907,0.0010131418],"about_ca_topic_score_codex":0.000010584913,"about_ca_topic_score_gemma":0.000009231413,"teacher_disagreement_score":0.118800715,"about_ca_system_score_codex":0.00011681113,"about_ca_system_score_gemma":0.000025200661,"threshold_uncertainty_score":0.9998512},"labels":[],"label_agreement":null},{"id":"W2949574883","doi":"10.48550/arxiv.0710.1842","title":"An explicit universal cycle for the (n-1)-permutations of an n-set","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"Set (abstract data type); Combinatorics; Mathematics; Arithmetic; Computer science; Programming language","score_opus":0.034317488211462584,"score_gpt":0.2731775099604899,"score_spread":0.23886002174902732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949574883","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.97439384,0.00018604587,0.022785345,0.00001890667,0.00071431167,0.00045362397,0.00016628261,0.00019942068,0.0010822471],"genre_scores_gemma":[0.99927044,0.00002160045,0.00016357421,0.000019683339,0.00021611877,0.00006681784,0.00013559456,0.000050074737,0.000056090787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991523,0.00004610616,0.00026467908,0.00022042324,0.00010241337,0.00021405471],"domain_scores_gemma":[0.99895227,0.00014521011,0.000074954856,0.00068577385,0.00006545049,0.000076360935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034517678,0.00019055007,0.00022239775,0.00010433375,0.000100398946,0.000020932079,0.0004563694,0.00019953249,0.000032550375],"category_scores_gemma":[0.0000130073095,0.00016576744,0.00013616697,0.00011076737,0.000048198748,0.00011931561,0.000044792592,0.00025873684,0.000012909161],"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.00016320591,0.00027011702,0.042737767,0.001224628,0.0009923929,0.000025047702,0.019376986,0.85461694,0.023805697,0.04947238,0.0006193702,0.006695481],"study_design_scores_gemma":[0.0035872268,0.0008560026,0.34050083,0.00083611475,0.0012199343,0.000041831132,0.04166793,0.47816357,0.065747894,0.03736876,0.026451882,0.0035580148],"about_ca_topic_score_codex":0.00009859692,"about_ca_topic_score_gemma":0.00008287189,"teacher_disagreement_score":0.37645334,"about_ca_system_score_codex":0.000033919525,"about_ca_system_score_gemma":0.00002334652,"threshold_uncertainty_score":0.67598003},"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":"W2950028648","doi":"10.48550/arxiv.1410.6743","title":"Mutually orthogonal latin squares with large holes","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Victoria","funders":"","keywords":"Latin square; Mathematics; Combinatorics; Order (exchange); Row; Orthogonal array; Least-squares function approximation; Set (abstract data type); Total least squares; Algorithm; Statistics; Computer science; Chemistry","score_opus":0.025998137142011647,"score_gpt":0.14388415464924117,"score_spread":0.11788601750722953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950028648","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.90164405,0.0000864747,0.084929086,0.0000052043692,0.00039323178,0.00021171548,0.00007652673,0.00054261833,0.012111072],"genre_scores_gemma":[0.99852115,0.00003609119,0.00006091982,0.000020459767,0.00013250319,0.0000017846227,0.00006172055,0.00005944815,0.001105915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987299,0.00010885856,0.0001746538,0.00051984773,0.00008369089,0.00038309165],"domain_scores_gemma":[0.99897873,0.000068564856,0.00009395071,0.00064550596,0.000068516434,0.00014473782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021766813,0.00037670496,0.00038250725,0.0002703866,0.00010646835,0.000050840223,0.0004865257,0.00031344895,0.00011490889],"category_scores_gemma":[0.000007944028,0.00038544493,0.00017102495,0.00030307952,0.000107938125,0.00009885873,0.00020463721,0.00056586793,0.00013186957],"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.00006451079,0.000039926184,0.012850107,0.0004001028,0.00026163628,0.00020531428,0.00027610143,0.7203354,0.000051708877,0.26509473,0.00034299112,0.00007747641],"study_design_scores_gemma":[0.0049516903,0.0004240754,0.024863716,0.0021558604,0.0009009895,0.000047668567,0.002378783,0.84016466,0.0008175801,0.090646066,0.027712071,0.004936831],"about_ca_topic_score_codex":0.000011949714,"about_ca_topic_score_gemma":0.00011417293,"teacher_disagreement_score":0.17444865,"about_ca_system_score_codex":0.000060359,"about_ca_system_score_gemma":0.000039567607,"threshold_uncertainty_score":0.99985975},"labels":[],"label_agreement":null},{"id":"W2950123396","doi":"10.48550/arxiv.1310.0992","title":"A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Waterloo","funders":"","keywords":"Simple (philosophy); Block design; Construct (python library); Class (philosophy); Block (permutation group theory); Computer science; Mathematics; Combinatorics; Programming language; Artificial intelligence","score_opus":0.06758740833046312,"score_gpt":0.17426033374466518,"score_spread":0.10667292541420206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950123396","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.8866528,0.00020681285,0.09954658,0.0000066606904,0.0017049392,0.00057672255,0.00011620344,0.0010412583,0.010147998],"genre_scores_gemma":[0.993098,0.000098959135,0.0031362958,0.000024517547,0.00044263827,0.000003301468,0.00013397259,0.000103139915,0.0029591464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974786,0.00025526623,0.0004366427,0.0010902025,0.000121674624,0.0006176252],"domain_scores_gemma":[0.9976142,0.00017667639,0.0002445449,0.0013405292,0.00010453697,0.0005195097],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021202539,0.00064048497,0.0006985526,0.00029367016,0.0002686476,0.0001728493,0.0008213935,0.00071445655,0.0020802724],"category_scores_gemma":[0.000017165472,0.00080168695,0.00029161293,0.00038206988,0.0002271987,0.00048028387,0.00044655218,0.00084302167,0.00043275204],"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.00024168238,0.00007376436,0.031874035,0.00054225634,0.0015762827,0.0006321756,0.001743738,0.65041655,0.011237023,0.28984913,0.009609594,0.0022037541],"study_design_scores_gemma":[0.005150645,0.00028354445,0.0012594073,0.0012932108,0.0014271798,0.00021308433,0.010747648,0.30595946,0.01574969,0.6426086,0.009294719,0.006012821],"about_ca_topic_score_codex":0.0015186036,"about_ca_topic_score_gemma":0.00025831442,"teacher_disagreement_score":0.35275945,"about_ca_system_score_codex":0.00042126083,"about_ca_system_score_gemma":0.00013419433,"threshold_uncertainty_score":0.9994434},"labels":[],"label_agreement":null},{"id":"W2950135190","doi":"10.48550/arxiv.1307.8161","title":"Mutually Unbiased Weighing Matrices","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Alberta; University of Lethbridge","funders":"","keywords":"Hadamard transform; Mutually unbiased bases; Mathematics; Upper and lower bounds; Best linear unbiased prediction; Computer science; Algorithm; Combinatorics; Statistics; Pure mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.03665512459433039,"score_gpt":0.14419042542004393,"score_spread":0.10753530082571354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950135190","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.9630783,0.0003640987,0.013714017,0.0000064388205,0.0017099059,0.0003258175,0.000029126644,0.00091621047,0.019856092],"genre_scores_gemma":[0.99788195,0.00026347526,0.000076114986,0.000016936761,0.00017290142,0.0000022943557,0.000028408056,0.000058443184,0.0014994611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987169,0.00009646031,0.00022284496,0.0005242507,0.00006797468,0.00037158685],"domain_scores_gemma":[0.99886954,0.00008667224,0.0001070229,0.0007048372,0.00006590465,0.0001660296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017331727,0.0003788555,0.0003759603,0.00029215091,0.00010016036,0.00010115659,0.000717895,0.00039760087,0.0002806007],"category_scores_gemma":[0.000010181211,0.00044405818,0.00024102515,0.0003489354,0.00006217821,0.00022770496,0.00028048977,0.00061589095,0.0006386262],"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.000019839541,0.000037833535,0.0011988978,0.0007272963,0.00038419297,0.00026927012,0.0004511964,0.8980546,0.00043233414,0.09568388,0.0023859977,0.0003546731],"study_design_scores_gemma":[0.0011734939,0.000062159845,0.0013545338,0.00084276014,0.00045577067,0.000013108402,0.0012471385,0.87257266,0.0010174351,0.10918598,0.009648572,0.0024263603],"about_ca_topic_score_codex":0.00012975985,"about_ca_topic_score_gemma":0.00002170034,"teacher_disagreement_score":0.034803674,"about_ca_system_score_codex":0.00013216454,"about_ca_system_score_gemma":0.00003140561,"threshold_uncertainty_score":0.9998011},"labels":[],"label_agreement":null},{"id":"W2950425505","doi":"10.48550/arxiv.1110.3463","title":"Nonexistence Results for Tight Block Designs","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Victoria","funders":"","keywords":"Block (permutation group theory); Upper and lower bounds; Mathematics; Combinatorics; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.12555457797221298,"score_gpt":0.17262648376591985,"score_spread":0.047071905793706875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950425505","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.66145545,0.00039762774,0.16617726,0.000013966708,0.0040550334,0.0019077616,0.0005469612,0.00168185,0.1637641],"genre_scores_gemma":[0.99573624,0.00009574698,0.0002792225,0.000009287599,0.00011949488,0.000005269551,0.000038485763,0.000047454017,0.0036687697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998666,0.00006397416,0.0002472859,0.00061512954,0.000042840617,0.00036477126],"domain_scores_gemma":[0.998726,0.000107487635,0.00011250046,0.00082318974,0.00008230182,0.00014849009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027233313,0.00033906693,0.00035328,0.00018361531,0.00010365889,0.000029745928,0.00067979004,0.00039368862,0.000017644992],"category_scores_gemma":[0.000022287551,0.00039744444,0.00027820264,0.00020716278,0.00007989997,0.00008509778,0.00017063729,0.000370005,0.000112517526],"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.0006316003,0.000116573865,0.00029801592,0.0012894828,0.0006700336,0.00027406085,0.0014462272,0.67813706,0.0009463723,0.30950844,0.0065469383,0.00013514896],"study_design_scores_gemma":[0.0061067864,0.00048761346,0.0009636007,0.0016900242,0.0012654709,0.000045557368,0.0010177188,0.5387655,0.014687171,0.39661762,0.0333247,0.0050282567],"about_ca_topic_score_codex":0.000034994915,"about_ca_topic_score_gemma":0.000029875033,"teacher_disagreement_score":0.33428082,"about_ca_system_score_codex":0.00009424731,"about_ca_system_score_gemma":0.000037855898,"threshold_uncertainty_score":0.99984777},"labels":[],"label_agreement":null},{"id":"W2950627915","doi":"10.48550/arxiv.1009.5795","title":"Hamiltonian cycles in Cayley graphs whose order has few prime factors","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Lethbridge","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Hamiltonian (control theory); Factorization; Hamiltonian path; Graph; Prime (order theory); Order (exchange); Business","score_opus":0.046942898371860914,"score_gpt":0.16203382626674867,"score_spread":0.11509092789488776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950627915","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.9915915,0.00016292615,0.0017999838,0.0000117466325,0.0014945976,0.0004071674,0.00005180239,0.00051525043,0.0039649843],"genre_scores_gemma":[0.99903035,0.00013635388,0.000047644313,0.000009858353,0.000049776732,0.000002324306,0.000050397666,0.0000785315,0.000594778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982218,0.00012503857,0.0003023401,0.0007432369,0.00008624481,0.00052131945],"domain_scores_gemma":[0.99852425,0.000078997575,0.00011304485,0.0009986407,0.00007040859,0.00021465267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023010946,0.00054577144,0.00055694726,0.0006584523,0.00013065318,0.00010032873,0.00081111374,0.0008193074,0.0001167322],"category_scores_gemma":[0.000024057877,0.0006280308,0.0002712069,0.0007339297,0.00020118547,0.0002004941,0.00030559066,0.0015248269,0.00009247552],"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.000098497774,0.00028718577,0.21698174,0.0009175328,0.00067640777,0.00091102184,0.0042884136,0.6901435,0.0036922717,0.081061415,0.00045136767,0.0004906072],"study_design_scores_gemma":[0.006338206,0.00022053575,0.40143242,0.0027492566,0.00093941344,0.000044346798,0.005487122,0.25681907,0.013811293,0.28118297,0.020335555,0.010639807],"about_ca_topic_score_codex":0.0009432903,"about_ca_topic_score_gemma":0.0027946685,"teacher_disagreement_score":0.4333245,"about_ca_system_score_codex":0.00014148164,"about_ca_system_score_gemma":0.00008448059,"threshold_uncertainty_score":0.9996171},"labels":[],"label_agreement":null},{"id":"W2950769433","doi":"","title":"On the Arithmetic Complexity of Strassen-Like Matrix Multiplications.","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","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 Waterloo","funders":"","keywords":"Strassen algorithm; Matrix multiplication; Mathematics; Arithmetic; Dimension (graph theory); Multiplication (music); Matrix (chemical analysis); Multiplication algorithm; Discrete mathematics; Combinatorics; Binary number","score_opus":0.02792268647726698,"score_gpt":0.2523565732619038,"score_spread":0.22443388678463683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950769433","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.7379699,0.00023117788,0.24808519,0.000496225,0.0012270143,0.0014600566,0.00025263292,0.00032466082,0.009953175],"genre_scores_gemma":[0.976649,0.00005982466,0.02256368,0.000044566776,0.00006870483,0.00048793852,0.00006941169,0.00005174294,0.000005129384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979345,0.00041559344,0.000630684,0.0004535502,0.00018810546,0.0003775597],"domain_scores_gemma":[0.99715185,0.001089958,0.0002297318,0.0013595194,0.000073455005,0.00009550158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034212339,0.00041097903,0.0006282057,0.00021443369,0.00010700057,0.00003127372,0.0008844029,0.0003045614,0.00029031961],"category_scores_gemma":[0.000087709755,0.0003249654,0.00029369898,0.000105503495,0.0008429346,0.000024211062,0.00043549773,0.0012813761,0.00044175924],"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.000016755472,0.00007159733,0.000356102,0.00024450244,0.00028061596,0.000003406497,0.00077630545,0.016829427,0.0025694657,0.9775234,0.0010038149,0.00032464127],"study_design_scores_gemma":[0.00018283901,0.000029966137,0.008837933,0.00014727739,0.000046006488,0.000017299497,0.00018499205,0.020592937,0.0014089468,0.967865,0.0003912783,0.00029550624],"about_ca_topic_score_codex":0.000077896344,"about_ca_topic_score_gemma":0.000046413097,"teacher_disagreement_score":0.23867914,"about_ca_system_score_codex":0.000040683684,"about_ca_system_score_gemma":0.000037183265,"threshold_uncertainty_score":0.99992025},"labels":[],"label_agreement":null},{"id":"W2950799116","doi":"10.48550/arxiv.1502.00776","title":"Homomorphisms of binary Cayley graphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Royal Military College of Canada","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Vertex-transitive graph; Bipartite graph; Discrete mathematics; Foster graph; Edge-transitive graph; Voltage graph; Graph; Line graph","score_opus":0.05502701422007894,"score_gpt":0.15664920998005044,"score_spread":0.1016221957599715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950799116","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.9820288,0.0005416478,0.001381027,0.0000026344899,0.0012077335,0.0002338631,0.0000963488,0.00035377967,0.014154158],"genre_scores_gemma":[0.9989996,0.00018212895,0.000026218993,0.0000045118063,0.000041830765,0.0000011040221,0.000040074745,0.000044195353,0.00066035416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989204,0.000096341675,0.00023365946,0.00041069844,0.00007445857,0.00026446817],"domain_scores_gemma":[0.9987381,0.000038034486,0.00012036939,0.00080882834,0.0001243482,0.00017032147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026187973,0.00031312162,0.00046300708,0.00036041517,0.000039896477,0.000013555389,0.0006085936,0.00036981297,0.0000609014],"category_scores_gemma":[0.000009483746,0.0003755024,0.0002659686,0.00045365977,0.00014624663,0.00010085964,0.0002806049,0.00045910795,0.00007159151],"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.000051357903,0.000064295135,0.002003248,0.00058091676,0.00032774586,0.00031188407,0.00031217685,0.8223906,0.0008560023,0.17105094,0.001997035,0.000053793206],"study_design_scores_gemma":[0.0023735743,0.00028329444,0.0030312024,0.0011249115,0.00079899415,0.000038433147,0.0016875679,0.2957906,0.0033448667,0.68533325,0.003517164,0.002676151],"about_ca_topic_score_codex":0.00007938541,"about_ca_topic_score_gemma":0.000014222522,"teacher_disagreement_score":0.5266,"about_ca_system_score_codex":0.00009494002,"about_ca_system_score_gemma":0.000056485755,"threshold_uncertainty_score":0.9998697},"labels":[],"label_agreement":null},{"id":"W2951081630","doi":"10.48550/arxiv.1106.5736","title":"Algorithms for Solving Rubik's Cubes","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Waterloo","funders":"","keywords":"Cube (algebra); Upper and lower bounds; Combinatorics; Unit cube; State (computer science); Space (punctuation); Mathematics; Argument (complex analysis); Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Chemistry","score_opus":0.08213520116338414,"score_gpt":0.16775753457400247,"score_spread":0.08562233341061833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951081630","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.60376066,0.00060227804,0.36470884,0.000005233912,0.0039071385,0.00091327296,0.00013910104,0.0012733066,0.024690166],"genre_scores_gemma":[0.9976678,0.00014881179,0.00032377464,0.0000095663345,0.00020085496,0.000005806172,0.00003289297,0.0000669161,0.0015436081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883276,0.00003229083,0.00019043319,0.0005230567,0.000038636885,0.00038280513],"domain_scores_gemma":[0.99902683,0.00007375729,0.00007657745,0.0006190735,0.000072940864,0.00013080322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001709267,0.000343076,0.0003731968,0.00020913423,0.000114470946,0.000040378494,0.00058475725,0.0003821159,0.000074649455],"category_scores_gemma":[0.0000124848575,0.00041616146,0.00032987708,0.00016820066,0.000066028646,0.00013655002,0.00021806234,0.00038556478,0.00007938446],"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.00008964257,0.00009185919,0.001019948,0.0017368265,0.0009134867,0.0001735665,0.0012187586,0.65664834,0.000750785,0.33336934,0.0025879224,0.0013994955],"study_design_scores_gemma":[0.0008844604,0.00007084719,0.00033278295,0.00041578306,0.00035481778,0.000008704954,0.00058447535,0.7618152,0.00274433,0.22576754,0.0056212116,0.0013998421],"about_ca_topic_score_codex":0.00005016422,"about_ca_topic_score_gemma":0.000020521604,"teacher_disagreement_score":0.3939071,"about_ca_system_score_codex":0.00009613627,"about_ca_system_score_gemma":0.0000287435,"threshold_uncertainty_score":0.999829},"labels":[],"label_agreement":null},{"id":"W2951112717","doi":"","title":"Forbidden Families of Configurations","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 British Columbia","funders":"","keywords":"TRACE (psycholinguistics); Combinatorics; Permutation (music); Matrix (chemical analysis); Simple (philosophy); Mathematics; Function (biology); Set (abstract data type); Physics; Computer science; Linguistics; Philosophy; Chemistry","score_opus":0.0427247339713837,"score_gpt":0.15037084650849603,"score_spread":0.10764611253711233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951112717","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.939631,0.00012904483,0.013454954,0.0000035752532,0.00058776676,0.00026301545,0.0000584599,0.0002356166,0.0456366],"genre_scores_gemma":[0.998452,0.00018296012,0.000029207611,0.000004025783,0.0000394854,0.0000019257975,0.000026937998,0.00002214186,0.0012412837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993541,0.00004216677,0.000174122,0.00023392154,0.0000359915,0.00015964903],"domain_scores_gemma":[0.99925196,0.00004715231,0.00007647948,0.00048169456,0.00007834103,0.0000643775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006914469,0.00018863351,0.00027160902,0.00018125873,0.000040614465,0.000018139923,0.00034710433,0.00022361251,0.00017598398],"category_scores_gemma":[0.000007437773,0.00022053163,0.00015963094,0.00017971118,0.000086852255,0.00010607164,0.000107309585,0.00025003933,0.0001179224],"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.00000820961,0.00002540598,0.0009789788,0.0005097032,0.0002780498,0.000019291714,0.00047509055,0.6031813,0.0015228913,0.39155036,0.0012843966,0.00016633286],"study_design_scores_gemma":[0.0013220032,0.000102945625,0.0062770457,0.0008172556,0.00056481,0.000009699302,0.004818977,0.6746255,0.009461488,0.29202667,0.0079559265,0.0020176573],"about_ca_topic_score_codex":0.000114572256,"about_ca_topic_score_gemma":0.000027647093,"teacher_disagreement_score":0.09952369,"about_ca_system_score_codex":0.000039272683,"about_ca_system_score_gemma":0.000023876295,"threshold_uncertainty_score":0.8993019},"labels":[],"label_agreement":null},{"id":"W2951247286","doi":"10.48550/arxiv.1510.02521","title":"On the chromatic number of Latin square graphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Latin square; Circulant matrix; Chromatic scale; Combinatorics; Mathematics; Square (algebra); Discrete mathematics; Graph; Geometry","score_opus":0.05691088794379047,"score_gpt":0.16991475302707906,"score_spread":0.1130038650832886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951247286","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.96777,0.00004366767,0.00080579217,0.00000734035,0.0004738465,0.000261441,0.000038106762,0.00017911619,0.030420702],"genre_scores_gemma":[0.9993389,0.000023043123,0.000009250498,0.0000103401735,0.000025407466,0.0000015807545,0.000014605834,0.000030863433,0.0005459787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915445,0.00013410118,0.00018364048,0.000263105,0.00007856777,0.00018616412],"domain_scores_gemma":[0.9988377,0.00015417459,0.00010943527,0.0007519144,0.000069747104,0.00007699514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026681117,0.0002443613,0.00030603053,0.000109258945,0.000049134418,0.00001649123,0.0005097793,0.00021761948,0.00017596327],"category_scores_gemma":[0.000024999008,0.00021112525,0.00020938089,0.00033080752,0.00009389855,0.000046153407,0.00014199695,0.00041015696,0.0002484244],"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.000021447206,0.000036345406,0.0025059069,0.00044809846,0.00021181317,0.00003702302,0.00050451874,0.37319097,0.00004064355,0.6208172,0.0021662666,0.00001977879],"study_design_scores_gemma":[0.0005041375,0.000046138415,0.0012702954,0.00078799995,0.00017852866,0.000004940614,0.0009422579,0.12559822,0.00032503015,0.8694097,0.00033159828,0.00060115324],"about_ca_topic_score_codex":0.000032114265,"about_ca_topic_score_gemma":0.000013252915,"teacher_disagreement_score":0.2485925,"about_ca_system_score_codex":0.000068123496,"about_ca_system_score_gemma":0.000026872814,"threshold_uncertainty_score":0.8609438},"labels":[],"label_agreement":null},{"id":"W2951431360","doi":"10.48550/arxiv.math/0703860","title":"Sets that contain their circle centers","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","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 British Columbia","funders":"","keywords":"Center (category theory); Mathematics; Plane (geometry); Line (geometry); Conjecture; Combinatorics; Unit circle; Set (abstract data type); Assertion; Great circle; Finite set; Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.03530505608797795,"score_gpt":0.2303407107308514,"score_spread":0.19503565464287345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951431360","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.98319435,0.0013710211,0.0014238836,0.000039571252,0.0033413847,0.000353761,0.000058229267,0.0006431199,0.009574648],"genre_scores_gemma":[0.9991396,0.000112991205,0.00001740235,0.00012933917,0.00020780425,0.00004065768,0.00007136313,0.00008817281,0.00019268239],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986204,0.000074197225,0.00031394136,0.00036944056,0.00015455506,0.00046747937],"domain_scores_gemma":[0.9989544,0.00007433482,0.000079536745,0.0007252047,0.000028022387,0.00013847419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004458995,0.00036390597,0.00041728816,0.00014244547,0.00006412472,0.000044954268,0.0004419903,0.00038704718,0.00008219221],"category_scores_gemma":[0.000011201394,0.00037731096,0.00025232902,0.000093789124,0.000053296735,0.00006971705,0.00017769822,0.00070228183,0.00028022044],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007383503,0.00011503843,0.9581119,0.001780518,0.0011739915,0.00022696269,0.0045501147,0.011474398,0.007467792,0.000971081,0.004465158,0.009589208],"study_design_scores_gemma":[0.0015114176,0.000074107505,0.88649315,0.0017803414,0.00014536176,0.000072019626,0.002849055,0.0024859481,0.053740747,0.005459081,0.04276781,0.002620986],"about_ca_topic_score_codex":0.00005297425,"about_ca_topic_score_gemma":0.00003269323,"teacher_disagreement_score":0.07161878,"about_ca_system_score_codex":0.00009959529,"about_ca_system_score_gemma":0.000016054119,"threshold_uncertainty_score":0.99986786},"labels":[],"label_agreement":null},{"id":"W2952154984","doi":"10.48550/arxiv.0712.2553","title":"Constructions for Difference Triangle Sets","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","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 Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.04885016559136222,"score_gpt":0.2627568006893815,"score_spread":0.2139066350980193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952154984","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.97163093,0.00065665826,0.015910447,0.000022919021,0.0044246796,0.00057826156,0.00015699829,0.0004986937,0.0061203954],"genre_scores_gemma":[0.99823844,0.000044062053,0.00050078816,0.000023928584,0.00032053917,0.00018916246,0.00007146267,0.000050492847,0.000561096],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99892825,0.000030474517,0.0003528805,0.00028573239,0.000091868686,0.0003107689],"domain_scores_gemma":[0.99915665,0.00014802218,0.00007172808,0.00047477393,0.00005266947,0.00009613132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024197991,0.00026404797,0.00037989003,0.00014033032,0.00009189112,0.00003177527,0.000255674,0.00034780812,0.000055503464],"category_scores_gemma":[0.000045040393,0.00027048984,0.00023494224,0.00010115942,0.0000657783,0.000032682477,0.00007435503,0.0004120333,0.00007530008],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003845742,0.0004674282,0.72196656,0.011042602,0.0040104454,0.00012050227,0.005949947,0.027029693,0.037351716,0.0823652,0.018716978,0.09059436],"study_design_scores_gemma":[0.008122365,0.000372572,0.59270895,0.0034936669,0.0012618775,0.00030590082,0.0027912625,0.022334034,0.058752768,0.1366885,0.16571014,0.0074579976],"about_ca_topic_score_codex":0.0000124129465,"about_ca_topic_score_gemma":0.000017683573,"teacher_disagreement_score":0.14699315,"about_ca_system_score_codex":0.000051595875,"about_ca_system_score_gemma":0.000026140644,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2952485320","doi":"10.48550/arxiv.1209.4315","title":"Unbiased complex Hadamard matrices and bases","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Lethbridge","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Mathematics; Hadamard matrix; Order (exchange); Hadamard product; Mutually unbiased bases; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.07804646999801362,"score_gpt":0.16152805242667231,"score_spread":0.08348158242865869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952485320","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.9793056,0.0007857116,0.007840841,0.000007770669,0.00066773477,0.00023948266,0.00010113256,0.00049829204,0.010553405],"genre_scores_gemma":[0.9989533,0.0003394335,0.00008645327,0.000019210092,0.00011617318,9.542387e-7,0.000041792893,0.000035488338,0.00040718616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990604,0.00008738735,0.00014898463,0.00035672335,0.000046545585,0.00029996983],"domain_scores_gemma":[0.9991842,0.000093544586,0.000071114795,0.0004436193,0.000032990854,0.00017455159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001559672,0.0002954175,0.00032996517,0.00019242163,0.00008877842,0.000048918086,0.00030298848,0.00023395864,0.00015870828],"category_scores_gemma":[0.0000068509453,0.00034387596,0.00012415448,0.00020804344,0.00009121539,0.00014436149,0.00023646202,0.0003222282,0.00007664685],"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.00022622291,0.00025082947,0.08021797,0.005330009,0.0016451622,0.0006823342,0.0013777193,0.6766871,0.0025392107,0.21709314,0.011569202,0.0023810521],"study_design_scores_gemma":[0.0032142668,0.0001165597,0.05888504,0.0011919982,0.0016975984,0.00007430027,0.0022199496,0.80627507,0.0015035555,0.053930614,0.065890096,0.005000967],"about_ca_topic_score_codex":0.00007945027,"about_ca_topic_score_gemma":0.000027204602,"teacher_disagreement_score":0.16316253,"about_ca_system_score_codex":0.000060446724,"about_ca_system_score_gemma":0.000013885696,"threshold_uncertainty_score":0.99990135},"labels":[],"label_agreement":null},{"id":"W2952647283","doi":"10.4169/193009709x458564","title":"Almost All Integer Matrices Have No Integer Eigenvalues","year":2009,"lang":"en","type":"article","venue":"American Mathematical Monthly","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":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fell; Integer (computer science); Mathematics; Psychology; Library science; Mathematics education; Computer science; Geology","score_opus":0.007926610431278803,"score_gpt":0.2291393352006122,"score_spread":0.2212127247693334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952647283","genre_codex":"other","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.2414054,0.00082995807,0.014046489,0.00040142777,0.00041288152,0.0006060908,0.000033424087,0.0014585933,0.74080575],"genre_scores_gemma":[0.9958344,0.000039778166,0.0028620516,0.0004216641,0.00015437715,0.000033916585,0.000007928234,0.000051158248,0.0005947442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839056,0.00007057342,0.00049268175,0.00026911567,0.000279493,0.0004975645],"domain_scores_gemma":[0.9989826,0.00018908294,0.00008652351,0.00046860485,0.000055212156,0.00021798073],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025657157,0.000334104,0.0005510715,0.00012326246,0.000052973577,0.00007709242,0.00031614868,0.00007904638,0.00034239024],"category_scores_gemma":[0.00010323259,0.0002730075,0.00019517698,0.00025496885,0.00019891352,0.00016353324,0.000027907663,0.00026673934,0.0016964236],"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.00041501576,0.0021507812,0.0023479054,0.0019249119,0.0020547444,0.0005657961,0.021982916,0.01044651,0.016706726,0.7538828,0.13244092,0.055080913],"study_design_scores_gemma":[0.0011002489,0.0018353239,0.004568949,0.0010536562,0.00042838618,0.00013006375,0.004548956,0.20307389,0.0053687613,0.69257456,0.081905745,0.0034114385],"about_ca_topic_score_codex":0.000039510112,"about_ca_topic_score_gemma":0.000004495361,"teacher_disagreement_score":0.754429,"about_ca_system_score_codex":0.0000500714,"about_ca_system_score_gemma":0.000007688718,"threshold_uncertainty_score":0.9999722},"labels":[],"label_agreement":null},{"id":"W2953081283","doi":"10.48550/arxiv.1410.7437","title":"Pairwise balanced designs covered by bounded flats","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Victoria","funders":"","keywords":"Bounded function; Pairwise comparison; Divisibility rule; Dimension (graph theory); Mathematics; Upper and lower bounds; Combinatorics; Constant (computer programming); Point (geometry); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Statistics","score_opus":0.04302344133253318,"score_gpt":0.15336017190741844,"score_spread":0.11033673057488526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953081283","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.85417396,0.00022280669,0.1315499,0.000006720344,0.0014210023,0.00040368093,0.00010938417,0.00090917177,0.011203402],"genre_scores_gemma":[0.9971423,0.00013538315,0.00004081159,0.000033363325,0.00009914041,0.0000027616722,0.00010446486,0.000069012494,0.0023727564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984155,0.00018218397,0.00023714294,0.00064346223,0.00007946755,0.0004421916],"domain_scores_gemma":[0.99863505,0.00008404213,0.000117010226,0.0008936755,0.000056528977,0.00021369234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025171763,0.000447229,0.000504733,0.00015861973,0.00011728502,0.00007465207,0.0006695577,0.00050555397,0.00012237062],"category_scores_gemma":[0.000016766202,0.0005521257,0.00027073483,0.00025603533,0.00009847871,0.00012630508,0.00019824713,0.0005729418,0.00025968993],"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.00015822488,0.000094080315,0.002978047,0.0009128145,0.0007276462,0.00020048692,0.00031996204,0.9167998,0.004421567,0.045075588,0.028068168,0.00024360642],"study_design_scores_gemma":[0.0034418341,0.00016276201,0.0009050233,0.0007584489,0.0005371625,0.000015686444,0.00030083497,0.79823965,0.007909762,0.15139225,0.0328425,0.0034940923],"about_ca_topic_score_codex":0.000040081926,"about_ca_topic_score_gemma":0.000015373758,"teacher_disagreement_score":0.14296837,"about_ca_system_score_codex":0.00020474604,"about_ca_system_score_gemma":0.00003928152,"threshold_uncertainty_score":0.99969304},"labels":[],"label_agreement":null},{"id":"W2953272544","doi":"","title":"A Bound on the Size of Separating Hash Families.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","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 Waterloo","funders":"","keywords":"Hash function; Perfect hash function; Upper and lower bounds; Collision resistance; Computer science; Mathematics; Theoretical computer science; Cryptographic hash function; Discrete mathematics; Combinatorics; Algorithm; Computer security","score_opus":0.015310997025844715,"score_gpt":0.24073128244675535,"score_spread":0.22542028542091064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953272544","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.82597435,0.0002713381,0.07101024,0.00010483681,0.0015715843,0.0006824971,0.000079497724,0.00025203478,0.1000536],"genre_scores_gemma":[0.9921291,0.00009169268,0.007258983,0.00011136104,0.00018224731,0.00013846309,0.000016922575,0.00006359014,0.000007669469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776375,0.000328808,0.0007116285,0.00045671407,0.00023121608,0.0005078815],"domain_scores_gemma":[0.9962814,0.00233209,0.00023126183,0.001018476,0.000049712355,0.00008706522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008265266,0.00045966587,0.00071023754,0.00020352277,0.00012619628,0.00003240067,0.00073319714,0.00038898643,0.00013939518],"category_scores_gemma":[0.00023971644,0.000367839,0.0003487095,0.0001317594,0.0005278024,0.000021792268,0.00047154527,0.0015743893,0.00013336017],"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.00008169219,0.00005112591,0.0011564589,0.00038108503,0.00048670327,0.00003695108,0.0050445558,0.02383112,0.005399918,0.96137786,0.00086393545,0.0012885671],"study_design_scores_gemma":[0.00034674528,0.00008639833,0.005735864,0.0005164563,0.00007243894,0.00004066234,0.001343426,0.004548203,0.010107768,0.97345287,0.0031590378,0.0005901469],"about_ca_topic_score_codex":0.00003843635,"about_ca_topic_score_gemma":0.00008893552,"teacher_disagreement_score":0.1661547,"about_ca_system_score_codex":0.00005040247,"about_ca_system_score_gemma":0.00005642428,"threshold_uncertainty_score":0.99987733},"labels":[],"label_agreement":null},{"id":"W2954351703","doi":"","title":"Improvement to lotto design tables","year":2005,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.002336055304463867,"score_gpt":0.12893826632894323,"score_spread":0.12660221102447936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954351703","genre_codex":"other","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.18260309,0.002752458,0.00070815923,0.00061244844,0.00251972,0.0012407361,0.000752179,0.000106899904,0.8087043],"genre_scores_gemma":[0.96203375,0.00019900946,0.0007422499,0.00034126145,0.00013594597,0.000055537876,0.000069622634,0.000071758346,0.036350884],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980452,0.000031408497,0.0003469757,0.00022687994,0.001026992,0.00032250918],"domain_scores_gemma":[0.99933237,0.00009765829,0.00008377644,0.0002087532,4.4507664e-7,0.00027698182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000011949177,0.00030312987,0.00033115153,0.000042333966,0.00009393472,0.00002678225,0.00023781093,0.000055409782,0.000059543236],"category_scores_gemma":[0.0000012140273,0.0003138588,0.00003381651,0.00007915948,0.000011811774,0.0001677922,0.00002662869,0.00014920474,9.204463e-9],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022570323,0.00009372283,0.00093593204,0.0064868527,0.001304236,0.00022224718,0.0016245799,0.034747683,0.5396312,0.20071475,0.03601297,0.1759688],"study_design_scores_gemma":[0.0004268275,0.00018628435,0.0042443885,0.00082149036,0.00007705618,0.000004455872,0.009841036,0.0037522016,0.8425243,0.0014739801,0.13552752,0.001120437],"about_ca_topic_score_codex":0.00092875346,"about_ca_topic_score_gemma":0.056505356,"teacher_disagreement_score":0.7794306,"about_ca_system_score_codex":0.000011303419,"about_ca_system_score_gemma":0.000571252,"threshold_uncertainty_score":0.99993134},"labels":[],"label_agreement":null},{"id":"W2962755011","doi":"10.1007/s00493-018-3859-1","title":"Improved Bounds for Rota's Basis Conjecture","year":2018,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Combinatorics; Disjoint sets; Conjecture; Rank (graph theory); Basis (linear algebra); Discrete mathematics; Geometry","score_opus":0.00628664731631921,"score_gpt":0.2029663673454901,"score_spread":0.1966797200291709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962755011","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.8779779,0.002499342,0.03673149,0.0002980533,0.016926894,0.0018158425,0.00007011511,0.0024815795,0.06119877],"genre_scores_gemma":[0.99895865,0.0000048790175,0.000114766226,0.00004043472,0.00021902415,0.00010001499,0.0000048476013,0.00003595235,0.0005214528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939215,0.000015923757,0.00013926749,0.00014121844,0.0000604096,0.00025103643],"domain_scores_gemma":[0.99952644,0.000053146057,0.000021259691,0.00026640852,0.000058551806,0.00007417218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012191728,0.00013288727,0.00016390624,0.000050940034,0.0001281544,0.000039012364,0.00017192501,0.0001024797,0.00005665069],"category_scores_gemma":[0.0000245798,0.0001254423,0.00008373619,0.00018282005,0.00004708274,0.00005688271,0.00001520841,0.00008054731,0.000042564097],"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.00011132211,0.00016489587,0.00085020275,0.00047991032,0.00041530488,0.000006530828,0.0022209957,0.000030788175,0.042178337,0.8146121,0.12177089,0.017158741],"study_design_scores_gemma":[0.0020548834,0.0006960833,0.0004284656,0.000042787175,0.000057602952,0.000015527532,0.00012560446,0.012146552,0.071983576,0.14340682,0.7683808,0.0006613082],"about_ca_topic_score_codex":0.0000034323425,"about_ca_topic_score_gemma":0.0000020852524,"teacher_disagreement_score":0.6712053,"about_ca_system_score_codex":0.000043375112,"about_ca_system_score_gemma":0.000009662911,"threshold_uncertainty_score":0.5115388},"labels":[],"label_agreement":null},{"id":"W2962843004","doi":"10.1016/j.disc.2017.09.009","title":"On a class of quaternary complex Hadamard matrices","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Japan Society for the Promotion of Science; Soochow University; Universities Space Research Association","keywords":"Mathematics; Hadamard transform; Complex Hadamard matrix; Class (philosophy); Combinatorics; Complex matrix; Association scheme; Derangement; Unit (ring theory); Skew; Complex conjugate; Discrete mathematics; Hadamard matrix; Algebra over a field; Pure mathematics","score_opus":0.025179432586805526,"score_gpt":0.2555797424418448,"score_spread":0.23040030985503926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962843004","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.90585196,0.00006751841,0.0033127822,0.000040631377,0.00027123129,0.00017954015,0.00004129664,0.00013416089,0.09010089],"genre_scores_gemma":[0.9985316,0.000012434196,0.0011608845,0.0000074477093,0.000033584474,0.000009383483,0.000004202648,0.000028033588,0.00021242353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993397,0.000014175612,0.0002562642,0.000083363106,0.00016133109,0.00014519054],"domain_scores_gemma":[0.9991007,0.00007256112,0.00013357268,0.0006338799,0.000016898613,0.0000424163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015582878,0.00013175487,0.00025243405,0.000049961593,0.00009930361,0.000060998223,0.00038569403,0.000051506748,0.000058388585],"category_scores_gemma":[0.000032725566,0.00010792729,0.00009174724,0.00002765952,0.00006628547,0.00007870101,0.00003836707,0.00007263245,0.00008066022],"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.000054839642,0.0001986793,0.001972029,0.0055839997,0.00048972166,0.00004992623,0.006286601,0.0032737225,0.020136487,0.9513372,0.008455267,0.0021614938],"study_design_scores_gemma":[0.0016690143,0.00033435147,0.0061960337,0.0019830472,0.0001856903,0.000047972786,0.0023324017,0.61016047,0.020849345,0.34887692,0.0060962173,0.0012685214],"about_ca_topic_score_codex":0.0000068992504,"about_ca_topic_score_gemma":0.000002938809,"teacher_disagreement_score":0.60688674,"about_ca_system_score_codex":0.00000960344,"about_ca_system_score_gemma":0.0000027763604,"threshold_uncertainty_score":0.4401147},"labels":[],"label_agreement":null},{"id":"W2962864308","doi":"10.1016/j.spl.2019.03.015","title":"Compatible matrices of Spearman’s rank correlation","year":2019,"lang":"en","type":"article","venue":"Statistics & Probability Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"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; National Natural Science Foundation of China","keywords":"Mathematics; Spearman's rank correlation coefficient; Rank correlation; Equivalence (formal languages); Correlation; Combinatorics; Multivariate random variable; Pure mathematics; Statistics; Random variable; Geometry","score_opus":0.005913167016695225,"score_gpt":0.18834138159091088,"score_spread":0.18242821457421565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962864308","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.74708414,0.00004954909,0.25058678,0.000025635374,0.00051262864,0.00033921775,0.00010179612,0.00008758586,0.0012126521],"genre_scores_gemma":[0.97735494,0.000004471067,0.02248811,0.000036046036,0.0000221474,0.000008106845,0.000040729446,0.000016365182,0.00002910615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991602,0.0000643435,0.0003147573,0.00013545628,0.00016509235,0.00016019303],"domain_scores_gemma":[0.9994596,0.00014787914,0.00006481198,0.0002537449,0.00003856246,0.00003539583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026724848,0.00011227597,0.0002029435,0.00006116627,0.000021706086,0.000013746475,0.00011166981,0.000037746875,0.0001896661],"category_scores_gemma":[0.0000183491,0.00011440217,0.00003873138,0.00013831677,0.000072803356,0.000083532665,0.000012566916,0.00010930496,0.0001624271],"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.00014795229,0.00016599972,0.2862682,0.006273748,0.000282249,0.000009418207,0.004398893,0.09823757,0.07246336,0.5066969,0.021088334,0.0039673946],"study_design_scores_gemma":[0.0038333994,0.0004081524,0.1974646,0.00053407706,0.00027626424,0.000023755758,0.00020850563,0.26673052,0.010083698,0.51028275,0.008176029,0.0019782723],"about_ca_topic_score_codex":0.000036048466,"about_ca_topic_score_gemma":0.000010117656,"teacher_disagreement_score":0.23027077,"about_ca_system_score_codex":0.000040585346,"about_ca_system_score_gemma":0.000007094994,"threshold_uncertainty_score":0.46651852},"labels":[],"label_agreement":null},{"id":"W2962894756","doi":"10.1109/allerton.2014.7028540","title":"LP-decodable multipermutation codes","year":2014,"lang":"en","type":"article","venue":"","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":"Decoding methods; Multiset; Class (philosophy); Mathematics; Code (set theory); Discrete mathematics; Algorithm; Characterization (materials science); Combinatorics; Computer science","score_opus":0.0032613149007874593,"score_gpt":0.1643744718189831,"score_spread":0.16111315691819564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962894756","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.64776224,0.000055642653,0.11138096,0.000015623533,0.00046746383,0.00007927636,0.0000025670358,0.000739114,0.23949711],"genre_scores_gemma":[0.9984878,0.0000024699575,0.00046574709,0.000024305615,0.000044606262,0.000008102298,0.0000048531056,0.000009860906,0.0009522784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972594,0.0000171589,0.00007605645,0.000051927607,0.000040268445,0.0000886228],"domain_scores_gemma":[0.9998319,0.00003385601,0.000005381139,0.00009197197,0.000009356722,0.000027509126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011872022,0.000049628874,0.000060277856,0.000026403397,0.000025833566,0.000015515596,0.000042732387,0.000028470296,0.00012850291],"category_scores_gemma":[0.000010237857,0.00004311169,0.000020488442,0.0000484375,0.000007281066,0.00006336177,0.0000029663877,0.000029126244,0.0002233507],"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.000015169192,0.000056494704,0.0060286536,0.00038485197,0.00012463085,0.0000033534968,0.0018482229,0.16826071,0.11815634,0.6150944,0.020388668,0.06963847],"study_design_scores_gemma":[0.00059181097,0.000039595576,0.0033332044,0.000032769094,0.00001268949,0.000010835684,0.00041394177,0.8300307,0.06718292,0.015522319,0.0824419,0.00038731753],"about_ca_topic_score_codex":0.00000943349,"about_ca_topic_score_gemma":0.000014101271,"teacher_disagreement_score":0.66177,"about_ca_system_score_codex":0.000005854343,"about_ca_system_score_gemma":8.2875124e-7,"threshold_uncertainty_score":0.28707957},"labels":[],"label_agreement":null},{"id":"W2963006461","doi":"10.31799/1684-8853-2018-4-2-8","title":"Symmetric Hadamard Matrices of Orders 268, 412, 436 and 604","year":2018,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hadamard transform; Mathematics; Complex Hadamard matrix; Rectangle; Hadamard product; Symmetric-key algorithm; Hadamard matrix; Algorithm; Computer science; Mathematical analysis; Geometry; Encryption","score_opus":0.002750279093694454,"score_gpt":0.1635226526549562,"score_spread":0.16077237356126173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963006461","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.91551447,0.00673337,0.02030975,0.000047623285,0.0017241562,0.0008653665,0.00006396619,0.00032703378,0.05441428],"genre_scores_gemma":[0.9997448,0.000081684804,0.000008739165,0.000037719714,0.000071363,0.000019607227,0.0000034843397,0.0000057207426,0.000026925563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992688,0.000031175638,0.00039662668,0.000050078594,0.00012523393,0.00012812304],"domain_scores_gemma":[0.99958646,0.000054816795,0.00010656148,0.00010179065,0.00008999299,0.000060395112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031818618,0.00010269998,0.00021454817,0.00024176059,0.00006206187,0.00009080448,0.000059623337,0.000073855444,0.0000067355527],"category_scores_gemma":[0.000021155505,0.000087530316,0.000026455611,0.00023309102,0.00005129137,0.0005155468,0.0000075531516,0.000046218272,0.000030240406],"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.000781515,0.00010621028,0.041061178,0.016539684,0.0022953316,0.000009109767,0.022545116,0.009866393,0.009451389,0.63621116,0.016817441,0.24431549],"study_design_scores_gemma":[0.008732447,0.000587057,0.013255602,0.000569704,0.00017760176,0.00021102975,0.0076836753,0.6826611,0.0007496868,0.00071206625,0.28363943,0.0010205719],"about_ca_topic_score_codex":0.00011292608,"about_ca_topic_score_gemma":0.0000046198275,"teacher_disagreement_score":0.67279476,"about_ca_system_score_codex":0.000009401209,"about_ca_system_score_gemma":0.0000064234296,"threshold_uncertainty_score":0.35693827},"labels":[],"label_agreement":null},{"id":"W2963014173","doi":"10.46298/dmtcs.635","title":"Sequence variations of the 1-2-3 conjecture and irregularity strength","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Graph; Upper and lower bounds; Sequence (biology); Weighting; Discrete mathematics","score_opus":0.007904307775328885,"score_gpt":0.21123517022535293,"score_spread":0.20333086245002405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963014173","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.61652106,0.00003643681,0.37872267,0.00020678554,0.00032615516,0.00037002438,0.0000159675,0.00009936574,0.0037015348],"genre_scores_gemma":[0.980316,0.0000018926761,0.019609919,0.000024827787,0.000022849723,0.000010899184,5.475239e-7,0.000008680844,0.0000044278027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990205,0.000046467183,0.00024317234,0.00017158139,0.00029101563,0.00022724217],"domain_scores_gemma":[0.9991466,0.00018036421,0.000047853602,0.0004611205,0.00006895789,0.00009512553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045628802,0.00013075443,0.00017240435,0.000045924822,0.00017924613,0.00012634705,0.0005745075,0.000046955105,0.00006382981],"category_scores_gemma":[0.000054985936,0.00007993824,0.00005093602,0.00039236582,0.0019816149,0.00017110255,0.00018029613,0.00013775536,0.000008215853],"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":[2.2064867e-7,0.000010676975,0.000048156457,0.00006780405,0.0000072312255,1.8936846e-7,0.0009530612,0.00015254495,0.0031046276,0.9950898,0.000014058559,0.00055159425],"study_design_scores_gemma":[0.000052253417,0.000015016401,0.000647294,0.000058191043,0.000009515046,0.000014502587,0.00005829984,0.46643937,0.0026342473,0.52997565,0.0000062985678,0.00008935005],"about_ca_topic_score_codex":0.0000030545173,"about_ca_topic_score_gemma":5.7067047e-7,"teacher_disagreement_score":0.46628684,"about_ca_system_score_codex":0.000011529888,"about_ca_system_score_gemma":0.000017571201,"threshold_uncertainty_score":0.73013425},"labels":[],"label_agreement":null},{"id":"W2963042986","doi":"10.1090/s0002-9939-2011-11462-x","title":"The elementary divisors of the incidence matrix of skew lines in PG(3,k)","year":2011,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"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":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Skew; Mathematics; Matrix (chemical analysis); Incidence (geometry); Incidence matrix; Pure mathematics; Combinatorics; Physics; Computer science; Geometry; Telecommunications; Materials science","score_opus":0.009929396429302413,"score_gpt":0.21955839910662525,"score_spread":0.20962900267732285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963042986","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.99746007,0.00013087851,0.00008513285,0.00010340695,0.000053576314,0.0002790379,0.0000047749604,0.000024388615,0.0018587528],"genre_scores_gemma":[0.99798936,0.0000709325,0.0018112992,0.00002438193,0.00001578388,0.000025213862,5.7312807e-8,0.00001740322,0.000045597357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998833,0.000017035125,0.00054091675,0.00010127683,0.0002959248,0.00021183006],"domain_scores_gemma":[0.9991481,0.00016027177,0.00038025153,0.00020588662,0.0000768725,0.000028627854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007334017,0.0001363858,0.00034465085,0.00001481346,0.00006846556,0.000007365169,0.0008577811,0.000033999568,0.00001371277],"category_scores_gemma":[0.00013410416,0.00006700496,0.0003258466,0.00056071114,0.0008096701,0.00007034819,0.00019970728,0.00018010881,0.0000015323135],"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.00013846932,0.0007057215,0.27647507,0.006859576,0.0009427409,2.6810164e-7,0.07237633,0.000120699784,0.21380249,0.4206944,0.0042478885,0.0036363357],"study_design_scores_gemma":[0.00060956663,0.00023773624,0.10673737,0.0017511371,0.00025547805,0.000015647689,0.039075434,0.008633778,0.2865789,0.55530155,0.0002363429,0.0005670642],"about_ca_topic_score_codex":0.000059046226,"about_ca_topic_score_gemma":0.0000026731116,"teacher_disagreement_score":0.16973771,"about_ca_system_score_codex":0.00002299317,"about_ca_system_score_gemma":0.000010048902,"threshold_uncertainty_score":0.2983263},"labels":[],"label_agreement":null},{"id":"W2963103783","doi":"","title":"Poncelet's Theorem in the four non-isomorphic finite projective planes of order 9.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective test; Order (exchange); Projective plane; Pure mathematics; Geometry; Business","score_opus":0.010041789105039441,"score_gpt":0.20594157992666806,"score_spread":0.19589979082162862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963103783","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.9829264,0.00007474606,0.000043152326,0.000027114564,0.0012222376,0.0003030861,0.000009635352,0.00005571447,0.015337898],"genre_scores_gemma":[0.9998348,0.0000071815143,0.000016571603,0.000030055826,0.000022026987,0.000042061172,0.000004379103,0.000015899184,0.000027046593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918747,0.00011853115,0.00020959394,0.0001250264,0.0001505602,0.00020881812],"domain_scores_gemma":[0.9993189,0.00024525516,0.00004433427,0.00029788222,0.000071506896,0.000022123355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941224,0.00013589676,0.00018938092,0.00009295201,0.0000513021,0.000016819415,0.0002970537,0.00008093111,0.000029268724],"category_scores_gemma":[0.000052021853,0.000099160134,0.000040863786,0.0004997159,0.00012150428,0.00007634577,0.000019413807,0.00016475457,0.0000576752],"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.00009019828,0.00013521645,0.008851358,0.00015561271,0.00010839105,0.00003536329,0.014541521,0.0003133554,0.0017521012,0.9713068,0.002111047,0.0005990573],"study_design_scores_gemma":[0.0024702759,0.0006689064,0.020118145,0.0002660771,0.00004211313,0.000051130195,0.003586414,0.007225975,0.011559797,0.9501237,0.0032780592,0.000609398],"about_ca_topic_score_codex":0.00004214072,"about_ca_topic_score_gemma":0.000026896987,"teacher_disagreement_score":0.02118307,"about_ca_system_score_codex":0.000015472178,"about_ca_system_score_gemma":0.000016950955,"threshold_uncertainty_score":0.40436327},"labels":[],"label_agreement":null},{"id":"W2963166896","doi":"10.1016/j.disc.2018.02.020","title":"On the Hamilton–Waterloo Problem with cycle lengths of distinct parities","year":2018,"lang":"en","type":"article","venue":"Institutional Research Information System (Università degli Studi di Brescia)","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":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Hamiltonian path; Discrete mathematics; Graph","score_opus":0.02751061785749115,"score_gpt":0.23636552794200022,"score_spread":0.20885491008450907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963166896","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.8150371,0.000033450022,0.004407491,0.00009297928,0.00024721064,0.0007216902,0.00011347416,0.00018245711,0.17916416],"genre_scores_gemma":[0.99960923,0.00000414791,0.00003986499,0.000012508606,0.0000785874,0.0000494239,0.000020149719,0.0000093498575,0.00017670625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9977815,0.00018211693,0.0003332778,0.00013258817,0.0011805941,0.000389924],"domain_scores_gemma":[0.9984063,0.0002732574,0.00008777762,0.00033042842,0.0008037697,0.0000984937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013296677,0.0001665141,0.0002090969,0.00044989033,0.0011552393,0.00010692475,0.0004650527,0.00008186265,0.000033565753],"category_scores_gemma":[0.000055899614,0.00011871616,0.00006350209,0.0008392008,0.0009007261,0.0011679111,0.000086928165,0.00027840753,0.00034151293],"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.00025356893,0.000032475004,0.0010165112,0.0006527937,0.00022178738,0.00001196164,0.0076893168,0.007080477,0.000043211643,0.9798218,0.0021098622,0.0010662153],"study_design_scores_gemma":[0.015107499,0.0060330844,0.128487,0.014325461,0.00028026037,0.0009144318,0.42627946,0.15179726,0.011564934,0.011184144,0.22994989,0.0040765707],"about_ca_topic_score_codex":0.00014134862,"about_ca_topic_score_gemma":0.00008821607,"teacher_disagreement_score":0.9686377,"about_ca_system_score_codex":0.00033413398,"about_ca_system_score_gemma":0.00013524371,"threshold_uncertainty_score":0.88852835},"labels":[],"label_agreement":null},{"id":"W2963225498","doi":"10.4230/lipics.itcs.2019.54","title":"On the Communication Complexity of High-Dimensional Permutations","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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 Toronto","funders":"","keywords":"Integer (computer science); Communication complexity; Combinatorics; Abelian group; Discrete mathematics; Extension (predicate logic); Mathematics; Variety (cybernetics); Group (periodic table); Computational complexity theory; Computer science; Theoretical computer science; Algorithm","score_opus":0.022459193858593098,"score_gpt":0.23265221125104732,"score_spread":0.21019301739245422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963225498","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.9790958,0.000025481446,0.009068904,0.00021854014,0.0005380753,0.0006521766,0.00056651037,0.00015184555,0.009682625],"genre_scores_gemma":[0.99817544,0.0000044339595,0.0010596621,0.00024784368,0.000054082462,0.000066234395,0.00030292515,0.000025177731,0.00006417122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.0000524342,0.0006224979,0.00007433007,0.00024563406,0.00025384242],"domain_scores_gemma":[0.99865806,0.00025471766,0.00016052231,0.000649036,0.00021865798,0.00005898282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046286386,0.00018557477,0.00022989999,0.000117073854,0.00035642445,0.00005191149,0.00045221334,0.00009681458,0.00014497747],"category_scores_gemma":[0.000054098386,0.00013779393,0.00012309113,0.00019524264,0.0004263083,0.00026967438,0.00006945809,0.00021893297,0.00016085929],"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.00010132287,0.00015960961,0.000286551,0.00031920095,0.00025043596,2.4324476e-7,0.010709493,0.0025538295,0.00028333926,0.9707324,0.013597055,0.0010065073],"study_design_scores_gemma":[0.006648645,0.0012129535,0.009905057,0.001232771,0.00021328051,0.00008906255,0.009446153,0.5976141,0.026593544,0.30742073,0.037930887,0.0016928075],"about_ca_topic_score_codex":0.000019469258,"about_ca_topic_score_gemma":0.00003312678,"teacher_disagreement_score":0.66331166,"about_ca_system_score_codex":0.000041832,"about_ca_system_score_gemma":0.000013832225,"threshold_uncertainty_score":0.56190735},"labels":[],"label_agreement":null},{"id":"W2963226514","doi":"","title":"Embedding quartic Eulerian digraphs on the plane","year":2017,"lang":"en","type":"article","venue":"Monash University Research Portal (Monash University)","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":"Simon Fraser University","funders":"Marsden Fund; Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Royal Society Te Apārangi","keywords":"Eulerian path; Mathematics; Embedding; Quartic function; Plane (geometry); Combinatorics; Order (exchange); Discrete mathematics; Pure mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.04115052752114146,"score_gpt":0.2518270147430473,"score_spread":0.21067648722190585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963226514","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.7179598,0.000026600266,0.00005965395,0.00032289815,0.00024892052,0.00032818023,0.00006196337,0.00023693239,0.280755],"genre_scores_gemma":[0.9835191,0.00011668348,0.000014466914,0.000011985275,0.000076171505,4.968752e-7,0.000016155596,0.000032009382,0.016212966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975293,0.00035152084,0.00014343257,0.00045256148,0.0006828264,0.0008403262],"domain_scores_gemma":[0.99787706,0.00032448102,0.00008202381,0.0012136506,0.0001459456,0.00035681925],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007970039,0.0002800972,0.00027743753,0.00075246394,0.0029049579,0.0002252077,0.0019791608,0.00018779293,0.0003698944],"category_scores_gemma":[0.000080487494,0.0002770123,0.00022092192,0.000621037,0.00073884294,0.0006654807,0.00036698722,0.0008665147,0.00031400681],"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.00093591335,0.0004064281,0.022036672,0.00025391494,0.0011093143,0.013575802,0.0031506375,0.0051263175,0.007807261,0.888056,0.054067567,0.0034742164],"study_design_scores_gemma":[0.0038199106,0.0008008927,0.048205882,0.0006126624,0.00017980725,0.00008105702,0.05551312,0.012404902,0.0043723043,0.0041992157,0.86761135,0.0021988722],"about_ca_topic_score_codex":0.00030785945,"about_ca_topic_score_gemma":0.00045466132,"teacher_disagreement_score":0.8838567,"about_ca_system_score_codex":0.0001619721,"about_ca_system_score_gemma":0.00006594143,"threshold_uncertainty_score":0.99996823},"labels":[],"label_agreement":null},{"id":"W2963299192","doi":"10.1016/j.disc.2019.04.013","title":"The Hamilton–Waterloo Problem with even cycle lengths","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Hamiltonian path; Discrete mathematics; Graph","score_opus":0.0029876957720433657,"score_gpt":0.17190028242807048,"score_spread":0.16891258665602712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963299192","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.9380366,0.00021171752,0.001960362,0.00004123995,0.00020412776,0.0005888128,0.000009187315,0.00032060794,0.058627315],"genre_scores_gemma":[0.9953853,0.000021179118,0.001252364,0.000009259767,0.000032552685,0.00005008467,0.000004396586,0.000056090063,0.0031887963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991765,0.000023384122,0.00022502251,0.00011338083,0.00018535228,0.000276336],"domain_scores_gemma":[0.9993213,0.0000983228,0.000044301316,0.00046635667,0.000021265438,0.000048449318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025120802,0.00016810809,0.00018219181,0.00002469503,0.00009625885,0.000087518216,0.00025621973,0.000050624527,0.00003302875],"category_scores_gemma":[0.0000040510267,0.00009346914,0.000057819827,0.000109678345,0.00004191852,0.00009538827,0.00001896516,0.00012579476,0.00041445624],"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.00008656089,0.00017079666,0.0023095892,0.00544406,0.0012620509,0.00003173481,0.072565116,0.045343593,0.012581821,0.8521362,0.003206465,0.0048620244],"study_design_scores_gemma":[0.0042846138,0.0008872481,0.001045096,0.0029205836,0.00038451375,0.0003672748,0.03854246,0.45934764,0.025568513,0.3435167,0.11931978,0.0038155618],"about_ca_topic_score_codex":0.0000029815078,"about_ca_topic_score_gemma":0.000011148603,"teacher_disagreement_score":0.5086195,"about_ca_system_score_codex":0.000016884745,"about_ca_system_score_gemma":0.0000057247807,"threshold_uncertainty_score":0.5327135},"labels":[],"label_agreement":null},{"id":"W2963525585","doi":"10.1016/j.disc.2018.10.021","title":"Balancedly splittable Hadamard matrices","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Japan Society for the Promotion of Science; Soochow University","keywords":"Mathematics; Hadamard transform; Complex Hadamard matrix; Hadamard product; Combinatorics; Association scheme; Hadamard matrix; Hadamard's inequality; Diagonalizable matrix; Hadamard three-lines theorem; Connection (principal bundle); Discrete mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Geometry; Mathematical analysis","score_opus":0.007210121603247261,"score_gpt":0.21108673985639514,"score_spread":0.20387661825314787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963525585","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.56061727,0.0007366225,0.04958087,0.00004002554,0.0011416562,0.00034919856,0.000036652393,0.001105214,0.3863925],"genre_scores_gemma":[0.993149,0.000022662834,0.0054106447,0.000021654869,0.00024199071,0.000018808467,0.000005189844,0.000043331365,0.0010867605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992206,0.000012941158,0.00024120865,0.00011287971,0.00014842144,0.00026391188],"domain_scores_gemma":[0.99947387,0.00004332737,0.000038120117,0.00034604844,0.00003193264,0.000066696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019297385,0.00015319187,0.0002033851,0.00005527951,0.00007796019,0.00006377235,0.00020366738,0.0000638263,0.00023313159],"category_scores_gemma":[0.00001702919,0.0001298989,0.00006571943,0.00019451178,0.00006326123,0.00011505063,0.00002558703,0.00007496161,0.00073033787],"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.00003795022,0.00018665093,0.0021817486,0.0052790227,0.0006609442,0.00004283182,0.018313248,0.0014240715,0.032427043,0.86734563,0.06728515,0.0048156977],"study_design_scores_gemma":[0.0017619827,0.0004049078,0.001151019,0.0013855589,0.0002939974,0.00019033543,0.007414642,0.3256403,0.07663989,0.3650869,0.21710062,0.0029298598],"about_ca_topic_score_codex":0.0000023218595,"about_ca_topic_score_gemma":0.0000032470712,"teacher_disagreement_score":0.5022587,"about_ca_system_score_codex":0.000016471495,"about_ca_system_score_gemma":0.000004613261,"threshold_uncertainty_score":0.93872595},"labels":[],"label_agreement":null},{"id":"W2963653441","doi":"10.1007/s10623-019-00622-z","title":"Linked systems of symmetric group divisible designs of type II","year":2019,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Japan Society for the Promotion of Science; Soochow University","keywords":"Mathematics; Affine transformation; Group (periodic table); Equivalence (formal languages); Type (biology); Orthogonal array; Symmetric group; Combinatorics; Pure mathematics; Physics; Statistics","score_opus":0.01889534089713072,"score_gpt":0.2081665042103435,"score_spread":0.18927116331321278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963653441","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.97867817,0.006533706,0.010770406,0.0000013227896,0.0004936373,0.00042128973,0.000027632008,0.000116049545,0.002957807],"genre_scores_gemma":[0.99896723,0.00041252875,0.0005077857,0.0000052693917,0.000027036991,0.000015997874,0.000010851378,0.000032191892,0.000021123977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988579,0.000089498826,0.0004146857,0.00019280247,0.00019424579,0.0002508814],"domain_scores_gemma":[0.99925745,0.00014866285,0.00010516549,0.00031729694,0.000086541455,0.000084882755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475319,0.00020402434,0.00047914856,0.000596545,0.00005676395,0.000022638771,0.00018521378,0.00012403632,0.000030169474],"category_scores_gemma":[0.000008906605,0.00018408443,0.00014699284,0.0015329779,0.00007679237,0.00010277318,0.00002974118,0.000109529545,0.0000064427495],"study_design_candidate":"observational","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.0002009615,0.00030148865,0.16052032,0.0044222507,0.0011040599,0.000006472632,0.0014575602,0.00937867,0.27777675,0.5403641,0.0009305561,0.0035368307],"study_design_scores_gemma":[0.01914601,0.0259447,0.51462424,0.007889708,0.002677015,0.00025145157,0.012556319,0.20787814,0.10427969,0.061016712,0.033108123,0.010627893],"about_ca_topic_score_codex":0.000035847926,"about_ca_topic_score_gemma":0.000002442845,"teacher_disagreement_score":0.47934738,"about_ca_system_score_codex":0.0000058657815,"about_ca_system_score_gemma":0.0000071942,"threshold_uncertainty_score":0.75067455},"labels":[],"label_agreement":null},{"id":"W2963687249","doi":"10.1016/j.ffa.2018.03.007","title":"Non-commutative association schemes and their fusion association schemes","year":2018,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Japan Society for the Promotion of Science; Soochow University","keywords":"Association scheme; Commutative property; Association (psychology); Mathematics; Algebra over a field; Pure mathematics; Discrete mathematics; Epistemology","score_opus":0.00568083153776056,"score_gpt":0.2003904576498935,"score_spread":0.19470962611213294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963687249","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.83027256,0.0010274197,0.14466643,0.00067914993,0.00025985035,0.0007488776,0.00018138436,0.00036198786,0.021802364],"genre_scores_gemma":[0.9987016,0.00019049844,0.00013054234,0.00009002746,0.00020872112,0.00018064564,0.00004254263,0.000015985375,0.00043944665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993987,0.000030158706,0.00017732538,0.00015678097,0.00006360018,0.00017345347],"domain_scores_gemma":[0.9992469,0.0003437543,0.00008994688,0.00017225636,0.00009447907,0.000052683245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002815248,0.00014473256,0.00016402273,0.000062659565,0.00027991165,0.000064320484,0.00008263527,0.00020422672,0.00003698135],"category_scores_gemma":[0.000033754764,0.00011908855,0.00004083532,0.00018659384,0.000030040275,0.00011281566,0.0000363867,0.0001762259,0.00003265266],"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.00018282748,0.0007331779,0.14675799,0.0012270643,0.0036833035,0.0000016517574,0.120094046,0.000389584,0.10959379,0.25542212,0.030967824,0.33094665],"study_design_scores_gemma":[0.0017532388,0.00038676593,0.017288152,0.00023176032,0.00010972657,0.000007701302,0.0068346504,0.06403915,0.083908536,0.11430718,0.7097645,0.0013686592],"about_ca_topic_score_codex":0.000009806278,"about_ca_topic_score_gemma":0.000024292307,"teacher_disagreement_score":0.67879665,"about_ca_system_score_codex":0.00004363093,"about_ca_system_score_gemma":0.0000068580293,"threshold_uncertainty_score":0.48562902},"labels":[],"label_agreement":null},{"id":"W2963692556","doi":"10.1016/j.jalgebra.2012.03.023","title":"Subspace arrangements, configurations of linear spaces and the quadrics containing them","year":2012,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Politecnico di Torino","keywords":"Linear subspace; Mathematics; Projective space; Hilbert space; Degree (music); Subspace topology; Pure mathematics; Ideal (ethics); Linear space; Hilbert series and Hilbert polynomial; Projective test; Discrete mathematics; Algebra over a field; Mathematical analysis","score_opus":0.015091162556765781,"score_gpt":0.21348740757272533,"score_spread":0.19839624501595954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963692556","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.9896311,0.0029652666,0.002411418,0.00016286202,0.0004410785,0.00006767144,0.0000018577094,0.000010946473,0.0043077897],"genre_scores_gemma":[0.9993668,0.00016901302,0.00018297143,0.000019990073,0.00022261696,0.0000011949109,2.686859e-7,0.000008843489,0.000028278053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99941903,0.00006485877,0.00026094876,0.00002359444,0.00012263657,0.000108905966],"domain_scores_gemma":[0.99946207,0.00018662306,0.00016074223,0.00007770731,0.00006128941,0.000051595547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007611618,0.00006785433,0.00018596805,0.000043262447,0.0000498202,0.000017147138,0.00008433694,0.00003104623,0.000035639707],"category_scores_gemma":[0.00004890082,0.00004186518,0.00006513851,0.00008283992,0.00006453738,0.00017880973,0.000007170672,0.0001292116,0.000003387425],"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.00042476246,0.00011440048,0.03726719,0.00036069762,0.0013392228,0.000008557871,0.051625863,0.0020415583,0.021251237,0.8805496,0.0021538164,0.0028631063],"study_design_scores_gemma":[0.04440608,0.002023799,0.17896791,0.0042546876,0.0034622564,0.003813206,0.27259994,0.0302677,0.1934181,0.06469381,0.198727,0.003365525],"about_ca_topic_score_codex":0.0000034147254,"about_ca_topic_score_gemma":0.0000022010665,"teacher_disagreement_score":0.8158558,"about_ca_system_score_codex":0.0000071381423,"about_ca_system_score_gemma":0.0000075138887,"threshold_uncertainty_score":0.17072125},"labels":[],"label_agreement":null},{"id":"W2963701486","doi":"","title":"Some Constructions for Amicable Orthogonal Designs","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","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":"York University","funders":"","keywords":"Disjoint sets; Orthogonal array; Mathematics; Combinatorial design; Construct (python library); Combinatorics; Kronecker product; Notation; Product (mathematics); Discrete mathematics; Arithmetic; Computer science; Computer network","score_opus":0.06524877658368881,"score_gpt":0.25054375355455266,"score_spread":0.18529497697086383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963701486","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.9813069,0.00028287215,0.008399842,0.00008888742,0.0027067738,0.0004959868,0.000089363915,0.0006618376,0.005967536],"genre_scores_gemma":[0.9975741,0.0000049412665,0.0010253373,0.000020792359,0.00023150026,0.00007466997,0.000022107643,0.000026277496,0.0010202712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929595,0.000023106622,0.00018670633,0.00012463547,0.00009333377,0.00027628976],"domain_scores_gemma":[0.9995328,0.00005884355,0.000022031401,0.00018341636,0.000047572128,0.00015529583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017090121,0.00012863183,0.00016167153,0.00006470221,0.000067043744,0.00003361579,0.00012364921,0.00008692909,0.00003929704],"category_scores_gemma":[0.000017354096,0.00013120394,0.00007814374,0.00011354242,0.0000635106,0.00017743408,0.0000097865795,0.0001068134,0.000102252125],"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.000055863977,0.000090801346,0.00690717,0.00018757238,0.000309816,0.000012653004,0.000513714,0.0305321,0.011592037,0.83506054,0.11303798,0.0016997799],"study_design_scores_gemma":[0.008057394,0.0008179198,0.0062049455,0.00022424501,0.0003458177,0.00059775705,0.0034946587,0.03050193,0.0440803,0.57206434,0.33103254,0.002578133],"about_ca_topic_score_codex":0.000004978732,"about_ca_topic_score_gemma":0.0000052204227,"teacher_disagreement_score":0.26299614,"about_ca_system_score_codex":0.00003348311,"about_ca_system_score_gemma":0.000028632508,"threshold_uncertainty_score":0.5350342},"labels":[],"label_agreement":null},{"id":"W2963736507","doi":"","title":"Linking systems of difference sets","year":2017,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Abelian group; Constructive; Connection (principal bundle); Group (periodic table); Difference set; Argument (complex analysis); Set (abstract data type); Projection (relational algebra); Pure mathematics; Algebra over a field; Discrete mathematics; Combinatorics; Geometry; Algorithm; Computer science","score_opus":0.013417272823759128,"score_gpt":0.19247965499569802,"score_spread":0.1790623821719389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963736507","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.9712396,0.00018298143,0.00096139265,0.0000053660924,0.0007567909,0.00010721083,0.000025634843,0.00014118617,0.026579808],"genre_scores_gemma":[0.99858993,0.00004036318,0.000016915721,0.0000018946882,0.00003544659,3.7136712e-7,0.000004748901,0.000014518823,0.0012958061],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939793,0.00003747726,0.00012087247,0.00014121877,0.00011712569,0.00018537066],"domain_scores_gemma":[0.9992188,0.000033892487,0.00008754508,0.0005433041,0.00004179236,0.00007467301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009299055,0.00012774336,0.00021053002,0.00015534887,0.00020584531,0.000049808066,0.0005728567,0.000105720705,0.000013892196],"category_scores_gemma":[0.000009919761,0.00014058809,0.00007694623,0.000103958504,0.00008164602,0.00020142728,0.0000665037,0.00012707541,0.000024080766],"study_design_candidate":"observational","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.00002560068,0.000025455327,0.97262484,0.0004243064,0.00011761606,0.00010995065,0.000055847093,0.002826065,0.00037199867,0.02087082,0.0008836564,0.0016638655],"study_design_scores_gemma":[0.009817658,0.0005506677,0.20688266,0.0059265024,0.0008067689,2.4978053e-7,0.07163894,0.079724744,0.057181343,0.0052191806,0.5571692,0.005082102],"about_ca_topic_score_codex":0.000094855255,"about_ca_topic_score_gemma":0.0017237648,"teacher_disagreement_score":0.7657422,"about_ca_system_score_codex":0.00003434932,"about_ca_system_score_gemma":0.0000097221055,"threshold_uncertainty_score":0.5733016},"labels":[],"label_agreement":null},{"id":"W2963762533","doi":"","title":"A linear algebraic approach to orthogonal arrays and Latin squares","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal array; Rank (graph theory); Algebraic number; Matrix (chemical analysis); Latin square; Orthogonal basis; Basis (linear algebra); Orthogonal matrix; Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Statistics","score_opus":0.011382821637307295,"score_gpt":0.20291604016779738,"score_spread":0.19153321853049007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963762533","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.98434323,0.0004901825,0.00045302152,0.000011925475,0.0012063435,0.00016835766,0.0000043385735,0.0002040815,0.013118516],"genre_scores_gemma":[0.99918497,0.0000041687736,0.00058301556,0.000034293822,0.00004206868,0.000040915944,0.000006487403,0.00003071055,0.000073368086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992658,0.0000337704,0.00015178342,0.0001239505,0.0001191082,0.00030560954],"domain_scores_gemma":[0.9995381,0.000044627308,0.00001565872,0.00018700142,0.000016119124,0.0001984442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025065322,0.00014335287,0.0001636729,0.00009402535,0.00006330083,0.000021813566,0.00009859638,0.000074817086,0.000014817463],"category_scores_gemma":[0.000019528989,0.00013941935,0.00003780524,0.00024836793,0.000021800399,0.00012724394,0.000029590497,0.00012438191,0.00007926728],"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.0000068532463,0.000057842233,0.010979348,0.00007185176,0.000035332378,7.2418305e-7,0.0015410021,0.00024231295,0.00096975977,0.98456717,0.001215777,0.0003120534],"study_design_scores_gemma":[0.004279543,0.00044655715,0.13769299,0.00026903706,0.0001610643,0.00018375565,0.002750292,0.019080635,0.012805903,0.767837,0.051371712,0.0031215115],"about_ca_topic_score_codex":0.0000029072621,"about_ca_topic_score_gemma":4.4001777e-7,"teacher_disagreement_score":0.21673015,"about_ca_system_score_codex":0.000014142743,"about_ca_system_score_gemma":0.0000041064222,"threshold_uncertainty_score":0.5685356},"labels":[],"label_agreement":null},{"id":"W2963787518","doi":"10.1016/j.ejc.2016.07.001","title":"On the existence of unparalleled even cycle systems","year":2017,"lang":"en","type":"article","venue":"Institutional Research Information System (Università degli Studi di Brescia)","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":"Mathematics; Combinatorics","score_opus":0.06731859441380772,"score_gpt":0.2834697578986184,"score_spread":0.21615116348481067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963787518","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.6806374,0.00014340728,0.0045555253,0.00018458623,0.0011557825,0.00108955,0.00013964817,0.00017982592,0.31191427],"genre_scores_gemma":[0.99961585,0.000011991192,0.000013172775,0.000006712284,0.00007062661,0.000056992474,0.000011365914,0.000008091806,0.00020521057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997443,0.00022473605,0.00041457143,0.00014287677,0.0013823819,0.0003924334],"domain_scores_gemma":[0.99789476,0.0003102726,0.0002074251,0.0007892143,0.00067393563,0.00012439415],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021816615,0.00016673404,0.00026827137,0.00042373693,0.0024256886,0.00028025647,0.0011918587,0.000112236004,0.000015242923],"category_scores_gemma":[0.00031469323,0.00013518713,0.00010990753,0.00037226445,0.0005597725,0.0017311613,0.00020698053,0.0003400628,0.00046572773],"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.000078109624,0.000016106695,0.00042526654,0.00046377094,0.00013543581,0.00001396598,0.0010625299,0.037168182,0.00005001582,0.958398,0.0016745115,0.0005141418],"study_design_scores_gemma":[0.0088615045,0.0008472293,0.15425467,0.008779399,0.0001372762,0.00044045658,0.14290462,0.5914341,0.0013511699,0.006116969,0.08255955,0.0023130123],"about_ca_topic_score_codex":0.00020808195,"about_ca_topic_score_gemma":0.00001585157,"teacher_disagreement_score":0.952281,"about_ca_system_score_codex":0.00043296049,"about_ca_system_score_gemma":0.00015216171,"threshold_uncertainty_score":0.998873},"labels":[],"label_agreement":null},{"id":"W2963914152","doi":"10.4310/joc.2018.v9.n1.a2","title":"Teaching dimension, VC dimension, and critical sets in Latin squares","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorics","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":"McGill University","funders":"","keywords":"Mathematics; Dimension (graph theory); Latin square; Combinatorics; Packing dimension; Minkowski–Bouligand dimension; Mathematical analysis; Biology","score_opus":0.008669537047505128,"score_gpt":0.24530354476894012,"score_spread":0.236634007721435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963914152","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.99602526,0.0009312577,0.00028449224,0.00012808855,0.001446763,0.000038325856,6.4069525e-7,0.0000258298,0.0011193376],"genre_scores_gemma":[0.99965996,0.000023492385,0.00014431422,0.000034021967,0.00009675821,6.004738e-7,1.736246e-7,0.00001724621,0.000023448305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999044,0.00010766453,0.00040314416,0.00007048516,0.0001999177,0.00017478026],"domain_scores_gemma":[0.9993737,0.00022491976,0.00006122133,0.00010401785,0.00012645345,0.00010970077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069653994,0.000109711684,0.00023318734,0.00023431788,0.00007913129,0.000030533716,0.00009104196,0.000081051396,0.000009042989],"category_scores_gemma":[0.0001693183,0.00009443815,0.000041143725,0.00018242875,0.00005774814,0.00018461615,0.000025219826,0.00037669833,0.0000051476572],"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.0001467826,0.0004111856,0.05444205,0.00047327243,0.00012152162,0.0004522506,0.011355166,0.00049951574,0.019550921,0.8982185,0.010314293,0.0040145],"study_design_scores_gemma":[0.004989834,0.0022463403,0.07638163,0.001909758,0.00013965133,0.0013179275,0.0033449929,0.018962698,0.0091947075,0.85883135,0.021512942,0.0011681756],"about_ca_topic_score_codex":0.0000048934207,"about_ca_topic_score_gemma":0.0000027723584,"teacher_disagreement_score":0.039387196,"about_ca_system_score_codex":0.000038064743,"about_ca_system_score_gemma":0.000011270674,"threshold_uncertainty_score":0.3851076},"labels":[],"label_agreement":null},{"id":"W2963995511","doi":"","title":"A note on 2-subset-regular self-complementary 3-uniform hypergraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.005274001393304178,"score_gpt":0.18998650655606586,"score_spread":0.1847125051627617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963995511","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.97992265,0.00013306821,0.00001509224,0.00009202653,0.002861642,0.00041766244,0.000008862487,0.00075092324,0.015798083],"genre_scores_gemma":[0.9993921,0.000018592802,0.00016942521,0.00013260319,0.000021362339,0.000105263454,0.000022806278,0.000054018907,0.000083835395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881893,0.000047001166,0.00027580126,0.00021498853,0.00023324759,0.0004100124],"domain_scores_gemma":[0.99923176,0.00006011436,0.000034657438,0.00048737077,0.00003958477,0.00014650902],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016720322,0.00025486306,0.00024020861,0.00013952437,0.00012238185,0.000058674133,0.00030280417,0.00009820385,0.00030749897],"category_scores_gemma":[0.0000051378393,0.00024672394,0.00012008892,0.00027913522,0.000029570308,0.00021513629,0.000032848362,0.0002058671,0.0010323488],"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.000012357842,0.00019353657,0.0018982271,0.00013093353,0.0002450857,0.000019380457,0.0008713061,0.00034626503,0.005212375,0.9599154,0.02858617,0.0025689867],"study_design_scores_gemma":[0.002618114,0.00037761367,0.007506823,0.00012894087,0.000069242786,0.000027395854,0.00043662582,0.0070456127,0.013918609,0.9099704,0.056811627,0.0010889636],"about_ca_topic_score_codex":0.000059217968,"about_ca_topic_score_gemma":0.000005161261,"teacher_disagreement_score":0.049944945,"about_ca_system_score_codex":0.00007125032,"about_ca_system_score_gemma":0.000008062168,"threshold_uncertainty_score":0.9999985},"labels":[],"label_agreement":null},{"id":"W2964030595","doi":"10.1002/jgt.22167","title":"Levi's Lemma, pseudolinear drawings of , and empty triangles","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"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; Consejo Nacional de Ciencia y Tecnología, Guatemala","keywords":"Lemma (botany); Mathematics; Mathematical proof; Combinatorics; Regular polygon; Graph; Geometry","score_opus":0.012369625081423936,"score_gpt":0.23100893026290978,"score_spread":0.21863930518148583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964030595","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.99228203,0.0029118126,0.0008625245,0.000041814208,0.0006085436,0.000059592978,0.0000066803073,0.0000195708,0.0032074407],"genre_scores_gemma":[0.9992064,0.00030762027,0.00016793273,0.000012394355,0.00019277024,8.521116e-7,1.993582e-7,0.000021204025,0.00009058522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903756,0.00010603732,0.0004710214,0.00007167853,0.00016172571,0.00015199125],"domain_scores_gemma":[0.9989675,0.00013626298,0.00040411335,0.0003094047,0.00008559578,0.0000971169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016884918,0.00013342596,0.00037642606,0.000209716,0.00014994608,0.00006243709,0.0003509964,0.00008316143,0.000029622284],"category_scores_gemma":[0.00014882983,0.00010609621,0.00022338428,0.000053061285,0.00023037632,0.00031385096,0.000027984894,0.00020745741,0.0000022793406],"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.001998718,0.0002880271,0.04046205,0.0015040226,0.0021765912,0.00035925172,0.009224855,0.0013730638,0.18869641,0.65023327,0.0050673117,0.0986164],"study_design_scores_gemma":[0.0057088383,0.00074677955,0.090763204,0.0014666894,0.00046777955,0.0012447672,0.0025567268,0.00043606904,0.046008077,0.8414638,0.008274099,0.0008631384],"about_ca_topic_score_codex":0.0000030780957,"about_ca_topic_score_gemma":0.0000017549951,"teacher_disagreement_score":0.19123054,"about_ca_system_score_codex":0.000007406186,"about_ca_system_score_gemma":0.00001259419,"threshold_uncertainty_score":0.4326478},"labels":[],"label_agreement":null},{"id":"W2964041986","doi":"10.48550/arxiv.1401.1466","title":"A three-factor product construction for mutually orthogonal latin squares","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Victoria","funders":"","keywords":"Kronecker product; Transversal (combinatorics); Product (mathematics); Latin square; Mathematics; Table (database); Resolution (logic); Square (algebra); Factor (programming language); Orthogonal array; Kronecker delta; Algebra over a field; Computer science; Pure mathematics; Statistics; Geometry; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.04569567817454224,"score_gpt":0.16296162699352235,"score_spread":0.11726594881898011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964041986","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.784022,0.00007193167,0.21189909,0.000007709559,0.0015296559,0.0006105548,0.00013781148,0.00044496078,0.001276294],"genre_scores_gemma":[0.99879915,0.000019722655,0.00044516497,0.000006890219,0.0003564808,0.000006866331,0.00006720254,0.00005168275,0.0002468187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874336,0.00005398736,0.00022808535,0.0006048919,0.000062109786,0.00030756363],"domain_scores_gemma":[0.9989742,0.00009846037,0.00012779742,0.0005743179,0.00011670788,0.00010849139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017778981,0.00034243474,0.0003784692,0.00026479363,0.00011239774,0.000046999976,0.00035997684,0.0002779402,0.00007313544],"category_scores_gemma":[0.00003247445,0.00039611253,0.00026981783,0.00022552194,0.00010759267,0.00010528729,0.000117347765,0.00038433043,0.000037986596],"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.00018924425,0.00004563857,0.014032852,0.0016005816,0.00053524197,0.000029661534,0.00029081645,0.6258138,0.0007437354,0.35346848,0.000739264,0.0025107064],"study_design_scores_gemma":[0.0022247077,0.00020489143,0.009783048,0.00064695184,0.00047857917,0.000027638267,0.00039106293,0.72088796,0.0020375194,0.25105396,0.009883039,0.0023806572],"about_ca_topic_score_codex":0.000017123455,"about_ca_topic_score_gemma":0.000100677506,"teacher_disagreement_score":0.21477717,"about_ca_system_score_codex":0.00009031243,"about_ca_system_score_gemma":0.00005282993,"threshold_uncertainty_score":0.9998491},"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":"W2964105682","doi":"10.1007/978-3-319-46310-0_8","title":"Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes","year":2017,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Association scheme; Mathematics; Combinatorics; Disjoint sets; Upper and lower bounds; Adjacency matrix; Vertex (graph theory); Discrete mathematics; Hadamard transform; Graph","score_opus":0.010630550892028419,"score_gpt":0.2176528313383885,"score_spread":0.2070222804463601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964105682","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.020178422,0.008691969,0.12467482,0.00010020363,0.0036224907,0.007858049,0.0033687882,0.0013816557,0.8301236],"genre_scores_gemma":[0.12060344,0.008279867,0.33904678,0.00007303697,0.0016773841,0.0010503494,0.00033696517,0.0016803684,0.5272518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979684,0.0000036155204,0.0007728559,0.00037394222,0.00040562186,0.0004755725],"domain_scores_gemma":[0.99842054,0.00033519187,0.00055805885,0.00027345883,0.00029924474,0.00011348554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010308416,0.00054266636,0.00081210234,0.00053448475,0.0002030459,0.00036945473,0.0003427357,0.0005994836,0.000015648986],"category_scores_gemma":[0.00058019644,0.0006053446,0.00011510405,0.000044757275,0.00010515905,0.00019700536,0.00008517452,0.000549646,0.000016323362],"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.000009441567,0.000024546322,0.00031897106,0.005910534,0.00026213264,0.000008578116,0.00085393834,0.000007397327,0.00010620533,0.9882309,0.0027010688,0.0015662798],"study_design_scores_gemma":[0.0007639526,0.00009205396,0.00022468064,0.0017804835,0.00035470581,0.000019454084,0.000116099895,0.007043859,0.00035117022,0.89875215,0.089325786,0.0011756243],"about_ca_topic_score_codex":0.0000036196343,"about_ca_topic_score_gemma":0.000025722962,"teacher_disagreement_score":0.3028718,"about_ca_system_score_codex":0.00024095994,"about_ca_system_score_gemma":0.000033978336,"threshold_uncertainty_score":0.9996398},"labels":[],"label_agreement":null},{"id":"W2964128008","doi":"","title":"Edge-colorings of Km,n which forbid multicolored cycles","year":2013,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer science","score_opus":0.010782240573600754,"score_gpt":0.20565779790229413,"score_spread":0.19487555732869338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964128008","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.92665684,0.00021102531,0.0005810126,0.000036728863,0.00015060091,0.0005248727,0.00001152661,0.0002916147,0.071535796],"genre_scores_gemma":[0.997485,0.0000065207123,0.00206615,0.0000074632794,0.000020582625,0.00017410406,0.000003254544,0.0000356864,0.00020128262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989557,0.000030176097,0.00043038087,0.00014056033,0.0001591187,0.00028405464],"domain_scores_gemma":[0.9991624,0.0002162372,0.00005338483,0.00039901678,0.0000794754,0.000089503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022744646,0.00017643347,0.00033599284,0.000090228816,0.000039892693,0.000023506956,0.00022912445,0.00009668818,0.0008158181],"category_scores_gemma":[0.00011599615,0.00015274466,0.00009589758,0.0002063241,0.00006371132,0.00015926152,0.000034928373,0.00010154233,0.00060056156],"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.00005387304,0.00087114685,0.0018509113,0.01160926,0.0010189277,0.000008589605,0.0194248,0.0012826568,0.17625038,0.7616766,0.01788627,0.008066591],"study_design_scores_gemma":[0.0023762172,0.0004012097,0.021250669,0.0015136508,0.00028156198,0.00006874159,0.010408672,0.16946886,0.16809478,0.61593324,0.008382035,0.0018203811],"about_ca_topic_score_codex":0.000014047949,"about_ca_topic_score_gemma":0.000004141966,"teacher_disagreement_score":0.1681862,"about_ca_system_score_codex":0.000019269635,"about_ca_system_score_gemma":0.0000070525252,"threshold_uncertainty_score":0.8932636},"labels":[],"label_agreement":null},{"id":"W2964243333","doi":"10.1002/jgt.22414","title":"Generating Near-Bipartite Bricks","year":2016,"lang":"","type":"article","venue":"ArXiv.org","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":"Bipartite graph; Brick; Mathematics; Simple (philosophy); Combinatorics; Complete bipartite graph; Object (grammar); Class (philosophy); Graph; Discrete mathematics; Computer science; Archaeology; Geography","score_opus":0.021280883216764794,"score_gpt":0.2131548500898415,"score_spread":0.1918739668730767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964243333","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.98411244,0.0026041546,0.0045394027,0.000284049,0.0032422973,0.000273776,0.000021884578,0.00034767174,0.004574334],"genre_scores_gemma":[0.9932787,0.00017243429,0.00016529352,0.00015078201,0.0012306166,0.000041316882,0.0000027408505,0.00011852474,0.0048395963],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972319,0.00020102905,0.0007713389,0.00057425525,0.00026198538,0.0009594965],"domain_scores_gemma":[0.9984148,0.00018812578,0.00014874026,0.0008435364,0.000083908875,0.00032085765],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005993143,0.00048351273,0.00047301545,0.000090804344,0.0004276242,0.00014386736,0.00039546724,0.00029049252,0.001258069],"category_scores_gemma":[0.0001317117,0.00038693828,0.00028162668,0.00040214317,0.00018063706,0.00046161798,0.00011055167,0.0002876105,0.005070542],"study_design_candidate":"observational","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.00003548449,0.000076919634,0.5592173,0.00021781778,0.00035054586,0.00008188121,0.0016972952,0.0024819274,0.4093055,0.0028236192,0.0019505196,0.021761162],"study_design_scores_gemma":[0.007518764,0.00082628964,0.33826342,0.004800164,0.0006144651,0.00029900266,0.0011647636,0.040428035,0.24842277,0.0018957991,0.34942323,0.0063432967],"about_ca_topic_score_codex":0.000044026907,"about_ca_topic_score_gemma":0.00001794938,"teacher_disagreement_score":0.34747273,"about_ca_system_score_codex":0.00009765145,"about_ca_system_score_gemma":0.000051638846,"threshold_uncertainty_score":0.99985826},"labels":[],"label_agreement":null},{"id":"W2964336310","doi":"","title":"P 2k+1 -factorization of symmetric complete bipartite multi-digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Factorization; Combinatorics; Complete bipartite graph; Graph; Algorithm","score_opus":0.012850550209698127,"score_gpt":0.20130412126206385,"score_spread":0.1884535710523657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964336310","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.9856237,0.00031877335,0.005200516,0.000006193393,0.003656401,0.00019027112,0.00001249572,0.0003270199,0.0046645864],"genre_scores_gemma":[0.9997703,0.000017276738,0.00010504225,0.000008262271,0.0000100203915,0.000011845192,0.000014365035,0.00002974147,0.000033154523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991175,0.000080029706,0.00029756522,0.00013744594,0.00015993995,0.00020750785],"domain_scores_gemma":[0.99938756,0.000104122315,0.000066801214,0.0003026973,0.000062891035,0.000075944416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025985236,0.00014631564,0.0002465386,0.00024760253,0.000048549788,0.000018016266,0.00017863915,0.0000848853,0.000017792732],"category_scores_gemma":[0.00005679031,0.00014987242,0.00008504431,0.000752644,0.00003865535,0.000107971835,0.000018146307,0.000100243255,0.000051495197],"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.0000046948717,0.000054722637,0.012768846,0.00012952978,0.00005423267,6.0136904e-7,0.00019956834,0.0007387425,0.013811859,0.97123516,0.00026263052,0.00073942647],"study_design_scores_gemma":[0.0052485415,0.00044448994,0.1073405,0.00029022418,0.0001311244,0.000010559516,0.00015659285,0.11298047,0.05880637,0.68400824,0.029187541,0.0013953192],"about_ca_topic_score_codex":0.0000154052,"about_ca_topic_score_gemma":0.00000268485,"teacher_disagreement_score":0.2872269,"about_ca_system_score_codex":0.000018592902,"about_ca_system_score_gemma":0.0000041363,"threshold_uncertainty_score":0.611162},"labels":[],"label_agreement":null},{"id":"W2964344819","doi":"","title":"Cycle structures of autotopisms of the Latin squares of order up to 11","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; BETA (programming language); Order (exchange); Delta; Alpha (finance); Combinatorics; Square (algebra); Physics; Statistics; Geometry; Chemistry; Computer science","score_opus":0.0067334071503194395,"score_gpt":0.20614109394995983,"score_spread":0.19940768679964038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964344819","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.9958538,0.00015683564,0.000016190874,0.000009644721,0.0024127506,0.00014118208,0.000009040222,0.000026912148,0.0013736772],"genre_scores_gemma":[0.9998481,9.921467e-7,0.00005549033,0.0000061807523,0.0000071803543,0.0000060243815,6.3926694e-7,0.000013948654,0.00006143931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993866,0.000045905,0.00023395958,0.00005282121,0.00013962325,0.00014108242],"domain_scores_gemma":[0.9994975,0.000052886302,0.000063821244,0.00029736187,0.000049236754,0.000039219125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014403998,0.000084840685,0.00018728552,0.00005564737,0.000019021696,0.0000024031192,0.00019696122,0.00005537522,0.00003659535],"category_scores_gemma":[0.000038962975,0.000063419255,0.00006115616,0.00031388673,0.00003845687,0.0000485472,0.000037446534,0.000056004064,0.000002334496],"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.000007683916,0.000023235358,0.03421476,0.00016503545,0.000038848637,6.498793e-8,0.0029737642,0.0012648688,0.019611534,0.9411009,0.00045397802,0.00014534377],"study_design_scores_gemma":[0.000758327,0.000092205206,0.21993865,0.00012841771,0.000041011088,0.000001993978,0.0007317339,0.00032179628,0.44673842,0.32891935,0.002082849,0.00024523673],"about_ca_topic_score_codex":0.000049347393,"about_ca_topic_score_gemma":0.0000044729563,"teacher_disagreement_score":0.61218154,"about_ca_system_score_codex":0.000007961433,"about_ca_system_score_gemma":0.0000066928105,"threshold_uncertainty_score":0.2586162},"labels":[],"label_agreement":null},{"id":"W2966446838","doi":"10.1016/j.jsc.2019.10.013","title":"Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"Binary Golay code; Mathematics; Sequence (biology); Algebraic number; Symbolic computation; Algorithm; Search algorithm; Conjecture; Satisfiability; Computation; Discrete mathematics; Combinatorics","score_opus":0.011700229146881482,"score_gpt":0.23035184370239942,"score_spread":0.21865161455551793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966446838","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.8895276,0.000105474624,0.10915836,0.00008526633,0.0006323508,0.00030373543,0.0000010933685,0.00005635165,0.00012977139],"genre_scores_gemma":[0.9964426,0.000005723567,0.0032485006,0.00004934851,0.00020251487,0.0000026507703,0.0000039685406,0.000023919516,0.000020749714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988615,0.00010437124,0.0004521206,0.00010544567,0.00027124112,0.00020530037],"domain_scores_gemma":[0.9994296,0.00010654044,0.00009281027,0.00009390728,0.00012217849,0.00015500678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005315957,0.00014125873,0.00031989097,0.00025457243,0.000043527234,0.00009298347,0.00011883041,0.000050400307,0.000023932307],"category_scores_gemma":[0.0000048159495,0.00012570192,0.00008001631,0.00023684441,0.000019482135,0.00017517737,0.000028171951,0.00019134136,0.000079369005],"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.0001625943,0.00013600658,0.015064308,0.0016041915,0.0006631064,0.000044470857,0.028138688,0.45803255,0.017140893,0.0031936425,0.003095888,0.47272366],"study_design_scores_gemma":[0.0016987337,0.00078439515,0.09289031,0.0004228662,0.000053099033,0.00066750107,0.0009934488,0.8972041,0.00032884203,0.0029651665,0.0015893059,0.00040220603],"about_ca_topic_score_codex":0.000004676736,"about_ca_topic_score_gemma":0.0000016305858,"teacher_disagreement_score":0.47232145,"about_ca_system_score_codex":0.0000476753,"about_ca_system_score_gemma":0.000014346705,"threshold_uncertainty_score":0.51259756},"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":"W2969413889","doi":"10.1016/j.jctb.2019.08.002","title":"The genus of complete 3-uniform hypergraphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Hypergraph; Conjecture; Genus; Vertex (graph theory); Graph; Discrete mathematics; Botany","score_opus":0.005066796062146385,"score_gpt":0.18156300372263182,"score_spread":0.17649620766048543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969413889","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.9649432,0.0015131222,0.00010299926,0.00003249128,0.016801268,0.00014301219,0.000007153632,0.00003275277,0.01642401],"genre_scores_gemma":[0.9992819,0.0001693826,0.000028319795,0.0000071263485,0.00027971744,0.0000015092274,5.043114e-7,0.000023045388,0.00020852145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872625,0.00016115641,0.00058088306,0.00005502394,0.0002795884,0.00019707881],"domain_scores_gemma":[0.9988514,0.0003571217,0.00026879387,0.00027987637,0.00017527486,0.00006750985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013844952,0.00014187612,0.00036204976,0.000089088884,0.00009007089,0.000036489215,0.00044939632,0.00007559346,0.00006727508],"category_scores_gemma":[0.00005352684,0.00009453879,0.00023137231,0.00019369881,0.0001328603,0.0002600553,0.00002724042,0.0002561072,0.00001607965],"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.00056180556,0.000020716452,0.0002457438,0.00006116377,0.00021788832,0.0000055864657,0.00037763934,0.00049741607,0.0071288864,0.9895182,0.0003376358,0.0010273197],"study_design_scores_gemma":[0.0015057577,0.0007499731,0.0003347892,0.00011867078,0.00005443635,0.00019149733,0.0017557812,0.00006823663,0.010365127,0.7915698,0.19306149,0.00022442403],"about_ca_topic_score_codex":8.218239e-7,"about_ca_topic_score_gemma":4.8355e-7,"teacher_disagreement_score":0.19794837,"about_ca_system_score_codex":0.000024274523,"about_ca_system_score_gemma":0.000026437967,"threshold_uncertainty_score":0.38551798},"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":"W2974476133","doi":"10.48550/arxiv.1909.07580","title":"Design Theory and Some Non-simple Forbidden Configurations","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 British Columbia","funders":"","keywords":"Column (typography); Combinatorics; Permutation (music); Matrix (chemical analysis); Simple (philosophy); Mathematics; Permutation matrix; Physics; Geometry; Chromatography; Chemistry","score_opus":0.0431820182060095,"score_gpt":0.16475624645860465,"score_spread":0.12157422825259515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974476133","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.5596928,0.00027098088,0.43139786,0.0000043999726,0.000657949,0.00059159275,0.000043886765,0.0002924918,0.0070480695],"genre_scores_gemma":[0.99818623,0.00019634352,0.00003858343,0.000021064992,0.00007138399,0.000002697021,0.000030425272,0.000040261424,0.0014129817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989917,0.0001672624,0.00014916733,0.00040484325,0.000038631166,0.0002483755],"domain_scores_gemma":[0.99902374,0.00021803446,0.000063850486,0.0005521118,0.00003902477,0.0001032482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036786075,0.000269795,0.0003017962,0.00017877105,0.000095387135,0.00005661017,0.00032186485,0.00029210866,0.00007944074],"category_scores_gemma":[0.000011046828,0.0003134347,0.00010739629,0.00013060457,0.00007741996,0.00019845419,0.00015820151,0.00036896064,0.00014470555],"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.000045629495,0.000014146951,0.00029312074,0.0002537148,0.00022826009,0.000045295852,0.00038888777,0.5623475,0.0007929413,0.43483,0.0006597362,0.00010076634],"study_design_scores_gemma":[0.00086228485,0.000062672305,0.0010012159,0.00018430417,0.00026997828,0.000010604146,0.0008827147,0.32171044,0.0014718083,0.6715089,0.0010492278,0.0009858746],"about_ca_topic_score_codex":0.0000151857785,"about_ca_topic_score_gemma":0.0000043690134,"teacher_disagreement_score":0.43849346,"about_ca_system_score_codex":0.000059582904,"about_ca_system_score_gemma":0.000040166033,"threshold_uncertainty_score":0.99993175},"labels":[],"label_agreement":null},{"id":"W2975313719","doi":"10.1515/spma-2019-0012","title":"Computational methods for difference families in finite abelian groups","year":2019,"lang":"en","type":"article","venue":"Special Matrices","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Pure mathematics; Algebra over a field","score_opus":0.0098922211831459,"score_gpt":0.2621349386192329,"score_spread":0.252242717436087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975313719","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.9415993,0.0006104593,0.04028825,0.000018370956,0.0020829688,0.00040594558,0.000028916536,0.00012797375,0.014837832],"genre_scores_gemma":[0.9896234,0.000032397216,0.00954756,0.000014173078,0.00054910034,0.00003136768,0.000011727996,0.000015160277,0.00017505854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.00004026631,0.0001785125,0.0001169348,0.00006676092,0.00015418432],"domain_scores_gemma":[0.99942935,0.000424258,0.00002458888,0.0000802447,0.000016442835,0.00002510835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020318347,0.000095829426,0.00016454876,0.00017176809,0.000025677542,0.000032059237,0.000121870224,0.00005219473,0.00008662567],"category_scores_gemma":[0.000017575936,0.00009127356,0.000049869985,0.00025472217,0.000014081933,0.00007459864,0.000011905491,0.00006629694,0.0000776373],"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.00017837269,0.00010899352,0.0467292,0.001736666,0.00013740861,0.0000061284313,0.006385405,0.26590186,0.0064373217,0.452448,0.0012127293,0.21871793],"study_design_scores_gemma":[0.0026312487,0.00023350786,0.18202958,0.00024113449,0.00003816372,0.00000649008,0.002483466,0.3107895,0.0016039296,0.42507908,0.0736698,0.0011941124],"about_ca_topic_score_codex":0.00000960394,"about_ca_topic_score_gemma":0.00002019585,"teacher_disagreement_score":0.21752381,"about_ca_system_score_codex":0.000019016205,"about_ca_system_score_gemma":0.0000059515924,"threshold_uncertainty_score":0.37220278},"labels":[],"label_agreement":null},{"id":"W2976325565","doi":"10.1109/isit.2019.8849452","title":"Improved Upper Bounds on the Hermite and KZ Constants","year":2019,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Upper and lower bounds; Constant (computer programming); Bounding overwatch; Hermite polynomials; Mathematics; Orthogonality; Lattice (music); Lattice reduction; Lattice constant; Computer science; Pure mathematics; Mathematical analysis; Physics; Geometry; MIMO; Quantum mechanics; Statistics","score_opus":0.0039959646442981655,"score_gpt":0.16370911219330855,"score_spread":0.1597131475490104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976325565","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.83307564,0.00008795345,0.000029335773,0.000042738568,0.00026966562,0.000116125426,0.0000020364294,0.00008938503,0.16628714],"genre_scores_gemma":[0.99640507,0.0000074884433,0.0000068022828,0.00015295317,0.000017779825,0.00000554621,3.799472e-7,0.000010374559,0.0033936177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969834,0.000015403806,0.00006693257,0.000070492264,0.000040714913,0.0001081331],"domain_scores_gemma":[0.99974483,0.000057296224,0.0000063308516,0.00016134181,0.000005646994,0.000024544679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112311325,0.00006861257,0.000069692396,0.000017338092,0.00002988572,0.00003402749,0.000053074815,0.000033422755,0.00033484746],"category_scores_gemma":[0.0000031787172,0.00004043358,0.000021159105,0.000041994914,0.000022301698,0.00003702967,0.000008218577,0.00006573412,0.00016607727],"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.000053189633,0.000028860639,0.016909197,0.00016732202,0.00021061672,0.0000045418906,0.0012673286,0.00017484157,0.17706735,0.7925796,0.004604163,0.006932992],"study_design_scores_gemma":[0.00713368,0.0010929697,0.062375225,0.0007183607,0.000116073235,0.0002164819,0.013981479,0.22816876,0.20041455,0.04015218,0.44193208,0.00369816],"about_ca_topic_score_codex":0.0000037690463,"about_ca_topic_score_gemma":0.0000032220469,"teacher_disagreement_score":0.7524274,"about_ca_system_score_codex":0.0000052658575,"about_ca_system_score_gemma":0.000002168529,"threshold_uncertainty_score":0.3666345},"labels":[],"label_agreement":null},{"id":"W297797070","doi":"","title":"Face 2-colorable quadrilateral embeddings of complete bipartite graphs","year":2002,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Quadrilateral; Mathematics; Combinatorics; Face (sociological concept); Complete bipartite graph; Discrete mathematics; Graph; Linguistics; Engineering","score_opus":0.024208800536516955,"score_gpt":0.2066045955571672,"score_spread":0.18239579502065026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W297797070","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.9399393,0.0009142557,0.0020428535,0.000038683207,0.00026028795,0.00035878614,0.00005882448,0.00043861117,0.05594837],"genre_scores_gemma":[0.99844986,0.00001637841,0.0007742124,0.000012685887,0.000012021784,0.000029118177,0.0000028077136,0.000031405067,0.0006715176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988864,0.0000379947,0.00044249737,0.00014867021,0.00017550073,0.000308926],"domain_scores_gemma":[0.99934775,0.00009141357,0.000057354497,0.00039049218,0.00002860199,0.0000844096],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023271501,0.00018482006,0.0003652361,0.00011419011,0.000053357275,0.00002179419,0.00021210988,0.00007262313,0.0012345084],"category_scores_gemma":[0.000026783557,0.00016814047,0.00013927279,0.00024929637,0.00009033169,0.0001267833,0.00002364005,0.000104249164,0.0005099621],"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.00005042071,0.00072852534,0.0011285776,0.008063466,0.0009491725,0.000037827554,0.042517677,0.0057320837,0.084023885,0.815607,0.03843103,0.002730333],"study_design_scores_gemma":[0.0012101874,0.00025396506,0.00055299513,0.0008518312,0.0001622381,0.000093222436,0.002540942,0.7515318,0.018430809,0.20183493,0.021379171,0.0011579313],"about_ca_topic_score_codex":0.000003456244,"about_ca_topic_score_gemma":0.000001240346,"teacher_disagreement_score":0.7457997,"about_ca_system_score_codex":0.000013405917,"about_ca_system_score_gemma":0.0000014393839,"threshold_uncertainty_score":0.9996785},"labels":[],"label_agreement":null},{"id":"W29797089","doi":"10.1007/164_2018_138","title":"Packings with block size five and index one: v \\equiv 2 (mod 4).","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Block (permutation group theory); Index (typography); Block size; Combinatorics; Arithmetic; Statistics; Computer science; World Wide Web","score_opus":0.005980269939868157,"score_gpt":0.1673284559591292,"score_spread":0.16134818601926104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29797089","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.98721004,0.00052394153,0.0000068240697,0.000036805683,0.00053483574,0.00014357701,0.0000028460895,0.00024960155,0.011291552],"genre_scores_gemma":[0.999356,0.000037876536,0.000023880915,0.000031327912,0.000012254725,0.000019155972,7.5099587e-7,0.000036643785,0.00048211153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992494,0.000028350385,0.00014278412,0.00017353044,0.00015204561,0.0002539096],"domain_scores_gemma":[0.9995084,0.00009594094,0.000029171226,0.0002353339,0.00002975718,0.00010138966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009561375,0.00016810583,0.000201318,0.00004384578,0.000076404336,0.000047231475,0.00011483439,0.00009271667,0.00007380204],"category_scores_gemma":[0.000017293214,0.00015849838,0.000029152598,0.00019194752,0.000055428718,0.00012865235,0.00002371651,0.00017334167,0.000049389335],"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.00009199727,0.00037624958,0.04476408,0.00056308444,0.0007581637,0.00016474495,0.008878649,0.0013293673,0.0042264485,0.92356527,0.012285356,0.002996584],"study_design_scores_gemma":[0.015669337,0.0016292194,0.07538775,0.0011453282,0.00033832897,0.00046156993,0.002233475,0.035140496,0.012448027,0.8267388,0.02479064,0.004017064],"about_ca_topic_score_codex":0.000012810816,"about_ca_topic_score_gemma":0.000004496906,"teacher_disagreement_score":0.09682651,"about_ca_system_score_codex":0.000024104358,"about_ca_system_score_gemma":0.0000028289126,"threshold_uncertainty_score":0.6463377},"labels":[],"label_agreement":null},{"id":"W2981592602","doi":"10.1007/s10623-020-00800-4","title":"Maximal nonassociativity via fields","year":2020,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Quasigroup; Conjecture; Constructive; Associative property; Mathematics; Character (mathematics); Set (abstract data type); Combinatorics; Field (mathematics); Quadratic equation; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.024347394247268093,"score_gpt":0.21747760601648916,"score_spread":0.19313021176922107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981592602","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.27160275,0.005241644,0.7069705,0.00021474794,0.00162298,0.0007675953,0.00029380762,0.0013015444,0.011984422],"genre_scores_gemma":[0.9973907,0.00044553936,0.0016514076,0.000107844004,0.00020438606,0.000090126974,0.000050151746,0.000052088413,0.000007773685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986597,0.00011626254,0.00029919515,0.00040325054,0.00019014899,0.00033147438],"domain_scores_gemma":[0.9993064,0.000095402305,0.00007743454,0.000308004,0.000035177756,0.00017759413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023528257,0.0004059042,0.00054008776,0.00016455342,0.000108771055,0.00013929862,0.00024884078,0.00048471466,0.000044579425],"category_scores_gemma":[0.000008706939,0.0004157975,0.00033775487,0.00024257028,0.00008045851,0.00005800233,0.00014483403,0.0007252875,0.000012542184],"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.00089336076,0.0010841776,0.11747223,0.024956329,0.017692337,0.0010408048,0.03074612,0.03088857,0.0695886,0.41478392,0.09787255,0.192981],"study_design_scores_gemma":[0.0015750005,0.00051098224,0.027604586,0.00081074395,0.0007807867,0.000052244704,0.00070728624,0.07005318,0.006196305,0.8661093,0.021086637,0.004512964],"about_ca_topic_score_codex":0.00003103687,"about_ca_topic_score_gemma":0.00001883797,"teacher_disagreement_score":0.72578794,"about_ca_system_score_codex":0.000014365003,"about_ca_system_score_gemma":0.000012804278,"threshold_uncertainty_score":0.9998294},"labels":[],"label_agreement":null},{"id":"W2982082459","doi":"10.31799/1684-8853-2019-5-2-9","title":"Hadamard matrices from Goethals — Seidel difference families with a repeated block","year":2019,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Hadamard transform; Combinatorics; Complex Hadamard matrix; Hadamard matrix; Hadamard's maximal determinant problem; Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.002459892335687036,"score_gpt":0.14795452638362047,"score_spread":0.14549463404793345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982082459","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.98734844,0.0009925636,0.00250684,0.000016608656,0.00041937677,0.0005387413,0.000075346965,0.00031078747,0.007791303],"genre_scores_gemma":[0.9995837,0.00004872464,0.000009030837,0.00005717746,0.000037218844,0.000060127637,0.000023417366,0.000009374228,0.00017123492],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.000044896286,0.00039434477,0.0000850999,0.00017958439,0.00016087685],"domain_scores_gemma":[0.99948263,0.00008093584,0.00010996377,0.00019866461,0.00006321913,0.00006456323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016084913,0.00015938847,0.0002872477,0.000105605,0.0000475212,0.0002011359,0.00009340897,0.000086664586,0.000010687943],"category_scores_gemma":[0.000006275222,0.00011746022,0.00003024341,0.00012241848,0.000017271763,0.00051364035,0.0000074731565,0.00008728156,0.00015384436],"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.0021015254,0.000112948415,0.4665325,0.00835786,0.0041093575,0.000036142996,0.040935148,0.3452524,0.039983105,0.04269236,0.004145881,0.04574078],"study_design_scores_gemma":[0.008944361,0.0002966177,0.052538294,0.0011257909,0.00014805714,0.00013060906,0.017221712,0.865921,0.0005424913,0.00020137212,0.051701374,0.001228313],"about_ca_topic_score_codex":0.00037960612,"about_ca_topic_score_gemma":0.000012572439,"teacher_disagreement_score":0.5206686,"about_ca_system_score_codex":0.000017309469,"about_ca_system_score_gemma":0.000009387765,"threshold_uncertainty_score":0.4789889},"labels":[],"label_agreement":null},{"id":"W2982273608","doi":"10.1016/j.disc.2019.111784","title":"Divisible design Cayley digraphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Hrvatska Zaklada za Znanost; University of Lethbridge","keywords":"Cayley graph; Combinatorics; Digraph; Cayley transform; Characterization (materials science); Mathematics; Discrete mathematics; Physics; Voltage graph; Graph","score_opus":0.022734619903903488,"score_gpt":0.22585510259647767,"score_spread":0.20312048269257418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982273608","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.07118763,0.0023308403,0.8257469,0.000024209296,0.0035901426,0.0021499589,0.00021243306,0.0014963311,0.093261585],"genre_scores_gemma":[0.9891477,0.00013641412,0.008853195,0.000013407774,0.0001225579,0.00015610081,0.000069148475,0.00017334434,0.0013281074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983094,0.000072012874,0.0005526638,0.00033211423,0.0003174604,0.0004163544],"domain_scores_gemma":[0.9983005,0.0001829768,0.00013833067,0.0012270282,0.00004068865,0.0001105109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004919612,0.00051316665,0.00070210116,0.00018452076,0.000053965417,0.00017027876,0.000622801,0.000399481,0.00012873315],"category_scores_gemma":[0.000032667132,0.00046365923,0.00032793346,0.0001534372,0.000047598416,0.00007042562,0.00024871464,0.0005908061,0.00056248734],"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.00002130637,0.00018603951,0.00043266243,0.02614529,0.0018412201,0.000055989443,0.016200537,0.79794836,0.0020632553,0.13266766,0.021322474,0.0011151759],"study_design_scores_gemma":[0.000553686,0.00007601916,0.00011157726,0.003202184,0.0004040954,0.00003173466,0.0013848838,0.5563248,0.006254248,0.42614055,0.0031312287,0.0023850156],"about_ca_topic_score_codex":0.0000050309372,"about_ca_topic_score_gemma":0.0000015641847,"teacher_disagreement_score":0.9179601,"about_ca_system_score_codex":0.000044596574,"about_ca_system_score_gemma":0.000027920652,"threshold_uncertainty_score":0.9997815},"labels":[],"label_agreement":null},{"id":"W2982790906","doi":"10.1016/s0024-3795(04)00032-1","title":"Tridiagonal normal forms for orthogonal similarity classes of symmetric matrices*1","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tridiagonal matrix; Mathematics; Orthogonal matrix; Combinatorics; Similarity (geometry); Matrix (chemical analysis); Transpose; Identity matrix; Pure mathematics; Band matrix; Algebraically closed field; Symmetric group; Symmetric matrix; Square matrix; Orthogonal basis; Image (mathematics); Eigenvalues and eigenvectors; Chemistry; Physics","score_opus":0.010103635704896217,"score_gpt":0.22800922152868527,"score_spread":0.21790558582378905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982790906","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.8725942,0.002944668,0.12055826,0.0001254318,0.000097029544,0.0010272946,0.0003972582,0.00018565475,0.002070241],"genre_scores_gemma":[0.99820805,0.00019343391,0.0010676493,0.000024013234,0.00012210262,0.00028121003,0.00005416427,0.000017652254,0.00003173764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993571,0.000005460427,0.00025462173,0.00013082888,0.00008947859,0.0001624991],"domain_scores_gemma":[0.99960214,0.0000857137,0.00004631559,0.00012704972,0.0000644382,0.00007434418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011751438,0.00010903278,0.00016094059,0.00013018327,0.000096904114,0.00001331246,0.00010727746,0.00008338286,0.000011375044],"category_scores_gemma":[0.000015213335,0.000099716664,0.0000769848,0.00043678755,0.000026543801,0.000115671144,0.000014934704,0.000083074614,0.000011648062],"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.000019506442,0.000079137164,0.00016104536,0.00035113154,0.00005611357,2.0532588e-7,0.000070271104,0.0018558303,0.0024996663,0.9915064,0.00005496975,0.0033457456],"study_design_scores_gemma":[0.008871074,0.00095901394,0.017189287,0.00021478205,0.00062364194,0.00013388711,0.00069195277,0.08056297,0.14947096,0.51687324,0.22211784,0.0022913567],"about_ca_topic_score_codex":0.0000022218805,"about_ca_topic_score_gemma":0.000004161154,"teacher_disagreement_score":0.47463316,"about_ca_system_score_codex":0.000011326519,"about_ca_system_score_gemma":0.000021732274,"threshold_uncertainty_score":0.40663275},"labels":[],"label_agreement":null},{"id":"W2983614779","doi":"","title":"Asymptotically good local list edge colourings","year":2019,"lang":"en","type":"article","venue":"Acta Mathematica Universitatis Comenianae","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.003372258778867649,"score_gpt":0.16135558956753487,"score_spread":0.15798333078866722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983614779","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.778942,0.000042124695,0.0051523275,0.00021117079,0.00034811773,0.00037791985,0.000019736384,0.0004427351,0.21446386],"genre_scores_gemma":[0.99526584,0.000007887834,0.0011502111,0.00003837798,0.00001874148,0.0000045546594,0.0000069314315,0.00004363895,0.0034638003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891305,0.00004660281,0.000246333,0.00020930482,0.00022231415,0.00036238233],"domain_scores_gemma":[0.99905306,0.0002667559,0.000048787904,0.00042434115,0.00004244073,0.0001646181],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017742143,0.00022657127,0.0003455643,0.00015333117,0.00007847188,0.000051262115,0.0003989291,0.00011471767,0.0012832764],"category_scores_gemma":[0.000013933031,0.0002348805,0.000106180545,0.00027941223,0.00008809853,0.00028748487,0.000069821595,0.00019003665,0.0012571395],"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.000037813632,0.00017473137,0.0014173568,0.0013875919,0.00063445175,0.00009662671,0.005139076,0.0009203525,0.0046358886,0.96936303,0.014748072,0.0014449792],"study_design_scores_gemma":[0.023056844,0.0029993197,0.019186076,0.003673854,0.0014800492,0.000741054,0.06645063,0.27992564,0.010862316,0.18307562,0.39865714,0.009891459],"about_ca_topic_score_codex":0.000005161772,"about_ca_topic_score_gemma":0.000007710331,"teacher_disagreement_score":0.7862874,"about_ca_system_score_codex":0.00012096635,"about_ca_system_score_gemma":0.000017217997,"threshold_uncertainty_score":0.9996297},"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":"W2987306417","doi":"10.1145/3359589","title":"Solving the Sigma-Tau Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"University of Guelph","funders":"","keywords":"Combinatorics; Mathematics; Sigma; Successor cardinal; Cayley graph; Hamiltonian path; Permutation (music); Transposition (logic); Discrete mathematics; Graph; Traverse; Directed graph","score_opus":0.008035747002884806,"score_gpt":0.19748789890374618,"score_spread":0.18945215190086137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987306417","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.09643065,0.0006582956,0.86548895,0.0007575259,0.004637698,0.0014278193,0.00005063936,0.0017258102,0.0288226],"genre_scores_gemma":[0.99640876,0.000040371695,0.00188577,0.00007070415,0.00006373243,0.00007628178,0.0000018156732,0.00004023875,0.0014123075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921334,0.000039704242,0.00017682707,0.00016398846,0.0001562733,0.0002498525],"domain_scores_gemma":[0.99915546,0.0001349947,0.000017950742,0.000621212,0.000019479357,0.00005091685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019684264,0.0001537795,0.00013325538,0.0000741147,0.000157714,0.00004810714,0.0003505318,0.00007853262,0.00039769494],"category_scores_gemma":[0.0000030740803,0.00011432011,0.00011458154,0.0002459052,0.000028068464,0.00013098755,0.0000027046904,0.0003041284,0.0005023722],"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.0000318714,0.00017045393,0.000116043826,0.00026422064,0.0005076077,0.000010850425,0.0038801502,0.4415759,0.01013172,0.0038745562,0.0009953727,0.53844124],"study_design_scores_gemma":[0.006391887,0.001282615,0.0049247663,0.0012577077,0.0005300949,0.00046366715,0.01077164,0.56309927,0.110542215,0.06055072,0.23552392,0.0046615144],"about_ca_topic_score_codex":0.000014271597,"about_ca_topic_score_gemma":0.000008409068,"teacher_disagreement_score":0.8999781,"about_ca_system_score_codex":0.00003240486,"about_ca_system_score_gemma":0.000008248141,"threshold_uncertainty_score":0.6457146},"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":"W2989774488","doi":"10.1002/jcd.21688","title":"Cyclic cycle systems of the complete multipartite graph","year":2020,"lang":"en","type":"article","venue":"Institutional Research Information System (Università degli Studi di Brescia)","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":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multipartite; Mathematics; Combinatorics; Graph; Discrete mathematics; Quantum","score_opus":0.06517181382929227,"score_gpt":0.25063452807488845,"score_spread":0.18546271424559618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989774488","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.9015006,0.0005760375,0.021769656,0.00038800304,0.0019529838,0.0021593387,0.000689454,0.0005054263,0.07045851],"genre_scores_gemma":[0.99975723,0.000009345803,0.000016986642,0.000024963509,0.00009784053,0.000035604608,0.000022528475,0.000010363769,0.00002514289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719626,0.0002980257,0.0005434037,0.00015992299,0.0013828857,0.0004194939],"domain_scores_gemma":[0.99857175,0.00014199638,0.00014024203,0.00034614155,0.0005789895,0.0002208539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009104134,0.0001804114,0.00030867947,0.00038069292,0.00088676205,0.00010391831,0.00074159534,0.00011127071,0.000010245597],"category_scores_gemma":[0.00012147276,0.0001562093,0.00017016985,0.0017654849,0.00041709674,0.0013334892,0.00023603166,0.00037843164,0.00033640917],"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.00015569669,0.000035078105,0.0071925665,0.0029505815,0.00043776596,0.000020714104,0.007315968,0.488652,0.002798782,0.48552877,0.004406525,0.0005055564],"study_design_scores_gemma":[0.007887093,0.00038517258,0.14279965,0.0031590972,0.00015321925,0.00028204522,0.10756242,0.5573365,0.0025587734,0.00031905627,0.17583686,0.0017201242],"about_ca_topic_score_codex":0.00014453409,"about_ca_topic_score_gemma":0.000013636868,"teacher_disagreement_score":0.4852097,"about_ca_system_score_codex":0.0002981492,"about_ca_system_score_gemma":0.00012805572,"threshold_uncertainty_score":0.6820347},"labels":[],"label_agreement":null},{"id":"W2994163036","doi":"10.1101/868935","title":"Fast and flexible design of novel proteins using graph neural networks","year":2019,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Institutes of Health Research; Compute Canada; Nvidia","keywords":"Artificial neural network; Protein design; Graph; Constraint (computer-aided design); Sequence (biology); Function (biology); Variety (cybernetics); Protein sequencing","score_opus":0.021556900151863383,"score_gpt":0.20201361646787647,"score_spread":0.1804567163160131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994163036","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.56346565,0.002115135,0.4314094,0.0000033539295,0.0013496093,0.00114436,0.00008029903,0.00042679018,0.000005400741],"genre_scores_gemma":[0.9910129,0.000087073895,0.008354439,0.000014846854,0.00023838076,0.00010429573,1.7686519e-7,0.00018618238,0.000001741046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785763,0.00011772954,0.00060644257,0.00061689777,0.00025230073,0.0005489864],"domain_scores_gemma":[0.9982956,0.000064072534,0.0002772966,0.0009916223,0.00018548606,0.00018591943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061772694,0.00060653896,0.0007660903,0.000354187,0.00009142434,0.00013137424,0.00042494523,0.00060242653,0.000008213891],"category_scores_gemma":[0.000028113362,0.0006660809,0.00015250596,0.0005077368,0.00012898476,0.00017134524,0.00023647143,0.0007326884,0.0000031369848],"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.000023082284,0.000041682484,0.001503762,0.00091470615,0.00016558498,0.0000057236266,0.00000997541,0.60385597,0.39295375,0.0005089277,0.000015299644,0.0000015650619],"study_design_scores_gemma":[0.0006487821,0.000054313852,0.0038060895,0.00088030036,0.00013350372,8.804519e-8,0.000004727452,0.9045716,0.088956654,0.000003537871,0.000047897673,0.00089250033],"about_ca_topic_score_codex":0.00003614666,"about_ca_topic_score_gemma":5.041586e-7,"teacher_disagreement_score":0.4275472,"about_ca_system_score_codex":0.00007965182,"about_ca_system_score_gemma":0.000091008464,"threshold_uncertainty_score":0.999579},"labels":[],"label_agreement":null},{"id":"W2999823167","doi":"10.37236/1990","title":"Pan-Factorial Property in Regular Graphs","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Combinatorics; Property (philosophy); Graph; Enhanced Data Rates for GSM Evolution; Factorial; Strongly regular graph; Order (exchange); Discrete mathematics; Line graph; Pathwidth; Computer science","score_opus":0.004129565124336749,"score_gpt":0.1804684884641493,"score_spread":0.17633892333981258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999823167","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.987793,0.006876597,0.00096571515,0.00022406023,0.0017104967,0.00014824618,4.027288e-7,0.000046179015,0.0022352897],"genre_scores_gemma":[0.9988361,0.00065452006,0.000002412042,0.000013460652,0.00027528728,0.0000029517003,2.4366864e-7,0.000023002634,0.0001919978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.00011735459,0.00042022005,0.000059714177,0.00026741117,0.00044644257],"domain_scores_gemma":[0.99952924,0.00006057886,0.000107146145,0.00019321518,0.000063129286,0.000046665453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011896541,0.000135766,0.00023805522,0.00013381528,0.000049276237,0.000024289218,0.00040559637,0.00007649843,0.000008837285],"category_scores_gemma":[0.000025751684,0.00007595114,0.000117592,0.0003981505,0.000029584673,0.00018747483,0.0000125071465,0.0007522146,0.000008802823],"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.000083491155,0.000101585465,0.00038686994,0.000023762635,0.000121348094,0.000009561955,0.00073189795,0.0031291998,0.0030838512,0.988108,0.0012064342,0.0030140406],"study_design_scores_gemma":[0.0016659708,0.00035545958,0.00032263267,0.00006093523,0.000040758692,0.00020969016,0.00016124306,0.00068020064,0.0066268,0.90946,0.08017824,0.00023808857],"about_ca_topic_score_codex":0.0000041554795,"about_ca_topic_score_gemma":0.000015053844,"teacher_disagreement_score":0.0789718,"about_ca_system_score_codex":0.00028950782,"about_ca_system_score_gemma":0.00008964848,"threshold_uncertainty_score":0.32680398},"labels":[],"label_agreement":null},{"id":"W2999935146","doi":"10.37236/1973","title":"Extending Arcs: An Elementary Proof","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 New Brunswick","funders":"","keywords":"Mathematical proof; Mathematics; Combinatorial proof; Elementary proof; Projective plane; Combinatorics; Plane (geometry); Direct proof; Projective test; Discrete mathematics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.004973517383678192,"score_gpt":0.20796259034543835,"score_spread":0.20298907296176016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999935146","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.9801521,0.0105368765,0.0067452374,0.00019454549,0.00068344903,0.00012284092,6.410025e-7,0.000055762415,0.001508567],"genre_scores_gemma":[0.9991104,0.00040378832,0.000012023926,0.000036062935,0.00032258563,0.0000028904176,6.7636404e-7,0.000026916005,0.00008466748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877346,0.00009999102,0.0003665842,0.000058900325,0.00025222474,0.00044881794],"domain_scores_gemma":[0.9995025,0.00004817761,0.00011760782,0.00020139069,0.00005656007,0.00007376177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012159399,0.0001278699,0.00018153503,0.000096345895,0.00009570862,0.000029636036,0.0004345555,0.00004015865,0.000029622246],"category_scores_gemma":[0.0000089109335,0.00009102288,0.00009183732,0.00021205164,0.00002376866,0.00030264704,0.000013356117,0.00057480787,0.000007728187],"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.000045458968,0.0001454507,0.00022547126,0.00003178192,0.00024387975,0.000009282073,0.00086735457,0.008260877,0.0048155226,0.97219026,0.0009531429,0.0122114895],"study_design_scores_gemma":[0.0015715865,0.0011782947,0.00026898374,0.00008341991,0.00014483741,0.00090459635,0.00094157003,0.0065638945,0.032592807,0.874192,0.081138305,0.00041968178],"about_ca_topic_score_codex":9.15811e-7,"about_ca_topic_score_gemma":0.0000049095875,"teacher_disagreement_score":0.09799826,"about_ca_system_score_codex":0.0002714966,"about_ca_system_score_gemma":0.000056831923,"threshold_uncertainty_score":0.3711805},"labels":[],"label_agreement":null},{"id":"W3000238327","doi":"10.37236/7874","title":"The Chromatic Number of Finite Group Cayley Tables","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Abelian group; Conjecture; Upper and lower bounds; Group (periodic table); Chromatic scale; Finite group; Sylow theorems; Cover (algebra); Discrete mathematics; Physics","score_opus":0.0023096900750067158,"score_gpt":0.1815914334554968,"score_spread":0.17928174338049008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000238327","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.986838,0.0072911363,0.0011253187,0.000057719815,0.0011235314,0.00012379659,8.083913e-7,0.000019139577,0.0034205944],"genre_scores_gemma":[0.99866605,0.0009259272,0.0000016696833,0.0000073175233,0.00004960896,0.0000021190017,3.3526322e-7,0.00002204503,0.00032495055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875766,0.00012400963,0.0004263505,0.000044664783,0.00027894936,0.00036835403],"domain_scores_gemma":[0.9988609,0.0005047468,0.00023137523,0.00028576617,0.00008300181,0.00003424323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013723279,0.000118240794,0.00024910574,0.00003627762,0.00008301215,0.000026256537,0.0005206285,0.00004948464,0.00003226001],"category_scores_gemma":[0.000035137713,0.00006571474,0.00013318814,0.00028660247,0.0000436806,0.00010102095,0.000019544468,0.00046976563,0.000033487737],"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.000028094606,0.000033698016,0.0010118354,0.00007999781,0.0002467873,0.0000015690229,0.00036999298,0.0020841083,0.0015845379,0.99394643,0.0003879774,0.000224989],"study_design_scores_gemma":[0.0010708659,0.00037970583,0.0006000879,0.00015762355,0.000102254315,0.00029000296,0.00067222357,0.0029864667,0.0033755242,0.97261477,0.017547466,0.00020302771],"about_ca_topic_score_codex":0.000003876204,"about_ca_topic_score_gemma":0.0000035023445,"teacher_disagreement_score":0.02133166,"about_ca_system_score_codex":0.00010206101,"about_ca_system_score_gemma":0.000059971462,"threshold_uncertainty_score":0.26797694},"labels":[],"label_agreement":null},{"id":"W3005139504","doi":"10.1016/j.disc.2020.111837","title":"Disjoint cycles and chorded cycles in a graph with given minimum degree","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Degree (music); Disjoint sets; Graph; Discrete mathematics","score_opus":0.02041939034260443,"score_gpt":0.20803890247721818,"score_spread":0.18761951213461375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005139504","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.9890902,0.00033006334,0.0055087064,0.00020984453,0.00003127664,0.000270621,0.00001894654,0.0001862698,0.004354064],"genre_scores_gemma":[0.99747306,0.000036745667,0.002347854,0.000026603731,0.00002699088,0.00003047341,0.0000052163787,0.000041186733,0.000011842902],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923223,0.000023130691,0.00025464068,0.00015583915,0.00012673264,0.00020744401],"domain_scores_gemma":[0.9996099,0.000059935417,0.00003925899,0.00017212333,0.000009603099,0.00010916302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098742035,0.00019032336,0.00029110032,0.00006394233,0.000032866876,0.00004547322,0.0001227342,0.00005483624,0.0000130460985],"category_scores_gemma":[0.000021552027,0.00014715873,0.000044529163,0.0002042713,0.00006691576,0.000088401124,0.000030606778,0.0001223046,0.000012233529],"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.00070385356,0.00078763673,0.06658062,0.03235564,0.0023302604,0.0009663004,0.397046,0.02572187,0.0743559,0.3747384,0.004099929,0.020313572],"study_design_scores_gemma":[0.009924691,0.0013364849,0.056281365,0.00537827,0.00058741594,0.0003272311,0.08738974,0.5585893,0.021723652,0.25018975,0.0025937022,0.0056784144],"about_ca_topic_score_codex":0.0000041647095,"about_ca_topic_score_gemma":0.000029914807,"teacher_disagreement_score":0.5328674,"about_ca_system_score_codex":0.000008119167,"about_ca_system_score_gemma":0.0000040566692,"threshold_uncertainty_score":0.6000959},"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":"W3006775530","doi":"10.1007/s00373-021-02414-6","title":"Local Balance in Graph Decompositions","year":2022,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Null graph; Graph; Butterfly graph; Windmill graph; Voltage graph; Mathematics; Colored; Vertex (graph theory); Line graph; Combinatorics; Graph property; Discrete mathematics","score_opus":0.0066739414426932086,"score_gpt":0.20054254986837353,"score_spread":0.19386860842568032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006775530","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.9635984,0.015847012,0.0030733643,0.00003261279,0.0047659148,0.00045254568,0.000116776704,0.00052272464,0.0115907015],"genre_scores_gemma":[0.99818677,0.0013994101,0.00002853282,0.000021613045,0.000009161437,0.00021319278,0.00006371318,0.00003775058,0.000039863502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988724,0.00007222197,0.00030295702,0.0003033308,0.00017183984,0.000277266],"domain_scores_gemma":[0.9994362,0.000046735437,0.000044131535,0.00036034646,0.000018762874,0.00009379846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020731334,0.00027116537,0.0003528639,0.00036383647,0.00011443636,0.000053160475,0.00026816296,0.00019978522,0.000039294024],"category_scores_gemma":[0.0000023478356,0.00031590823,0.00012994395,0.00052026915,0.0000651101,0.00004401161,0.00022445031,0.00088290917,0.0000025747247],"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.000010294292,0.00012948706,0.010182404,0.0006068528,0.00009741345,0.00007670802,0.0005095085,0.027529456,0.000036221438,0.9587889,0.0012442684,0.000788539],"study_design_scores_gemma":[0.0004375745,0.000042379972,0.006239861,0.000113632705,0.00002689223,0.000016800022,0.00030510835,0.008400723,0.00004126175,0.98030555,0.003562178,0.000508044],"about_ca_topic_score_codex":0.000053439395,"about_ca_topic_score_gemma":0.000015736214,"teacher_disagreement_score":0.034588415,"about_ca_system_score_codex":0.00007634,"about_ca_system_score_gemma":0.000015356403,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W3009700760","doi":"10.48550/arxiv.2003.03920","title":"A new representation of mutually orthogonal frequency squares","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Representation (politics); Mathematics; Combinatorics; Upper and lower bounds; Constraint (computer-aided design); Type (biology); Set (abstract data type); Binary number; Orthogonal array; Square (algebra); Discrete mathematics; Computer science; Mathematical analysis; Arithmetic; Geometry; Statistics","score_opus":0.060381481722988004,"score_gpt":0.17645679145275747,"score_spread":0.11607530972976947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009700760","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.8615645,0.00018773756,0.124785416,0.00002121239,0.00072652375,0.00028223218,0.00005924574,0.000369576,0.012003537],"genre_scores_gemma":[0.9990906,0.00008357859,0.00027777997,0.000008186824,0.00014501682,6.6415583e-7,0.00005034485,0.00003118511,0.0003126532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989772,0.00008538581,0.00025139243,0.00043239613,0.00007734004,0.00017630577],"domain_scores_gemma":[0.9991167,0.000058657843,0.00012955363,0.00048066102,0.00006297959,0.00015141015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007354751,0.00023557688,0.00035825127,0.0001659656,0.00003249826,0.000019094417,0.0004366039,0.00023396609,0.00017574473],"category_scores_gemma":[0.000024360163,0.00029469407,0.00025268053,0.00041748813,0.000044728855,0.0001228908,0.00016570803,0.00036862423,0.00004990674],"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.00008193481,0.000028998455,0.011360942,0.0007562885,0.00049061235,0.0002725239,0.0011631385,0.6381837,0.0040096147,0.34174868,0.001355771,0.0005477864],"study_design_scores_gemma":[0.0020839714,0.00022110231,0.016703054,0.00087698456,0.00070806633,0.000018206649,0.0019228739,0.18621281,0.007791625,0.7808593,0.0006481041,0.0019539269],"about_ca_topic_score_codex":0.00018527634,"about_ca_topic_score_gemma":0.000060395003,"teacher_disagreement_score":0.4519709,"about_ca_system_score_codex":0.000055437686,"about_ca_system_score_gemma":0.00008806466,"threshold_uncertainty_score":0.9999505},"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":"W3010904431","doi":"10.37236/9008","title":"Maximal Arcs, Codes, and New Links Between Projective Planes of Order 16","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Projective plane; Conjecture; Upper and lower bounds; Order (exchange); Incidence (geometry); Finite geometry; Binary code; Discrete mathematics; Minimum distance; Rank (graph theory); Dual (grammatical number); Binary number; Geometry; Arithmetic","score_opus":0.013515703878677104,"score_gpt":0.2035715332085311,"score_spread":0.19005582932985401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010904431","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.96884686,0.012688628,0.016168702,0.0007025227,0.00027446373,0.00020118477,0.0000060826546,0.000044267093,0.001067271],"genre_scores_gemma":[0.9992621,0.00047769962,0.000008056229,0.000022206263,0.00017541955,7.166443e-7,0.0000010764146,0.000019174428,0.000033572443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990581,0.00008110586,0.00033332093,0.00006377706,0.00019539558,0.0002682593],"domain_scores_gemma":[0.9994264,0.00013963091,0.0001583001,0.00009144407,0.00008819864,0.0000959874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042473737,0.0001261752,0.000322682,0.000053339343,0.000040348954,0.000015553725,0.00025070092,0.00009604946,0.0000059117647],"category_scores_gemma":[0.00004532368,0.00008938891,0.00005989037,0.0002966183,0.00004121361,0.00007848848,0.00002112556,0.00083620514,0.000001514735],"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.00043635594,0.00008199651,0.009327816,0.00041231827,0.0017049168,0.00001890434,0.007656882,0.001603337,0.0028599517,0.96626675,0.00424627,0.005384529],"study_design_scores_gemma":[0.0035852974,0.0032840094,0.0029155323,0.00018598471,0.00046733292,0.0003603451,0.001576244,0.001072497,0.018959368,0.9432924,0.023765426,0.00053558435],"about_ca_topic_score_codex":0.000010433079,"about_ca_topic_score_gemma":0.0000028142629,"teacher_disagreement_score":0.030415202,"about_ca_system_score_codex":0.00006805799,"about_ca_system_score_gemma":0.00015830247,"threshold_uncertainty_score":0.3645174},"labels":[],"label_agreement":null},{"id":"W3011317023","doi":"10.13001/ela.2020.5149","title":"The triangle graph $T_6$ is not SPN","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Converse; Symmetric matrix; Positive-definite matrix; Matrix (chemical analysis); Nonnegative matrix; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.008990989875618341,"score_gpt":0.1987404812043778,"score_spread":0.18974949132875946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011317023","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.9468574,0.030308878,0.0105383275,0.007860857,0.0014035418,0.00027578426,0.000009123431,0.00018901499,0.0025570514],"genre_scores_gemma":[0.9976865,0.0009026168,0.00003318539,0.00044462533,0.00078078767,0.0000017417319,5.124219e-7,0.000032484997,0.00011752538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986496,0.000079457175,0.00047929763,0.00008471614,0.00025013127,0.0004568145],"domain_scores_gemma":[0.9994064,0.000116348245,0.00013397854,0.00014830208,0.00006249008,0.0001324845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833856,0.00014324435,0.00026458304,0.00005624757,0.00012420578,0.000044565757,0.00038618495,0.00006377385,0.00007240376],"category_scores_gemma":[0.00006188794,0.000098280325,0.00028481203,0.00030984893,0.000034765337,0.00011882174,0.00001415881,0.00066626497,0.00007632568],"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.003146737,0.00027889598,0.0008931156,0.0005251582,0.007507114,0.00035219936,0.01847416,0.01448401,0.12587623,0.579305,0.16033468,0.08882272],"study_design_scores_gemma":[0.0039052109,0.0018970086,0.0002313458,0.000108842316,0.00024985266,0.0005637276,0.0012591259,0.009932821,0.11382555,0.046014816,0.821263,0.0007486827],"about_ca_topic_score_codex":9.881459e-7,"about_ca_topic_score_gemma":0.000002724364,"teacher_disagreement_score":0.6609283,"about_ca_system_score_codex":0.000043510117,"about_ca_system_score_gemma":0.00008427294,"threshold_uncertainty_score":0.40077552},"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":"W3013102369","doi":"10.23638/dmtcs-22-1-1","title":"Vertex ordering with optimal number of adjacent predecessors","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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 Guelph","funders":"Agence Nationale de la Recherche","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Computer science; Graph","score_opus":0.009019497210736761,"score_gpt":0.22111733288742005,"score_spread":0.2120978356766833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013102369","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.39487672,0.000014198654,0.5972764,0.000058556518,0.00010156355,0.00014587896,0.000004261073,0.00014613825,0.007376328],"genre_scores_gemma":[0.93127096,0.0000025312731,0.06862958,0.00003398262,0.000030336387,0.0000056672748,8.412322e-7,0.000024233608,0.0000018748417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853164,0.000025941035,0.0003244254,0.00027308072,0.00048704742,0.00035786215],"domain_scores_gemma":[0.9992231,0.000086316,0.000053267082,0.00032682077,0.00007282021,0.00023766617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035710074,0.0002002855,0.00030850235,0.000041014897,0.00008427847,0.00009541789,0.0006773969,0.000039774102,0.00013479784],"category_scores_gemma":[0.000033127762,0.00014603756,0.00006276085,0.00059551647,0.0011486349,0.00018633693,0.00016488777,0.00014245391,0.000045212786],"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.000015284853,0.000026810156,0.00008062129,0.00031980712,0.000026881498,0.0000063067055,0.004012532,0.013215315,0.0017045798,0.9802026,0.000019172516,0.00037008515],"study_design_scores_gemma":[0.0002186191,0.00011694087,0.00003523822,0.00018889327,0.000021341373,0.000028700098,0.0002889449,0.9710822,0.009381864,0.01836295,0.000029722283,0.00024459508],"about_ca_topic_score_codex":3.3770735e-7,"about_ca_topic_score_gemma":9.2896336e-8,"teacher_disagreement_score":0.9618397,"about_ca_system_score_codex":0.000013401927,"about_ca_system_score_gemma":0.000020861125,"threshold_uncertainty_score":0.5955239},"labels":[],"label_agreement":null},{"id":"W3014844","doi":"10.1007/bf01988032","title":"Recursive constructions on large sets of some balanced incomplete block designs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.010568064870484012,"score_gpt":0.21796563939955124,"score_spread":0.20739757452906724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014844","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.9921293,0.00020115661,0.000025042384,0.000040299095,0.0020147946,0.00018320796,0.000042289208,0.00018523446,0.005178624],"genre_scores_gemma":[0.99969894,0.000017568564,0.0001395982,0.000036075762,0.000020474758,0.00001889623,0.000007394258,0.000024087643,0.00003695788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991727,0.000060971553,0.00025004966,0.00013746852,0.00013409203,0.00024470428],"domain_scores_gemma":[0.99946475,0.00008893543,0.000055142056,0.00027526016,0.00004358124,0.00007234961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015356917,0.00014580751,0.00023319887,0.00010086032,0.000075846365,0.000010142014,0.000150284,0.00008679096,0.000039528673],"category_scores_gemma":[0.000019109635,0.00015491887,0.00007561821,0.00018580059,0.00004797755,0.00010890791,0.000016454513,0.00015727922,0.00009613333],"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.000015054009,0.000065999026,0.00052860286,0.000036348494,0.00007353425,0.0000029311075,0.0003074372,0.0012444282,0.0040550814,0.9911274,0.0022240803,0.00031914088],"study_design_scores_gemma":[0.004230048,0.0003506219,0.003822734,0.00030910806,0.00006761549,0.000054321008,0.0004868835,0.004030417,0.073196694,0.89485085,0.017807811,0.0007928871],"about_ca_topic_score_codex":0.0000022676209,"about_ca_topic_score_gemma":0.0000019912995,"teacher_disagreement_score":0.09627651,"about_ca_system_score_codex":0.000049876202,"about_ca_system_score_gemma":0.000011466967,"threshold_uncertainty_score":0.63174087},"labels":[],"label_agreement":null},{"id":"W3014980510","doi":"10.2140/ant.2023.17.93","title":"Constructions of difference sets in nonabelian 2-groups","year":2023,"lang":"en","type":"article","venue":"Algebra & Number Theory","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":"MetaOptima Technology (Canada); Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constructive; Product (mathematics); Set (abstract data type); Group (periodic table); Order (exchange); Class (philosophy); Algebra over a field; Algebraic number; Pure mathematics; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.007387366079784991,"score_gpt":0.21333857550353302,"score_spread":0.20595120942374803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014980510","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.9739471,0.000076244396,0.00014608983,0.000012198569,0.00050356146,0.00011105004,0.0000835801,0.00033749582,0.02478266],"genre_scores_gemma":[0.9993403,0.000024104562,0.000048707872,0.000015744947,0.000028647124,0.000043396703,0.00002858415,0.000028330405,0.0004421928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912566,0.00010892299,0.00026469846,0.00014151524,0.000106238986,0.00025295364],"domain_scores_gemma":[0.9993522,0.00027765793,0.000030193944,0.00026876578,0.000017002847,0.000054168264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030727923,0.00013406815,0.00020686968,0.0001453575,0.000037014583,0.00000996824,0.00016905846,0.00008555623,0.0009229798],"category_scores_gemma":[0.000031023053,0.00013442323,0.00006898697,0.0006579283,0.00012286911,0.00007115405,0.000031154526,0.00015128985,0.00055852416],"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.000026406333,0.000046038134,0.023989901,0.00024000183,0.00012807941,0.00003662785,0.003515138,0.0005409224,0.007085543,0.9421636,0.0018892629,0.020338515],"study_design_scores_gemma":[0.00055129203,0.000022951584,0.06467267,0.0002938512,0.000026413794,0.000072647024,0.0043212143,0.001560408,0.004991423,0.92092896,0.0020591076,0.00049908145],"about_ca_topic_score_codex":0.000010324427,"about_ca_topic_score_gemma":0.000024495414,"teacher_disagreement_score":0.04068277,"about_ca_system_score_codex":0.00001664465,"about_ca_system_score_gemma":0.000010025446,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W3015520384","doi":"10.36227/techrxiv.12093732.v1","title":"Online Sudoku Generator and Solver for Competitions using Java Server Faces","year":2020,"lang":"en","type":"preprint","venue":"","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":"Lakehead University","funders":"","keywords":"Scalability; Java; Computer science; Generator (circuit theory); Solver; Popularity; Web application; World Wide Web; Programming language; Operating system","score_opus":0.052761363659004114,"score_gpt":0.25468804695426533,"score_spread":0.20192668329526123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015520384","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.9476161,0.0011605361,0.047167525,0.0001401142,0.0012163298,0.0006082392,0.00088913157,0.0004598836,0.0007421355],"genre_scores_gemma":[0.9885671,0.00006692569,0.010218236,0.00011089367,0.00043900966,0.000043148306,0.0003077063,0.00006022132,0.0001867602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922,0.000023436203,0.00024521493,0.000261161,0.00007672411,0.00017342811],"domain_scores_gemma":[0.99958014,0.00003595057,0.000034338278,0.00020936337,0.00004342808,0.00009677026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007737691,0.000236519,0.00031681135,0.000058859932,0.000075406424,0.000084993735,0.00012587021,0.00019204488,0.00009807514],"category_scores_gemma":[0.0000065348904,0.00022975905,0.000114495946,0.000053664164,0.000028487606,0.000053341882,0.00012772497,0.00021179747,0.0000065142062],"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.0000693148,0.0003164629,0.0025894549,0.016277129,0.0029022053,0.00003639621,0.0036274071,0.6288638,0.134647,0.18853536,0.021071728,0.0010637051],"study_design_scores_gemma":[0.0008595194,0.000047285044,0.0006186005,0.0004965067,0.0002772342,0.000020771415,0.0009246339,0.9410799,0.008440434,0.016130941,0.029780336,0.0013238279],"about_ca_topic_score_codex":0.00003539925,"about_ca_topic_score_gemma":0.00010222311,"teacher_disagreement_score":0.31221607,"about_ca_system_score_codex":0.000023533468,"about_ca_system_score_gemma":0.000020290352,"threshold_uncertainty_score":0.93693024},"labels":[],"label_agreement":null},{"id":"W3015912977","doi":"10.1007/s10801-020-01001-x","title":"On resolvable Golomb rulers, symmetric configurations and progressive dinner parties","year":2021,"lang":"en","type":"preprint","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Golomb coding; Ruler; Block (permutation group theory); Combinatorics; Mathematics; Computer science; Physics","score_opus":0.008523629866259555,"score_gpt":0.2070971569757502,"score_spread":0.19857352710949067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015912977","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.9639001,0.026449695,0.0002648846,0.00016578293,0.0053742463,0.00025789445,0.000014542523,0.000081520295,0.003491338],"genre_scores_gemma":[0.99860054,0.00090940535,0.0000627194,0.000027568874,0.0001565049,0.000019674719,0.000010682752,0.000048064623,0.00016483823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981561,0.00015479937,0.0007553908,0.00020813601,0.00044951416,0.00027607958],"domain_scores_gemma":[0.9982858,0.00032825442,0.00046665248,0.00035235254,0.00037756766,0.00018940434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052919495,0.0003334277,0.00068285194,0.00051580055,0.000111803536,0.0002882689,0.0002966191,0.00033767088,0.000052258292],"category_scores_gemma":[0.0002672295,0.0003018509,0.0002278396,0.00048331812,0.00007309776,0.00016599322,0.000120077995,0.0012600508,0.000004398133],"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.00012190618,0.0006618666,0.0010257543,0.0025504457,0.002375923,0.001111448,0.004201833,0.015708052,0.000767698,0.94425213,0.024135042,0.0030879134],"study_design_scores_gemma":[0.004411877,0.0018510377,0.0069244574,0.0065842858,0.0011698817,0.0013562749,0.0047895527,0.008495324,0.008309672,0.9407686,0.012744762,0.0025942908],"about_ca_topic_score_codex":0.0000026181197,"about_ca_topic_score_gemma":8.116971e-7,"teacher_disagreement_score":0.034700446,"about_ca_system_score_codex":0.00014431846,"about_ca_system_score_gemma":0.000120743636,"threshold_uncertainty_score":0.9999434},"labels":[],"label_agreement":null},{"id":"W3016867789","doi":"10.55016/ojs/cdm.v17i2.70232","title":"Designs for graphs with six vertices and ten edges - II","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.01315523726742908,"score_gpt":0.23704203511170552,"score_spread":0.22388679784427643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016867789","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.44645867,0.0008654527,0.5465981,0.00060094555,0.00027718773,0.001876731,0.0016286746,0.00047963837,0.0012145964],"genre_scores_gemma":[0.9959932,0.0000049410055,0.0029464273,0.000027784334,0.000022771224,0.00075761386,0.00003266476,0.00002727602,0.00018729627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992867,0.000026828515,0.00019240618,0.00012853362,0.00011766331,0.00024788664],"domain_scores_gemma":[0.9994328,0.00016683924,0.000032160504,0.00021386746,0.000056018725,0.00009828442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002799705,0.00013778289,0.00020779925,0.00009343921,0.000619539,0.0000442307,0.00014132631,0.000027603846,0.000023978697],"category_scores_gemma":[0.000066267545,0.00011635735,0.000051522955,0.00024030608,0.000040550396,0.00007063603,0.000066268054,0.000084713975,0.000003543845],"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.000067282526,0.00011592296,0.00019367095,0.00046685568,0.00034660564,0.0000050778926,0.0055837925,0.010653747,0.0072950213,0.97043467,0.004270644,0.00056674005],"study_design_scores_gemma":[0.006040844,0.0036191728,0.00077137526,0.00053898257,0.0013073063,0.00030611514,0.021398949,0.147488,0.018796109,0.64398867,0.15291503,0.002829461],"about_ca_topic_score_codex":0.0000014738409,"about_ca_topic_score_gemma":0.0000051898933,"teacher_disagreement_score":0.54953456,"about_ca_system_score_codex":0.000042287054,"about_ca_system_score_gemma":0.000012677268,"threshold_uncertainty_score":0.47650555},"labels":[],"label_agreement":null},{"id":"W3021534272","doi":"","title":"Three-Coloring Three-Dimensional Uniform Hypergraphs.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University; University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.014843588248475922,"score_gpt":0.1947268364063736,"score_spread":0.17988324815789766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021534272","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.96351373,0.00011344306,0.0026994962,0.00014986965,0.0013571695,0.00027178385,0.00008641892,0.00017235422,0.03163573],"genre_scores_gemma":[0.999019,0.000001271806,0.00039709566,0.00024550394,0.00007683767,0.000015966896,0.00008324581,0.000030627507,0.00013044999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987871,0.000012334926,0.00022935972,0.00026236547,0.00028901966,0.00041984388],"domain_scores_gemma":[0.9991372,0.00011960755,0.000031641255,0.00021806256,0.000121523066,0.00037196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016123334,0.00021714497,0.0002146156,0.00064984657,0.000120642115,0.00007104256,0.00024180938,0.0001224552,0.0011835136],"category_scores_gemma":[0.000010980005,0.0002321022,0.00008286279,0.0005547741,0.000045797715,0.00012816074,0.000014433377,0.00025718726,0.0013740128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013494711,0.000014724916,0.016953172,0.0000641284,0.00011062311,0.000027770584,0.000043153315,0.54358023,0.00012811447,0.4317415,0.001411554,0.0059114997],"study_design_scores_gemma":[0.00081521826,0.00015379785,0.109433286,0.00021483467,0.000016972164,0.00005128123,0.00008707781,0.7811045,0.00009439496,0.10028086,0.0068628625,0.00088492496],"about_ca_topic_score_codex":0.0026181967,"about_ca_topic_score_gemma":0.02508727,"teacher_disagreement_score":0.33146065,"about_ca_system_score_codex":0.00016151095,"about_ca_system_score_gemma":0.00027225,"threshold_uncertainty_score":0.9997295},"labels":[],"label_agreement":null},{"id":"W3021735993","doi":"10.48550/arxiv.2005.02452","title":"The Karpelevi\\v{c} Region Revisited","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Manitoba","funders":"","keywords":"Eigenvalues and eigenvectors; Order (exchange); Combinatorics; Matrix (chemical analysis); Mathematics; Boundary (topology); Random matrix; Pure mathematics; Mathematical physics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.05949840366288468,"score_gpt":0.1521711452847829,"score_spread":0.09267274162189822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021735993","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.77461445,0.0044463496,0.11885846,0.0005221232,0.00484061,0.0018126542,0.00007127426,0.003845048,0.09098905],"genre_scores_gemma":[0.9973476,0.0011855972,0.0000075245443,0.00003699269,0.0001828085,0.0000013127556,0.000018901785,0.00004335084,0.0011759291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988743,0.00014384462,0.00019236632,0.00045495664,0.00005497714,0.00027954002],"domain_scores_gemma":[0.99879086,0.0001104712,0.000092223,0.0008172945,0.00005250788,0.00013666511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016658376,0.00029048586,0.0002899901,0.00007840984,0.00018770981,0.00007878254,0.00076148653,0.00026002267,0.000014979868],"category_scores_gemma":[0.000028111408,0.0002691796,0.00025504394,0.00040482412,0.00008968648,0.00007687883,0.00028831628,0.00068973826,0.00019432104],"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.00012319897,0.000022466435,0.0014473909,0.00089400535,0.00064457156,0.00087120594,0.00045074365,0.32814154,0.0002075929,0.6458112,0.020222284,0.0011638053],"study_design_scores_gemma":[0.00095247594,0.000078386336,0.0013580944,0.0008673746,0.00049438275,0.00003381001,0.0008499756,0.5692167,0.00041308848,0.26887345,0.15499118,0.0018710672],"about_ca_topic_score_codex":0.000011820073,"about_ca_topic_score_gemma":0.000008139128,"teacher_disagreement_score":0.37693775,"about_ca_system_score_codex":0.00009670899,"about_ca_system_score_gemma":0.000023121123,"threshold_uncertainty_score":0.99997604},"labels":[],"label_agreement":null},{"id":"W3022250425","doi":"10.13069/jacodesmath.729446","title":"Some bounds arising from a polynomial ideal associated to any $t$-design","year":2020,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Ideal (ethics); Degree (music); Integer (computer science); Polynomial; Lambda; Mathematics; Zero (linguistics); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.010209551175529859,"score_gpt":0.21508424569404885,"score_spread":0.204874694518519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022250425","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.9261686,0.0030566666,0.06828568,0.0009768964,0.00064144563,0.00044172365,0.000105635525,0.0001259449,0.0001974006],"genre_scores_gemma":[0.9986982,0.00008361718,0.00044464864,0.00019088149,0.0005301208,0.000010630126,0.000007807218,0.000029815175,0.000004282739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989395,0.0000530514,0.00044383382,0.00014657794,0.00021694257,0.00020006583],"domain_scores_gemma":[0.9992013,0.000084381165,0.00017316526,0.00013045374,0.00007265504,0.00033805717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001478868,0.00017738921,0.00032305467,0.00008774312,0.00016509056,0.00015668588,0.00025380315,0.00010561105,0.000010996636],"category_scores_gemma":[0.000037394584,0.00016089808,0.00010012729,0.00033564275,0.000033349505,0.00017813948,0.0000378108,0.00031270972,0.0000026770056],"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.00027914133,0.000114113194,0.0023825204,0.00017213525,0.0017192389,0.000042948188,0.006575616,0.020193925,0.0951921,0.83391833,0.035052985,0.0043569296],"study_design_scores_gemma":[0.0021204106,0.00055765023,0.016817793,0.000088518405,0.00030184485,0.000042296262,0.0010660486,0.005917097,0.005447851,0.9515619,0.015246655,0.00083187985],"about_ca_topic_score_codex":0.000008067628,"about_ca_topic_score_gemma":8.0776795e-7,"teacher_disagreement_score":0.1176436,"about_ca_system_score_codex":0.000052886848,"about_ca_system_score_gemma":0.00003004209,"threshold_uncertainty_score":0.6561233},"labels":[],"label_agreement":null},{"id":"W3022932399","doi":"10.26493/2590-9770.1250.763","title":"Cayley graphs of order kp are hamiltonian for k &lt; 48","year":2020,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","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 Lethbridge","funders":"","keywords":"Cayley graph; Hamiltonian (control theory); Mathematics; Combinatorics; Vertex-transitive graph; Graph; Discrete mathematics; Voltage graph; Line graph","score_opus":0.012546757478369494,"score_gpt":0.19741736586770395,"score_spread":0.18487060838933445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022932399","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.9424957,0.00041283836,0.026934596,0.0003884366,0.00007491913,0.0010022933,0.00011755932,0.0001400393,0.028433608],"genre_scores_gemma":[0.9964922,0.000027094911,0.0033258765,0.000038451777,0.000018514093,0.000032616867,0.0000041301914,0.000023946053,0.000037157235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943733,0.000005434685,0.00026224199,0.00007975179,0.00009373595,0.000121477155],"domain_scores_gemma":[0.99957573,0.00007643302,0.00008987219,0.00019119769,0.000021348482,0.000045433648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014154853,0.00011703757,0.00028334226,0.000020683148,0.000041975884,0.000008433941,0.00014005804,0.00003988956,0.000008596072],"category_scores_gemma":[0.000012224153,0.000079921236,0.000062316816,0.00012334403,0.00007956628,0.000022671651,0.000026504298,0.00005355024,0.0000042568936],"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.000055269156,0.00004817396,0.000038747803,0.0044858265,0.00027136432,4.3936492e-7,0.0120117795,0.0015417346,0.109012574,0.86831164,0.0036926544,0.00052976346],"study_design_scores_gemma":[0.0037115326,0.0003600668,0.00032051146,0.00081486884,0.0007471123,0.00001550362,0.030827383,0.055798795,0.35076073,0.5382856,0.01699818,0.0013597043],"about_ca_topic_score_codex":3.1158538e-7,"about_ca_topic_score_gemma":0.000002013386,"teacher_disagreement_score":0.33002603,"about_ca_system_score_codex":0.0000015264717,"about_ca_system_score_gemma":0.000002891755,"threshold_uncertainty_score":0.32590935},"labels":[],"label_agreement":null},{"id":"W3024612332","doi":"10.1201/9780203719916-3","title":"Faithful Enclosing of Triple Systems: A Generalization of Stern’s Theorem","year":2017,"lang":"en","type":"book-chapter","venue":"","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":"Vancouver Island University","funders":"","keywords":"Stern; Generalization; Triple bond; Mathematics; Pure mathematics; Algebra over a field; Physics; Mathematical analysis; Engineering; Marine engineering","score_opus":0.014654459709072478,"score_gpt":0.20009241172548847,"score_spread":0.185437952016416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024612332","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011983125,0.0024684726,0.009338524,0.0000011188406,0.0014875785,0.0004126182,0.00009127383,0.00012633685,0.98487574],"genre_scores_gemma":[0.71302855,0.00014104531,0.000054356504,0.0000018036689,0.00014258009,0.000008272428,0.000034115506,0.000079153644,0.2865101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888265,0.000024500594,0.0005876094,0.00016231446,0.00021261454,0.0001303084],"domain_scores_gemma":[0.99887425,0.000025692962,0.00035699448,0.00060222717,0.00009990745,0.000040902873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026443743,0.00026301172,0.0006126365,0.00018690697,0.000036705795,0.000027776305,0.00027883804,0.00030585052,0.00018287222],"category_scores_gemma":[0.000008320648,0.00023426645,0.00018057732,0.000012002113,0.000073600924,0.00008457518,0.000028825933,0.000108889355,0.000014562235],"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.000011449226,0.0000049905166,0.00002400924,0.001611998,0.00023300068,0.000002910774,0.0002461342,0.0016481815,0.0022071616,0.9925525,0.0007886243,0.0006690469],"study_design_scores_gemma":[0.005101669,0.00079835096,0.000149712,0.028589554,0.0019378767,0.0002152573,0.0012258718,0.08853647,0.07468529,0.2431616,0.5494083,0.006190037],"about_ca_topic_score_codex":0.000038911654,"about_ca_topic_score_gemma":0.000011418088,"teacher_disagreement_score":0.7493909,"about_ca_system_score_codex":0.00002962029,"about_ca_system_score_gemma":0.000016028107,"threshold_uncertainty_score":0.9553109},"labels":[],"label_agreement":null},{"id":"W3026202994","doi":"10.3390/e22050576","title":"Two-Dimensional Permutation Vectors’ (PV) Code for Optical Code Division Multiple Access Systems","year":2020,"lang":"en","type":"article","venue":"Entropy","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Constant-weight code; Permutation (music); Computer science; Code word; Systematic code; Code (set theory); Code division multiple access; Algorithm; Cardinality (data modeling); Interference (communication); Prefix code; Bit error rate; Transmitter; Code rate; Set (abstract data type); Theoretical computer science; Linear code; Telecommunications; Decoding methods; Block code; Physics","score_opus":0.02605857773788938,"score_gpt":0.26111424819384577,"score_spread":0.23505567045595638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026202994","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.9086435,0.0004012234,0.08777294,0.00015339805,0.0015016876,0.00065606437,0.00019103316,0.00044127743,0.00023887894],"genre_scores_gemma":[0.9989486,0.0000020345667,0.00035342982,0.00005914859,0.0003805101,0.000094560215,0.00009031437,0.00004425809,0.000027171769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898475,0.0000427162,0.00027473486,0.00022806907,0.00021053896,0.00025917153],"domain_scores_gemma":[0.99939275,0.00021910128,0.000038618302,0.00013497376,0.000050852075,0.00016372783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013636991,0.00016597706,0.00022736921,0.000041207746,0.00009878044,0.000101058125,0.00018368651,0.00007236463,0.000030489566],"category_scores_gemma":[0.000095505864,0.00015409944,0.00009753348,0.00011855918,0.000023316265,0.00018222055,0.000034691577,0.00011652884,0.00008087794],"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.00016488359,0.000045347395,0.0031871349,0.00045900344,0.000113474365,0.000013879424,0.0006421912,0.83639485,0.116269276,0.03864116,0.0038752407,0.0001935901],"study_design_scores_gemma":[0.0014428936,0.000088573324,0.0012599141,0.00007398893,0.000029305344,0.000005894657,0.00010720839,0.979553,0.013067041,0.00026860894,0.0038509655,0.00025264168],"about_ca_topic_score_codex":0.0000057899697,"about_ca_topic_score_gemma":0.0000038090136,"teacher_disagreement_score":0.14315815,"about_ca_system_score_codex":0.00004200689,"about_ca_system_score_gemma":0.000010371476,"threshold_uncertainty_score":0.6283993},"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":"W3030282785","doi":"10.1142/s1793830920500482","title":"Starter sequences and M-fold starter sequences: How can you begin?","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","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":"Starter; Mathematics; Combinatorics; Fold (higher-order function); Biology; Computer science; Food science; Programming language","score_opus":0.015639134198053867,"score_gpt":0.21258263772387728,"score_spread":0.1969435035258234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030282785","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.3613275,0.0040297653,0.60492456,0.013060324,0.00024203573,0.003708082,0.0018648732,0.0013978835,0.00944499],"genre_scores_gemma":[0.9914708,0.00017609051,0.0075286105,0.00014012064,0.00015974526,0.00033487476,0.0000410827,0.000036882895,0.000111754984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917066,0.000014481285,0.00021627932,0.0002463378,0.00013833767,0.0002139273],"domain_scores_gemma":[0.9994626,0.00004586984,0.000053093336,0.00021557993,0.00002947259,0.00019338817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104490646,0.00020284868,0.00023631139,0.00003802129,0.00015195593,0.00018960239,0.00014242134,0.00006498585,0.000018174975],"category_scores_gemma":[0.000005089623,0.00017097514,0.000042668835,0.00017345794,0.00012803126,0.00012554965,0.00003202158,0.00011879884,0.000009143766],"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.000017161532,0.00019997769,0.0013047125,0.0064789816,0.0010999291,0.00003759116,0.07859719,0.001587561,0.030411823,0.8222637,0.0041440097,0.053857364],"study_design_scores_gemma":[0.0014353035,0.00039655343,0.00038754073,0.0003642581,0.0004319694,0.00012806519,0.043520935,0.6434487,0.0049508065,0.19850975,0.10385714,0.0025689644],"about_ca_topic_score_codex":0.000009435415,"about_ca_topic_score_gemma":0.000008856448,"teacher_disagreement_score":0.64186114,"about_ca_system_score_codex":0.000010033069,"about_ca_system_score_gemma":0.000009344921,"threshold_uncertainty_score":0.6972164},"labels":[],"label_agreement":null},{"id":"W3035089730","doi":"10.22108/toc.2020.120320.1692","title":"Exact bounds for (λ,n)–stable 0-1 matrices.","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"Université de Sherbrooke","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.18586164804632868,"score_gpt":0.48085358829029556,"score_spread":0.2949919402439669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035089730","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.8669858,0.076987095,0.014172653,0.00030729867,0.0027993878,0.0018339059,0.00029375404,0.00055192894,0.036068197],"genre_scores_gemma":[0.9952661,0.0033703507,0.00022185758,0.00023753439,0.00042255846,0.00009526461,0.000015023831,0.00010729119,0.00026401048],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978302,0.00010874,0.0008109645,0.00034320026,0.00040552678,0.0005013661],"domain_scores_gemma":[0.9984956,0.00027293907,0.0003168266,0.00036876366,0.00015228431,0.00039363478],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092185155,0.00034548505,0.00078627456,0.00038772819,0.0002207208,0.0012632564,0.002200316,0.00013257108,0.0045264345],"category_scores_gemma":[0.00014773321,0.00033304087,0.00028802984,0.0010499568,0.00005757638,0.0020247754,0.0002700813,0.00032021798,0.000044474815],"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.00056541694,0.00021092306,0.083231494,0.002572456,0.0011733558,0.00006977602,0.0012670826,0.014287685,0.30971107,0.002753486,0.56760603,0.01655123],"study_design_scores_gemma":[0.0030473368,0.000071623814,0.063516654,0.001101735,0.0004439736,0.000050914794,0.0006454584,0.0120655345,0.15269881,0.03288936,0.73098093,0.002487691],"about_ca_topic_score_codex":0.00009360906,"about_ca_topic_score_gemma":0.000007886692,"teacher_disagreement_score":0.16337489,"about_ca_system_score_codex":0.000064793145,"about_ca_system_score_gemma":0.000053005908,"threshold_uncertainty_score":0.99991214},"labels":[],"label_agreement":null},{"id":"W3035542725","doi":"10.13001/ela.2020.5217","title":"Maximal Orientations of Graphs","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.007608641683185857,"score_gpt":0.2030779890287413,"score_spread":0.19546934734555543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035542725","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.97970873,0.0027441203,0.016342906,0.00018119645,0.00023038097,0.00005766204,0.000003965857,0.00003700451,0.00069404684],"genre_scores_gemma":[0.99942756,0.00014318092,0.00019658246,0.000039297516,0.0001610592,7.548274e-7,0.0000012844085,0.000017538605,0.000012721639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991348,0.000034138866,0.00039552542,0.00005119976,0.00015830046,0.00022604573],"domain_scores_gemma":[0.99962544,0.00003104496,0.00011655753,0.00006949528,0.00007280244,0.00008465767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020956041,0.000084979576,0.00020482845,0.0000830477,0.000024917044,0.0000063572,0.0001640221,0.00003819068,0.00007650662],"category_scores_gemma":[0.000027444752,0.00007677468,0.00014864728,0.00031003915,0.000031969663,0.00011227143,0.0000069166667,0.0003172396,0.000013053895],"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.00031220654,0.00013507601,0.0027883595,0.00033317544,0.0013571556,0.00005188888,0.005625739,0.019304646,0.11536024,0.8475739,0.0027761813,0.004381482],"study_design_scores_gemma":[0.010724656,0.009399825,0.0043772524,0.0005109507,0.0010541672,0.0017192841,0.007237175,0.034786347,0.51425403,0.32494187,0.088897444,0.0020970027],"about_ca_topic_score_codex":7.137184e-7,"about_ca_topic_score_gemma":0.0000010201736,"teacher_disagreement_score":0.52263194,"about_ca_system_score_codex":0.000022194046,"about_ca_system_score_gemma":0.00006625961,"threshold_uncertainty_score":0.31307808},"labels":[],"label_agreement":null},{"id":"W3037733482","doi":"","title":"Costas cubes","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Permutation (music); Cube (algebra); Mathematics; Order (exchange); Discrete mathematics; Physics","score_opus":0.06157262740825657,"score_gpt":0.16314614895575888,"score_spread":0.10157352154750231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037733482","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.8898264,0.00046780793,0.01330936,0.000012760389,0.002528151,0.00029167417,0.00008130801,0.00077103113,0.0927115],"genre_scores_gemma":[0.99639815,0.0003734995,0.00001238597,0.000007869308,0.00012928917,9.461444e-7,0.000024655239,0.000039234637,0.0030139773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909884,0.00005163294,0.0001245538,0.00041209656,0.000042566542,0.0002702869],"domain_scores_gemma":[0.9986359,0.000030438747,0.0000801653,0.0010862362,0.00004370068,0.00012357559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014235039,0.00028183396,0.0003065978,0.0001417349,0.0001580263,0.00008328077,0.0007997989,0.000325049,0.000091977476],"category_scores_gemma":[0.000012721299,0.0003408193,0.00020648366,0.00007892375,0.00009808205,0.00013389894,0.0002951281,0.00047989548,0.000324219],"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.000033016942,0.00003567321,0.00268889,0.00055848545,0.0004314476,0.00054352364,0.00027822342,0.81006134,0.00016077157,0.18101393,0.0034254978,0.0007692009],"study_design_scores_gemma":[0.0013762527,0.00006191152,0.0033176476,0.0009290448,0.00050124346,0.000023496203,0.00047859456,0.7379519,0.0014820956,0.19397224,0.05734607,0.002559547],"about_ca_topic_score_codex":0.000050531457,"about_ca_topic_score_gemma":0.00003323309,"teacher_disagreement_score":0.106571734,"about_ca_system_score_codex":0.000105311425,"about_ca_system_score_gemma":0.00002756244,"threshold_uncertainty_score":0.9999044},"labels":[],"label_agreement":null},{"id":"W3037862862","doi":"","title":"Fibonacci Designs","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","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":"Metis; Fibonacci number; Mathematics; Automorphism; Residual; Combinatorics; Pure mathematics; Computer science; Algorithm","score_opus":0.06282253724143577,"score_gpt":0.15614610447891347,"score_spread":0.0933235672374777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037862862","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.9275895,0.00012299397,0.043811906,0.0000058161736,0.0021067108,0.00025947895,0.000036051104,0.00079773425,0.025269842],"genre_scores_gemma":[0.99788296,0.00008474997,0.00007959053,0.000012351016,0.00015205052,0.0000013449634,0.000023229719,0.000049438953,0.0017142912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989948,0.00006185122,0.00015089821,0.00044431636,0.000044457804,0.00030362443],"domain_scores_gemma":[0.9989274,0.00005612038,0.000058140136,0.00076442386,0.000044696848,0.00014920492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016472222,0.00030852816,0.00029352232,0.00018599334,0.000079282,0.000042098625,0.0006056051,0.000559119,0.00023232953],"category_scores_gemma":[0.000009704178,0.00037496624,0.0002200615,0.0002207019,0.00006768777,0.00009774348,0.00021757712,0.0009919332,0.00030097665],"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.000030668667,0.00004339073,0.0016856081,0.00040623077,0.00027932206,0.00034574035,0.00025810255,0.82737815,0.0022536917,0.16500543,0.001956823,0.00035684634],"study_design_scores_gemma":[0.0013118645,0.00007615781,0.00253296,0.0004477216,0.00047478106,0.000035861678,0.0004600306,0.6750444,0.0055975574,0.2852046,0.025805568,0.003008513],"about_ca_topic_score_codex":0.000031634874,"about_ca_topic_score_gemma":0.000052655167,"teacher_disagreement_score":0.15233374,"about_ca_system_score_codex":0.00007136788,"about_ca_system_score_gemma":0.000032924207,"threshold_uncertainty_score":0.99987024},"labels":[],"label_agreement":null},{"id":"W3039500359","doi":"10.26493/1855-3974.2374.9ff","title":"New results on modular Golomb rulers, optical orthogonal codes and related structures","year":2020,"lang":"en","type":"preprint","venue":"Ars Mathematica Contemporanea","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Golomb coding; Modular design; Mathematics; Combinatorics; Order (exchange); Discrete mathematics; Computer science; Image (mathematics); Programming language; Business","score_opus":0.020613894835832557,"score_gpt":0.22285676506902058,"score_spread":0.20224287023318802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039500359","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.8674053,0.0027835467,0.006196357,0.0020694712,0.0027141955,0.0025483067,0.00069560856,0.0023065915,0.1132806],"genre_scores_gemma":[0.9966947,0.00005662198,0.0024169309,0.00004808569,0.000120488585,0.000032244687,0.00017335918,0.00010792379,0.0003496791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975111,0.00012557041,0.0009738796,0.0006457889,0.00039372517,0.00034992603],"domain_scores_gemma":[0.998305,0.0003493793,0.00019445656,0.0007412645,0.000040550854,0.00036935468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046036474,0.0006135462,0.001001709,0.0001313167,0.00007260472,0.00014411351,0.00039553584,0.0005632704,0.000058700516],"category_scores_gemma":[0.00022762382,0.00055115303,0.00022875742,0.0001216075,0.00012058105,0.000065413755,0.00018461685,0.0010166144,0.00010216829],"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.0006892052,0.000093464965,0.000046186466,0.005343523,0.0023439962,0.0006314039,0.008421636,0.0115387365,0.005436664,0.94574517,0.017351411,0.0023585735],"study_design_scores_gemma":[0.0022348391,0.00018483918,0.00042908074,0.0017924235,0.00024344663,0.00014911247,0.00037795608,0.02618777,0.0019790225,0.9635572,0.0015968368,0.0012674872],"about_ca_topic_score_codex":0.000010674789,"about_ca_topic_score_gemma":0.0000031014622,"teacher_disagreement_score":0.12928934,"about_ca_system_score_codex":0.000036528796,"about_ca_system_score_gemma":0.000059065373,"threshold_uncertainty_score":0.999694},"labels":[],"label_agreement":null},{"id":"W3041826191","doi":"10.1117/1.oe.59.7.076105","title":"Design and performance analysis of GPON-employed two-dimensional multidiagonal OCDMA code","year":2020,"lang":"en","type":"article","venue":"Optical Engineering","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":"Optiwave Systems (Canada)","funders":"","keywords":"Computer science; Passive optical network; Optical engineering; Code division multiple access; Code (set theory); Telecommunications; Optics; Wavelength-division multiplexing; Physics; Programming language","score_opus":0.012694743502596497,"score_gpt":0.1933662718210935,"score_spread":0.180671528318497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041826191","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.8937568,0.00018544024,0.10557618,0.000021041365,0.00007756517,0.00008827846,0.000008350755,0.00018213231,0.00010420539],"genre_scores_gemma":[0.9881883,0.000008445325,0.0117019685,0.00001656045,0.000037280206,0.0000105917525,0.000006680168,0.000026356378,0.0000037981738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999197,0.000011918179,0.00025663324,0.00016454961,0.00015514714,0.00021474919],"domain_scores_gemma":[0.9994857,0.00018365281,0.00001666911,0.00011112676,0.000023979734,0.00017888889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015813837,0.00016049534,0.00033203317,0.00012828181,0.000023683337,0.00001334614,0.00009002628,0.000059895152,0.000031262905],"category_scores_gemma":[0.000038060545,0.00016060252,0.00008072056,0.00050097913,0.000030200179,0.000086945394,0.00002830288,0.0001488651,0.000007821494],"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.00002317059,0.0000069780053,0.00038547814,0.000094186245,0.00036802146,0.0000048106845,0.00012863157,0.9478658,0.049624898,0.0011063641,0.000009453517,0.00038220195],"study_design_scores_gemma":[0.00026646053,0.0000501581,0.0036736885,0.000025039642,0.00017840005,0.000003630239,0.0000066927123,0.98031557,0.015263998,0.0000046556756,0.00004210619,0.00016961948],"about_ca_topic_score_codex":0.000001050234,"about_ca_topic_score_gemma":1.9898347e-7,"teacher_disagreement_score":0.09443151,"about_ca_system_score_codex":0.000012478389,"about_ca_system_score_gemma":0.0000058435517,"threshold_uncertainty_score":0.654918},"labels":[],"label_agreement":null},{"id":"W3043148448","doi":"10.37236/9725","title":"Hadamard Diagonalizable Graphs of Order at Most 36","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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; Ontario Tech University","funders":"National Science Foundation","keywords":"Diagonalizable matrix; Hadamard matrix; Mathematics; Hadamard transform; Hadamard three-lines theorem; Complex Hadamard matrix; Combinatorics; Hadamard's inequality; Hadamard's maximal determinant problem; Hadamard product; Laplacian matrix; Hadamard three-circle theorem; Eigenvalues and eigenvectors; Graph; Discrete mathematics; Symmetric matrix; Physics; Mathematical analysis","score_opus":0.0035089089068579857,"score_gpt":0.17306635063278916,"score_spread":0.16955744172593118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043148448","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.9747402,0.019221894,0.00134675,0.0001167168,0.001488973,0.00013271475,0.00000568704,0.000036113626,0.0029109628],"genre_scores_gemma":[0.99881524,0.00056314515,0.0000018286474,0.000025877582,0.000028815743,0.000007354265,0.0000015055919,0.000029690424,0.00052656303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984811,0.00017853241,0.00042642618,0.00006195705,0.00045183877,0.00040014758],"domain_scores_gemma":[0.9992384,0.00013410486,0.00022383177,0.00023076785,0.00012284197,0.000050099028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234182,0.00012933442,0.00027884202,0.00012644308,0.0002009209,0.000009958551,0.0005343508,0.00003299873,0.00013987451],"category_scores_gemma":[0.000023029797,0.000100890284,0.00014305236,0.0008328524,0.00004189238,0.000072229624,0.00007535211,0.0006256818,0.0000028561778],"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.00013694982,0.00011167621,0.0005555092,0.00005804142,0.0003598805,0.000012046898,0.00059935806,0.034292024,0.0026010254,0.9546999,0.0064155944,0.00015800673],"study_design_scores_gemma":[0.0011449482,0.00071518664,0.00016731338,0.00002049113,0.0001308337,0.0005334893,0.00042133682,0.0010481881,0.0046979934,0.9273659,0.0635367,0.00021759636],"about_ca_topic_score_codex":0.0000063657167,"about_ca_topic_score_gemma":0.0000054845473,"teacher_disagreement_score":0.05712111,"about_ca_system_score_codex":0.00032985242,"about_ca_system_score_gemma":0.00012982394,"threshold_uncertainty_score":0.41141865},"labels":[],"label_agreement":null},{"id":"W3043264869","doi":"10.26493/1855-3974.1685.395","title":"Incidence structures near configurations of type (n_3)","year":2020,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Incidence (geometry); Euclidean geometry; Type (biology); Hypergraph; Line (geometry); Projective plane; Discrete mathematics; Geometry","score_opus":0.024498562677013024,"score_gpt":0.22336806235402998,"score_spread":0.19886949967701695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043264869","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.9589076,0.00056484714,0.006075386,0.00032073114,0.00024599332,0.00043853075,0.000026889105,0.0003717909,0.033048198],"genre_scores_gemma":[0.99906975,0.000005842665,0.0007618097,0.00007306294,0.00002076966,0.000007825099,0.0000055672326,0.000021523192,0.000033832857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992469,0.000033914766,0.00035383643,0.000105586034,0.00014248496,0.00011728191],"domain_scores_gemma":[0.9994743,0.00010381926,0.00006732082,0.00020619087,0.0000625137,0.00008586849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011454782,0.00012355552,0.0002714064,0.000024462768,0.000041816988,0.000026775755,0.00017952145,0.000052665204,0.00024595115],"category_scores_gemma":[0.0001123978,0.00011066566,0.000061154744,0.00019667762,0.000079357655,0.0000977649,0.0000129947575,0.000092599854,0.00010376278],"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.000087951186,0.000056853944,0.0006490675,0.003034858,0.00043169837,0.000043928212,0.025449656,0.004966512,0.22276779,0.73254234,0.009228428,0.000740898],"study_design_scores_gemma":[0.003514108,0.00094737374,0.0016683731,0.001252055,0.0003743793,0.00018126964,0.008659877,0.3496863,0.1859274,0.41432884,0.03091656,0.0025434408],"about_ca_topic_score_codex":0.000004227992,"about_ca_topic_score_gemma":0.0000014512713,"teacher_disagreement_score":0.3447198,"about_ca_system_score_codex":0.0000052845676,"about_ca_system_score_gemma":0.000021144058,"threshold_uncertainty_score":0.45128146},"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":"W30538323","doi":"10.1038/d41586-018-07734-x","title":"Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Electronic circuit; Graph; Plane (geometry); Combinatorics; Discrete mathematics; Arithmetic; Geometry; Electrical engineering; Engineering","score_opus":0.004147788796509642,"score_gpt":0.16255924101002223,"score_spread":0.15841145221351258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30538323","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.9854518,0.00094209175,0.000019292953,0.00001654553,0.0007816905,0.00017395351,0.000018526898,0.0002791021,0.012316984],"genre_scores_gemma":[0.998819,0.000025289572,0.000013478725,0.000029895975,0.000019618725,0.00002083091,0.000017274162,0.00005008506,0.0010045036],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900734,0.000033735298,0.00019454594,0.00024215307,0.00019575635,0.00032643814],"domain_scores_gemma":[0.9995097,0.00003716922,0.000040628893,0.00029055442,0.000029190767,0.0000927526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001228641,0.00023872773,0.0002599531,0.00009436224,0.00014599723,0.000050665414,0.00012173173,0.00010209023,0.000037612244],"category_scores_gemma":[0.0000026050325,0.00021543686,0.000040394898,0.00023203682,0.00007435745,0.00015801031,0.000024413648,0.00014894613,0.00006626394],"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.00012041563,0.00015585535,0.55467874,0.0005058144,0.0003602844,0.00012468516,0.00093754125,0.0009029469,0.010489925,0.39839682,0.03270569,0.00062129204],"study_design_scores_gemma":[0.011851812,0.00078121043,0.27374345,0.00084184407,0.00031960933,0.0010256394,0.00062880473,0.0016507435,0.046317838,0.62342656,0.035839878,0.0035726163],"about_ca_topic_score_codex":0.000058341786,"about_ca_topic_score_gemma":0.000045888835,"teacher_disagreement_score":0.28093526,"about_ca_system_score_codex":0.000037769532,"about_ca_system_score_gemma":0.000008223597,"threshold_uncertainty_score":0.878526},"labels":[],"label_agreement":null},{"id":"W3060607878","doi":"10.1016/j.ffa.2021.101866","title":"A lower bound on HMOLS with equal sized holes","year":2021,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Mathematics; Upper and lower bounds; Equipartition theorem; Order (exchange); Product (mathematics); Orthogonal array; Matrix (chemical analysis); Finite field; Discrete mathematics; Physics; Statistics; Geometry; Mathematical analysis; Quantum mechanics","score_opus":0.012524983623596338,"score_gpt":0.21026574907780426,"score_spread":0.19774076545420793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3060607878","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.37194386,0.0027999072,0.57901734,0.00034197452,0.00055025285,0.0016378555,0.0005332267,0.0006440742,0.042531494],"genre_scores_gemma":[0.9980458,0.00015765557,0.00016291275,0.00010248962,0.00015873573,0.0009625209,0.000165382,0.000035394438,0.00020913176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992412,0.000028813887,0.00019128826,0.00029794252,0.00007356661,0.00016723653],"domain_scores_gemma":[0.9990717,0.00020102688,0.000046352154,0.000570492,0.000039219514,0.00007120415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000873815,0.0002511188,0.00027766093,0.0000651503,0.00011015021,0.00015441488,0.0001664406,0.00028682203,0.0000679816],"category_scores_gemma":[0.0000049188357,0.00019715342,0.00008565133,0.00011794303,0.00006300873,0.000027641972,0.000079292164,0.0005045076,0.000016898162],"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.0005730262,0.0013373722,0.0005208552,0.0054367604,0.003936555,0.00009077928,0.02070685,0.12406445,0.0039508822,0.7533225,0.004361075,0.08169894],"study_design_scores_gemma":[0.004934608,0.001450819,0.0018268545,0.005522685,0.0006460009,0.00014577564,0.008042322,0.044030562,0.0123003535,0.45583954,0.45794815,0.007312329],"about_ca_topic_score_codex":0.000009344372,"about_ca_topic_score_gemma":0.00002758849,"teacher_disagreement_score":0.6261019,"about_ca_system_score_codex":0.00001035534,"about_ca_system_score_gemma":0.000027191058,"threshold_uncertainty_score":0.8039683},"labels":[],"label_agreement":null},{"id":"W3081345703","doi":"10.31799/1684-8853-2020-4-2-10","title":"Conference matrices from Legendre C-pairs","year":2020,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Education and Science of the Russian Federation; Compute Canada","keywords":"Legendre polynomials; Mathematics; Order (exchange); Combinatorics; Abelian group; Group (periodic table); Pure mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.006935592973951402,"score_gpt":0.1591168324270149,"score_spread":0.1521812394530635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081345703","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.5650984,0.010934169,0.3249488,0.00093771605,0.0033620533,0.0017859016,0.00077887654,0.0025022656,0.08965181],"genre_scores_gemma":[0.999561,0.000040361203,0.0000065935187,0.00021059463,0.00011493417,0.000029070758,0.000021739024,0.0000053637214,0.000010329324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993906,0.000029550758,0.00030871245,0.000053812582,0.00010836554,0.00010893062],"domain_scores_gemma":[0.9996958,0.000030948726,0.000057886075,0.00007568337,0.000035170528,0.00010451932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083594256,0.000101115875,0.0001747003,0.00003486206,0.000044884644,0.00018349281,0.00008314081,0.00006213582,0.00003311681],"category_scores_gemma":[0.000008091342,0.00009043066,0.000028856708,0.00007484528,0.00001269178,0.00064159214,0.0000061615215,0.00006913644,0.00023676788],"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.00076799555,0.000051111252,0.019417545,0.0074370313,0.0022812968,0.000040352297,0.104025155,0.23076874,0.021972671,0.4475857,0.052921448,0.11273095],"study_design_scores_gemma":[0.0015123973,0.000040064802,0.00074353814,0.00007135331,0.000027504804,0.0000089683035,0.0055545974,0.83737665,0.00014571584,0.00011780943,0.15412617,0.00027523888],"about_ca_topic_score_codex":0.000062690866,"about_ca_topic_score_gemma":0.0000021255116,"teacher_disagreement_score":0.6066079,"about_ca_system_score_codex":0.000007417348,"about_ca_system_score_gemma":0.00000656928,"threshold_uncertainty_score":0.3687655},"labels":[],"label_agreement":null},{"id":"W3083845621","doi":"10.23952/jano.3.2021.3.01","title":"The fun is finite: Douglas-Rachford and Sudoku puzzle – Finite termination and local linear convergence","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Leverhulme Trust","keywords":"Convergence (economics); Mathematics; Applied mathematics; Calculus (dental); Computer science; Mathematical optimization; Economics","score_opus":0.004666684971510855,"score_gpt":0.18881917530046893,"score_spread":0.18415249032895809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083845621","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.06413329,0.0021131241,0.9314889,0.00042104904,0.00044118764,0.00011313939,0.0000052740074,0.000026440051,0.001257626],"genre_scores_gemma":[0.9956026,0.0019105586,0.0022470816,0.000078412835,0.000094053394,0.0000027894694,0.0000031679688,0.000010963538,0.000050387127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940526,0.000024463467,0.0002724315,0.00008577963,0.0001107812,0.00010128085],"domain_scores_gemma":[0.99948275,0.00021170476,0.00009151869,0.00006193445,0.00007373227,0.00007838549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018852645,0.000092973205,0.00015482464,0.000036906393,0.00014216194,0.00006694642,0.000041328534,0.00006468025,0.000024765646],"category_scores_gemma":[0.000031831412,0.00006876345,0.000025508452,0.00013272047,0.000064471955,0.00011865097,0.000020026417,0.0001401636,9.636116e-7],"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.0002060082,0.00003597793,0.00046319334,0.0001342429,0.0001013159,0.000021993745,0.0018692779,0.911905,0.0010161104,0.0059197806,0.00022538374,0.07810175],"study_design_scores_gemma":[0.0004911517,0.00006245517,0.00046064978,0.00002924556,0.00003622857,0.00007189538,0.00056563196,0.9879221,0.0016577014,0.0010835341,0.007497505,0.00012191998],"about_ca_topic_score_codex":5.563584e-7,"about_ca_topic_score_gemma":3.3621103e-7,"teacher_disagreement_score":0.9314693,"about_ca_system_score_codex":0.000009419461,"about_ca_system_score_gemma":0.000009677971,"threshold_uncertainty_score":0.28040922},"labels":[],"label_agreement":null},{"id":"W3086793159","doi":"10.7151/dmgt.2355","title":"Efficient <i>(j, k)</i> -dominating functions","year":2020,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","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 Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.010157933203239268,"score_gpt":0.19143911717733153,"score_spread":0.18128118397409226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086793159","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.55222994,0.00096606725,0.3721632,0.00071162987,0.0011076997,0.00083833473,0.00005912609,0.002674701,0.069249295],"genre_scores_gemma":[0.99875784,0.0000045947513,0.0006065762,0.0001306177,0.00010964754,0.00008872561,0.00000771537,0.00006626275,0.00022802995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986044,0.00014405824,0.00042287956,0.00025485526,0.00024028377,0.00033349564],"domain_scores_gemma":[0.9991133,0.00022355201,0.000060722,0.00034076144,0.000028336433,0.00023331285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050819095,0.00027116117,0.00032941572,0.00010883511,0.00021721756,0.000046771784,0.00026222222,0.00008228723,0.0004278122],"category_scores_gemma":[0.00012139641,0.00018310215,0.00024086091,0.000543563,0.000107550186,0.00005943821,0.000052939726,0.00020882858,0.00064539444],"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.00006460304,0.00016394196,0.00007804,0.0010857037,0.00021127427,0.000018570308,0.011866751,0.021249453,0.02511292,0.9314898,0.0031799574,0.0054789446],"study_design_scores_gemma":[0.0021494562,0.0002086725,0.00038721075,0.0010190888,0.0004083276,0.000100100646,0.03809432,0.21977279,0.009347552,0.7186955,0.0074686734,0.002348288],"about_ca_topic_score_codex":1.6386446e-7,"about_ca_topic_score_gemma":1.3794029e-7,"teacher_disagreement_score":0.44652787,"about_ca_system_score_codex":0.000011999762,"about_ca_system_score_gemma":0.0000064798937,"threshold_uncertainty_score":0.82954556},"labels":[],"label_agreement":null},{"id":"W3089570406","doi":"10.55016/ojs/cdm.v20i2.74490","title":"Orthogonal colourings of tensor graphs","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.004453893162943379,"score_gpt":0.24175436573638104,"score_spread":0.23730047257343767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089570406","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.77331537,0.00047155653,0.19120015,0.00028818933,0.0005113525,0.0008420785,0.00073982956,0.0004295446,0.032201946],"genre_scores_gemma":[0.99798566,0.000007506194,0.0014006281,0.000026137384,0.00001298639,0.0000705291,0.000012546158,0.000012519817,0.00047148374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991749,0.000020082864,0.00038029067,0.000100176214,0.00010732118,0.00021724544],"domain_scores_gemma":[0.99931943,0.00012928875,0.000039417606,0.0002955366,0.00014524756,0.00007107884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023833184,0.00013157059,0.0002856577,0.0001889058,0.000079612946,0.000020408346,0.00018202861,0.00007339693,0.00003180802],"category_scores_gemma":[0.0001805133,0.000121301826,0.00012329257,0.0005228649,0.00005471469,0.000042485524,0.000037333524,0.00009179843,0.00003739056],"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.0000059721206,0.000035726665,0.00033138925,0.00029177833,0.000120489036,0.0000013945054,0.0002801829,0.0011083989,0.005444502,0.99021554,0.0020493905,0.00011522074],"study_design_scores_gemma":[0.0028663308,0.00023013976,0.008983219,0.0025864833,0.0006851848,0.000040120125,0.002692601,0.036769684,0.08732378,0.8073341,0.049006864,0.0014814798],"about_ca_topic_score_codex":0.0000012865268,"about_ca_topic_score_gemma":0.0000034540599,"teacher_disagreement_score":0.22467032,"about_ca_system_score_codex":0.000037272617,"about_ca_system_score_gemma":0.000021005311,"threshold_uncertainty_score":0.4946545},"labels":[],"label_agreement":null},{"id":"W3091117907","doi":"10.1016/j.laa.2020.09.038","title":"Weakly Hadamard diagonalizable graphs","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Hadamard matrix; Complex Hadamard matrix; Hadamard transform; Hadamard's inequality; Mathematics; Diagonalizable matrix; Hadamard's maximal determinant problem; Hadamard three-lines theorem; Hadamard product; Combinatorics; Matrix (chemical analysis); Hadamard three-circle theorem; Discrete mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Mathematical analysis; Physics; Chemistry","score_opus":0.010937332364898024,"score_gpt":0.19737203540061013,"score_spread":0.1864347030357121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091117907","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.768162,0.025324116,0.10938392,0.0050476403,0.00050739583,0.0031558452,0.00037269745,0.0039624246,0.08408394],"genre_scores_gemma":[0.99871355,0.00026003513,0.00017442417,0.00030881105,0.00014883958,0.00017848989,0.000025177585,0.00002336309,0.00016731686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994982,0.000010872785,0.00014237677,0.00014905958,0.00006533359,0.00013413971],"domain_scores_gemma":[0.9996723,0.000030283074,0.0000151151835,0.00012034342,0.000020669871,0.00014131387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004154989,0.00010093055,0.00011362722,0.000027239916,0.00009416325,0.000024064717,0.00010397776,0.000051127387,0.00007783661],"category_scores_gemma":[0.0000062095683,0.000099045385,0.000040047686,0.0002578681,0.000020128464,0.00007404795,0.000018038667,0.00009106542,0.00023176704],"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.000009388567,0.000031000913,0.0003090773,0.0003105374,0.000090081856,0.0000015762862,0.00067127973,0.0010431004,0.017733673,0.969741,0.007008443,0.0030508784],"study_design_scores_gemma":[0.00035014912,0.000059450354,0.00059149484,0.000020063411,0.0000663685,0.000009992927,0.0002149598,0.055705115,0.009830688,0.020786151,0.91190696,0.00045863484],"about_ca_topic_score_codex":0.0000013767617,"about_ca_topic_score_gemma":0.0000015078774,"teacher_disagreement_score":0.9489548,"about_ca_system_score_codex":0.0000030779738,"about_ca_system_score_gemma":0.0000048109796,"threshold_uncertainty_score":0.40389538},"labels":[],"label_agreement":null},{"id":"W3091934412","doi":"","title":"Secret sharing schemes and noncommutative polynomial interpolation","year":2018,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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":"University of Manitoba","keywords":"Noncommutative geometry; Interpolation (computer graphics); Polynomial; Mathematics; Polynomial interpolation; Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Linear interpolation; Computer graphics (images); Mathematical analysis","score_opus":0.008442923572161564,"score_gpt":0.19211010333282535,"score_spread":0.1836671797606638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091934412","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.9810037,0.00025068579,0.0005708601,0.0000108371105,0.00052338594,0.00014090844,0.000024424284,0.00011427274,0.017360928],"genre_scores_gemma":[0.99848795,0.000054504068,0.00042273224,0.0000017165489,0.000078438075,3.304915e-7,0.00017702562,0.000027115235,0.00075016817],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9994622,0.0000250939,0.000087622066,0.00018319562,0.00010793741,0.0001339345],"domain_scores_gemma":[0.99959224,0.000024247825,0.00010498023,0.00016710511,0.000060552913,0.00005088137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001019981,0.00017477307,0.00025583163,0.00020698264,0.00012760656,0.000021997334,0.00020647657,0.00021362028,0.000020701349],"category_scores_gemma":[0.0000059669806,0.00024175424,0.00007393616,0.000109263005,0.00006333936,0.00020350625,0.000042527656,0.00019498171,0.000025104257],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0071823183,0.0005311171,0.29252782,0.028979719,0.011108445,0.0004217631,0.27996957,0.0012333203,0.18131003,0.028158097,0.11123944,0.057338353],"study_design_scores_gemma":[0.0034392409,0.000607885,0.25337324,0.0037722487,0.00088681927,0.0000294829,0.6102544,0.07221139,0.010271309,0.0022835727,0.04015241,0.0027180072],"about_ca_topic_score_codex":0.00029409063,"about_ca_topic_score_gemma":0.062265757,"teacher_disagreement_score":0.3302848,"about_ca_system_score_codex":0.000048978723,"about_ca_system_score_gemma":0.000011672216,"threshold_uncertainty_score":0.9858452},"labels":[],"label_agreement":null},{"id":"W309275459","doi":"","title":"Perfect -latin squares.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Biology; Food science","score_opus":0.01037542429947677,"score_gpt":0.1823213698910491,"score_spread":0.17194594559157234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W309275459","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.917574,0.00091244397,0.000010840427,0.000018718143,0.0025256665,0.00009447264,0.0000019466797,0.0004481681,0.078413755],"genre_scores_gemma":[0.99916697,0.00002203569,0.000012156123,0.000016335174,0.000013152985,0.000016811115,0.0000016090216,0.000028624656,0.00072228373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993952,0.000035125828,0.00014064531,0.000110757464,0.00010824182,0.00021002028],"domain_scores_gemma":[0.99961346,0.000045302117,0.0000140925695,0.00024579398,0.0000144594105,0.000066881774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010306337,0.00012001509,0.00013282751,0.00007679168,0.000060700393,0.000026694772,0.0001340777,0.00006776615,0.0004894903],"category_scores_gemma":[0.000013416337,0.00012214326,0.00006199288,0.00024600737,0.000020309684,0.00008021962,0.000012199616,0.0001279069,0.0007642052],"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.0000031197935,0.00006195835,0.0037889024,0.00008468191,0.00006107271,0.000024480325,0.0010842109,0.00057676854,0.0022432122,0.95899695,0.029720303,0.003354313],"study_design_scores_gemma":[0.004122771,0.0004187237,0.009706992,0.00023345536,0.00008373735,0.00006856162,0.0005442948,0.08978439,0.017350182,0.7170059,0.15865278,0.0020282187],"about_ca_topic_score_codex":0.0000032976243,"about_ca_topic_score_gemma":7.617633e-7,"teacher_disagreement_score":0.24199109,"about_ca_system_score_codex":0.000024513745,"about_ca_system_score_gemma":0.000001194634,"threshold_uncertainty_score":0.98225665},"labels":[],"label_agreement":null},{"id":"W3093034456","doi":"10.1016/j.jcta.2022.105611","title":"On the Oberwolfach problem for single-flip 2-factors via graceful labelings","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Automorphism; Vertex (graph theory); Discrete mathematics; Path (computing); Multiplicity (mathematics); Graph; Computer science","score_opus":0.010781057771309437,"score_gpt":0.18796648477639918,"score_spread":0.17718542700508974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093034456","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.9808716,0.00045465288,0.000726199,0.00023637175,0.014179464,0.00051288196,0.000029419314,0.0000981544,0.0028912406],"genre_scores_gemma":[0.9991837,0.000006706608,0.000044104127,0.000058053265,0.000389742,0.000047464633,0.0000028411166,0.000055430664,0.00021193827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982492,0.00037425375,0.0005757257,0.0001099708,0.00040310118,0.00028776884],"domain_scores_gemma":[0.99831104,0.0009324797,0.0003036601,0.0002353076,0.0001328139,0.00008472161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023758188,0.00022365757,0.00036015062,0.00012558437,0.0004732623,0.00007546673,0.0005143992,0.00006628539,0.00021382944],"category_scores_gemma":[0.0001701463,0.00015746304,0.00029917643,0.00026981768,0.000071375376,0.00021148704,0.000053259453,0.0005412343,0.000002511778],"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.0011613187,0.0001398589,0.000026040476,0.000045652854,0.00021841786,0.000009590652,0.0018365433,0.0036626987,0.010726137,0.97951424,0.0023167233,0.00034279175],"study_design_scores_gemma":[0.0009878604,0.001744799,0.00000811656,0.00004079177,0.000056051613,0.00011129577,0.002290325,0.000058813897,0.012384062,0.9187776,0.06331789,0.00022241281],"about_ca_topic_score_codex":0.0000011637125,"about_ca_topic_score_gemma":3.0906529e-7,"teacher_disagreement_score":0.061001163,"about_ca_system_score_codex":0.00013743977,"about_ca_system_score_gemma":0.000031230436,"threshold_uncertainty_score":0.64211565},"labels":[],"label_agreement":null},{"id":"W3097219386","doi":"10.48550/arxiv.2011.01763","title":"A Bipartite Graph That Is Not the $\\gamma$-Graph of a Bipartite Graph","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Manitoba","funders":"","keywords":"Combinatorics; Edge-transitive graph; Mathematics; Bipartite graph; Voltage graph; Line graph; Complete bipartite graph; Simplex graph; Discrete mathematics; Graph power; Graph","score_opus":0.07446300635692651,"score_gpt":0.16873842563232633,"score_spread":0.09427541927539981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097219386","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.9753307,0.0008910616,0.016411927,0.00020201413,0.0013879103,0.0007960417,0.00031013368,0.0006657027,0.0040045166],"genre_scores_gemma":[0.99820316,0.0010081221,0.000027915052,0.00017160886,0.00010502434,0.000008468799,0.000026220247,0.000084075815,0.00036538258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763024,0.00024361999,0.00045542113,0.0008867471,0.00020659587,0.000577377],"domain_scores_gemma":[0.99765766,0.0001599177,0.0003085591,0.0014931483,0.000110140674,0.00027057214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038552392,0.0006440137,0.00077863876,0.0005802576,0.00018231072,0.00007733239,0.0013968867,0.0004606763,0.00013297844],"category_scores_gemma":[0.000019375937,0.00060281134,0.0010100389,0.001650866,0.00039744342,0.00020347875,0.00050380634,0.0009898172,0.000119931115],"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.00071172917,0.00028909257,0.029773949,0.0037313278,0.005839588,0.0007067319,0.008235793,0.6575796,0.010181369,0.2702833,0.012098235,0.00056927744],"study_design_scores_gemma":[0.005509998,0.00056528626,0.018562606,0.003069518,0.0051778434,0.00006374542,0.00589691,0.20673773,0.07370549,0.63434005,0.039090842,0.007279953],"about_ca_topic_score_codex":0.00016047867,"about_ca_topic_score_gemma":0.00008392459,"teacher_disagreement_score":0.45084187,"about_ca_system_score_codex":0.000050676543,"about_ca_system_score_gemma":0.000050038165,"threshold_uncertainty_score":0.9996423},"labels":[],"label_agreement":null},{"id":"W3099726793","doi":"10.29007/91wj","title":"The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices","year":2019,"lang":"en","type":"paratext","venue":"EasyChair preprint","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"DPLL algorithm; Mathematics; Satisfiability; Combinatorics; Solver; Conjecture; Computer science; Discrete mathematics; Mathematical optimization","score_opus":0.017162339290335504,"score_gpt":0.30160680561434317,"score_spread":0.28444446632400766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099726793","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.0003427273,0.0013316518,0.93578404,0.00012307639,0.004038183,0.0052343043,0.00017052612,0.00015683309,0.05281863],"genre_scores_gemma":[0.8760073,0.00038089935,0.011983697,0.00006188781,0.0031394733,0.016546838,0.00023411898,0.00040176834,0.091243975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832004,0.0001281649,0.0003430608,0.00050573144,0.0002749565,0.00042803618],"domain_scores_gemma":[0.9980575,0.00044433872,0.00007741445,0.001133864,0.00014479454,0.00014212861],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000943178,0.00033537854,0.00039688218,0.00009527826,0.00025222942,0.00016206589,0.00074242364,0.00024532076,0.000084154955],"category_scores_gemma":[0.000010732962,0.00024387192,0.00015803067,0.00027590367,0.000035881156,0.000039139155,0.00011817363,0.00041201778,0.008830937],"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.00023548472,0.00008867118,0.000031656167,0.0013329674,0.00054445944,7.485771e-7,0.0012240392,0.85862166,0.00042356955,0.088365525,0.037730597,0.011400614],"study_design_scores_gemma":[0.00049039046,0.00016206369,0.000029618206,0.00018626546,0.000020390207,0.000010074635,0.00043833966,0.004127254,0.0012818652,0.002192338,0.99057585,0.0004855595],"about_ca_topic_score_codex":0.00004451481,"about_ca_topic_score_gemma":0.000021701338,"teacher_disagreement_score":0.9528452,"about_ca_system_score_codex":0.0001009638,"about_ca_system_score_gemma":0.000074265394,"threshold_uncertainty_score":0.99448085},"labels":[],"label_agreement":null},{"id":"W3101372095","doi":"","title":"Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements","year":2007,"lang":"en","type":"article","venue":"CERN Document Server (European Organization for Nuclear Research)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":72,"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","funders":"","keywords":"Orthonormal basis; Mutually unbiased bases; Mathematics; Abelian group; Dimension (graph theory); Prime (order theory); Projective test; Basis (linear algebra); Prime power; State (computer science); Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Hilbert space","score_opus":0.048716292458667466,"score_gpt":0.2702320760458275,"score_spread":0.22151578358716004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101372095","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.99332035,0.000039519306,0.0034186048,0.000037351503,0.00017812557,0.00084697787,0.000040628784,0.0005734927,0.0015449451],"genre_scores_gemma":[0.9980608,0.000012294045,0.000109898676,0.000042849344,0.00008199762,0.0000017259027,0.0010073264,0.00033347204,0.00034961035],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977822,0.00037990615,0.0003889513,0.00035860183,0.00062479486,0.00046558303],"domain_scores_gemma":[0.998949,0.00006677319,0.00007904425,0.00029265633,0.00043128274,0.00018124345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015628707,0.00021277451,0.00016884008,0.00021733591,0.0005190523,0.00033302148,0.0004653387,0.00005821764,0.0017939387],"category_scores_gemma":[0.00007474828,0.0002256799,0.00005706348,0.0005432057,0.00007867096,0.0004973108,0.00014472648,0.00020154596,0.00069665845],"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.0050364933,0.004222306,0.016858632,0.003106854,0.0054227416,0.00049637095,0.07690826,0.01184762,0.55594,0.113379076,0.12910111,0.077680565],"study_design_scores_gemma":[0.02372613,0.003838929,0.10799132,0.0011873215,0.0004979163,0.00012780639,0.011052957,0.0085223485,0.4541124,0.050762802,0.33091706,0.0072630052],"about_ca_topic_score_codex":0.00002546961,"about_ca_topic_score_gemma":0.0000063969046,"teacher_disagreement_score":0.20181593,"about_ca_system_score_codex":0.00033177668,"about_ca_system_score_gemma":0.000009030562,"threshold_uncertainty_score":0.99911857},"labels":[],"label_agreement":null},{"id":"W3101784368","doi":"","title":"CYCLIC (v;r,s; λ) DIFFERENCE FAMILIES WITH TWO BASE BLOCKS AND v ≤ 50","year":2007,"lang":"en","type":"article","venue":"","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; Combinatorics; Base (topology); Mathematical analysis","score_opus":0.004996193610767626,"score_gpt":0.18401193939232882,"score_spread":0.1790157457815612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101784368","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.94698614,0.00021137066,0.01109992,0.0000062114214,0.000074742624,0.00006737729,0.0000013495013,0.00023751466,0.041315354],"genre_scores_gemma":[0.99883777,0.000017025573,0.00031759884,0.000031376796,0.000032555363,0.000004224446,9.1135536e-7,0.000012704571,0.00074585376],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99954396,0.000007672848,0.000098238,0.00010114173,0.00007082453,0.00017815756],"domain_scores_gemma":[0.99972206,0.00005296674,0.000008047133,0.00013567398,0.000008318905,0.000072908224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012496827,0.00010496196,0.000102360296,0.00006417358,0.000038120746,0.000018913443,0.000052781877,0.000029330798,0.00003800262],"category_scores_gemma":[0.0000026863947,0.000074884396,0.000014021768,0.00009632611,0.000041585678,0.000040169256,0.000009320717,0.00007105626,0.0000095118385],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030122223,0.00017633778,0.35676,0.0007114203,0.00046419646,0.00025298633,0.006844252,0.0039140396,0.35580954,0.1628292,0.0012264983,0.11071031],"study_design_scores_gemma":[0.0079105515,0.00080167333,0.56336594,0.00066976016,0.00020786138,0.0007546785,0.017210638,0.020665245,0.3462235,0.014699422,0.02360968,0.0038810296],"about_ca_topic_score_codex":0.00004345668,"about_ca_topic_score_gemma":0.00023193729,"teacher_disagreement_score":0.20660596,"about_ca_system_score_codex":0.0000059106437,"about_ca_system_score_gemma":0.0000017867027,"threshold_uncertainty_score":0.3053697},"labels":[],"label_agreement":null},{"id":"W3103546543","doi":"10.1007/s00530-020-00711-3","title":"An efficient 2D encoding/decoding technique for optical communication system based on permutation vectors theory","year":2020,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Constant-weight code; Decoding methods; Algorithm; Code word; Bit error rate; Systematic code; Permutation (music); Repetition code; Code (set theory); Encoding (memory); Linear code; Electronic engineering; Theoretical computer science; Code rate; Set (abstract data type); Block code; Artificial intelligence; Engineering","score_opus":0.016804962273427256,"score_gpt":0.2348392627314118,"score_spread":0.21803430045798455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103546543","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.09851356,0.00035071129,0.8894138,0.000059518625,0.0017358583,0.0040666605,0.00011362621,0.0020381548,0.003708148],"genre_scores_gemma":[0.9942739,0.0000013877984,0.0040765796,0.000024844283,0.00025086984,0.0011752156,0.000111231704,0.00008073137,0.0000052239934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825656,0.00034134672,0.00051024614,0.0003125183,0.000268681,0.0003106514],"domain_scores_gemma":[0.9983501,0.0007392958,0.00010115284,0.0004959977,0.00009034742,0.0002231188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013373508,0.00026809538,0.00036263396,0.00015556453,0.00019028544,0.00010165746,0.00036349925,0.00020613079,0.000005882966],"category_scores_gemma":[0.00014252838,0.00025516938,0.00012218724,0.00023150595,0.000048085392,0.00009251646,0.000013037951,0.0002197106,0.000044369455],"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.00020713171,0.00010094119,0.00015913644,0.0025324111,0.00007028021,0.000008368767,0.0041302633,0.83683854,0.12530687,0.029058991,0.0001638653,0.001423175],"study_design_scores_gemma":[0.00054681237,0.00015207645,0.00004893092,0.00043170698,0.000031438904,0.000005865355,0.0024943065,0.9797628,0.016025666,0.000013009582,0.00020978022,0.00027760517],"about_ca_topic_score_codex":0.000007599359,"about_ca_topic_score_gemma":7.57573e-7,"teacher_disagreement_score":0.89576036,"about_ca_system_score_codex":0.00020097048,"about_ca_system_score_gemma":0.00002055166,"threshold_uncertainty_score":0.99999005},"labels":[],"label_agreement":null},{"id":"W3104490375","doi":"10.1016/j.dam.2020.09.028","title":"A geometric lower bound on the extension complexity of polytopes based on the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e1733\" altimg=\"si5.svg\"> <mml:mi>f</mml:mi> </mml:math> -vector","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Wetenschappelijk Onderzoek; Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS; European Resuscitation Council; European Research Council; Institut national de la recherche scientifique","keywords":"Polytope; Mathematics; Combinatorics; Extension (predicate logic); Rank (graph theory); Affine transformation; Monotone polygon; Generalization; Polyhedral combinatorics; Upper and lower bounds; Matrix (chemical analysis); Polytope model; Discrete mathematics; Computer science; Geometry; Regular polygon","score_opus":0.02682975593205257,"score_gpt":0.22447548181883936,"score_spread":0.1976457258867868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104490375","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.98692065,0.0000872634,0.005326861,0.00045425797,0.00027030535,0.00024800017,0.00014067897,0.00021044546,0.006341507],"genre_scores_gemma":[0.9976217,0.000023031494,0.0010281929,0.0007154429,0.00019259426,0.00020414684,0.00006426432,0.00013762362,0.0000130079525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977254,0.00005732526,0.00064782036,0.00037969544,0.0007180812,0.0004716413],"domain_scores_gemma":[0.99742204,0.0010175153,0.00034476767,0.0010230043,0.000036250374,0.00015640284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007001785,0.0004008722,0.0003515952,0.00010633846,0.00035254174,0.00016360174,0.0006443008,0.00023899681,0.00007382333],"category_scores_gemma":[0.0002566189,0.00030041518,0.00034770402,0.0005967619,0.00033617966,0.00008601746,0.00016863384,0.0004889502,0.000511398],"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.0001315206,0.00011953405,8.660009e-7,0.00066732295,0.00015177972,0.00001726436,0.0011014469,0.002712287,0.00634195,0.9881603,0.0004945671,0.00010112105],"study_design_scores_gemma":[0.00038454522,0.0002478465,0.000033716155,0.00033648245,0.00015729261,0.000014011026,0.0014210417,0.97329134,0.017777085,0.0052764877,0.0007154864,0.0003446825],"about_ca_topic_score_codex":0.000016604747,"about_ca_topic_score_gemma":0.00000804002,"teacher_disagreement_score":0.9828839,"about_ca_system_score_codex":0.000014588695,"about_ca_system_score_gemma":0.000045025776,"threshold_uncertainty_score":0.9999448},"labels":[],"label_agreement":null},{"id":"W3107806255","doi":"10.1007/s11082-020-02630-z","title":"Techno-economic analysis of two dimensional optical code division multiple access systems","year":2020,"lang":"en","type":"article","venue":"Optical and Quantum Electronics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Spectral efficiency; Transmitter; Electronic engineering; Bandwidth (computing); Transmission (telecommunications); Code division multiple access; Transmission system; Telecommunications; Code (set theory); Software deployment; Computer network; Engineering; Beamforming","score_opus":0.013882439928241586,"score_gpt":0.23919914947559184,"score_spread":0.22531670954735025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107806255","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.9879576,0.0019371945,0.009242759,0.000096466065,0.00011485687,0.0001441191,0.000039126142,0.00014017046,0.0003277347],"genre_scores_gemma":[0.9997095,0.00007779599,0.000087128145,0.00002007391,0.000040009396,0.000012926345,0.00002511482,0.000022065855,0.000005395122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879926,0.000027840942,0.0003967848,0.00026985802,0.00015528937,0.00035097756],"domain_scores_gemma":[0.9993594,0.00020073786,0.000042929663,0.00017802214,0.00002613826,0.00019271353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019014702,0.0001839649,0.00050583726,0.0001150484,0.00005831861,0.000057994228,0.00020219757,0.000111423265,0.000019719255],"category_scores_gemma":[0.000031727493,0.00016107327,0.00013707581,0.00038454268,0.000084678875,0.00011878727,0.00007850407,0.0002405789,0.000013176218],"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.00006298215,0.000046202123,0.0029163605,0.00014995628,0.00080426555,0.0000061185265,0.000051674153,0.6037566,0.024001298,0.36744586,0.000056215064,0.00070249167],"study_design_scores_gemma":[0.00036427935,0.0001342025,0.0006522588,0.000019386105,0.0002926476,0.0000043322652,0.000019825402,0.99273515,0.0045475606,0.00070382905,0.00032977044,0.00019677478],"about_ca_topic_score_codex":0.000020947278,"about_ca_topic_score_gemma":0.00002163786,"teacher_disagreement_score":0.38897854,"about_ca_system_score_codex":0.00004045639,"about_ca_system_score_gemma":0.00002169821,"threshold_uncertainty_score":0.6568377},"labels":[],"label_agreement":null},{"id":"W3114520403","doi":"10.37236/7969","title":"Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"Memorial University of Newfoundland","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Hamiltonian path; Hamiltonian (control theory); Conjecture; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.01752812739628705,"score_gpt":0.14099472856651496,"score_spread":0.12346660117022791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114520403","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.96348953,0.00003183709,0.013993461,0.0000020225511,0.0011901141,0.00023442085,0.000006105105,0.00039024506,0.020662244],"genre_scores_gemma":[0.9981751,0.000013221194,0.000022003258,0.000009817598,0.000107270156,0.0000016893424,0.000004002778,0.000035254176,0.0016316604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908775,0.000054046523,0.00014607901,0.00032386556,0.00005414847,0.00033409748],"domain_scores_gemma":[0.9993197,0.000024759422,0.00005152341,0.00038881524,0.00007918448,0.0001360656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015264994,0.00021093932,0.00021794802,0.0002411248,0.00018050712,0.0000481297,0.00024954238,0.00010472237,0.00003382646],"category_scores_gemma":[0.0000025508969,0.00021258704,0.0000841883,0.00078504,0.000114151335,0.0002901316,0.000027597953,0.00014731247,0.00020924764],"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.0010005346,0.0002867904,0.06487405,0.0006925071,0.0012566254,0.0005700799,0.0026785422,0.6924062,0.013423161,0.21339363,0.00919278,0.0002251188],"study_design_scores_gemma":[0.0043606255,0.0012087083,0.005081723,0.0005414913,0.00029091665,0.00020921476,0.0045071747,0.9569768,0.006419866,0.0044319606,0.014309727,0.0016618127],"about_ca_topic_score_codex":0.00015333187,"about_ca_topic_score_gemma":0.00024088507,"teacher_disagreement_score":0.26457062,"about_ca_system_score_codex":0.00010149264,"about_ca_system_score_gemma":0.000014106019,"threshold_uncertainty_score":0.86690474},"labels":[],"label_agreement":null},{"id":"W3118184077","doi":"10.11575/cdm.vi.62290","title":"A complete solution to the spectrum problem for graphs with six vertices and up to nine edges","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Cograph; 1-planar graph; Indifference graph; Chordal graph; Pathwidth; Metric dimension; Vertex (graph theory); Discrete mathematics; Neighbourhood (mathematics); Clique-sum; Graph; Line graph","score_opus":0.02038946915703298,"score_gpt":0.2462494282127911,"score_spread":0.22585995905575812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118184077","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.08920434,0.00024077196,0.9001954,0.0056578205,0.00026871625,0.0027341351,0.00074718584,0.00024567163,0.0007059199],"genre_scores_gemma":[0.99204975,0.000002316895,0.0069076885,0.00009225428,0.0000777222,0.00058963354,0.000028028617,0.000029673207,0.00022293383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990358,0.0000288317,0.00025699392,0.00016730698,0.00015372783,0.00035737807],"domain_scores_gemma":[0.9990872,0.00012644,0.0000350629,0.00031688914,0.00015007031,0.00028433287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047679222,0.00018383609,0.0002558865,0.00010312151,0.00020635415,0.00011310383,0.00018860406,0.000042711745,0.0000043918176],"category_scores_gemma":[0.0001647716,0.0001229724,0.000046629844,0.00037819234,0.00003816852,0.00008285907,0.00005399857,0.000070471695,0.00005334447],"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.00025928864,0.00007952229,0.00016118417,0.00066765735,0.0004351149,0.0000028782995,0.02276992,0.023898834,0.0076456154,0.8975325,0.04581174,0.0007357427],"study_design_scores_gemma":[0.0068858806,0.0041223615,0.0009636285,0.002299945,0.0011346457,0.000216178,0.016881047,0.1863515,0.013115458,0.3395561,0.42537686,0.0030963875],"about_ca_topic_score_codex":0.000009269601,"about_ca_topic_score_gemma":0.00016451314,"teacher_disagreement_score":0.9028454,"about_ca_system_score_codex":0.00006186308,"about_ca_system_score_gemma":0.000018223036,"threshold_uncertainty_score":0.50146693},"labels":[],"label_agreement":null},{"id":"W3118725835","doi":"10.3390/app11020783","title":"Optical Code Construction of 2D Spectral/Spatial BIBD Codes for SAC-OCDMA Systems","year":2021,"lang":"en","type":"article","venue":"Applied Sciences","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Electronic engineering; Diagonal; Code (set theory); Bandwidth (computing); Code division multiple access; Algorithm; Telecommunications; Mathematics; Engineering","score_opus":0.013413751347609734,"score_gpt":0.22107445195168748,"score_spread":0.20766070060407776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118725835","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.87266755,0.00067979563,0.098955244,0.000049709368,0.002370794,0.0003946875,0.000100504985,0.00020182798,0.024579886],"genre_scores_gemma":[0.9963204,0.000013311892,0.0034519138,0.0000047037192,0.00012784255,0.00004634589,0.000003871545,0.00000839918,0.000023194087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910426,0.000018865348,0.00025300958,0.00020636481,0.00019833523,0.00021915042],"domain_scores_gemma":[0.9995284,0.00020371222,0.000043185664,0.00013103565,0.000042562508,0.000051100298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040883495,0.00010034514,0.00021728447,0.00007682355,0.00012959653,0.000051879015,0.00015223357,0.0000632185,0.000018976287],"category_scores_gemma":[0.000027923954,0.000090191286,0.00005244223,0.00036912155,0.0003907556,0.000070118425,0.000013403018,0.000055161854,0.000007847233],"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.00001180815,0.000016532387,0.00026545944,0.00022968087,0.000030033189,0.0000014471927,0.00023098217,0.012419593,0.19037609,0.79442686,0.00020198329,0.00178953],"study_design_scores_gemma":[0.0007298736,0.00015802936,0.00053548435,0.00015575906,0.00007255279,0.000114796516,0.008844317,0.066607065,0.88678193,0.0308135,0.00461989,0.0005667791],"about_ca_topic_score_codex":0.0000111987765,"about_ca_topic_score_gemma":0.000026393143,"teacher_disagreement_score":0.76361334,"about_ca_system_score_codex":0.00001354777,"about_ca_system_score_gemma":0.000038000144,"threshold_uncertainty_score":0.3677894},"labels":[],"label_agreement":null},{"id":"W3118754754","doi":"","title":"On some new Steiner 2-designs S(2, 5, 45)","year":2019,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner tree problem; Arithmetic; Combinatorics","score_opus":0.015088643819815504,"score_gpt":0.21160597189090913,"score_spread":0.19651732807109362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118754754","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.8003413,0.00050356507,0.0025001864,0.00009252121,0.00083911774,0.00063869136,0.000011430763,0.0008213918,0.19425179],"genre_scores_gemma":[0.99195945,0.0000036870283,0.0004592389,0.00006760383,0.000059244376,0.000015764163,0.0000029915702,0.000048713904,0.0073833256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990737,0.000032268552,0.0002526991,0.00017159969,0.00019049042,0.0002792704],"domain_scores_gemma":[0.9990797,0.00020721188,0.000024263763,0.00055487856,0.000010445746,0.00012348653],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022480378,0.00019062568,0.00026602467,0.00008550664,0.00002684695,0.000028678769,0.00019906613,0.000086254295,0.0018950611],"category_scores_gemma":[0.000033052544,0.00015856804,0.00010530893,0.0001140655,0.00001814714,0.000117112395,0.000017257049,0.00013425428,0.0083237905],"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.000012268264,0.000050882274,0.000015357175,0.00042167632,0.00007432107,0.000003907763,0.00083111,0.00060535205,0.0040489538,0.9755818,0.017701011,0.000653352],"study_design_scores_gemma":[0.00084567035,0.00021324735,0.00012491098,0.0004415008,0.000041180625,0.00001803879,0.00047312165,0.014582111,0.0056222803,0.9653702,0.011703077,0.00056465965],"about_ca_topic_score_codex":0.0000017860838,"about_ca_topic_score_gemma":3.750245e-7,"teacher_disagreement_score":0.19161813,"about_ca_system_score_codex":0.000025794043,"about_ca_system_score_gemma":0.000010646042,"threshold_uncertainty_score":0.99901736},"labels":[],"label_agreement":null},{"id":"W3118821818","doi":"10.1007/s10801-020-01001-x","title":"On resolvable Golomb rulers, symmetric configurations and progressive dinner parties","year":2021,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","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 Waterloo","funders":"","keywords":"Golomb coding; Mathematics; Combinatorics; Block (permutation group theory); Ruler; Distortion (music); Computer science; Telecommunications; Physics","score_opus":0.030129331663910682,"score_gpt":0.2639609884781102,"score_spread":0.23383165681419954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118821818","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.9818056,0.0059633693,0.00008897893,0.00047532006,0.0001747561,0.000471812,0.00013118758,0.00013415865,0.010754815],"genre_scores_gemma":[0.99666095,0.00030560707,0.00014657812,0.0000054851557,0.000042202246,0.0000033875826,0.00008134175,0.000017651262,0.0027368215],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982975,0.0002784025,0.00015534816,0.00039181465,0.0004404313,0.0004364859],"domain_scores_gemma":[0.9985858,0.00025028732,0.000041708267,0.00051611406,0.00045082025,0.00015525025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716095,0.00014335125,0.0002538925,0.0004952578,0.00038348796,0.000052558218,0.0002655627,0.00008766467,0.00015812342],"category_scores_gemma":[0.00036241414,0.00015617345,0.000059282942,0.0012366078,0.0005032806,0.00027296305,0.00013072128,0.00040095288,0.00006627805],"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.0010820578,0.0018484656,0.0067914687,0.0047011534,0.0022807699,0.0030320399,0.037006974,0.0072531737,0.22114831,0.28518087,0.39514506,0.034529667],"study_design_scores_gemma":[0.006270797,0.0020924269,0.03967692,0.0016460051,0.00022107502,0.00039852958,0.0532176,0.0040537557,0.24370241,0.02273557,0.6233743,0.0026106525],"about_ca_topic_score_codex":0.00010354957,"about_ca_topic_score_gemma":0.000039818282,"teacher_disagreement_score":0.2624453,"about_ca_system_score_codex":0.00008234895,"about_ca_system_score_gemma":0.00009544089,"threshold_uncertainty_score":0.63685685},"labels":[],"label_agreement":null},{"id":"W3118825047","doi":"10.1002/jgt.22821","title":"Covering hypergraphs are Eulerian","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Eulerian path; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Context (archaeology); Euler's formula; Rank (graph theory); Discrete mathematics; Lagrangian; Computer science; Pure mathematics","score_opus":0.004984631025252905,"score_gpt":0.1670494334548476,"score_spread":0.1620648024295947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118825047","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.983944,0.004292767,0.0015116644,0.000036904956,0.0030368469,0.000077825396,0.000018904408,0.00009959568,0.006981494],"genre_scores_gemma":[0.999461,0.00008249774,0.00005655269,0.00007770838,0.000155478,0.000007516712,7.816483e-7,0.000038119222,0.00012036638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987002,0.00026498575,0.0004249752,0.0000825886,0.0003055325,0.00022173666],"domain_scores_gemma":[0.9993414,0.00010243866,0.00021037692,0.00019671005,0.00004394676,0.000105104526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014263474,0.00014701336,0.00029125705,0.00043290184,0.0002072432,0.000028512135,0.00037233206,0.000036812373,0.00038683604],"category_scores_gemma":[0.000023008935,0.00013910585,0.00032381486,0.0004367883,0.00004833348,0.00016444655,0.00004342905,0.00047002034,0.0000064825317],"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.0013976182,0.00045365916,0.01628832,0.0005098569,0.0025759642,0.0015816326,0.00672715,0.24294437,0.10278281,0.58630437,0.022904139,0.01553009],"study_design_scores_gemma":[0.0034054639,0.0009560627,0.01246523,0.00032197626,0.00030229584,0.00471474,0.023146506,0.0006156348,0.0076328805,0.76953185,0.17548633,0.0014210428],"about_ca_topic_score_codex":6.8143396e-7,"about_ca_topic_score_gemma":7.320953e-7,"teacher_disagreement_score":0.24232875,"about_ca_system_score_codex":0.000046497506,"about_ca_system_score_gemma":0.000013922936,"threshold_uncertainty_score":0.5672572},"labels":[],"label_agreement":null},{"id":"W3123329527","doi":"10.13001/1081-3810.3616","title":"Correlation Matrices with the Perron Frobenius Property","year":2018,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Matrix (chemical analysis); Correlation; Property (philosophy); Covariance matrix; Random matrix; Pure mathematics; Positive-definite matrix; Applied mathematics; Statistics","score_opus":0.0038440464567341044,"score_gpt":0.1836140637354046,"score_spread":0.17977001727867048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123329527","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.96533316,0.00426404,0.027086765,0.00030165978,0.00039289612,0.00013918964,7.01174e-7,0.00006141069,0.0024201476],"genre_scores_gemma":[0.9986608,0.000095955824,0.000075418415,0.00002940454,0.0007170992,0.0000017417184,6.072256e-7,0.000023430995,0.00039552661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991839,0.00005800524,0.00022250626,0.00006103469,0.000191676,0.00028289005],"domain_scores_gemma":[0.99957293,0.000034809,0.000116870884,0.00012398024,0.00011246641,0.000038954546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005108415,0.00010731197,0.0001413127,0.00006626533,0.000110170215,0.000027592363,0.00020103088,0.000046699763,0.00007090086],"category_scores_gemma":[0.000009631304,0.00004881004,0.00006167958,0.00020618323,0.00005519355,0.00016983523,0.0000067939304,0.00039685905,0.00005001151],"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.0074724983,0.0010062191,0.01890034,0.0010290394,0.0101457825,0.00028228675,0.057840213,0.21357337,0.11265844,0.3217539,0.112583995,0.14275393],"study_design_scores_gemma":[0.007995327,0.014972832,0.00611132,0.00096560235,0.0011942032,0.007394981,0.0063199247,0.2506712,0.05135664,0.023598133,0.6271623,0.0022575413],"about_ca_topic_score_codex":0.000004075191,"about_ca_topic_score_gemma":0.000030339654,"teacher_disagreement_score":0.5145783,"about_ca_system_score_codex":0.00006268332,"about_ca_system_score_gemma":0.000073396004,"threshold_uncertainty_score":0.19904156},"labels":[],"label_agreement":null},{"id":"W3130171556","doi":"10.37236/8219","title":"Cycle Decompositions of Complete Digraphs","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Directed graph; BETA (programming language); Graph; Decomposition; Complete graph; Alpha (finance); Discrete mathematics; Computer science; Statistics","score_opus":0.004021153063682866,"score_gpt":0.18460727969830887,"score_spread":0.180586126634626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130171556","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.9682151,0.014288132,0.01263648,0.00019524724,0.00081833464,0.000056056346,0.0000037194984,0.000029641067,0.0037572577],"genre_scores_gemma":[0.9992725,0.0006145667,0.000008269099,0.000016222819,0.000037810696,0.000001024399,0.0000010921166,0.000014473411,0.000034019165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990542,0.00010267961,0.0003534967,0.000042069034,0.00018903866,0.00025853325],"domain_scores_gemma":[0.9993793,0.00013378292,0.00012591622,0.00019214138,0.00012572414,0.00004316546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041378464,0.00008825996,0.00022420974,0.00006919814,0.000068468544,0.000014266481,0.0002579432,0.000035922647,0.00001457349],"category_scores_gemma":[0.000015311789,0.000068156136,0.00017074701,0.00041245538,0.00003817291,0.00007203485,0.000014626324,0.00037609087,0.0000033342824],"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.000012076428,0.00007440092,0.000115188304,0.00002895981,0.0002478956,0.000011381239,0.00024768375,0.003002581,0.015497087,0.98015213,0.0004373509,0.0001732513],"study_design_scores_gemma":[0.0007071706,0.0002099571,0.00041459143,0.000059293132,0.00010738205,0.0006700225,0.00028226292,0.0007616206,0.027246473,0.95864636,0.0107567245,0.00013812631],"about_ca_topic_score_codex":0.0000010775875,"about_ca_topic_score_gemma":0.0000030640033,"teacher_disagreement_score":0.03105739,"about_ca_system_score_codex":0.00006492099,"about_ca_system_score_gemma":0.00008411839,"threshold_uncertainty_score":0.27793264},"labels":[],"label_agreement":null},{"id":"W3133661775","doi":"","title":"Equitably 2-colourable even cycle systems","year":2021,"lang":"en","type":"article","venue":"Iris (Roma Tre University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Biology; Computer science","score_opus":0.005910000495180537,"score_gpt":0.14975014060297048,"score_spread":0.14384014010778995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133661775","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.7718765,0.0009431211,0.0009394347,0.00004143217,0.0010317476,0.00011854512,0.000033764427,0.0005055114,0.22450992],"genre_scores_gemma":[0.9772882,0.000039302435,0.000059438255,0.000008622866,0.000047212452,8.4721376e-7,0.000011808254,0.000023372126,0.022521226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916303,0.00009152266,0.000121663616,0.0001996062,0.00012155801,0.00030264707],"domain_scores_gemma":[0.9994477,0.000048336686,0.00002668498,0.00030102537,0.00006133958,0.00011492247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008169756,0.00014535112,0.00021242931,0.00015671378,0.000128049,0.000047344478,0.00020687461,0.00011438603,0.00015528733],"category_scores_gemma":[0.000009400029,0.0001740157,0.00010312476,0.00057012105,0.000027652655,0.00020399831,0.00004972421,0.00012941954,0.0002380977],"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.00014986213,0.00042662644,0.010016406,0.0016462415,0.0018031918,0.013688769,0.0036933958,0.18420205,0.12406245,0.5651201,0.08986701,0.005323928],"study_design_scores_gemma":[0.0020897065,0.00010895615,0.0025103283,0.00034804855,0.00021093707,0.00030024213,0.010806755,0.016357932,0.0067577264,0.001560356,0.9577993,0.0011496956],"about_ca_topic_score_codex":0.00005956982,"about_ca_topic_score_gemma":0.00003693613,"teacher_disagreement_score":0.8679323,"about_ca_system_score_codex":0.00011446865,"about_ca_system_score_gemma":0.00003068875,"threshold_uncertainty_score":0.7096154},"labels":[],"label_agreement":null},{"id":"W3134598310","doi":"10.1007/s00493-021-4774-4","title":"A Family of Balanced Generalized Weighing Matrices","year":2022,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Class (philosophy); Matrix (chemical analysis); Association scheme; Scheme (mathematics); Integer matrix; Mathematical analysis; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.006785211765883642,"score_gpt":0.18435956513308321,"score_spread":0.17757435336719957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134598310","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.9810885,0.0037664848,0.00021662722,0.000010256999,0.0017601828,0.00010814892,0.000010722927,0.00023784384,0.012801222],"genre_scores_gemma":[0.999652,0.000046358226,0.000058183385,0.000016255488,0.00001872596,0.000056615532,0.000004038581,0.00001965049,0.00012813597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933916,0.000065647626,0.00018667022,0.0000937401,0.00016694149,0.00014785022],"domain_scores_gemma":[0.999679,0.00003597631,0.00004128487,0.00019341566,0.000015136999,0.00003516538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016318337,0.00008619688,0.00018236758,0.00008721068,0.00009851667,0.000008084783,0.00022377077,0.000021819445,0.00008189309],"category_scores_gemma":[0.0000046126615,0.00009248284,0.0000668033,0.00040364914,0.000011039864,0.000042586955,0.0000561746,0.0001172922,0.0000077244695],"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.000066483706,0.0002312879,0.00426828,0.00044008455,0.00024631762,0.000044254637,0.0019373611,0.019200912,0.14345908,0.803598,0.02409657,0.0024114],"study_design_scores_gemma":[0.008742209,0.00086189073,0.0111229895,0.00014638541,0.00018778254,0.000067058616,0.0035017745,0.055486288,0.038923822,0.2253503,0.65324455,0.0023649593],"about_ca_topic_score_codex":0.000013153048,"about_ca_topic_score_gemma":8.006883e-8,"teacher_disagreement_score":0.62914795,"about_ca_system_score_codex":0.00004844488,"about_ca_system_score_gemma":0.0000073065703,"threshold_uncertainty_score":0.37713405},"labels":[],"label_agreement":null},{"id":"W3135767204","doi":"10.31799/1684-8853-2021-1-2-7","title":"Three new lengths for cyclic Legendre pairs","year":2021,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Legendre polynomials; Mathematics; Circulant matrix; Combinatorics; Hadamard transform; Mathematical analysis","score_opus":0.006628157526751887,"score_gpt":0.17936101659321846,"score_spread":0.17273285906646657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135767204","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.040967897,0.008746282,0.91460186,0.0003116877,0.0040294556,0.0014940667,0.00015670765,0.00077412516,0.028917897],"genre_scores_gemma":[0.99937046,0.000025774683,0.000024496649,0.00009652986,0.00018515407,0.000088762674,0.000030574665,0.000009435597,0.00016880056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931157,0.000016562719,0.0003530146,0.000060376737,0.00009501069,0.0001634956],"domain_scores_gemma":[0.99959296,0.00006071068,0.000051367482,0.00014091194,0.0000623177,0.00009173967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018570918,0.0001099749,0.00019316065,0.00005324004,0.0000733561,0.00015520077,0.000056343357,0.00008304054,0.000012068189],"category_scores_gemma":[0.000021204422,0.000103740436,0.00006367132,0.00007936407,0.000008511789,0.00049888453,0.000005052282,0.000055934845,0.000052371328],"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.00020340845,0.000037073947,0.0027780181,0.004411392,0.0011096507,0.000011445284,0.006698112,0.07612282,0.0065734386,0.65840596,0.070203125,0.17344557],"study_design_scores_gemma":[0.0039963597,0.000047897942,0.0007710383,0.00013181203,0.000048376078,0.00010640258,0.0025597762,0.2788771,0.00048048873,0.0012068256,0.7113963,0.00037761286],"about_ca_topic_score_codex":0.000028884126,"about_ca_topic_score_gemma":0.000029586492,"teacher_disagreement_score":0.9584026,"about_ca_system_score_codex":0.000016598024,"about_ca_system_score_gemma":0.00002440163,"threshold_uncertainty_score":0.42304122},"labels":[],"label_agreement":null},{"id":"W3144027832","doi":"","title":"Graph designs for nine graphs with six vertices and nine edges.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.01691304859091494,"score_gpt":0.1984579077484705,"score_spread":0.18154485915755555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144027832","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.9953099,0.001484064,0.0003313902,0.000018152197,0.0008953874,0.00032126784,0.000009286948,0.00026517737,0.0013653701],"genre_scores_gemma":[0.99934196,0.000110050634,0.00022458096,0.000019655263,0.000010625831,0.000085578235,0.000012212877,0.000042752123,0.00015260333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922484,0.00002643115,0.00017195131,0.0001864859,0.00011469552,0.00027561266],"domain_scores_gemma":[0.9994895,0.000112691174,0.00003092013,0.00021331271,0.000042580774,0.00011103637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013657926,0.00019216226,0.00023436053,0.00010683488,0.00016724282,0.000021229795,0.00012237491,0.00007561475,0.000016841524],"category_scores_gemma":[0.000011950482,0.0001663537,0.00004393582,0.00025049644,0.00010777847,0.00015248709,0.000012323322,0.00009791939,0.0000064086066],"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.0002834067,0.00018982864,0.036438733,0.0004964582,0.0005546549,0.000072223746,0.0017830466,0.0007132246,0.010936737,0.9275104,0.019989545,0.0010317704],"study_design_scores_gemma":[0.021314597,0.004130811,0.050938316,0.0005500392,0.0005796961,0.0007358905,0.0010584551,0.0051958016,0.06672047,0.79489166,0.05009917,0.003785099],"about_ca_topic_score_codex":0.000011297616,"about_ca_topic_score_gemma":0.000006257385,"teacher_disagreement_score":0.13261871,"about_ca_system_score_codex":0.000010773294,"about_ca_system_score_gemma":0.000009545079,"threshold_uncertainty_score":0.67837065},"labels":[],"label_agreement":null},{"id":"W3151759838","doi":"10.1007/s00454-002-0793-0","title":"A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transversal (combinatorics); Disjoint sets; Combinatorics; Mathematics; Unit (ring theory); Line (geometry); Order (exchange); Type (biology); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.01665846638318672,"score_gpt":0.24972540014439143,"score_spread":0.23306693376120471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151759838","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.4046828,0.00035733407,0.58764297,0.00009164475,0.00076981,0.00057733955,0.00016574332,0.00023844017,0.005473933],"genre_scores_gemma":[0.99462867,0.000004170119,0.0046019345,0.00016421721,0.000084740066,0.000040390336,0.00014234666,0.000046015368,0.00028754133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890697,0.000056447698,0.00030125913,0.0002219758,0.00021316615,0.00030020077],"domain_scores_gemma":[0.9992546,0.00028403627,0.000028621078,0.00015856574,0.00011549483,0.00015869417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036846008,0.00020231717,0.0002375481,0.00023670141,0.00009222496,0.000049055725,0.00015189005,0.00007224401,0.0001861961],"category_scores_gemma":[0.00007914964,0.00019513557,0.00013725179,0.0007128295,0.000030482297,0.000089369656,0.000009574639,0.00009910642,0.00011671606],"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.00005828238,0.00003063323,0.00021142149,0.00012514346,0.00013561561,0.0000032262863,0.00044990092,0.753329,0.0011316069,0.24284643,0.00058954454,0.0010892379],"study_design_scores_gemma":[0.0059096375,0.0015650105,0.012982973,0.0005471093,0.00029066647,0.00011862024,0.0032161532,0.2508648,0.020220006,0.5081375,0.19267567,0.0034718518],"about_ca_topic_score_codex":0.0000019454037,"about_ca_topic_score_gemma":0.0000020755501,"teacher_disagreement_score":0.58994585,"about_ca_system_score_codex":0.000027613525,"about_ca_system_score_gemma":0.000023858165,"threshold_uncertainty_score":0.7957397},"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":"W3158233228","doi":"10.1016/j.disc.2021.112413","title":"A new infinite class of ideal minimally non-packing clutters","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Directorate for Education and Human Resources; National Science Foundation","keywords":"Ideal (ethics); Mathematics; Conjecture; Class (philosophy); Combinatorics; Rank (graph theory); Computer science; Artificial intelligence","score_opus":0.009566289660287362,"score_gpt":0.21686219637917176,"score_spread":0.2072959067188844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158233228","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.8208188,0.0004600016,0.109927535,0.0001034336,0.00058331375,0.0002300625,0.000035406625,0.00023448752,0.067606956],"genre_scores_gemma":[0.98367447,0.000016527743,0.015759554,0.000037136113,0.00007053625,0.0000059536164,0.000010928611,0.00004525371,0.00037963572],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904686,0.000020471483,0.00041415961,0.00011653396,0.00018386824,0.0002181332],"domain_scores_gemma":[0.9993522,0.000104879015,0.0000763871,0.0003378854,0.00003939084,0.00008922205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015681813,0.00016197927,0.00031535057,0.00006478999,0.000027426495,0.000035866196,0.00015543125,0.00007768652,0.00008695867],"category_scores_gemma":[0.000040250903,0.00015711559,0.00013897459,0.00023406315,0.000025332225,0.00007636886,0.000041928695,0.0001145038,0.00004116273],"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.00005476791,0.00019877363,0.002295271,0.01273721,0.0016646296,0.00033233222,0.06581891,0.017972898,0.4469789,0.42601925,0.01738593,0.008541129],"study_design_scores_gemma":[0.005034198,0.00034287493,0.0030963935,0.006644249,0.0007802206,0.00047332214,0.031450655,0.2998993,0.42493412,0.20128417,0.022422766,0.0036377073],"about_ca_topic_score_codex":0.0000041777016,"about_ca_topic_score_gemma":0.0000097198235,"teacher_disagreement_score":0.28192642,"about_ca_system_score_codex":0.000015966516,"about_ca_system_score_gemma":0.000032805296,"threshold_uncertainty_score":0.6406988},"labels":[],"label_agreement":null},{"id":"W3158357550","doi":"","title":"Steiner 2-designs S(2, 5, 41) with automorphisms of order 3","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Order (exchange); Combinatorics; Pure mathematics; Discrete mathematics; Business","score_opus":0.014541364336742142,"score_gpt":0.20469761229631767,"score_spread":0.19015624795957553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158357550","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.9746563,0.0009516594,0.010475709,0.000037066613,0.010014102,0.00027287682,0.0000027924705,0.000098062446,0.0034914657],"genre_scores_gemma":[0.9959339,0.000037073547,0.0033593825,0.0000049152204,0.0005978863,0.0000013849294,3.9514345e-7,0.000051908017,0.00001315839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979349,0.000076981036,0.0010262162,0.00012653292,0.0005483797,0.00028700614],"domain_scores_gemma":[0.9981935,0.00036026392,0.000599403,0.00022974968,0.00045826993,0.00015882694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008405921,0.00028682844,0.0008193765,0.00020557562,0.000109848515,0.0000799789,0.00030090663,0.00014480695,0.000032088446],"category_scores_gemma":[0.000092469476,0.0002281604,0.00012563448,0.00043330953,0.000103729566,0.00017820892,0.00004887347,0.0003755065,0.0000031482002],"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.00009575346,0.0007839159,0.00025718447,0.0009855863,0.00057610736,0.000072859664,0.0036371087,0.0025947054,0.004800515,0.98296535,0.0011892621,0.0020416481],"study_design_scores_gemma":[0.02413606,0.0061611165,0.00017371883,0.0034783515,0.0007678988,0.00131125,0.0018847327,0.17719994,0.015058793,0.7633161,0.004703821,0.0018081923],"about_ca_topic_score_codex":0.000002127147,"about_ca_topic_score_gemma":1.4717561e-7,"teacher_disagreement_score":0.21964924,"about_ca_system_score_codex":0.000038452345,"about_ca_system_score_gemma":0.000025034486,"threshold_uncertainty_score":0.9304111},"labels":[],"label_agreement":null},{"id":"W3159230994","doi":"","title":"A lower bound on HMOLS with equal-sized holes","year":2021,"lang":"en","type":"article","venue":"UVic’s Research and Learning Repository (University of Victoria)","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Equipartition theorem; Order (exchange); Orthogonal array; Product (mathematics); Latin square; Matrix (chemical analysis); Finite field; Discrete mathematics; Statistics; Mathematical analysis; Geometry; Physics","score_opus":0.01716833020639061,"score_gpt":0.23229704890250877,"score_spread":0.21512871869611816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159230994","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.9716554,0.00052397704,0.0003472587,0.000038501104,0.00030797202,0.000105574734,0.0000022710353,0.00011638302,0.02690266],"genre_scores_gemma":[0.99248755,0.000079994985,0.00008946268,0.0000022233176,0.0001276307,7.2917794e-7,0.0000053570266,0.000019885227,0.007187165],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847054,0.00037957585,0.00009773629,0.0002664556,0.00046471026,0.00032096478],"domain_scores_gemma":[0.9989853,0.00030104027,0.000035250756,0.00025878524,0.00025152627,0.00016812795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005074509,0.00012325744,0.0002264586,0.00015204905,0.0006034856,0.00008889525,0.0001613465,0.000113290866,0.0000781602],"category_scores_gemma":[0.00004869928,0.00013393353,0.0000561198,0.00039481054,0.00028931303,0.00014833295,0.00006365309,0.00069492863,0.000027233591],"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.006670871,0.0013468575,0.06000068,0.003423158,0.002824902,0.0117425285,0.041361775,0.02165402,0.7847349,0.045343228,0.011335927,0.009561155],"study_design_scores_gemma":[0.014238717,0.010547629,0.061809387,0.004190047,0.0002502953,0.00074382115,0.08919452,0.010457189,0.056497358,0.0046277684,0.7444022,0.0030410246],"about_ca_topic_score_codex":0.000057858233,"about_ca_topic_score_gemma":0.000029154078,"teacher_disagreement_score":0.7330663,"about_ca_system_score_codex":0.000060945444,"about_ca_system_score_gemma":0.000076920194,"threshold_uncertainty_score":0.5461651},"labels":[],"label_agreement":null},{"id":"W3173236514","doi":"10.1515/ms-2021-0003","title":"Six-cycle systems","year":2021,"lang":"en","type":"article","venue":"Mathematica Slovaca","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":"Enumeration; Mathematics; Discrete mathematics","score_opus":0.00779541663163966,"score_gpt":0.18978597241507533,"score_spread":0.18199055578343568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173236514","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.6109304,0.0055407463,0.013914401,0.000066810826,0.0019394922,0.00033215343,0.000014819481,0.0013120929,0.3659491],"genre_scores_gemma":[0.997636,0.000017657077,0.00042992263,0.000017620454,0.00010273704,0.00004260025,0.0000046842356,0.00003984538,0.0017088918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991684,0.00004319121,0.00027214157,0.00013710273,0.00015600577,0.0002231348],"domain_scores_gemma":[0.9993667,0.000083463485,0.000022968321,0.00041260134,0.00003575059,0.00007851596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001483467,0.00013879623,0.00024647,0.00004366885,0.000050131246,0.0000717743,0.00013786349,0.00007728368,0.00027336218],"category_scores_gemma":[0.00003389038,0.00013053846,0.0000823879,0.00022036566,0.000017930359,0.000073127805,0.000025755182,0.00010488886,0.0009507011],"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.000005671817,0.00017638713,0.0000993307,0.0042008082,0.00039411263,0.0002713897,0.0028742347,0.012159911,0.035843246,0.9200156,0.022432487,0.001526847],"study_design_scores_gemma":[0.002417578,0.000089720284,0.00056290143,0.002471888,0.00032238264,0.0019735193,0.012648925,0.3896106,0.083542004,0.20894703,0.2943043,0.0031091534],"about_ca_topic_score_codex":0.000001075067,"about_ca_topic_score_gemma":9.886919e-7,"teacher_disagreement_score":0.7110686,"about_ca_system_score_codex":0.000021798762,"about_ca_system_score_gemma":0.0000089592195,"threshold_uncertainty_score":0.99982715},"labels":[],"label_agreement":null},{"id":"W3173627995","doi":"10.35708/gc1868-126721","title":"The Leaf Function of Graphs Associated with Penrose Tilings","year":2020,"lang":"en","type":"article","venue":"International Journal of Graph Computing","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":"Université du Québec à Montréal","funders":"","keywords":"Fibonacci number; Combinatorics; Penrose tiling; Substitution tiling; Mathematics; Function (biology); Upper and lower bounds; Computation; Graph; Representation (politics); Euclidean geometry; Discrete mathematics; Geometry; Quasicrystal; Algorithm; Mathematical analysis","score_opus":0.008884711683581311,"score_gpt":0.19965140410357027,"score_spread":0.19076669241998895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173627995","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.98397005,0.0004003967,0.013602414,0.00018923113,0.0011299294,0.000042717656,0.0000028717077,0.0000398292,0.000622588],"genre_scores_gemma":[0.99966776,0.000022696724,0.00007582876,0.000061909035,0.00015220167,2.733464e-7,0.0000015958017,0.000013337435,0.000004411424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894434,0.000050612667,0.00044014433,0.00006019509,0.00039813417,0.00010658232],"domain_scores_gemma":[0.9989264,0.00022241597,0.00034025477,0.00005106555,0.00040593368,0.000053903193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004519038,0.00009099402,0.00015500975,0.00010865201,0.00006674871,0.000048063896,0.0003319057,0.00003296764,0.000005531452],"category_scores_gemma":[0.00009429623,0.00006293596,0.00014279337,0.00024277942,0.000053687876,0.00011195828,0.000019893323,0.00022299105,0.000001248286],"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.0029943837,0.00034606206,0.15449335,0.00021509096,0.013411448,0.0003316787,0.013242117,0.51016533,0.09118871,0.100355126,0.006391509,0.10686523],"study_design_scores_gemma":[0.018967466,0.005929191,0.34379435,0.0062156115,0.0011060615,0.0012527338,0.013816277,0.45041308,0.050037865,0.085048415,0.020755727,0.002663231],"about_ca_topic_score_codex":0.0000016532052,"about_ca_topic_score_gemma":0.0000023210846,"teacher_disagreement_score":0.189301,"about_ca_system_score_codex":0.000018437728,"about_ca_system_score_gemma":0.00001619868,"threshold_uncertainty_score":0.25664538},"labels":[],"label_agreement":null},{"id":"W3174996705","doi":"10.1080/00029890.2022.2043106","title":"Number Cubes with Consecutive Line Sums","year":2022,"lang":"en","type":"article","venue":"American Mathematical Monthly","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; MAGIC (telescope); Block (permutation group theory); Graph; Mathematics; Line (geometry); Computer science; Discrete mathematics; Arithmetic; Physics; Geometry","score_opus":0.00575270722321771,"score_gpt":0.2036463669136727,"score_spread":0.19789365969045497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174996705","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.71462595,0.00007474114,0.003975252,0.0001207696,0.00010991749,0.0003076009,0.00006716671,0.0005338676,0.28018475],"genre_scores_gemma":[0.99800175,0.0000016136065,0.0012639955,0.00011572816,0.000031380423,0.0001917158,0.000007293611,0.000046418238,0.0003401148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990132,0.00008168063,0.00021655268,0.00016234834,0.0002487807,0.00027743677],"domain_scores_gemma":[0.9993624,0.00020254168,0.000045460503,0.00026506506,0.000018859602,0.00010569139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015411284,0.00017045204,0.00032815512,0.000040126368,0.000115872666,0.0000197566,0.00017479504,0.000015237987,0.0008773508],"category_scores_gemma":[0.000018285102,0.00013981816,0.00006560146,0.00034884026,0.00024988942,0.000046439018,0.000046855035,0.00022135786,0.00019665691],"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.00036867798,0.0008429438,0.004628502,0.00052011805,0.0010845861,0.00049027905,0.011948966,0.06823757,0.0016582379,0.8940961,0.013130523,0.002993508],"study_design_scores_gemma":[0.0034974832,0.003568415,0.0031706144,0.00036082228,0.00049463223,0.0011609311,0.070714876,0.26772174,0.003784945,0.57253104,0.06888723,0.004107284],"about_ca_topic_score_codex":0.000027286524,"about_ca_topic_score_gemma":0.0000045535025,"teacher_disagreement_score":0.32156503,"about_ca_system_score_codex":0.000041840995,"about_ca_system_score_gemma":0.00001166156,"threshold_uncertainty_score":0.96063757},"labels":[],"label_agreement":null},{"id":"W3180407997","doi":"10.37394/23209.2021.18.9","title":"Generating Cyclic Permutations: Insights to the Traveling Salesman Problem","year":2021,"lang":"en","type":"article","venue":"WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS","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":"Lockheed Martin (Canada)","funders":"","keywords":"Travelling salesman problem; Combinatorics; Integer (computer science); Diagonal; Line (geometry); Mathematics; Matrix (chemical analysis); Traveling purchaser problem; Bottleneck traveling salesman problem; Prime (order theory); Computer science; Algorithm; Geometry","score_opus":0.008301937107657724,"score_gpt":0.21949010264155094,"score_spread":0.21118816553389322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180407997","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.041031655,0.00007707162,0.9483718,0.00059086556,0.00010643551,0.0005523363,0.000025453868,0.00017884691,0.00906549],"genre_scores_gemma":[0.9970955,0.00005877554,0.0014768273,0.0004895685,0.000036433346,0.00077541696,0.000011641495,0.000005724494,0.000050074257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915045,0.000016633694,0.0002654721,0.00012712395,0.000282294,0.00015803921],"domain_scores_gemma":[0.99932355,0.000045368062,0.000028418905,0.00024660345,0.00024608997,0.000109998145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002709695,0.00009197468,0.00006926424,0.0001658626,0.0012821782,0.00029945967,0.00016306413,0.00003056691,0.000015868509],"category_scores_gemma":[0.000011362373,0.00007513786,0.000028690973,0.0015882355,0.00009451763,0.0010119657,0.0000034963248,0.00012091776,0.0001350076],"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.000002985822,0.000033596043,0.000006807385,0.00006021331,0.00001914406,2.2297704e-7,0.009234101,0.7414145,0.011402227,0.10058436,0.00013589069,0.13710597],"study_design_scores_gemma":[0.00063275156,0.00007730024,0.0012566951,0.00013987196,0.000077199606,0.0001256541,0.023230353,0.40827692,0.046672713,0.006190079,0.5124398,0.00088070054],"about_ca_topic_score_codex":0.0000029006346,"about_ca_topic_score_gemma":0.000020609059,"teacher_disagreement_score":0.95606387,"about_ca_system_score_codex":0.0000452034,"about_ca_system_score_gemma":0.00008742904,"threshold_uncertainty_score":0.9861608},"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":"W3187558414","doi":"","title":"Orthogonal double covers of complete graphs by lobsters of diameter 5","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013690073296563441,"score_gpt":0.20780882290809777,"score_spread":0.19411874961153433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187558414","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.9874318,0.0005988469,0.0019627756,0.0000063001385,0.008747076,0.0001784403,0.00001377009,0.000027657288,0.0010332894],"genre_scores_gemma":[0.9988332,0.000079206584,0.0008414252,0.000004079875,0.00019877544,9.82e-7,0.0000021856004,0.000037304548,0.000002888843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748534,0.00007392635,0.0014413223,0.00012700091,0.0006025809,0.000269823],"domain_scores_gemma":[0.9978765,0.0004960031,0.000919786,0.00021401282,0.00033936076,0.00015432747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008321997,0.00027250184,0.0010231758,0.00022153031,0.000110919515,0.000027031234,0.00034080673,0.0001476518,0.0000070539613],"category_scores_gemma":[0.00006104352,0.00025217593,0.00030065316,0.00032533304,0.00020797005,0.00016688564,0.00007004228,0.00032673983,7.880355e-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.0004148555,0.0007408081,0.0021054072,0.0012787182,0.00079514756,0.000035254296,0.0037589474,0.0011571205,0.03679598,0.95101655,0.0016126165,0.0002886168],"study_design_scores_gemma":[0.041988146,0.0043838103,0.00087013474,0.0029133812,0.0007105736,0.0010793937,0.0022029267,0.0143902525,0.07241137,0.85326433,0.0037361998,0.0020494976],"about_ca_topic_score_codex":0.0000065669697,"about_ca_topic_score_gemma":1.2118755e-7,"teacher_disagreement_score":0.09775221,"about_ca_system_score_codex":0.000033408847,"about_ca_system_score_gemma":0.000047165253,"threshold_uncertainty_score":0.999993},"labels":[],"label_agreement":null},{"id":"W3197010831","doi":"","title":"On the sl2 Weight System and Intersection Graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Intersection (aeronautics); Combinatorics; Mathematics; Computer science; Geography; Cartography","score_opus":0.0038321557643884972,"score_gpt":0.1462792395617529,"score_spread":0.1424470837973644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197010831","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.9144942,0.000054287597,0.0041231834,0.00008139681,0.0007376934,0.000087149354,0.0000014014072,0.00031240963,0.080108255],"genre_scores_gemma":[0.9994159,0.0000062449258,0.0000026276714,0.000016023601,0.00002699141,0.000013146149,8.324271e-8,0.000007750865,0.0005112792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973327,0.000026663456,0.000066695255,0.000060406677,0.00004010093,0.0000728425],"domain_scores_gemma":[0.99977475,0.00008010697,0.0000068944096,0.0001121186,0.0000053230146,0.00002079156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011731026,0.00005730219,0.000049412283,0.000035418914,0.00003726617,0.000011953081,0.00004211126,0.000026528129,0.00005631871],"category_scores_gemma":[0.0000035113376,0.000024178304,0.00002351787,0.000047824036,0.000017033308,0.0000387936,0.000005042256,0.000029232106,0.000083854546],"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.0000050551043,0.000001674399,0.0001586278,0.00002677007,0.000022395838,8.020618e-7,0.00008371505,0.000004936949,0.0057897214,0.99040246,0.0021139593,0.001389896],"study_design_scores_gemma":[0.006455165,0.0013096702,0.020456953,0.0067714658,0.00022934428,0.0008867479,0.01929999,0.028077578,0.42731914,0.370396,0.11507805,0.0037199247],"about_ca_topic_score_codex":0.0000034231925,"about_ca_topic_score_gemma":0.000005162624,"teacher_disagreement_score":0.62000644,"about_ca_system_score_codex":0.000014325823,"about_ca_system_score_gemma":5.3864375e-7,"threshold_uncertainty_score":0.107780844},"labels":[],"label_agreement":null},{"id":"W3197649727","doi":"10.48550/arxiv.2108.12593","title":"Balanced Weighing Matrices","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Prime (order theory); Integer (computer science); Mathematics; Combinatorics; Equivalence (formal languages); Matrix (chemical analysis); Prime power; Discrete mathematics; Computer science; Materials science","score_opus":0.029664775169580555,"score_gpt":0.1455762682767522,"score_spread":0.11591149310717166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197649727","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.9572392,0.0008359743,0.023346877,0.0000045974148,0.0019731575,0.00014618866,0.000018069708,0.0006245101,0.01581143],"genre_scores_gemma":[0.9984461,0.000542304,0.00007565214,0.000012117822,0.00013386628,9.718448e-7,0.000033515214,0.000039477076,0.0007159657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989508,0.000079290854,0.00016276303,0.00047328742,0.000051639567,0.0002822153],"domain_scores_gemma":[0.99912816,0.000051166233,0.00006927105,0.000593491,0.000050293183,0.000107629996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001322991,0.0002804951,0.00033939845,0.00016503477,0.00007806845,0.00008912444,0.00047107937,0.0003016583,0.00014292363],"category_scores_gemma":[0.000007804639,0.0003498793,0.00022486004,0.00036897545,0.00003610449,0.00016238129,0.0002705019,0.000514413,0.000077821926],"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.000014518607,0.000027319655,0.0028524718,0.0007269044,0.00032578773,0.0006646523,0.00038837094,0.96536976,0.0006673729,0.028324172,0.0004252529,0.00021342418],"study_design_scores_gemma":[0.0014073382,0.000043759544,0.0032574735,0.0016852196,0.0005761128,0.000030800828,0.003644515,0.9382638,0.003335939,0.0379872,0.0068107955,0.0029570893],"about_ca_topic_score_codex":0.000041180392,"about_ca_topic_score_gemma":0.000024009913,"teacher_disagreement_score":0.041206934,"about_ca_system_score_codex":0.00010782044,"about_ca_system_score_gemma":0.00003047227,"threshold_uncertainty_score":0.99989533},"labels":[],"label_agreement":null},{"id":"W3198507813","doi":"10.1007/978-3-030-83508-8_36","title":"Uniform Embeddings for Robinson Similarity Matrices","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Embedding; Diagonal; Combinatorics; Adjacency matrix; Similarity (geometry); Mathematics; Matrix (chemical analysis); Interval (graph theory); Row; Discrete mathematics; Graph; Diagonal matrix; Computer science; Artificial intelligence","score_opus":0.010761991444864649,"score_gpt":0.2194520355252555,"score_spread":0.20869004408039085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198507813","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.0005988162,0.0016744781,0.98951226,0.000047055983,0.0022737184,0.00033826122,0.000024250561,0.00019831752,0.0053328644],"genre_scores_gemma":[0.8354136,0.0003653625,0.15960182,0.0007607627,0.0019878182,0.000059258004,0.00006922869,0.00021765544,0.0015244975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984364,0.000007968972,0.00031023743,0.0005399706,0.00029741746,0.00040801326],"domain_scores_gemma":[0.99902254,0.00025906277,0.00007382271,0.000453015,0.000106425956,0.00008511302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004813454,0.0003449526,0.00040080567,0.00035045558,0.0001369317,0.00020960969,0.0006925197,0.00030624875,0.000031440395],"category_scores_gemma":[0.000027942127,0.00033156548,0.00014590858,0.0002773514,0.00017401086,0.00018824606,0.00013297264,0.00042550542,0.000008724347],"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.00001622774,0.000023924738,0.00004970201,0.0012940553,0.00007494726,0.000080831705,0.0013241852,0.63001,0.0011295577,0.07772967,0.0002777538,0.2879891],"study_design_scores_gemma":[0.0003837874,0.000121776735,0.000024383695,0.0011993586,0.00003712227,0.00007985067,0.000001530558,0.7531801,0.007650431,0.20106715,0.03503274,0.0012218034],"about_ca_topic_score_codex":0.0000042432434,"about_ca_topic_score_gemma":0.000043935237,"teacher_disagreement_score":0.8348148,"about_ca_system_score_codex":0.00015066897,"about_ca_system_score_gemma":0.00007670898,"threshold_uncertainty_score":0.99991363},"labels":[],"label_agreement":null},{"id":"W3199856109","doi":"","title":"Decomposition of complete graphs into unicyclic graphs with eight edges","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Decomposition; Discrete mathematics","score_opus":0.011295425392662472,"score_gpt":0.21960433089916828,"score_spread":0.2083089055065058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199856109","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.98554444,0.0006764092,0.008018741,0.00006789202,0.0047715046,0.00023730307,0.0000041011967,0.00007087998,0.00060873764],"genre_scores_gemma":[0.9967736,0.000052573236,0.002682755,0.000016299411,0.0004216857,0.0000014888055,0.0000024037938,0.00004884937,3.5327693e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978048,0.000111446745,0.0011393323,0.00016440653,0.0005156864,0.00026433103],"domain_scores_gemma":[0.99812996,0.00037684565,0.00070114457,0.00018819512,0.0003437653,0.0002601059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063250714,0.00032057436,0.0009375748,0.00021471042,0.00016114746,0.00009295001,0.00038310696,0.0001369557,0.0000049312785],"category_scores_gemma":[0.000059454836,0.00027043244,0.00020695716,0.00054632826,0.00013204501,0.00020514708,0.000076637014,0.00043251,0.0000014423778],"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.0001883616,0.00025401622,0.0003977115,0.0011316506,0.00046430237,0.00003226871,0.0039429516,0.00071163784,0.0121977655,0.97908026,0.00017970568,0.0014193637],"study_design_scores_gemma":[0.0072223786,0.0025793752,0.00018477342,0.0012232414,0.00032366387,0.00018635506,0.001137895,0.022626562,0.012506308,0.95064837,0.00068435847,0.00067670865],"about_ca_topic_score_codex":0.000003916972,"about_ca_topic_score_gemma":3.3045472e-7,"teacher_disagreement_score":0.028431885,"about_ca_system_score_codex":0.000031086453,"about_ca_system_score_gemma":0.00003828813,"threshold_uncertainty_score":0.9999748},"labels":[],"label_agreement":null},{"id":"W3202221775","doi":"","title":"Decomposition of complete graphs into tri-cyclic graphs with eight edges","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Decomposition; Brooks' theorem; 1-planar graph; Modular decomposition; Discrete mathematics; Chordal graph; Pathwidth; Graph; Line graph; Chemistry","score_opus":0.011706885947761347,"score_gpt":0.21951926727166565,"score_spread":0.2078123813239043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202221775","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.986126,0.00071601226,0.006777662,0.00007521695,0.0053958716,0.00026950598,0.000004587883,0.00007445366,0.00056065706],"genre_scores_gemma":[0.99712145,0.000052803593,0.0022537916,0.000016748116,0.00049859006,0.0000018980705,0.00000263619,0.000051682277,3.9851017e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976167,0.00011923277,0.0012459994,0.00017696047,0.0005586286,0.0002824455],"domain_scores_gemma":[0.99799466,0.00042484113,0.0007636501,0.00018998665,0.00035143355,0.0002754292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007007369,0.00034295616,0.0010298705,0.0002356051,0.00017335192,0.00010333781,0.0003849082,0.00014735362,0.000005613525],"category_scores_gemma":[0.00007833786,0.00028843718,0.0002364232,0.0005706655,0.00013005537,0.00021634538,0.00007245077,0.0004546432,0.0000016040282],"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.0003488087,0.00032592606,0.0004691761,0.001523864,0.0005401685,0.0000379255,0.0047997856,0.0007723718,0.017482296,0.9722693,0.00026007812,0.0011702743],"study_design_scores_gemma":[0.008662766,0.0028524406,0.00020970017,0.0012192862,0.00035078512,0.00019097577,0.0011003553,0.012786011,0.015353075,0.95581007,0.0007626375,0.00070190197],"about_ca_topic_score_codex":0.0000038830435,"about_ca_topic_score_gemma":2.9968962e-7,"teacher_disagreement_score":0.01645926,"about_ca_system_score_codex":0.00003308386,"about_ca_system_score_gemma":0.00004023617,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W3204835119","doi":"10.1007/s10623-022-01096-2","title":"On a class of optimal constant weight ternary codes","year":2022,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Combinatorics; Integer (computer science); Mathematics; Order (exchange); Constant (computer programming); Prime (order theory); Prime power; Matrix (chemical analysis); Physics; Chemistry; Computer science","score_opus":0.010407589298477304,"score_gpt":0.19621618130382187,"score_spread":0.18580859200534458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204835119","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.97162384,0.0021648614,0.015779186,0.000018134857,0.00030901105,0.00024244956,0.000205996,0.00018914008,0.009467377],"genre_scores_gemma":[0.9990649,0.00012653104,0.0006151071,0.00004963509,0.000020786343,0.000072752155,0.000011880482,0.000025510686,0.000012895408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904484,0.000111547655,0.00024052436,0.0001819431,0.00019895934,0.00022218167],"domain_scores_gemma":[0.9995309,0.00012630862,0.00004857627,0.00020095876,0.000017513856,0.00007575507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024254806,0.00017556809,0.00026389764,0.00026465557,0.0001721867,0.000021888329,0.0001553614,0.000043709966,0.00015818949],"category_scores_gemma":[0.0000025987501,0.00016676224,0.0001400164,0.00035154846,0.00013338012,0.00004575825,0.000036247242,0.00017819545,0.0000018566283],"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.00043430476,0.0002517745,0.0067676147,0.000283091,0.00057793595,0.00009713864,0.0016056882,0.024488619,0.053660035,0.9030268,0.0057369936,0.0030700096],"study_design_scores_gemma":[0.015329642,0.014052172,0.01164899,0.0012380427,0.0011052467,0.0013244873,0.028003484,0.2283604,0.1164184,0.34442607,0.2301552,0.007937863],"about_ca_topic_score_codex":0.0000075681605,"about_ca_topic_score_gemma":0.0000013900166,"teacher_disagreement_score":0.5586007,"about_ca_system_score_codex":0.000010069598,"about_ca_system_score_gemma":0.000007794087,"threshold_uncertainty_score":0.68003666},"labels":[],"label_agreement":null},{"id":"W3208072245","doi":"10.17582/journal.sja/2022/38.1.11.15","title":"Stability Analysis of Advanced Chilli Lines","year":2021,"lang":"en","type":"article","venue":"Sarhad Journal of Agriculture","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"Alberta Agricultural Research Institute","keywords":"Chemistry","score_opus":0.004623174648390729,"score_gpt":0.18631101131877298,"score_spread":0.18168783667038224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208072245","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.9919428,0.006261167,0.0003180417,0.000043026284,0.0003808613,0.000031640502,0.000025659685,0.000017226363,0.0009795564],"genre_scores_gemma":[0.999213,0.00025219953,0.00034343472,0.00000937878,0.00012027096,6.054878e-7,0.000009430925,0.000005233926,0.00004646075],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910605,0.00006138272,0.00045654422,0.00007345244,0.00019283094,0.00010976958],"domain_scores_gemma":[0.9991946,0.000044827182,0.00016667077,0.00014046993,0.00038615355,0.000067231966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020254763,0.00010716665,0.0004340064,0.000084562496,0.000024013076,0.0000125936485,0.0001215045,0.000076714394,0.00010093927],"category_scores_gemma":[0.00004657298,0.00006711757,0.00039979978,0.0010886642,0.000018012324,0.00011765755,0.00001024882,0.0001917889,0.0000010819276],"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.000046687055,0.00018477062,0.018118303,0.00025264008,0.0040857894,0.00007410052,0.0019769988,0.16017777,0.8097081,0.00078619784,0.0020124274,0.00257619],"study_design_scores_gemma":[0.0013579847,0.00020497869,0.42147937,0.00037380066,0.0034112097,0.00031685352,0.010023443,0.000786408,0.5397004,0.0011415528,0.020563528,0.0006404682],"about_ca_topic_score_codex":9.701585e-7,"about_ca_topic_score_gemma":0.000024835335,"teacher_disagreement_score":0.40336105,"about_ca_system_score_codex":0.00002024803,"about_ca_system_score_gemma":0.000013375502,"threshold_uncertainty_score":0.27369753},"labels":[],"label_agreement":null},{"id":"W3211769238","doi":"10.1109/access.2021.3125912","title":"Adaptive Transceiver Architecture With QoS Provision for OCDMA Network Based on Logic Gates","year":2021,"lang":"en","type":"article","venue":"IEEE Access","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":"Université du Québec à Chicoutimi","funders":"King Khalid University; Taif University","keywords":"Computer science; Transceiver; Computer network; Quality of service; Architecture; Computer architecture; Logic gate; Telecommunications; Wireless","score_opus":0.017280168960804934,"score_gpt":0.23042226483433892,"score_spread":0.213142095873534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211769238","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.32955116,0.00060659926,0.65809643,0.0002518409,0.0019718937,0.0015316267,0.000079446596,0.0005958822,0.007315146],"genre_scores_gemma":[0.99858236,0.0000033372453,0.00061836786,0.00020290776,0.00033939167,0.00012579668,0.000016125596,0.00003786044,0.00007387023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920994,0.000051715477,0.00012551734,0.0002256732,0.00012471556,0.00026244082],"domain_scores_gemma":[0.99949217,0.00015578629,0.000025410718,0.00021859669,0.00005160639,0.00005640396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009560906,0.00017649909,0.00019037328,0.00004367217,0.000084365616,0.000068835056,0.00018827395,0.000081593884,0.00003667127],"category_scores_gemma":[0.0000052907712,0.0001325309,0.00008364604,0.00024589524,0.000025439167,0.0000958828,0.0000040877194,0.0001462701,0.0000060446982],"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.00029181447,0.000031588723,0.00023525127,0.00014150658,0.000051980485,0.00003111312,0.00015588487,0.9930966,0.0012608414,0.0009172062,0.001104923,0.0026813054],"study_design_scores_gemma":[0.008732624,0.0021403355,0.0059370203,0.0031132665,0.00037855844,0.00007669993,0.00050924835,0.62231374,0.28676593,0.04050027,0.02669574,0.002836594],"about_ca_topic_score_codex":0.0000032696016,"about_ca_topic_score_gemma":0.000039162715,"teacher_disagreement_score":0.6690312,"about_ca_system_score_codex":0.00001694691,"about_ca_system_score_gemma":0.000020727026,"threshold_uncertainty_score":0.5404453},"labels":[],"label_agreement":null},{"id":"W3215275878","doi":"10.1109/tg.2021.3131960","title":"Twin <i>Sudoku</i> Puzzles and Triplet Solid <i>Sudoku</i> Cubes From Strongly Mutually Distinct Twin <i>Sudoku</i> Tables","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Games","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 Victoria","funders":"","keywords":"Notation; Mathematics; Combinatorics; Algorithm; Arithmetic","score_opus":0.008521079113951556,"score_gpt":0.20459398219763372,"score_spread":0.19607290308368217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215275878","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.87753445,0.006145806,0.10285671,0.00034748734,0.0035946325,0.0005798601,0.0024028749,0.0013735067,0.0051646475],"genre_scores_gemma":[0.9962175,0.00058583455,0.000574613,0.00022400696,0.0003219316,0.00016177354,0.0000940594,0.00016066167,0.0016596268],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99682045,0.00024134107,0.00081030873,0.00083767815,0.00048445378,0.0008057709],"domain_scores_gemma":[0.9980774,0.0005030777,0.00010147362,0.0008427002,0.00011626924,0.00035907782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002703029,0.0007342094,0.00085339637,0.00022903542,0.00038043034,0.00031502364,0.00037667388,0.00033650023,0.0005336456],"category_scores_gemma":[0.000017507442,0.00075495563,0.00037342642,0.00057453,0.0002358721,0.0005047062,0.00000773113,0.0006881104,0.00012556891],"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.0012164846,0.0027114262,0.0024657096,0.002003771,0.004528539,0.0010789296,0.01184675,0.25144768,0.6014782,0.002940414,0.03780113,0.08048097],"study_design_scores_gemma":[0.005530423,0.00038442443,0.0012611117,0.0009081004,0.0009457982,0.0003481843,0.006403521,0.014613639,0.84892696,0.0028843575,0.11467326,0.0031202526],"about_ca_topic_score_codex":0.00018040775,"about_ca_topic_score_gemma":0.0011909988,"teacher_disagreement_score":0.24744874,"about_ca_system_score_codex":0.00008845538,"about_ca_system_score_gemma":0.000087146705,"threshold_uncertainty_score":0.99949014},"labels":[],"label_agreement":null},{"id":"W3225683","doi":"10.1111/j.1552-6909.1988.tb00454.x","title":"Sp-Sets with Multiplier p.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiplier (economics); Mathematics; Arithmetic; Economics; Keynesian economics","score_opus":0.00623970409345416,"score_gpt":0.1896039206715281,"score_spread":0.18336421657807395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3225683","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.9684636,0.00020778099,0.000044352706,0.000014337901,0.001271971,0.000110931316,0.0000013682054,0.0003464719,0.029539177],"genre_scores_gemma":[0.99956346,0.00001800291,0.000051084273,0.000018839826,0.000008085583,0.000020454101,0.000003384658,0.000032619213,0.00028406325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941564,0.000019343835,0.000112453425,0.00011794236,0.00011303678,0.00022160116],"domain_scores_gemma":[0.9996092,0.000028361048,0.0000148337285,0.00025002306,0.000021096948,0.00007649079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090892274,0.00012777305,0.00013032819,0.000046959995,0.000052869884,0.000023014894,0.00012396301,0.000058570804,0.00006962897],"category_scores_gemma":[0.0000046390214,0.000110596804,0.000032429412,0.00020104244,0.000025760566,0.00009517224,0.0000108433915,0.00011142993,0.00020939749],"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.00009720375,0.00016199249,0.07352844,0.00011048532,0.00025216627,0.00026878843,0.0011535073,0.0028274604,0.0033978138,0.90362877,0.009398102,0.0051752864],"study_design_scores_gemma":[0.009289486,0.00057678664,0.07512613,0.0003755011,0.000121097706,0.0005126132,0.0009238873,0.013407841,0.013557746,0.65518653,0.22840862,0.0025137463],"about_ca_topic_score_codex":0.0000070744704,"about_ca_topic_score_gemma":0.000005270155,"teacher_disagreement_score":0.2484422,"about_ca_system_score_codex":0.000021637685,"about_ca_system_score_gemma":0.00000470913,"threshold_uncertainty_score":0.45100066},"labels":[],"label_agreement":null},{"id":"W32355936","doi":"10.1039/d0ob00617c","title":"Spanning Trees Orthogonal to One-Factorizations of K 2n .","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Mathematics; Spanning tree; Combinatorics","score_opus":0.009432520135238544,"score_gpt":0.20343251724879927,"score_spread":0.19399999711356072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32355936","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.9750779,0.00008495132,0.0001448716,0.0000128174415,0.00083077746,0.00010455181,0.000010549084,0.00016169074,0.02357189],"genre_scores_gemma":[0.9995401,0.000008042637,0.000088682806,0.000011248587,0.000012369404,0.000013610324,0.000007298303,0.000022795584,0.00029588505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936485,0.000025188838,0.00020545193,0.00010449642,0.00013240278,0.00016758728],"domain_scores_gemma":[0.9996329,0.000039270606,0.0000168153,0.00019882063,0.000028910928,0.00008331177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008813803,0.00010215933,0.00016408188,0.000075624936,0.000048226197,0.000013887905,0.00013681628,0.00005441129,0.00045210627],"category_scores_gemma":[0.000011175187,0.0001133222,0.000052858333,0.00032784432,0.000016777989,0.00008430607,0.0000093825565,0.00007552053,0.00011037869],"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.000018388193,0.000096017495,0.009873749,0.000056320885,0.00010562528,0.000003803646,0.0015641951,0.015873108,0.012108965,0.9537441,0.0010996304,0.0054560946],"study_design_scores_gemma":[0.002996399,0.00057175214,0.15490966,0.0006803914,0.0001502562,0.000019661229,0.0006633068,0.0058046165,0.060665082,0.71558684,0.056137156,0.0018148699],"about_ca_topic_score_codex":0.0000072103894,"about_ca_topic_score_gemma":0.0000050443364,"teacher_disagreement_score":0.23815724,"about_ca_system_score_codex":0.00001810409,"about_ca_system_score_gemma":0.000009109706,"threshold_uncertainty_score":0.49502465},"labels":[],"label_agreement":null},{"id":"W34586909","doi":"10.1007/978-1-4419-7997-1_13","title":"Algorithms and Metaheuristics for Combinatorial Matrices","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Metaheuristic; Computer science; Combinatorial optimization; Theoretical computer science; Algorithm","score_opus":0.010866429703347565,"score_gpt":0.19179572869600947,"score_spread":0.1809292989926619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34586909","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.000046722518,0.00488736,0.0051955893,0.000006555514,0.0043460843,0.00067137275,0.000110521105,0.00035756011,0.9843782],"genre_scores_gemma":[0.011915728,0.0013160883,0.0036273124,0.000026457168,0.0018354472,0.00012886793,0.00008814912,0.00026292066,0.980799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999386,0.0000037343423,0.00022349937,0.00015325246,0.00009166786,0.00014185974],"domain_scores_gemma":[0.99957216,0.00011130613,0.000040950385,0.0001603476,0.000045570774,0.00006964371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098574936,0.00024401548,0.0003370649,0.00006240141,0.00003967074,0.00005611878,0.00009614217,0.00027703797,0.000282484],"category_scores_gemma":[0.0000050101053,0.0002151906,0.0000924539,0.000009458297,0.00003107274,0.000045591,0.000018076036,0.00012526619,0.00010480421],"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.000002565479,0.0000017535201,2.9227928e-7,0.00028001284,0.00015074467,0.0000014387336,0.000016796988,0.000007327053,0.0000085256515,0.9804125,0.016259698,0.0028583896],"study_design_scores_gemma":[0.00028181434,0.00004169989,6.9577686e-7,0.000042719657,0.00011911784,0.000006791194,0.0000076230153,0.0021428545,0.00004618756,0.3373856,0.6596109,0.00031399247],"about_ca_topic_score_codex":0.0000030020844,"about_ca_topic_score_gemma":7.3240267e-7,"teacher_disagreement_score":0.6433512,"about_ca_system_score_codex":0.000011751433,"about_ca_system_score_gemma":0.000004357068,"threshold_uncertainty_score":0.87752175},"labels":[],"label_agreement":null},{"id":"W3484787","doi":"","title":"Graph designs for eight graphs with six vertices and eight edges (index >1).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.014421072735930126,"score_gpt":0.19427767105891255,"score_spread":0.17985659832298242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3484787","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.9950058,0.0017017173,0.00061247684,0.000018036393,0.0011114305,0.00036731362,0.000012159429,0.00017976672,0.0009912932],"genre_scores_gemma":[0.999432,0.00015131515,0.00014648044,0.00001963593,0.000012736787,0.00008786933,0.000009431824,0.000048747665,0.00009174639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990541,0.000038317175,0.00019529503,0.00023261258,0.00014802543,0.0003316988],"domain_scores_gemma":[0.9993703,0.00015077676,0.000037395424,0.00025653548,0.000054796048,0.00013023982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014025743,0.0002328748,0.00026438272,0.00013963699,0.00023801024,0.000033972843,0.0001623409,0.00010547355,0.000010193232],"category_scores_gemma":[0.000010617461,0.00019636625,0.00007237248,0.00028042088,0.00013369894,0.00021122117,0.000014201817,0.000116215066,0.000007721947],"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.00028663976,0.00019193787,0.07628963,0.0005411221,0.0006190581,0.000078722944,0.0028775781,0.0004385695,0.004832469,0.90417784,0.008846079,0.0008203372],"study_design_scores_gemma":[0.006978992,0.0010950033,0.036497947,0.00027401512,0.0002175858,0.00025114222,0.00060463377,0.002506995,0.032849513,0.9027194,0.014330014,0.0016747541],"about_ca_topic_score_codex":0.000008668122,"about_ca_topic_score_gemma":0.000008468649,"teacher_disagreement_score":0.039791685,"about_ca_system_score_codex":0.000014401127,"about_ca_system_score_gemma":0.000013141512,"threshold_uncertainty_score":0.80075836},"labels":[],"label_agreement":null},{"id":"W3526629","doi":"10.1016/0049-3848(86)90145-3","title":"On the Existence of Extended 5-Cycle Systems Having a Prescribed Number of Idempotent Elements.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Idempotence; Idempotent matrix; Pure mathematics; Combinatorics","score_opus":0.01446420584719671,"score_gpt":0.21516381113641753,"score_spread":0.20069960528922082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3526629","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.9797627,0.00046282847,0.000019969628,0.00001370392,0.0014911218,0.0003170831,0.000008504126,0.000080611964,0.017843492],"genre_scores_gemma":[0.9996888,0.000020762465,0.000016943544,0.000008058253,0.0000056478584,0.000049860253,0.0000010753027,0.000024820942,0.00018404027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987579,0.00012313957,0.000472291,0.00014121314,0.00028655192,0.00021892933],"domain_scores_gemma":[0.99910885,0.00017471469,0.00012755331,0.00048426905,0.000057631252,0.00004695831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039825123,0.00015099323,0.00026807078,0.0000423148,0.00005340355,0.000016255128,0.00030301543,0.00006311965,0.00011331169],"category_scores_gemma":[0.00005427638,0.00011765584,0.000097152,0.00020510994,0.0000559443,0.00007453537,0.00003079843,0.00013129895,0.00004411983],"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.000010111609,0.0001249688,0.0011904417,0.00020355126,0.00010350827,0.0000038506237,0.00066066725,0.00088179595,0.0034099263,0.9918812,0.0013611102,0.00016886236],"study_design_scores_gemma":[0.0039158743,0.0005283251,0.0075094798,0.0024377906,0.00019447067,0.00005900159,0.0031864333,0.12782516,0.039619237,0.81155074,0.0019325481,0.0012409285],"about_ca_topic_score_codex":0.000034291304,"about_ca_topic_score_gemma":7.30185e-7,"teacher_disagreement_score":0.18033046,"about_ca_system_score_codex":0.000030500525,"about_ca_system_score_gemma":0.0000031806676,"threshold_uncertainty_score":0.4797866},"labels":[],"label_agreement":null},{"id":"W35924807","doi":"10.17392/1469-22","title":"Digraphs Whose Nodes are Multigraphs Having Exactly Two Degrees f and 2.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012638851634045075,"score_gpt":0.19641588354844872,"score_spread":0.18377703191440364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35924807","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.9873352,0.0070522237,0.0000119201995,0.000022894934,0.0013486302,0.00015282526,0.0000075950697,0.00046073954,0.0036079541],"genre_scores_gemma":[0.99931407,0.0003965757,0.00007273063,0.000019706356,0.000013128963,0.000029378642,0.0000021546773,0.000046418612,0.000105850544],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893373,0.00005983403,0.0002445692,0.00024819793,0.0001616728,0.000351974],"domain_scores_gemma":[0.99931645,0.0001095982,0.00005179923,0.00033879347,0.000034662167,0.00014871504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016338243,0.00025520514,0.00027694393,0.00016686085,0.00015989832,0.0000932734,0.00018893408,0.00009801727,0.00005029219],"category_scores_gemma":[0.000027205275,0.0002570984,0.0000931897,0.00030159848,0.00008274066,0.0002599496,0.000033204476,0.0001996969,0.00004762578],"study_design_candidate":"observational","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.000024414647,0.0003281954,0.52008265,0.00067804044,0.0004437363,0.00018381725,0.005757369,0.0010882702,0.010352457,0.441744,0.00507202,0.014245033],"study_design_scores_gemma":[0.01377897,0.00041281953,0.41205785,0.0020270927,0.00038600963,0.00030473722,0.00550345,0.104500934,0.0154048,0.4133787,0.026770458,0.005474182],"about_ca_topic_score_codex":0.000034533117,"about_ca_topic_score_gemma":0.000024365969,"teacher_disagreement_score":0.10802478,"about_ca_system_score_codex":0.0000172567,"about_ca_system_score_gemma":0.0000015543942,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W36932259","doi":"10.1007/s00247-023-05643-4","title":"Minimal Defining Sets of 1-Factorizations of Complete Graphs","year":2008,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Equivalence (formal languages); Combinatorics; Set (abstract data type); Graph; Unipotent; Discrete mathematics; Computer science; Algorithm","score_opus":0.02718840041487686,"score_gpt":0.22031214190550283,"score_spread":0.19312374149062597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36932259","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.9756554,0.00032886353,0.0018170751,0.000003607425,0.00010535817,0.00013086005,0.00010728627,0.00010709106,0.021744497],"genre_scores_gemma":[0.99704313,0.000010758265,0.0028816275,0.0000018807169,0.000003194303,0.000009579816,0.000009939906,0.000018786019,0.000021092816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.000028654815,0.00042490748,0.00008258835,0.00014798237,0.0001439075],"domain_scores_gemma":[0.99941057,0.0001660725,0.000067965615,0.00026826572,0.00004343647,0.000043715037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013085181,0.00011074179,0.00029858598,0.00010689931,0.000043336873,0.0000021882704,0.00013082978,0.000048625276,0.00014858143],"category_scores_gemma":[0.000056873465,0.000104714854,0.00010575007,0.00022693197,0.00011778235,0.00005260845,0.000015889957,0.000056295197,0.000029019971],"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.00001720861,0.00020807149,0.0044573187,0.002580529,0.00030067406,0.000007664555,0.014256861,0.00056335476,0.025649944,0.9502369,0.001381322,0.00034015364],"study_design_scores_gemma":[0.0037677323,0.00086829177,0.06811505,0.0031208922,0.0005786518,0.0005858181,0.010376451,0.11944344,0.0789757,0.70717746,0.0044383863,0.0025521142],"about_ca_topic_score_codex":0.000002563052,"about_ca_topic_score_gemma":7.052226e-7,"teacher_disagreement_score":0.24305943,"about_ca_system_score_codex":0.000005799169,"about_ca_system_score_gemma":0.000008941551,"threshold_uncertainty_score":0.4270148},"labels":[],"label_agreement":null},{"id":"W37843838","doi":"","title":"The crossing number of P(10, 3) is six.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Combinatorics; Geography; Cartography; Intersection (aeronautics)","score_opus":0.006790254492457936,"score_gpt":0.23282530009685584,"score_spread":0.2260350456043979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37843838","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.9582044,0.0003017747,0.000032932618,0.000010297085,0.0022896628,0.000060600607,0.0000016080006,0.00009266611,0.03900605],"genre_scores_gemma":[0.99930984,0.0000048032375,0.00001830451,0.000015943746,0.000011393284,0.000002507287,5.1572994e-7,0.00001920642,0.0006174966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932206,0.00001886794,0.00022715729,0.000076207376,0.00013037333,0.0002253201],"domain_scores_gemma":[0.99946254,0.00015687547,0.000036081474,0.00025845921,0.000041374693,0.000044678865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053662085,0.0000911921,0.00011267192,0.00001979818,0.00017496842,0.000050524,0.00016919548,0.00006330254,0.000077251585],"category_scores_gemma":[0.000019250401,0.00007218048,0.0000646837,0.00018263984,0.00009669601,0.00006220182,0.000017650545,0.00009649321,0.00012130951],"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.000023849381,0.000027547378,0.011273851,0.000058972553,0.00007758788,0.000006763011,0.0013211592,0.000031229047,0.0038466328,0.97253704,0.008064315,0.0027310539],"study_design_scores_gemma":[0.001120322,0.000044548106,0.011820602,0.00011217947,0.000029984069,0.000029519932,0.0007946365,0.0006374841,0.107741386,0.6947107,0.18250914,0.00044955115],"about_ca_topic_score_codex":0.00000891291,"about_ca_topic_score_gemma":0.00000303762,"teacher_disagreement_score":0.2778264,"about_ca_system_score_codex":0.000019499055,"about_ca_system_score_gemma":0.000007646735,"threshold_uncertainty_score":0.29434347},"labels":[],"label_agreement":null},{"id":"W38371716","doi":"10.1007/s43477-023-00092-5","title":"On the Connectivity of (4;g)-Cages.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Center for Chronic Disease Prevention and Health Promotion","keywords":"Mathematics; Combinatorics","score_opus":0.012091663010184227,"score_gpt":0.18071383805628483,"score_spread":0.1686221750461006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38371716","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.951589,0.00018871843,0.0000068529735,0.000050837272,0.0012039888,0.0000912439,0.0000024096676,0.00009513357,0.046771854],"genre_scores_gemma":[0.99981946,0.000010824127,0.0000012682425,0.000022946162,0.000003849225,0.000011263754,2.7541049e-7,0.000012814871,0.00011727318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.0000557172,0.000107788095,0.00006999527,0.00009865397,0.00011503436],"domain_scores_gemma":[0.9993947,0.00027352056,0.000021286585,0.00026984932,0.00001538834,0.000025235448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808189,0.00008056821,0.00011369304,0.000028458177,0.000043344622,0.000008162465,0.00013949376,0.00004197227,0.00022293036],"category_scores_gemma":[0.0000447834,0.000059233214,0.00005171716,0.00014201399,0.000036826514,0.000035482473,0.000009898903,0.000111059104,0.000117390984],"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.0000019014134,0.000033987904,0.00023470925,0.000016399255,0.000025984567,0.0000015734555,0.00022928246,0.0001590895,0.0009463677,0.99170285,0.0063758036,0.0002720454],"study_design_scores_gemma":[0.000577574,0.000119571385,0.0022765936,0.000061927436,0.000014705829,0.0000047044837,0.00013191503,0.0061263973,0.024437774,0.9628271,0.0031982125,0.0002235423],"about_ca_topic_score_codex":0.0000036156318,"about_ca_topic_score_gemma":7.507997e-7,"teacher_disagreement_score":0.048230525,"about_ca_system_score_codex":0.00001259899,"about_ca_system_score_gemma":9.790929e-7,"threshold_uncertainty_score":0.24409312},"labels":[],"label_agreement":null},{"id":"W38505790","doi":"10.3138/canlivj-2023-0018","title":"Local Rigidity of Triangle Groups in Sp(4,R)","year":2009,"lang":"en","type":"dissertation","venue":"Canadian Liver Journal","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rigidity (electromagnetism); Mathematics; Combinatorics; Pure mathematics; Structural engineering; Engineering","score_opus":0.006413724983744884,"score_gpt":0.18463624902144746,"score_spread":0.17822252403770258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38505790","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.95448494,0.0061966996,0.00012497188,0.000009600821,0.0028041813,0.00018473949,0.000062778876,0.000025237801,0.036106873],"genre_scores_gemma":[0.9989094,0.00019007869,0.000015332547,0.00001556899,0.00022311209,0.0000023713676,0.00006722409,0.000029471326,0.00054740335],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99892884,0.000071589086,0.00042484113,0.000102971906,0.00014580139,0.00032592888],"domain_scores_gemma":[0.9993158,0.000021226917,0.000099457735,0.00013135394,0.000055569857,0.0003766035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003292486,0.00018961237,0.00037744653,0.0006976892,0.000055371373,0.00003202078,0.00022558979,0.00031089914,0.00026079477],"category_scores_gemma":[0.000015579932,0.00020667256,0.00016008737,0.0002262777,0.000019215435,0.00010609798,0.000001164575,0.00069696776,0.000028714969],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008515366,0.00035712344,0.008015257,0.0052446034,0.0019912578,0.015622626,0.035229567,0.04713479,0.0027395803,0.041732132,0.18625493,0.6548266],"study_design_scores_gemma":[0.009097002,0.0009978056,0.708871,0.010452196,0.00075739546,0.0029001348,0.024520444,0.0101393415,0.008741758,0.04280379,0.17489897,0.005820168],"about_ca_topic_score_codex":0.010212617,"about_ca_topic_score_gemma":0.46192095,"teacher_disagreement_score":0.70085573,"about_ca_system_score_codex":0.00039520187,"about_ca_system_score_gemma":0.00032541668,"threshold_uncertainty_score":0.9963785},"labels":[],"label_agreement":null},{"id":"W39262992","doi":"10.1007/978-3-642-04016-0_9","title":"Total Colouring Revisited","year":2002,"lang":"en","type":"book-chapter","venue":"Algorithms and combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University; University of Toronto; University of New Brunswick","funders":"","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Graph; Artificial intelligence","score_opus":0.009097649269214048,"score_gpt":0.1723357971254268,"score_spread":0.16323814785621274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39262992","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.0011170276,0.019900877,0.00021395762,0.000010826164,0.00205854,0.00032367778,0.00005338112,0.00055753556,0.97576416],"genre_scores_gemma":[0.22013699,0.00883821,0.00012555472,0.000044919158,0.0006312723,0.000035427336,0.0000656134,0.00035977393,0.7697622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899703,0.00000885401,0.00029444558,0.0002581062,0.0001952764,0.00024630423],"domain_scores_gemma":[0.99943054,0.000041097643,0.00006137846,0.00028701345,0.000046450743,0.00013351144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010383928,0.00037007898,0.000457029,0.00012709199,0.000100009434,0.000065393964,0.00012405014,0.0003833419,0.00016363345],"category_scores_gemma":[0.0000026460152,0.00039287854,0.000114727016,0.000054165685,0.000042857908,0.000065891785,0.0000505617,0.0004326806,0.000096302785],"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.0000022708339,0.000013764576,0.000011839591,0.00033670623,0.00020365186,0.000112356436,0.0001143797,0.00002803084,0.000009236394,0.98185503,0.0040282863,0.013284458],"study_design_scores_gemma":[0.0010576013,0.00024078852,0.000070407616,0.00076021306,0.00024597938,0.000329324,0.000034473785,0.013461387,0.00005960596,0.28118938,0.70067453,0.001876285],"about_ca_topic_score_codex":0.0000018055965,"about_ca_topic_score_gemma":1.3730926e-7,"teacher_disagreement_score":0.70066565,"about_ca_system_score_codex":0.00005442538,"about_ca_system_score_gemma":0.00000456708,"threshold_uncertainty_score":0.9998523},"labels":[],"label_agreement":null},{"id":"W40043733","doi":"","title":"Optimal Binary Linear Codes.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Arithmetic","score_opus":0.007077893867938434,"score_gpt":0.206232152952072,"score_spread":0.19915425908413356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40043733","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.9851512,0.00062925933,0.000043962908,0.000051911305,0.0018225545,0.00009692354,0.0000044987355,0.00050415035,0.011695578],"genre_scores_gemma":[0.9991633,0.000023960489,0.00034309697,0.000031592608,0.000042600805,0.00001618116,0.0000070210035,0.00003483295,0.0003373851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993087,0.000027073078,0.00017800344,0.0001270319,0.00011545783,0.00024371219],"domain_scores_gemma":[0.99958646,0.00003328222,0.000017211785,0.00025289546,0.000022067296,0.0000881093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001590699,0.0001395434,0.00015818459,0.00006196508,0.00006160585,0.00001854964,0.000175585,0.000088718756,0.00010766335],"category_scores_gemma":[0.0000075205785,0.00014507445,0.00006557824,0.00016660999,0.00002942251,0.00013799359,0.000023490698,0.0001557377,0.00058936153],"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.000034128378,0.00018524515,0.0012974106,0.000113565264,0.00016905092,0.000051050043,0.0010262994,0.09742449,0.010860004,0.851439,0.034403004,0.0029967723],"study_design_scores_gemma":[0.005417506,0.00052001636,0.004781843,0.0002405862,0.0001179702,0.00013575958,0.00059182,0.34796056,0.06820234,0.09649362,0.4730652,0.0024727874],"about_ca_topic_score_codex":0.0000026885739,"about_ca_topic_score_gemma":8.899974e-7,"teacher_disagreement_score":0.75494534,"about_ca_system_score_codex":0.000038518232,"about_ca_system_score_gemma":0.0000074201453,"threshold_uncertainty_score":0.75752467},"labels":[],"label_agreement":null},{"id":"W40066852","doi":"","title":"Embeddings of Steiner Quadruple Systems using Extensions of Linear Spaces.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner system; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.0127891565091201,"score_gpt":0.2265981414725181,"score_spread":0.213808984963398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40066852","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.99538875,0.00089520315,0.00031787984,0.000004407775,0.0023431801,0.00017411228,0.000009552482,0.00010476108,0.00076215016],"genre_scores_gemma":[0.9996776,0.000012991724,0.00021474424,0.0000021828937,0.000012220401,0.0000052980713,0.0000026624073,0.000036530604,0.00003575916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990397,0.000033821656,0.0004002432,0.0001294784,0.00019222878,0.00020451313],"domain_scores_gemma":[0.9993224,0.000045593835,0.00010953973,0.00033272736,0.00011927837,0.00007045186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024243857,0.00015085569,0.00036640008,0.00012567836,0.000047236714,0.000010269669,0.0001559542,0.00010399889,0.000007501338],"category_scores_gemma":[0.000029066989,0.00014842127,0.00009920643,0.00034149532,0.000057351863,0.00010679078,0.000027348015,0.000112884525,0.000009332199],"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.0000126674195,0.000094635994,0.00077211537,0.0006129887,0.00011893498,0.0000100832185,0.0011417414,0.17045383,0.13267866,0.6939959,0.0000825178,0.00002592045],"study_design_scores_gemma":[0.01082808,0.0008227304,0.0020337899,0.006674082,0.0005212542,0.000220138,0.009504171,0.2078569,0.46594128,0.2903204,0.0027723818,0.002504787],"about_ca_topic_score_codex":0.00024127714,"about_ca_topic_score_gemma":0.0000022984043,"teacher_disagreement_score":0.4036755,"about_ca_system_score_codex":0.000043686592,"about_ca_system_score_gemma":0.00002382517,"threshold_uncertainty_score":0.60524434},"labels":[],"label_agreement":null},{"id":"W415000","doi":"","title":"Product constructions for critical sets in latin squares","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Product (mathematics); Geometry; Food science; Chemistry","score_opus":0.013311967139782947,"score_gpt":0.2513491557138496,"score_spread":0.23803718857406664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W415000","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.96281576,0.0007258618,0.007427466,0.000041488845,0.026605917,0.00040931223,0.0000043220134,0.0000591064,0.0019107894],"genre_scores_gemma":[0.99354285,0.000011569138,0.0059207473,0.000003657131,0.00048146932,0.0000052461023,4.7005324e-7,0.000032154905,0.0000018472275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982806,0.00010201366,0.0009349633,0.00013281549,0.0002508477,0.00029879785],"domain_scores_gemma":[0.99828357,0.000986952,0.0002078595,0.00014504754,0.0002537438,0.00012284088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014597038,0.00020840224,0.0005683666,0.0002647028,0.00014485471,0.000110015666,0.0001524478,0.000109277236,0.0000051217767],"category_scores_gemma":[0.0010835768,0.00019922374,0.0001294728,0.00031136244,0.00008206519,0.00014814759,0.000020807614,0.0003358611,8.20899e-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.00002198382,0.00015593396,0.00029683497,0.0003790562,0.000043524786,0.000007311472,0.0006691094,0.00029688442,0.00050269475,0.9970869,0.00012247502,0.00041732172],"study_design_scores_gemma":[0.0029749565,0.00028347256,0.00006638718,0.0003763173,0.00005179783,0.00017580106,0.00073246204,0.005605634,0.0018979673,0.98636436,0.0012025174,0.0002683019],"about_ca_topic_score_codex":0.0000010251305,"about_ca_topic_score_gemma":3.2408525e-7,"teacher_disagreement_score":0.030727103,"about_ca_system_score_codex":0.00005747177,"about_ca_system_score_gemma":0.000060012684,"threshold_uncertainty_score":0.81241083},"labels":[],"label_agreement":null},{"id":"W4187411","doi":"10.1016/0013-4694(69)91361-3","title":"On 3-Hypergraphs with Equal Degree Sequences.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics","score_opus":0.011802308836113619,"score_gpt":0.20624362873441562,"score_spread":0.19444131989830202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4187411","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.94164747,0.00015544578,0.0003122784,0.000007190056,0.0016683196,0.00011298899,0.0000020851976,0.00032960126,0.055764616],"genre_scores_gemma":[0.9997631,0.000004765146,0.000047442034,0.000040851977,0.000010742808,0.000008501868,0.0000029328087,0.000032257434,0.000089416484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991292,0.000021647105,0.00016591762,0.00015448839,0.00020686294,0.00032191636],"domain_scores_gemma":[0.99945825,0.00011295429,0.000024254547,0.00026984458,0.00002807809,0.00010662168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033939275,0.0001657615,0.00015650924,0.000110170055,0.0000692037,0.000023421562,0.00017332181,0.00008500434,0.000030327692],"category_scores_gemma":[0.00001044237,0.00013854424,0.000046923848,0.00032903944,0.00005262783,0.00008702724,0.000008972254,0.0001801096,0.00010359076],"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.000033556888,0.000028489228,0.0016077898,0.000022639117,0.0000466895,0.000057580335,0.00016542611,0.00035256022,0.0010724334,0.99507684,0.0005402519,0.0009957644],"study_design_scores_gemma":[0.0018803069,0.0006205074,0.0067839725,0.00016941705,0.00003302156,0.000061797706,0.00035009306,0.0003518838,0.019596966,0.96611536,0.0032756792,0.0007609873],"about_ca_topic_score_codex":0.000012829474,"about_ca_topic_score_gemma":0.000018769133,"teacher_disagreement_score":0.058115616,"about_ca_system_score_codex":0.000039358718,"about_ca_system_score_gemma":0.000008914526,"threshold_uncertainty_score":0.56496704},"labels":[],"label_agreement":null},{"id":"W4206036233","doi":"10.1016/s0304-3975(04)00125-2","title":"Packing arrays","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Alphabet; Disjoint sets; Upper and lower bounds; Row; Packing problems; Set (abstract data type); Row and column spaces; Equivalence (formal languages); Class (philosophy); Matching (statistics); Discrete mathematics; Computer science","score_opus":0.005519304663409126,"score_gpt":0.19487625343632034,"score_spread":0.1893569487729112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206036233","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.28266567,0.000022159567,0.70268893,0.000046504138,0.0006571916,0.000050302704,4.7280665e-7,0.00030843297,0.0135603305],"genre_scores_gemma":[0.9926018,0.000001460688,0.0071889614,0.00007268386,0.00012234808,0.0000025838056,1.9995953e-7,0.00000873539,0.0000012385924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913806,0.0000145304475,0.000118519594,0.00018060002,0.00022477524,0.00032349615],"domain_scores_gemma":[0.99954814,0.000031221276,0.000008165105,0.00025487845,0.000026464822,0.00013115817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004973203,0.00009485189,0.00009628234,0.00007450091,0.00015090768,0.000095715084,0.00043964808,0.000027263106,0.00003274233],"category_scores_gemma":[0.000010709974,0.000079219004,0.00003478786,0.00044539358,0.0011055348,0.00016447136,0.000060079812,0.000107075306,0.00013822025],"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.000001041565,0.00000610256,0.000010951782,0.000006700319,0.0000018445463,0.000005110538,0.00028599313,0.01692516,0.0031195316,0.9768834,0.000005099354,0.0027490475],"study_design_scores_gemma":[0.0002455756,0.000064272,0.000307883,0.00006454773,0.0000037242528,0.00005531897,0.000022612207,0.09109101,0.03669578,0.87103266,0.00016225828,0.00025436704],"about_ca_topic_score_codex":5.192024e-7,"about_ca_topic_score_gemma":1.644477e-7,"teacher_disagreement_score":0.70993614,"about_ca_system_score_codex":0.000037476846,"about_ca_system_score_gemma":0.000014697256,"threshold_uncertainty_score":0.40733892},"labels":[],"label_agreement":null},{"id":"W4206498668","doi":"10.1016/j.dam.2006.03.006","title":"Existence of directedwhist tournaments with the three person property <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mtext>PDWh</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Zhejiang University; Mount Saint Vincent University","keywords":"Tournament; Property (philosophy); Mathematics; Scroll; Combinatorics; Discrete mathematics; Theology; Philosophy","score_opus":0.01529304542828501,"score_gpt":0.2129425662549024,"score_spread":0.1976495208266174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206498668","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.9499151,0.0018302829,0.0030695102,0.00030277827,0.001213091,0.00041642596,0.0007998628,0.0005775821,0.04187537],"genre_scores_gemma":[0.98911023,0.00047812535,0.005395279,0.00032330368,0.0011960233,0.0015374743,0.0006060933,0.0010279141,0.00032556124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9890665,0.00031295125,0.0027088055,0.0020279265,0.003137596,0.0027462223],"domain_scores_gemma":[0.9919835,0.001203374,0.0027170028,0.0029270593,0.00028656572,0.00088249665],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0023512815,0.0017349067,0.0010684395,0.0004532728,0.001821552,0.0014507849,0.0028527083,0.0020076176,0.0014326185],"category_scores_gemma":[0.00043287608,0.0019821425,0.001682984,0.0014216487,0.00182554,0.0010386129,0.0011572175,0.0021630137,0.0013288272],"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.0009742389,0.0006379083,0.000019176172,0.003982175,0.0022917127,0.00039527038,0.0068599847,0.0036907338,0.0066880044,0.9628653,0.009574021,0.002021487],"study_design_scores_gemma":[0.00626684,0.0030988576,0.00011269473,0.007966918,0.005895595,0.0019408688,0.02670099,0.4507464,0.43510473,0.0506067,0.0055332566,0.0060261744],"about_ca_topic_score_codex":0.0012820084,"about_ca_topic_score_gemma":0.00106331,"teacher_disagreement_score":0.91225857,"about_ca_system_score_codex":0.00008098734,"about_ca_system_score_gemma":0.0006609989,"threshold_uncertainty_score":0.9995858},"labels":[],"label_agreement":null},{"id":"W4210460994","doi":"","title":"Local balance in graph decompositions","year":2021,"lang":"en","type":"article","venue":"UVic’s Research and Learning Repository (University of Victoria)","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Null graph; Combinatorics; Butterfly graph; Voltage graph; Windmill graph; Graph; Line graph; Colored; Vertex (graph theory); Regular graph; Graph property; Discrete mathematics","score_opus":0.012779814965576428,"score_gpt":0.23140800630957514,"score_spread":0.21862819134399872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210460994","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.9789902,0.0015998797,0.0023936597,0.000032244585,0.0003121389,0.00007117223,0.0000022238248,0.000081471204,0.016517017],"genre_scores_gemma":[0.99826133,0.00020373365,0.00016122933,0.0000011000307,0.000051910403,5.746561e-7,0.0000068846,0.000009938071,0.0013033056],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988681,0.00032645394,0.000103875995,0.00019528437,0.00024224675,0.00026402387],"domain_scores_gemma":[0.999356,0.00019334757,0.00001990208,0.00016298701,0.0001463657,0.000121408586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004002316,0.00007954414,0.00016839005,0.00019413616,0.0003490142,0.000032117878,0.0001351477,0.00009841855,0.000047915448],"category_scores_gemma":[0.000022197284,0.00010681821,0.00004834927,0.0005528522,0.00019847756,0.00014310826,0.000060772843,0.0006242252,0.000012800381],"study_design_candidate":"observational","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.0006486382,0.00081467873,0.25982657,0.0023417058,0.00072279404,0.0056851283,0.030155318,0.084617846,0.5657633,0.03442894,0.0061685955,0.008826515],"study_design_scores_gemma":[0.008233327,0.001803856,0.40822455,0.002735339,0.000103676895,0.00087418716,0.118430026,0.11651974,0.042380426,0.013662729,0.28467533,0.002356807],"about_ca_topic_score_codex":0.00016330529,"about_ca_topic_score_gemma":0.00011165764,"teacher_disagreement_score":0.52338284,"about_ca_system_score_codex":0.00007029321,"about_ca_system_score_gemma":0.000039964732,"threshold_uncertainty_score":0.43559203},"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":"W4213188790","doi":"10.1016/j.disc.2007.07.031","title":"Pancyclic PBD block-intersection graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"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","funders":"","keywords":"Combinatorics; Mathematics; Intersection (aeronautics); Vertex (graph theory); Graph; Pairwise comparison; Discrete mathematics; Block (permutation group theory); Intersection graph; Line graph","score_opus":0.007455798218356486,"score_gpt":0.2132354064206548,"score_spread":0.20577960820229832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213188790","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.8846528,0.0001542806,0.043295685,0.0000072771027,0.00078338344,0.00018244736,0.0000056735244,0.0005640966,0.07035438],"genre_scores_gemma":[0.99870116,0.000009883982,0.00089085527,0.000011649728,0.00007091962,0.00000924382,0.0000044961607,0.000039678278,0.00026214568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917305,0.000011018944,0.0003063822,0.00010424561,0.00013952504,0.00026576934],"domain_scores_gemma":[0.9995434,0.00006051798,0.00004090896,0.0002633384,0.000016857393,0.000074946765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562246,0.00015425659,0.00017399082,0.000116537965,0.000057561956,0.000028846207,0.0001213614,0.00008009907,0.000037826787],"category_scores_gemma":[0.000015520422,0.00013857956,0.000113601105,0.00021021308,0.000030943585,0.00007343402,0.000013420314,0.00012272375,0.00012477765],"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.000046965735,0.0002669347,0.0021363324,0.003155467,0.0007487608,0.00010982801,0.02721123,0.002782628,0.08209663,0.8686764,0.0047330596,0.008035735],"study_design_scores_gemma":[0.0027060062,0.00040254628,0.0055972524,0.0017593777,0.00047500263,0.00081710453,0.03319963,0.09043534,0.17806648,0.6525104,0.03014311,0.0038877535],"about_ca_topic_score_codex":0.0000024853416,"about_ca_topic_score_gemma":0.0000152243165,"teacher_disagreement_score":0.21616603,"about_ca_system_score_codex":0.000025080146,"about_ca_system_score_gemma":0.0000019056644,"threshold_uncertainty_score":0.5651111},"labels":[],"label_agreement":null},{"id":"W4214935846","doi":"10.1016/j.laa.2022.03.001","title":"Gram mates, sign changes in singular values, and isomorphism","year":2022,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"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; University of Manitoba","keywords":"Mathematics; Rank (graph theory); Gram; Isomorphism (crystallography); Sign (mathematics); Singular value; Pure mathematics; Combinatorics; Statistics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.007569654424923625,"score_gpt":0.20117891514469274,"score_spread":0.1936092607197691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214935846","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.9829092,0.011821183,0.0019469436,0.00048493766,0.00013529744,0.00092480483,0.000096291355,0.00034149256,0.0013398234],"genre_scores_gemma":[0.99863243,0.0002705811,0.00015523071,0.0000755002,0.000058417,0.00052021997,0.000029182984,0.00002042519,0.00023800894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995116,0.00002973849,0.000114165494,0.00014610935,0.0000673218,0.0001310933],"domain_scores_gemma":[0.99976605,0.000034875327,0.000016976544,0.00012440086,0.000008621058,0.00004909617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013866514,0.00008883873,0.000108500004,0.0000835632,0.00016523882,0.000018149276,0.00007484363,0.00003231188,0.00005852691],"category_scores_gemma":[0.0000030242197,0.000096690186,0.000012652274,0.00022039707,0.000021678048,0.00003558489,0.00004220102,0.0001231597,0.000009898867],"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.000044364646,0.0003975917,0.0020597621,0.00088723336,0.00018443856,0.000025862724,0.0077644074,0.008064272,0.07615581,0.8471705,0.0036293012,0.053616505],"study_design_scores_gemma":[0.0017820045,0.00033637972,0.0043839165,0.00007166754,0.000107528045,0.0002085932,0.0031301875,0.2021173,0.011028435,0.11354067,0.6618753,0.0014180131],"about_ca_topic_score_codex":0.000007256911,"about_ca_topic_score_gemma":0.000005686554,"teacher_disagreement_score":0.73362976,"about_ca_system_score_codex":0.000011840813,"about_ca_system_score_gemma":0.0000037089733,"threshold_uncertainty_score":0.39429116},"labels":[],"label_agreement":null},{"id":"W4221037899","doi":"10.26493/2590-9770.1494.1e4","title":"Some Erdös-Ko-Rado results for linear and affine groups of degree two","year":2022,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","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":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Adjacency matrix; Affine transformation; Degree (music); Group (periodic table); Algebraic number; Graph; General linear group; Degree matrix; Property (philosophy); Discrete mathematics; Pure mathematics; Symmetric group; Mathematical analysis; Physics; Line graph; Graph power","score_opus":0.01849394591208479,"score_gpt":0.222389438756969,"score_spread":0.20389549284488423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221037899","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.98747754,0.00053953426,0.0028029769,0.00011349721,0.00006792536,0.00063434517,0.00021893477,0.00006123908,0.008083994],"genre_scores_gemma":[0.99686444,0.000040736686,0.0028253472,0.000011421285,0.000046680394,0.00006341953,0.000013486785,0.000021200605,0.0001132699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933827,0.000010999492,0.0003161402,0.000091025206,0.00011864779,0.00012494506],"domain_scores_gemma":[0.999439,0.0001910358,0.00009486078,0.00023709245,0.000009326542,0.000028685443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047681315,0.000110264074,0.00025597922,0.000036537953,0.000099964825,0.0000065681184,0.00013068022,0.000020098676,0.0000043136497],"category_scores_gemma":[0.000009732656,0.00008010729,0.000044465385,0.00007520485,0.00007691841,0.000029456836,0.00008677563,0.00007825612,6.6960246e-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.00020640674,0.000080125974,0.0000059342983,0.0016135051,0.00017003593,5.6570025e-7,0.006825677,0.0042019486,0.05130909,0.9332637,0.0011531686,0.0011698387],"study_design_scores_gemma":[0.008373313,0.0007633036,0.00012460501,0.00028789585,0.00050843565,0.000064453416,0.019385125,0.09397518,0.09373563,0.7721811,0.009635026,0.0009659411],"about_ca_topic_score_codex":7.563223e-7,"about_ca_topic_score_gemma":0.0000014347162,"teacher_disagreement_score":0.16108261,"about_ca_system_score_codex":0.000003864123,"about_ca_system_score_gemma":0.0000027832489,"threshold_uncertainty_score":0.32666805},"labels":[],"label_agreement":null},{"id":"W4223457192","doi":"10.3390/electronics11081224","title":"Reduction of Complexity Design of SAC OCDMA Systems by Utilizing Diagonal Permutation Shift (DPS) Codes with Single Photodiode (SPD) Detection Technique","year":2022,"lang":"en","type":"article","venue":"Electronics","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Diagonal; Fiber Bragg grating; Computer science; Permutation (music); Photodiode; Decoding methods; Reduction (mathematics); Algorithm; Mathematics; Optics; Physics; Optical fiber; Telecommunications","score_opus":0.016102442680981873,"score_gpt":0.20261048935831147,"score_spread":0.1865080466773296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223457192","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.7098961,0.0039045303,0.2848101,0.000003632188,0.00019260528,0.00073592813,0.000047708843,0.00020728793,0.0002021066],"genre_scores_gemma":[0.9993167,0.00004006885,0.00027512782,0.0000012740156,0.000022053504,0.00025701,0.000039406095,0.00003696366,0.000011381564],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870193,0.00026805885,0.00033532787,0.00017410253,0.00027161633,0.00024898304],"domain_scores_gemma":[0.9995197,0.000053577733,0.00016611151,0.00017937881,0.00005087109,0.000030325551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596932,0.00015345887,0.00026033775,0.00013199032,0.00015451777,0.00001418505,0.00012251142,0.0000646925,0.000014858933],"category_scores_gemma":[0.000008040818,0.00016575497,0.000051931765,0.0003874286,0.00006734494,0.00010994312,0.000013877515,0.00026715492,4.883978e-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.00012794933,0.0000754883,0.000039301023,0.00019979692,0.0000761732,7.1486375e-7,0.0005285677,0.11126143,0.8849194,0.002170284,0.000050337818,0.0005505558],"study_design_scores_gemma":[0.00034408644,0.0010175044,0.000054630927,0.00006220141,0.000051459752,0.0001269611,0.001054903,0.038433388,0.9560719,0.0018034547,0.000733749,0.0002457563],"about_ca_topic_score_codex":0.00004425688,"about_ca_topic_score_gemma":0.000017400946,"teacher_disagreement_score":0.2894206,"about_ca_system_score_codex":0.00029866883,"about_ca_system_score_gemma":0.000045405814,"threshold_uncertainty_score":0.6759291},"labels":[],"label_agreement":null},{"id":"W4224286454","doi":"10.1007/s10623-022-01048-w","title":"Sharper bounds on four lattice constants","year":2022,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constant (computer programming); Upper and lower bounds; Mathematics; Lattice (music); Mathematical analysis; Computer science; Physics","score_opus":0.024357526316692198,"score_gpt":0.20584657018460156,"score_spread":0.18148904386790937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224286454","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.9595941,0.0018488534,0.005384695,0.00004336771,0.00065047026,0.0002926234,0.00014049068,0.00046089632,0.031584516],"genre_scores_gemma":[0.99925405,0.000073805204,0.00025277297,0.00020959717,0.00003773305,0.000090864385,0.000008859273,0.000029830628,0.00004246662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909574,0.00009899766,0.00016210087,0.0001944071,0.0001878606,0.00026092294],"domain_scores_gemma":[0.9995811,0.00009237357,0.000023841865,0.00019731965,0.00001434221,0.00009105185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027898268,0.00016797923,0.00017688781,0.00021096703,0.00036907214,0.00006954056,0.00013697277,0.0000402281,0.00030291633],"category_scores_gemma":[0.0000034418558,0.00016784524,0.00010079697,0.00040367834,0.00007001409,0.000061322375,0.000028839582,0.00020199173,0.000011150394],"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.00030068532,0.00023821423,0.015988512,0.00027900696,0.00073252036,0.00019878203,0.002685967,0.006211724,0.02023547,0.9185009,0.022123659,0.012504553],"study_design_scores_gemma":[0.0054101925,0.0027040297,0.01945426,0.000256795,0.00038649433,0.00065538386,0.010782948,0.023986919,0.005167294,0.16335516,0.7639222,0.003918288],"about_ca_topic_score_codex":0.0000054072466,"about_ca_topic_score_gemma":0.000002495315,"teacher_disagreement_score":0.7551457,"about_ca_system_score_codex":0.000012348699,"about_ca_system_score_gemma":0.0000060363013,"threshold_uncertainty_score":0.684453},"labels":[],"label_agreement":null},{"id":"W4225547311","doi":"10.4230/lipics.socg.2022.42","title":"Robust Radical Sylvester-Gallai Theorem for Quadratics","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"Combinatorics; Generalization; Dimension (graph theory); Mathematics; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.025147154245618777,"score_gpt":0.23528827382658862,"score_spread":0.21014111958096984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225547311","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.30253068,0.0013053401,0.59704417,0.00035138082,0.025186388,0.015794195,0.020386057,0.0033932936,0.034008525],"genre_scores_gemma":[0.95529485,0.00027401253,0.02347866,0.0007754102,0.0015371661,0.005573319,0.010857511,0.00073074346,0.0014783135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949942,0.000109353015,0.0023740544,0.0004992415,0.00072876015,0.0012943662],"domain_scores_gemma":[0.99677396,0.00043742105,0.0006004897,0.0015890513,0.00021668847,0.0003823948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015347776,0.0011252961,0.0013779721,0.00049186207,0.00055591116,0.00060843595,0.0017911397,0.0009426011,0.00026679557],"category_scores_gemma":[0.000123417,0.0011204854,0.001106717,0.00025338645,0.00022623497,0.000534952,0.000864801,0.0018448541,0.00007026916],"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.0012927123,0.0013096149,0.0025109383,0.058198944,0.006154232,0.00004474085,0.053714763,0.49631947,0.0001898445,0.2633648,0.1061515,0.0107484395],"study_design_scores_gemma":[0.0053497083,0.00052176503,0.000096214775,0.0010615245,0.00053004816,0.0001263279,0.006507394,0.44132555,0.00055425713,0.02064841,0.5202413,0.0030375114],"about_ca_topic_score_codex":0.0000072402145,"about_ca_topic_score_gemma":0.000015041322,"teacher_disagreement_score":0.6527642,"about_ca_system_score_codex":0.00041547645,"about_ca_system_score_gemma":0.00013757222,"threshold_uncertainty_score":0.9991245},"labels":[],"label_agreement":null},{"id":"W4225639641","doi":"10.1016/j.dam.2023.04.019","title":"Factorization and pseudofactorization of weighted graphs","year":2023,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Army Research Office; National Institute of Environmental Health Sciences; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; Google; Office of Naval Research; Alfred P. Sloan Foundation","keywords":"Combinatorics; Cartesian product; Mathematics; Factorization; Graph product; Discrete mathematics; Chordal graph; Embedding; Graph; 1-planar graph; Computer science; Algorithm","score_opus":0.016483838906898047,"score_gpt":0.2178819892981109,"score_spread":0.20139815039121284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225639641","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.47616526,0.00023095663,0.5110335,0.000009969571,0.0014145502,0.0013995217,0.00034429674,0.0013881068,0.0080138715],"genre_scores_gemma":[0.9957522,0.00022744664,0.0034053968,0.0000014825868,0.0000460636,0.00009222741,0.0003271685,0.00010685621,0.000041165295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882865,0.00001205895,0.0005296442,0.0002267013,0.00022858602,0.0001743606],"domain_scores_gemma":[0.99919814,0.00008620016,0.00019826551,0.00041716278,0.00004055244,0.000059668764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016573834,0.00030190175,0.00047625936,0.00020561421,0.000036661204,0.000042942956,0.00017590428,0.0003217369,0.000011860958],"category_scores_gemma":[0.000012937356,0.00028883238,0.00008094599,0.00022764147,0.00005167027,0.000037316513,0.00012480923,0.00023494552,0.000012528461],"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.000009533487,0.000045423578,0.00026574783,0.013601292,0.00047238497,0.0000018307633,0.0076703383,0.0061570858,0.03995734,0.9308737,0.0002900996,0.0006552366],"study_design_scores_gemma":[0.00030996962,0.000016884414,0.00047273355,0.0006047305,0.00020262317,0.0000019313943,0.00095915445,0.051352084,0.019066356,0.92623955,0.000095488875,0.00067848794],"about_ca_topic_score_codex":0.0000031058446,"about_ca_topic_score_gemma":0.0000017237475,"teacher_disagreement_score":0.5195869,"about_ca_system_score_codex":0.000019744697,"about_ca_system_score_gemma":0.000010408316,"threshold_uncertainty_score":0.99995637},"labels":[],"label_agreement":null},{"id":"W4226194707","doi":"10.48550/arxiv.2111.13198","title":"The Implicit Graph Conjecture is False","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Discrete mathematics; Vertex (graph theory); Regular graph; Graph; Symmetric graph; Graph power; Line graph; Voltage graph","score_opus":0.026286020746623305,"score_gpt":0.15122589631266095,"score_spread":0.12493987556603764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226194707","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.9778163,0.0017458003,0.010988587,0.000044416185,0.0017217234,0.00029753643,0.000057094876,0.00043281732,0.0068957345],"genre_scores_gemma":[0.99762154,0.0009007721,0.00000807292,0.000056149765,0.00009636074,0.0000020553234,0.000021447322,0.00004402381,0.0012496025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.00011186437,0.00018764427,0.00051373837,0.00006410412,0.0003686452],"domain_scores_gemma":[0.9985634,0.00011380226,0.000077404045,0.0010497703,0.00007121059,0.00012438325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001834228,0.0003503175,0.00032807983,0.00011221328,0.0002434693,0.0001449491,0.0007346201,0.00039721854,0.00009039815],"category_scores_gemma":[0.000009915221,0.00032181977,0.00039206498,0.00042020643,0.00010924281,0.000082104,0.00032209136,0.0007642888,0.000057255853],"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.000054602682,0.000051790368,0.003134811,0.0006473645,0.001694405,0.0008168582,0.0016916107,0.7091829,0.0009197635,0.27367163,0.007319072,0.0008151836],"study_design_scores_gemma":[0.0032092654,0.00016609105,0.0066581974,0.0014857121,0.0016492642,0.0001792538,0.0126964785,0.20689149,0.010156424,0.6513404,0.09923287,0.0063345544],"about_ca_topic_score_codex":0.00005959192,"about_ca_topic_score_gemma":0.00010278291,"teacher_disagreement_score":0.50229144,"about_ca_system_score_codex":0.000078290155,"about_ca_system_score_gemma":0.000040940933,"threshold_uncertainty_score":0.9999234},"labels":[],"label_agreement":null},{"id":"W4226221169","doi":"10.1109/milcom52596.2021.9652917","title":"Constrained Resource Allocation Problems in Communications: An Information-assisted Approach","year":2021,"lang":"en","type":"preprint","venue":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","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":"Queen's University","funders":"Army Research Office","keywords":"Computer science; Mathematical optimization; Resource allocation; Class (philosophy); Set (abstract data type); Dynamic programming; Function (biology); Optimization problem; Wireless; Mathematics; Algorithm; Computer network; Artificial intelligence","score_opus":0.05019196301323469,"score_gpt":0.2517093227390902,"score_spread":0.2015173597258555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226221169","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.34254533,0.17887273,0.14855307,0.01294752,0.0062480173,0.022731766,0.0061059324,0.004436667,0.27755895],"genre_scores_gemma":[0.93678576,0.011806025,0.02410648,0.00014319077,0.00013366551,0.0025594374,0.024191545,0.00012338598,0.00015050588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99172246,0.0029838176,0.002782576,0.0009533246,0.00068012107,0.00087769923],"domain_scores_gemma":[0.9835329,0.0006507703,0.00043798678,0.014092962,0.0008977185,0.00038768107],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021139744,0.0011380722,0.001471513,0.0010535318,0.0007026349,0.00051340694,0.0074251285,0.0011150804,0.0003385423],"category_scores_gemma":[0.00018545825,0.0013911277,0.00044681213,0.0017066638,0.0010721898,0.0015225497,0.0023344883,0.0036111048,0.00010853502],"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.00017249798,0.0063115116,0.0036454536,0.009263942,0.0035902578,0.00003579267,0.11882534,0.5608204,0.011854879,0.057976473,0.010368729,0.2171347],"study_design_scores_gemma":[0.0019554808,0.00010894761,0.002678584,0.0031785911,0.00030739413,0.000070921524,0.040942144,0.90276915,0.00034231518,0.0030336974,0.041737955,0.0028748391],"about_ca_topic_score_codex":0.0023527148,"about_ca_topic_score_gemma":0.0074800067,"teacher_disagreement_score":0.5942404,"about_ca_system_score_codex":0.0005719496,"about_ca_system_score_gemma":0.0009354542,"threshold_uncertainty_score":0.9988538},"labels":[],"label_agreement":null},{"id":"W4226355852","doi":"10.1109/access.2022.3159027","title":"Construction of Standard Solid Sudoku Cubes and 3D Sudoku Puzzles","year":2022,"lang":"en","type":"article","venue":"IEEE Access","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 Victoria","funders":"","keywords":"Notation; Cube (algebra); Mathematics; Order (exchange); Table (database); Combinatorics; Algorithm; Discrete mathematics; Computer science; Arithmetic; Data mining","score_opus":0.010016676204719731,"score_gpt":0.23836069969096738,"score_spread":0.22834402348624763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226355852","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.994929,0.0005395113,0.0010671683,0.0000146161865,0.0012332815,0.000112221955,0.000087400964,0.00011283279,0.0019039294],"genre_scores_gemma":[0.9997296,0.000053034444,0.00006650124,0.000010147009,0.000059134734,0.000028388607,0.000004126323,0.00001689534,0.000032177508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935186,0.000049926624,0.00019318877,0.00011374458,0.00015644041,0.00013482019],"domain_scores_gemma":[0.99970984,0.000038184095,0.000042088403,0.00014728912,0.000026405198,0.00003621825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018728916,0.000093217845,0.00018196317,0.00009899924,0.00011174916,0.000040816944,0.00017332355,0.00003073959,0.00013554496],"category_scores_gemma":[0.000005474611,0.000097480246,0.000033813194,0.00017129845,0.00007053198,0.0002049337,0.000046553683,0.0001115553,0.0000014034855],"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.0010036462,0.00024211321,0.20024215,0.004317743,0.0015369179,0.00014884054,0.010787697,0.3319492,0.22043301,0.08900621,0.02123277,0.11909971],"study_design_scores_gemma":[0.0049861693,0.00070145587,0.015209167,0.00033439157,0.00031828773,0.00081784866,0.010109629,0.034607444,0.77974206,0.06558914,0.085163176,0.0024212124],"about_ca_topic_score_codex":0.00002792666,"about_ca_topic_score_gemma":0.000015951293,"teacher_disagreement_score":0.55930907,"about_ca_system_score_codex":0.000023017225,"about_ca_system_score_gemma":0.000011013464,"threshold_uncertainty_score":0.3975129},"labels":[],"label_agreement":null},{"id":"W4230966397","doi":"10.1090/car/036/17","title":"The (11,5,2) biplane, codes, designs, and groups","year":2020,"lang":"en","type":"book-chapter","venue":"˜The œCarus mathematical monographs","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Biplane; Computer science; Mathematics; Engineering; Aerospace engineering","score_opus":0.01831644372717914,"score_gpt":0.1950487286688932,"score_spread":0.17673228494171406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230966397","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016020427,0.025266133,0.014309619,0.0005928041,0.0014876147,0.0032781602,0.00036833202,0.002022446,0.9510729],"genre_scores_gemma":[0.93854976,0.0046207486,0.001060715,0.0004885851,0.0010260826,0.00051173597,0.00012562868,0.00086055446,0.052756213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805206,0.00007321888,0.0006669975,0.00036755519,0.0003924298,0.0004477171],"domain_scores_gemma":[0.9978073,0.0009935043,0.00013086802,0.0007890255,0.000034021334,0.00024526168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005431853,0.0006384078,0.0006981937,0.00010561687,0.00039009535,0.00023859195,0.00064560963,0.0004030365,0.00008505612],"category_scores_gemma":[0.000017205113,0.00037905513,0.00035392106,0.000111856476,0.00050177966,0.000054656255,0.00011051277,0.00070415967,0.0002874471],"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.000017960096,0.000008483852,0.000006485744,0.0004438229,0.00038063913,0.000027309969,0.00037448714,0.000013883928,0.000037402257,0.98899627,0.007398059,0.0022951902],"study_design_scores_gemma":[0.000211993,0.00006560837,0.000010602057,0.00030467223,0.00027271587,0.000120327575,0.00018164174,0.0033223752,0.000020200774,0.81157947,0.18331018,0.0006001999],"about_ca_topic_score_codex":0.000002830871,"about_ca_topic_score_gemma":0.00003239367,"teacher_disagreement_score":0.9369477,"about_ca_system_score_codex":0.000021081436,"about_ca_system_score_gemma":0.0000129176915,"threshold_uncertainty_score":0.9998661},"labels":[],"label_agreement":null},{"id":"W4234676776","doi":"10.37236/997","title":"Small Forbidden Configurations III","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Mathematics; Matrix (chemical analysis); Forb; Permutation (music); Physics","score_opus":0.008252513326393115,"score_gpt":0.19585237267408728,"score_spread":0.18759985934769416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234676776","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.8323086,0.0068317493,0.13843495,0.00013850276,0.0016528564,0.00014392905,5.620199e-7,0.00007191121,0.02041694],"genre_scores_gemma":[0.99933016,0.00021619964,0.0000033366634,0.000020575479,0.00013774604,9.849754e-7,3.924802e-7,0.00001753732,0.0002730652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898493,0.00004243449,0.00036650285,0.00003867791,0.00016630073,0.00040117017],"domain_scores_gemma":[0.9994084,0.00015163037,0.00011632641,0.00015523599,0.000107755746,0.00006059965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017493193,0.00009926141,0.00016083442,0.000091254435,0.00009501287,0.000023065344,0.00032320226,0.00005505919,0.0000141093],"category_scores_gemma":[0.000020252595,0.00007034119,0.00010330859,0.00026863947,0.000028081313,0.00007761039,0.000007812162,0.00051646604,0.0000091437105],"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.000021129137,0.000021223623,0.00003701932,0.000008206264,0.000104525796,0.000006857009,0.0003904318,0.00044582627,0.0022820826,0.99565476,0.00046524304,0.00056266406],"study_design_scores_gemma":[0.0012831633,0.00037856871,0.00052598736,0.00003853101,0.00009928784,0.0006297068,0.00091284985,0.0004422856,0.01626085,0.9430507,0.03614886,0.000229242],"about_ca_topic_score_codex":0.0000019896358,"about_ca_topic_score_gemma":0.000012936865,"teacher_disagreement_score":0.16702157,"about_ca_system_score_codex":0.00014236716,"about_ca_system_score_gemma":0.000068724694,"threshold_uncertainty_score":0.28684306},"labels":[],"label_agreement":null},{"id":"W4235291268","doi":"10.22215/etd/2018-13204","title":"Properties of Interleaved Sequences Created from M-Sequences","year":2018,"lang":"en","type":"dissertation","venue":"","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":"Palindrome; Sequence (biology); Mathematics; Base (topology); Combinatorics; Tuple; Complementary sequences; Equivalence (formal languages); Discrete mathematics; Genetics; Biology; Mathematical analysis","score_opus":0.014969478804461374,"score_gpt":0.20606207056435963,"score_spread":0.19109259175989826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235291268","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.9485109,0.001855588,0.00002611998,0.000001502185,0.0013954674,0.00016856362,0.000028110971,0.00027451865,0.047739223],"genre_scores_gemma":[0.99430704,0.000073579555,0.000112858696,0.0000033996625,0.00011552167,0.00003694362,0.00025576487,0.000035375102,0.0050595133],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990463,0.00004598267,0.0004046565,0.0001911716,0.00016063964,0.00015121717],"domain_scores_gemma":[0.99952567,0.000019885485,0.00009519693,0.000217683,0.00010407203,0.000037500366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010004265,0.00024718815,0.00038426864,0.00012021251,0.00003600659,0.0000348145,0.00028431008,0.00025545259,0.0006494163],"category_scores_gemma":[0.000018724199,0.00018279467,0.00010232652,0.00012829046,0.00008398637,0.000109898065,0.000005716667,0.00012577215,0.00008569174],"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.00019457938,0.000032706517,0.00029042535,0.001865214,0.0009294477,0.000008640255,0.0177919,0.00011456602,0.97262037,0.0018714317,0.0017450937,0.0025356058],"study_design_scores_gemma":[0.00010863549,0.00006937333,0.00026655025,0.0015977443,0.00006999013,0.000001319381,0.0115059,0.00068153423,0.98235244,0.0024992703,0.0004807441,0.0003665149],"about_ca_topic_score_codex":0.0010009906,"about_ca_topic_score_gemma":0.0012221654,"teacher_disagreement_score":0.045796137,"about_ca_system_score_codex":0.000018257437,"about_ca_system_score_gemma":0.000026048252,"threshold_uncertainty_score":0.745415},"labels":[],"label_agreement":null},{"id":"W4237114245","doi":"10.4153/s0008439518000140","title":"Tits Triangles","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unicode; Mathematics; Combinatorics; Vertex (graph theory); Rank (graph theory); Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.00678503187890921,"score_gpt":0.1719346801781578,"score_spread":0.16514964829924858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237114245","genre_codex":"other","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.1954852,0.00018364674,0.0021558374,0.0009502798,0.000521746,0.00024598272,0.000022785767,0.0003489923,0.80008554],"genre_scores_gemma":[0.99637514,0.0000013947564,0.00027008168,0.00020808096,0.00023039957,0.000015419368,0.000002043962,0.000025962383,0.0028714999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936986,0.000020659454,0.0001516989,0.00009172036,0.00006991351,0.00029616203],"domain_scores_gemma":[0.9993717,0.000048870108,0.000008110282,0.00019536573,0.000023133542,0.00035279515],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017228778,0.0000995782,0.00013299347,0.00008335501,0.00006755257,0.00003221978,0.0001365548,0.000075743745,0.022525165],"category_scores_gemma":[0.00007066544,0.00009228987,0.000043674903,0.000099943216,0.000081553386,0.0000129304335,0.0000052749906,0.00007316924,0.059479184],"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.000005732364,0.000017809034,0.000031267773,0.00025267308,0.00007277853,0.00006838003,0.0009246523,0.000021124442,0.0005698633,0.5961421,0.39760616,0.004287436],"study_design_scores_gemma":[0.00018454429,0.00003192506,0.000055740824,0.00008299036,0.000011494159,0.00003705401,0.00012227171,0.0011591235,0.001009566,0.04329739,0.95376414,0.00024375728],"about_ca_topic_score_codex":0.00009845507,"about_ca_topic_score_gemma":0.000746204,"teacher_disagreement_score":0.8008899,"about_ca_system_score_codex":0.00004449225,"about_ca_system_score_gemma":0.00002071957,"threshold_uncertainty_score":0.9783684},"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":"W4239989114","doi":"10.1007/978-1-4614-4325-4_1","title":"Introduction","year":2012,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Block (permutation group theory); Computer science; Focus (optics); Subject (documents); Context (archaeology); Mathematics; Combinatorics; Geography; Library science; Physics","score_opus":0.01328876068628785,"score_gpt":0.18842094196614828,"score_spread":0.17513218127986044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239989114","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.0001317693,0.002041493,0.0009345892,0.000012336041,0.0013497443,0.00025082892,0.000007704407,0.0002667688,0.9950048],"genre_scores_gemma":[0.013706226,0.00026859975,0.001632039,0.000012249001,0.002817638,0.000039975395,0.000028642628,0.0002754886,0.9812191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999095,0.000006382864,0.00040869322,0.00013347452,0.0001456799,0.0002107523],"domain_scores_gemma":[0.9993751,0.000032853848,0.000075268064,0.0004475041,0.000017356062,0.000051931023],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002829,0.00027769431,0.00037302758,0.00016958079,0.000021216301,0.000019446286,0.00014886541,0.00030962523,0.0006106688],"category_scores_gemma":[0.000009768724,0.00028098814,0.00009548654,0.00001730686,0.000045669174,0.000059404098,0.000023148685,0.00037965094,0.00083182217],"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.0000010408478,0.000009528438,0.0000011774046,0.0008459323,0.000047684665,0.0000044073927,0.0006929661,0.00013694755,0.00012710236,0.9887204,0.007609531,0.0018032633],"study_design_scores_gemma":[0.000092306545,0.0000093828885,0.0000013298501,0.00037889328,0.000048521993,0.00003886045,0.000046847385,0.0005757796,0.00020115475,0.4635733,0.5346314,0.0004022509],"about_ca_topic_score_codex":2.04349e-7,"about_ca_topic_score_gemma":0.0000018996918,"teacher_disagreement_score":0.5270218,"about_ca_system_score_codex":0.00007971487,"about_ca_system_score_gemma":0.0000058064666,"threshold_uncertainty_score":0.99996424},"labels":[],"label_agreement":null},{"id":"W4240403405","doi":"10.1007/978-1-4614-4325-4_2","title":"Background","year":2012,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"","keywords":"Mathematical proof; Computer science; Graph theory; Theoretical computer science; Combinatorial design; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.030720597759030407,"score_gpt":0.21653837882131513,"score_spread":0.18581778106228472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240403405","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.0002929498,0.0032454291,0.0007021939,0.0000020329558,0.00066896214,0.0002591993,0.000014008672,0.00023720463,0.994578],"genre_scores_gemma":[0.03144225,0.00029365218,0.0019283466,0.00002334285,0.00055141444,0.000042922617,0.000022053493,0.0003695862,0.9653264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988948,0.0000070801493,0.0004885469,0.00013825459,0.00018232832,0.00028900366],"domain_scores_gemma":[0.9992251,0.000078208424,0.00008303332,0.0005168684,0.000016575344,0.00008024821],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029315383,0.00036366037,0.0004914944,0.00016467694,0.000024884303,0.000031212574,0.00024155572,0.00039966853,0.0005849557],"category_scores_gemma":[0.000004668841,0.00036369215,0.00013610654,0.000017512593,0.000061715415,0.00006318075,0.0000384408,0.0004311383,0.0011246162],"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":[8.6056315e-7,0.000010508595,0.0000021581097,0.0010705477,0.00006107599,0.000013346937,0.0006615217,0.0000469036,0.00004921726,0.99544847,0.0016945197,0.00094089506],"study_design_scores_gemma":[0.00016373702,0.000012003048,0.000002755838,0.0011586064,0.00006563051,0.00004523301,0.0001099034,0.00067941664,0.00007997342,0.70343727,0.2935956,0.00064983574],"about_ca_topic_score_codex":3.784765e-7,"about_ca_topic_score_gemma":0.0000041850853,"teacher_disagreement_score":0.29201114,"about_ca_system_score_codex":0.000085814216,"about_ca_system_score_gemma":0.000009155474,"threshold_uncertainty_score":0.9998815},"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":"W4242555413","doi":"10.1007/978-1-4939-7131-2_100580","title":"k-Shell Decomposition","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Decomposition; Shell (structure); Materials science; Chemistry; Composite material; Organic chemistry","score_opus":0.007679540739184541,"score_gpt":0.19200845175560685,"score_spread":0.18432891101642232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242555413","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.00012702536,0.00028931306,0.0010200272,0.000002011242,0.00082101166,0.00011868045,0.000009483619,0.000443781,0.99716866],"genre_scores_gemma":[0.025641585,0.000053147327,0.00012581596,0.00003144883,0.00048998836,0.000008966516,0.000039700062,0.00007663304,0.97353274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995746,0.0000029717642,0.00014345362,0.00010891101,0.00007175675,0.0000982939],"domain_scores_gemma":[0.9997102,0.000011136504,0.000016769252,0.00020098194,0.000018924486,0.000042015392],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000504466,0.00016918598,0.0001527351,0.00007148709,0.000022944834,0.000017206696,0.000085732914,0.00021547533,0.0075785723],"category_scores_gemma":[3.494518e-7,0.0001597094,0.00008797209,0.000007208816,0.000024686935,0.00003198981,0.0000097269985,0.00010909557,0.005243099],"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.0000054303464,0.0000029368769,9.363631e-7,0.000172647,0.00015985081,0.000012724123,0.000080547536,0.00008390705,0.00081859756,0.9034346,0.092677474,0.0025503507],"study_design_scores_gemma":[0.00006396724,0.000025936855,0.0000014101981,0.00012727844,0.00002535984,0.000018076778,0.0000043760374,0.0003753597,0.00081642147,0.09031866,0.9079256,0.0002975592],"about_ca_topic_score_codex":6.8604453e-7,"about_ca_topic_score_gemma":0.0000053118333,"teacher_disagreement_score":0.81524813,"about_ca_system_score_codex":0.000021745393,"about_ca_system_score_gemma":0.0000025098589,"threshold_uncertainty_score":0.99553144},"labels":[],"label_agreement":null},{"id":"W4244155401","doi":"10.1145/1466390.1466393","title":"Combinatorial designs","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"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":"Citation; Computer science; World Wide Web; Information retrieval","score_opus":0.033454250736503946,"score_gpt":0.21741172163611278,"score_spread":0.18395747089960884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244155401","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.96784467,0.00023443285,0.00050931034,0.000027436165,0.0025121742,0.0001256116,0.0000024782312,0.0004662582,0.02827766],"genre_scores_gemma":[0.99930096,0.000038508806,0.00009575101,0.000039661445,0.0002977763,0.000013668741,0.0000032309576,0.000026104557,0.00018431531],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994244,0.000034469216,0.00014257494,0.00009846012,0.00010193481,0.00019819215],"domain_scores_gemma":[0.999407,0.000088652494,0.000014852035,0.00040083492,0.000011905858,0.00007674949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073860465,0.000113352864,0.00014100385,0.000043995136,0.00007947823,0.000011678348,0.00025293184,0.000074749354,0.00009847077],"category_scores_gemma":[0.000050891107,0.000109237786,0.00006550238,0.00013082221,0.000027681379,0.00009964913,0.000021227897,0.00011135366,0.00035819775],"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.00022740262,0.00041728053,0.049486857,0.00034946535,0.0007041059,0.00084606383,0.011995446,0.0064289714,0.29885358,0.25482294,0.35772148,0.01814641],"study_design_scores_gemma":[0.005506487,0.00051825366,0.014854921,0.00012359701,0.00008708408,0.00052884355,0.0007762448,0.0016329314,0.18184511,0.14901292,0.64272946,0.0023841383],"about_ca_topic_score_codex":0.000018192359,"about_ca_topic_score_gemma":0.0000028367128,"teacher_disagreement_score":0.28500795,"about_ca_system_score_codex":0.000019019877,"about_ca_system_score_gemma":0.000009722605,"threshold_uncertainty_score":0.4604027},"labels":[],"label_agreement":null},{"id":"W4244929336","doi":"10.23952/jano.2.2020.3.06","title":"The S-iterative techniques on Hadamard manifolds and applications","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.005057722705793437,"score_gpt":0.18895287439820238,"score_spread":0.18389515169240894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244929336","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.0021382016,0.00042127777,0.98598784,0.00084591797,0.00004753246,0.00025535474,0.0000028193567,0.00006912218,0.010231941],"genre_scores_gemma":[0.9948866,0.0004153953,0.004308506,0.00020047069,0.00015806533,0.000014466148,0.000001220602,0.0000106937505,0.0000046082037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996175,0.000012444578,0.0001818012,0.000054135315,0.00007551373,0.000058571575],"domain_scores_gemma":[0.9997441,0.000059608923,0.00006496874,0.000037538182,0.000026001138,0.0000677881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008887663,0.00006768485,0.00010845944,0.000022383523,0.000092990675,0.000053530013,0.00004881837,0.00003418367,0.0000031376294],"category_scores_gemma":[0.0000047065387,0.000044306627,0.00002010726,0.000092263916,0.000026221156,0.000050304305,0.000007694157,0.00010981106,8.600363e-7],"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.00058126124,0.000065163236,0.00008581838,0.00011630514,0.00022207866,0.0000064436613,0.0021228604,0.5730109,0.0066615716,0.20832957,0.0025798376,0.20621814],"study_design_scores_gemma":[0.0018028823,0.0015811601,0.0006233214,0.00013961627,0.000187704,0.00012564175,0.0015956833,0.72705126,0.022747777,0.020092065,0.22317532,0.00087757345],"about_ca_topic_score_codex":9.3449195e-8,"about_ca_topic_score_gemma":1.6807322e-8,"teacher_disagreement_score":0.9927484,"about_ca_system_score_codex":0.000007090333,"about_ca_system_score_gemma":0.0000030935207,"threshold_uncertainty_score":0.18067719},"labels":[],"label_agreement":null},{"id":"W4245052140","doi":"10.1109/isit.1994.394681","title":"On the trellis structure of block codes","year":2002,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Trellis (graph); Block (permutation group theory); Code (set theory); Computer science; Discrete mathematics; Algorithm; Mathematics; Combinatorics; Theoretical computer science; Decoding methods; Programming language","score_opus":0.007217360500899943,"score_gpt":0.15573024311564818,"score_spread":0.14851288261474824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245052140","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.9254336,0.00013830523,0.000046458983,0.000034316407,0.0001082298,0.000045760604,0.000007721891,0.000065690656,0.07411996],"genre_scores_gemma":[0.999071,0.0000075970597,0.000009649438,0.00002697062,0.000017175678,8.1711835e-7,2.608814e-7,0.0000061301243,0.0008603774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977684,0.000013266689,0.00006657882,0.000034473134,0.00004983668,0.00005900193],"domain_scores_gemma":[0.9997836,0.00005928629,0.000007157481,0.00013313195,0.0000050864955,0.000011761992],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000022603903,0.000048276743,0.0000588232,0.000016400769,0.000016663658,0.000004690598,0.00007122591,0.000027220209,0.0012942777],"category_scores_gemma":[0.000004285861,0.000026745527,0.000027731896,0.00006306432,0.00001447112,0.000010875794,0.0000025349068,0.00004836618,0.000032928834],"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.0000056821323,0.000026856746,0.00022744738,0.00008721298,0.00012319387,0.000002160059,0.0017123958,0.037404604,0.07240862,0.8263717,0.0600644,0.0015656966],"study_design_scores_gemma":[0.0006848855,0.00019910854,0.0010895653,0.00013605908,0.000050731716,0.00003177598,0.0013456903,0.10832668,0.78772753,0.06620027,0.033576764,0.0006309506],"about_ca_topic_score_codex":0.0000028381642,"about_ca_topic_score_gemma":0.000006059885,"teacher_disagreement_score":0.7601715,"about_ca_system_score_codex":0.0000023658918,"about_ca_system_score_gemma":2.2234036e-7,"threshold_uncertainty_score":0.99961865},"labels":[],"label_agreement":null},{"id":"W4245144801","doi":"10.1007/s11786-018-0388-7","title":"Foreword","year":2018,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.01225182957901668,"score_gpt":0.22252371470536159,"score_spread":0.2102718851263449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245144801","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.42446274,0.000009374078,0.5709283,0.0000055295172,0.00066501007,0.000051150935,4.978816e-7,0.000082867766,0.0037945453],"genre_scores_gemma":[0.93362963,5.429046e-7,0.06622664,0.00001949475,0.00009728126,0.00000365226,5.8429823e-8,0.000005568867,0.000017150882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942434,0.000004650568,0.00013615158,0.00010440394,0.00014211383,0.00018834023],"domain_scores_gemma":[0.99964964,0.000031160806,0.000012151068,0.0002456689,0.00002533393,0.000036025383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141837,0.000060888622,0.00007961805,0.000119548335,0.000053486194,0.000040642008,0.0003743796,0.000018267423,0.000012728994],"category_scores_gemma":[0.000008350285,0.00005356875,0.000014136984,0.0005135898,0.00022562327,0.00012343329,0.000055082248,0.000048179627,0.00011035889],"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.000003510128,0.00022407855,0.0018591174,0.0006900394,0.000021680302,0.00003142534,0.033979718,0.016704587,0.012406025,0.79507065,0.0024053706,0.13660379],"study_design_scores_gemma":[0.00005240468,0.000020644411,0.00031173913,0.000060510913,5.617899e-7,0.000012181957,0.000019063516,0.94467425,0.0038896166,0.050703008,0.00017169733,0.00008433735],"about_ca_topic_score_codex":5.2093117e-7,"about_ca_topic_score_gemma":0.000004109105,"teacher_disagreement_score":0.92796963,"about_ca_system_score_codex":0.000021811558,"about_ca_system_score_gemma":0.000007945797,"threshold_uncertainty_score":0.21844701},"labels":[],"label_agreement":null},{"id":"W4245416987","doi":"10.1002/net.20119","title":"Fault‐tolerant routings with minimum optical index","year":2006,"lang":"en","type":"article","venue":"Networks","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 Waterloo","funders":"","keywords":"Computer science; Fault tolerance; Graph; Construct (python library); Context (archaeology); Directed graph; Property (philosophy); Mathematics; Combinatorics; Algorithm; Theoretical computer science; Distributed computing; Computer network","score_opus":0.0022790414841768387,"score_gpt":0.15247128549506406,"score_spread":0.1501922440108872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245416987","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.8345331,0.0005449635,0.103671476,0.000021067133,0.00049144827,0.00014853525,0.0000012379427,0.0004773923,0.06011077],"genre_scores_gemma":[0.99899536,0.0000024920164,0.00012972266,0.00003060705,0.00048338433,0.000014600728,0.000006977655,0.000032589745,0.00030423325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992631,0.000015267855,0.0001673825,0.00013127732,0.00011120854,0.0003117652],"domain_scores_gemma":[0.9997077,0.000037479214,0.000017553559,0.00016631937,0.000016047703,0.00005487391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001058065,0.00014031953,0.00015592805,0.000030649288,0.000049629372,0.000038544593,0.000098098535,0.000121807134,0.000029098861],"category_scores_gemma":[0.0000012926902,0.00011447517,0.00004158622,0.00015998821,0.000038535414,0.00005418867,0.0000099946255,0.00020629456,0.000023235973],"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.00003172724,0.00002019093,0.005452085,0.000021883474,0.000030596904,0.000034680346,0.00006405059,0.979857,0.00013888536,0.006997321,0.0056902478,0.0016612897],"study_design_scores_gemma":[0.00073252455,0.00005925608,0.012015702,0.00011792653,0.000025097339,0.00006305514,0.0000841774,0.97602904,0.00024291455,0.00059125485,0.009631994,0.00040702848],"about_ca_topic_score_codex":0.000017843338,"about_ca_topic_score_gemma":0.000030517782,"teacher_disagreement_score":0.16446228,"about_ca_system_score_codex":0.000016060492,"about_ca_system_score_gemma":0.0000034732423,"threshold_uncertainty_score":0.46681622},"labels":[],"label_agreement":null},{"id":"W4245559008","doi":"10.22215/etd/2021-14520","title":"Single and Double Change Covering Design","year":2021,"lang":"en","type":"dissertation","venue":"","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":"Mitacs","keywords":"Recursion (computer science); Block (permutation group theory); Set (abstract data type); Algebraic number; Sequence (biology); Combinatorics; Mathematics; Discrete mathematics; Computer science; Algorithm; Chemistry; Mathematical analysis","score_opus":0.04193609077388514,"score_gpt":0.21865708707474377,"score_spread":0.17672099630085863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245559008","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.645129,0.02427569,0.0040480825,0.0000072755556,0.005729946,0.00094948476,0.000010265485,0.0010598459,0.31879038],"genre_scores_gemma":[0.9860296,0.00022027166,0.00025930727,0.000012244137,0.0001740975,0.00010353156,0.00018710982,0.00006579988,0.0129480325],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953604,0.000013466111,0.0001170913,0.00013342794,0.000068999805,0.00013099631],"domain_scores_gemma":[0.99978983,0.000020119918,0.000017580207,0.00011379642,0.00001827918,0.000040363157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070050104,0.0001524465,0.00018079465,0.000062016,0.000033259574,0.000063151965,0.000047559035,0.00015862385,0.00013173172],"category_scores_gemma":[0.0000020154787,0.00015800375,0.000036108137,0.00008273525,0.0000039640568,0.00008299654,0.0000048178345,0.00009874044,0.000015604284],"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.00070118374,0.00030035398,0.00043001206,0.023658257,0.0022478758,0.0004976297,0.058314804,0.00539283,0.65095073,0.07556916,0.014345655,0.16759148],"study_design_scores_gemma":[0.002665294,0.00024204703,0.001556294,0.0031970826,0.00035019367,0.00010688556,0.018659402,0.008709394,0.8953565,0.00293825,0.06268408,0.0035346195],"about_ca_topic_score_codex":0.000024901174,"about_ca_topic_score_gemma":0.00009833186,"teacher_disagreement_score":0.34090057,"about_ca_system_score_codex":0.000015738533,"about_ca_system_score_gemma":0.000004746969,"threshold_uncertainty_score":0.6443206},"labels":[],"label_agreement":null},{"id":"W4247953588","doi":"10.1007/978-0-387-39940-9_2097","title":"Autonomous Message Queuing Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Computer network","score_opus":0.009111518141385085,"score_gpt":0.19581204421812184,"score_spread":0.18670052607673676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247953588","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.00018880113,0.03393412,0.000746172,0.0000036473741,0.0101598045,0.0013642625,0.0023671698,0.0008516078,0.95038444],"genre_scores_gemma":[0.089343704,0.007100996,0.00012268589,0.000012121417,0.0031672865,0.00018825526,0.0019372843,0.00059947005,0.8975282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960024,0.000114873656,0.0018136088,0.00069255603,0.0007449287,0.00063166354],"domain_scores_gemma":[0.9970093,0.00019067198,0.0005959828,0.0017640296,0.00013725454,0.00030277588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009101238,0.0010071057,0.0017389245,0.0005650806,0.00010106424,0.000095545,0.00076172693,0.0007182136,0.00011986144],"category_scores_gemma":[0.000028577626,0.0010256157,0.00036096407,0.000114359675,0.00010209877,0.000351366,0.0000940565,0.00078969524,0.00041721424],"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.000050182887,0.000084417385,0.000039577542,0.016635776,0.0015873759,0.00081464497,0.00083494605,0.02195919,0.00081968703,0.8320938,0.11858732,0.0064930804],"study_design_scores_gemma":[0.00037452334,0.00007435533,0.0000041511544,0.0045451494,0.0002328054,0.00015570507,0.00017080235,0.0028234941,0.000034455534,0.00033166417,0.9900696,0.0011832754],"about_ca_topic_score_codex":0.00016548442,"about_ca_topic_score_gemma":0.000018646873,"teacher_disagreement_score":0.8714823,"about_ca_system_score_codex":0.00019871074,"about_ca_system_score_gemma":0.00010420609,"threshold_uncertainty_score":0.9992194},"labels":[],"label_agreement":null},{"id":"W4248175530","doi":"10.1007/978-1-4757-3542-0_31","title":"Minimal decompositions","year":2001,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Simon Fraser University; Western University","funders":"","keywords":"Reflection (computer programming); Mathematics; Calculus (dental); Computer science; Pure mathematics; Algebra over a field; Programming language","score_opus":0.016689895330028952,"score_gpt":0.2118106722641509,"score_spread":0.19512077693412194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248175530","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.00040125975,0.0006658468,0.0015776933,0.0000055902337,0.0003566839,0.00026112815,0.000027690345,0.00026039247,0.9964437],"genre_scores_gemma":[0.027958876,0.000265698,0.005415296,0.000037244437,0.00040812982,0.00007947937,0.00005568381,0.00037484374,0.96540475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894273,0.0000066392276,0.0005087693,0.00015934565,0.00015482209,0.00022770041],"domain_scores_gemma":[0.9993376,0.00008337328,0.00007259932,0.0004197329,0.000020135842,0.00006654912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001473911,0.00032789423,0.00044346653,0.00021769005,0.000038439473,0.000032863783,0.00022665756,0.0003249229,0.0004326034],"category_scores_gemma":[0.000005582417,0.0003489306,0.00015221507,0.000025009242,0.000062079125,0.000038961694,0.000029464329,0.00037652778,0.0004669989],"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.0000017350916,0.000019254398,0.0000024044973,0.00057968457,0.00007403001,0.0000835873,0.0005860461,0.00031254967,0.00010632357,0.99466944,0.003139995,0.00042497428],"study_design_scores_gemma":[0.00021645482,0.000026272603,0.0000026781736,0.0015103923,0.0000716254,0.00014181025,0.00008063751,0.0031581786,0.00009562323,0.8152671,0.17879178,0.0006374649],"about_ca_topic_score_codex":4.1443258e-7,"about_ca_topic_score_gemma":0.000008516844,"teacher_disagreement_score":0.17940232,"about_ca_system_score_codex":0.00007530203,"about_ca_system_score_gemma":0.000011487304,"threshold_uncertainty_score":0.9998963},"labels":[],"label_agreement":null},{"id":"W4249447895","doi":"10.1090/car/036/13","title":"(7,3,1) and combinatorics","year":2020,"lang":"en","type":"book-chapter","venue":"˜The œCarus mathematical monographs","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Combinatorics; Algebraic combinatorics; Mathematics","score_opus":0.012524748446257818,"score_gpt":0.18180156634746608,"score_spread":0.16927681790120827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249447895","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003634178,0.004221275,0.0019926426,0.000102025755,0.0005327648,0.0006604914,0.000057954683,0.0007145955,0.9913548],"genre_scores_gemma":[0.9454187,0.00075538957,0.00024615932,0.00021557324,0.00030140486,0.00011757129,0.00003198719,0.0004122325,0.052500945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986343,0.000024993315,0.00048052683,0.00028831698,0.00029259163,0.00027927774],"domain_scores_gemma":[0.99887496,0.00025671363,0.00008172733,0.0005365765,0.000030468454,0.00021956865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021051028,0.0004943302,0.00063819415,0.000118461154,0.00011914296,0.00009180595,0.0003587814,0.00037256684,0.00013388853],"category_scores_gemma":[0.000008287052,0.00036852452,0.00029886188,0.00009393039,0.00024651547,0.0000444506,0.00009075086,0.000659729,0.00036910299],"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.000004575123,0.000008544376,0.0000026903128,0.000568776,0.00022369996,0.00002001813,0.0003041729,0.000005117269,0.000011163026,0.99472076,0.003117631,0.0010128398],"study_design_scores_gemma":[0.00015697227,0.00004715626,0.0000034977654,0.00019765153,0.00016173172,0.00004425573,0.000054943856,0.0015697596,0.000012314106,0.91673726,0.08060268,0.0004117636],"about_ca_topic_score_codex":5.864378e-7,"about_ca_topic_score_gemma":0.0000013504603,"teacher_disagreement_score":0.9450553,"about_ca_system_score_codex":0.000018618686,"about_ca_system_score_gemma":0.000007692665,"threshold_uncertainty_score":0.9998767},"labels":[],"label_agreement":null},{"id":"W4249666710","doi":"10.1109/isias.2007.4299821","title":"A novel anti-collusion coding scheme tailored to track linear collusions","year":2007,"lang":"en","type":"article","venue":"","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":"Computer science; Binary number; Algorithm; Discrete mathematics; Mathematics; Arithmetic","score_opus":0.01572073622864322,"score_gpt":0.23481473298410396,"score_spread":0.21909399675546073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249666710","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.79176927,0.00003610454,0.18730286,0.000049812115,0.00058256485,0.00031848458,0.000007949274,0.0005752694,0.019357694],"genre_scores_gemma":[0.9901445,0.000005369231,0.008559993,0.00012838497,0.00014762423,0.000009163175,0.0000044502194,0.000035360987,0.0009651446],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989831,0.000009218568,0.00029630313,0.00017761481,0.00016963304,0.00036412486],"domain_scores_gemma":[0.9994357,0.000067293244,0.000018648541,0.00023262354,0.00004298663,0.00020273562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005073991,0.00015979986,0.00019439908,0.00018968536,0.00015124425,0.000025270414,0.00015897168,0.00010872197,0.00017455903],"category_scores_gemma":[0.000037720725,0.00014884352,0.00007588195,0.00060524466,0.00001723263,0.00009332323,0.0000494832,0.00012725842,0.00026124992],"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.000019390895,0.00004858659,0.0002628306,0.000041164676,0.000024771845,0.000011607451,0.00055381155,0.0036712058,0.9823231,0.010925235,0.0016541261,0.0004641817],"study_design_scores_gemma":[0.0038860193,0.00029943205,0.017792217,0.0006194895,0.00006610603,0.00017895488,0.004634452,0.18410562,0.65024817,0.00044436887,0.13543154,0.0022935984],"about_ca_topic_score_codex":0.000018558092,"about_ca_topic_score_gemma":0.00006413421,"teacher_disagreement_score":0.3320749,"about_ca_system_score_codex":0.00004537807,"about_ca_system_score_gemma":0.000009017389,"threshold_uncertainty_score":0.60696626},"labels":[],"label_agreement":null},{"id":"W4250156082","doi":"10.1090/fic/037/05","title":"Indivisibility and divisbility polytopes","year":2003,"lang":"en","type":"other","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Computer science; Art; Mathematics","score_opus":0.0040846940350589625,"score_gpt":0.17152183243320293,"score_spread":0.16743713839814398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250156082","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.002361261,0.002540984,0.000439611,0.0000034061582,0.00041974857,0.00020117678,0.000032932636,0.0007023849,0.9932985],"genre_scores_gemma":[0.297495,0.000135825,0.00019875856,0.000032443717,0.00009847108,0.000019912051,0.000009730354,0.00035812354,0.7016517],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940056,0.000046485216,0.0001263893,0.0002027759,0.000071886185,0.00015192105],"domain_scores_gemma":[0.9995572,0.00001834638,0.000018322122,0.00033793467,0.0000034463333,0.000064724045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017717811,0.00019310306,0.00024338244,0.00007915181,0.000013866754,0.00002121258,0.000078300436,0.00021490217,0.0029662275],"category_scores_gemma":[0.000008545487,0.00016357818,0.000042980326,0.00006621686,0.000052871233,0.000019225256,0.000015685735,0.00012221588,0.00008664195],"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.0000028361112,0.00004790756,0.014643625,0.0015790701,0.00029641736,0.000005706701,0.00024969742,0.0000074957275,0.000072290066,0.016462233,0.9581368,0.008495927],"study_design_scores_gemma":[0.0001758843,0.000013573695,0.0024694696,0.00008442434,0.000023560475,0.0000062860827,0.000062086474,0.000044388362,0.00014444401,0.0026998476,0.9938067,0.00046933666],"about_ca_topic_score_codex":0.000049318533,"about_ca_topic_score_gemma":0.000089962065,"teacher_disagreement_score":0.29513377,"about_ca_system_score_codex":0.000009988294,"about_ca_system_score_gemma":0.0000037300674,"threshold_uncertainty_score":0.9979452},"labels":[],"label_agreement":null},{"id":"W4251896413","doi":"10.1002/jgt.20248","title":"On the chromatic spectrum of acyclic decompositions of graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Partition (number theory); Bipartite graph; Spectrum (functional analysis); Graph; Chromatic polynomial; Discrete mathematics","score_opus":0.00556956968964261,"score_gpt":0.2045617445571517,"score_spread":0.1989921748675091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251896413","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.9868899,0.00079247454,0.0054997453,0.000041913852,0.0004690838,0.00009454638,0.000005477578,0.0000181161,0.006188736],"genre_scores_gemma":[0.9997434,0.000059763093,0.00009230522,0.000027495296,0.00004533854,0.0000010005655,3.4379224e-7,0.000018540524,0.000011796739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986589,0.00015639176,0.00071071304,0.00005159242,0.00024523554,0.00017715734],"domain_scores_gemma":[0.998351,0.0009288301,0.00034760492,0.00025315065,0.000054419215,0.00006501912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023096516,0.000127174,0.00031506555,0.00048757158,0.000057496105,0.000007391331,0.00031848368,0.00005912951,0.00009606159],"category_scores_gemma":[0.000050504597,0.00008303861,0.0003815388,0.0004566059,0.00016432902,0.000078609126,0.000009671164,0.00025450205,0.0000040214177],"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.00015427444,0.0001206161,0.00037662897,0.00011574763,0.00039412055,0.000015006859,0.0008105455,0.0012022447,0.06103774,0.9350051,0.0003410417,0.00042687592],"study_design_scores_gemma":[0.0003586763,0.00029393687,0.0074960412,0.00038475782,0.000087097564,0.00013501303,0.00083163934,0.0000388607,0.09013326,0.9000824,0.000050494105,0.00010783556],"about_ca_topic_score_codex":0.0000011533884,"about_ca_topic_score_gemma":0.0000030307592,"teacher_disagreement_score":0.034922764,"about_ca_system_score_codex":0.00001512525,"about_ca_system_score_gemma":0.000009834527,"threshold_uncertainty_score":0.33862165},"labels":[],"label_agreement":null},{"id":"W4253505002","doi":"10.1016/j.jmp.2017.10.003","title":"On Fishburn’s questions about finite two-dimensional additive measurement, II","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematical Psychology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cartesian product; Combinatorics; Order (exchange); Mathematics; Product (mathematics); Sequence (biology); Set (abstract data type); Representation (politics); Discrete mathematics; Finite set; Mathematical analysis; Computer science; Geometry","score_opus":0.040708956094964305,"score_gpt":0.31716307318911463,"score_spread":0.27645411709415035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253505002","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.70424205,0.00072454236,0.03385202,0.003066466,0.006362501,0.00040857436,0.00006158542,0.0001621327,0.25112015],"genre_scores_gemma":[0.9986203,0.0000117238615,0.00071626384,0.00022650267,0.00026466823,0.0000062383456,5.543725e-7,0.00002138438,0.00013237966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872243,0.0000919223,0.0005246876,0.0001052854,0.000343205,0.00021248417],"domain_scores_gemma":[0.9987642,0.00023995327,0.00027541808,0.000395836,0.00018385658,0.00014071718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010310904,0.0001511423,0.00035171362,0.0001259582,0.00024323635,0.000037245354,0.0003547463,0.00010642178,0.0006192417],"category_scores_gemma":[0.00079146994,0.00011784634,0.00016808875,0.000035558394,0.00013116548,0.00013477098,0.000024994364,0.00042360724,0.00021417438],"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.00078906654,0.00251262,0.0001619437,0.00035271054,0.0019363892,0.00073844637,0.0019548675,0.01689151,0.020217573,0.6587527,0.28028983,0.01540239],"study_design_scores_gemma":[0.003636765,0.0011439826,0.0066169216,0.0016401971,0.00015337339,0.0011793011,0.00005017062,0.0037826046,0.0009439888,0.96997464,0.010399194,0.00047885426],"about_ca_topic_score_codex":3.6983735e-7,"about_ca_topic_score_gemma":0.0000015006649,"teacher_disagreement_score":0.311222,"about_ca_system_score_codex":0.000041654715,"about_ca_system_score_gemma":0.000014972781,"threshold_uncertainty_score":0.6780262},"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":"W4280580529","doi":"10.31799/1684-8853-2022-2-2-10","title":"Some new symmetric Hadamard matrices","year":2022,"lang":"en","type":"article","venue":"Information and Control Systems","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Compute Canada","keywords":"Hadamard transform; Mathematics; Combinatorics; Conjecture; Complex Hadamard matrix; Hadamard matrix; Hadamard's maximal determinant problem; Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.0037249913874403484,"score_gpt":0.16035350967793838,"score_spread":0.15662851829049804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280580529","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.6207408,0.14952415,0.059139814,0.0010437738,0.0297831,0.006142115,0.000692077,0.005418507,0.12751572],"genre_scores_gemma":[0.99928284,0.000057648867,0.0000032782289,0.00014051041,0.00015710916,0.00009565308,0.000012806918,0.0000074981294,0.00024264037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991847,0.00005160903,0.00034959038,0.000050335104,0.00021163857,0.00015211912],"domain_scores_gemma":[0.999665,0.000043108,0.00007605626,0.00011339132,0.000017185528,0.00008526213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312689,0.00009972681,0.00016952534,0.0002776074,0.00016076134,0.00014740709,0.0001067831,0.00003309734,0.00002809179],"category_scores_gemma":[0.000008122498,0.000096212774,0.000040417057,0.00028008482,0.000006711603,0.00073097815,0.00001677359,0.00010570716,0.00007337016],"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.00013015162,0.000026464506,0.0019412398,0.0010997789,0.00041846826,0.0000082761735,0.0038627898,0.29267257,0.00050318916,0.59717745,0.050325915,0.051833678],"study_design_scores_gemma":[0.0021062214,0.00007725894,0.0006337665,0.000020408592,0.000029206309,0.000102613005,0.0025336,0.24243973,0.000014350556,0.00070421695,0.75104344,0.00029519256],"about_ca_topic_score_codex":0.00009864257,"about_ca_topic_score_gemma":6.5026944e-7,"teacher_disagreement_score":0.7007175,"about_ca_system_score_codex":0.000042513257,"about_ca_system_score_gemma":0.0000146128805,"threshold_uncertainty_score":0.39234433},"labels":[],"label_agreement":null},{"id":"W4283376037","doi":"10.1007/s00373-022-02511-0","title":"Constructions of Sarvate-Beam Group Divisible Designs","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Combinatorics; Set (abstract data type); Constant (computer programming); Interval (graph theory); Beam (structure); Block size; Discrete mathematics; Computer science; Physics; Optics","score_opus":0.010082170307835883,"score_gpt":0.1746189271279651,"score_spread":0.1645367568201292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283376037","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.9920967,0.0014865965,0.00050312135,0.000004712839,0.0010929188,0.00011956863,0.000030175039,0.00015473175,0.004511433],"genre_scores_gemma":[0.9997619,0.00008372543,0.000029981285,0.000007212555,0.0000043241957,0.0000414215,0.000006409327,0.000014825772,0.00005024251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941415,0.000036342473,0.0001705953,0.00010267595,0.00013095727,0.00014530799],"domain_scores_gemma":[0.99970764,0.000037703627,0.000032125514,0.00015254425,0.00001808346,0.00005190654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016672103,0.00009543488,0.00015391405,0.00013554224,0.00021574197,0.000009384432,0.00010663853,0.000030008385,0.00004325464],"category_scores_gemma":[0.0000026325247,0.00010402602,0.000059564896,0.0005250739,0.000057299345,0.000053718206,0.00004511745,0.00014010996,0.0000010305013],"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.0000047512135,0.00005071544,0.014279288,0.0000650542,0.00004845996,0.0000030377148,0.00021350305,0.0005371168,0.0019151048,0.98189354,0.00047183115,0.0005175804],"study_design_scores_gemma":[0.0012246951,0.0004344881,0.0091210725,0.000023778071,0.000070078015,0.00010295059,0.0027682383,0.0013945211,0.0036543983,0.9670981,0.013599368,0.00050826464],"about_ca_topic_score_codex":0.000012416024,"about_ca_topic_score_gemma":8.614248e-7,"teacher_disagreement_score":0.01479541,"about_ca_system_score_codex":0.000014277579,"about_ca_system_score_gemma":0.0000053736567,"threshold_uncertainty_score":0.42420578},"labels":[],"label_agreement":null},{"id":"W4283821153","doi":"10.1145/3476446.3536184","title":"Computing a Basis for an Integer Lattice","year":2022,"lang":"en","type":"article","venue":"","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":"Basis (linear algebra); Computer science; Lattice (music); Mathematics; Physics","score_opus":0.01684024685153416,"score_gpt":0.2245051132886127,"score_spread":0.20766486643707854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283821153","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.84248763,0.00009456868,0.10793896,0.000034909168,0.0009975043,0.0002700384,0.000018347077,0.00073739875,0.047420636],"genre_scores_gemma":[0.99862933,1.6034686e-7,0.0008408295,0.00008420873,0.00005024766,0.000032124284,0.0000044817675,0.000015140004,0.00034345427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966264,0.000026994798,0.00008361891,0.000069959075,0.000047054833,0.000109737106],"domain_scores_gemma":[0.9997942,0.00006548833,0.00000703634,0.00009819297,0.0000077977265,0.00002727395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024354628,0.000048426973,0.00006417598,0.00003450568,0.00011117248,0.000013012011,0.000089226145,0.000010969672,0.00023441062],"category_scores_gemma":[0.000005472101,0.000048627477,0.000035848945,0.00008339268,0.000004165386,0.000042271164,0.0000201242,0.000061397455,0.000007233145],"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.00006874772,0.0001564345,0.0013025443,0.00041452915,0.00024639198,0.000007644554,0.010721008,0.32885325,0.014793566,0.58700097,0.024213819,0.032221105],"study_design_scores_gemma":[0.0003481714,0.00016632544,0.00020873196,0.000010213872,0.000018876608,0.000025449586,0.0069141584,0.88941765,0.001794721,0.0038365233,0.09696089,0.00029832244],"about_ca_topic_score_codex":0.000008455555,"about_ca_topic_score_gemma":0.0000051065686,"teacher_disagreement_score":0.5831644,"about_ca_system_score_codex":0.000018048248,"about_ca_system_score_gemma":0.0000023820173,"threshold_uncertainty_score":0.2566632},"labels":[],"label_agreement":null},{"id":"W4287285376","doi":"10.48550/arxiv.2103.01645","title":"Tilted Corners in Integer Grids","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Hungarian Scientific Research Fund","keywords":"Isosceles triangle; Monochromatic color; Vertex (graph theory); Combinatorics; Grid; Integer (computer science); Mathematics; Geometry; Physics; Computer science; Optics; Graph","score_opus":0.04012021127068237,"score_gpt":0.14673450070600483,"score_spread":0.10661428943532246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287285376","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.9750544,0.0002457931,0.008261447,0.0000052147448,0.0014689877,0.00019039473,0.000015717449,0.00034050446,0.014417545],"genre_scores_gemma":[0.998657,0.00018492581,0.000018501018,0.00001783771,0.0000600363,0.0000017358354,0.00005540351,0.000043598488,0.00096097763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987389,0.00012348025,0.00022209331,0.00053889374,0.00005097897,0.00032567538],"domain_scores_gemma":[0.9990822,0.000051410017,0.000054970293,0.0006443808,0.00005295689,0.00011408346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018719623,0.00031844602,0.00040443943,0.00033162747,0.00003312069,0.000050152397,0.00046999048,0.00040560286,0.00017476555],"category_scores_gemma":[0.000016210543,0.0004021081,0.0002091896,0.0006092951,0.000068423265,0.00013039094,0.0002778214,0.0008390254,0.00007621352],"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.000028820108,0.00004855282,0.007648463,0.00034603185,0.00017612892,0.0011007242,0.0005839796,0.96983063,0.00033330548,0.019358791,0.00041778793,0.00012678806],"study_design_scores_gemma":[0.0020500638,0.000055127723,0.009127088,0.001738255,0.0002530534,0.0000328701,0.0058204355,0.95198125,0.0022554244,0.021129416,0.0029585594,0.00259846],"about_ca_topic_score_codex":0.0001194955,"about_ca_topic_score_gemma":0.00022684412,"teacher_disagreement_score":0.023602588,"about_ca_system_score_codex":0.00022537059,"about_ca_system_score_gemma":0.00005307303,"threshold_uncertainty_score":0.99984306},"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":"W4289494340","doi":"10.48550/arxiv.1809.09305","title":"Resolvable Cycle Decompositions of Complete Multigraphs and Complete\\n Equipartite Multigraphs via Layering and Detachment","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Layering; Mathematics; Combinatorics; Biology; Botany","score_opus":0.04705176111859937,"score_gpt":0.178765948847008,"score_spread":0.13171418772840862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289494340","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.96522236,0.0006411931,0.03184326,0.0000050807275,0.00029995912,0.0004081718,0.00018914981,0.00022345185,0.0011673501],"genre_scores_gemma":[0.99870545,0.0002855903,0.000852275,0.0000101012165,0.000036217323,0.000003908357,0.000033670385,0.000038927505,0.00003384185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984857,0.00011750686,0.0003447689,0.00059592957,0.00007638284,0.00037970534],"domain_scores_gemma":[0.9988357,0.00011887426,0.0001521737,0.00059083465,0.000085585925,0.00021686938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022656092,0.00038519513,0.0005407853,0.00037693573,0.00021255859,0.000047845282,0.00031365594,0.00023045321,0.000030146393],"category_scores_gemma":[0.0000057149846,0.0004689185,0.00017239811,0.0002911857,0.00037090085,0.00015286729,0.0004215475,0.00034182746,0.000011266496],"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.0003293288,0.00032254276,0.06064551,0.003946246,0.002134413,0.00022348412,0.0028208417,0.8034758,0.08234086,0.042821005,0.00026409936,0.00067586376],"study_design_scores_gemma":[0.0014307175,0.00013243101,0.016224498,0.00068799907,0.00032606587,0.000029497998,0.00033820435,0.95741546,0.0018245564,0.019912196,0.00073281856,0.0009455274],"about_ca_topic_score_codex":0.000265234,"about_ca_topic_score_gemma":0.00020134439,"teacher_disagreement_score":0.15393968,"about_ca_system_score_codex":0.00004453103,"about_ca_system_score_gemma":0.000010834346,"threshold_uncertainty_score":0.99977624},"labels":[],"label_agreement":null},{"id":"W4292554535","doi":"10.3390/su141610337","title":"New Algorithm for a Fixed Right Shift Code to Support Different Quality of Services in Smart and Sustainable Optical Networks","year":2022,"lang":"en","type":"article","venue":"Sustainability","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":"Royal Military College of Canada","funders":"","keywords":"Computer science; Algorithm; Quality of service; Bit error rate; Computer network; Transmission (telecommunications); Telecommunications; Real-time computing; Channel (broadcasting)","score_opus":0.006204453905818351,"score_gpt":0.24536920654867594,"score_spread":0.23916475264285758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292554535","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.9354934,0.00014611022,0.062063947,0.00021552294,0.00017443181,0.001593525,0.000056264274,0.00009716356,0.00015960481],"genre_scores_gemma":[0.99871343,0.0000013839958,0.00045945446,0.000028081147,0.000035911675,0.00038905957,0.000027033555,0.000023395281,0.00032224678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980562,0.0002214426,0.00054267567,0.00034219978,0.00019593799,0.00064155075],"domain_scores_gemma":[0.99896675,0.00026330102,0.000049499784,0.0003874584,0.00013428589,0.0001986833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017977601,0.00020184997,0.00047158732,0.00012564634,0.00014456973,0.00003043697,0.0002367271,0.00008026601,0.00009003598],"category_scores_gemma":[0.00007174947,0.00020062983,0.00010149754,0.00034962173,0.00004536243,0.00010228297,0.00025111312,0.00021877789,2.1096211e-7],"study_design_candidate":"observational","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.0030778402,0.0014366173,0.26699576,0.021860776,0.0003901615,0.00016888864,0.024061073,0.14662272,0.00016204879,0.4506631,0.0018086421,0.08275238],"study_design_scores_gemma":[0.0061136154,0.0023913784,0.49507517,0.000056070083,0.00010322389,0.000014759153,0.048100457,0.1146806,0.0008615288,0.30853462,0.022448113,0.0016204419],"about_ca_topic_score_codex":0.00064841873,"about_ca_topic_score_gemma":0.0004678852,"teacher_disagreement_score":0.22807942,"about_ca_system_score_codex":0.00053190073,"about_ca_system_score_gemma":0.00010726549,"threshold_uncertainty_score":0.81814474},"labels":[],"label_agreement":null},{"id":"W4292754702","doi":"10.1007/978-3-031-08655-7_35","title":"Weak Hadamard differentiability","year":2022,"lang":"pl","type":"book-chapter","venue":"Monografie matematyczne","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Differentiable function; Hadamard transform; Mathematics; Bounded function; Pure mathematics; Convex function; Limit (mathematics); Mathematical analysis; Regular polygon; Geometry","score_opus":0.014689242755338892,"score_gpt":0.19504345150247943,"score_spread":0.18035420874714053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292754702","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03668637,0.0053702835,0.000701906,0.0003842123,0.010640688,0.0031554184,0.0011371111,0.0021867664,0.93973726],"genre_scores_gemma":[0.8673987,0.0008981234,0.00013235537,0.00007620998,0.0005098556,0.00046381922,0.000520343,0.0006092005,0.1293914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99399656,0.0003248231,0.0020228496,0.0013617019,0.0010643781,0.0012296764],"domain_scores_gemma":[0.9961064,0.0002872684,0.0005506542,0.0024640684,0.00011061869,0.00048098605],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0011995423,0.0017191925,0.0022515336,0.00064331683,0.0006887292,0.00030616552,0.0012630615,0.00093682884,0.041003693],"category_scores_gemma":[0.00003408119,0.001821627,0.0013646228,0.00023450956,0.0002971042,0.00028044573,0.00066857476,0.0019683673,0.0025498895],"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.00023256152,0.00028434017,0.0011587447,0.009908822,0.002395424,0.00024020315,0.0009330535,0.0016130486,0.00090378925,0.97159994,0.0076644304,0.0030656457],"study_design_scores_gemma":[0.0011166382,0.00032988645,0.0012666876,0.0011830472,0.00085995166,0.00013426901,0.00041257875,0.0013448318,0.00048536638,0.0459722,0.9437629,0.0031316665],"about_ca_topic_score_codex":0.00011827513,"about_ca_topic_score_gemma":0.000033529413,"teacher_disagreement_score":0.93609846,"about_ca_system_score_codex":0.0003874744,"about_ca_system_score_gemma":0.00004542143,"threshold_uncertainty_score":0.9995554},"labels":[],"label_agreement":null},{"id":"W4295686006","doi":"10.48550/arxiv.2209.04946","title":"Block colourings of star systems","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Star (game theory); Vertex (graph theory); Block (permutation group theory); Mathematics; Stars; Graph; Order (exchange); Congruence (geometry); Discrete mathematics; Physics; Astrophysics","score_opus":0.03393654231667478,"score_gpt":0.1457726623977268,"score_spread":0.11183612008105201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295686006","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.98589176,0.00046997747,0.00078753754,0.0000018414456,0.0017280625,0.00037134098,0.00013065318,0.00035072767,0.010268091],"genre_scores_gemma":[0.997789,0.00013956611,0.000008871797,0.000002814384,0.00005383417,0.0000033560448,0.000020715515,0.00004500229,0.0019368262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885327,0.00013015173,0.00026284612,0.0004052666,0.0000877776,0.00026070842],"domain_scores_gemma":[0.9989358,0.00006211181,0.0001537741,0.0006929264,0.000055983433,0.00009936123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026079934,0.00027199514,0.00045291768,0.00026183343,0.0000796762,0.000020468287,0.0006544265,0.00022167114,0.00014408852],"category_scores_gemma":[0.000006774593,0.0003521108,0.00022350815,0.00034815335,0.00006596026,0.00006389643,0.00043615882,0.000564248,0.000024750769],"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.000025196658,0.000029457697,0.001033409,0.0009247532,0.0002520205,0.00012815367,0.00022094794,0.95064616,0.0001993917,0.046110876,0.00042505047,0.0000046015643],"study_design_scores_gemma":[0.0018614487,0.00026920636,0.0014625384,0.00092779176,0.0007730346,0.000039017323,0.006209429,0.93186504,0.0013724129,0.016842445,0.03585139,0.0025262416],"about_ca_topic_score_codex":0.00016300811,"about_ca_topic_score_gemma":0.000009078338,"teacher_disagreement_score":0.03542634,"about_ca_system_score_codex":0.00019052412,"about_ca_system_score_gemma":0.00004084766,"threshold_uncertainty_score":0.99989307},"labels":[],"label_agreement":null},{"id":"W4297821321","doi":"10.48550/arxiv.2209.05678","title":"Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Georgia Institute of Technology","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Positive-definite matrix; Diagonal; Combinatorics; Diagonal matrix; Polynomial matrix; Semidefinite programming; Symmetric matrix; Matrix decomposition; Matrix polynomial; Bounded function; Polynomial; Discrete mathematics; Applied mathematics; Mathematical optimization; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.04171935949327458,"score_gpt":0.19621136437995265,"score_spread":0.15449200488667808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297821321","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.9872642,0.00092231086,0.007826399,0.000004739911,0.00022724165,0.00024291569,0.00047973284,0.00008317072,0.0029492567],"genre_scores_gemma":[0.9992067,0.00016063557,0.00043107587,0.0000046349974,0.000016593967,0.0000010353301,0.000110628,0.000023943143,0.000044711578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885267,0.00016965628,0.00031889707,0.00035650216,0.00011998661,0.00018228668],"domain_scores_gemma":[0.99890065,0.00042026598,0.00026120624,0.00023208105,0.00010130907,0.0000844777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025202916,0.00024108829,0.0004868895,0.00068978063,0.00009345794,0.000018527897,0.00031129774,0.000134796,0.00008649947],"category_scores_gemma":[0.000015815496,0.00031077635,0.00019073291,0.00079224294,0.00022028796,0.00009288362,0.00044282724,0.0003725051,0.0000038316225],"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.000079180485,0.00005721183,0.010603716,0.00071615394,0.00030649445,0.000051699066,0.00031403426,0.7276903,0.00009895041,0.2600249,0.000016501668,0.000040849485],"study_design_scores_gemma":[0.0013485281,0.00019714214,0.039350025,0.00057354185,0.00051082164,0.000056824585,0.001303961,0.6565989,0.0005267103,0.2985626,0.00007629644,0.00089466776],"about_ca_topic_score_codex":0.00023764512,"about_ca_topic_score_gemma":0.000007893446,"teacher_disagreement_score":0.0710914,"about_ca_system_score_codex":0.0001027961,"about_ca_system_score_gemma":0.000054334796,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W4299510373","doi":"","title":"Exact and Approximate Unitary 2-Designs: Constructions and Applications","year":2006,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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 Waterloo","funders":"","keywords":"Unitary state; Mathematics; Algebra over a field; Computer science; Pure mathematics; Arithmetic; Political science","score_opus":0.00978324931573508,"score_gpt":0.19467868820316167,"score_spread":0.1848954388874266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299510373","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.20135698,0.009566817,0.6640685,0.00076019653,0.00029015762,0.0014101319,0.00030874467,0.0012066789,0.121031776],"genre_scores_gemma":[0.98255455,0.0010910211,0.014314607,0.000014271867,0.000034953373,0.00032899325,0.00039677712,0.000059554488,0.0012052472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766815,0.0011593966,0.00036629365,0.00043758698,0.00013979417,0.00022876303],"domain_scores_gemma":[0.9978533,0.0005233861,0.00013127415,0.001011945,0.0003472247,0.00013287555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015107616,0.00028256158,0.00028961414,0.00018621919,0.00030938874,0.00024639987,0.00033449946,0.0002400319,0.000022006936],"category_scores_gemma":[0.000060859904,0.00032045378,0.000072584044,0.00022059292,0.0003281239,0.00010028865,0.0003190259,0.00044450347,0.000007294105],"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.000008861675,0.00032767153,0.005482483,0.0023792158,0.00037246346,0.0000064156116,0.006003523,0.0027611775,0.0051389793,0.86982113,0.0020018993,0.10569619],"study_design_scores_gemma":[0.0032822287,0.000001982158,0.022722324,0.008412239,0.0007997803,0.0005817452,0.002505577,0.38619304,0.04736581,0.39503452,0.12782557,0.005275207],"about_ca_topic_score_codex":0.00029555216,"about_ca_topic_score_gemma":0.00026032218,"teacher_disagreement_score":0.7811976,"about_ca_system_score_codex":0.00003881182,"about_ca_system_score_gemma":0.000040902934,"threshold_uncertainty_score":0.9999248},"labels":[],"label_agreement":null},{"id":"W4301487879","doi":"10.48550/arxiv.1109.0562","title":"A tight bound on the length of odd cycles in the incompatibility graph\\n of a non-C1P matrix","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Binary number; Logical matrix; Graph; Mathematics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Physics; Chemistry; Arithmetic; Quantum mechanics","score_opus":0.058339293220000664,"score_gpt":0.18272943288820034,"score_spread":0.12439013966819967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301487879","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.98029643,0.00019164279,0.0020848336,0.000020235742,0.0005013396,0.0012925615,0.000079936675,0.000039705,0.015493342],"genre_scores_gemma":[0.9992397,0.0005249176,0.000016592776,0.000013456644,0.000043688025,0.0000050681265,0.000007254611,0.000040764706,0.000108551336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962532,0.0012156519,0.00090777816,0.0008861076,0.00021875901,0.00051852333],"domain_scores_gemma":[0.99548334,0.0009807697,0.0007007287,0.0025773698,0.00015370916,0.00010409575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002352053,0.00065812137,0.0010229017,0.0008568138,0.0001990667,0.00003517646,0.002432038,0.00050158275,0.00019432836],"category_scores_gemma":[0.000056290268,0.00049395993,0.000781934,0.0020307084,0.00083479605,0.00017467262,0.00044702657,0.0013204655,0.000042359025],"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.0010761002,0.0013367251,0.060215343,0.0023492957,0.001092877,0.00013140909,0.015789129,0.20951155,0.001148954,0.7070572,0.000147487,0.00014393315],"study_design_scores_gemma":[0.0038830852,0.0010318316,0.25965396,0.004203613,0.0013176511,0.0000208217,0.020454545,0.10270996,0.010106409,0.59379834,0.00031619152,0.0025036],"about_ca_topic_score_codex":0.0017274152,"about_ca_topic_score_gemma":0.00049610925,"teacher_disagreement_score":0.1994386,"about_ca_system_score_codex":0.000106578766,"about_ca_system_score_gemma":0.000095333264,"threshold_uncertainty_score":0.9997512},"labels":[],"label_agreement":null},{"id":"W4301725977","doi":"10.48550/arxiv.1702.06612","title":"Some results on the existence of t-all-or-nothing transforms over\\n arbitrary alphabets","year":2017,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","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 Waterloo","funders":"","keywords":"Nothing; Tuple; Bijection; Integer (computer science); Mathematics; Alphabet; Combinatorics; Discrete mathematics; Literal (mathematical logic); Algorithm; Computer science","score_opus":0.10030990288212238,"score_gpt":0.19868055070803833,"score_spread":0.09837064782591595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301725977","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.9600805,0.00046402853,0.0016703625,0.00019473117,0.0025383101,0.001267665,0.00039930726,0.00023802901,0.03314709],"genre_scores_gemma":[0.99314123,0.002743386,0.000025454832,0.00012660562,0.0003178854,0.0000039043057,0.000028710014,0.00010273472,0.003510087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957969,0.00037723826,0.0010136174,0.0015359183,0.00032122957,0.00095508597],"domain_scores_gemma":[0.99414474,0.00091672974,0.0009627595,0.003512418,0.00012934773,0.00033400542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015874875,0.0010512477,0.0011949684,0.00043378316,0.0007146081,0.00017822457,0.003425761,0.0009229472,0.00012255531],"category_scores_gemma":[0.00017408741,0.0008618974,0.0010183251,0.0004168782,0.000722434,0.00089047407,0.0004506688,0.0021196567,0.000115862415],"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.0038818517,0.00034779176,0.00025104327,0.0019388228,0.0019160082,0.0012241731,0.008908344,0.22388355,0.001385676,0.75513226,0.00021990939,0.00091054325],"study_design_scores_gemma":[0.013461003,0.002127833,0.0070648002,0.02012513,0.0027725187,0.00010583464,0.01023554,0.3311207,0.026762195,0.5623623,0.0161617,0.0077004503],"about_ca_topic_score_codex":0.00034235904,"about_ca_topic_score_gemma":0.00006489528,"teacher_disagreement_score":0.19276999,"about_ca_system_score_codex":0.00026973855,"about_ca_system_score_gemma":0.00020519862,"threshold_uncertainty_score":0.99938315},"labels":[],"label_agreement":null},{"id":"W43069128","doi":"","title":"Some Properties of (k, 0)-sets of Cyclic Groups.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclic group; Pure mathematics","score_opus":0.013790653651423486,"score_gpt":0.1798142748881543,"score_spread":0.1660236212367308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43069128","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.9924631,0.0038200885,9.017939e-7,0.000009224467,0.0012564189,0.00010154944,0.000002781012,0.00009134137,0.0022545946],"genre_scores_gemma":[0.99979717,0.000083730636,0.000006415772,0.000004372512,0.000006954396,0.0000110423925,6.7206696e-7,0.000019876856,0.00006978123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993606,0.000031326465,0.0002572887,0.000080718164,0.00012602568,0.00014401198],"domain_scores_gemma":[0.99963254,0.000018032191,0.000045799443,0.00024009876,0.00002710191,0.000036401776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010082013,0.000101555226,0.00022256207,0.000070025475,0.000019663654,0.0000048571487,0.00015599153,0.0000619418,0.00003127727],"category_scores_gemma":[0.000013529767,0.00009258759,0.00006716589,0.0001467902,0.000057461813,0.00011815858,0.000017433778,0.00007412126,0.000033643257],"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.0000091120255,0.00014401662,0.0017550439,0.0006014883,0.00011273111,0.000003555708,0.001785662,0.00021114851,0.12536311,0.8681887,0.0011402114,0.0006852687],"study_design_scores_gemma":[0.0017108415,0.0002422153,0.0031551558,0.000471724,0.0000546624,0.000013681131,0.00047989073,0.005124362,0.5749585,0.41222858,0.0010173252,0.0005430767],"about_ca_topic_score_codex":0.000007933866,"about_ca_topic_score_gemma":5.1325407e-7,"teacher_disagreement_score":0.45596007,"about_ca_system_score_codex":0.000011211061,"about_ca_system_score_gemma":0.0000018477771,"threshold_uncertainty_score":0.3775612},"labels":[],"label_agreement":null},{"id":"W4306976805","doi":"10.37236/11037","title":"Crowns in Linear $3$-Graphs of Minimum Degree $4$","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Combinatorics; Mathematics; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.008747014920304353,"score_gpt":0.20061773821357293,"score_spread":0.19187072329326857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306976805","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.98954725,0.0075813252,0.00046316726,0.00006722042,0.0009976656,0.00008619804,0.0000018262699,0.000015662736,0.00123966],"genre_scores_gemma":[0.999563,0.00028405097,0.0000021709168,0.000010614419,0.000026803365,0.0000047838694,4.0375238e-7,0.000020328445,0.00008783953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862355,0.00018390603,0.00047539364,0.000051756135,0.00031822253,0.00034718242],"domain_scores_gemma":[0.99940944,0.0001279501,0.00018198948,0.00019126029,0.00005491237,0.00003442498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510876,0.000105662875,0.00026144972,0.0002214343,0.00007179762,0.0000054889038,0.00052621367,0.00003288951,0.000029543915],"category_scores_gemma":[0.00002203201,0.0000840593,0.00014178298,0.0007328155,0.00003367579,0.00006158503,0.000039012528,0.00087777287,0.0000012003492],"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.00014274828,0.00021890506,0.0018211901,0.00006406823,0.00021941475,0.000029368115,0.001594073,0.029084317,0.0045591844,0.9608461,0.0008722562,0.00054834137],"study_design_scores_gemma":[0.0021374326,0.00134379,0.0011211659,0.000046927413,0.000074985284,0.0004838949,0.0017623595,0.003098294,0.0050117387,0.97338045,0.011268046,0.00027093943],"about_ca_topic_score_codex":0.000004404955,"about_ca_topic_score_gemma":0.000005193219,"teacher_disagreement_score":0.025986023,"about_ca_system_score_codex":0.00018950267,"about_ca_system_score_gemma":0.000111269605,"threshold_uncertainty_score":0.38135353},"labels":[],"label_agreement":null},{"id":"W4311003387","doi":"10.37236/10962","title":"The EKR-Module Property of Pseudo-Paley Graphs of Square Order","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Clique; Property (philosophy); Order (exchange); Square (algebra); Clique number; Block (permutation group theory); Discrete mathematics; Graph; Geometry","score_opus":0.004352458934925816,"score_gpt":0.18179650405606376,"score_spread":0.17744404512113796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311003387","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.9797908,0.01615808,0.0007251827,0.00023475822,0.0012252759,0.00023928942,0.0000046146065,0.000025443975,0.0015965507],"genre_scores_gemma":[0.99893725,0.00077327195,0.0000020174318,0.000007852154,0.000026396941,0.000009548985,4.8636275e-7,0.000026395772,0.00021677089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821675,0.0002871801,0.0005625735,0.00006170539,0.00049715,0.0003746553],"domain_scores_gemma":[0.9988739,0.00017976636,0.00035018168,0.0003322172,0.00022679233,0.000037138296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019459038,0.00013232409,0.00029287612,0.00009640936,0.00025158352,0.000011737673,0.0007850293,0.00003475676,0.000023233104],"category_scores_gemma":[0.000044978475,0.00006777725,0.00018962992,0.0007572296,0.00008427371,0.00006678043,0.00005653234,0.00078009797,8.460073e-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.00015550578,0.00015432558,0.0005789259,0.000099886616,0.00052391837,0.000003972589,0.0010059457,0.013144148,0.0038351058,0.97825825,0.0014164235,0.00082357856],"study_design_scores_gemma":[0.0017338801,0.0020955284,0.0004536286,0.00007596379,0.00018768784,0.00044693096,0.002827346,0.00284993,0.011292073,0.9467114,0.031026106,0.00029952993],"about_ca_topic_score_codex":0.0000073239285,"about_ca_topic_score_gemma":0.000004426465,"teacher_disagreement_score":0.03154687,"about_ca_system_score_codex":0.00012808459,"about_ca_system_score_gemma":0.00016742913,"threshold_uncertainty_score":0.3389181},"labels":[],"label_agreement":null},{"id":"W4311591694","doi":"10.1109/ipc53466.2022.9975665","title":"Security Performance of Physical-Layer Encryption Based on Randomized Phase Space in Optical Fiber Communication","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Photonics Conference (IPC)","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":"Quantropi (Canada); McGill University","funders":"Mitacs","keywords":"Eavesdropping; Encryption; Physical layer; Computer science; Computer network; Fiber; Optical communication; Computer security; Materials science; Optoelectronics; Telecommunications; Wireless","score_opus":0.013375313083232724,"score_gpt":0.2391103579127396,"score_spread":0.22573504482950688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311591694","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.9884786,0.00006993362,0.00031050327,0.00004226636,0.00019291134,0.0006607088,0.00004328794,0.00008654025,0.010115276],"genre_scores_gemma":[0.99917203,0.00006458524,0.000089513225,0.000024619767,0.000011706154,0.00049050455,0.000052925752,0.000025033949,0.00006909325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983023,0.00046441966,0.000390201,0.00022251108,0.00036990194,0.00025067627],"domain_scores_gemma":[0.99878234,0.00040690886,0.00011112038,0.0005870834,0.000051613024,0.000060917173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011406379,0.00020371967,0.00053092913,0.0001762108,0.00011386336,0.000021509813,0.00036591702,0.00006231363,0.00080626627],"category_scores_gemma":[0.000036575453,0.0002115683,0.00015487075,0.0003743985,0.000110260604,0.000113857976,0.000051503437,0.00061710493,0.000025168554],"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.021213133,0.0018236408,0.0000955375,0.00051689084,0.00013430897,0.000011248526,0.0078964,0.78594,0.12326416,0.057034124,0.00033197913,0.0017385717],"study_design_scores_gemma":[0.02179756,0.00019280579,0.00001718495,0.00006783064,0.000027095857,0.0000016670188,0.00023811011,0.92856103,0.047274172,0.0011252983,0.00048531062,0.00021195087],"about_ca_topic_score_codex":0.000026871858,"about_ca_topic_score_gemma":0.000008601926,"teacher_disagreement_score":0.14262101,"about_ca_system_score_codex":0.00012177051,"about_ca_system_score_gemma":0.000058338046,"threshold_uncertainty_score":0.88280505},"labels":[],"label_agreement":null},{"id":"W4312250997","doi":"10.5486/pmd.2001.2518","title":"Units in right alternative loop rings","year":2001,"lang":"en","type":"article","venue":"Publicationes Mathematicae Debrecen","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":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Loop (graph theory); Pure mathematics; Combinatorics","score_opus":0.015962084761915758,"score_gpt":0.21160999624260912,"score_spread":0.19564791148069335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312250997","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.81613094,0.00031237645,0.010343311,0.0007967345,0.0002944365,0.00055857195,0.0000098884,0.000717906,0.17083582],"genre_scores_gemma":[0.9981446,0.00005807227,0.00032831222,0.000050132574,0.00005809627,0.00020108347,0.000020890633,0.000035024404,0.0011037319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899817,0.00004454219,0.00035499677,0.0001712545,0.0001624996,0.0002685135],"domain_scores_gemma":[0.9992756,0.00012102272,0.000055304183,0.00035364527,0.00010812574,0.00008630162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033165223,0.00015864117,0.0002053713,0.00025449955,0.000047108217,0.00007374645,0.00032262373,0.000067199886,0.00040045893],"category_scores_gemma":[0.000110678564,0.00014537647,0.000031471955,0.001016537,0.000033793003,0.00036999036,0.000025390642,0.00012217167,0.0005026943],"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.00001612548,0.00027653817,0.007620073,0.00041375638,0.00015514722,0.000021369102,0.0058188466,0.0013050947,0.0014495334,0.9676261,0.0054499013,0.0098475255],"study_design_scores_gemma":[0.0024776862,0.000057784717,0.025648504,0.0006430557,0.00006668124,0.00045747837,0.0019215833,0.22583751,0.01045883,0.538906,0.19156517,0.0019597148],"about_ca_topic_score_codex":0.000010592291,"about_ca_topic_score_gemma":0.000022179825,"teacher_disagreement_score":0.4287201,"about_ca_system_score_codex":0.000053506625,"about_ca_system_score_gemma":0.000010943387,"threshold_uncertainty_score":0.6461286},"labels":[],"label_agreement":null},{"id":"W4313597940","doi":"10.48550/arxiv.2301.01364","title":"Notes on Correspondence Analysis of Power Transformed Data Sets","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Correspondence analysis; Power (physics); Power analysis; Computer science; Mathematics; Data mining; Algorithm; Statistics; Epistemology; Physics; Philosophy","score_opus":0.13201845135630266,"score_gpt":0.2104490145462475,"score_spread":0.07843056318994485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313597940","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.97049683,0.00004836217,0.024921274,0.000009680434,0.00080138515,0.00021150298,0.0011035608,0.00036595276,0.002041453],"genre_scores_gemma":[0.9990069,0.00014180776,0.000012986379,0.0000071506292,0.000012379436,6.2644676e-7,0.0003446709,0.000034165212,0.00043927933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986806,0.000093873416,0.0002459793,0.0006334466,0.00010211983,0.00024397163],"domain_scores_gemma":[0.9976935,0.00034810684,0.00009538302,0.001719298,0.000050045408,0.00009367923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035198024,0.00028261702,0.0005551154,0.0008935598,0.000043829285,0.000019920251,0.001258785,0.00027376498,0.00013415725],"category_scores_gemma":[0.000045857334,0.00031292296,0.00030124394,0.0015783974,0.000079125246,0.00012391084,0.00028233518,0.0003923621,0.00009866495],"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.00009135765,0.00003241604,0.0027099582,0.00017322857,0.0021197088,0.000117447125,0.00032379339,0.9857282,0.00016774592,0.008210058,0.00022522469,0.00010088241],"study_design_scores_gemma":[0.0003887391,0.000058087815,0.018692046,0.00031746773,0.0025267475,9.217e-7,0.00042200356,0.97123814,0.00058909744,0.004682413,0.00037974396,0.0007046106],"about_ca_topic_score_codex":0.000099411445,"about_ca_topic_score_gemma":0.00024262522,"teacher_disagreement_score":0.028510105,"about_ca_system_score_codex":0.000060908053,"about_ca_system_score_gemma":0.000034597466,"threshold_uncertainty_score":0.9999323},"labels":[],"label_agreement":null},{"id":"W4320147679","doi":"10.1364/fio.2022.jw5a.80","title":"Enhancing Data Security in Optical Fiber Communication Through Dual Layer Encryption with Randomized Phases","year":2022,"lang":"en","type":"article","venue":"Frontiers in Optics + Laser Science 2022 (FIO, LS)","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":"Quantropi (Canada); McGill University","funders":"","keywords":"Encryption; Computer science; Physical layer; Dual layer; Modulation (music); Transmission (telecommunications); Optical fiber; Quadrature amplitude modulation; Fiber; Layer (electronics); Computer network; Materials science; Telecommunications; Bit error rate; Physics; Wireless; Channel (broadcasting); Nanotechnology; Composite material","score_opus":0.013408819907797973,"score_gpt":0.24366593077520707,"score_spread":0.2302571108674091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320147679","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.9605267,0.0010457241,0.028454352,0.0001776997,0.0015908986,0.00097329234,0.0000902585,0.00016162082,0.006979454],"genre_scores_gemma":[0.9820088,0.00015477958,0.017323656,0.00004751493,0.000033750952,0.00018492415,0.00010043298,0.000024750714,0.00012140379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974466,0.0003746366,0.00051644293,0.0004895915,0.00068400335,0.00048874546],"domain_scores_gemma":[0.998419,0.00023608316,0.0000903422,0.0011272742,0.000045643803,0.0000816915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044051767,0.00021394667,0.0004731703,0.00032978193,0.00035233062,0.00012012363,0.0012240554,0.00006075328,0.00018519258],"category_scores_gemma":[0.00020711934,0.00020652259,0.000047795827,0.0015659417,0.0005791952,0.001158564,0.0005429567,0.0006147148,0.000006169344],"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.016560301,0.0022465945,0.006733863,0.0005097193,0.00041052696,0.00037995353,0.052086033,0.8131266,0.013529229,0.074624725,0.016048057,0.0037443682],"study_design_scores_gemma":[0.031175481,0.00016675719,0.0001177428,0.00018307735,0.00008632158,0.000059584738,0.015554186,0.9217067,0.0108189685,0.015296379,0.0038988132,0.0009359824],"about_ca_topic_score_codex":0.000059664897,"about_ca_topic_score_gemma":0.00009315908,"teacher_disagreement_score":0.108580075,"about_ca_system_score_codex":0.00028222587,"about_ca_system_score_gemma":0.000119069184,"threshold_uncertainty_score":0.84217465},"labels":[],"label_agreement":null},{"id":"W4320477443","doi":"10.1016/j.jcta.2022.105723","title":"Compositions and parities of complete mappings and of orthomorphisms","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Sylow theorems; Mathematics; Combinatorics; Permutation (music); Parity (physics); Group (periodic table); Finite field; Finite group; Discrete mathematics; Physics","score_opus":0.008526302920910316,"score_gpt":0.18838510898220048,"score_spread":0.17985880606129018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320477443","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.9966613,0.00076870626,0.00013121529,0.000041628646,0.0014896501,0.00007029374,0.000039005823,0.000027923683,0.00077028276],"genre_scores_gemma":[0.9994653,0.00032889686,0.000062653555,0.0000036955926,0.00008296517,0.0000015599354,0.0000018300661,0.000012630684,0.00004050754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991581,0.000105582425,0.00044473313,0.000046824538,0.00013887309,0.00010589848],"domain_scores_gemma":[0.9993249,0.00024172125,0.00018281324,0.000086004744,0.000107755826,0.000056760306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006756687,0.00009694229,0.00038396972,0.0001612848,0.000054820546,0.000016242244,0.000090863046,0.000052840904,0.000014620952],"category_scores_gemma":[0.000033913046,0.000088585,0.000068535424,0.00018540121,0.0002620696,0.00017788068,0.000031725158,0.00011735586,4.6565918e-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.0002537313,0.000019227748,0.0005504021,0.00034654132,0.00016467554,0.000012599209,0.001565873,0.00013804888,0.02848753,0.96802384,0.00027539567,0.00016216806],"study_design_scores_gemma":[0.0016107452,0.0006887565,0.003895007,0.0004932618,0.00009257796,0.00028585127,0.0039474866,0.00012221475,0.009947806,0.9720665,0.0066540567,0.00019568685],"about_ca_topic_score_codex":0.0000021689848,"about_ca_topic_score_gemma":5.517421e-7,"teacher_disagreement_score":0.018539725,"about_ca_system_score_codex":0.0000062640866,"about_ca_system_score_gemma":0.0000106864445,"threshold_uncertainty_score":0.36123914},"labels":[],"label_agreement":null},{"id":"W4323670410","doi":"10.37236/11586","title":"Constructions and Restrictions for Balanced Splittable Hadamard Matrices","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hadamard transform; Hadamard matrix; Block matrix; Matrix (chemical analysis); Discrete mathematics; Row; Abelian group; Eigenvalues and eigenvectors; Computer science","score_opus":0.005811934820727407,"score_gpt":0.20609010508360373,"score_spread":0.2002781702628763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323670410","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.9748457,0.0073793936,0.013485024,0.0004204384,0.001935891,0.00024159314,0.000007243509,0.00016464155,0.0015200895],"genre_scores_gemma":[0.99713063,0.0025166469,0.000012718305,0.0000050004014,0.00008902404,0.000010135492,8.078114e-7,0.000015361706,0.00021966366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992683,0.000033423097,0.0002338478,0.000048115766,0.0001104306,0.00030589377],"domain_scores_gemma":[0.99945015,0.00023858943,0.00008446,0.00010578811,0.00007880923,0.000042215674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005994696,0.00008067444,0.00015354963,0.00013978867,0.00018557829,0.000033916713,0.00014852156,0.000041720952,0.0000023607472],"category_scores_gemma":[0.000033985612,0.000060467675,0.00006884852,0.0005998422,0.000034624733,0.00010133958,0.000010246064,0.0002599248,0.0000033407944],"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.00001841823,0.000010116965,0.00035084397,0.000042452364,0.0001369358,0.0000014354808,0.00013139965,0.0022546253,0.00076123636,0.99140424,0.0044069802,0.00048130497],"study_design_scores_gemma":[0.00081627676,0.00021611464,0.0006723955,0.00003113361,0.00009789058,0.00030931982,0.00066277554,0.0033293099,0.00066838495,0.950177,0.042894598,0.00012476442],"about_ca_topic_score_codex":0.0000017261611,"about_ca_topic_score_gemma":0.0000016027595,"teacher_disagreement_score":0.041227214,"about_ca_system_score_codex":0.00007020777,"about_ca_system_score_gemma":0.00005940778,"threshold_uncertainty_score":0.24658003},"labels":[],"label_agreement":null},{"id":"W4323706434","doi":"10.48550/arxiv.2303.04308","title":"On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Combinatorics; Mathematics; Prime (order theory); Decomposition; Chemistry","score_opus":0.09044331024431902,"score_gpt":0.17792496799620872,"score_spread":0.0874816577518897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323706434","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.98305655,0.00019816704,0.008257984,0.00004750343,0.0006313591,0.0013569855,0.00035330318,0.0013824025,0.00471575],"genre_scores_gemma":[0.99867487,0.0002360273,0.000049523194,0.000018428707,0.000047745234,0.000019287456,0.000066649656,0.00007114593,0.0008162952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985584,0.0001181564,0.00024385628,0.00056628836,0.00007848117,0.00043479173],"domain_scores_gemma":[0.9983228,0.0007512814,0.00011328105,0.0006183398,0.00006897232,0.00012532734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042671527,0.0003830659,0.00038714454,0.0004931622,0.00024957804,0.00008967265,0.0005178119,0.00025033546,0.000011679329],"category_scores_gemma":[0.000050668714,0.00033772187,0.0002362712,0.0009242411,0.00012049041,0.00008731284,0.00026251294,0.00047981006,0.00004675884],"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.00007215715,0.000037219306,0.0011712076,0.0007531239,0.00052931963,0.000031585412,0.00026039843,0.24683109,0.00012417106,0.74892753,0.0010035413,0.00025867138],"study_design_scores_gemma":[0.00088071584,0.0001265784,0.0041384036,0.00057223346,0.00031664278,0.000004023512,0.00043552354,0.5994098,0.00019634451,0.3902548,0.002673574,0.0009913208],"about_ca_topic_score_codex":0.000060445804,"about_ca_topic_score_gemma":0.000067899506,"teacher_disagreement_score":0.35867274,"about_ca_system_score_codex":0.00007718641,"about_ca_system_score_gemma":0.000017840735,"threshold_uncertainty_score":0.9999075},"labels":[],"label_agreement":null},{"id":"W4324357480","doi":"10.1016/j.disc.2023.113404","title":"Block colourings of star systems","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Mathematics; Bipartite graph; Star (game theory); Vertex (graph theory); Block (permutation group theory); Graph; Discrete mathematics; Stars; Astrophysics; Physics","score_opus":0.011800853276043487,"score_gpt":0.2099673878089681,"score_spread":0.1981665345329246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324357480","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.9879645,0.00015664908,0.0005205834,0.000007218444,0.00038138666,0.00022384417,0.00003749994,0.0005524044,0.010155875],"genre_scores_gemma":[0.999066,0.00002015276,0.00018948369,0.0000013761039,0.000033668934,0.000026562464,0.0000065043573,0.00003669385,0.00061954954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923366,0.00001622679,0.00031572318,0.000075564465,0.00016694047,0.00019188307],"domain_scores_gemma":[0.9995318,0.000081583996,0.000053054606,0.00026294345,0.00002414951,0.000046452315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027597806,0.000115189796,0.00024655476,0.000097691554,0.000028701072,0.00001957047,0.00015228603,0.00005747144,0.000011748415],"category_scores_gemma":[0.000020709609,0.000101975915,0.000069435504,0.0003019551,0.000029703264,0.00004067321,0.000025123421,0.00006372303,0.00016706972],"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.000019552925,0.00013233314,0.0006625594,0.027189542,0.0009633516,0.00009058697,0.030543057,0.14132088,0.066782,0.70953614,0.022539534,0.00022044772],"study_design_scores_gemma":[0.0008245706,0.00013684487,0.00040186182,0.0015134258,0.00014878306,0.000062057064,0.01744369,0.9173924,0.023234112,0.027324006,0.010546021,0.00097224745],"about_ca_topic_score_codex":0.0000034053944,"about_ca_topic_score_gemma":7.231358e-7,"teacher_disagreement_score":0.7760715,"about_ca_system_score_codex":0.000011369513,"about_ca_system_score_gemma":0.000004081998,"threshold_uncertainty_score":0.41584572},"labels":[],"label_agreement":null},{"id":"W4360838541","doi":"10.2140/ant.2023.17.359","title":"Constructions of difference sets in nonabelian 2-groups","year":2023,"lang":"en","type":"article","venue":"Algebra & Number Theory","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":"MetaOptima Technology (Canada); Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.007387366079784991,"score_gpt":0.21333857550353302,"score_spread":0.20595120942374803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360838541","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.9739471,0.000076244396,0.00014608983,0.000012198569,0.00050356146,0.00011105004,0.0000835801,0.00033749582,0.02478266],"genre_scores_gemma":[0.9993403,0.000024104562,0.000048707872,0.000015744947,0.000028647124,0.000043396703,0.00002858415,0.000028330405,0.0004421928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912566,0.00010892299,0.00026469846,0.00014151524,0.000106238986,0.00025295364],"domain_scores_gemma":[0.9993522,0.00027765793,0.000030193944,0.00026876578,0.000017002847,0.000054168264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030727923,0.00013406815,0.00020686968,0.0001453575,0.000037014583,0.00000996824,0.00016905846,0.00008555623,0.0009229798],"category_scores_gemma":[0.000031023053,0.00013442323,0.00006898697,0.0006579283,0.00012286911,0.00007115405,0.000031154526,0.00015128985,0.00055852416],"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.000026406333,0.000046038134,0.023989901,0.00024000183,0.00012807941,0.00003662785,0.003515138,0.0005409224,0.007085543,0.9421636,0.0018892629,0.020338515],"study_design_scores_gemma":[0.00055129203,0.000022951584,0.06467267,0.0002938512,0.000026413794,0.000072647024,0.0043212143,0.001560408,0.004991423,0.92092896,0.0020591076,0.00049908145],"about_ca_topic_score_codex":0.000010324427,"about_ca_topic_score_gemma":0.000024495414,"teacher_disagreement_score":0.04068277,"about_ca_system_score_codex":0.00001664465,"about_ca_system_score_gemma":0.000010025446,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W4361229231","doi":"10.48550/arxiv.2303.16026","title":"On a Lemma of Schensted","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Combinatorics; Column (typography); Mathematics; Physics; Connection (principal bundle); Geometry; Biology","score_opus":0.08301085802252389,"score_gpt":0.1596513337459389,"score_spread":0.07664047572341501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361229231","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.98154783,0.000037394555,0.005643914,0.000004339135,0.0010224098,0.00019500416,0.00005669839,0.00061974203,0.01087264],"genre_scores_gemma":[0.99783504,0.00005304393,0.000011137054,0.0000047043754,0.000036082067,7.8188555e-7,0.000019603272,0.00004363676,0.0019959994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991873,0.00005961694,0.00016615838,0.00033849347,0.000051225346,0.00019720542],"domain_scores_gemma":[0.99911696,0.000093532544,0.00007386389,0.00060002314,0.00004350008,0.00007210108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014226006,0.0002183409,0.00030879988,0.00030240766,0.000031733423,0.000010309989,0.00038360112,0.0002686196,0.000037586356],"category_scores_gemma":[0.000017724902,0.0002620715,0.00020161702,0.0003805827,0.00005788575,0.00003918985,0.00016535986,0.0003981236,0.00021743639],"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.00003403261,0.000021418062,0.00047973037,0.00039518852,0.00020403159,0.00012413258,0.000112238195,0.8085134,0.00027023692,0.18900345,0.00080366177,0.000038467035],"study_design_scores_gemma":[0.0018799361,0.0002060438,0.0037989384,0.0021435665,0.00040049662,0.0000067675046,0.0008592657,0.61376894,0.005197858,0.36810324,0.0017853251,0.0018496246],"about_ca_topic_score_codex":0.00003961131,"about_ca_topic_score_gemma":0.000017998635,"teacher_disagreement_score":0.19474447,"about_ca_system_score_codex":0.00006266384,"about_ca_system_score_gemma":0.00002023978,"threshold_uncertainty_score":0.99998313},"labels":[],"label_agreement":null},{"id":"W4361229663","doi":"10.48550/arxiv.2303.16204","title":"The Decoupling of Binaries from Their Circumbinary Disks","year":2023,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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":"Graduate School, University of Maryland; Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Nuclear Safety and Security Commission; Government of Canada; National Aeronautics and Space Administration","keywords":"Circumbinary planet; Decoupling (probability); Physics; Astrophysics; Computer science; Engineering; Stars; Control engineering","score_opus":0.052076466026497584,"score_gpt":0.2331139405169416,"score_spread":0.181037474490444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361229663","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.99055654,0.0034864177,0.00048180483,0.00009030354,0.003917743,0.0002466129,0.00011497931,0.0005410968,0.0005644908],"genre_scores_gemma":[0.99859935,0.00066709216,0.000011958239,0.000008084788,0.00026531477,0.00009658161,0.00006932048,0.000095321724,0.00018700068],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987128,0.00006200274,0.00046865287,0.00030684457,0.0001463588,0.00030336052],"domain_scores_gemma":[0.9982798,0.00054693833,0.00012825959,0.0009467775,0.000041920655,0.000056270874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039328754,0.00030546088,0.00040675187,0.00007272306,0.00017415342,0.000056594494,0.00066147774,0.00028087705,0.000019420617],"category_scores_gemma":[0.00005885223,0.00023140213,0.00024679315,0.00015248724,0.00013533537,0.00005109574,0.00037967306,0.0006012262,0.00012028843],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058056066,0.000058632188,0.9196983,0.0010858225,0.0017341719,0.000050067574,0.0059173633,0.055467345,0.007370027,0.003471212,0.0023077675,0.0027812235],"study_design_scores_gemma":[0.00050539133,0.000060287923,0.8344545,0.0017960352,0.0002084337,0.0000057348693,0.00469808,0.01733878,0.016502475,0.11727944,0.005863509,0.0012873242],"about_ca_topic_score_codex":0.00020845738,"about_ca_topic_score_gemma":0.00006541833,"teacher_disagreement_score":0.11380823,"about_ca_system_score_codex":0.000034076238,"about_ca_system_score_gemma":0.00002685076,"threshold_uncertainty_score":0.94363046},"labels":[],"label_agreement":null},{"id":"W4362606931","doi":"10.36227/techrxiv.22340764","title":"Generalized Inverse Matrix Construction for Code Based Cryptography","year":2023,"lang":"en","type":"preprint","venue":"","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 Victoria","funders":"","keywords":"Gaussian elimination; McEliece cryptosystem; Mathematics; Cryptosystem; Inverse; Cryptography; Decoding methods; Matrix (chemical analysis); Square matrix; Moore–Penrose pseudoinverse; Generalized inverse; Binary number; Algorithm; Discrete mathematics; Algebra over a field; Theoretical computer science; Arithmetic; Computer science; Pure mathematics; Symmetric matrix; Gaussian; Eigenvalues and eigenvectors","score_opus":0.027891323924557055,"score_gpt":0.2536716368298101,"score_spread":0.22578031290525302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362606931","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.13434078,0.00023105378,0.8439279,0.000103596176,0.010946128,0.0017976199,0.0007849929,0.0047739767,0.0030939316],"genre_scores_gemma":[0.6722993,0.00030299748,0.31656325,0.00025011325,0.00164857,0.0038401796,0.0021796576,0.0007065295,0.0022093884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988821,0.00005028741,0.00036370696,0.00031552376,0.00012568725,0.0002626555],"domain_scores_gemma":[0.9992737,0.000082484934,0.000065210465,0.00043410505,0.000059147813,0.0000853417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000280654,0.0002943506,0.0003687255,0.00037991305,0.000061311235,0.00006806219,0.00020237284,0.00038008802,0.00012617189],"category_scores_gemma":[0.000013960012,0.0003011455,0.00042282316,0.00020434112,0.00005463528,0.000035048786,0.00004877293,0.00024103903,0.00006241085],"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.000110731264,0.000025843283,0.00086189713,0.004431476,0.00079130527,0.000007970974,0.00017222714,0.6175833,0.0052467645,0.30053422,0.06953546,0.00069885264],"study_design_scores_gemma":[0.0021303098,0.000038549893,0.000112518544,0.00034575808,0.00023595884,0.0000066976145,0.00031334203,0.7911877,0.008719341,0.16283606,0.03285487,0.0012188612],"about_ca_topic_score_codex":0.00003570753,"about_ca_topic_score_gemma":0.00007012755,"teacher_disagreement_score":0.5379585,"about_ca_system_score_codex":0.000034024433,"about_ca_system_score_gemma":0.000026705447,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W4362606933","doi":"10.36227/techrxiv.22340764.v1","title":"Generalized Inverse Matrix Construction for Code Based Cryptography","year":2023,"lang":"en","type":"preprint","venue":"","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 Victoria","funders":"","keywords":"McEliece cryptosystem; Gaussian elimination; Inverse; Cryptosystem; Cryptography; Decoding methods; Mathematics; Matrix (chemical analysis); Generalized inverse; Square matrix; Moore–Penrose pseudoinverse; Binary number; Algorithm; S-box; Discrete mathematics; Theoretical computer science; Computer science; Algebra over a field; Arithmetic; Block cipher; Pure mathematics; Symmetric matrix; Gaussian; Eigenvalues and eigenvectors","score_opus":0.027891323924557055,"score_gpt":0.2536716368298101,"score_spread":0.22578031290525302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362606933","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.13434078,0.00023105378,0.8439279,0.000103596176,0.010946128,0.0017976199,0.0007849929,0.0047739767,0.0030939316],"genre_scores_gemma":[0.6722993,0.00030299748,0.31656325,0.00025011325,0.00164857,0.0038401796,0.0021796576,0.0007065295,0.0022093884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988821,0.00005028741,0.00036370696,0.00031552376,0.00012568725,0.0002626555],"domain_scores_gemma":[0.9992737,0.000082484934,0.000065210465,0.00043410505,0.000059147813,0.0000853417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000280654,0.0002943506,0.0003687255,0.00037991305,0.000061311235,0.00006806219,0.00020237284,0.00038008802,0.00012617189],"category_scores_gemma":[0.000013960012,0.0003011455,0.00042282316,0.00020434112,0.00005463528,0.000035048786,0.00004877293,0.00024103903,0.00006241085],"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.000110731264,0.000025843283,0.00086189713,0.004431476,0.00079130527,0.000007970974,0.00017222714,0.6175833,0.0052467645,0.30053422,0.06953546,0.00069885264],"study_design_scores_gemma":[0.0021303098,0.000038549893,0.000112518544,0.00034575808,0.00023595884,0.0000066976145,0.00031334203,0.7911877,0.008719341,0.16283606,0.03285487,0.0012188612],"about_ca_topic_score_codex":0.00003570753,"about_ca_topic_score_gemma":0.00007012755,"teacher_disagreement_score":0.5379585,"about_ca_system_score_codex":0.000034024433,"about_ca_system_score_gemma":0.000026705447,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W4362647900","doi":"10.20948/dms-2022-47","title":"Methods of construction and differentiation of 5-configurations","year":2022,"lang":"en","type":"article","venue":"","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":"123 Certification (Canada)","funders":"","keywords":"Cardinality (data modeling); Degenerate energy levels; Incidence matrix; Inverse; Column (typography); Property (philosophy); Field (mathematics); Matrix (chemical analysis); Mathematics; Finite field; Combinatorics; Computer science; Discrete mathematics; Pure mathematics; Engineering; Physics; Geometry; Node (physics); Structural engineering; Data mining","score_opus":0.008165647548780755,"score_gpt":0.2311221102030684,"score_spread":0.22295646265428765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362647900","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.8457052,0.0000922443,0.14622812,0.000004913582,0.00020870261,0.00005418177,0.000008205937,0.00003067658,0.0076677366],"genre_scores_gemma":[0.99588585,0.0000030182418,0.00406443,8.5448994e-7,0.0000031227837,0.0000076332035,0.0000032319042,0.0000023468058,0.000029489313],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976665,0.000052229745,0.00010096091,0.000025878415,0.000031775555,0.000022506],"domain_scores_gemma":[0.99989253,0.000028034172,0.000020647632,0.00004344916,0.000008780726,0.000006557969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104119776,0.000021798749,0.000057032303,0.00004417524,0.000022992683,0.0000013323024,0.000016299582,0.000008172595,0.00022605454],"category_scores_gemma":[0.0000033578679,0.000021711325,0.00001369001,0.000067589935,0.000015041961,0.000022998991,0.0000057700454,0.000023338838,9.4680054e-8],"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.0000037707434,0.000009048748,0.0012749623,0.00007370352,0.000038172657,3.617795e-8,0.00054732215,0.0030476118,0.64171517,0.33532602,0.00003636196,0.017927831],"study_design_scores_gemma":[0.00056292256,0.000109929846,0.022140894,0.000012743651,0.000062478306,0.000032702934,0.0065428405,0.05579574,0.879058,0.033450197,0.0020446135,0.000186925],"about_ca_topic_score_codex":0.000004866574,"about_ca_topic_score_gemma":7.976505e-7,"teacher_disagreement_score":0.3018758,"about_ca_system_score_codex":0.0000032447872,"about_ca_system_score_gemma":0.0000014811585,"threshold_uncertainty_score":0.24751388},"labels":[],"label_agreement":null},{"id":"W4362725540","doi":"10.33140/jmtcm.02.02.02","title":"Hadamard Matrix Conjecture","year":2023,"lang":"en","type":"article","venue":"Journal of Mathematical Techniques and Computational Mathematics","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":"Saint John Regional Hospital","funders":"","keywords":"Hadamard's inequality; Hadamard matrix; Hadamard three-lines theorem; Hadamard transform; Complex Hadamard matrix; Conjecture; Hadamard's maximal determinant problem; Mathematics; Hadamard product; Hadamard three-circle theorem; Matrix (chemical analysis); Rank (graph theory); Combinatorics; Pure mathematics; Mathematical analysis; Materials science","score_opus":0.010927766849377782,"score_gpt":0.25477832925033644,"score_spread":0.24385056240095865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362725540","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.52452743,0.00076623604,0.46197593,0.00059263845,0.00029978473,0.00050374516,0.000020948666,0.0012622809,0.010050989],"genre_scores_gemma":[0.8479564,0.00013604561,0.15144116,0.000022658469,0.00018585277,0.000012234772,0.0000032281253,0.000049950315,0.00019246442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988515,0.00002348619,0.0006048045,0.000062118765,0.0003104903,0.0001476437],"domain_scores_gemma":[0.9991717,0.00041759099,0.00013952477,0.00009264362,0.00008892177,0.00008965579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062266405,0.0001441605,0.00035263383,0.0002034708,0.000047191963,0.00005304673,0.00014035532,0.00008925907,0.00003948969],"category_scores_gemma":[0.000047004487,0.00010973831,0.00011474599,0.00023942953,0.000055148903,0.00009798461,0.000028548484,0.00018521285,0.000033452594],"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.000012018468,0.00012788412,0.000022623843,0.0022446269,0.00021442331,0.00018704678,0.001437193,0.008269351,0.0005911584,0.97179043,0.009095299,0.006007927],"study_design_scores_gemma":[0.00018696979,0.000089260706,0.000020277952,0.00032726093,0.000032383727,0.0013965967,0.00026282898,0.06294052,0.00059850834,0.93224055,0.0017673163,0.00013752157],"about_ca_topic_score_codex":5.6094297e-8,"about_ca_topic_score_gemma":2.6978038e-8,"teacher_disagreement_score":0.32342896,"about_ca_system_score_codex":0.00001675187,"about_ca_system_score_gemma":0.00001299803,"threshold_uncertainty_score":0.44749984},"labels":[],"label_agreement":null},{"id":"W4365140412","doi":"10.1016/j.jcta.2023.105756","title":"Balancing permuted copies of multigraphs and integer matrices","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Combinatorics; Mathematics; Permutation (music); Permutation matrix; Graph; Discrete mathematics; Integer (computer science); Integer matrix; Matrix (chemical analysis); Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.0045704480086358095,"score_gpt":0.19753891989771308,"score_spread":0.19296847188907726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365140412","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.99277174,0.0016315598,0.000100435005,0.000019901823,0.004694972,0.00006936178,0.0000065835043,0.00008206545,0.0006233784],"genre_scores_gemma":[0.99925286,0.00041767408,0.000040033454,0.0000035801622,0.00020863494,0.0000020719888,8.0925514e-7,0.000019840543,0.000054496344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990027,0.00012533528,0.00046631612,0.0000618266,0.00018572199,0.00015808924],"domain_scores_gemma":[0.99921894,0.00029272502,0.00018364444,0.00011027639,0.0001258936,0.000068529975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001031209,0.00013147999,0.00037293826,0.00028335082,0.000054078944,0.000031762662,0.00015902509,0.00007955464,0.000027133006],"category_scores_gemma":[0.00012418997,0.00010841863,0.000114615395,0.00041134784,0.000107225154,0.00030481623,0.000028775112,0.00018133417,0.0000027032684],"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.001100508,0.000055378063,0.0040282733,0.00080867193,0.0006541177,0.000096512966,0.008424527,0.0011430187,0.047985304,0.93153024,0.0019460082,0.0022274249],"study_design_scores_gemma":[0.0035744824,0.0009780689,0.0054264036,0.0009770205,0.00018388843,0.0005113829,0.01789542,0.00062849576,0.044372886,0.9115024,0.013365666,0.00058388367],"about_ca_topic_score_codex":0.0000017854871,"about_ca_topic_score_gemma":7.0770125e-7,"teacher_disagreement_score":0.020027852,"about_ca_system_score_codex":0.000012804108,"about_ca_system_score_gemma":0.00001502925,"threshold_uncertainty_score":0.44211835},"labels":[],"label_agreement":null},{"id":"W4366695211","doi":"10.54550/eca2023v3s3r19","title":"On a lemma of Schensted","year":2023,"lang":"en","type":"article","venue":"Enumerative Combinatorics and Applications","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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Combinatorics; Column (typography); Mathematics; Geometry; Connection (principal bundle); Biology","score_opus":0.008472006389211025,"score_gpt":0.2136296068280778,"score_spread":0.20515760043886677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366695211","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.95255363,0.00054173585,0.009487209,0.00009555006,0.0002560929,0.00065094396,0.00006799932,0.00054119073,0.035805672],"genre_scores_gemma":[0.9994772,0.00005657903,0.000009510011,0.0000062487447,0.000012346937,0.00017496328,0.000012827886,0.000009727585,0.00024060809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999672,0.000013118493,0.00010157138,0.00007994097,0.000057116784,0.0000762687],"domain_scores_gemma":[0.99971616,0.00008293264,0.000017641676,0.0001195618,0.000031106785,0.000032571603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007056045,0.00006285957,0.00008939946,0.000073880045,0.00007051654,0.000008719514,0.0000504954,0.000029950119,0.0000054101274],"category_scores_gemma":[0.000006545668,0.000061127655,0.000019901705,0.00048460328,0.000027818482,0.000021926198,0.000010421375,0.00006231833,0.00003877518],"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.000001254913,0.000016157843,0.00009380634,0.00002563744,0.00001638426,2.6342752e-7,0.00017547491,0.00030636915,0.0018792668,0.9957026,0.0009407181,0.00084204454],"study_design_scores_gemma":[0.0008379634,0.00017550997,0.0036746003,0.00006414692,0.00002359336,0.0000029041905,0.0006820427,0.013024837,0.023410147,0.8733613,0.08434592,0.00039706426],"about_ca_topic_score_codex":9.501673e-7,"about_ca_topic_score_gemma":2.503653e-7,"teacher_disagreement_score":0.12234135,"about_ca_system_score_codex":0.000006917829,"about_ca_system_score_gemma":0.000003265676,"threshold_uncertainty_score":0.24927133},"labels":[],"label_agreement":null},{"id":"W4366818668","doi":"10.1016/j.disc.2023.113476","title":"Some new results on skew frame starters in cyclic groups","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skew; Frame (networking); Mathematics; Property (philosophy); Construct (python library); Combinatorics; Discrete mathematics; Computer science; Telecommunications","score_opus":0.01660319553253778,"score_gpt":0.23144399839805008,"score_spread":0.2148408028655123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366818668","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.9888173,0.00008987626,0.0007981758,0.00020277183,0.0005515241,0.00029737657,0.00004759797,0.0007953635,0.008400015],"genre_scores_gemma":[0.9985474,0.0000468742,0.0003680738,0.00004011113,0.00014715629,0.000020835627,0.000034303794,0.0000574745,0.00073781935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998897,0.000026769787,0.0003895811,0.0001620629,0.00019740032,0.00032717982],"domain_scores_gemma":[0.999293,0.00016328492,0.000041022075,0.00040134517,0.0000050819112,0.00009623824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030740164,0.00018321512,0.00024940196,0.00020190408,0.00003171242,0.00004255041,0.00019344277,0.00009431704,0.00001245427],"category_scores_gemma":[0.000061393504,0.00016524916,0.00007984561,0.00041004684,0.000020506439,0.00010275518,0.00002393076,0.0001874342,0.00077677204],"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.00010292197,0.00014457414,0.00021499745,0.0020315181,0.00023051698,0.00021471342,0.051558875,0.03683617,0.0062067118,0.87028176,0.029209638,0.0029676012],"study_design_scores_gemma":[0.0025197975,0.00020292342,0.0024598327,0.0016083696,0.00003898834,0.00001226354,0.0049899826,0.1128998,0.0023192153,0.8657366,0.0060977507,0.0011144798],"about_ca_topic_score_codex":0.000009029632,"about_ca_topic_score_gemma":0.000015496707,"teacher_disagreement_score":0.07606363,"about_ca_system_score_codex":0.00003333091,"about_ca_system_score_gemma":0.000006623424,"threshold_uncertainty_score":0.9984092},"labels":[],"label_agreement":null},{"id":"W4367860060","doi":"10.48550/arxiv.2305.01193","title":"Wickets in 3-uniform Hypergraphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Hypergraph; Combinatorics; Vertex (graph theory); Mathematics; Row; Conjecture; Matrix (chemical analysis); Discrete mathematics; Computer science; Graph","score_opus":0.062176183342349804,"score_gpt":0.15829953369578065,"score_spread":0.09612335035343084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367860060","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.98156327,0.00011528949,0.0025290353,0.000009930115,0.0015415655,0.00027051676,0.000035194378,0.00093697314,0.012998197],"genre_scores_gemma":[0.99759656,0.00034649653,0.00001604618,0.000008630348,0.000061143706,0.000002391544,0.00003151525,0.000062838284,0.0018743634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988038,0.000061518134,0.00021293129,0.0004913272,0.000055073528,0.0003753301],"domain_scores_gemma":[0.999103,0.0000605341,0.00005232795,0.0006444447,0.000028049144,0.00011165553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023741249,0.00031031336,0.00035318994,0.0005894986,0.000047885485,0.000029166808,0.00055887917,0.0003853428,0.00003943126],"category_scores_gemma":[0.000010668553,0.00038857874,0.0002072699,0.00059487857,0.000067686495,0.00011633754,0.00026642255,0.0006574276,0.00036726528],"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.000021375292,0.000027676295,0.009620727,0.00036538258,0.00012929739,0.0006416305,0.00035358733,0.9351802,0.00008132268,0.05290001,0.0005600414,0.00011877748],"study_design_scores_gemma":[0.0015782965,0.000058075704,0.018749075,0.0010735053,0.00017200042,0.00001500954,0.0016954797,0.62940335,0.00039943375,0.34093642,0.003716408,0.0022029488],"about_ca_topic_score_codex":0.00014320185,"about_ca_topic_score_gemma":0.00049001956,"teacher_disagreement_score":0.30577683,"about_ca_system_score_codex":0.00014183167,"about_ca_system_score_gemma":0.000028444001,"threshold_uncertainty_score":0.9998566},"labels":[],"label_agreement":null},{"id":"W4376143266","doi":"10.1007/s00493-023-00031-w","title":"Stronger Counterexamples to the Topological Tverberg Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Mathematics; Combinatorics; Conjecture; Disjoint sets; Embedding; Equivariant map; Continuous map; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.012019137954067779,"score_gpt":0.20605481547363724,"score_spread":0.19403567751956946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376143266","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.9796927,0.00047893074,0.0004320915,0.0009996174,0.0030719638,0.0003083033,0.000018023864,0.0012042371,0.013794154],"genre_scores_gemma":[0.9989747,0.000017350225,0.0000052480973,0.000095598065,0.0000852042,0.000052609812,0.000005361245,0.0000179995,0.00074596284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993247,0.000043994256,0.000117608084,0.00012731436,0.00012543536,0.00026097786],"domain_scores_gemma":[0.99950045,0.00011429084,0.000010048905,0.00028651237,0.000016311817,0.00007235721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017283902,0.00011588874,0.00013144188,0.000049905182,0.00010990894,0.000036152655,0.00028362073,0.000068597816,0.000119870165],"category_scores_gemma":[0.00002572265,0.00007606633,0.00005483632,0.00045884412,0.000026898602,0.000028409924,0.00005106062,0.00014487427,0.0009234166],"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.000011272819,0.000025967416,0.0014163763,0.000040661693,0.00008605829,0.000037547336,0.0012746415,0.004428162,0.00076045457,0.7314246,0.25857556,0.0019186682],"study_design_scores_gemma":[0.00029397573,0.000095975905,0.013291061,0.000021205075,0.000014581061,0.000013978698,0.000616587,0.0008555023,0.0008504668,0.033395346,0.9502572,0.00029416906],"about_ca_topic_score_codex":0.000005704327,"about_ca_topic_score_gemma":0.0000032720945,"teacher_disagreement_score":0.6980293,"about_ca_system_score_codex":0.000032002943,"about_ca_system_score_gemma":0.000004633537,"threshold_uncertainty_score":0.9998545},"labels":[],"label_agreement":null},{"id":"W4376644826","doi":"10.1080/03081087.2023.2212317","title":"Real Schur norms and Hadamard matrices","year":2023,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","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":"Mount Allison University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Schur product theorem; Algebra over a field; Hadamard product; Pure mathematics; Computer science; Schur complement; Schur decomposition; Physics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.008597101368412189,"score_gpt":0.2230587375097344,"score_spread":0.21446163614132221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376644826","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.9963202,0.0006091884,0.000069081565,0.000034638066,0.00032646707,0.0001392061,0.000025196356,0.0007373485,0.0017386714],"genre_scores_gemma":[0.9966354,0.0017926809,0.0004400237,0.0000210031,0.0002467786,0.00001368671,0.000026921338,0.00004031343,0.0007832259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992191,0.000021750975,0.00019455719,0.00020007209,0.00010624697,0.00025828023],"domain_scores_gemma":[0.99960154,0.00007073388,0.000018419185,0.00016336668,0.000019911851,0.0001260009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020620941,0.00016423056,0.00019690159,0.00012921452,0.000098438955,0.0000469281,0.000076814744,0.00010539252,0.00002281719],"category_scores_gemma":[0.000018289762,0.00014149214,0.000043090306,0.0002624811,0.00005772988,0.0001177976,0.000047733763,0.00013975662,0.00016539301],"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.00083595567,0.0004158364,0.1963092,0.010333315,0.0023281178,0.0010414316,0.026534209,0.015953587,0.2163701,0.080674,0.03635838,0.41284588],"study_design_scores_gemma":[0.0027267651,0.00018126886,0.06621354,0.00018497359,0.0001082313,0.000098155106,0.0015515799,0.83016455,0.011825608,0.0022513047,0.08343164,0.0012624025],"about_ca_topic_score_codex":0.000039615312,"about_ca_topic_score_gemma":0.0000128748125,"teacher_disagreement_score":0.81421095,"about_ca_system_score_codex":0.0000050947037,"about_ca_system_score_gemma":0.0000051512925,"threshold_uncertainty_score":0.5769882},"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":"W4380186445","doi":"10.48550/arxiv.2306.05039","title":"Powers of Karpelevic arcs and their Sparsest Realising matrices","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Arc (geometry); Eigenvalues and eigenvectors; Mathematics; Disjoint sets; Matrix (chemical analysis); Boundary (topology); Combinatorics; Order (exchange); Characterization (materials science); Discrete mathematics; Mathematical analysis; Geometry; Physics","score_opus":0.06286155144869011,"score_gpt":0.16196829901582155,"score_spread":0.09910674756713143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380186445","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.9889638,0.000540521,0.0060457545,0.000006193258,0.0006563867,0.00018552422,0.00008515342,0.0003897167,0.0031269703],"genre_scores_gemma":[0.9985846,0.0009837857,0.000022121634,0.000003518748,0.000045909648,4.7935913e-7,0.000019525281,0.00004571736,0.00029431548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990715,0.00006945487,0.00020206244,0.00038491015,0.00004102009,0.00023110167],"domain_scores_gemma":[0.99914175,0.00012767315,0.000116666895,0.0004804454,0.000041429594,0.000092011716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022504591,0.00027017668,0.000385653,0.00032573144,0.000053538566,0.00002894826,0.00033857423,0.0002348379,0.000011997947],"category_scores_gemma":[0.000012133297,0.00028931856,0.00014631958,0.0004006147,0.00010692075,0.00009333724,0.00024637952,0.00031895598,0.000020004389],"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.00006230979,0.00004052531,0.014398919,0.0029374266,0.00071649556,0.0002500894,0.0020206992,0.92449796,0.0015486705,0.052485228,0.00055376376,0.00048788672],"study_design_scores_gemma":[0.0024108,0.00024013943,0.025357567,0.005368913,0.0010328727,0.00006643491,0.016635718,0.63155615,0.008020787,0.3015109,0.0035156088,0.004284115],"about_ca_topic_score_codex":0.00017436821,"about_ca_topic_score_gemma":0.000056239616,"teacher_disagreement_score":0.29294187,"about_ca_system_score_codex":0.000048660586,"about_ca_system_score_gemma":0.000020051848,"threshold_uncertainty_score":0.9999559},"labels":[],"label_agreement":null},{"id":"W4380354320","doi":"10.1007/978-981-99-2295-6_11","title":"Beyond the Current Book","year":2023,"lang":"en","type":"book-chapter","venue":"Behaviormetrics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Current (fluid); Computer science; Engineering; Electrical engineering","score_opus":0.03014847688405559,"score_gpt":0.23477593381849293,"score_spread":0.20462745693443735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380354320","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.00019917553,0.035483085,0.00017184601,0.00002006782,0.011561015,0.000732505,0.0002988909,0.0013246682,0.9502087],"genre_scores_gemma":[0.0061644786,0.0065021846,0.0000113107335,0.000049582606,0.00077203073,0.00010285804,0.0001566282,0.00039321303,0.9858477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867004,0.000011338351,0.00037194608,0.00022698188,0.00042455233,0.00029516232],"domain_scores_gemma":[0.9990532,0.00013308156,0.00007717838,0.0005930069,0.000052282678,0.00009128406],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027738497,0.00036731252,0.00031555168,0.0005789551,0.00010596832,0.00006428267,0.00042743378,0.0002675687,0.00021767875],"category_scores_gemma":[0.0000143301395,0.00028736974,0.00027150067,0.00029228794,0.00006426658,0.00005790849,0.00007047558,0.0008577766,0.0020044737],"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.0000034846894,0.000020556034,0.00007000307,0.00029647895,0.000113243696,0.000070298935,0.00018743961,0.00014091215,0.000015574871,0.4051822,0.26620704,0.32769275],"study_design_scores_gemma":[0.0000837453,0.000019755593,0.00015764522,0.000085663814,0.0001820831,0.000008576587,0.000006644871,0.000034213936,0.000018618046,0.011693494,0.9873083,0.00040123917],"about_ca_topic_score_codex":0.0000012991746,"about_ca_topic_score_gemma":0.00000391841,"teacher_disagreement_score":0.7211013,"about_ca_system_score_codex":0.000084386265,"about_ca_system_score_gemma":0.000022198044,"threshold_uncertainty_score":0.99995786},"labels":[],"label_agreement":null},{"id":"W4381615661","doi":"10.1016/j.jctb.2023.06.003","title":"On 2-cycles of graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Skew; Graph; Cycle basis; Vertex (graph theory); Discrete mathematics; Physics; Line graph; Graph power","score_opus":0.007034065921966524,"score_gpt":0.2091723375639919,"score_spread":0.20213827164202536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381615661","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.9816843,0.0002102088,0.00004654674,0.00002152953,0.010782274,0.00005900319,0.00000590096,0.000095998075,0.007094212],"genre_scores_gemma":[0.9995241,0.00010101877,0.00001078014,0.0000062032627,0.00021620527,0.0000017019704,8.191363e-7,0.00002449145,0.000114646966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998925,0.0001476727,0.00045618854,0.00005363166,0.0002574619,0.00016009044],"domain_scores_gemma":[0.99918866,0.00032062395,0.00016412335,0.00016519053,0.00009292965,0.00006844531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011024029,0.00012470716,0.00032707755,0.00028852382,0.00004395144,0.0000164368,0.00024227954,0.00007925177,0.000059988804],"category_scores_gemma":[0.00012462295,0.00010426253,0.00019490634,0.0004175215,0.00008388568,0.00019170852,0.000016067052,0.00019503373,0.000018202292],"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.00045750572,0.000028174309,0.00006595342,0.00006315419,0.00012709414,0.000025694733,0.00042002264,0.0014735805,0.004801169,0.99009174,0.0019380852,0.0005077997],"study_design_scores_gemma":[0.0006229215,0.0004340559,0.00030400534,0.000114846276,0.000020993428,0.000028734543,0.0005428962,0.000014420771,0.020991065,0.97366774,0.003153217,0.00010508909],"about_ca_topic_score_codex":3.1227304e-7,"about_ca_topic_score_gemma":1.2183806e-7,"teacher_disagreement_score":0.017839806,"about_ca_system_score_codex":0.000015783748,"about_ca_system_score_gemma":0.000015430476,"threshold_uncertainty_score":0.42517027},"labels":[],"label_agreement":null},{"id":"W4382776389","doi":"10.37236/11990","title":"Hadamard Matrices related to Projective Planes","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hadamard transform; Hadamard matrix; Combinatorics; Projective plane; Projective test; Order (exchange); Matrix (chemical analysis); Complex Hadamard matrix; Pure mathematics; Hadamard's inequality; Hadamard's maximal determinant problem; Geometry; Mathematical analysis; Composite material","score_opus":0.004127754479292991,"score_gpt":0.20626214929694514,"score_spread":0.20213439481765216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382776389","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.99111766,0.003385751,0.0004692195,0.00043608143,0.0014242403,0.0001994098,0.0000014580551,0.0001950976,0.0027710595],"genre_scores_gemma":[0.9989458,0.00047512513,0.0000010814771,0.000015480371,0.000051771378,0.0000053577223,7.0395294e-7,0.000025743993,0.00047896625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988513,0.000092384194,0.0003131142,0.00006120545,0.00025683304,0.0004251354],"domain_scores_gemma":[0.99943775,0.00015958458,0.00009577332,0.00014853186,0.00008240246,0.00007595434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011306899,0.00011897309,0.0002034221,0.0002342139,0.0000874789,0.000029061346,0.00037416234,0.000058426354,0.0000063420152],"category_scores_gemma":[0.000060520528,0.000081399376,0.000111312955,0.0012423337,0.000016154847,0.00009300452,0.00002116504,0.00049867044,0.00008761043],"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.00008322819,0.000034530512,0.00037262848,0.00005881805,0.00055934454,0.000046282097,0.0030961842,0.014206849,0.0012911282,0.96279496,0.016680405,0.00077565905],"study_design_scores_gemma":[0.00061233074,0.0005887567,0.00065550295,0.00007496566,0.00008380988,0.00038584988,0.0012812212,0.00093349966,0.0016651292,0.9700743,0.023414545,0.00023009666],"about_ca_topic_score_codex":0.0000020530517,"about_ca_topic_score_gemma":0.0000015403874,"teacher_disagreement_score":0.01327335,"about_ca_system_score_codex":0.00015261001,"about_ca_system_score_gemma":0.000091794296,"threshold_uncertainty_score":0.33193702},"labels":[],"label_agreement":null},{"id":"W4383497952","doi":"10.1016/j.jmaa.2023.127583","title":"On a characterization theorem in the space <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">R</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math>","year":2023,"lang":"lv","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Linear subspace; Distribution (mathematics); Real line; Subspace topology; Gaussian; Random variable; Conditional probability distribution; Discrete mathematics; Combinatorics; Mathematical analysis; Pure mathematics; Statistics","score_opus":0.015369399909667705,"score_gpt":0.23567479603277408,"score_spread":0.22030539612310637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383497952","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.7668623,0.00034530874,0.014980876,0.0014891932,0.00047735986,0.00005652601,0.00015357877,0.00010666768,0.2155282],"genre_scores_gemma":[0.9954778,0.00073629187,0.001053824,0.00035071358,0.000936306,0.00068518816,0.00033934406,0.00023540093,0.0001851506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497944,0.0003011354,0.0016196447,0.0007035759,0.0014073185,0.0009888673],"domain_scores_gemma":[0.99528486,0.0013865309,0.0013969626,0.0013087108,0.00011679093,0.00050612533],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023078264,0.0004658487,0.00034675936,0.0006068298,0.00083509285,0.0009860775,0.0011750543,0.0009091877,0.09595526],"category_scores_gemma":[0.00050801923,0.00066088093,0.0013298239,0.0019163556,0.00054076983,0.00064044876,0.00043224706,0.001051905,0.0011435867],"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.00032065492,0.0002676488,0.000008642738,0.0008613503,0.0018457937,0.00028117024,0.0023963118,0.0030583178,0.0023610853,0.974616,0.012793761,0.0011892953],"study_design_scores_gemma":[0.001922263,0.0010024676,0.0004204397,0.0016108197,0.005059253,0.0018209493,0.006674395,0.53652084,0.43535703,0.0055845324,0.0026725975,0.0013544137],"about_ca_topic_score_codex":0.00015960993,"about_ca_topic_score_gemma":0.00014135247,"teacher_disagreement_score":0.96903145,"about_ca_system_score_codex":0.000010183983,"about_ca_system_score_gemma":0.00028032792,"threshold_uncertainty_score":0.99963415},"labels":[],"label_agreement":null},{"id":"W4385229717","doi":"10.48550/arxiv.2307.11246","title":"On the minisymposium problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Combinatorics; Mathematics; Context (archaeology); Factorization; Decomposition; Discrete mathematics; Algorithm","score_opus":0.06270216774098923,"score_gpt":0.15098389347153113,"score_spread":0.0882817257305419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385229717","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.93114996,0.00005166801,0.00666029,0.0001626895,0.0022682194,0.0007186882,0.00006572832,0.0015983796,0.057324372],"genre_scores_gemma":[0.9930265,0.00007209625,0.0000072303224,0.000031974978,0.00008396639,0.000004522816,0.000013742811,0.000056524987,0.006703472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901617,0.00010127285,0.00013947756,0.00041132394,0.00005841128,0.00027333148],"domain_scores_gemma":[0.9988691,0.00020538039,0.000055019533,0.00076668453,0.00002924937,0.00007453638],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002522121,0.0002711804,0.00021566483,0.0001480759,0.00011092573,0.000047491132,0.00066972803,0.00024610202,0.000063063126],"category_scores_gemma":[0.00001031032,0.0002379653,0.00020056813,0.0003278029,0.00006722196,0.00004242601,0.00023777441,0.0005849228,0.0008702848],"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.000012764756,0.000013432111,0.00012060728,0.00014214963,0.00013252757,0.00008911905,0.00017939408,0.5820431,0.00006629266,0.4122695,0.0049156975,0.00001542064],"study_design_scores_gemma":[0.00049874786,0.000087976834,0.0005177031,0.00071141194,0.000213662,0.0000057293087,0.0008256207,0.24769054,0.0007523187,0.7405478,0.0069252867,0.0012232418],"about_ca_topic_score_codex":0.000021044068,"about_ca_topic_score_gemma":0.000019042009,"teacher_disagreement_score":0.33435255,"about_ca_system_score_codex":0.00008089242,"about_ca_system_score_gemma":0.00002071568,"threshold_uncertainty_score":0.9999077},"labels":[],"label_agreement":null},{"id":"W4385269515","doi":"10.1142/9789811234378_0046","title":"Hadamard Matrix Discovery","year":2023,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Hadamard transform; Computer science; Mathematics; Mathematical analysis","score_opus":0.017290615802448894,"score_gpt":0.20693882664771246,"score_spread":0.18964821084526357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385269515","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.00022878558,0.00036809195,0.000088085326,0.0000095800415,0.0120072495,0.00033176402,0.0001700361,0.0011573796,0.98563904],"genre_scores_gemma":[0.018005973,0.0000017780887,0.000022522952,0.000010804655,0.00033802248,0.00002812803,0.00007545975,0.0001966583,0.9813207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980191,0.000016733959,0.00045777368,0.0005584803,0.00050782517,0.00044011165],"domain_scores_gemma":[0.99873775,0.00007531887,0.00008411646,0.00092542905,0.00004135842,0.00013600731],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058708835,0.00043435264,0.00044837617,0.000809274,0.00025820642,0.0005937276,0.0004798654,0.00019793554,0.00021813539],"category_scores_gemma":[0.000003120077,0.00043412307,0.0003439551,0.00009391778,0.00029618654,0.00009362281,0.00010257467,0.0004796588,0.0034702155],"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.0000055598593,0.0000022370716,0.0000026008656,0.0002659306,0.00013114503,0.000080161364,0.00019359817,0.00022983128,0.0008559564,0.8260057,0.17114022,0.0010870693],"study_design_scores_gemma":[0.00009300847,0.0000055336686,0.0000032782102,0.00042890426,0.00004846965,0.0000059928575,0.000013557711,0.00014105462,0.0003415109,0.061674476,0.93674177,0.0005024204],"about_ca_topic_score_codex":0.0000014012536,"about_ca_topic_score_gemma":0.0007175783,"teacher_disagreement_score":0.7656016,"about_ca_system_score_codex":0.00007592334,"about_ca_system_score_gemma":0.000039569313,"threshold_uncertainty_score":0.99981105},"labels":[],"label_agreement":null},{"id":"W4385585618","doi":"10.26493/1855-3974.2835.8f0","title":"On the minisymposium problem","year":2023,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","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":"Carleton University; University of Toronto; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Combinatorics; Mathematics; Context (archaeology); Factorization; Graph; Discrete mathematics; Algorithm","score_opus":0.018478833660245924,"score_gpt":0.20446352596479575,"score_spread":0.18598469230454984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385585618","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.5880986,0.00008412192,0.0005996555,0.00207217,0.00052519137,0.0010428954,0.000017138525,0.002100747,0.40545946],"genre_scores_gemma":[0.9972828,0.0000068363765,0.000049764574,0.00010181467,0.000024850387,0.00017331088,0.0000048442084,0.00004413278,0.0023116553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909526,0.00005921705,0.00027396673,0.00013148173,0.00019011398,0.00024998278],"domain_scores_gemma":[0.9989232,0.00054573093,0.000035508252,0.0004243124,0.000017264456,0.000054007873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063012075,0.00016370401,0.00019603994,0.000077610894,0.00009706654,0.000048210568,0.0002580668,0.000054968303,0.000108784996],"category_scores_gemma":[0.000040788193,0.000105732484,0.000094264855,0.0003247735,0.000050109596,0.00005241203,0.000019445532,0.00012266097,0.002837328],"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.000008923814,0.000029007817,0.000016540696,0.00032838766,0.000095603085,0.000025539968,0.002803251,0.00036415402,0.0047811153,0.9318729,0.05950267,0.00017188906],"study_design_scores_gemma":[0.00070361677,0.00013328035,0.0000539956,0.0006126201,0.000040463263,0.000039762937,0.002426866,0.023625359,0.008233329,0.9355518,0.02792404,0.0006548323],"about_ca_topic_score_codex":0.0000010561206,"about_ca_topic_score_gemma":0.0000011122164,"teacher_disagreement_score":0.4091842,"about_ca_system_score_codex":0.000010735685,"about_ca_system_score_gemma":0.000006273311,"threshold_uncertainty_score":0.99793905},"labels":[],"label_agreement":null},{"id":"W4385724459","doi":"10.1038/s41598-023-39621-5","title":"Encryption in phase space for classical coherent optical communications","year":2023,"lang":"en","type":"article","venue":"Scientific Reports","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":"McGill University; Quantropi (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Encryption; Phase (matter); Theoretical computer science; Computer security; Physics; Quantum mechanics","score_opus":0.034693553455217185,"score_gpt":0.29824296639059467,"score_spread":0.2635494129353775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385724459","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.9849413,0.00012474722,0.0036051748,0.00024705296,0.0059091076,0.0006089037,0.0000058303167,0.00046053584,0.00409732],"genre_scores_gemma":[0.9984663,0.000003982801,0.00035265333,0.000002393207,0.000030742445,0.00018347152,0.000090024805,0.000012685204,0.0008577443],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990598,0.000027469461,0.00032506077,0.00021964342,0.00015050177,0.00021755608],"domain_scores_gemma":[0.9990203,0.00007766822,0.000036502657,0.000763239,0.00003403767,0.00006826058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012602384,0.00007301823,0.00011684886,0.00017627473,0.00012424166,0.0000914325,0.00013119084,0.000053755597,0.000016172798],"category_scores_gemma":[0.00008132403,0.00007166788,0.0000617421,0.0005988476,0.00012888167,0.00008442138,0.000036090998,0.00008925949,0.000058378468],"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.000048416758,0.0007495274,0.0028558972,0.00045033183,0.000081592414,0.00035594965,0.0038080183,0.014339151,0.6015961,0.15444723,0.19561481,0.025652967],"study_design_scores_gemma":[0.0010708893,0.000072891824,0.0010788331,0.00017323044,0.000028302638,0.00010866509,0.00095583475,0.26176542,0.028020032,0.09579288,0.61045235,0.00048063506],"about_ca_topic_score_codex":0.0000014382308,"about_ca_topic_score_gemma":0.000027521735,"teacher_disagreement_score":0.5735761,"about_ca_system_score_codex":0.00003880402,"about_ca_system_score_gemma":0.0000191339,"threshold_uncertainty_score":0.2922531},"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":"W4386211521","doi":"10.36227/techrxiv.24038001.v1","title":"Generalized Inverse Binary Matrix Construction for Public Key Cryptography Applications","year":2023,"lang":"en","type":"preprint","venue":"","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 Victoria","funders":"","keywords":"McEliece cryptosystem; Mathematics; Binary number; Inverse; Cryptography; Matrix (chemical analysis); Cryptosystem; Key (lock); Key generation; Discrete mathematics; Algorithm; Arithmetic; Combinatorics; Computer science","score_opus":0.03228620764382252,"score_gpt":0.2516458305483331,"score_spread":0.2193596229045106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386211521","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.09091837,0.0010203104,0.87726885,0.0004611522,0.007064135,0.005384783,0.0007907575,0.008371517,0.008720115],"genre_scores_gemma":[0.7062936,0.0020572483,0.24229285,0.00016980355,0.0029117677,0.035635296,0.005286251,0.0008257592,0.0045274682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987359,0.00004642842,0.00041424634,0.00037623345,0.00012617104,0.0003010235],"domain_scores_gemma":[0.9990395,0.00006582222,0.000083403625,0.0005947938,0.000096185715,0.00012030996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026481802,0.00029508828,0.00033598254,0.0005898575,0.00012537494,0.00012469213,0.0003048327,0.00039499672,0.00009421755],"category_scores_gemma":[0.000009493684,0.0003104765,0.00037735043,0.00045434933,0.00007821583,0.00008221026,0.00011752277,0.00027779886,0.0001331393],"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.000023545075,0.000034619097,0.0005400186,0.002132732,0.0006777368,0.000001669695,0.0001619005,0.03195337,0.0024177514,0.92140365,0.039206717,0.0014462955],"study_design_scores_gemma":[0.0014401344,0.000055233693,0.00018806584,0.0001693024,0.00026859745,0.000023442843,0.0010189349,0.10722893,0.0010981576,0.54084885,0.34600687,0.0016534572],"about_ca_topic_score_codex":0.000025162262,"about_ca_topic_score_gemma":0.000029067893,"teacher_disagreement_score":0.634976,"about_ca_system_score_codex":0.000043508473,"about_ca_system_score_gemma":0.00003293086,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W4386212980","doi":"10.36227/techrxiv.24038001","title":"Generalized Inverse Binary Matrix Construction for Public Key Cryptography Applications","year":2023,"lang":"en","type":"preprint","venue":"","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 Victoria","funders":"","keywords":"McEliece cryptosystem; Mathematics; Binary number; Inverse; Cryptography; Matrix (chemical analysis); Cryptosystem; Key (lock); Key generation; Discrete mathematics; Algorithm; Arithmetic; Combinatorics; Computer science","score_opus":0.03228620764382252,"score_gpt":0.2516458305483331,"score_spread":0.2193596229045106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386212980","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.09091837,0.0010203104,0.87726885,0.0004611522,0.007064135,0.005384783,0.0007907575,0.008371517,0.008720115],"genre_scores_gemma":[0.7062936,0.0020572483,0.24229285,0.00016980355,0.0029117677,0.035635296,0.005286251,0.0008257592,0.0045274682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987359,0.00004642842,0.00041424634,0.00037623345,0.00012617104,0.0003010235],"domain_scores_gemma":[0.9990395,0.00006582222,0.000083403625,0.0005947938,0.000096185715,0.00012030996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026481802,0.00029508828,0.00033598254,0.0005898575,0.00012537494,0.00012469213,0.0003048327,0.00039499672,0.00009421755],"category_scores_gemma":[0.000009493684,0.0003104765,0.00037735043,0.00045434933,0.00007821583,0.00008221026,0.00011752277,0.00027779886,0.0001331393],"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.000023545075,0.000034619097,0.0005400186,0.002132732,0.0006777368,0.000001669695,0.0001619005,0.03195337,0.0024177514,0.92140365,0.039206717,0.0014462955],"study_design_scores_gemma":[0.0014401344,0.000055233693,0.00018806584,0.0001693024,0.00026859745,0.000023442843,0.0010189349,0.10722893,0.0010981576,0.54084885,0.34600687,0.0016534572],"about_ca_topic_score_codex":0.000025162262,"about_ca_topic_score_gemma":0.000029067893,"teacher_disagreement_score":0.634976,"about_ca_system_score_codex":0.000043508473,"about_ca_system_score_gemma":0.00003293086,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W4386351978","doi":"10.1016/j.jcta.2023.105803","title":"Constructing uniform 2-factorizations via row-sum matrices: Solutions to the Hamilton-Waterloo problem","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Agencia Nacional de Promoción Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Agencia Nacional de Promoción de la Investigación, el Desarrollo Tecnológico y la Innovación; Universidad Nacional de San Luis; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Dihedral group; Mathematics; Combinatorics; Cayley graph; Factorization; Abelian group; Group (periodic table); Matrix (chemical analysis); Construct (python library); Spectrum (functional analysis); Discrete mathematics; Computer science; Algorithm; Graph","score_opus":0.00954778292910096,"score_gpt":0.2026864869044561,"score_spread":0.19313870397535512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386351978","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.86014336,0.0009035937,0.046808522,0.001458744,0.06847076,0.0015666388,0.00014482126,0.0013407301,0.019162802],"genre_scores_gemma":[0.99828917,0.000076332726,0.00020520278,0.000019976005,0.00096104975,0.000018886105,0.000006285231,0.000044535853,0.00037857253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834037,0.00020197997,0.00064979855,0.00010133621,0.00031056014,0.0003959612],"domain_scores_gemma":[0.998887,0.00028256912,0.00020236066,0.0002540653,0.00022613333,0.00014786117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016510009,0.00019925775,0.0003148593,0.00027362452,0.0004180284,0.00014139737,0.00045557113,0.000102118895,0.000051867188],"category_scores_gemma":[0.000096658514,0.00014365456,0.00016942121,0.0011124677,0.00008914566,0.00048181662,0.0000595132,0.00034229257,0.000058167723],"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.00011211331,0.000022231981,0.0001266755,0.00007119165,0.000213801,0.000017891354,0.0044143265,0.008485109,0.001658132,0.9815507,0.0021928912,0.0011349716],"study_design_scores_gemma":[0.0010534425,0.00041672742,0.00009161789,0.00026426814,0.00013806824,0.00044429203,0.014592681,0.0006008148,0.0035309913,0.87319064,0.10520571,0.00047073737],"about_ca_topic_score_codex":0.000004926742,"about_ca_topic_score_gemma":0.00000999421,"teacher_disagreement_score":0.13814577,"about_ca_system_score_codex":0.00010568454,"about_ca_system_score_gemma":0.000049510905,"threshold_uncertainty_score":0.5858063},"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":"W4387271850","doi":"10.1214/23-ejs2148","title":"Nonregular designs from Paley’s Hadamard matrices: Generalized resolution, projectivity and hidden projection property","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Hadamard transform; Mathematics; Projection (relational algebra); Resolution (logic); Property (philosophy); Hadamard matrix; Algorithm; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.01688612921967763,"score_gpt":0.22148207553660249,"score_spread":0.20459594631692485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387271850","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.6824318,0.0041461554,0.31167737,0.00007455747,0.00067048677,0.00046817094,0.00013083953,0.0002175849,0.00018302043],"genre_scores_gemma":[0.9918903,0.00259285,0.0047897976,0.000008649788,0.0003009891,0.000016305787,0.000024632776,0.00004500045,0.0003314625],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986018,0.00018888837,0.00040109103,0.0001306859,0.00026090656,0.0004166579],"domain_scores_gemma":[0.9993981,0.00012158185,0.00015595368,0.00012046348,0.00013304604,0.000070861155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506646,0.00015893838,0.00027564683,0.00020020417,0.000108941305,0.000057286157,0.00011751652,0.00008284016,0.000014776341],"category_scores_gemma":[0.00007918865,0.00011786674,0.000048379577,0.00037785622,0.000041446063,0.00017138412,0.000015586356,0.0003539759,0.000009328043],"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.0031391059,0.00065268605,0.020090804,0.002811338,0.0069112694,0.00105458,0.016875805,0.032801595,0.26404962,0.16088335,0.25835907,0.23237078],"study_design_scores_gemma":[0.00970673,0.004116908,0.03790055,0.0010239971,0.0013949696,0.0017219571,0.0030827285,0.39793894,0.015680902,0.4419512,0.082790546,0.0026906068],"about_ca_topic_score_codex":0.00009429121,"about_ca_topic_score_gemma":0.00013090316,"teacher_disagreement_score":0.36513734,"about_ca_system_score_codex":0.00018981195,"about_ca_system_score_gemma":0.00017144751,"threshold_uncertainty_score":0.4806466},"labels":[],"label_agreement":null},{"id":"W4389992692","doi":"10.3336/gm.58.2.07","title":"Bush-type Butson Hadamard matrices","year":2023,"lang":"en","type":"article","venue":"Glasnik Matematicki","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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Hadamard transform; Mathematics; Hadamard's inequality; Hadamard matrix; Complex Hadamard matrix; Hadamard's maximal determinant problem; Hadamard three-lines theorem; Hadamard product; Combinatorics; Type (biology); Order (exchange); Matrix (chemical analysis); Pure mathematics; Discrete mathematics; Mathematical analysis; Chemistry","score_opus":0.010488157395222375,"score_gpt":0.20599120126204573,"score_spread":0.19550304386682335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389992692","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.96826935,0.0006922804,0.00036047684,0.00007602014,0.0024286364,0.00034037573,0.000015325948,0.0029871555,0.024830358],"genre_scores_gemma":[0.9976413,0.0001196703,0.00015141936,0.000023882652,0.000117605305,0.000039030245,0.000020775444,0.000055408014,0.0018308795],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988775,0.000048977166,0.00033883195,0.00015297053,0.00022193907,0.0003597274],"domain_scores_gemma":[0.99938035,0.00010271401,0.000042326177,0.0003558306,0.000035200846,0.00008356086],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042415617,0.00018683058,0.00027968796,0.00019113702,0.00008009429,0.00008094874,0.00023314488,0.00009442783,0.00022852632],"category_scores_gemma":[0.000037879192,0.00016757203,0.000074046184,0.00081170263,0.000025375393,0.00014568113,0.000037505528,0.00010796113,0.0076135844],"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.00013562749,0.00016550712,0.007275803,0.034914926,0.0013205432,0.000597611,0.010909795,0.058261782,0.06940853,0.13048676,0.6790924,0.0074307374],"study_design_scores_gemma":[0.0039262758,0.0006713032,0.022158604,0.005156374,0.0006104361,0.00049186824,0.011772464,0.35186198,0.06788041,0.13363607,0.39559808,0.0062361285],"about_ca_topic_score_codex":0.000008459085,"about_ca_topic_score_gemma":0.0000037788202,"teacher_disagreement_score":0.2936002,"about_ca_system_score_codex":0.000024268636,"about_ca_system_score_gemma":0.0000075594935,"threshold_uncertainty_score":0.9931591},"labels":[],"label_agreement":null},{"id":"W4390714308","doi":"10.55016/ojs/cdm.v17i2.67832","title":"On uniformly resolvable $(C_4,K_{1,3})$-designs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Resolution (logic); Class (philosophy); Complete graph; Discrete mathematics; Computer science","score_opus":0.011618421720882403,"score_gpt":0.24143616208692215,"score_spread":0.22981774036603975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714308","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.26800495,0.0006797322,0.56596214,0.001300196,0.0022454371,0.0032738978,0.004742517,0.0027352348,0.1510559],"genre_scores_gemma":[0.9970798,0.0000033611227,0.000707963,0.00010747644,0.00005386231,0.00039998628,0.00006684446,0.000047574897,0.0015331355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866354,0.00007517508,0.00036193203,0.00017439842,0.0003035112,0.00042143886],"domain_scores_gemma":[0.99897623,0.00020875766,0.000046023648,0.0005494697,0.000058098092,0.00016143089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057607674,0.00020303472,0.00027472634,0.00018031018,0.0005453243,0.00006149773,0.00034717514,0.000050245144,0.0005250017],"category_scores_gemma":[0.00015756511,0.00020078944,0.000121910394,0.0005425424,0.00002816867,0.000071054375,0.0000991965,0.00027323648,0.00038265076],"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.00001697861,0.00008296043,0.0000052621085,0.00007103639,0.00007294847,0.000011733725,0.0009838709,0.067330815,0.0025333865,0.904243,0.024547728,0.00010027714],"study_design_scores_gemma":[0.002293266,0.0010866321,0.00008592767,0.00031044937,0.00021918012,0.00014148057,0.006116873,0.1525592,0.0109720575,0.5468063,0.27743545,0.001973214],"about_ca_topic_score_codex":0.0000029346106,"about_ca_topic_score_gemma":0.0000028770341,"teacher_disagreement_score":0.72907484,"about_ca_system_score_codex":0.00025771733,"about_ca_system_score_gemma":0.00002564639,"threshold_uncertainty_score":0.81879556},"labels":[],"label_agreement":null},{"id":"W4390714624","doi":"10.55016/ojs/cdm.v17i1.69695","title":"Kn(λ) is fully {P5,C6}-decomposable","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Multigraph; Mathematics; Combinatorics; Lambda; Path (computing); Decomposition; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Physics; Computer science","score_opus":0.006452648171387555,"score_gpt":0.2344828851408915,"score_spread":0.22803023696950395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714624","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.42951354,0.0021086487,0.4464679,0.0030724593,0.003070479,0.0032125637,0.008502179,0.002833472,0.10121877],"genre_scores_gemma":[0.9961616,0.0000060853845,0.0012943334,0.00015704622,0.00007531576,0.00029111022,0.00006508818,0.000046096353,0.0019033194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987006,0.000053368054,0.00038702856,0.00017696775,0.00025909304,0.0004229457],"domain_scores_gemma":[0.9990965,0.0000956468,0.000046703837,0.00052273175,0.00007171428,0.00016671077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044190823,0.00019539925,0.0002962087,0.00013494387,0.00042929166,0.000070608825,0.00035709457,0.00004736653,0.001241714],"category_scores_gemma":[0.000065954904,0.00020356957,0.00014481401,0.00049693295,0.000027493454,0.00008353138,0.00014872315,0.00022378421,0.0005384888],"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.000024272878,0.0002672879,0.00009906024,0.00037343812,0.00041819937,0.0000340276,0.009040821,0.06358071,0.012963431,0.7316359,0.18096405,0.0005987611],"study_design_scores_gemma":[0.001559036,0.00029200368,0.00011773871,0.00014880576,0.00022519311,0.00020522873,0.0055800807,0.16381831,0.012071193,0.16104428,0.6533697,0.0015684015],"about_ca_topic_score_codex":0.0000033544372,"about_ca_topic_score_gemma":0.0000019656889,"teacher_disagreement_score":0.5705917,"about_ca_system_score_codex":0.00018262179,"about_ca_system_score_gemma":0.000023229904,"threshold_uncertainty_score":0.9996713},"labels":[],"label_agreement":null},{"id":"W4390932847","doi":"10.22457/apam.v28n1a01909","title":"Note on Wing Symmetric n-Sigraphs","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Wing; Mathematics; Combinatorics; Computer science; Physics","score_opus":0.033853019150894864,"score_gpt":0.259517534648334,"score_spread":0.22566451549743913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390932847","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.93277436,0.00025556298,0.0009163613,0.00007205263,0.00012178017,0.00021325388,0.000016127087,0.00032947757,0.06530102],"genre_scores_gemma":[0.99928087,0.00019748419,0.000329299,0.00004531911,0.00003567078,0.000015592685,0.0000042781962,0.000022989068,0.000068474445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993909,0.0000044077,0.00020808418,0.00008847281,0.00013100127,0.0001771066],"domain_scores_gemma":[0.999582,0.0001483824,0.000038322403,0.00016856089,0.0000146043685,0.000048158057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028277517,0.00011698461,0.00021516535,0.00023975957,0.000038049235,0.000014780528,0.00008424432,0.00006764885,0.000008441423],"category_scores_gemma":[0.000014400948,0.00010246583,0.000055089527,0.0005783536,0.000022524873,0.000025278094,0.000015812277,0.00008091877,0.00008622718],"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.000009553993,0.00006967393,0.000014379431,0.0019693812,0.00013172765,0.000006563329,0.0027996204,0.0027424807,0.023079092,0.94102114,0.013120864,0.015035522],"study_design_scores_gemma":[0.0007142306,0.0001914193,0.00065925735,0.00070607115,0.00008704579,0.00001353792,0.0036216972,0.022174248,0.18192513,0.77946776,0.009517964,0.0009216157],"about_ca_topic_score_codex":2.7451904e-7,"about_ca_topic_score_gemma":4.0339214e-7,"teacher_disagreement_score":0.16155335,"about_ca_system_score_codex":0.0000012743235,"about_ca_system_score_gemma":0.000002008316,"threshold_uncertainty_score":0.41784352},"labels":[],"label_agreement":null},{"id":"W4391127691","doi":"10.61091/jcmcc117-15","title":"Block Structured Hadamard matrices from certain arrays","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Block (permutation group theory); Mathematics; Hadamard matrix; Complex Hadamard matrix; Combinatorics; Column (typography); Arithmetic; Discrete mathematics; Geometry","score_opus":0.009221665411444858,"score_gpt":0.21659174214408744,"score_spread":0.20737007673264257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127691","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.9709799,0.00054195203,0.00075015746,0.000034933884,0.026556443,0.0001804998,0.000008815365,0.00023855355,0.00070873497],"genre_scores_gemma":[0.99681455,0.00008155058,0.0008643489,0.0000064839637,0.0021611562,0.0000017147713,0.0000038258663,0.000061025043,0.0000053711165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976587,0.00009916757,0.0010835879,0.00017553575,0.0005913743,0.0003916102],"domain_scores_gemma":[0.998092,0.00074888306,0.0004901819,0.00024916118,0.00020867473,0.00021111996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010790532,0.0003307857,0.00080229924,0.00030544482,0.00021424356,0.00023785162,0.00043486847,0.0002115801,0.000010515078],"category_scores_gemma":[0.0001723874,0.00029885734,0.00021228874,0.0006006387,0.00005324459,0.00017975054,0.00010984298,0.000489979,0.000012645352],"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.00021401145,0.00034030582,0.000895877,0.0012202854,0.0013322207,0.00028149324,0.009296824,0.009627537,0.020061655,0.9445715,0.007776914,0.004381393],"study_design_scores_gemma":[0.003598174,0.0002877875,0.00027288854,0.00051170087,0.00015786011,0.00008600103,0.0013848267,0.033953827,0.003176495,0.9534973,0.0025415916,0.0005315809],"about_ca_topic_score_codex":0.000008978814,"about_ca_topic_score_gemma":5.1455885e-7,"teacher_disagreement_score":0.025834614,"about_ca_system_score_codex":0.000056650468,"about_ca_system_score_gemma":0.000040520765,"threshold_uncertainty_score":0.99994636},"labels":[],"label_agreement":null},{"id":"W4391127864","doi":"10.61091/jcmcc117-17","title":"https://combinatorialpress.com/jcmcc-articles/volume-117/gregarious-y_5-tree-decompositions-of-tensor-product-of-complete-graphs/","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Tree (set theory); Mathematics; Decomposition; Product (mathematics); Physics; Chemistry; Geometry","score_opus":0.014530366808617037,"score_gpt":0.22737213290409172,"score_spread":0.21284176609547467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127864","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.9650376,0.00094088266,0.00170709,0.0000853006,0.03006774,0.00051662675,0.000017540366,0.0002543732,0.0013728862],"genre_scores_gemma":[0.99754226,0.00010331469,0.0012056644,0.0000049165396,0.0010027345,0.000006881338,0.000006800544,0.00011111344,0.000016321224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492943,0.0002730548,0.0026641893,0.0003493264,0.0011016636,0.0006823342],"domain_scores_gemma":[0.99572617,0.0009910872,0.0014084397,0.0006416865,0.00091102236,0.00032161278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026675046,0.000572037,0.0017647289,0.00083181716,0.00030938594,0.00015602779,0.0008492204,0.00028254613,0.000019512028],"category_scores_gemma":[0.0004126512,0.00056290155,0.00056350336,0.0015866932,0.00027733695,0.00035688965,0.00026176465,0.0007625899,0.000016563949],"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.00019731325,0.0007667807,0.0012728984,0.0017070087,0.00073482085,0.000060430495,0.0027104823,0.0019556982,0.025322061,0.96120703,0.0017761937,0.0022893026],"study_design_scores_gemma":[0.0071776533,0.0011512246,0.00055318174,0.0013195364,0.00040667164,0.00015313725,0.0010397603,0.027872093,0.016871344,0.94064015,0.0019360139,0.00087925524],"about_ca_topic_score_codex":0.000017602186,"about_ca_topic_score_gemma":6.116808e-7,"teacher_disagreement_score":0.032504693,"about_ca_system_score_codex":0.00008200077,"about_ca_system_score_gemma":0.00010038077,"threshold_uncertainty_score":0.99968225},"labels":[],"label_agreement":null},{"id":"W4391135163","doi":"10.13001/ela.2024.7779","title":"The allow sequence of distinct eigenvalues for a sign pattern","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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 British Columbia; The Scarborough Hospital; University of Toronto; Redeemer University; University of Victoria; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; American Institute of Mathematics","keywords":"Mathematics; Eigenvalues and eigenvectors; Sign (mathematics); Sequence (biology); Pure mathematics; Combinatorics; Mathematical analysis; Physics; Biology","score_opus":0.010694569745821806,"score_gpt":0.24141335960754337,"score_spread":0.23071878986172156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391135163","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.8155,0.04755835,0.13468769,0.00029819107,0.0012709027,0.00027433524,0.000024998435,0.000095876494,0.00028962028],"genre_scores_gemma":[0.9989943,0.00042892876,0.00004769956,0.000008749616,0.00036938765,0.0000064249743,0.0000015995206,0.000029741073,0.00011317653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896467,0.00005093747,0.00041502443,0.00007074525,0.00016395064,0.00033466285],"domain_scores_gemma":[0.99937475,0.00031539882,0.00007955359,0.00012176683,0.00006753472,0.000040969135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035497,0.00011104032,0.00018701695,0.000061031256,0.000063452644,0.00003735908,0.00025731963,0.00004341036,0.000013326321],"category_scores_gemma":[0.00004401262,0.000072041235,0.00021582993,0.00013500004,0.00004227384,0.00009373766,0.00000817495,0.00030732574,0.0000065699505],"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.00062332774,0.0001613244,0.0009367482,0.0028344241,0.0058697774,0.00016071378,0.0058609555,0.013848562,0.15756878,0.47935018,0.00828818,0.324497],"study_design_scores_gemma":[0.0020184957,0.0040636593,0.00046429594,0.0019421743,0.0007138969,0.0015244362,0.0012204378,0.21216603,0.14438805,0.36051005,0.26982823,0.0011602319],"about_ca_topic_score_codex":0.000002365619,"about_ca_topic_score_gemma":0.000010876337,"teacher_disagreement_score":0.32333678,"about_ca_system_score_codex":0.00006725268,"about_ca_system_score_gemma":0.00012028584,"threshold_uncertainty_score":0.29377562},"labels":[],"label_agreement":null},{"id":"W4391183289","doi":"10.1090/mawrld/031/04","title":"Codes and factoring","year":2023,"lang":"en","type":"book-chapter","venue":"Mathematical world","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Factoring; Computer science; Business; Accounting","score_opus":0.024795477130100822,"score_gpt":0.20733024218506332,"score_spread":0.1825347650549625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391183289","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.00016950673,0.00026222505,0.00056074775,0.00001945494,0.0003031538,0.00014706358,0.00002379735,0.00070579007,0.9978083],"genre_scores_gemma":[0.04047573,0.000035976853,0.00014345089,0.000010170025,0.00015888653,0.000016397602,0.000007539954,0.00014211613,0.9590097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992919,0.00000418939,0.00024697345,0.00014616032,0.00013938596,0.00017136794],"domain_scores_gemma":[0.9994432,0.00022561912,0.000024274736,0.00021189486,0.000008592771,0.00008642327],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012815396,0.00023522922,0.00037451522,0.00014005885,0.000034791563,0.000043300275,0.00009242799,0.00012025554,0.00049538567],"category_scores_gemma":[0.000011411796,0.00020941612,0.00008032089,0.000032974833,0.000050298517,0.000025206653,0.000039532522,0.00025193635,0.0013006246],"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":[8.2185437e-7,0.0000016281557,0.000002076018,0.00077719294,0.00007266607,0.000015908445,0.00013258551,0.000012457567,0.000026882311,0.99735636,0.0009981883,0.0006032365],"study_design_scores_gemma":[0.00006784318,0.0000070745527,0.000009535528,0.0009953725,0.00004914326,0.000010450505,0.000013586555,0.00075368886,0.00007282423,0.91135335,0.08631539,0.00035172014],"about_ca_topic_score_codex":2.3763467e-7,"about_ca_topic_score_gemma":0.000005215269,"teacher_disagreement_score":0.08600299,"about_ca_system_score_codex":0.000016669424,"about_ca_system_score_gemma":0.0000020769764,"threshold_uncertainty_score":0.99947697},"labels":[],"label_agreement":null},{"id":"W4391505413","doi":"10.4230/lipics.icalp.2024.21","title":"Oracle Separation of QMA and QCMA with Bounded Adaptivity","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Bounded function; Separation (statistics); Computer science; Mathematics; Mathematical economics; Programming language; Mathematical analysis; Machine learning","score_opus":0.033931879770174894,"score_gpt":0.15972773954720673,"score_spread":0.12579585977703184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391505413","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.9820618,0.0002901587,0.009273097,0.000004066363,0.00023373727,0.00018003883,0.000026804,0.00020513458,0.0077251834],"genre_scores_gemma":[0.999075,0.00006619875,0.000039244645,0.0000015981607,0.000029819781,8.011159e-7,0.000009172909,0.000023941011,0.00075420685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993561,0.00004762082,0.000107788794,0.00032016766,0.000041517702,0.00012682748],"domain_scores_gemma":[0.99951386,0.000027286334,0.000052118987,0.00031081497,0.000037931593,0.00005799712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012341069,0.00018420916,0.00024165469,0.00013909058,0.000036115434,0.000031768635,0.000127161,0.0001667262,0.000018286166],"category_scores_gemma":[0.0000027540916,0.00019116695,0.000064280204,0.0002301401,0.000088263936,0.00008197912,0.00015102085,0.00029906607,0.000016956232],"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.00026104922,0.00007340834,0.0045781317,0.0028932907,0.0008126703,0.00030170954,0.0010381484,0.61272436,0.0014188332,0.37510133,0.0002977063,0.0004993641],"study_design_scores_gemma":[0.0008768624,0.00020299351,0.0037088057,0.0010212666,0.0005839484,0.000026790074,0.00076773856,0.79606014,0.0033965863,0.19121194,0.001117557,0.0010253834],"about_ca_topic_score_codex":0.00006129961,"about_ca_topic_score_gemma":0.00012585532,"teacher_disagreement_score":0.18388939,"about_ca_system_score_codex":0.000050362414,"about_ca_system_score_gemma":0.000030727406,"threshold_uncertainty_score":0.7795562},"labels":[],"label_agreement":null},{"id":"W4391589431","doi":"10.1016/j.disc.2024.113908","title":"New weighing matrices via partitioned group actions","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Group action; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.012719165053318967,"score_gpt":0.23222383439495878,"score_spread":0.2195046693416398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391589431","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.028137472,0.0020806089,0.9325116,0.00008610544,0.0017441545,0.00021665287,0.000021266997,0.0017838163,0.033418313],"genre_scores_gemma":[0.99203384,0.000059387392,0.006779142,0.0000074025766,0.00026680753,0.000027820199,0.000015900217,0.00005256745,0.00075715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993363,0.000013003629,0.00023102712,0.00011142725,0.0001281305,0.00018009805],"domain_scores_gemma":[0.9996162,0.00008412446,0.000017875818,0.00019415944,0.00000696288,0.0000806535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001302889,0.00013738705,0.00014243311,0.00009463763,0.00007382881,0.00016028494,0.00010733381,0.000058860787,0.00026114364],"category_scores_gemma":[0.0000063726984,0.00011915658,0.00009989966,0.00026417815,0.000012574712,0.00022723414,0.000014691199,0.00012379517,0.0005038161],"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.0000034456293,0.00003343619,0.000019498466,0.0033057297,0.00035451076,0.000042296975,0.0078847,0.0029549566,0.01867407,0.94287795,0.016515851,0.007333542],"study_design_scores_gemma":[0.00026971244,0.00005249154,0.00003953972,0.0012985411,0.00028271534,0.000122871,0.0023402711,0.42600253,0.0058340994,0.4828712,0.08001662,0.0008693826],"about_ca_topic_score_codex":0.000004962024,"about_ca_topic_score_gemma":0.0000055100018,"teacher_disagreement_score":0.96389633,"about_ca_system_score_codex":0.00002503794,"about_ca_system_score_gemma":0.0000058608834,"threshold_uncertainty_score":0.64757055},"labels":[],"label_agreement":null},{"id":"W4391622594","doi":"10.61091/ars159-10","title":"Groups Generated by Pattern Avoiding Permutations","year":2024,"lang":"en","type":"preprint","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.008891041553598563,"score_gpt":0.2108900942415152,"score_spread":0.20199905268791662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391622594","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.9708074,0.0044666673,0.00039376417,0.0000524362,0.018514838,0.00030485052,0.00017557867,0.0011889101,0.0040956],"genre_scores_gemma":[0.9988563,0.00007721336,0.000006842032,0.000023211553,0.000050790233,0.00016973799,0.0003322334,0.00012668566,0.00035700056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863374,0.0001236943,0.00036429087,0.00038215242,0.00019046197,0.00030563536],"domain_scores_gemma":[0.9992891,0.00006769948,0.00004607171,0.00044362695,0.000047908223,0.00010558631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028171449,0.00036377812,0.0003360933,0.00014933085,0.00011897441,0.00021459132,0.0003140127,0.000352295,0.0000647483],"category_scores_gemma":[0.000015070694,0.00039911378,0.00016345966,0.0002209929,0.000027276268,0.00004615803,0.00024141668,0.0012386102,0.00038207104],"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.000006172584,0.00013479925,0.0007185344,0.0036496646,0.0014816589,0.00017147808,0.0064017256,0.0204441,0.02458811,0.75272614,0.1869218,0.002755782],"study_design_scores_gemma":[0.0003043309,0.000021367261,0.000066246255,0.00049950153,0.00013554974,0.000014057419,0.00028302852,0.041216433,0.0052497457,0.94855434,0.0028411706,0.0008142181],"about_ca_topic_score_codex":0.00003366933,"about_ca_topic_score_gemma":0.000004367948,"teacher_disagreement_score":0.19582818,"about_ca_system_score_codex":0.00012587289,"about_ca_system_score_gemma":0.000025819812,"threshold_uncertainty_score":0.9998461},"labels":[],"label_agreement":null},{"id":"W4391871600","doi":"10.48550/arxiv.2402.09335","title":"Efficient Unitary T-designs from Random Sums","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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":"Air Force Office of Scientific Research; Canadian Institute for Advanced Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Unitary state; Mathematics; Arithmetic; Combinatorics; Computer science; Discrete mathematics; Algebra over a field; Pure mathematics; Political science; Law","score_opus":0.04622874212836593,"score_gpt":0.15484395326852662,"score_spread":0.10861521114016069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391871600","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.95913637,0.0013615668,0.022503238,0.000009430467,0.0030786851,0.00037667586,0.00022951672,0.0010650218,0.012239486],"genre_scores_gemma":[0.9984982,0.000106125495,0.000025770438,0.000012881214,0.00019996354,0.0000022537738,0.00008173079,0.000074983014,0.0009981069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985385,0.00014662385,0.00023066839,0.0006629993,0.00007708395,0.0003441174],"domain_scores_gemma":[0.99880004,0.00016711,0.000050167888,0.00077089673,0.00004101214,0.00017079062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002286112,0.00042058504,0.00045172442,0.0003019703,0.0000787901,0.000066814995,0.0005644099,0.00040058207,0.0001804574],"category_scores_gemma":[0.000009428073,0.00047025818,0.00035701983,0.0004146043,0.00008437876,0.000027819931,0.00046913707,0.0009121603,0.0007088087],"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.00006735938,0.000026341044,0.000116249474,0.0002594013,0.00041742492,0.0005275499,0.00035477162,0.9722047,0.0003310123,0.024763023,0.00085928745,0.000072875104],"study_design_scores_gemma":[0.000963651,0.00001942287,0.00012716508,0.0004796939,0.00043072758,0.000003762355,0.00047220537,0.8952865,0.00042798356,0.100085095,0.00094199984,0.0007617752],"about_ca_topic_score_codex":0.00022251859,"about_ca_topic_score_gemma":0.000038851496,"teacher_disagreement_score":0.076918185,"about_ca_system_score_codex":0.00017461552,"about_ca_system_score_gemma":0.000049091286,"threshold_uncertainty_score":0.99977493},"labels":[],"label_agreement":null},{"id":"W4391940712","doi":"10.48550/arxiv.2402.10443","title":"Permutations with a Given X-Descent Set","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Descent (aeronautics); Set (abstract data type); Combinatorics; Mathematics; Computer science; Physics; Programming language","score_opus":0.040343045602219726,"score_gpt":0.15634530453019574,"score_spread":0.11600225892797601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391940712","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.95018536,0.00032646515,0.024756376,0.000032661115,0.0009071748,0.00039609725,0.00017683263,0.0010530575,0.022166],"genre_scores_gemma":[0.9974915,0.00006025171,0.000022325867,0.000008576908,0.00008804211,0.0000028568577,0.000046282265,0.0000528945,0.0022272752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912125,0.00004674643,0.00011739712,0.00043347225,0.000051703948,0.00022941963],"domain_scores_gemma":[0.9993192,0.000028521108,0.000045900033,0.00045154875,0.00004376716,0.00011108007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000081017504,0.0002710679,0.00023086046,0.00022029137,0.00006544934,0.00006121949,0.00029510577,0.00018788535,0.000074003205],"category_scores_gemma":[0.0000032719943,0.00027870055,0.00014390289,0.00035235132,0.00006653453,0.000055644374,0.00020141207,0.0005939458,0.0003185482],"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.000021435271,0.000018096764,0.00029588095,0.0006791715,0.0003791676,0.0005587128,0.00082431216,0.89649576,0.000064431515,0.099619634,0.00095887535,0.0000844987],"study_design_scores_gemma":[0.0010790896,0.00014471976,0.00094646827,0.0020466605,0.0012455295,0.000080072525,0.0035114624,0.7851885,0.0005593757,0.18961267,0.013378506,0.0022069425],"about_ca_topic_score_codex":0.0000352045,"about_ca_topic_score_gemma":0.00006218723,"teacher_disagreement_score":0.111307286,"about_ca_system_score_codex":0.00015060733,"about_ca_system_score_gemma":0.000050139275,"threshold_uncertainty_score":0.9999665},"labels":[],"label_agreement":null},{"id":"W4392583061","doi":"10.5267/j.msl.2024.3.002","title":"Multi-banking ATM system services using biometrics","year":2024,"lang":"en","type":"article","venue":"Management Science Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Biometrics; Computer science; Business; Computer security; Telecommunications","score_opus":0.013683571388369757,"score_gpt":0.22301992653607067,"score_spread":0.2093363551477009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392583061","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.88070697,0.0005409039,0.11017746,0.00010632605,0.0039282693,0.00027360627,0.0000030763397,0.0012605279,0.0030028694],"genre_scores_gemma":[0.9965606,0.000007349319,0.0031081943,0.00019660243,0.000065839056,0.000010415923,9.3381396e-7,0.000020582242,0.000029538347],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987254,0.000015523432,0.00017691674,0.0003141923,0.00038381072,0.00038412848],"domain_scores_gemma":[0.9996484,0.000014743698,0.000016955379,0.00025799024,0.000005818888,0.00005607509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007303704,0.00013942219,0.00010138987,0.0011906318,0.00019992785,0.0005234387,0.0004828226,0.000021773381,0.000005688849],"category_scores_gemma":[9.739173e-7,0.00012983748,0.000050205075,0.0037649164,0.00009776106,0.0004938243,0.000090519694,0.00007469224,0.00010938444],"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.000004132626,0.000034006214,0.0050464063,0.016612025,0.0003694589,0.0009900349,0.00318489,0.27460355,0.63008314,0.045616977,0.0010249335,0.022430452],"study_design_scores_gemma":[0.00009924433,0.0000042334336,0.0011097257,0.0006282075,0.00004039012,0.000015568156,0.0012024862,0.98863226,0.002125906,0.000023736175,0.0058430634,0.00027518632],"about_ca_topic_score_codex":0.000012228574,"about_ca_topic_score_gemma":7.954559e-7,"teacher_disagreement_score":0.7140287,"about_ca_system_score_codex":0.00021110906,"about_ca_system_score_gemma":0.0000016621344,"threshold_uncertainty_score":0.5294619},"labels":[],"label_agreement":null},{"id":"W4392644418","doi":"10.1007/s11082-024-06455-y","title":"High speed UOWC system using DP states with FRS-OCDMA code","year":2024,"lang":"en","type":"article","venue":"Optical and Quantum Electronics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optiwave Systems (Canada)","funders":"","keywords":"Computer science; Code (set theory); Code division multiple access; Telecommunications; Computer network; Programming language","score_opus":0.006319713956607698,"score_gpt":0.19393162891088828,"score_spread":0.1876119149542806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392644418","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.980022,0.008158286,0.0099839065,0.000047327463,0.00033668644,0.00013852936,0.00002037213,0.00055247976,0.0007403931],"genre_scores_gemma":[0.99925435,0.00019887861,0.00028429672,0.0000094968555,0.000109179484,0.0000051641973,0.000011320585,0.000053327884,0.00007401828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888986,0.000027577866,0.00021079718,0.00023774327,0.00014924571,0.0004847769],"domain_scores_gemma":[0.9996102,0.00008518403,0.000012600805,0.0001504757,0.000021780199,0.0001198021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018887712,0.00021150948,0.00025953408,0.00006593325,0.00008566194,0.00014766573,0.00008068095,0.00009743782,0.000011338267],"category_scores_gemma":[0.0000034371405,0.00015888932,0.0000454017,0.00022583753,0.0000634126,0.00011193874,0.00001551281,0.0002917199,0.000028761586],"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.00004329962,0.000014579763,0.000027950995,0.0008624763,0.00018211034,0.000097268065,0.00015096433,0.010536293,0.011046858,0.97625345,0.00010220012,0.00068252836],"study_design_scores_gemma":[0.00027876368,0.00027778943,0.00002202276,0.00041690827,0.000117281976,0.00032215827,0.00030450546,0.980838,0.00589944,0.0055099805,0.0056399885,0.00037314545],"about_ca_topic_score_codex":0.000014467541,"about_ca_topic_score_gemma":0.000014451432,"teacher_disagreement_score":0.9707435,"about_ca_system_score_codex":0.000091526366,"about_ca_system_score_gemma":0.000034810644,"threshold_uncertainty_score":0.6479318},"labels":[],"label_agreement":null},{"id":"W4392717403","doi":"10.1117/12.3005370","title":"Spatial Hadamard encoding with difference frequency generation","year":2024,"lang":"en","type":"article","venue":"","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":"Hadamard transform; Encoding (memory); Computer science; Arithmetic; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.01121489337668052,"score_gpt":0.18499857225555463,"score_spread":0.1737836788788741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392717403","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.6205349,0.0005289854,0.32416713,0.0000302802,0.0010129972,0.00009592028,0.0000031738844,0.0008171217,0.052809462],"genre_scores_gemma":[0.9987345,0.00001029372,0.00040703913,0.000011279129,0.00022373955,0.000016059033,0.0000055242444,0.000014894498,0.0005766821],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999627,0.000011608537,0.00008388195,0.00010059666,0.00007545276,0.00010146425],"domain_scores_gemma":[0.9998571,0.0000141232495,0.0000034272832,0.000088778834,0.000007992858,0.00002853706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054752567,0.00007963986,0.0000630151,0.00004520631,0.000030512474,0.00007935164,0.000045493056,0.000031704603,0.00015351376],"category_scores_gemma":[0.0000017206429,0.00005695709,0.0000198418,0.00009191657,0.000010084575,0.0000819174,0.000003629599,0.000068889436,0.000058356047],"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.000005668387,0.0000137544375,0.0038929798,0.0004220936,0.00016232413,0.0000966841,0.0014394268,0.005237394,0.6280154,0.31389323,0.0020854403,0.044735637],"study_design_scores_gemma":[0.00025405773,0.00014358059,0.0027497015,0.00032479785,0.000048203205,0.00008271884,0.00018278605,0.8819521,0.10336377,0.006031452,0.004166466,0.00070037984],"about_ca_topic_score_codex":0.000057878664,"about_ca_topic_score_gemma":0.00013744018,"teacher_disagreement_score":0.8767147,"about_ca_system_score_codex":0.000017888067,"about_ca_system_score_gemma":0.0000071446275,"threshold_uncertainty_score":0.23226427},"labels":[],"label_agreement":null},{"id":"W4393150838","doi":"10.1007/978-3-031-47504-7_6","title":"The Perfect Matching Polytope","year":2024,"lang":"en","type":"book-chapter","venue":"Algorithms and computation in mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Polytope; Matching (statistics); Combinatorics; Mathematics; Computer science; Statistics","score_opus":0.0106418524654151,"score_gpt":0.22080294325443975,"score_spread":0.21016109078902465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393150838","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.002139289,0.016990904,0.036291976,0.00011129333,0.0024050407,0.00073594163,0.000034064302,0.0005801139,0.9407114],"genre_scores_gemma":[0.16301894,0.006291529,0.020689037,0.0000851626,0.0014421728,0.00017245427,0.00009206888,0.00084635,0.80736226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992405,0.000007176488,0.00034551392,0.00013427951,0.00014050728,0.00013200239],"domain_scores_gemma":[0.99954736,0.00023283421,0.000047747864,0.00012330718,0.000017307157,0.00003142284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027534997,0.00021379707,0.00023006395,0.00009594115,0.00008800465,0.00016210107,0.00009252854,0.00012746229,0.000011571009],"category_scores_gemma":[0.0000024349654,0.00015939046,0.00006521629,0.000036404508,0.000042203603,0.00003611029,0.000032013395,0.00030149525,0.00008499],"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":[9.4388076e-7,0.000004470958,3.747214e-7,0.0007809328,0.00010306021,0.000021018022,0.002107425,0.0052995807,0.000006072764,0.96729493,0.00035649462,0.02402469],"study_design_scores_gemma":[0.00006023879,0.000012282772,0.00000244257,0.0005116544,0.000027607392,0.00004082562,0.00025792714,0.20854712,0.000002672849,0.78271896,0.00763381,0.00018449494],"about_ca_topic_score_codex":0.0000022150675,"about_ca_topic_score_gemma":0.000005907148,"teacher_disagreement_score":0.20324753,"about_ca_system_score_codex":0.000026873837,"about_ca_system_score_gemma":0.000006501679,"threshold_uncertainty_score":0.6499754},"labels":[],"label_agreement":null},{"id":"W4393241092","doi":"10.1109/tcomm.2024.3382328","title":"Exploiting Parity-Polytope Geometry in Approximate and Randomized Scheduled ADMM-LP Decoding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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 Toronto","funders":"","keywords":"Polytope; Decoding methods; Parity (physics); Mathematics; Computer science; Combinatorics; Algorithm; Mathematical optimization; Physics","score_opus":0.022132572506266306,"score_gpt":0.2540489958127179,"score_spread":0.2319164233064516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393241092","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.25745875,0.008912373,0.7223964,0.00050988415,0.00090043154,0.000908517,0.000051855593,0.0013251574,0.0075366828],"genre_scores_gemma":[0.9946725,0.002293451,0.0024254736,0.000019699952,0.00001551395,0.0004462129,0.0000063820003,0.000040438714,0.000080365346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988463,0.00026035137,0.0004118434,0.00017586493,0.000091472386,0.00021417173],"domain_scores_gemma":[0.9981337,0.0010432672,0.000021942864,0.00071315916,0.00001832693,0.000069569745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082466414,0.0001700754,0.00032331463,0.00049121276,0.00025251086,0.00013196512,0.00030666514,0.00009717351,0.00003786179],"category_scores_gemma":[0.000016426813,0.00017225588,0.00012515933,0.000636987,0.00013885662,0.000264287,0.000004743222,0.00057220337,0.00003278021],"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.0036445307,0.0015815258,0.00032897646,0.0043737735,0.0033144632,0.000064204716,0.030098764,0.19386643,0.050933193,0.40824863,0.0004683442,0.30307716],"study_design_scores_gemma":[0.012561309,0.000021866354,0.000029901366,0.0010641643,0.00016244424,0.000048780046,0.0017179701,0.96693015,0.008822325,0.006883825,0.0012096566,0.0005476255],"about_ca_topic_score_codex":0.00003420735,"about_ca_topic_score_gemma":0.00013004371,"teacher_disagreement_score":0.7730637,"about_ca_system_score_codex":0.000055464585,"about_ca_system_score_gemma":0.000015058436,"threshold_uncertainty_score":0.70243907},"labels":[],"label_agreement":null},{"id":"W4393402122","doi":"10.5281/zenodo.1492023","title":"Enumeration of complex Golay pairs","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Binary Golay code; Mathematics; Combinatorics; Computer science; Statistics","score_opus":0.030182901504710386,"score_gpt":0.22380247233266057,"score_spread":0.19361957082795017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393402122","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031933005,0.00007507824,0.000531319,0.000017202332,0.00033951132,0.00034784173,0.9836087,0.00063614006,0.01412485],"genre_scores_gemma":[0.016950183,0.00008565087,0.00003204797,0.000017360813,0.0002621445,3.9991438e-8,0.98161227,0.0009391623,0.00010114453],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985183,0.00029115594,0.00036091477,0.00026231798,0.0003045645,0.00026273995],"domain_scores_gemma":[0.99881965,0.000019066649,0.00011650422,0.0006213912,0.00031909285,0.00010429167],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055750937,0.00020153182,0.00025171603,0.0002791108,0.00064518646,0.0002552205,0.0009245147,0.00015797745,0.016349865],"category_scores_gemma":[0.0001480545,0.00022044987,0.00007536876,0.00037463743,0.00015538803,0.00012352622,0.00033457225,0.00027809845,0.0062799524],"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.000015183503,0.000034307046,7.0380764e-8,0.00038140404,0.00007345529,0.0000033547124,0.00013608037,0.00010399062,0.0011488643,0.00025498748,0.9955547,0.0022936007],"study_design_scores_gemma":[0.00018790226,0.0001333698,0.000019780455,0.00007211486,0.000025390387,0.00003591105,0.000053491654,0.00031586518,0.00024908595,0.00007071956,0.9986334,0.00020300146],"about_ca_topic_score_codex":0.000013981497,"about_ca_topic_score_gemma":7.586212e-7,"teacher_disagreement_score":0.016630853,"about_ca_system_score_codex":0.000075776436,"about_ca_system_score_gemma":0.0000017895187,"threshold_uncertainty_score":0.9944938},"labels":[],"label_agreement":null},{"id":"W4393677883","doi":"10.5281/zenodo.1195693","title":"Enumeration of Williamson sequences divisible by 2 or 3","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Combinatorics; Mathematics","score_opus":0.021226745983930085,"score_gpt":0.22657756217903585,"score_spread":0.20535081619510576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393677883","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005583148,0.00021345667,0.0004555202,0.000018605333,0.00035017132,0.00034057198,0.9926845,0.0005100679,0.0048688357],"genre_scores_gemma":[0.008696634,0.00037821752,0.000022236756,0.000016075328,0.00020103938,7.1240734e-8,0.9895262,0.00079466077,0.00036484774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984975,0.00024914378,0.00034961433,0.00028792286,0.00034227225,0.00027356402],"domain_scores_gemma":[0.99896884,0.000023241715,0.00012621272,0.00051831536,0.00026008714,0.000103273815],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053079234,0.00020823524,0.00024939261,0.00022308735,0.00064916967,0.00033530255,0.00095838786,0.00017106005,0.012964352],"category_scores_gemma":[0.00018719648,0.00019510057,0.000055160308,0.00046135442,0.00016401001,0.00020147079,0.00027429196,0.00025984403,0.0033269234],"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.000025421414,0.000033359487,9.824569e-8,0.0003991236,0.000065749366,0.0000036259148,0.000119839664,0.00005296034,0.0015081927,0.000074054275,0.9952058,0.0025117684],"study_design_scores_gemma":[0.00016549218,0.00023267737,0.0000024490141,0.000118653945,0.000024307968,0.000030226613,0.00005534305,0.00012618842,0.0013324646,0.00006121286,0.9976422,0.00020877554],"about_ca_topic_score_codex":0.000027959555,"about_ca_topic_score_gemma":0.0000013179632,"teacher_disagreement_score":0.009637428,"about_ca_system_score_codex":0.000075210504,"about_ca_system_score_gemma":0.0000030850154,"threshold_uncertainty_score":0.9974491},"labels":[],"label_agreement":null},{"id":"W4393786501","doi":"10.5281/zenodo.1246338","title":"Enumeration Of Complex Golay Pairs","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Binary Golay code; Mathematics; Combinatorics; Computer science; Statistics","score_opus":0.030182901504710386,"score_gpt":0.22380247233266057,"score_spread":0.19361957082795017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393786501","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031933005,0.00007507824,0.000531319,0.000017202332,0.00033951132,0.00034784173,0.9836087,0.00063614006,0.01412485],"genre_scores_gemma":[0.016950183,0.00008565087,0.00003204797,0.000017360813,0.0002621445,3.9991438e-8,0.98161227,0.0009391623,0.00010114453],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985183,0.00029115594,0.00036091477,0.00026231798,0.0003045645,0.00026273995],"domain_scores_gemma":[0.99881965,0.000019066649,0.00011650422,0.0006213912,0.00031909285,0.00010429167],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055750937,0.00020153182,0.00025171603,0.0002791108,0.00064518646,0.0002552205,0.0009245147,0.00015797745,0.016349865],"category_scores_gemma":[0.0001480545,0.00022044987,0.00007536876,0.00037463743,0.00015538803,0.00012352622,0.00033457225,0.00027809845,0.0062799524],"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.000015183503,0.000034307046,7.0380764e-8,0.00038140404,0.00007345529,0.0000033547124,0.00013608037,0.00010399062,0.0011488643,0.00025498748,0.9955547,0.0022936007],"study_design_scores_gemma":[0.00018790226,0.0001333698,0.000019780455,0.00007211486,0.000025390387,0.00003591105,0.000053491654,0.00031586518,0.00024908595,0.00007071956,0.9986334,0.00020300146],"about_ca_topic_score_codex":0.000013981497,"about_ca_topic_score_gemma":7.586212e-7,"teacher_disagreement_score":0.016630853,"about_ca_system_score_codex":0.000075776436,"about_ca_system_score_gemma":0.0000017895187,"threshold_uncertainty_score":0.9944938},"labels":[],"label_agreement":null},{"id":"W4394053406","doi":"10.5281/zenodo.1172259","title":"Enumeration of Williamson sequences divisible by 2 or 3","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Combinatorics; Mathematics","score_opus":0.021226745983930085,"score_gpt":0.22657756217903585,"score_spread":0.20535081619510576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394053406","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005583148,0.00021345667,0.0004555202,0.000018605333,0.00035017132,0.00034057198,0.9926845,0.0005100679,0.0048688357],"genre_scores_gemma":[0.008696634,0.00037821752,0.000022236756,0.000016075328,0.00020103938,7.1240734e-8,0.9895262,0.00079466077,0.00036484774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984975,0.00024914378,0.00034961433,0.00028792286,0.00034227225,0.00027356402],"domain_scores_gemma":[0.99896884,0.000023241715,0.00012621272,0.00051831536,0.00026008714,0.000103273815],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053079234,0.00020823524,0.00024939261,0.00022308735,0.00064916967,0.00033530255,0.00095838786,0.00017106005,0.012964352],"category_scores_gemma":[0.00018719648,0.00019510057,0.000055160308,0.00046135442,0.00016401001,0.00020147079,0.00027429196,0.00025984403,0.0033269234],"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.000025421414,0.000033359487,9.824569e-8,0.0003991236,0.000065749366,0.0000036259148,0.000119839664,0.00005296034,0.0015081927,0.000074054275,0.9952058,0.0025117684],"study_design_scores_gemma":[0.00016549218,0.00023267737,0.0000024490141,0.000118653945,0.000024307968,0.000030226613,0.00005534305,0.00012618842,0.0013324646,0.00006121286,0.9976422,0.00020877554],"about_ca_topic_score_codex":0.000027959555,"about_ca_topic_score_gemma":0.0000013179632,"teacher_disagreement_score":0.009637428,"about_ca_system_score_codex":0.000075210504,"about_ca_system_score_gemma":0.0000030850154,"threshold_uncertainty_score":0.9974491},"labels":[],"label_agreement":null},{"id":"W4394053923","doi":"10.5281/zenodo.1246337","title":"Enumeration of complex Golay pairs","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Binary Golay code; Mathematics; Combinatorics; Computer science; Statistics","score_opus":0.030182901504710386,"score_gpt":0.22380247233266057,"score_spread":0.19361957082795017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394053923","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031933005,0.00007507824,0.000531319,0.000017202332,0.00033951132,0.00034784173,0.9836087,0.00063614006,0.01412485],"genre_scores_gemma":[0.016950183,0.00008565087,0.00003204797,0.000017360813,0.0002621445,3.9991438e-8,0.98161227,0.0009391623,0.00010114453],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985183,0.00029115594,0.00036091477,0.00026231798,0.0003045645,0.00026273995],"domain_scores_gemma":[0.99881965,0.000019066649,0.00011650422,0.0006213912,0.00031909285,0.00010429167],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055750937,0.00020153182,0.00025171603,0.0002791108,0.00064518646,0.0002552205,0.0009245147,0.00015797745,0.016349865],"category_scores_gemma":[0.0001480545,0.00022044987,0.00007536876,0.00037463743,0.00015538803,0.00012352622,0.00033457225,0.00027809845,0.0062799524],"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.000015183503,0.000034307046,7.0380764e-8,0.00038140404,0.00007345529,0.0000033547124,0.00013608037,0.00010399062,0.0011488643,0.00025498748,0.9955547,0.0022936007],"study_design_scores_gemma":[0.00018790226,0.0001333698,0.000019780455,0.00007211486,0.000025390387,0.00003591105,0.000053491654,0.00031586518,0.00024908595,0.00007071956,0.9986334,0.00020300146],"about_ca_topic_score_codex":0.000013981497,"about_ca_topic_score_gemma":7.586212e-7,"teacher_disagreement_score":0.016630853,"about_ca_system_score_codex":0.000075776436,"about_ca_system_score_gemma":0.0000017895187,"threshold_uncertainty_score":0.9944938},"labels":[],"label_agreement":null},{"id":"W4394793007","doi":"10.61091/um119-06","title":"On Constructions of GMGDs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Generalization; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.006881211977921021,"score_gpt":0.21034888816295408,"score_spread":0.20346767618503306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793007","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.5683057,0.0014339035,0.009801941,0.00004098223,0.0012053382,0.0002381009,0.00006377796,0.0009566188,0.41795367],"genre_scores_gemma":[0.99935746,0.0000044100498,0.0003568834,0.0000029123955,0.000018350866,0.000013796701,0.0000011936027,0.000015299687,0.00022966287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995687,0.000012485665,0.00017643279,0.0000709394,0.00008030258,0.00009113979],"domain_scores_gemma":[0.9995779,0.00019055455,0.000006968312,0.00018791562,0.00000860842,0.000028098135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120453034,0.00007409374,0.000121480676,0.00008358731,0.00001682247,0.000012288669,0.00006205755,0.00003518587,0.00052534626],"category_scores_gemma":[0.000023332059,0.00006162591,0.00006954605,0.00014239087,0.00005747648,0.00003388274,0.000005695145,0.000069120804,0.00031669944],"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.0000011451893,0.000012060354,0.0000017839417,0.0007989637,0.0000543067,0.000002501754,0.0006061025,0.00009728283,0.0010080766,0.99404216,0.0023471157,0.0010285228],"study_design_scores_gemma":[0.00010032414,0.000058331963,0.00002987665,0.0009000142,0.000051841424,0.000065403634,0.0009134724,0.03612823,0.008479278,0.9458939,0.007197103,0.00018226162],"about_ca_topic_score_codex":3.7921444e-7,"about_ca_topic_score_gemma":2.0206774e-7,"teacher_disagreement_score":0.43105182,"about_ca_system_score_codex":0.000009425171,"about_ca_system_score_gemma":0.000005027606,"threshold_uncertainty_score":0.5752173},"labels":[],"label_agreement":null},{"id":"W4394793044","doi":"10.61091/um119-05","title":"On Decompositions of \\(\\mathbf{K_{18k}}\\) and \\(\\mathbf{K_{18k+1}}\\) into Certain Connected Bicyclic Graphs with Nine Edges","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bicyclic molecule; Combinatorics; Pancyclic graph; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Stereochemistry; Chemistry","score_opus":0.006593700966318909,"score_gpt":0.21395876840731143,"score_spread":0.2073650674409925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793044","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.976663,0.004048586,0.0031664514,0.00023331489,0.0003043398,0.0007022704,0.000108613654,0.0009701161,0.013803309],"genre_scores_gemma":[0.99748784,0.0000762014,0.0018725655,0.00002898931,0.000035608988,0.00013178338,0.000030416775,0.00009920943,0.0002373979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981375,0.00010494125,0.00063467765,0.0004119853,0.00029931762,0.0004116117],"domain_scores_gemma":[0.99813473,0.00093910104,0.00006692491,0.0006054883,0.00006662931,0.00018712314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040163533,0.0004400905,0.0006330115,0.00050014694,0.00017575448,0.000120028155,0.0002383438,0.00015411893,0.00029976523],"category_scores_gemma":[0.00008924943,0.00034499462,0.0001584721,0.00076354557,0.0003160001,0.00018045247,0.000046529254,0.00027466824,0.000133721],"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.00009343443,0.00030844187,0.00010034159,0.007061965,0.0009296883,0.00007299596,0.009451407,0.00029817742,0.020196937,0.9538092,0.0050339294,0.0026434916],"study_design_scores_gemma":[0.002435219,0.0017557527,0.0014948958,0.011250904,0.000981922,0.00064441236,0.005134688,0.07730926,0.035819344,0.8525711,0.008145253,0.002457202],"about_ca_topic_score_codex":0.000026625952,"about_ca_topic_score_gemma":0.000030726438,"teacher_disagreement_score":0.10123804,"about_ca_system_score_codex":0.000042785912,"about_ca_system_score_gemma":0.000029402474,"threshold_uncertainty_score":0.9999002},"labels":[],"label_agreement":null},{"id":"W4394793217","doi":"10.61091/ars158-04","title":"Near Hexagons of Order \\((3,t)\\) having a Big Quad","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Order (exchange); Isomorphism (crystallography); Combinatorics; Crystallography; Business; Crystal structure","score_opus":0.00844429568122194,"score_gpt":0.20840420293730594,"score_spread":0.199959907256084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793217","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.9834278,0.002200565,0.000108858076,0.000026570466,0.0060130386,0.000097376804,0.00000677648,0.00045768978,0.007661319],"genre_scores_gemma":[0.9996163,0.000018045313,0.000057359226,0.000008166518,0.0000150652995,0.000015040058,0.000003078582,0.000040084156,0.00022681306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993089,0.000032965127,0.00020997407,0.00013436904,0.000120916746,0.00019289169],"domain_scores_gemma":[0.9995785,0.00007816957,0.000013847605,0.0002424959,0.000031425458,0.000055607634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001911739,0.0001254112,0.00017395055,0.00008546822,0.00004510897,0.000057475678,0.00013989369,0.00007659703,0.00004929751],"category_scores_gemma":[0.000019807774,0.00012366357,0.000075698365,0.00047769514,0.000043265794,0.00008276315,0.000022819439,0.00015443847,0.00011977962],"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.0000046947835,0.00003729757,0.0013872691,0.0005325686,0.000155137,0.00003289853,0.0017108034,0.0009019013,0.008603825,0.9799606,0.0038088446,0.0028641492],"study_design_scores_gemma":[0.001392121,0.00027225417,0.0038054215,0.0015160021,0.0001907126,0.00008288756,0.0011392968,0.053761575,0.031309903,0.77786547,0.12729724,0.001367109],"about_ca_topic_score_codex":0.000036795474,"about_ca_topic_score_gemma":0.0000057962284,"teacher_disagreement_score":0.20209512,"about_ca_system_score_codex":0.000023769002,"about_ca_system_score_gemma":0.000025757858,"threshold_uncertainty_score":0.50428545},"labels":[],"label_agreement":null},{"id":"W4394818542","doi":"10.1556/012.2024.04305","title":"A Combinatorial Construction of Bi-Cyclic 4-Polytopes","year":2024,"lang":"en","type":"article","venue":"Studia Scientiarum Mathematicarum Hungarica","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 Calgary","funders":"","keywords":"Mathematics; Polytope; Combinatorics","score_opus":0.006343908250763578,"score_gpt":0.20962733132028993,"score_spread":0.20328342306952635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394818542","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.66919476,0.00595375,0.017343925,0.00030637567,0.023244342,0.0012043435,0.000091573274,0.0024391892,0.28022176],"genre_scores_gemma":[0.9988277,0.000031091604,0.000821311,0.0000037650823,0.0001222805,0.0000373224,0.0000029560695,0.000035282086,0.00011831395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985053,0.000052686053,0.00046119821,0.00026739127,0.00037714656,0.00033630693],"domain_scores_gemma":[0.99930567,0.00017281005,0.000048130438,0.0003426002,0.000045213736,0.000085600324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056559755,0.00020331578,0.00036428563,0.00031256964,0.00012541276,0.00012175796,0.00025688688,0.00008511787,0.0001057423],"category_scores_gemma":[0.000049476825,0.00017724483,0.00017747807,0.00096228597,0.00026285264,0.00017388066,0.00006787666,0.00017409956,0.00016623327],"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.00000455261,0.000065704895,0.00009646099,0.0010441398,0.00028334084,0.000008282967,0.0018503993,0.000058654685,0.013780558,0.97881275,0.0023570587,0.001638071],"study_design_scores_gemma":[0.0014244427,0.0003131145,0.00058989157,0.0019979873,0.0007684928,0.00022837019,0.0045819087,0.032636687,0.07298105,0.8350404,0.047882143,0.001555511],"about_ca_topic_score_codex":0.0000031260793,"about_ca_topic_score_gemma":0.0000015991558,"teacher_disagreement_score":0.32963294,"about_ca_system_score_codex":0.00003582379,"about_ca_system_score_gemma":0.00003878104,"threshold_uncertainty_score":0.72278345},"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":"W4395099384","doi":"10.1007/978-3-031-48679-1_21","title":"Orthogonal and Strong Frame Starters: Revisited","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University; University of Waterloo","funders":"","keywords":"Frame (networking); Computer science; Telecommunications","score_opus":0.05323197053147859,"score_gpt":0.25120154976081993,"score_spread":0.19796957922934133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099384","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014820004,0.003660868,0.0015713025,0.00028757373,0.00068336946,0.00032157177,0.00027726573,0.00072317873,0.9923267],"genre_scores_gemma":[0.50449014,0.024101174,0.00208057,0.000275022,0.0005336113,0.00018980255,0.0026316994,0.000303622,0.46539438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925256,0.000019618345,0.00031266108,0.00016028783,0.00010672126,0.00014816686],"domain_scores_gemma":[0.99814886,0.000117441836,0.000056998117,0.0015594967,0.000042162916,0.00007505783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012849076,0.00022669755,0.0002687113,0.00015510705,0.00019713258,0.00005617916,0.00058638275,0.00038716462,0.00007685407],"category_scores_gemma":[0.000016011454,0.0002522543,0.00009242652,0.00005392603,0.00019326332,0.00013169742,0.00022465404,0.0007940566,0.00018227445],"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.0000014418594,0.000003370843,0.000009670303,0.00010437372,0.0001379119,0.000004103131,0.00021002056,0.00014294086,0.0000064921755,0.99348104,0.003600171,0.0022984508],"study_design_scores_gemma":[0.00014476753,0.000023492341,0.000054161937,0.0007547324,0.00008934825,0.000013592176,0.000055863664,0.0016854501,0.0000021098076,0.05168813,0.945056,0.0004323388],"about_ca_topic_score_codex":0.000007980262,"about_ca_topic_score_gemma":0.00024196063,"teacher_disagreement_score":0.9417929,"about_ca_system_score_codex":0.000023984263,"about_ca_system_score_gemma":0.000021279657,"threshold_uncertainty_score":0.99999297},"labels":[],"label_agreement":null},{"id":"W4395099391","doi":"10.1007/978-3-031-48679-1_6","title":"Colourings of Path Systems","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"graph theory and CDMA systems","field":"Engineering","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","funders":"","keywords":"Path (computing); Computer science; Computer network","score_opus":0.049292519178298244,"score_gpt":0.23464546825460939,"score_spread":0.18535294907631114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099391","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009168257,0.0031276585,0.0007762916,0.00006679692,0.0019944357,0.0003642545,0.00019091302,0.00055322924,0.99283475],"genre_scores_gemma":[0.52589726,0.007388741,0.00027774606,0.00002143781,0.00016542125,0.00015008639,0.00036799622,0.0001348274,0.4655965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991376,0.000018304589,0.0004633832,0.00011821817,0.00013171212,0.00013081696],"domain_scores_gemma":[0.99760586,0.00012348336,0.00012026756,0.0020232226,0.00007630594,0.000050857765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016714876,0.00020432011,0.00035931528,0.00016044959,0.00011428559,0.000021954604,0.0010373413,0.00042504712,0.000028296092],"category_scores_gemma":[0.000017167882,0.00022522305,0.0001407643,0.00006519024,0.00018092274,0.000075891694,0.00020699397,0.0005355985,0.00021758923],"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.0000011568129,0.0000060251195,0.0000028105615,0.00031724753,0.00014384672,0.0000031834124,0.00023350408,0.0018517716,0.000019698366,0.9900387,0.007034495,0.00034759231],"study_design_scores_gemma":[0.0001243622,0.00002697026,0.000010581714,0.0012501918,0.00008366002,0.000011013989,0.00006758432,0.0025305091,0.000019714607,0.017395675,0.97812676,0.0003529838],"about_ca_topic_score_codex":0.00004889819,"about_ca_topic_score_gemma":0.00013679451,"teacher_disagreement_score":0.972643,"about_ca_system_score_codex":0.000033820394,"about_ca_system_score_gemma":0.0000327002,"threshold_uncertainty_score":0.91843295},"labels":[],"label_agreement":null},{"id":"W4395659072","doi":"10.1007/978-3-031-48679-1_19","title":"Block Size Five: Quo Vadis?","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"graph theory and CDMA systems","field":"Engineering","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":"McMaster University","funders":"","keywords":"Block (permutation group theory); Status quo; Political science; Mathematics; Combinatorics; Law","score_opus":0.03973862458253953,"score_gpt":0.24792402070062025,"score_spread":0.20818539611808073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395659072","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.00005252325,0.0017346753,0.00014763181,0.00046808802,0.0018813545,0.00030230315,0.00015834923,0.0010831334,0.9941719],"genre_scores_gemma":[0.12585519,0.00579545,0.00042802063,0.00013611472,0.0002617809,0.00012300092,0.00029414034,0.00013585357,0.8669704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990369,0.000022278575,0.00040698325,0.0001878099,0.00014068288,0.0002053269],"domain_scores_gemma":[0.9966025,0.00031411328,0.000073951385,0.002860005,0.000059849335,0.00008959071],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013774575,0.00030185212,0.00033157604,0.00013476027,0.00027905332,0.00004911418,0.0014481033,0.00056414166,0.00016926331],"category_scores_gemma":[0.00005469645,0.000340141,0.00020619512,0.00008682536,0.00020076503,0.000114185015,0.0003173186,0.00096555613,0.0014398197],"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.000001632605,0.000009766815,0.0000018870696,0.0001099258,0.00022141128,0.000009154053,0.00041633306,0.0013566558,0.0000150266615,0.9582496,0.03833722,0.001271361],"study_design_scores_gemma":[0.00011613385,0.0000132050145,0.000013108798,0.00034529544,0.00007220688,0.000012687781,0.00003374292,0.000591057,0.000010546293,0.03915498,0.9592402,0.00039681033],"about_ca_topic_score_codex":0.000034257308,"about_ca_topic_score_gemma":0.0008203592,"teacher_disagreement_score":0.920903,"about_ca_system_score_codex":0.000048511018,"about_ca_system_score_gemma":0.000039997933,"threshold_uncertainty_score":0.99990505},"labels":[],"label_agreement":null},{"id":"W4395687369","doi":"10.48550/arxiv.2404.16751","title":"Efficient unitary designs and pseudorandom unitaries from permutations","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"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":"Air Force Office of Scientific Research; Simons Institute for the Theory of Computing, University of California Berkeley; Office of Science; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Pseudorandom number generator; Unitary state; Pseudorandom permutation; Computer science; Mathematics; Algebra over a field; Discrete mathematics; Algorithm; Random permutation; Pure mathematics; Political science; Symmetric group","score_opus":0.047599744920979827,"score_gpt":0.15870639811189746,"score_spread":0.11110665319091764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395687369","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.97267383,0.0020275235,0.019920671,0.000016488802,0.0009513298,0.00027234165,0.0002805721,0.0005671292,0.003290136],"genre_scores_gemma":[0.99912894,0.00017409162,0.000061020306,0.000009976488,0.00007768736,0.0000023782975,0.00008701392,0.000046807105,0.0004120871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.00011359207,0.00017171314,0.00048364294,0.00005195686,0.00022597761],"domain_scores_gemma":[0.9991644,0.00020043031,0.000035509376,0.00041559804,0.000049220493,0.00013486696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013472853,0.0003149867,0.00030966033,0.00027776402,0.00013704089,0.00008866941,0.00025468526,0.00025635387,0.000061682724],"category_scores_gemma":[0.000012786213,0.00035627297,0.00013451847,0.000339503,0.00015227376,0.000036905054,0.00032164698,0.0006065223,0.000107132255],"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.000031719726,0.000017403474,0.0002740544,0.0003045141,0.0003197671,0.0002539303,0.0012047504,0.92027515,0.00011522476,0.07695334,0.00020129351,0.000048867896],"study_design_scores_gemma":[0.00052676717,0.000018532548,0.000393413,0.00031180857,0.0004784238,0.000006575328,0.001896629,0.7892003,0.00010165291,0.20623194,0.00028938867,0.0005445825],"about_ca_topic_score_codex":0.00025466725,"about_ca_topic_score_gemma":0.000084286716,"teacher_disagreement_score":0.13107485,"about_ca_system_score_codex":0.00008856881,"about_ca_system_score_gemma":0.000049740833,"threshold_uncertainty_score":0.9998889},"labels":[],"label_agreement":null},{"id":"W4396212855","doi":"10.61091/jcmcc119-11","title":"On Generalizing the Method of Scarpis to Complex Hadamard Matrices","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Mathematics; Hadamard matrix; Computer science; Mathematical analysis","score_opus":0.017390427265444614,"score_gpt":0.26847375975983256,"score_spread":0.25108333249438797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396212855","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.89413583,0.002315979,0.06117313,0.00024099764,0.038433556,0.000506755,0.000011555895,0.00016526032,0.0030169317],"genre_scores_gemma":[0.99322444,0.00003096184,0.0055264467,0.000021196278,0.0011422241,0.000002170102,5.046757e-7,0.000047723108,0.0000043340187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978626,0.00015368548,0.0010183203,0.00014688348,0.0005587205,0.00025981673],"domain_scores_gemma":[0.9977351,0.0014318005,0.00026721743,0.00023002866,0.00019831781,0.00013754786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023621793,0.0002613472,0.0006648904,0.00029398108,0.00015643558,0.00024545848,0.00042856878,0.00010622536,0.000009058589],"category_scores_gemma":[0.00015086184,0.00018447981,0.00023736399,0.0005398623,0.000043980577,0.00010622628,0.00009688811,0.0004108974,0.0000035561325],"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.000038996353,0.00007544641,0.000009430535,0.00066949904,0.00024977743,0.00001724285,0.0021280271,0.0037887688,0.0046818936,0.98242956,0.0021552655,0.0037561166],"study_design_scores_gemma":[0.0014130266,0.000880507,0.000051133364,0.0019291895,0.00022561515,0.00023726003,0.0007013051,0.106673114,0.0053038513,0.876263,0.005889136,0.0004328287],"about_ca_topic_score_codex":0.000005822353,"about_ca_topic_score_gemma":2.0214692e-7,"teacher_disagreement_score":0.1061665,"about_ca_system_score_codex":0.000056342287,"about_ca_system_score_gemma":0.00003809603,"threshold_uncertainty_score":0.7522868},"labels":[],"label_agreement":null},{"id":"W4396601306","doi":"10.48550/arxiv.2405.00265","title":"Tree independence number II. Three-path-configurations","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Independence (probability theory); Tree (set theory); Path (computing); Mathematics; Computer science; Statistics; Geography; Combinatorics; Computer network","score_opus":0.03433345479291274,"score_gpt":0.16610042194123423,"score_spread":0.13176696714832148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396601306","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.8104897,0.00028125753,0.016761947,0.000022072065,0.0025278938,0.00035790858,0.00012050859,0.0011681097,0.16827059],"genre_scores_gemma":[0.9951656,0.00007555802,0.000030088668,0.00001104685,0.00016127997,0.0000040113564,0.000033208886,0.000056830853,0.0044623897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998739,0.000048415186,0.00021401078,0.00059898774,0.00009045373,0.0003091246],"domain_scores_gemma":[0.9989695,0.00004304042,0.000056230314,0.0007252117,0.00007061049,0.00013538619],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016803759,0.00035995254,0.0003090262,0.00017909976,0.00015034697,0.00008047226,0.00057200954,0.0004939344,0.00047201655],"category_scores_gemma":[0.000009597561,0.00042225368,0.00023789778,0.00047781534,0.0000804124,0.00012744062,0.0004932106,0.0010970803,0.0011058219],"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.000020294614,0.000051658168,0.0017193179,0.00064953114,0.0005014973,0.0006814928,0.00063518604,0.2658708,0.00050367194,0.7248241,0.0039138235,0.0006286198],"study_design_scores_gemma":[0.0004328951,0.000034565932,0.0010385533,0.0007004211,0.00043711494,0.000041170675,0.00050604244,0.43483105,0.00060173654,0.55546325,0.004555954,0.0013572627],"about_ca_topic_score_codex":0.00008741729,"about_ca_topic_score_gemma":0.0003304704,"teacher_disagreement_score":0.18467586,"about_ca_system_score_codex":0.00011475999,"about_ca_system_score_gemma":0.00007742723,"threshold_uncertainty_score":0.9998229},"labels":[],"label_agreement":null},{"id":"W4396677071","doi":"10.1137/23m1600384","title":"A Precise Condition for Independent Transversals in Bipartite Covers","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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 Waterloo","funders":"KU Leuven; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Bipartite graph; Mathematics; Combinatorics; Discrete mathematics; Graph","score_opus":0.011869001262928582,"score_gpt":0.2562360631189546,"score_spread":0.244367061856026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396677071","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.86877054,0.0014805091,0.11509724,0.000194457,0.0023185282,0.00095988554,0.0001715193,0.00033214522,0.01067516],"genre_scores_gemma":[0.9991768,0.00009684365,0.00038784675,0.000010870446,0.00009902433,0.000041693314,0.0000065452246,0.00004397576,0.00013637464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990165,0.000031676216,0.00041014087,0.00010227921,0.00021083967,0.00022855],"domain_scores_gemma":[0.9995548,0.00018622988,0.000039743332,0.000114634364,0.000017206467,0.00008737646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058494066,0.0001553259,0.000220609,0.00022383565,0.000044622768,0.00016148071,0.00011514583,0.00008152941,0.000108912696],"category_scores_gemma":[0.000025689083,0.00012786014,0.00017139055,0.00016388588,0.000019045627,0.00019887352,0.0000041568965,0.00027081373,0.000055716046],"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.0004197342,0.0004960143,0.000120788885,0.0115292715,0.0015788416,0.00084423396,0.05078508,0.2058864,0.08201046,0.6226429,0.016616838,0.007069455],"study_design_scores_gemma":[0.0038083696,0.00084871554,0.00009942878,0.009322133,0.0003115198,0.00085586065,0.0067309407,0.55640787,0.04904674,0.3382984,0.03290964,0.0013603941],"about_ca_topic_score_codex":2.849763e-7,"about_ca_topic_score_gemma":0.000003833114,"teacher_disagreement_score":0.35052145,"about_ca_system_score_codex":0.00009082892,"about_ca_system_score_gemma":0.000017074468,"threshold_uncertainty_score":0.5213985},"labels":[],"label_agreement":null},{"id":"W4396885387","doi":"10.1007/s10623-024-01414-w","title":"On optimal constant weight codes derived from $$\\omega $$-circulant balanced generalized weighing matrices","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Circulant matrix; Constant (computer programming); Mathematics; Omega; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Physics","score_opus":0.011661370651380275,"score_gpt":0.21187667797458667,"score_spread":0.2002153073232064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396885387","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.8847915,0.020451333,0.0904638,0.000027527256,0.00091358146,0.00027862718,0.00025792758,0.00088603335,0.0019296926],"genre_scores_gemma":[0.99368894,0.0022695034,0.003586171,0.000068463014,0.0001693707,0.00007436449,0.0000689795,0.000066593006,0.0000075905386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836427,0.00012502326,0.00037209803,0.00046218673,0.0002377687,0.00043864094],"domain_scores_gemma":[0.99914396,0.0003401696,0.000040361145,0.00027339323,0.000027460237,0.00017464212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002400295,0.0004032589,0.00046367626,0.0003930062,0.00019290565,0.00038338653,0.0001920648,0.00016154589,0.0001111551],"category_scores_gemma":[0.0000058649684,0.00033899792,0.0002415071,0.000542933,0.00013386496,0.00017969156,0.000023153145,0.00024655837,0.000027240465],"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.0003122519,0.00010165501,0.0017983125,0.0007012517,0.002113087,0.00058692816,0.0025396482,0.0070263064,0.49183115,0.48158684,0.003898803,0.0075037437],"study_design_scores_gemma":[0.0075713363,0.0011622927,0.0045169657,0.005442945,0.0016147149,0.00032520792,0.0037284982,0.49610904,0.17312753,0.24457733,0.05478976,0.007034374],"about_ca_topic_score_codex":0.00004641885,"about_ca_topic_score_gemma":0.000007701579,"teacher_disagreement_score":0.48908272,"about_ca_system_score_codex":0.000022515409,"about_ca_system_score_gemma":0.000015659793,"threshold_uncertainty_score":0.9999062},"labels":[],"label_agreement":null},{"id":"W4396945166","doi":"10.1145/3618260.3649642","title":"Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters","year":2024,"lang":"en","type":"preprint","venue":"","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 British Columbia","funders":"","keywords":"Mathematics; Pseudorandomness; Hash function; Orthogonal array; Constructive; Discrete mathematics; K-independent hashing; Upper and lower bounds; Perfect hash function; Theoretical computer science; Algorithm; Computer science; Cryptography","score_opus":0.008962190122907913,"score_gpt":0.1766746204094409,"score_spread":0.167712430286533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396945166","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.9416062,0.0008686648,0.008617816,0.000045554654,0.00072096783,0.00023342807,0.000029775723,0.00085748447,0.047020055],"genre_scores_gemma":[0.9971229,0.00004427461,0.0022578654,0.000029370716,0.00007644807,0.00002840954,0.000021178228,0.00006618613,0.0003533878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908984,0.000027132535,0.00017371956,0.0003504589,0.00013636208,0.00022249701],"domain_scores_gemma":[0.99953836,0.0000514453,0.000022715694,0.00027035954,0.000011283706,0.00010585543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012745708,0.0003076918,0.00028488322,0.00015611615,0.000036597237,0.00015633162,0.00014662182,0.00020300853,0.000037938113],"category_scores_gemma":[0.0000018398542,0.00025445136,0.00008211713,0.00009672965,0.000043809057,0.00006588218,0.00016740894,0.00080582756,0.000024377934],"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.0001726026,0.0000536994,0.0021176492,0.008704499,0.003458992,0.0011335149,0.0085253455,0.18255088,0.0026091356,0.7809972,0.003935233,0.005741217],"study_design_scores_gemma":[0.0023032525,0.0004500713,0.0015280724,0.009928615,0.0014470816,0.000973435,0.015090447,0.33080918,0.010161161,0.6101233,0.0096856,0.007499811],"about_ca_topic_score_codex":0.000030603096,"about_ca_topic_score_gemma":0.00002993497,"teacher_disagreement_score":0.17087397,"about_ca_system_score_codex":0.000031717827,"about_ca_system_score_gemma":0.000029077943,"threshold_uncertainty_score":0.99999076},"labels":[],"label_agreement":null},{"id":"W4398157627","doi":"10.48550/arxiv.2405.10854","title":"Strong log-convexity of genus sequences","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Convexity; Genus; Combinatorics; Mathematics; Biology; Zoology; Economics; Financial economics","score_opus":0.05434992744298476,"score_gpt":0.1672848378569444,"score_spread":0.11293491041395964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398157627","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.9719067,0.0007738722,0.005216152,0.0000047618505,0.0015147685,0.00017812774,0.00009346082,0.00037073824,0.019941406],"genre_scores_gemma":[0.9989593,0.00012538029,0.000021767035,0.000002805001,0.00007790955,7.915893e-7,0.000012052392,0.000029446537,0.0007705467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990435,0.0000656794,0.00019897797,0.0004085426,0.000055545042,0.00022774443],"domain_scores_gemma":[0.9992533,0.00004181035,0.000071364,0.00050465553,0.00004443648,0.00008447846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018209085,0.00025332702,0.0003407496,0.00020870371,0.00003363401,0.000024503395,0.00046979086,0.00028394233,0.000091537266],"category_scores_gemma":[0.0000060159555,0.00028796622,0.0002392185,0.00028804757,0.0001403463,0.00006240974,0.00033571778,0.0005664914,0.000114077964],"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.000017993516,0.000020264431,0.0017943976,0.0017943206,0.00045530038,0.0002932866,0.00036434006,0.7285456,0.00047214632,0.26573783,0.0002732044,0.00023127992],"study_design_scores_gemma":[0.00050342025,0.0000840674,0.0010691431,0.0012310658,0.00065751525,0.000019411169,0.0015231101,0.5016307,0.006316176,0.4839179,0.0016225543,0.001424892],"about_ca_topic_score_codex":0.000109239096,"about_ca_topic_score_gemma":0.000037679238,"teacher_disagreement_score":0.22691488,"about_ca_system_score_codex":0.000094145755,"about_ca_system_score_gemma":0.000050198512,"threshold_uncertainty_score":0.99995726},"labels":[],"label_agreement":null},{"id":"W4398247717","doi":"10.1007/s10623-024-01418-6","title":"Bounds on data limits for all-to-all comparison from combinatorial designs","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","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 Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorial design; Combinatorics; Cryptography; Combinatorial algorithms; Discrete mathematics; Algorithm","score_opus":0.09736931338553659,"score_gpt":0.309788310489445,"score_spread":0.2124189971039084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398247717","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.3849836,0.0122940205,0.58406717,0.00025156557,0.008632878,0.0020817714,0.0025251743,0.0019487062,0.0032151102],"genre_scores_gemma":[0.99579626,0.00013534799,0.0028386689,0.0001782247,0.00039002698,0.00012314976,0.00045231383,0.00007726041,0.000008740517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984097,0.000081102764,0.00034019386,0.00054688513,0.00020494465,0.000417188],"domain_scores_gemma":[0.9985922,0.0005253838,0.000025808487,0.0006072768,0.000028587252,0.00022076735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041585346,0.00032777435,0.00040387234,0.00030478602,0.00013082438,0.00042934564,0.0004558834,0.00016772354,0.000021532842],"category_scores_gemma":[0.000017020577,0.0003077869,0.00014205553,0.00038951923,0.00005616683,0.00018108367,0.00004440526,0.00020321742,0.00003236861],"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.00072582805,0.00036471552,0.0014962504,0.0008317685,0.0031161804,0.00004859588,0.004105917,0.002173473,0.059823915,0.6427585,0.2635549,0.02099999],"study_design_scores_gemma":[0.001975468,0.0016013811,0.0007253378,0.0007141958,0.00071406167,0.000009977715,0.0007519908,0.10394923,0.010304456,0.13535082,0.74219674,0.0017063556],"about_ca_topic_score_codex":0.000029848063,"about_ca_topic_score_gemma":0.000022058644,"teacher_disagreement_score":0.61081266,"about_ca_system_score_codex":0.000015609588,"about_ca_system_score_gemma":0.000013258883,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W4399122124","doi":"10.1177/17483026241252407","title":"Inverse matrices with applications in public-key cryptography","year":2024,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","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 Victoria","funders":"","keywords":"Key (lock); Cryptography; Public-key cryptography; Inverse; Mathematics; Computer science; Theoretical computer science; Computer security; Encryption; Geometry","score_opus":0.007177399161255579,"score_gpt":0.21938210511347173,"score_spread":0.21220470595221613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399122124","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.2651251,0.005876605,0.7253546,0.0012101551,0.0005066931,0.00025259427,0.000015509211,0.0005466209,0.0011121018],"genre_scores_gemma":[0.9489737,0.00008389671,0.050784126,0.000012863638,0.000092043316,0.000022171935,0.0000048866737,0.000021203328,0.000005084185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991432,0.000018895522,0.00037773693,0.00010776736,0.00019203295,0.00016040343],"domain_scores_gemma":[0.9995503,0.00010787267,0.00007210107,0.00008503311,0.0001349785,0.000049723458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144492,0.00011946701,0.00019474167,0.001932841,0.00003675751,0.0000591507,0.00022580515,0.000113990005,0.000016229105],"category_scores_gemma":[0.0000067970764,0.00009705021,0.000070989314,0.0020560748,0.00009605647,0.00024533062,0.000015387624,0.000379595,0.000013015974],"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.000017540135,0.00015048213,0.006122982,0.00026406464,0.0005800807,0.00029424322,0.0005121892,0.22900875,0.000357863,0.71612275,0.0014757871,0.045093287],"study_design_scores_gemma":[0.0010997229,0.00042524814,0.0030054648,0.00043390872,0.00008025338,0.0022592212,0.00211189,0.24298549,0.0003483866,0.66150767,0.085205145,0.0005375904],"about_ca_topic_score_codex":0.0000011150299,"about_ca_topic_score_gemma":0.0000047457934,"teacher_disagreement_score":0.6838486,"about_ca_system_score_codex":0.000050558447,"about_ca_system_score_gemma":0.000057794598,"threshold_uncertainty_score":0.39575925},"labels":[],"label_agreement":null},{"id":"W4399149997","doi":"10.1016/j.jctb.2024.05.002","title":"Directed cycles with zero weight in Zpk","year":2024,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","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; Royal Society","keywords":"Zero (linguistics); Mathematics; Algorithm; Philosophy","score_opus":0.00466580706083357,"score_gpt":0.20019280797731395,"score_spread":0.19552700091648037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399149997","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.89595336,0.030005218,0.00072494266,0.00026445216,0.056639,0.0003631229,0.000030239864,0.000324088,0.015695572],"genre_scores_gemma":[0.996643,0.0007244466,0.0000852301,0.000010979288,0.0017118944,0.0000066188304,0.0000021951375,0.00011023618,0.0007053959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969433,0.0007081962,0.0011023111,0.00023753721,0.0005216816,0.00048695074],"domain_scores_gemma":[0.9984342,0.0006114602,0.00025401587,0.00030940748,0.00018151046,0.00020943569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022108315,0.00046357317,0.0008818799,0.00059272686,0.000096230055,0.00031624542,0.00046694383,0.00029956474,0.00025066233],"category_scores_gemma":[0.00012383686,0.00036084445,0.000295585,0.0009777959,0.00021753513,0.0010452516,0.00004745137,0.0011259757,0.00003843335],"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.0029092317,0.00015209324,0.00039648122,0.0006551684,0.0008291744,0.0016575226,0.003445383,0.00068318483,0.0016959133,0.98458695,0.0011495285,0.0018393516],"study_design_scores_gemma":[0.0024549724,0.0012243134,0.0005881127,0.004350515,0.00029190927,0.0010607587,0.0012633044,0.00019364145,0.0062123653,0.9156384,0.066053726,0.00066802226],"about_ca_topic_score_codex":0.00000729028,"about_ca_topic_score_gemma":0.000005263972,"teacher_disagreement_score":0.10068964,"about_ca_system_score_codex":0.00020117157,"about_ca_system_score_gemma":0.0002084125,"threshold_uncertainty_score":0.99988437},"labels":[],"label_agreement":null},{"id":"W4399434193","doi":"10.1007/s10623-024-01427-5","title":"On the classification of skew Hadamard matrices of order $$\\varvec{36}$$ and related structures","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Science Foundation of Anhui Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Skew; Hadamard transform; Order (exchange); Mathematics; Combinatorics; Computer science; Mathematical analysis; Telecommunications; Business","score_opus":0.013674302757528638,"score_gpt":0.21367640397838608,"score_spread":0.20000210122085743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399434193","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.9779371,0.010537881,0.008238027,0.00004939983,0.00019357345,0.00019668802,0.000029623756,0.00010694217,0.0027107734],"genre_scores_gemma":[0.9989593,0.00068097556,0.00030341922,0.0000066503117,0.000010186807,0.000011834812,0.0000042294487,0.000015447951,0.0000079506435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938816,0.00006549337,0.0002161744,0.00012864538,0.00010430961,0.000097214535],"domain_scores_gemma":[0.9994936,0.00026440804,0.000038187583,0.00014582291,0.000029422088,0.000028532591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022339963,0.00011848255,0.000157572,0.00019894102,0.000050925522,0.00004337327,0.0000749342,0.00007813117,0.000035247675],"category_scores_gemma":[0.000010121533,0.000077597986,0.00006509688,0.00054364075,0.00013087183,0.000053883075,0.000007972763,0.00010193945,8.0880375e-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.000025710944,0.000009852788,0.00041652183,0.000441864,0.00021988383,0.000001586717,0.0007584042,0.00018297978,0.030746108,0.9627148,0.0006611083,0.0038211856],"study_design_scores_gemma":[0.00056782103,0.00046557706,0.061877035,0.0009621968,0.00034551046,0.000044441796,0.0019397247,0.023705343,0.020090027,0.8848321,0.004535908,0.0006343531],"about_ca_topic_score_codex":0.000008961849,"about_ca_topic_score_gemma":0.000002105828,"teacher_disagreement_score":0.07788273,"about_ca_system_score_codex":0.0000021360331,"about_ca_system_score_gemma":0.000004809854,"threshold_uncertainty_score":0.3164354},"labels":[],"label_agreement":null},{"id":"W4399522856","doi":"10.1145/3618260.3649617","title":"Strong Algebras and Radical Sylvester-Gallai Configurations","year":2024,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"University of Toronto; Simons Institute for the Theory of Computing, University of California Berkeley; Princeton University","keywords":"Generalization; Algebraically closed field; Mathematics; Combinatorics; Scalar (mathematics); Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.006983062527541315,"score_gpt":0.20308435261811955,"score_spread":0.19610129009057822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399522856","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.73136985,0.0048200157,0.038573343,0.0003205059,0.0012163916,0.00021390735,0.000013747599,0.0017293053,0.22174296],"genre_scores_gemma":[0.9987692,0.000019236748,0.00006734333,0.000016849266,0.00007014054,0.000009622096,0.0000035996186,0.000012652296,0.0010313408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966437,0.0000124258595,0.00009367365,0.000084495,0.000047376496,0.0000976775],"domain_scores_gemma":[0.9998251,0.0000399838,0.0000020419375,0.00007380661,0.0000037382092,0.000055334796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063987754,0.00006617492,0.000064636275,0.000044404467,0.000029326824,0.000098324,0.00003391245,0.000039244307,0.0003263372],"category_scores_gemma":[0.0000025123886,0.000055851546,0.000023291941,0.00006707187,0.000030861058,0.00010230426,0.0000053894196,0.0000755654,0.00010319186],"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":[8.710192e-7,0.0000034821094,0.00008848674,0.00012715103,0.00006177961,0.0000145621125,0.00029231704,0.00019376048,0.007756422,0.9836085,0.0045895777,0.0032630884],"study_design_scores_gemma":[0.00087050325,0.00016360245,0.0060056616,0.00057775236,0.00016107291,0.0005569349,0.002069271,0.29903528,0.018514369,0.03872635,0.63194764,0.0013716047],"about_ca_topic_score_codex":0.000003107533,"about_ca_topic_score_gemma":0.0000066266034,"teacher_disagreement_score":0.94488215,"about_ca_system_score_codex":0.0000067418637,"about_ca_system_score_gemma":0.0000049050464,"threshold_uncertainty_score":0.35731637},"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":"W4400196885","doi":"10.5070/c64163845","title":"Sets of mutually orthogoval projective and affine planes","year":2024,"lang":"en","type":"article","venue":"Combinatorial Theory","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; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Projective test; Mathematics; Projective plane; Pure mathematics; Combinatorics; Geometry","score_opus":0.005227168127259759,"score_gpt":0.20475737832382995,"score_spread":0.1995302101965702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400196885","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.9638026,0.0034257392,0.00014839871,0.000005825842,0.0073920297,0.00022400619,0.000030301044,0.0004055435,0.024565583],"genre_scores_gemma":[0.9995668,0.00003003613,0.000011675004,0.0000023341645,0.00022018602,0.00001518889,0.0000054371453,0.000026600801,0.00012176352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993684,0.00009043749,0.00016779837,0.00013878649,0.00009970511,0.00013482047],"domain_scores_gemma":[0.99954444,0.00024579643,0.000014663785,0.00013211997,0.000022367642,0.000040594845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048317065,0.00012726092,0.00018581712,0.00009603157,0.000028932252,0.00002772452,0.00008845328,0.00008595529,0.00004875926],"category_scores_gemma":[0.00003604549,0.00011202957,0.000048179543,0.000165914,0.00007726581,0.00008658747,0.00002633992,0.00013144223,0.0000115797675],"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.00007372284,0.000016719516,0.00005414613,0.00033836052,0.00011737219,0.000023161876,0.001772662,0.000033342312,0.003555316,0.98881423,0.00027333768,0.0049276194],"study_design_scores_gemma":[0.000812426,0.00023559132,0.00031136195,0.00033706927,0.000072655865,0.00006527192,0.0009895469,0.0010897644,0.013342137,0.9718588,0.010517906,0.0003674913],"about_ca_topic_score_codex":0.0000021339044,"about_ca_topic_score_gemma":7.436403e-7,"teacher_disagreement_score":0.035764206,"about_ca_system_score_codex":0.000014273255,"about_ca_system_score_gemma":0.000017679942,"threshold_uncertainty_score":0.45684335},"labels":[],"label_agreement":null},{"id":"W4400484726","doi":"10.61091/jcmcc120-34","title":"Half-exceeded Symmetric Permutations and the Inverse Pairs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Inverse; Mathematics; Combinatorics; Geometry","score_opus":0.009341677583296197,"score_gpt":0.217350577099676,"score_spread":0.2080088995163798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484726","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.95383626,0.005690841,0.0041967435,0.0002698672,0.03154919,0.0003757089,0.000002308598,0.00018590747,0.003893192],"genre_scores_gemma":[0.9984575,0.0001538533,0.0003157178,0.000010354845,0.0010130695,0.0000028379222,5.152476e-7,0.00003699536,0.000009171767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983963,0.00012176645,0.0007762164,0.00012528802,0.00035842252,0.00022205287],"domain_scores_gemma":[0.99799395,0.0013938771,0.00018394529,0.00014398561,0.00015349525,0.00013073786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002070116,0.00022626697,0.00052605674,0.00028882019,0.00024019417,0.00044369162,0.00021803193,0.000113853814,0.00000465831],"category_scores_gemma":[0.00026505766,0.00015738118,0.00017220399,0.0005408694,0.00016046315,0.00020173698,0.00007515242,0.0004955515,0.0000035892378],"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.000027681375,0.0000420228,0.000014150228,0.00044472914,0.00020519242,0.00002383728,0.0029571198,0.0001785569,0.00011658196,0.99445105,0.0005228529,0.0010162393],"study_design_scores_gemma":[0.0033160406,0.00016108305,0.000024063065,0.00051947276,0.00021388338,0.0003334966,0.0013697034,0.13159622,0.00012933793,0.8598523,0.0022519073,0.00023249265],"about_ca_topic_score_codex":0.0000054995485,"about_ca_topic_score_gemma":4.6849888e-7,"teacher_disagreement_score":0.13459875,"about_ca_system_score_codex":0.000045276887,"about_ca_system_score_gemma":0.00004229828,"threshold_uncertainty_score":0.6417818},"labels":[],"label_agreement":null},{"id":"W4400485129","doi":"10.61091/jcmcc120-26","title":"A Note on Decomposition of Tensor Product of Complete Multipartite Graphs into Gregarious Kite","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kite; Multipartite; Tensor product; Decomposition; Mathematics; Product (mathematics); Pure mathematics; Combinatorics; Computer science; Physics; Biology; Ecology; Quantum mechanics; Geometry; Quantum","score_opus":0.009648721597012798,"score_gpt":0.24566924838250495,"score_spread":0.23602052678549215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485129","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.97924864,0.0012362911,0.0027507837,0.00003114058,0.015975088,0.00028716345,0.0000072104485,0.00007545364,0.00038825427],"genre_scores_gemma":[0.9975882,0.000044442382,0.0017525335,0.0000035009646,0.0005571966,0.0000019484387,0.0000017631837,0.00004854113,0.0000018823534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755305,0.00010693075,0.0013980425,0.00017921659,0.0005215656,0.00024117115],"domain_scores_gemma":[0.9981008,0.00065358216,0.0005293469,0.00024527352,0.00034921878,0.00012177039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001232866,0.0002915105,0.00088230905,0.00042587862,0.00009719729,0.000091637135,0.00027440683,0.00012270575,0.000002957275],"category_scores_gemma":[0.0001414091,0.00025400877,0.0002881083,0.0004511831,0.00010949683,0.00016255307,0.00006140642,0.000440165,0.0000021700691],"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.00021864717,0.000463778,0.0001166557,0.0038212473,0.00045141828,0.00004412881,0.0049413275,0.002279235,0.05616018,0.92794126,0.00020321873,0.003358918],"study_design_scores_gemma":[0.0037683004,0.0018599676,0.00018812683,0.0051796813,0.00031419625,0.00020383307,0.00026814104,0.079372935,0.035256527,0.8719874,0.0010521666,0.00054875284],"about_ca_topic_score_codex":0.000009025331,"about_ca_topic_score_gemma":3.6870247e-7,"teacher_disagreement_score":0.0770937,"about_ca_system_score_codex":0.000055607816,"about_ca_system_score_gemma":0.000052944124,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W4400485602","doi":"10.61091/jcmcc120-15","title":"Some Convex Polytopes Joining Paths and Their Metric Dimension","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Dimension (graph theory); Convex polytope; Regular polygon; Mathematics; Metric (unit); Convex body; Combinatorics; Convex analysis; Geometry; Convex hull; Convex optimization; Economics; Operations management","score_opus":0.008892237614099886,"score_gpt":0.21321134951999665,"score_spread":0.20431911190589677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485602","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.9483681,0.019010453,0.0019977891,0.00004511849,0.02981741,0.00017512466,0.0000028829509,0.00016960177,0.00041351927],"genre_scores_gemma":[0.9972577,0.00031643352,0.00033847062,0.000011176996,0.0020149099,0.0000012567931,6.545909e-7,0.000055632794,0.000003776761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982341,0.00008554375,0.00088318007,0.00017561483,0.00032306067,0.00029850978],"domain_scores_gemma":[0.998444,0.0008653488,0.0002190184,0.00015251196,0.00013083094,0.00018824356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015180348,0.0003178441,0.00074205984,0.00040333671,0.00017992863,0.00038866978,0.00018944695,0.00016372761,0.0000034455234],"category_scores_gemma":[0.00013168556,0.00024707563,0.00015955603,0.00039968875,0.00006538124,0.00034080635,0.0001111649,0.00052586483,0.0000027162782],"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.00002321326,0.00008450968,0.000054518696,0.0009323676,0.00028719672,0.000058202273,0.0029477987,0.00013390447,0.0046317964,0.98591715,0.00033027132,0.004599044],"study_design_scores_gemma":[0.0019440805,0.0005719,0.000040787483,0.001693564,0.00013754095,0.00049755804,0.001762759,0.090993345,0.00433521,0.8955909,0.0019334613,0.0004989164],"about_ca_topic_score_codex":0.000001928839,"about_ca_topic_score_gemma":3.799395e-8,"teacher_disagreement_score":0.090859435,"about_ca_system_score_codex":0.000049645798,"about_ca_system_score_gemma":0.000039128892,"threshold_uncertainty_score":0.99999815},"labels":[],"label_agreement":null},{"id":"W4400486032","doi":"10.61091/jcmcc120-09","title":"Sufficient Conditions for a Graph k G Admitting all [ 1 , k ] -factors","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Graph; Mathematics; Computer science","score_opus":0.014412211179939178,"score_gpt":0.25017638234587464,"score_spread":0.23576417116593545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486032","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.95379883,0.0013665439,0.011127206,0.000035422105,0.03261346,0.00033500232,0.000014122966,0.00019707622,0.00051232905],"genre_scores_gemma":[0.9979808,0.000027914826,0.0006452026,0.000006340151,0.0012656511,0.0000050663384,0.000004290545,0.000060473092,0.000004306357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981126,0.000049657985,0.0009831036,0.00016151628,0.0003490905,0.00034403388],"domain_scores_gemma":[0.99797237,0.0012321796,0.00023616794,0.00014848482,0.00022168382,0.0001891337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013246886,0.00028249118,0.0005795784,0.00031659563,0.00019833044,0.00033473645,0.00024398677,0.00014963464,0.0000061138317],"category_scores_gemma":[0.00019522886,0.00024511767,0.00033197325,0.00031403982,0.000057374797,0.0001943682,0.0000463366,0.00039222,0.0000018854508],"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.000016446103,0.00013732178,0.000041222716,0.0009490966,0.00032320764,0.00001723552,0.0029056042,0.00071980414,0.0017795649,0.9919653,0.00092719396,0.00021799948],"study_design_scores_gemma":[0.0020168158,0.0006634704,0.000036399502,0.001277587,0.00030520555,0.00015668783,0.0016513224,0.07174595,0.0017987576,0.9141343,0.0057284697,0.00048503463],"about_ca_topic_score_codex":0.0000012682189,"about_ca_topic_score_gemma":1.2409802e-7,"teacher_disagreement_score":0.077831,"about_ca_system_score_codex":0.000067812565,"about_ca_system_score_gemma":0.00005466477,"threshold_uncertainty_score":0.99956083},"labels":[],"label_agreement":null},{"id":"W4400486250","doi":"10.61091/jcmcc121-11","title":"On Vertex Euclidean Deficiency of One-Point Union and One-Edge Union of Complete Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Euclidean geometry; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Geometry; Artificial intelligence","score_opus":0.014268240180009285,"score_gpt":0.22321728692369866,"score_spread":0.2089490467436894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486250","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.98168916,0.0014969346,0.0036647022,0.000029799523,0.011503894,0.0002194473,0.000007668959,0.000058540536,0.0013298283],"genre_scores_gemma":[0.99912375,0.00012338118,0.0004903454,0.0000025885333,0.00021292457,8.459941e-7,0.0000013799829,0.000043182918,0.0000016075342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975445,0.0001827094,0.0013009784,0.00017381058,0.00054749125,0.0002504905],"domain_scores_gemma":[0.99797755,0.00094189827,0.00047271443,0.00021929781,0.00024982067,0.00013868608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002320197,0.0002743376,0.0008761731,0.0004213331,0.00010614587,0.00009625629,0.00025769626,0.00015682096,0.000004953175],"category_scores_gemma":[0.0001503294,0.00025542048,0.00019675636,0.00044537793,0.00012941322,0.00016557529,0.00009029394,0.0004498458,0.0000010715438],"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.000042287316,0.00028534658,0.00004302179,0.0019645079,0.00015947768,0.000007923623,0.0013363893,0.00021348665,0.007368018,0.98708206,0.00006202841,0.0014354427],"study_design_scores_gemma":[0.0019569744,0.0013395931,0.00016294773,0.0033902342,0.0001607208,0.00005949074,0.00040164034,0.014262846,0.0036774257,0.97421455,0.00009634659,0.00027725007],"about_ca_topic_score_codex":0.0000071353766,"about_ca_topic_score_gemma":3.191356e-7,"teacher_disagreement_score":0.01743456,"about_ca_system_score_codex":0.000046665733,"about_ca_system_score_gemma":0.00005060496,"threshold_uncertainty_score":0.9999898},"labels":[],"label_agreement":null},{"id":"W4400486528","doi":"10.61091/jcmcc121-05","title":"An Open Problem in Embedding","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Citadel Foundation","keywords":"Embedding; Computer science; Artificial intelligence","score_opus":0.01177004964521012,"score_gpt":0.265732392087963,"score_spread":0.2539623424427529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486528","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.9724602,0.0011773938,0.0029102904,0.00002713566,0.019246502,0.00035067383,0.0000013800503,0.00012822876,0.003698207],"genre_scores_gemma":[0.9965252,0.000032664404,0.0024795602,0.000004163994,0.00089881447,0.0000031017144,7.4126586e-7,0.000053021362,0.0000027196381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981611,0.00009737312,0.0009801593,0.00016459682,0.00031320573,0.00028360655],"domain_scores_gemma":[0.99907786,0.0003182714,0.00016602888,0.00017936733,0.00010413997,0.00015433817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023214428,0.00023347305,0.000598032,0.00030090564,0.00009327834,0.0008105623,0.0005922221,0.00013730218,0.000007530369],"category_scores_gemma":[0.00004821669,0.0002099095,0.00008088287,0.00041903506,0.000033572927,0.0006260426,0.00012087407,0.00052367896,0.000003012276],"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.000026676647,0.00019513906,0.000060333783,0.00066671305,0.00008558266,0.00009831332,0.003293773,0.0026979682,0.0016530886,0.98835844,0.00016790224,0.0026960622],"study_design_scores_gemma":[0.0016064519,0.00048787674,0.00002476685,0.0015943832,0.000041098032,0.00018049967,0.0006696832,0.17077251,0.00051444146,0.82253754,0.0012687152,0.00030202983],"about_ca_topic_score_codex":0.000006631673,"about_ca_topic_score_gemma":5.229682e-7,"teacher_disagreement_score":0.16807453,"about_ca_system_score_codex":0.00008547315,"about_ca_system_score_gemma":0.00006346636,"threshold_uncertainty_score":0.85598606},"labels":[],"label_agreement":null},{"id":"W4400596696","doi":"10.55016/ojs/cdm.v13i2.62733","title":"The Complexity of Power Graphs Associated With Finite Groups","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; King Saud University; Division of Mathematical Sciences; Kent State University","keywords":"Combinatorics; Mathematics; Clique graph; Vertex (graph theory); Graph; Finite group; Simplex graph; Discrete mathematics; Split graph; Simple graph; Clique; Graph power; Group (periodic table); Line graph; Pathwidth","score_opus":0.014652087546509748,"score_gpt":0.23763441569815247,"score_spread":0.2229823281516427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596696","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.7083325,0.00024450888,0.26764736,0.00042403888,0.00053933455,0.0011282456,0.0013263021,0.00053645024,0.019821279],"genre_scores_gemma":[0.99946266,0.0000031171032,0.00033236062,0.000014697733,0.00002170416,0.000038481576,0.000019689842,0.000020982854,0.00008632728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990552,0.000052728177,0.00032902526,0.00009525495,0.00017959309,0.00028820615],"domain_scores_gemma":[0.9987738,0.000350753,0.00008331326,0.0004100343,0.0002962993,0.00008578308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047401164,0.00014758497,0.00024480032,0.00005818959,0.00030126396,0.000044627945,0.00024392486,0.0000606846,0.000035139874],"category_scores_gemma":[0.00041670623,0.000095126066,0.0000816252,0.00047353006,0.00052897993,0.000053114964,0.00003346296,0.00010083506,0.000048954214],"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.000015012158,0.00004333356,0.000102358594,0.000029933273,0.00022868249,9.980788e-7,0.0014192257,0.00019828489,0.0007513153,0.99612856,0.0010486636,0.00003360606],"study_design_scores_gemma":[0.0020455548,0.0009808935,0.008089576,0.0010997014,0.00034014814,0.000023125218,0.0036283534,0.04784311,0.013454648,0.9135846,0.007770359,0.0011399158],"about_ca_topic_score_codex":0.0000018921656,"about_ca_topic_score_gemma":0.000057802936,"teacher_disagreement_score":0.29113016,"about_ca_system_score_codex":0.000040405383,"about_ca_system_score_gemma":0.000012506684,"threshold_uncertainty_score":0.38791284},"labels":[],"label_agreement":null},{"id":"W4400596699","doi":"10.55016/ojs/cdm.v13i2.62378","title":"Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Combinatorics; Bipartite graph; Mathematics; Complete bipartite graph; Decomposition; Disjoint sets; Star (game theory); Stars; Graph; Path (computing); Discrete mathematics; Chemistry; Physics; Computer science; Astrophysics","score_opus":0.007471612639337897,"score_gpt":0.23914193056462946,"score_spread":0.23167031792529155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596699","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.89198494,0.00008598562,0.106424846,0.00011699211,0.000107642336,0.00042214055,0.0003560815,0.00008507697,0.0004162876],"genre_scores_gemma":[0.9973499,0.0000045081715,0.0025226125,0.000021714937,0.000030333007,0.000028761582,0.0000084544545,0.000017415266,0.000016275224],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928015,0.00004122385,0.0002627737,0.00010646451,0.0001297352,0.00017967283],"domain_scores_gemma":[0.99928284,0.00007652137,0.000064743406,0.00034662668,0.00014661394,0.000082652696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014616018,0.00013473367,0.00021424264,0.00006682583,0.00017446215,0.000033527667,0.00013957337,0.000045566994,0.000015488595],"category_scores_gemma":[0.000051293315,0.00008885267,0.000054267875,0.00032059665,0.00017831622,0.00006736126,0.000040725525,0.00007162535,0.0000121199755],"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.0001539182,0.00018229253,0.0030375528,0.0012411961,0.0007295214,0.0000050955805,0.02285543,0.0012048109,0.55738884,0.4108849,0.0011868103,0.0011296198],"study_design_scores_gemma":[0.007805735,0.0022922568,0.073747285,0.006750357,0.0012196203,0.0003029541,0.007018836,0.18035278,0.3437808,0.35610166,0.017027544,0.0036001974],"about_ca_topic_score_codex":0.000006947353,"about_ca_topic_score_gemma":0.00005008353,"teacher_disagreement_score":0.21360809,"about_ca_system_score_codex":0.000030932748,"about_ca_system_score_gemma":0.000010429727,"threshold_uncertainty_score":0.36233068},"labels":[],"label_agreement":null},{"id":"W4400596743","doi":"10.55016/ojs/cdm.v15i1.67935","title":"3-uniform hypergraphs: modular decomposition and realization by tournaments","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Realization (probability); Mathematics; Combinatorics; Modular design; Tournament; Decomposition; Discrete mathematics; Element (criminal law); Computer science","score_opus":0.00590559664333025,"score_gpt":0.23519904584602175,"score_spread":0.22929344920269149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596743","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.20328484,0.00036870386,0.79311675,0.0005776925,0.00008875478,0.0004307265,0.00049114163,0.0002937052,0.0013476703],"genre_scores_gemma":[0.99837583,0.000053213065,0.0011946938,0.00011797456,0.0000394695,0.000039340994,0.00013719598,0.000021972895,0.00002033492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993093,0.000020733818,0.0002583896,0.00011863612,0.0001141131,0.00017881795],"domain_scores_gemma":[0.9995429,0.00002709797,0.000034699176,0.00013888499,0.0000572331,0.00019920734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001080969,0.00013372592,0.00018333647,0.00004847004,0.00012421,0.00007046277,0.00009172778,0.000062011335,0.000017113081],"category_scores_gemma":[0.00006148335,0.00013029986,0.00004377568,0.00023564948,0.000020609039,0.0001261549,0.000024850171,0.00007164602,0.000033794688],"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.000052761694,0.00018950042,0.00044965095,0.0013248654,0.00061001297,0.000015837131,0.0108083105,0.027450286,0.32818154,0.58547866,0.04294573,0.0024928476],"study_design_scores_gemma":[0.0019898857,0.00033578204,0.00028494536,0.00049370906,0.00029616946,0.00005641244,0.001953482,0.8662402,0.0335852,0.06452706,0.028999545,0.0012376277],"about_ca_topic_score_codex":0.0000015514274,"about_ca_topic_score_gemma":9.571776e-7,"teacher_disagreement_score":0.8387899,"about_ca_system_score_codex":0.00003982758,"about_ca_system_score_gemma":0.000003980796,"threshold_uncertainty_score":0.5313474},"labels":[],"label_agreement":null},{"id":"W4400596750","doi":"10.55016/ojs/cdm.v14i1.62399","title":"Hamiltonian paths in $m \\times n$ projective checkerboards","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Rectangle; Mathematics; Combinatorics; Projective plane; Square (algebra); Twist; Hamiltonian (control theory); Projective test; Checkerboard; Geometry; Pure mathematics","score_opus":0.004960986473503946,"score_gpt":0.23566436345648492,"score_spread":0.23070337698298096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596750","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.8828156,0.00034041522,0.033174235,0.0002414055,0.00071309175,0.002557543,0.0005237013,0.0006395097,0.078994475],"genre_scores_gemma":[0.9979369,0.0000054562524,0.0010990725,0.000024666155,0.0000379121,0.00016951014,0.000019150868,0.000032505213,0.00067483773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989213,0.000038495335,0.00034950022,0.00017481504,0.00015065003,0.00036527697],"domain_scores_gemma":[0.9993036,0.00008495896,0.000034703855,0.0004026236,0.00007611458,0.00009800044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035949697,0.00019311844,0.00033373132,0.00017808424,0.00004874298,0.00004955313,0.00019357202,0.000103772545,0.0001469092],"category_scores_gemma":[0.00012344525,0.00017771481,0.00009187149,0.00046977526,0.000025739455,0.000114415925,0.00004155594,0.00017101582,0.00078024383],"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.000024179655,0.00017820715,0.0030614182,0.0006830915,0.00019489262,0.000018343702,0.010384099,0.0075552235,0.009617779,0.96553093,0.002110914,0.00064090785],"study_design_scores_gemma":[0.00845229,0.0008438202,0.030632364,0.004336481,0.0003158021,0.00015017093,0.021083185,0.3983715,0.046307284,0.4203545,0.06368854,0.0054640803],"about_ca_topic_score_codex":0.000007621925,"about_ca_topic_score_gemma":0.000021547869,"teacher_disagreement_score":0.54517645,"about_ca_system_score_codex":0.00016649532,"about_ca_system_score_gemma":0.00002786715,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W4400596751","doi":"10.55016/ojs/cdm.v15i1.62708","title":"Latin Squares and their Bruhat Order","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Latin square; Mathematics; Combinatorics; Class (philosophy); Order (exchange); Relation (database); Cover (algebra); Computer science; Biology; Artificial intelligence","score_opus":0.010507876194894855,"score_gpt":0.2220730865490173,"score_spread":0.21156521035412246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596751","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.38912404,0.0010346263,0.5986108,0.002592335,0.0001891211,0.00079121604,0.0007438149,0.0008255029,0.0060885334],"genre_scores_gemma":[0.99853176,0.000012046427,0.0010811437,0.00013381145,0.00007332941,0.0000389612,0.000016482956,0.000023834064,0.000088631336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937093,0.000020625474,0.00022044999,0.000117139665,0.00006751231,0.00020331072],"domain_scores_gemma":[0.9994489,0.00010391688,0.000021986265,0.00017575703,0.00006506499,0.00018436072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001033615,0.0001521902,0.00022599638,0.00004800277,0.00009742911,0.000066312474,0.0001117642,0.000056996367,0.000054144548],"category_scores_gemma":[0.00022174719,0.000121600104,0.00004603628,0.0003477457,0.000032391268,0.00006345233,0.00004255418,0.000095150936,0.00011030272],"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.000023745268,0.00006490391,0.0004022395,0.0011366729,0.00036768932,0.000010320686,0.036119778,0.008161978,0.03883358,0.8978299,0.014161848,0.0028873815],"study_design_scores_gemma":[0.0025897126,0.0004159515,0.0013507501,0.0007401606,0.00022811547,0.000046417885,0.01850666,0.69225574,0.03782072,0.11793215,0.12579222,0.0023213935],"about_ca_topic_score_codex":0.0000010953071,"about_ca_topic_score_gemma":0.0000024010092,"teacher_disagreement_score":0.7798977,"about_ca_system_score_codex":0.000016356382,"about_ca_system_score_gemma":0.0000073936603,"threshold_uncertainty_score":0.49587083},"labels":[],"label_agreement":null},{"id":"W4400596753","doi":"10.55016/ojs/cdm.v15i1.62385","title":"On the first two entries of the f-vectors of 6-polytopes","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Characterization (materials science); Physics","score_opus":0.008947915511209567,"score_gpt":0.2183748864401502,"score_spread":0.20942697092894064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596753","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.94376606,0.00033120147,0.039789975,0.0072743217,0.00038429623,0.0012605828,0.00081436895,0.00016809787,0.0062111127],"genre_scores_gemma":[0.99974763,0.0000034795166,0.00004966997,0.00009881772,0.000031436866,0.000028478187,0.0000019707086,0.000012623119,0.000025903877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992879,0.00003464348,0.00031181204,0.00006925264,0.00015663449,0.00013976403],"domain_scores_gemma":[0.99908346,0.00038454356,0.000074448806,0.00034254848,0.0000665105,0.00004847583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017959549,0.00011291573,0.00022108619,0.000023670074,0.00011037725,0.000015492364,0.00033666583,0.000031456504,0.00005336437],"category_scores_gemma":[0.0005794266,0.000061859115,0.00013453022,0.00034442652,0.0000952452,0.000025731113,0.00005467139,0.00009639931,0.000026690093],"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.000008128025,0.00002317976,0.00014158676,0.00017904327,0.00009668194,2.9207723e-7,0.0038936206,0.0071105813,0.002914198,0.9825577,0.0030529979,0.00002194967],"study_design_scores_gemma":[0.0018464968,0.0004249541,0.0016179736,0.0019869963,0.0005013406,0.000011461327,0.0068873954,0.070778556,0.7209901,0.1621526,0.031818748,0.0009833449],"about_ca_topic_score_codex":0.0000026352936,"about_ca_topic_score_gemma":0.000006810999,"teacher_disagreement_score":0.8204051,"about_ca_system_score_codex":0.000017733126,"about_ca_system_score_gemma":0.0000109461225,"threshold_uncertainty_score":0.25225416},"labels":[],"label_agreement":null},{"id":"W4400596754","doi":"10.55016/ojs/cdm.v15i1.62603","title":"Factorizations of complete graphs into cycles and 1-factors","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Focus (optics); Complete graph; Discrete mathematics","score_opus":0.015975935800053572,"score_gpt":0.24105505167068036,"score_spread":0.2250791158706268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596754","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.6964635,0.00022431317,0.30062163,0.00029343006,0.00010798454,0.0003875714,0.0009520228,0.0002475093,0.00070198555],"genre_scores_gemma":[0.9985918,0.00001267463,0.0012721479,0.000018498336,0.00001919105,0.0000159242,0.000046010722,0.000018555193,0.000005219009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.000021513864,0.00031043103,0.00010427144,0.00010264571,0.00015137857],"domain_scores_gemma":[0.9994109,0.00012289848,0.0000433236,0.00016690098,0.000075794494,0.00018014047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069969334,0.000137789,0.00027319964,0.00007070072,0.000098907,0.000028199142,0.00012355551,0.000051933046,0.000022900158],"category_scores_gemma":[0.00020176206,0.00012369188,0.0000670023,0.00033248903,0.000061387,0.00007185776,0.00003818351,0.00007276301,0.000014183631],"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.0000056170707,0.00003606368,0.0022644417,0.00073356787,0.00020824646,0.0000013227011,0.016203048,0.0034100942,0.0617359,0.91458595,0.0006817733,0.00013400105],"study_design_scores_gemma":[0.0032136901,0.00073104404,0.019575141,0.0011535685,0.00089443196,0.00002295616,0.02359892,0.30905575,0.10198277,0.5115323,0.025013693,0.0032257298],"about_ca_topic_score_codex":0.000003904355,"about_ca_topic_score_gemma":0.0000036793442,"teacher_disagreement_score":0.40305364,"about_ca_system_score_codex":0.000015852,"about_ca_system_score_gemma":0.0000070795177,"threshold_uncertainty_score":0.50440085},"labels":[],"label_agreement":null},{"id":"W4400596788","doi":"10.55016/ojs/cdm.v15i3.69350","title":"Bounds of characteristic polynomials of regular matroids","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Mathematics; Unimodular matrix; Matroid; Combinatorics; Equivalence (formal languages); Discrete mathematics","score_opus":0.008651262275556838,"score_gpt":0.23158512091227587,"score_spread":0.22293385863671902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596788","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.7445902,0.00037710075,0.24965626,0.0004350002,0.00021246531,0.0005897187,0.0018312848,0.00020770248,0.0021002474],"genre_scores_gemma":[0.99858105,0.0000071018335,0.0012139429,0.000020581758,0.00006372443,0.000024032382,0.000027987182,0.000022995611,0.000038581176],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897695,0.000029049848,0.0005724469,0.00009741724,0.00013701129,0.00018711605],"domain_scores_gemma":[0.9992721,0.00008178512,0.00010686974,0.00029341615,0.00010996769,0.00013583452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020505955,0.00013701263,0.00045866068,0.00006501927,0.000037087488,0.000016268907,0.00020356728,0.0000673879,0.00006248425],"category_scores_gemma":[0.00028510884,0.00013090576,0.0001294399,0.0002895768,0.000060060866,0.000054741446,0.000037783015,0.00007026839,0.000047267273],"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.000040365892,0.0000786815,0.00012669606,0.0022569178,0.0003269169,0.000004500019,0.004760995,0.0014304781,0.61648774,0.37127915,0.0029418685,0.00026567705],"study_design_scores_gemma":[0.0030696278,0.0009697125,0.002749949,0.001885009,0.0009445508,0.00005234014,0.0040135575,0.087727055,0.81746686,0.057303976,0.021934163,0.0018832047],"about_ca_topic_score_codex":0.0000014063761,"about_ca_topic_score_gemma":3.6032506e-7,"teacher_disagreement_score":0.3139752,"about_ca_system_score_codex":0.00002558718,"about_ca_system_score_gemma":0.000014924271,"threshold_uncertainty_score":0.5338182},"labels":[],"label_agreement":null},{"id":"W4400596794","doi":"10.55016/ojs/cdm.v16i1.62666","title":"Bounds on r-identifying codes in q-ary Lee space","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Hypercube; Combinatorics; Cardinality (data modeling); Upper and lower bounds; Mathematics; Discrete mathematics; Computer science","score_opus":0.012316153291424704,"score_gpt":0.2664175244968444,"score_spread":0.2541013712054197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596794","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.7754367,0.0013629025,0.18593879,0.000974299,0.0010500569,0.0007005129,0.0005656214,0.0006123629,0.033358756],"genre_scores_gemma":[0.99787337,0.000021569023,0.0011745632,0.000050172654,0.000058436555,0.00006636608,0.000042406744,0.000028712166,0.0006844257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895847,0.0000540617,0.00033262456,0.00016700942,0.0001617817,0.00032607318],"domain_scores_gemma":[0.9991711,0.0001808554,0.000029170627,0.00040467817,0.00008020827,0.00013403034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003177356,0.0001681574,0.00029114215,0.00013677923,0.000113588634,0.00011896963,0.0001429625,0.0000852401,0.00009722342],"category_scores_gemma":[0.0004136502,0.00017154432,0.00009339183,0.0004945387,0.00002777242,0.00008900373,0.000045243556,0.00017950092,0.00028287355],"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.000009660195,0.00014349305,0.00024657452,0.0004738719,0.0001233527,0.00012320047,0.002909973,0.012574831,0.02555939,0.95380616,0.0037771177,0.0002523553],"study_design_scores_gemma":[0.0046352968,0.00025647244,0.004867464,0.0067054406,0.0003474776,0.00034113706,0.016365428,0.134371,0.27965257,0.488008,0.060865317,0.0035844133],"about_ca_topic_score_codex":0.0000034252062,"about_ca_topic_score_gemma":0.000049056758,"teacher_disagreement_score":0.4657982,"about_ca_system_score_codex":0.00013185636,"about_ca_system_score_gemma":0.0000316065,"threshold_uncertainty_score":0.69953746},"labels":[],"label_agreement":null},{"id":"W4400596797","doi":"10.55016/ojs/cdm.v15i3.62692","title":"Decomposition of complete tripartite graphs into cycles and paths of length three","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Decomposition; Path (computing); Discrete mathematics; Computer science; Chemistry","score_opus":0.013751420812721989,"score_gpt":0.2541824710650604,"score_spread":0.24043105025233844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596797","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.76551133,0.00047656865,0.23237194,0.00019590367,0.00005582264,0.00038344093,0.00052880595,0.000098007185,0.0003781606],"genre_scores_gemma":[0.99691266,0.000020158906,0.002969304,0.000015698713,0.000017070235,0.000023318747,0.000025572112,0.000014990941,0.0000012414996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999169,0.000028375376,0.0004424178,0.00010311296,0.00011498836,0.00014209036],"domain_scores_gemma":[0.9994019,0.00011715535,0.00008265657,0.00018418275,0.000093017414,0.0001210324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645687,0.00012729177,0.00035608656,0.000072911054,0.00005792563,0.0000143321495,0.000117903655,0.000052613723,0.000011848472],"category_scores_gemma":[0.00008210887,0.00011931617,0.00008744093,0.00026028836,0.000075803306,0.000068830384,0.000038772378,0.000068882924,0.000008678716],"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.000048622827,0.00008939061,0.0007504931,0.0020126784,0.00030950372,0.0000029233129,0.009328158,0.0031853393,0.23991823,0.7427364,0.00040801422,0.0012102424],"study_design_scores_gemma":[0.0033372126,0.0008265202,0.0051347385,0.0014921473,0.0006152919,0.000027358306,0.0039005475,0.36351952,0.1468956,0.47116467,0.0018763338,0.001210056],"about_ca_topic_score_codex":0.0000051067545,"about_ca_topic_score_gemma":0.000010431313,"teacher_disagreement_score":0.3603342,"about_ca_system_score_codex":0.000013030829,"about_ca_system_score_gemma":0.000006503757,"threshold_uncertainty_score":0.48655722},"labels":[],"label_agreement":null},{"id":"W4400596835","doi":"10.55016/ojs/cdm.v15i3.62290","title":"A complete solution to the spectrum problem for graphs with six vertices and up to nine edges","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Cograph; 1-planar graph; Pathwidth; Indifference graph; Chordal graph; Metric dimension; Discrete mathematics; Vertex (graph theory); Clique-sum; Neighbourhood (mathematics); Graph; Line graph","score_opus":0.0162376995996428,"score_gpt":0.23206859272246858,"score_spread":0.21583089312282577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596835","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.055546805,0.00016996861,0.9225517,0.017541725,0.00012884675,0.0025601503,0.0009057164,0.00025522918,0.0003398528],"genre_scores_gemma":[0.99331033,0.000003537655,0.0056873844,0.00030146271,0.00008950361,0.00048106947,0.000026743935,0.000029987372,0.00007000146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907196,0.000024275574,0.00025923367,0.00018585482,0.00012696256,0.00033172648],"domain_scores_gemma":[0.99925005,0.00013659074,0.000033390228,0.00023536982,0.00008495983,0.00025961635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022618554,0.00018381892,0.00026430987,0.00006343334,0.0002473014,0.00010761238,0.00019365079,0.000038324033,0.000009862989],"category_scores_gemma":[0.00014361292,0.00012594138,0.00005581755,0.00042868414,0.00003297221,0.00006971164,0.00005623597,0.00007960123,0.000053753123],"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.00030779737,0.000059624002,0.00013216499,0.0014987245,0.0005681212,0.0000037607128,0.03085269,0.025157856,0.031636324,0.874507,0.0343909,0.00088504504],"study_design_scores_gemma":[0.005854414,0.004788383,0.0011850173,0.002237848,0.001357511,0.00011287456,0.013029746,0.39237764,0.025222898,0.12087844,0.4295595,0.0033957418],"about_ca_topic_score_codex":0.0000041061703,"about_ca_topic_score_gemma":0.00006441464,"teacher_disagreement_score":0.9377635,"about_ca_system_score_codex":0.00003193797,"about_ca_system_score_gemma":0.000010859926,"threshold_uncertainty_score":0.513574},"labels":[],"label_agreement":null},{"id":"W4400596836","doi":"10.55016/ojs/cdm.v15i2.67943","title":"Minimum size blocking sets of certain line sets with respect to an elliptic quadric in $PG(3,q)$","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Human Resource Development; Science and Engineering Research Board; Ministry of Education, India; Council of Scientific and Industrial Research, India","keywords":"Quadric; Combinatorics; Mathematics; Line (geometry); Blocking (statistics); Type (biology); Blocking set; Connection (principal bundle); Discrete mathematics; Geometry; Pure mathematics; Projective space; Statistics","score_opus":0.015431631780813145,"score_gpt":0.26435813305748357,"score_spread":0.24892650127667043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596836","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.92176586,0.00012319483,0.075295225,0.0007206639,0.00007038261,0.00089178904,0.0003240316,0.00021427366,0.0005945855],"genre_scores_gemma":[0.9947147,0.0000032660762,0.004975442,0.000085572145,0.00004700615,0.00007511529,0.000020225541,0.00004601544,0.00003268384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984704,0.0000829268,0.00058975845,0.00024033288,0.00022473419,0.00039184577],"domain_scores_gemma":[0.9987671,0.00030140605,0.00007507753,0.00042548316,0.00011443509,0.00031652016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038038613,0.00024928822,0.000511259,0.0001463097,0.0000649748,0.000042948195,0.00028705032,0.00009081188,0.000040195893],"category_scores_gemma":[0.00056979165,0.00022165514,0.00007282846,0.0009891287,0.000033424283,0.0000967522,0.000048884533,0.00017900144,0.000058035796],"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.00080679,0.000924648,0.002167388,0.0044724196,0.00082770863,0.00028807076,0.10010247,0.54873127,0.16953608,0.16840532,0.0019846922,0.0017531496],"study_design_scores_gemma":[0.005720237,0.003383455,0.0029906884,0.0038995217,0.0005229089,0.000110568726,0.016410988,0.8658021,0.07080363,0.023499338,0.0037295425,0.0031269905],"about_ca_topic_score_codex":0.000007745922,"about_ca_topic_score_gemma":0.00006047419,"teacher_disagreement_score":0.31707087,"about_ca_system_score_codex":0.00007977418,"about_ca_system_score_gemma":0.000030858995,"threshold_uncertainty_score":0.9038834},"labels":[],"label_agreement":null},{"id":"W4400596870","doi":"10.55016/ojs/cdm.v15i2.62352","title":"$Q_4$-Factorization of $\\lambda K_n$ and $\\lambda K_x(m)$","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Lambda; Factorization; Combinatorics; Mathematics; Graph; Physics; Algorithm","score_opus":0.008506781654910561,"score_gpt":0.22344907458835542,"score_spread":0.21494229293344486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596870","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.17148934,0.0003989283,0.82240456,0.0005638098,0.00022477079,0.000635357,0.0006430835,0.00035241482,0.0032877305],"genre_scores_gemma":[0.99863946,0.000021368953,0.0010974084,0.000040223294,0.00007471918,0.000027426808,0.000036340545,0.000025814157,0.000037222817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991103,0.0000271393,0.0003853623,0.00013480708,0.00014150482,0.00020088351],"domain_scores_gemma":[0.9993398,0.000095233714,0.00006037598,0.00021222791,0.00010575815,0.0001865838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014263506,0.00016012973,0.00030939223,0.000060779323,0.000070630376,0.00003779785,0.00013084938,0.000080150654,0.000042318843],"category_scores_gemma":[0.00029389458,0.00015128912,0.000065384214,0.00034016932,0.00004311133,0.00010302858,0.000043595122,0.00009506649,0.000044231267],"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.000032157757,0.0000835512,0.0007461164,0.0019796796,0.0003372305,0.0000075647395,0.0119821,0.005534666,0.10618757,0.8680904,0.0038360453,0.0011829082],"study_design_scores_gemma":[0.0059671593,0.0012343745,0.0042377487,0.0019867956,0.0011032379,0.00009104169,0.010361758,0.4470716,0.26621553,0.18733996,0.070406325,0.003984457],"about_ca_topic_score_codex":0.0000017089073,"about_ca_topic_score_gemma":0.0000016452015,"teacher_disagreement_score":0.82715017,"about_ca_system_score_codex":0.000027529144,"about_ca_system_score_gemma":0.000011998554,"threshold_uncertainty_score":0.6169391},"labels":[],"label_agreement":null},{"id":"W4400650105","doi":"10.1145/3666000.3669712","title":"SAT and Lattice Reduction for Integer Factorization","year":2024,"lang":"en","type":"article","venue":"","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 Windsor","funders":"Universitas Brawijaya","keywords":"Lattice reduction; Factorization; Reduction (mathematics); Integer (computer science); Lattice (music); Integer lattice; Integer factorization; Computer science; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Physics; Condensed matter physics; Half-integer; Statistics","score_opus":0.007918975520314593,"score_gpt":0.20715564817976428,"score_spread":0.1992366726594497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400650105","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.387061,0.0014168195,0.59425217,0.00008902868,0.0038084462,0.00026873793,0.000008551367,0.001026332,0.012068896],"genre_scores_gemma":[0.9986329,0.00001273903,0.00014566367,0.0000024854326,0.00010534578,0.000011328264,0.000006424716,0.000009153896,0.0010739478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999837,0.000003704558,0.00004717438,0.000051346204,0.000017916003,0.00004285131],"domain_scores_gemma":[0.9999297,0.00001859146,0.000001687101,0.000030872685,0.0000064190403,0.000012732763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051487812,0.0000341451,0.000030473597,0.00003099412,0.000014097347,0.000033237553,0.000010542315,0.000025556783,0.000020903313],"category_scores_gemma":[0.0000033570727,0.000028458919,0.000012547864,0.000050843984,0.0000045833253,0.00009253176,0.0000016991893,0.000023113347,0.000013106012],"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.0000119398,0.0000068634367,0.00012525846,0.0012991682,0.00011848822,0.0000010317704,0.0026767086,0.0013711703,0.11351593,0.83782524,0.0095370775,0.03351111],"study_design_scores_gemma":[0.00044326327,0.00012924023,0.0007322183,0.00033736462,0.00011712721,0.00009703703,0.0026231736,0.41065103,0.09078074,0.116575636,0.37683022,0.0006829512],"about_ca_topic_score_codex":0.0000013003535,"about_ca_topic_score_gemma":8.021033e-7,"teacher_disagreement_score":0.72124964,"about_ca_system_score_codex":0.000007607366,"about_ca_system_score_gemma":0.0000011202444,"threshold_uncertainty_score":0.1160521},"labels":[],"label_agreement":null},{"id":"W4400888188","doi":"10.1016/j.jctb.2024.07.002","title":"Fractional coloring with local demands and applications to degree-sequence bounds on the independence number","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Government of Ontario; National Science Foundation","keywords":"Mathematics; Degree (music); Combinatorics; Independence (probability theory); Sequence (biology); Independence number; Discrete mathematics; Statistics; Graph","score_opus":0.014636745229695129,"score_gpt":0.23990438999761646,"score_spread":0.22526764476792133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400888188","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.85753375,0.000934784,0.109545685,0.0006432814,0.0078078215,0.0005428536,0.000016007107,0.00020897685,0.022766849],"genre_scores_gemma":[0.9991518,0.000031259664,0.000049350147,0.000040076455,0.0005485669,0.000036341597,3.583604e-7,0.000020514308,0.00012170208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991468,0.00008240136,0.00023538254,0.00009767701,0.0002988312,0.00013890876],"domain_scores_gemma":[0.9991931,0.00043714812,0.000048931004,0.00013004841,0.00009515052,0.00009565325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008940197,0.0001294993,0.0001590717,0.00007135854,0.00015699191,0.0001519032,0.0001844691,0.000069504975,0.000065879096],"category_scores_gemma":[0.000029626384,0.00008274861,0.000046572062,0.0002666011,0.00013919517,0.00033155628,0.000019605663,0.00042674286,0.000020891262],"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.00031147202,0.000013170115,0.00011171887,0.00003831724,0.00010393239,0.000028403618,0.00031180252,0.001706447,0.00039297028,0.9950649,0.00021818336,0.0016986824],"study_design_scores_gemma":[0.00044169833,0.0006285542,0.0003878989,0.00048060407,0.000073195566,0.0013817714,0.0017221252,0.00026253943,0.0040363776,0.8730569,0.11722482,0.00030350688],"about_ca_topic_score_codex":0.0000011974693,"about_ca_topic_score_gemma":0.0000017467735,"teacher_disagreement_score":0.14161809,"about_ca_system_score_codex":0.000070161834,"about_ca_system_score_gemma":0.000055746023,"threshold_uncertainty_score":0.33743903},"labels":[],"label_agreement":null},{"id":"W4401024175","doi":"10.24963/ijcai.2024/210","title":"Coming Out of the Dark: Human Pose Estimation in Low-light Conditions","year":2024,"lang":"en","type":"article","venue":"","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 Windsor","funders":"","keywords":"Solver; Computer science; Boolean satisfiability problem; Algebra over a field; Programming language; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.007908125011100465,"score_gpt":0.2378872443781093,"score_spread":0.22997911936700882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401024175","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.93667006,0.000114835275,0.001933487,0.00007170449,0.0010111401,0.00013158227,0.000009445371,0.00016824935,0.059889484],"genre_scores_gemma":[0.99946773,5.520584e-7,0.000022335473,0.0000068914105,0.000014116894,0.000008725433,0.000004410301,0.000008020665,0.00046719273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996818,0.000019653977,0.00013919776,0.000048111673,0.00004814895,0.00006312473],"domain_scores_gemma":[0.9998429,0.00002501423,0.000007189026,0.000109229346,0.0000052672494,0.000010437181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106249325,0.000046437097,0.000060975544,0.000060095983,0.000028955312,0.000017054304,0.0000636419,0.000026772921,0.00007984262],"category_scores_gemma":[0.000004770698,0.00003332348,0.00003548773,0.00011954572,0.000014855958,0.00006925845,0.0000087954,0.000066905566,0.000026664604],"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.0000016304026,0.000033582404,0.0009706001,0.00081062916,0.00007084866,0.0000082245315,0.0050079506,0.03865516,0.21293989,0.7338182,0.0072143753,0.00046890974],"study_design_scores_gemma":[0.0007500264,0.00004429454,0.023229262,0.0034210912,0.0000799706,0.000021883172,0.0021584919,0.5947847,0.21275984,0.1579304,0.0041792165,0.0006408568],"about_ca_topic_score_codex":0.0000085743595,"about_ca_topic_score_gemma":0.00006483052,"teacher_disagreement_score":0.5758878,"about_ca_system_score_codex":0.000015596052,"about_ca_system_score_gemma":0.00000357746,"threshold_uncertainty_score":0.1358892},"labels":[],"label_agreement":null},{"id":"W4402193221","doi":"10.5802/alco.370","title":"The base size of the symmetric group acting on subsets","year":2024,"lang":"lv","type":"article","venue":"Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"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":"Natural Sciences and Engineering Research Council of Canada; University of St Andrews","keywords":"Base (topology); Permutation group; Combinatorics; Permutation (music); Group (periodic table); Mathematics; Symmetric group; Primitive permutation group; Set (abstract data type); Pointwise; Discrete mathematics; Cyclic permutation; Computer science; Physics","score_opus":0.007844251260929224,"score_gpt":0.20200337605478239,"score_spread":0.19415912479385317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402193221","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.94109845,0.021554481,0.000052653068,0.0006303349,0.023141757,0.00065206713,0.000036278903,0.0003071073,0.012526854],"genre_scores_gemma":[0.9980165,0.0004442292,0.0000023210732,0.000046992627,0.00018879764,0.000030812185,0.0000023520843,0.000097116164,0.0011708965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973674,0.00038533405,0.00063752173,0.00038354247,0.00064028543,0.0005859356],"domain_scores_gemma":[0.99285644,0.0057592127,0.00014464742,0.0010518689,0.00006778754,0.0001200275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013012103,0.00040420488,0.0003616494,0.00017060114,0.0005141986,0.00024504995,0.0009291842,0.00020760388,0.000038675873],"category_scores_gemma":[0.00088467647,0.00025747324,0.00043320976,0.0036718536,0.00013918235,0.00013055876,0.00018137724,0.0009757509,0.0001565406],"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.000016268137,0.00009523083,0.00065826793,0.0007140332,0.0002901189,0.00002764364,0.0009464377,0.00010915128,0.00025758534,0.9835141,0.0025782844,0.010792932],"study_design_scores_gemma":[0.0027530189,0.0011265826,0.03553809,0.005105048,0.0012595771,0.00013184422,0.0043780184,0.03268942,0.014681016,0.72316504,0.17648953,0.0026828225],"about_ca_topic_score_codex":0.00003772599,"about_ca_topic_score_gemma":0.000016160559,"teacher_disagreement_score":0.260349,"about_ca_system_score_codex":0.00019905127,"about_ca_system_score_gemma":0.00006364149,"threshold_uncertainty_score":0.9999877},"labels":[],"label_agreement":null},{"id":"W4402536618","doi":"10.61091/ars-in-press-02","title":"Nilpotent Covers of Dihedral Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dihedral group; Nilpotent; Dihedral angle; Pure mathematics; Group (periodic table); Chemistry","score_opus":0.005181752518495255,"score_gpt":0.18989263048196028,"score_spread":0.18471087796346503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402536618","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.98140275,0.0014467523,0.0000727947,0.000016760407,0.0067680716,0.000080597456,0.000007408136,0.00033007498,0.00987478],"genre_scores_gemma":[0.99977696,0.000027421636,0.000008774494,0.0000053508156,0.000010859824,0.0000087233075,0.0000038126395,0.000023932518,0.00013417224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994541,0.000020682763,0.00016243047,0.00010071199,0.00011714045,0.00014494496],"domain_scores_gemma":[0.9997208,0.000046970363,0.000010178793,0.00016398,0.000012899524,0.00004515993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013282434,0.00009718438,0.00013499153,0.00006873398,0.0000191218,0.00002355073,0.000110632456,0.000055549215,0.00004257755],"category_scores_gemma":[0.0000058661412,0.00009339051,0.0000854292,0.00020730765,0.00002845396,0.00009697123,0.000015627753,0.00010451396,0.0000847983],"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.0000037670018,0.000013442406,0.00026883997,0.00021154693,0.00007220116,0.000017996574,0.00033968076,0.0004975754,0.0057333126,0.989579,0.0027761534,0.00048648173],"study_design_scores_gemma":[0.00062463654,0.00013345086,0.0016283751,0.0003225599,0.000076304816,0.000025518746,0.00037090637,0.01115694,0.0243296,0.9449501,0.015962321,0.00041929944],"about_ca_topic_score_codex":0.0000062479,"about_ca_topic_score_gemma":6.1542283e-7,"teacher_disagreement_score":0.04462892,"about_ca_system_score_codex":0.000029917615,"about_ca_system_score_gemma":0.0000077596005,"threshold_uncertainty_score":0.38083547},"labels":[],"label_agreement":null},{"id":"W4402635708","doi":"10.2139/ssrn.4932667","title":"Worst-case Distortion Risk Measures of Limited Stop-loss Transforms With Uncertain Distributions Lying in Wasserstein Balls","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Lying; Distortion (music); Mathematics; Computer science; Telecommunications","score_opus":0.010582671356766396,"score_gpt":0.21339462126994974,"score_spread":0.20281194991318335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402635708","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.88562036,0.011580151,0.10133794,0.000056931265,0.0005004277,0.00040668045,0.0001575335,0.00014070969,0.00019924426],"genre_scores_gemma":[0.9951402,0.0044454257,0.00003580262,0.0000012636082,0.00013009942,0.000060164315,0.00005684019,0.000075613876,0.000054590422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967733,0.00020144551,0.0007943983,0.0003257339,0.00037145792,0.0015336899],"domain_scores_gemma":[0.99917805,0.00006467592,0.00022628784,0.00032408297,0.0000930663,0.00011383325],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002534514,0.00043230553,0.00056598923,0.0004701757,0.00014675279,0.0000870413,0.00030418704,0.00033242773,0.000005598281],"category_scores_gemma":[0.000034787925,0.0003529534,0.00032277248,0.0005460117,0.00007588495,0.00011646075,0.000042585547,0.0060556824,0.0000043685645],"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.0010567205,0.0004679602,0.009088389,0.002849418,0.0069823624,0.0020635012,0.009219446,0.6361657,0.0026960834,0.25909433,0.000057731104,0.070258364],"study_design_scores_gemma":[0.0025190385,0.000670792,0.00078955176,0.0044301143,0.0013977875,0.009666515,0.01362731,0.01736572,0.0020004837,0.9453014,0.00041194467,0.0018193328],"about_ca_topic_score_codex":0.0004107924,"about_ca_topic_score_gemma":0.008769142,"teacher_disagreement_score":0.68620706,"about_ca_system_score_codex":0.0022324843,"about_ca_system_score_gemma":0.00085046113,"threshold_uncertainty_score":0.99989223},"labels":[],"label_agreement":null},{"id":"W4402679330","doi":"10.1007/s11083-024-09685-7","title":"Partition Rank and Partition Lattices","year":2024,"lang":"en","type":"article","venue":"Order","topic":"graph theory and CDMA systems","field":"Engineering","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":"York University","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Rank (graph theory); Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.0063255926443933266,"score_gpt":0.20017275173423477,"score_spread":0.19384715908984143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402679330","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.9681906,0.00503638,0.004167743,0.00016523182,0.00091736217,0.00008673107,0.0000061305195,0.00060200226,0.020827804],"genre_scores_gemma":[0.9994648,0.00008284926,0.00003595062,0.000014780179,0.000079313075,0.000015729354,0.0000051597167,0.000009724101,0.00029168202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997669,0.000011046563,0.000056110035,0.00006139541,0.00003410528,0.0000704448],"domain_scores_gemma":[0.9999085,0.000016463666,0.0000026178343,0.000046561825,0.000005875552,0.000019977888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007282123,0.000043847773,0.000040826537,0.000026091107,0.000022126318,0.00004952639,0.000014000989,0.000028469232,0.00018705562],"category_scores_gemma":[0.0000027770081,0.0000392821,0.000011864013,0.00008821505,0.0000119022425,0.00011478889,0.0000028756988,0.000040623043,0.00019606149],"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.0000438381,0.00007489345,0.004851047,0.0048537203,0.0005602665,0.00013046045,0.00795175,0.010891506,0.08338305,0.66769224,0.061387856,0.15817936],"study_design_scores_gemma":[0.00048187972,0.0000680061,0.00513793,0.0005226273,0.000106743464,0.00006185789,0.00043734314,0.15989785,0.009297197,0.061422676,0.7619794,0.00058649125],"about_ca_topic_score_codex":0.0000017002085,"about_ca_topic_score_gemma":0.000005049666,"teacher_disagreement_score":0.70059156,"about_ca_system_score_codex":0.000003839829,"about_ca_system_score_gemma":0.0000015631333,"threshold_uncertainty_score":0.2520039},"labels":[],"label_agreement":null},{"id":"W4403024451","doi":"10.1109/pacrim61180.2024.10690211","title":"Swapping Algorithms for Combinatorial Optimization of QAM Constellation Labels","year":2024,"lang":"en","type":"article","venue":"","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":"Computer science; Constellation; Quadrature amplitude modulation; QAM; Algorithm; Combinatorial optimization; Theoretical computer science; Bit error rate; Decoding methods","score_opus":0.012981845259994029,"score_gpt":0.22749949996893037,"score_spread":0.21451765470893636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403024451","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.010240199,0.000872588,0.9434265,0.00002093611,0.0055990806,0.00045217588,0.00002092597,0.00063157105,0.03873601],"genre_scores_gemma":[0.99662966,0.000015112062,0.0030751661,0.0000023747,0.00012301521,0.000007942065,0.00001704261,0.000015520753,0.00011414963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996363,0.000010002348,0.0001583751,0.00006839477,0.00005307802,0.00007384981],"domain_scores_gemma":[0.9998025,0.000084125306,0.000010255966,0.000059263304,0.000027343856,0.000016537106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014972314,0.00005716541,0.00008898884,0.000050177438,0.000018354098,0.00002320863,0.00003261431,0.00005164541,0.00007134487],"category_scores_gemma":[0.000005498852,0.000054709384,0.00004126665,0.00013200047,0.000011795759,0.00008516801,0.0000036323092,0.000028840877,0.0000054851243],"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.0000071072895,0.000009609962,0.000014990006,0.00063684344,0.00009243466,6.06912e-7,0.00025310132,0.70412135,0.0050797253,0.28356123,0.0015501642,0.0046728537],"study_design_scores_gemma":[0.00021637307,0.000024089954,0.0000014384442,0.000075834585,0.000015022711,0.0000017331952,0.000071203554,0.97761554,0.013373431,0.004512905,0.0040139095,0.0000785032],"about_ca_topic_score_codex":0.0000015322905,"about_ca_topic_score_gemma":1.2145019e-7,"teacher_disagreement_score":0.98638946,"about_ca_system_score_codex":0.000012265627,"about_ca_system_score_gemma":0.0000062651357,"threshold_uncertainty_score":0.2230984},"labels":[],"label_agreement":null},{"id":"W4403165688","doi":"10.61091/ars-160-08","title":"Decomposition of the λ -Fold Complete Equipartite Graph into Unicyclic Graphs of Order Five","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Graph; Discrete mathematics; Computer science; Programming language","score_opus":0.0075931445805088975,"score_gpt":0.2268545531715541,"score_spread":0.2192614085910452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165688","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.9930815,0.0015167281,0.000104787425,0.000033037508,0.0030626478,0.00017994302,0.000016639413,0.00013442207,0.001870299],"genre_scores_gemma":[0.99982566,0.000036896963,0.000039421408,0.000010193104,0.0000049607274,0.000016799944,0.0000068319578,0.000026134952,0.000033092052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991155,0.0000891902,0.00032563633,0.00013521874,0.00017254829,0.00016187351],"domain_scores_gemma":[0.99939024,0.00011149331,0.000047683836,0.0003511233,0.000059845417,0.000039616127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020847346,0.00013826152,0.00022005074,0.0001394603,0.000053051263,0.000018471179,0.00026528997,0.000073871975,0.000020659594],"category_scores_gemma":[0.000009578964,0.00011101212,0.00016627173,0.0009007386,0.00011018233,0.000103403276,0.000048279104,0.00014958186,0.000013366618],"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.000006288268,0.000028869246,0.00062593864,0.00033871716,0.00016003607,0.0000023594387,0.0009261705,0.00084320945,0.044343103,0.95167977,0.0007026762,0.00034287246],"study_design_scores_gemma":[0.0003575099,0.00007268243,0.0019056777,0.0004548333,0.00007074313,0.0000065337767,0.00014771392,0.006898973,0.030510534,0.9582453,0.0011383558,0.00019115723],"about_ca_topic_score_codex":0.00005271964,"about_ca_topic_score_gemma":0.0000137324105,"teacher_disagreement_score":0.013832569,"about_ca_system_score_codex":0.000020559863,"about_ca_system_score_gemma":0.000012484597,"threshold_uncertainty_score":0.4526943},"labels":[],"label_agreement":null},{"id":"W4403165707","doi":"10.61091/ars-160-02","title":"Nilpotent Covers of Dihedral Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nilpotent; Mathematics; Dihedral group; Dihedral angle; Pure mathematics; Group (periodic table); Chemistry","score_opus":0.005181752518495255,"score_gpt":0.18989263048196028,"score_spread":0.18471087796346503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165707","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.98140275,0.0014467523,0.0000727947,0.000016760407,0.0067680716,0.000080597456,0.000007408136,0.00033007498,0.00987478],"genre_scores_gemma":[0.99977696,0.000027421636,0.000008774494,0.0000053508156,0.000010859824,0.0000087233075,0.0000038126395,0.000023932518,0.00013417224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994541,0.000020682763,0.00016243047,0.00010071199,0.00011714045,0.00014494496],"domain_scores_gemma":[0.9997208,0.000046970363,0.000010178793,0.00016398,0.000012899524,0.00004515993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013282434,0.00009718438,0.00013499153,0.00006873398,0.0000191218,0.00002355073,0.000110632456,0.000055549215,0.00004257755],"category_scores_gemma":[0.0000058661412,0.00009339051,0.0000854292,0.00020730765,0.00002845396,0.00009697123,0.000015627753,0.00010451396,0.0000847983],"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.0000037670018,0.000013442406,0.00026883997,0.00021154693,0.00007220116,0.000017996574,0.00033968076,0.0004975754,0.0057333126,0.989579,0.0027761534,0.00048648173],"study_design_scores_gemma":[0.00062463654,0.00013345086,0.0016283751,0.0003225599,0.000076304816,0.000025518746,0.00037090637,0.01115694,0.0243296,0.9449501,0.015962321,0.00041929944],"about_ca_topic_score_codex":0.0000062479,"about_ca_topic_score_gemma":6.1542283e-7,"teacher_disagreement_score":0.04462892,"about_ca_system_score_codex":0.000029917615,"about_ca_system_score_gemma":0.0000077596005,"threshold_uncertainty_score":0.38083547},"labels":[],"label_agreement":null},{"id":"W4403165768","doi":"10.61091/jcmcc122-01","title":"Cyclic Decompositions of λ K n into LWO Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.006831238778567406,"score_gpt":0.2323769293118001,"score_spread":0.2255456905332327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165768","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.9633491,0.0031212096,0.00599031,0.000030023837,0.025667753,0.00015630983,0.0000028706888,0.00012069239,0.0015616983],"genre_scores_gemma":[0.9975836,0.000084663945,0.0016064515,0.0000029757196,0.0006744416,0.0000015109181,9.822053e-7,0.0000431454,0.0000022022543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980994,0.000068207744,0.0010995122,0.00012395502,0.00038728982,0.00022162034],"domain_scores_gemma":[0.99867016,0.00055816397,0.000256092,0.00017618485,0.00019653483,0.0001428676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248838,0.00023573714,0.00063414493,0.00036140037,0.00012278088,0.00015595045,0.0002760105,0.00013912132,0.000007476063],"category_scores_gemma":[0.00006853038,0.00021206542,0.00026499233,0.00046130182,0.00008379897,0.00020276477,0.00006391711,0.00041001302,0.000003140755],"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.000017245062,0.0001330497,0.000036360136,0.0010947059,0.00025905907,0.000027102695,0.0019395526,0.00027372254,0.008812995,0.98580205,0.0002769503,0.0013271761],"study_design_scores_gemma":[0.0010571826,0.00034102614,0.00002760236,0.0012307747,0.0001418321,0.00017647467,0.00035103934,0.012354499,0.00533385,0.9778233,0.00091981766,0.00024255775],"about_ca_topic_score_codex":0.0000038313456,"about_ca_topic_score_gemma":2.0554428e-7,"teacher_disagreement_score":0.034234494,"about_ca_system_score_codex":0.00004766226,"about_ca_system_score_gemma":0.00004614747,"threshold_uncertainty_score":0.8647777},"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":"W4403446952","doi":"10.1109/acit62333.2024.10712631","title":"A McEliece-type Cryptosystem using a Random Inverse Matrix and an Error Vector with Large Hamming Weight","year":2024,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"McEliece cryptosystem; Hamming weight; Cryptosystem; Hamming code; Hamming distance; Mathematics; Hamming(7,4); Inverse; Discrete mathematics; Algorithm; Cryptography; Decoding methods; Block code","score_opus":0.01076897706016645,"score_gpt":0.23971115487467554,"score_spread":0.2289421778145091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403446952","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.9791917,0.002499169,0.014985361,0.0000113448,0.0007626417,0.00028399014,0.000010016359,0.0008100211,0.0014457626],"genre_scores_gemma":[0.99838006,0.00001169305,0.00091797777,0.000010029378,0.00017335647,0.0000108556105,0.0000045444094,0.000059194048,0.00043231263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911267,0.0000620475,0.00019481192,0.00022805868,0.00012243533,0.0002799836],"domain_scores_gemma":[0.999602,0.00004578549,0.000014589392,0.00019167205,0.0000231588,0.00012274817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029235554,0.00019761437,0.0002487058,0.00014703703,0.000089999376,0.00014418998,0.00007322945,0.00008300478,0.000117956144],"category_scores_gemma":[0.0000047417175,0.00014652575,0.000041667416,0.00031898354,0.000021369222,0.00031086057,0.000017332792,0.0001322175,0.00004484599],"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.0028074083,0.00032417072,0.016767653,0.021993486,0.003941777,0.0028739164,0.037933603,0.04172692,0.42518687,0.43448964,0.009203327,0.0027512377],"study_design_scores_gemma":[0.0023045016,0.00014219277,0.00005873389,0.00080841396,0.00015602275,0.0002466722,0.002639329,0.9634631,0.0032783188,0.00027917972,0.0260013,0.00062223483],"about_ca_topic_score_codex":0.00002736443,"about_ca_topic_score_gemma":0.00013725736,"teacher_disagreement_score":0.9217362,"about_ca_system_score_codex":0.000034934277,"about_ca_system_score_gemma":0.000020262552,"threshold_uncertainty_score":0.5975146},"labels":[],"label_agreement":null},{"id":"W4403577280","doi":"10.48550/arxiv.2410.12039","title":"EFX Orientations of Multigraphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Economics; Mathematics","score_opus":0.0384326268622161,"score_gpt":0.15977008664633022,"score_spread":0.12133745978411412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403577280","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.9741003,0.00042035728,0.006694097,0.000003501687,0.0016532945,0.00020727713,0.00011782117,0.0004310352,0.016372317],"genre_scores_gemma":[0.99881136,0.00011689445,0.000044367236,0.0000027172546,0.00004212792,0.0000013251042,0.000022997716,0.00003113675,0.0009270667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992576,0.00004083861,0.00017634052,0.00032131546,0.000041814394,0.0001620803],"domain_scores_gemma":[0.99932975,0.00004612569,0.000051089468,0.0004491503,0.000050668248,0.00007322529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009562167,0.0002017121,0.00024364237,0.00032049257,0.000033599976,0.000017472777,0.0002995987,0.00020655332,0.00006166823],"category_scores_gemma":[0.0000061547407,0.00023854642,0.0002471019,0.00048306191,0.0000777571,0.00004512711,0.00019939318,0.00040815948,0.000104057835],"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.000012199343,0.000030164947,0.0014055545,0.0011300441,0.0003862065,0.00010228112,0.0007198054,0.66409385,0.0006039742,0.33075538,0.00064333976,0.00011721417],"study_design_scores_gemma":[0.0008237677,0.000061660314,0.001955656,0.0011862037,0.00085909595,0.000009239365,0.0022374184,0.5168614,0.004641274,0.46724194,0.0027914813,0.0013308695],"about_ca_topic_score_codex":0.000053922337,"about_ca_topic_score_gemma":0.00003294857,"teacher_disagreement_score":0.14723246,"about_ca_system_score_codex":0.00004694839,"about_ca_system_score_gemma":0.000026294136,"threshold_uncertainty_score":0.972764},"labels":[],"label_agreement":null},{"id":"W4403619422","doi":"10.13001/ela.2024.8671","title":"Characterizations of complex P-matrices","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics","score_opus":0.007500226076614021,"score_gpt":0.22135283934090658,"score_spread":0.21385261326429256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619422","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.96042687,0.018577298,0.018664103,0.00012986,0.0007317411,0.00007293105,0.000011823658,0.00010167254,0.0012837074],"genre_scores_gemma":[0.9987715,0.0007276225,0.000082924795,0.000007905595,0.00030202526,8.0689574e-7,0.0000038446224,0.000021368078,0.00008201664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919635,0.000029914876,0.0003888771,0.000048112033,0.00013137724,0.00020539781],"domain_scores_gemma":[0.99970585,0.00005431385,0.000070442846,0.00007937586,0.000052402767,0.00003759371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003166392,0.00008280386,0.00018924019,0.00019343551,0.000023111448,0.000020428473,0.00014413211,0.000038572296,0.00012950799],"category_scores_gemma":[0.000010587158,0.000069874965,0.00012554442,0.0003229779,0.000019046665,0.00015549557,0.000006385314,0.0002661674,0.00002225911],"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.000060690127,0.000114196104,0.00037334408,0.0011262841,0.0017178634,0.000068294976,0.0022892272,0.007733801,0.45059788,0.51723367,0.0033087176,0.015376062],"study_design_scores_gemma":[0.0021439688,0.0021703183,0.004585709,0.002104395,0.00082903507,0.0031873109,0.0010354299,0.1497552,0.13862462,0.09006196,0.6040807,0.0014213928],"about_ca_topic_score_codex":8.4788246e-7,"about_ca_topic_score_gemma":0.0000012086138,"teacher_disagreement_score":0.60077196,"about_ca_system_score_codex":0.000037669015,"about_ca_system_score_gemma":0.00008246649,"threshold_uncertainty_score":0.28494182},"labels":[],"label_agreement":null},{"id":"W4403826439","doi":"10.1109/comst.2024.3487112","title":"RIS-Assisted Physical Layer Security in Emerging RF and Optical Wireless Communications Systems: A Comprehensive Survey","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":91,"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; University of Guelph; McMaster University","funders":"HORIZON EUROPE Framework Programme; Natural Sciences and Engineering Research Council of Canada; European Commission; McMaster University; Agence Nationale de la Recherche; University of Guelph","keywords":"Physical layer; Wireless; Layer (electronics); Computer science; Telecommunications; Materials science; Nanotechnology","score_opus":0.06455284319399247,"score_gpt":0.3188448688402552,"score_spread":0.25429202564626274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403826439","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.9763351,0.014531225,0.0012396147,0.0001827614,0.0032726764,0.00083320466,0.00043783753,0.00077254017,0.0023950243],"genre_scores_gemma":[0.9973814,0.0016010036,0.00012313602,0.000007880481,0.0002181743,0.0003133888,0.00024097801,0.00007725495,0.000036789894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924633,0.005657825,0.0008515017,0.00035514744,0.0002625848,0.0004096218],"domain_scores_gemma":[0.9904776,0.0058397357,0.000080767626,0.0032123222,0.00023559948,0.00015395091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0045914813,0.0003563615,0.00073222996,0.0003120331,0.00032653735,0.00033573396,0.0014501464,0.00021727526,0.000004649147],"category_scores_gemma":[0.00015155181,0.0003748637,0.00012046307,0.0011184743,0.00049244915,0.00033674066,0.0003802021,0.0008112125,0.00006762151],"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.00021317221,0.0047457605,0.058631644,0.0071764253,0.005352907,0.0001350286,0.0734183,0.016653726,0.24300829,0.53662986,0.017260825,0.036774054],"study_design_scores_gemma":[0.002879785,0.00017326645,0.22323515,0.00348898,0.00043984255,0.00017506556,0.0059451843,0.6669993,0.0022289555,0.006066812,0.08478274,0.0035849346],"about_ca_topic_score_codex":0.0016816775,"about_ca_topic_score_gemma":0.0026556097,"teacher_disagreement_score":0.65034556,"about_ca_system_score_codex":0.00016804427,"about_ca_system_score_gemma":0.00007178987,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W4403939241","doi":"10.5802/alco.375","title":"The linear system for Sudoku and a fractional completion threshold","year":2024,"lang":"en","type":"article","venue":"Algebraic Combinatorics","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Applied mathematics; Calculus (dental); Medicine; Orthodontics","score_opus":0.009174809248733927,"score_gpt":0.2129243991810131,"score_spread":0.20374958993227918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403939241","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.88058203,0.040314388,0.037402917,0.0008183342,0.021088174,0.0016936444,0.000089670895,0.0032691888,0.014741655],"genre_scores_gemma":[0.9994261,0.00007145039,0.000011716556,0.000008601754,0.00013394862,0.00009195332,0.000010737525,0.000029102488,0.00021638066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993873,0.000017886718,0.00016745983,0.00013174006,0.00012669363,0.00016889603],"domain_scores_gemma":[0.999365,0.00039640482,0.000013657887,0.00014334956,0.000034561068,0.000047036396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034849814,0.00011093586,0.00011154995,0.00004745985,0.00022919492,0.00011410821,0.000091527814,0.000065759115,0.0000030142114],"category_scores_gemma":[0.000013063625,0.00008522263,0.000060892587,0.00018205147,0.000032987162,0.000081802704,0.000016224525,0.00013794858,0.000023341667],"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.0000051778707,0.000004948617,0.00007822461,0.0003581094,0.000057667206,0.0000028027625,0.00008033877,0.00011617498,0.00014402073,0.99627906,0.0023741438,0.000499341],"study_design_scores_gemma":[0.0005852804,0.00010997333,0.0006399564,0.0002614703,0.00007838613,0.00012802501,0.0006011168,0.32179275,0.00067832984,0.2680007,0.4067387,0.00038530162],"about_ca_topic_score_codex":0.0000026164194,"about_ca_topic_score_gemma":0.0000021257024,"teacher_disagreement_score":0.72827834,"about_ca_system_score_codex":0.000058684596,"about_ca_system_score_gemma":0.000011135903,"threshold_uncertainty_score":0.3475278},"labels":[],"label_agreement":null},{"id":"W4403969779","doi":"10.55016/ojs/cdm.v19i3.68835","title":"Uniformly resolvable ${P_4, C_k}$-decomposition of $K_n$ - a complete solution","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Atomic Energy, Government of India; University Grants Commission","keywords":"Mathematics; Combinatorics; Decomposition; Discrete mathematics; Chemistry; Organic chemistry","score_opus":0.010436032785876681,"score_gpt":0.26578712690123246,"score_spread":0.2553510941153558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969779","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.059657738,0.001691534,0.9225551,0.00033024966,0.00070866896,0.0007564241,0.001703846,0.00085235917,0.011744079],"genre_scores_gemma":[0.9964866,0.00002280286,0.002952335,0.000010440443,0.000078979516,0.000073109026,0.00012733259,0.000034327186,0.00021408436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.000036429396,0.0004939687,0.00015305492,0.00018361463,0.0003065886],"domain_scores_gemma":[0.99925864,0.00013778756,0.000039824918,0.00033975838,0.000114195245,0.00010982213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041214583,0.00017954929,0.00030132715,0.00021563018,0.00012263148,0.00008383758,0.00017040658,0.00009421627,0.00006832297],"category_scores_gemma":[0.000060085906,0.00016861579,0.00014777722,0.0005273751,0.00005447885,0.00017349068,0.000039113784,0.00014219119,0.00026245796],"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.0000129603195,0.000057108056,0.0000062905915,0.0014125168,0.00022815962,0.00000989054,0.0016289172,0.007461439,0.10568597,0.8755242,0.0073981932,0.00057430624],"study_design_scores_gemma":[0.0006061299,0.0002155186,0.0001240744,0.0023992318,0.00030117383,0.0001000692,0.00073013443,0.7857209,0.026452405,0.13184209,0.050748527,0.0007597716],"about_ca_topic_score_codex":0.0000073966817,"about_ca_topic_score_gemma":0.000008266889,"teacher_disagreement_score":0.93682885,"about_ca_system_score_codex":0.00013136533,"about_ca_system_score_gemma":0.000026058737,"threshold_uncertainty_score":0.68759525},"labels":[],"label_agreement":null},{"id":"W4404145574","doi":"10.1007/s00493-024-00122-2","title":"Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monochromatic color; Term (time); Arithmetic; Combinatorics; Arithmetic progression; Plane (geometry); Geometry; Physics","score_opus":0.006440745679770104,"score_gpt":0.2143328731498059,"score_spread":0.2078921274700358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404145574","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.98755866,0.0034441992,0.00014289755,0.000042593663,0.0025072924,0.00030950812,0.0000072226762,0.0003944073,0.0055932007],"genre_scores_gemma":[0.9996851,0.000015802787,0.000019856621,0.0000038224275,0.00003278207,0.00006312928,0.0000014435802,0.00002600892,0.00015206412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992883,0.000048121496,0.00021944268,0.00011693612,0.00013557826,0.00019160192],"domain_scores_gemma":[0.99949855,0.00010917536,0.000024611345,0.00029885294,0.000015869702,0.00005297322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013782509,0.00012352188,0.00018065628,0.000071849696,0.00007413678,0.00003708392,0.00024261368,0.000049012848,0.000020375723],"category_scores_gemma":[0.000016904038,0.00008621682,0.00009092779,0.00038713656,0.000047227193,0.000060892267,0.000045315024,0.00017887354,0.00002623498],"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.000013019391,0.00022691602,0.010225975,0.0029052706,0.0004899916,0.00013164285,0.004229147,0.0010972734,0.040110186,0.9326683,0.002382821,0.0055194115],"study_design_scores_gemma":[0.006142339,0.0011155069,0.089761026,0.016591681,0.0011322213,0.0007469863,0.0025803535,0.17065321,0.2628156,0.39977303,0.045171633,0.0035164237],"about_ca_topic_score_codex":0.0000036592335,"about_ca_topic_score_gemma":0.0000010589738,"teacher_disagreement_score":0.5328953,"about_ca_system_score_codex":0.000055863376,"about_ca_system_score_gemma":0.000017811126,"threshold_uncertainty_score":0.351582},"labels":[],"label_agreement":null},{"id":"W4404304524","doi":"10.48550/arxiv.2410.16495","title":"Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Government of Ontario; Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Bipartite graph; Combinatorics; Tree (set theory); Mathematics; Robertson–Seymour theorem; Discrete mathematics; Graph; 1-planar graph; Chordal graph","score_opus":0.06981344404602814,"score_gpt":0.17610309202948565,"score_spread":0.10628964798345751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404304524","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.98628116,0.00027033163,0.00072351325,0.00002299383,0.0011929541,0.00034561183,0.000114088005,0.0006704124,0.010378965],"genre_scores_gemma":[0.99936783,0.000118639546,0.00004973221,0.000017329963,0.00008840068,0.000004552119,0.00005438649,0.00006408096,0.00023506301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849296,0.00011803434,0.0002615932,0.0006891196,0.00006764745,0.0003706333],"domain_scores_gemma":[0.9989425,0.00008248803,0.000070403745,0.0006267536,0.000049697417,0.00022817019],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001343462,0.00043698656,0.00044458703,0.00061543053,0.00015651391,0.000113584036,0.0003937639,0.00041582063,0.000038313527],"category_scores_gemma":[0.0000049106875,0.0005235307,0.00025340734,0.0006409752,0.0000956978,0.000105764135,0.00045154756,0.000988842,0.00011737427],"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.00014379756,0.00025084324,0.012088827,0.0039471146,0.0035719816,0.001974223,0.0032749076,0.12787697,0.13279763,0.7095898,0.0019919863,0.0024919377],"study_design_scores_gemma":[0.0027633528,0.00033440816,0.02794967,0.0024060146,0.0022093386,0.00012902252,0.0017744403,0.5275553,0.0068594352,0.42039105,0.002631488,0.004996508],"about_ca_topic_score_codex":0.0001238792,"about_ca_topic_score_gemma":0.00025686465,"teacher_disagreement_score":0.39967832,"about_ca_system_score_codex":0.00010477374,"about_ca_system_score_gemma":0.00003944872,"threshold_uncertainty_score":0.99972165},"labels":[],"label_agreement":null},{"id":"W4404545979","doi":"10.4153/s0008439524000419","title":"Completion problems and sparsity for Kemeny’s constant","year":2024,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Constant (computer programming); Diagonal; Matrix (chemical analysis); Diagonal matrix; Value (mathematics); Combinatorics; Main diagonal; Algebra over a field; Discrete mathematics; Pure mathematics; Statistics; Computer science; Geometry","score_opus":0.01590555696797146,"score_gpt":0.18670030439235824,"score_spread":0.17079474742438677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404545979","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.5795136,0.0074899388,0.16218163,0.009033982,0.0018119852,0.0043094032,0.0006555395,0.0018748686,0.23312904],"genre_scores_gemma":[0.9988437,0.000008383131,0.00045597256,0.00007030497,0.000046132547,0.00006131264,0.000008093472,0.000022603068,0.00048349518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994306,0.00001311937,0.00014833605,0.00012282761,0.000052596184,0.00023251976],"domain_scores_gemma":[0.9995346,0.00011878457,0.000005418482,0.00009367169,0.000013842945,0.00023370105],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025520788,0.00009811588,0.00014091763,0.000076912664,0.00006282399,0.00007881752,0.00005363963,0.000058653517,0.001095158],"category_scores_gemma":[0.000026372634,0.00009180288,0.000037956303,0.000057640696,0.00005594089,0.000015478532,0.000005168601,0.00007548545,0.00078757654],"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.000002029105,0.0000056722915,0.000019266105,0.0022956836,0.000053837633,0.000020015874,0.0005098744,0.00007637088,0.00042490868,0.9554623,0.040096104,0.0010339853],"study_design_scores_gemma":[0.00016165331,0.000032417443,0.000031545456,0.0004459205,0.000032889006,0.000070806025,0.00014782118,0.02595763,0.00010594015,0.17185141,0.80091023,0.00025171117],"about_ca_topic_score_codex":0.000083550956,"about_ca_topic_score_gemma":0.00034127128,"teacher_disagreement_score":0.7836108,"about_ca_system_score_codex":0.000056493474,"about_ca_system_score_gemma":0.00001869353,"threshold_uncertainty_score":0.9999904},"labels":[],"label_agreement":null},{"id":"W4404692016","doi":"10.4171/owr/2024/29","title":"Arrangements, Matroids and Logarithmic Vector Fields","year":2024,"lang":"en","type":"article","venue":"Oberwolfach Reports","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":"Western University","funders":"","keywords":"Matroid; Hyperplane; Simple (philosophy); Mathematics; Combinatorics; Subject (documents); Oriented matroid; Order (exchange); Realization (probability); Logarithm; Object (grammar); Focus (optics); Algebraic number; Computer science; Discrete mathematics; Graphic matroid; Artificial intelligence; Physics","score_opus":0.004808241260094329,"score_gpt":0.18736712980990064,"score_spread":0.18255888854980631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404692016","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.95179707,0.008233626,0.002321976,0.000079855374,0.0030075645,0.00020515884,0.0000058059195,0.0008653926,0.033483576],"genre_scores_gemma":[0.9980623,0.000061388244,0.00007884508,0.000017449394,0.00014662273,0.000030054012,0.000007676674,0.000028605364,0.0015670611],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992657,0.000014321564,0.00023128791,0.000199813,0.000108143926,0.00018075116],"domain_scores_gemma":[0.9996723,0.000020584524,0.000014947616,0.00021782296,0.000008859682,0.00006551209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002060134,0.00012781667,0.00013080766,0.00007295463,0.000039212893,0.00009219139,0.00003843898,0.00008398323,0.00014714002],"category_scores_gemma":[0.0000074500003,0.000117862626,0.000054360455,0.000111109985,0.000021765465,0.000106100524,0.00001772436,0.00014393436,0.000039745242],"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.00005461452,0.00022967855,0.04557612,0.0131504545,0.0033547,0.037966978,0.010351819,0.005940831,0.22073199,0.10318579,0.28781277,0.27164426],"study_design_scores_gemma":[0.00045191133,0.00019289381,0.023212126,0.00093802356,0.000268873,0.008520718,0.0004232827,0.016932739,0.024948932,0.034280796,0.8880615,0.0017681875],"about_ca_topic_score_codex":0.000015945981,"about_ca_topic_score_gemma":0.000008888584,"teacher_disagreement_score":0.60024875,"about_ca_system_score_codex":0.000020071455,"about_ca_system_score_gemma":0.000007091054,"threshold_uncertainty_score":0.48062986},"labels":[],"label_agreement":null},{"id":"W4405425365","doi":"10.48550/arxiv.2408.11107","title":"Bounds on MLDR Codes Over ${\\mathbb Z}_{p^t}$","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.03678842018370886,"score_gpt":0.16015126335251642,"score_spread":0.12336284316880755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405425365","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.9247716,0.00042872285,0.0014330925,0.000011234287,0.002874532,0.00023974205,0.000117614276,0.0011412398,0.068982236],"genre_scores_gemma":[0.9938552,0.000166458,0.000009212764,0.000031428823,0.00020970694,0.0000021495641,0.00003202649,0.000083189516,0.005610626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862725,0.000070995295,0.00019719166,0.00065925735,0.00008519694,0.00036011677],"domain_scores_gemma":[0.99889505,0.00007401719,0.00005201357,0.00080103776,0.000032235308,0.00014565019],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018547388,0.0004360442,0.0003928439,0.00034978203,0.00008684077,0.00012067573,0.00052636873,0.00043703872,0.00018057763],"category_scores_gemma":[0.00000792797,0.0004910813,0.00032967346,0.00037466755,0.00009115862,0.00007160444,0.0003866088,0.0009801302,0.0010382151],"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.000044291857,0.000045077217,0.00033540966,0.00092588237,0.00048327123,0.0006314507,0.00031076395,0.49209,0.0002503011,0.49852616,0.006213305,0.0001441161],"study_design_scores_gemma":[0.00080994563,0.0001271552,0.00087329216,0.0017178673,0.0005689711,0.000019928477,0.00043754207,0.44769865,0.0013458607,0.51771384,0.0265286,0.0021583284],"about_ca_topic_score_codex":0.000041381103,"about_ca_topic_score_gemma":0.000032671305,"teacher_disagreement_score":0.069083616,"about_ca_system_score_codex":0.00022680606,"about_ca_system_score_gemma":0.00004132084,"threshold_uncertainty_score":0.9997541},"labels":[],"label_agreement":null},{"id":"W4405626107","doi":"10.48550/arxiv.2412.13392","title":"Hamiltonian decompositions of the wreath product of hamiltonian decomposable digraphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Wreath product; Hamiltonian (control theory); Mathematics; Combinatorics; Product (mathematics); Geometry; Mathematical optimization","score_opus":0.025159330434564926,"score_gpt":0.15522433317724332,"score_spread":0.1300650027426784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405626107","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.9800254,0.00085415295,0.0007452768,0.00002469287,0.0014498235,0.00050327,0.00023624259,0.00024188186,0.015919225],"genre_scores_gemma":[0.9987624,0.0001463874,0.00008091322,0.000005029865,0.00005005993,0.0000028034328,0.000017161708,0.000051771745,0.0008834678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986076,0.00012155242,0.00036747806,0.00051832193,0.000095701675,0.00028937258],"domain_scores_gemma":[0.99834,0.00006148716,0.00015834095,0.0012463327,0.00010256567,0.000091289345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021026102,0.0003504443,0.0004926392,0.00033932214,0.00009999645,0.000027394186,0.00088534184,0.00021524991,0.000036144436],"category_scores_gemma":[0.000009010067,0.0003230453,0.000548425,0.0008642696,0.00024742645,0.00007035844,0.0005614514,0.0006323573,0.000024879262],"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.00004377992,0.00017087816,0.009784125,0.003000832,0.0011314668,0.00006404243,0.001023964,0.7844047,0.008580413,0.19067813,0.0009523741,0.00016530557],"study_design_scores_gemma":[0.001987079,0.00025407333,0.03975762,0.008493421,0.0034540908,0.000098652796,0.0015767855,0.24795148,0.11025784,0.57690716,0.005737629,0.0035241877],"about_ca_topic_score_codex":0.00014718377,"about_ca_topic_score_gemma":0.00017554502,"teacher_disagreement_score":0.5364532,"about_ca_system_score_codex":0.000094067684,"about_ca_system_score_gemma":0.00008924059,"threshold_uncertainty_score":0.99992216},"labels":[],"label_agreement":null},{"id":"W4406164119","doi":"10.61091/ars161-01","title":"The Zero Forcing Number of Quartic Circulant Graphs of Prime Order","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Quartic function; Prime (order theory); Order (exchange); Zero (linguistics); Forcing (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.005492508806893865,"score_gpt":0.21444864632565572,"score_spread":0.20895613751876185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164119","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.9913836,0.0016158777,0.00017834525,0.000012598607,0.002813755,0.00012227701,0.000003070737,0.00012989,0.003740594],"genre_scores_gemma":[0.9998419,0.00003275395,0.000013154096,0.0000019125941,0.0000037679488,0.000013705546,0.000001268409,0.000025049887,0.000066454435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992627,0.00004222018,0.00028030478,0.00009591,0.00014503731,0.00017384496],"domain_scores_gemma":[0.9994492,0.00017832774,0.000029353647,0.00026627444,0.000044714063,0.000032150012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032458483,0.000101231286,0.00016617059,0.00004301186,0.000045115707,0.000022182763,0.00015234346,0.000052489275,0.000016255522],"category_scores_gemma":[0.00002053522,0.000075652584,0.000095778814,0.00039740247,0.000055919594,0.00006497941,0.000016427259,0.00010819088,0.000027920452],"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.000004262615,0.000013929606,0.0016977257,0.00024428067,0.00013137516,0.0000037958403,0.00062158646,0.00014840065,0.008539323,0.98756796,0.0004219788,0.0006053506],"study_design_scores_gemma":[0.0002537119,0.000032891487,0.0008591983,0.00025257198,0.00004659367,0.000016734948,0.00021315,0.0050607203,0.023778947,0.96803194,0.0012981755,0.00015536805],"about_ca_topic_score_codex":0.000019994506,"about_ca_topic_score_gemma":0.0000017691173,"teacher_disagreement_score":0.019536054,"about_ca_system_score_codex":0.00001422393,"about_ca_system_score_gemma":0.000015408425,"threshold_uncertainty_score":0.3085023},"labels":[],"label_agreement":null},{"id":"W4406164136","doi":"10.61091/ars161-04","title":"A Classification of Mengerian 4-uniform Hypergraphs Derived from Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.00979477293055983,"score_gpt":0.20593983887715075,"score_spread":0.19614506594659092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164136","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.98640496,0.0019389198,0.000061289764,0.000022785247,0.003707194,0.00013444002,0.000030441503,0.00045871804,0.0072412323],"genre_scores_gemma":[0.99970746,0.000089706125,0.000057867397,0.0000045790484,0.000009245243,0.00003367046,0.00003425414,0.000035715224,0.000027525235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921703,0.000037862137,0.00026748038,0.0001731081,0.0001388606,0.00016566979],"domain_scores_gemma":[0.999496,0.000084654275,0.000026088825,0.0002998116,0.000029588702,0.000063897125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014521155,0.00014693475,0.00019308343,0.00016422522,0.000037984057,0.00003949903,0.00017107549,0.00010504509,0.000059995276],"category_scores_gemma":[0.000008455728,0.00014492225,0.00011509402,0.0004422713,0.000047191254,0.00015054885,0.000013670645,0.00013359831,0.000055948],"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.0000070035408,0.000021893962,0.000760279,0.00011418703,0.00015269748,0.00000592476,0.00074684195,0.000023271576,0.1525986,0.8434072,0.0004996706,0.001662441],"study_design_scores_gemma":[0.00041242494,0.00005477279,0.014356496,0.00020912377,0.000063553205,0.0000039953943,0.0005023817,0.0069082384,0.028044103,0.945281,0.0038561376,0.00030772583],"about_ca_topic_score_codex":0.000029790603,"about_ca_topic_score_gemma":0.000008523511,"teacher_disagreement_score":0.12455449,"about_ca_system_score_codex":0.00002524993,"about_ca_system_score_gemma":0.000012850748,"threshold_uncertainty_score":0.5909758},"labels":[],"label_agreement":null},{"id":"W4406164298","doi":"10.61091/ars161-06","title":"Total Coloring and Efficient Domination Applications to Non-Cayley Non-Shreier Vertex-transitive Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Cayley graph; Graph","score_opus":0.003972590158681082,"score_gpt":0.2046014828315814,"score_spread":0.2006288926729003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164298","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.9888506,0.00032314964,0.002213853,0.000035854642,0.0021967238,0.0006228306,0.000011353858,0.00024325945,0.005502355],"genre_scores_gemma":[0.99946624,0.000011829347,0.000037417092,0.000010705454,0.000013039436,0.00034700718,0.0000064729866,0.000033971737,0.00007334026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919516,0.000018982144,0.0001802299,0.0002526473,0.00013448297,0.00021849072],"domain_scores_gemma":[0.99956256,0.000092789676,0.000010777998,0.00017813202,0.000039552287,0.00011616725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002064349,0.00015990883,0.00016055294,0.00018916574,0.000095442614,0.000081173974,0.00008725668,0.00007813898,0.000006487053],"category_scores_gemma":[0.000005104087,0.00017003075,0.00005439862,0.00052770943,0.000030980482,0.00007476304,0.000024023902,0.00014597148,0.0000724684],"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.000027456088,0.000081275466,0.00028397987,0.00045833096,0.00019256979,0.000025194498,0.0057992856,0.006743983,0.04335359,0.9363816,0.00051183155,0.006140929],"study_design_scores_gemma":[0.0038399426,0.0006222057,0.0336073,0.0015871151,0.00039622848,0.00014558189,0.0031611254,0.5211527,0.08214273,0.34340075,0.0072116028,0.0027327708],"about_ca_topic_score_codex":0.000010878504,"about_ca_topic_score_gemma":0.0000022237464,"teacher_disagreement_score":0.59298086,"about_ca_system_score_codex":0.000061013277,"about_ca_system_score_gemma":0.000011351831,"threshold_uncertainty_score":0.6933653},"labels":[],"label_agreement":null},{"id":"W4406164401","doi":"10.61091/ars161-02","title":"Generating Hypergraphs of Finite Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0065926494154069015,"score_gpt":0.1946719160706673,"score_spread":0.1880792666552604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164401","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.9859798,0.003259201,0.00013800533,0.000008656444,0.0047849477,0.00006489989,0.000005719205,0.00036895293,0.005389795],"genre_scores_gemma":[0.9997602,0.000034030683,0.0000591257,0.0000070050255,0.00001729193,0.000012581163,0.000004325869,0.000028792583,0.000076665136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994261,0.000027366928,0.00019586018,0.00010888835,0.000098274686,0.00014346732],"domain_scores_gemma":[0.9996638,0.00009898309,0.000011819993,0.00017025026,0.000016987593,0.000038184327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017361043,0.00010313088,0.00013834029,0.00009926014,0.00003096614,0.000030986834,0.00010548984,0.000058792244,0.000030352827],"category_scores_gemma":[0.000012597221,0.00010069299,0.00008202428,0.00031807888,0.000022745291,0.00009034269,0.000014219464,0.000114500675,0.00004593969],"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.0000014931895,0.000010505759,0.00033649418,0.00024995813,0.000073201016,0.000014414391,0.00045857296,0.0031334818,0.022065753,0.97143036,0.0009657814,0.0012599617],"study_design_scores_gemma":[0.00050833565,0.000116512914,0.0003673508,0.00046656877,0.00006148299,0.000024109226,0.00034544192,0.17250596,0.03361678,0.782544,0.008898053,0.0005454116],"about_ca_topic_score_codex":0.0000040594,"about_ca_topic_score_gemma":9.061658e-7,"teacher_disagreement_score":0.18888639,"about_ca_system_score_codex":0.0000117312275,"about_ca_system_score_gemma":0.000006575419,"threshold_uncertainty_score":0.4106141},"labels":[],"label_agreement":null},{"id":"W4406203403","doi":"10.61091/jcmcc123-09","title":"Multi-Decomposition of Graphs into Paths and \\(Y\\)-Trees of Order Five","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Graph; Spanning tree; Disjoint sets; Discrete mathematics","score_opus":0.006841013643729089,"score_gpt":0.23772190450346958,"score_spread":0.2308808908597405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203403","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.98205113,0.0030614035,0.004911306,0.000011944518,0.009605847,0.00015404978,0.0000038076869,0.000044141536,0.00015635684],"genre_scores_gemma":[0.995656,0.0001348027,0.0039114454,0.0000013989286,0.00026024308,0.0000010563223,8.939239e-7,0.000032401917,0.0000017375268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827576,0.00007358318,0.0010415404,0.0001234004,0.00032108612,0.00016463811],"domain_scores_gemma":[0.99859625,0.00049638416,0.00035928233,0.00013413634,0.0003149888,0.00009894077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000974099,0.00021738875,0.00068291416,0.0002899568,0.00007381354,0.0000799081,0.00017195095,0.00013847959,0.0000029059254],"category_scores_gemma":[0.00009708041,0.00019102886,0.00014881966,0.00035366212,0.00010509066,0.00017629554,0.00007178066,0.00029439072,4.2948244e-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.00006543682,0.00032639925,0.00021850277,0.0034247471,0.0004716014,0.000026753301,0.008042627,0.0005729298,0.032777015,0.9513548,0.00009583,0.0026233522],"study_design_scores_gemma":[0.0031996921,0.0009157347,0.00025169956,0.003032868,0.00025365734,0.00014856915,0.0014642086,0.09058619,0.010718492,0.88888305,0.00016337886,0.00038243353],"about_ca_topic_score_codex":0.000009424555,"about_ca_topic_score_gemma":5.404668e-7,"teacher_disagreement_score":0.09001326,"about_ca_system_score_codex":0.00002507346,"about_ca_system_score_gemma":0.000036239406,"threshold_uncertainty_score":0.778993},"labels":[],"label_agreement":null},{"id":"W4406523780","doi":"10.2478/candc-2024-0004","title":"Shape and topological derivatives as Hadamard semidifferentials","year":2024,"lang":"en","type":"article","venue":"Control and Cybernetics","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":"Université de Montréal","funders":"","keywords":"Hadamard transform; Mathematics; Topology (electrical circuits); Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.005752876491933362,"score_gpt":0.20120199700245067,"score_spread":0.1954491205105173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406523780","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.9687564,0.024603087,0.0011143454,0.000143976,0.0002988585,0.00010406884,0.000009699671,0.00020960488,0.0047599617],"genre_scores_gemma":[0.99869156,0.00059992576,0.000016725622,0.00006479789,0.00009989275,0.000012585006,0.0000013820287,0.0000128326155,0.00050032133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995166,0.000039962906,0.000119020966,0.00013087771,0.00005488051,0.00013867834],"domain_scores_gemma":[0.9997093,0.00014180991,0.000006492884,0.00006500669,0.000008264899,0.00006914594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009956637,0.00011458245,0.00016179141,0.00002940835,0.000035942827,0.00009945187,0.000041905496,0.00007903287,0.00008975244],"category_scores_gemma":[0.000017449745,0.000088617926,0.000030104684,0.00004090307,0.00008369471,0.000037507612,0.000015568401,0.00009552766,0.0000173382],"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.00008161855,0.000044604003,0.0052043363,0.0009379591,0.00076308096,0.00016973092,0.0038432328,0.00017397793,0.126914,0.7020848,0.0024634432,0.15731926],"study_design_scores_gemma":[0.0036418568,0.00076581474,0.09218621,0.0007790916,0.0005738058,0.00050044106,0.0018396255,0.3519267,0.008910894,0.33207053,0.20481429,0.0019907325],"about_ca_topic_score_codex":0.000002400525,"about_ca_topic_score_gemma":0.00000197716,"teacher_disagreement_score":0.37001422,"about_ca_system_score_codex":0.000004007959,"about_ca_system_score_gemma":0.0000031281236,"threshold_uncertainty_score":0.36137342},"labels":[],"label_agreement":null},{"id":"W4406786949","doi":"10.1142/s0129054125500029","title":"Almost Perfect <i>c</i>-Nonlinear Permutations with Trace Functions over 𝔽2n","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","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":"Carleton University","funders":"Natural Science Foundation of Gansu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"TRACE (psycholinguistics); Mathematics; Nonlinear system; Combinatorics; Discrete mathematics; Physics; Philosophy; Quantum mechanics","score_opus":0.005174225003495601,"score_gpt":0.24993348897042472,"score_spread":0.24475926396692912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406786949","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.4062769,0.000070587426,0.5890309,0.00024963077,0.0021469975,0.000052988657,0.000010716959,0.000022839082,0.0021384018],"genre_scores_gemma":[0.99033254,0.000011325351,0.0093506295,0.000041360257,0.00015074636,0.0000024692326,0.0000028403465,0.0000054310603,0.00010267484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890167,0.000021639498,0.0003903316,0.000102262595,0.00047546005,0.00010865962],"domain_scores_gemma":[0.9985358,0.000120513425,0.00017794348,0.00014652548,0.0009681944,0.000051004787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038487688,0.00008906268,0.00013166641,0.0006549594,0.0001318683,0.0001474119,0.00063547987,0.000022117396,0.000039536142],"category_scores_gemma":[0.000042251268,0.000075558564,0.00008186593,0.0007276406,0.00026740527,0.00076748943,0.000034156827,0.00013512619,0.000005851857],"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.00012838113,0.0004998818,0.011186893,0.00007294554,0.00097521755,0.000035383608,0.0022367078,0.7994343,0.029019637,0.08777952,0.003188089,0.065443054],"study_design_scores_gemma":[0.004898443,0.0010167462,0.13341722,0.0018396167,0.00032338843,0.0016249367,0.0011597658,0.72980446,0.024635766,0.011042715,0.08924931,0.0009876246],"about_ca_topic_score_codex":0.0000043380023,"about_ca_topic_score_gemma":0.0000070404362,"teacher_disagreement_score":0.5840556,"about_ca_system_score_codex":0.00008535329,"about_ca_system_score_gemma":0.0002544313,"threshold_uncertainty_score":0.30811888},"labels":[],"label_agreement":null},{"id":"W4406902757","doi":"10.1007/s11139-024-01009-y","title":"Factorized $$A_2$$-Leonard pair","year":2025,"lang":"en","type":"article","venue":"The Ramanujan Journal","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Mathematics; Computer science","score_opus":0.0024460337302269416,"score_gpt":0.17570140263671616,"score_spread":0.1732553689064892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406902757","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.93644917,0.0023570387,0.01659142,0.0012768507,0.005181483,0.00019603499,0.0000047035346,0.00037092462,0.037572354],"genre_scores_gemma":[0.9976298,0.00004704249,0.000043247048,0.00008111371,0.00029322944,0.000005470801,6.390873e-7,0.000015018984,0.0018843937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916065,0.00012925063,0.00025068148,0.00007027361,0.0001352962,0.00025387722],"domain_scores_gemma":[0.9995395,0.00009365694,0.000035358396,0.00023501915,0.00002667376,0.00006981739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061943196,0.00013362602,0.00016785835,0.00009413,0.00024615016,0.00011164013,0.00035860488,0.000058036032,0.00016025956],"category_scores_gemma":[0.000019241163,0.000086062835,0.00014365836,0.00017530538,0.000042327847,0.00008740621,0.00002054032,0.00045325918,0.00008833924],"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.00055805733,0.00021946781,0.018783113,0.0006423486,0.0038729853,0.0003711622,0.012073134,0.033773866,0.059167035,0.2533374,0.41058344,0.20661798],"study_design_scores_gemma":[0.0031968276,0.00012909614,0.018215723,0.0005944661,0.0002359765,0.0008688961,0.0038177595,0.0066905366,0.014883553,0.17652482,0.773951,0.00089136336],"about_ca_topic_score_codex":0.000001213034,"about_ca_topic_score_gemma":0.0000016256297,"teacher_disagreement_score":0.36336753,"about_ca_system_score_codex":0.00004109991,"about_ca_system_score_gemma":0.000018640432,"threshold_uncertainty_score":0.35095406},"labels":[],"label_agreement":null},{"id":"W4406932316","doi":"10.26493/2590-9770.1795.a62","title":"Colour-permuting automorphisms of complete Cayley graphs","year":2025,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","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 Lethbridge","funders":"","keywords":"Automorphism; Mathematics; Combinatorics; Cayley graph; Graph","score_opus":0.008418801352591763,"score_gpt":0.2018806403477872,"score_spread":0.19346183899519542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406932316","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.89946765,0.0002541948,0.0064045526,0.00006974595,0.000070644695,0.00035342487,0.000026848747,0.00009555532,0.09325736],"genre_scores_gemma":[0.9981182,0.000022858618,0.001711375,0.00001733907,0.000005208279,0.000015126013,0.0000031881918,0.000011958277,0.00009474806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993575,0.000010792888,0.00033051072,0.000074184776,0.00009703208,0.0001299287],"domain_scores_gemma":[0.99946666,0.00015678474,0.00007924679,0.00025983682,0.00001553942,0.000021941298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966398,0.0001150651,0.0002963577,0.000055128356,0.00006521373,0.000009346735,0.00016133822,0.00004002118,0.000008804915],"category_scores_gemma":[0.000007021661,0.00008075538,0.000056353994,0.00016902208,0.00015372425,0.000018717848,0.000046514615,0.00007768185,0.0000028643708],"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.0000064110636,0.000018464638,0.000027174527,0.0008323076,0.00010741702,2.1788077e-7,0.0015179059,0.00059882173,0.08544056,0.910707,0.0004430692,0.00030066998],"study_design_scores_gemma":[0.0012958236,0.00008509774,0.0005471244,0.0009858067,0.0003896068,0.000014398262,0.008308824,0.03548072,0.18417642,0.76573676,0.0024982004,0.0004812433],"about_ca_topic_score_codex":0.0000013982665,"about_ca_topic_score_gemma":0.000001846408,"teacher_disagreement_score":0.14497024,"about_ca_system_score_codex":0.0000036227507,"about_ca_system_score_gemma":0.0000046157274,"threshold_uncertainty_score":0.3293109},"labels":[],"label_agreement":null},{"id":"W4407235495","doi":"10.2478/candc-2024-004","title":"Shape and topological derivatives as Hadamard semidifferentials","year":2024,"lang":"en","type":"article","venue":"Control and Cybernetics","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":"Université de Montréal","funders":"","keywords":"Hadamard transform; Topology (electrical circuits); Mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.005752876491933362,"score_gpt":0.20120199700245067,"score_spread":0.1954491205105173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407235495","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.9687564,0.024603087,0.0011143454,0.000143976,0.0002988585,0.00010406884,0.000009699671,0.00020960488,0.0047599617],"genre_scores_gemma":[0.99869156,0.00059992576,0.000016725622,0.00006479789,0.00009989275,0.000012585006,0.0000013820287,0.0000128326155,0.00050032133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995166,0.000039962906,0.000119020966,0.00013087771,0.00005488051,0.00013867834],"domain_scores_gemma":[0.9997093,0.00014180991,0.000006492884,0.00006500669,0.000008264899,0.00006914594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009956637,0.00011458245,0.00016179141,0.00002940835,0.000035942827,0.00009945187,0.000041905496,0.00007903287,0.00008975244],"category_scores_gemma":[0.000017449745,0.000088617926,0.000030104684,0.00004090307,0.00008369471,0.000037507612,0.000015568401,0.00009552766,0.0000173382],"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.00008161855,0.000044604003,0.0052043363,0.0009379591,0.00076308096,0.00016973092,0.0038432328,0.00017397793,0.126914,0.7020848,0.0024634432,0.15731926],"study_design_scores_gemma":[0.0036418568,0.00076581474,0.09218621,0.0007790916,0.0005738058,0.00050044106,0.0018396255,0.3519267,0.008910894,0.33207053,0.20481429,0.0019907325],"about_ca_topic_score_codex":0.000002400525,"about_ca_topic_score_gemma":0.00000197716,"teacher_disagreement_score":0.37001422,"about_ca_system_score_codex":0.000004007959,"about_ca_system_score_gemma":0.0000031281236,"threshold_uncertainty_score":0.36137342},"labels":[],"label_agreement":null},{"id":"W4407248590","doi":"10.1515/itit-2024-0069","title":"Rectangle-free four-colored square grids realized by cyclic-rotated reusable patterns","year":2024,"lang":"en","type":"article","venue":"it - Information Technology","topic":"graph theory and CDMA systems","field":"Engineering","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":"Rectangle; Colored; Square tiling; Square (algebra); Grid; Combinatorics; Mathematics; Grid pattern; Computer science; Geometry; Materials science","score_opus":0.005194607007309188,"score_gpt":0.19364109336308113,"score_spread":0.18844648635577194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407248590","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.8466135,0.0018459507,0.05727393,0.005127776,0.0042621894,0.0018232211,0.0010547081,0.021346305,0.060652383],"genre_scores_gemma":[0.9986496,0.00017678541,0.0001951538,0.000103238075,0.00003522174,0.00025325036,0.00026765408,0.00003301625,0.00028607587],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987778,0.000026146774,0.00055765704,0.00013403244,0.00015718037,0.0003471904],"domain_scores_gemma":[0.9992247,0.000045722176,0.000059317485,0.00056470995,0.000054587337,0.000050927618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023496574,0.00020744199,0.00023665311,0.00063337834,0.00008173228,0.00011008571,0.0004519713,0.00043548652,0.00018192983],"category_scores_gemma":[0.00009396534,0.00020319661,0.00007237871,0.00091675913,0.00005222745,0.0008060394,0.00006881361,0.00036104716,0.0005776867],"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.00007978333,0.000033897664,0.00080242415,0.0021255154,0.00044852798,0.000055203654,0.0039343783,0.001777248,0.0145335095,0.084900305,0.8136095,0.07769975],"study_design_scores_gemma":[0.0011591382,0.00018835449,0.00007046353,0.00044627432,0.000042826054,0.00019338679,0.0024026982,0.027867854,0.039484933,0.023303093,0.9042093,0.0006316479],"about_ca_topic_score_codex":0.000033369914,"about_ca_topic_score_gemma":0.000025667738,"teacher_disagreement_score":0.15203607,"about_ca_system_score_codex":0.000110930116,"about_ca_system_score_gemma":0.000014524919,"threshold_uncertainty_score":0.8286118},"labels":[],"label_agreement":null},{"id":"W4407873258","doi":"10.1007/s00233-025-10505-6","title":"The lattice of submonoids of the uniform block permutations containing the symmetric group","year":2025,"lang":"en","type":"article","venue":"Semigroup Forum","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":"York University; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Lattice (music); Symmetric group; Block (permutation group theory); Group (periodic table); Pure mathematics; Algebra over a field; Combinatorics; Physics; Quantum mechanics","score_opus":0.004025996234215667,"score_gpt":0.19604683135190507,"score_spread":0.1920208351176894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407873258","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.9656981,0.0027952679,0.00086017436,0.0006053927,0.00095012155,0.00046313237,0.000026458476,0.00008121892,0.028520096],"genre_scores_gemma":[0.9992832,0.00004963219,0.000011769027,0.000058878937,0.000019542447,0.00003371928,0.000002244135,0.000013303158,0.0005277102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99909264,0.00008406603,0.00033945084,0.00008657876,0.00015288679,0.0002444077],"domain_scores_gemma":[0.99869084,0.0006892165,0.000086745524,0.00045914485,0.000054639033,0.000019430427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005095494,0.00011627161,0.00015776763,0.00008277202,0.00032749027,0.000023157274,0.0005047223,0.00005852276,0.0000026476578],"category_scores_gemma":[0.00009692175,0.000059762187,0.00014810752,0.0011216613,0.00014343725,0.000058633563,0.000073232964,0.00020057258,0.0000024309647],"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.00002194539,0.000024435993,0.019232912,0.00014110463,0.0002509604,4.0598385e-7,0.001491426,0.0037439093,0.0016925101,0.9692887,0.0013427808,0.002768884],"study_design_scores_gemma":[0.003926445,0.0006125103,0.3633773,0.0015760593,0.0012292602,0.00006592576,0.131052,0.13540512,0.037049446,0.14557377,0.17866553,0.001466612],"about_ca_topic_score_codex":0.000057496924,"about_ca_topic_score_gemma":0.00032992032,"teacher_disagreement_score":0.823715,"about_ca_system_score_codex":0.000030277512,"about_ca_system_score_gemma":0.000017901699,"threshold_uncertainty_score":0.25188234},"labels":[],"label_agreement":null},{"id":"W4408029834","doi":"10.1007/s10623-025-01581-4","title":"Constructing k-ary orientable sequences with asymptotically optimal length","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Asymptotically optimal algorithm; Cryptography; Discrete mathematics; Algorithm","score_opus":0.00643270379213447,"score_gpt":0.19659421892699305,"score_spread":0.19016151513485857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408029834","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.77405244,0.0016780914,0.18643561,0.00003576262,0.00028153104,0.00024458804,0.000018948205,0.0004113638,0.036841642],"genre_scores_gemma":[0.9894637,0.00009064299,0.010292863,0.00005307949,0.00002457722,0.000029727436,0.0000061223654,0.000015806456,0.00002347621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991204,0.00004925067,0.00019712426,0.0002224478,0.00011320529,0.00029755323],"domain_scores_gemma":[0.99955827,0.00011458445,0.00002481881,0.00016054492,0.00004021403,0.00010156454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020107192,0.0001962573,0.00023566607,0.00020940861,0.00017517978,0.00011645815,0.00011653185,0.00008289848,0.000030767773],"category_scores_gemma":[0.000007382028,0.00016128142,0.0000622503,0.0005850732,0.00024412041,0.00014604283,0.000017433273,0.00015553959,0.0000019022007],"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.000092960836,0.000036864138,0.07494678,0.00034747954,0.0005651112,0.000032247954,0.0004297751,0.0026690296,0.0051233433,0.9050427,0.0005236257,0.010190049],"study_design_scores_gemma":[0.018748026,0.0052965498,0.034789458,0.009095428,0.003269588,0.0020787069,0.12586625,0.15759486,0.26192465,0.2930073,0.07519278,0.013136382],"about_ca_topic_score_codex":0.000012727639,"about_ca_topic_score_gemma":0.000010501582,"teacher_disagreement_score":0.6120354,"about_ca_system_score_codex":0.0000105536255,"about_ca_system_score_gemma":0.000023454824,"threshold_uncertainty_score":0.65768653},"labels":[],"label_agreement":null},{"id":"W4408220710","doi":"10.1101/2025.03.03.641310","title":"On ARGs, pedigrees, and genetic relatedness matrices","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"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":"Biotechnology and Biological Sciences Research Council; Engineering and Physical Sciences Research Council","keywords":"Pedigree chart; Evolutionary biology; Biology; Mathematics; Geography; Genetics; Gene","score_opus":0.006009441626567493,"score_gpt":0.18292837063563605,"score_spread":0.17691892900906855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408220710","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.98065186,0.012573529,0.001096826,0.000038421796,0.0032976477,0.0006262112,0.00025393645,0.0012758049,0.00018577467],"genre_scores_gemma":[0.99741066,0.0013617207,0.0006332725,0.000053847456,0.00026316682,0.00015417344,2.2932807e-7,0.00010490624,0.00001801694],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.997929,0.0001126261,0.00050240185,0.0007252733,0.00025741695,0.00047333157],"domain_scores_gemma":[0.99835634,0.00011682832,0.00013930272,0.0010606447,0.000116707495,0.00021017298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028499542,0.0006137406,0.00057479064,0.00044389578,0.00013089972,0.00019371022,0.00046560087,0.00069631886,0.000024828136],"category_scores_gemma":[0.000059797123,0.0006656037,0.0001190811,0.00047384365,0.000075308104,0.000080020836,0.00021942833,0.0008750622,0.00006177688],"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.00051806174,0.0011603722,0.060212288,0.057330146,0.0070659723,0.0028042903,0.00047891945,0.08593659,0.57447535,0.18378991,0.026003703,0.0002244096],"study_design_scores_gemma":[0.0068545216,0.0006595534,0.5206788,0.025787443,0.0031529325,8.442126e-7,0.000053628428,0.057248935,0.28394026,0.0014323461,0.083139926,0.017050777],"about_ca_topic_score_codex":0.000018986264,"about_ca_topic_score_gemma":0.0000014300283,"teacher_disagreement_score":0.46046653,"about_ca_system_score_codex":0.00012219594,"about_ca_system_score_gemma":0.000107391155,"threshold_uncertainty_score":0.9995795},"labels":[],"label_agreement":null},{"id":"W4408568268","doi":"10.61091/jcmcc124-35","title":"Easier proofs of three determinant identities","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical proof; Mathematics; Calculus (dental); Computer science; Algebra over a field; Pure mathematics; Medicine; Geometry","score_opus":0.008556634527984061,"score_gpt":0.2234023516475557,"score_spread":0.21484571711957165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408568268","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.9675104,0.0011432889,0.0069280616,0.000013275178,0.020863682,0.0002170211,0.0000016977187,0.00004537922,0.0032772133],"genre_scores_gemma":[0.9988629,0.00003171699,0.00065794465,0.0000034324632,0.00040650115,0.0000017779967,2.785341e-7,0.000023064955,0.000012389765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980949,0.000053078526,0.001156933,0.00010398017,0.00035774094,0.00023336164],"domain_scores_gemma":[0.9985532,0.00036013112,0.00047472666,0.00020526655,0.00032608988,0.00008059759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011173317,0.00022339071,0.00074792805,0.00028128125,0.00011499052,0.00009651826,0.00034225313,0.00013979194,0.0000041771846],"category_scores_gemma":[0.00016266314,0.00019885527,0.00019283108,0.00031250337,0.00009212645,0.00016183117,0.000100281635,0.00030528492,8.213149e-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.000049760743,0.00018817133,0.00060945284,0.001326607,0.0002502165,0.000015907883,0.00076048664,0.00016003048,0.0019132263,0.99211264,0.00026778402,0.0023456933],"study_design_scores_gemma":[0.002469515,0.00029052072,0.00027913248,0.0012520342,0.00014673609,0.000064257925,0.0003595032,0.0071608727,0.00652616,0.9808272,0.00039732922,0.00022672823],"about_ca_topic_score_codex":0.0000022370573,"about_ca_topic_score_gemma":3.9864878e-7,"teacher_disagreement_score":0.031352513,"about_ca_system_score_codex":0.00004489297,"about_ca_system_score_gemma":0.00006224862,"threshold_uncertainty_score":0.8109082},"labels":[],"label_agreement":null},{"id":"W4408611016","doi":"10.61091/jcmcc124-39","title":"Decomposition of the cartesian product of complete graphs into paths and cycles of length six","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Decomposition; Mathematics; Product (mathematics); Cartesian coordinate system; Combinatorics; Geometry; Chemistry","score_opus":0.006244479181035906,"score_gpt":0.22468741054367522,"score_spread":0.21844293136263931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408611016","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.9912737,0.0010210078,0.000647688,0.000031863772,0.006384599,0.00023832351,0.000003954024,0.00001352387,0.00038534217],"genre_scores_gemma":[0.99913245,0.00004364125,0.00067576533,0.0000022327338,0.00012742807,9.638447e-7,4.515559e-7,0.000016287006,7.5173773e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980666,0.00013416848,0.0012082838,0.000109395776,0.0003308061,0.00015072245],"domain_scores_gemma":[0.9981,0.00044343446,0.00081024633,0.00023840454,0.00035317216,0.000054754313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052924,0.00019453309,0.00078324135,0.00020685678,0.000113623886,0.000028493354,0.000298359,0.00009145669,8.395984e-7],"category_scores_gemma":[0.00014281894,0.0001526213,0.0001830469,0.00037463458,0.00017829989,0.000090918824,0.000112535476,0.00025142438,4.901753e-8],"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.000064460204,0.00024395308,0.0018928108,0.002315384,0.0002776252,0.0000014103422,0.00223255,0.0002801997,0.03593625,0.9554446,0.000044751916,0.0012660306],"study_design_scores_gemma":[0.0028209467,0.00040309838,0.0022796164,0.002296271,0.00024215235,0.000033935805,0.0008382529,0.005100455,0.04706929,0.9386231,0.000081962375,0.00021091836],"about_ca_topic_score_codex":0.000012382164,"about_ca_topic_score_gemma":8.9580925e-7,"teacher_disagreement_score":0.016821474,"about_ca_system_score_codex":0.000022975171,"about_ca_system_score_gemma":0.00004708333,"threshold_uncertainty_score":0.6223716},"labels":[],"label_agreement":null},{"id":"W4408658710","doi":"10.3390/math13061013","title":"Counting the Number of Squares of Each Colour in Cyclically Coloured Rectangular Grids","year":2025,"lang":"en","type":"article","venue":"Mathematics","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 Guelph","funders":"","keywords":"Mathematics; Arithmetic; Geometry","score_opus":0.004324474243307701,"score_gpt":0.22835610488161895,"score_spread":0.22403163063831125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408658710","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.9790291,0.00014766064,0.0013756901,0.000034590343,0.00013208375,0.00019063533,0.000004653543,0.000042190786,0.019043371],"genre_scores_gemma":[0.9987824,0.0000067657766,0.001000878,0.000009381841,0.000008956064,0.000018741854,8.516331e-7,0.000011486083,0.00016055511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999245,0.000043569886,0.00041842417,0.000058022146,0.00011659125,0.0001184086],"domain_scores_gemma":[0.9993518,0.00029842224,0.000070979215,0.00023006853,0.000038102793,0.000010619613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005726488,0.00008499361,0.0002568661,0.000051429495,0.000020564321,0.000008276197,0.00018763373,0.000072166506,0.000024695531],"category_scores_gemma":[0.00012055908,0.0000641367,0.000058341764,0.00032080323,0.00004876094,0.000020466778,0.000023572014,0.00010479687,0.0000048600086],"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.00004526088,0.0005027566,0.04468108,0.008937287,0.0004582033,0.000011898681,0.02185064,0.008304616,0.07304656,0.83740455,0.0038122826,0.00094487815],"study_design_scores_gemma":[0.003798462,0.00016140292,0.036107935,0.0076910155,0.00047208328,0.00007067802,0.029205708,0.23651947,0.16722724,0.5083116,0.00909134,0.0013430353],"about_ca_topic_score_codex":0.0000137992665,"about_ca_topic_score_gemma":0.000017601673,"teacher_disagreement_score":0.32909292,"about_ca_system_score_codex":0.000017138247,"about_ca_system_score_gemma":0.000011671851,"threshold_uncertainty_score":0.26154187},"labels":[],"label_agreement":null},{"id":"W4408720272","doi":"10.26493/1855-3974.3471.51f","title":"Decompositions of the wreath product of certain directed graphs into directed hamiltonian cycles","year":2025,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","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 Regina","funders":"","keywords":"Wreath product; Mathematics; Combinatorics; Directed graph; Product (mathematics); Hamiltonian (control theory); Discrete mathematics; Geometry; Mathematical optimization","score_opus":0.007890167093602561,"score_gpt":0.22104538520205289,"score_spread":0.2131552181084503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408720272","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.9712133,0.00089910865,0.0005531381,0.00020395646,0.0003145527,0.00079092855,0.00003251633,0.00050113164,0.025491387],"genre_scores_gemma":[0.9986562,0.000011667324,0.0008703305,0.000011548609,0.0000058033206,0.00006923094,0.0000073212123,0.000025307938,0.00034256914],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868834,0.00015437556,0.0006327502,0.00017735494,0.00016882643,0.000178364],"domain_scores_gemma":[0.99877715,0.00025743054,0.00014004814,0.000672157,0.000112775706,0.000040410156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003199333,0.00020392124,0.00047668503,0.00018567516,0.000097329044,0.000014584745,0.0003570256,0.000065934066,0.000019733838],"category_scores_gemma":[0.00011954413,0.00015096589,0.00020658389,0.0007614037,0.00018288568,0.00006905465,0.00004101733,0.00011954695,0.000004173594],"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.00011173887,0.0008050253,0.010233703,0.007739223,0.0016129805,0.000008802223,0.013632532,0.0006601437,0.50809765,0.45073238,0.0037899765,0.0025758331],"study_design_scores_gemma":[0.0019715047,0.00009288144,0.02259097,0.0044320947,0.0005040241,0.000028137107,0.0018161552,0.013019972,0.50424063,0.4488575,0.0015712805,0.0008748774],"about_ca_topic_score_codex":0.000072676456,"about_ca_topic_score_gemma":0.000070603885,"teacher_disagreement_score":0.02744294,"about_ca_system_score_codex":0.000021430864,"about_ca_system_score_gemma":0.00003214822,"threshold_uncertainty_score":0.6156211},"labels":[],"label_agreement":null},{"id":"W4408734169","doi":"10.1007/s00373-025-02912-x","title":"Unbiased Hadamard Matrices and Ternary Self-dual Codes","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hadamard transform; Ternary operation; Combinatorics; Dual (grammatical number); Complex Hadamard matrix; Discrete mathematics; Hadamard matrix; Computer science","score_opus":0.003005978694838545,"score_gpt":0.17769162327630803,"score_spread":0.17468564458146948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408734169","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.98380446,0.008733923,0.00010504039,0.000031504373,0.0006735352,0.00010996952,0.000008656295,0.00037791007,0.0061549717],"genre_scores_gemma":[0.9984091,0.0013142487,0.000040518775,0.00003670103,0.0000081511635,0.000014023661,0.0000030167914,0.000011593924,0.00016265882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942714,0.000027710044,0.00014985647,0.0001468143,0.00008128696,0.00016716954],"domain_scores_gemma":[0.9996943,0.00006800777,0.000019001869,0.00013429984,0.000020859407,0.00006354168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013002142,0.00014244864,0.00017919896,0.00015749421,0.000115691466,0.000072269686,0.00007243875,0.000082750135,0.0000027284573],"category_scores_gemma":[0.00000399327,0.00013561103,0.00003659717,0.00035895276,0.000038206086,0.00007818943,0.000033617904,0.000110439716,0.0000015723615],"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.000015345611,0.00006917305,0.06266939,0.0006211192,0.00021581161,0.000030555635,0.0004095646,0.000029585317,0.0003713557,0.9290011,0.0038148179,0.0027521667],"study_design_scores_gemma":[0.002651357,0.00022565572,0.06448081,0.0002978983,0.00025805106,0.00006717549,0.0011903858,0.009912002,0.0018497211,0.87190944,0.046200957,0.00095652964],"about_ca_topic_score_codex":0.000013828895,"about_ca_topic_score_gemma":0.0000024644849,"teacher_disagreement_score":0.057091665,"about_ca_system_score_codex":0.000009934144,"about_ca_system_score_gemma":0.000006601417,"threshold_uncertainty_score":0.55300575},"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":"W4408928583","doi":"10.61091/um122-08","title":"Tactical decomposable regular group divisible designs and their threshold schemes","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Arithmetic; Discrete mathematics","score_opus":0.013757782278056983,"score_gpt":0.22742380261366799,"score_spread":0.213666020335611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408928583","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.70166385,0.007310474,0.17312677,0.0001961548,0.00042992688,0.00079215213,0.000019493993,0.0010431021,0.1154181],"genre_scores_gemma":[0.99575573,0.000027122598,0.003725785,0.00003177999,0.000019313682,0.00005343533,0.00000325136,0.000025330259,0.0003582267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990649,0.000039849692,0.00028761674,0.00021079498,0.000093337556,0.00030349893],"domain_scores_gemma":[0.99914443,0.00029635266,0.000018876573,0.00043870677,0.00001686018,0.00008474287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041926024,0.00021387398,0.00032002936,0.0001071256,0.00011503364,0.00007326981,0.00018083089,0.00010289072,0.0001252171],"category_scores_gemma":[0.000052211748,0.0001701987,0.000081065846,0.00021422547,0.00010056759,0.00013515564,0.000063880725,0.00014513037,0.000046032208],"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.000013978415,0.00009995528,0.00035744475,0.0012353215,0.00021903182,0.0000044537533,0.0005962067,0.000046260924,0.009623677,0.9827039,0.0032762974,0.0018234296],"study_design_scores_gemma":[0.00057103345,0.000063843174,0.00031460862,0.0006723689,0.00008230776,0.00002818306,0.0014361921,0.07827644,0.025854457,0.8737745,0.01846105,0.00046496216],"about_ca_topic_score_codex":0.0000010039156,"about_ca_topic_score_gemma":0.0000011947747,"teacher_disagreement_score":0.29409194,"about_ca_system_score_codex":0.000020993053,"about_ca_system_score_gemma":0.0000073276938,"threshold_uncertainty_score":0.6940502},"labels":[],"label_agreement":null},{"id":"W4408941115","doi":"10.1109/lpt.2025.3555919","title":"Polarization-Dependent Loss Mitigation via Orthogonal Design Precoding and Interference Cancellation","year":2025,"lang":"en","type":"article","venue":"IEEE Photonics Technology Letters","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":"Precoding; Zero-forcing precoding; Computer science; Electronic engineering; Single antenna interference cancellation; Interference (communication); Polarization (electrochemistry); Orthogonal polarization spectral imaging; Telecommunications; MIMO; Physics; Optics; Engineering; Beamforming; Decoding methods; Chemistry","score_opus":0.005133622562488096,"score_gpt":0.19612144667074002,"score_spread":0.19098782410825194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408941115","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.61539364,0.00016769084,0.38305414,0.00036706828,0.00045831501,0.00017725752,0.0000031418172,0.00028919388,0.0000895771],"genre_scores_gemma":[0.99876267,0.0000401823,0.00093585585,0.00015243504,0.000009243884,0.000056098666,0.0000043927002,0.000014194704,0.000024913765],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928385,0.000031825966,0.00022914268,0.00020194956,0.0000624734,0.00019075966],"domain_scores_gemma":[0.9996784,0.00004845944,0.00004554532,0.00018019414,0.000025942896,0.00002149527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017210969,0.00013519768,0.00013615274,0.00033927418,0.00009329972,0.000027701348,0.00014182323,0.00017737209,0.000004681312],"category_scores_gemma":[0.00001243503,0.00015423195,0.000021651515,0.0003405421,0.00009533627,0.000097843884,0.000018977751,0.00023027367,0.000005274216],"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.000012326524,0.0000074847076,0.010301222,0.00007787258,0.00007622156,0.0000062337576,0.0001162483,0.019481786,0.9616018,0.0054377127,0.00011041587,0.002770677],"study_design_scores_gemma":[0.00042422066,0.00002744805,0.00093089195,0.00016396878,0.000041993404,0.000040385316,0.0000624776,0.14598976,0.83824915,0.013555031,0.00020316057,0.00031150313],"about_ca_topic_score_codex":0.000005164869,"about_ca_topic_score_gemma":0.000021004276,"teacher_disagreement_score":0.38336906,"about_ca_system_score_codex":0.000083877465,"about_ca_system_score_gemma":0.000014484188,"threshold_uncertainty_score":0.6289396},"labels":[],"label_agreement":null},{"id":"W4409341297","doi":"10.1007/s10013-025-00742-1","title":"Small Kissing Polytopes","year":2025,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Polytope; Combinatorics","score_opus":0.013504725093635312,"score_gpt":0.21529907167410312,"score_spread":0.2017943465804678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409341297","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.78110653,0.0056726853,0.17099965,0.00017664801,0.0017734461,0.00012574531,0.0000021782735,0.00011096294,0.040032156],"genre_scores_gemma":[0.98796976,0.00008129368,0.01136633,0.000034370336,0.00008936284,0.0000010263793,1.3474356e-7,0.000016818118,0.0004408856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927163,0.000020918176,0.00045321943,0.000034367764,0.00009867206,0.00012120769],"domain_scores_gemma":[0.9995891,0.000076431046,0.00010416607,0.000130304,0.000055519482,0.000044473007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044223559,0.00009628855,0.0002449993,0.00016162806,0.000042556563,0.00004111521,0.0001874643,0.00005053839,0.000023051442],"category_scores_gemma":[0.000051602397,0.000077011915,0.000116890056,0.00017361731,0.00001911262,0.00006804582,0.0000130195585,0.00015677749,0.000011802952],"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.00007587566,0.0011840374,0.0031262096,0.013741935,0.0032305312,0.00039080912,0.02012023,0.035476997,0.16517325,0.58981925,0.034083385,0.1335775],"study_design_scores_gemma":[0.0052819825,0.00055364193,0.0017737412,0.018275388,0.001303458,0.0028803314,0.025348827,0.08743495,0.12245033,0.58118147,0.15138514,0.002130758],"about_ca_topic_score_codex":1.7181071e-7,"about_ca_topic_score_gemma":6.4111686e-7,"teacher_disagreement_score":0.20686324,"about_ca_system_score_codex":0.000022489741,"about_ca_system_score_gemma":0.00001787191,"threshold_uncertainty_score":0.31404546},"labels":[],"label_agreement":null},{"id":"W4409346330","doi":"10.1093/imrn/rnaf090","title":"Splitting for Integer Tilings","year":2025,"lang":"en","type":"article","venue":"International Mathematics Research Notices","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 British Columbia","funders":"","keywords":"Mathematics; Integer (computer science); Substitution tiling; Combinatorics; Computer science","score_opus":0.05956725086842343,"score_gpt":0.4026713607646899,"score_spread":0.3431041098962665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346330","genre_codex":"other","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.38486618,0.0006071792,0.19657761,0.0013096496,0.0034270866,0.0011820965,0.000053299602,0.0005164343,0.41146046],"genre_scores_gemma":[0.9912093,0.000011121406,0.0047067488,0.000019920333,0.00010983377,0.00013293189,0.0000064154183,0.000017544819,0.0037861385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990281,0.000026062018,0.0002682216,0.000125166,0.00032021073,0.00023226219],"domain_scores_gemma":[0.9982704,0.0012081892,0.000024057952,0.00016299308,0.0002995893,0.00003475705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014354994,0.00008508356,0.00011859524,0.00033788258,0.000089712026,0.00015171143,0.0004515622,0.00005560446,0.00006830594],"category_scores_gemma":[0.00066798885,0.000077515506,0.0000669348,0.00018808106,0.000058906364,0.00012528095,0.0000623224,0.00018802477,0.00006961566],"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.000020488927,0.00008874211,0.00013715556,0.0013030642,0.00027354446,0.0000029587618,0.0013396101,0.0030361868,0.0059508327,0.97783893,0.0050616874,0.004946808],"study_design_scores_gemma":[0.00032998482,0.000022227156,0.000043601176,0.0006488903,0.000011563709,0.0000021426256,0.0019180182,0.65397483,0.012411423,0.28446135,0.04602792,0.00014805877],"about_ca_topic_score_codex":0.000004192322,"about_ca_topic_score_gemma":0.0000045951383,"teacher_disagreement_score":0.69337755,"about_ca_system_score_codex":0.0000658933,"about_ca_system_score_gemma":0.000018937573,"threshold_uncertainty_score":0.31609908},"labels":[],"label_agreement":null},{"id":"W4409873972","doi":"10.1007/s12095-025-00798-3","title":"An effective approach to enumerate universal cycles for k-permutations","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Foundation of Henan Educational Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Enumeration; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.008558640135579046,"score_gpt":0.2534321535233065,"score_spread":0.24487351338772745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409873972","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.17653081,0.0019258294,0.77473694,0.0001753169,0.00012818404,0.0011893206,0.00009919181,0.0004076454,0.044806767],"genre_scores_gemma":[0.9913153,0.0000865109,0.0078099193,0.00005592561,0.000008902864,0.0006438233,0.00005809328,0.0000100985535,0.000011416974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955904,0.00008039127,0.000107479194,0.00011306723,0.00002624077,0.00011380384],"domain_scores_gemma":[0.99911505,0.00015994762,0.000011458447,0.0006038031,0.000048043956,0.00006167325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011501061,0.00009258734,0.00010851613,0.0002433649,0.00040033663,0.00005260423,0.00032117835,0.000047795475,8.787088e-7],"category_scores_gemma":[0.0000069281814,0.000099438774,0.000060352617,0.000529518,0.00009511539,0.00010982925,0.000029961053,0.00008397623,0.0000013160691],"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.000010890231,0.00008807127,0.00073875807,0.000057300174,0.0001223739,2.9775359e-8,0.0020868531,0.0019768926,0.0016357253,0.98261046,0.00026201725,0.010410621],"study_design_scores_gemma":[0.0034974078,0.00047025114,0.13272503,0.00041328982,0.000714867,0.000010063788,0.03543289,0.16277738,0.00504731,0.5232379,0.13382104,0.0018526266],"about_ca_topic_score_codex":0.0000084415215,"about_ca_topic_score_gemma":0.000015118542,"teacher_disagreement_score":0.8147845,"about_ca_system_score_codex":0.000008427747,"about_ca_system_score_gemma":0.0000058174223,"threshold_uncertainty_score":0.40549958},"labels":[],"label_agreement":null},{"id":"W4410005165","doi":"10.1007/s10623-025-01635-7","title":"Weak colourings of Kirkman triple systems","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Triple system; Cryptography; Discrete mathematics; Arithmetic; Pure mathematics; Algorithm","score_opus":0.009053155272220269,"score_gpt":0.2041809074481235,"score_spread":0.19512775217590322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410005165","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.8482773,0.013828694,0.08889711,0.000021743654,0.0012120845,0.00066189625,0.000045225097,0.00044955226,0.04660642],"genre_scores_gemma":[0.99931014,0.0002471702,0.00022098002,0.000011809232,0.000020674723,0.00004987717,0.000003532681,0.000014296474,0.000121513345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992255,0.000054963013,0.0002819273,0.00014848233,0.00009035459,0.00019875515],"domain_scores_gemma":[0.99960154,0.000068861,0.00003874889,0.0001967346,0.00003715538,0.000056950572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024590341,0.00015374682,0.0002969235,0.00033756855,0.00007768252,0.000045058703,0.0001271432,0.00009424872,0.000008941723],"category_scores_gemma":[0.000005156671,0.00014490113,0.000112168724,0.0005600986,0.00008983487,0.000060039365,0.000015587604,0.00008709655,0.0000018036022],"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.00007420263,0.000074631665,0.0155378245,0.0017360807,0.0005643128,0.000005475679,0.0005241181,0.0016972387,0.049553305,0.9192285,0.008623865,0.0023804486],"study_design_scores_gemma":[0.011601729,0.0017450553,0.071983576,0.005560303,0.001454686,0.00013037234,0.019937273,0.072165236,0.16532439,0.14949043,0.49578577,0.0048211934],"about_ca_topic_score_codex":0.0000314006,"about_ca_topic_score_gemma":0.0000050177705,"teacher_disagreement_score":0.7697381,"about_ca_system_score_codex":0.000006015692,"about_ca_system_score_gemma":0.000007088976,"threshold_uncertainty_score":0.59088963},"labels":[],"label_agreement":null},{"id":"W4410338799","doi":"10.37236/12513","title":"Almost All 9-Regular Graphs Have a Modulo-5 Orientation","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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; Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Modulo; Orientation (vector space); Mathematics; Combinatorics; Arithmetic; Geometry","score_opus":0.003546911379042969,"score_gpt":0.20805621188000095,"score_spread":0.20450930050095797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410338799","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.9605503,0.010836992,0.021056127,0.00034844285,0.0024361166,0.00018563257,0.0000010910195,0.00007101952,0.004514251],"genre_scores_gemma":[0.9986143,0.000855329,0.0000028801273,0.000048972084,0.00003764002,0.000004391103,0.0000011259592,0.000016969736,0.00041840738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988456,0.00011191621,0.0003700139,0.0000692638,0.00023063648,0.0003725992],"domain_scores_gemma":[0.9994039,0.00008323939,0.00012002012,0.00022474854,0.00012548012,0.000042635475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090315804,0.00013770675,0.00021303691,0.00013899196,0.00008797471,0.000034769208,0.00033473124,0.00006731778,0.0000061676888],"category_scores_gemma":[0.000025075962,0.00010203856,0.00014881471,0.00042861482,0.00003577448,0.00012759196,0.000015787633,0.0005109176,0.000004321954],"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.000028640645,0.000036153953,0.0002673357,0.000031902448,0.00030007193,0.000004578885,0.0003889769,0.0023322199,0.0010680393,0.9931963,0.0019893553,0.00035643807],"study_design_scores_gemma":[0.0007046604,0.00014528976,0.0003071649,0.00005282317,0.00011842181,0.00006605297,0.00025872502,0.0015424982,0.005519491,0.97403586,0.017132543,0.00011644837],"about_ca_topic_score_codex":0.000004464843,"about_ca_topic_score_gemma":0.0000058299784,"teacher_disagreement_score":0.03806396,"about_ca_system_score_codex":0.00025305562,"about_ca_system_score_gemma":0.00010039625,"threshold_uncertainty_score":0.41610116},"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":"W4411720715","doi":"10.61091/ars163-07","title":"Construction of magic squares and partially balanced incomplete block designs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; Block (permutation group theory); MAGIC (telescope); Combinatorics; Arithmetic","score_opus":0.007934536213604302,"score_gpt":0.20574074004573753,"score_spread":0.19780620383213324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720715","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.994007,0.0003735657,0.00021462231,0.00001825843,0.0014693012,0.00011865471,0.000004952656,0.000108450506,0.0036852255],"genre_scores_gemma":[0.9997886,0.00002148235,0.00012409069,0.000008616253,0.0000034101868,0.000008101031,0.0000017826827,0.000007884213,0.000036046535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949074,0.000044633463,0.00018995831,0.00009707121,0.00006103604,0.000116591924],"domain_scores_gemma":[0.99970216,0.00006267137,0.000028337263,0.00014614375,0.000031080668,0.000029583214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011396054,0.000090934824,0.0001716727,0.00007585452,0.000036549034,0.000014031872,0.00007374675,0.000054130396,0.000008310299],"category_scores_gemma":[0.000013899724,0.000095403564,0.00002963285,0.00018025887,0.00006900841,0.00005113217,0.000017517943,0.000068384135,0.0000039939296],"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.000017143295,0.000014678486,0.010354504,0.00018802666,0.00006813303,0.0000018424705,0.00013377388,0.00032816845,0.03225011,0.9554932,0.00044795548,0.0007024405],"study_design_scores_gemma":[0.0013740491,0.00008703234,0.019709935,0.00020448078,0.00005100757,0.000013227206,0.00025374605,0.00416057,0.050079126,0.9224926,0.0013275,0.0002466937],"about_ca_topic_score_codex":0.000007881204,"about_ca_topic_score_gemma":0.000002467915,"teacher_disagreement_score":0.033000592,"about_ca_system_score_codex":0.000012956943,"about_ca_system_score_gemma":0.000010367838,"threshold_uncertainty_score":0.38904443},"labels":[],"label_agreement":null},{"id":"W4411858855","doi":"10.1007/978-3-031-76568-1_15","title":"Integer Factorization","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Integer (computer science); Factorization; Mathematics; Computer science; Algorithm; Programming language","score_opus":0.011820101467061809,"score_gpt":0.19902643895784616,"score_spread":0.18720633749078436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411858855","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.00006454684,0.00065463764,0.023976123,0.000005876367,0.0011928547,0.0004373252,0.000036649988,0.00037232228,0.9732597],"genre_scores_gemma":[0.025293013,0.00019951224,0.0009921009,0.00003134589,0.00019580712,0.0000523546,0.000063980144,0.0001884493,0.9729834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860436,0.000012265523,0.00068288774,0.00023518535,0.00022162688,0.00024368655],"domain_scores_gemma":[0.9990561,0.00015100397,0.000114769005,0.0005728016,0.000049352293,0.0000559731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023165403,0.00044757634,0.0005978398,0.00037312534,0.000036519657,0.000054422097,0.000313668,0.0005332293,0.00024997114],"category_scores_gemma":[0.000034684977,0.00045198444,0.00016412273,0.000051639774,0.000055700017,0.00006779347,0.000055318855,0.00054484984,0.00020990254],"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.0000020428492,0.000012593597,0.0000049468454,0.0016832118,0.00009551757,0.00001555817,0.0009460052,0.0003439062,0.00008046301,0.99067706,0.005060809,0.0010778931],"study_design_scores_gemma":[0.00022665583,0.000018581793,0.000002121184,0.003186548,0.000079224934,0.000009919272,0.00011154955,0.005971535,0.00033173736,0.83256954,0.15680027,0.0006923189],"about_ca_topic_score_codex":0.0000011045589,"about_ca_topic_score_gemma":0.000010088208,"teacher_disagreement_score":0.1581075,"about_ca_system_score_codex":0.00014872533,"about_ca_system_score_gemma":0.000030305924,"threshold_uncertainty_score":0.9997932},"labels":[],"label_agreement":null},{"id":"W4411864883","doi":"10.1103/bdrr-q25l","title":"Vector space constructions of Kochen-Specker sets using Hadamard matrices","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Hadamard transform; Mathematics; Complex Hadamard matrix; Space (punctuation); Kochen–Specker theorem; Vector space; Pure mathematics; Combinatorics; Hadamard matrix; Physics; Computer science; Mathematical analysis; Quantum; Quantum mechanics","score_opus":0.011948106508415232,"score_gpt":0.3310205361630645,"score_spread":0.31907242965464927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411864883","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.58521724,0.39537302,0.002578698,0.00051300455,0.00064697256,0.0019737217,0.00007412367,0.00037156878,0.0132516585],"genre_scores_gemma":[0.91147834,0.087466896,0.00029477154,0.00028396206,0.00024210385,0.00012646576,0.0000129996915,0.00004965769,0.000044794462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771386,0.00026896218,0.0007450905,0.0004299236,0.0004033743,0.00043878864],"domain_scores_gemma":[0.99832624,0.00036209275,0.00022015757,0.0007573922,0.0001590796,0.00017503704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031661819,0.00046347137,0.001740206,0.00009026158,0.00009668891,0.000026383135,0.00040160745,0.00005295402,0.000047424714],"category_scores_gemma":[0.0002569731,0.00038907293,0.00086914026,0.0015015628,0.00020195433,0.00020676186,0.000096398566,0.00041792053,0.00015664448],"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.000029761983,0.00093725283,0.00065549486,0.13434365,0.0011185755,0.000017915785,0.00021536616,0.0003497398,0.22756274,0.578448,0.022212766,0.034108702],"study_design_scores_gemma":[0.0017536305,0.0003379394,0.0025226064,0.2556016,0.007558388,0.000087012646,0.0001519415,0.041570984,0.10894955,0.1697262,0.40791017,0.0038299763],"about_ca_topic_score_codex":0.00001379367,"about_ca_topic_score_gemma":0.0000015642312,"teacher_disagreement_score":0.40872183,"about_ca_system_score_codex":0.00008618767,"about_ca_system_score_gemma":0.000060827384,"threshold_uncertainty_score":0.9998561},"labels":[],"label_agreement":null},{"id":"W4412376449","doi":"10.55016/ojs/cdm.v10i1.62266","title":"On uniformly resolvable {K_2, P_k}-designs with with k=3,4","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016433725059316805,"score_gpt":0.2377580312302699,"score_spread":0.22132430617095308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376449","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.14664507,0.0001382883,0.77824044,0.00032972955,0.00018139639,0.0012635422,0.00043111196,0.0008930457,0.07187737],"genre_scores_gemma":[0.9941909,0.0000017227169,0.0046334397,0.000047997706,0.000048359623,0.00012206611,0.00003678723,0.000054596523,0.0008641713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988411,0.00003490486,0.0002546308,0.00016911827,0.0002981405,0.00040208403],"domain_scores_gemma":[0.9987658,0.000116708405,0.000046746165,0.0005347899,0.00020271541,0.00033319907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003548796,0.00024605315,0.00030832874,0.0001247825,0.00012773219,0.00008914668,0.00021124088,0.000079889505,0.00002646237],"category_scores_gemma":[0.000116717456,0.0001686068,0.000042971144,0.00046334686,0.00005908231,0.00012804475,0.000021240245,0.00016754966,0.0003166597],"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.00016810863,0.0001242762,0.0000503509,0.0001433735,0.000229551,0.00003832363,0.0022795964,0.070114404,0.00060041697,0.91257447,0.013597329,0.00007977564],"study_design_scores_gemma":[0.02100444,0.0123753,0.0004167477,0.0072507295,0.0014557015,0.0010297613,0.02037847,0.22317241,0.05629834,0.5236398,0.12518401,0.0077942885],"about_ca_topic_score_codex":0.000005096615,"about_ca_topic_score_gemma":0.000023305263,"teacher_disagreement_score":0.8475458,"about_ca_system_score_codex":0.0001451893,"about_ca_system_score_gemma":0.000044729437,"threshold_uncertainty_score":0.6875586},"labels":[],"label_agreement":null},{"id":"W4412402127","doi":"10.55016/ojs/cdm.v10i2.62371","title":"On bisectors in normed planes","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006157138654072794,"score_gpt":0.23045405420678156,"score_spread":0.22429691555270875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402127","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.92203665,0.00006232772,0.068686604,0.0003493833,0.00038544205,0.00050380494,0.00050440436,0.00035220227,0.0071191993],"genre_scores_gemma":[0.99946594,0.0000057294396,0.0001213849,0.00001989737,0.000035716996,0.00008055981,0.000007038196,0.000019374294,0.0002443407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992531,0.000023093713,0.00025193937,0.00010500747,0.00010407543,0.00026279435],"domain_scores_gemma":[0.9993076,0.00028547956,0.000020677377,0.00026460885,0.00002715898,0.00009451963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018458746,0.00013317444,0.00019403856,0.00016072839,0.0000421238,0.000019166144,0.00013526095,0.0000634794,0.00007994652],"category_scores_gemma":[0.0002633429,0.000088074026,0.000050553135,0.0002274439,0.000023878007,0.000053561926,0.000014713555,0.00005899156,0.0004915899],"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.000029600238,0.00010606438,0.0005997595,0.00018337756,0.00007965181,0.000020511816,0.0014192103,0.0023660276,0.023169614,0.96562123,0.005304923,0.0011000395],"study_design_scores_gemma":[0.009403704,0.00080219744,0.011689384,0.007150246,0.000170396,0.00010558407,0.0019622971,0.020729415,0.11153572,0.7829173,0.049517937,0.0040158085],"about_ca_topic_score_codex":0.0000017315531,"about_ca_topic_score_gemma":0.000022916194,"teacher_disagreement_score":0.18270391,"about_ca_system_score_codex":0.0000986875,"about_ca_system_score_gemma":0.000007748757,"threshold_uncertainty_score":0.6318557},"labels":[],"label_agreement":null},{"id":"W4412617757","doi":"10.55016/ojs/cdm.v12i1.62344","title":"α-Resolvable λ-fold G-designs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Combinatorics; Mathematics; Computer science; Programming language","score_opus":0.019686769001258552,"score_gpt":0.27854811497171394,"score_spread":0.2588613459704554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617757","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.09197195,0.00042365864,0.7731732,0.000870921,0.0013217191,0.0012600868,0.0008277643,0.0011141752,0.12903649],"genre_scores_gemma":[0.9965375,0.000008584074,0.0018945348,0.00002271781,0.000116630574,0.00009973114,0.000011646559,0.00003309712,0.0012755806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906826,0.000018149289,0.00027503818,0.00013579597,0.00014015475,0.00036259796],"domain_scores_gemma":[0.9985874,0.00007084814,0.00006160938,0.0010146202,0.00008656399,0.00017893342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033996947,0.0001746848,0.0002641296,0.00006704072,0.00060605607,0.00027747257,0.0005053535,0.00008695864,0.000099598816],"category_scores_gemma":[0.00035879816,0.00016085121,0.00010539646,0.00007761854,0.00006002039,0.00017903459,0.000073611984,0.00011525095,0.00070715987],"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.000007603373,0.00006593602,0.00014139243,0.00024165185,0.00018516832,0.000017039272,0.0010646537,0.0028229908,0.016836235,0.95693815,0.021119786,0.0005594106],"study_design_scores_gemma":[0.003518991,0.00031425265,0.0028514545,0.0016346787,0.00054792524,0.00012614978,0.0019920205,0.1885662,0.0955096,0.46177676,0.23970598,0.0034559797],"about_ca_topic_score_codex":0.000005434078,"about_ca_topic_score_gemma":0.000009588097,"teacher_disagreement_score":0.9045655,"about_ca_system_score_codex":0.00006200301,"about_ca_system_score_gemma":0.000013437999,"threshold_uncertainty_score":0.9089345},"labels":[],"label_agreement":null},{"id":"W4412617758","doi":"10.55016/ojs/cdm.v12i1.62743","title":"The Spectrum of Balanced P^(3)(1, 5)-Designs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spectrum (functional analysis); Physics","score_opus":0.012829032395431789,"score_gpt":0.26471875447806387,"score_spread":0.25188972208263205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617758","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.20672663,0.0008616487,0.7059011,0.003238633,0.0024129918,0.0019247867,0.0009915085,0.00059492566,0.07734778],"genre_scores_gemma":[0.9990089,0.00002192427,0.00039069535,0.0000053694093,0.0000628796,0.00004721259,0.0000033910762,0.000016592589,0.00044305617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992371,0.00002020715,0.00028771767,0.0000794696,0.00012256134,0.0002529006],"domain_scores_gemma":[0.9987192,0.00013529875,0.00009630731,0.00090768846,0.00006280131,0.00007867692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003875164,0.00011670548,0.00021110814,0.000030714553,0.00058604253,0.00012424534,0.000521162,0.000048489106,0.000016381808],"category_scores_gemma":[0.00039309124,0.000081895894,0.00009493025,0.00006675651,0.00011440199,0.00007277566,0.000054727832,0.000084548,0.00007940904],"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.000007725783,0.000021010563,0.000101188394,0.00009595632,0.000113637776,0.0000019765766,0.00054051785,0.00058310595,0.009271228,0.98612696,0.0027891924,0.00034752907],"study_design_scores_gemma":[0.0018511164,0.00023382134,0.006541707,0.00083890575,0.00025867543,0.000039953986,0.0018904866,0.071013704,0.14410761,0.7217574,0.050252296,0.0012143059],"about_ca_topic_score_codex":0.0000029147513,"about_ca_topic_score_gemma":0.000014209024,"teacher_disagreement_score":0.7922823,"about_ca_system_score_codex":0.000033080785,"about_ca_system_score_gemma":0.000011874751,"threshold_uncertainty_score":0.45074245},"labels":[],"label_agreement":null},{"id":"W4412646976","doi":"10.55016/ojs/cdm.v3i1.61981","title":"Partitioning the flags of PG(2,q) into strong representative systems","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"FLAGS register; Mathematics; Combinatorics; Computer science","score_opus":0.014457357920457273,"score_gpt":0.26399478753059696,"score_spread":0.2495374296101397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646976","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.39401817,0.0009405061,0.5945789,0.00017674912,0.0005146512,0.001088108,0.00029932882,0.00029617938,0.0080874],"genre_scores_gemma":[0.9989032,0.000016787953,0.0006115482,0.000006400818,0.00007306804,0.00017128506,0.000019346575,0.000019883873,0.0001784583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988938,0.00008367759,0.00046871556,0.000117115414,0.00020000114,0.00023666993],"domain_scores_gemma":[0.9989473,0.00026724293,0.000088116394,0.0004460595,0.00016678717,0.00008445555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037993604,0.00014466955,0.00028479527,0.00006960589,0.00030815054,0.000031421645,0.00022281216,0.000056850102,0.0000211306],"category_scores_gemma":[0.0002394428,0.00010764883,0.00010234277,0.0003387767,0.00013559168,0.000105292456,0.000043362783,0.00012501939,0.00006765495],"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.00001175267,0.000061735365,0.00054640416,0.00041583544,0.00034062317,0.000011863132,0.021391299,0.0706237,0.0067525203,0.8944851,0.005312817,0.000046349094],"study_design_scores_gemma":[0.0036381227,0.00054259517,0.0040435996,0.0034856526,0.00083967345,0.00067210954,0.08487205,0.63430786,0.10920235,0.13716863,0.018389141,0.0028381879],"about_ca_topic_score_codex":0.00002441599,"about_ca_topic_score_gemma":0.000006355434,"teacher_disagreement_score":0.75731647,"about_ca_system_score_codex":0.000062804866,"about_ca_system_score_gemma":0.000018605931,"threshold_uncertainty_score":0.4389792},"labels":[],"label_agreement":null},{"id":"W4412646979","doi":"10.55016/ojs/cdm.v3i1.61962","title":"Two character sets in finite linear spaces","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Character (mathematics); Combinatorics; Geometry","score_opus":0.013650253567308255,"score_gpt":0.259812493195392,"score_spread":0.24616223962808376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646979","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.93712467,0.00024253581,0.054673795,0.00027280248,0.00036423013,0.00060543086,0.00042122093,0.00038875124,0.005906561],"genre_scores_gemma":[0.9978417,0.000023731021,0.0016088921,0.00003913546,0.00008012477,0.0000803862,0.000037023914,0.000026692363,0.00026231058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904805,0.000032679764,0.00034077614,0.00012770532,0.00012727543,0.0003235309],"domain_scores_gemma":[0.999324,0.00014785961,0.000033756645,0.00031378088,0.000062547726,0.00011804924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023222246,0.00016994296,0.00027951403,0.00015763444,0.00010134548,0.000025656718,0.00015829316,0.00006904559,0.000058432113],"category_scores_gemma":[0.00018948199,0.00015750484,0.000077888115,0.00036161547,0.00004014838,0.000111735295,0.000032020907,0.00015737303,0.00049729017],"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.00011514176,0.0010508256,0.010323271,0.002123718,0.0007983094,0.0007572113,0.05951793,0.1425519,0.036183484,0.73354536,0.011259547,0.0017732815],"study_design_scores_gemma":[0.006336163,0.00026977397,0.0095196385,0.0023652157,0.00018627239,0.00048380066,0.0030420576,0.8305228,0.025649795,0.053874634,0.06428716,0.0034627093],"about_ca_topic_score_codex":0.000004663931,"about_ca_topic_score_gemma":0.000014379639,"teacher_disagreement_score":0.6879709,"about_ca_system_score_codex":0.000059944614,"about_ca_system_score_gemma":0.000014266655,"threshold_uncertainty_score":0.6422861},"labels":[],"label_agreement":null},{"id":"W4412647866","doi":"10.55016/ojs/cdm.v2i1.61930","title":"Bounds on the achromatic number of partial triple systems","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Achromatic lens; Mathematics; Combinatorics; Physics","score_opus":0.010416507884809528,"score_gpt":0.2646640253499947,"score_spread":0.2542475174651852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647866","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.68899816,0.0001514999,0.28441313,0.00016100093,0.0009870569,0.0011721109,0.0003330072,0.00028037533,0.023503644],"genre_scores_gemma":[0.9993123,0.0000022112797,0.00018233813,0.000017558888,0.00010583203,0.000078499026,0.000010808817,0.000025257214,0.00026518494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987007,0.000052388834,0.00057002,0.00010139666,0.00024145917,0.00033406413],"domain_scores_gemma":[0.9987452,0.00046567805,0.000085875654,0.00050153385,0.00009477269,0.000106918094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011573774,0.00016811304,0.00031221146,0.00006417259,0.0001477843,0.0000556238,0.00024324458,0.00008275908,0.00006672078],"category_scores_gemma":[0.0003009573,0.00011586441,0.00012012249,0.00036016543,0.00006535065,0.00004872016,0.000024668076,0.00012675811,0.00032104732],"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.00001141914,0.00006336982,0.000055130393,0.00025713697,0.00012662959,0.0000030647516,0.0012061516,0.0016563451,0.0026504074,0.99100995,0.0029115605,0.00004885933],"study_design_scores_gemma":[0.0063944813,0.0009508799,0.0025254146,0.006743885,0.0013899849,0.0004996532,0.030274913,0.43565926,0.19460803,0.21119756,0.10533637,0.0044195545],"about_ca_topic_score_codex":0.000004501789,"about_ca_topic_score_gemma":0.0000024287986,"teacher_disagreement_score":0.77981234,"about_ca_system_score_codex":0.000077045785,"about_ca_system_score_gemma":0.000013142346,"threshold_uncertainty_score":0.47248134},"labels":[],"label_agreement":null},{"id":"W4412648254","doi":"10.55016/ojs/cdm.v13i1.62548","title":"Uniformly resolvable (C4, K1,3) -designs of index 2","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Index (typography); Statistics; Discrete mathematics; Computer science","score_opus":0.01208784937286285,"score_gpt":0.25704937298803887,"score_spread":0.24496152361517604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648254","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.1172954,0.00017792096,0.837342,0.00013578584,0.0004437008,0.00071105047,0.0005195586,0.00042070888,0.04295388],"genre_scores_gemma":[0.9971541,0.000005066963,0.0021205607,0.00002160971,0.00011121286,0.000042930988,0.000014734119,0.000029305626,0.0005004652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891174,0.000030621246,0.00043652428,0.00012461639,0.00017051928,0.00032595996],"domain_scores_gemma":[0.99895567,0.00010255844,0.000061951185,0.0005100148,0.00023727854,0.00013250747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043119615,0.00016495961,0.00030433878,0.00014246406,0.00012747696,0.000032680466,0.00025776215,0.000102880585,0.00013912292],"category_scores_gemma":[0.00019438694,0.00014976904,0.00009274427,0.00047237868,0.000112239315,0.00009943649,0.00004607355,0.000099454104,0.00025960678],"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.00003530988,0.0001102705,0.00016490601,0.00046692393,0.00025517447,0.000004228492,0.0032858846,0.0025198902,0.03136866,0.9480677,0.013262181,0.0004588158],"study_design_scores_gemma":[0.0030732343,0.0010288954,0.0010611347,0.0016465937,0.00036713612,0.000081607664,0.0044013816,0.21838301,0.24120183,0.4153073,0.1113586,0.0020892601],"about_ca_topic_score_codex":0.0000056568388,"about_ca_topic_score_gemma":0.000014945202,"teacher_disagreement_score":0.87985873,"about_ca_system_score_codex":0.0000586082,"about_ca_system_score_gemma":0.000026032772,"threshold_uncertainty_score":0.6107404},"labels":[],"label_agreement":null},{"id":"W4412861219","doi":"10.5206/mt.v5i3.23166","title":"Bidiagonal factoring of Stirling matrices","year":2025,"lang":"en","type":"article","venue":"Maple Transactions","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":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Factoring; Stirling engine; Mathematics; Algebra over a field; Arithmetic; Computer science; Pure mathematics; Business; Engineering; Mechanical engineering; Accounting","score_opus":0.00510104760539836,"score_gpt":0.19809943049818682,"score_spread":0.19299838289278845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412861219","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.3701884,0.000945648,0.6153922,0.000034610217,0.0012498787,0.00010833604,0.00004179366,0.0003229274,0.01171619],"genre_scores_gemma":[0.9993571,0.00004188632,0.00019596904,0.0000032749392,0.000016231623,0.000012785957,0.0000014541415,0.0000075082203,0.00036380618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962497,0.000009746507,0.00014748858,0.000062326086,0.000055081728,0.000100400655],"domain_scores_gemma":[0.99980235,0.00005231759,0.000010244477,0.000101192934,0.000013636942,0.000020279462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058068083,0.00006480695,0.00009959394,0.00014191397,0.00005321548,0.000009657737,0.00007106396,0.00003874553,0.00012889446],"category_scores_gemma":[0.0000015254686,0.00006810604,0.00006745539,0.00027383905,0.000014717477,0.000062197534,0.0000010789518,0.000082329745,0.0000088278275],"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.000049246348,0.00019765114,0.0039736335,0.002787037,0.0010177816,0.0000070426177,0.0050175283,0.6358841,0.24723998,0.03644104,0.00058262993,0.06680233],"study_design_scores_gemma":[0.002206418,0.00008446497,0.028650528,0.0010388284,0.00054789614,0.000018372062,0.004887125,0.06459003,0.69873536,0.010280674,0.18765905,0.0013012746],"about_ca_topic_score_codex":0.000023232107,"about_ca_topic_score_gemma":0.000010608523,"teacher_disagreement_score":0.6291687,"about_ca_system_score_codex":0.000014729186,"about_ca_system_score_gemma":0.000007589815,"threshold_uncertainty_score":0.27772838},"labels":[],"label_agreement":null},{"id":"W4413106101","doi":"10.55016/ojs/cdm.v4i1.61878","title":"Results on permutations with distinct difference property","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Combinatorics","score_opus":0.010103001978321065,"score_gpt":0.23740924101247035,"score_spread":0.2273062390341493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106101","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.431932,0.00006323629,0.50068104,0.0020077839,0.00019908063,0.001593848,0.0017460884,0.0011627969,0.06061413],"genre_scores_gemma":[0.99803984,0.0000018184907,0.0007403256,0.00004824801,0.000045874152,0.000069744354,0.00006425368,0.000016744163,0.0009731493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906796,0.00002676289,0.00029276483,0.00016470424,0.00017400409,0.0002737851],"domain_scores_gemma":[0.99918765,0.00010697827,0.00005003333,0.00040678852,0.0001043287,0.00014423115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015029423,0.0001902175,0.00022113713,0.00007985073,0.00018440236,0.00007245112,0.0001676541,0.000051864492,0.0000110598785],"category_scores_gemma":[0.00028813365,0.00011265861,0.000052330026,0.0003017788,0.000035921574,0.000053486245,0.000009550211,0.00013286626,0.0001395352],"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.0002553259,0.00060010847,0.00007831628,0.0002459295,0.00021620828,0.0000531982,0.0074873446,0.02359174,0.00869923,0.9455317,0.006473245,0.0067676217],"study_design_scores_gemma":[0.016469155,0.0097848745,0.08455526,0.008966801,0.0012744311,0.0006384943,0.0069609457,0.36939853,0.04780491,0.39189023,0.053195074,0.009061299],"about_ca_topic_score_codex":0.0000014296164,"about_ca_topic_score_gemma":0.0000084752855,"teacher_disagreement_score":0.56610787,"about_ca_system_score_codex":0.00007146873,"about_ca_system_score_gemma":0.000016005117,"threshold_uncertainty_score":0.45940846},"labels":[],"label_agreement":null},{"id":"W4413186058","doi":"10.55016/ojs/cdm.v6i2.62097","title":"Cards, permutations, and sums","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Winnipeg","keywords":"Combinatorics; Mathematics","score_opus":0.011680211440807824,"score_gpt":0.23045438583522634,"score_spread":0.2187741743944185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186058","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.5155162,0.001304814,0.4383809,0.00011662613,0.0004812339,0.000942368,0.00077481044,0.0008280728,0.041654944],"genre_scores_gemma":[0.9975963,0.000016711338,0.0020755557,0.000015769878,0.000030424006,0.000073748226,0.0000150688,0.00001916172,0.00015725332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994047,0.000018414547,0.00020994378,0.00009554263,0.00007695951,0.00019440775],"domain_scores_gemma":[0.99952006,0.0000457501,0.000019130712,0.00022254352,0.00006461078,0.00012790007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017128159,0.00011813918,0.00016809948,0.00007650793,0.00010939682,0.000031526204,0.000090418085,0.00005332624,0.00006279426],"category_scores_gemma":[0.000090034635,0.00010865175,0.00004524098,0.00015676221,0.00003942864,0.00007631615,0.000023909024,0.00006945286,0.00011989648],"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.0000044120575,0.000039362312,0.00032704463,0.00019152646,0.00012366273,0.0000072015373,0.009391186,0.00017736595,0.002117591,0.98465157,0.00245874,0.0005103643],"study_design_scores_gemma":[0.0027960967,0.00036736394,0.014893876,0.0009522134,0.00084146945,0.00040049845,0.019330831,0.072813354,0.034705356,0.8062781,0.043346893,0.003273938],"about_ca_topic_score_codex":0.000004874278,"about_ca_topic_score_gemma":0.000006066383,"teacher_disagreement_score":0.48208007,"about_ca_system_score_codex":0.000027361022,"about_ca_system_score_gemma":0.000007444594,"threshold_uncertainty_score":0.443069},"labels":[],"label_agreement":null},{"id":"W4413186192","doi":"10.55016/ojs/cdm.v6i2.62095","title":"A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.014953510623808203,"score_gpt":0.2223248306890903,"score_spread":0.2073713200652821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186192","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.8101489,0.00018531023,0.1848849,0.000050538227,0.00007083582,0.00089476764,0.0006017661,0.00011471583,0.003048244],"genre_scores_gemma":[0.9988385,0.0000022787901,0.0010071126,0.0000045258907,0.0000068574213,0.00007458978,0.0000074683985,0.00002213972,0.00003654191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989486,0.00007489202,0.00041872094,0.00011213153,0.00020407684,0.00024160116],"domain_scores_gemma":[0.99915254,0.000063798434,0.00014614691,0.00041323458,0.00013720353,0.00008706715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025329585,0.0001730678,0.0003544174,0.000058281035,0.00011949624,0.000009109027,0.00027471076,0.000045002784,0.000051946958],"category_scores_gemma":[0.00004828561,0.00011121056,0.00011526304,0.00033330094,0.00058686687,0.000037536796,0.0000808733,0.00010123163,0.0000032780222],"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.00017166558,0.0004752973,0.00146296,0.0010806568,0.00063298503,0.0000035428168,0.011197612,0.0044375286,0.022210171,0.95754176,0.00058969256,0.00019614628],"study_design_scores_gemma":[0.00262315,0.00041091253,0.0031897319,0.002357684,0.00058205397,0.00009295029,0.0038030017,0.039986804,0.73350835,0.21245226,0.00018038567,0.0008127262],"about_ca_topic_score_codex":0.00001836179,"about_ca_topic_score_gemma":0.00006710612,"teacher_disagreement_score":0.7450895,"about_ca_system_score_codex":0.00008159521,"about_ca_system_score_gemma":0.000015891534,"threshold_uncertainty_score":0.4535035},"labels":[],"label_agreement":null},{"id":"W4413186330","doi":"10.55016/ojs/cdm.v7i2.62152","title":"Algorithms for classifying regular polytopes with a fixed automorphism group","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Polytope; Automorphism group; Group (periodic table); Automorphism; Outer automorphism group; Discrete mathematics","score_opus":0.01561005595092591,"score_gpt":0.2570172356043343,"score_spread":0.2414071796534084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186330","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.0381325,0.0005706693,0.957651,0.00016488193,0.0003465037,0.0010716702,0.00049031765,0.0005376092,0.0010348122],"genre_scores_gemma":[0.96660036,0.000004385885,0.032133568,0.000038316473,0.00024372226,0.00054589735,0.00007354984,0.00006125325,0.00029892687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987542,0.000028007791,0.00032498743,0.00013901069,0.00016186235,0.00059192185],"domain_scores_gemma":[0.99905276,0.00016560822,0.000056586425,0.00037793783,0.00009492239,0.0002521665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042707348,0.00023164717,0.00033617814,0.00010783301,0.00022068204,0.000068370646,0.00018011448,0.00010407364,0.000022584873],"category_scores_gemma":[0.000109708766,0.000188083,0.000111692665,0.0002734938,0.00005046745,0.00020517065,0.000028868755,0.000109936555,0.000057377867],"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.000044995035,0.00022665248,0.00037883094,0.0008597751,0.0005921472,0.0000050776694,0.0039686398,0.0014077905,0.018829081,0.96437824,0.007679092,0.0016296841],"study_design_scores_gemma":[0.011276169,0.0014225878,0.0039603715,0.003754855,0.00226323,0.000713152,0.01144479,0.40517166,0.06667065,0.08943914,0.3972838,0.00659959],"about_ca_topic_score_codex":0.000001643695,"about_ca_topic_score_gemma":0.0000032017092,"teacher_disagreement_score":0.92846787,"about_ca_system_score_codex":0.00010520402,"about_ca_system_score_gemma":0.000011792745,"threshold_uncertainty_score":0.76698023},"labels":[],"label_agreement":null},{"id":"W4413186453","doi":"10.55016/ojs/cdm.v7i1.62051","title":"2-generated Cayley digraphs on nilpotent groups have hamiltonian paths","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nilpotent; Mathematics; Combinatorics; Cayley graph; Cayley's theorem; Hamiltonian (control theory); Nilpotent group; Discrete mathematics; Graph; Voltage graph","score_opus":0.010370156541710187,"score_gpt":0.2377313745768587,"score_spread":0.2273612180351485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186453","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.8389357,0.0009703164,0.13931355,0.0002480061,0.0015810637,0.0013816532,0.0012415453,0.0010524561,0.015275733],"genre_scores_gemma":[0.99836653,0.000014345925,0.0006608433,0.00008147855,0.00022609127,0.00018855846,0.00009347623,0.00005668056,0.0003120096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836344,0.00006686501,0.00045307423,0.0001788408,0.00024499118,0.00069277856],"domain_scores_gemma":[0.99873424,0.00010834337,0.000057498655,0.0005899695,0.000108340595,0.00040161973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045851123,0.00031712925,0.00036774512,0.00018437133,0.00023580459,0.00009722959,0.00023173507,0.00014653766,0.00006769827],"category_scores_gemma":[0.00015122605,0.00027748782,0.00017627874,0.00036119067,0.000045081615,0.00014412944,0.000040878727,0.00021232897,0.00056993763],"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.000033191558,0.0004923324,0.0011644971,0.00031375015,0.00046586333,0.00001620767,0.008068281,0.0068920567,0.022350855,0.94728035,0.0119535485,0.00096905866],"study_design_scores_gemma":[0.009912331,0.0020602974,0.019872531,0.004180643,0.0019971672,0.0005419739,0.019187808,0.21225561,0.24525702,0.13778667,0.33459634,0.012351604],"about_ca_topic_score_codex":0.0000048018555,"about_ca_topic_score_gemma":0.000008967546,"teacher_disagreement_score":0.80949366,"about_ca_system_score_codex":0.0001448003,"about_ca_system_score_gemma":0.000011306449,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W4413186477","doi":"10.55016/ojs/cdm.v4i2.62763","title":"On the Hall-Janko graph with 100 vertices and the near-octagon of order (2,4)","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vlaamse regering; Fonds Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Graph; Order (exchange); Business","score_opus":0.005192508490468586,"score_gpt":0.21655889918899499,"score_spread":0.2113663906985264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186477","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.8755667,0.0008524787,0.10434246,0.0056795916,0.00013042621,0.0015487373,0.00015091228,0.00020620872,0.011522495],"genre_scores_gemma":[0.99930286,0.000016878417,0.00042157946,0.00011933599,0.000016502501,0.000044089793,0.0000036242059,0.000011851352,0.00006329618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992672,0.00006136098,0.00021865194,0.00009555208,0.00016195593,0.00019527182],"domain_scores_gemma":[0.99891305,0.00047964675,0.00005313379,0.0003991363,0.00009966414,0.00005539535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044427524,0.00014908412,0.00024083552,0.000039204504,0.0002183003,0.0000781678,0.00019557218,0.000044904653,0.000021005255],"category_scores_gemma":[0.00022474398,0.00007079742,0.000056717665,0.00035140885,0.00019401644,0.000051329036,0.000015980384,0.00012300545,0.000015212285],"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.000050902556,0.000027171798,0.000008050395,0.000042033676,0.000088689514,8.5691795e-7,0.0018666155,0.0028257894,0.0003688775,0.9940557,0.00053071504,0.00013462179],"study_design_scores_gemma":[0.005582042,0.0010358187,0.0014474294,0.0014323291,0.00077461783,0.000079273836,0.005657962,0.13014844,0.008073555,0.83871865,0.0059544165,0.0010954296],"about_ca_topic_score_codex":0.000004235318,"about_ca_topic_score_gemma":0.000007436191,"teacher_disagreement_score":0.15533699,"about_ca_system_score_codex":0.000013348194,"about_ca_system_score_gemma":0.000011230901,"threshold_uncertainty_score":0.2887035},"labels":[],"label_agreement":null},{"id":"W4413186795","doi":"10.55016/ojs/cdm.v5i1.62066","title":"Deletion constructions of symmetric 4-configurations. Part I.","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005168732471958994,"score_gpt":0.2271772617436259,"score_spread":0.22200852927166692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186795","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.63142294,0.00015709229,0.31934735,0.0003194954,0.0023932753,0.0011326051,0.0015249936,0.0006491446,0.043053124],"genre_scores_gemma":[0.9965552,0.0000073395363,0.003085661,0.000008786467,0.00009690734,0.000093023744,0.000047328595,0.000018412673,0.00008732304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990599,0.00002163353,0.00046061326,0.000108497894,0.00013972638,0.0002096368],"domain_scores_gemma":[0.9990423,0.00014046177,0.0000693189,0.0003847742,0.00023982253,0.00012336762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027672137,0.0001364676,0.00024006021,0.00025042339,0.00013543537,0.000035340683,0.0001489858,0.00010676614,0.00018879941],"category_scores_gemma":[0.0004228288,0.00013211778,0.00010153748,0.000695819,0.000089154404,0.00009780444,0.00001641489,0.00018539929,0.0001276366],"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.0000013794778,0.000030927127,0.000036278994,0.00007064659,0.000048769696,4.7442506e-7,0.00020980295,0.0005644407,0.04220497,0.9551628,0.00113418,0.00053530553],"study_design_scores_gemma":[0.0027218643,0.00028764142,0.002104822,0.0006865753,0.00077624933,0.00044231233,0.0038760048,0.109407336,0.28328922,0.4392334,0.15484013,0.0023344385],"about_ca_topic_score_codex":0.000002518379,"about_ca_topic_score_gemma":0.000013074807,"teacher_disagreement_score":0.51592946,"about_ca_system_score_codex":0.000026412508,"about_ca_system_score_gemma":0.000023451214,"threshold_uncertainty_score":0.53876066},"labels":[],"label_agreement":null},{"id":"W4413321771","doi":"10.1109/cog64752.2025.11114382","title":"The Maximum Number of Sets for 12 Cards is 14","year":2025,"lang":"en","type":"article","venue":"","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 Alberta","funders":"","keywords":"Computer science","score_opus":0.007046278518834364,"score_gpt":0.24100483942615972,"score_spread":0.23395856090732536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413321771","genre_codex":"other","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.19314843,0.00049875665,0.013881028,0.00026801028,0.0019074794,0.00041713164,0.000038227307,0.00020841419,0.7896325],"genre_scores_gemma":[0.99158484,0.000009580058,0.00008926646,0.00004314051,0.000013906166,0.000028524875,8.673569e-7,0.000006451145,0.008223406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999706,0.000008516311,0.00010505351,0.00004575523,0.00003899635,0.00009568635],"domain_scores_gemma":[0.99973214,0.00007524159,0.0000072785583,0.00015393889,0.000020028467,0.000011366778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013544699,0.00004897189,0.00007665609,0.000012443783,0.00003922847,0.00000952455,0.00008522447,0.000034450193,0.000054376844],"category_scores_gemma":[0.000006943197,0.00003252425,0.00006562367,0.000058329235,0.000014497767,0.000017584642,0.0000086189575,0.000028070279,0.000013830247],"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.000048123857,0.000022196524,0.005358852,0.00078929187,0.00057521835,7.4273754e-7,0.0010743965,0.0005945986,0.0030058385,0.5915355,0.3659731,0.031022133],"study_design_scores_gemma":[0.00062213634,0.000017226484,0.0010782954,0.000074619034,0.000049148264,0.000003627958,0.0010142773,0.0069461213,0.06500533,0.16061728,0.7643659,0.00020605575],"about_ca_topic_score_codex":0.0000107667665,"about_ca_topic_score_gemma":0.000015444388,"teacher_disagreement_score":0.7984364,"about_ca_system_score_codex":0.000005982825,"about_ca_system_score_gemma":0.000004659367,"threshold_uncertainty_score":0.13263005},"labels":[],"label_agreement":null},{"id":"W4413472863","doi":"10.61091/jcmcc126-23","title":"Constructing strong starters of orders 3p: triplication with SAT solver","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Boolean satisfiability problem; Problem solver; Solver; Arithmetic; Algorithm; Mathematics; Programming language; Computational science","score_opus":0.006000475268581502,"score_gpt":0.2121616487559696,"score_spread":0.2061611734873881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413472863","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.9667256,0.00023443082,0.022842282,0.000024561996,0.0074802814,0.00022437684,0.0000021654573,0.000046676192,0.00241964],"genre_scores_gemma":[0.9980459,0.0000094659645,0.0016951795,0.0000037208597,0.00021768587,0.0000013988354,0.0000011268378,0.00002276892,0.000002713418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983191,0.00006201623,0.0009597233,0.00010501365,0.0003301585,0.00022400598],"domain_scores_gemma":[0.99839276,0.000413008,0.000583522,0.00018741352,0.0003415636,0.00008171364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000873888,0.0002196242,0.0006570054,0.00024479252,0.00011589894,0.00008114564,0.00023490374,0.00011474801,0.0000030471952],"category_scores_gemma":[0.0000900021,0.00019028067,0.000112165035,0.00037790654,0.00010975334,0.0001599905,0.00004778379,0.0003243291,3.666779e-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.00009940948,0.00012320215,0.0010796123,0.0006800117,0.00033711377,0.0000039029123,0.0010445509,0.00060448627,0.001211941,0.9925567,0.000109916284,0.0021491474],"study_design_scores_gemma":[0.01895619,0.0016368852,0.00043746582,0.0045457026,0.00074076356,0.00020270224,0.017449483,0.043141186,0.016119251,0.8948345,0.00090744573,0.0010284174],"about_ca_topic_score_codex":0.0000041645735,"about_ca_topic_score_gemma":5.723481e-7,"teacher_disagreement_score":0.097722195,"about_ca_system_score_codex":0.00007769289,"about_ca_system_score_gemma":0.000077080476,"threshold_uncertainty_score":0.7759421},"labels":[],"label_agreement":null},{"id":"W4414468632","doi":"10.1007/s00026-025-00782-x","title":"Enumeration of Max-Pooling Responses with Generalized Permutohedra","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"H2020 European Research Council; Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; Deutsche Forschungsgemeinschaft; Simons Foundation","keywords":"Enumeration; Polytope; Minkowski addition; Generating function; Catalan number; Minkowski space","score_opus":0.019094318878115798,"score_gpt":0.26378201397117046,"score_spread":0.24468769509305466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414468632","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.9904789,0.0016056563,0.0024798654,0.000068171554,0.0003029028,0.00009945754,0.0000064620012,0.0000649958,0.0048936433],"genre_scores_gemma":[0.999335,0.00016135549,0.000058952333,0.000028426311,0.000009118953,0.000008617947,0.0000035641144,0.000011586142,0.00038339559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934983,0.000066695175,0.0002582976,0.00007873178,0.00012707849,0.0001193719],"domain_scores_gemma":[0.9994567,0.00008592149,0.000058335412,0.00020623571,0.00016830662,0.000024472312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027425453,0.00009642392,0.00022456775,0.00016097468,0.000032522366,0.000009884479,0.000110077664,0.0000599392,0.000006985714],"category_scores_gemma":[0.0000364493,0.00008893148,0.0000554317,0.00038990402,0.000032426935,0.0000792895,0.000011168433,0.00006521492,0.0000011704026],"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.00024737098,0.00008962515,0.0040329597,0.0005860239,0.00021718683,0.0000047857106,0.0005818661,0.007139889,0.02355717,0.9613687,0.0013437981,0.00083062775],"study_design_scores_gemma":[0.0013861593,0.00030407793,0.0064549455,0.00051531923,0.00006786599,0.0000058794913,0.00030627623,0.0057667317,0.84603506,0.12928766,0.009506956,0.0003630516],"about_ca_topic_score_codex":0.000010224548,"about_ca_topic_score_gemma":0.000001227279,"teacher_disagreement_score":0.832081,"about_ca_system_score_codex":0.0000062774957,"about_ca_system_score_gemma":0.000025401763,"threshold_uncertainty_score":0.36265206},"labels":[],"label_agreement":null},{"id":"W4414581285","doi":"10.61091/jcmcc127-10","title":"Block-transitive \\(2-(v,5,\\lambda)\\) designs with sporadic socle","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Socle; Automorphism; Block (permutation group theory); Automorphism group; Simple (philosophy)","score_opus":0.008054323735415675,"score_gpt":0.21302488808969655,"score_spread":0.20497056435428088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581285","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.9602001,0.0007698587,0.019250479,0.00005750409,0.014031761,0.00032912506,0.000002238981,0.00012669622,0.005232239],"genre_scores_gemma":[0.99819237,0.000028702949,0.0011897293,0.000014845352,0.00052109046,0.0000022613594,5.873367e-7,0.000038038863,0.000012372059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814594,0.00008900744,0.0008713123,0.00015979676,0.00040123722,0.00033268807],"domain_scores_gemma":[0.9985742,0.00041044023,0.00032956357,0.00020904058,0.00032785887,0.00014888361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011204403,0.00031593637,0.0007696054,0.0002733854,0.00022522417,0.00015682206,0.00030339442,0.00016401845,0.0000038817598],"category_scores_gemma":[0.000066876615,0.00026535115,0.0001527031,0.00048293624,0.000109484,0.00017453563,0.000045820205,0.00050354307,0.0000017138955],"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.000181573,0.0003098201,0.00023474962,0.00064908597,0.00053763896,0.00007484464,0.0019963828,0.0009178814,0.002523616,0.99107486,0.00048760395,0.0010119621],"study_design_scores_gemma":[0.010682752,0.0014225321,0.00029953913,0.0027318199,0.0005396375,0.0004132307,0.0025025231,0.018702976,0.010502479,0.94912285,0.0021992994,0.0008803586],"about_ca_topic_score_codex":0.0000028154811,"about_ca_topic_score_gemma":3.7353414e-7,"teacher_disagreement_score":0.04195199,"about_ca_system_score_codex":0.00007894587,"about_ca_system_score_gemma":0.000101977435,"threshold_uncertainty_score":0.99997985},"labels":[],"label_agreement":null},{"id":"W4414643071","doi":"10.61091/ars164-05","title":"Primitive star decompositions of graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Graph; Decomposition; Path (computing); Induced path; Cograph","score_opus":0.004280500213493223,"score_gpt":0.2069997454216965,"score_spread":0.20271924520820328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643071","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.96382636,0.00036909065,0.00009043221,0.000014987613,0.0016471006,0.00011829743,0.000010645827,0.00014151384,0.033781577],"genre_scores_gemma":[0.99979675,0.00001666117,0.00006623857,0.00001338158,0.0000011667515,0.000018119024,0.0000053392596,0.0000088286815,0.00007351399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954134,0.000031991665,0.00016722866,0.00008006041,0.000062045896,0.000117328695],"domain_scores_gemma":[0.9996606,0.00006844225,0.000018581664,0.00018220788,0.000042000378,0.000028184379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008777221,0.000082366,0.00014199689,0.00012290246,0.000044688863,0.000007903595,0.00011566908,0.000049783604,0.000016439353],"category_scores_gemma":[0.000007726185,0.00008884119,0.00006696615,0.00032559698,0.000038222406,0.000054294134,0.000015680622,0.00008054248,0.000010465088],"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.000004658498,0.000034101296,0.0010302907,0.00007279681,0.00008190831,0.0000014107234,0.00014723625,0.000093693394,0.007139047,0.99022734,0.0010366228,0.00013091131],"study_design_scores_gemma":[0.00048057866,0.000034090404,0.009239093,0.00012733614,0.000028943803,0.0000012626144,0.00017975732,0.00038037077,0.03875415,0.94962347,0.0010258986,0.00012502933],"about_ca_topic_score_codex":0.0000061846295,"about_ca_topic_score_gemma":0.0000018023826,"teacher_disagreement_score":0.040603835,"about_ca_system_score_codex":0.00001972364,"about_ca_system_score_gemma":0.000010827431,"threshold_uncertainty_score":0.36228386},"labels":[],"label_agreement":null},{"id":"W4414684088","doi":"10.1016/j.ffa.2025.102730","title":"On the study of semi-involutory and semi-orthogonal matrices","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","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 Waterloo","funders":"","keywords":"Circulant matrix; Diagonal; Order (exchange); Matrix (chemical analysis); Main diagonal; Computational complexity theory; Diagonal matrix","score_opus":0.007018259349240369,"score_gpt":0.20027188860003167,"score_spread":0.19325362925079131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414684088","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.97732675,0.0011848639,0.008873638,0.000096336524,0.000048617385,0.00043858474,0.00003047624,0.000055443797,0.011945278],"genre_scores_gemma":[0.9994714,0.000080675374,0.000004568725,0.000054311233,0.000018496032,0.0002067453,0.0000025263253,0.0000046446235,0.00015663494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967235,0.000022275655,0.00011952169,0.00009136515,0.00003204663,0.00006243399],"domain_scores_gemma":[0.999339,0.00041679794,0.000019668014,0.0001940913,0.000013325093,0.000017161588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010657406,0.00007279716,0.00009141044,0.000051779534,0.000105401705,0.000014461914,0.00008206657,0.000046566016,0.000012637102],"category_scores_gemma":[0.000005111208,0.000048115435,0.000019145644,0.0001558803,0.000027872056,0.00001696974,0.000022213158,0.00010056574,0.0000019533131],"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.00002883174,0.00028687328,0.0058546877,0.00031596108,0.00031962595,4.9604506e-7,0.0056935586,0.0022505946,0.00084224454,0.9687364,0.002548305,0.0131224105],"study_design_scores_gemma":[0.002871695,0.0011378153,0.05594295,0.0006426684,0.0003453794,0.000013471744,0.045058675,0.059851736,0.0042920904,0.65383893,0.17461976,0.0013848444],"about_ca_topic_score_codex":0.0000072589755,"about_ca_topic_score_gemma":0.000017976834,"teacher_disagreement_score":0.3148975,"about_ca_system_score_codex":0.000002195149,"about_ca_system_score_gemma":0.0000036343472,"threshold_uncertainty_score":0.19620904},"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":"W4415315340","doi":"10.48550/arxiv.2510.06489","title":"A class of skew-regular quaternary Hadamard matrices","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Class (philosophy); Complex Hadamard matrix; Hadamard's maximal determinant problem; Hadamard matrix; Prime (order theory); Hadamard's inequality; Order (exchange); Prime power","score_opus":0.02680445868039519,"score_gpt":0.15627533543952685,"score_spread":0.12947087675913166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415315340","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.9547173,0.0007875883,0.022027852,0.000009576076,0.001237006,0.00028198434,0.00012223472,0.0003827264,0.020433731],"genre_scores_gemma":[0.9961013,0.00036410158,0.00007219639,0.000008155258,0.00005589532,0.0000013020858,0.000020676956,0.000022791972,0.0033535613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988929,0.00010321155,0.0002605256,0.00042968747,0.000068270456,0.00024542143],"domain_scores_gemma":[0.9989105,0.0000705654,0.00012646,0.00074173044,0.0000681057,0.000082623505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017094988,0.00030566004,0.00046695615,0.00037916776,0.000046603323,0.000021171825,0.00071528903,0.00037301073,0.000050797855],"category_scores_gemma":[0.000007024302,0.00036468092,0.00030933536,0.00040877075,0.00008040896,0.00009324586,0.0003574971,0.00040492887,0.000034540415],"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.00009799313,0.00007781016,0.00973872,0.0033778832,0.0009404375,0.00028842312,0.00036688696,0.78313184,0.0005268991,0.19943392,0.0017434761,0.00027573755],"study_design_scores_gemma":[0.0018960431,0.000124048,0.0027507194,0.0031083254,0.0011813816,0.000013672079,0.0009063376,0.73626244,0.0070431447,0.2264423,0.01795697,0.002314612],"about_ca_topic_score_codex":0.00014769155,"about_ca_topic_score_gemma":0.000023901797,"teacher_disagreement_score":0.046869375,"about_ca_system_score_codex":0.00009396405,"about_ca_system_score_gemma":0.00004980264,"threshold_uncertainty_score":0.9998805},"labels":[],"label_agreement":null},{"id":"W4415368266","doi":"10.1109/isit63088.2025.11195519","title":"Design and Decoding of Full-Diversity Construction-D Lattices on Block-Fading Channels","year":2025,"lang":"","type":"article","venue":"","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 British Columbia, Okanagan Campus","funders":"","keywords":"Decoding methods; Lattice (music); Fading; Algebraic number; Coding (social sciences); Error detection and correction; Prime (order theory); Coding gain; Reliability (semiconductor)","score_opus":0.017793691077933743,"score_gpt":0.21562753074977026,"score_spread":0.19783383967183651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368266","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.882471,0.00086502166,0.0975057,0.00006057758,0.0025001788,0.00042724315,0.0000056584236,0.0001160376,0.016048538],"genre_scores_gemma":[0.9966366,0.00017959377,0.0026867134,0.000021765642,0.00004520745,0.000003940845,4.1246759e-7,0.000010971616,0.00041476492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874115,0.00014606811,0.00038833573,0.00030091265,0.0001387863,0.00028476387],"domain_scores_gemma":[0.99898463,0.0005575348,0.00009969096,0.00021054801,0.00006381422,0.00008377592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006152336,0.00024931834,0.00039663544,0.00036946082,0.0004414292,0.00006179052,0.00017078144,0.0001814496,0.00013178804],"category_scores_gemma":[0.000040669387,0.00026480563,0.000087247565,0.00041080554,0.00015570091,0.00017262598,0.00015515229,0.00018690892,0.000010146968],"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.00062451366,0.00014852155,0.012007509,0.003551924,0.0021279873,0.000024715493,0.009437535,0.37178558,0.03989472,0.54384923,0.0005311313,0.016016673],"study_design_scores_gemma":[0.004865751,0.00085685577,0.0013168363,0.0059045814,0.0011956374,0.00016046241,0.018840482,0.6759219,0.25562486,0.032681707,0.0007285956,0.0019023339],"about_ca_topic_score_codex":0.000029259014,"about_ca_topic_score_gemma":0.0000027920698,"teacher_disagreement_score":0.51116747,"about_ca_system_score_codex":0.000042343767,"about_ca_system_score_gemma":0.000019380655,"threshold_uncertainty_score":0.9999804},"labels":[],"label_agreement":null},{"id":"W4415403472","doi":"10.22331/q-2025-10-21-1890","title":"A Mathematical Structure for Amplitude-Mixing Error-Transparent Gates for Binomial Codes","year":2025,"lang":"en","type":"article","venue":"Quantum","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":"Université de Sherbrooke","funders":"","keywords":"Quantum error correction; Error detection and correction; Qubit; Quantum information; Quantum; Realization (probability); Quantum computer; Binomial (polynomial)","score_opus":0.023604531778119747,"score_gpt":0.27648194829348427,"score_spread":0.25287741651536455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415403472","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.5044777,0.0004906604,0.49172214,0.00010455826,0.0011187966,0.0009397062,0.00025852295,0.0003172644,0.0005706892],"genre_scores_gemma":[0.99824315,0.0000027735991,0.001270216,0.000024712524,0.000094199735,0.0002059588,0.000029826318,0.000025984917,0.000103201266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923486,0.000014628457,0.00026062856,0.00015797881,0.000060111153,0.0002717905],"domain_scores_gemma":[0.9994908,0.00024656657,0.000020808893,0.00017114023,0.00002868843,0.000041981348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014647286,0.00015650147,0.00026730626,0.000070614115,0.000097109434,0.00004537879,0.00014459835,0.00009992943,0.000024000761],"category_scores_gemma":[0.000034391145,0.00013820532,0.00013603304,0.00008519847,0.00003020754,0.00004555711,0.000007730235,0.000073529765,0.000004057706],"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.000091399386,0.000027217779,0.00013778797,0.0024360702,0.00017931762,7.8640267e-7,0.00071017386,0.0037153095,0.023079926,0.9665612,0.0024414915,0.0006193012],"study_design_scores_gemma":[0.0013502894,0.00010098077,0.00028370938,0.0004355244,0.00013782183,0.000005505918,0.00080747146,0.2255717,0.022477468,0.73207927,0.016317304,0.00043296334],"about_ca_topic_score_codex":0.0000016291528,"about_ca_topic_score_gemma":0.000009512419,"teacher_disagreement_score":0.49376547,"about_ca_system_score_codex":0.000025376714,"about_ca_system_score_gemma":0.000012085522,"threshold_uncertainty_score":0.5635849},"labels":[],"label_agreement":null},{"id":"W4415428023","doi":"10.3233/faia251259","title":"EFX Orientations of Multigraphs","year":2025,"lang":"","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","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 Victoria","funders":"","keywords":"Multigraph; Multiplicity (mathematics); Simple (philosophy); Orientation (vector space); Focus (optics)","score_opus":0.02070287606172763,"score_gpt":0.25121927087855317,"score_spread":0.23051639481682554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415428023","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.00033491012,0.0057023037,0.90359014,0.000068464,0.0012971542,0.001824444,0.00033755074,0.00007100231,0.08677403],"genre_scores_gemma":[0.9657805,0.010626557,0.012074281,0.00004194131,0.0002913826,0.001088134,0.00015468943,0.00008903214,0.009853457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750227,0.000035349112,0.001386445,0.00056822033,0.0001875534,0.0003201889],"domain_scores_gemma":[0.998743,0.00016160966,0.00024933793,0.0005844782,0.00014229995,0.00011930129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028609938,0.00042893842,0.0006743709,0.00093067787,0.00022473853,0.000048694565,0.00037717022,0.00043142238,0.00011647191],"category_scores_gemma":[0.000024040017,0.000517452,0.00021778932,0.00057401025,0.00061583857,0.000113246526,0.00006004099,0.0004853529,0.000031954398],"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.000026504473,0.000068031135,0.00028210317,0.00030154636,0.00011624501,0.0000010576612,0.00057872146,0.0023296387,0.00014883866,0.8076277,0.00019767128,0.18832195],"study_design_scores_gemma":[0.00006226484,0.00007108105,0.000059565886,0.00084849907,0.00023671208,0.0000024597848,0.004622649,0.018093444,0.0058770347,0.90878624,0.06060774,0.00073234044],"about_ca_topic_score_codex":0.00006172972,"about_ca_topic_score_gemma":0.00007889647,"teacher_disagreement_score":0.96544564,"about_ca_system_score_codex":0.000051883235,"about_ca_system_score_gemma":0.000056919573,"threshold_uncertainty_score":0.9997277},"labels":[],"label_agreement":null},{"id":"W4415590863","doi":"10.1007/s00037-025-00278-3","title":"Separation of the Factorization Norm and Randomized Communication Complexity","year":2025,"lang":"en","type":"article","venue":"Computational Complexity","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria; Island Health; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Communication complexity; Upper and lower bounds; Randomized algorithm; Norm (philosophy); Conjecture; Nondeterministic algorithm; Logarithm; Factorization; Boolean function","score_opus":0.02315802691439623,"score_gpt":0.2658649143461981,"score_spread":0.24270688743180185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415590863","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.68748534,0.00040906656,0.30024657,0.00026467195,0.0003779063,0.0006586298,0.000038419683,0.00013299916,0.010386429],"genre_scores_gemma":[0.9985272,0.0000070360147,0.0012654178,0.000042380118,0.000010542253,0.000018041224,0.00008500578,0.000005450678,0.00003891221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990805,0.00028559403,0.00033306,0.000093456336,0.00013388364,0.000073505515],"domain_scores_gemma":[0.99920684,0.0003604894,0.000084325635,0.00020449322,0.00012511648,0.000018753848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037594186,0.000098608034,0.00024885553,0.000065669694,0.00018869006,0.000026763353,0.00016851566,0.000043277392,0.000015809177],"category_scores_gemma":[0.000053967535,0.000079874255,0.00007502589,0.00026400737,0.00043038442,0.00009304271,0.00005666012,0.00009699944,0.000001837231],"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.00029539308,0.000020536914,0.001677878,0.000107281485,0.00006631944,2.448508e-8,0.0003687508,0.058929544,0.00019779064,0.93787116,0.0002274604,0.00023788949],"study_design_scores_gemma":[0.0052240044,0.000003618843,0.05714762,0.000050609975,0.000022427132,0.0000012164925,0.00003832514,0.33263913,0.00028637616,0.6043698,0.00014367793,0.00007314777],"about_ca_topic_score_codex":0.000021435251,"about_ca_topic_score_gemma":0.000028618319,"teacher_disagreement_score":0.33350128,"about_ca_system_score_codex":0.00003120942,"about_ca_system_score_gemma":0.000019806528,"threshold_uncertainty_score":0.32571775},"labels":[],"label_agreement":null},{"id":"W4415628587","doi":"10.1007/s10801-025-01471-x","title":"Super-simple directed group divisible designs with block size four and coding theory applications","year":2025,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Combinatorial design; Block size; Block (permutation group theory); Set (abstract data type); Coding (social sciences); Coding theory","score_opus":0.0072743820849405895,"score_gpt":0.19992714198945732,"score_spread":0.19265275990451675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415628587","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.95586145,0.0020291249,0.03740597,0.00009720445,0.0005686219,0.00032435035,0.0000046233645,0.00017650299,0.0035321575],"genre_scores_gemma":[0.9993503,0.00017275017,0.00022514563,0.000026180844,0.00004591574,0.000017101811,5.3895593e-7,0.000024748397,0.00013728334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990411,0.00008547248,0.0003718689,0.00011450619,0.00018206102,0.00020498938],"domain_scores_gemma":[0.99868196,0.0006979755,0.00013118815,0.00024784784,0.00013341283,0.000107601634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060523854,0.00016743086,0.00030927613,0.00016316223,0.0002398893,0.00011367062,0.00026786362,0.000079060585,0.000011349984],"category_scores_gemma":[0.000104059676,0.00014015769,0.00007156206,0.00047716015,0.000060809056,0.00018843815,0.00004404041,0.00029103758,0.000001358514],"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.00008195741,0.00014288882,0.013771079,0.00036221195,0.00053247146,0.000036767455,0.00041525468,0.0002502789,0.0050181765,0.9758715,0.0011566721,0.0023607202],"study_design_scores_gemma":[0.0035675436,0.00044668143,0.044322673,0.0004950594,0.000414899,0.00034081718,0.0011373657,0.0013634438,0.003601428,0.93525237,0.0084366035,0.0006210933],"about_ca_topic_score_codex":0.0000022306347,"about_ca_topic_score_gemma":0.00000337066,"teacher_disagreement_score":0.043488894,"about_ca_system_score_codex":0.00006240531,"about_ca_system_score_gemma":0.000032125685,"threshold_uncertainty_score":0.57154644},"labels":[],"label_agreement":null},{"id":"W4415667431","doi":"10.55016/ojs/cdm.v20i2.76082","title":"On a construction of self-orthogonal codes from orbit matrices of 2-designs","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orbit (dynamics); Construct (python library); Point (geometry); Matrix (chemical analysis); Block code; Linear code","score_opus":0.006254058590538595,"score_gpt":0.2414348782628296,"score_spread":0.235180819672291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667431","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.67859656,0.0003017596,0.31371212,0.000050172566,0.0002560688,0.00039657278,0.00156311,0.00017937666,0.0049442397],"genre_scores_gemma":[0.9922132,0.000015742904,0.007636409,0.0000074080044,0.000018042101,0.00003470953,0.000031722928,0.000010770567,0.00003201832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907607,0.000041315605,0.00048321811,0.00011008628,0.0001407556,0.00014853053],"domain_scores_gemma":[0.9989908,0.00042702458,0.000099080054,0.00028893378,0.00014532483,0.00004885688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020540647,0.0001384276,0.00036724718,0.00019491464,0.000056321653,0.000016006228,0.00015409592,0.000087698114,0.000048456015],"category_scores_gemma":[0.00015840544,0.00012750516,0.000109822526,0.00042794712,0.000059323564,0.000046589954,0.000024339197,0.00008434236,0.000016865244],"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.000018860148,0.00007675859,0.00015789861,0.00037259172,0.00027965975,9.781509e-7,0.0005048703,0.0020942313,0.00965866,0.98619825,0.00047618226,0.00016104788],"study_design_scores_gemma":[0.0015962315,0.00022881042,0.0011957325,0.0025194762,0.0007010892,0.000012331305,0.002297907,0.04277004,0.19550744,0.7514515,0.0011081189,0.00061133545],"about_ca_topic_score_codex":0.0000063262264,"about_ca_topic_score_gemma":0.000004386415,"teacher_disagreement_score":0.3136166,"about_ca_system_score_codex":0.000046817266,"about_ca_system_score_gemma":0.00003123425,"threshold_uncertainty_score":0.5199509},"labels":[],"label_agreement":null},{"id":"W4415683583","doi":"10.1142/s1793830925501563","title":"Orthogonal Latin squares of order 10 with two relations: A SAT investigation","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","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 Windsor; Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Solver; Enumeration; Satisfiability; Orthogonal array; Correctness; Boolean satisfiability problem; Simple (philosophy); Relation (database)","score_opus":0.007072878004715721,"score_gpt":0.22397373028427445,"score_spread":0.21690085227955871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415683583","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.14028019,0.00065492856,0.8299098,0.0001506189,0.00003569558,0.0010625038,0.00011351896,0.00023205613,0.027560696],"genre_scores_gemma":[0.95131594,0.000019982057,0.046993867,0.0000139454205,0.000025488964,0.0005056733,0.00009100416,0.00002317662,0.0010109066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993936,0.000012053662,0.0002811345,0.000120429904,0.00009682269,0.00009597137],"domain_scores_gemma":[0.99949604,0.00010189672,0.00006512763,0.00021631236,0.000081756676,0.000038843675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011910612,0.000115384435,0.00015997553,0.00012631011,0.00010055936,0.000029764764,0.00007567538,0.000043014323,0.000026226424],"category_scores_gemma":[0.000010626979,0.000095425865,0.000026407619,0.0005825695,0.00009574247,0.00006566672,0.0000162617,0.00007056129,0.000009466941],"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.0000032315618,0.000031742213,0.0008714896,0.00040800206,0.000106172054,1.4682755e-7,0.0007963456,0.0045144274,0.00075822946,0.9901113,0.00012775837,0.0022711903],"study_design_scores_gemma":[0.0015144182,0.0000957938,0.004586031,0.000835707,0.00037810247,0.000011236229,0.0035796713,0.5175354,0.002520107,0.4572801,0.010960638,0.0007028221],"about_ca_topic_score_codex":0.0000042675906,"about_ca_topic_score_gemma":0.000010369942,"teacher_disagreement_score":0.81103575,"about_ca_system_score_codex":0.000008144669,"about_ca_system_score_gemma":0.000020208967,"threshold_uncertainty_score":0.3891354},"labels":[],"label_agreement":null},{"id":"W4416079062","doi":"10.61091/jcmcc128-16","title":"Strong complete mappings – existence and applications","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Abelian group; Set (abstract data type); Cayley graph; Algebra over a field; Substitution (logic); Finite set","score_opus":0.013144527311373163,"score_gpt":0.23821844057987843,"score_spread":0.22507391326850526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416079062","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.72507894,0.023815753,0.14909075,0.0004970513,0.07482282,0.0028995462,0.00003953099,0.00024179138,0.0235138],"genre_scores_gemma":[0.99535257,0.00037383244,0.002447313,0.000021877651,0.0017067689,0.000009134133,0.0000014725507,0.000054605465,0.000032433836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589694,0.00020082493,0.0023201813,0.00038606543,0.00060366094,0.00059231627],"domain_scores_gemma":[0.9960401,0.0012505634,0.0012750853,0.00044169527,0.00065627624,0.00033628647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023664164,0.0006148127,0.0015572631,0.0005149121,0.00068440917,0.00061930675,0.00065215223,0.00037162108,0.000007763731],"category_scores_gemma":[0.00022952043,0.00063440594,0.00029000765,0.0007534847,0.00031685008,0.000310139,0.00040308177,0.0010595666,0.0000034010943],"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.00006373733,0.00030355883,0.00014641049,0.002308345,0.00047522417,0.000013716155,0.0011456916,0.00008587114,0.00081048143,0.99071354,0.00012554231,0.0038078565],"study_design_scores_gemma":[0.0051150504,0.00048293866,0.00012904267,0.0030176623,0.0005253993,0.00017825661,0.0021003322,0.020314598,0.0002331005,0.95636785,0.010903536,0.00063222664],"about_ca_topic_score_codex":0.000009053847,"about_ca_topic_score_gemma":2.9499867e-7,"teacher_disagreement_score":0.27027363,"about_ca_system_score_codex":0.00014563698,"about_ca_system_score_gemma":0.0001687746,"threshold_uncertainty_score":0.9996107},"labels":[],"label_agreement":null},{"id":"W4417409221","doi":"10.48550/arxiv.2509.02731","title":"On circular external difference families","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; European Commission; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Multiset; Construct (python library); Cyclic group; Order (exchange); Group (periodic table); Variation (astronomy)","score_opus":0.03144044712504589,"score_gpt":0.15311908818104497,"score_spread":0.12167864105599908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417409221","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.9065725,0.00021416225,0.06666277,0.0000024552003,0.0012837222,0.00018333692,0.000053413976,0.00042193112,0.024605704],"genre_scores_gemma":[0.99628985,0.0002576712,0.000013518663,0.000024763036,0.000051117866,0.0000015711747,0.000010288393,0.000017877544,0.0033333146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989942,0.00007786595,0.00014338475,0.0004762865,0.000059757353,0.0002485586],"domain_scores_gemma":[0.99906063,0.000083747815,0.000046451263,0.00068821944,0.000034775556,0.000086183194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000088843546,0.00031087102,0.00030929,0.00029400055,0.00007415617,0.000037108995,0.0005988598,0.00028091512,0.000050569834],"category_scores_gemma":[0.0000112671905,0.00036279822,0.00021678043,0.000250459,0.00006234334,0.000042788073,0.0002182637,0.0005712442,0.00008165176],"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.000027016242,0.000032951048,0.0016609794,0.0005138599,0.00016414834,0.0001862424,0.00015594615,0.7241387,0.000298812,0.2723057,0.00013650197,0.0003791553],"study_design_scores_gemma":[0.0011245088,0.00008275447,0.010644283,0.0025602248,0.00033986356,0.0000075890916,0.00049797684,0.47035176,0.0018358859,0.509299,0.0014046506,0.0018515432],"about_ca_topic_score_codex":0.00004238462,"about_ca_topic_score_gemma":0.0000098904,"teacher_disagreement_score":0.25378692,"about_ca_system_score_codex":0.000121013356,"about_ca_system_score_gemma":0.000029873338,"threshold_uncertainty_score":0.9998824},"labels":[],"label_agreement":null},{"id":"W45017458","doi":"","title":"On 2-Factors with Quadrilaterals Containing Specified Vertices in a Bipartite Graph.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Quadrilateral; Complete bipartite graph; Combinatorics; Graph; Structural engineering; Engineering","score_opus":0.010930092718626423,"score_gpt":0.21220099067908124,"score_spread":0.20127089796045483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45017458","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.9899546,0.000106787404,0.000025008705,0.00000555223,0.0012263012,0.00016231347,0.0000013151529,0.000205341,0.008312797],"genre_scores_gemma":[0.999888,0.0000055046867,0.000010658484,0.00002207878,0.000007225393,0.000009353225,0.0000037016648,0.000033885637,0.000019611814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998948,0.00004033869,0.0002753604,0.00017940097,0.00017109029,0.0003858239],"domain_scores_gemma":[0.9994049,0.0002086957,0.000037842434,0.00023109493,0.00001886856,0.00009861588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041254816,0.00019524053,0.0002419028,0.00023065326,0.00004918192,0.000037988448,0.0001378812,0.00008360136,0.00003196928],"category_scores_gemma":[0.000014964594,0.00016465291,0.000046029058,0.00042988392,0.000033884095,0.00014629791,0.000009147842,0.00019659895,0.00003191409],"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.00045212696,0.00010275624,0.12993331,0.00006207382,0.000098608434,0.00014205043,0.003968266,0.0011013901,0.0048247706,0.8590253,0.00014055765,0.00014882277],"study_design_scores_gemma":[0.008000814,0.0018193643,0.40475798,0.001131398,0.0000627917,0.000024118619,0.004718606,0.0010191948,0.17022122,0.40396366,0.0022632787,0.0020175576],"about_ca_topic_score_codex":0.000034885306,"about_ca_topic_score_gemma":0.00010148498,"teacher_disagreement_score":0.4550616,"about_ca_system_score_codex":0.000051239153,"about_ca_system_score_gemma":0.0000056443896,"threshold_uncertainty_score":0.67143506},"labels":[],"label_agreement":null},{"id":"W45661086","doi":"","title":"Finite Linear Spaces With Four More Lines Than Points.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009353248580632405,"score_gpt":0.20319063039886534,"score_spread":0.19383738181823293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45661086","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.99509007,0.00024245518,0.000192598,0.00018064794,0.0013886807,0.0001470214,0.0000055558853,0.00043804102,0.0023149492],"genre_scores_gemma":[0.9994022,0.00001905982,0.00028204313,0.000035780817,0.000033490487,0.000020388396,0.0000068865984,0.00004954346,0.00015061155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.000021295573,0.00015915562,0.00016583748,0.00016609584,0.00026402483],"domain_scores_gemma":[0.99947345,0.000047664504,0.00003237615,0.00030305135,0.000047458892,0.00009599233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012592497,0.0001983233,0.000202931,0.00007880993,0.00007406391,0.00003828348,0.00018208181,0.00008776746,0.000016143533],"category_scores_gemma":[0.000021216822,0.00016638843,0.0000598737,0.0002751373,0.0000495534,0.00014282682,0.000019722002,0.00017010521,0.00011557775],"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.000113689275,0.00019412374,0.018848822,0.00043641683,0.00041345294,0.00029722464,0.003925494,0.07056117,0.0017230214,0.90215176,0.00087082025,0.00046399343],"study_design_scores_gemma":[0.008676837,0.0008587754,0.009785609,0.0012556938,0.00015378548,0.00018703897,0.0024529528,0.008834651,0.038812418,0.9141545,0.012703096,0.002124645],"about_ca_topic_score_codex":0.000027205295,"about_ca_topic_score_gemma":0.000015239829,"teacher_disagreement_score":0.06172652,"about_ca_system_score_codex":0.000023320963,"about_ca_system_score_gemma":0.000016283806,"threshold_uncertainty_score":0.67851233},"labels":[],"label_agreement":null},{"id":"W47163984","doi":"","title":"On the Symmetry Groups of Hypergraphs of Perfect Cwatsets.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Symmetry (geometry); Pure mathematics; Combinatorics; Geometry","score_opus":0.004793500089538844,"score_gpt":0.17670995599839498,"score_spread":0.17191645590885613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47163984","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.96761006,0.00034647793,8.6333154e-7,0.000013864306,0.0007270813,0.00011343541,0.0000062456033,0.00006233398,0.031119667],"genre_scores_gemma":[0.99982566,0.000039775354,0.000003278032,0.000016822902,0.000004001662,0.000010556043,0.0000016983669,0.000020336673,0.0000778958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930525,0.00007683066,0.00022069261,0.00009418084,0.00015668264,0.0001463636],"domain_scores_gemma":[0.99933773,0.0002121602,0.000032257718,0.0003652425,0.000020635454,0.000031959542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026506043,0.00011839601,0.00020559008,0.00006678641,0.000039032017,0.000005420499,0.0002244449,0.000056582714,0.0002501307],"category_scores_gemma":[0.000017674236,0.00008679744,0.000119868964,0.00031209897,0.00006609756,0.000039068902,0.000008298201,0.00012742492,0.00004430881],"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.00001979643,0.00005882112,0.0007566697,0.00006732375,0.000070868766,0.0000014776035,0.00027863018,0.0003895557,0.0030925698,0.9933049,0.0010810621,0.0008783446],"study_design_scores_gemma":[0.0009994954,0.0003978105,0.005759225,0.00022455855,0.00005475386,0.000011143358,0.00027760424,0.0014258376,0.05258518,0.93612164,0.0017960741,0.00034669915],"about_ca_topic_score_codex":0.000011882495,"about_ca_topic_score_gemma":6.4828384e-7,"teacher_disagreement_score":0.057183266,"about_ca_system_score_codex":0.000010523609,"about_ca_system_score_gemma":0.000004297985,"threshold_uncertainty_score":0.3539497},"labels":[],"label_agreement":null},{"id":"W48132171","doi":"","title":"A direct construction of transversal covers using group divisible designs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transversal (combinatorics); Mathematics; Group (periodic table); Pure mathematics; Mathematical analysis; Physics","score_opus":0.017915168625932065,"score_gpt":0.1950306630076919,"score_spread":0.17711549438175983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48132171","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.9877422,0.00038440534,0.0007900453,0.0000022166626,0.002170822,0.00012135927,0.000006824615,0.0001674163,0.008614704],"genre_scores_gemma":[0.999693,0.000031434465,0.00022254474,0.0000028315235,0.000006224714,0.000004384834,0.0000015755706,0.000022485163,0.000015553576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932784,0.000054309192,0.00019897798,0.00011282082,0.00012925235,0.00017677672],"domain_scores_gemma":[0.9996789,0.000052208932,0.000036789468,0.00016045252,0.000020147201,0.00005150676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013001513,0.000120700075,0.00020272794,0.000088250345,0.000052852865,0.000014092969,0.00009343759,0.00007625893,0.00009037653],"category_scores_gemma":[0.0000074225068,0.00013343814,0.00008231613,0.00026634667,0.000064062246,0.00015440305,0.0000061105543,0.00008061371,0.000012328029],"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.000040289757,0.00016258513,0.0059368336,0.00032561072,0.0003568439,0.000019948211,0.0019808214,0.0085990485,0.1972735,0.7821785,0.00091908814,0.002206906],"study_design_scores_gemma":[0.011270336,0.0009192895,0.0030078427,0.00088389363,0.0005799866,0.00021223925,0.0021812944,0.2324836,0.4213855,0.3190002,0.0053823455,0.002693452],"about_ca_topic_score_codex":0.000020943096,"about_ca_topic_score_gemma":0.0000011072656,"teacher_disagreement_score":0.4631783,"about_ca_system_score_codex":0.00004085062,"about_ca_system_score_gemma":0.0000030099873,"threshold_uncertainty_score":0.5441449},"labels":[],"label_agreement":null},{"id":"W50494007","doi":"10.46298/dmtcs.3432","title":"Color critical hypergraphs and forbidden configurations","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Combinatorics; Mathematics; Simple (philosophy); Matrix (chemical analysis); Permutation (music); Upper and lower bounds; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.008544014444155194,"score_gpt":0.23904298060786963,"score_spread":0.23049896616371443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50494007","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.24340743,0.00013342394,0.72480106,0.00058965234,0.00036255785,0.0002670801,0.000013277672,0.000360474,0.030065017],"genre_scores_gemma":[0.9469234,0.0000064650535,0.052832387,0.000092101494,0.000102282094,0.000017654049,0.0000010897342,0.000016939148,0.000007675474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987018,0.000030383391,0.00029687685,0.00025953952,0.00031455513,0.00039680648],"domain_scores_gemma":[0.9989826,0.0003509951,0.000019240604,0.00033206612,0.00007379027,0.000241285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061637274,0.00017772162,0.00021634462,0.00011553912,0.00029232784,0.00027208927,0.0003990491,0.00005811404,0.000105598876],"category_scores_gemma":[0.000091629256,0.00014400386,0.00005686393,0.000332509,0.0023794947,0.00030397502,0.000100428144,0.00013989786,0.00006362987],"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.0000014504037,0.000020594558,0.0000055296696,0.000052109164,0.0000070416277,0.0000020054172,0.0008453641,0.0001995726,0.0027192098,0.9949685,0.00005280483,0.0011258186],"study_design_scores_gemma":[0.00010871321,0.00005051555,0.000047528953,0.000054013937,0.000017170061,0.00006272757,0.00013160355,0.73342884,0.0021875277,0.2634576,0.00024654437,0.00020721037],"about_ca_topic_score_codex":2.3840809e-7,"about_ca_topic_score_gemma":6.6100864e-7,"teacher_disagreement_score":0.7332293,"about_ca_system_score_codex":0.000016662974,"about_ca_system_score_gemma":0.000014913847,"threshold_uncertainty_score":0.87673473},"labels":[],"label_agreement":null},{"id":"W50680129","doi":"","title":"On H-chromatic uniqeness of two linear uniform cycles having some edges in common.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.009732626660648884,"score_gpt":0.23853471880727378,"score_spread":0.2288020921466249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50680129","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.99481976,0.00023417357,0.000041907937,0.00000579611,0.0013602634,0.00014322701,0.00000268147,0.000114601375,0.0032775595],"genre_scores_gemma":[0.999862,0.0000101003125,0.000041908337,0.00001160947,0.000010903041,0.0000063037787,0.0000039929937,0.00003199234,0.000021195992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990038,0.000044071876,0.00040227882,0.0001169944,0.00015831122,0.0002744873],"domain_scores_gemma":[0.9992939,0.00026251818,0.000057327346,0.00030324148,0.000021338656,0.00006166829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061477814,0.00015963451,0.0003058375,0.00022088978,0.00003960947,0.0000104483515,0.00021621659,0.00008419112,0.0000107683745],"category_scores_gemma":[0.000018990739,0.00016214688,0.00005699103,0.00031380448,0.0000471885,0.00013446414,0.000026539383,0.00018138433,0.000029807848],"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.000016605503,0.000105882915,0.008966164,0.0002216934,0.000029463774,0.000026476037,0.00061489025,0.004748641,0.003668827,0.980658,0.000040530136,0.0009028382],"study_design_scores_gemma":[0.0017525152,0.000119746364,0.020455427,0.0006461327,0.000017611736,0.000008192802,0.00058786134,0.004977118,0.07527371,0.8956988,0.000075054304,0.00038786404],"about_ca_topic_score_codex":0.00003737604,"about_ca_topic_score_gemma":0.000039857776,"teacher_disagreement_score":0.08495922,"about_ca_system_score_codex":0.0000655436,"about_ca_system_score_gemma":0.000008527709,"threshold_uncertainty_score":0.6612158},"labels":[],"label_agreement":null},{"id":"W52999166","doi":"","title":"Path Decompositions of lKn, n.","year":2007,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Path (computing); Mathematics; Arithmetic; Computer science; Operating system","score_opus":0.006374199842404352,"score_gpt":0.21563062262925406,"score_spread":0.2092564227868497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52999166","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.95660794,0.0013977514,0.00053250685,0.00002526846,0.0071571055,0.00024160599,0.000029214301,0.00013807032,0.033870514],"genre_scores_gemma":[0.9995052,0.000045944016,0.000119541146,0.000015518484,0.00002634571,0.000005983159,0.0000131999695,0.000047736583,0.00022052487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841416,0.00007712266,0.00060376094,0.00021110788,0.00024322834,0.0004505948],"domain_scores_gemma":[0.9988919,0.00022389821,0.00012354617,0.00048407188,0.00010230233,0.00017431137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079518434,0.00024315141,0.0003730545,0.0001751009,0.00011243585,0.00002456159,0.00027970964,0.0002128806,0.00013198605],"category_scores_gemma":[0.000026929009,0.00027917585,0.00019406795,0.0004850321,0.00008221199,0.00011822577,0.000045521567,0.0002692618,0.00017572046],"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.000027976817,0.00020864469,0.003688152,0.00024672854,0.00016394448,0.000036264548,0.00087975786,0.00012784492,0.011493487,0.9814403,0.0012289783,0.0004579439],"study_design_scores_gemma":[0.0035314134,0.000641037,0.042129856,0.0012577054,0.00033198527,0.000080147984,0.0017141962,0.0013401669,0.080909304,0.8558071,0.010930784,0.0013262776],"about_ca_topic_score_codex":0.00003843115,"about_ca_topic_score_gemma":0.0000048712113,"teacher_disagreement_score":0.12563315,"about_ca_system_score_codex":0.00007112113,"about_ca_system_score_gemma":0.000024241326,"threshold_uncertainty_score":0.999966},"labels":[],"label_agreement":null},{"id":"W54024878","doi":"","title":"Existence of HSOLSSOMs with type h n and 1 n u 1 .","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Pure mathematics; Combinatorics; Geology; Paleontology","score_opus":0.005438531868843801,"score_gpt":0.17781141596049524,"score_spread":0.17237288409165144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54024878","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.98066956,0.00039723946,0.0000014194154,0.0000033103079,0.00023620184,0.000049060334,0.0000010301895,0.00006437108,0.018577816],"genre_scores_gemma":[0.9996312,0.000047916034,0.000042883847,0.0000045396346,0.0000021987678,0.0000030228405,8.7407903e-7,0.000011024823,0.0002563103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968606,0.000011990687,0.00008322959,0.00006718561,0.000061423074,0.000090126996],"domain_scores_gemma":[0.99978364,0.000017821725,0.000010072674,0.00013254926,0.000021860886,0.000034053504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005414097,0.00006496349,0.0001018533,0.000018397322,0.00001876688,0.000006348828,0.000060515755,0.000030255916,0.000072647046],"category_scores_gemma":[0.000002833773,0.000055447308,0.000009184231,0.00016692086,0.00003934316,0.00005324552,0.0000039418414,0.00004728556,0.000018529034],"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.00009642344,0.000054007203,0.012123917,0.00022143725,0.0001059987,0.000017546954,0.0011112426,0.00043358558,0.0038004236,0.9745334,0.00065084395,0.00685119],"study_design_scores_gemma":[0.004468817,0.00159821,0.057785362,0.0006873498,0.00011601151,0.00018019702,0.0006827251,0.0038383906,0.03854066,0.86748123,0.02324067,0.00138035],"about_ca_topic_score_codex":0.0000071199256,"about_ca_topic_score_gemma":0.0000012679561,"teacher_disagreement_score":0.10705213,"about_ca_system_score_codex":0.0000043924956,"about_ca_system_score_gemma":0.00000394005,"threshold_uncertainty_score":0.22610755},"labels":[],"label_agreement":null},{"id":"W55585612","doi":"","title":"On the Non-Existence of (g, g\\lambda-1;lambda)-Difference matrices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lambda; Mathematics; Pure mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.011237856145784781,"score_gpt":0.1841631365943014,"score_spread":0.1729252804485166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55585612","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.95815045,0.00044195572,0.000021321172,0.000050687704,0.00162842,0.00018437853,0.0000046146565,0.00012519679,0.03939297],"genre_scores_gemma":[0.9993458,0.00007391052,0.00001227438,0.0000350085,0.000009424921,0.00002616572,8.251157e-7,0.000023794817,0.00047280514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990565,0.000051955474,0.00025397353,0.0001548338,0.00023935681,0.00024336546],"domain_scores_gemma":[0.9990877,0.0002458337,0.000062589104,0.00050835003,0.00003825287,0.000057302903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020431417,0.00017354771,0.00021518856,0.000067063855,0.00008245381,0.000024874405,0.00043416335,0.00008232406,0.00017768546],"category_scores_gemma":[0.000035470926,0.00012929499,0.000088724424,0.00035392563,0.000071937866,0.00005845245,0.00002935641,0.0002060382,0.0002249094],"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.0000060083185,0.000067743335,0.0005981321,0.000090348636,0.000041774576,0.0000068240456,0.0006453926,0.00016314992,0.002308841,0.9911845,0.0042554904,0.00063182914],"study_design_scores_gemma":[0.0013526522,0.00039650418,0.009437024,0.0004796896,0.00006050639,0.000021803822,0.0004847295,0.028136568,0.025319668,0.93132097,0.0021648158,0.0008250873],"about_ca_topic_score_codex":0.000008712638,"about_ca_topic_score_gemma":9.347593e-7,"teacher_disagreement_score":0.059863515,"about_ca_system_score_codex":0.000025310557,"about_ca_system_score_gemma":0.000003543904,"threshold_uncertainty_score":0.5272497},"labels":[],"label_agreement":null},{"id":"W5642064","doi":"10.1016/s0002-7138(09)61534-x","title":"Halving complete 4-partite graphs","year":2000,"lang":"sv","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spectrum (functional analysis); Set (abstract data type); Finite set; Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.009989280154877843,"score_gpt":0.20194056415638015,"score_spread":0.1919512840015023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5642064","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.92894804,0.003296056,0.0000049499954,0.00008749294,0.0067937705,0.0003509594,0.000042542466,0.0004899331,0.05998627],"genre_scores_gemma":[0.9968078,0.00029258186,0.000037786976,0.000088176435,0.00004160596,0.000034818342,0.00002338347,0.00011512439,0.0025587338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973029,0.00024967725,0.0006746006,0.0004995336,0.00037473507,0.0008985822],"domain_scores_gemma":[0.9985174,0.0001598824,0.00008630129,0.0008672097,0.00005937036,0.0003098277],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00050741766,0.0005180096,0.0006015506,0.00017875995,0.00035437365,0.00019202918,0.00054773974,0.0002755317,0.0034698946],"category_scores_gemma":[0.000021493217,0.0005969203,0.00033623443,0.0007352831,0.000140864,0.00032021027,0.00004765135,0.0005255566,0.004021727],"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.000047362653,0.00015125182,0.003019557,0.00027201226,0.00032709623,0.00009126234,0.001405276,0.0011922388,0.0029344151,0.9797814,0.006053998,0.0047241542],"study_design_scores_gemma":[0.002848917,0.00026266853,0.010581181,0.0007821697,0.00021684801,0.00008112277,0.00032264352,0.008335842,0.0013632,0.82408625,0.14942794,0.0016912208],"about_ca_topic_score_codex":0.00009727814,"about_ca_topic_score_gemma":0.000008911877,"teacher_disagreement_score":0.15569513,"about_ca_system_score_codex":0.00008262042,"about_ca_system_score_gemma":0.000024082867,"threshold_uncertainty_score":0.9996482},"labels":[],"label_agreement":null},{"id":"W56528681","doi":"","title":"Some Classes of Extended Meldelsohn Triple Systems and Numbers of Common Blocks.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.00830150240946874,"score_gpt":0.2123668151098502,"score_spread":0.20406531270038145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56528681","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.9899381,0.0037919807,0.000006796619,0.0000065273734,0.0022107845,0.00019293689,0.000008879726,0.00009969779,0.003744329],"genre_scores_gemma":[0.99950856,0.00028506285,0.000008319981,0.0000030316173,0.000011948416,0.000014399816,0.0000034515574,0.000023803535,0.00014141844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905705,0.00006711394,0.00039883796,0.0001252212,0.00016305022,0.00018872281],"domain_scores_gemma":[0.99940306,0.00009801113,0.00009462015,0.0002878908,0.000044963574,0.000071434966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002488953,0.00014703594,0.00041495293,0.0000980053,0.000033306245,0.000013277141,0.00015037341,0.00010582612,0.000009375512],"category_scores_gemma":[0.000014396535,0.00014734741,0.00006453362,0.0002240387,0.00007280525,0.00013083368,0.000024332927,0.00010293404,0.0000029305022],"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.00004840198,0.00016320428,0.012181441,0.00061079673,0.00021230371,0.000016608763,0.0005994405,0.00063821394,0.009397473,0.9741642,0.00159485,0.00037306547],"study_design_scores_gemma":[0.008755886,0.0008835978,0.018912459,0.0012576337,0.00032327673,0.00025324372,0.004492532,0.016964113,0.06185025,0.8736975,0.011062161,0.0015473135],"about_ca_topic_score_codex":0.00010382524,"about_ca_topic_score_gemma":0.000006501787,"teacher_disagreement_score":0.10046667,"about_ca_system_score_codex":0.000020472973,"about_ca_system_score_gemma":0.00000866778,"threshold_uncertainty_score":0.6008653},"labels":[],"label_agreement":null},{"id":"W573636968","doi":"10.13001/1081-3810.2988","title":"Stationary vectors of stochastic matrices subject to combinatorial constraints","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","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; Polytope; Bipartite graph; Directed graph; Matrix (chemical analysis); Discrete mathematics; Graph","score_opus":0.008634904918265188,"score_gpt":0.22576911177524084,"score_spread":0.21713420685697565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W573636968","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.97700155,0.001974228,0.019141816,0.00002855604,0.0013774824,0.00011798136,0.0000074508075,0.000031556512,0.00031941055],"genre_scores_gemma":[0.99950045,0.000014091115,0.00011024451,0.000008371766,0.00032855402,0.0000016139581,0.0000019718761,0.000021811917,0.000012902583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876434,0.00007382793,0.00047415218,0.0000675044,0.00031513555,0.00030502726],"domain_scores_gemma":[0.9992789,0.000111656926,0.00015409039,0.00009723036,0.00020010294,0.00015799476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806172,0.000120020115,0.00028411002,0.00022408759,0.000022481372,0.000010644717,0.00019732372,0.000055891036,0.000031092084],"category_scores_gemma":[0.00011182228,0.000109899556,0.000092420574,0.000300175,0.000041097028,0.0001222904,0.000011018759,0.0002871584,0.000019468593],"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.00227203,0.0006423597,0.0018237161,0.00048614418,0.0027831257,0.00014087318,0.0122955,0.34999377,0.030119078,0.5822664,0.0083730295,0.008803992],"study_design_scores_gemma":[0.035312258,0.02821459,0.0037436518,0.0021673278,0.0014750208,0.005261508,0.017032197,0.033169314,0.109267585,0.742723,0.017075459,0.004558099],"about_ca_topic_score_codex":0.0000035095638,"about_ca_topic_score_gemma":0.000002273819,"teacher_disagreement_score":0.31682444,"about_ca_system_score_codex":0.00012445268,"about_ca_system_score_gemma":0.00029829488,"threshold_uncertainty_score":0.4481574},"labels":[],"label_agreement":null},{"id":"W600271645","doi":"10.1007/s00373-015-1582-x","title":"A Cyclic Solution for an Infinite Class of Hamilton–Waterloo Problems","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"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; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Class (philosophy); Factorization; Integer (computer science); Combinatorics; Composition (language); Algorithm; Computer science; Artificial intelligence","score_opus":0.02871495167170536,"score_gpt":0.217056275594567,"score_spread":0.18834132392286163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W600271645","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.99524945,0.000873383,0.001557,0.0000064556593,0.000642199,0.0002785277,0.000014461507,0.00014818333,0.0012303429],"genre_scores_gemma":[0.9996976,0.000065886954,0.000062139494,0.0000078614585,0.000012071745,0.000057214267,0.00001526518,0.000020216814,0.000061728744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935424,0.00002715829,0.00021063279,0.00011871411,0.0001027147,0.00018651523],"domain_scores_gemma":[0.9995674,0.000021628483,0.00004139723,0.00017096646,0.00007905963,0.00011955829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028740434,0.000119868826,0.00018325464,0.000112896014,0.00004752275,0.000022952765,0.000092494935,0.00009563648,4.6039233e-7],"category_scores_gemma":[0.000006553062,0.00011270561,0.000051846542,0.00022442358,0.0000411485,0.00013781757,0.000010198,0.000068675254,0.000001078024],"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.000057902318,0.0002129522,0.008264726,0.00083652564,0.00012091107,0.0000014852665,0.006626785,0.0012000231,0.009389856,0.9677725,0.0016137834,0.0039025734],"study_design_scores_gemma":[0.0025307722,0.0010586065,0.0012454871,0.00008776476,0.00006137291,0.000015124496,0.000677488,0.032967664,0.0031817285,0.939886,0.017818267,0.00046973868],"about_ca_topic_score_codex":0.000026724583,"about_ca_topic_score_gemma":0.000013541827,"teacher_disagreement_score":0.03176764,"about_ca_system_score_codex":0.000012718703,"about_ca_system_score_gemma":0.000007552122,"threshold_uncertainty_score":0.45960012},"labels":[],"label_agreement":null},{"id":"W60558427","doi":"","title":"Odd (m1, m2, ..., mr)-cycle systems of Kn.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.005333178173023237,"score_gpt":0.18616441581972554,"score_spread":0.1808312376467023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60558427","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.98059,0.0015148617,0.000079151214,0.000009296161,0.005144828,0.0001973003,0.000007996612,0.00029104017,0.012165524],"genre_scores_gemma":[0.99977565,0.000022130254,0.00001890825,0.0000057035504,0.000017978507,0.000024660878,0.0000041683684,0.000037972204,0.000092807895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990439,0.000038960527,0.00032552503,0.00014585571,0.00018777572,0.00025802714],"domain_scores_gemma":[0.99939334,0.000038788694,0.00005413195,0.00037962748,0.000045329893,0.00008874859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022299269,0.00016371817,0.00028583783,0.00008814607,0.000049288763,0.000024014213,0.00022836616,0.000113328846,0.000016141046],"category_scores_gemma":[0.000014452137,0.00016750945,0.00009048958,0.0002669555,0.00004262556,0.00011883659,0.000023052093,0.00013219682,0.000117506024],"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.00000666496,0.00006058167,0.0006297128,0.00024094098,0.000075432006,0.0000115245175,0.00038665347,0.016405255,0.0053846044,0.9762119,0.0004997134,0.00008703013],"study_design_scores_gemma":[0.0053257807,0.00034539244,0.0033639127,0.0008391213,0.00009979503,0.00008191122,0.001176679,0.0031021463,0.055421256,0.91958606,0.009483436,0.0011745245],"about_ca_topic_score_codex":0.000095830954,"about_ca_topic_score_gemma":0.0000034658474,"teacher_disagreement_score":0.056625843,"about_ca_system_score_codex":0.000061785395,"about_ca_system_score_gemma":0.000016145734,"threshold_uncertainty_score":0.6830838},"labels":[],"label_agreement":null},{"id":"W62420143","doi":"","title":"Complete Sets of Orthogonal Self-Orthogonal Latin Squares.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal array; Latin square; Orthogonal basis; Combinatorics; Statistics; Chemistry; Physics; Food science; Taguchi methods","score_opus":0.014000129129407471,"score_gpt":0.19457764534021188,"score_spread":0.18057751621080442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62420143","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.97866243,0.0005295606,0.000015874572,0.000018131193,0.0015858705,0.00015181783,0.000050885854,0.0003472607,0.018638158],"genre_scores_gemma":[0.99967694,0.000021663314,0.000111713256,0.000017371158,0.000012842569,0.000015944921,0.000017298422,0.000037526846,0.00008869952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988169,0.000071666145,0.00037472564,0.00017415013,0.0002676568,0.00029488376],"domain_scores_gemma":[0.9993556,0.00010201183,0.00006568891,0.00031502228,0.000055854012,0.000105818144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001913584,0.0001973187,0.00029806537,0.00013195084,0.000067458684,0.000017514694,0.00022064375,0.00010588696,0.00042545525],"category_scores_gemma":[0.000013051447,0.00020818615,0.00012568894,0.00036736895,0.00004767128,0.00010108243,0.000031081305,0.000190416,0.0001781068],"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.000010192894,0.0001687503,0.016971018,0.00022582327,0.0001820389,0.00002568194,0.0009556186,0.0007602408,0.0026537136,0.97209895,0.004989721,0.00095827883],"study_design_scores_gemma":[0.008022807,0.00072307163,0.09454145,0.0005055575,0.0002384259,0.0001562606,0.00047504672,0.13253063,0.0061898665,0.67560244,0.07827119,0.0027432377],"about_ca_topic_score_codex":0.0000030755232,"about_ca_topic_score_gemma":0.00000275411,"teacher_disagreement_score":0.29649645,"about_ca_system_score_codex":0.00002635931,"about_ca_system_score_gemma":0.000006258431,"threshold_uncertainty_score":0.84895843},"labels":[],"label_agreement":null},{"id":"W64469974","doi":"","title":"Symmetric Designs and Self-Dual Codes over Rings.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number)","score_opus":0.00857695644386442,"score_gpt":0.20865252052036734,"score_spread":0.20007556407650293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64469974","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.98702836,0.0008468113,0.0001217086,0.0000026497955,0.0014051173,0.00011016847,0.0000019240852,0.00043300947,0.01005026],"genre_scores_gemma":[0.99973345,0.00004289365,0.00009903849,0.000015805734,0.000015456835,0.0000050157555,0.0000015496031,0.000027605014,0.00005919736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924374,0.000025901569,0.000177729,0.00013846961,0.00013328656,0.00028087565],"domain_scores_gemma":[0.9995471,0.0001364008,0.00002296419,0.00016220998,0.000021022654,0.00011025655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050933403,0.0001405428,0.00016039265,0.00016593692,0.000072675444,0.00003771223,0.000083583516,0.000094759926,0.000014346795],"category_scores_gemma":[0.000019146311,0.0001435155,0.00003586467,0.00039995104,0.000025804029,0.000110709676,0.000023244693,0.00013106398,0.000029869261],"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.000008476411,0.00006072661,0.011695928,0.000084366366,0.00009170482,0.000035142148,0.0004944966,0.000029441519,0.0026322196,0.98301226,0.0010951844,0.00076008006],"study_design_scores_gemma":[0.0049648136,0.00049460185,0.22045322,0.00018379626,0.00019949654,0.00020021814,0.0007113711,0.005012979,0.064131334,0.6735993,0.027982412,0.0020664583],"about_ca_topic_score_codex":0.000010129392,"about_ca_topic_score_gemma":0.0000028543875,"teacher_disagreement_score":0.30941293,"about_ca_system_score_codex":0.0000388754,"about_ca_system_score_gemma":0.000004730794,"threshold_uncertainty_score":0.58523923},"labels":[],"label_agreement":null},{"id":"W66104440","doi":"","title":"Critical sets in products of latin squares.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Statistics; Food science; Chemistry","score_opus":0.00907736098431752,"score_gpt":0.21802162512139808,"score_spread":0.20894426413708056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66104440","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.98495126,0.0003026147,5.7289117e-7,0.000038367343,0.00073193474,0.000095525735,0.0000033621905,0.00008324419,0.013793148],"genre_scores_gemma":[0.99982846,0.000009135617,0.000029093342,0.0000065341756,0.000004818412,0.000011099042,0.0000027588194,0.000015730258,0.00009239318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993675,0.000045425975,0.00020644936,0.000107679094,0.00010008884,0.00017290947],"domain_scores_gemma":[0.9996632,0.00006364705,0.000008230714,0.00020309968,0.000025431924,0.000036432026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016607893,0.000085697226,0.0001558625,0.00007630306,0.0000146586835,0.000008068708,0.00010181293,0.0000589071,0.00014435104],"category_scores_gemma":[0.0000525373,0.00009060168,0.000025410578,0.0003421065,0.00003796958,0.00008220084,0.0000063972657,0.00010879925,0.00008412863],"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.00002232142,0.00013854442,0.005980171,0.00034333754,0.00001784801,0.000025411835,0.0010492721,0.0008510744,0.0029758783,0.98377687,0.0014840906,0.0033352103],"study_design_scores_gemma":[0.0017467486,0.00017484455,0.041909363,0.0003579412,0.00001959155,0.00001545946,0.00019954638,0.0037435486,0.031506874,0.91232383,0.007415306,0.0005869302],"about_ca_topic_score_codex":0.000009553117,"about_ca_topic_score_gemma":0.0000022241045,"teacher_disagreement_score":0.07145299,"about_ca_system_score_codex":0.000015331201,"about_ca_system_score_gemma":0.0000073986603,"threshold_uncertainty_score":0.36946294},"labels":[],"label_agreement":null},{"id":"W66450420","doi":"","title":"A New Technique For Constructing Pairwise Balanced Designs From Groups.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pairwise comparison; Combinatorics; Statistics","score_opus":0.01590864148593365,"score_gpt":0.20553577312519936,"score_spread":0.1896271316392657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66450420","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.9222626,0.00040105038,0.07017741,0.000015836269,0.0036592488,0.00080788846,0.0000227973,0.0008193926,0.0018337535],"genre_scores_gemma":[0.9921198,0.000012231753,0.0075434567,0.000014890736,0.000037619564,0.00014677487,0.000012702958,0.000044288812,0.00006822576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991932,0.000035835594,0.00023088667,0.00018230063,0.000095130374,0.00026266772],"domain_scores_gemma":[0.9994027,0.00015986044,0.000041555024,0.0002554188,0.000029718789,0.00011074997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013947749,0.00017123108,0.00024477244,0.00005552989,0.00010796076,0.00001647146,0.00017758511,0.00012639584,0.000032250016],"category_scores_gemma":[0.000035471956,0.00018487338,0.00009645913,0.0001613317,0.00003505134,0.00011166858,0.000015789716,0.00013308144,0.000018781113],"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.000074659474,0.0000497593,0.011329318,0.00012777325,0.00022346346,0.00005030597,0.0017057501,0.00014482542,0.26564726,0.7032761,0.01574936,0.0016213928],"study_design_scores_gemma":[0.0021382163,0.0001053345,0.0007399638,0.00012792104,0.0000313228,0.00006826323,0.0002855847,0.00076043716,0.17120868,0.821658,0.0023202987,0.0005559716],"about_ca_topic_score_codex":0.000032223328,"about_ca_topic_score_gemma":0.000002125169,"teacher_disagreement_score":0.11838189,"about_ca_system_score_codex":0.000041712676,"about_ca_system_score_gemma":0.000027603277,"threshold_uncertainty_score":0.75389177},"labels":[],"label_agreement":null},{"id":"W67197367","doi":"","title":"A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.008125151538911718,"score_gpt":0.19794097486648696,"score_spread":0.18981582332757524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67197367","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.9776186,0.00067633495,0.000019622346,0.000014430327,0.0065915883,0.00024985068,0.000021573815,0.00030345726,0.014504563],"genre_scores_gemma":[0.9994996,0.000041760028,0.00003580956,0.000011758947,0.00004450759,0.000010196331,0.000019393894,0.000059739752,0.00027723733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998589,0.000078389196,0.00040824988,0.00022882849,0.0002928551,0.000402684],"domain_scores_gemma":[0.9991095,0.00009300325,0.00008229998,0.0005073111,0.00007785514,0.00013001867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017309478,0.00027192206,0.00042134753,0.00012759151,0.00010266776,0.000023145785,0.00034553956,0.00021058864,0.0004898644],"category_scores_gemma":[0.000028662522,0.00027500172,0.0001243991,0.00048150212,0.00007189938,0.00013835772,0.00006344935,0.00021045914,0.000059350717],"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.00012921073,0.0001044112,0.004581852,0.00014343704,0.00020283424,0.00003437213,0.0003729976,0.0009635272,0.094421335,0.89119315,0.0075945514,0.00025831765],"study_design_scores_gemma":[0.0044203536,0.00029848074,0.0017572347,0.000116688425,0.00008076591,0.00007626212,0.00011544496,0.0012881401,0.10885367,0.8522307,0.029998515,0.00076372083],"about_ca_topic_score_codex":0.000028264645,"about_ca_topic_score_gemma":0.000010880306,"teacher_disagreement_score":0.038962428,"about_ca_system_score_codex":0.000096843476,"about_ca_system_score_gemma":0.000018042576,"threshold_uncertainty_score":0.9999702},"labels":[],"label_agreement":null},{"id":"W68998160","doi":"","title":"Maximum Complementary P3-Packings of Kv.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.008776974851571239,"score_gpt":0.20190988841245586,"score_spread":0.1931329135608846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68998160","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.9661874,0.00033524464,0.000054574877,0.000009060201,0.002395174,0.00012511107,0.000007848132,0.00013215514,0.03075339],"genre_scores_gemma":[0.99977666,0.000010104932,0.000098677345,0.000019942188,0.0000037272077,0.000008814486,0.0000061297615,0.000024409906,0.00005152468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992756,0.000052501513,0.00023450452,0.00010495959,0.00012709388,0.00020533474],"domain_scores_gemma":[0.999592,0.000041627718,0.00003505871,0.00024734752,0.000027632439,0.000056317458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022458173,0.00012135095,0.00018935095,0.00006253717,0.00003983986,0.000009781977,0.00013902286,0.000047390957,0.00019730201],"category_scores_gemma":[0.000010385092,0.00012958172,0.00006631277,0.0001844107,0.0000341636,0.00007442747,0.000013114654,0.00009352327,0.00004565112],"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.000004845519,0.00004102831,0.0051532965,0.000091928894,0.0000679831,0.000005199725,0.00031515778,0.00009547239,0.004454787,0.9859258,0.0035711878,0.00027330357],"study_design_scores_gemma":[0.0010817583,0.00009319415,0.0011570719,0.000057638532,0.000024679606,0.000013350559,0.00042015736,0.00019387942,0.040168073,0.9253231,0.031181699,0.00028536064],"about_ca_topic_score_codex":0.000013994376,"about_ca_topic_score_gemma":0.0000022086053,"teacher_disagreement_score":0.060602672,"about_ca_system_score_codex":0.000024362773,"about_ca_system_score_gemma":0.000006739201,"threshold_uncertainty_score":0.52841896},"labels":[],"label_agreement":null},{"id":"W6901883357","doi":"10.60692/xgdnq-qn103","title":"Adaptive Transceiver Architecture With QoS Provision for OCDMA Network Based on Logic Gates","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Transceiver; Multiplexer; Quality of service; Interference (communication); Amplifier; Code division multiple access; Transmission (telecommunications); Logic gate","score_opus":0.014686457134293344,"score_gpt":0.16491366697877144,"score_spread":0.1502272098444781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901883357","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.117712826,0.000018301645,0.8702731,0.000042785818,0.0008248271,0.0014272403,0.0002119294,0.0007648913,0.008724072],"genre_scores_gemma":[0.99841785,4.608538e-8,0.0009872975,0.00011332164,0.00014725316,0.00020864017,0.000053629086,0.000021850365,0.000050126895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899024,0.00006359888,0.00033959842,0.0001363103,0.00019809527,0.0002721422],"domain_scores_gemma":[0.9994344,0.000024946738,0.00008298222,0.00026571823,0.00012204162,0.00006992086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019705713,0.00022235642,0.00024367178,0.000109602915,0.00012362744,0.0000968688,0.00009512784,0.00011453288,0.000013529025],"category_scores_gemma":[0.00000420451,0.00015972453,0.000102347745,0.00023949266,0.000017457989,0.00020407484,0.0000046376513,0.00011149872,0.00007844665],"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.00044969795,0.0000027520578,0.0019012624,0.0010895797,0.000089188004,0.000008487559,0.017730596,0.9757084,0.000007934119,0.0021764536,0.00021536354,0.0006202902],"study_design_scores_gemma":[0.007998017,0.0010442813,0.007330172,0.004137861,0.00021133882,0.00017656657,0.025792189,0.9380713,0.008054645,0.00011351081,0.0054510497,0.0016190821],"about_ca_topic_score_codex":4.950293e-7,"about_ca_topic_score_gemma":4.061432e-7,"teacher_disagreement_score":0.880705,"about_ca_system_score_codex":0.0000517143,"about_ca_system_score_gemma":0.000022500919,"threshold_uncertainty_score":0.6513377},"labels":[],"label_agreement":null},{"id":"W6911813052","doi":"10.5281/zenodo.15100609","title":"MATH+ Adventskaleder: Aufgaben und Lösungen 2024","year":2025,"lang":"de","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"graph theory and CDMA systems","field":"Engineering","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":"Deutsche Forschungsgemeinschaft","keywords":"Quarter (Canadian coin); Work (physics); Term (time)","score_opus":0.017469301693410072,"score_gpt":0.22475354865415637,"score_spread":0.2072842469607463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911813052","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.00033343505,0.005786009,0.0019670965,0.00022707011,0.0024080807,0.00161811,0.0027313523,0.0021699904,0.9827589],"genre_scores_gemma":[0.03340207,0.0031183437,0.00016837943,0.00022367862,0.0024596124,7.4155804e-7,0.025187446,0.01151152,0.9239282],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957055,0.0007046488,0.0008440417,0.0009949451,0.0007359123,0.001014979],"domain_scores_gemma":[0.99734557,0.000078502984,0.00023753957,0.0013421462,0.0005649954,0.00043127258],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013356959,0.00068467,0.00066852703,0.000843487,0.0027100705,0.0015724748,0.002516542,0.0005408428,0.029830953],"category_scores_gemma":[0.00035282542,0.00080178067,0.00033002798,0.00086799386,0.00026860627,0.00027817042,0.0019928755,0.0012904246,0.06912059],"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.00009566474,0.00014143417,0.0000012602495,0.0022481664,0.0015210002,0.00011004841,0.0010514095,0.000787136,0.00022027145,0.096119665,0.8346523,0.06305165],"study_design_scores_gemma":[0.00060604175,0.0001511556,0.000050089468,0.00072136574,0.00034806997,0.00006699455,0.00018651031,0.0009476774,0.000056261262,0.0018366809,0.9943452,0.0006839929],"about_ca_topic_score_codex":0.000018870645,"about_ca_topic_score_gemma":7.7099867e-7,"teacher_disagreement_score":0.15969287,"about_ca_system_score_codex":0.00074008794,"about_ca_system_score_gemma":0.000021909473,"threshold_uncertainty_score":0.999464},"labels":[],"label_agreement":null},{"id":"W6930509961","doi":"10.5281/zenodo.15114758","title":"Hillslope hydrologic influences on soil dissolved organic carbon fate informs climate impacts on boreal forest mineral soil stocks","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Natural Resources Canada; Memorial University of Newfoundland","funders":"","keywords":"Lysimeter; Dissolved organic carbon; Soil water; Hydrology (agriculture); Podzol; Watershed; Taiga; Leachate; Soil carbon; Soil horizon","score_opus":0.012235783905623,"score_gpt":0.21775035950745344,"score_spread":0.20551457560183045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930509961","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17261265,0.00013552778,0.000015185568,0.00015171601,0.0009068238,0.0011571378,0.7494292,0.0022564037,0.07333533],"genre_scores_gemma":[0.31999215,0.0003546907,0.0000015661263,0.00016252916,0.00022871603,4.437027e-7,0.6783499,0.0007152557,0.00019477232],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969037,0.00031378926,0.00059101195,0.00063457276,0.00060667825,0.00095022086],"domain_scores_gemma":[0.99806684,0.000076635486,0.000220747,0.001097275,0.00023012015,0.00030836722],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007137128,0.00062204717,0.00055510184,0.00074505864,0.0011567564,0.0008224465,0.0017536113,0.0004177753,0.0010110759],"category_scores_gemma":[0.0004284922,0.00055859966,0.00015058016,0.00086282426,0.00017822025,0.0002155655,0.00083470996,0.0010887722,0.0014915805],"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.00019897669,0.00009847916,0.0000066479793,0.00059765676,0.00017359441,0.00004780523,0.00020565132,0.0059933243,0.0004893995,0.0002950469,0.9906215,0.0012718973],"study_design_scores_gemma":[0.0007378179,0.0008422804,0.00043745423,0.00039332084,0.00007060593,0.00003503309,0.000104770326,0.001275843,0.00022303355,0.00009121187,0.9951241,0.0006645474],"about_ca_topic_score_codex":0.000116336036,"about_ca_topic_score_gemma":0.000044836026,"teacher_disagreement_score":0.14737949,"about_ca_system_score_codex":0.00030574942,"about_ca_system_score_gemma":0.000011666112,"threshold_uncertainty_score":0.9999021},"labels":[],"label_agreement":null},{"id":"W6931167490","doi":"10.5281/zenodo.16576460","title":"Analysis code for Time-resolved certification of frequency-bin entanglement over multi-mode channels","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Code (set theory); Certification; Quantum entanglement; Scheme (mathematics); Key (lock); Identification (biology)","score_opus":0.024108757009884532,"score_gpt":0.24672902123126955,"score_spread":0.22262026422138503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931167490","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.0005341219,0.0009929326,0.29182765,0.000096735224,0.0006565647,0.0031837027,0.015470426,0.0032701078,0.68396777],"genre_scores_gemma":[0.33367953,0.00052633934,0.0033452613,0.00008975562,0.00072035263,0.000004450579,0.049473543,0.019824581,0.5923362],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985507,0.00017300845,0.00038410054,0.00036980605,0.0002423433,0.00028003828],"domain_scores_gemma":[0.99892706,0.000022915077,0.00016110197,0.00058555836,0.00021702671,0.00008633469],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039509922,0.00022529323,0.00036117068,0.0008359468,0.00028955966,0.00015109738,0.0007091646,0.00016622999,0.018141074],"category_scores_gemma":[0.00010220942,0.00024903618,0.00018338677,0.00077527226,0.00006676985,0.000056910318,0.00016633762,0.00014232592,0.0009811455],"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.00005395566,0.00021424756,0.000008194219,0.0011400174,0.002658828,0.000002112546,0.0008798105,0.0034990485,0.01790785,0.006610115,0.9563826,0.010643255],"study_design_scores_gemma":[0.0005176621,0.000055201464,0.00003453904,0.0001368538,0.00028593358,0.0000011592796,0.000072040326,0.018033283,0.0013865873,0.0001114097,0.97910273,0.00026259897],"about_ca_topic_score_codex":0.000045922367,"about_ca_topic_score_gemma":0.0000058069895,"teacher_disagreement_score":0.3331454,"about_ca_system_score_codex":0.00012393678,"about_ca_system_score_gemma":0.000003415632,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W6931910058","doi":"10.5683/sp3/eqn2g3","title":"Supplemental Data: Role and attitudes of veterinarians in the promotion of positive welfare states for dairy cattle","year":2023,"lang":"en","type":"dataset","venue":"Borealis","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 Guelph","funders":"","keywords":"Dairy cattle; Welfare; Dairy farming; Promotion (chess); Animal welfare; Dairy industry; Milk production","score_opus":0.02368458400805819,"score_gpt":0.274982511128313,"score_spread":0.25129792712025484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931910058","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044746995,0.00011013974,0.000010006428,0.000043947544,0.00007271099,0.00046906667,0.9947954,0.000013725652,0.00001034762],"genre_scores_gemma":[0.05637799,0.00008431966,0.0000140830225,0.00000231855,0.000031350224,0.000082364524,0.9433911,0.000014972814,0.0000014896641],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936336,0.000053535194,0.00022977561,0.00014066159,0.00009868421,0.00011398075],"domain_scores_gemma":[0.99942577,0.00008144179,0.00006314365,0.0003982365,0.000017786375,0.000013643401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032764964,0.00011926863,0.00021313071,0.00008116894,0.000027391505,0.000013677959,0.00030135937,0.000075187614,0.0000040220275],"category_scores_gemma":[0.000012963571,0.00009516944,0.000028382476,0.00007551267,0.000043421132,0.00006881637,0.00006559586,0.000072142335,4.068412e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022765402,0.000054925433,0.00009509558,0.0013901963,0.000090952155,0.0000041854955,0.00058261276,0.00007145114,0.000086195476,0.00016462746,0.9973186,0.0001183397],"study_design_scores_gemma":[0.0010770451,0.00075107,0.048027128,0.0008040846,0.0002536259,0.00003135241,0.005876049,0.00041687785,0.00045131883,0.0005086273,0.9413376,0.000465214],"about_ca_topic_score_codex":0.014525,"about_ca_topic_score_gemma":0.015740968,"teacher_disagreement_score":0.055981044,"about_ca_system_score_codex":0.000011755324,"about_ca_system_score_gemma":0.0000066638463,"threshold_uncertainty_score":0.99203736},"labels":[],"label_agreement":null},{"id":"W6948900600","doi":"10.5281/zenodo.12036833","title":"apple product catalogue pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"graph theory and CDMA systems","field":"Engineering","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":"Product (mathematics); Subpoena; Quality (philosophy); Interchangeability","score_opus":0.015317139346764428,"score_gpt":0.20083472456285872,"score_spread":0.1855175852160943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948900600","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.000015190241,0.00162246,0.000562881,0.000040991814,0.0006473483,0.00047228902,0.0013523306,0.0043424917,0.990944],"genre_scores_gemma":[0.01253252,0.00021728333,0.00006434199,0.000025204481,0.0011383606,1.8139326e-7,0.014876582,0.023959182,0.94718635],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875736,0.0001154465,0.00018710674,0.0003981997,0.0002260563,0.00031579938],"domain_scores_gemma":[0.999208,0.000004343706,0.00004049537,0.0005672966,0.00006245793,0.00011741315],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031797672,0.00022851836,0.00020128772,0.00038458928,0.00028136105,0.00045046798,0.0007293139,0.00012397525,0.062313363],"category_scores_gemma":[0.000055684173,0.00024007175,0.000067443696,0.00044765422,0.00008818409,0.00005798448,0.00034437288,0.00037122672,0.27507117],"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.0000032145817,0.000016288934,4.9994163e-8,0.0006768947,0.000103236795,0.000019006702,0.00029816595,0.000027526046,0.00026929248,0.0027530515,0.98951364,0.0063196463],"study_design_scores_gemma":[0.00009921051,0.000028292407,0.0000010050084,0.00016454946,0.000022907736,0.00009129986,0.00009028989,0.00007482766,0.00012473577,0.00023055384,0.9988208,0.00025153434],"about_ca_topic_score_codex":0.00001829336,"about_ca_topic_score_gemma":0.0000010980382,"teacher_disagreement_score":0.21275781,"about_ca_system_score_codex":0.00007054282,"about_ca_system_score_gemma":0.0000012607625,"threshold_uncertainty_score":0.9789842},"labels":[],"label_agreement":null},{"id":"W6968591482","doi":"10.5281/zenodo.2563993","title":"The Best Matrix Conjecture","year":2019,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Conjecture; Matrix (chemical analysis); Algebra over a field; Matrix algebra; Integer matrix","score_opus":0.011133550499691738,"score_gpt":0.20510013359229012,"score_spread":0.1939665830925984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968591482","genre_codex":"other","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.33897594,0.0010697847,0.0016282639,0.00044827926,0.0010241909,0.0009303269,0.00014827313,0.002756971,0.653018],"genre_scores_gemma":[0.99608177,0.0000638701,0.00001283499,0.000017893404,0.000091756476,2.0700927e-8,0.00013863965,0.00079753436,0.0027956737],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916804,0.00013020859,0.00013696488,0.0001471091,0.00016767051,0.00025001023],"domain_scores_gemma":[0.99941045,0.000027203847,0.000024737921,0.00036990238,0.00009508999,0.00007264445],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039832856,0.00009453846,0.00008292495,0.00006321726,0.0010428317,0.00048608784,0.0006212848,0.00004769498,0.003782524],"category_scores_gemma":[0.000057215824,0.00007593299,0.000040300794,0.0002611796,0.000059609545,0.00010180689,0.00018872916,0.0002006618,0.028686956],"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.00011928022,0.00010534177,0.00004669966,0.0004725996,0.00032138336,0.00002661939,0.0035029284,0.0080754785,0.040491894,0.27647173,0.5081211,0.16224493],"study_design_scores_gemma":[0.00019259959,0.00006565409,0.00006078828,0.000015997333,0.000004835513,0.00006151985,0.00047098906,0.0009890429,0.0004540159,0.00041093968,0.9971713,0.000102308615],"about_ca_topic_score_codex":0.0000019950137,"about_ca_topic_score_gemma":1.15110694e-7,"teacher_disagreement_score":0.65710586,"about_ca_system_score_codex":0.000042382766,"about_ca_system_score_gemma":6.9357617e-7,"threshold_uncertainty_score":0.9971281},"labels":[],"label_agreement":null},{"id":"W6968816530","doi":"10.5281/zenodo.2563992","title":"The Best Matrix Conjecture","year":2019,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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 Waterloo","funders":"","keywords":"Conjecture; Matrix (chemical analysis); Algebra over a field; Matrix algebra; Integer matrix","score_opus":0.011133550499691738,"score_gpt":0.20510013359229012,"score_spread":0.1939665830925984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968816530","genre_codex":"other","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.33897594,0.0010697847,0.0016282639,0.00044827926,0.0010241909,0.0009303269,0.00014827313,0.002756971,0.653018],"genre_scores_gemma":[0.99608177,0.0000638701,0.00001283499,0.000017893404,0.000091756476,2.0700927e-8,0.00013863965,0.00079753436,0.0027956737],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916804,0.00013020859,0.00013696488,0.0001471091,0.00016767051,0.00025001023],"domain_scores_gemma":[0.99941045,0.000027203847,0.000024737921,0.00036990238,0.00009508999,0.00007264445],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039832856,0.00009453846,0.00008292495,0.00006321726,0.0010428317,0.00048608784,0.0006212848,0.00004769498,0.003782524],"category_scores_gemma":[0.000057215824,0.00007593299,0.000040300794,0.0002611796,0.000059609545,0.00010180689,0.00018872916,0.0002006618,0.028686956],"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.00011928022,0.00010534177,0.00004669966,0.0004725996,0.00032138336,0.00002661939,0.0035029284,0.0080754785,0.040491894,0.27647173,0.5081211,0.16224493],"study_design_scores_gemma":[0.00019259959,0.00006565409,0.00006078828,0.000015997333,0.000004835513,0.00006151985,0.00047098906,0.0009890429,0.0004540159,0.00041093968,0.9971713,0.000102308615],"about_ca_topic_score_codex":0.0000019950137,"about_ca_topic_score_gemma":1.15110694e-7,"teacher_disagreement_score":0.65710586,"about_ca_system_score_codex":0.000042382766,"about_ca_system_score_gemma":6.9357617e-7,"threshold_uncertainty_score":0.9971281},"labels":[],"label_agreement":null},{"id":"W6976852436","doi":"10.60692/zxv22-ssy92","title":"Adaptive Transceiver Architecture With QoS Provision for OCDMA Network Based on Logic Gates","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Transceiver; Multiplexer; Quality of service; Interference (communication); Amplifier; Code division multiple access; Transmission (telecommunications); Logic gate","score_opus":0.014686457134293344,"score_gpt":0.16491366697877144,"score_spread":0.1502272098444781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976852436","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.117712826,0.000018301645,0.8702731,0.000042785818,0.0008248271,0.0014272403,0.0002119294,0.0007648913,0.008724072],"genre_scores_gemma":[0.99841785,4.608538e-8,0.0009872975,0.00011332164,0.00014725316,0.00020864017,0.000053629086,0.000021850365,0.000050126895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899024,0.00006359888,0.00033959842,0.0001363103,0.00019809527,0.0002721422],"domain_scores_gemma":[0.9994344,0.000024946738,0.00008298222,0.00026571823,0.00012204162,0.00006992086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019705713,0.00022235642,0.00024367178,0.000109602915,0.00012362744,0.0000968688,0.00009512784,0.00011453288,0.000013529025],"category_scores_gemma":[0.00000420451,0.00015972453,0.000102347745,0.00023949266,0.000017457989,0.00020407484,0.0000046376513,0.00011149872,0.00007844665],"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.00044969795,0.0000027520578,0.0019012624,0.0010895797,0.000089188004,0.000008487559,0.017730596,0.9757084,0.000007934119,0.0021764536,0.00021536354,0.0006202902],"study_design_scores_gemma":[0.007998017,0.0010442813,0.007330172,0.004137861,0.00021133882,0.00017656657,0.025792189,0.9380713,0.008054645,0.00011351081,0.0054510497,0.0016190821],"about_ca_topic_score_codex":4.950293e-7,"about_ca_topic_score_gemma":4.061432e-7,"teacher_disagreement_score":0.880705,"about_ca_system_score_codex":0.0000517143,"about_ca_system_score_gemma":0.000022500919,"threshold_uncertainty_score":0.6513377},"labels":[],"label_agreement":null},{"id":"W6989647975","doi":"","title":"Boolean complementary pairs","year":2023,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","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 Manitoba","funders":"","keywords":"Hadamard transform; Binary Golay code; Factorization; Generalization; Zero (linguistics); Boolean function; Ternary operation; Complementary sequences; Ternary Golay code; Connection (principal bundle)","score_opus":0.013185308621481364,"score_gpt":0.1862694833632031,"score_spread":0.17308417474172172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989647975","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.97349304,0.00016102951,0.00011197213,0.000044980865,0.0016570371,0.00023586399,0.00009534392,0.0005798082,0.0236209],"genre_scores_gemma":[0.99284,0.00012299653,0.000115627205,0.000004969629,0.00007979135,5.7122566e-7,0.0009896919,0.000072315495,0.005774061],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.99931234,0.00003577239,0.000093611074,0.0001717202,0.0001910342,0.0001955345],"domain_scores_gemma":[0.99956506,0.000028448892,0.00007343929,0.00023811248,0.000036259866,0.000058672504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011103055,0.00018415131,0.00028227703,0.00024046407,0.00012008466,0.000009357678,0.00030712818,0.00015786174,0.000045203327],"category_scores_gemma":[0.0000022888291,0.0002689983,0.000159735,0.00021129313,0.000028883318,0.00007840414,0.000025127783,0.00020043895,0.00030576324],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065792503,0.00020804779,0.04974249,0.014474646,0.0044726846,0.0009924662,0.02342158,0.0088053625,0.010175273,0.014118172,0.85813487,0.01479651],"study_design_scores_gemma":[0.0011722362,0.00013745256,0.33098808,0.0009698826,0.00043636496,0.0000063504253,0.6009271,0.0026045986,0.0007353285,0.0011733236,0.05965241,0.0011968277],"about_ca_topic_score_codex":0.00083303725,"about_ca_topic_score_gemma":0.28045553,"teacher_disagreement_score":0.7984824,"about_ca_system_score_codex":0.00006317535,"about_ca_system_score_gemma":0.000012380906,"threshold_uncertainty_score":0.9999762},"labels":[],"label_agreement":null},{"id":"W7008518072","doi":"","title":"Canada a leader among G20 for plan to phase out coal, says report","year":2019,"lang":"en","type":"other","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Plan (archaeology); Phase (matter); Work (physics); Government (linguistics)","score_opus":0.016216745530991863,"score_gpt":0.22689111052818223,"score_spread":0.21067436499719036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008518072","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.00042630083,0.00016736191,0.00932271,0.000032966374,0.0033801307,0.0011911518,0.00038307038,0.00044831968,0.984648],"genre_scores_gemma":[0.05309408,0.0000012044933,0.000098817465,0.000084099105,0.00032656887,0.00012357549,0.00011666203,0.00042932,0.9457257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990547,0.000009719894,0.00024933188,0.0002488705,0.00014641696,0.0002909891],"domain_scores_gemma":[0.9993012,0.00003627503,0.000056978377,0.0004578393,0.000012119428,0.0001355717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100014935,0.0002653348,0.00037609812,0.00011422838,0.000018325552,0.000021862332,0.00016574588,0.00020324429,0.00057648396],"category_scores_gemma":[0.000014694909,0.0002414088,0.0000780176,0.000044620963,0.000010815851,0.000017698727,0.000011251126,0.00010619705,0.000111885165],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057455104,0.000006508428,0.00011357194,0.00038044617,0.00010914555,0.00006437615,0.000052546682,0.00014118933,0.000038335966,0.00054399477,0.9984974,0.00004672569],"study_design_scores_gemma":[0.00036429963,0.0000249366,0.000008213628,0.00015728339,0.000023893215,0.00001907029,0.00013802743,0.00014576154,0.00016747232,0.000012514742,0.99858797,0.00035054903],"about_ca_topic_score_codex":0.21426654,"about_ca_topic_score_gemma":0.7636294,"teacher_disagreement_score":0.54936284,"about_ca_system_score_codex":0.00006211719,"about_ca_system_score_gemma":0.000106790525,"threshold_uncertainty_score":0.98443645},"labels":[],"label_agreement":null},{"id":"W7009092561","doi":"","title":"Cyclic m-cycle systems of complete graphs minus a 1-factor","year":2017,"lang":"en","type":"article","venue":"Open ULeth Scholarship (OPUS) (University of Lethbridge)","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 Lethbridge","funders":"","keywords":"Class (philosophy); Interval (graph theory); Set (abstract data type); Sequence (biology); Disjoint sets","score_opus":0.04188348140576942,"score_gpt":0.24117228382751377,"score_spread":0.19928880242174435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009092561","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.98080194,0.00042664277,0.0004333507,0.00008165437,0.00078590744,0.0006426644,0.0003179919,0.00009962314,0.016410215],"genre_scores_gemma":[0.99858135,0.00005595582,0.00039616958,0.000013587761,0.000035064157,0.0000018445207,0.000018687388,0.000042769727,0.000854551],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99814445,0.00026315413,0.0003668538,0.00039459666,0.0003972658,0.00043365304],"domain_scores_gemma":[0.99753565,0.00012236668,0.00046614974,0.0014790676,0.00016295239,0.00023379097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009528527,0.00030368278,0.0007926842,0.00024800084,0.00068875315,0.0002652046,0.0030079,0.00024158573,0.00012122902],"category_scores_gemma":[0.0000708874,0.00037467133,0.00028154306,0.00021098305,0.00038650332,0.0016487445,0.00046459393,0.00048364603,0.00011240551],"study_design_candidate":"observational","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.0013942746,0.00080939307,0.25497302,0.006494727,0.0035457597,0.0008527162,0.011937794,0.004409507,0.5535099,0.13322447,0.008529744,0.020318668],"study_design_scores_gemma":[0.008046413,0.00045868097,0.9181327,0.0025939902,0.00042885228,0.00013825322,0.005554876,0.0033196583,0.01433003,0.003669977,0.040922396,0.0024041263],"about_ca_topic_score_codex":0.0024151318,"about_ca_topic_score_gemma":0.00020987944,"teacher_disagreement_score":0.6631597,"about_ca_system_score_codex":0.000060473063,"about_ca_system_score_gemma":0.000039091465,"threshold_uncertainty_score":0.99987054},"labels":[],"label_agreement":null},{"id":"W7022056156","doi":"","title":"Editor’s note","year":2016,"lang":"en","type":"article","venue":"DergiPark (Istanbul University)","topic":"graph theory and CDMA systems","field":"Engineering","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":"Algebraic combinatorics; Combinatorial design; Mathematical sciences; Permutation (music); Hamming distance; Automorphism group; Group (periodic table); Permutation group","score_opus":0.002773949903790563,"score_gpt":0.1462928486868692,"score_spread":0.14351889878307864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022056156","genre_codex":"other","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.2634603,0.00025272093,0.1357574,0.00034174474,0.016521636,0.0003328248,0.00010348259,0.0023734125,0.58085644],"genre_scores_gemma":[0.989599,0.000044359385,0.00010587296,0.000011430458,0.0007097567,4.4462132e-7,0.0000017150345,0.000020559035,0.0095068505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937445,0.00003640621,0.00008979697,0.00015231346,0.00010863692,0.00023838866],"domain_scores_gemma":[0.99951446,0.00007761903,0.00001986105,0.00025253795,0.000030644802,0.00010489914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007235586,0.00012569132,0.00012372374,0.00016476885,0.00007746501,0.000013658114,0.00022656514,0.000088044086,0.00018828092],"category_scores_gemma":[0.000010583764,0.00010837871,0.00007569496,0.00026483188,0.00005786056,0.00021246819,0.000026546317,0.000066537184,0.0003176664],"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.00027340188,0.00010461595,0.0015578533,0.00024535597,0.00041012838,0.0009246363,0.0016202383,0.002561406,0.06838958,0.4507156,0.46213868,0.011058484],"study_design_scores_gemma":[0.00044086398,0.000015871823,0.00017178529,0.000040204668,0.000015081968,0.0000054668535,0.00019854718,0.00012603232,0.0018707229,0.00068553473,0.99621904,0.00021082084],"about_ca_topic_score_codex":0.0000045451247,"about_ca_topic_score_gemma":0.00001857343,"teacher_disagreement_score":0.7261387,"about_ca_system_score_codex":0.00011791513,"about_ca_system_score_gemma":0.000013668397,"threshold_uncertainty_score":0.44195554},"labels":[],"label_agreement":null},{"id":"W7023577430","doi":"","title":"An Octonian Algebra Originating in Combinatorics","year":2010,"lang":"en","type":"article","venue":"Scholars Commons (Wilfrid Laurier University)","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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematical proof; Identity (music); Product (mathematics); Polynomial; Algebra over a field; Explained sum of squares; Infinite product","score_opus":0.005361041817017718,"score_gpt":0.19083584885175411,"score_spread":0.1854748070347364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023577430","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.957224,0.000041128864,0.00014465283,0.000035624165,0.0009798896,0.00015000638,0.000017910046,0.00041390493,0.040992893],"genre_scores_gemma":[0.9992392,0.000007189,0.00024928624,0.000016521564,0.00003868138,0.000001298128,0.000014274446,0.000038299513,0.00039524524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883324,0.00014765906,0.00018441361,0.00025820712,0.00017200292,0.0004044848],"domain_scores_gemma":[0.9990059,0.00006463343,0.00003964082,0.0006002343,0.00005479976,0.00023475646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042930033,0.00022071044,0.00023319024,0.0006468312,0.00024145635,0.00010671157,0.0006746204,0.00020763703,0.00008717163],"category_scores_gemma":[0.000024930328,0.00027462782,0.0000761005,0.0012142268,0.000091594455,0.0010353652,0.000058157242,0.0012064679,0.000046623456],"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.000028056682,0.00021311428,0.16011603,0.000060224364,0.00006459039,0.00041212968,0.0010174273,0.00094429235,0.01898523,0.81576425,0.00029347866,0.0021011818],"study_design_scores_gemma":[0.005484092,0.00028750618,0.06578806,0.00022636028,0.00012422873,0.00010268654,0.0044757198,0.012346469,0.01666534,0.029142193,0.862572,0.0027853432],"about_ca_topic_score_codex":0.000052283063,"about_ca_topic_score_gemma":0.0009996054,"teacher_disagreement_score":0.8622785,"about_ca_system_score_codex":0.000093677,"about_ca_system_score_gemma":0.000037812715,"threshold_uncertainty_score":0.9999706},"labels":[],"label_agreement":null},{"id":"W7023712761","doi":"","title":"Ormat Technologies, Inc. to Host Conference Call Announcing Fourth Quarter and Year-end 2021 ...","year":2022,"lang":"en","type":"other","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Host (biology)","score_opus":0.006779560530586926,"score_gpt":0.18064274114791004,"score_spread":0.17386318061732312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023712761","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.00052809133,0.001037357,0.0016849673,0.00008903749,0.00058297423,0.0003895305,0.0001674768,0.0014201258,0.99410045],"genre_scores_gemma":[0.24679232,0.0006025673,0.001987171,0.00013454702,0.0002744597,0.00028184414,0.00014203577,0.0007366785,0.74904835],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991475,0.000027241793,0.00016466576,0.00024413709,0.00015794864,0.00025855712],"domain_scores_gemma":[0.99949443,0.000020334219,0.000032043645,0.000382591,0.000013366346,0.000057259207],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012725193,0.0002549944,0.00029853106,0.0002652822,0.00004287371,0.00006118469,0.00023754542,0.00023661325,0.009676277],"category_scores_gemma":[0.000010021777,0.0002343,0.000030832995,0.00017971966,0.000035584577,0.000038310543,0.00012571439,0.00031059346,0.00028717285],"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.0000039555803,0.0000072730995,0.0001646899,0.0002011904,0.00008998122,0.000027028225,0.00032750345,0.00002359141,0.00031127402,0.007829894,0.9884508,0.0025628186],"study_design_scores_gemma":[0.0001371362,0.000042490057,0.000021044134,0.00009597255,0.000012014979,0.000017059996,0.0023623582,0.00018321419,0.000040755505,0.00012875473,0.9965872,0.000371978],"about_ca_topic_score_codex":0.00015565887,"about_ca_topic_score_gemma":0.0005764856,"teacher_disagreement_score":0.24626422,"about_ca_system_score_codex":0.000049121816,"about_ca_system_score_gemma":0.00001569796,"threshold_uncertainty_score":0.991229},"labels":[],"label_agreement":null},{"id":"W7024266639","doi":"","title":"Reports of tenant farmers' delegates and other informations on Manitoba North-west Territory and other parts of the Dominion of Canada as a field for the settlement of agriculturalists and others.","year":2014,"lang":"en","type":"article","venue":"QSpace (Queen's University Library)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Dominion; Settlement (finance); Field (mathematics); Peninsula; Government (linguistics)","score_opus":0.003223404077169968,"score_gpt":0.1435075860069185,"score_spread":0.14028418192974854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024266639","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.9965281,0.000025575664,0.00004007165,0.0018598933,0.000077129094,0.0002913838,0.00010069673,0.000009918178,0.001067217],"genre_scores_gemma":[0.9994725,0.00001709556,0.000032115513,0.00007552001,0.000008909813,0.0000011563308,0.0000021950946,0.000006061652,0.0003844731],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995937,0.000033627966,0.00014541468,0.000066511006,0.00008143084,0.000079317426],"domain_scores_gemma":[0.9994968,0.0001564516,0.00015137086,0.00014519876,0.000019883084,0.00003028915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054118296,0.00008230376,0.00013835565,0.000037227594,0.000057308436,0.000005734266,0.00007406325,0.000036122572,0.000008765349],"category_scores_gemma":[0.000011469296,0.0000464389,0.000032823278,0.000064500055,0.00007704564,0.00012933605,0.00003311275,0.00004203598,2.3517389e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004874681,0.00011555602,0.8510017,0.002740491,0.0009333436,0.000007002904,0.016694117,0.003910039,0.0011611306,0.02487908,0.09643768,0.0016324059],"study_design_scores_gemma":[0.002055326,0.0007510931,0.37493962,0.0010238073,0.00030226904,0.000011276999,0.040206116,0.00046958032,0.115259826,0.00054058706,0.4638006,0.0006398687],"about_ca_topic_score_codex":0.06376368,"about_ca_topic_score_gemma":0.030987814,"teacher_disagreement_score":0.47606206,"about_ca_system_score_codex":0.000008496778,"about_ca_system_score_gemma":0.00002167994,"threshold_uncertainty_score":0.98669416},"labels":[],"label_agreement":null},{"id":"W7027394154","doi":"","title":"CIRCULANTS AND THE CHROMATIC INDEX OF STEINER TRIPLE SYSTEMS","year":2008,"lang":"en","type":"article","venue":"Czech Digital Mathematics Library (Institute of Mathematics CAS)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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":"Natural Sciences and Engineering Research Council of Canada; Agentúra na Podporu Výskumu a Vývoja; McMaster University","keywords":"Chromatic scale; Upper and lower bounds; Index (typography); Edge coloring; Term (time)","score_opus":0.011042918251037195,"score_gpt":0.17167824720099314,"score_spread":0.16063532894995594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027394154","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.9520736,0.0016948181,0.011104872,0.000018170682,0.0004994219,0.0011143044,0.00013234316,0.0002896528,0.03307283],"genre_scores_gemma":[0.9976046,0.00017804226,0.0014166859,0.00000583638,0.00005345,0.000055392968,0.000017859315,0.0000813252,0.00058682647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997735,0.000029988887,0.0012873333,0.00018766732,0.0004619936,0.00029797186],"domain_scores_gemma":[0.9983197,0.0003480927,0.0003951785,0.000766255,0.00004784448,0.00012296165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002940807,0.00037726364,0.0010523573,0.00016544852,0.00009710583,0.00011601034,0.0005224518,0.00015437327,0.000013034105],"category_scores_gemma":[0.00012342933,0.000262242,0.00021331622,0.00040181258,0.0007061557,0.0012942386,0.00013626207,0.00017416876,0.000021617323],"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.00006561155,0.001041189,0.0012803558,0.041458987,0.0013544153,0.00013770486,0.018277846,0.008557674,0.0016452462,0.9231038,0.0026037954,0.00047339487],"study_design_scores_gemma":[0.010600183,0.0003156364,0.0006372884,0.00860286,0.00055177446,0.0053907665,0.010864302,0.65938306,0.014211034,0.28395656,0.0030563318,0.002430226],"about_ca_topic_score_codex":0.0000023774905,"about_ca_topic_score_gemma":3.37117e-7,"teacher_disagreement_score":0.6508254,"about_ca_system_score_codex":0.000014205987,"about_ca_system_score_gemma":0.000045190907,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W7033345157","doi":"","title":"Portfolio size as funktion of the premium: modeling and optimization","year":2013,"lang":"en","type":"report","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Portfolio; Portfolio optimization; Process (computing); Optimization problem","score_opus":0.011770173520041638,"score_gpt":0.20610049231204247,"score_spread":0.19433031879200083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033345157","genre_codex":"other","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.052404866,0.0038643545,0.06007699,0.00001728928,0.0028460172,0.0010271928,0.00001585133,0.0003647496,0.87938267],"genre_scores_gemma":[0.98980534,0.0014125962,0.00035537838,0.0000049228706,0.00012091712,0.000027357677,0.000012050612,0.000043401033,0.008218031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991211,0.000024404322,0.00034887283,0.00013107502,0.00026609155,0.000108410815],"domain_scores_gemma":[0.99942666,0.000027773434,0.00009559179,0.00027171648,0.0001459686,0.000032259024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002774081,0.00016054936,0.00023623806,0.00005166501,0.000032860054,0.000022714856,0.00009825222,0.00025259412,0.00030036079],"category_scores_gemma":[0.000056330133,0.00011167113,0.000082252875,0.00010041837,0.00001738797,0.00008302689,0.000028629152,0.00015043386,0.0000043213595],"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.0000011006431,0.0000038921935,0.000062598934,0.0004150005,0.000059931113,2.9334527e-7,0.00004775361,0.99610054,0.00013063193,0.0008738457,0.0018173867,0.00048703572],"study_design_scores_gemma":[0.000100630365,0.000012326434,0.0000671813,0.00038142194,0.00009414288,0.000063605585,0.00009268386,0.9953235,0.0004959775,0.001110388,0.0020090456,0.00024911825],"about_ca_topic_score_codex":0.00018370262,"about_ca_topic_score_gemma":0.0000046306454,"teacher_disagreement_score":0.93740046,"about_ca_system_score_codex":0.000036802525,"about_ca_system_score_gemma":0.0000519072,"threshold_uncertainty_score":0.45538163},"labels":[],"label_agreement":null},{"id":"W7039345667","doi":"","title":"Measurement of the <i>B</i><SUP>0</SUP><i><sub>s</sub></i> → μμ effective lifetime with the ATLAS detector","year":2023,"lang":"en","type":"article","venue":"RepositóriUM (Universidade do Minho)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; Fundação para a Ciência e a Tecnologia; Institut National de Physique Nucléaire et de Physique des Particules; Agencia Nacional de Promoción Científica y Tecnológica; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Narodowa Agencja Wymiany Akademickiej; Centre National pour la Recherche Scientifique et Technique; Centre National de la Recherche Scientifique; Israel Science Foundation; Japan Society for the Promotion of Science; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Generalitat Valenciana; Austrian Science Fund; European Regional Development Fund; Bundesministerium für Bildung und Forschung; Ministerstvo Školství, Mládeže a Tělovýchovy; U.S. Department of Energy; National Natural Science Foundation of China; Fundação de Amparo à Pesquisa do Estado de São Paulo; H2020 Marie Skłodowska-Curie Actions; Javna Agencija za Raziskovalno Dejavnost RS; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche; National Science Foundation; Alexander von Humboldt-Stiftung; TRIUMF; Compute Canada; Max-Planck-Gesellschaft; Royal Society; Danmarks Grundforskningsfond; British Columbia Knowledge Development Fund; Türkiye Enerji, Nükleer ve Maden Araştırma Kurumu; Agencia Nacional de Investigación y Desarrollo; Generalitat de Catalunya; Canarie; Deutsche Forschungsgemeinschaft; Centres de Recerca de Catalunya; CERN; Leverhulme Trust; Ministerio de Ciencia e Innovación; European Commission","keywords":"Detector; Large Hadron Collider; Atlas (anatomy); SIGNAL (programming language); Statistical analysis; Statistical model","score_opus":0.004131949506350092,"score_gpt":0.1556927369864869,"score_spread":0.1515607874801368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039345667","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.99360996,0.0004900973,0.00029809415,0.00021894765,0.00023131158,0.000916487,0.000016637197,0.00036116588,0.003857272],"genre_scores_gemma":[0.9995494,0.000020201729,0.000008676605,0.000024124354,0.00009474408,0.000055438228,0.000002858448,0.000068187364,0.00017635294],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979016,0.00028671173,0.00025149807,0.00035029426,0.00073728,0.0004726237],"domain_scores_gemma":[0.9985954,0.00016211021,0.0001348396,0.0008239426,0.00016798895,0.00011570933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064011343,0.00033876835,0.00034907516,0.00018317564,0.00034173985,0.00006262486,0.0005757767,0.00014873313,0.000009656339],"category_scores_gemma":[0.000028166796,0.00022219344,0.00028815525,0.001525186,0.00019892176,0.00016682225,0.00012644811,0.00035689998,0.00009829905],"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.00018930307,0.00004979205,0.00075251923,0.00037982187,0.0009101886,0.00010926216,0.005255943,0.05751901,0.92651385,0.0008317629,0.005473044,0.0020154929],"study_design_scores_gemma":[0.0015350821,0.00027768736,0.010481617,0.00066030974,0.00047289423,0.00019148228,0.0059467917,0.008506293,0.9655391,0.00010021112,0.0055811075,0.00070739875],"about_ca_topic_score_codex":0.0000314449,"about_ca_topic_score_gemma":0.000029727022,"teacher_disagreement_score":0.04901272,"about_ca_system_score_codex":0.00017534895,"about_ca_system_score_gemma":0.000046090052,"threshold_uncertainty_score":0.9060786},"labels":[],"label_agreement":null},{"id":"W7042358783","doi":"","title":"Overlapped CDMA System in Optical Packet Networks: Resource Allocation and Performance Evaluation","year":2009,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Resource allocation; Network packet; Code division multiple access; Packet switching; Resource management (computing); Channel allocation schemes; Interference (communication); Optical communication","score_opus":0.0023458559484461658,"score_gpt":0.12941813711398473,"score_spread":0.12707228116553856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042358783","genre_codex":"other","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.032014173,0.0024632753,0.000092485694,0.00009512976,0.00022654823,0.00041636755,0.00004768376,0.00005208861,0.9645922],"genre_scores_gemma":[0.98034185,0.0003139555,0.00006221267,0.00006485854,0.000094543786,0.00001693436,0.000019996665,0.000084642925,0.019001005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839896,0.00007664865,0.00025647937,0.00019382186,0.0008550281,0.0002190885],"domain_scores_gemma":[0.9995503,0.00006542424,0.000088609115,0.00017266623,2.7629028e-7,0.00012275776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003571183,0.00021384467,0.0002823402,0.000049428505,0.000039436567,0.00001714606,0.00010833915,0.00007811433,0.0000151783825],"category_scores_gemma":[7.374737e-7,0.00021930844,0.000014390412,0.000075992,0.00003380241,0.000107265296,0.000025685998,0.00014851018,3.034287e-9],"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.0013745178,0.00009167601,0.029278263,0.010288562,0.00079789234,0.00021006385,0.0005874518,0.07776435,0.0021110731,0.34992683,0.09846217,0.42910716],"study_design_scores_gemma":[0.0014020917,0.00015627118,0.057309646,0.0047218334,0.00011885657,0.000033148404,0.0033302414,0.7641789,0.002232327,0.00017154429,0.1651856,0.0011595659],"about_ca_topic_score_codex":0.00031823883,"about_ca_topic_score_gemma":0.0070999665,"teacher_disagreement_score":0.94832766,"about_ca_system_score_codex":0.000016319753,"about_ca_system_score_gemma":0.00019016377,"threshold_uncertainty_score":0.8943138},"labels":[],"label_agreement":null},{"id":"W7104378041","doi":"10.55016/ojs/cdm.v20i1.75051","title":"On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Directed graph; Directed acyclic graph; Optimization problem; Feedback arc set","score_opus":0.005041616138665181,"score_gpt":0.2342231469093046,"score_spread":0.2291815307706394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104378041","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.49608937,0.0015076076,0.383788,0.008370257,0.0015842903,0.009716817,0.0026468616,0.002096282,0.09420053],"genre_scores_gemma":[0.992551,0.000027126987,0.0015810716,0.00020946618,0.000085224165,0.0007178045,0.00003722432,0.000076444405,0.0047146003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702036,0.00027036745,0.00091701763,0.00048336052,0.00039955782,0.000909322],"domain_scores_gemma":[0.9964153,0.0014282939,0.00016784524,0.0013764766,0.0003846341,0.00022743583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093455106,0.0006638718,0.0007896658,0.0002714457,0.00091325736,0.00043662105,0.00071841344,0.00018817662,0.00019359919],"category_scores_gemma":[0.0004677255,0.00042690197,0.0002540222,0.0015641141,0.00023700585,0.00013264763,0.00011971963,0.00054781634,0.00044388016],"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.00008074462,0.00021811371,0.00002168398,0.0005197954,0.00078051956,0.000010206756,0.0044784616,0.01579269,0.0013434396,0.9735074,0.0030220565,0.0002249056],"study_design_scores_gemma":[0.005527576,0.0008603578,0.00028048607,0.0138438,0.0019682657,0.000054808617,0.005441071,0.22544122,0.028447203,0.6955944,0.019901725,0.0026391293],"about_ca_topic_score_codex":0.00003211548,"about_ca_topic_score_gemma":0.00007288669,"teacher_disagreement_score":0.4964617,"about_ca_system_score_codex":0.00027873888,"about_ca_system_score_gemma":0.000104950144,"threshold_uncertainty_score":0.99981827},"labels":[],"label_agreement":null},{"id":"W7104381928","doi":"10.55016/ojs/cdm.v19i4.70236","title":"Two families of strongly walk regular graphs from three-weight codes over $\\mathbb{Z_4}$","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Dual polyhedron; Generalization; Coset; Strongly regular graph; Code (set theory)","score_opus":0.006117288750354618,"score_gpt":0.2483047190128505,"score_spread":0.2421874302624959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104381928","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.52788794,0.007942353,0.43920428,0.00032538222,0.0017838482,0.0021054915,0.010630528,0.00036172516,0.009758485],"genre_scores_gemma":[0.9936692,0.0002243869,0.0048650904,0.000032568936,0.0001422133,0.00020096387,0.00022360476,0.00008851588,0.00055342435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954526,0.00021219233,0.002057712,0.00066712644,0.00060801074,0.001002399],"domain_scores_gemma":[0.99579674,0.00093676907,0.00041325594,0.0019631158,0.0005579383,0.00033221053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089657144,0.00087773777,0.0017558462,0.000688338,0.00046766188,0.00021656422,0.0009990609,0.0004346272,0.00033046078],"category_scores_gemma":[0.00058274204,0.0008612408,0.00078242586,0.0016763294,0.00044342224,0.0002896959,0.00035220376,0.000515289,0.00012085965],"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.00006904102,0.0002711978,0.0009928783,0.0010415688,0.0017863709,0.000010039478,0.0019584612,0.0037930969,0.014023146,0.97404855,0.0015650094,0.0004406164],"study_design_scores_gemma":[0.004238454,0.00021818587,0.0029260379,0.0064839786,0.0026299714,0.0000075950347,0.0052463333,0.08936621,0.042257708,0.83873075,0.0061449464,0.001749853],"about_ca_topic_score_codex":0.00018049136,"about_ca_topic_score_gemma":0.0002800642,"teacher_disagreement_score":0.4657813,"about_ca_system_score_codex":0.0002687579,"about_ca_system_score_gemma":0.00016315967,"threshold_uncertainty_score":0.9993838},"labels":[],"label_agreement":null},{"id":"W7104560208","doi":"10.1145/3747199.3747549","title":"On properties of Legendre pairs under compression","year":2025,"lang":"","type":"article","venue":"","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":"Wilfrid Laurier University","funders":"Agencia Estatal de Investigación; European Regional Development Fund","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Hadamard's maximal determinant problem; Matrix (chemical analysis); Algebraic number; Legendre polynomials; Transpose","score_opus":0.015527765079991075,"score_gpt":0.20489816923208531,"score_spread":0.18937040415209425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104560208","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.74466807,0.0056728325,0.007208611,0.0001957204,0.0024066784,0.0004687999,0.0000067024175,0.00019149126,0.23918107],"genre_scores_gemma":[0.9888678,0.000050748564,0.000017226681,0.000072077855,0.000024740151,0.0000122185165,0.0000010013272,0.000018657229,0.010935488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988379,0.00011988048,0.0004389834,0.00020811895,0.00016074679,0.00023436356],"domain_scores_gemma":[0.9994008,0.00006066853,0.000044947647,0.00039949274,0.000046892415,0.000047222104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018746944,0.00022559319,0.00033731104,0.00018331016,0.00008966134,0.000025006908,0.0002018255,0.00016277854,0.00040294472],"category_scores_gemma":[0.000011520131,0.00017394153,0.00014499997,0.00028197488,0.00008644212,0.000077137054,0.00005322491,0.00018736922,0.00006181931],"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.00014299242,0.00015731895,0.0001392767,0.0019724923,0.00027494523,0.0000016068232,0.00061534025,0.05399481,0.10555921,0.83199805,0.0033621395,0.0017818336],"study_design_scores_gemma":[0.0011824757,0.00021093409,0.00089888496,0.007511812,0.000104913954,0.0000025502002,0.0058314865,0.029323105,0.93263805,0.017917756,0.0038471185,0.00053092977],"about_ca_topic_score_codex":0.0000391641,"about_ca_topic_score_gemma":0.000007846237,"teacher_disagreement_score":0.8270788,"about_ca_system_score_codex":0.00003291614,"about_ca_system_score_gemma":0.000028384193,"threshold_uncertainty_score":0.709313},"labels":[],"label_agreement":null},{"id":"W7105508414","doi":"","title":"Spherical codes attached to complex weighing matrices *","year":2025,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Lethbridge","funders":"","keywords":"Code (set theory); Algebra over a field; Matrix (chemical analysis); Focus (optics)","score_opus":0.010518337444408908,"score_gpt":0.22372303969268803,"score_spread":0.21320470224827912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105508414","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.35710078,0.0009848108,0.43201348,0.0030864915,0.00036204216,0.00033727085,0.000025231437,0.00084041327,0.2052495],"genre_scores_gemma":[0.98045087,0.000041322284,0.015917173,0.000108033244,0.000012337889,0.000032882926,0.000032959917,0.000021622714,0.0033828174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791044,0.0011281181,0.00029408687,0.00025446215,0.00015681605,0.00025607308],"domain_scores_gemma":[0.99815226,0.00067897973,0.000046990437,0.00070583884,0.00030056987,0.000115354196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170903,0.00016147549,0.00021679897,0.000122054356,0.00021590863,0.00017884963,0.000552746,0.000078148485,0.00013626253],"category_scores_gemma":[0.00024053363,0.00017058321,0.00008673321,0.00071179704,0.000061745784,0.000099741104,0.00014231152,0.00015818313,0.00007647686],"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.000029844874,0.00039498854,0.012567309,0.00051379995,0.00027166677,0.000009288561,0.012531144,0.0026946259,0.112119235,0.7599443,0.022370411,0.07655339],"study_design_scores_gemma":[0.0016056136,0.0000012327042,0.03769144,0.0028877824,0.00011371533,0.000017073251,0.0015790395,0.15819608,0.25290543,0.013495029,0.5300711,0.0014364796],"about_ca_topic_score_codex":0.00014264448,"about_ca_topic_score_gemma":0.00029687918,"teacher_disagreement_score":0.7464493,"about_ca_system_score_codex":0.000055915814,"about_ca_system_score_gemma":0.000022835424,"threshold_uncertainty_score":0.69561815},"labels":[],"label_agreement":null},{"id":"W7117414058","doi":"10.61091/um125-02","title":"Encoding and enumerating acyclic orientations of graphs","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación","keywords":"Directed acyclic graph; Multipartite; Permutation (music); Vertex (graph theory); Graph; Directed graph; Upper and lower bounds","score_opus":0.010036451430266479,"score_gpt":0.2500600423868139,"score_spread":0.2400235909565474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117414058","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.8573894,0.008694134,0.012868599,0.00011103173,0.0009711014,0.0008405829,0.000058519076,0.0001617056,0.11890495],"genre_scores_gemma":[0.9970112,0.00015098935,0.002315128,0.000014820018,0.00001757214,0.00004933996,0.0000034467923,0.000025051895,0.0004124894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980703,0.00012845088,0.00097565964,0.00029712828,0.00018319333,0.0003452635],"domain_scores_gemma":[0.99853736,0.00066438277,0.0001450955,0.0004904486,0.00007116329,0.00009155231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069378846,0.00029368172,0.00057161035,0.000355891,0.0002423547,0.000067504996,0.0002010868,0.00014271887,0.00023266616],"category_scores_gemma":[0.00035380633,0.00030415147,0.00016486381,0.0007393664,0.00021564629,0.00017876977,0.000088337714,0.00021318997,0.00001944384],"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.00000906757,0.00009704141,0.0006151742,0.0052166893,0.00034264385,0.0000022292543,0.011304626,0.000057910045,0.0071850903,0.97005343,0.00016843266,0.0049476335],"study_design_scores_gemma":[0.001300794,0.00013379286,0.001834466,0.0069348845,0.00086023327,0.000031917818,0.028395776,0.055604044,0.016970834,0.8859454,0.0011836293,0.00080424483],"about_ca_topic_score_codex":0.000009615296,"about_ca_topic_score_gemma":0.0000032315716,"teacher_disagreement_score":0.13962178,"about_ca_system_score_codex":0.000025976602,"about_ca_system_score_gemma":0.0000327505,"threshold_uncertainty_score":0.99994105},"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},{"id":"W7125898959","doi":"10.59350/9cvkr-8fh58","title":"Latin Quarter II: Colours and Latin Squares","year":2022,"lang":"","type":"article","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","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":"Latin square; Square (algebra); Latin Americans; Row; Set (abstract data type); Quarter (Canadian coin)","score_opus":0.007995975369251134,"score_gpt":0.18563644290599782,"score_spread":0.17764046753674667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125898959","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.9524789,0.001446391,0.00019651721,0.0004534819,0.0013046877,0.00039195415,0.000055622117,0.00021521123,0.04345723],"genre_scores_gemma":[0.9870262,0.000015697231,0.000090094785,0.000114515846,0.00009878098,0.00009303991,0.0000079225465,0.000043887936,0.012509824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982945,0.00023981874,0.00043336695,0.00033234633,0.00026565747,0.00043431445],"domain_scores_gemma":[0.9993151,0.00013879972,0.00006500185,0.00031820382,0.000018580788,0.00014434707],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048770482,0.00027936735,0.00032955763,0.00020911315,0.0008533273,0.00007881035,0.00018707034,0.000087712484,0.00850786],"category_scores_gemma":[0.000011673458,0.00030059903,0.00010703325,0.00044820385,0.00006480652,0.00010489469,0.0002142275,0.0004117829,0.000051830535],"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.00032264777,0.0005290671,0.048549067,0.0009451258,0.0008008437,0.00014772483,0.07599756,0.04728898,0.010764138,0.72840667,0.073982336,0.01226586],"study_design_scores_gemma":[0.0068918164,0.005728864,0.05604902,0.0002677541,0.0004341737,0.00019024141,0.17027915,0.25825375,0.0031530221,0.033041783,0.4613124,0.0043980177],"about_ca_topic_score_codex":0.00009234293,"about_ca_topic_score_gemma":0.000040189643,"teacher_disagreement_score":0.6953649,"about_ca_system_score_codex":0.000052563064,"about_ca_system_score_gemma":0.000018507435,"threshold_uncertainty_score":0.9999446},"labels":[],"label_agreement":null},{"id":"W71863754","doi":"","title":"Minimal and near-minimal critical sets in back-circulant latin squares","year":2003,"lang":"en","type":"article","venue":"Australas. J Comb.","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 Manitoba","funders":"","keywords":"Latin square; Circulant matrix; Mathematics; Combinatorics; Square (algebra); Conjecture; Cardinality (data modeling); Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.017913105463955546,"score_gpt":0.24115261198602986,"score_spread":0.2232395065220743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71863754","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.989753,0.00029334176,0.00003240782,0.000051950898,0.00029744647,0.00013050715,0.000013235134,0.00008776212,0.0093403375],"genre_scores_gemma":[0.9993836,0.000008920022,0.0003761401,0.000024029694,0.00002434592,0.00001451398,0.0000045923757,0.00002711992,0.00013671929],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988786,0.00010058807,0.00028611033,0.0002106518,0.0001240864,0.000399962],"domain_scores_gemma":[0.9994825,0.0001679933,0.0000143882835,0.00018429598,0.000015429106,0.00013537628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022336961,0.00019040077,0.0002460469,0.00008910106,0.00005372602,0.00007207706,0.000090992085,0.00013664788,0.00033316662],"category_scores_gemma":[0.00006564466,0.00019503315,0.00005118201,0.0001964311,0.00012280658,0.00011839083,0.0000142388335,0.00023533164,0.0001290865],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015318191,0.00053243665,0.5982187,0.001937278,0.00024248146,0.0009893999,0.0063402834,0.0054643326,0.021207998,0.34776515,0.013781346,0.0033674564],"study_design_scores_gemma":[0.0060717813,0.0008684995,0.8623948,0.0009203847,0.0001369373,0.0009631286,0.0036808236,0.027256222,0.016056152,0.019673092,0.058896586,0.0030815967],"about_ca_topic_score_codex":0.000017579154,"about_ca_topic_score_gemma":0.000022347456,"teacher_disagreement_score":0.32809204,"about_ca_system_score_codex":0.000020090021,"about_ca_system_score_gemma":0.0000138230735,"threshold_uncertainty_score":0.7953221},"labels":[],"label_agreement":null},{"id":"W72092036","doi":"","title":"Degree Sequences of Optimally Edge-Connected Multigraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence; Physics","score_opus":0.012998791461641877,"score_gpt":0.20781882398912047,"score_spread":0.1948200325274786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72092036","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.98722726,0.0011943687,0.000037964608,0.000019980916,0.0011728276,0.00012473522,0.000006217505,0.0002887505,0.009927873],"genre_scores_gemma":[0.999245,0.000029828934,0.0005964389,0.000011287411,0.000014107174,0.000016955406,0.0000041758753,0.00002419062,0.00005802548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915767,0.000043832326,0.00028704174,0.0001403572,0.0001416241,0.00022944887],"domain_scores_gemma":[0.9994624,0.00007997566,0.000048677808,0.00027153708,0.000061908664,0.00007548982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018578165,0.00015629992,0.00022844884,0.000105457315,0.000043658125,0.000014931518,0.00025104918,0.00009834376,0.00007727745],"category_scores_gemma":[0.000023322693,0.00015514322,0.00009435249,0.0002687664,0.00006784219,0.00015551958,0.000017198317,0.0001246453,0.000065501416],"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.00003450026,0.00017010617,0.005761953,0.00022418486,0.00023598778,0.000016046297,0.001581239,0.009019721,0.11907236,0.8519417,0.0027056357,0.009236565],"study_design_scores_gemma":[0.005585915,0.00051013625,0.027097408,0.0005016706,0.0001616473,0.0000747417,0.0009893242,0.031456664,0.648686,0.2675804,0.01531641,0.0020397154],"about_ca_topic_score_codex":0.000014072678,"about_ca_topic_score_gemma":0.0000121795865,"teacher_disagreement_score":0.5843613,"about_ca_system_score_codex":0.000022715685,"about_ca_system_score_gemma":0.000012762621,"threshold_uncertainty_score":0.6326557},"labels":[],"label_agreement":null},{"id":"W72832394","doi":"","title":"Three challenges in Costas arrays","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diagonal; Mathematics; Conjecture; Golomb coding; Parity (physics); Combinatorics; Fraction (chemistry); Discrete mathematics; Computer science; Geometry; Physics","score_opus":0.028554957949343342,"score_gpt":0.20542392526065925,"score_spread":0.1768689673113159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72832394","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.9738134,0.004023298,0.00002582232,0.000040808034,0.0017739355,0.000116101735,0.0000014183586,0.00023561851,0.019969596],"genre_scores_gemma":[0.99924046,0.0006608559,0.00001901625,0.0000072942735,0.0000096474,0.00002022412,0.0000017853309,0.000024473502,0.000016255866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993534,0.000023185377,0.00015999391,0.00013037525,0.00011004633,0.00022301351],"domain_scores_gemma":[0.9996244,0.00004201479,0.00001441166,0.0002509131,0.000013582149,0.000054692842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014860091,0.00012160345,0.00016861678,0.00008223619,0.00004420377,0.0000059723307,0.00014582125,0.000080094695,0.000017642264],"category_scores_gemma":[0.000010421395,0.00012843129,0.00004071177,0.00015634227,0.00003147385,0.00008765732,0.000013715924,0.00015324453,0.00012452355],"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.000008969829,0.00006395049,0.007288944,0.000066228444,0.00003229831,0.00010181489,0.0018684289,0.00038098983,0.00047135327,0.98595977,0.00141662,0.0023406167],"study_design_scores_gemma":[0.001695106,0.000095339376,0.052066445,0.000102752354,0.000007798034,0.00008195484,0.0004307832,0.0026058608,0.0018456809,0.9320368,0.008470093,0.00056137383],"about_ca_topic_score_codex":0.000009441145,"about_ca_topic_score_gemma":0.000030902796,"teacher_disagreement_score":0.05392297,"about_ca_system_score_codex":0.000038936898,"about_ca_system_score_gemma":0.0000067916503,"threshold_uncertainty_score":0.5237276},"labels":[],"label_agreement":null},{"id":"W74597297","doi":"","title":"Some Davenport Constants with Weights and Adhikari and Rath's Conjecture.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Subsequence; Combinatorics; Conjecture; Constant (computer programming); Sequence (biology); Bounded function; Mathematical analysis; Chemistry","score_opus":0.005679560799056794,"score_gpt":0.16967655853066035,"score_spread":0.16399699773160356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74597297","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.99438965,0.0024448878,0.0000068720105,0.000013906345,0.0006871031,0.00014782911,0.000005335453,0.00015414758,0.0021502904],"genre_scores_gemma":[0.99954414,0.00025395915,0.000033772852,0.000023340423,0.0000131232555,0.00001048911,0.000003104876,0.00002419843,0.00009385486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936914,0.000025548014,0.00013615466,0.00016850559,0.00010769177,0.0001929342],"domain_scores_gemma":[0.999628,0.000046769306,0.000025238976,0.00016974246,0.000018637369,0.00011157804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008594291,0.00016348725,0.00021962736,0.000055520184,0.00012468103,0.000021407113,0.000060920294,0.000078428224,0.0000091457105],"category_scores_gemma":[0.0000045072857,0.0001346868,0.000017112496,0.00009473216,0.00016242021,0.00014763043,0.000017177725,0.00012837797,0.000007838418],"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.000028982136,0.000026706792,0.032925777,0.0000768126,0.00011380471,0.00023726681,0.0008651791,0.000013020609,0.00072605675,0.9639321,0.0009056613,0.00014863403],"study_design_scores_gemma":[0.0077794865,0.0006650222,0.07374261,0.00029977236,0.00011670392,0.003007026,0.0004574101,0.0010041466,0.013453643,0.8839733,0.013925253,0.0015756269],"about_ca_topic_score_codex":0.000006581595,"about_ca_topic_score_gemma":0.0000029420366,"teacher_disagreement_score":0.0799588,"about_ca_system_score_codex":0.0000115822795,"about_ca_system_score_gemma":0.000015922602,"threshold_uncertainty_score":0.54923683},"labels":[],"label_agreement":null},{"id":"W75383027","doi":"","title":"4-Circulant Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.00953351272886977,"score_gpt":0.17653289603992614,"score_spread":0.16699938331105638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75383027","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.94559616,0.0011674511,0.000010701799,0.00001792594,0.003180092,0.00008652449,0.0000023390314,0.00048587308,0.04945292],"genre_scores_gemma":[0.9996663,0.000051485917,0.000008699144,0.000022792317,0.0000063197285,0.000014966237,0.0000017845476,0.000024156943,0.00020353637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.000024184925,0.00013608273,0.000105708656,0.00010672959,0.00020834465],"domain_scores_gemma":[0.9996322,0.00002319384,0.000013015923,0.0002455569,0.000013681178,0.00007239626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008566992,0.00011236689,0.00012642192,0.00006449586,0.0000522438,0.000022468432,0.0001412229,0.00006142473,0.00022417343],"category_scores_gemma":[0.000006063794,0.000113097056,0.000067907764,0.00020854738,0.000022637903,0.00007530966,0.000009947978,0.00010671179,0.0005417402],"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":[8.638238e-7,0.00003173302,0.0015278421,0.00003321348,0.000043099786,0.000019904212,0.00029575912,0.00011594129,0.0013615492,0.9829632,0.012704341,0.00090254884],"study_design_scores_gemma":[0.00092883996,0.000055530185,0.0025970007,0.00005028985,0.000024611925,0.000051238952,0.00010353876,0.008645071,0.003487415,0.95173967,0.031782277,0.000534542],"about_ca_topic_score_codex":0.0000029454573,"about_ca_topic_score_gemma":5.7088096e-7,"teacher_disagreement_score":0.054070085,"about_ca_system_score_codex":0.000016661996,"about_ca_system_score_gemma":9.031489e-7,"threshold_uncertainty_score":0.69631547},"labels":[],"label_agreement":null},{"id":"W75935481","doi":"","title":"Lambda-Designs on 8p+1 Points.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lambda; Mathematics; Physics; Optics","score_opus":0.013211806983962163,"score_gpt":0.20637079298105399,"score_spread":0.19315898599709183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75935481","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.83709306,0.00018104988,0.000052737116,0.00002163818,0.004415984,0.00014856311,0.00000246656,0.0004102924,0.15767421],"genre_scores_gemma":[0.99942327,0.000009581884,0.000034295444,0.000058956917,0.000007111636,0.000019632584,0.000002064238,0.00003699315,0.0004081151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992242,0.000089845395,0.00015797555,0.00014347494,0.00013255248,0.00025197287],"domain_scores_gemma":[0.9994934,0.00007225179,0.000018251912,0.00031279927,0.000018077675,0.00008522411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026786546,0.0001520695,0.00015647912,0.000068711975,0.00006441559,0.000025518526,0.0001308248,0.00008395509,0.0001279717],"category_scores_gemma":[0.000036277193,0.00015248799,0.00006648719,0.00019312315,0.000020822315,0.00006779213,0.0000060071216,0.00015540965,0.00063465605],"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.0000040496448,0.00003398292,0.00034666833,0.000018552839,0.00002717354,0.000010331916,0.0001171226,0.00014710368,0.0011185854,0.9932982,0.004761848,0.000116384275],"study_design_scores_gemma":[0.00091966905,0.0001388966,0.000635901,0.000054770564,0.000014364234,0.0000146211805,0.000121928984,0.0001934695,0.030197224,0.9226674,0.044649724,0.00039205872],"about_ca_topic_score_codex":0.0000017584761,"about_ca_topic_score_gemma":6.0939476e-7,"teacher_disagreement_score":0.1623302,"about_ca_system_score_codex":0.000038079466,"about_ca_system_score_gemma":0.00000778458,"threshold_uncertainty_score":0.8157431},"labels":[],"label_agreement":null},{"id":"W76027121","doi":"","title":"Some applications of combinatorial designs to extremal graph theory.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Graph theory; Combinatorics; Discrete mathematics","score_opus":0.011140038620850464,"score_gpt":0.21478753270808115,"score_spread":0.20364749408723068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76027121","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.9550666,0.0017666486,0.00765433,0.000019064892,0.010236845,0.0015574063,0.00003434168,0.00067508424,0.022989687],"genre_scores_gemma":[0.9993897,0.000014980441,0.00018682548,0.000019329516,0.000024958837,0.00022330436,0.0000046211767,0.000045741723,0.00009052538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998746,0.00017205719,0.00035206997,0.00021077631,0.00020621624,0.0003129146],"domain_scores_gemma":[0.9990327,0.0001726313,0.000051083764,0.0005048664,0.00007238477,0.00016635048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005959894,0.00020506767,0.00029621538,0.00018823493,0.00009328318,0.000022004824,0.00029515816,0.000120748795,0.00005338246],"category_scores_gemma":[0.000050098617,0.00021795469,0.00011936271,0.0006195764,0.00006041544,0.0001246251,0.000020016627,0.00014544057,0.00009485577],"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.000014257226,0.00009257526,0.00025818517,0.000049426828,0.00005879951,0.000001596918,0.00025745854,0.0002130043,0.0054723346,0.99264836,0.00071095396,0.00022306698],"study_design_scores_gemma":[0.000660211,0.00007780056,0.00011716006,0.000022542292,0.000025836804,0.0000044461913,0.000153647,0.000018168625,0.025102733,0.9671359,0.0064422092,0.00023933986],"about_ca_topic_score_codex":0.000003024412,"about_ca_topic_score_gemma":4.594946e-7,"teacher_disagreement_score":0.04432312,"about_ca_system_score_codex":0.000035292032,"about_ca_system_score_gemma":0.000022092016,"threshold_uncertainty_score":0.8887934},"labels":[],"label_agreement":null},{"id":"W77443714","doi":"","title":"(K 3 +e, lambda)-group divisible designs of type g t u 1 .","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lambda; Type (biology); Group (periodic table); Combinatorics; Arithmetic; Discrete mathematics; Physics","score_opus":0.019949034074548264,"score_gpt":0.20691167870315758,"score_spread":0.18696264462860931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77443714","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.98315936,0.00050284935,0.00007554983,0.000003598461,0.0019728015,0.000092041424,0.0000022671059,0.0001891424,0.014002364],"genre_scores_gemma":[0.99961776,0.000058408514,0.00006871649,0.000008374024,0.0000075064777,0.000006793158,0.000003898294,0.000025453575,0.00020308296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937844,0.00003534494,0.0001852496,0.000097204946,0.00012729829,0.0001764538],"domain_scores_gemma":[0.99957657,0.00005174603,0.000026724441,0.00024949253,0.000039628045,0.00005583294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013093944,0.00010834419,0.00018288125,0.0000656987,0.000054195207,0.0000051318057,0.00015847915,0.00006894551,0.00005055613],"category_scores_gemma":[0.000015409336,0.00010992044,0.00005360888,0.00031493278,0.00004607844,0.00008537106,0.00001783034,0.00009112286,0.00008386083],"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.0000208546,0.00009438615,0.012035615,0.00011486164,0.00009041437,0.000025866591,0.000627819,0.00050963083,0.02119338,0.95796895,0.007109303,0.00020893457],"study_design_scores_gemma":[0.003603061,0.00096557447,0.044337496,0.00025898972,0.00008454854,0.00013392973,0.00032302694,0.0045148614,0.10516751,0.81478626,0.02439964,0.0014250951],"about_ca_topic_score_codex":0.000008513908,"about_ca_topic_score_gemma":9.2336484e-7,"teacher_disagreement_score":0.14318267,"about_ca_system_score_codex":0.000015493766,"about_ca_system_score_gemma":0.000009329046,"threshold_uncertainty_score":0.44824255},"labels":[],"label_agreement":null},{"id":"W790617462","doi":"","title":"On the diameter of the generalized undirected de bruijn graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Digraph; De Bruijn sequence; Mathematics; Undirected graph; De Bruijn graph; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.008907260818277427,"score_gpt":0.19244935153631856,"score_spread":0.18354209071804115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W790617462","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.99039286,0.00030996124,0.000015418134,0.000041064028,0.0027630841,0.00014745725,0.0000032074558,0.0000850944,0.0062418496],"genre_scores_gemma":[0.9997333,0.000008643072,0.0000151163,0.00007549491,0.000009147833,0.000026377385,7.308143e-7,0.000021438555,0.00010971649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992607,0.00019182258,0.00013653543,0.000058265832,0.00012018557,0.00023245235],"domain_scores_gemma":[0.9993312,0.0002031926,0.00003436873,0.00037040983,0.000016226535,0.000044646225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036464597,0.000104268525,0.00012056631,0.00003239208,0.00007082014,0.000010422808,0.00024285796,0.000058641523,0.000050115163],"category_scores_gemma":[0.000047288286,0.000059529964,0.000108898756,0.00025983795,0.000049894614,0.00004322835,0.000015831933,0.00013127761,0.000019926103],"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.0000056963436,0.000031701988,0.0066510304,0.000013887922,0.000059479135,1.6868218e-7,0.0005182126,0.00007142257,0.009096399,0.98110443,0.0023764868,0.00007107611],"study_design_scores_gemma":[0.00063152,0.00003248909,0.037693255,0.00006639744,0.000046847934,0.0000054522666,0.00009417407,0.00037180356,0.09614404,0.862134,0.002554867,0.00022516339],"about_ca_topic_score_codex":0.000012276525,"about_ca_topic_score_gemma":0.000001829338,"teacher_disagreement_score":0.11897045,"about_ca_system_score_codex":0.000022287995,"about_ca_system_score_gemma":0.0000053852996,"threshold_uncertainty_score":0.24275616},"labels":[],"label_agreement":null},{"id":"W79879488","doi":"","title":"McLeish's construction for Latin squares without intercalates.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Latin square; Intercalation (chemistry); Chemistry; Food science; Inorganic chemistry","score_opus":0.009266359935564312,"score_gpt":0.21141249303037254,"score_spread":0.20214613309480822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79879488","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.9880109,0.00012390038,0.000684947,0.000024862058,0.0037425668,0.00023785257,0.0000050760505,0.00037935365,0.0067905574],"genre_scores_gemma":[0.9994934,0.000012339846,0.00019244639,0.000013913708,0.000022417797,0.000054605418,0.000008437061,0.0000307245,0.00017166935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993825,0.000022590328,0.00018925853,0.00012867808,0.00007265975,0.000204315],"domain_scores_gemma":[0.9996429,0.000058044458,0.000026874903,0.00017374192,0.000040398983,0.000058055746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013291999,0.00012495008,0.00016203475,0.00008436381,0.00006738548,0.000035166395,0.000105291874,0.00008446274,0.00004172273],"category_scores_gemma":[0.00002047113,0.00012826381,0.000067259134,0.00017439674,0.000039045182,0.00011566259,0.000010612767,0.00009191351,0.000037652706],"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.000043454562,0.000030543833,0.03974055,0.000096132506,0.0000782098,0.00000414657,0.00041787548,0.0003779712,0.0022045153,0.9491582,0.0020048642,0.0058435393],"study_design_scores_gemma":[0.0024428964,0.00018493988,0.0051676123,0.00015146733,0.000047770423,0.00006619347,0.0006459184,0.014313788,0.008797668,0.9245647,0.043035273,0.00058176194],"about_ca_topic_score_codex":0.000006031915,"about_ca_topic_score_gemma":0.00000387296,"teacher_disagreement_score":0.041030407,"about_ca_system_score_codex":0.000032123586,"about_ca_system_score_gemma":0.0000049520745,"threshold_uncertainty_score":0.52304465},"labels":[],"label_agreement":null},{"id":"W799218574","doi":"","title":"Some results on 4-cycle packings","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006447865152484092,"score_gpt":0.20106490630664814,"score_spread":0.19461704115416406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W799218574","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.96381515,0.00020347789,0.0000015401044,0.00013375291,0.0025524278,0.000099385965,0.0000054104526,0.00048536886,0.0327035],"genre_scores_gemma":[0.99959296,0.000018866316,0.0000076170904,0.00013836501,0.000034143977,0.000004554519,0.000005450647,0.000017784852,0.00018025764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926317,0.00002771707,0.00018709735,0.00014908946,0.00013705496,0.00023589731],"domain_scores_gemma":[0.99952835,0.000045983972,0.000024163348,0.00031063202,0.00001495947,0.00007594135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018266898,0.0001346788,0.00014366728,0.000066480505,0.000060591352,0.00003083383,0.0001550728,0.00007876149,0.0000065786844],"category_scores_gemma":[0.000024534833,0.00013364013,0.00005840258,0.00015075815,0.000013996483,0.00012419715,0.0000066836064,0.00015013386,0.00025460985],"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.000029408731,0.000043686305,0.00002802382,0.000008929333,0.000014240712,0.000014037169,0.00025299346,0.0005239313,0.0015237808,0.98904073,0.00702307,0.0014971516],"study_design_scores_gemma":[0.0010227634,0.0001998158,0.002843745,0.000059231254,0.000006240138,0.0000040942823,0.000034460845,0.0005859007,0.008217906,0.97934586,0.007440619,0.00023939354],"about_ca_topic_score_codex":0.0000024933001,"about_ca_topic_score_gemma":2.5948964e-7,"teacher_disagreement_score":0.035777826,"about_ca_system_score_codex":0.00003286647,"about_ca_system_score_gemma":0.0000037084405,"threshold_uncertainty_score":0.54496866},"labels":[],"label_agreement":null},{"id":"W8041970","doi":"","title":"About Multicoloured Cycles In K_{24n+1}.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.006737357559729747,"score_gpt":0.20348953988985208,"score_spread":0.19675218233012234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8041970","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.9775219,0.000854036,0.0000087600965,0.0000069054163,0.0025091795,0.00015210969,0.0000014061042,0.00019841988,0.018747266],"genre_scores_gemma":[0.999723,0.000023929977,0.000050130744,0.000021070706,0.000004114602,0.00003453886,0.000002155848,0.000029431554,0.00011160125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.00008975893,0.00021589882,0.00013755784,0.00010133254,0.00027746215],"domain_scores_gemma":[0.99957454,0.000065674285,0.000019744179,0.00023331834,0.000015794514,0.00009094355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023090749,0.00014072857,0.00018543135,0.00009656284,0.000039462877,0.000024882245,0.0001315328,0.000104398976,0.000041453444],"category_scores_gemma":[0.00006441497,0.00014910946,0.000051078805,0.0002483479,0.000025242723,0.000087939596,0.000008704648,0.00016381651,0.00011859803],"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.000006917771,0.00006945877,0.017664317,0.00005462317,0.000027350576,0.000026169353,0.0008644289,0.0008174811,0.0022260095,0.9771771,0.0007478722,0.00031831735],"study_design_scores_gemma":[0.004402181,0.00010317107,0.024613664,0.00021927166,0.000021628068,0.000028668532,0.0012670596,0.0036779048,0.020057663,0.9152784,0.029341547,0.0009888649],"about_ca_topic_score_codex":0.000008860547,"about_ca_topic_score_gemma":0.000009123589,"teacher_disagreement_score":0.06189868,"about_ca_system_score_codex":0.000045778837,"about_ca_system_score_gemma":0.000011545439,"threshold_uncertainty_score":0.60805076},"labels":[],"label_agreement":null},{"id":"W83024883","doi":"","title":"A note on the Alon-Saks-Seymour coloring conjecture.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.012286738029871656,"score_gpt":0.19181035952498893,"score_spread":0.17952362149511727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83024883","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.95412993,0.00036015318,0.00001691994,0.0002671379,0.0039963685,0.00023533632,0.0000038334742,0.00038160928,0.04060868],"genre_scores_gemma":[0.9993958,0.000022621134,0.00000624324,0.00011626509,0.000029795068,0.000045928504,0.0000010640861,0.000037598616,0.0003446993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991305,0.00007072164,0.00017746547,0.0001556025,0.00017140633,0.0002943052],"domain_scores_gemma":[0.9992506,0.0002479709,0.00002916244,0.00038616237,0.000017885519,0.00006821661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022535548,0.00018371812,0.00017392579,0.000053890988,0.00015196996,0.00005153045,0.00026731123,0.00009675672,0.00020768004],"category_scores_gemma":[0.0000380043,0.00013849285,0.00008607966,0.00022864268,0.000037688333,0.000063240805,0.00002199485,0.00029061403,0.00064247835],"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.000006560689,0.00004019363,0.00027264765,0.000027650447,0.000057708552,0.000024223424,0.00087392837,0.0009352701,0.0014491809,0.9832167,0.012575071,0.0005208795],"study_design_scores_gemma":[0.003610643,0.0006059487,0.0033337339,0.0003853838,0.000099133475,0.00010248911,0.00057903246,0.039021038,0.04830913,0.7395209,0.16266987,0.0017626935],"about_ca_topic_score_codex":0.000006715305,"about_ca_topic_score_gemma":0.0000031256154,"teacher_disagreement_score":0.24369577,"about_ca_system_score_codex":0.000051735442,"about_ca_system_score_gemma":0.0000028267136,"threshold_uncertainty_score":0.8257974},"labels":[],"label_agreement":null},{"id":"W83305989","doi":"","title":"On a well-spread halving of regular multigraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.004842996645751768,"score_gpt":0.19622034415575465,"score_spread":0.19137734751000288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83305989","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.9724281,0.0003503356,0.00014620833,0.00000441092,0.0019775014,0.00012405729,0.000001723081,0.00019832996,0.024769366],"genre_scores_gemma":[0.9997829,0.000009343394,0.000060537594,0.000011619242,0.000007135113,0.000005057495,0.000002134333,0.000029076633,0.00009217018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991424,0.000028790337,0.00026838548,0.00013405958,0.00017202746,0.00025434745],"domain_scores_gemma":[0.99934536,0.00015964344,0.00004408488,0.00034216512,0.00003253766,0.00007623343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000476631,0.00014213183,0.0001983286,0.00015853341,0.000042639414,0.000009243027,0.00017073534,0.000098263175,0.000029350078],"category_scores_gemma":[0.000029278803,0.00014543111,0.00010055554,0.0002797123,0.00004093613,0.00006104182,0.00001390011,0.00013833278,0.00004877161],"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.000028175722,0.000065614666,0.0015496248,0.0000947029,0.00006628385,0.00001882528,0.00042821356,0.00041791066,0.014315186,0.9804479,0.0014846822,0.0010829162],"study_design_scores_gemma":[0.0020392695,0.0002590854,0.01384245,0.00042619818,0.000040506657,0.000015380121,0.0004823714,0.0017301824,0.24630113,0.7291732,0.0050733304,0.00061693956],"about_ca_topic_score_codex":0.000015943437,"about_ca_topic_score_gemma":0.000004694458,"teacher_disagreement_score":0.2512747,"about_ca_system_score_codex":0.000023197357,"about_ca_system_score_gemma":0.000003261957,"threshold_uncertainty_score":0.5930509},"labels":[],"label_agreement":null},{"id":"W83819121","doi":"","title":"Families of 4-Sets Without Property B.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Pure mathematics; Combinatorics; Epistemology; Philosophy","score_opus":0.009102544129121957,"score_gpt":0.2029822138299365,"score_spread":0.19387966970081455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83819121","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.9603314,0.00024170779,0.000012312458,0.00000864225,0.001264999,0.000114252514,0.0000018104901,0.00018337053,0.037841532],"genre_scores_gemma":[0.99946445,0.000059362617,0.000024909268,0.0000074140244,0.0000045438496,0.000014012564,0.0000019979275,0.000021015596,0.00040229651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944186,0.000028222217,0.00017385751,0.00008960803,0.00010947326,0.00015699811],"domain_scores_gemma":[0.99965274,0.000018927985,0.000023214194,0.00022949492,0.000031946045,0.000043688022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012411895,0.0001044171,0.00017505424,0.00005524218,0.000029630039,0.000008821662,0.00013717191,0.00005598176,0.000029680481],"category_scores_gemma":[0.000011649829,0.00007656122,0.00004682059,0.00018035831,0.00003878911,0.000082526465,0.000014852119,0.000077405806,0.00004683143],"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.000060469545,0.00021954639,0.2315633,0.00045312586,0.00025866798,0.000038944192,0.0026171373,0.0009495621,0.028866528,0.71777743,0.0066683986,0.010526902],"study_design_scores_gemma":[0.00474041,0.00045252062,0.056334507,0.00055566465,0.00011132784,0.00013553118,0.0018714864,0.010139894,0.06992667,0.7366405,0.117451325,0.001640161],"about_ca_topic_score_codex":0.0000228129,"about_ca_topic_score_gemma":0.000003470172,"teacher_disagreement_score":0.17522879,"about_ca_system_score_codex":0.000013490257,"about_ca_system_score_gemma":0.0000062000413,"threshold_uncertainty_score":0.3122076},"labels":[],"label_agreement":null},{"id":"W84484537","doi":"","title":"Non-isomorphic Minimal Colorings of K_{4n+3}.","year":2002,"lang":"zh","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0117901448158318,"score_gpt":0.1917539557327879,"score_spread":0.1799638109169561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84484537","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.8577252,0.0021792504,0.0000035558069,0.000071837545,0.00528634,0.0003821183,0.000041450417,0.00013930627,0.13417095],"genre_scores_gemma":[0.998342,0.00019067101,0.00002300005,0.000021825617,0.000029974704,0.00003907291,0.000007631417,0.00007352962,0.0012723078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975901,0.0000990308,0.0008119934,0.00041146862,0.000413799,0.0006735859],"domain_scores_gemma":[0.9985224,0.00017763715,0.00022942586,0.000712464,0.000118971846,0.00023908512],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042629312,0.00045940685,0.0007647678,0.00022077067,0.00013444848,0.000052553383,0.00053827325,0.00037430777,0.0008179776],"category_scores_gemma":[0.000049495156,0.000531996,0.00029446828,0.00068276084,0.00018736653,0.0002217616,0.00009955719,0.00046256345,0.0010376616],"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.00004404404,0.00040704446,0.0066687893,0.0007360496,0.00032014036,0.00007206253,0.002026208,0.00015627687,0.006429824,0.97675866,0.0060880054,0.00029288782],"study_design_scores_gemma":[0.016465072,0.0039534904,0.023804016,0.0029041297,0.0010427102,0.00023210503,0.0028285806,0.022355683,0.035442024,0.8540116,0.03214575,0.004814868],"about_ca_topic_score_codex":0.000053561947,"about_ca_topic_score_gemma":0.0000025710629,"teacher_disagreement_score":0.14061679,"about_ca_system_score_codex":0.00008816067,"about_ca_system_score_gemma":0.000018773902,"threshold_uncertainty_score":0.9997401},"labels":[],"label_agreement":null},{"id":"W88699973","doi":"10.25596/jalc-2006-399","title":"Intervals of Partial Clones Containing Maximal Clones","year":2006,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","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":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Combinatorics; clone (Java method); Mathematics; Bounded function; Permutation (music); Order (exchange); Equivalence relation; Discrete mathematics; Prime (order theory); Biology; Physics; Genetics; Gene; Mathematical analysis","score_opus":0.007721498035841037,"score_gpt":0.180193418547502,"score_spread":0.17247192051166096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88699973","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.95900697,0.00067367085,0.0027631603,0.00006128537,0.0009600425,0.00022897226,0.000046336496,0.00043395697,0.03582559],"genre_scores_gemma":[0.9985528,0.000030062778,0.00022501104,0.0000164767,0.00028538945,0.000005554717,0.000031268733,0.00004478171,0.0008086746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850875,0.0000893494,0.0004239383,0.00027002455,0.00025489077,0.00045303354],"domain_scores_gemma":[0.9992814,0.000077079094,0.000111998255,0.00035071757,0.000081209255,0.00009757628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025767708,0.0002881774,0.00047203424,0.00022931492,0.00012384001,0.00003327451,0.0003776388,0.00017897223,0.0001678187],"category_scores_gemma":[0.000012268755,0.0003086001,0.00023517809,0.0003068899,0.00012841917,0.0005952317,0.000097130614,0.00019768445,0.00011088826],"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.002268787,0.0009422939,0.058865834,0.0030090646,0.002674122,0.0012722625,0.017250765,0.07276312,0.17320251,0.6180552,0.026534205,0.023161832],"study_design_scores_gemma":[0.022889255,0.003111923,0.10358403,0.002740527,0.002939593,0.00053517474,0.08664183,0.04825369,0.26300985,0.027321013,0.43008387,0.008889251],"about_ca_topic_score_codex":0.00033816736,"about_ca_topic_score_gemma":0.00006987939,"teacher_disagreement_score":0.5907342,"about_ca_system_score_codex":0.00009216586,"about_ca_system_score_gemma":0.000028355798,"threshold_uncertainty_score":0.9999366},"labels":[],"label_agreement":null},{"id":"W89704318","doi":"","title":"i?(1)-perfect graphs with girth at least six.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics","score_opus":0.006569376156257282,"score_gpt":0.16942580496164364,"score_spread":0.16285642880538637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89704318","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.97875625,0.00044022512,0.000008754656,0.000009412771,0.0013495546,0.00014953957,0.000004093911,0.00046205867,0.018820107],"genre_scores_gemma":[0.9992313,0.000043943197,0.00002071644,0.000018648665,0.000009678959,0.000029776586,0.0000068952004,0.000052485346,0.000586572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908227,0.000044842458,0.00016465825,0.00019369267,0.00019637113,0.00031816444],"domain_scores_gemma":[0.9994132,0.000043721808,0.000027308823,0.00036377806,0.000031789743,0.000120218625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010345844,0.00021134061,0.00022791614,0.00008720408,0.00019974129,0.000014047542,0.00018281507,0.00008167082,0.00007139112],"category_scores_gemma":[0.0000058033515,0.00018431456,0.00007879614,0.00033135025,0.0000935232,0.00012210294,0.000025374604,0.00015903266,0.0002466168],"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.00013750627,0.00015400833,0.16371718,0.00018251635,0.0003524925,0.00036455225,0.0018508744,0.001982214,0.0062050526,0.8092531,0.015429756,0.00037077584],"study_design_scores_gemma":[0.022101395,0.0032203428,0.2659357,0.0008990769,0.00037079418,0.0050244876,0.001181339,0.0060205194,0.10893431,0.44718546,0.13153589,0.007590695],"about_ca_topic_score_codex":0.000012699271,"about_ca_topic_score_gemma":0.000013659814,"teacher_disagreement_score":0.36206764,"about_ca_system_score_codex":0.00005102079,"about_ca_system_score_gemma":0.00001077211,"threshold_uncertainty_score":0.75161296},"labels":[],"label_agreement":null},{"id":"W94221996","doi":"","title":"Nilpotent-SQS-Skeins with Nilpotent Derived Sloops.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Nilpotent; Pure mathematics; Nilpotent group","score_opus":0.004353581427768965,"score_gpt":0.16702429106666974,"score_spread":0.1626707096389008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94221996","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.9725435,0.00039332276,0.000048971175,0.00003816709,0.001153047,0.00023980597,0.0000058211067,0.0005880717,0.024989326],"genre_scores_gemma":[0.99862,0.0000663075,0.00008064911,0.00005508682,0.000019505094,0.00004732706,0.000011389593,0.00006805068,0.0010316843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987607,0.000056827463,0.00025183326,0.00025284468,0.00024317336,0.00043461676],"domain_scores_gemma":[0.9992786,0.000031928586,0.000028419163,0.00045494718,0.000037293416,0.00016878429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013932008,0.00027265196,0.00027899034,0.000072251605,0.00012900683,0.000056069224,0.00026803074,0.000116048745,0.0005044709],"category_scores_gemma":[0.0000045619618,0.00024270524,0.000088401874,0.00030372248,0.00006395953,0.0001671644,0.000015102267,0.00022069344,0.00051243784],"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.0005221553,0.0009462858,0.011228498,0.0005966055,0.0015493146,0.0007328501,0.0049907737,0.030317029,0.038427807,0.837281,0.01714461,0.0562631],"study_design_scores_gemma":[0.021218304,0.0023769222,0.073118694,0.001207292,0.0006223707,0.0008161573,0.0020099324,0.018170271,0.10193727,0.56372297,0.20773008,0.007069736],"about_ca_topic_score_codex":0.000023275876,"about_ca_topic_score_gemma":0.000007176766,"teacher_disagreement_score":0.273558,"about_ca_system_score_codex":0.000055553675,"about_ca_system_score_gemma":0.000015171569,"threshold_uncertainty_score":0.98972327},"labels":[],"label_agreement":null},{"id":"W94667062","doi":"","title":"(2 mod 4)-cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics","score_opus":0.007451476060539044,"score_gpt":0.19618654542113895,"score_spread":0.18873506936059992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94667062","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.93746054,0.0003844916,0.00005271953,0.000017744616,0.0025651415,0.00007293247,0.0000011550088,0.00044014366,0.059005138],"genre_scores_gemma":[0.99950725,0.000040040384,0.000015114499,0.000020534048,0.00001254866,0.000014162126,0.0000025058953,0.00002567107,0.00036217103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994535,0.000020559477,0.0001264699,0.00009874741,0.00009462547,0.000206099],"domain_scores_gemma":[0.9996462,0.000023699435,0.000011619307,0.00023396905,0.000014908576,0.00006963369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010418427,0.00010463136,0.000117310236,0.00004852521,0.000046773173,0.000021894297,0.00014216865,0.00006268907,0.000086900516],"category_scores_gemma":[0.0000063962884,0.000108391934,0.00004942649,0.00018493287,0.000018650451,0.00009186917,0.0000131537945,0.0000988659,0.00031480234],"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.0000064124297,0.000033930864,0.0044082357,0.00002531352,0.000042334406,0.00003460976,0.00020868343,0.0006961565,0.0015890774,0.98549366,0.005314724,0.0021468792],"study_design_scores_gemma":[0.0008716285,0.00004146315,0.005744356,0.0000371197,0.000015421167,0.000049571227,0.00012356808,0.0040728888,0.0028357124,0.9309681,0.0548416,0.00039857705],"about_ca_topic_score_codex":0.0000062931294,"about_ca_topic_score_gemma":0.0000015769983,"teacher_disagreement_score":0.062046718,"about_ca_system_score_codex":0.000024626876,"about_ca_system_score_gemma":0.0000036139481,"threshold_uncertainty_score":0.44200948},"labels":[],"label_agreement":null},{"id":"W9648232","doi":"10.1271/bbb.62.993","title":"New Series of Dudeney Sets for p + 2 Vertices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Combinatorics; Geology","score_opus":0.012263626041807859,"score_gpt":0.20388496235456388,"score_spread":0.19162133631275602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9648232","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.9839164,0.0015323353,0.00013244909,0.000053952655,0.0038284506,0.00024710913,0.000011065462,0.00022777847,0.010050457],"genre_scores_gemma":[0.9990934,0.00002805939,0.00017687875,0.00000785898,0.000009631173,0.000015247736,0.0000022463573,0.000021606245,0.00064504216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.000012648127,0.00016740896,0.000082175975,0.00008017285,0.00015398422],"domain_scores_gemma":[0.9996537,0.00004468438,0.00002491207,0.00018757982,0.000025180181,0.00006395686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007381201,0.00009368915,0.00015560586,0.000038246922,0.000030317437,0.000012626545,0.0001304669,0.0000585648,0.00010161928],"category_scores_gemma":[0.000017547627,0.00009731683,0.00006220279,0.00011686052,0.000015536105,0.00013007972,0.000010112624,0.000045385197,0.00003330447],"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.00001921541,0.00003704923,0.00084388454,0.0002847367,0.00010807643,0.0000028051832,0.0011588943,0.00035321582,0.0045389296,0.9462028,0.043512788,0.0029375674],"study_design_scores_gemma":[0.002684674,0.0003209378,0.0012601165,0.00014410193,0.000076774675,0.00001774718,0.00025860153,0.005906404,0.08160705,0.8349698,0.07218908,0.00056470325],"about_ca_topic_score_codex":0.000006330019,"about_ca_topic_score_gemma":0.0000025540285,"teacher_disagreement_score":0.111233026,"about_ca_system_score_codex":0.000012165921,"about_ca_system_score_gemma":0.00000374993,"threshold_uncertainty_score":0.3968465},"labels":[],"label_agreement":null},{"id":"W97490400","doi":"","title":"Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quartic graph; Bipartite graph; Combinatorics; Complete bipartite graph; Tensor product; Graph; Voltage graph; Discrete mathematics; Line graph; Pure mathematics","score_opus":0.008344616813618661,"score_gpt":0.18789505573802162,"score_spread":0.17955043892440295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97490400","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.99656206,0.0007510647,0.000028478244,0.000057437614,0.0007344787,0.00032008157,0.000088348774,0.0000793522,0.0013786787],"genre_scores_gemma":[0.999788,0.000012584516,0.00010556327,0.000009640778,0.000007999602,0.000023323966,0.0000076110696,0.000023253919,0.00002204098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898475,0.00009249228,0.0003832608,0.00016571395,0.00016198058,0.0002118135],"domain_scores_gemma":[0.9992738,0.000070610826,0.00010107264,0.0004343434,0.000076568474,0.0000436362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017455677,0.00016376274,0.00030481475,0.00013017369,0.000117483185,0.000014951249,0.00021447844,0.00004455411,0.0000066404023],"category_scores_gemma":[0.0000088125225,0.00013379799,0.00013267332,0.0005252338,0.00024613086,0.00006756714,0.000039978713,0.00011881976,0.0000029543762],"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.00001818578,0.00013234194,0.03171194,0.00029928915,0.00013431924,0.000002321714,0.0003325193,0.001122536,0.19809067,0.76698416,0.0011083087,0.000063385516],"study_design_scores_gemma":[0.0014847076,0.00012429296,0.36242002,0.000297719,0.00012222979,0.00004580172,0.0001027358,0.0012170235,0.025337901,0.6056029,0.0028172617,0.00042739967],"about_ca_topic_score_codex":0.00012304317,"about_ca_topic_score_gemma":0.00004698986,"teacher_disagreement_score":0.3307081,"about_ca_system_score_codex":0.0000099468625,"about_ca_system_score_gemma":0.000007923412,"threshold_uncertainty_score":0.54561234},"labels":[],"label_agreement":null},{"id":"W98525897","doi":"","title":"Non-isomorphic Minimal Bicovers of K8.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.008540832429105345,"score_gpt":0.17758552450257495,"score_spread":0.16904469207346962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98525897","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.97591054,0.000345223,0.000005361718,0.000011272328,0.002024808,0.000092037786,0.00000797413,0.000111056645,0.021491703],"genre_scores_gemma":[0.99976367,0.00002687528,0.000012715807,0.000007882434,0.0000071368154,0.000009331615,0.000002415147,0.000018196428,0.00015176598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993555,0.000017692104,0.00020505665,0.000104469524,0.00012833418,0.00018892674],"domain_scores_gemma":[0.9996006,0.000039357044,0.000033960536,0.00024227443,0.000023061251,0.000060754555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009880975,0.00011884401,0.00019157722,0.000078083714,0.000029776204,0.000010009641,0.00015961748,0.00007822295,0.00021208856],"category_scores_gemma":[0.000009222617,0.00012548394,0.00007761775,0.0002262618,0.000041720326,0.0000839475,0.000014983767,0.000101021345,0.00021601566],"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.000036962247,0.00039563945,0.023111537,0.0006383953,0.00039642068,0.00006932916,0.0031466905,0.0016463678,0.06890703,0.8302679,0.06977546,0.0016082829],"study_design_scores_gemma":[0.015266104,0.001826465,0.027147485,0.00087746425,0.00034895778,0.00015437309,0.0019927726,0.07822603,0.3396392,0.4627353,0.06772855,0.0040573077],"about_ca_topic_score_codex":0.0000058572714,"about_ca_topic_score_gemma":5.6445134e-7,"teacher_disagreement_score":0.36753258,"about_ca_system_score_codex":0.00001762419,"about_ca_system_score_gemma":0.0000026707787,"threshold_uncertainty_score":0.5117087},"labels":[],"label_agreement":null},{"id":"W98905922","doi":"","title":"Even (m1, m2, ..., mr)-cycle systems of the complete graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.007542788810694694,"score_gpt":0.18441058062592242,"score_spread":0.17686779181522772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98905922","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.987399,0.0009269109,0.000051037478,0.00002551843,0.006002777,0.00030103064,0.000019228257,0.00018287144,0.005091665],"genre_scores_gemma":[0.9998369,0.000011744707,0.000009260771,0.0000117793315,0.000013966764,0.000027209468,0.0000028419367,0.000033409025,0.000052845076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.00007689867,0.00032269274,0.00014183005,0.00023336845,0.00025460584],"domain_scores_gemma":[0.9992328,0.000047760997,0.00007219852,0.0005363688,0.00004565519,0.00006521324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002362009,0.00016808315,0.0002665594,0.000064274085,0.0001005451,0.000024270581,0.00041731587,0.00009076092,0.000008318986],"category_scores_gemma":[0.000013937824,0.00013410758,0.0001483687,0.00039255584,0.000078379686,0.00008589294,0.000042982974,0.00016631241,0.00004350475],"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.0000051553443,0.000043744472,0.0015148849,0.00016497816,0.00008805383,0.0000032440992,0.00041810444,0.019457005,0.006777565,0.9709986,0.0004982091,0.000030440238],"study_design_scores_gemma":[0.0026637618,0.00011421045,0.011293409,0.0005534364,0.00007226679,0.000046703768,0.00056177465,0.0013605629,0.01132474,0.96601033,0.005407206,0.0005916012],"about_ca_topic_score_codex":0.00013468832,"about_ca_topic_score_gemma":0.000009312706,"teacher_disagreement_score":0.018096443,"about_ca_system_score_codex":0.00005063142,"about_ca_system_score_gemma":0.000016267606,"threshold_uncertainty_score":0.5468749},"labels":[],"label_agreement":null}]}