{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62566286,0.0010913984,0.3046329,0.0004421119,0.00021133383,0.0004349428,0.00078382867,0.00045257638,0.06628808],"genre_scores_gemma":[0.8765769,0.000825486,0.10065474,0.00048770584,0.00015143966,0.00032822494,0.002077423,0.00016867301,0.018729363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996761,0.00006431094,0.000016475038,0.00009092401,0.00006371111,0.000088487184],"domain_scores_gemma":[0.9995074,0.000102739876,0.00007338421,0.00017438564,0.00007349136,0.00006847268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020446519,0.0005093791,0.00028204347,0.0008629662,0.00070441875,0.00067329156,0.00043493783,0.00033092164,0.005122942],"category_scores_gemma":[0.0008079177,0.00028053415,0.0006153786,0.0006297505,0.0008650573,0.0009965374,0.0008726328,0.00068741635,0.0006099455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000640894,0.00020257916,0.0025339078,0.00037630898,0.000092969785,0.0010282733,0.0010284788,0.045280464,0.0947507,0.6521248,0.007959566,0.19398095],"study_design_scores_gemma":[0.00011237327,0.00033691735,0.002980681,0.00013485769,0.0001270766,0.0014151073,0.00064593874,0.07109136,0.042392623,0.8105779,0.07010826,0.00007684737],"about_ca_topic_score_codex":0.0017085489,"about_ca_topic_score_gemma":0.002780736,"teacher_disagreement_score":0.005122942,"about_ca_system_score_codex":0.00045737936,"about_ca_system_score_gemma":0.0006841727,"threshold_uncertainty_score":0.017137885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01624288,0.014693698,0.3651612,0.007305352,0.00062504876,0.000058265698,0.0002745127,0.00048689527,0.5951522],"genre_scores_gemma":[0.59863436,0.020304356,0.1738782,0.0034770137,0.0025354468,0.00050867704,0.000845867,0.00080112956,0.19901502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935704,0.00022728332,0.00002500845,0.00013826114,0.00017183508,0.00008055053],"domain_scores_gemma":[0.9982843,0.0011974241,0.000051363742,0.00027585993,0.00015711489,0.000033943274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008366354,0.00065317185,0.0008125737,0.0011268122,0.0017729047,0.0044721,0.0015084572,0.0011847352,0.011473376],"category_scores_gemma":[0.0029369132,0.0005802877,0.0007500312,0.0024456787,0.005233728,0.009965531,0.0018644496,0.0043247417,0.0036522436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054905418,0.000007118813,0.000033288055,0.000036078163,0.0000022058566,0.000014952363,0.00006545053,0.00047483156,0.00010611741,0.9874079,0.0033013527,0.008545253],"study_design_scores_gemma":[0.000003868163,0.000002980329,0.000048056747,0.000016444263,0.0000039572737,0.0000467296,0.000026204907,0.0014979608,0.00021047393,0.98050827,0.017631348,0.0000036652207],"about_ca_topic_score_codex":0.0010265387,"about_ca_topic_score_gemma":0.0009846531,"teacher_disagreement_score":0.011473376,"about_ca_system_score_codex":0.0019987775,"about_ca_system_score_gemma":0.0008155353,"threshold_uncertainty_score":0.03838229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7545645,0.00031933407,0.17305087,0.0005018371,0.000102850994,0.00009783281,0.00031684685,0.0006561867,0.07038974],"genre_scores_gemma":[0.9378596,0.00028846916,0.037806444,0.00018227754,0.000058435846,0.000089547,0.00048325484,0.00019688066,0.023035163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957556,0.00010018285,0.00002457,0.00009758067,0.00010808038,0.00009408661],"domain_scores_gemma":[0.99682474,0.0016889378,0.00042726583,0.00027642422,0.00044864786,0.00033390825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033642462,0.0004666534,0.00035331328,0.0016220093,0.0010644089,0.0012782144,0.0011480886,0.0008889981,0.009216395],"category_scores_gemma":[0.0037862922,0.00036395853,0.00040336672,0.0009227924,0.0010032568,0.0016078111,0.0011142322,0.0012919442,0.0008334221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013584067,0.000078583915,0.001181181,0.00011428616,0.000016474061,0.00073213346,0.0007719213,0.0058937715,0.014020037,0.95318806,0.0019607455,0.021906905],"study_design_scores_gemma":[0.000040636707,0.00006528475,0.001847917,0.00005547476,0.0000284189,0.0006169014,0.0004939098,0.046161745,0.0061312653,0.9361123,0.008410507,0.00003561348],"about_ca_topic_score_codex":0.0011452542,"about_ca_topic_score_gemma":0.0022551012,"teacher_disagreement_score":0.009216395,"about_ca_system_score_codex":0.00088905444,"about_ca_system_score_gemma":0.00039925895,"threshold_uncertainty_score":0.030831933},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15519884,0.0016133954,0.15819173,0.0029625583,0.0027365969,0.000111004374,0.002031122,0.001301905,0.67585284],"genre_scores_gemma":[0.68654853,0.0011315724,0.039846785,0.0011636713,0.0008288628,0.00016170126,0.0013276837,0.00056305045,0.26842827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937195,0.00008781104,0.000030217017,0.0001716272,0.0001680938,0.0001702997],"domain_scores_gemma":[0.9990491,0.00025541865,0.000086194224,0.0001782831,0.000202229,0.00022871468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047651157,0.0005897122,0.0007420781,0.0019269445,0.0024647438,0.0029610293,0.0012278782,0.0007225733,0.044304203],"category_scores_gemma":[0.0019450726,0.00030943652,0.0005367064,0.00087149354,0.0016059452,0.0039337273,0.0024669783,0.0016813964,0.008706556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007124641,0.000029277748,0.00043282192,0.000070274735,0.00001241025,0.00007634174,0.00008043227,0.0006960641,0.0015352488,0.9573457,0.013568994,0.026081098],"study_design_scores_gemma":[0.00001535736,0.000034942575,0.0007016623,0.000037622936,0.000018890309,0.0003618416,0.00010781398,0.0049892277,0.0034509406,0.92822963,0.062029827,0.000022320379],"about_ca_topic_score_codex":0.0007431843,"about_ca_topic_score_gemma":0.001532782,"teacher_disagreement_score":0.044304203,"about_ca_system_score_codex":0.001069649,"about_ca_system_score_gemma":0.0008198723,"threshold_uncertainty_score":0.14821231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6399782,0.00081237464,0.17022167,0.0014972197,0.00026485024,0.00016513334,0.002553547,0.0018289451,0.18267807],"genre_scores_gemma":[0.9452811,0.0003715264,0.025604842,0.00037334673,0.00008820832,0.000082311926,0.0014647186,0.00020958357,0.026524335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939024,0.000092018796,0.00003954849,0.00015652565,0.00016642218,0.00015518838],"domain_scores_gemma":[0.99723756,0.0011099215,0.00048983475,0.00043634788,0.00032988223,0.0003965002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509732,0.0004039191,0.00051808247,0.0013457284,0.0009965664,0.0028407695,0.0007172245,0.0009972493,0.011283711],"category_scores_gemma":[0.0032345946,0.0004903745,0.00048089804,0.0012158545,0.0011416945,0.0029479924,0.001201869,0.0013103267,0.0017797101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003478769,0.0001277792,0.0024740617,0.00018308082,0.00006643451,0.001538309,0.0006659719,0.006383704,0.020824768,0.93021137,0.008663525,0.028513204],"study_design_scores_gemma":[0.000040003066,0.000035593308,0.0015127178,0.000061202496,0.000042453,0.0013148373,0.0004789989,0.0200006,0.008052416,0.9537118,0.014718608,0.000030731902],"about_ca_topic_score_codex":0.0012455311,"about_ca_topic_score_gemma":0.0019136562,"teacher_disagreement_score":0.011283711,"about_ca_system_score_codex":0.000907554,"about_ca_system_score_gemma":0.00057400187,"threshold_uncertainty_score":0.0377478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13788883,0.0089172255,0.5854508,0.002217057,0.00095202145,0.00022408039,0.0006089341,0.00069263217,0.26304835],"genre_scores_gemma":[0.75351954,0.0070931483,0.19008671,0.0016817861,0.0008715311,0.00051225827,0.0006428364,0.0004426108,0.045149624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781835,0.001020633,0.0001148635,0.0004534765,0.00035786393,0.00023471807],"domain_scores_gemma":[0.9903985,0.0063483645,0.0009183955,0.0012181742,0.00077551877,0.00034094657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001722759,0.001115511,0.0009171545,0.0014734897,0.0015671797,0.002751495,0.0012740484,0.0014271126,0.0154912],"category_scores_gemma":[0.00996897,0.0009598681,0.0007569682,0.0027300864,0.0024736808,0.0029854549,0.0016465003,0.002563414,0.002658469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019501465,0.00006197178,0.00039778018,0.00037575833,0.000040753122,0.000089102185,0.00016520354,0.009496931,0.0026501035,0.9178616,0.005260375,0.06340553],"study_design_scores_gemma":[0.000061925646,0.00016545347,0.00023903408,0.00012456527,0.000047515503,0.0003084946,0.00009666512,0.012087191,0.0019390921,0.97272056,0.01217813,0.000031345535],"about_ca_topic_score_codex":0.00045631482,"about_ca_topic_score_gemma":0.0006699459,"teacher_disagreement_score":0.0154912,"about_ca_system_score_codex":0.0012390941,"about_ca_system_score_gemma":0.00083976955,"threshold_uncertainty_score":0.0518232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7260065,0.00087323104,0.07336024,0.0016291465,0.00035138612,0.00009877961,0.0005817111,0.00037162504,0.19672734],"genre_scores_gemma":[0.9656479,0.00026789264,0.013403501,0.00017872459,0.000053679076,0.000035292745,0.0002993707,0.00008452156,0.020029213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994355,0.00012963536,0.000025747986,0.00009376012,0.000110686284,0.00020468999],"domain_scores_gemma":[0.99892575,0.0003719637,0.00014607956,0.00012842797,0.00013474008,0.00029305476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046442705,0.000602305,0.00044627686,0.0021749744,0.002341266,0.003943674,0.0008190075,0.0013996557,0.0119827],"category_scores_gemma":[0.0014782329,0.0004749609,0.00063705066,0.0012117346,0.0034450023,0.0026096946,0.0017966101,0.0014507517,0.0011668779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009442244,0.000021533406,0.00068952295,0.000027312126,0.000007853434,0.0001659199,0.00023953337,0.0011134217,0.0013360442,0.9870394,0.0017784828,0.0074865143],"study_design_scores_gemma":[0.00006324234,0.000044494587,0.0018081965,0.00005190141,0.00002392177,0.00048788605,0.00059602835,0.0077526565,0.0023527257,0.97159564,0.015185148,0.000038139482],"about_ca_topic_score_codex":0.0029778995,"about_ca_topic_score_gemma":0.0034145373,"teacher_disagreement_score":0.0119827,"about_ca_system_score_codex":0.0016426936,"about_ca_system_score_gemma":0.00049677695,"threshold_uncertainty_score":0.04008615},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15857372,0.00058954314,0.6464812,0.005441519,0.001028566,0.00025206816,0.0029958694,0.003420583,0.18121693],"genre_scores_gemma":[0.7442457,0.0005057861,0.13137849,0.0022388243,0.00029433588,0.0005188494,0.0028413446,0.0015715193,0.116405085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987204,0.00022682725,0.000064590175,0.0002837153,0.00039730288,0.00030719096],"domain_scores_gemma":[0.9981129,0.0005971669,0.00010532002,0.000571854,0.00045640377,0.00015638166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010463359,0.0005319067,0.00057952164,0.0010524929,0.0020666146,0.0022544018,0.0014483788,0.000986022,0.027205275],"category_scores_gemma":[0.002513672,0.00045548542,0.00077460374,0.00087408663,0.001960353,0.003260913,0.0033182825,0.0026751286,0.0070157778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024753113,0.00005032167,0.0003342121,0.000055799366,0.000011542513,0.00007683946,0.00016084207,0.0010178591,0.0029159994,0.95125824,0.012919928,0.030950893],"study_design_scores_gemma":[0.00009274331,0.00007575756,0.00036726406,0.00004717129,0.000028339733,0.00051979924,0.00013356897,0.007920215,0.012156392,0.88493437,0.09366344,0.00006098181],"about_ca_topic_score_codex":0.0007293438,"about_ca_topic_score_gemma":0.0007012606,"teacher_disagreement_score":0.027205275,"about_ca_system_score_codex":0.0016474647,"about_ca_system_score_gemma":0.00096846436,"threshold_uncertainty_score":0.09101075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821509,0.00021098684,0.0102963075,0.00007836245,0.000033180433,0.000029789471,0.00013676354,0.00017309186,0.0068906797],"genre_scores_gemma":[0.99626213,0.00022019008,0.0012743246,0.000051058345,0.000008137936,0.000009638266,0.0000732424,0.00002092882,0.002080253],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99966383,0.00007442619,0.000015955691,0.00005883673,0.00007409094,0.00011287525],"domain_scores_gemma":[0.9964502,0.0021645096,0.00033595215,0.0005100751,0.0003834799,0.00015589366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005983214,0.00030328435,0.0002548064,0.00044339383,0.00024445157,0.00055444316,0.00020908695,0.00058608514,0.007341593],"category_scores_gemma":[0.0052232617,0.00018454457,0.000110183995,0.00022034463,0.00031591213,0.0006910418,0.00056519406,0.00040651884,0.0011840543],"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.0135332765,0.00023150872,0.0067377505,0.00041537837,0.000055000575,0.00028781572,0.0012097126,0.013198974,0.87403786,0.011851816,0.0022930843,0.07614784],"study_design_scores_gemma":[0.0015715486,0.009434941,0.12600982,0.0003578162,0.00029353154,0.0017804236,0.0025336228,0.11688883,0.70948267,0.017913552,0.013549816,0.00018334853],"about_ca_topic_score_codex":0.00201679,"about_ca_topic_score_gemma":0.0010738156,"teacher_disagreement_score":0.007341593,"about_ca_system_score_codex":0.00035979852,"about_ca_system_score_gemma":0.00028095118,"threshold_uncertainty_score":0.024560094},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40361243,0.00070472073,0.55731237,0.00040806923,0.00014320492,0.00015804727,0.0013054566,0.0005487899,0.03580696],"genre_scores_gemma":[0.82260674,0.00031553587,0.17092696,0.0001736599,0.0000805897,0.00028235698,0.00062886294,0.000083722145,0.004901515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808854,0.00069513364,0.00014810104,0.00035651698,0.00037307132,0.00033847784],"domain_scores_gemma":[0.99693465,0.001067638,0.00068140187,0.0006645511,0.0004214253,0.00023025283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012565588,0.00078239053,0.0005962137,0.0008561711,0.00057052716,0.0013273433,0.0004504461,0.00053195516,0.007161989],"category_scores_gemma":[0.004686807,0.00038172342,0.00056080136,0.0012100743,0.00086782547,0.001304475,0.0012947299,0.0008539171,0.0011356382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013016952,0.00016341083,0.004127638,0.0003497261,0.00012686737,0.00023003276,0.00038257692,0.054527193,0.043414358,0.76628363,0.006378222,0.12271474],"study_design_scores_gemma":[0.0004360693,0.002387869,0.0028751658,0.00018999417,0.00011718415,0.00080832466,0.0003515164,0.11894048,0.039996672,0.7898994,0.04385541,0.00014192217],"about_ca_topic_score_codex":0.00019034071,"about_ca_topic_score_gemma":0.00026204812,"teacher_disagreement_score":0.007161989,"about_ca_system_score_codex":0.0006113794,"about_ca_system_score_gemma":0.0005291389,"threshold_uncertainty_score":0.02395922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3897408,0.003345493,0.15455225,0.08695118,0.006680952,0.00027296797,0.003089269,0.0023616324,0.35300538],"genre_scores_gemma":[0.9165839,0.0015781084,0.035593133,0.007786148,0.001851076,0.00026209885,0.0023924953,0.00051054184,0.033442505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968477,0.000818281,0.00018427527,0.0007370203,0.00070127915,0.0007114625],"domain_scores_gemma":[0.98221415,0.011841538,0.001169302,0.0028849444,0.0008265397,0.0010636138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782735,0.00085055275,0.0017093623,0.0013363499,0.0067491313,0.004741355,0.0029019269,0.0067432616,0.02069548],"category_scores_gemma":[0.018504094,0.0012119118,0.0014531846,0.0033699838,0.0063110203,0.012024418,0.00579394,0.0062696827,0.0031050604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060002727,0.00021153728,0.0013602901,0.00025787074,0.00005869429,0.0016621202,0.0015173649,0.0035415106,0.001668503,0.8828672,0.0911988,0.015055969],"study_design_scores_gemma":[0.0001570881,0.00006283167,0.00054610294,0.00008624134,0.000048727565,0.0017626544,0.00081276346,0.008303131,0.0014541879,0.95638174,0.03033629,0.00004809736],"about_ca_topic_score_codex":0.002117992,"about_ca_topic_score_gemma":0.0016289351,"teacher_disagreement_score":0.02069548,"about_ca_system_score_codex":0.0015754686,"about_ca_system_score_gemma":0.0008795086,"threshold_uncertainty_score":0.0692333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32983232,0.0014444374,0.37552536,0.0029340056,0.0008247454,0.00024858027,0.0023541495,0.00074845005,0.28608787],"genre_scores_gemma":[0.8913967,0.0010048411,0.044746038,0.000697497,0.00033036873,0.00025701945,0.0012141847,0.00017422614,0.06017919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994103,0.00017024258,0.000022141006,0.00011001209,0.00015822807,0.00012906859],"domain_scores_gemma":[0.9982998,0.00063960184,0.00036741572,0.00017956116,0.00028827478,0.00022552535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025054745,0.0005475231,0.0003585111,0.0018728835,0.0012232873,0.0018882935,0.0007470043,0.0010841871,0.01633183],"category_scores_gemma":[0.0029088918,0.0003080049,0.00036276624,0.00143003,0.00086123904,0.0019034983,0.0012823029,0.0013014216,0.002818734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058359536,0.000037021928,0.0003274259,0.00005987451,0.000011450826,0.00026163165,0.00014654497,0.0022706708,0.002371242,0.97701424,0.0055624484,0.011879108],"study_design_scores_gemma":[0.000022119735,0.000021374099,0.0006159081,0.000027443892,0.000010442128,0.00045282746,0.00012680794,0.015551287,0.0016824694,0.9696008,0.011867781,0.000020674841],"about_ca_topic_score_codex":0.00074917905,"about_ca_topic_score_gemma":0.0011308467,"teacher_disagreement_score":0.01633183,"about_ca_system_score_codex":0.0006848925,"about_ca_system_score_gemma":0.0005351703,"threshold_uncertainty_score":0.054635406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64038646,0.0024055955,0.30933237,0.0022252216,0.0004644798,0.00045013794,0.00042645138,0.0020568692,0.042252447],"genre_scores_gemma":[0.9776824,0.00044149574,0.01931299,0.000087402324,0.000021971422,0.00010460219,0.00015977044,0.000041314765,0.0021480322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885964,0.0004661456,0.000038197028,0.00016383082,0.00032999145,0.00014217195],"domain_scores_gemma":[0.9963658,0.002123678,0.00033750714,0.000461232,0.0005152238,0.00019652458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667395,0.00043814583,0.00041070406,0.000730052,0.0008609918,0.0012475906,0.0011171758,0.0005788697,0.002402734],"category_scores_gemma":[0.0050707716,0.00016685647,0.0004047289,0.0004512261,0.0007678007,0.0028194443,0.0010323343,0.0006885244,0.00019738535],"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.0006049643,0.00027780313,0.0056761107,0.00026386612,0.00017987106,0.00057180703,0.0004585549,0.82175964,0.02700043,0.07516374,0.0059009017,0.062142342],"study_design_scores_gemma":[0.000033063046,0.00013394252,0.0006209869,0.000015301901,0.000036257356,0.00015739704,0.00011430322,0.9793952,0.0051160776,0.011755016,0.0026057914,0.000016647784],"about_ca_topic_score_codex":0.0042308723,"about_ca_topic_score_gemma":0.0028365825,"teacher_disagreement_score":0.0042308723,"about_ca_system_score_codex":0.0014769785,"about_ca_system_score_gemma":0.0007889745,"threshold_uncertainty_score":0.0107162595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26371768,0.00064713834,0.45086792,0.00234004,0.0013517789,0.00023315138,0.0010013081,0.0014411826,0.27839985],"genre_scores_gemma":[0.8341544,0.00037237635,0.11094132,0.00051557785,0.00021155276,0.0001229807,0.0005411042,0.00027697373,0.052863713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943167,0.00014183087,0.000025615558,0.00010819196,0.0001495533,0.00014318626],"domain_scores_gemma":[0.9993223,0.00016577033,0.00006367617,0.0001635089,0.000126043,0.00015861948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029866918,0.000355651,0.00034497963,0.00087287265,0.0013924695,0.001497973,0.0008864382,0.00069038355,0.0150407],"category_scores_gemma":[0.0011656805,0.00029776336,0.0005215324,0.0008104063,0.0014063851,0.0020156999,0.0019235305,0.0015365946,0.0029650596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036948615,0.000035152636,0.00009373089,0.000038632003,0.000005356164,0.00011569265,0.00019734504,0.0009892532,0.005059497,0.98119044,0.0035360751,0.00870188],"study_design_scores_gemma":[0.00003099462,0.000033588658,0.00024816408,0.000020434796,0.000009819441,0.00019492857,0.00016378086,0.008621174,0.0041539534,0.96869254,0.01780441,0.000026229816],"about_ca_topic_score_codex":0.0012197392,"about_ca_topic_score_gemma":0.002667793,"teacher_disagreement_score":0.0150407,"about_ca_system_score_codex":0.00080120773,"about_ca_system_score_gemma":0.0006142597,"threshold_uncertainty_score":0.050316155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7826214,0.0008485083,0.16517922,0.0008892087,0.000371604,0.00013134467,0.0004803335,0.0003632344,0.049115214],"genre_scores_gemma":[0.9302969,0.00046944665,0.05314016,0.00033299768,0.00035523393,0.0001869746,0.0008295207,0.00006712751,0.01432163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993556,0.000109630506,0.00006539872,0.00016125572,0.00019018879,0.00011791601],"domain_scores_gemma":[0.9969227,0.0012386927,0.00054460677,0.0002913516,0.00041289066,0.0005897781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663755,0.00046430508,0.0004979738,0.0016096215,0.0011800763,0.0012327096,0.00060542417,0.0015090398,0.0050701606],"category_scores_gemma":[0.0044078548,0.00041201047,0.0005679795,0.00056244474,0.0014175099,0.0032672426,0.0013453215,0.001734815,0.00064311194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037602728,0.00012753866,0.0041633165,0.00017293757,0.000015279622,0.0010021763,0.00073855615,0.0036360377,0.014370033,0.94375896,0.0022793736,0.0293597],"study_design_scores_gemma":[0.00016006763,0.00061611866,0.004737749,0.00014720015,0.000035171346,0.0060076937,0.0006961125,0.05185116,0.014824214,0.88925546,0.03153621,0.00013294368],"about_ca_topic_score_codex":0.00018610434,"about_ca_topic_score_gemma":0.00025597712,"teacher_disagreement_score":0.0050701606,"about_ca_system_score_codex":0.0007364369,"about_ca_system_score_gemma":0.0003871595,"threshold_uncertainty_score":0.016961336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80499506,0.0027874017,0.115203016,0.00089058,0.00022478309,0.00020950407,0.0012429142,0.0011349557,0.07331188],"genre_scores_gemma":[0.9305136,0.0005163616,0.05248233,0.0001808336,0.000040635576,0.00016470427,0.0005609935,0.000058440335,0.0154821575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995659,0.00012253465,0.000021812864,0.00009681232,0.000093638046,0.00009931443],"domain_scores_gemma":[0.9989219,0.00041944822,0.00019917054,0.00018094845,0.00013549622,0.00014300326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303305,0.00044354773,0.00032182166,0.0007549378,0.0009861698,0.0007734947,0.0004732016,0.00063979084,0.004060051],"category_scores_gemma":[0.0019487824,0.00028376348,0.0004163607,0.0006264547,0.00064576586,0.00044742035,0.00048206587,0.00050135487,0.000675954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025338084,0.00026812637,0.0082421815,0.00063783274,0.00019141087,0.0028702724,0.0012088584,0.034788206,0.06506608,0.6653242,0.021597601,0.19727136],"study_design_scores_gemma":[0.0011860486,0.002315734,0.009014658,0.0006510807,0.00018845744,0.009153115,0.00071022514,0.19392927,0.06870701,0.4872054,0.2266155,0.00032344175],"about_ca_topic_score_codex":0.0006734087,"about_ca_topic_score_gemma":0.0008746194,"teacher_disagreement_score":0.004060051,"about_ca_system_score_codex":0.00074763596,"about_ca_system_score_gemma":0.0005585827,"threshold_uncertainty_score":0.01358223},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08288754,0.0010809358,0.7889822,0.0016356243,0.0005423533,0.00056977343,0.0015003352,0.002680318,0.120120816],"genre_scores_gemma":[0.6770357,0.0005747716,0.2821394,0.0013171183,0.00026224818,0.0010235453,0.00062040257,0.00029144317,0.036735423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728835,0.0012938569,0.0001678536,0.00039034072,0.0004056473,0.00045402625],"domain_scores_gemma":[0.99319386,0.0030222598,0.00060341926,0.001819732,0.0009043675,0.00045633412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018689156,0.0007789083,0.0006565449,0.00092400564,0.0011531289,0.0020657897,0.0011129683,0.0014948964,0.022199072],"category_scores_gemma":[0.0072884182,0.00051713514,0.00051157596,0.0007380254,0.0011769056,0.0023911486,0.0016815668,0.0010961446,0.007478223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016559025,0.00036463884,0.0010898295,0.00059119705,0.00010829863,0.0003367335,0.00029758087,0.014529148,0.042551376,0.7857988,0.019380927,0.13329549],"study_design_scores_gemma":[0.0007355948,0.0012592293,0.00077138277,0.00029574172,0.00013896594,0.0009428476,0.00022527076,0.098587476,0.052459467,0.7658148,0.07860391,0.0001652906],"about_ca_topic_score_codex":0.0006441109,"about_ca_topic_score_gemma":0.0012598466,"teacher_disagreement_score":0.022199072,"about_ca_system_score_codex":0.0011405488,"about_ca_system_score_gemma":0.0014590999,"threshold_uncertainty_score":0.074263275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11503541,0.007585305,0.6698635,0.0030929432,0.0013356062,0.0001882581,0.0009336225,0.00048378773,0.20148157],"genre_scores_gemma":[0.7666143,0.0032710745,0.18599999,0.0022526253,0.0013410577,0.0003709164,0.0007702597,0.00015158173,0.03922823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888974,0.00028490362,0.00007426345,0.00032905737,0.00029313198,0.00012888972],"domain_scores_gemma":[0.99884254,0.0003713486,0.00017481414,0.0002206118,0.00022745266,0.00016332336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037767,0.00048077956,0.00045043085,0.001401068,0.0015760176,0.0024258324,0.0006672757,0.0009114979,0.0065642307],"category_scores_gemma":[0.0019507739,0.00035033823,0.000710121,0.0011932475,0.0048585446,0.005870969,0.002467849,0.0019183708,0.0012120894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009546878,0.0000052464607,0.00009283296,0.000027742291,0.0000042588836,0.000043573677,0.00017027227,0.000548452,0.0005892438,0.9928837,0.00075601944,0.0048692077],"study_design_scores_gemma":[0.000007723038,0.000026177055,0.00010371212,0.000017897004,0.0000035735102,0.00012532734,0.00006767799,0.0027471017,0.00036244752,0.976992,0.019536553,0.000009707556],"about_ca_topic_score_codex":0.00088696193,"about_ca_topic_score_gemma":0.0007360114,"teacher_disagreement_score":0.0065642307,"about_ca_system_score_codex":0.0012610279,"about_ca_system_score_gemma":0.0005702774,"threshold_uncertainty_score":0.021959543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46283028,0.0021831985,0.367315,0.0035532818,0.0008949026,0.00014160428,0.0014518807,0.0005594123,0.16107033],"genre_scores_gemma":[0.91134816,0.00090836006,0.0333087,0.0007164883,0.0004958184,0.00012167476,0.0006119315,0.00029904614,0.05218978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990953,0.00035857453,0.000029767041,0.000111952686,0.00022355748,0.00018084134],"domain_scores_gemma":[0.99823976,0.00066129694,0.00021318923,0.00023387809,0.0003838892,0.00026791403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009599595,0.0011458953,0.00071982655,0.002321154,0.0016753736,0.0029049998,0.0009873948,0.0012370811,0.014982582],"category_scores_gemma":[0.0028562937,0.00035265335,0.00055599824,0.0013383458,0.0026249953,0.0022753368,0.0021399406,0.0025124194,0.002165697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060060767,0.000033450284,0.00019642786,0.00003801741,0.0000074877644,0.00005659945,0.00011278784,0.003468152,0.0013166469,0.98499435,0.0016961392,0.008019873],"study_design_scores_gemma":[0.00001888894,0.000042489257,0.00047086473,0.000025943898,0.000004739885,0.00021218832,0.00008910075,0.06418852,0.00108255,0.92935455,0.0044798683,0.000030206842],"about_ca_topic_score_codex":0.0007052429,"about_ca_topic_score_gemma":0.00062070205,"teacher_disagreement_score":0.014982582,"about_ca_system_score_codex":0.001113663,"about_ca_system_score_gemma":0.0009503605,"threshold_uncertainty_score":0.050121725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7238512,0.0018643385,0.0904154,0.009731197,0.000583387,0.00011515684,0.0010165594,0.00047940807,0.17194338],"genre_scores_gemma":[0.9766832,0.000655951,0.0102561535,0.0008292018,0.00025585497,0.00012892166,0.00036996417,0.000117331234,0.010703441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794954,0.00055571564,0.000106339816,0.00037480122,0.00044364703,0.00056999456],"domain_scores_gemma":[0.9801483,0.015167938,0.0012632435,0.0014078058,0.0008755457,0.0011372287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021891764,0.00037609917,0.0008767692,0.0017170127,0.003774307,0.0040292908,0.0013873641,0.0022545357,0.005874621],"category_scores_gemma":[0.02177001,0.0009967567,0.0005735983,0.0009365893,0.0046778847,0.007270841,0.0052451845,0.003792461,0.0011916835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022923219,0.000046609333,0.0014433414,0.00012393457,0.000029534898,0.0005789453,0.0005839668,0.002963413,0.0025198355,0.9781396,0.007154651,0.0061868853],"study_design_scores_gemma":[0.00004444943,0.000040679886,0.0007738158,0.000058628666,0.000016769543,0.000640275,0.00037863312,0.008530868,0.002017198,0.9840316,0.0034346087,0.00003249181],"about_ca_topic_score_codex":0.0008673072,"about_ca_topic_score_gemma":0.0010854106,"teacher_disagreement_score":0.005874621,"about_ca_system_score_codex":0.0008436876,"about_ca_system_score_gemma":0.0010221072,"threshold_uncertainty_score":0.019652605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28741875,0.0014151625,0.45039853,0.0045933058,0.0022492805,0.00023770018,0.00065885356,0.0006703501,0.252358],"genre_scores_gemma":[0.7949534,0.00063731073,0.11837395,0.0012484544,0.00051146763,0.00020827746,0.0003783805,0.00017591956,0.083512954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923503,0.00022915486,0.000037381935,0.00010279733,0.00024489837,0.00015070064],"domain_scores_gemma":[0.99880147,0.0003560186,0.00015290937,0.00026349537,0.0002819486,0.00014413027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086801534,0.0004980476,0.00028106396,0.001478116,0.0011195868,0.0017589511,0.0006727621,0.0011647858,0.015182182],"category_scores_gemma":[0.0024528075,0.00028307523,0.000325175,0.0008998571,0.0017012383,0.0019522114,0.0011808854,0.001379329,0.0023993193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006280111,0.00002061819,0.00013298278,0.000017858656,0.0000049450114,0.0000492768,0.000059139886,0.0015724314,0.0026848626,0.97967803,0.0022482877,0.01346869],"study_design_scores_gemma":[0.000021858963,0.000044016986,0.00035076987,0.000024670202,0.0000046055443,0.00022768725,0.0000858315,0.019456323,0.005395603,0.9576933,0.016654287,0.00004100417],"about_ca_topic_score_codex":0.0008948608,"about_ca_topic_score_gemma":0.0009906641,"teacher_disagreement_score":0.015182182,"about_ca_system_score_codex":0.00073030783,"about_ca_system_score_gemma":0.00075814466,"threshold_uncertainty_score":0.050789416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008572233,0.008207589,0.13599926,0.00376659,0.0016424801,0.00007114893,0.0013052084,0.0009311745,0.8395043],"genre_scores_gemma":[0.33882025,0.022885049,0.105776384,0.00413434,0.004341893,0.0005291309,0.0058980845,0.0033306165,0.5142842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.00024312979,0.00005600898,0.00023904971,0.00045093175,0.00017132422],"domain_scores_gemma":[0.99862206,0.0006490848,0.00007610711,0.00033036983,0.00019305637,0.00012927529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007627401,0.0020427094,0.002045211,0.004137735,0.0032460915,0.004852416,0.0022036196,0.0014764625,0.060686905],"category_scores_gemma":[0.0032951948,0.0013663546,0.0016117478,0.012248501,0.004768664,0.010244501,0.003226259,0.008463947,0.01230519],"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.000011409375,0.000011446593,0.000046896042,0.00006162147,0.000006780336,0.000027569076,0.000085657346,0.000673693,0.0001002161,0.9682556,0.015244974,0.015474213],"study_design_scores_gemma":[0.0000036906918,0.0000025578233,0.000048242022,0.000021934935,0.0000047832714,0.00003560052,0.000035717094,0.00088151684,0.00007575362,0.9810497,0.017835282,0.0000052938162],"about_ca_topic_score_codex":0.0035798552,"about_ca_topic_score_gemma":0.0034613966,"teacher_disagreement_score":0.060686905,"about_ca_system_score_codex":0.0030701037,"about_ca_system_score_gemma":0.0012771446,"threshold_uncertainty_score":0.20301789},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.356786,0.0011189177,0.47185788,0.00081242924,0.00058731856,0.00020102494,0.0011813422,0.0010304587,0.16642468],"genre_scores_gemma":[0.86087203,0.00041302544,0.10121205,0.00031087577,0.00012416075,0.00023034083,0.0005875893,0.00013029296,0.036119632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00015365472,0.000046371282,0.0001569458,0.00017908105,0.00016162585],"domain_scores_gemma":[0.9983454,0.0004598561,0.00022401262,0.00036850793,0.00036990579,0.00023234988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050736446,0.0003503357,0.00071178394,0.0014251263,0.0019382548,0.001978404,0.00088812056,0.0010555997,0.013317171],"category_scores_gemma":[0.0028416908,0.0003763052,0.00053697993,0.0010630311,0.0010855037,0.0018677802,0.001461451,0.0009969529,0.002834083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023674557,0.000046791763,0.0006048474,0.00009205286,0.000033482305,0.0005739765,0.00025220355,0.0067228437,0.01028906,0.95593774,0.002863518,0.022346565],"study_design_scores_gemma":[0.00011555792,0.00012791877,0.000556002,0.00006325448,0.000049936923,0.0009118707,0.00026380026,0.047538254,0.008148797,0.9154734,0.026684593,0.00006659314],"about_ca_topic_score_codex":0.001124088,"about_ca_topic_score_gemma":0.0020745904,"teacher_disagreement_score":0.013317171,"about_ca_system_score_codex":0.0008131795,"about_ca_system_score_gemma":0.0007327705,"threshold_uncertainty_score":0.04455036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4427864,0.00082094374,0.36474112,0.0015600659,0.0006112978,0.00028727407,0.003574613,0.00078215153,0.18483621],"genre_scores_gemma":[0.8872316,0.00046724186,0.064439826,0.00059931114,0.00028259767,0.00019235407,0.0034269001,0.00020911581,0.043151073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993637,0.00015545133,0.000029705605,0.0001854622,0.00011570221,0.00015002939],"domain_scores_gemma":[0.9988102,0.00032480978,0.00026742902,0.00021579646,0.00020297582,0.00017875318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039667045,0.00042159157,0.00039940837,0.0010074025,0.0011310929,0.0013330353,0.0003526253,0.0006730869,0.013790566],"category_scores_gemma":[0.0018917369,0.00032223554,0.0004816738,0.0005815698,0.0008454174,0.0016555113,0.00077038235,0.00077948155,0.0017052639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016960711,0.000087637105,0.000838669,0.00011361826,0.000024193952,0.0001706372,0.00019554546,0.0036794576,0.009035466,0.956293,0.011097435,0.01829467],"study_design_scores_gemma":[0.000039144186,0.000049765138,0.0014488546,0.00005187741,0.000020217147,0.00037706955,0.00024118624,0.01563926,0.0022722278,0.96384984,0.015990932,0.000019578543],"about_ca_topic_score_codex":0.0013105689,"about_ca_topic_score_gemma":0.003258721,"teacher_disagreement_score":0.013790566,"about_ca_system_score_codex":0.0006254069,"about_ca_system_score_gemma":0.0007058158,"threshold_uncertainty_score":0.046134055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.638211,0.0015014716,0.17031035,0.0026591108,0.00050489476,0.00070439064,0.011422474,0.0018882082,0.17279816],"genre_scores_gemma":[0.9138122,0.00041754614,0.056214303,0.0004644304,0.000118585376,0.00037681538,0.004865711,0.00044935994,0.023280982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986406,0.0004099786,0.000046105,0.00026762747,0.0002988238,0.00033696333],"domain_scores_gemma":[0.9918826,0.0049435273,0.00033680015,0.0012663734,0.00081286626,0.00075778883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012673832,0.00054747745,0.0006734212,0.0017757558,0.0025737553,0.0028061154,0.0014254289,0.0013266469,0.024252884],"category_scores_gemma":[0.009390084,0.00058737356,0.0006215664,0.0015166771,0.0012653719,0.0032671045,0.0012813581,0.0010917287,0.0018539538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002484486,0.00054029835,0.0047974265,0.00063997257,0.00023510093,0.00046702544,0.0011747627,0.03364518,0.035778955,0.81371397,0.04985494,0.056667868],"study_design_scores_gemma":[0.0004517675,0.00016470083,0.009082546,0.00019909994,0.00021798683,0.0009546632,0.0015057962,0.14326034,0.030064547,0.7695735,0.04442518,0.00009996472],"about_ca_topic_score_codex":0.0019026471,"about_ca_topic_score_gemma":0.006130484,"teacher_disagreement_score":0.024252884,"about_ca_system_score_codex":0.0015830548,"about_ca_system_score_gemma":0.0010695547,"threshold_uncertainty_score":0.08113402},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2852162,0.0006732046,0.5788248,0.0007091391,0.00033683673,0.00013692414,0.0006722679,0.0013124468,0.13211812],"genre_scores_gemma":[0.77379876,0.00038372338,0.18701898,0.00030896676,0.00012671968,0.00017453876,0.00086261466,0.000519223,0.036806453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922335,0.00015878161,0.000061837134,0.00019340987,0.00020470862,0.00015785787],"domain_scores_gemma":[0.99774534,0.00085252104,0.00017401847,0.0006073013,0.00031611323,0.00030468495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047745317,0.0003701526,0.00065358414,0.0009192931,0.0015355101,0.001962419,0.0010159246,0.0010844861,0.011419287],"category_scores_gemma":[0.0032434345,0.0005769127,0.0007976901,0.0008882259,0.0016916896,0.0038118495,0.0038251088,0.0022040536,0.002123826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012363381,0.00005493652,0.0006625355,0.000113576396,0.000022387372,0.00027859554,0.0007844069,0.003097541,0.0067840205,0.9411166,0.004619674,0.042342123],"study_design_scores_gemma":[0.000025418934,0.00006952773,0.00036594036,0.00006973877,0.000037093054,0.00026603206,0.00045088204,0.009876357,0.0071688686,0.95418936,0.027455954,0.000024837447],"about_ca_topic_score_codex":0.00072201504,"about_ca_topic_score_gemma":0.0012391389,"teacher_disagreement_score":0.011419287,"about_ca_system_score_codex":0.0006809082,"about_ca_system_score_gemma":0.0004772748,"threshold_uncertainty_score":0.038201332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5995152,0.0010329606,0.13325605,0.0014308123,0.0011478554,0.00011711447,0.0006640246,0.00018739323,0.26264858],"genre_scores_gemma":[0.9388327,0.0002780282,0.02257677,0.00027355857,0.00016502578,0.000052237257,0.0004374047,0.00010466793,0.03727964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962425,0.00008981293,0.000016228214,0.000086187276,0.000084485124,0.00009905848],"domain_scores_gemma":[0.99945956,0.00013536296,0.000120568046,0.00007642918,0.00009023716,0.00011788622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002756636,0.00033676944,0.0003570222,0.0008132093,0.0014626886,0.0016577969,0.00056128344,0.00084593956,0.014309389],"category_scores_gemma":[0.0016930471,0.00032255394,0.00050575536,0.00039433365,0.0017555826,0.0018038566,0.0013509992,0.00113346,0.0023124393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007220461,0.000013284836,0.00040981904,0.000029985787,0.000006229441,0.00017860997,0.00012959685,0.00087893324,0.0022351153,0.986668,0.002635206,0.0067429207],"study_design_scores_gemma":[0.000047865648,0.00006215672,0.0010031069,0.00003190519,0.000009047489,0.0007525459,0.00039175764,0.006906517,0.0022055712,0.97296417,0.015598068,0.000027403146],"about_ca_topic_score_codex":0.001285344,"about_ca_topic_score_gemma":0.001369107,"teacher_disagreement_score":0.014309389,"about_ca_system_score_codex":0.00045170102,"about_ca_system_score_gemma":0.0005924688,"threshold_uncertainty_score":0.047869623},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010249226,0.013844199,0.0053755855,0.021161785,0.1153613,0.00031205267,0.0105725555,0.0021645818,0.83018315],"genre_scores_gemma":[0.004426161,0.0062828297,0.0023995421,0.0046039186,0.015386712,0.00016246732,0.011065952,0.0012334685,0.95443887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861836,0.00016038322,0.000096492804,0.0003079124,0.0006963854,0.000120431076],"domain_scores_gemma":[0.9970462,0.0004763238,0.00011185569,0.00043011367,0.0014391658,0.0004964355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820131,0.0011639423,0.0010346407,0.0027741154,0.0024259018,0.006384971,0.0018297448,0.0016580928,0.58367926],"category_scores_gemma":[0.006638496,0.00039416263,0.0008920625,0.0026262454,0.0008550004,0.0043157083,0.0029216434,0.0026764227,0.3849938],"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.00002448569,0.00001654656,0.00008423263,0.00012337441,0.0000032875005,0.000027896305,0.00006711744,0.000050441715,0.0001251687,0.005057794,0.95044345,0.04397628],"study_design_scores_gemma":[0.0000022800627,0.0000073463666,0.00012557142,0.000071358794,0.0000015648225,0.000038625807,0.00004300924,0.000022493177,0.00004920225,0.0013688143,0.9982665,0.0000032747155],"about_ca_topic_score_codex":0.002629257,"about_ca_topic_score_gemma":0.0035860024,"teacher_disagreement_score":0.58367926,"about_ca_system_score_codex":0.0021274034,"about_ca_system_score_gemma":0.0023383074,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032222036,0.014624481,0.25373933,0.009296001,0.00767388,0.00007752358,0.00045322313,0.0005973224,0.68131626],"genre_scores_gemma":[0.59361184,0.024650207,0.20381698,0.0061124894,0.0072128125,0.00014285503,0.0005860917,0.00092698296,0.16293971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992453,0.00014625317,0.00003163837,0.00014672006,0.00029659586,0.00013345057],"domain_scores_gemma":[0.9980015,0.0009841995,0.00009149585,0.00042437165,0.00028163573,0.00021681689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008572298,0.00051445985,0.0008329394,0.0015176132,0.0027736877,0.0034727396,0.0014793187,0.0013818812,0.016443409],"category_scores_gemma":[0.005677263,0.0004577577,0.0007247212,0.0021631338,0.0026484418,0.0063804258,0.0036679527,0.004641987,0.0041658664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018752626,0.000011159859,0.00009572083,0.000046651767,0.0000051391266,0.000084474625,0.00008589145,0.0005289497,0.00042426575,0.96743023,0.012872334,0.018396415],"study_design_scores_gemma":[0.000004301699,0.000011784369,0.00013473113,0.00003747862,0.000010362316,0.00034945013,0.00007087229,0.0022507804,0.00053282577,0.9252099,0.071377754,0.000009818509],"about_ca_topic_score_codex":0.0013992557,"about_ca_topic_score_gemma":0.0027272722,"teacher_disagreement_score":0.016443409,"about_ca_system_score_codex":0.001287311,"about_ca_system_score_gemma":0.00061863556,"threshold_uncertainty_score":0.05500865},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13784249,0.00018454112,0.83503574,0.00043086326,0.00016239138,0.00019423808,0.00028592895,0.00076877174,0.025095077],"genre_scores_gemma":[0.5042853,0.00019823086,0.47703046,0.0003216193,0.00004917046,0.00024472713,0.00051086687,0.000244142,0.017115502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994642,0.00016466799,0.000027262347,0.00008949147,0.0001612548,0.000093136565],"domain_scores_gemma":[0.99923885,0.00020884196,0.00008568764,0.00021121286,0.0001672502,0.000088235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046302268,0.00060940423,0.0005795896,0.00047267711,0.000575687,0.00074531056,0.0006396006,0.0005972909,0.004663562],"category_scores_gemma":[0.0012721313,0.0005439267,0.0004594631,0.00064566213,0.00065110624,0.0008041188,0.0016401442,0.00076518214,0.0015860723],"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.00075445935,0.00021132978,0.0017410059,0.0003520387,0.00010154631,0.00036573954,0.00034172373,0.041410215,0.15644245,0.60367095,0.009565425,0.18504313],"study_design_scores_gemma":[0.0005766959,0.0010388682,0.0016788996,0.00012130238,0.00012875388,0.000965174,0.0002867015,0.28612998,0.23743993,0.40134114,0.070168726,0.00012381819],"about_ca_topic_score_codex":0.0004972426,"about_ca_topic_score_gemma":0.0010069828,"teacher_disagreement_score":0.004663562,"about_ca_system_score_codex":0.00043917887,"about_ca_system_score_gemma":0.00082651473,"threshold_uncertainty_score":0.015601158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7262555,0.011170926,0.09744914,0.0047974996,0.00044131378,0.0003710869,0.004086761,0.0013644685,0.15406331],"genre_scores_gemma":[0.9228071,0.0037637705,0.041246302,0.0008681375,0.00034169998,0.0003276165,0.0045597944,0.00034663343,0.025738928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992131,0.00014008743,0.00005516852,0.00009762653,0.0002730093,0.00022094636],"domain_scores_gemma":[0.9971521,0.0013602247,0.00066387176,0.00028201716,0.00032101516,0.00022068163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005324338,0.00083927554,0.0007696955,0.0023371608,0.0009440832,0.002589113,0.0010408052,0.0018114081,0.009626181],"category_scores_gemma":[0.004628993,0.00053546834,0.00056464213,0.0015753253,0.001268612,0.0013889214,0.0012231091,0.0013030153,0.0018295646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013329006,0.0003134096,0.005397215,0.0009746851,0.00007642475,0.00052255165,0.0004676606,0.042768802,0.019345986,0.67016584,0.05159879,0.20703578],"study_design_scores_gemma":[0.0004856485,0.00056706654,0.0055062524,0.00050035,0.000107439235,0.0016395538,0.00044611725,0.16015162,0.012850186,0.7670411,0.05057646,0.0001282816],"about_ca_topic_score_codex":0.00093513675,"about_ca_topic_score_gemma":0.0011961994,"teacher_disagreement_score":0.009626181,"about_ca_system_score_codex":0.0015575472,"about_ca_system_score_gemma":0.0015432796,"threshold_uncertainty_score":0.03220278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.612032,0.0005572829,0.3014746,0.00044084515,0.00017619265,0.00012264423,0.0007982218,0.0011384275,0.08325975],"genre_scores_gemma":[0.87574565,0.00032137628,0.102591604,0.00016369257,0.00006677816,0.00014059868,0.00088438555,0.00042299385,0.019662876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994424,0.000111680994,0.000050628016,0.00011621285,0.000130184,0.00014885327],"domain_scores_gemma":[0.99736625,0.0010102546,0.00028900037,0.0005667545,0.0003492772,0.0004184317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037249154,0.00029710942,0.0004683196,0.000830948,0.0010473646,0.0014849309,0.00070214196,0.0006593158,0.007600476],"category_scores_gemma":[0.0030447633,0.00037873554,0.00041758936,0.0007759735,0.00082744774,0.002202018,0.0020759858,0.0012384056,0.0013141481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006214088,0.00022053884,0.0033112015,0.00034711036,0.000048981972,0.000649932,0.0016015243,0.01327934,0.06162268,0.77365655,0.011932085,0.13270867],"study_design_scores_gemma":[0.00007483764,0.0002844777,0.0020070125,0.00015831331,0.000079138365,0.00074189104,0.0007690928,0.052401833,0.05455407,0.8475431,0.041334953,0.000051158026],"about_ca_topic_score_codex":0.00055028475,"about_ca_topic_score_gemma":0.0012402921,"teacher_disagreement_score":0.007600476,"about_ca_system_score_codex":0.0005575845,"about_ca_system_score_gemma":0.0003928407,"threshold_uncertainty_score":0.02542615},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2870264,0.0033207783,0.5114308,0.0018757316,0.0013443131,0.00009780613,0.0009916495,0.000501211,0.19341128],"genre_scores_gemma":[0.86459905,0.0018871046,0.06556655,0.0006547163,0.0009105921,0.00016232346,0.0006367117,0.00024855215,0.06533438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991998,0.00024201683,0.00003502994,0.00014121739,0.00025862624,0.00012335808],"domain_scores_gemma":[0.9963367,0.0013261627,0.0005458201,0.0002690527,0.0010230594,0.0004990965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078505225,0.00052435615,0.00039790096,0.0020774137,0.0007412265,0.0016502064,0.0008113474,0.00061624165,0.009271043],"category_scores_gemma":[0.0053676344,0.00017177926,0.0002588555,0.000917109,0.0017304783,0.0022460737,0.00089093234,0.0010697641,0.001885821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004393865,0.00001751403,0.00015936437,0.000027737988,0.0000044291014,0.000053586587,0.000105521925,0.0013748027,0.0015022906,0.9831254,0.002279552,0.011305924],"study_design_scores_gemma":[0.000011692188,0.000040883915,0.00038704256,0.000025245157,0.000004743488,0.00020749026,0.0001287231,0.023647934,0.0015557822,0.96600324,0.007958623,0.000028609074],"about_ca_topic_score_codex":0.0010818265,"about_ca_topic_score_gemma":0.0016297316,"teacher_disagreement_score":0.009271043,"about_ca_system_score_codex":0.0006852846,"about_ca_system_score_gemma":0.00066654885,"threshold_uncertainty_score":0.03101474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22518277,0.002014104,0.41120538,0.0039572013,0.0008010204,0.00029210158,0.00190149,0.001012451,0.35363343],"genre_scores_gemma":[0.9015046,0.0011606669,0.052950174,0.0011583498,0.000472473,0.00046687815,0.00089331117,0.00021384128,0.041179795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826306,0.00038888227,0.00008652438,0.00040906842,0.0005084539,0.0003439956],"domain_scores_gemma":[0.99585176,0.0018172916,0.00049434375,0.00081788463,0.00046564962,0.0005531018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045893,0.0006567029,0.00054518646,0.003294703,0.0016207186,0.0044208774,0.00094959664,0.002309961,0.017561212],"category_scores_gemma":[0.0065752664,0.00045272996,0.00079897005,0.0014233488,0.0025041623,0.004334351,0.0018185904,0.0019064524,0.0026138606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029897117,0.000017032931,0.00011460868,0.000024715784,0.0000034791065,0.000048175294,0.00010194597,0.0003048058,0.0005114558,0.990846,0.0019055598,0.0060923793],"study_design_scores_gemma":[0.000019981842,0.000020276893,0.00022420438,0.000036367557,0.000005853891,0.00028002763,0.0001340279,0.003668981,0.0005833956,0.98715127,0.007861882,0.000013731787],"about_ca_topic_score_codex":0.00043298962,"about_ca_topic_score_gemma":0.00040681657,"teacher_disagreement_score":0.017561212,"about_ca_system_score_codex":0.0013987003,"about_ca_system_score_gemma":0.00070433284,"threshold_uncertainty_score":0.058748186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28800738,0.0037507063,0.3802661,0.0054960046,0.00090977474,0.0002286037,0.0016283805,0.0010608314,0.31865218],"genre_scores_gemma":[0.8763231,0.0014087956,0.057735268,0.00085149636,0.00048992195,0.00019842823,0.0015127235,0.00038669788,0.06109354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714464,0.0007941892,0.0001420332,0.00057646265,0.00063529384,0.00070739933],"domain_scores_gemma":[0.99226356,0.004453747,0.00060929544,0.0011876931,0.0007653046,0.0007203695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015997308,0.00060892967,0.0015817515,0.0024619154,0.0057576858,0.0071983156,0.0024995867,0.0043000923,0.036702536],"category_scores_gemma":[0.0141515555,0.0009936203,0.0011494714,0.003195776,0.0031707878,0.01569973,0.006467827,0.005097878,0.0043775043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009896173,0.000042560478,0.00034537876,0.00007002282,0.000017693656,0.00009636415,0.00024412785,0.0023431848,0.00040716623,0.97761256,0.0069993115,0.011722704],"study_design_scores_gemma":[0.000019578116,0.000015299307,0.00012409902,0.000026286281,0.00001453574,0.00018801166,0.00026601323,0.01189475,0.000591014,0.97917867,0.0076636956,0.00001800146],"about_ca_topic_score_codex":0.0018429785,"about_ca_topic_score_gemma":0.0017161148,"teacher_disagreement_score":0.036702536,"about_ca_system_score_codex":0.002121822,"about_ca_system_score_gemma":0.0014094589,"threshold_uncertainty_score":0.12278223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36544445,0.0033996438,0.32190052,0.0020123464,0.0006435033,0.00019254968,0.0009892938,0.0012011258,0.30421656],"genre_scores_gemma":[0.9154663,0.0011847898,0.029695442,0.00056316436,0.00036532522,0.00015990042,0.00044564312,0.00026517542,0.05185424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929583,0.00022994705,0.000024458217,0.00015764998,0.00014724389,0.00014491146],"domain_scores_gemma":[0.9976891,0.0012197738,0.00027448655,0.00028486937,0.00019948573,0.00033227482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005078314,0.0006695438,0.00060072215,0.0015929776,0.0010164605,0.0019149063,0.0004855509,0.00081479317,0.01768654],"category_scores_gemma":[0.0042184475,0.00046206723,0.00050946797,0.00076528685,0.0016910143,0.002723783,0.0012619247,0.0010780586,0.0028271514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010999983,0.00003106886,0.0005661148,0.00008745679,0.000017241675,0.00014477612,0.00019603681,0.0028116927,0.002789064,0.9766716,0.0057226676,0.010852262],"study_design_scores_gemma":[0.000029926841,0.000023949353,0.00042681373,0.000035426085,0.000013670796,0.00025374044,0.0000936839,0.010763415,0.0013288958,0.97495234,0.012064994,0.000013141936],"about_ca_topic_score_codex":0.00094140565,"about_ca_topic_score_gemma":0.001690367,"teacher_disagreement_score":0.01768654,"about_ca_system_score_codex":0.00067931117,"about_ca_system_score_gemma":0.00043102255,"threshold_uncertainty_score":0.059167385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07302499,0.007923799,0.5921733,0.004076846,0.0020927845,0.00009270388,0.000650272,0.00056418224,0.31940112],"genre_scores_gemma":[0.7815488,0.006187992,0.12433822,0.002491721,0.0019063954,0.00022238253,0.00075108744,0.0002684106,0.08228496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887556,0.00041297887,0.000048549253,0.00015820013,0.00028971414,0.00021489685],"domain_scores_gemma":[0.9977495,0.0010631937,0.0002436783,0.00036035493,0.00039378947,0.00018943998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084645965,0.00095553073,0.00065329764,0.0029301138,0.0015525816,0.0023097256,0.0007918106,0.0013798422,0.011688943],"category_scores_gemma":[0.0043101795,0.00040150058,0.0006539651,0.002289748,0.0025226707,0.0035883372,0.0017294111,0.002651014,0.0038944099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025383295,0.000012934916,0.00010629997,0.000038552793,0.0000060305274,0.0000831347,0.00009939716,0.0015245659,0.00073214935,0.98540086,0.003951791,0.008018903],"study_design_scores_gemma":[0.000008322766,0.000012796946,0.00009667092,0.000027399186,0.0000032355222,0.00015097935,0.00004395405,0.0075736693,0.00051931787,0.98448527,0.007063871,0.00001451069],"about_ca_topic_score_codex":0.001861822,"about_ca_topic_score_gemma":0.002355363,"teacher_disagreement_score":0.011688943,"about_ca_system_score_codex":0.001301845,"about_ca_system_score_gemma":0.00070042873,"threshold_uncertainty_score":0.03910345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73442227,0.0009614459,0.12563823,0.0016794977,0.00053629134,0.0002343984,0.0017925743,0.0008249105,0.1339104],"genre_scores_gemma":[0.95932233,0.00031862248,0.02567097,0.00024307509,0.00007665791,0.00011593837,0.00081626873,0.000061856146,0.013374428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994916,0.00013888544,0.000030748866,0.00009017707,0.00011876568,0.00012985324],"domain_scores_gemma":[0.99914455,0.0002332624,0.00016804754,0.0001670903,0.00013234769,0.00015465946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966611,0.0004336255,0.0005857571,0.0010827865,0.0014831009,0.001553784,0.00070244883,0.0011484087,0.013098279],"category_scores_gemma":[0.001195815,0.00029941188,0.0004476251,0.0011887329,0.0009447271,0.001710287,0.0016056685,0.00095446664,0.0017509961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040330619,0.00007760441,0.001129361,0.00020924257,0.00007195623,0.0013608248,0.00049481733,0.013687364,0.011678172,0.9328024,0.011094909,0.026990099],"study_design_scores_gemma":[0.00018813935,0.00019143448,0.0012111408,0.000081037055,0.00005859205,0.0010881255,0.000909217,0.044291865,0.00841421,0.92330986,0.020192957,0.0000635276],"about_ca_topic_score_codex":0.0007705857,"about_ca_topic_score_gemma":0.0013927135,"teacher_disagreement_score":0.013098279,"about_ca_system_score_codex":0.00077981065,"about_ca_system_score_gemma":0.0007059796,"threshold_uncertainty_score":0.043818057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08155341,0.0040021017,0.5245865,0.0034163448,0.0012305194,0.000105322135,0.0006704334,0.00043474935,0.3840006],"genre_scores_gemma":[0.82438916,0.0026935528,0.078333184,0.0016587225,0.0007055688,0.00025295853,0.00052969443,0.00023183839,0.091205224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993437,0.00015812747,0.000039609156,0.00013111265,0.0001976748,0.00012991045],"domain_scores_gemma":[0.9986553,0.00057500903,0.00009912399,0.0002292743,0.00028591012,0.00015520697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008269583,0.0004590717,0.00065068906,0.001782137,0.0022937297,0.0026615532,0.00077397143,0.0011278103,0.011559217],"category_scores_gemma":[0.003977193,0.00036567036,0.0007397541,0.0012274395,0.0022207142,0.0058721374,0.00222251,0.0020614099,0.0019418843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062143295,0.0000047761837,0.00006670625,0.000018760962,0.0000033673043,0.000031206055,0.000058463273,0.0002173691,0.00017244529,0.99402654,0.0017441047,0.003650129],"study_design_scores_gemma":[0.0000046468826,0.000003535978,0.000058639816,0.000011417021,0.0000040690243,0.00007614436,0.0000358512,0.0016310221,0.00019015542,0.99005544,0.007923472,0.0000056957824],"about_ca_topic_score_codex":0.0016557509,"about_ca_topic_score_gemma":0.0020171641,"teacher_disagreement_score":0.011559217,"about_ca_system_score_codex":0.001255378,"about_ca_system_score_gemma":0.0007145392,"threshold_uncertainty_score":0.038669407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.745724,0.0012687301,0.11628479,0.0014709852,0.00020446313,0.00006014399,0.00086611975,0.00045342965,0.1336673],"genre_scores_gemma":[0.9641352,0.00076209125,0.014429376,0.00013879625,0.00010665053,0.00004221722,0.00044858982,0.000088366316,0.019848792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926215,0.00022012011,0.000030004201,0.00013009486,0.00012740924,0.00023009375],"domain_scores_gemma":[0.997993,0.0010303995,0.0004172839,0.00016945889,0.00014866704,0.000241266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002997189,0.0005359266,0.00041649432,0.0020205036,0.0017891354,0.0025178038,0.0006972369,0.0010729429,0.011792992],"category_scores_gemma":[0.0023358816,0.00040318893,0.00039992787,0.0019787825,0.0018973941,0.0035329254,0.0017366037,0.0012106893,0.0017550447],"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.0002320559,0.00004600931,0.0017679062,0.00012778977,0.00003766181,0.0007890281,0.0007567918,0.011480806,0.004824028,0.9546427,0.005395073,0.01990018],"study_design_scores_gemma":[0.000057293484,0.000060821083,0.0020208317,0.000088458044,0.000035579968,0.0010469235,0.0010099057,0.036670398,0.005188057,0.9366765,0.017104154,0.000040951825],"about_ca_topic_score_codex":0.0027191292,"about_ca_topic_score_gemma":0.0027177783,"teacher_disagreement_score":0.011792992,"about_ca_system_score_codex":0.0013683725,"about_ca_system_score_gemma":0.0003240618,"threshold_uncertainty_score":0.03945148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8036793,0.00022145073,0.15986186,0.00041331898,0.000034418703,0.00012547646,0.00055429066,0.0001260399,0.03498385],"genre_scores_gemma":[0.9711794,0.00019707582,0.019087961,0.00012340643,0.000027667995,0.00013099815,0.0003606088,0.000034483986,0.008858303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995321,0.00015765296,0.00002469602,0.00008267064,0.00010457397,0.00009826336],"domain_scores_gemma":[0.99778336,0.0011003299,0.0004873812,0.00019241836,0.0002649813,0.00017144968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006160913,0.00036681612,0.00036910514,0.0009772433,0.0008919775,0.0012868281,0.00065665063,0.0005950329,0.004705658],"category_scores_gemma":[0.0028283389,0.00044855927,0.00039558858,0.0007511278,0.0010076583,0.001484003,0.00076577195,0.000748465,0.00030497476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022694928,0.000053524873,0.0013218729,0.000058145877,0.000020451944,0.00015985596,0.0003367953,0.022945266,0.005457499,0.9564911,0.0011017226,0.011826816],"study_design_scores_gemma":[0.000070244336,0.000080665355,0.0011954756,0.000041135525,0.000025292036,0.00014292162,0.00018707133,0.0874915,0.0032097972,0.90505296,0.0024784533,0.000024434083],"about_ca_topic_score_codex":0.0026644114,"about_ca_topic_score_gemma":0.0037032166,"teacher_disagreement_score":0.004705658,"about_ca_system_score_codex":0.0009985361,"about_ca_system_score_gemma":0.0011717299,"threshold_uncertainty_score":0.015742004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06762388,0.0014766033,0.69506884,0.0018990184,0.0005900055,0.00012693567,0.00032671908,0.00047329438,0.23241463],"genre_scores_gemma":[0.59421843,0.0013057105,0.3083577,0.0018408675,0.00048806422,0.0004418773,0.0006323078,0.00052082905,0.0921943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985642,0.00070563174,0.000052583502,0.00021624634,0.00030516944,0.00015617689],"domain_scores_gemma":[0.9980908,0.0010500258,0.00015618384,0.00029538455,0.00023355724,0.0001740032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009239528,0.00050755066,0.0005245591,0.0010660448,0.001437361,0.0022460981,0.000962488,0.0009796877,0.011133666],"category_scores_gemma":[0.0049173324,0.00044416924,0.00051306933,0.0012656763,0.002186371,0.0034047056,0.0027252275,0.0021003785,0.0027499318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010275368,0.0000083832,0.000065130684,0.000016675194,0.0000025147372,0.000018715573,0.00007179293,0.000849208,0.0003252419,0.98939335,0.0019329248,0.007305799],"study_design_scores_gemma":[0.000009034375,0.000010455439,0.0000636672,0.000014600688,0.0000032918172,0.00007783569,0.000074810676,0.005818061,0.0004775933,0.98455226,0.008891395,0.0000069544035],"about_ca_topic_score_codex":0.00071981247,"about_ca_topic_score_gemma":0.0015941763,"teacher_disagreement_score":0.011133666,"about_ca_system_score_codex":0.0010659199,"about_ca_system_score_gemma":0.0006413577,"threshold_uncertainty_score":0.03724581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598674,0.0004114658,0.040124703,0.0013148484,0.00027213636,0.000110278736,0.0013200406,0.00063832564,0.39594093],"genre_scores_gemma":[0.9187383,0.00019596511,0.009243028,0.00040681585,0.000087480024,0.00007605102,0.0014797219,0.00034829107,0.06942434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913543,0.00013623545,0.00004269311,0.0002053826,0.00018945686,0.0002908588],"domain_scores_gemma":[0.9983364,0.00065221055,0.00023306972,0.00025636397,0.0002907909,0.0002313517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045438198,0.00076553476,0.0005599142,0.0012844452,0.0024997245,0.0029981479,0.0010449413,0.0010506731,0.027345566],"category_scores_gemma":[0.0019458957,0.00041567048,0.00052945194,0.0009814458,0.0018128373,0.0027531767,0.0023611113,0.0017122924,0.0037918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046839696,0.00012057879,0.00094645505,0.00016359398,0.000030589257,0.0006240604,0.0007099008,0.0021613094,0.008531067,0.9613702,0.008380322,0.016493589],"study_design_scores_gemma":[0.0000743729,0.00006260342,0.0015069818,0.000059908674,0.000046436213,0.0005298903,0.0005470415,0.0055181114,0.013225673,0.9451873,0.033182345,0.00005938353],"about_ca_topic_score_codex":0.0022998475,"about_ca_topic_score_gemma":0.0028422638,"teacher_disagreement_score":0.027345566,"about_ca_system_score_codex":0.001790818,"about_ca_system_score_gemma":0.00070546777,"threshold_uncertainty_score":0.09148002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5185015,0.002024313,0.27159083,0.0035576115,0.0005830878,0.0001446385,0.0013246188,0.0010935273,0.20117998],"genre_scores_gemma":[0.96745235,0.0004459835,0.01817633,0.00031291746,0.00008162683,0.000084097876,0.00039717884,0.000081735656,0.012967756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892056,0.00023184011,0.00007331489,0.000220375,0.00021561212,0.00033820057],"domain_scores_gemma":[0.99607086,0.0019270297,0.00050555606,0.0005768876,0.00045806164,0.00046151583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000720287,0.00031965616,0.0005635733,0.0015256607,0.002971315,0.0033846595,0.00057964126,0.0015309397,0.015559855],"category_scores_gemma":[0.005075869,0.00057109003,0.00061760814,0.0011388753,0.0020481173,0.0044558276,0.0029826474,0.0016885174,0.002405448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001101532,0.000025677871,0.0008631722,0.00013872486,0.000021119606,0.00023341861,0.000493631,0.0023567837,0.0027836915,0.9784691,0.0050467756,0.0094578145],"study_design_scores_gemma":[0.000027306303,0.000044058314,0.0005512494,0.000071358096,0.000023722614,0.00050657516,0.0004894542,0.009702836,0.0023618592,0.9785548,0.0076328325,0.000033806944],"about_ca_topic_score_codex":0.0009592697,"about_ca_topic_score_gemma":0.0012387867,"teacher_disagreement_score":0.015559855,"about_ca_system_score_codex":0.0010817524,"about_ca_system_score_gemma":0.0009569114,"threshold_uncertainty_score":0.052052915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19667202,0.00040043375,0.7896241,0.00033307084,0.00008848869,0.00013193669,0.0001681127,0.0008557545,0.011726112],"genre_scores_gemma":[0.8619091,0.00033301706,0.13137925,0.00013716848,0.000040799205,0.00010659122,0.0001508062,0.00013503338,0.0058082202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897265,0.00024992315,0.000089423054,0.00015464952,0.00035966147,0.00017365492],"domain_scores_gemma":[0.99661237,0.0009845641,0.00048359518,0.0012390903,0.0005521198,0.00012830259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328628,0.0007825706,0.00050456985,0.0007533887,0.00053059653,0.001974181,0.0008613175,0.0010596617,0.0029201726],"category_scores_gemma":[0.004600488,0.00036304802,0.00042264786,0.0009620746,0.0009712345,0.0021929136,0.0013943731,0.0009246556,0.00075864187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022130555,0.00018340655,0.0014106964,0.0003207957,0.000090234935,0.00025912467,0.00043161603,0.07602701,0.3552014,0.4618721,0.0016177702,0.100372836],"study_design_scores_gemma":[0.00017009623,0.0004142938,0.0005868639,0.00014337395,0.00007214881,0.00043889755,0.00009575462,0.361908,0.5283365,0.10336454,0.004384748,0.000084663836],"about_ca_topic_score_codex":0.00017541376,"about_ca_topic_score_gemma":0.00029243343,"teacher_disagreement_score":0.0029201726,"about_ca_system_score_codex":0.0009824515,"about_ca_system_score_gemma":0.0006575515,"threshold_uncertainty_score":0.009768963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046873055,0.00029563456,0.946914,0.00027687754,0.000030134972,0.00009292491,0.00014115084,0.0001729103,0.0052033295],"genre_scores_gemma":[0.40329272,0.00051020953,0.58763224,0.00012466693,0.00007012796,0.0001712569,0.00046179694,0.00015471593,0.0075822244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959534,0.00014456322,0.000016030674,0.000066048975,0.0001209952,0.000057027173],"domain_scores_gemma":[0.99929,0.0003958588,0.000104241204,0.000099938225,0.000059771468,0.000050180402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057891605,0.00064449495,0.0004189171,0.0005113385,0.00041127493,0.0007941792,0.0004228532,0.0005045374,0.004110792],"category_scores_gemma":[0.0021365567,0.00032165207,0.00047509966,0.000809029,0.0006620974,0.0011892691,0.00069177087,0.0008139535,0.0006789749],"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.00036540147,0.0001274619,0.0007324754,0.00037106036,0.000043435062,0.00017440427,0.00025982532,0.5462837,0.028026234,0.22200799,0.0056752283,0.19593278],"study_design_scores_gemma":[0.000043048352,0.000146318,0.000418728,0.000027073978,0.000022105527,0.000110577086,0.0000816936,0.83337617,0.0069032726,0.15346642,0.005383588,0.000021003232],"about_ca_topic_score_codex":0.0020830114,"about_ca_topic_score_gemma":0.0039567733,"teacher_disagreement_score":0.004110792,"about_ca_system_score_codex":0.00089316815,"about_ca_system_score_gemma":0.0008561005,"threshold_uncertainty_score":0.013751924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16371298,0.021988338,0.3995892,0.013517506,0.003665759,0.000117030744,0.00076883566,0.0005448358,0.39609548],"genre_scores_gemma":[0.82168365,0.008987569,0.0737247,0.0032847458,0.0051730075,0.00019663623,0.0006556798,0.00026082832,0.08603318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880123,0.00046487848,0.00007031157,0.00017155994,0.0002679441,0.0002240177],"domain_scores_gemma":[0.99730587,0.0015087825,0.00029082858,0.00043856475,0.00027073562,0.00018522562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193168,0.0008442413,0.0008577405,0.0025237543,0.0016903429,0.001841779,0.00087712385,0.0013002539,0.009256251],"category_scores_gemma":[0.0044114054,0.00049242144,0.0006571399,0.0018364569,0.0035076647,0.007163372,0.0021523046,0.0023946683,0.002152274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023851379,0.000011637456,0.0001037437,0.000044383134,0.000007370922,0.00009036148,0.00015072468,0.0006187177,0.00037137698,0.9888727,0.0034428614,0.006262196],"study_design_scores_gemma":[0.0000055815226,0.000016960854,0.00010102702,0.000018862285,0.0000058808428,0.00013923446,0.000045232566,0.0016522893,0.0001916518,0.9906611,0.007155429,0.0000067283518],"about_ca_topic_score_codex":0.00066362653,"about_ca_topic_score_gemma":0.0009044679,"teacher_disagreement_score":0.009256251,"about_ca_system_score_codex":0.0009576497,"about_ca_system_score_gemma":0.00046253923,"threshold_uncertainty_score":0.030965209},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17130348,0.0017071628,0.7828745,0.0014814516,0.00016557399,0.00055766903,0.0022695703,0.0015908396,0.038049676],"genre_scores_gemma":[0.3091081,0.0009612602,0.6691044,0.00046786616,0.00011867765,0.0005687012,0.0033996517,0.0010041432,0.015267173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990313,0.00034472867,0.000041299852,0.00023449116,0.00017707938,0.00017112831],"domain_scores_gemma":[0.99602354,0.0027687864,0.00028447434,0.0002550778,0.00037511066,0.00029304414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097128557,0.0021217493,0.0035028828,0.0031088032,0.0021284998,0.002971568,0.0033787927,0.0034584454,0.01322401],"category_scores_gemma":[0.007865085,0.0030795375,0.0014755405,0.0042825458,0.0015842076,0.0047013075,0.0033763333,0.0036044796,0.0027456305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014066849,0.0006980201,0.0043804105,0.003023648,0.00026229455,0.00037456327,0.0009185777,0.41924292,0.014069154,0.17809513,0.04918366,0.32834488],"study_design_scores_gemma":[0.00017816115,0.00023869079,0.0013256882,0.00026800152,0.00006106904,0.00029473702,0.0006418963,0.703504,0.005482077,0.28081802,0.0071303924,0.000057191024],"about_ca_topic_score_codex":0.0028517817,"about_ca_topic_score_gemma":0.0051306197,"teacher_disagreement_score":0.01322401,"about_ca_system_score_codex":0.0013841452,"about_ca_system_score_gemma":0.0010245513,"threshold_uncertainty_score":0.044238687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43349782,0.00073965517,0.47311467,0.0006251512,0.00086812733,0.00017459507,0.00026672543,0.00054190756,0.09017134],"genre_scores_gemma":[0.85222507,0.00026809864,0.1310331,0.00026575083,0.00014863675,0.00009082578,0.0002704901,0.00008502878,0.015613034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995485,0.00008099585,0.000025226835,0.00007864744,0.00018866271,0.00007794177],"domain_scores_gemma":[0.99934477,0.00015055743,0.00012108699,0.00012285235,0.00015273641,0.00010804677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035342126,0.00056801905,0.0003819202,0.0009638154,0.0005991651,0.0010285528,0.00046259278,0.0005912971,0.005559307],"category_scores_gemma":[0.0013535513,0.00032377648,0.000529258,0.0006221828,0.0009376116,0.0011869051,0.00063980033,0.0011056715,0.0010776771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001105303,0.00006971325,0.00070454035,0.00007289517,0.000012439606,0.00026229635,0.00018022157,0.006705821,0.023742255,0.9318458,0.002195477,0.03409803],"study_design_scores_gemma":[0.00012839165,0.0004831103,0.0012268504,0.000059035017,0.000026680393,0.0011786225,0.00021697616,0.09423678,0.06452701,0.7884707,0.049317252,0.0001286542],"about_ca_topic_score_codex":0.00027332947,"about_ca_topic_score_gemma":0.00034276908,"teacher_disagreement_score":0.005559307,"about_ca_system_score_codex":0.00047701533,"about_ca_system_score_gemma":0.00047948005,"threshold_uncertainty_score":0.018597722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105405055,0.00035455733,0.88332695,0.00044414002,0.000057275716,0.000064097265,0.00042756158,0.00022374983,0.009696721],"genre_scores_gemma":[0.7869563,0.0006940097,0.19983745,0.0002948738,0.00012836902,0.0002394702,0.001253262,0.0002668247,0.010329395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989741,0.00032330843,0.000052449595,0.00019085589,0.00028963276,0.00016975284],"domain_scores_gemma":[0.9908331,0.005995337,0.00071806816,0.0009954411,0.0009872648,0.0004708476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001882271,0.000379121,0.0010274212,0.0013439903,0.0010578018,0.0016467512,0.0013571552,0.0011636922,0.008093512],"category_scores_gemma":[0.010827137,0.0006390209,0.0009572602,0.0013795557,0.0011788377,0.0034134067,0.001759364,0.00195657,0.00078081863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001971501,0.00005711763,0.0011887813,0.00007052205,0.00003140186,0.00011413665,0.00023056942,0.037045676,0.0019416356,0.92803615,0.003444971,0.02764188],"study_design_scores_gemma":[0.00003530504,0.00004455635,0.0002486054,0.000021628557,0.000016758964,0.00017026979,0.00009629965,0.25737587,0.0008114056,0.7385425,0.00261979,0.000016993392],"about_ca_topic_score_codex":0.0012159889,"about_ca_topic_score_gemma":0.0013431873,"teacher_disagreement_score":0.008093512,"about_ca_system_score_codex":0.0010989173,"about_ca_system_score_gemma":0.0011273861,"threshold_uncertainty_score":0.02707547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.850835,0.00021149295,0.06439378,0.0008511607,0.00011410428,0.0000888019,0.00059937546,0.00039019217,0.082516015],"genre_scores_gemma":[0.95001286,0.00025608987,0.029673802,0.00021864036,0.00003830251,0.00004950312,0.0006234163,0.000089153385,0.01903828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995689,0.00008864974,0.000021819546,0.00009606288,0.000087791916,0.00013677435],"domain_scores_gemma":[0.9987398,0.00045814217,0.0002091284,0.00018109067,0.00019371526,0.00021812896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002984429,0.00059981336,0.0005620613,0.00094324804,0.0011766651,0.0016754487,0.0013328722,0.0008823112,0.007834103],"category_scores_gemma":[0.0016709777,0.0004229965,0.00037738905,0.0009155374,0.0014382593,0.00111935,0.001257864,0.0012145246,0.0010319533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010268269,0.00023965679,0.0034554661,0.0003205927,0.00007965779,0.0011394379,0.0010703738,0.025222337,0.03679167,0.8650666,0.008615879,0.05697149],"study_design_scores_gemma":[0.00023345617,0.00018639074,0.003129098,0.00008038123,0.000109817105,0.0009821358,0.00095073954,0.04881817,0.013225505,0.91324127,0.018973723,0.00006927347],"about_ca_topic_score_codex":0.0017235785,"about_ca_topic_score_gemma":0.002540269,"teacher_disagreement_score":0.007834103,"about_ca_system_score_codex":0.0007779199,"about_ca_system_score_gemma":0.0005603747,"threshold_uncertainty_score":0.026207685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54192466,0.0011745922,0.32164252,0.0051169316,0.00026290907,0.00045628575,0.0016813419,0.00036283213,0.12737788],"genre_scores_gemma":[0.78290594,0.0022842076,0.17044476,0.0009623263,0.00037162888,0.00049618917,0.0030166844,0.00021011234,0.039308194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993305,0.00019257398,0.000028053131,0.00014243336,0.000099217395,0.00020725631],"domain_scores_gemma":[0.9971348,0.0021747085,0.00019696607,0.0001620381,0.0001399461,0.00019151621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008554217,0.000944131,0.0008093243,0.0010761741,0.0014072298,0.0017144865,0.001230131,0.0016727534,0.01420418],"category_scores_gemma":[0.004544347,0.00054440805,0.00066797907,0.0012673343,0.0014737969,0.0033758038,0.0020173513,0.0018932563,0.0012104823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034232743,0.00025748595,0.0011500927,0.0004860934,0.000060162693,0.00058520376,0.00054260565,0.07694316,0.0044393484,0.83539915,0.0149320895,0.06486225],"study_design_scores_gemma":[0.00013711351,0.00008752573,0.0004906685,0.00008774512,0.0000356382,0.0002882407,0.00054977695,0.08397939,0.0028185013,0.9028853,0.008595402,0.000044718992],"about_ca_topic_score_codex":0.0025851203,"about_ca_topic_score_gemma":0.004111923,"teacher_disagreement_score":0.01420418,"about_ca_system_score_codex":0.0012079661,"about_ca_system_score_gemma":0.0011179236,"threshold_uncertainty_score":0.047517717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4151162,0.0028106852,0.29710132,0.0026043348,0.0011895278,0.00036094678,0.0008775024,0.0007587851,0.27918068],"genre_scores_gemma":[0.7399365,0.0014000173,0.20690186,0.0017879335,0.0003905761,0.00028614234,0.0010482696,0.00017014486,0.04807858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951684,0.00014165154,0.00003490784,0.000099687495,0.000121914956,0.00008504659],"domain_scores_gemma":[0.99924445,0.00029403894,0.00010570673,0.00018195914,0.00010484671,0.00006907003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507221,0.0003916938,0.00038038625,0.0005998317,0.0009828204,0.00078302674,0.0005342008,0.0010512964,0.015631758],"category_scores_gemma":[0.0016287108,0.00030356698,0.00050813425,0.00067671714,0.0007713373,0.0011403869,0.000993185,0.0011353738,0.0017748821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024384327,0.00011297655,0.0011568744,0.000408368,0.000038573915,0.000524553,0.00044864867,0.008100356,0.015163983,0.8730337,0.007360589,0.0934076],"study_design_scores_gemma":[0.00021422356,0.00075193774,0.0011088359,0.00021527048,0.00006170297,0.0016765356,0.000263996,0.028023265,0.018523581,0.79180616,0.15724018,0.000114301925],"about_ca_topic_score_codex":0.0002909104,"about_ca_topic_score_gemma":0.00069606747,"teacher_disagreement_score":0.015631758,"about_ca_system_score_codex":0.0006121221,"about_ca_system_score_gemma":0.0005089132,"threshold_uncertainty_score":0.05229348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0657637,0.0012922998,0.0857942,0.0029114678,0.0039951103,0.00021003529,0.0019892314,0.002846493,0.83519757],"genre_scores_gemma":[0.43240756,0.0007239795,0.054933034,0.0018954783,0.0002145907,0.00021255352,0.0015819162,0.001032344,0.5069986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967206,0.000070674985,0.000026375987,0.00009319859,0.00007547049,0.000062336556],"domain_scores_gemma":[0.99929893,0.00012065632,0.000046113844,0.0002019883,0.00025047583,0.00008181466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519661,0.00054636813,0.0003438939,0.0004064423,0.0015104286,0.0017065266,0.00057696854,0.0006540957,0.1366756],"category_scores_gemma":[0.0016914407,0.0002927562,0.00028398487,0.00073529565,0.0011185213,0.0020221234,0.0013116766,0.00095595146,0.036042843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013269653,0.00012826748,0.002195051,0.00037854357,0.000021919339,0.0010185393,0.0029549105,0.001542973,0.017930936,0.4629019,0.19005807,0.31954196],"study_design_scores_gemma":[0.0000324156,0.00017182947,0.0007503528,0.00005974207,0.0000064970573,0.00056792377,0.0014879183,0.0013334784,0.00540819,0.043723084,0.9464355,0.00002304512],"about_ca_topic_score_codex":0.0017915606,"about_ca_topic_score_gemma":0.0034685212,"teacher_disagreement_score":0.1366756,"about_ca_system_score_codex":0.00089251646,"about_ca_system_score_gemma":0.00056400633,"threshold_uncertainty_score":0.45722544},"labels":[],"label_agreement":null},{"id":"W1514353915","doi":"10.1002/jcd.21427","title":"Equitably Colored Balanced Incomplete Block Designs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders; Canada Foundation for Innovation","keywords":"Mathematics; Colored; Integer (computer science); Combinatorics; Block (permutation group theory); Block design; Discrete mathematics; Computer science; Law","score_opus":0.04942652340474804,"score_gpt":0.24936105834956793,"score_spread":0.19993453494481989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514353915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2516869,0.00018008838,0.70267385,0.00019386943,0.00008513054,0.00017678343,0.00031420105,0.00036705632,0.04432214],"genre_scores_gemma":[0.8460955,0.00013068787,0.14662501,0.00012254482,0.000022517132,0.00022523844,0.00024004692,0.000063898675,0.0064745992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988048,0.000382077,0.00008763107,0.00018062159,0.00031768353,0.00022716552],"domain_scores_gemma":[0.99813867,0.00048851356,0.0002819916,0.0004351614,0.0005204784,0.00013516795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011554952,0.00051465974,0.0005211314,0.0005599289,0.0006336026,0.0010897014,0.000686788,0.00046739375,0.006527408],"category_scores_gemma":[0.0028487486,0.00034227435,0.00027141455,0.0004605519,0.00069512153,0.0012683687,0.00091136893,0.0005618379,0.00075570977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001077524,0.00020497199,0.00324617,0.0003556786,0.000095516196,0.00035095194,0.00027496275,0.13461782,0.117187254,0.6612008,0.0030054818,0.07838282],"study_design_scores_gemma":[0.00038392984,0.00082452846,0.0015433017,0.00013160455,0.00010596922,0.00061625574,0.00023853857,0.55280316,0.15185885,0.25383595,0.037582934,0.000074977215],"about_ca_topic_score_codex":0.0005642922,"about_ca_topic_score_gemma":0.0012650458,"teacher_disagreement_score":0.006527408,"about_ca_system_score_codex":0.00077976874,"about_ca_system_score_gemma":0.00078638416,"threshold_uncertainty_score":0.02183628},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.666375,0.00075798,0.28400248,0.00032906176,0.00039031517,0.000094970725,0.00015194264,0.00027293994,0.047625367],"genre_scores_gemma":[0.95170414,0.0002644593,0.03973914,0.000088151624,0.00012430186,0.00008302921,0.00015442524,0.00005146087,0.007790862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00007213016,0.000043319495,0.00015144984,0.0001303253,0.00012556136],"domain_scores_gemma":[0.9991117,0.00030227494,0.00018967384,0.00018662728,0.00009267708,0.00011694775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002993842,0.00041096212,0.00041440775,0.00097411114,0.00096447504,0.0011113706,0.00047513432,0.0005842324,0.0059756464],"category_scores_gemma":[0.0016290606,0.00027651517,0.00059928704,0.0006137693,0.0017980848,0.001890394,0.0017632759,0.00085041823,0.0007433713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008810301,0.000039559865,0.0012214179,0.000089288566,0.000018890989,0.00036315247,0.00051825086,0.0057757855,0.018185746,0.94966924,0.00050568173,0.023524847],"study_design_scores_gemma":[0.00004431244,0.00025302352,0.00094050815,0.00003852385,0.000029435409,0.00090914953,0.0005882654,0.03320645,0.026549688,0.9217751,0.015626628,0.000038833623],"about_ca_topic_score_codex":0.00025687146,"about_ca_topic_score_gemma":0.00021581337,"teacher_disagreement_score":0.0059756464,"about_ca_system_score_codex":0.0004939455,"about_ca_system_score_gemma":0.00022177283,"threshold_uncertainty_score":0.019990504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18142371,0.00095529325,0.68140316,0.0014393297,0.00032265278,0.0002529831,0.0012798009,0.001417107,0.13150597],"genre_scores_gemma":[0.6558935,0.00060892967,0.28011334,0.001035803,0.0001827418,0.0003351044,0.0011489763,0.00040162134,0.060280062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959546,0.000104066836,0.000012535754,0.00009029359,0.00012426896,0.000073374926],"domain_scores_gemma":[0.99893576,0.0005605742,0.00010134789,0.00013017026,0.00016001752,0.00011215344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032750622,0.0004097344,0.0002786174,0.00063161144,0.00063314807,0.00064242986,0.0005793438,0.00068958953,0.019717855],"category_scores_gemma":[0.001965504,0.00030348945,0.0004392203,0.0005663054,0.0006245426,0.001457748,0.0010484258,0.0011752245,0.0030929265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000348744,0.00013389165,0.00087422546,0.00033325134,0.000028562965,0.0005351635,0.00045651087,0.015967196,0.06734811,0.73738635,0.023735188,0.15285283],"study_design_scores_gemma":[0.0000913293,0.00016944137,0.0012254548,0.000095813644,0.000036753914,0.0014742458,0.00024796324,0.1298838,0.03853308,0.72851586,0.09967333,0.00005295068],"about_ca_topic_score_codex":0.0004061646,"about_ca_topic_score_gemma":0.0007899096,"teacher_disagreement_score":0.019717855,"about_ca_system_score_codex":0.00039320503,"about_ca_system_score_gemma":0.00022652053,"threshold_uncertainty_score":0.06596273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039852493,0.0032597464,0.80754375,0.0016224898,0.0007841281,0.000115666226,0.00020947964,0.000581861,0.1460303],"genre_scores_gemma":[0.5761003,0.0053266766,0.30947107,0.0026325956,0.0013245199,0.0006168549,0.00073845504,0.00049295236,0.1032967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987017,0.00041459306,0.00006748961,0.00022332964,0.0004507358,0.0001421599],"domain_scores_gemma":[0.99835324,0.0007089068,0.00019213959,0.00044480743,0.00022720794,0.00007379261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065275683,0.0009060994,0.0009148913,0.001317919,0.0013392855,0.0027465182,0.00078298274,0.0019572545,0.013097453],"category_scores_gemma":[0.0043491204,0.0009507707,0.00057954213,0.0026068476,0.0017925211,0.0041525727,0.0019091961,0.0023683265,0.003213008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049646704,0.000022530372,0.000109712935,0.000069043606,0.00000982381,0.000048748843,0.00009816791,0.0072841356,0.0017044919,0.93922424,0.0041903197,0.04718924],"study_design_scores_gemma":[0.000017323315,0.000047839552,0.000086842294,0.00004263789,0.000011112623,0.00018997483,0.000051858773,0.025096806,0.0033094445,0.9507648,0.020365126,0.000016287924],"about_ca_topic_score_codex":0.00028796794,"about_ca_topic_score_gemma":0.00031544894,"teacher_disagreement_score":0.013097453,"about_ca_system_score_codex":0.00080109714,"about_ca_system_score_gemma":0.0005320931,"threshold_uncertainty_score":0.043815374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77370167,0.00032108495,0.20177856,0.0014947939,0.00029429648,0.00026510982,0.0002887696,0.0023593798,0.019496365],"genre_scores_gemma":[0.8761782,0.00015482705,0.115485586,0.00017844888,0.000047634334,0.00012272311,0.00007890511,0.000049362206,0.0077043027],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996588,0.000058580008,0.000014917835,0.000043464017,0.00015504072,0.000069179645],"domain_scores_gemma":[0.99935645,0.00022384527,0.00008622008,0.000059806007,0.00016213002,0.00011152218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046137843,0.0003750601,0.000330571,0.00043135183,0.000489697,0.0005378813,0.0007261691,0.0009713027,0.0030557606],"category_scores_gemma":[0.00076553004,0.00026526192,0.00024492794,0.00022420847,0.0004730501,0.0006297196,0.00075343467,0.0005589635,0.0007392453],"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.000308894,0.00012166816,0.0011040198,0.00009917548,0.000040095205,0.000832196,0.0004635483,0.004083331,0.95199484,0.01466782,0.001418637,0.024865905],"study_design_scores_gemma":[0.00027204113,0.0020704386,0.0030268508,0.00004805742,0.00005438696,0.0016127138,0.00015362806,0.101706624,0.86435676,0.00537849,0.021200007,0.00012002451],"about_ca_topic_score_codex":0.0012233916,"about_ca_topic_score_gemma":0.0012105216,"teacher_disagreement_score":0.0030557606,"about_ca_system_score_codex":0.00039316982,"about_ca_system_score_gemma":0.0007444541,"threshold_uncertainty_score":0.010222495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58673704,0.00050497206,0.38402423,0.0004668923,0.000031497366,0.00013265427,0.001503796,0.0008309296,0.025767945],"genre_scores_gemma":[0.93233025,0.00032725555,0.05832979,0.00020907763,0.000024851219,0.00021230735,0.0016057774,0.00019466129,0.0067659807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839336,0.00026760998,0.00009667221,0.00045480335,0.00042641576,0.000361088],"domain_scores_gemma":[0.9962084,0.0014691747,0.00070811005,0.00065222464,0.00055095204,0.0004110976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008297434,0.00063535105,0.00071963033,0.0007726604,0.0010779718,0.001806026,0.0016061838,0.00066286983,0.0049253237],"category_scores_gemma":[0.0043333983,0.0007158656,0.0006583632,0.00095889915,0.0017806946,0.0043999525,0.0026220034,0.0016514906,0.0006144482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009811146,0.00016071278,0.007518569,0.00043869205,0.000113351954,0.0005220026,0.0014735047,0.063726015,0.034323815,0.83130574,0.003408788,0.05602779],"study_design_scores_gemma":[0.00013197404,0.0002699791,0.0033065837,0.00011339428,0.00013376563,0.00093364366,0.0008971273,0.19385745,0.031655993,0.7422402,0.026377233,0.00008274704],"about_ca_topic_score_codex":0.0015447624,"about_ca_topic_score_gemma":0.0015776625,"teacher_disagreement_score":0.0049253237,"about_ca_system_score_codex":0.0013917006,"about_ca_system_score_gemma":0.0007541106,"threshold_uncertainty_score":0.01647681},"labels":[],"label_agreement":null},{"id":"W1522959676","doi":"10.1002/jcd.21377","title":"Three‐Phase Barker Arrays","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Aperiodic graph; Phase (matter); Algebraic number; Function (biology); Combinatorics; Existential quantification; Matrix (chemical analysis); Generating function; Discrete mathematics; Arithmetic; Mathematical analysis; Quantum mechanics","score_opus":0.016589660886695418,"score_gpt":0.22608809282131725,"score_spread":0.20949843193462184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522959676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2517016,0.00054664374,0.6728334,0.00066237315,0.00038918163,0.00009105752,0.00030908678,0.0010696902,0.07239697],"genre_scores_gemma":[0.88344187,0.00037889736,0.102216616,0.00046285856,0.00014978029,0.00011538701,0.00019556767,0.00006641493,0.012972626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996099,0.00007680429,0.000023603492,0.00006219208,0.0001359023,0.00009167057],"domain_scores_gemma":[0.99834573,0.0005891079,0.00027999052,0.00030422758,0.0003638307,0.0001170218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003489647,0.0004100048,0.000380039,0.0005760053,0.00049010466,0.00094061,0.00039900307,0.0006529528,0.008572653],"category_scores_gemma":[0.0020916297,0.000247235,0.00026052428,0.00046288586,0.0006798876,0.0012821944,0.00081977155,0.00070447044,0.0019061265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004996064,0.00008572046,0.0010528513,0.00013966103,0.000026478157,0.00041717672,0.00028836614,0.030229831,0.1477708,0.7381481,0.0044884165,0.07685296],"study_design_scores_gemma":[0.00012176097,0.00045824365,0.001128829,0.00006678571,0.00003433846,0.0011636899,0.00022042364,0.24773028,0.13861288,0.5638228,0.046492692,0.00014723695],"about_ca_topic_score_codex":0.00020679065,"about_ca_topic_score_gemma":0.00025980867,"teacher_disagreement_score":0.008572653,"about_ca_system_score_codex":0.0002744675,"about_ca_system_score_gemma":0.00028257398,"threshold_uncertainty_score":0.028678417},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05963128,0.0031194228,0.8367394,0.0069847205,0.0004977508,0.00042239428,0.0010853302,0.0019703303,0.0895494],"genre_scores_gemma":[0.7624867,0.003286057,0.19602905,0.0014257132,0.00090161874,0.0015665087,0.0015824926,0.000981662,0.03174025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98165625,0.0040214094,0.00096129073,0.0026862845,0.007301041,0.00337365],"domain_scores_gemma":[0.9332033,0.046969328,0.0027689054,0.01148666,0.0029399004,0.002631894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111447545,0.0032343916,0.0031157488,0.0040752436,0.005662488,0.015293201,0.009476336,0.005844024,0.015649024],"category_scores_gemma":[0.04266531,0.0034378343,0.003230844,0.006623103,0.0087028025,0.030550051,0.019986333,0.023095535,0.0055157547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019385495,0.00011270898,0.00020921516,0.00013593897,0.000031010997,0.0000587225,0.00033713103,0.0117259165,0.0012157303,0.9730032,0.0026473303,0.01032915],"study_design_scores_gemma":[0.00003831895,0.00004089571,0.00011791187,0.0000922101,0.000050146104,0.00006416978,0.00007218464,0.04272301,0.0030946683,0.9496188,0.0040301024,0.000057659876],"about_ca_topic_score_codex":0.0013876151,"about_ca_topic_score_gemma":0.0016313996,"teacher_disagreement_score":0.015649024,"about_ca_system_score_codex":0.010877669,"about_ca_system_score_gemma":0.0060407617,"threshold_uncertainty_score":0.078923404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36530197,0.002332965,0.495787,0.0019355876,0.0002621542,0.00015995774,0.0018249473,0.0011461569,0.13124923],"genre_scores_gemma":[0.9300635,0.0008996216,0.04038836,0.0005578496,0.00026414354,0.00019342135,0.00095804915,0.00016838413,0.026506621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985794,0.00049092335,0.000051061223,0.0002997708,0.00033098832,0.00024796664],"domain_scores_gemma":[0.9930641,0.0032760298,0.0011301753,0.0009927567,0.0008281596,0.00070875476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992824,0.0006864036,0.00053683337,0.002843307,0.0017898543,0.0019429751,0.00072114175,0.0010364747,0.008440541],"category_scores_gemma":[0.0076704137,0.0006297418,0.0006189482,0.0011228133,0.0014771642,0.0021630032,0.0015555522,0.0010933278,0.0020247723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012682627,0.00004044501,0.0012370034,0.00006697126,0.000037102753,0.00046391116,0.00025229296,0.0044604223,0.0032982507,0.9686521,0.007907075,0.013457542],"study_design_scores_gemma":[0.000073888856,0.00007988376,0.0019187825,0.000081997285,0.00003858037,0.0027767392,0.00029868563,0.048308462,0.0041033225,0.923485,0.018764148,0.00007049408],"about_ca_topic_score_codex":0.00064689957,"about_ca_topic_score_gemma":0.0009510671,"teacher_disagreement_score":0.008440541,"about_ca_system_score_codex":0.0007154182,"about_ca_system_score_gemma":0.0006378988,"threshold_uncertainty_score":0.028236449},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77948725,0.001335311,0.12704302,0.0029469077,0.00048469668,0.00014855315,0.0012366408,0.0003975348,0.08692008],"genre_scores_gemma":[0.96104664,0.0007780465,0.015448995,0.00048813084,0.00108813,0.00019213955,0.0015935501,0.00019897037,0.019165318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990025,0.00027075404,0.000041167365,0.00024751565,0.00023977645,0.00019830657],"domain_scores_gemma":[0.9965624,0.0018572524,0.000514368,0.00017613375,0.00023923299,0.0006505843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009980967,0.0013150872,0.0013486325,0.0026927898,0.0030737855,0.0052666026,0.0015206076,0.0022538335,0.012971577],"category_scores_gemma":[0.0047952603,0.0009823875,0.0012555287,0.0014914796,0.0031458251,0.004292233,0.0023565297,0.0035307975,0.0011815525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016129066,0.00006488999,0.00084279996,0.0000738522,0.000017738665,0.00022848333,0.0004864234,0.0019569278,0.0014776352,0.98523027,0.00400694,0.0054528685],"study_design_scores_gemma":[0.000055678523,0.000049763144,0.0006786773,0.000024778743,0.000018669118,0.0002853505,0.00017416332,0.011325829,0.00041693953,0.9828441,0.004105305,0.00002074767],"about_ca_topic_score_codex":0.0019923237,"about_ca_topic_score_gemma":0.001699761,"teacher_disagreement_score":0.012971577,"about_ca_system_score_codex":0.001727281,"about_ca_system_score_gemma":0.00066465157,"threshold_uncertainty_score":0.043394268},"labels":[],"label_agreement":null},{"id":"W1541637185","doi":"10.1002/jcd.1027","title":"Cycle decompositions III: Complete graphs and fixed length cycles","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Order (exchange); Decomposition; Discrete mathematics","score_opus":0.017931818266640507,"score_gpt":0.22816228992088358,"score_spread":0.21023047165424308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541637185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47732532,0.002832816,0.42193845,0.0010490286,0.0002688102,0.0005093674,0.002342536,0.00049081293,0.09324285],"genre_scores_gemma":[0.89817655,0.0015738378,0.08224562,0.00043540905,0.00015113404,0.0003949416,0.0030731931,0.0001633709,0.013785895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990953,0.00012859257,0.00005254889,0.00021332533,0.00024977772,0.0002604612],"domain_scores_gemma":[0.9979247,0.0006538413,0.00035660586,0.00028028912,0.00048610356,0.00029847806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006471657,0.0006683714,0.0006295303,0.0018164478,0.0009229124,0.0021718193,0.00060869433,0.00084724394,0.007126549],"category_scores_gemma":[0.00306374,0.00061777537,0.00091208564,0.0012288223,0.0016180088,0.0021946097,0.0012138538,0.00133981,0.0007654914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035948542,0.000091766255,0.0020395906,0.00032555472,0.000055081047,0.00061630463,0.0005007309,0.019308237,0.021602103,0.9117623,0.0068303463,0.036508523],"study_design_scores_gemma":[0.00012232739,0.000117775584,0.0015264647,0.00022603435,0.000052156345,0.00078263367,0.00052188314,0.04479635,0.013709624,0.9149693,0.02312278,0.000052628362],"about_ca_topic_score_codex":0.0016383053,"about_ca_topic_score_gemma":0.0022768322,"teacher_disagreement_score":0.007126549,"about_ca_system_score_codex":0.00090488343,"about_ca_system_score_gemma":0.001038231,"threshold_uncertainty_score":0.023840666},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49652228,0.0020733173,0.29362828,0.0032810634,0.0002748849,0.0001203868,0.0005867954,0.0010765413,0.20243643],"genre_scores_gemma":[0.92463994,0.0010677327,0.036620863,0.00031347323,0.00014293498,0.00010579131,0.00033087717,0.0002709787,0.036507454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991819,0.00033454117,0.000041320385,0.00015432549,0.0001276392,0.00016013312],"domain_scores_gemma":[0.9941182,0.0040232097,0.0004764777,0.00065340474,0.00030452228,0.0004241141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069729576,0.0007456299,0.0008291435,0.0014844806,0.0018759167,0.0039503365,0.0011808184,0.0012863011,0.01151504],"category_scores_gemma":[0.0065030647,0.00072577584,0.00059331866,0.0026851364,0.0030121643,0.0076805144,0.0032665192,0.0021824173,0.0011788994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105131534,0.000040029554,0.00043899534,0.00009161781,0.000010225722,0.00016970906,0.0004389675,0.005843864,0.0010993928,0.9762224,0.0024051578,0.013134527],"study_design_scores_gemma":[0.000016058675,0.000017271757,0.00027841757,0.000033498978,0.000015678808,0.00018724096,0.00031622523,0.019473366,0.0009818227,0.97307825,0.00558593,0.00001622855],"about_ca_topic_score_codex":0.001178053,"about_ca_topic_score_gemma":0.0021191866,"teacher_disagreement_score":0.01151504,"about_ca_system_score_codex":0.001471144,"about_ca_system_score_gemma":0.00041628393,"threshold_uncertainty_score":0.038521707},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07243975,0.0034975884,0.74748623,0.007787502,0.001044562,0.00032204777,0.0013514715,0.0018861444,0.16418478],"genre_scores_gemma":[0.53132075,0.0045442404,0.38924468,0.00449132,0.0022927565,0.0011951756,0.003487671,0.002629656,0.06079366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963259,0.0011606528,0.00015536326,0.0006796166,0.0010857359,0.00059271866],"domain_scores_gemma":[0.98855853,0.0071404544,0.0006329088,0.0020499607,0.00071056426,0.000907561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031359207,0.0024360882,0.0019059469,0.0032861081,0.0031854422,0.006041955,0.004928835,0.003352773,0.026609035],"category_scores_gemma":[0.018940458,0.0015173308,0.0027217476,0.0041848207,0.004158388,0.014004259,0.007839316,0.01120152,0.005155723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013713112,0.00020241614,0.00054396887,0.0002604136,0.000042829328,0.00019243473,0.00035243804,0.012990956,0.002135926,0.9311512,0.020860963,0.031129168],"study_design_scores_gemma":[0.00003486042,0.000057422243,0.00016822813,0.00009541399,0.000030008117,0.00020468197,0.000095962154,0.055942494,0.0011853249,0.93136305,0.010775433,0.000047165515],"about_ca_topic_score_codex":0.0016494186,"about_ca_topic_score_gemma":0.0020350486,"teacher_disagreement_score":0.026609035,"about_ca_system_score_codex":0.0027745466,"about_ca_system_score_gemma":0.0016376674,"threshold_uncertainty_score":0.08901608},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21956144,0.00034352732,0.745166,0.0006045035,0.000102531274,0.0005616678,0.0010581306,0.0004792064,0.032122992],"genre_scores_gemma":[0.5339282,0.00052419753,0.44724822,0.0002552447,0.00004344143,0.0005470094,0.0019029162,0.0003180335,0.015232682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908674,0.00027440875,0.00006759203,0.00015827645,0.00025392245,0.00015897078],"domain_scores_gemma":[0.9985216,0.00054658134,0.00014003602,0.00047337174,0.00023008356,0.000088346314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048698203,0.0006199766,0.0008522669,0.0012175187,0.0011088252,0.0020621193,0.0010022016,0.0008323114,0.009214384],"category_scores_gemma":[0.0022898363,0.0006735804,0.00080039474,0.0018438436,0.0012516177,0.002712567,0.0024938222,0.0014619053,0.0018530469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011658927,0.00029451755,0.0027022844,0.00059308315,0.00015276943,0.0003507572,0.0009208819,0.13301025,0.049422894,0.5650272,0.010861084,0.23549843],"study_design_scores_gemma":[0.00017202819,0.00041949397,0.001317311,0.0002071922,0.00009223413,0.00040123274,0.0018112578,0.24760208,0.038005933,0.67644054,0.03347493,0.00005583692],"about_ca_topic_score_codex":0.0015576674,"about_ca_topic_score_gemma":0.0017932131,"teacher_disagreement_score":0.009214384,"about_ca_system_score_codex":0.00074260164,"about_ca_system_score_gemma":0.00067538855,"threshold_uncertainty_score":0.030825138},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13117991,0.0047652274,0.63261485,0.0014599217,0.0011480398,0.00018346665,0.0003651399,0.00077262527,0.2275108],"genre_scores_gemma":[0.57382697,0.0037215662,0.3060435,0.000817876,0.00073531835,0.0003702752,0.0005260263,0.0005533471,0.11340527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.00009643388,0.000022170194,0.00006610893,0.0001226469,0.00005140022],"domain_scores_gemma":[0.99954945,0.00016651727,0.000048754388,0.00007733352,0.000092888586,0.000064968015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181496,0.000803361,0.00058300974,0.002044211,0.0014007484,0.0024583405,0.0007728073,0.0010825188,0.0058313347],"category_scores_gemma":[0.0014288062,0.0005176562,0.00063529843,0.0013875498,0.001725649,0.0027158028,0.0011143724,0.0020912604,0.001484514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016552236,0.00001062733,0.000034399265,0.00003520314,0.0000021515193,0.000054656335,0.00012761963,0.00052414666,0.0023650492,0.98463744,0.0010375527,0.011154508],"study_design_scores_gemma":[0.000013030613,0.000033841996,0.00010421584,0.00002951577,0.0000072238026,0.0005248767,0.00009711483,0.0056491937,0.004387799,0.9674805,0.02164999,0.000022763885],"about_ca_topic_score_codex":0.00023765703,"about_ca_topic_score_gemma":0.00031955892,"teacher_disagreement_score":0.0058313347,"about_ca_system_score_codex":0.0010531594,"about_ca_system_score_gemma":0.0004737367,"threshold_uncertainty_score":0.019507766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069301343,0.00005358646,0.9825616,0.00009087761,0.000058029924,0.00007592964,0.00035093157,0.0014595679,0.008419242],"genre_scores_gemma":[0.10924377,0.00022819826,0.8687821,0.00011508634,0.0000622077,0.00026529032,0.0011869775,0.00075980823,0.019356476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916244,0.00019290071,0.00006553928,0.00018116334,0.00029068973,0.00010722861],"domain_scores_gemma":[0.9975132,0.0006207433,0.000116530915,0.0012559465,0.0003887733,0.000104925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092705456,0.00060502614,0.0006842258,0.0012554993,0.0014370264,0.0022188735,0.002837566,0.0010692303,0.013899811],"category_scores_gemma":[0.0034338178,0.0006804493,0.00066346716,0.0024034863,0.0011554544,0.0051656333,0.0029588365,0.002388302,0.0041592666],"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.00023305028,0.00015763144,0.00019993962,0.00021205095,0.000015858053,0.000080200734,0.00055575394,0.026792374,0.014772408,0.6101887,0.013424676,0.33336726],"study_design_scores_gemma":[0.00009569208,0.000113084076,0.00018022972,0.00011390667,0.00004616189,0.00015331327,0.00017830062,0.2561021,0.016256941,0.6369133,0.0897608,0.00008623057],"about_ca_topic_score_codex":0.0018346582,"about_ca_topic_score_gemma":0.0032025746,"teacher_disagreement_score":0.013899811,"about_ca_system_score_codex":0.0009912376,"about_ca_system_score_gemma":0.0009401566,"threshold_uncertainty_score":0.04649949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5011723,0.0021279638,0.22364654,0.0033622412,0.0006862744,0.00011769963,0.0006273232,0.000467919,0.26779172],"genre_scores_gemma":[0.9257853,0.0008377598,0.029831685,0.00017381796,0.00033927607,0.000052539683,0.00025821166,0.00026165557,0.042459816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985644,0.00053347874,0.00006302949,0.0002602836,0.00033053293,0.00024830602],"domain_scores_gemma":[0.98929626,0.0061857398,0.0012697526,0.0013567964,0.0010185192,0.00087300246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629511,0.00048135643,0.0008332752,0.002487638,0.0030024454,0.0041859215,0.0017966221,0.0013878457,0.018736906],"category_scores_gemma":[0.010705644,0.00060812663,0.00079791865,0.0038623342,0.0036050244,0.010743212,0.002080225,0.0024333168,0.0011564449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004895841,0.000049788992,0.0007825886,0.000045497807,0.0000037442735,0.00006542668,0.00029798053,0.0019592128,0.0004993696,0.98535144,0.001680583,0.009215411],"study_design_scores_gemma":[0.000014622948,0.000035405035,0.0008499349,0.000048137852,0.000019489147,0.0003360479,0.00049037853,0.019742101,0.0012186894,0.96645766,0.010758831,0.000028602095],"about_ca_topic_score_codex":0.0016217567,"about_ca_topic_score_gemma":0.0019360706,"teacher_disagreement_score":0.018736906,"about_ca_system_score_codex":0.0019392652,"about_ca_system_score_gemma":0.0007385813,"threshold_uncertainty_score":0.0626812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91245365,0.00020078006,0.03489489,0.00019593607,0.000039632545,0.000069263704,0.0008911891,0.00011453672,0.051140115],"genre_scores_gemma":[0.9816218,0.00016283893,0.010595703,0.000042047606,0.0000284498,0.00005528092,0.0008806986,0.000035166617,0.006578052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952567,0.00005614974,0.000044508502,0.000073833064,0.00015911557,0.00014073245],"domain_scores_gemma":[0.9987978,0.00038921082,0.00032768055,0.00013948021,0.00019880632,0.00014700637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033518233,0.00028316837,0.00035763538,0.00084716774,0.0011357507,0.0016644963,0.00033599194,0.00035120468,0.009232201],"category_scores_gemma":[0.0014315635,0.0003288569,0.000470082,0.0009318015,0.0009420369,0.0011251036,0.00079142256,0.00068336434,0.0007736425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039300357,0.000100056095,0.0076840627,0.00021309846,0.000055262753,0.00086653343,0.0010968847,0.02389219,0.046267856,0.870934,0.0040930267,0.04440402],"study_design_scores_gemma":[0.00018253954,0.000706692,0.010643127,0.00010158315,0.000093507755,0.0027634108,0.0016275547,0.047817145,0.04028283,0.84265137,0.052999046,0.00013107454],"about_ca_topic_score_codex":0.0008354205,"about_ca_topic_score_gemma":0.0010672127,"teacher_disagreement_score":0.009232201,"about_ca_system_score_codex":0.0007320613,"about_ca_system_score_gemma":0.00071632076,"threshold_uncertainty_score":0.030884743},"labels":[],"label_agreement":null},{"id":"W1565202964","doi":"10.1002/jcd.21393","title":"A Three‐Factor Product Construction for Mutually Orthogonal Latin Squares","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kronecker product; Mathematics; Transversal (combinatorics); Product (mathematics); Latin square; Orthogonal array; Combinatorics; Table (database); Resolution (logic); Square (algebra); Kronecker delta; Algebra over a field; Pure mathematics; Statistics; Computer science; Geometry; Mathematical analysis","score_opus":0.019663794156290007,"score_gpt":0.22177891748209777,"score_spread":0.20211512332580778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565202964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18404347,0.0004210291,0.7459676,0.00034096692,0.00031350146,0.00010925337,0.00018626443,0.00095734984,0.06766054],"genre_scores_gemma":[0.75841564,0.00030876626,0.22330914,0.00026614487,0.000106800326,0.0001237073,0.00021709198,0.0003377604,0.016914971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926525,0.00020374473,0.00004582191,0.00015335286,0.0001910155,0.00014070798],"domain_scores_gemma":[0.99922144,0.00019725441,0.00008308631,0.00025609278,0.00015346317,0.00008863744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755257,0.0003677769,0.00037567972,0.0006775306,0.00066479004,0.001081403,0.00046357978,0.00045601782,0.008857756],"category_scores_gemma":[0.0011277765,0.0003883644,0.00055775116,0.00054849545,0.0011388524,0.0011691971,0.0018089372,0.0010534824,0.0017354088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015678439,0.00005101727,0.0006242441,0.000099153884,0.000017629012,0.0002937785,0.00037062372,0.003312,0.03200968,0.8802932,0.003141971,0.07962991],"study_design_scores_gemma":[0.000106779735,0.0006449162,0.0009313454,0.00011553462,0.00006740746,0.0018040919,0.0004585482,0.04598907,0.11448855,0.73056746,0.10470158,0.000124732],"about_ca_topic_score_codex":0.00025944528,"about_ca_topic_score_gemma":0.00029245156,"teacher_disagreement_score":0.008857756,"about_ca_system_score_codex":0.00030382237,"about_ca_system_score_gemma":0.00027163772,"threshold_uncertainty_score":0.029632151},"labels":[],"label_agreement":null},{"id":"W1566220351","doi":"10.1002/jcd.21312","title":"On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Complete bipartite graph; Hamiltonian path; Graph; Discrete mathematics","score_opus":0.029608792030511425,"score_gpt":0.2273490084058673,"score_spread":0.19774021637535588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566220351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37103742,0.0013069874,0.5331441,0.0032626872,0.00018890407,0.00060151867,0.0015256925,0.00046195244,0.08847069],"genre_scores_gemma":[0.8266492,0.001198697,0.13968475,0.0007823418,0.00022482075,0.00036278192,0.0014832213,0.00019994046,0.029414237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988092,0.00038663007,0.0000440795,0.00022950086,0.00019485324,0.00033583186],"domain_scores_gemma":[0.99698704,0.0021694626,0.00020158461,0.00029038955,0.00018842958,0.00016313195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011121061,0.0006131618,0.000747433,0.00064625626,0.0013379661,0.0014431924,0.0009810046,0.0013532051,0.014555414],"category_scores_gemma":[0.0044662296,0.000492378,0.0008209645,0.0009540742,0.0016236935,0.0044818674,0.0013246887,0.0012563039,0.0009028673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183685,0.00026605822,0.0012043709,0.0003580195,0.000059591544,0.00042915548,0.00061878504,0.06314137,0.0051591913,0.8545773,0.020261312,0.053406276],"study_design_scores_gemma":[0.00015788835,0.00010178359,0.0003463574,0.0000641427,0.000026673404,0.00015272359,0.0003662375,0.14131957,0.002566856,0.8424328,0.012424443,0.000040399045],"about_ca_topic_score_codex":0.012124315,"about_ca_topic_score_gemma":0.01457494,"teacher_disagreement_score":0.014555414,"about_ca_system_score_codex":0.0018625215,"about_ca_system_score_gemma":0.0015883052,"threshold_uncertainty_score":0.048692763},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20902307,0.0021686782,0.45478743,0.0017642439,0.0016451047,0.00017914329,0.001640088,0.0011461547,0.32764605],"genre_scores_gemma":[0.8339622,0.0009943326,0.08693778,0.0007553828,0.0004800269,0.00016861605,0.0010737403,0.00026551526,0.07536247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910706,0.00019354842,0.00006309539,0.00016027116,0.00025002877,0.00022597566],"domain_scores_gemma":[0.9979729,0.00055470085,0.00033519085,0.0003256238,0.00042864736,0.0003829504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000405637,0.00069963076,0.0003663773,0.0025906,0.0013671402,0.002374546,0.0004669326,0.0006739284,0.01611638],"category_scores_gemma":[0.0026481282,0.00030009175,0.00031848953,0.0011866117,0.0011048707,0.0025043434,0.0011084498,0.0012122702,0.0030742516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008032127,0.000026412707,0.00025916676,0.00004794364,0.0000061520614,0.00019003877,0.00015412369,0.0007231176,0.004595076,0.9690842,0.0043352935,0.020498151],"study_design_scores_gemma":[0.000022141034,0.000047992813,0.00034637278,0.000046106106,0.000009111627,0.00043836888,0.00017523312,0.0064530913,0.004891643,0.9555478,0.031995904,0.00002622231],"about_ca_topic_score_codex":0.00073161005,"about_ca_topic_score_gemma":0.001889937,"teacher_disagreement_score":0.01611638,"about_ca_system_score_codex":0.00076488836,"about_ca_system_score_gemma":0.0005907659,"threshold_uncertainty_score":0.053914666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35080293,0.0010625913,0.4979364,0.0009871629,0.00019867037,0.00013570325,0.00049607333,0.0013083097,0.14707224],"genre_scores_gemma":[0.826129,0.00054318405,0.14648633,0.00039727884,0.00012481683,0.0003585918,0.00072098966,0.00025641153,0.024983503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878675,0.00044615683,0.00006410242,0.00023743574,0.00030661863,0.00015900523],"domain_scores_gemma":[0.9972351,0.0013683117,0.00035238746,0.0004670295,0.00030488858,0.0002722912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069552474,0.00063540495,0.0004971635,0.00216117,0.0022073856,0.002814051,0.0016561215,0.0010434475,0.010612588],"category_scores_gemma":[0.003859937,0.0007104689,0.00047688326,0.0016472992,0.0026370927,0.0034486104,0.002937748,0.0017019486,0.0020564592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066745524,0.000019911706,0.0003883222,0.000057503457,0.0000069178855,0.00011623875,0.0002025404,0.0027810533,0.002170247,0.981531,0.0020167104,0.010642881],"study_design_scores_gemma":[0.000059766804,0.0001160907,0.00064546,0.00010783644,0.000026826308,0.0008735305,0.00051354466,0.03762873,0.016069522,0.90290743,0.040991835,0.000059383645],"about_ca_topic_score_codex":0.0002657406,"about_ca_topic_score_gemma":0.0004924064,"teacher_disagreement_score":0.010612588,"about_ca_system_score_codex":0.0009917925,"about_ca_system_score_gemma":0.0002383846,"threshold_uncertainty_score":0.035502613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028431665,0.0005997698,0.9248389,0.000424653,0.00040887325,0.0001169351,0.00016852855,0.00024471374,0.044765957],"genre_scores_gemma":[0.2844691,0.0019653824,0.68283963,0.0009620883,0.00078298576,0.00045020803,0.0005092726,0.00035007973,0.02767128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984743,0.00053269655,0.000065246466,0.00023884242,0.000518461,0.00017043225],"domain_scores_gemma":[0.9967116,0.0019096422,0.0002627706,0.0005463151,0.00041221394,0.00015740942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015208705,0.0013742632,0.00065702904,0.0018564068,0.0013439059,0.0014235481,0.0010140515,0.0012954226,0.009749032],"category_scores_gemma":[0.0072318125,0.00060474745,0.0008983428,0.0022272673,0.0022912933,0.00269041,0.0014248297,0.0025948256,0.0031031643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004363286,0.00006156282,0.00017064798,0.000088563604,0.000010046607,0.000086193984,0.00012994501,0.011967968,0.0040651876,0.92402494,0.0044834153,0.054867934],"study_design_scores_gemma":[0.000022869981,0.0000865156,0.00013128611,0.000050355746,0.00001043553,0.00017566397,0.0000334804,0.04890599,0.0035214948,0.93503064,0.011989764,0.000041461542],"about_ca_topic_score_codex":0.0008778815,"about_ca_topic_score_gemma":0.0015386496,"teacher_disagreement_score":0.009749032,"about_ca_system_score_codex":0.000955507,"about_ca_system_score_gemma":0.0008057215,"threshold_uncertainty_score":0.032613754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20909311,0.0028754685,0.5130856,0.0024200114,0.00069464074,0.000065139095,0.00036283748,0.0010122512,0.270391],"genre_scores_gemma":[0.901154,0.0016323375,0.068006985,0.00036019005,0.000611223,0.00010132929,0.00035638534,0.0005112854,0.027266238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994235,0.00016709646,0.00003826826,0.00010847271,0.0001656684,0.00009697872],"domain_scores_gemma":[0.9986539,0.0006571134,0.0001337782,0.0001257243,0.00027175905,0.00015766728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007922533,0.0005266254,0.0004615733,0.0042462763,0.0015957488,0.0024826534,0.000725241,0.00086519006,0.010944046],"category_scores_gemma":[0.0032891692,0.00035445258,0.00062961696,0.0021001038,0.0020993862,0.0037579334,0.002222453,0.0019992818,0.002232438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025794445,0.000011821829,0.00010863514,0.000019357065,0.0000029735172,0.000081390725,0.0002406843,0.00057739334,0.00065185584,0.9866001,0.0012755162,0.010404485],"study_design_scores_gemma":[0.000007225008,0.000016248876,0.00013067518,0.000028822415,0.000004016394,0.00024065372,0.00016710725,0.007642291,0.0011641163,0.9838451,0.0067366264,0.000017071441],"about_ca_topic_score_codex":0.00069620775,"about_ca_topic_score_gemma":0.00049326563,"teacher_disagreement_score":0.010944046,"about_ca_system_score_codex":0.0009854091,"about_ca_system_score_gemma":0.0004940901,"threshold_uncertainty_score":0.036611438},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42364308,0.0008723087,0.1154402,0.0029225831,0.0013690002,0.00044188622,0.0033603678,0.002710092,0.44924048],"genre_scores_gemma":[0.88874584,0.00068137684,0.026633522,0.0010150447,0.00030757685,0.00027492686,0.0017976072,0.00062433677,0.079919755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908435,0.00010808734,0.000035337423,0.00019156994,0.00021503054,0.00036566905],"domain_scores_gemma":[0.9974445,0.0005002618,0.00061253086,0.0006927123,0.00038490182,0.00036514096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039053592,0.00080625876,0.00037279387,0.0025441514,0.0033845487,0.002962078,0.00094679557,0.0011303525,0.021917716],"category_scores_gemma":[0.0028732438,0.0005108314,0.00087116146,0.0015140993,0.0029047623,0.0020928672,0.0015693099,0.0022622277,0.0033299588],"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.00037743806,0.00008614257,0.0011531599,0.00019968995,0.000036836027,0.0007528089,0.0005732573,0.0026976096,0.01681878,0.9230406,0.017606677,0.036656875],"study_design_scores_gemma":[0.0000438833,0.00007929781,0.0038946047,0.00006739257,0.00004761248,0.0010083125,0.00039686152,0.0048948782,0.016659016,0.90132487,0.0714564,0.00012696952],"about_ca_topic_score_codex":0.0035722416,"about_ca_topic_score_gemma":0.0063245897,"teacher_disagreement_score":0.021917716,"about_ca_system_score_codex":0.0016094897,"about_ca_system_score_gemma":0.001815325,"threshold_uncertainty_score":0.07332212},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1828832,0.00031354354,0.7756132,0.00027066597,0.00006534562,0.00022221738,0.00013923207,0.00082372344,0.03966887],"genre_scores_gemma":[0.48958695,0.00030705746,0.5053729,0.00013986671,0.00002485873,0.00020288689,0.00022546825,0.0001862711,0.0039537656],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994579,0.00020993943,0.00003071656,0.00006494435,0.00016592898,0.000070522314],"domain_scores_gemma":[0.99869484,0.0008046443,0.00007333412,0.00025634648,0.000139932,0.00003100046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006005922,0.00049579557,0.00029839994,0.0008174084,0.00037082133,0.00054228987,0.00053725997,0.0002922899,0.003332004],"category_scores_gemma":[0.0031637405,0.00021872245,0.0003426769,0.00057167053,0.0005747177,0.0010968167,0.000901619,0.0006662523,0.0009242583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061305094,0.00018701216,0.0010702516,0.00028008412,0.000023584942,0.00037215048,0.00041783345,0.1318704,0.19132057,0.27891076,0.002781796,0.39215255],"study_design_scores_gemma":[0.00011744261,0.00081939885,0.0005179484,0.00010196431,0.000023449666,0.00063808216,0.00015977983,0.6124921,0.27042624,0.091811724,0.022827394,0.00006451079],"about_ca_topic_score_codex":0.00046708665,"about_ca_topic_score_gemma":0.0009947707,"teacher_disagreement_score":0.003332004,"about_ca_system_score_codex":0.00032869613,"about_ca_system_score_gemma":0.0003554942,"threshold_uncertainty_score":0.011146605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076017186,0.0047534434,0.822593,0.0056741345,0.001238595,0.0002815268,0.0009902578,0.0017067234,0.08674523],"genre_scores_gemma":[0.62165743,0.0044166646,0.32200107,0.0033611446,0.0030245571,0.0014231391,0.0013629757,0.0010815742,0.04167148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897441,0.0026695107,0.0006626168,0.0025030256,0.0032589089,0.0011618567],"domain_scores_gemma":[0.95197237,0.031954158,0.0024305035,0.0099169165,0.001958488,0.0017675823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006964686,0.0036561778,0.00288573,0.003993687,0.0028126235,0.008530551,0.00546874,0.004878144,0.022108134],"category_scores_gemma":[0.035611905,0.0018570448,0.0024431648,0.00406638,0.0063220738,0.022433566,0.008132971,0.008886168,0.003935402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010844854,0.00022515625,0.0015223941,0.00053321884,0.0001302344,0.00022219932,0.00021677754,0.030095626,0.011447706,0.8803367,0.0110514015,0.06313417],"study_design_scores_gemma":[0.00015268764,0.00021513323,0.0004594405,0.00015382035,0.00012684548,0.00052006193,0.00004898726,0.09070991,0.008066781,0.8866457,0.012800553,0.00010021994],"about_ca_topic_score_codex":0.00036197083,"about_ca_topic_score_gemma":0.00063322193,"teacher_disagreement_score":0.022108134,"about_ca_system_score_codex":0.0039263633,"about_ca_system_score_gemma":0.002632246,"threshold_uncertainty_score":0.07395911},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23597318,0.00048490262,0.7353523,0.0006068594,0.000077036246,0.00009826351,0.000257,0.00018806728,0.026962373],"genre_scores_gemma":[0.856053,0.00040121758,0.13564277,0.00024089393,0.000105814725,0.00012685396,0.00021105433,0.000040640814,0.007177794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660814,0.00083906885,0.00019996788,0.0005943208,0.0010105714,0.00074801367],"domain_scores_gemma":[0.98982567,0.004939803,0.0011859462,0.002463692,0.0010674112,0.0005174991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024717776,0.0005019603,0.00070517435,0.0009743576,0.0016203267,0.0018337335,0.0007778143,0.0011167699,0.004621823],"category_scores_gemma":[0.0094637945,0.0005113988,0.00067938206,0.0012445974,0.0026868582,0.0035562397,0.0023776498,0.0023155073,0.0009556909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114138194,0.000023689518,0.00060243526,0.00004746512,0.000009769019,0.00005305297,0.00018538297,0.00504775,0.00659252,0.97689706,0.00044250145,0.009984209],"study_design_scores_gemma":[0.00004702166,0.00013262138,0.00087010657,0.000040047904,0.000021632055,0.00038773747,0.00015614401,0.058039002,0.017558044,0.91303265,0.009654496,0.00006063343],"about_ca_topic_score_codex":0.0005069427,"about_ca_topic_score_gemma":0.0005101118,"teacher_disagreement_score":0.004621823,"about_ca_system_score_codex":0.00085040764,"about_ca_system_score_gemma":0.00070468563,"threshold_uncertainty_score":0.015461564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53019434,0.001390571,0.2993852,0.0016289656,0.00075076654,0.00014990363,0.00058003236,0.0008287221,0.16509151],"genre_scores_gemma":[0.9390718,0.00078651047,0.030660734,0.00056094874,0.00041214074,0.00011093337,0.00042448932,0.00014447261,0.027827991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.00016588824,0.000029647368,0.00014567,0.00016561098,0.000100612946],"domain_scores_gemma":[0.99796593,0.0008243101,0.00026913,0.00023506956,0.00028817946,0.0004174541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004934406,0.00041387774,0.00040311477,0.0021387648,0.0011157347,0.002027175,0.00076696486,0.00061376573,0.007435211],"category_scores_gemma":[0.0027139115,0.0004161286,0.0005207555,0.0011027482,0.0013655416,0.0028932502,0.0013528547,0.0017009557,0.0007096596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023046448,0.000030991512,0.00018212151,0.000024617868,0.000005855599,0.00005538883,0.00021336332,0.00077608426,0.0012986755,0.9889339,0.0009483367,0.007507593],"study_design_scores_gemma":[0.000017101675,0.000022739421,0.00035702676,0.000014249957,0.0000066866332,0.00014124176,0.0001360457,0.0062727863,0.001040633,0.98739773,0.004580711,0.000013067171],"about_ca_topic_score_codex":0.0009645577,"about_ca_topic_score_gemma":0.0007818621,"teacher_disagreement_score":0.007435211,"about_ca_system_score_codex":0.0008009077,"about_ca_system_score_gemma":0.0004954183,"threshold_uncertainty_score":0.024873257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7498301,0.00062344375,0.08766652,0.000860651,0.00021026534,0.00007507773,0.00039394907,0.00023276781,0.16010723],"genre_scores_gemma":[0.9715639,0.0002884298,0.010761361,0.00023477752,0.00004249737,0.00003685003,0.000281421,0.00003785942,0.016752986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997924,0.000045385008,0.000009068703,0.000050106188,0.000049961796,0.000053114058],"domain_scores_gemma":[0.99944013,0.00028531734,0.00008678864,0.000068462716,0.00005580766,0.000063607324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017153556,0.00021819423,0.00020546657,0.0006987549,0.0009308982,0.00088625704,0.0006703208,0.0008899197,0.010723057],"category_scores_gemma":[0.0012362506,0.00019337682,0.00029579434,0.0004206161,0.0012678662,0.0015211281,0.0011876051,0.0010110919,0.00090135273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036242034,0.000064634696,0.0013452232,0.00019228239,0.00003044837,0.001419182,0.00058866356,0.0042772028,0.025888562,0.9398717,0.0030088455,0.022950716],"study_design_scores_gemma":[0.00008121768,0.0001506039,0.00281038,0.00012213677,0.000057711153,0.0016120648,0.00079763663,0.02036214,0.025844228,0.92627114,0.0218344,0.000056361267],"about_ca_topic_score_codex":0.0004977334,"about_ca_topic_score_gemma":0.0008698335,"teacher_disagreement_score":0.010723057,"about_ca_system_score_codex":0.0003748687,"about_ca_system_score_gemma":0.00021883007,"threshold_uncertainty_score":0.03587216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04900858,0.0003512904,0.9112411,0.0013148332,0.00022457639,0.00041051564,0.00029951104,0.00066450186,0.03648512],"genre_scores_gemma":[0.4966096,0.0005684446,0.48219544,0.000899293,0.00015380263,0.0008609623,0.00068064185,0.00023118695,0.017800737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938497,0.0031244976,0.00030159103,0.0010483692,0.0010415191,0.00063425465],"domain_scores_gemma":[0.993793,0.002449421,0.0005643896,0.0025130445,0.00040268805,0.0002774074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003629192,0.0014139405,0.0011337451,0.00088642084,0.0014700175,0.0027140367,0.0025202853,0.002355781,0.011131158],"category_scores_gemma":[0.011156548,0.00085854676,0.0023722248,0.0016417485,0.003325333,0.0050432915,0.0050511984,0.004278538,0.0021071245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013989572,0.00010152086,0.00067483453,0.00019070704,0.000055337507,0.00011829282,0.00036807786,0.024752088,0.002282753,0.93359315,0.0034225557,0.03430081],"study_design_scores_gemma":[0.00019999366,0.00025181758,0.00040962527,0.00011237003,0.00009257782,0.00040262577,0.00020928816,0.12245973,0.00466372,0.8417452,0.02937327,0.0000797815],"about_ca_topic_score_codex":0.0008710996,"about_ca_topic_score_gemma":0.0011694205,"teacher_disagreement_score":0.011131158,"about_ca_system_score_codex":0.0015560433,"about_ca_system_score_gemma":0.001991372,"threshold_uncertainty_score":0.037237465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008441872,0.16847783,0.16846332,0.027264569,0.031501215,0.00034124448,0.005199485,0.008543862,0.58176666],"genre_scores_gemma":[0.024061687,0.080345064,0.05906748,0.0019919728,0.0041130977,0.00020634917,0.0052877474,0.0023229895,0.8226036],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991053,0.00010782337,0.000028210656,0.00019758184,0.0004296407,0.00013145695],"domain_scores_gemma":[0.9982626,0.00037555685,0.000025898104,0.00024455064,0.0008672793,0.00022412247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015076351,0.0016154721,0.0020161613,0.0024303694,0.0021872448,0.0076058186,0.0016912057,0.0008381631,0.07923113],"category_scores_gemma":[0.0020269214,0.0009205776,0.0008062615,0.0064962567,0.0027962334,0.0038449394,0.0018793672,0.0029197969,0.020411363],"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.000051525443,0.00005280003,0.00030797708,0.00025873943,0.000025151881,0.000031641295,0.000106581414,0.0012594749,0.00069105567,0.043486815,0.7962174,0.15751077],"study_design_scores_gemma":[0.000020773567,0.00002194689,0.0008900884,0.0002560089,0.000031331572,0.00015345358,0.00017346632,0.005007175,0.0008307141,0.03530968,0.9572763,0.000029101648],"about_ca_topic_score_codex":0.13282238,"about_ca_topic_score_gemma":0.25684386,"teacher_disagreement_score":0.13282238,"about_ca_system_score_codex":0.012709728,"about_ca_system_score_gemma":0.011164984,"threshold_uncertainty_score":0.26505452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.780898,0.00057636,0.16413897,0.00021439587,0.00007060955,0.00010072432,0.0008902086,0.00026522268,0.052845486],"genre_scores_gemma":[0.9316442,0.0003944641,0.057817727,0.00006934822,0.00003001265,0.0001384259,0.0015478138,0.00007570681,0.008282393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899274,0.00017535289,0.00010182083,0.00016058495,0.00028305151,0.0002864241],"domain_scores_gemma":[0.99841785,0.0005438793,0.00038500965,0.00018856382,0.00026040323,0.00020419453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036676155,0.0005963109,0.0008489904,0.0015302452,0.001531445,0.0017374131,0.00067848037,0.0010499981,0.0099215405],"category_scores_gemma":[0.0020864161,0.0008406258,0.0006287502,0.001803212,0.0009372838,0.0022436322,0.0019933463,0.000780521,0.0021607955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018162604,0.00017782599,0.009358482,0.00043369405,0.00024917448,0.0056658336,0.0014609242,0.09304984,0.10124878,0.7131982,0.0077026673,0.06563838],"study_design_scores_gemma":[0.0002706911,0.00057314325,0.005911696,0.00021259069,0.00024590685,0.0053226906,0.0026176963,0.2339696,0.075005926,0.64048827,0.035187624,0.0001941495],"about_ca_topic_score_codex":0.0011222456,"about_ca_topic_score_gemma":0.0018643165,"teacher_disagreement_score":0.0099215405,"about_ca_system_score_codex":0.0008182474,"about_ca_system_score_gemma":0.0005446847,"threshold_uncertainty_score":0.033190906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37483305,0.0017204318,0.47253242,0.0013486167,0.0005771095,0.00022372686,0.0006327256,0.001363373,0.14676856],"genre_scores_gemma":[0.9258058,0.00051191193,0.058106,0.0004345738,0.00013722284,0.00024280744,0.00056214223,0.0003227523,0.013876792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982413,0.0004520166,0.00007129816,0.00042711472,0.00042987263,0.0003785012],"domain_scores_gemma":[0.9930118,0.0038418528,0.0005533157,0.0012755648,0.00065399904,0.00066351955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075034756,0.00065154326,0.0007951099,0.0014628891,0.0025100089,0.0022509026,0.002056801,0.0010180426,0.018021744],"category_scores_gemma":[0.008156927,0.0006454813,0.00069869595,0.0013379934,0.002257164,0.0039994386,0.0025333695,0.0026443414,0.0016680214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046001922,0.00019670774,0.003454069,0.00029230065,0.000056432742,0.0010130462,0.00060263585,0.029837972,0.011535286,0.8873428,0.009697967,0.05551067],"study_design_scores_gemma":[0.000063021645,0.0001750346,0.0011004381,0.00008364704,0.000035097506,0.0014366935,0.00035580923,0.06310117,0.00818334,0.9073345,0.018062599,0.0000686693],"about_ca_topic_score_codex":0.0011958007,"about_ca_topic_score_gemma":0.0021694037,"teacher_disagreement_score":0.018021744,"about_ca_system_score_codex":0.0010973603,"about_ca_system_score_gemma":0.0007997737,"threshold_uncertainty_score":0.060288727},"labels":[],"label_agreement":null},{"id":"W1599668014","doi":"10.1002/jcd.21319","title":"Trinal Decompositions of Steiner Triple Systems into Triangles","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Steiner system; Combinatorics; Vertex (graph theory); Order (exchange); Midpoint; Pairwise comparison; Intersection (aeronautics); Geometry; Graph","score_opus":0.018729803315847168,"score_gpt":0.23870246730773245,"score_spread":0.21997266399188528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599668014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46599084,0.0004364152,0.48329532,0.00036162583,0.0000941637,0.00015189101,0.00060116954,0.00027785066,0.04879071],"genre_scores_gemma":[0.9082979,0.0002469341,0.082312554,0.00011114537,0.000044970046,0.000116711286,0.00093202235,0.00007853798,0.007859328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990145,0.00024945068,0.00009216772,0.00016081924,0.00027626764,0.00020678136],"domain_scores_gemma":[0.9981225,0.0005488639,0.00036415283,0.00034617088,0.00038279858,0.0002355216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072376453,0.00029855987,0.00054995524,0.0012713876,0.0007568175,0.0011924113,0.00049629464,0.00043546344,0.008851487],"category_scores_gemma":[0.0023896545,0.00040064182,0.00047699446,0.00091583055,0.0010474714,0.0015380087,0.0017186766,0.00077390944,0.00074751023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000427913,0.00008913256,0.004043074,0.0002682302,0.000051649276,0.0006012161,0.001095099,0.060202226,0.017758602,0.8430763,0.0055072103,0.066879384],"study_design_scores_gemma":[0.0000629978,0.0001734072,0.001452643,0.00011493807,0.000037158214,0.0008506586,0.0013087521,0.21576537,0.008464574,0.74893993,0.02278697,0.00004256218],"about_ca_topic_score_codex":0.0007334401,"about_ca_topic_score_gemma":0.0010499171,"teacher_disagreement_score":0.008851487,"about_ca_system_score_codex":0.0007008637,"about_ca_system_score_gemma":0.0003512472,"threshold_uncertainty_score":0.02961123},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72922707,0.0020190855,0.24166362,0.00036974123,0.00012077944,0.00005368149,0.0002443966,0.00021411026,0.026087584],"genre_scores_gemma":[0.9487548,0.0008612634,0.043041937,0.00008734537,0.000097657095,0.000064373424,0.00016330906,0.000051588304,0.0068777623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990798,0.000250197,0.000065518616,0.00019847727,0.0002520891,0.0001538812],"domain_scores_gemma":[0.9968894,0.0014788996,0.0007485666,0.00030809513,0.00037074357,0.00020423534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006977674,0.00060298626,0.0004758874,0.0011611417,0.00068793213,0.0013836068,0.0005600191,0.0007334218,0.0019742383],"category_scores_gemma":[0.0037821108,0.0004900689,0.0004027495,0.0010830887,0.0026672855,0.0038018692,0.0017435596,0.0008807837,0.00031772317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004241543,0.000011770356,0.0007948583,0.000072866635,0.0000074932545,0.00032998205,0.00045242306,0.00909858,0.001960361,0.981911,0.00032540289,0.0049928194],"study_design_scores_gemma":[0.000020297273,0.00018124886,0.00086535566,0.00005922714,0.000016276534,0.0013184809,0.00026383478,0.04211056,0.0035138254,0.94376755,0.007844519,0.000038779297],"about_ca_topic_score_codex":0.00049304636,"about_ca_topic_score_gemma":0.00048579418,"teacher_disagreement_score":0.0019742383,"about_ca_system_score_codex":0.00044818956,"about_ca_system_score_gemma":0.00048932765,"threshold_uncertainty_score":0.006604433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6254746,0.0008093484,0.33228263,0.00054137065,0.00012819334,0.00021841677,0.0014143841,0.0005319601,0.03859905],"genre_scores_gemma":[0.94123214,0.00028798758,0.047851782,0.00016726454,0.00008401354,0.0001388686,0.00090714206,0.000120022465,0.009210642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991197,0.00021892754,0.000042896827,0.00019772777,0.00017817822,0.0002425545],"domain_scores_gemma":[0.99816316,0.0006219682,0.0003355167,0.00029448027,0.00026683277,0.00031813135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070001767,0.0006449484,0.0005848765,0.0012594488,0.0010370333,0.0014042873,0.00037916453,0.00054092496,0.0086084595],"category_scores_gemma":[0.0021271654,0.00052190234,0.000777599,0.00069850823,0.0009526722,0.0018020014,0.00095636444,0.0007875706,0.0010766463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006832396,0.00018193609,0.002336343,0.00024676215,0.00007051848,0.00079740625,0.0011551857,0.052755535,0.022043087,0.88124,0.008472587,0.030017354],"study_design_scores_gemma":[0.00007183648,0.00013980195,0.001744454,0.00007552129,0.000027312068,0.00052147266,0.00035587692,0.107547194,0.0043389406,0.87098247,0.014131595,0.00006366229],"about_ca_topic_score_codex":0.0015763959,"about_ca_topic_score_gemma":0.0018612932,"teacher_disagreement_score":0.0086084595,"about_ca_system_score_codex":0.0006217986,"about_ca_system_score_gemma":0.0004009618,"threshold_uncertainty_score":0.028798163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7971052,0.00042995324,0.068193816,0.00082639715,0.000172348,0.00014513628,0.0011892194,0.000593717,0.13134426],"genre_scores_gemma":[0.9269732,0.0003042928,0.016406696,0.0003345144,0.00012338,0.00020236509,0.0014159118,0.00021844874,0.05402108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995085,0.00007433596,0.000025752963,0.000104517865,0.00012789186,0.00015903062],"domain_scores_gemma":[0.99914217,0.00026739266,0.00013528475,0.00013303298,0.00014491363,0.00017710644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026605546,0.0006275594,0.0007995093,0.0014675034,0.0024723925,0.0032122585,0.0008697088,0.001241953,0.012209398],"category_scores_gemma":[0.001181022,0.00057421887,0.0006523283,0.0016067512,0.0012573238,0.0025129488,0.0015238676,0.0015231654,0.0018330074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019289591,0.00007096305,0.0008499497,0.00012011037,0.000028440345,0.00033039693,0.00084064854,0.0022155026,0.007777925,0.96428704,0.004123087,0.019163001],"study_design_scores_gemma":[0.00003990464,0.00003893162,0.0008732045,0.000027432154,0.000020631203,0.00028316808,0.0003855216,0.0053360695,0.0035095264,0.97762626,0.01183528,0.000024014118],"about_ca_topic_score_codex":0.0010451772,"about_ca_topic_score_gemma":0.0015995937,"teacher_disagreement_score":0.012209398,"about_ca_system_score_codex":0.0009627922,"about_ca_system_score_gemma":0.000707317,"threshold_uncertainty_score":0.04084444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8786302,0.00024417683,0.0790184,0.00095084,0.00013429488,0.000071111506,0.00015709574,0.00023217978,0.04056167],"genre_scores_gemma":[0.9710361,0.0000667352,0.020579958,0.00011943261,0.000023846056,0.00004012489,0.000062849474,0.000028200227,0.0080426205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993679,0.00014288288,0.000028694169,0.00010363702,0.00011002579,0.00024677147],"domain_scores_gemma":[0.997329,0.00130062,0.00035442878,0.00044940037,0.00020077813,0.00036578908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562292,0.00041817754,0.00050365186,0.00095354085,0.0013906686,0.0021483002,0.00082178786,0.001620927,0.0075435527],"category_scores_gemma":[0.003702286,0.0005277834,0.00044015897,0.0005071442,0.0031503667,0.0026929253,0.0028487106,0.0010172423,0.000542792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009615131,0.000045478846,0.0014837293,0.000067944726,0.000017621143,0.00024813315,0.0004515254,0.0028806427,0.015922392,0.9644672,0.0009427827,0.012510972],"study_design_scores_gemma":[0.00030072877,0.0003455529,0.0023042958,0.00007018894,0.00005319469,0.00069901795,0.0011407679,0.033911303,0.03221327,0.9194718,0.00938133,0.000108521395],"about_ca_topic_score_codex":0.00037392092,"about_ca_topic_score_gemma":0.0003214807,"teacher_disagreement_score":0.0075435527,"about_ca_system_score_codex":0.0007020101,"about_ca_system_score_gemma":0.0005251064,"threshold_uncertainty_score":0.025235713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49803773,0.0059696874,0.25468823,0.004228448,0.0004884636,0.00014087326,0.00082846876,0.00071659236,0.23490156],"genre_scores_gemma":[0.90108794,0.0021738003,0.06465331,0.00063011143,0.00038947025,0.00012095328,0.0005332365,0.00015164157,0.03025961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975973,0.000057765046,0.000011399393,0.00008131119,0.00005422499,0.00003557118],"domain_scores_gemma":[0.99925786,0.00035511528,0.00009295169,0.00008556091,0.00010244383,0.00010605986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026498968,0.00041260908,0.000574964,0.0016262485,0.0010836037,0.0014153597,0.000729333,0.0007599663,0.005771689],"category_scores_gemma":[0.0014560589,0.00033039297,0.00044713935,0.001510735,0.0008119445,0.001472909,0.0011918583,0.0012010947,0.00047528924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053354022,0.000032682412,0.00026921494,0.0000936645,0.000009598747,0.000086242035,0.00019118146,0.001895014,0.002175045,0.97668684,0.002463421,0.016043643],"study_design_scores_gemma":[0.000015051085,0.000016192547,0.00029051333,0.000019310684,0.00001247936,0.00015495004,0.000094696574,0.007854296,0.00092216453,0.9829155,0.0076965676,0.000008412761],"about_ca_topic_score_codex":0.000705569,"about_ca_topic_score_gemma":0.00088018767,"teacher_disagreement_score":0.005771689,"about_ca_system_score_codex":0.00072301895,"about_ca_system_score_gemma":0.00037641122,"threshold_uncertainty_score":0.019308269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51524884,0.00063901686,0.42407975,0.00048701724,0.00009108182,0.00017223935,0.0004389859,0.0005164026,0.058326636],"genre_scores_gemma":[0.8939825,0.00025223542,0.09795282,0.00014232328,0.000045833523,0.000168177,0.0002728965,0.0000669747,0.007116222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991217,0.00017939923,0.000054794662,0.00020417971,0.00020264296,0.00023730028],"domain_scores_gemma":[0.9966271,0.0011492709,0.00049545744,0.0011865258,0.00030396463,0.00023779088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146125,0.0004224064,0.0005213567,0.00074757903,0.0012880382,0.0015143328,0.00093489664,0.0010114913,0.004498226],"category_scores_gemma":[0.0038163138,0.00038178838,0.0005804667,0.0006354301,0.00151802,0.001838297,0.0014460862,0.0017014941,0.00066266936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001876483,0.000055484023,0.0012315011,0.00011577061,0.00002063235,0.00022972608,0.000342541,0.010029369,0.018821206,0.9384766,0.0012720966,0.02921743],"study_design_scores_gemma":[0.00013128661,0.00031994312,0.00096126756,0.00011670705,0.000049474074,0.0015405882,0.00034238328,0.08624465,0.06821053,0.81321436,0.028792502,0.00007638041],"about_ca_topic_score_codex":0.0002043087,"about_ca_topic_score_gemma":0.00035186386,"teacher_disagreement_score":0.004498226,"about_ca_system_score_codex":0.0011289363,"about_ca_system_score_gemma":0.00053268886,"threshold_uncertainty_score":0.015048027},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2855035,0.0111907115,0.5047289,0.0018228017,0.00092912535,0.00012423772,0.00038705821,0.0006720181,0.1946416],"genre_scores_gemma":[0.8786968,0.0047437786,0.087959945,0.00041882787,0.00062260486,0.00010650264,0.00023134326,0.00010774891,0.027112406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995202,0.00010894727,0.00003224935,0.00009938549,0.00017326906,0.00006593911],"domain_scores_gemma":[0.9995338,0.00015294795,0.000073781644,0.00007749044,0.00010305582,0.0000589749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044956824,0.0006100938,0.00038191417,0.0015008479,0.0006774821,0.0013902342,0.00048594613,0.0007098243,0.00476932],"category_scores_gemma":[0.0018096579,0.00029062788,0.0003432334,0.0015136019,0.0012651972,0.0014868772,0.0011753427,0.00101827,0.00091976137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012814157,0.0000107266,0.00017841779,0.00005293208,0.0000051985285,0.00007524341,0.00010418109,0.0033848903,0.002222986,0.96703345,0.0006130632,0.026306057],"study_design_scores_gemma":[0.0000070444635,0.000044864853,0.00020866952,0.000035458917,0.000006531681,0.00024728538,0.00008550054,0.016883802,0.0021292237,0.96353436,0.016795026,0.000022268485],"about_ca_topic_score_codex":0.00059885654,"about_ca_topic_score_gemma":0.00053592306,"teacher_disagreement_score":0.00476932,"about_ca_system_score_codex":0.00083105447,"about_ca_system_score_gemma":0.00035818215,"threshold_uncertainty_score":0.015954971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852545,0.0003844833,0.009069736,0.00021312265,0.000051621344,0.000015525145,0.00023592707,0.0003113691,0.0044636433],"genre_scores_gemma":[0.99546635,0.00014527676,0.0031804268,0.00003833957,0.000019411564,0.000010310672,0.00013903329,0.000022210455,0.0009786381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989843,0.00031294307,0.000059697366,0.000109027475,0.00032697717,0.00020706539],"domain_scores_gemma":[0.9942122,0.0036126694,0.00039435917,0.0003417837,0.0012787868,0.00016020899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011417973,0.00069878757,0.0005122003,0.0007271649,0.00080369983,0.0005539173,0.00042831173,0.0010572703,0.0021226953],"category_scores_gemma":[0.0045920108,0.00018730116,0.00019105256,0.00076236075,0.00060360896,0.0006996812,0.00050675886,0.0004940835,0.00049491023],"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.007677382,0.00053555274,0.031438403,0.0007677634,0.00053298427,0.0015634682,0.00092057744,0.4596738,0.40665138,0.009977743,0.0030493727,0.07721168],"study_design_scores_gemma":[0.00018788481,0.0038868042,0.024665443,0.000097244854,0.00031140682,0.0011242856,0.00030301206,0.72565365,0.23695593,0.00416823,0.002429314,0.00021674675],"about_ca_topic_score_codex":0.002656878,"about_ca_topic_score_gemma":0.0015745994,"teacher_disagreement_score":0.002656878,"about_ca_system_score_codex":0.00047591285,"about_ca_system_score_gemma":0.00035981036,"threshold_uncertainty_score":0.0071011186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19092128,0.0017135734,0.45172364,0.0016209249,0.001005868,0.00024005216,0.0026018124,0.0013175262,0.3488555],"genre_scores_gemma":[0.77165353,0.00085908815,0.1416497,0.00069080613,0.00027451364,0.00025244127,0.002663831,0.00040664614,0.0815494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983942,0.00036239062,0.00012617705,0.00031614513,0.00046776718,0.00033330938],"domain_scores_gemma":[0.99701476,0.00085216865,0.00031173215,0.00067431154,0.00079789426,0.00034912015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774089,0.0005046742,0.0006916957,0.002537297,0.0031173148,0.004245345,0.0009733248,0.0011180089,0.022366235],"category_scores_gemma":[0.0035289058,0.0006315037,0.0007967269,0.0021519891,0.0022950438,0.005614928,0.0028629724,0.0018897186,0.003999142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043344513,0.000024625764,0.00029094674,0.000042884167,0.00001478625,0.0001552576,0.00025930084,0.00058001286,0.0017851797,0.9840056,0.0027602853,0.010037817],"study_design_scores_gemma":[0.000019001984,0.000025714195,0.00031458118,0.00004983586,0.000028434828,0.00040647798,0.0004864958,0.0038348567,0.0038846259,0.9564906,0.034429513,0.000029845516],"about_ca_topic_score_codex":0.001863691,"about_ca_topic_score_gemma":0.0037588102,"teacher_disagreement_score":0.022366235,"about_ca_system_score_codex":0.0014704767,"about_ca_system_score_gemma":0.0010930565,"threshold_uncertainty_score":0.074822485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37839246,0.0011629948,0.61649764,0.00119449,0.00002404267,0.00004307386,0.00037363038,0.00049705675,0.0018146448],"genre_scores_gemma":[0.90683025,0.00048110355,0.09120957,0.0000813725,0.00005833143,0.000038936047,0.00032689606,0.00006661723,0.00090677605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996251,0.00015662127,0.000015148503,0.000077547505,0.000078343095,0.00004732587],"domain_scores_gemma":[0.9977126,0.0017033967,0.00021351945,0.00013128835,0.00018122251,0.00005800439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066035934,0.00053534686,0.00076224084,0.0014457033,0.0003279227,0.0008225125,0.0011031412,0.00081650494,0.00040224128],"category_scores_gemma":[0.0035354274,0.00044774843,0.00029654714,0.0012698155,0.00074565614,0.0015477703,0.00044895412,0.00042146156,0.0001253417],"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.000082134204,0.000106492684,0.005378272,0.00014045175,0.00006547229,0.00010879239,0.000090634305,0.89567816,0.004555481,0.009818064,0.001798013,0.08217797],"study_design_scores_gemma":[0.000009952247,0.0000127790345,0.00046640815,0.000005537622,0.000010652791,0.000018386409,0.000024365328,0.97800714,0.0018629702,0.019239977,0.00033613492,0.0000057159773],"about_ca_topic_score_codex":0.00277027,"about_ca_topic_score_gemma":0.00356267,"teacher_disagreement_score":0.00277027,"about_ca_system_score_codex":0.000524954,"about_ca_system_score_gemma":0.00069405645,"threshold_uncertainty_score":0.005508244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09148448,0.0007547507,0.83071506,0.00091383,0.0008082565,0.0002647752,0.000398164,0.0014425999,0.07321804],"genre_scores_gemma":[0.51373833,0.00050953106,0.4485851,0.00064299157,0.00022334466,0.0003710281,0.0004443819,0.00025278472,0.03523245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993364,0.00017935602,0.000043587082,0.00013844551,0.00019748625,0.000104604565],"domain_scores_gemma":[0.9988134,0.00034392506,0.00015032191,0.00036560337,0.0001271068,0.00019970826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064862607,0.0004962651,0.00051177427,0.0009512206,0.0012823647,0.0012182025,0.0009834372,0.00077185134,0.008867121],"category_scores_gemma":[0.0016604403,0.00039639696,0.00060793885,0.0007834007,0.001283984,0.0015157986,0.0024103504,0.0014468258,0.001980514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022558549,0.00009842505,0.00043322763,0.0002087979,0.000024934332,0.0002560193,0.00029259713,0.0026803226,0.02473156,0.900612,0.0069764834,0.06345997],"study_design_scores_gemma":[0.00028011843,0.00054871256,0.0006847235,0.0001633946,0.00008914723,0.0014652946,0.00019544175,0.027889347,0.03168996,0.8096508,0.12722567,0.000117365016],"about_ca_topic_score_codex":0.0002708234,"about_ca_topic_score_gemma":0.000676644,"teacher_disagreement_score":0.008867121,"about_ca_system_score_codex":0.00069674576,"about_ca_system_score_gemma":0.0006675972,"threshold_uncertainty_score":0.029663444},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04550624,0.00034048062,0.5012119,0.0017667457,0.0025960603,0.00060464954,0.016523983,0.021102032,0.41034794],"genre_scores_gemma":[0.21934812,0.0006377805,0.25345492,0.0010765529,0.00027455448,0.00073128316,0.030358175,0.013941273,0.48017722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999406,0.00011117728,0.00003492921,0.00014248923,0.00019112787,0.00011432309],"domain_scores_gemma":[0.99872893,0.00029205382,0.00007995432,0.00044818007,0.00033868596,0.00011213022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047969533,0.0008777856,0.0006597699,0.0011103684,0.0012388981,0.0017581853,0.0012319648,0.0009558043,0.0915703],"category_scores_gemma":[0.0019006749,0.0005122162,0.0007659376,0.0010703406,0.0008578962,0.0023964208,0.001274248,0.0019029113,0.038490366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077066285,0.00021736386,0.0006887276,0.0005202627,0.000028580018,0.0006397126,0.0007770088,0.004143948,0.03379222,0.54529524,0.27312255,0.14000382],"study_design_scores_gemma":[0.00008345253,0.00013866274,0.0008104468,0.00011904568,0.00002869989,0.0002701952,0.0002834066,0.0063188337,0.04083367,0.20353507,0.74749327,0.000085313084],"about_ca_topic_score_codex":0.0019638306,"about_ca_topic_score_gemma":0.004610852,"teacher_disagreement_score":0.0915703,"about_ca_system_score_codex":0.00091925275,"about_ca_system_score_gemma":0.0008449672,"threshold_uncertainty_score":0.30633318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64387983,0.0011951175,0.15070973,0.0012325261,0.00020725862,0.00016237382,0.0007727006,0.00045046408,0.20139009],"genre_scores_gemma":[0.9592564,0.0003498497,0.016763944,0.00015666395,0.00008765862,0.000053314325,0.0004612013,0.00007014107,0.022800833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947995,0.00010128693,0.000034154116,0.00015177674,0.00012407402,0.00010881113],"domain_scores_gemma":[0.9967746,0.0012822935,0.0005795851,0.00054309086,0.00042874966,0.0003916978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042453766,0.00035820488,0.00043975553,0.0013023589,0.0013413574,0.0023847122,0.0010244469,0.00081337936,0.015597348],"category_scores_gemma":[0.006114885,0.0003740441,0.00037509442,0.001101999,0.0015058474,0.0031807867,0.0018842948,0.001050613,0.0011428479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020366901,0.000049529488,0.0019278409,0.00011440366,0.000020130166,0.0003088448,0.0005156786,0.0065956265,0.0035408102,0.9584609,0.003299715,0.02496294],"study_design_scores_gemma":[0.00005108715,0.000052931577,0.0012240378,0.00005057283,0.000035769386,0.00071433006,0.00047758312,0.027633308,0.0034647975,0.952121,0.01415277,0.000021762224],"about_ca_topic_score_codex":0.002759905,"about_ca_topic_score_gemma":0.0030608883,"teacher_disagreement_score":0.015597348,"about_ca_system_score_codex":0.0011327605,"about_ca_system_score_gemma":0.0005921904,"threshold_uncertainty_score":0.052178323},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29212984,0.0021653082,0.38243246,0.0017702545,0.0008629305,0.00014070458,0.0020353917,0.00081880484,0.31764433],"genre_scores_gemma":[0.8513826,0.0013259541,0.085498214,0.00046483308,0.0002164323,0.00011336247,0.0020362972,0.00028343173,0.058678947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995919,0.000106464955,0.00002528774,0.00009593069,0.000097371434,0.000083103165],"domain_scores_gemma":[0.9991436,0.00026829855,0.00015487084,0.00016186037,0.00013697027,0.00013436074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018847693,0.00047573165,0.00036714235,0.0014454576,0.0011191709,0.002044746,0.0005781113,0.0008423233,0.016752893],"category_scores_gemma":[0.0017156065,0.00037701975,0.00041350664,0.0011366772,0.0008920629,0.0032403558,0.0020858063,0.0014361481,0.003671082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035856076,0.000027630826,0.00027215076,0.00006556006,0.000011300179,0.00016801615,0.00024101518,0.0020954155,0.0016966474,0.96658385,0.005995725,0.022806786],"study_design_scores_gemma":[0.000012313126,0.000027621327,0.00034401056,0.00004227637,0.00001066152,0.00039450108,0.0003499909,0.0077098343,0.0012940849,0.9601851,0.029615244,0.0000143598245],"about_ca_topic_score_codex":0.00048465177,"about_ca_topic_score_gemma":0.0007695628,"teacher_disagreement_score":0.016752893,"about_ca_system_score_codex":0.0006925397,"about_ca_system_score_gemma":0.00025860363,"threshold_uncertainty_score":0.056044042},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04796953,0.038731534,0.3651722,0.04184823,0.02857422,0.00016621439,0.0011095759,0.0018001033,0.4746284],"genre_scores_gemma":[0.5514503,0.054179665,0.23159121,0.020268079,0.023273801,0.0002643114,0.0011308319,0.0012193114,0.11662244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919945,0.00022007692,0.00003905397,0.00016743064,0.0002760688,0.00009792499],"domain_scores_gemma":[0.9963349,0.0024928602,0.0001474387,0.0005042016,0.00026755355,0.0002530321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094329694,0.0009828227,0.0009351983,0.0016221512,0.0018718748,0.001941755,0.0019511759,0.0014223136,0.010788612],"category_scores_gemma":[0.0046956455,0.00043036405,0.00089745177,0.0021184685,0.00273914,0.0053230757,0.0028130275,0.0048603965,0.0032211565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001316111,0.00008043522,0.0006123115,0.0005082305,0.000056782676,0.0010648804,0.00039300098,0.004442269,0.0034268955,0.834622,0.08973123,0.06493038],"study_design_scores_gemma":[0.00000981054,0.000043192817,0.00042248002,0.00006813282,0.000022915174,0.00073444634,0.00011444853,0.0031816482,0.00096822635,0.89187557,0.102528244,0.000030966934],"about_ca_topic_score_codex":0.0013467176,"about_ca_topic_score_gemma":0.002498171,"teacher_disagreement_score":0.010788612,"about_ca_system_score_codex":0.0010327711,"about_ca_system_score_gemma":0.00056446483,"threshold_uncertainty_score":0.036091506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10609839,0.0010929616,0.7841592,0.0008980569,0.0002753354,0.000338638,0.0014514893,0.00094762206,0.10473832],"genre_scores_gemma":[0.57973677,0.0012274389,0.38059714,0.000719844,0.00019433428,0.00027510585,0.004811621,0.000388331,0.032049406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995247,0.00014566508,0.000022236187,0.00010985086,0.000118983655,0.000078464276],"domain_scores_gemma":[0.9989951,0.00030014856,0.000113927126,0.0003395943,0.0001586745,0.000092577146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035637608,0.00059290376,0.00040628834,0.0013241936,0.0006148041,0.0012399914,0.00071453786,0.0005617461,0.00917013],"category_scores_gemma":[0.0019546668,0.0002724776,0.00072750077,0.001196309,0.0007414229,0.002490573,0.0012654038,0.0009595978,0.0015423973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002707851,0.00019007287,0.0015597354,0.0004148143,0.000113443246,0.0007802385,0.000463072,0.03178596,0.016126148,0.7522932,0.01860086,0.17740172],"study_design_scores_gemma":[0.000043142718,0.000049312694,0.0011468608,0.00007181471,0.000066385335,0.0005799054,0.00045710508,0.04864518,0.0055261347,0.9110531,0.032341253,0.000019690446],"about_ca_topic_score_codex":0.0016353606,"about_ca_topic_score_gemma":0.003463269,"teacher_disagreement_score":0.00917013,"about_ca_system_score_codex":0.00053790386,"about_ca_system_score_gemma":0.0006824674,"threshold_uncertainty_score":0.0306772},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009849871,0.0017169006,0.0016819491,0.9515352,0.035938308,0.000008094452,0.00021652675,0.00016229684,0.0077556926],"genre_scores_gemma":[0.03133298,0.0024340902,0.001189015,0.8820827,0.07311999,0.000032571726,0.00018523756,0.00012511289,0.009498269],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687046,0.0007058949,0.00024057554,0.0006716027,0.0012612531,0.0002502852],"domain_scores_gemma":[0.98294616,0.009413541,0.0010776278,0.0012732852,0.0043375487,0.0009518534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037992625,0.0008175666,0.00080136425,0.0009643556,0.0026532563,0.002084101,0.0044163587,0.013456686,0.012942177],"category_scores_gemma":[0.027476279,0.00036320917,0.00071021373,0.0011824798,0.006544933,0.0073302863,0.0022448057,0.01923184,0.0070730858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037960333,0.000012682518,0.00021937984,0.00008785917,0.0000072191165,0.00039745722,0.00019945847,0.00015156862,0.00019480551,0.05596294,0.9378356,0.0048930733],"study_design_scores_gemma":[0.00006604875,0.00003944617,0.0009016524,0.00023558036,0.000011813351,0.0017465381,0.00065302796,0.0011252107,0.0009510377,0.17485102,0.81934565,0.000073060655],"about_ca_topic_score_codex":0.004590836,"about_ca_topic_score_gemma":0.0021264167,"teacher_disagreement_score":0.013456686,"about_ca_system_score_codex":0.0019112271,"about_ca_system_score_gemma":0.001291366,"threshold_uncertainty_score":0.04329586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014325729,0.0009781898,0.63893753,0.0040690852,0.0010036154,0.00022511712,0.009101289,0.011200293,0.3201592],"genre_scores_gemma":[0.36740413,0.002520442,0.28982762,0.0034192859,0.0023764684,0.00082249497,0.03088306,0.014149986,0.28859645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732286,0.00045881743,0.0002982113,0.0006209694,0.00093463523,0.0003645568],"domain_scores_gemma":[0.99422616,0.0018124626,0.000515579,0.0011260702,0.0019291972,0.00039061866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017429861,0.0014278385,0.0007610918,0.0025382482,0.0017910047,0.005840321,0.0015037605,0.0011255243,0.080486976],"category_scores_gemma":[0.008394302,0.00082441344,0.0014018695,0.0033762066,0.0018704667,0.007889174,0.0028221041,0.003376593,0.06223897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013190729,0.00009130053,0.00043023442,0.00025089778,0.000016996055,0.00023747957,0.000614967,0.001656735,0.004573295,0.825414,0.10954578,0.05703647],"study_design_scores_gemma":[0.000047856793,0.00008335118,0.00084772473,0.00014462654,0.000026107873,0.00080787233,0.0002695108,0.013823409,0.012352945,0.58827835,0.38323742,0.000080773476],"about_ca_topic_score_codex":0.0028750682,"about_ca_topic_score_gemma":0.0033875175,"teacher_disagreement_score":0.080486976,"about_ca_system_score_codex":0.0017752385,"about_ca_system_score_gemma":0.0015999083,"threshold_uncertainty_score":0.26925576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22796127,0.002765787,0.4581509,0.0017495312,0.0012818835,0.00017985282,0.0011340731,0.0012787161,0.30549797],"genre_scores_gemma":[0.8513119,0.0015437311,0.073502116,0.0005842714,0.000790875,0.00018499023,0.0008588102,0.00051788485,0.070705414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987274,0.00031838406,0.00007838718,0.0003016657,0.00031113776,0.00026309065],"domain_scores_gemma":[0.9971732,0.00079512136,0.0004957784,0.00052333996,0.0005869,0.0004256699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008889244,0.00080673874,0.00075945846,0.0033412694,0.0019177473,0.0043231933,0.0010525566,0.0010393278,0.01647784],"category_scores_gemma":[0.0036532192,0.0006129859,0.0008057019,0.0016757621,0.0026526747,0.0058239284,0.0026117382,0.0018819692,0.0032365695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021240761,0.000011825376,0.000112742746,0.000024511606,0.000006558867,0.000039414652,0.000111743284,0.0003236108,0.00057820097,0.99287087,0.0016226628,0.0042766905],"study_design_scores_gemma":[0.000009617521,0.000018674249,0.0001563962,0.000022162032,0.0000122448855,0.00018819555,0.00013246427,0.0042464593,0.0013603114,0.98290986,0.010930664,0.000012994561],"about_ca_topic_score_codex":0.0008848508,"about_ca_topic_score_gemma":0.0011799469,"teacher_disagreement_score":0.01647784,"about_ca_system_score_codex":0.0013343584,"about_ca_system_score_gemma":0.0006546071,"threshold_uncertainty_score":0.055123925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8012376,0.001248339,0.12750316,0.0065955976,0.00039111305,0.00007231331,0.0015892508,0.00072670984,0.06063593],"genre_scores_gemma":[0.98218185,0.00026740282,0.010953873,0.0010773815,0.00018539894,0.0001209755,0.00057923223,0.000096847245,0.004537088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969867,0.0006472285,0.00023110701,0.00088260113,0.00065023714,0.0006020565],"domain_scores_gemma":[0.9898789,0.0062070605,0.00081212673,0.0018981779,0.00050850096,0.0006953228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029950023,0.0007146935,0.0014817711,0.0012406004,0.0027187439,0.004059006,0.0014582326,0.0020507309,0.009279948],"category_scores_gemma":[0.013200442,0.0008092163,0.0011191352,0.001613208,0.004531481,0.008103065,0.0030433105,0.002312392,0.0013535641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019056717,0.00018538724,0.011519675,0.00029051496,0.00007222343,0.00059244083,0.0013456914,0.010818381,0.009986591,0.9228468,0.01129022,0.029146438],"study_design_scores_gemma":[0.0001842272,0.00013796809,0.0022868311,0.00007160736,0.000052694315,0.0013289,0.00040751896,0.024919823,0.0057393257,0.95309603,0.0117113395,0.00006378652],"about_ca_topic_score_codex":0.0012463595,"about_ca_topic_score_gemma":0.0010286499,"teacher_disagreement_score":0.009279948,"about_ca_system_score_codex":0.001885506,"about_ca_system_score_gemma":0.00094660925,"threshold_uncertainty_score":0.031044483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61031526,0.00044869742,0.2318742,0.0006063779,0.0004114521,0.00018948386,0.00076539133,0.0008284481,0.1545607],"genre_scores_gemma":[0.9290203,0.00015607408,0.039728973,0.00024637964,0.00006198365,0.000104590494,0.000350347,0.00006066994,0.030270744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994708,0.00013878617,0.00003218879,0.00009760572,0.00011077636,0.00014993302],"domain_scores_gemma":[0.99934655,0.00015466921,0.0001087883,0.00013631987,0.000118157186,0.00013554412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037246168,0.00030301703,0.00032631663,0.00063668523,0.0008974372,0.0013977854,0.00055012666,0.0006481237,0.011975104],"category_scores_gemma":[0.001145568,0.00022436523,0.00029355078,0.00070085574,0.00066264847,0.0008685924,0.0009922944,0.00061605405,0.0013359817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040982015,0.00006906613,0.0008675106,0.0000905291,0.00003057901,0.00034159154,0.00024582722,0.0072034514,0.014009674,0.93313795,0.0053466656,0.038247284],"study_design_scores_gemma":[0.0002741189,0.00049697317,0.0018328693,0.000087973436,0.000061853025,0.0005932815,0.0003074494,0.051354356,0.022592986,0.8636986,0.05860129,0.00009825309],"about_ca_topic_score_codex":0.0008751353,"about_ca_topic_score_gemma":0.0025632263,"teacher_disagreement_score":0.011975104,"about_ca_system_score_codex":0.0005129581,"about_ca_system_score_gemma":0.0004768001,"threshold_uncertainty_score":0.04006076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23555306,0.010114835,0.5250927,0.015193777,0.0011624086,0.00014070055,0.0018482892,0.003038587,0.20785561],"genre_scores_gemma":[0.9132531,0.002548124,0.058931313,0.00056073745,0.0007119975,0.00017712144,0.0003349402,0.0006909912,0.022791656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795985,0.00086302235,0.000105895626,0.0003989884,0.00040563484,0.00026652616],"domain_scores_gemma":[0.9701333,0.022497654,0.002451162,0.0022764194,0.0015691805,0.0010723337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022951728,0.0007385418,0.0007167944,0.0034665668,0.0017412821,0.004776979,0.0017010131,0.0018737608,0.016032208],"category_scores_gemma":[0.039548486,0.0006835451,0.00032326384,0.0046280003,0.0052131056,0.009936273,0.0023556512,0.0043042977,0.0034027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035294998,0.00011153296,0.004441445,0.00015352349,0.000026834723,0.00029215185,0.00041164062,0.013705693,0.0016542347,0.9010639,0.013615217,0.064170815],"study_design_scores_gemma":[0.000025300531,0.000032891854,0.0014591191,0.00006537566,0.000020514137,0.0006499179,0.00022776973,0.04028357,0.0023720902,0.9429974,0.011801424,0.00006463656],"about_ca_topic_score_codex":0.0010582992,"about_ca_topic_score_gemma":0.0014168872,"teacher_disagreement_score":0.016032208,"about_ca_system_score_codex":0.0016915696,"about_ca_system_score_gemma":0.001058445,"threshold_uncertainty_score":0.053633094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2166683,0.0033422378,0.7123699,0.002387688,0.00083668146,0.00010188026,0.0003975922,0.00032082226,0.06357496],"genre_scores_gemma":[0.8617168,0.0021215803,0.10897517,0.0007376219,0.0006450424,0.00012584214,0.00022909505,0.00009194489,0.025356933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992987,0.00027280368,0.00003781402,0.00013150171,0.00015706995,0.00010204238],"domain_scores_gemma":[0.99741167,0.0011488849,0.00037521563,0.00054973067,0.00034021103,0.00017430302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011587224,0.00064908987,0.00080062886,0.0017202359,0.0012156676,0.0024016316,0.0010142874,0.0017095902,0.0056183897],"category_scores_gemma":[0.0039547104,0.00041904626,0.00052627287,0.0023670034,0.0031400225,0.0037936894,0.0012654376,0.0021423418,0.00079011696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021656824,0.000009441021,0.00007177923,0.000015965466,0.0000035287603,0.000027364653,0.00006432998,0.0020845328,0.0005984099,0.9929692,0.0003954247,0.00373824],"study_design_scores_gemma":[0.000010156362,0.000014989317,0.00006866521,0.0000133626545,0.0000037601449,0.00008851701,0.000043762928,0.01771672,0.00047460874,0.9792309,0.002315391,0.000019241817],"about_ca_topic_score_codex":0.0006584228,"about_ca_topic_score_gemma":0.00068209355,"teacher_disagreement_score":0.0056183897,"about_ca_system_score_codex":0.0010025162,"about_ca_system_score_gemma":0.00075152656,"threshold_uncertainty_score":0.018795371},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25545436,0.0014836439,0.29739764,0.0012346142,0.0011995308,0.00018289177,0.0019020718,0.00050622685,0.44063896],"genre_scores_gemma":[0.8061651,0.0012663363,0.07540276,0.0006490286,0.00025608877,0.00018077734,0.0019152499,0.00036469023,0.11379996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994771,0.00012095494,0.000022311682,0.00011281424,0.00015159028,0.00011534316],"domain_scores_gemma":[0.9993444,0.00023777572,0.00012292553,0.000092339294,0.00010587338,0.00009663149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013451374,0.0005301592,0.00053273916,0.0009664301,0.0010276292,0.0018416923,0.0007247905,0.0007055989,0.026103154],"category_scores_gemma":[0.0012866956,0.0004590564,0.00037140577,0.0009254968,0.001019428,0.0016520725,0.0014009778,0.0015045968,0.0053777867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022042787,0.000052289743,0.0005949737,0.00018636687,0.00003362475,0.0006624115,0.00024918697,0.014524804,0.009406752,0.92298,0.013558156,0.037531152],"study_design_scores_gemma":[0.000038229813,0.00006802474,0.0011068258,0.00010890598,0.000018087458,0.0007671212,0.00092403154,0.047962423,0.0068263896,0.89306235,0.04908389,0.00003369798],"about_ca_topic_score_codex":0.0009245071,"about_ca_topic_score_gemma":0.0016216363,"teacher_disagreement_score":0.026103154,"about_ca_system_score_codex":0.0005005744,"about_ca_system_score_gemma":0.00030998955,"threshold_uncertainty_score":0.087323785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62161344,0.0007758127,0.36385038,0.00026483077,0.00007782752,0.00006545139,0.00011844971,0.00086698803,0.012366847],"genre_scores_gemma":[0.9103456,0.00031072393,0.08546389,0.000052574567,0.00002044108,0.00002173884,0.00007028837,0.00002239663,0.0036924183],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998523,0.000031528663,0.000005592358,0.000021390852,0.00007063086,0.000018519337],"domain_scores_gemma":[0.9997565,0.000098598524,0.000044260043,0.000032321084,0.000058174184,0.000010135646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001533429,0.0002090941,0.00010438758,0.0002651375,0.00014503293,0.00025892755,0.00023842028,0.00016344771,0.00083790516],"category_scores_gemma":[0.00044639767,0.000098541175,0.000078494006,0.00025996598,0.00022100446,0.00033142616,0.00023060192,0.00018979792,0.00020871287],"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.00023438866,0.000090313784,0.0010397483,0.000109082896,0.000010324604,0.000113159236,0.00007200964,0.0073853643,0.8948339,0.023106646,0.00062430126,0.07238076],"study_design_scores_gemma":[0.000030116633,0.00024210232,0.0011139713,0.000019157671,0.000021097185,0.00047320034,0.000020339996,0.1356607,0.8493124,0.0055641285,0.007526909,0.000015926846],"about_ca_topic_score_codex":0.00028693807,"about_ca_topic_score_gemma":0.0005938601,"teacher_disagreement_score":0.00083790516,"about_ca_system_score_codex":0.00020460892,"about_ca_system_score_gemma":0.0001911074,"threshold_uncertainty_score":0.0028030276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71445876,0.0025287713,0.21704105,0.01374876,0.000586209,0.0003249615,0.009981627,0.00376371,0.03756615],"genre_scores_gemma":[0.9360564,0.00060139055,0.046725202,0.0010208051,0.0007962132,0.00016135808,0.0054811286,0.0006283284,0.008529289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933403,0.0014536999,0.00027000287,0.0024141828,0.0013769603,0.0011448633],"domain_scores_gemma":[0.96066266,0.02889283,0.001827978,0.0051454995,0.0014087097,0.0020623908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027243039,0.0022201966,0.0024872464,0.0029799445,0.0029086883,0.009704218,0.0063705416,0.0043097315,0.014633597],"category_scores_gemma":[0.02644246,0.001442537,0.0023425862,0.004516957,0.0046993354,0.015385179,0.0047455714,0.005922147,0.0016494485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0063110543,0.0016208554,0.033889577,0.0023555795,0.00086750113,0.0008216438,0.0021711914,0.43701085,0.0200137,0.2862374,0.07192183,0.1367788],"study_design_scores_gemma":[0.0002438538,0.00012269063,0.0033687742,0.00008585287,0.00012088067,0.00027092788,0.00051046506,0.38953876,0.005667033,0.5956789,0.004318945,0.000072934],"about_ca_topic_score_codex":0.009922018,"about_ca_topic_score_gemma":0.014253438,"teacher_disagreement_score":0.014633597,"about_ca_system_score_codex":0.005479597,"about_ca_system_score_gemma":0.004472652,"threshold_uncertainty_score":0.04895425},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1486276,0.00023137471,0.8354862,0.0003258147,0.00006819063,0.00014734782,0.00033466416,0.00034017224,0.014438657],"genre_scores_gemma":[0.6935117,0.00022306506,0.2946779,0.000115911294,0.000031681706,0.00022252898,0.0004927898,0.00010180961,0.010622685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.0001499362,0.000025049687,0.00007223993,0.00017750263,0.00010813093],"domain_scores_gemma":[0.9987431,0.0005581966,0.00011996236,0.00019779692,0.00021464124,0.00016627273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050355535,0.0004870507,0.0006173333,0.0006817666,0.00058639137,0.0012329404,0.00093808834,0.0008118199,0.00568584],"category_scores_gemma":[0.003055759,0.00039096895,0.00030334972,0.00085330015,0.0006330527,0.00109749,0.0015881781,0.00073130336,0.0006756773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020844578,0.0003494402,0.0028125828,0.00020598675,0.00007542364,0.00036716697,0.0002046457,0.49833977,0.03844443,0.31345168,0.0056407577,0.13802363],"study_design_scores_gemma":[0.000102925595,0.0001480802,0.0005118391,0.000019662793,0.000017514854,0.00011960502,0.00008143522,0.9277801,0.0068833022,0.06169856,0.0026179308,0.000019159921],"about_ca_topic_score_codex":0.0015540303,"about_ca_topic_score_gemma":0.0019177783,"teacher_disagreement_score":0.00568584,"about_ca_system_score_codex":0.00075556035,"about_ca_system_score_gemma":0.00074177375,"threshold_uncertainty_score":0.019021034},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2880456,0.004524446,0.3409241,0.0018561276,0.0007430429,0.0005272195,0.002452755,0.0030434874,0.35788316],"genre_scores_gemma":[0.82510525,0.0020633293,0.11347959,0.0011736209,0.00025961662,0.0007178355,0.0014235778,0.00030508096,0.055472214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977584,0.0005969503,0.00009671369,0.000326161,0.00048744906,0.0007343377],"domain_scores_gemma":[0.9941579,0.0022600526,0.0008205158,0.0013140327,0.0010264276,0.00042105105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013828732,0.0010577046,0.0010664484,0.0020683745,0.0024222038,0.002564542,0.0009196233,0.002268575,0.027917223],"category_scores_gemma":[0.006069828,0.0005968684,0.0009568959,0.0018613932,0.0014865757,0.0018729923,0.0016571782,0.0014906824,0.011943524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096067577,0.0001919368,0.0014759765,0.0005463038,0.00008728457,0.00025796684,0.0004443454,0.0025852553,0.01985043,0.8502676,0.0125868395,0.11074537],"study_design_scores_gemma":[0.0003240273,0.0007844808,0.0025204835,0.0003693481,0.00014763312,0.0020390057,0.00047263099,0.012660553,0.030147435,0.8441521,0.10620672,0.00017556445],"about_ca_topic_score_codex":0.00057819695,"about_ca_topic_score_gemma":0.0013961224,"teacher_disagreement_score":0.027917223,"about_ca_system_score_codex":0.0006301582,"about_ca_system_score_gemma":0.0019657435,"threshold_uncertainty_score":0.09339243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51421416,0.0012677575,0.37936896,0.0016225771,0.00043586252,0.00014505311,0.0022015714,0.0010917804,0.099652365],"genre_scores_gemma":[0.86615443,0.00082528783,0.10648296,0.00039340058,0.0002079824,0.00023046574,0.0027286198,0.00066167314,0.022315172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988581,0.00030285312,0.00008574784,0.00025948582,0.00026128368,0.00023262046],"domain_scores_gemma":[0.99675566,0.0016199163,0.00041481326,0.00054741354,0.00029322825,0.0003689239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058845145,0.0011140715,0.0010646442,0.0021982098,0.0019553273,0.0041429824,0.0013665336,0.0016966244,0.014769703],"category_scores_gemma":[0.0050965315,0.0014664975,0.0012059704,0.002587263,0.001974386,0.0056852624,0.0031396735,0.0025374396,0.002290977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002255697,0.0001248252,0.0010613522,0.00025682105,0.000041007745,0.00043764294,0.0010784764,0.010604851,0.0037809894,0.94205594,0.0074641854,0.032868214],"study_design_scores_gemma":[0.00003008699,0.000036807003,0.00062787376,0.00009095914,0.00002663062,0.00036048843,0.0005964379,0.02536705,0.0019481557,0.9622625,0.008630387,0.000022598311],"about_ca_topic_score_codex":0.0009479545,"about_ca_topic_score_gemma":0.0012414326,"teacher_disagreement_score":0.014769703,"about_ca_system_score_codex":0.0011265771,"about_ca_system_score_gemma":0.00035715703,"threshold_uncertainty_score":0.04940957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35223365,0.0029214995,0.5412533,0.0017159416,0.0002678072,0.00013869605,0.0013053194,0.0004551014,0.099708706],"genre_scores_gemma":[0.8974115,0.0028846953,0.07426289,0.00040750598,0.00047266248,0.00017830024,0.0008689324,0.00014360834,0.023369951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933463,0.00018831015,0.000040734674,0.00014454151,0.00018249592,0.00010921164],"domain_scores_gemma":[0.9962041,0.0021550998,0.00049071264,0.00027409132,0.00048671887,0.00038940035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007998316,0.00071410724,0.00043665938,0.0022523294,0.0009945395,0.0018336638,0.0004970858,0.0007429067,0.0048678606],"category_scores_gemma":[0.0056193545,0.0003772412,0.00042798562,0.0021099881,0.0021187086,0.0033199056,0.0010314977,0.0013612664,0.0008445511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048886555,0.000026164767,0.00033543675,0.00005802644,0.0000039457595,0.00009857554,0.0002157153,0.0069816685,0.0011101033,0.97343904,0.0012755328,0.016407032],"study_design_scores_gemma":[0.0000064257256,0.00003076364,0.00020883612,0.00002156681,0.0000028418397,0.00012364579,0.000050527018,0.013402093,0.00033638196,0.9826779,0.0031261449,0.000012902027],"about_ca_topic_score_codex":0.0010754254,"about_ca_topic_score_gemma":0.0011768646,"teacher_disagreement_score":0.0048678606,"about_ca_system_score_codex":0.0011464336,"about_ca_system_score_gemma":0.0007238342,"threshold_uncertainty_score":0.016284585},"labels":[],"label_agreement":null},{"id":"W1800155867","doi":"10.1002/jcd.10019","title":"Decomposition of the complete graph plus a 1‐factor into cycles of equal length","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Graph; Decomposition; Factor (programming language); Order (exchange); Discrete mathematics; Computer science; Chemistry","score_opus":0.023096758306833373,"score_gpt":0.24517342109675486,"score_spread":0.2220766627899215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800155867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.742185,0.00052804674,0.22795317,0.00034969542,0.00009793113,0.0002863687,0.0011778518,0.00023694849,0.02718494],"genre_scores_gemma":[0.88657445,0.00042213805,0.09996545,0.00021287089,0.00006343334,0.00022373148,0.0015567404,0.00009438128,0.010886814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922156,0.00013434522,0.00004450311,0.00021441458,0.00014621373,0.00023901137],"domain_scores_gemma":[0.99736917,0.00079530576,0.0005724151,0.00038208129,0.00044244117,0.00043859213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049260055,0.0007165665,0.00059473695,0.0012201541,0.0007967265,0.0014734707,0.00042457585,0.0004953192,0.0060303374],"category_scores_gemma":[0.0022774497,0.0004936852,0.00067462114,0.00056005246,0.00090875546,0.0018615421,0.00084350066,0.00077444396,0.00076131994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022127794,0.0004878446,0.010411034,0.0009799168,0.0002457502,0.0022077416,0.0011976385,0.08350175,0.13261151,0.62229687,0.010717066,0.13313006],"study_design_scores_gemma":[0.00035546755,0.0009876477,0.00778336,0.00034109104,0.00030708165,0.002378461,0.0011750858,0.1653453,0.064179696,0.71422094,0.042782094,0.00014385312],"about_ca_topic_score_codex":0.0015219519,"about_ca_topic_score_gemma":0.0028458107,"teacher_disagreement_score":0.0060303374,"about_ca_system_score_codex":0.0005729077,"about_ca_system_score_gemma":0.0007363443,"threshold_uncertainty_score":0.02017355},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1637331,0.0007192544,0.82431686,0.00010758091,0.000027309725,0.000030526928,0.0000367671,0.00027667332,0.010752014],"genre_scores_gemma":[0.96594983,0.0004227952,0.03131843,0.000031987307,0.000022407088,0.000032782733,0.000033663786,0.00006271076,0.0021253256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996178,0.00011845534,0.000009041526,0.000035822286,0.00015061839,0.00006816734],"domain_scores_gemma":[0.99903846,0.0005591788,0.00009944072,0.00010913565,0.00015842025,0.000035410216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006281703,0.00044697445,0.00038526708,0.0006904454,0.00027254774,0.0006449241,0.0004900028,0.00037155914,0.0010236679],"category_scores_gemma":[0.002182543,0.00016004403,0.00029121817,0.00036627412,0.0008451935,0.0009321012,0.0003795772,0.0008428845,0.00024653613],"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.00020347224,0.00007089195,0.001638269,0.000106091364,0.000025570529,0.00047898132,0.00027476327,0.48206046,0.05952311,0.43052986,0.00071773684,0.024370765],"study_design_scores_gemma":[0.0000040899995,0.000021641152,0.00031192892,0.000012119321,0.0000055230134,0.0000881688,0.000016403821,0.9764323,0.0026362939,0.019909982,0.00055227615,0.000009200147],"about_ca_topic_score_codex":0.0019286759,"about_ca_topic_score_gemma":0.00089638395,"teacher_disagreement_score":0.0019286759,"about_ca_system_score_codex":0.00097464956,"about_ca_system_score_gemma":0.00058256346,"threshold_uncertainty_score":0.007071674},"labels":[],"label_agreement":null},{"id":"W1821740204","doi":"10.1002/jcd.21331","title":"Cops and Robbers on Graphs Based on Designs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Trapezoid graph; Indifference graph; Chromatic scale; Discrete mathematics; Pathwidth; Intersection (aeronautics); 1-planar graph; Graph; Line graph","score_opus":0.021854492476667983,"score_gpt":0.22479205968209653,"score_spread":0.20293756720542855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1821740204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.884111,0.00036241455,0.086034425,0.0004188928,0.000038398473,0.000070110946,0.00032088035,0.00020173195,0.02844225],"genre_scores_gemma":[0.97817194,0.00019278849,0.017888807,0.00006116964,0.000022700086,0.000078468285,0.00016138665,0.000053852447,0.0033687856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988287,0.00033922118,0.00004601423,0.00025964231,0.00029843522,0.00022812447],"domain_scores_gemma":[0.99441874,0.0030884426,0.0011717645,0.0005122278,0.00036463738,0.00044417472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767434,0.000588843,0.0007910011,0.0028304106,0.0016171302,0.0019772435,0.0007092066,0.0009930946,0.006494771],"category_scores_gemma":[0.0069449134,0.0006588192,0.0005578538,0.0011578724,0.0019145692,0.0023700579,0.0011527219,0.0009313697,0.00041796212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037136127,0.00009879088,0.008255937,0.00023207435,0.00006695588,0.00066216383,0.0006840705,0.05086504,0.0157756,0.89626974,0.0031478468,0.023570236],"study_design_scores_gemma":[0.00007250032,0.000281659,0.008613113,0.00018216501,0.00008825186,0.0017735955,0.0008512329,0.22872582,0.021045946,0.72461283,0.013669391,0.000083464234],"about_ca_topic_score_codex":0.0007163023,"about_ca_topic_score_gemma":0.00083051895,"teacher_disagreement_score":0.006494771,"about_ca_system_score_codex":0.0013276575,"about_ca_system_score_gemma":0.0003834237,"threshold_uncertainty_score":0.021727145},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04278828,0.00073743606,0.95389706,0.00010218634,0.00010433812,0.00006246068,0.00002730949,0.00034205738,0.0019388687],"genre_scores_gemma":[0.67070544,0.0004626565,0.3249371,0.00017015375,0.00019372845,0.00005783418,0.00005967243,0.000029957604,0.0033833971],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993687,0.00017031377,0.000028334456,0.000119361255,0.00025518332,0.000058041584],"domain_scores_gemma":[0.99966896,0.00008402335,0.000044410655,0.000057538782,0.00012512758,0.000019926902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056026416,0.00042971654,0.00048698342,0.0002808352,0.00035364332,0.00061502005,0.0007729594,0.00057242706,0.00096947345],"category_scores_gemma":[0.0005461552,0.0002643515,0.0003267845,0.0002985223,0.00027542692,0.0006833008,0.00026888476,0.0005893753,0.00033702943],"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.0010819177,0.0003143369,0.0036759316,0.00046089452,0.00034803152,0.0008132219,0.00029167222,0.13072906,0.49188069,0.07411286,0.0025087753,0.29378274],"study_design_scores_gemma":[0.00009225373,0.00063688157,0.0017803318,0.000025836614,0.0001874215,0.0010176782,0.000021305323,0.93180394,0.055683345,0.0030873762,0.005611811,0.000051862837],"about_ca_topic_score_codex":0.00078661396,"about_ca_topic_score_gemma":0.0021229107,"teacher_disagreement_score":0.00096947345,"about_ca_system_score_codex":0.00057647354,"about_ca_system_score_gemma":0.00055936375,"threshold_uncertainty_score":0.004182577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805699,0.00010868532,0.018678084,0.000038648974,0.000013043588,0.00002057041,0.000050936338,0.000120751625,0.00039933005],"genre_scores_gemma":[0.9779181,0.000049177957,0.021623839,0.000009760837,0.0000034486945,0.000021968839,0.000031872725,0.000008285178,0.0003335218],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995641,0.000078753976,0.000023698405,0.00006344471,0.0002106979,0.000059257964],"domain_scores_gemma":[0.9990495,0.00049553846,0.00010225752,0.00009955891,0.00020130143,0.00005177397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051969953,0.00025760528,0.00018928251,0.00039937694,0.0002570753,0.00017595163,0.0004380794,0.00043789778,0.001100957],"category_scores_gemma":[0.0008072047,0.00013911803,0.00012176822,0.00021680954,0.00026385696,0.00038742088,0.00019757365,0.00017462307,0.00012556647],"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.000073866606,0.00004327746,0.0011150972,0.00003382205,0.000005472764,0.000098839635,0.00003747832,0.0009642538,0.9918601,0.00026500144,0.000043201417,0.0054595885],"study_design_scores_gemma":[0.000014455737,0.00060122856,0.003004098,0.0000036783345,0.000007254881,0.0003002521,0.000027447844,0.016234335,0.97925603,0.0001511131,0.00038980666,0.000010258985],"about_ca_topic_score_codex":0.0006970323,"about_ca_topic_score_gemma":0.0013729373,"teacher_disagreement_score":0.001100957,"about_ca_system_score_codex":0.0003073695,"about_ca_system_score_gemma":0.0001904698,"threshold_uncertainty_score":0.0036830902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8210725,0.00022689957,0.15361069,0.00034155181,0.00005110947,0.000038794627,0.0005124799,0.00036186562,0.023784146],"genre_scores_gemma":[0.9336699,0.00021058478,0.062108655,0.00008591539,0.000034222234,0.00004663385,0.00076875405,0.00016413127,0.002911127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.00009355295,0.00002242168,0.00010966986,0.00014304736,0.00012664692],"domain_scores_gemma":[0.9986308,0.0006695687,0.00012677997,0.00019901663,0.00012624572,0.00024758148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739768,0.0006772901,0.00063379435,0.0024749103,0.0016029113,0.0020185595,0.0008182653,0.0011051097,0.0045628357],"category_scores_gemma":[0.0026202106,0.00065216667,0.00086340914,0.001415899,0.0016186251,0.0019437956,0.0016660279,0.000991604,0.0005880635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005023236,0.00022999599,0.004549042,0.00017726146,0.000040826046,0.00068501255,0.0012225005,0.050609317,0.019503566,0.8692124,0.006127664,0.047140036],"study_design_scores_gemma":[0.000049638664,0.00007059519,0.0013452267,0.00004618051,0.000020823249,0.00044145904,0.0005755858,0.18008198,0.0050919023,0.8094197,0.002828592,0.000028237604],"about_ca_topic_score_codex":0.0011871945,"about_ca_topic_score_gemma":0.001143149,"teacher_disagreement_score":0.0045628357,"about_ca_system_score_codex":0.00075948855,"about_ca_system_score_gemma":0.00056182884,"threshold_uncertainty_score":0.0152641535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6972408,0.001020894,0.12646781,0.00093678833,0.0002450094,0.00013565732,0.0017088248,0.00030022272,0.17194398],"genre_scores_gemma":[0.9634301,0.00034418935,0.015996182,0.00020870047,0.000117023024,0.00006793552,0.00058394956,0.000054137403,0.019197721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959475,0.000076807,0.000031677184,0.00009916624,0.00010673588,0.000090781454],"domain_scores_gemma":[0.9985916,0.0006097082,0.00018862828,0.00023856861,0.0001603505,0.0002110368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003436384,0.00035144817,0.0004653195,0.0013124676,0.0011999044,0.002722733,0.00053562736,0.0005198276,0.007874233],"category_scores_gemma":[0.0023062595,0.0003869859,0.00042264667,0.0007760286,0.0013496592,0.0029431009,0.0016948736,0.0011924516,0.00081513834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057709072,0.000017209148,0.0005158551,0.00006523038,0.000010128272,0.00014203465,0.00020437452,0.00078991574,0.0018142143,0.98711616,0.0013575408,0.007909673],"study_design_scores_gemma":[0.00002936738,0.000033543398,0.0012474568,0.000044081706,0.000022701428,0.0003666355,0.00018837715,0.006069962,0.0019938638,0.9800198,0.0099659255,0.000018334642],"about_ca_topic_score_codex":0.00046392795,"about_ca_topic_score_gemma":0.0007641937,"teacher_disagreement_score":0.007874233,"about_ca_system_score_codex":0.0008146588,"about_ca_system_score_gemma":0.00040223764,"threshold_uncertainty_score":0.026341915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17184669,0.001489388,0.68602806,0.0014096859,0.00034668122,0.00019869892,0.000319785,0.00045580184,0.13790525],"genre_scores_gemma":[0.81500614,0.0016883669,0.14130817,0.0011635536,0.0003053244,0.0003205799,0.00025938754,0.0002119918,0.039736435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986627,0.00055623264,0.00004592969,0.00014249056,0.00039343056,0.00019919768],"domain_scores_gemma":[0.9975821,0.0011517092,0.0002573086,0.00052116596,0.0003739336,0.000113782145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012492221,0.0012711429,0.00065699365,0.0014305149,0.0010657279,0.0016775595,0.0007438864,0.0013838968,0.0064378064],"category_scores_gemma":[0.0050782682,0.0004447308,0.0005772262,0.0013866071,0.001959301,0.001865909,0.0019308223,0.0014992352,0.0012588587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121744626,0.000017149981,0.00021781768,0.000047275866,0.000015955018,0.00007559692,0.00017480874,0.015777111,0.0033221468,0.95477766,0.0018700011,0.023582691],"study_design_scores_gemma":[0.00006674272,0.000106336774,0.0002069863,0.000101805635,0.000029519448,0.0002590862,0.00012409464,0.08314662,0.0053088465,0.897435,0.013159919,0.00005492709],"about_ca_topic_score_codex":0.0015534444,"about_ca_topic_score_gemma":0.00281163,"teacher_disagreement_score":0.0064378064,"about_ca_system_score_codex":0.0015205309,"about_ca_system_score_gemma":0.00097447314,"threshold_uncertainty_score":0.021536589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80772775,0.00027683264,0.08716486,0.0010940734,0.000157688,0.00014037371,0.0008659452,0.00055204635,0.102020346],"genre_scores_gemma":[0.9429087,0.00036550983,0.035633896,0.00030438328,0.00005639403,0.00006778722,0.0011575602,0.00013535941,0.019370416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992599,0.0001523256,0.00004110546,0.00014950933,0.00017375537,0.00022339822],"domain_scores_gemma":[0.9977976,0.0008264012,0.0003172863,0.000297386,0.00038164147,0.0003796909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004462137,0.0007005376,0.00075351726,0.001333448,0.0016116027,0.0022934896,0.0017597777,0.0011285992,0.008817316],"category_scores_gemma":[0.002380197,0.00056252035,0.00059847196,0.001313565,0.0018961537,0.0013158972,0.0016617902,0.0015748972,0.001513519],"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.00077596866,0.00021512002,0.002822466,0.00032985525,0.00009080108,0.0010085941,0.0010102267,0.017771052,0.029555334,0.89353466,0.008356823,0.04452902],"study_design_scores_gemma":[0.00020552044,0.00018215987,0.0029987423,0.000087799504,0.00014398796,0.0010068303,0.0010393836,0.0435368,0.015055267,0.9183226,0.017339142,0.00008183251],"about_ca_topic_score_codex":0.0022195776,"about_ca_topic_score_gemma":0.0030804747,"teacher_disagreement_score":0.008817316,"about_ca_system_score_codex":0.0010339238,"about_ca_system_score_gemma":0.00079211214,"threshold_uncertainty_score":0.029496849},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08023692,0.00054329063,0.88618886,0.0014052961,0.00027318043,0.00022866191,0.000230844,0.00068098604,0.030211994],"genre_scores_gemma":[0.7278666,0.000446729,0.25536177,0.0005803547,0.000103581086,0.00021478615,0.00020350036,0.000056788558,0.01516595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887294,0.0003666014,0.000058039015,0.00021170492,0.0003249699,0.00016577812],"domain_scores_gemma":[0.9990945,0.00016998862,0.00013311229,0.00038104944,0.00013827953,0.00008303076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076706934,0.0003096558,0.00045776126,0.00043672055,0.0007142309,0.0010030502,0.0008315591,0.0009989048,0.0034149156],"category_scores_gemma":[0.0011982032,0.00024772887,0.00052673154,0.0008735733,0.0012418517,0.0020281486,0.0020210173,0.0010062059,0.0009726217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004027842,0.00013759384,0.00063945353,0.00024062929,0.00006868845,0.00064218557,0.00059884717,0.031670988,0.08819838,0.786861,0.0046397042,0.08589966],"study_design_scores_gemma":[0.0004534935,0.00084609684,0.00084298913,0.00011854282,0.00011084425,0.0029988904,0.0002647997,0.44295588,0.12192133,0.3162472,0.11296016,0.00027981095],"about_ca_topic_score_codex":0.0003351542,"about_ca_topic_score_gemma":0.0002579688,"teacher_disagreement_score":0.0034149156,"about_ca_system_score_codex":0.0007002361,"about_ca_system_score_gemma":0.0009532279,"threshold_uncertainty_score":0.011424065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21665181,0.001968045,0.5285586,0.016102886,0.0009252083,0.00016300431,0.0010152941,0.0012169031,0.23339827],"genre_scores_gemma":[0.9439621,0.0006619688,0.03140001,0.0027922653,0.00065640465,0.00027136743,0.0004776313,0.00021516162,0.019563071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794847,0.00042817972,0.00008771742,0.0005671031,0.00046207322,0.00050648634],"domain_scores_gemma":[0.99434537,0.0038318646,0.00028735393,0.00063879025,0.000462191,0.00043450663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018676539,0.0005958717,0.001233916,0.0015855816,0.002357752,0.004930456,0.0016186552,0.0023604971,0.014253184],"category_scores_gemma":[0.006689067,0.0005847048,0.0011949856,0.0014513811,0.004474587,0.006868528,0.0042757634,0.0057822634,0.0012209017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008039513,0.000028781504,0.00015597613,0.000055749988,0.000010664555,0.00004743856,0.00011336407,0.001582023,0.00097633665,0.9872198,0.003635323,0.006094027],"study_design_scores_gemma":[0.00002571643,0.000014936866,0.00009697082,0.000012381798,0.000008488147,0.00005566267,0.000034842775,0.008328406,0.00043101594,0.98927945,0.0017043126,0.000007830677],"about_ca_topic_score_codex":0.00075396296,"about_ca_topic_score_gemma":0.00050751027,"teacher_disagreement_score":0.014253184,"about_ca_system_score_codex":0.0026668021,"about_ca_system_score_gemma":0.0010042976,"threshold_uncertainty_score":0.04768163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19696906,0.0016249926,0.5880992,0.0015744044,0.0008446313,0.00017995865,0.00045105678,0.0016135513,0.20864323],"genre_scores_gemma":[0.85639906,0.0005610392,0.11509753,0.00034978462,0.00011098342,0.00008734823,0.0003756716,0.00023019315,0.02678836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993709,0.00023127184,0.00003348296,0.00012119552,0.0001292161,0.00011389414],"domain_scores_gemma":[0.9984131,0.00071152725,0.00013834675,0.00040761766,0.00018032809,0.00014915502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070515857,0.000413512,0.00032170664,0.0009474619,0.001280757,0.0011970378,0.0005364065,0.0005906248,0.009184907],"category_scores_gemma":[0.003852431,0.00029633375,0.00038836902,0.0004828817,0.0013370527,0.002305009,0.0018120428,0.000985119,0.0024851072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001972872,0.00006645169,0.00031385082,0.000102706384,0.000011806712,0.00016716297,0.00034625098,0.0042411783,0.008283201,0.93742764,0.0061347215,0.042707693],"study_design_scores_gemma":[0.0000426655,0.000111204594,0.00017579884,0.0000715601,0.00001478668,0.00040169212,0.00015404842,0.023515822,0.014801165,0.93898726,0.021685971,0.000038014638],"about_ca_topic_score_codex":0.00037932003,"about_ca_topic_score_gemma":0.0009278131,"teacher_disagreement_score":0.009184907,"about_ca_system_score_codex":0.00046435735,"about_ca_system_score_gemma":0.00041515625,"threshold_uncertainty_score":0.030726552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63792825,0.0010522753,0.1615883,0.0018556095,0.0004631712,0.0002925243,0.0018646015,0.00080198416,0.19415322],"genre_scores_gemma":[0.922289,0.00056538545,0.035810087,0.00051849935,0.00011907518,0.0002583396,0.0011419378,0.00017368168,0.03912394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.00016984274,0.000041539904,0.00015587133,0.00013255916,0.00017536886],"domain_scores_gemma":[0.99748397,0.0011662118,0.00042674263,0.00029514355,0.00026929748,0.00035855468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040144543,0.0003777699,0.00047272036,0.0020506254,0.0025638188,0.0028562965,0.00081329216,0.0010948578,0.014847702],"category_scores_gemma":[0.0035211574,0.0005277183,0.00050369673,0.0014259443,0.0016292568,0.003553262,0.0018551315,0.0009394362,0.0013885068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016530654,0.00003921996,0.001085297,0.0001555833,0.000028829132,0.000494075,0.00080492627,0.0028915731,0.0040157023,0.9649919,0.0062555564,0.019071925],"study_design_scores_gemma":[0.00003013948,0.000042243882,0.0012239747,0.00010290341,0.000041747302,0.00067109516,0.0007785345,0.013472875,0.0044010133,0.95340174,0.025800264,0.00003344505],"about_ca_topic_score_codex":0.0017083765,"about_ca_topic_score_gemma":0.0038886394,"teacher_disagreement_score":0.014847702,"about_ca_system_score_codex":0.001017157,"about_ca_system_score_gemma":0.0005822251,"threshold_uncertainty_score":0.049670517},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04002654,0.00085618877,0.947745,0.00089701713,0.00010613409,0.00016503243,0.00008375744,0.00054464,0.0095757],"genre_scores_gemma":[0.34724733,0.0009750262,0.6432558,0.000357466,0.00015693974,0.0007504856,0.000304068,0.00023487008,0.0067180987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986785,0.0006228645,0.00007347714,0.00024594032,0.00023184075,0.00014747366],"domain_scores_gemma":[0.9957021,0.0034573232,0.00022512415,0.00023383036,0.00027750808,0.00010401523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018737804,0.0014407288,0.0015985797,0.001812997,0.0015685838,0.0018032556,0.0018806108,0.002388545,0.0030654564],"category_scores_gemma":[0.008703651,0.0009652458,0.001243063,0.0018981672,0.0028165006,0.0014201123,0.002154277,0.0022415987,0.0004489982],"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.00005913375,0.000057899706,0.00069470674,0.00011484014,0.00007932304,0.0001543206,0.00018560428,0.87607664,0.00059351383,0.08234592,0.001339353,0.038298726],"study_design_scores_gemma":[0.00005041653,0.000025850113,0.00009773694,0.000024508685,0.000021507212,0.000034967565,0.00005189062,0.85721433,0.00039213352,0.14046405,0.0016094439,0.0000132480745],"about_ca_topic_score_codex":0.006541824,"about_ca_topic_score_gemma":0.006461536,"teacher_disagreement_score":0.006541824,"about_ca_system_score_codex":0.0024594949,"about_ca_system_score_gemma":0.0020720402,"threshold_uncertainty_score":0.017844975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17906319,0.0023320017,0.4998559,0.002148363,0.00083694654,0.00020901923,0.002260579,0.0005703529,0.3127236],"genre_scores_gemma":[0.70162964,0.0015581532,0.1735146,0.0010182732,0.00062811753,0.00030112386,0.0032573617,0.0004997241,0.117593035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988739,0.0002808135,0.000067041066,0.00035880646,0.00027577262,0.00014364533],"domain_scores_gemma":[0.9974394,0.00096450245,0.0003313914,0.0005467948,0.00044783493,0.00027015927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603958,0.000541922,0.00054935686,0.0021007913,0.0017198562,0.0027085776,0.0008297584,0.00080541143,0.022042328],"category_scores_gemma":[0.0026790893,0.000563858,0.0008564648,0.0014574045,0.001296555,0.0046887826,0.0022703898,0.0023084395,0.0038917975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040062456,0.00003486447,0.00022564412,0.00006841428,0.000020585876,0.00016382536,0.00016674552,0.000922877,0.0012936371,0.97643423,0.0043933652,0.016235773],"study_design_scores_gemma":[0.000014620454,0.000023145993,0.00036043298,0.00004338368,0.00001866667,0.00040786903,0.00017487392,0.0065703862,0.002068668,0.9674492,0.022853093,0.000015525293],"about_ca_topic_score_codex":0.00051316834,"about_ca_topic_score_gemma":0.0012447597,"teacher_disagreement_score":0.022042328,"about_ca_system_score_codex":0.00072834635,"about_ca_system_score_gemma":0.00045707537,"threshold_uncertainty_score":0.07373893},"labels":[],"label_agreement":null},{"id":"W1928034317","doi":"10.1002/jcd.21324","title":"Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Upper and lower bounds; Group (periodic table); Generalization; Integer (computer science); Type (biology); Block (permutation group theory); Combinatorial design; Block size; Limit (mathematics); Discrete mathematics","score_opus":0.0222665637184636,"score_gpt":0.21794672969470974,"score_spread":0.19568016597624613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928034317","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52183074,0.00041554536,0.4580747,0.0003427032,0.00012472022,0.00013989878,0.0002322945,0.00086977414,0.017969644],"genre_scores_gemma":[0.84097475,0.00012347351,0.15484843,0.00013687334,0.000037273912,0.00010515521,0.00017400007,0.000041470616,0.0035585305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991959,0.00026057984,0.00006526541,0.00013044501,0.00018883085,0.00015907885],"domain_scores_gemma":[0.9976986,0.00066562375,0.00044236367,0.0007509095,0.00026630674,0.00017627032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000639561,0.0003440121,0.00045059147,0.00056808215,0.00043133475,0.0010181046,0.0006091717,0.00055822154,0.0024289063],"category_scores_gemma":[0.0019666867,0.00028280684,0.00040998994,0.0008060079,0.00061146414,0.0010580099,0.00076760363,0.00052557583,0.00038648688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017615882,0.0003367903,0.009729839,0.0004295922,0.00015848414,0.0010028932,0.00042145833,0.14698485,0.28772983,0.37430364,0.006692305,0.17044875],"study_design_scores_gemma":[0.0002208805,0.0018676587,0.002140551,0.00008885475,0.00012707517,0.0021433528,0.00016921725,0.5868899,0.21575136,0.14003794,0.05046683,0.00009639519],"about_ca_topic_score_codex":0.00034241975,"about_ca_topic_score_gemma":0.0005762148,"teacher_disagreement_score":0.0024289063,"about_ca_system_score_codex":0.0006856181,"about_ca_system_score_gemma":0.00038139735,"threshold_uncertainty_score":0.008125544},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13549122,0.0006177296,0.8358624,0.0010602906,0.00014625124,0.0001768439,0.00014881486,0.0026108592,0.023885656],"genre_scores_gemma":[0.6806339,0.00039600034,0.30552176,0.00022508293,0.00006511727,0.00018509255,0.00027326448,0.000079229,0.012620531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984014,0.00004868845,0.000007229718,0.000026447125,0.000051911942,0.000025416059],"domain_scores_gemma":[0.9998098,0.000030150619,0.000018843535,0.000030524126,0.000080951446,0.000029814817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023410303,0.00023255196,0.00013997388,0.00041549775,0.00068282656,0.0007706757,0.0006427097,0.00043491297,0.0046639517],"category_scores_gemma":[0.00030808037,0.0001249087,0.00015613876,0.00037885978,0.0003397365,0.0009199458,0.00045362377,0.0003675065,0.00096096616],"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.0005651545,0.00036441337,0.002972062,0.00032550524,0.00010224831,0.0004491689,0.00027256022,0.26353967,0.17156596,0.20934056,0.018009774,0.3324929],"study_design_scores_gemma":[0.000107669475,0.00046586126,0.002192392,0.000042902197,0.00011516962,0.0005350002,0.00016165814,0.8426433,0.032652155,0.067776054,0.053251635,0.00005615259],"about_ca_topic_score_codex":0.0019182565,"about_ca_topic_score_gemma":0.003961939,"teacher_disagreement_score":0.0046639517,"about_ca_system_score_codex":0.00077496696,"about_ca_system_score_gemma":0.00041365647,"threshold_uncertainty_score":0.015602469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71868914,0.0012562838,0.119481124,0.0009919729,0.00069514057,0.00011288701,0.0005678316,0.0003877813,0.1578178],"genre_scores_gemma":[0.97247136,0.0002564127,0.012076635,0.000120543344,0.00009464832,0.00010462446,0.00016193182,0.000050643524,0.014663258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994199,0.00016124411,0.00003647345,0.000092465416,0.0001591168,0.00013071488],"domain_scores_gemma":[0.9976762,0.0009846648,0.00034340427,0.0003406011,0.0003081158,0.00034704618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004972765,0.00026035542,0.00040241115,0.0014479761,0.0013161327,0.0016900364,0.00054756773,0.0012168091,0.013761775],"category_scores_gemma":[0.0037137608,0.00024189473,0.0002243077,0.0004940948,0.0012668238,0.0022343867,0.0010116574,0.0008118942,0.0012995747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018619686,0.000054442782,0.00085353956,0.000078948084,0.000012866307,0.00021196603,0.00018827406,0.0024097953,0.012227345,0.96629655,0.0022284603,0.015251611],"study_design_scores_gemma":[0.000041359373,0.00015767693,0.0016885941,0.000080522674,0.000026616586,0.00070699875,0.0002904662,0.028847983,0.012438563,0.9447946,0.0108689545,0.000057729343],"about_ca_topic_score_codex":0.00028175564,"about_ca_topic_score_gemma":0.0006095951,"teacher_disagreement_score":0.013761775,"about_ca_system_score_codex":0.00042508455,"about_ca_system_score_gemma":0.00043927538,"threshold_uncertainty_score":0.046037793},"labels":[],"label_agreement":null},{"id":"W1939767867","doi":"10.1002/jcd.21315","title":"The Asymptotic Existence of Resolvable Group Divisible Designs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Corollary; Block (permutation group theory); Group (periodic table); Graph; Discrete mathematics","score_opus":0.027203003280620378,"score_gpt":0.23307030169027662,"score_spread":0.20586729840965623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1939767867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51698136,0.00046827502,0.46045294,0.00044935883,0.000042856882,0.000095179035,0.0004354131,0.00041672325,0.020657929],"genre_scores_gemma":[0.9085893,0.00017651563,0.08807495,0.000118176424,0.000037706202,0.00013181596,0.00029124637,0.00004841457,0.0025318963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832696,0.0005651911,0.00010623242,0.00035636194,0.0004304621,0.00021472313],"domain_scores_gemma":[0.9829906,0.010771433,0.0017130566,0.002589846,0.0014624539,0.00047265526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017468651,0.00032701608,0.00057761645,0.0009340722,0.00072469935,0.0012924124,0.0008146348,0.0009073006,0.0035587838],"category_scores_gemma":[0.015658643,0.00072465657,0.0005548317,0.00074299803,0.0011857699,0.0015881298,0.001169092,0.001222405,0.0005570414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008113046,0.00017433889,0.0067628804,0.00041288513,0.0001044186,0.00058412313,0.00073356513,0.08640117,0.048255216,0.78991103,0.0030302983,0.06281879],"study_design_scores_gemma":[0.00016119034,0.00043196382,0.001690042,0.00012082862,0.000073267816,0.0014253359,0.00028392114,0.24782361,0.028631615,0.7098166,0.009487833,0.000053856704],"about_ca_topic_score_codex":0.0002222438,"about_ca_topic_score_gemma":0.00035608368,"teacher_disagreement_score":0.0035587838,"about_ca_system_score_codex":0.00081375265,"about_ca_system_score_gemma":0.00058184925,"threshold_uncertainty_score":0.011905313},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008466276,0.0002939636,0.9766178,0.00027398535,0.00016161193,0.00031145007,0.00042291355,0.002345577,0.011106366],"genre_scores_gemma":[0.05423822,0.00012846004,0.93881273,0.00009987128,0.000028616603,0.00035371352,0.00076793693,0.00019829394,0.005372101],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840516,0.0003962987,0.00013731251,0.00028963268,0.00058883906,0.0001828273],"domain_scores_gemma":[0.99796474,0.0007725106,0.00009749266,0.00071474345,0.0003415117,0.000109014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011741092,0.001171856,0.0010509859,0.0015355751,0.001295844,0.0015925354,0.001492347,0.0015883786,0.018363602],"category_scores_gemma":[0.004937327,0.0007436568,0.0012005211,0.0018066345,0.0007732711,0.0017898388,0.0030239928,0.0014582938,0.0073990277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007212512,0.00037994675,0.0009081594,0.00055997376,0.00017488202,0.00036959784,0.00036771936,0.014773998,0.025378566,0.11537604,0.028546857,0.812443],"study_design_scores_gemma":[0.0011367928,0.00078765344,0.0013751036,0.00023665075,0.00031409308,0.0026011,0.0005974246,0.20870739,0.054580078,0.6157541,0.11367275,0.00023683567],"about_ca_topic_score_codex":0.00087110914,"about_ca_topic_score_gemma":0.0018665165,"teacher_disagreement_score":0.018363602,"about_ca_system_score_codex":0.0008006384,"about_ca_system_score_gemma":0.0018727578,"threshold_uncertainty_score":0.06143236},"labels":[],"label_agreement":null},{"id":"W1948972712","doi":"10.1002/jcd.21328","title":"Cycle Extensions in BIBD Block‐Intersection Graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Beijing Institute For Brain Disorders","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Intersection (aeronautics); Intersection graph; Discrete mathematics; Line graph","score_opus":0.015058811688889324,"score_gpt":0.22534113340204748,"score_spread":0.21028232171315817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948972712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5614086,0.00043587002,0.41193134,0.00033674872,0.000029833329,0.00028223806,0.00081836694,0.0005584169,0.02419861],"genre_scores_gemma":[0.8202238,0.0002594983,0.17167412,0.000108957094,0.00001454415,0.0002487378,0.0010510595,0.000074510055,0.0063447715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961853,0.00008141306,0.000021492906,0.000085932035,0.000110132445,0.000082545674],"domain_scores_gemma":[0.9990109,0.00037318096,0.00016465326,0.00016136037,0.00015987731,0.00013002311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919849,0.0002941102,0.00031150016,0.0007781698,0.00074560114,0.00070683996,0.00054899283,0.00033786957,0.0037550891],"category_scores_gemma":[0.001122298,0.00040415925,0.00032473478,0.0008127317,0.0005317136,0.0013408037,0.0012249902,0.00072969036,0.00031577842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011693371,0.00030806416,0.007534621,0.000578161,0.00010558631,0.0011806778,0.0011194163,0.19833283,0.059317917,0.49590218,0.0059508537,0.22850041],"study_design_scores_gemma":[0.000111108224,0.00025301456,0.0033455952,0.0001468011,0.00009611379,0.0007851252,0.00049742515,0.5121154,0.033748593,0.4053219,0.043525238,0.000053744927],"about_ca_topic_score_codex":0.002042966,"about_ca_topic_score_gemma":0.0029487496,"teacher_disagreement_score":0.0037550891,"about_ca_system_score_codex":0.00072870986,"about_ca_system_score_gemma":0.0005608845,"threshold_uncertainty_score":0.0125620365},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4639541,0.0007860579,0.25771022,0.0013852766,0.0003616466,0.00009235709,0.0011768154,0.0010559716,0.27347755],"genre_scores_gemma":[0.95955133,0.00023628525,0.016169759,0.0003253254,0.00011872515,0.00008673611,0.00046178018,0.00012615335,0.022923859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.00008855247,0.000023707486,0.00012731359,0.000095882184,0.00012822723],"domain_scores_gemma":[0.9984345,0.00061720825,0.00018296522,0.00027262387,0.00023960149,0.00025316497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030960146,0.00022155048,0.00036934132,0.0005942845,0.0010933221,0.0014371284,0.00031444844,0.0005554836,0.012915748],"category_scores_gemma":[0.0017865228,0.00020017638,0.00035430965,0.0004400086,0.0010953221,0.0020983396,0.0012331282,0.00074090797,0.0013287067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048677513,0.000016512893,0.00060306746,0.000037641654,0.000005899145,0.00013243864,0.000101864,0.0006281985,0.004866714,0.98475915,0.0027003402,0.006099458],"study_design_scores_gemma":[0.000028072289,0.00007073544,0.0019272876,0.000029419169,0.00002223286,0.0007750561,0.000280144,0.01174305,0.007261728,0.95192224,0.02591461,0.000025513984],"about_ca_topic_score_codex":0.00091295154,"about_ca_topic_score_gemma":0.0013036533,"teacher_disagreement_score":0.012915748,"about_ca_system_score_codex":0.00048520204,"about_ca_system_score_gemma":0.00038489705,"threshold_uncertainty_score":0.043207526},"labels":[],"label_agreement":null},{"id":"W1956284500","doi":"10.1002/jcd.21419","title":"Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation‐detachment Approach","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multigraph; Degree (music); Variable (mathematics); Decomposition; Existential quantification","score_opus":0.01722085646959558,"score_gpt":0.22773193411690057,"score_spread":0.21051107764730498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956284500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21692583,0.00073103735,0.7592404,0.0003986446,0.000109565444,0.00014364481,0.00019463463,0.00022006585,0.022036195],"genre_scores_gemma":[0.7266344,0.00046752518,0.26268098,0.0003450025,0.000097321514,0.00023737852,0.00042450518,0.00010491381,0.009007948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966896,0.00009430526,0.000022258131,0.00007780083,0.000056135083,0.00008049005],"domain_scores_gemma":[0.9993512,0.00015869533,0.00007946486,0.00020166278,0.00009549962,0.00011340385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003716305,0.00059452327,0.00029093536,0.0009495617,0.00091044983,0.00081347855,0.00059118273,0.00052569533,0.0040175025],"category_scores_gemma":[0.0011045372,0.000397154,0.00072696334,0.0008436711,0.0008424469,0.0021103323,0.001473019,0.0014964838,0.00045927943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004518804,0.00019522534,0.0018535347,0.00042398158,0.000091292575,0.00093990227,0.00090035493,0.04813682,0.089009285,0.6883297,0.0067991856,0.16286884],"study_design_scores_gemma":[0.000055989865,0.0001881279,0.0018998869,0.00014329607,0.000066533954,0.0008246563,0.00052548904,0.17355534,0.027653906,0.7652041,0.029809693,0.00007296044],"about_ca_topic_score_codex":0.00073165225,"about_ca_topic_score_gemma":0.001236117,"teacher_disagreement_score":0.0040175025,"about_ca_system_score_codex":0.00044878165,"about_ca_system_score_gemma":0.0003599692,"threshold_uncertainty_score":0.013439894},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03556367,0.00067084644,0.9514338,0.00043427135,0.00007383925,0.00003495432,0.000036543814,0.00012556362,0.011626549],"genre_scores_gemma":[0.629643,0.0015054389,0.3546556,0.00021799351,0.0002307885,0.00016229205,0.0001236793,0.000046457466,0.01341478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987316,0.0000425808,0.0000051762695,0.000020985915,0.000039052586,0.000019079014],"domain_scores_gemma":[0.9997856,0.00013233465,0.000019064031,0.000010866253,0.000042089225,0.000010111109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022271049,0.00026944268,0.00034037887,0.00032084383,0.0003311555,0.0005254949,0.00047994798,0.00065211323,0.002204816],"category_scores_gemma":[0.00096283667,0.00011896208,0.00018354483,0.00032315476,0.0002835585,0.00050414994,0.0004662617,0.00057637243,0.0003018956],"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.00011337488,0.000074395546,0.00043712306,0.0002947133,0.000042064163,0.0002487092,0.00016198576,0.687194,0.010414849,0.18211353,0.004719102,0.11418616],"study_design_scores_gemma":[0.00002537952,0.000045778866,0.000112378526,0.0000121210105,0.0000070918263,0.000100449484,0.000037793816,0.949345,0.001902044,0.044078723,0.004327216,0.000006037721],"about_ca_topic_score_codex":0.00062918477,"about_ca_topic_score_gemma":0.00048223292,"teacher_disagreement_score":0.002204816,"about_ca_system_score_codex":0.00018201812,"about_ca_system_score_gemma":0.00039253858,"threshold_uncertainty_score":0.0073758364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.949584,0.00083206524,0.025299208,0.00024371555,0.000034469598,0.00002120069,0.00029186488,0.00016876467,0.02352457],"genre_scores_gemma":[0.9865868,0.0002682818,0.0090074865,0.0000663418,0.000018039877,0.000023555127,0.0003090624,0.000026895155,0.0036936274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952865,0.00008590882,0.000027208804,0.0000722769,0.000090097885,0.00019590581],"domain_scores_gemma":[0.99916804,0.00031246472,0.00016741549,0.00017979687,0.0000524841,0.00011970374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023688651,0.00033413424,0.0004404337,0.00065413653,0.0011101041,0.00089752453,0.00063680025,0.00048391783,0.003177405],"category_scores_gemma":[0.0011877879,0.00039263593,0.00036138037,0.00070658064,0.00071595836,0.0011628506,0.001039577,0.00034377145,0.00034544992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001162293,0.00012890852,0.010226142,0.0005962554,0.00013544213,0.0013885829,0.0013904328,0.04187829,0.04736866,0.80858076,0.00842793,0.07871638],"study_design_scores_gemma":[0.00016156788,0.00035862907,0.00801619,0.00016864017,0.00012050502,0.0019535634,0.0010106297,0.07050151,0.036388475,0.84742725,0.033818662,0.00007439372],"about_ca_topic_score_codex":0.0014479354,"about_ca_topic_score_gemma":0.0023600613,"teacher_disagreement_score":0.003177405,"about_ca_system_score_codex":0.0005761667,"about_ca_system_score_gemma":0.00030050604,"threshold_uncertainty_score":0.010629475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12559046,0.0052197655,0.6798354,0.01244036,0.0019331082,0.00011425865,0.0006871163,0.0013900623,0.17278953],"genre_scores_gemma":[0.72264147,0.003901147,0.14905271,0.0026116336,0.0021158722,0.00020064354,0.00074849534,0.0005855776,0.11814237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869895,0.00039358143,0.00007579071,0.00027313075,0.0003959315,0.0001624462],"domain_scores_gemma":[0.9962452,0.002313748,0.00025134368,0.00058197835,0.00039149908,0.00021619459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010912779,0.00080359867,0.0011666056,0.0023929623,0.0022913837,0.0051001427,0.0012972375,0.0019938366,0.015115864],"category_scores_gemma":[0.008441774,0.00068414916,0.00072771916,0.005529902,0.0031383275,0.009069661,0.002057314,0.0036296248,0.002437375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002778772,0.000027582468,0.000108518005,0.000025558511,0.000005615075,0.000021136055,0.000063332656,0.002780441,0.00041815938,0.96721387,0.0040169097,0.025291163],"study_design_scores_gemma":[0.000004143574,0.0000054145676,0.00003005339,0.000006296536,0.000003852767,0.000022695574,0.00001770102,0.0059294533,0.000262186,0.9893773,0.0043351655,0.0000057739494],"about_ca_topic_score_codex":0.0015202109,"about_ca_topic_score_gemma":0.0017905044,"teacher_disagreement_score":0.015115864,"about_ca_system_score_codex":0.0021179486,"about_ca_system_score_gemma":0.0013684285,"threshold_uncertainty_score":0.050567567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14565867,0.0052853706,0.5361559,0.011580396,0.0027565053,0.00017141104,0.00063440023,0.0013224464,0.29643488],"genre_scores_gemma":[0.8393594,0.003875111,0.05532579,0.004637005,0.0026028734,0.00026053158,0.0016198858,0.001300255,0.091019295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979305,0.00061319,0.000112347436,0.0003192028,0.0005727268,0.00045206596],"domain_scores_gemma":[0.9927241,0.0051088016,0.000320125,0.0009527155,0.00060083345,0.00029343477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023167976,0.0011556448,0.0016634016,0.0025914353,0.0028473292,0.0039770645,0.0019850668,0.0024248876,0.016572982],"category_scores_gemma":[0.0069613988,0.0008438287,0.0022481424,0.0019045142,0.004813474,0.010078368,0.0065066027,0.0081141405,0.0040905518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019106781,0.00006652308,0.00036102493,0.00020987255,0.000033986675,0.0004769944,0.0004818562,0.0015368888,0.0038523013,0.96879923,0.010122048,0.013868138],"study_design_scores_gemma":[0.00004075622,0.000039388935,0.00028680352,0.000039454466,0.00004147849,0.00032362458,0.00013313837,0.0065824105,0.0025171635,0.9735005,0.0164563,0.000038985847],"about_ca_topic_score_codex":0.0012427416,"about_ca_topic_score_gemma":0.0010287703,"teacher_disagreement_score":0.016572982,"about_ca_system_score_codex":0.0011835502,"about_ca_system_score_gemma":0.0007031062,"threshold_uncertainty_score":0.055442154},"labels":[],"label_agreement":null},{"id":"W1964395996","doi":"10.1002/jcd.20112","title":"Commuting decompositions of complete graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Prime power; Graph; Discrete mathematics; Adjacency list; Multigraph; Prime (order theory)","score_opus":0.014776714017030023,"score_gpt":0.21460459658773007,"score_spread":0.19982788257070005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964395996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76501405,0.00033777245,0.20218427,0.00019052591,0.0000867282,0.00016872774,0.00044230302,0.00022966237,0.031345934],"genre_scores_gemma":[0.96615815,0.00017884052,0.027773287,0.00008837026,0.00005297836,0.000112170805,0.00046708027,0.000043522075,0.0051255994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992386,0.00015424685,0.00006070567,0.00020601002,0.00020139254,0.00013890922],"domain_scores_gemma":[0.9984717,0.00034838117,0.00029260467,0.00030124868,0.00028102158,0.00030505564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071633304,0.00031969146,0.0003708316,0.0013154373,0.0006409932,0.0011244119,0.00040317109,0.00036571952,0.005284767],"category_scores_gemma":[0.0017819148,0.0003055691,0.00044517132,0.00057844835,0.0010736459,0.0017754921,0.00086379587,0.0006347455,0.00036407445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001392861,0.00008177961,0.001583335,0.00007697048,0.000029613699,0.00042329327,0.00077937415,0.005790505,0.009446666,0.95930654,0.0014515807,0.020891055],"study_design_scores_gemma":[0.000037600676,0.00007213311,0.0011088672,0.000031075822,0.000024417854,0.00032016946,0.00033681295,0.02657733,0.004579473,0.95974225,0.007150702,0.000019326504],"about_ca_topic_score_codex":0.0004917134,"about_ca_topic_score_gemma":0.0006513946,"teacher_disagreement_score":0.005284767,"about_ca_system_score_codex":0.00043742804,"about_ca_system_score_gemma":0.0003276049,"threshold_uncertainty_score":0.017679274},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012701878,0.0014028751,0.7860346,0.0039065983,0.00052863633,0.00016262505,0.0021884167,0.001961323,0.19111308],"genre_scores_gemma":[0.3694645,0.0024823316,0.4999686,0.002152839,0.0006752575,0.0011228246,0.00594533,0.0031937438,0.11499466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964366,0.0008827234,0.00027592684,0.0007413737,0.0010900903,0.000573345],"domain_scores_gemma":[0.9905166,0.0056856526,0.0004710102,0.0015332225,0.0012885253,0.0005050462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031941542,0.001436739,0.00077657524,0.002830568,0.003097103,0.007665247,0.002705227,0.0021110564,0.05083021],"category_scores_gemma":[0.012887056,0.0012338537,0.0016421003,0.0030140178,0.0025270996,0.012533455,0.006424759,0.0071006566,0.01730218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023210125,0.000019039271,0.00008842385,0.00006334409,0.000006803296,0.000031227188,0.00019757716,0.0010849151,0.0005416157,0.9783066,0.010834526,0.008802747],"study_design_scores_gemma":[0.00001363954,0.000016549206,0.00016491613,0.0000792409,0.00001655009,0.0001037004,0.00012197668,0.0077114,0.0020507406,0.93807024,0.05162276,0.000028298276],"about_ca_topic_score_codex":0.0021607196,"about_ca_topic_score_gemma":0.003361979,"teacher_disagreement_score":0.05083021,"about_ca_system_score_codex":0.0045332857,"about_ca_system_score_gemma":0.0016698533,"threshold_uncertainty_score":0.170044},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087843,0.006487411,0.8324038,0.0055740797,0.00068190304,0.00016600406,0.0021806855,0.00079938606,0.06386385],"genre_scores_gemma":[0.61449397,0.0056293323,0.35747164,0.0017295684,0.0013388713,0.0006848186,0.0024359382,0.0009957099,0.015220223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944555,0.0017327176,0.00024898053,0.0010514391,0.0016438876,0.0008674592],"domain_scores_gemma":[0.92999035,0.05834629,0.0023098213,0.004563676,0.003191205,0.0015986029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050211307,0.0033320198,0.002457016,0.0024539137,0.0015427242,0.0060343114,0.004284478,0.002577212,0.015001841],"category_scores_gemma":[0.046713583,0.0018791266,0.0013545152,0.002824569,0.0036808741,0.010221397,0.0040463917,0.0071032317,0.0027446148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019747273,0.00046580125,0.0021152722,0.0012615327,0.00024368073,0.00036886305,0.0005988189,0.3466372,0.02585592,0.49253,0.022946905,0.105001345],"study_design_scores_gemma":[0.00008952892,0.00021188655,0.0009698547,0.00022233446,0.000065823624,0.00029745768,0.00014549284,0.5695942,0.00836858,0.41477308,0.0051852963,0.0000764328],"about_ca_topic_score_codex":0.001186739,"about_ca_topic_score_gemma":0.0026785708,"teacher_disagreement_score":0.015001841,"about_ca_system_score_codex":0.0022450022,"about_ca_system_score_gemma":0.0019289909,"threshold_uncertainty_score":0.050186157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42381644,0.0035111625,0.1886787,0.003720667,0.0011183056,0.00031881663,0.0015444888,0.0019170234,0.37537438],"genre_scores_gemma":[0.83435005,0.0012685637,0.07949318,0.0015654485,0.0004322196,0.00049178995,0.0014493463,0.00062935817,0.08032011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985184,0.00044160296,0.00006970355,0.00036425138,0.0003072835,0.00029865367],"domain_scores_gemma":[0.99547136,0.0023516647,0.00071937917,0.00067705335,0.0004125279,0.0003680749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097537966,0.0019359004,0.0014075106,0.0014784554,0.0023448307,0.0038071496,0.000801283,0.0020142684,0.01791002],"category_scores_gemma":[0.0056727985,0.0012074169,0.000636442,0.0019342152,0.0027182086,0.004318711,0.003336642,0.0019976841,0.00509402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006809997,0.00009798922,0.0013388436,0.00030113687,0.0000549063,0.0005327439,0.0007492698,0.0030353733,0.01953203,0.9238375,0.011219589,0.03861964],"study_design_scores_gemma":[0.00018098732,0.00018284189,0.0011456668,0.000113650545,0.000055451008,0.0013588648,0.00065817934,0.009308246,0.02961623,0.90137833,0.05590982,0.00009175167],"about_ca_topic_score_codex":0.00020321218,"about_ca_topic_score_gemma":0.00048511397,"teacher_disagreement_score":0.01791002,"about_ca_system_score_codex":0.0007382839,"about_ca_system_score_gemma":0.0008033254,"threshold_uncertainty_score":0.059915006},"labels":[],"label_agreement":null},{"id":"W1967788202","doi":"10.1002/jcd.20144","title":"On the spectrum of critical sets in latin squares of order 2<sup><i>n</i></sup>","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Circulant matrix; Mathematics; Combinatorics; Order (exchange); Square (algebra); Abelian group; Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.01674029674862886,"score_gpt":0.24787666359341357,"score_spread":0.2311363668447847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967788202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9211074,0.000308957,0.061823912,0.00016777881,0.000034052704,0.000032253032,0.000113389135,0.000095665055,0.016316487],"genre_scores_gemma":[0.9882621,0.00008956857,0.010345179,0.000041958247,0.000033087857,0.000050626953,0.00012736891,0.000029782408,0.0010201798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950147,0.0001009231,0.000032784934,0.000096040545,0.00015939391,0.00010941869],"domain_scores_gemma":[0.99655473,0.0020980537,0.00054316525,0.00022280747,0.00031454317,0.0002667203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056793407,0.00032173426,0.00042443912,0.0021216746,0.0012918125,0.0015862559,0.00040929386,0.0004744281,0.0033205338],"category_scores_gemma":[0.0035082246,0.00036313577,0.00034022267,0.0006452485,0.0020674022,0.0015688101,0.0011308177,0.00049001194,0.00023111212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068900886,0.00015496173,0.008823961,0.00014115564,0.000042838015,0.0014667419,0.0016784378,0.029458864,0.048013426,0.876876,0.00272977,0.029924886],"study_design_scores_gemma":[0.00009446901,0.00021927136,0.0056996597,0.000099945064,0.000031723892,0.0013837591,0.00128263,0.11806917,0.03348087,0.83283764,0.0067295725,0.000071298084],"about_ca_topic_score_codex":0.0007369979,"about_ca_topic_score_gemma":0.0005509079,"teacher_disagreement_score":0.0033205338,"about_ca_system_score_codex":0.00081052247,"about_ca_system_score_gemma":0.00033191248,"threshold_uncertainty_score":0.011108339},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48908535,0.0006598742,0.20502649,0.0012454872,0.0009811069,0.00011001207,0.00060146843,0.0005936786,0.30169642],"genre_scores_gemma":[0.8999985,0.00038341415,0.050684523,0.0004327478,0.00013833687,0.00008083305,0.0005080262,0.00013115043,0.047642455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996898,0.00008330318,0.00001584456,0.00005975998,0.00009029221,0.000060903378],"domain_scores_gemma":[0.99947685,0.00010779508,0.000056147695,0.00015147016,0.000086961,0.00012079202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001780919,0.0005138901,0.0006718756,0.0008551283,0.0010216234,0.0014763037,0.0009562902,0.0013101527,0.017539335],"category_scores_gemma":[0.00091792195,0.00036113017,0.00051835633,0.0008585855,0.00074226625,0.0017708594,0.0016424616,0.0016430349,0.0021418487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030497718,0.00009074013,0.00059492455,0.00017856198,0.000036878933,0.0008450529,0.00020472545,0.025755668,0.013337319,0.91204214,0.007006139,0.03960285],"study_design_scores_gemma":[0.000103206105,0.00014885083,0.001102961,0.00005429764,0.00003967915,0.0017610774,0.00041740816,0.13080227,0.007824809,0.8316605,0.026029903,0.000055088778],"about_ca_topic_score_codex":0.00022582464,"about_ca_topic_score_gemma":0.00043403413,"teacher_disagreement_score":0.017539335,"about_ca_system_score_codex":0.00043974823,"about_ca_system_score_gemma":0.00028343173,"threshold_uncertainty_score":0.058674872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30738088,0.005502046,0.49618736,0.0116652455,0.00054351037,0.00021156538,0.0007943449,0.00024873592,0.17746635],"genre_scores_gemma":[0.88057506,0.0036373998,0.06818439,0.0008631474,0.00053074677,0.00013134624,0.0005200089,0.00011944747,0.04543835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926203,0.00022959,0.000029275405,0.00015731918,0.00015177159,0.00017003156],"domain_scores_gemma":[0.9973546,0.001697554,0.00024250244,0.00021730253,0.00023853433,0.00024953522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083782175,0.00048365194,0.00092119176,0.0009473717,0.0014913625,0.002493081,0.0016672275,0.0033077113,0.011505942],"category_scores_gemma":[0.0071612564,0.0005558663,0.0006355746,0.0020366798,0.0021744727,0.0048484453,0.0014849607,0.0018019385,0.000698443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058844027,0.000024721521,0.00021859037,0.00007357488,0.000014931589,0.00016346014,0.0001299444,0.011589475,0.00029611628,0.97097576,0.0058143167,0.010640269],"study_design_scores_gemma":[0.000026198752,0.0000063206157,0.000072897536,0.000012727803,0.0000057244047,0.00005525306,0.0001019911,0.03133669,0.00014878671,0.96505064,0.0031740773,0.000008749627],"about_ca_topic_score_codex":0.012094094,"about_ca_topic_score_gemma":0.008999018,"teacher_disagreement_score":0.012094094,"about_ca_system_score_codex":0.0015460881,"about_ca_system_score_gemma":0.0014151023,"threshold_uncertainty_score":0.03849119},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044092663,0.00045179183,0.93011135,0.0005981081,0.00014829493,0.00022513854,0.0006112481,0.0002695645,0.023491835],"genre_scores_gemma":[0.57458895,0.0009159549,0.4063438,0.00072533666,0.0002917263,0.0012906328,0.0006095697,0.00023781683,0.0149962455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99505424,0.0023974618,0.00024649137,0.00066240376,0.0012089614,0.00043045098],"domain_scores_gemma":[0.9909548,0.004640416,0.0011143388,0.0015207018,0.0012662656,0.0005035195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029207212,0.0017743744,0.0018257067,0.0015188647,0.0008430094,0.002479776,0.0016839787,0.0020117364,0.0083576],"category_scores_gemma":[0.013548761,0.0011948625,0.00069365505,0.0017671543,0.0012909743,0.0021660342,0.0029162506,0.0014805221,0.0024658216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000623428,0.00009510571,0.0006018363,0.0002871689,0.00009264785,0.0001062131,0.00011438531,0.05632145,0.013947441,0.867121,0.004312626,0.056376718],"study_design_scores_gemma":[0.00049237296,0.000638508,0.00041616,0.00014954295,0.000084853695,0.00035256715,0.00007378969,0.14660311,0.009010015,0.8301006,0.012019874,0.00005863199],"about_ca_topic_score_codex":0.00030484772,"about_ca_topic_score_gemma":0.00047503674,"teacher_disagreement_score":0.0083576,"about_ca_system_score_codex":0.0010906646,"about_ca_system_score_gemma":0.0013026232,"threshold_uncertainty_score":0.02795899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91040856,0.00097431097,0.05834718,0.001007368,0.00031088386,0.000028181035,0.00029348963,0.0009205055,0.027709493],"genre_scores_gemma":[0.9927489,0.00015419003,0.0051715183,0.000075976786,0.000062900945,0.000015010636,0.00014963435,0.00011378045,0.001508022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995889,0.00010882101,0.000017245593,0.00010392294,0.00011670294,0.00006440874],"domain_scores_gemma":[0.9936661,0.003597068,0.00064354076,0.00075135456,0.0006133,0.00072852365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503339,0.00034004418,0.00051872333,0.0022362692,0.0009603433,0.0020469928,0.0008170277,0.0013240057,0.005070685],"category_scores_gemma":[0.013894067,0.0005478489,0.00027276168,0.0011435335,0.0012700913,0.0020658288,0.0007979692,0.0015143155,0.0005172473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032501054,0.00016481763,0.007668208,0.00025200302,0.000064143795,0.0008945435,0.000718264,0.044642586,0.03881432,0.86441374,0.009046571,0.032995813],"study_design_scores_gemma":[0.00005029123,0.000091593465,0.0060344907,0.00006658606,0.00003992065,0.0013849228,0.00034967874,0.23962724,0.010295843,0.73611337,0.0058745127,0.000071576476],"about_ca_topic_score_codex":0.00042625683,"about_ca_topic_score_gemma":0.0004645541,"teacher_disagreement_score":0.005070685,"about_ca_system_score_codex":0.0006701512,"about_ca_system_score_gemma":0.0003523469,"threshold_uncertainty_score":0.016963124},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01577146,0.00042452657,0.17808913,0.0043016495,0.0015327535,0.000310747,0.003595959,0.0010286515,0.7949452],"genre_scores_gemma":[0.47907537,0.0014351413,0.10117747,0.00463442,0.001097771,0.00076596066,0.007030872,0.0027136016,0.40206936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782616,0.00036151873,0.00016911287,0.0004625214,0.0007056626,0.00047504093],"domain_scores_gemma":[0.9962496,0.0010450731,0.00018714019,0.0005622728,0.0016115017,0.00034442384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012395751,0.00078759843,0.0009331218,0.0012435534,0.0026652035,0.004479585,0.0012664383,0.0017171842,0.1304272],"category_scores_gemma":[0.007810795,0.0004640918,0.0007346576,0.0013147151,0.0020390248,0.00745295,0.0017927445,0.0038686963,0.026019568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010659997,0.00005757601,0.00025804562,0.00008692009,0.000005593546,0.00016143141,0.00011450029,0.0004340463,0.0013954438,0.9326999,0.04654484,0.018135047],"study_design_scores_gemma":[0.00007270656,0.00006931333,0.00064912374,0.00011661713,0.0000147982055,0.0006067455,0.00026736088,0.0056831967,0.005177315,0.8605118,0.12677568,0.000055309483],"about_ca_topic_score_codex":0.005561208,"about_ca_topic_score_gemma":0.0074201217,"teacher_disagreement_score":0.1304272,"about_ca_system_score_codex":0.0015367081,"about_ca_system_score_gemma":0.0027131,"threshold_uncertainty_score":0.43632245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7996196,0.00072095136,0.13167821,0.0006843778,0.000115190225,0.00006268377,0.00044284304,0.00026685777,0.06640924],"genre_scores_gemma":[0.9703782,0.00045686218,0.017951101,0.00015599685,0.000088381305,0.0000558492,0.00038665198,0.00013506816,0.010391944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943346,0.00012842723,0.00003226307,0.00012042205,0.000115276875,0.00017001078],"domain_scores_gemma":[0.9972024,0.0013132681,0.000453154,0.000460935,0.00021191819,0.00035825936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000633388,0.0005591393,0.00095521443,0.0017358003,0.001673729,0.0030052927,0.0011085576,0.0010634334,0.0077486997],"category_scores_gemma":[0.002850941,0.0007249456,0.0006337358,0.002337253,0.0018663496,0.0038398688,0.001567652,0.0020947075,0.0006909947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021521725,0.000045028813,0.001212762,0.00007151554,0.000017847182,0.00019042386,0.0005358734,0.010169484,0.007036961,0.9658942,0.0023200742,0.012290539],"study_design_scores_gemma":[0.000028484483,0.000025994648,0.0010059299,0.000019698098,0.000023877015,0.0002021927,0.00017845469,0.03178143,0.0027659182,0.961171,0.0027766747,0.000020298667],"about_ca_topic_score_codex":0.0020553137,"about_ca_topic_score_gemma":0.0033588682,"teacher_disagreement_score":0.0077486997,"about_ca_system_score_codex":0.0016761012,"about_ca_system_score_gemma":0.00060301065,"threshold_uncertainty_score":0.02592194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15192892,0.001971916,0.81091416,0.0007736043,0.00024271237,0.00043821754,0.0005636188,0.0058432072,0.02732369],"genre_scores_gemma":[0.26481184,0.0006497468,0.72783226,0.00023147515,0.000051999843,0.00026836523,0.0009240044,0.0004991288,0.004731176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981304,0.0006399908,0.00011914572,0.00029549855,0.00043895745,0.00037607804],"domain_scores_gemma":[0.9927879,0.0043305075,0.00039351362,0.0015658273,0.0006446041,0.00027760377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019242595,0.001126178,0.0014578841,0.0021500252,0.0017499394,0.0017986952,0.0025930824,0.0018184936,0.0061232075],"category_scores_gemma":[0.009974643,0.000481582,0.0010659914,0.003933654,0.00087822735,0.0025581561,0.0017987167,0.0014925963,0.0011906248],"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.0008601913,0.00070368714,0.0021476652,0.0004082401,0.00012603475,0.000102973856,0.0002720874,0.4184105,0.003653448,0.05854935,0.009488597,0.5052772],"study_design_scores_gemma":[0.000121693025,0.000083814455,0.00044222688,0.000031179676,0.000033044013,0.000071882954,0.00011113793,0.97356117,0.0018768967,0.020664431,0.002984276,0.000018263141],"about_ca_topic_score_codex":0.013422533,"about_ca_topic_score_gemma":0.018746391,"teacher_disagreement_score":0.013422533,"about_ca_system_score_codex":0.0028505153,"about_ca_system_score_gemma":0.0061239013,"threshold_uncertainty_score":0.026688755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7334613,0.0006974213,0.1256548,0.0009551074,0.00015873568,0.000099719415,0.0010559132,0.00061050954,0.13730654],"genre_scores_gemma":[0.9664346,0.00042520376,0.012563811,0.00012156904,0.000092003036,0.00006945502,0.00078170886,0.00013745316,0.019374054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895847,0.000113142516,0.00004792798,0.00027117803,0.00030453797,0.00030480907],"domain_scores_gemma":[0.9975,0.0013299908,0.00024927166,0.00029411263,0.00024854575,0.0003781808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042190013,0.00072865677,0.0012623348,0.0022149486,0.0025234374,0.005120563,0.0008841892,0.0010413775,0.010613103],"category_scores_gemma":[0.0020968495,0.0010683795,0.0012139371,0.0017390455,0.002690753,0.00456132,0.0025326381,0.0026751296,0.0012433679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016103502,0.00007449015,0.0010559087,0.00007386444,0.000044556473,0.0003704381,0.00054761046,0.0032686032,0.0029585816,0.98130006,0.0015598891,0.008584894],"study_design_scores_gemma":[0.00005033552,0.00005046698,0.0013262243,0.0000406568,0.000054659326,0.00062388275,0.00061996345,0.0125265205,0.0034763105,0.9723111,0.008882422,0.00003751178],"about_ca_topic_score_codex":0.0014003855,"about_ca_topic_score_gemma":0.0015079344,"teacher_disagreement_score":0.010613103,"about_ca_system_score_codex":0.0014048879,"about_ca_system_score_gemma":0.00039537103,"threshold_uncertainty_score":0.0355044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11122339,0.00054519216,0.8790629,0.00071409624,0.0001032493,0.00007900222,0.000052798692,0.00013715695,0.008082157],"genre_scores_gemma":[0.74585855,0.00037590932,0.24523446,0.00026178747,0.00007906383,0.00017504145,0.0000911866,0.00008362966,0.007840349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997491,0.00012139804,0.000007510813,0.000025706964,0.00005371518,0.000042537453],"domain_scores_gemma":[0.9993538,0.00045301352,0.000038365204,0.000019839514,0.00010270176,0.00003221598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084638706,0.0005847954,0.00072949816,0.0008349415,0.00049456506,0.00063743023,0.00096540543,0.0012786174,0.0021678053],"category_scores_gemma":[0.0023334625,0.0004836962,0.00044803534,0.0007348582,0.0007041331,0.0006307034,0.0005429959,0.00069680315,0.00014350447],"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.000014674504,0.00001836818,0.00023714933,0.0000126024925,0.000016477305,0.000020348327,0.000026362968,0.98191077,0.00031932848,0.005068629,0.00031127862,0.012044006],"study_design_scores_gemma":[0.000007303542,0.000010062427,0.00005719475,0.0000022600345,0.0000047742237,0.000005384052,0.000008311479,0.99640095,0.0000962454,0.003242042,0.00016387313,0.0000016851898],"about_ca_topic_score_codex":0.00710256,"about_ca_topic_score_gemma":0.0062455162,"teacher_disagreement_score":0.00710256,"about_ca_system_score_codex":0.0010646381,"about_ca_system_score_gemma":0.0007947229,"threshold_uncertainty_score":0.0141224265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13920088,0.00073941646,0.85412097,0.00020150312,0.00009240965,0.000081203325,0.00001861142,0.00048204264,0.005062888],"genre_scores_gemma":[0.87350327,0.00049297774,0.12289708,0.000079739024,0.000086382555,0.00006530006,0.000028868575,0.000026980188,0.0028193772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996145,0.00011297747,0.000017317563,0.00006991928,0.00014389175,0.000041353058],"domain_scores_gemma":[0.99944276,0.00029370934,0.000079281526,0.000065699736,0.000087367094,0.00003130325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043741445,0.0005715501,0.00044461727,0.00038219918,0.00039276524,0.0005526809,0.0006452934,0.0005007646,0.0008735708],"category_scores_gemma":[0.0010084517,0.00016874704,0.0002620184,0.0003304793,0.0004875078,0.0009943817,0.00046182945,0.00035630187,0.00019459536],"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.0006638577,0.00034882632,0.002972878,0.0004990996,0.0001337903,0.0007896153,0.0004970196,0.369417,0.16522911,0.057006914,0.0013243635,0.40111762],"study_design_scores_gemma":[0.000091211725,0.00028206737,0.0005057829,0.000022702401,0.00006199869,0.00029909314,0.000030264137,0.9670516,0.019922212,0.008186778,0.0035187646,0.000027459588],"about_ca_topic_score_codex":0.0006651391,"about_ca_topic_score_gemma":0.00072048575,"teacher_disagreement_score":0.0008735708,"about_ca_system_score_codex":0.00031387698,"about_ca_system_score_gemma":0.0002855057,"threshold_uncertainty_score":0.0029223561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8129715,0.00034638727,0.17390136,0.00037992003,0.00020344673,0.000089395384,0.000033759043,0.00052645005,0.011547877],"genre_scores_gemma":[0.96652335,0.000115177245,0.032110315,0.000052316384,0.000021668135,0.000022117489,0.000015157094,0.000021296546,0.0011185352],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997166,0.00006717055,0.000008665899,0.000024001887,0.00014549062,0.000037994094],"domain_scores_gemma":[0.99917346,0.0004362911,0.00011224348,0.0001287618,0.00011326372,0.00003596996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037560274,0.0003504219,0.00014492855,0.00030424382,0.00049440475,0.00053391187,0.00033405877,0.000486918,0.0008659364],"category_scores_gemma":[0.0009905169,0.00010735325,0.00011283771,0.00027799254,0.0008355081,0.0006868918,0.000528101,0.00050573196,0.0002514053],"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.00035171735,0.00021737312,0.0013588748,0.000107723514,0.00001788974,0.00035816696,0.00031208398,0.0155324,0.871271,0.055451553,0.0007841935,0.054237038],"study_design_scores_gemma":[0.00003237039,0.000505575,0.00042693497,0.000013647411,0.000022423019,0.00019461467,0.000062008614,0.09993323,0.88695943,0.008335761,0.003480447,0.000033588083],"about_ca_topic_score_codex":0.00030238126,"about_ca_topic_score_gemma":0.00038303027,"teacher_disagreement_score":0.0008659364,"about_ca_system_score_codex":0.0002637405,"about_ca_system_score_gemma":0.00024967897,"threshold_uncertainty_score":0.0028968453},"labels":[],"label_agreement":null},{"id":"W1970963182","doi":"10.1002/jcd.10060","title":"Super‐simple resolvable balanced incomplete block designs with block size 4 and index 3","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Simple (philosophy); Block size; Block design; Index (typography); Discrete mathematics; Computer science; Key (lock)","score_opus":0.013758034569920165,"score_gpt":0.2069027847097385,"score_spread":0.19314475013981833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970963182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42139342,0.00030466536,0.5449189,0.00022496484,0.00006946181,0.00023314157,0.0006633717,0.0005056219,0.031686526],"genre_scores_gemma":[0.83656883,0.00020669446,0.15664254,0.00009742561,0.000044381293,0.00022058818,0.0005644981,0.000043758944,0.005611354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902976,0.00028254258,0.0000842482,0.00011955176,0.0003191822,0.0001647869],"domain_scores_gemma":[0.9972651,0.0006455353,0.0008045425,0.0007009983,0.00041341278,0.00017053391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081153604,0.00059851474,0.00073642394,0.0007004958,0.0004390244,0.0009903305,0.0007941463,0.00060310756,0.0055067562],"category_scores_gemma":[0.0021832003,0.00045811088,0.00049185427,0.00061518303,0.00048604386,0.0010649617,0.0008826043,0.00053282647,0.0012996633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031076856,0.0002601099,0.0034090115,0.0005453414,0.00026614798,0.0006504081,0.00024836065,0.109278545,0.3025534,0.41003603,0.0034021132,0.16624291],"study_design_scores_gemma":[0.0012044974,0.0026058862,0.0027744118,0.00018342472,0.00024558144,0.0014675916,0.00014950658,0.46757814,0.204743,0.2901536,0.028729666,0.00016472448],"about_ca_topic_score_codex":0.00042775722,"about_ca_topic_score_gemma":0.0012480221,"teacher_disagreement_score":0.0055067562,"about_ca_system_score_codex":0.000468586,"about_ca_system_score_gemma":0.0007233456,"threshold_uncertainty_score":0.018421948},"labels":[],"label_agreement":null},{"id":"W1971473039","doi":"10.1002/jcd.20033","title":"Quasi‐embeddings of Steiner triple systems, or Steiner triple systems of different orders with maximum intersection","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Order (exchange); Intersection (aeronautics); Steiner system; Generalization; Prime (order theory); Recursion (computer science); Discrete mathematics; Mathematical analysis; Algorithm","score_opus":0.01459643275759967,"score_gpt":0.2186255622253785,"score_spread":0.20402912946777882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971473039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75400966,0.0006412902,0.1833064,0.00076120533,0.00020256176,0.000070204245,0.00038022408,0.00034653224,0.060281772],"genre_scores_gemma":[0.95716465,0.000215564,0.036248885,0.00011567892,0.00007096794,0.00006199504,0.00041684724,0.00009710497,0.0056083435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991505,0.00019657472,0.00008051155,0.0001675023,0.00023183909,0.00017315394],"domain_scores_gemma":[0.99781406,0.00070344406,0.00042532544,0.00040842377,0.00029584867,0.00035289096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008362445,0.0004017634,0.00047674007,0.00095375255,0.0012194599,0.0019999042,0.00076190894,0.0008072262,0.010343888],"category_scores_gemma":[0.0029721316,0.0005914958,0.00071613,0.00090846623,0.0021469442,0.005189792,0.0018291014,0.001545214,0.00082509284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013304538,0.000026930697,0.0009689829,0.00008151025,0.000012091222,0.0001290758,0.00034839928,0.004887125,0.003534684,0.97833955,0.0010107771,0.010527804],"study_design_scores_gemma":[0.000057253445,0.00017243004,0.0013667222,0.0000670952,0.000024921414,0.00044618952,0.0009559091,0.033818346,0.007884871,0.9394936,0.015666686,0.000045885605],"about_ca_topic_score_codex":0.0004540722,"about_ca_topic_score_gemma":0.0006055514,"teacher_disagreement_score":0.010343888,"about_ca_system_score_codex":0.0010432587,"about_ca_system_score_gemma":0.0003935709,"threshold_uncertainty_score":0.034603715},"labels":[],"label_agreement":null},{"id":"W1971646571","doi":"10.1002/jcd.10031","title":"New type of block design","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Equivalence (formal languages); Block (permutation group theory); Type (biology); Combinatorics; Class (philosophy); Difference set; Discrete mathematics; Arithmetic; Computer science; Artificial intelligence; Abelian group","score_opus":0.046615365826622866,"score_gpt":0.22926837539136305,"score_spread":0.18265300956474018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971646571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043850236,0.00055458915,0.9118068,0.0003456485,0.0003561774,0.00020826426,0.00034838374,0.00043435275,0.042095542],"genre_scores_gemma":[0.60489696,0.0005736086,0.3641668,0.000804452,0.00025287797,0.0006114039,0.00055373344,0.00015498686,0.027985204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971253,0.0011455396,0.0001728892,0.00047452282,0.0008214257,0.00026044715],"domain_scores_gemma":[0.9957616,0.0014253356,0.00038284578,0.0013211821,0.00088498025,0.00022421624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020288697,0.00041388918,0.00055806834,0.00077272154,0.00056138006,0.0012494338,0.0009800526,0.0009178293,0.010329557],"category_scores_gemma":[0.0048440117,0.0003242528,0.000608331,0.0007204037,0.0010538548,0.0019273307,0.0013458142,0.0011663396,0.0016240599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005019528,0.0001246645,0.0013445596,0.00024840987,0.000065852764,0.00011622279,0.00019202568,0.014940798,0.016553968,0.8414269,0.0039738305,0.1205107],"study_design_scores_gemma":[0.00029400343,0.0013193144,0.0015208019,0.00015077413,0.00011007331,0.0010380036,0.00009759062,0.13968056,0.027315298,0.7176626,0.11070543,0.00010550544],"about_ca_topic_score_codex":0.00035383826,"about_ca_topic_score_gemma":0.00050721044,"teacher_disagreement_score":0.010329557,"about_ca_system_score_codex":0.0008554025,"about_ca_system_score_gemma":0.0006983947,"threshold_uncertainty_score":0.034555793},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45667174,0.001016317,0.30917883,0.00285205,0.0012955773,0.00025268146,0.00047453653,0.00061542646,0.22764283],"genre_scores_gemma":[0.89138687,0.00035769938,0.06646933,0.00067414244,0.00087677647,0.00016819913,0.00025831826,0.00014426885,0.03966451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982495,0.00043414353,0.000087823486,0.0002571568,0.0005566386,0.000414707],"domain_scores_gemma":[0.9967788,0.0010215173,0.00044695783,0.00044214766,0.0006594493,0.0006511787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012420339,0.0009778575,0.0009302536,0.0029385262,0.0026886822,0.0039967666,0.0011862603,0.0013769515,0.008185424],"category_scores_gemma":[0.004098977,0.0007176997,0.00094587094,0.0017230625,0.0038589728,0.0035051054,0.0018613064,0.0027977964,0.0013894784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050307342,0.000025833348,0.000068950714,0.000015707707,0.0000042131423,0.00010823103,0.00012032869,0.00040431513,0.0012142931,0.9950498,0.00075781334,0.002180271],"study_design_scores_gemma":[0.000026430087,0.00003256964,0.000121669575,0.000009660253,0.000005892223,0.00025222232,0.00008004894,0.0044140816,0.0014893917,0.9905715,0.0029722527,0.00002429797],"about_ca_topic_score_codex":0.0006112919,"about_ca_topic_score_gemma":0.0006156869,"teacher_disagreement_score":0.008185424,"about_ca_system_score_codex":0.0010560518,"about_ca_system_score_gemma":0.0009721103,"threshold_uncertainty_score":0.02738297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6460679,0.0010925771,0.26418933,0.0030786581,0.00031093284,0.00015065326,0.000587798,0.0006372411,0.08388485],"genre_scores_gemma":[0.9287795,0.0003542664,0.061424177,0.00044767035,0.00012818401,0.00018594081,0.00019213816,0.00005212226,0.008436075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980769,0.0006327331,0.00013102779,0.0003743889,0.0004936663,0.00029126173],"domain_scores_gemma":[0.99259526,0.0043782047,0.0013640578,0.00071013515,0.00052131736,0.0004309803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023883237,0.0006574663,0.0006530119,0.0015329103,0.0021283631,0.0029513848,0.0010322133,0.002040709,0.0042150836],"category_scores_gemma":[0.012755128,0.0012113203,0.0005868392,0.0012823072,0.0025587403,0.0027031102,0.0022868346,0.001395206,0.0007955661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004642045,0.000048658396,0.0012447832,0.00013040788,0.000033629716,0.00019301692,0.00038709005,0.005619942,0.008860938,0.9646234,0.0015949119,0.016799016],"study_design_scores_gemma":[0.00023102394,0.0002014971,0.00072513364,0.00009278121,0.000037712107,0.00083705044,0.00014671533,0.027192008,0.008950287,0.95531255,0.006189214,0.000084060266],"about_ca_topic_score_codex":0.00046979237,"about_ca_topic_score_gemma":0.0005275005,"teacher_disagreement_score":0.0042150836,"about_ca_system_score_codex":0.0013654603,"about_ca_system_score_gemma":0.0016151291,"threshold_uncertainty_score":0.014100909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08648744,0.0037469892,0.829041,0.0020570322,0.00088779244,0.00008834382,0.0008081789,0.00046018066,0.076423064],"genre_scores_gemma":[0.8241267,0.0035454268,0.13041674,0.0011535988,0.0011477564,0.00018153459,0.0006279046,0.000120183664,0.03868016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993395,0.00024338558,0.000025685331,0.00012921882,0.0001909583,0.00007121212],"domain_scores_gemma":[0.997463,0.0011381453,0.00033265728,0.000339045,0.00061602466,0.000111062975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005998845,0.0008009097,0.00074333756,0.0018090163,0.00087743066,0.0019263881,0.0007494243,0.0010689416,0.007734905],"category_scores_gemma":[0.00355956,0.00033887103,0.0003623264,0.0026624873,0.0014522299,0.0015195915,0.0005420708,0.0012032372,0.0010125012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034302728,0.000030271993,0.0001421155,0.00005274884,0.000011949016,0.00010268951,0.000081011276,0.0103583895,0.0026240635,0.97114223,0.0023680849,0.0130523145],"study_design_scores_gemma":[0.0000166937,0.000044542274,0.00031017963,0.000033288226,0.000012399366,0.0002502617,0.000059228747,0.10924308,0.0024211234,0.8758579,0.011694074,0.00005714467],"about_ca_topic_score_codex":0.0014067033,"about_ca_topic_score_gemma":0.0016533211,"teacher_disagreement_score":0.007734905,"about_ca_system_score_codex":0.00082555646,"about_ca_system_score_gemma":0.0009227453,"threshold_uncertainty_score":0.025875807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21181971,0.0007288187,0.75252044,0.0008149743,0.00053285575,0.0003156235,0.0003505803,0.0009208244,0.031996187],"genre_scores_gemma":[0.7064183,0.00031426136,0.2754202,0.0005131042,0.00020880954,0.00033526664,0.00020070544,0.00010306759,0.016486352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983367,0.0007160832,0.000091490096,0.00025648094,0.00040754525,0.0001917156],"domain_scores_gemma":[0.9965581,0.00085469545,0.00045356745,0.0014098536,0.00054274773,0.00018094308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011729492,0.0009025928,0.0007756626,0.0008282796,0.000584165,0.0011189262,0.0010698437,0.0010411716,0.006672745],"category_scores_gemma":[0.0034564,0.0003830704,0.0004465073,0.00089072186,0.0008267813,0.0010282315,0.001073205,0.00086184125,0.0014072788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037255343,0.00025010647,0.0015153409,0.0003494593,0.00017730724,0.00043776206,0.00036181818,0.04329444,0.12369788,0.6330786,0.004499709,0.18861197],"study_design_scores_gemma":[0.0012319686,0.0026844435,0.001678624,0.00019717889,0.0003243532,0.0013167562,0.00013944737,0.3278839,0.09904516,0.5082436,0.057038497,0.00021610188],"about_ca_topic_score_codex":0.00032294285,"about_ca_topic_score_gemma":0.0007211579,"teacher_disagreement_score":0.006672745,"about_ca_system_score_codex":0.0008638243,"about_ca_system_score_gemma":0.00077166554,"threshold_uncertainty_score":0.022322536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6650614,0.00057531346,0.22753194,0.0019334712,0.00022816168,0.00019319875,0.0011774341,0.0007614809,0.10253753],"genre_scores_gemma":[0.91908187,0.00044892344,0.055377383,0.00040496365,0.000069721886,0.00025115526,0.0008133951,0.00018221488,0.02337049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908483,0.00020282321,0.000046289708,0.00020596947,0.00016291444,0.00029717106],"domain_scores_gemma":[0.9965395,0.0018433597,0.00037857026,0.00029527355,0.00041427425,0.0005291072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008525728,0.0006769284,0.0010906133,0.0014492177,0.0025406713,0.004677722,0.0013759126,0.0020222226,0.011631327],"category_scores_gemma":[0.0056716474,0.0011843279,0.0009091686,0.0010486726,0.0017809101,0.003067675,0.0031525553,0.002470017,0.0015891576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021349064,0.000066802415,0.00058239186,0.000090409616,0.000028351496,0.00016161769,0.0002584176,0.0029093183,0.00497118,0.9806192,0.0028967895,0.0072020567],"study_design_scores_gemma":[0.00017027245,0.00009905986,0.0008142716,0.00006507566,0.000045999288,0.0004950348,0.00038869222,0.026075076,0.0071204775,0.95660067,0.008081761,0.000043632106],"about_ca_topic_score_codex":0.0007484972,"about_ca_topic_score_gemma":0.0008664263,"teacher_disagreement_score":0.011631327,"about_ca_system_score_codex":0.0011698089,"about_ca_system_score_gemma":0.0015391337,"threshold_uncertainty_score":0.038910687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22510317,0.00080610724,0.7239157,0.0006721268,0.0003796285,0.00023301429,0.00033096285,0.0005138279,0.0480454],"genre_scores_gemma":[0.86575,0.0003616388,0.12080294,0.00027073512,0.00012967412,0.00036214443,0.0003103067,0.000095063704,0.011917578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923277,0.00033010214,0.00004715721,0.00012105633,0.00016759454,0.00010125406],"domain_scores_gemma":[0.99693704,0.0019778528,0.00022618502,0.0004165648,0.00028694,0.00015554337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089333626,0.00041219627,0.0008806679,0.0011721943,0.0011792055,0.0018086806,0.000732834,0.0014957943,0.0063124737],"category_scores_gemma":[0.005256592,0.00051879947,0.0004889796,0.0010143206,0.0012777202,0.0017168395,0.0013623552,0.0010728013,0.00065544236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072313655,0.00003691518,0.00021723047,0.00009612802,0.000012476298,0.00007367537,0.00012053934,0.017905273,0.0038507907,0.9636963,0.0010788691,0.012839617],"study_design_scores_gemma":[0.000072494884,0.000070942624,0.00019723545,0.000043679942,0.000020669379,0.00012015783,0.00007621048,0.1334339,0.002036385,0.8592226,0.00468204,0.000023761264],"about_ca_topic_score_codex":0.0003822367,"about_ca_topic_score_gemma":0.00061566697,"teacher_disagreement_score":0.0063124737,"about_ca_system_score_codex":0.00084890425,"about_ca_system_score_gemma":0.0007984666,"threshold_uncertainty_score":0.02111727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55732363,0.0012351051,0.38575402,0.0027674895,0.0008274152,0.00009669921,0.0010439154,0.00052465935,0.05042702],"genre_scores_gemma":[0.9511506,0.0009127296,0.02748299,0.00030819097,0.00044631102,0.00006919172,0.0004740926,0.00012417225,0.019031737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995472,0.000112464106,0.000020905336,0.00009266541,0.00014717042,0.00007962899],"domain_scores_gemma":[0.9975177,0.00097452576,0.00054260547,0.00014177231,0.00049942365,0.00032399062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815981,0.0006310464,0.00037800838,0.002246343,0.00057379104,0.0019338081,0.0005733299,0.00086681603,0.00463908],"category_scores_gemma":[0.0038083927,0.0002317178,0.00024036106,0.0012084553,0.0016771395,0.0024840082,0.0007811416,0.001362531,0.0010557546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016025911,0.00005053956,0.00092215714,0.000079449856,0.000009455753,0.00027801743,0.00030642847,0.006532439,0.011635978,0.95286036,0.0032901198,0.023874737],"study_design_scores_gemma":[0.000023646882,0.00013337402,0.0012352504,0.00003852056,0.000010091761,0.0007840161,0.00017990913,0.06712507,0.005403019,0.9177441,0.0072535994,0.00006943666],"about_ca_topic_score_codex":0.00074869127,"about_ca_topic_score_gemma":0.00050337805,"teacher_disagreement_score":0.00463908,"about_ca_system_score_codex":0.0007555618,"about_ca_system_score_gemma":0.0012378232,"threshold_uncertainty_score":0.015519321},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12661561,0.0027849425,0.2509003,0.01050942,0.007739851,0.0002063097,0.0015512368,0.00086611777,0.5988262],"genre_scores_gemma":[0.68724823,0.0033878142,0.13630387,0.005912709,0.0022285606,0.00033348854,0.0015029105,0.0007645578,0.16231784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991812,0.00022549168,0.00005875944,0.00016875587,0.00020036145,0.00016546232],"domain_scores_gemma":[0.99858224,0.0006185147,0.00010617389,0.0003205009,0.00021055316,0.00016203099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007081871,0.0006446215,0.0013195084,0.0012634414,0.0028500247,0.0029178842,0.0014374377,0.0018077656,0.012411236],"category_scores_gemma":[0.0029822206,0.000541711,0.0014873368,0.0020069468,0.0021804275,0.0038432777,0.002596411,0.0040590405,0.0021273051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002914321,0.0000066580415,0.000068359004,0.000024528947,0.0000037191057,0.000061018578,0.000076199576,0.00027453058,0.00038908306,0.9910739,0.004107802,0.0038852077],"study_design_scores_gemma":[0.00001356697,0.000013647271,0.00007885365,0.000020872867,0.000009038826,0.00018569556,0.000059497397,0.0017802741,0.00046019917,0.9711949,0.026170164,0.00001313854],"about_ca_topic_score_codex":0.0015309768,"about_ca_topic_score_gemma":0.001514087,"teacher_disagreement_score":0.012411236,"about_ca_system_score_codex":0.001533447,"about_ca_system_score_gemma":0.001033236,"threshold_uncertainty_score":0.0415197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34538162,0.0015910971,0.6322761,0.0004229143,0.00029921383,0.00015076931,0.000071204995,0.0008261949,0.018980917],"genre_scores_gemma":[0.69779944,0.0007241932,0.2949186,0.00020977655,0.00010342698,0.000052415788,0.000057001027,0.000035870675,0.0060993354],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998679,0.000021815918,0.0000065320237,0.000019183275,0.00007186888,0.000012646547],"domain_scores_gemma":[0.99988115,0.000032996544,0.000025857526,0.000015621195,0.000034207696,0.000010109809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012287173,0.00026967216,0.00012016855,0.00020908297,0.00017959595,0.00029253465,0.00031191652,0.0002505085,0.0006666359],"category_scores_gemma":[0.00027126787,0.00011665462,0.00008761037,0.00017572111,0.00021600461,0.00037476543,0.00015889175,0.00021595621,0.0003328971],"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.00019652609,0.00012686005,0.0006743577,0.000095115145,0.000014330072,0.00017184785,0.00008604483,0.006202594,0.82067305,0.022025544,0.0007482498,0.14898548],"study_design_scores_gemma":[0.0000779804,0.00062679005,0.0012126083,0.000025910815,0.00004196077,0.0006689772,0.000041194446,0.20429751,0.76800734,0.0061701373,0.018785326,0.000044188826],"about_ca_topic_score_codex":0.0003913396,"about_ca_topic_score_gemma":0.0010380242,"teacher_disagreement_score":0.0006666359,"about_ca_system_score_codex":0.00021004124,"about_ca_system_score_gemma":0.00019649885,"threshold_uncertainty_score":0.0022301674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015225893,0.0003363145,0.9768886,0.00014829294,0.00012377666,0.00012257087,0.0003809998,0.0003543656,0.0064191436],"genre_scores_gemma":[0.2605169,0.00072959636,0.7257374,0.00019725328,0.0001268738,0.0005949391,0.0014948297,0.00021637624,0.010385882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883,0.00027196071,0.000105100495,0.00020919177,0.0004580359,0.00012566987],"domain_scores_gemma":[0.997024,0.0010103559,0.00026220098,0.0005841951,0.0008715653,0.00024765503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078460947,0.0006152821,0.0007428151,0.0012739659,0.00096962537,0.001099341,0.0013105802,0.0007524875,0.0032943771],"category_scores_gemma":[0.007488817,0.0006691273,0.0005160194,0.0016346922,0.00094945,0.0013817074,0.0018441317,0.0013372507,0.0016027206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040832075,0.00008410251,0.0012038177,0.00032685837,0.000037013135,0.0004812498,0.0006416939,0.062175892,0.055942137,0.6607355,0.009675765,0.2082876],"study_design_scores_gemma":[0.00010190408,0.0003374476,0.0010263582,0.00015169567,0.000031301184,0.0010607131,0.00019104393,0.642184,0.033051644,0.2826691,0.0390581,0.00013661785],"about_ca_topic_score_codex":0.0019140133,"about_ca_topic_score_gemma":0.001557252,"teacher_disagreement_score":0.0032943771,"about_ca_system_score_codex":0.0008594725,"about_ca_system_score_gemma":0.0015140113,"threshold_uncertainty_score":0.01102078},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25941777,0.0013203342,0.6803013,0.0013542345,0.00026067047,0.00020191538,0.0005975171,0.00090295693,0.055643335],"genre_scores_gemma":[0.838697,0.0004984387,0.15195112,0.00047711347,0.00009748669,0.00023247907,0.00023649774,0.00005690015,0.0077530104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761534,0.0009484667,0.00014995014,0.0003479206,0.00064729736,0.00029106872],"domain_scores_gemma":[0.99527633,0.0023392204,0.0007094603,0.001081481,0.00042753562,0.00016599368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018640396,0.00087964855,0.0008502703,0.00093223044,0.0009295005,0.0015036666,0.0011891157,0.0016604128,0.0050297095],"category_scores_gemma":[0.006629258,0.00070561265,0.0005883791,0.0008362732,0.00097154564,0.0015336762,0.0014234307,0.0008708415,0.001102918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012107253,0.000117146184,0.0010451542,0.00029441647,0.00014429027,0.00033181734,0.0002864128,0.042046692,0.033439804,0.830181,0.0024772652,0.08842524],"study_design_scores_gemma":[0.0005937718,0.0008313251,0.0007219923,0.00020471631,0.00015402303,0.001002003,0.0001167803,0.15600148,0.035062406,0.7906878,0.014484516,0.00013907367],"about_ca_topic_score_codex":0.00041881326,"about_ca_topic_score_gemma":0.00088013517,"teacher_disagreement_score":0.0050297095,"about_ca_system_score_codex":0.0009440198,"about_ca_system_score_gemma":0.0013256883,"threshold_uncertainty_score":0.016826034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74603117,0.0005327859,0.17081885,0.0006815495,0.00009241308,0.00011092744,0.001564112,0.0005587026,0.079609476],"genre_scores_gemma":[0.97329783,0.00031217575,0.017509285,0.00017352015,0.00002611578,0.00008059323,0.0017366079,0.0000914489,0.00677249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993192,0.00011483042,0.000038695016,0.00020469486,0.0001664167,0.00015620526],"domain_scores_gemma":[0.99516416,0.0027255535,0.00055146735,0.00070428825,0.00035068608,0.0005037365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809197,0.00046631193,0.00090126775,0.0012431104,0.0022145999,0.0024709795,0.0011525111,0.0009351773,0.006750666],"category_scores_gemma":[0.003965156,0.00072231615,0.00084872264,0.001263161,0.0014867958,0.002878441,0.0016050036,0.0012404203,0.00057965313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022691413,0.00010529216,0.0045385985,0.00017111789,0.00007836171,0.00085990404,0.00044776208,0.017881466,0.0037080746,0.9509716,0.005157639,0.015853312],"study_design_scores_gemma":[0.00008793671,0.00007527322,0.004084304,0.00008232521,0.000071070834,0.0017250709,0.00076009997,0.0707417,0.004188384,0.90392953,0.014201223,0.000052992757],"about_ca_topic_score_codex":0.0010802118,"about_ca_topic_score_gemma":0.0014777882,"teacher_disagreement_score":0.006750666,"about_ca_system_score_codex":0.0008806629,"about_ca_system_score_gemma":0.000695962,"threshold_uncertainty_score":0.022583246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67123824,0.0011960391,0.16519696,0.004326501,0.0011754005,0.00010812792,0.00023346956,0.00036643358,0.15615886],"genre_scores_gemma":[0.96590036,0.00030491193,0.012006175,0.00048405494,0.0004215042,0.000049770282,0.00013899017,0.00008807362,0.020606097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991973,0.00019848792,0.000050295806,0.00019587972,0.00021878506,0.00013923082],"domain_scores_gemma":[0.9976501,0.0007487271,0.0003000902,0.0005000295,0.0004168868,0.0003842734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007811724,0.00041527225,0.0010441437,0.002035031,0.0022688522,0.0030787908,0.0010672336,0.0015627093,0.0080774035],"category_scores_gemma":[0.004827776,0.0004195579,0.0006532758,0.0014570153,0.004380092,0.0050777867,0.0023655198,0.0021732294,0.00084376713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014794353,0.000012103148,0.00007913656,0.0000067026645,0.0000023711314,0.000024259185,0.00009957122,0.000081800215,0.00030376154,0.9971968,0.00030270024,0.001876064],"study_design_scores_gemma":[0.0000062803488,0.0000067421497,0.00007066929,0.0000028060897,0.0000020542836,0.00006521048,0.0000628445,0.00087909313,0.00015256037,0.998214,0.0005323208,0.0000053903827],"about_ca_topic_score_codex":0.0005197342,"about_ca_topic_score_gemma":0.00038302384,"teacher_disagreement_score":0.0080774035,"about_ca_system_score_codex":0.0005967251,"about_ca_system_score_gemma":0.00067776337,"threshold_uncertainty_score":0.027021646},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22665413,0.0010967572,0.26823318,0.002107539,0.0006968549,0.00019195638,0.001631501,0.00058990705,0.49879816],"genre_scores_gemma":[0.8011748,0.0015023702,0.039187193,0.0008836389,0.0005502343,0.00018206022,0.0013524556,0.0003062156,0.15486096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953127,0.00009434327,0.000018308945,0.00013681815,0.00013096255,0.0000883334],"domain_scores_gemma":[0.99913496,0.0002695663,0.00011379745,0.00020863034,0.00016197712,0.00011119292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031170962,0.00067523867,0.00063702336,0.0020125485,0.0014162173,0.0021424417,0.00080213253,0.0009289396,0.022637133],"category_scores_gemma":[0.0017062341,0.00046086896,0.00073747145,0.001401236,0.0011745867,0.003748605,0.0017424522,0.0023036343,0.0028081443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021927823,0.000012220044,0.00006819688,0.000022580085,0.0000067600276,0.00006087989,0.0000761088,0.0010414786,0.00056178897,0.9900367,0.0018680368,0.006223198],"study_design_scores_gemma":[0.0000073211945,0.000008511351,0.00016099609,0.000008933048,0.00000777055,0.00010320921,0.00005386387,0.0033235596,0.00057387276,0.9858273,0.0099172015,0.0000075013186],"about_ca_topic_score_codex":0.00047473007,"about_ca_topic_score_gemma":0.0005752068,"teacher_disagreement_score":0.022637133,"about_ca_system_score_codex":0.00056053547,"about_ca_system_score_gemma":0.00040301486,"threshold_uncertainty_score":0.075728714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32393524,0.0030631872,0.539788,0.023186196,0.00049581105,0.00022330739,0.0019315797,0.0003963104,0.10698045],"genre_scores_gemma":[0.91042286,0.0023760682,0.069428,0.0012998856,0.0010144839,0.0004159072,0.0016056986,0.00030238047,0.013134809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924435,0.0032755097,0.00034626562,0.000936963,0.0021952158,0.00080248236],"domain_scores_gemma":[0.8886559,0.09893495,0.0025359748,0.005919972,0.0026232614,0.0013298898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061196713,0.0012120999,0.0025152373,0.0026315136,0.0029178576,0.00892555,0.0046919035,0.0029542614,0.012633588],"category_scores_gemma":[0.048761588,0.0012744446,0.00213802,0.0040994035,0.008462459,0.027253557,0.006954283,0.009794336,0.00097557023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085077874,0.000049474835,0.0004902799,0.00006747656,0.00001609801,0.00004079559,0.0002223763,0.0112784,0.00018929357,0.9799187,0.0018264242,0.0058155954],"study_design_scores_gemma":[0.000013966908,0.00000828816,0.00012677003,0.000012417132,0.0000074941004,0.00002523811,0.000051010396,0.027156115,0.000116053685,0.9718332,0.0006397368,0.000009548405],"about_ca_topic_score_codex":0.0025331397,"about_ca_topic_score_gemma":0.0020933244,"teacher_disagreement_score":0.012633588,"about_ca_system_score_codex":0.004117159,"about_ca_system_score_gemma":0.002161928,"threshold_uncertainty_score":0.042263567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31221077,0.0014456543,0.6037156,0.0030640452,0.00044933645,0.00035022572,0.0030586906,0.0042227604,0.071482934],"genre_scores_gemma":[0.8176496,0.0005408506,0.14196804,0.00080910366,0.00013046713,0.00025450485,0.0014637673,0.00030487677,0.03687867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887115,0.0003091463,0.00011026189,0.00019862989,0.00030167922,0.00020904024],"domain_scores_gemma":[0.99648666,0.0016575425,0.00028777344,0.0009635311,0.00045372616,0.00015069947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084859243,0.00046640346,0.00076862174,0.0010577897,0.0008668804,0.0019533136,0.0008322186,0.0008176839,0.009229244],"category_scores_gemma":[0.0029610293,0.00045172812,0.0005282822,0.0012366917,0.001088586,0.0023922543,0.0015941155,0.0012221088,0.0018657944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085243327,0.00018629555,0.0020136659,0.00035217506,0.000087487,0.00064520683,0.00039603928,0.02339993,0.015043343,0.8050802,0.015873821,0.13606939],"study_design_scores_gemma":[0.00022385978,0.0001544745,0.00057357305,0.000069457994,0.000081400394,0.0004667347,0.0001456204,0.06282961,0.024432026,0.87272954,0.038249522,0.00004420538],"about_ca_topic_score_codex":0.0010628899,"about_ca_topic_score_gemma":0.0012713397,"teacher_disagreement_score":0.009229244,"about_ca_system_score_codex":0.0011780255,"about_ca_system_score_gemma":0.0011977558,"threshold_uncertainty_score":0.030874908},"labels":[],"label_agreement":null},{"id":"W1975962647","doi":"10.1002/jcd.10057","title":"Some Hadamard matrices of order 32 and their binary codes","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Hadamard transform; Binary Golay code; Hadamard matrix; Mathematics; Ternary Golay code; Complex Hadamard matrix; Binary number; Order (exchange); Combinatorics; Hadamard code; Code (set theory); Binary code; Hadamard's inequality; Matrix (chemical analysis); Discrete mathematics; Linear code; Arithmetic; Algorithm; Block code; Computer science; Decoding methods; Set (abstract data type)","score_opus":0.011426857845416945,"score_gpt":0.20877933062935145,"score_spread":0.1973524727839345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975962647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9010763,0.0007812147,0.06902826,0.000561486,0.00015798007,0.000049240127,0.00018510617,0.00008308523,0.028077193],"genre_scores_gemma":[0.97787744,0.0001696756,0.017600458,0.00007980836,0.000060467337,0.000026941963,0.000090344896,0.000011279405,0.0040835505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995585,0.00010968363,0.000024504623,0.000059269558,0.00017415258,0.000073743446],"domain_scores_gemma":[0.9992619,0.00021975258,0.00019741166,0.0000732409,0.00013440626,0.000113333386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443028,0.0003624786,0.00028005152,0.00094256346,0.00073054474,0.0008424826,0.00026895144,0.0005944445,0.0018418571],"category_scores_gemma":[0.0015767193,0.00024032484,0.00019574449,0.00050523353,0.00097334577,0.0005884918,0.0005950119,0.0008640293,0.00023481903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029761082,0.00005708435,0.001381927,0.000082714345,0.00001721778,0.00068934145,0.0003780103,0.013053519,0.026340788,0.9428124,0.0013414697,0.013547963],"study_design_scores_gemma":[0.00008991314,0.00019807594,0.0021462457,0.00007065296,0.00001631501,0.0015172989,0.00022586447,0.10828659,0.026113214,0.8508018,0.010416568,0.000117538],"about_ca_topic_score_codex":0.00075245637,"about_ca_topic_score_gemma":0.0006060269,"teacher_disagreement_score":0.0018418571,"about_ca_system_score_codex":0.00048179206,"about_ca_system_score_gemma":0.00044185546,"threshold_uncertainty_score":0.0061615705},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009965319,0.00022257387,0.9726178,0.00040815977,0.00014040704,0.000065227,0.00013704888,0.00025750586,0.016185941],"genre_scores_gemma":[0.5137994,0.00090707926,0.4396719,0.0010499149,0.0005119585,0.0004165509,0.0005246319,0.00030423273,0.04281416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996289,0.0014220985,0.00013399731,0.0006143227,0.0012938615,0.00024679417],"domain_scores_gemma":[0.9954222,0.0016158982,0.00042243648,0.0013885361,0.0009991598,0.0001517688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023294052,0.0011356976,0.000765923,0.0014110208,0.00083498284,0.00191994,0.00089062547,0.0018713091,0.010331624],"category_scores_gemma":[0.013478937,0.0005880018,0.00046007888,0.0012685667,0.0013799709,0.0021604246,0.0021398938,0.001331734,0.0042806794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014621852,0.000047782505,0.00091283274,0.00010895237,0.000085554486,0.00007717088,0.00010568469,0.04680276,0.019241719,0.7820382,0.0046404246,0.14579266],"study_design_scores_gemma":[0.000046199126,0.00012320965,0.0008411886,0.00010040823,0.000067415785,0.00051891315,0.00007626231,0.27957243,0.02181009,0.67451686,0.022251422,0.0000757047],"about_ca_topic_score_codex":0.00033925055,"about_ca_topic_score_gemma":0.0005905956,"teacher_disagreement_score":0.010331624,"about_ca_system_score_codex":0.0006296338,"about_ca_system_score_gemma":0.0009815744,"threshold_uncertainty_score":0.034562767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009870649,0.0009594522,0.9870302,0.0005732255,0.00010550256,0.000028099063,0.0002502792,0.00010638419,0.0010761333],"genre_scores_gemma":[0.22017454,0.0028502075,0.7648341,0.00023504168,0.0005268293,0.0003084976,0.0016575973,0.00023981191,0.009173427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997062,0.0009962417,0.00021277304,0.0008139027,0.00082291383,0.00009221746],"domain_scores_gemma":[0.9925424,0.0051804474,0.00069881836,0.0006020191,0.000872702,0.00010357051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023609642,0.0012360981,0.0016867715,0.002009117,0.0006224108,0.0024159716,0.0025125782,0.0028885799,0.0022372876],"category_scores_gemma":[0.020167058,0.0006609112,0.0009204451,0.004445992,0.0017836934,0.004786053,0.0016880085,0.0023227811,0.0008562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001818563,0.0001103815,0.0012386376,0.0008681206,0.00022240338,0.00012480804,0.00021121308,0.5151889,0.00364976,0.1771466,0.0065958533,0.2944615],"study_design_scores_gemma":[0.000018235656,0.00006624359,0.00074350444,0.00006933938,0.000033388787,0.00016367045,0.00010438838,0.7774077,0.002060484,0.21510722,0.0041791964,0.000046619345],"about_ca_topic_score_codex":0.0029356244,"about_ca_topic_score_gemma":0.0018441956,"teacher_disagreement_score":0.0029356244,"about_ca_system_score_codex":0.0010999574,"about_ca_system_score_gemma":0.0009818634,"threshold_uncertainty_score":0.01248616},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43842074,0.0066548726,0.4534842,0.0042065126,0.00030961624,0.000057808993,0.00042802983,0.0004305969,0.096007586],"genre_scores_gemma":[0.9268198,0.0034078837,0.03552552,0.00038694698,0.0004717559,0.00006799835,0.00013955521,0.000080443344,0.033100158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995789,0.00013438992,0.0000147342,0.00008350327,0.0001395761,0.00004886624],"domain_scores_gemma":[0.99515826,0.0032575051,0.0006897105,0.0003236731,0.00032086438,0.00024994038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381618,0.00050224864,0.00046764172,0.0021244385,0.0008306152,0.001532325,0.0007349306,0.0010424267,0.0050053443],"category_scores_gemma":[0.005828591,0.00040823416,0.00026131584,0.0021424906,0.0021224057,0.0030098928,0.0011373195,0.0019420424,0.00047893828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007186227,0.00002144927,0.00040533976,0.00004115737,0.000012828653,0.00007975849,0.00014628103,0.023192748,0.0011509631,0.958677,0.0016589878,0.014541623],"study_design_scores_gemma":[0.000016006114,0.000010724067,0.0002185221,0.0000137875295,0.000008822134,0.0000950779,0.00007291968,0.030398652,0.00036403802,0.9662023,0.0025881557,0.000011007127],"about_ca_topic_score_codex":0.0015582844,"about_ca_topic_score_gemma":0.0015236391,"teacher_disagreement_score":0.0050053443,"about_ca_system_score_codex":0.000841977,"about_ca_system_score_gemma":0.00056446943,"threshold_uncertainty_score":0.016744494},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04714458,0.00048125122,0.36818033,0.0015129895,0.001297686,0.0007471378,0.017912675,0.016719645,0.5460038],"genre_scores_gemma":[0.3892804,0.0009689044,0.20581469,0.001975274,0.0005914719,0.001098651,0.027524421,0.008326463,0.36441973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952126,0.00009596482,0.000026562378,0.00012796828,0.000113718284,0.00011454954],"domain_scores_gemma":[0.99822575,0.0005072609,0.00009176601,0.00045330983,0.0005959776,0.00012597279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042951363,0.00042443327,0.00036833304,0.0012680123,0.0012399553,0.00191994,0.0009029218,0.00059042167,0.10718934],"category_scores_gemma":[0.0025695332,0.0003753393,0.00038295944,0.0015725393,0.00083396985,0.0026755128,0.0015455959,0.001053523,0.02430186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033004835,0.000105917,0.0009823203,0.00037516476,0.000022942646,0.00036834567,0.0006335085,0.0015332134,0.017758207,0.70784426,0.17439538,0.09565071],"study_design_scores_gemma":[0.000059628303,0.000063238534,0.0009596064,0.00012487733,0.0000355476,0.0005449367,0.00033004358,0.009124845,0.035378728,0.24735385,0.7059569,0.000067790264],"about_ca_topic_score_codex":0.0032400447,"about_ca_topic_score_gemma":0.0051525203,"teacher_disagreement_score":0.10718934,"about_ca_system_score_codex":0.000989593,"about_ca_system_score_gemma":0.001327318,"threshold_uncertainty_score":0.35858405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28160167,0.0006856428,0.6725806,0.0014344989,0.00026180333,0.00033649025,0.0004699806,0.0011523879,0.04147691],"genre_scores_gemma":[0.75126827,0.0003676332,0.23563007,0.00058145286,0.0001752041,0.00043595428,0.00030263953,0.000105358675,0.011133396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960995,0.0016062817,0.00023884882,0.0005584279,0.0009156631,0.0005813402],"domain_scores_gemma":[0.9868974,0.0056906384,0.0017924994,0.004103653,0.0009551116,0.0005608034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028397525,0.0011176298,0.001218368,0.0012170543,0.0013129377,0.0021454091,0.0017720762,0.0019954978,0.0068280636],"category_scores_gemma":[0.006850286,0.0008051574,0.0008700503,0.0012786363,0.0018248126,0.002043138,0.0025310174,0.002068793,0.001605894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026630252,0.00027370505,0.0012409292,0.00039968296,0.0001561645,0.0003628618,0.0005440887,0.035395414,0.04692434,0.806217,0.0036727202,0.10214999],"study_design_scores_gemma":[0.0013030985,0.0013890329,0.0004728331,0.00020057343,0.00016409357,0.0007131571,0.00017430959,0.10892979,0.05568149,0.8137846,0.017033702,0.00015338877],"about_ca_topic_score_codex":0.00034001775,"about_ca_topic_score_gemma":0.00061465555,"teacher_disagreement_score":0.0068280636,"about_ca_system_score_codex":0.0011906197,"about_ca_system_score_gemma":0.0017983768,"threshold_uncertainty_score":0.022842169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58522725,0.00060402334,0.35682395,0.00066782377,0.00016574928,0.00024254376,0.0011123292,0.0002466797,0.054909687],"genre_scores_gemma":[0.8725213,0.00041536707,0.10300906,0.0002791764,0.00009999297,0.000521708,0.001617347,0.00024504555,0.021291034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988104,0.00033611036,0.00008198909,0.00022981783,0.00030694774,0.00023470442],"domain_scores_gemma":[0.99772996,0.00093232945,0.00030636785,0.00044299185,0.00031335867,0.00027494974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065770006,0.0006965585,0.0009949123,0.0020918536,0.0016139762,0.004763672,0.0012764296,0.0010976577,0.011424611],"category_scores_gemma":[0.0029267026,0.000948408,0.0008475581,0.0018850734,0.0022444874,0.0038297921,0.0023767427,0.0017934693,0.0011209121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004111264,0.000060522187,0.00093664875,0.00011054358,0.000055514767,0.0001779153,0.00043037426,0.009235959,0.007863418,0.96584606,0.0022201017,0.01265178],"study_design_scores_gemma":[0.00007954881,0.000072044226,0.0010421963,0.00007151945,0.000047712834,0.0003288194,0.0009189749,0.048504315,0.0055039986,0.9359065,0.007497204,0.000027046877],"about_ca_topic_score_codex":0.0009132004,"about_ca_topic_score_gemma":0.0012376986,"teacher_disagreement_score":0.011424611,"about_ca_system_score_codex":0.00098609,"about_ca_system_score_gemma":0.00045594331,"threshold_uncertainty_score":0.038219094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7403504,0.0011816911,0.16207957,0.0011533984,0.00024676978,0.00011038795,0.0005666351,0.0004675897,0.09384346],"genre_scores_gemma":[0.911535,0.0004283732,0.06987861,0.00029619958,0.00007903526,0.00018708956,0.00030192264,0.000067260844,0.017226484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990777,0.00033067536,0.000065883956,0.00017387683,0.00018504381,0.00016679415],"domain_scores_gemma":[0.9972391,0.0015021092,0.00045096333,0.00027729364,0.00031969522,0.00021092752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426699,0.0005417513,0.00081191154,0.0013838091,0.0018062004,0.002152018,0.0009969966,0.0017540158,0.0065054223],"category_scores_gemma":[0.0059018573,0.00091767014,0.0007719598,0.0007286151,0.0012227427,0.0016118537,0.0012163445,0.00088116946,0.0012317718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003893659,0.000039357124,0.0010431346,0.00015219967,0.000045176563,0.00027203126,0.00029854174,0.004557587,0.0082366215,0.9646284,0.001764554,0.018573014],"study_design_scores_gemma":[0.00023702152,0.00015048371,0.00086918834,0.00008401079,0.00006426635,0.00076512864,0.00018218395,0.019839339,0.007000853,0.9630683,0.007664984,0.00007422932],"about_ca_topic_score_codex":0.00038850214,"about_ca_topic_score_gemma":0.00070628105,"teacher_disagreement_score":0.0065054223,"about_ca_system_score_codex":0.0007874119,"about_ca_system_score_gemma":0.00090314815,"threshold_uncertainty_score":0.021762848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73918724,0.0005964337,0.06636083,0.002148545,0.0010110101,0.00029613537,0.0029216593,0.0007298831,0.18674831],"genre_scores_gemma":[0.88445926,0.0004121777,0.048399284,0.00069087103,0.000076851196,0.0001589032,0.0014748402,0.0002670425,0.064060695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999546,0.00006446245,0.000034770044,0.00011799169,0.000084531624,0.00015231024],"domain_scores_gemma":[0.99836224,0.0005341506,0.00023324473,0.000355061,0.00023315134,0.00028214543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088744,0.0006282503,0.00044636006,0.0007330568,0.0018801222,0.0017433198,0.00081819156,0.0008586392,0.015689982],"category_scores_gemma":[0.0016320017,0.0003980106,0.0005301466,0.0009809807,0.001057088,0.0019193534,0.0012101474,0.0011241699,0.0018405487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022442082,0.0002763467,0.007929129,0.00064796716,0.00010516782,0.003634059,0.0018121692,0.005774817,0.06574485,0.7781252,0.04403049,0.08967558],"study_design_scores_gemma":[0.00012168481,0.00017535248,0.010764444,0.00014533366,0.00011246376,0.002565487,0.0013743842,0.009739896,0.04364742,0.84465003,0.08660879,0.000094670846],"about_ca_topic_score_codex":0.0018383607,"about_ca_topic_score_gemma":0.0043196464,"teacher_disagreement_score":0.015689982,"about_ca_system_score_codex":0.0009221319,"about_ca_system_score_gemma":0.00053700677,"threshold_uncertainty_score":0.05248815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049337735,0.018634513,0.34925,0.0016937961,0.0015824448,0.00016248901,0.0005922129,0.0009840135,0.6221667],"genre_scores_gemma":[0.09179751,0.026825653,0.22633497,0.0013471325,0.0015570503,0.0006029146,0.0011530732,0.0010074095,0.6493743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961793,0.00006775244,0.000014400212,0.00006887736,0.00020617551,0.000024828028],"domain_scores_gemma":[0.99961215,0.00016623386,0.00002277531,0.00008251381,0.000097143384,0.000019255524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028922208,0.001735783,0.000962826,0.002443889,0.0010836037,0.0031739213,0.0010797982,0.0010229168,0.02567963],"category_scores_gemma":[0.0010648227,0.0010907182,0.00056430156,0.0042999717,0.0018085737,0.002514246,0.0006701503,0.0021985737,0.0097012585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009940507,0.000026893124,0.000048915637,0.00018415695,0.000008808935,0.00003887622,0.0001064287,0.0031005885,0.0010335195,0.81617606,0.057628963,0.12163683],"study_design_scores_gemma":[0.00001063388,0.00002042253,0.00010108675,0.00009655024,0.000016765984,0.00028223044,0.000058416546,0.005747716,0.0013403038,0.6598324,0.33247173,0.000021652064],"about_ca_topic_score_codex":0.0011227524,"about_ca_topic_score_gemma":0.0020082882,"teacher_disagreement_score":0.02567963,"about_ca_system_score_codex":0.001829023,"about_ca_system_score_gemma":0.00091812236,"threshold_uncertainty_score":0.08590686},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3517488,0.0016666311,0.5875047,0.003926035,0.00037021004,0.00011648776,0.00024758207,0.00026017913,0.0541594],"genre_scores_gemma":[0.89947814,0.0009566624,0.086422466,0.0011092239,0.00020491994,0.0002653359,0.00020403542,0.00011514256,0.01124406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603623,0.0019490182,0.00020837362,0.000594836,0.0006883639,0.0005232444],"domain_scores_gemma":[0.9413179,0.04773091,0.0029920938,0.003607134,0.002951329,0.0014007094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075134216,0.00072114175,0.0015632177,0.0014024283,0.0024637089,0.0039674393,0.0015257609,0.0037991179,0.0073076747],"category_scores_gemma":[0.033844244,0.001668289,0.0014733698,0.0012428061,0.005391099,0.00709575,0.0042203185,0.0042389217,0.000883689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017212643,0.000027208629,0.00056537474,0.00007385041,0.000021424474,0.00008600164,0.0002509314,0.0052483333,0.0013400612,0.9860524,0.0008959192,0.005266473],"study_design_scores_gemma":[0.000063035186,0.00007262215,0.00025358354,0.000050675564,0.00001634337,0.0001735836,0.0001078316,0.030909518,0.000759469,0.9657791,0.0017885299,0.000025568981],"about_ca_topic_score_codex":0.0006315509,"about_ca_topic_score_gemma":0.00074673706,"teacher_disagreement_score":0.0075134216,"about_ca_system_score_codex":0.0015136875,"about_ca_system_score_gemma":0.001491185,"threshold_uncertainty_score":0.039735258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7642308,0.0007499678,0.17927933,0.00075681607,0.00019440714,0.0005652185,0.0016169515,0.0007522797,0.05185428],"genre_scores_gemma":[0.9535525,0.00024178503,0.03653653,0.00024510894,0.000049021044,0.00038904708,0.0010916267,0.000064383006,0.007830061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989348,0.00018692159,0.00012706795,0.00027295825,0.00018757928,0.00029071112],"domain_scores_gemma":[0.99641466,0.0011286566,0.00075390656,0.00045030352,0.00071232434,0.0005401051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752552,0.0005328915,0.0008811838,0.0013124463,0.0016897041,0.001464693,0.0010939992,0.0011172668,0.008054754],"category_scores_gemma":[0.0053490982,0.0006816799,0.0005993736,0.00094392494,0.0012548713,0.0018558857,0.0023075598,0.00074356893,0.0012861645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020419008,0.0003688939,0.011036505,0.0012699796,0.0002686294,0.004429584,0.0016134412,0.040337294,0.07590088,0.7807196,0.013324616,0.06868867],"study_design_scores_gemma":[0.00052094087,0.00048733616,0.004593634,0.00030818282,0.00017418757,0.002895274,0.0009420498,0.108235754,0.051584832,0.77074456,0.059344344,0.00016879843],"about_ca_topic_score_codex":0.0018217622,"about_ca_topic_score_gemma":0.00278689,"teacher_disagreement_score":0.008054754,"about_ca_system_score_codex":0.00071072055,"about_ca_system_score_gemma":0.0010059922,"threshold_uncertainty_score":0.026945889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92077535,0.00022915546,0.045718532,0.0008850876,0.00012327351,0.00003759511,0.00022474914,0.00021952209,0.031786732],"genre_scores_gemma":[0.9728836,0.000044834545,0.022991389,0.00013236438,0.000030200585,0.000047835307,0.0002324725,0.000040718427,0.0035966474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986966,0.0003945083,0.00010641313,0.0002823686,0.00027131516,0.00024880425],"domain_scores_gemma":[0.9905083,0.005713443,0.001216567,0.0013503755,0.00063404883,0.00057724526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041507,0.00045817508,0.0007401673,0.0009658589,0.002714282,0.0026296233,0.001294561,0.0018232117,0.006060563],"category_scores_gemma":[0.007790003,0.001131066,0.00068537315,0.00086164346,0.0030022026,0.0022924284,0.002528838,0.0012864787,0.0007743465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015348428,0.00014840008,0.010567021,0.0002756597,0.00012298084,0.0013221132,0.0015567972,0.009495555,0.06684692,0.8802888,0.0029798376,0.024861101],"study_design_scores_gemma":[0.00030558262,0.00045237617,0.006169587,0.00012674644,0.00015253805,0.0038505166,0.0018616535,0.058061704,0.100397035,0.8137739,0.014676151,0.00017235609],"about_ca_topic_score_codex":0.00030322248,"about_ca_topic_score_gemma":0.0004135906,"teacher_disagreement_score":0.006060563,"about_ca_system_score_codex":0.00059202313,"about_ca_system_score_gemma":0.00077670626,"threshold_uncertainty_score":0.02027464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061478224,0.0026532894,0.73459035,0.0018330548,0.001187883,0.00009522137,0.00048775264,0.0011633674,0.1965109],"genre_scores_gemma":[0.6576729,0.0026889136,0.21257526,0.0015309319,0.0011227075,0.00017492639,0.00084711215,0.0010861096,0.1223011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994,0.00022174134,0.000020767147,0.00014795097,0.00015769768,0.000051839572],"domain_scores_gemma":[0.9989492,0.0004488314,0.00007446326,0.00030806882,0.00013651019,0.000082949846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031788557,0.00076598866,0.0008013063,0.0007180544,0.00067168643,0.0012110821,0.0006163915,0.00083577406,0.014627865],"category_scores_gemma":[0.003523464,0.00043943874,0.0005045016,0.0011686144,0.0010277873,0.0017835542,0.0021008982,0.00176543,0.0043941992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008895839,0.000015152309,0.0002659662,0.0001405504,0.000030822874,0.00010222023,0.00014101737,0.014776964,0.0038827593,0.8628445,0.018483436,0.09922772],"study_design_scores_gemma":[0.000015831652,0.00003984756,0.0002987886,0.000021484382,0.000015015603,0.0002743949,0.0000619897,0.04416376,0.0023407943,0.9108143,0.041939255,0.000014544131],"about_ca_topic_score_codex":0.00049588986,"about_ca_topic_score_gemma":0.0005221745,"teacher_disagreement_score":0.014627865,"about_ca_system_score_codex":0.00038225783,"about_ca_system_score_gemma":0.00026237886,"threshold_uncertainty_score":0.048935115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5663122,0.0011963419,0.25922042,0.0015324112,0.00050011073,0.00014426836,0.00037660715,0.0005540147,0.1701636],"genre_scores_gemma":[0.92001706,0.00063990644,0.030503582,0.0004077066,0.00012364298,0.00010903216,0.00027092375,0.00022399316,0.047704265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971133,0.000070968534,0.000011174083,0.000055985623,0.00006063982,0.0000898115],"domain_scores_gemma":[0.99898237,0.00043333202,0.00010170497,0.00018010168,0.00013411594,0.00016839981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029170248,0.00048020587,0.000555056,0.0010742004,0.0012743687,0.0017385193,0.00067071285,0.0010646497,0.010824166],"category_scores_gemma":[0.0018216321,0.00036490266,0.000500677,0.00093943573,0.001350248,0.0023455548,0.0020151627,0.0016893534,0.0009042283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005211602,0.000015777925,0.00016322212,0.00003754707,0.0000056447097,0.00005842013,0.00020738298,0.0037210083,0.0025454364,0.983173,0.0014445964,0.008575763],"study_design_scores_gemma":[0.000012933775,0.000015953421,0.00010910434,0.000011150398,0.0000054978136,0.00004337115,0.00007016554,0.011501833,0.0009312163,0.98299,0.004299971,0.000008733229],"about_ca_topic_score_codex":0.0017484216,"about_ca_topic_score_gemma":0.0022199908,"teacher_disagreement_score":0.010824166,"about_ca_system_score_codex":0.00090376195,"about_ca_system_score_gemma":0.0005298541,"threshold_uncertainty_score":0.036210477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28372443,0.0017919999,0.5277037,0.03422199,0.0025579932,0.00028079806,0.0010150159,0.0027730102,0.14593102],"genre_scores_gemma":[0.87405634,0.00076056045,0.101128034,0.0022600798,0.0006186592,0.00014294528,0.000413953,0.00056373875,0.020055803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958176,0.0015376311,0.00020654802,0.0006022944,0.0010009571,0.00083491515],"domain_scores_gemma":[0.9814155,0.011251006,0.0011336453,0.0039808964,0.0012247639,0.0009941158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004065793,0.0006784843,0.0012505691,0.0010004091,0.003998536,0.0041231653,0.0027283644,0.0030228542,0.018364405],"category_scores_gemma":[0.024081195,0.00074373797,0.0014467405,0.0014346192,0.0046729962,0.01311221,0.004839833,0.005008096,0.0022689127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030826285,0.000119114724,0.0007086331,0.0001411656,0.000026861931,0.00055851624,0.00036103497,0.0036362135,0.0018091456,0.9380039,0.019454224,0.034872953],"study_design_scores_gemma":[0.00008719753,0.00003059392,0.00012701136,0.000025884963,0.000021287355,0.00023085499,0.00012586344,0.010782641,0.0017601916,0.97902054,0.007759297,0.000028627624],"about_ca_topic_score_codex":0.001084543,"about_ca_topic_score_gemma":0.0009336612,"teacher_disagreement_score":0.018364405,"about_ca_system_score_codex":0.0014851763,"about_ca_system_score_gemma":0.0015481682,"threshold_uncertainty_score":0.061435044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030633718,0.003284078,0.8448086,0.0043814383,0.0007490011,0.00032507812,0.0014233795,0.0007897004,0.113605],"genre_scores_gemma":[0.4461809,0.0050953534,0.36045608,0.0023961216,0.0021665578,0.0010683115,0.0028602453,0.0010310855,0.1787453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864846,0.00053403014,0.000046996647,0.0003056776,0.000260451,0.00020430832],"domain_scores_gemma":[0.997426,0.0016217951,0.00016917085,0.00029722054,0.00030662172,0.00017914001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010023874,0.0015978987,0.0014669404,0.0010489953,0.0011472098,0.0040854984,0.0016767053,0.0023052031,0.029605422],"category_scores_gemma":[0.0060818903,0.00081642333,0.0007312051,0.0029630782,0.0011711663,0.0033682368,0.0017323418,0.002723972,0.0046853656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045104153,0.00033328758,0.00040039426,0.0005498396,0.00013399613,0.0001561069,0.00016752009,0.11677147,0.003128779,0.6038534,0.079430506,0.19462365],"study_design_scores_gemma":[0.00017620955,0.00012341783,0.0002733903,0.000081640675,0.00006904316,0.00022334512,0.0001198455,0.26395488,0.0028861058,0.7045382,0.027520066,0.000033988104],"about_ca_topic_score_codex":0.0011264869,"about_ca_topic_score_gemma":0.00113361,"teacher_disagreement_score":0.029605422,"about_ca_system_score_codex":0.0011758299,"about_ca_system_score_gemma":0.0012760194,"threshold_uncertainty_score":0.09903997},"labels":[],"label_agreement":null},{"id":"W1982048527","doi":"10.1002/jcd.20288","title":"Generalized covering designs and clique coverings","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Toronto Metropolitan University; University of Regina","funders":"","keywords":"Mathematics; Generalization; Clique; Combinatorics; Class (philosophy); Combinatorial design; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.035267551852609595,"score_gpt":0.21890301828844091,"score_spread":0.1836354664358313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982048527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20569217,0.0010560128,0.76498055,0.0004855065,0.0001663725,0.00015808009,0.00036018292,0.00045945862,0.026641563],"genre_scores_gemma":[0.7576155,0.00081165123,0.23374557,0.0003169261,0.00018067862,0.00035484563,0.00034891226,0.00009348835,0.0065323794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985354,0.0005377693,0.00007523881,0.000332537,0.00031609213,0.00020300612],"domain_scores_gemma":[0.9964192,0.0017131899,0.0005661887,0.0007613215,0.00032423038,0.0002158413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417667,0.0007150651,0.0005409631,0.00095949863,0.0006584561,0.0012716522,0.0006464133,0.00083200337,0.004068897],"category_scores_gemma":[0.004287799,0.00044627112,0.00074115547,0.0013479461,0.0011194155,0.0017587519,0.0010356732,0.0009229309,0.0004621443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002184593,0.00005681378,0.0010911211,0.00022478453,0.00006271882,0.0003167773,0.00025092147,0.086779565,0.021645311,0.8031644,0.003627316,0.08256182],"study_design_scores_gemma":[0.00010443199,0.00034766804,0.00086430024,0.000069179405,0.000050583058,0.0010711779,0.00013941346,0.26699185,0.014089552,0.6901468,0.026066897,0.00005820947],"about_ca_topic_score_codex":0.00049687474,"about_ca_topic_score_gemma":0.0006118827,"teacher_disagreement_score":0.004068897,"about_ca_system_score_codex":0.00086851674,"about_ca_system_score_gemma":0.00048786012,"threshold_uncertainty_score":0.013611853},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5064658,0.0038430942,0.30322385,0.0063801887,0.0010195371,0.0001322891,0.0006329774,0.00030483608,0.17799735],"genre_scores_gemma":[0.9458451,0.002197345,0.026713708,0.00083457906,0.0010838143,0.00013515334,0.0004951654,0.00013526759,0.02255989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992011,0.00027797066,0.000042165106,0.0001553315,0.00016183035,0.00016155525],"domain_scores_gemma":[0.99667346,0.0019219012,0.00039107804,0.00028867653,0.00036516468,0.00035975574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010171831,0.0008309021,0.001194735,0.0026827725,0.0027183108,0.003216992,0.0010193888,0.0017970745,0.008003532],"category_scores_gemma":[0.00426602,0.0006757965,0.0010016684,0.0024846592,0.0037722834,0.0057229,0.0020484028,0.00292248,0.00066962483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016692418,0.000013434779,0.00012853312,0.000019988498,0.000004092698,0.000055895245,0.00015947023,0.0010620921,0.0002965282,0.99535036,0.00090043,0.0019925467],"study_design_scores_gemma":[0.0000045292913,0.0000054036072,0.00007188791,0.000009586014,0.0000028093925,0.000035881912,0.000054176766,0.0036902807,0.00005728879,0.99522686,0.0008361214,0.0000050975113],"about_ca_topic_score_codex":0.0018829457,"about_ca_topic_score_gemma":0.002232338,"teacher_disagreement_score":0.008003532,"about_ca_system_score_codex":0.0015292197,"about_ca_system_score_gemma":0.00061004236,"threshold_uncertainty_score":0.026774466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02793282,0.0011020793,0.9364218,0.0008155729,0.00031303483,0.0002504009,0.00022112747,0.001028035,0.031915076],"genre_scores_gemma":[0.46119788,0.0012989573,0.5046163,0.0008591137,0.00039631606,0.0007166501,0.0003035382,0.00021117835,0.030400114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946188,0.0029088964,0.00026333175,0.00047739505,0.0011606847,0.00057086756],"domain_scores_gemma":[0.9910609,0.0029679937,0.0008731225,0.0028131357,0.0019335513,0.0003513974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032919154,0.0020084162,0.0014175234,0.0014585075,0.0012768,0.0019058726,0.0012687782,0.0023010646,0.01040142],"category_scores_gemma":[0.01012458,0.0009068417,0.00076628366,0.0016543139,0.0013906307,0.0015829547,0.0019171241,0.0016243915,0.0066553433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023190659,0.00024715904,0.0012229147,0.00053521746,0.00024292886,0.0003424627,0.00046298633,0.038360246,0.08493658,0.6437368,0.008287133,0.21930653],"study_design_scores_gemma":[0.0010851491,0.0034016664,0.0014795109,0.0004046963,0.00042361583,0.002226038,0.00028992043,0.29642507,0.095923364,0.5217123,0.07627414,0.00035456946],"about_ca_topic_score_codex":0.0006640327,"about_ca_topic_score_gemma":0.0011588318,"teacher_disagreement_score":0.01040142,"about_ca_system_score_codex":0.00084789534,"about_ca_system_score_gemma":0.0018686997,"threshold_uncertainty_score":0.034796238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6089128,0.00037570824,0.26473865,0.00039910915,0.00018083001,0.00014254118,0.0009744834,0.0006231949,0.12365266],"genre_scores_gemma":[0.93907905,0.0003506681,0.036265288,0.00021018017,0.000101189755,0.00010797234,0.0006453453,0.00013251814,0.023107905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919385,0.0001864864,0.00004392573,0.00020609236,0.0002063303,0.00016327894],"domain_scores_gemma":[0.9961622,0.0017408152,0.00036629508,0.00056885456,0.00059389375,0.0005678724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005945213,0.00038140424,0.0006065056,0.0015800159,0.0016350633,0.0022336151,0.00089724065,0.0007224283,0.008364689],"category_scores_gemma":[0.0040279836,0.0005730781,0.00039469096,0.0016148954,0.0010293713,0.002766722,0.0015355174,0.0009180379,0.00090744504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018534512,0.00006961116,0.0011908368,0.00010570139,0.000034189146,0.0005000438,0.00045425806,0.0029098478,0.008716269,0.9651043,0.0026111545,0.018118521],"study_design_scores_gemma":[0.00006447726,0.00006053723,0.0014299866,0.000046395366,0.000082041726,0.0010635979,0.00041393127,0.026570661,0.009079766,0.9505162,0.0106404135,0.00003197315],"about_ca_topic_score_codex":0.00063942384,"about_ca_topic_score_gemma":0.0010110837,"teacher_disagreement_score":0.008364689,"about_ca_system_score_codex":0.0006633464,"about_ca_system_score_gemma":0.0005347375,"threshold_uncertainty_score":0.027982652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038461278,0.00032411265,0.49769846,0.0015609332,0.0011235487,0.00029598927,0.012944014,0.060310766,0.4218961],"genre_scores_gemma":[0.08530461,0.0008047309,0.28462952,0.002048803,0.0006039461,0.00081859715,0.0208105,0.027889363,0.57708997],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991036,0.00018848902,0.00007821863,0.0001389827,0.00037175542,0.000118905744],"domain_scores_gemma":[0.99765426,0.000563239,0.000114639544,0.00077291933,0.0007726747,0.00012227279],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010212775,0.0011217822,0.0008449837,0.0012805632,0.00097326085,0.0032875375,0.0018892616,0.0011986655,0.40641245],"category_scores_gemma":[0.0045415675,0.0008958738,0.00092041004,0.0013057559,0.00066166057,0.0035497742,0.0018567478,0.0018512732,0.21120979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044234857,0.00010160912,0.00045622635,0.0006498275,0.00003612655,0.0002571412,0.0002924511,0.003306367,0.013053618,0.2563443,0.57181585,0.15324421],"study_design_scores_gemma":[0.00008219991,0.000059259477,0.0002886723,0.000083253304,0.00001950413,0.000306359,0.00004876114,0.010035846,0.014994502,0.07850721,0.895525,0.00004941847],"about_ca_topic_score_codex":0.0025390016,"about_ca_topic_score_gemma":0.005735794,"teacher_disagreement_score":0.40641245,"about_ca_system_score_codex":0.0013394366,"about_ca_system_score_gemma":0.0014494709,"threshold_uncertainty_score":0.8466806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30497462,0.00046961106,0.61848813,0.0042264718,0.0003438639,0.0003211366,0.0022640997,0.0015261713,0.06738598],"genre_scores_gemma":[0.81767386,0.0005035267,0.14749569,0.00075504166,0.00023821194,0.00028238932,0.002339993,0.00046220314,0.030249057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931693,0.0001655577,0.000026941736,0.00014948337,0.00010895629,0.00023213172],"domain_scores_gemma":[0.996518,0.0024519947,0.00028676252,0.00035299547,0.00022529252,0.00016498353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005081122,0.0008374869,0.0011058769,0.00042275485,0.0009394841,0.0031898075,0.0010396695,0.0018896708,0.021391883],"category_scores_gemma":[0.003713692,0.00046625815,0.000661888,0.00089295884,0.00083647564,0.003140757,0.000980549,0.002047101,0.0030589506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027484056,0.0014292086,0.004321477,0.0017597371,0.00035823975,0.0013788152,0.0006806249,0.19329382,0.030489417,0.38078827,0.09221436,0.2905376],"study_design_scores_gemma":[0.00042210362,0.00018377088,0.0015093711,0.000055455195,0.00008030637,0.0004353903,0.00077028084,0.46316794,0.0110052265,0.5125404,0.009770454,0.000059229962],"about_ca_topic_score_codex":0.002217574,"about_ca_topic_score_gemma":0.0025830618,"teacher_disagreement_score":0.021391883,"about_ca_system_score_codex":0.00065280625,"about_ca_system_score_gemma":0.0010457485,"threshold_uncertainty_score":0.071563005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709292,0.00052671554,0.024658807,0.00019083577,0.00003904492,0.000013569935,0.00006965902,0.00022630734,0.0033459251],"genre_scores_gemma":[0.9986721,0.000077812925,0.0010299704,0.000024397445,0.000015547304,0.0000028027575,0.000021449348,0.00001743773,0.00013832723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975285,0.0007606798,0.00008337253,0.00023617224,0.0010118587,0.00037943939],"domain_scores_gemma":[0.9875021,0.010004085,0.0006859095,0.00057315757,0.0009790227,0.0002556448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015739189,0.0006541263,0.00067521713,0.00062614435,0.0006661723,0.0011251887,0.00026625898,0.0011255683,0.0006823484],"category_scores_gemma":[0.014467875,0.00032396914,0.00016380328,0.0006366228,0.00082130526,0.0010688514,0.00068847684,0.00043744905,0.00028073668],"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.003255917,0.00028639857,0.024082806,0.00022521181,0.00017609222,0.0013555794,0.0003634811,0.7029922,0.215236,0.008784037,0.00052717264,0.042715043],"study_design_scores_gemma":[0.00013813624,0.0017699752,0.02083613,0.000056893343,0.000114675575,0.0011906846,0.00014021392,0.82807773,0.14147355,0.0052310065,0.0008196945,0.00015130985],"about_ca_topic_score_codex":0.001247296,"about_ca_topic_score_gemma":0.0007157414,"teacher_disagreement_score":0.0015739189,"about_ca_system_score_codex":0.00062234857,"about_ca_system_score_gemma":0.0006072385,"threshold_uncertainty_score":0.008323789},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02837591,0.006353393,0.6780765,0.011255481,0.0031386842,0.00008220412,0.00068906764,0.0002458833,0.27178285],"genre_scores_gemma":[0.7414447,0.0071897856,0.11632704,0.0065857894,0.004101364,0.00037930856,0.0009762398,0.00044409317,0.12255174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987494,0.00036470313,0.000057285226,0.00026418085,0.0003639297,0.00020049978],"domain_scores_gemma":[0.99547726,0.0029717288,0.00021863611,0.0002579039,0.00080351654,0.00027106132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016238767,0.0014012915,0.0009305359,0.0017202719,0.0015742201,0.0026546004,0.0018611577,0.0017115233,0.01135509],"category_scores_gemma":[0.007156785,0.0005143223,0.00082686765,0.0020076595,0.002878552,0.005802257,0.0025883645,0.005738506,0.0017553295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005990107,0.000025889729,0.00014914076,0.00014460347,0.000012259885,0.00018232482,0.00019202502,0.0022597625,0.003706913,0.97321737,0.008971012,0.011078688],"study_design_scores_gemma":[0.000011574791,0.000025633844,0.00038961694,0.00006255757,0.000015604455,0.0001555966,0.0000881976,0.029533774,0.0012122731,0.95495963,0.013522517,0.000023013645],"about_ca_topic_score_codex":0.0029407847,"about_ca_topic_score_gemma":0.002840371,"teacher_disagreement_score":0.01135509,"about_ca_system_score_codex":0.0018273722,"about_ca_system_score_gemma":0.0009903433,"threshold_uncertainty_score":0.037986577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6574732,0.001207884,0.25855252,0.003214814,0.0004997843,0.000111179965,0.00016554364,0.0006017389,0.078173205],"genre_scores_gemma":[0.96315765,0.00039473074,0.023008984,0.00042036863,0.000096064025,0.00007408655,0.00009564307,0.00015821372,0.012594318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989932,0.00044365827,0.000030517847,0.00014863333,0.0001711102,0.00021283659],"domain_scores_gemma":[0.9940287,0.0031875065,0.0004035125,0.00086653634,0.00052171707,0.0009920851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012941739,0.00047518752,0.0010006707,0.0010546221,0.0025928125,0.0043295734,0.0014298529,0.0014084425,0.010055444],"category_scores_gemma":[0.012216721,0.00079002633,0.00071584375,0.0009191079,0.0019570012,0.0035785306,0.0029552642,0.0023674548,0.00077486254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041203346,0.000101436235,0.0012312261,0.00008974231,0.000056703168,0.00018528674,0.00045048253,0.043807063,0.0045602554,0.9094751,0.006407566,0.03322309],"study_design_scores_gemma":[0.00007094371,0.00007734186,0.0004617613,0.000042011437,0.000027162883,0.00009900565,0.0002996904,0.1836078,0.0014324357,0.8064717,0.007385306,0.000024834097],"about_ca_topic_score_codex":0.0017312898,"about_ca_topic_score_gemma":0.0021260374,"teacher_disagreement_score":0.010055444,"about_ca_system_score_codex":0.000951391,"about_ca_system_score_gemma":0.00067816133,"threshold_uncertainty_score":0.033638835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3927959,0.00327265,0.44316223,0.0018447244,0.00041033182,0.00022587874,0.0018016105,0.00036518087,0.15612155],"genre_scores_gemma":[0.77777904,0.0033464571,0.141207,0.0007452833,0.0005106958,0.00026472248,0.0031283374,0.0005056236,0.07251295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939835,0.00019119568,0.000033847384,0.00011470008,0.00013829111,0.00012364611],"domain_scores_gemma":[0.99762744,0.0010543594,0.00030603912,0.00025295428,0.0003220331,0.00043716337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083351374,0.00096453837,0.00082284457,0.0030159915,0.0013052473,0.0036790892,0.00092178397,0.00091072446,0.009855652],"category_scores_gemma":[0.0031530873,0.0010364688,0.0010784509,0.0023000685,0.0018304165,0.0039973077,0.0019412495,0.0023425661,0.0011964206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050184823,0.00003464227,0.0004126475,0.00006453329,0.000021662956,0.000113893526,0.00045518109,0.0038487434,0.0012566622,0.97721475,0.0042598983,0.01226712],"study_design_scores_gemma":[0.0000097196125,0.000006901406,0.00024955082,0.000034963905,0.000010044781,0.00006576428,0.00013978401,0.008481467,0.0001653812,0.9874715,0.003358706,0.000006108444],"about_ca_topic_score_codex":0.001508634,"about_ca_topic_score_gemma":0.0024170957,"teacher_disagreement_score":0.009855652,"about_ca_system_score_codex":0.0013164468,"about_ca_system_score_gemma":0.00047695235,"threshold_uncertainty_score":0.032970488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27048656,0.0076521733,0.46114817,0.0057187458,0.0020704963,0.000071007344,0.00036329436,0.00031435466,0.2521752],"genre_scores_gemma":[0.9159352,0.002706074,0.031212948,0.0008712862,0.0016650411,0.00006668254,0.00013637816,0.00008676482,0.047319654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993174,0.00027978397,0.000030191806,0.000104040264,0.00019108433,0.000077604556],"domain_scores_gemma":[0.997521,0.0013574015,0.0003529961,0.00023313446,0.00037014636,0.0001652567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080876186,0.0009986687,0.00079489284,0.0020310548,0.0011646826,0.0027246822,0.0007418798,0.0010860856,0.007981098],"category_scores_gemma":[0.0036317587,0.0005007221,0.0005418915,0.0024867968,0.003931103,0.0034504558,0.0010280958,0.0022564952,0.0009171365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013956206,0.00000943361,0.000035606117,0.000018922678,0.0000030101264,0.000056317636,0.00011118505,0.0010257364,0.0005159458,0.9944501,0.00061922736,0.003140491],"study_design_scores_gemma":[0.000004430235,0.0000085624415,0.000039535847,0.000006777998,0.0000020300454,0.000075860735,0.000031804106,0.0037236658,0.0002545434,0.9942015,0.0016427452,0.000008574667],"about_ca_topic_score_codex":0.0005778028,"about_ca_topic_score_gemma":0.0005739609,"teacher_disagreement_score":0.007981098,"about_ca_system_score_codex":0.0007433306,"about_ca_system_score_gemma":0.0004970744,"threshold_uncertainty_score":0.026699424},"labels":[],"label_agreement":null},{"id":"W1986793172","doi":"10.1002/jcd.998","title":"Existence of (q, 7, 1) difference families with q a prime power","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Prime power; Combinatorics; Prime (order theory); Character (mathematics); Discrete mathematics; Arithmetic; Geometry","score_opus":0.017603726356398626,"score_gpt":0.19152062674963516,"score_spread":0.17391690039323654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986793172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93185943,0.0003080012,0.05026654,0.0006752945,0.00008275506,0.00006795169,0.00024239424,0.00015080212,0.016346756],"genre_scores_gemma":[0.98463917,0.00009820347,0.012428641,0.00011521063,0.000038825765,0.0000675611,0.00021112616,0.000019045965,0.0023821348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985532,0.00037192286,0.00009923822,0.0002635789,0.00036484716,0.00034711682],"domain_scores_gemma":[0.99598926,0.002156186,0.00052896206,0.00041339017,0.000540371,0.0003718571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015133028,0.00026920438,0.00053121086,0.0008953072,0.0019576848,0.0013596066,0.0005614065,0.00085622247,0.004515615],"category_scores_gemma":[0.0050477465,0.00041460176,0.0005107596,0.0005065205,0.0013265623,0.0018296962,0.0014854225,0.0010470608,0.0007057919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018092296,0.000270586,0.020109287,0.00024434456,0.00007059654,0.0021823589,0.0019925188,0.005962589,0.059931282,0.82975173,0.0037641458,0.073911294],"study_design_scores_gemma":[0.0006102812,0.0011716902,0.0073945965,0.00016909103,0.00011285192,0.008385408,0.0013410382,0.03335319,0.103208,0.8039669,0.040091265,0.00019565973],"about_ca_topic_score_codex":0.000140469,"about_ca_topic_score_gemma":0.00010760014,"teacher_disagreement_score":0.004515615,"about_ca_system_score_codex":0.00083396584,"about_ca_system_score_gemma":0.00048493667,"threshold_uncertainty_score":0.015106261},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8208136,0.0011103551,0.07694426,0.0010509387,0.00031861803,0.00012301285,0.0007175082,0.00023506912,0.098686695],"genre_scores_gemma":[0.96930444,0.00033250317,0.01159419,0.00019918424,0.00013862072,0.00007498922,0.00035519165,0.00005633578,0.017944474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976224,0.00005898461,0.000009357559,0.000053537904,0.000053171043,0.000062651634],"domain_scores_gemma":[0.99947923,0.00014804908,0.000117956464,0.00006704082,0.00008195578,0.00010583184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018448423,0.0003934497,0.00040423535,0.0010297108,0.0009105916,0.0010746092,0.00062311505,0.00082874857,0.009326388],"category_scores_gemma":[0.0010432652,0.00024196232,0.00038084597,0.0006738616,0.0009455479,0.0010856848,0.0006918355,0.00069885055,0.00054001826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055919183,0.00002535178,0.00023659154,0.000042355783,0.000010996837,0.00013452928,0.00014795554,0.0057862923,0.0028798047,0.9826103,0.0020405515,0.0060294233],"study_design_scores_gemma":[0.000033786393,0.000039711587,0.00047610005,0.000014395086,0.000008832506,0.00012238973,0.00010465235,0.028754659,0.0011829454,0.96564406,0.0035963217,0.000022185674],"about_ca_topic_score_codex":0.0020426237,"about_ca_topic_score_gemma":0.002200091,"teacher_disagreement_score":0.009326388,"about_ca_system_score_codex":0.0008020985,"about_ca_system_score_gemma":0.00056336756,"threshold_uncertainty_score":0.031199932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7850548,0.0006185454,0.19276491,0.0005230362,0.000043841213,0.0000798936,0.0014041442,0.00041810266,0.01909269],"genre_scores_gemma":[0.91461545,0.0004464569,0.07809862,0.00014679055,0.000053236916,0.00014312033,0.0021842408,0.00018975303,0.0041223564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985936,0.0003610759,0.0000865286,0.00030632995,0.00033194516,0.00032050212],"domain_scores_gemma":[0.9894756,0.006899455,0.0010364072,0.001490858,0.0005304011,0.000567265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009589859,0.00075447105,0.0016212118,0.0014510612,0.0018956782,0.003260484,0.0015284743,0.001508917,0.004618025],"category_scores_gemma":[0.0070045013,0.0014829244,0.0015255234,0.002008946,0.0014120425,0.004480132,0.00227459,0.0023459676,0.0007244601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012006989,0.00027807913,0.0064917025,0.00085939845,0.00030940498,0.0010236293,0.0034297213,0.07252983,0.028387161,0.8075447,0.007920038,0.070025705],"study_design_scores_gemma":[0.000107851854,0.00013346254,0.0019353136,0.00012981234,0.000116435855,0.0010150864,0.0010035652,0.08540961,0.01532789,0.8880203,0.0067456285,0.00005509069],"about_ca_topic_score_codex":0.00055185996,"about_ca_topic_score_gemma":0.00080466113,"teacher_disagreement_score":0.004618025,"about_ca_system_score_codex":0.0009410407,"about_ca_system_score_gemma":0.00063661,"threshold_uncertainty_score":0.015448809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050897956,0.0040608714,0.8216376,0.004973788,0.00078306254,0.00021759259,0.0010551603,0.00071659224,0.11565744],"genre_scores_gemma":[0.6940046,0.004811223,0.25667715,0.0030196833,0.00264951,0.0010565177,0.002864802,0.0015396274,0.033376902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907568,0.003089316,0.00036947677,0.001241701,0.0031691832,0.001373626],"domain_scores_gemma":[0.9643993,0.028337922,0.0011803479,0.0025034216,0.0025757304,0.0010033468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070991437,0.0023130355,0.0030371407,0.004111151,0.0020555465,0.010006591,0.0057120137,0.00333734,0.017484106],"category_scores_gemma":[0.03949549,0.0010021654,0.0023392832,0.004585396,0.0040158452,0.012882737,0.005243351,0.012173232,0.0024783034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037824223,0.00033624045,0.000504944,0.00030692425,0.00007092336,0.00009383121,0.00029397252,0.045716133,0.0015010745,0.87874675,0.012622554,0.0594283],"study_design_scores_gemma":[0.000045014778,0.000077269535,0.0002727046,0.00007255023,0.00003436007,0.00005500587,0.00008738443,0.17884627,0.0010956116,0.8159595,0.0034223092,0.00003210579],"about_ca_topic_score_codex":0.0018981664,"about_ca_topic_score_gemma":0.001722859,"teacher_disagreement_score":0.017484106,"about_ca_system_score_codex":0.004650256,"about_ca_system_score_gemma":0.0024850634,"threshold_uncertainty_score":0.058490157},"labels":[],"label_agreement":null},{"id":"W1989084180","doi":"10.1002/jcd.1014","title":"Necessary existence criteria for mandatory representation designs MRD (4, k; ν)","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Pairwise comparison; Combinatorics; Block (permutation group theory); Representation (politics); Combinatorial design; Block design; Set (abstract data type); Discrete mathematics; Statistics; Computer science; Law","score_opus":0.06290992553931898,"score_gpt":0.30640907384357857,"score_spread":0.2434991483042596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989084180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39778778,0.001136953,0.56553227,0.0018664466,0.00016551933,0.0005139277,0.0016012427,0.0010039308,0.03039206],"genre_scores_gemma":[0.8336017,0.00028636874,0.15952133,0.000276663,0.00016766223,0.0008310524,0.0009923485,0.00013494208,0.0041879956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98891604,0.0047571696,0.001149898,0.0018920754,0.0022943586,0.000990527],"domain_scores_gemma":[0.88417214,0.080942914,0.012508221,0.0058396077,0.01248902,0.004048104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009340262,0.001274322,0.0016415204,0.002464002,0.0012202709,0.002171654,0.0015958946,0.002782998,0.013373282],"category_scores_gemma":[0.077338286,0.0016003235,0.0010434347,0.00119428,0.0024778224,0.004349676,0.0029728992,0.0019206227,0.0021695925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047561084,0.000788269,0.017101763,0.001398636,0.00020842525,0.0013617022,0.0013086947,0.054627042,0.043550946,0.7671518,0.009371394,0.09837516],"study_design_scores_gemma":[0.0014474742,0.0054710866,0.007310717,0.0007744521,0.00026569038,0.0035562303,0.0013834413,0.30969453,0.06517246,0.57869005,0.02589162,0.00034220406],"about_ca_topic_score_codex":0.00035321864,"about_ca_topic_score_gemma":0.00047426598,"teacher_disagreement_score":0.013373282,"about_ca_system_score_codex":0.001457034,"about_ca_system_score_gemma":0.0011934157,"threshold_uncertainty_score":0.049396574},"labels":[],"label_agreement":null},{"id":"W1989666997","doi":"10.1002/jcd.20012","title":"Weaving hadamard matrices with maximum excess and classes with small excess","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Manitoba","funders":"","keywords":"Hadamard transform; Hadamard matrix; Complex Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Combinatorics; Hadamard's inequality; Hadamard product; Matrix (chemical analysis); Order (exchange); Weaving; Kronecker product; Kronecker delta; Mathematical analysis; Composite material; Physics; Materials science","score_opus":0.013795336902620707,"score_gpt":0.19825136723104436,"score_spread":0.18445603032842364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989666997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.482054,0.00042546343,0.47375086,0.000337981,0.0001518599,0.00010906477,0.00016826057,0.0009848902,0.042017672],"genre_scores_gemma":[0.88251686,0.00022123777,0.10795689,0.00011934097,0.00010047467,0.0001101068,0.00027457127,0.00026075065,0.0084398305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985617,0.00024461152,0.00013889698,0.00023110308,0.0005277461,0.00029603532],"domain_scores_gemma":[0.99667656,0.001397922,0.00036483444,0.00084563636,0.00040572838,0.0003092034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009133152,0.00071628805,0.0005082078,0.001695733,0.001378612,0.0017872237,0.0005939221,0.00063686824,0.0061009326],"category_scores_gemma":[0.002832041,0.0005158323,0.0010471172,0.0008682321,0.0019190557,0.0024124242,0.0018946779,0.0017364332,0.0010242879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020179937,0.0001199045,0.0020992511,0.00013419038,0.000029121182,0.0004575517,0.00047574556,0.013535874,0.065847,0.8668894,0.0017150181,0.0484951],"study_design_scores_gemma":[0.000049835515,0.0003136731,0.0020862268,0.00008158115,0.000041466472,0.00084451796,0.00024669088,0.059155557,0.14039898,0.7678854,0.028789012,0.000107038584],"about_ca_topic_score_codex":0.0006665934,"about_ca_topic_score_gemma":0.00078172394,"teacher_disagreement_score":0.0061009326,"about_ca_system_score_codex":0.0009012346,"about_ca_system_score_gemma":0.0003428006,"threshold_uncertainty_score":0.020409644},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014094578,0.0002302433,0.9965739,0.00004984073,0.000056531862,0.000027876515,0.000028666198,0.00019107254,0.001432445],"genre_scores_gemma":[0.12741512,0.0014804472,0.86230665,0.0003346323,0.00017008191,0.00033177904,0.00021830952,0.0006830389,0.007059859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983997,0.0003288812,0.00009129,0.00021057992,0.0009099434,0.000059729722],"domain_scores_gemma":[0.997717,0.0010858632,0.00022722801,0.00042808815,0.0005128516,0.00002898138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014666079,0.0013604338,0.00087593414,0.0024594013,0.00048808832,0.0011304143,0.0019765678,0.0009552225,0.0029084592],"category_scores_gemma":[0.007036597,0.0004282709,0.00095341454,0.0010292993,0.0010349088,0.0029814509,0.0007653579,0.002018088,0.0016007547],"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.00009767413,0.00014150415,0.0007473913,0.00067676057,0.00017523977,0.0002492674,0.00021289277,0.2899994,0.09770953,0.4526106,0.0039428254,0.15343688],"study_design_scores_gemma":[0.000015860254,0.000057713547,0.00030267145,0.00004703489,0.000038082242,0.00036549976,0.000016601018,0.91954017,0.025175126,0.04386268,0.010513953,0.00006464159],"about_ca_topic_score_codex":0.00074772973,"about_ca_topic_score_gemma":0.00059579423,"teacher_disagreement_score":0.0029084592,"about_ca_system_score_codex":0.00085530954,"about_ca_system_score_gemma":0.000648085,"threshold_uncertainty_score":0.009729803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037976768,0.0069069276,0.6093768,0.03152003,0.0063210246,0.00009962065,0.0014992295,0.00043557477,0.30586413],"genre_scores_gemma":[0.6501194,0.009425386,0.21269129,0.016562272,0.009925268,0.00041766677,0.000927982,0.0006838407,0.09924686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989778,0.00032291215,0.00005109475,0.0002248139,0.00032986747,0.000093615796],"domain_scores_gemma":[0.9976586,0.001429597,0.00012885898,0.00020307385,0.0004139638,0.00016587987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015912267,0.00075822807,0.0008617883,0.0015060919,0.002114234,0.0034139017,0.0016104631,0.001692927,0.014289025],"category_scores_gemma":[0.005025907,0.00032211174,0.00083765085,0.0011270521,0.00482229,0.005240651,0.002104265,0.005651807,0.0016980619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001638204,0.00000481133,0.00006385132,0.000034335633,0.0000026666087,0.000086345615,0.00012766178,0.0002912392,0.0004316974,0.9880052,0.006406722,0.0045290175],"study_design_scores_gemma":[0.0000090464955,0.000022906645,0.00020334216,0.000026633086,0.00000444778,0.00023359229,0.000096518874,0.0029130392,0.00042250907,0.96830887,0.027735705,0.000023383065],"about_ca_topic_score_codex":0.002454877,"about_ca_topic_score_gemma":0.0011876741,"teacher_disagreement_score":0.014289025,"about_ca_system_score_codex":0.0006486498,"about_ca_system_score_gemma":0.00041069565,"threshold_uncertainty_score":0.047801554},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009207412,0.00017422618,0.98672885,0.00013595172,0.00011432114,0.00025160858,0.00020358658,0.00034768076,0.0028363282],"genre_scores_gemma":[0.21075214,0.00034417375,0.779021,0.000607331,0.00042048137,0.002127439,0.0006257457,0.0001592592,0.0059424383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96389115,0.023426099,0.001863582,0.005144862,0.0047570216,0.0009172923],"domain_scores_gemma":[0.8752746,0.0777206,0.0055759754,0.03360227,0.006458958,0.0013676549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029056204,0.0014487588,0.003042609,0.0012849664,0.0012189675,0.0018655999,0.0023384253,0.0024609282,0.01119238],"category_scores_gemma":[0.082309864,0.0023151075,0.0024902332,0.0021129015,0.0027160482,0.00395028,0.002788881,0.0025642263,0.00369708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046687224,0.00047677243,0.006992519,0.0013818284,0.0013460495,0.0006950915,0.000691967,0.04754277,0.02345995,0.5562125,0.008157086,0.34837478],"study_design_scores_gemma":[0.0013616028,0.00225686,0.004207864,0.00019241299,0.0009133526,0.0012790697,0.00011580965,0.2286166,0.007570887,0.73170763,0.021590639,0.00018713194],"about_ca_topic_score_codex":0.0003603969,"about_ca_topic_score_gemma":0.0010081423,"teacher_disagreement_score":0.029056204,"about_ca_system_score_codex":0.00066129206,"about_ca_system_score_gemma":0.0023555637,"threshold_uncertainty_score":0.15366572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92671585,0.0006634668,0.033233564,0.0011933078,0.000071496936,0.00003505842,0.0005270157,0.00015093021,0.037409324],"genre_scores_gemma":[0.9929207,0.00033526574,0.0035401327,0.0000655331,0.00006445081,0.000043668944,0.00025261153,0.000038197093,0.002739367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995018,0.000115556526,0.000020317846,0.00010700797,0.00015314625,0.00010214862],"domain_scores_gemma":[0.9961682,0.0024132743,0.00045440288,0.00024088893,0.00020649054,0.0005167631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005731835,0.00035170256,0.00071266195,0.0013950812,0.000894259,0.0025160643,0.0008427299,0.0008444106,0.007270194],"category_scores_gemma":[0.0039439774,0.00039777774,0.00038282492,0.00063375995,0.0024709252,0.0027184542,0.0014101268,0.0010922872,0.00029487474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035636796,0.00007038641,0.0035191916,0.000264551,0.00004802702,0.0003788365,0.00040868833,0.037751224,0.009369393,0.9307504,0.003829545,0.013253409],"study_design_scores_gemma":[0.00010197681,0.00012465788,0.0056722984,0.000097352895,0.00005219708,0.00065178913,0.0005704737,0.14600492,0.007328853,0.8334997,0.005836995,0.000058659003],"about_ca_topic_score_codex":0.00056512054,"about_ca_topic_score_gemma":0.00039895438,"teacher_disagreement_score":0.007270194,"about_ca_system_score_codex":0.0007222655,"about_ca_system_score_gemma":0.0002444292,"threshold_uncertainty_score":0.024321198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74664515,0.0003320049,0.15303321,0.0013361851,0.00014518994,0.0001656896,0.0025255773,0.00036340143,0.095453605],"genre_scores_gemma":[0.95627636,0.00022825696,0.022997895,0.00024489377,0.000057379933,0.00016022066,0.0022156732,0.00006948086,0.017749948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987914,0.00031633695,0.00005844785,0.0002827959,0.00019394838,0.00035712292],"domain_scores_gemma":[0.99200505,0.0041748374,0.0009154443,0.0004460458,0.00068245817,0.0017761801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095471035,0.0005648666,0.0011072747,0.0010347634,0.003383063,0.0041756225,0.00092998816,0.0011981769,0.020014172],"category_scores_gemma":[0.006335426,0.00070482364,0.0010329585,0.0015158729,0.0010772737,0.001949161,0.0017292202,0.0012709378,0.0016450235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010111516,0.00027427755,0.009701507,0.00033638036,0.00023585063,0.001362727,0.0010819278,0.012046256,0.0049055605,0.91715664,0.020086084,0.031801607],"study_design_scores_gemma":[0.0004724309,0.00026356804,0.006752105,0.00009547159,0.00013824242,0.001600795,0.0011144826,0.078494735,0.0032943604,0.887548,0.020137805,0.0000879595],"about_ca_topic_score_codex":0.0024217004,"about_ca_topic_score_gemma":0.0041955807,"teacher_disagreement_score":0.020014172,"about_ca_system_score_codex":0.000985748,"about_ca_system_score_gemma":0.0007993113,"threshold_uncertainty_score":0.06695408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6369485,0.0029212672,0.24690121,0.002583675,0.00019922081,0.00058754056,0.005317056,0.0025381306,0.10200338],"genre_scores_gemma":[0.91869617,0.0016350895,0.06555946,0.0005318021,0.00011369779,0.00095404126,0.0020064681,0.0002582374,0.010245066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763155,0.00073497155,0.00014855876,0.0003224982,0.000635618,0.0005267122],"domain_scores_gemma":[0.9914636,0.004799219,0.0012959176,0.00083387777,0.0009636018,0.0006436528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735141,0.001590651,0.0016385035,0.0032168436,0.0015433141,0.0041626035,0.0009938949,0.0019755512,0.007793696],"category_scores_gemma":[0.009867073,0.0007480031,0.0006773837,0.0013072871,0.0020553959,0.0025791395,0.0019264055,0.0012888935,0.0024500077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006487551,0.0011974508,0.008062024,0.002129439,0.0005291958,0.0015593392,0.0015811033,0.035873648,0.100151196,0.6058533,0.02516394,0.21141174],"study_design_scores_gemma":[0.0013759556,0.0021996726,0.007495463,0.0010206284,0.0003917111,0.0032118824,0.0011643133,0.15878128,0.08029069,0.69751364,0.046238106,0.0003166503],"about_ca_topic_score_codex":0.0005291579,"about_ca_topic_score_gemma":0.00036922656,"teacher_disagreement_score":0.007793696,"about_ca_system_score_codex":0.00072223734,"about_ca_system_score_gemma":0.0013546054,"threshold_uncertainty_score":0.026072502},"labels":[],"label_agreement":null},{"id":"W1993163310","doi":"10.1002/jcd.20086","title":"Common intersection designs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Disjoint sets; Mathematics; Combinatorial design; Block (permutation group theory); Set (abstract data type); Block design; Combinatorics; Function (biology); Discrete mathematics; Computer science; Engineering","score_opus":0.019869379363056817,"score_gpt":0.23518324999577622,"score_spread":0.2153138706327194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993163310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07854868,0.0006426089,0.86981905,0.00036248434,0.00017200042,0.00036181137,0.00037789985,0.00044978326,0.049265817],"genre_scores_gemma":[0.68506366,0.00034351888,0.3014688,0.0002742123,0.00016695942,0.0005194089,0.00042557763,0.00014763627,0.011590293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914213,0.0027877644,0.00058106816,0.0018871145,0.0023493234,0.00097332837],"domain_scores_gemma":[0.9881054,0.0031128724,0.001677368,0.0034824267,0.002920569,0.00070140127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036577205,0.0009571034,0.0011339049,0.0022331933,0.0017832282,0.0032817146,0.0019662478,0.0013644886,0.012293367],"category_scores_gemma":[0.008085837,0.0008795396,0.0010869757,0.0025273375,0.0027487774,0.003711879,0.0034187003,0.0016832727,0.0018051321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047127446,0.00014366454,0.0017537293,0.0002050811,0.00013888595,0.00015819038,0.00035520847,0.04718795,0.010427117,0.83317965,0.0041284277,0.10185086],"study_design_scores_gemma":[0.00023966431,0.0009851984,0.00077882997,0.00014489774,0.00015387493,0.0010809767,0.00030825732,0.18255098,0.026038175,0.71894234,0.06865964,0.00011706769],"about_ca_topic_score_codex":0.0005698039,"about_ca_topic_score_gemma":0.0007008163,"teacher_disagreement_score":0.012293367,"about_ca_system_score_codex":0.0019901425,"about_ca_system_score_gemma":0.0012696981,"threshold_uncertainty_score":0.041125417},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21059652,0.0010502129,0.7450262,0.00056166574,0.0001553846,0.00012208798,0.00023832808,0.00045119406,0.041798443],"genre_scores_gemma":[0.7862225,0.0009709949,0.19521515,0.000404928,0.00014116256,0.00029988575,0.00030781908,0.00012438688,0.016313197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989254,0.0004007038,0.00005322421,0.00015565485,0.000284024,0.00018100208],"domain_scores_gemma":[0.99710506,0.0015075756,0.00037189422,0.00058931304,0.0002531239,0.00017297013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008862929,0.0008048974,0.00065907394,0.0009447473,0.0007035224,0.0014478258,0.00071140117,0.0012200344,0.004089666],"category_scores_gemma":[0.0043669096,0.0007093279,0.00047842402,0.0016512249,0.0009043873,0.0015396505,0.0010886198,0.00088074344,0.0007987022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045865297,0.00012321695,0.0011034742,0.00020563761,0.000062654115,0.0003259951,0.00028343708,0.101542085,0.017798454,0.7742022,0.0047266395,0.099167585],"study_design_scores_gemma":[0.00010976723,0.00030995643,0.00065832364,0.00007512651,0.00006245301,0.00061422965,0.000114089584,0.34295756,0.013183643,0.6272544,0.0146134775,0.000047000955],"about_ca_topic_score_codex":0.00064339675,"about_ca_topic_score_gemma":0.0006885395,"teacher_disagreement_score":0.004089666,"about_ca_system_score_codex":0.0008016461,"about_ca_system_score_gemma":0.0005846981,"threshold_uncertainty_score":0.013681233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12326922,0.0024971897,0.8047191,0.0014911293,0.00094772864,0.00015600612,0.00022801074,0.0004154133,0.066276215],"genre_scores_gemma":[0.5645303,0.0016698505,0.390201,0.0009683031,0.0008661757,0.00032174477,0.00042420963,0.0003666162,0.040651683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993412,0.00024580045,0.000030515346,0.00012798538,0.00019498567,0.000059517533],"domain_scores_gemma":[0.99879164,0.0006315687,0.00011469671,0.00017301567,0.00018318713,0.0001058669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094686856,0.00085459393,0.00072761136,0.0018509801,0.00151558,0.0019789264,0.0011772763,0.0014014408,0.010284889],"category_scores_gemma":[0.00606377,0.0005161202,0.0007309637,0.001831851,0.0013442829,0.0030467007,0.0017491824,0.0016191909,0.0013104797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013974175,0.00005953212,0.0005341382,0.00014308825,0.000029973198,0.00016490463,0.00019574993,0.016540235,0.0020360975,0.9209875,0.0055388217,0.053630304],"study_design_scores_gemma":[0.000054227487,0.000067645,0.0003135284,0.000045747594,0.000028719693,0.0003759477,0.000087189364,0.16702248,0.0021928754,0.8173768,0.012396411,0.000038556565],"about_ca_topic_score_codex":0.0003401607,"about_ca_topic_score_gemma":0.00050550135,"teacher_disagreement_score":0.010284889,"about_ca_system_score_codex":0.0007669857,"about_ca_system_score_gemma":0.00061637117,"threshold_uncertainty_score":0.034406424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6715329,0.004271617,0.09589683,0.0044583348,0.00092288497,0.00008449104,0.0004922893,0.00029048076,0.2220502],"genre_scores_gemma":[0.9562005,0.0030935365,0.0089883525,0.00052181253,0.00048920093,0.000073269126,0.00024524218,0.00010623267,0.03028177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927145,0.00019592472,0.000024741246,0.000103798026,0.00019569426,0.00020835978],"domain_scores_gemma":[0.9987203,0.00053147675,0.0003284529,0.00012294161,0.000121462814,0.00017538734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079735427,0.0012908132,0.0006055641,0.0020511507,0.0014758448,0.001955025,0.00063069287,0.0010559064,0.008481048],"category_scores_gemma":[0.0016539255,0.00028347687,0.00062174676,0.0011030865,0.0034933002,0.0026494737,0.0018728559,0.0013339911,0.001367598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019711537,0.000057456535,0.00044480278,0.000059503505,0.000016314661,0.0003414359,0.00067128864,0.0051017953,0.0049632103,0.9697897,0.0017073766,0.016650146],"study_design_scores_gemma":[0.00005626114,0.00010992247,0.00088836055,0.00007396241,0.000021717677,0.00030567145,0.0001679609,0.017956086,0.0031497746,0.9711882,0.006028898,0.000053245953],"about_ca_topic_score_codex":0.0016169994,"about_ca_topic_score_gemma":0.0016191731,"teacher_disagreement_score":0.008481048,"about_ca_system_score_codex":0.0009541329,"about_ca_system_score_gemma":0.0008206688,"threshold_uncertainty_score":0.02837193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30952197,0.0014736215,0.6063454,0.00057538756,0.0003552386,0.00014165092,0.000857338,0.00039264877,0.08033676],"genre_scores_gemma":[0.8125122,0.0011136486,0.14994413,0.00038927005,0.000322459,0.00017525941,0.0011250557,0.00032718203,0.03409076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997392,0.00006355128,0.000016994516,0.0000518197,0.000076484626,0.000051854946],"domain_scores_gemma":[0.9991585,0.00024946666,0.00013266192,0.00012688542,0.00019127454,0.0001412075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003506025,0.0006007651,0.0005654139,0.0019561567,0.0009180947,0.0016845248,0.00062411686,0.00064877875,0.004849168],"category_scores_gemma":[0.0013331211,0.0005626952,0.00081011595,0.00089488155,0.0007848428,0.0013408898,0.0006914858,0.0011822387,0.00078656187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005071674,0.000028578133,0.00020567153,0.00005359044,0.000016558315,0.00016424138,0.0002275326,0.008657667,0.0047991294,0.97290707,0.0023704886,0.010518865],"study_design_scores_gemma":[0.000014478492,0.000023740411,0.00039383676,0.000029589464,0.000014898481,0.00020827615,0.000102255384,0.043757647,0.0013414727,0.9487214,0.0053734086,0.000018985247],"about_ca_topic_score_codex":0.0006931944,"about_ca_topic_score_gemma":0.0011734404,"teacher_disagreement_score":0.004849168,"about_ca_system_score_codex":0.0005723275,"about_ca_system_score_gemma":0.00036691662,"threshold_uncertainty_score":0.01622206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6159071,0.000933824,0.3187275,0.0012014959,0.00020409958,0.00007679617,0.00031706123,0.00029157533,0.062340565],"genre_scores_gemma":[0.94426197,0.00038132002,0.03824229,0.00018728166,0.00009869201,0.00008379253,0.00022538878,0.00005823001,0.016461005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994879,0.00011535299,0.000031893065,0.00013625075,0.0001128584,0.000115729614],"domain_scores_gemma":[0.99667335,0.0016053476,0.00047702223,0.00023555473,0.000539884,0.000468802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007258547,0.0006503078,0.0005228105,0.0013686371,0.0012925281,0.0021438336,0.0008177325,0.0010708485,0.0045761704],"category_scores_gemma":[0.0039599636,0.00045786708,0.0005098201,0.0007729288,0.0015671343,0.002514875,0.0017078527,0.0017455925,0.0007617325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015950456,0.000023686855,0.00041890267,0.00004782317,0.000010639433,0.00015949953,0.00029661605,0.0026815971,0.009130952,0.9779011,0.0005418285,0.008627867],"study_design_scores_gemma":[0.00006440631,0.0001007699,0.00069103524,0.000042695814,0.000019220153,0.0003899724,0.00029477788,0.03422731,0.0070497054,0.9511479,0.0059320023,0.000040209],"about_ca_topic_score_codex":0.00048803573,"about_ca_topic_score_gemma":0.00041780437,"teacher_disagreement_score":0.0045761704,"about_ca_system_score_codex":0.0007083484,"about_ca_system_score_gemma":0.0005820858,"threshold_uncertainty_score":0.015308857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99369097,0.000069327405,0.0044887075,0.0000405904,0.000020274412,0.000022802527,0.00003992971,0.00009328951,0.0015341961],"genre_scores_gemma":[0.9925581,0.000044129545,0.0067128455,0.000008757267,0.0000063514885,0.0000095001415,0.000024569687,0.0000072125913,0.00062852254],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996325,0.000061337334,0.000013451772,0.000051147646,0.00018258634,0.000059050624],"domain_scores_gemma":[0.99953043,0.0001708403,0.00005791052,0.000071081595,0.000095072704,0.00007470018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037991948,0.000301482,0.00019339674,0.00016015257,0.000376663,0.0002780376,0.00054175156,0.00048071105,0.0011972585],"category_scores_gemma":[0.0007799129,0.00023876718,0.00010753869,0.00020377155,0.00059276586,0.00032645382,0.00043662605,0.000422529,0.00017328124],"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.00017084306,0.00007946335,0.0006345024,0.00003001366,0.000008682194,0.00012488435,0.00009159688,0.00041345585,0.9950841,0.0007549418,0.00006109884,0.0025465027],"study_design_scores_gemma":[0.00003876633,0.00035128754,0.0013250533,0.0000035721273,0.000010228136,0.00012510394,0.000021515294,0.0053900653,0.9920568,0.000086916436,0.0005835557,0.0000071300738],"about_ca_topic_score_codex":0.0017403639,"about_ca_topic_score_gemma":0.0018911436,"teacher_disagreement_score":0.0017403639,"about_ca_system_score_codex":0.00030421917,"about_ca_system_score_gemma":0.00025032752,"threshold_uncertainty_score":0.0040051937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020657089,0.00053683855,0.9925263,0.00021150014,0.00011583793,0.000016960277,0.00009808169,0.00021982427,0.004208939],"genre_scores_gemma":[0.20988913,0.001809716,0.76603985,0.0006581174,0.0005764826,0.000117670366,0.0009053128,0.00028810732,0.019715639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981237,0.0006549529,0.00007028799,0.00052965194,0.0004870895,0.00013425917],"domain_scores_gemma":[0.99735475,0.0015184314,0.00025804088,0.00041242014,0.00038933664,0.00006701089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013083789,0.0011570482,0.0015187258,0.00068926264,0.000729673,0.0019438048,0.0011445387,0.0012443075,0.006150161],"category_scores_gemma":[0.007950538,0.00048752312,0.0005288445,0.0014311315,0.001074599,0.0019541895,0.0016898321,0.0013684859,0.0032092258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026033405,0.00008047514,0.0010182672,0.00045510335,0.00013672998,0.00023501083,0.00015210429,0.4422857,0.0067877723,0.119407594,0.012195104,0.41698584],"study_design_scores_gemma":[0.000023145165,0.0000740511,0.00025851183,0.000045305573,0.00002195599,0.00022376579,0.00006669741,0.91754705,0.0038111336,0.060938016,0.016955556,0.00003478194],"about_ca_topic_score_codex":0.0015419187,"about_ca_topic_score_gemma":0.0013618013,"teacher_disagreement_score":0.006150161,"about_ca_system_score_codex":0.00050943415,"about_ca_system_score_gemma":0.0008742803,"threshold_uncertainty_score":0.020574331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385669,0.000350902,0.100571916,0.0023080597,0.00032492122,0.00009352425,0.00037446915,0.0002269483,0.057182383],"genre_scores_gemma":[0.9626895,0.00010959962,0.025567792,0.0002410333,0.00007529217,0.000033095603,0.00015060882,0.00004005737,0.011093001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997309,0.00007456987,0.000011667806,0.00006162428,0.00006357063,0.000057672558],"domain_scores_gemma":[0.99922824,0.00033740257,0.00009474026,0.000097755656,0.00010335439,0.00013854438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029109212,0.00040428623,0.00051869417,0.00076231384,0.0010768283,0.0013981741,0.00060328376,0.0014718839,0.004399979],"category_scores_gemma":[0.0014695409,0.0003557093,0.0003454776,0.0007642679,0.0011311166,0.0013663957,0.00052453735,0.001184315,0.00037787578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003233018,0.00007579132,0.00053930335,0.00005920889,0.000017415285,0.0013300484,0.00036124513,0.0034291379,0.014422223,0.9701905,0.0024523458,0.0067994515],"study_design_scores_gemma":[0.0000943867,0.000100489924,0.0006935359,0.000018794115,0.000024066712,0.0009969445,0.00027511496,0.043919973,0.0060373736,0.94177127,0.0060133487,0.000054768137],"about_ca_topic_score_codex":0.00095255836,"about_ca_topic_score_gemma":0.001394741,"teacher_disagreement_score":0.004399979,"about_ca_system_score_codex":0.0005874624,"about_ca_system_score_gemma":0.00047582417,"threshold_uncertainty_score":0.014719427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3266673,0.001171194,0.43718675,0.0026836589,0.0014987087,0.00020114183,0.0016050157,0.0015554966,0.22743066],"genre_scores_gemma":[0.8904595,0.00052431965,0.034931116,0.00045963138,0.00039507658,0.00013981249,0.0012265841,0.0003186088,0.07154534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993387,0.00011268927,0.000042348,0.000108113214,0.0002274654,0.00017072087],"domain_scores_gemma":[0.9987147,0.00021113567,0.00019262699,0.00017957327,0.0004279024,0.0002740749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056257076,0.00050953374,0.00061336457,0.0017792576,0.0014389285,0.0034887632,0.00055008417,0.0010947358,0.024841288],"category_scores_gemma":[0.0018059562,0.00033901192,0.0005952031,0.00080255605,0.0013974207,0.002853165,0.0021112775,0.0016643306,0.004410088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060408467,0.000025450905,0.0004046168,0.00004006629,0.000011819663,0.00025845948,0.00018331593,0.0026369148,0.0020704244,0.98057884,0.0056305304,0.008099096],"study_design_scores_gemma":[0.000039698494,0.00007697259,0.00068718207,0.000039791816,0.000016044798,0.00047200578,0.00046835517,0.032936614,0.0045595514,0.94232213,0.018328365,0.000053420066],"about_ca_topic_score_codex":0.0017102755,"about_ca_topic_score_gemma":0.0020198277,"teacher_disagreement_score":0.024841288,"about_ca_system_score_codex":0.0013025189,"about_ca_system_score_gemma":0.00091033144,"threshold_uncertainty_score":0.083102345},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02875211,0.00007389809,0.9678437,0.00014053276,0.000022477694,0.00005947366,0.00009382826,0.0006008695,0.0024131495],"genre_scores_gemma":[0.3662564,0.00014991523,0.62503034,0.00008323367,0.00006353921,0.00019209883,0.00034779334,0.0002462763,0.0076302956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993575,0.00013332436,0.000026475534,0.00012790364,0.00022957473,0.00012521056],"domain_scores_gemma":[0.99898916,0.00043932215,0.000096177435,0.00026432896,0.00013700918,0.000073944895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087969087,0.00058403757,0.00080583245,0.0009834971,0.0005904498,0.0009875651,0.00079067436,0.0005155806,0.0075954637],"category_scores_gemma":[0.00283497,0.00032990164,0.0005024581,0.00067315745,0.0009999665,0.0022643146,0.0012044774,0.0011265568,0.001655781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007075595,0.00014310492,0.0007523339,0.00015010832,0.000036444053,0.00014324447,0.00024990403,0.17828508,0.021612894,0.45712662,0.005842797,0.33495],"study_design_scores_gemma":[0.00009639348,0.0000935691,0.00015744127,0.000022092954,0.00000711643,0.00005949724,0.000040802763,0.70175534,0.010635428,0.28311488,0.00399366,0.000023751247],"about_ca_topic_score_codex":0.0013562933,"about_ca_topic_score_gemma":0.001820631,"teacher_disagreement_score":0.0075954637,"about_ca_system_score_codex":0.0008559276,"about_ca_system_score_gemma":0.0011518411,"threshold_uncertainty_score":0.025409281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45938882,0.00076058926,0.19141072,0.0014958954,0.0008384126,0.00014102935,0.0011056366,0.00068088656,0.34417796],"genre_scores_gemma":[0.93313867,0.00027878993,0.016177272,0.00039581492,0.00010654621,0.00006857225,0.0006009405,0.00009788388,0.049135353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963355,0.000060278908,0.000018321596,0.00007852193,0.000095155716,0.00011409194],"domain_scores_gemma":[0.9993864,0.0001084238,0.000075603646,0.00013529822,0.00013805465,0.00015614726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024390587,0.00037481778,0.00062369794,0.0010034416,0.0018511262,0.0022423398,0.00056171534,0.0009904461,0.018972564],"category_scores_gemma":[0.0009397818,0.00029926348,0.00035885838,0.00066655525,0.0011132541,0.0023065447,0.0019478209,0.0013626984,0.0019180457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005075729,0.00001406077,0.00013107735,0.000019538693,0.0000053897643,0.00007473037,0.00008841674,0.0013844635,0.0012673021,0.9898185,0.0020286553,0.0051171444],"study_design_scores_gemma":[0.00002634384,0.000040530394,0.00019998619,0.000017117301,0.000007864379,0.00015424287,0.00026702933,0.011541686,0.0021191018,0.97436136,0.011247583,0.000017097138],"about_ca_topic_score_codex":0.00075877924,"about_ca_topic_score_gemma":0.0008838157,"teacher_disagreement_score":0.018972564,"about_ca_system_score_codex":0.00062248233,"about_ca_system_score_gemma":0.00047489096,"threshold_uncertainty_score":0.06346959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4236071,0.0058385897,0.32567233,0.0036997343,0.0014004319,0.000143459,0.0017067897,0.0009039406,0.23702769],"genre_scores_gemma":[0.9025013,0.0029914076,0.056832884,0.00081657636,0.0012945898,0.00030177334,0.0017404404,0.0007788319,0.03274217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688005,0.00072045584,0.00021938584,0.00075587956,0.0008671762,0.00055708975],"domain_scores_gemma":[0.9911848,0.004214648,0.0014191978,0.0009465642,0.0012777441,0.0009570737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025850479,0.00166431,0.0009450264,0.0047205593,0.0021604337,0.004318826,0.0017525053,0.0015340304,0.015482853],"category_scores_gemma":[0.016414283,0.000998822,0.0011242144,0.0021975604,0.004088784,0.011028441,0.0040061222,0.0044250637,0.0040998086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013866079,0.000022346236,0.0006403519,0.00011804091,0.00001684355,0.00009509698,0.00042175755,0.002308402,0.000993599,0.9811654,0.0023871835,0.011692277],"study_design_scores_gemma":[0.000013638617,0.000046590783,0.00055333076,0.000079919766,0.00001744088,0.00011035124,0.00016643672,0.008806809,0.00191094,0.98234504,0.005902124,0.000047440797],"about_ca_topic_score_codex":0.0010875926,"about_ca_topic_score_gemma":0.0011289928,"teacher_disagreement_score":0.015482853,"about_ca_system_score_codex":0.002079454,"about_ca_system_score_gemma":0.00083279336,"threshold_uncertainty_score":0.051795244},"labels":[],"label_agreement":null},{"id":"W1995950135","doi":"10.1002/jcd.20221","title":"Generalized Hadamard matrices whose transposes are not generalized Hadamard matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Hadamard's inequality; Mathematics; Hadamard's maximal determinant problem; Hadamard product; Hadamard three-lines theorem; Combinatorics; Mathematical analysis","score_opus":0.01928377501370095,"score_gpt":0.23377073186798195,"score_spread":0.21448695685428099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995950135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19088434,0.0014459655,0.7174623,0.0033340023,0.0018378762,0.00019840356,0.0003812263,0.00069038634,0.08376555],"genre_scores_gemma":[0.7554146,0.00095051987,0.21113558,0.001834336,0.0004892934,0.00020255597,0.00036991792,0.00017548843,0.029427752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903476,0.00026032474,0.000057790687,0.00020135433,0.0003222405,0.00012350698],"domain_scores_gemma":[0.9980539,0.0005753207,0.0002041598,0.0005407873,0.00050206,0.00012380721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071956177,0.00064644445,0.0005056527,0.00057124137,0.0008408433,0.001545662,0.0007310079,0.0011153133,0.00702942],"category_scores_gemma":[0.0034877537,0.00038041815,0.0005653347,0.00064437336,0.0016150568,0.0020197413,0.00088823267,0.0016290698,0.0015129569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011251624,0.000021828206,0.00034808085,0.00010892029,0.000020829177,0.00037826126,0.00017349844,0.0036783097,0.014284972,0.951466,0.0045604142,0.024846356],"study_design_scores_gemma":[0.000055816057,0.00013611525,0.0003748108,0.00006171643,0.000022457463,0.0009876236,0.0001540443,0.029969843,0.01684595,0.92175686,0.029561492,0.00007319997],"about_ca_topic_score_codex":0.000497427,"about_ca_topic_score_gemma":0.0005056498,"teacher_disagreement_score":0.00702942,"about_ca_system_score_codex":0.0005429418,"about_ca_system_score_gemma":0.0004982233,"threshold_uncertainty_score":0.02351576},"labels":[],"label_agreement":null},{"id":"W1996390551","doi":"10.1002/jcd.20092","title":"Erratum to: Self‐dual codes and the (22,8,4) balanced incomplete block design","year":2005,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Block (permutation group theory); Arithmetic; Discrete mathematics; Philosophy; Linguistics","score_opus":0.014092883060217824,"score_gpt":0.2208217076198572,"score_spread":0.20672882455963937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996390551","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010790406,0.009997483,0.037290532,0.07886322,0.8030773,0.00017944151,0.002415337,0.0008584102,0.056527857],"genre_scores_gemma":[0.18342727,0.023980696,0.07881197,0.058732305,0.06167138,0.00042438647,0.0058409185,0.0016118473,0.5854993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990164,0.00016471495,0.00012720346,0.00011239613,0.0004968409,0.000082449296],"domain_scores_gemma":[0.99675035,0.0011086928,0.00023987397,0.000251019,0.0015406333,0.00010945854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097346347,0.001030622,0.0007384912,0.0013190227,0.0016782745,0.0011951244,0.0011170588,0.0020989648,0.02840991],"category_scores_gemma":[0.0122555075,0.00043882758,0.00045498356,0.0012754841,0.0010215626,0.0015022649,0.00068797247,0.0026416604,0.009765115],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023921387,0.000027957722,0.0003475039,0.00031176262,0.000018306397,0.001069772,0.0001581982,0.0011574067,0.0009815259,0.026846172,0.91248405,0.056358095],"study_design_scores_gemma":[0.000058826343,0.00011905765,0.0009195593,0.00042900603,0.000044581477,0.00192807,0.00025067074,0.0029292577,0.0036767588,0.02290344,0.9666599,0.00008083972],"about_ca_topic_score_codex":0.0027888892,"about_ca_topic_score_gemma":0.0063671228,"teacher_disagreement_score":0.02840991,"about_ca_system_score_codex":0.0014903239,"about_ca_system_score_gemma":0.0010404815,"threshold_uncertainty_score":0.09504056},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3713726,0.00043908245,0.55735254,0.00055638776,0.00022231412,0.00029514605,0.0011918027,0.0007844035,0.06778567],"genre_scores_gemma":[0.7390316,0.0005605062,0.22390245,0.0003326319,0.00012134033,0.00029095405,0.002034201,0.00024965705,0.033476714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992685,0.00013885603,0.000061411374,0.00023619442,0.00011906449,0.0001759181],"domain_scores_gemma":[0.99834085,0.0005621172,0.00020743744,0.00035105852,0.00022108867,0.00031743723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050604955,0.0005560457,0.00063833484,0.0016038785,0.0014236125,0.002268441,0.00061245245,0.0006641659,0.010288422],"category_scores_gemma":[0.0020489634,0.0006932833,0.0009409721,0.0012851371,0.0011348337,0.0021811053,0.0020428086,0.001526672,0.0017043459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015270378,0.00012851114,0.0009454861,0.00012846875,0.000030521798,0.00032656154,0.0006516548,0.0049925284,0.005078763,0.9447648,0.0037735773,0.039026488],"study_design_scores_gemma":[0.000040256797,0.000049004597,0.0005509501,0.00004527566,0.000034654084,0.00033387094,0.00033271918,0.018466782,0.00158205,0.96714836,0.01139596,0.000019995305],"about_ca_topic_score_codex":0.0011449902,"about_ca_topic_score_gemma":0.0022323297,"teacher_disagreement_score":0.010288422,"about_ca_system_score_codex":0.00062078517,"about_ca_system_score_gemma":0.0006514505,"threshold_uncertainty_score":0.034418166},"labels":[],"label_agreement":null},{"id":"W1997203758","doi":"10.1002/jcd.10002","title":"On the state of strength‐three covering arrays","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":130,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Michigan Technological University","keywords":"Mathematics; Combinatorics; Constructive; Product (mathematics); Column (typography); Order (exchange); Discrete mathematics; Computer science; Geometry","score_opus":0.02112653195116119,"score_gpt":0.19883430334844865,"score_spread":0.17770777139728747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997203758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5173348,0.0036977378,0.39410597,0.0040640314,0.00043251552,0.00011292271,0.0009406265,0.001173033,0.0781384],"genre_scores_gemma":[0.9539322,0.0010240431,0.03968774,0.0004381921,0.00020160565,0.00010427671,0.00047986044,0.00008526521,0.0040468634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773175,0.0006954221,0.00017098835,0.00034849948,0.00064255396,0.0004107943],"domain_scores_gemma":[0.9820164,0.012829832,0.0013334586,0.0020038183,0.0012977166,0.00051873206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558585,0.00046071477,0.00059586175,0.0011971496,0.0012483234,0.004165886,0.0009402757,0.0012944309,0.00630576],"category_scores_gemma":[0.012894829,0.00071015384,0.0006267076,0.001532323,0.002162111,0.0044569275,0.0018192243,0.0016114563,0.0010511652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000433398,0.00010206537,0.0020533446,0.00026593992,0.00005060955,0.00028214094,0.00056058035,0.046946492,0.014470111,0.86069155,0.005336037,0.068807706],"study_design_scores_gemma":[0.000064224914,0.00025176816,0.00081197306,0.00011698106,0.000062381856,0.000541223,0.0002956151,0.1974272,0.02849227,0.7493546,0.022488425,0.00009333473],"about_ca_topic_score_codex":0.0004869472,"about_ca_topic_score_gemma":0.0003154336,"teacher_disagreement_score":0.00630576,"about_ca_system_score_codex":0.0012373091,"about_ca_system_score_gemma":0.0005828342,"threshold_uncertainty_score":0.021094859},"labels":[],"label_agreement":null},{"id":"W1998402533","doi":"10.1002/jcd.20036","title":"Quintessential PBDs and PBDs with prime power block sizes ≥ 8","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Prime (order theory); Prime power; Combinatorics; Mathematics; Pairwise comparison; Set (abstract data type); Block (permutation group theory); Coprime integers; Discrete mathematics; Statistics; Computer science","score_opus":0.005941501822332705,"score_gpt":0.19282354696042872,"score_spread":0.186882045138096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998402533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42645338,0.001781042,0.5196824,0.0012276304,0.00022374078,0.00037039584,0.0006153526,0.00051363104,0.04913246],"genre_scores_gemma":[0.77580196,0.0010118764,0.21123347,0.00039177368,0.0001556023,0.0004671189,0.0006483158,0.00009566388,0.010194188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812275,0.00057579926,0.00016896741,0.0003533,0.00049078435,0.00028832536],"domain_scores_gemma":[0.9913304,0.005109912,0.0010310066,0.0014811691,0.00077502866,0.00027251095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024261754,0.00062141387,0.0006938937,0.0010398042,0.0009037792,0.0015878001,0.0008373054,0.0007216866,0.0077530863],"category_scores_gemma":[0.010508484,0.0005171539,0.00060318253,0.00074272265,0.001321882,0.0027968145,0.0013265668,0.0011952685,0.0011825868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017576341,0.00024267727,0.0041513173,0.00067984493,0.000116132025,0.00047089934,0.0005154122,0.06817537,0.0232114,0.7068428,0.0043604225,0.18947619],"study_design_scores_gemma":[0.0008254557,0.0015515018,0.0011978465,0.0003392152,0.00016205694,0.0016284358,0.00033383947,0.1805915,0.055713125,0.71150905,0.046053354,0.000094568546],"about_ca_topic_score_codex":0.00037733815,"about_ca_topic_score_gemma":0.0006178118,"teacher_disagreement_score":0.0077530863,"about_ca_system_score_codex":0.00072304346,"about_ca_system_score_gemma":0.00088279304,"threshold_uncertainty_score":0.025936604},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63205826,0.0023190822,0.294158,0.0017773644,0.00030388538,0.00007028198,0.00016534257,0.0003552367,0.06879259],"genre_scores_gemma":[0.9625317,0.0009960672,0.022646436,0.00024220896,0.00014413595,0.00004588004,0.000083890496,0.000042589563,0.013267129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984884,0.000041369265,0.0000062740387,0.000031515985,0.000036965874,0.000034957586],"domain_scores_gemma":[0.9993119,0.00034160216,0.00008958029,0.000072209565,0.000070358925,0.00011426742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027399138,0.00024179902,0.00041849873,0.0008329493,0.00092809036,0.0014153746,0.0004954037,0.0009141662,0.0035695576],"category_scores_gemma":[0.0015714285,0.00026972668,0.0002905498,0.0008704288,0.001135543,0.0017138192,0.0009315109,0.0009371468,0.00030144234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007260645,0.000029211009,0.00029306873,0.000032161603,0.0000108234335,0.00009803821,0.00015205685,0.009538389,0.0031522224,0.97036797,0.0014304424,0.014822902],"study_design_scores_gemma":[0.000015786525,0.000014334973,0.0001935692,0.0000063350008,0.0000061133974,0.00008799956,0.00007515782,0.033372097,0.0005863144,0.96340066,0.0022357027,0.000005913582],"about_ca_topic_score_codex":0.0005516412,"about_ca_topic_score_gemma":0.0005971939,"teacher_disagreement_score":0.0035695576,"about_ca_system_score_codex":0.00048521085,"about_ca_system_score_gemma":0.00029044427,"threshold_uncertainty_score":0.011941314},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04433237,0.0033443766,0.30453688,0.02846881,0.0038902408,0.00014926732,0.002437038,0.0049932012,0.6078479],"genre_scores_gemma":[0.6618988,0.0033330605,0.11543157,0.012087598,0.005622786,0.00058242003,0.004433627,0.00204877,0.19456136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725133,0.00048244547,0.0001263742,0.00078510825,0.0008770694,0.000477644],"domain_scores_gemma":[0.9949673,0.0024776729,0.00031220622,0.0009093595,0.0010403869,0.00029303343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015745844,0.0014844778,0.0013062143,0.0014430467,0.002470547,0.003961333,0.0020202962,0.0016018089,0.04611956],"category_scores_gemma":[0.009546559,0.0008187782,0.0019833671,0.0016408087,0.0038054502,0.009475468,0.0057020155,0.0063831196,0.013412213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008653514,0.000049097387,0.00047481677,0.00018153607,0.000025368407,0.00014808154,0.00033480726,0.0010493625,0.0011376024,0.9412394,0.038924526,0.016348792],"study_design_scores_gemma":[0.000049517108,0.000025005922,0.0003530435,0.000046545774,0.000028399105,0.00012742619,0.00013488391,0.004336581,0.0016855273,0.94322795,0.049962662,0.000022506263],"about_ca_topic_score_codex":0.002691046,"about_ca_topic_score_gemma":0.002364696,"teacher_disagreement_score":0.04611956,"about_ca_system_score_codex":0.002149844,"about_ca_system_score_gemma":0.0013988181,"threshold_uncertainty_score":0.15428531},"labels":[],"label_agreement":null},{"id":"W1999801607","doi":"10.1002/jcd.20222","title":"A construction of binary Golay sequence pairs from odd‐length Barker sequences","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Mathematics; Combinatorics; Complementary sequences; Sequence (biology); Binary number; Pseudorandom binary sequence; Arithmetic; Statistics; Biology; Genetics","score_opus":0.019756980661113883,"score_gpt":0.2289022324656349,"score_spread":0.209145251804521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999801607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5620844,0.00066662324,0.39940652,0.0004957026,0.0004298479,0.00038239008,0.00038659383,0.0009732311,0.035174683],"genre_scores_gemma":[0.7659399,0.00020734244,0.22557256,0.00017296526,0.00005708583,0.00021468614,0.00035224474,0.00009847212,0.0073847296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942917,0.00018264812,0.000043036052,0.00010974759,0.00013321634,0.00010221935],"domain_scores_gemma":[0.9991561,0.00023923653,0.00018539556,0.00017473848,0.000140456,0.00010399331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054738845,0.000520362,0.00039135918,0.0009141681,0.0008902369,0.00057310157,0.0005076542,0.00046543084,0.004744709],"category_scores_gemma":[0.0014373537,0.0003854478,0.00038297768,0.0006199249,0.0006366992,0.00091885705,0.001154157,0.0005870862,0.0011129635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011782667,0.00032486249,0.003976423,0.0005228866,0.00006393165,0.0016665213,0.0011873195,0.010455164,0.19022636,0.5584361,0.0073120943,0.22465008],"study_design_scores_gemma":[0.00047903694,0.003173749,0.0053634993,0.00021781144,0.00017503361,0.0036963488,0.00043230396,0.06676835,0.44502604,0.33965394,0.13475306,0.00026083662],"about_ca_topic_score_codex":0.00021185102,"about_ca_topic_score_gemma":0.00033835712,"teacher_disagreement_score":0.004744709,"about_ca_system_score_codex":0.00044235025,"about_ca_system_score_gemma":0.00055254425,"threshold_uncertainty_score":0.015872657},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0307216,0.00027123097,0.9633877,0.0002322332,0.00015628764,0.00035616494,0.00039676254,0.00031928899,0.0041587595],"genre_scores_gemma":[0.33084026,0.00032791914,0.6603056,0.00029879116,0.00015928462,0.0013046162,0.0006357758,0.000109024724,0.0060186414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9813052,0.012280722,0.00087532017,0.0018031592,0.0022358096,0.0014997165],"domain_scores_gemma":[0.9723112,0.0138046,0.0013131858,0.009042189,0.0028729592,0.0006558272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012836353,0.001227608,0.0023434858,0.00096548075,0.0010651777,0.002047858,0.0014424146,0.0017207479,0.011574471],"category_scores_gemma":[0.030991128,0.0010253667,0.0016369716,0.0017965143,0.002355288,0.0021167283,0.0020933314,0.0012620577,0.0017718272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062581454,0.00055690244,0.0038034136,0.00040820765,0.0004848663,0.0001445483,0.0004033707,0.04608418,0.015914975,0.5982361,0.0039704586,0.32373485],"study_design_scores_gemma":[0.0027569283,0.0037586752,0.00519251,0.00022543031,0.0006725765,0.00046368936,0.00023152992,0.29841974,0.024164675,0.64129376,0.022478404,0.00034210758],"about_ca_topic_score_codex":0.00062538154,"about_ca_topic_score_gemma":0.0009338964,"teacher_disagreement_score":0.012836353,"about_ca_system_score_codex":0.000728405,"about_ca_system_score_gemma":0.0033690021,"threshold_uncertainty_score":0.067885935},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24016696,0.0004952285,0.31382123,0.0013589689,0.0012460792,0.00019089245,0.00061142177,0.00062117877,0.44148797],"genre_scores_gemma":[0.75356555,0.0005940958,0.14192615,0.0005052779,0.00013657128,0.00007599278,0.00040003489,0.00078714883,0.10200917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981457,0.000025598236,0.0000073095853,0.000033814038,0.0000722915,0.000046458368],"domain_scores_gemma":[0.99987805,0.000024332461,0.000015616262,0.000021795593,0.000037460784,0.000022785975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014894767,0.00058531814,0.0004898284,0.0006855403,0.0015042775,0.001513648,0.0009188526,0.0009216281,0.012304652],"category_scores_gemma":[0.0005534748,0.00042884017,0.0008438625,0.0004763776,0.0013636663,0.0013226885,0.0012557954,0.0016379195,0.0033321513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023561526,0.000016201524,0.00007962343,0.00002940992,0.000006335623,0.0004384329,0.00021929434,0.0013457687,0.0044201254,0.9861351,0.0014496822,0.005836299],"study_design_scores_gemma":[0.000040666964,0.000053379303,0.00030165736,0.00003690001,0.000017882368,0.00078648597,0.00024586957,0.008599268,0.006921502,0.920141,0.0628199,0.00003547682],"about_ca_topic_score_codex":0.0030878773,"about_ca_topic_score_gemma":0.0030378914,"teacher_disagreement_score":0.012304652,"about_ca_system_score_codex":0.0010732419,"about_ca_system_score_gemma":0.0006130236,"threshold_uncertainty_score":0.041163206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02261884,0.02432508,0.8268259,0.014969189,0.0014771383,0.00006462839,0.00036035926,0.00028612444,0.1090727],"genre_scores_gemma":[0.75540435,0.026931815,0.14457703,0.0022582216,0.010575793,0.0004403684,0.00041631263,0.00027117916,0.059124965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982626,0.0007802191,0.000068693764,0.00018843004,0.0005813633,0.00011874233],"domain_scores_gemma":[0.992153,0.0063120914,0.00029326204,0.00052061735,0.0005588201,0.00016208201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017520064,0.0011146527,0.0015960223,0.0025997236,0.0013235045,0.0033747852,0.0014607718,0.0013766177,0.008233528],"category_scores_gemma":[0.0070883455,0.00057663344,0.0009582379,0.0042110565,0.004781211,0.008198356,0.0021264257,0.006078476,0.0010595073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003733769,0.000010626278,0.000035037887,0.000041786432,0.0000060667508,0.0000072193557,0.00004881333,0.0028883237,0.000056429846,0.99015385,0.0016427019,0.0051053856],"study_design_scores_gemma":[0.0000039591387,0.0000036223157,0.00003220595,0.000010360561,0.00000403549,0.00001028074,0.000017655753,0.01429296,0.0000673416,0.98190355,0.0036489044,0.00000514909],"about_ca_topic_score_codex":0.0016585254,"about_ca_topic_score_gemma":0.0010820461,"teacher_disagreement_score":0.008233528,"about_ca_system_score_codex":0.0028423218,"about_ca_system_score_gemma":0.001284105,"threshold_uncertainty_score":0.027543843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10678633,0.009528638,0.7078673,0.010081063,0.0013468382,0.00008446954,0.00050803385,0.00017673025,0.16362056],"genre_scores_gemma":[0.73563915,0.012745369,0.13870141,0.0030247942,0.0021734813,0.00022283268,0.0008925612,0.00037595612,0.106224395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915195,0.00042018428,0.000027893855,0.00012293973,0.00018797952,0.000089082685],"domain_scores_gemma":[0.997124,0.0019226444,0.00020754512,0.00023102426,0.0002589079,0.00025592645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011896703,0.00092165265,0.0016169909,0.0014318901,0.0014091771,0.002348757,0.0013003579,0.0016851567,0.00983331],"category_scores_gemma":[0.0062701493,0.00064603856,0.0010345944,0.0036179174,0.0029536309,0.004958879,0.0025724422,0.0036995518,0.0010831233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026108126,0.000017979875,0.00012962472,0.00003930864,0.000009218777,0.000016997177,0.000069955175,0.01012773,0.00014383071,0.975019,0.0050860043,0.009314249],"study_design_scores_gemma":[0.00000719055,0.000008925839,0.0000656679,0.000013333267,0.0000034940956,0.00001586035,0.000036608853,0.016097639,0.000059614456,0.9800488,0.0036393348,0.0000034634013],"about_ca_topic_score_codex":0.0013853216,"about_ca_topic_score_gemma":0.001590031,"teacher_disagreement_score":0.00983331,"about_ca_system_score_codex":0.001520811,"about_ca_system_score_gemma":0.0007707088,"threshold_uncertainty_score":0.032895684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021146223,0.0024504545,0.9201123,0.0012803918,0.00031613928,0.00021880867,0.0010677871,0.00074098015,0.052666876],"genre_scores_gemma":[0.42732483,0.007088333,0.5237482,0.001349655,0.001691753,0.0023051896,0.0075546717,0.0024612185,0.026476104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957985,0.0010282401,0.00015069252,0.00045480643,0.0017795528,0.00078820833],"domain_scores_gemma":[0.9842451,0.012044154,0.0006418493,0.0012987803,0.0012532935,0.00051683525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036046184,0.0035996656,0.0020713334,0.004223967,0.0018820498,0.005418716,0.0027949747,0.00222357,0.015957452],"category_scores_gemma":[0.019098682,0.001415814,0.0036101595,0.0036937864,0.0021806913,0.0067599565,0.0042104847,0.007901085,0.0035610923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040862724,0.00027175894,0.0012737717,0.00080410164,0.00019209493,0.00028005653,0.00041799754,0.36758295,0.007051476,0.49485186,0.036452383,0.09041291],"study_design_scores_gemma":[0.0000614245,0.00014440577,0.00051895896,0.00017647447,0.00009701992,0.00020837567,0.00008944059,0.5132744,0.0048063193,0.4614753,0.019103548,0.000044303673],"about_ca_topic_score_codex":0.0015226665,"about_ca_topic_score_gemma":0.00203151,"teacher_disagreement_score":0.015957452,"about_ca_system_score_codex":0.0036370615,"about_ca_system_score_gemma":0.0015022885,"threshold_uncertainty_score":0.053382993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5775653,0.0012872065,0.27549687,0.00399569,0.00048267114,0.00015988978,0.0006472283,0.0005989652,0.13976619],"genre_scores_gemma":[0.9314954,0.0009631441,0.024797495,0.00077479385,0.0004475445,0.00011795457,0.000514889,0.0002960184,0.04059287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.00041851998,0.000056814017,0.00027614273,0.0003296088,0.00030761852],"domain_scores_gemma":[0.9939464,0.0033366198,0.00048737612,0.0010366524,0.0005023031,0.00069072144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376566,0.0010856283,0.0016427477,0.0020339603,0.0036604237,0.00353064,0.0016862924,0.0020497474,0.016223764],"category_scores_gemma":[0.008273549,0.0011383665,0.0011831023,0.002811829,0.0041130846,0.0096600335,0.0060871877,0.0043093264,0.0015360109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008235095,0.000021704149,0.00021697766,0.000025556063,0.0000074809013,0.000056384077,0.0002726479,0.0018925471,0.00044033682,0.9899727,0.0015901433,0.0054211887],"study_design_scores_gemma":[0.000016980595,0.000012085659,0.00011975364,0.000015736687,0.000009998841,0.00007733173,0.00010612073,0.009783623,0.000317666,0.9874878,0.0020391878,0.000013725102],"about_ca_topic_score_codex":0.0012596216,"about_ca_topic_score_gemma":0.0011522098,"teacher_disagreement_score":0.016223764,"about_ca_system_score_codex":0.002147168,"about_ca_system_score_gemma":0.00080777414,"threshold_uncertainty_score":0.054273903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85233,0.0004385893,0.08622733,0.0005822943,0.00008839236,0.000053661424,0.0004148431,0.00042364633,0.05944122],"genre_scores_gemma":[0.9586024,0.00022851648,0.030015849,0.00009750082,0.000055259763,0.000048504415,0.00035577215,0.000058759848,0.010537403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995757,0.00007287749,0.000023057402,0.00006964027,0.00015080751,0.000107839565],"domain_scores_gemma":[0.9977188,0.00108289,0.0002472542,0.00041601015,0.00039709502,0.00013792579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003431786,0.0002480924,0.00040582073,0.0009525619,0.0008939889,0.0011675773,0.0003678595,0.0004087495,0.0037617558],"category_scores_gemma":[0.002930001,0.00021826434,0.0003445875,0.0009792248,0.0013518668,0.00079746713,0.0007593141,0.0008685287,0.00055534363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045480818,0.00010750028,0.01151482,0.00037202652,0.000029048158,0.0012448549,0.00082972675,0.063247636,0.03263136,0.75560427,0.008433591,0.1255305],"study_design_scores_gemma":[0.000057198144,0.0002189002,0.0055326954,0.000068041954,0.000035299432,0.0013544883,0.0005559718,0.15021999,0.029409664,0.7847897,0.027687067,0.00007096165],"about_ca_topic_score_codex":0.0008367614,"about_ca_topic_score_gemma":0.0010593281,"teacher_disagreement_score":0.0037617558,"about_ca_system_score_codex":0.0004690554,"about_ca_system_score_gemma":0.00067836564,"threshold_uncertainty_score":0.012584388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4654821,0.00097106374,0.1832245,0.0025023948,0.000289806,0.00023875592,0.0032125611,0.0011227545,0.3429561],"genre_scores_gemma":[0.91340315,0.00066764967,0.041662734,0.0007712172,0.0001222625,0.00020809376,0.001842113,0.00021420831,0.04110853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999329,0.0001439761,0.000029318633,0.00009543904,0.00022966736,0.00017267083],"domain_scores_gemma":[0.99772996,0.00068034034,0.00032916715,0.0004514138,0.00046648245,0.00034260756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043104065,0.000384215,0.0008095256,0.0017225221,0.0020039484,0.0018710757,0.0012112054,0.0009942757,0.019175142],"category_scores_gemma":[0.0021135542,0.0004780771,0.00033946408,0.0022136096,0.0008690572,0.0023589144,0.0015728703,0.0018121747,0.0023656208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027599663,0.000048974878,0.00039630308,0.000099324476,0.000017666924,0.00013188508,0.00015168967,0.004573979,0.004451204,0.9663489,0.0088624135,0.014641724],"study_design_scores_gemma":[0.00008658113,0.00007417855,0.00072545634,0.000042246887,0.000030229767,0.0003846522,0.00016790241,0.04327682,0.0041076667,0.93323004,0.017846301,0.000027853988],"about_ca_topic_score_codex":0.0011330012,"about_ca_topic_score_gemma":0.0017585852,"teacher_disagreement_score":0.019175142,"about_ca_system_score_codex":0.00091506355,"about_ca_system_score_gemma":0.0006779307,"threshold_uncertainty_score":0.064147234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12631965,0.00032068195,0.45019424,0.0013641993,0.0012346265,0.0002102094,0.0007532075,0.0022315555,0.41737157],"genre_scores_gemma":[0.6946819,0.00039668893,0.14495793,0.0007216018,0.0002872634,0.00024109465,0.0011515142,0.0015214613,0.15604055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866474,0.00021610832,0.00006404644,0.00027969058,0.00045974067,0.00031567304],"domain_scores_gemma":[0.99894327,0.00021773858,0.000051965137,0.00044415827,0.00020489788,0.00013804463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065506896,0.0007121168,0.0006721318,0.00074825255,0.0023044269,0.0021162732,0.00077930815,0.0010709368,0.029082509],"category_scores_gemma":[0.0025248001,0.00060191937,0.0008672862,0.00071591674,0.0017918036,0.0039055154,0.0031045896,0.002356771,0.0058720293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109310786,0.000029091236,0.00010487622,0.00004324919,0.000009118546,0.00013292248,0.00013071799,0.0014148006,0.004678695,0.97679645,0.0035751571,0.012975606],"study_design_scores_gemma":[0.00002142188,0.000023328595,0.00009164839,0.000012486016,0.000011099459,0.00016579196,0.00009380619,0.006002449,0.00921399,0.9628038,0.021544391,0.000015876922],"about_ca_topic_score_codex":0.0009477757,"about_ca_topic_score_gemma":0.0009901645,"teacher_disagreement_score":0.029082509,"about_ca_system_score_codex":0.0007726214,"about_ca_system_score_gemma":0.0010183282,"threshold_uncertainty_score":0.097290695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46040425,0.0014250444,0.46358147,0.0010986197,0.00012812973,0.00018569693,0.003240506,0.0006806427,0.0692556],"genre_scores_gemma":[0.8836208,0.0012211119,0.086975865,0.00038489728,0.00010724274,0.00016070035,0.0037524018,0.00020208076,0.023574905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.00012693407,0.00003643526,0.000121446355,0.0001024392,0.00011497038],"domain_scores_gemma":[0.99600005,0.002129188,0.0003990372,0.00040992143,0.000475397,0.0005863921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005145145,0.00056405476,0.0005319714,0.0022367267,0.0009103787,0.0025905764,0.00085975876,0.0006286093,0.00808238],"category_scores_gemma":[0.0035559002,0.00065522565,0.0005380479,0.0016909007,0.0007819083,0.002179042,0.00090143684,0.0012960705,0.000848455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001596654,0.000108884524,0.0017114143,0.00017043625,0.000040550163,0.00027489226,0.00054795056,0.015806245,0.0051970906,0.9390061,0.006071742,0.030904923],"study_design_scores_gemma":[0.000027121856,0.000019014777,0.00089473627,0.00005601426,0.000036013433,0.00019454907,0.0001828294,0.046632815,0.0010703129,0.9439397,0.0069324602,0.000014401356],"about_ca_topic_score_codex":0.0016988015,"about_ca_topic_score_gemma":0.0039666328,"teacher_disagreement_score":0.00808238,"about_ca_system_score_codex":0.00092622556,"about_ca_system_score_gemma":0.00046777749,"threshold_uncertainty_score":0.027038276},"labels":[],"label_agreement":null},{"id":"W2003363815","doi":"10.1002/jcd.20097","title":"Resolvable modified group divisible designs with block size three","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Block size; Combinatorics; Block (permutation group theory); Group (periodic table); Block design; Discrete mathematics; Arithmetic; Computer science","score_opus":0.01960852151754365,"score_gpt":0.21183499385540264,"score_spread":0.192226472337859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003363815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5841646,0.0005929166,0.39451158,0.00043336116,0.00009188156,0.0001758642,0.00035221834,0.0008306738,0.018846927],"genre_scores_gemma":[0.9165671,0.00009302676,0.08051565,0.00009322926,0.000029228097,0.00008544272,0.00014064382,0.000029423922,0.0024462072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990421,0.00027729498,0.000080940685,0.00019690066,0.00027205065,0.00013073815],"domain_scores_gemma":[0.99651825,0.0009720427,0.0008025867,0.0012244501,0.00036049972,0.00012210084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218816,0.00041365193,0.00045468114,0.00048302513,0.000364662,0.0007982224,0.0007424594,0.0005575346,0.0035660623],"category_scores_gemma":[0.0019553923,0.00027630854,0.00041094903,0.00045334923,0.0006286351,0.0008683301,0.0006531168,0.0005913002,0.0005294477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003035027,0.00026887527,0.0044069244,0.0006122308,0.00020775269,0.0015370087,0.00054352125,0.13384087,0.2704711,0.3913182,0.0034584757,0.19029996],"study_design_scores_gemma":[0.00078213104,0.0019757603,0.0019352116,0.00015475867,0.00020681132,0.002446094,0.00016649211,0.42228338,0.2153647,0.31269234,0.041869782,0.00012258226],"about_ca_topic_score_codex":0.00021473474,"about_ca_topic_score_gemma":0.00043992177,"teacher_disagreement_score":0.0035660623,"about_ca_system_score_codex":0.0004891896,"about_ca_system_score_gemma":0.00045460422,"threshold_uncertainty_score":0.011929631},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56386167,0.00064116163,0.24890202,0.0016756203,0.00042785096,0.00016812842,0.0017513237,0.00041662797,0.1821557],"genre_scores_gemma":[0.9444963,0.00049636565,0.032572325,0.00035123172,0.0001403735,0.00013802019,0.0010638388,0.00010580557,0.020635603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927086,0.00015826878,0.00005492989,0.00009705012,0.0002284371,0.0001904318],"domain_scores_gemma":[0.99859685,0.00052827277,0.00028420717,0.00019779778,0.00022505331,0.00016783453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044051115,0.00060618087,0.00088623795,0.0015481875,0.0014797392,0.0026447377,0.00059375906,0.0021023012,0.016800953],"category_scores_gemma":[0.002343886,0.0006098467,0.00061871606,0.0016043764,0.0009399859,0.0025828122,0.0017970044,0.0018664782,0.0028675336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014168417,0.00002814609,0.00043085866,0.00007413753,0.000024996674,0.00041912842,0.00018867337,0.0061476077,0.0061871586,0.9712038,0.004058336,0.011095476],"study_design_scores_gemma":[0.000054230102,0.000046811907,0.00029244277,0.000027366355,0.000012434075,0.00034947734,0.00025237398,0.018542076,0.003566512,0.97171074,0.0051216413,0.00002386301],"about_ca_topic_score_codex":0.00048795991,"about_ca_topic_score_gemma":0.0006689245,"teacher_disagreement_score":0.016800953,"about_ca_system_score_codex":0.0007162205,"about_ca_system_score_gemma":0.0007654046,"threshold_uncertainty_score":0.056204736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8474186,0.00040563804,0.06990958,0.0006819398,0.000482309,0.0001606266,0.0005915085,0.00025051326,0.080099255],"genre_scores_gemma":[0.9529918,0.00015033325,0.021600597,0.0002540172,0.00009399166,0.00009706207,0.000612441,0.000083333325,0.024116457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953794,0.00007684741,0.00002417885,0.00010758076,0.000083846484,0.00016956269],"domain_scores_gemma":[0.99899906,0.00027851807,0.00010075228,0.00009040605,0.0001288844,0.00040247003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041454486,0.00039461793,0.00059226045,0.00085136073,0.002797405,0.0032205167,0.0010694248,0.0011379388,0.009512363],"category_scores_gemma":[0.0015151737,0.0003789136,0.00077639025,0.0013351485,0.00074073323,0.0011993347,0.00092535495,0.0015274029,0.00047054267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005507934,0.00023674287,0.0038969258,0.00017436725,0.0001370649,0.0012409675,0.00086286943,0.009906886,0.013836821,0.9093265,0.016612928,0.04321715],"study_design_scores_gemma":[0.00027947171,0.0003419558,0.00517776,0.000051549574,0.00012651423,0.0016060187,0.00097460556,0.09571569,0.0063028387,0.8558955,0.033434838,0.00009324119],"about_ca_topic_score_codex":0.0013497511,"about_ca_topic_score_gemma":0.0028250713,"teacher_disagreement_score":0.009512363,"about_ca_system_score_codex":0.00080510875,"about_ca_system_score_gemma":0.0005373775,"threshold_uncertainty_score":0.031822026},"labels":[],"label_agreement":null},{"id":"W2003797078","doi":"10.1002/jcd.20123","title":"Weak amicable <i>T</i>‐matrices and Plotkin arrays","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Prime (order theory); Class (philosophy); Prime power; Order (exchange); Orthogonal array; Discrete mathematics; Arithmetic; Statistics; Computer science","score_opus":0.008082513293770173,"score_gpt":0.19165961232274634,"score_spread":0.18357709902897618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003797078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48474017,0.0005905965,0.46313784,0.00044374733,0.00025363525,0.00010273747,0.00022801457,0.0005057393,0.049997494],"genre_scores_gemma":[0.9533765,0.00023684393,0.03705787,0.0001852571,0.0000948937,0.00008084196,0.00011841492,0.00004952961,0.008799946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995647,0.00009180185,0.000026511929,0.00008692819,0.00012822796,0.00010183173],"domain_scores_gemma":[0.999137,0.00019997424,0.00024617385,0.00012914951,0.00017485766,0.000112840185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033942217,0.0004947124,0.00023480336,0.00074448815,0.00047239446,0.0011780978,0.0003030725,0.00049056084,0.0049260156],"category_scores_gemma":[0.0012328688,0.00019494692,0.00031546399,0.0004928678,0.0010341879,0.0010862781,0.00068726076,0.00089435274,0.001069351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034258686,0.00003526303,0.001236722,0.00006521266,0.000017929737,0.00034459025,0.0001843402,0.010308361,0.06996769,0.8847069,0.0017401001,0.031050311],"study_design_scores_gemma":[0.00009573283,0.0007941867,0.0014478839,0.00007291851,0.00002997485,0.001800299,0.00030391928,0.10832665,0.09488984,0.7607279,0.031405255,0.000105374325],"about_ca_topic_score_codex":0.00022152936,"about_ca_topic_score_gemma":0.00024719257,"teacher_disagreement_score":0.0049260156,"about_ca_system_score_codex":0.00037395547,"about_ca_system_score_gemma":0.00034878662,"threshold_uncertainty_score":0.016479194},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61829156,0.0021086594,0.27053383,0.024094336,0.00038602442,0.00039345943,0.0063721403,0.0025401614,0.075279854],"genre_scores_gemma":[0.91820985,0.0009519185,0.057095658,0.0008534924,0.0004654061,0.00036648297,0.004045395,0.00040855052,0.01760338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739265,0.00076008815,0.0001314107,0.00066773675,0.00042958622,0.00061858556],"domain_scores_gemma":[0.98832804,0.009375589,0.00065990555,0.0009117515,0.00035790238,0.0003668193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278845,0.00087315345,0.0017360788,0.00060753105,0.0018584207,0.0064132274,0.0025033273,0.0023942832,0.013151196],"category_scores_gemma":[0.011158921,0.00075730233,0.0018526089,0.0017370211,0.002730907,0.011360574,0.0027064788,0.004146403,0.0016831525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002483499,0.00063391,0.0053419867,0.0014311482,0.00027580143,0.000725658,0.0011720874,0.39469153,0.007847982,0.40545008,0.055170316,0.12477601],"study_design_scores_gemma":[0.00021927948,0.00007732529,0.0010037073,0.000044957862,0.000093947914,0.00023099098,0.00043710903,0.37294084,0.0035900648,0.61503243,0.0062790904,0.000050235303],"about_ca_topic_score_codex":0.0049393163,"about_ca_topic_score_gemma":0.0039994763,"teacher_disagreement_score":0.013151196,"about_ca_system_score_codex":0.0027869933,"about_ca_system_score_gemma":0.0026522384,"threshold_uncertainty_score":0.043995142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82545817,0.000501604,0.11925766,0.0005018815,0.00046468936,0.000097891876,0.00033548888,0.0006183341,0.052764397],"genre_scores_gemma":[0.9554799,0.00020139196,0.027723923,0.000223862,0.00006955288,0.00008031356,0.0002125448,0.0002191788,0.015789371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998029,0.00003222225,0.000010049949,0.000060694732,0.000036965583,0.00005730574],"domain_scores_gemma":[0.9994229,0.00013839215,0.000059850838,0.00016665236,0.000050709026,0.00016153857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014502961,0.00026667994,0.0005839535,0.00041696287,0.0011388015,0.0010893071,0.00075563096,0.0008090182,0.015664384],"category_scores_gemma":[0.0010032816,0.00040828594,0.00044152138,0.00035090046,0.0007768047,0.0009299243,0.0011360488,0.00088588335,0.0018570971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070496445,0.0001712634,0.0014374753,0.00023853108,0.000058859277,0.00090194616,0.0013526316,0.049187448,0.08803934,0.80794567,0.008172066,0.041789807],"study_design_scores_gemma":[0.00015364654,0.0002465857,0.0014585134,0.000043128748,0.000042783446,0.0005345287,0.0008406663,0.14647514,0.031212851,0.7966306,0.022292698,0.00006880508],"about_ca_topic_score_codex":0.000479459,"about_ca_topic_score_gemma":0.0006542247,"teacher_disagreement_score":0.015664384,"about_ca_system_score_codex":0.00029334766,"about_ca_system_score_gemma":0.00025046314,"threshold_uncertainty_score":0.052402556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01708951,0.0006779726,0.9674152,0.0008222588,0.00011340902,0.00011089532,0.00024741955,0.000271326,0.013252133],"genre_scores_gemma":[0.32408524,0.0019626264,0.64552927,0.00096857315,0.0006899901,0.0007464572,0.0014143111,0.00063416496,0.02396934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570686,0.0016190462,0.00018844876,0.0005340596,0.0013247366,0.00062676345],"domain_scores_gemma":[0.98086655,0.013978725,0.0012622909,0.0019071224,0.0014943245,0.00049097533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044730427,0.0025896514,0.0022493578,0.0023506326,0.0017581108,0.0055341227,0.003242206,0.002647369,0.016367758],"category_scores_gemma":[0.026402073,0.0015689124,0.0016222425,0.0045673447,0.0026435016,0.009261146,0.0038986336,0.008019895,0.0028764668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046569385,0.0003493675,0.00073017704,0.0003956094,0.00008782667,0.000097455864,0.00036214184,0.12350809,0.0036898735,0.6907349,0.015822457,0.16375633],"study_design_scores_gemma":[0.00007008733,0.00011952141,0.00020291333,0.00006504764,0.00004241091,0.00008514888,0.00010592121,0.3525852,0.002128445,0.64143336,0.0031206852,0.000041185012],"about_ca_topic_score_codex":0.00171837,"about_ca_topic_score_gemma":0.0030656704,"teacher_disagreement_score":0.016367758,"about_ca_system_score_codex":0.0022668745,"about_ca_system_score_gemma":0.0026021085,"threshold_uncertainty_score":0.054755628},"labels":[],"label_agreement":null},{"id":"W2004704048","doi":"10.1002/jcd.20255","title":"The spectrum of 2‐idempotent 3‐quasigroups with conjugate invariant subgroups","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Lakehead University","keywords":"Quasigroup; Mathematics; Combinatorics; Idempotence; Invariant (physics); Order (exchange); Ternary operation; Mathematical physics","score_opus":0.007669229664755829,"score_gpt":0.19136397101840294,"score_spread":0.1836947413536471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004704048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91869986,0.00022496225,0.02974693,0.0004742615,0.00017015911,0.000058600508,0.000210617,0.00017684334,0.050237816],"genre_scores_gemma":[0.9866041,0.00009383782,0.0034927246,0.00013476689,0.00012659887,0.00007447604,0.00015421893,0.00005592336,0.009263545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930334,0.00014539858,0.000039139468,0.00009020602,0.0002253524,0.0001964914],"domain_scores_gemma":[0.99933124,0.00017549748,0.00012220834,0.00008530923,0.000124054,0.0001617866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000738985,0.0004629472,0.00040513577,0.001838331,0.0013420231,0.0021755013,0.0003991756,0.0006621299,0.007800809],"category_scores_gemma":[0.0007521244,0.00026238087,0.00065939524,0.0007356138,0.002055042,0.0018891736,0.001325244,0.00063449,0.0011345964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017657319,0.000056941823,0.0003499525,0.00001860491,0.000009739053,0.0002711917,0.0005993205,0.0008805149,0.009329277,0.98172414,0.0008096327,0.0057740486],"study_design_scores_gemma":[0.000121069424,0.00015261177,0.0014999786,0.000023524364,0.000012816264,0.0002616921,0.00037764804,0.009763797,0.00707702,0.9736372,0.007031227,0.000041372507],"about_ca_topic_score_codex":0.0009192677,"about_ca_topic_score_gemma":0.00048585763,"teacher_disagreement_score":0.007800809,"about_ca_system_score_codex":0.0013645646,"about_ca_system_score_gemma":0.00048758098,"threshold_uncertainty_score":0.026096344},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73036546,0.000730751,0.19174373,0.001141928,0.00007954183,0.00022449813,0.0008599928,0.0004235086,0.07443058],"genre_scores_gemma":[0.94590276,0.00053081964,0.027128614,0.0002735515,0.000051750234,0.00023717435,0.0005638907,0.00012389208,0.025187569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.00019717468,0.000029857205,0.000094253606,0.00015228953,0.00013050175],"domain_scores_gemma":[0.99770737,0.0010457517,0.00043474534,0.00027768774,0.00029438455,0.0002400452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044755006,0.0004211152,0.00065550016,0.0016167276,0.001591841,0.0018797535,0.0012478265,0.0009878376,0.008377339],"category_scores_gemma":[0.0030529173,0.00079350296,0.0004340933,0.0019086557,0.0013409767,0.0024680216,0.0013502487,0.0011364417,0.000879807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014058295,0.000038056296,0.00050137134,0.000057664103,0.000018243596,0.00009224457,0.00023947036,0.008796647,0.0019849534,0.9782624,0.00198138,0.007887053],"study_design_scores_gemma":[0.0000532452,0.000027667009,0.0004288652,0.000024807643,0.000020465439,0.0000983284,0.00016042097,0.046738148,0.0016662366,0.9473762,0.0033865888,0.000019003039],"about_ca_topic_score_codex":0.0042313784,"about_ca_topic_score_gemma":0.0056824437,"teacher_disagreement_score":0.008377339,"about_ca_system_score_codex":0.0011704854,"about_ca_system_score_gemma":0.0012336752,"threshold_uncertainty_score":0.028025031},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4016828,0.0002796797,0.47570816,0.0022328258,0.00027647233,0.000095834745,0.0004238278,0.001121586,0.11817879],"genre_scores_gemma":[0.923421,0.00020040844,0.047454372,0.00046962846,0.0001738378,0.00012231286,0.00028486334,0.00044667066,0.027426897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984686,0.0004362233,0.00007180185,0.00038467138,0.00026443624,0.00037421306],"domain_scores_gemma":[0.99348044,0.0031485343,0.0007670321,0.00096763053,0.0006197056,0.0010165556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014622366,0.0006394949,0.0008065723,0.0019456752,0.0036212844,0.004238686,0.0012551383,0.0016980771,0.018543787],"category_scores_gemma":[0.006076975,0.0008862671,0.0012092614,0.0014601251,0.004527785,0.008158494,0.004209831,0.003249296,0.0019921286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075202704,0.000036694833,0.00030744867,0.000022561024,0.0000046120376,0.000135432,0.00050929264,0.0006693845,0.0015069629,0.99010706,0.000732619,0.005892697],"study_design_scores_gemma":[0.000018795812,0.000014809783,0.00017835674,0.000011117284,0.000011860884,0.00016696636,0.00012915801,0.0031397466,0.0012376298,0.9933537,0.0017232897,0.000014546403],"about_ca_topic_score_codex":0.0007665433,"about_ca_topic_score_gemma":0.0010393992,"teacher_disagreement_score":0.018543787,"about_ca_system_score_codex":0.0010094432,"about_ca_system_score_gemma":0.00066239404,"threshold_uncertainty_score":0.062035143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42218602,0.007833664,0.44859433,0.010116207,0.0008952556,0.00044079366,0.0037641092,0.0019535185,0.104216024],"genre_scores_gemma":[0.84572387,0.003383929,0.12140477,0.0012350454,0.0016730843,0.00070855825,0.0021607755,0.00042641442,0.02328353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887045,0.0034705927,0.0007437145,0.0019714688,0.0034610373,0.0016486626],"domain_scores_gemma":[0.90496284,0.06919179,0.0059844335,0.01123902,0.005014541,0.003607415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008513971,0.0023006366,0.0025881466,0.003288533,0.0029416909,0.007945414,0.0047902022,0.0035367853,0.014835809],"category_scores_gemma":[0.054886185,0.001939183,0.0021039916,0.0034934643,0.005075212,0.011021261,0.0034911362,0.0042229164,0.0022804292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028432717,0.00042548752,0.005559407,0.00083588605,0.0002834712,0.0003924424,0.00046823232,0.100174144,0.019580696,0.77886605,0.014104953,0.07646595],"study_design_scores_gemma":[0.00030185867,0.0004631857,0.0017878053,0.00017065003,0.00020297396,0.0010451269,0.00015824054,0.1838071,0.0118264295,0.79178673,0.008296436,0.00015343988],"about_ca_topic_score_codex":0.0008028548,"about_ca_topic_score_gemma":0.0015885124,"teacher_disagreement_score":0.014835809,"about_ca_system_score_codex":0.004158204,"about_ca_system_score_gemma":0.003861949,"threshold_uncertainty_score":0.0496307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32905096,0.0020222561,0.5247333,0.0018881786,0.0008255523,0.00011750614,0.0004415476,0.00047923828,0.14044145],"genre_scores_gemma":[0.91148144,0.0012774628,0.051175658,0.0005634474,0.00090164004,0.00011060069,0.00028761025,0.00016130935,0.03404087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992748,0.00017583669,0.00003268043,0.00015388407,0.00022595497,0.00013686602],"domain_scores_gemma":[0.99783957,0.0009002455,0.00027533786,0.00035827293,0.00032616517,0.00030036515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007388311,0.0008164163,0.0008908742,0.0018743317,0.0017489842,0.0032239992,0.0011153924,0.0012905083,0.0057389634],"category_scores_gemma":[0.0035973063,0.0004299298,0.00077012175,0.0014804553,0.0024317398,0.0029675725,0.0014055764,0.0016551986,0.0007570018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018312332,0.000009924579,0.0000921542,0.000014399761,0.0000042834986,0.00007084061,0.000076246535,0.0010091767,0.0007834228,0.99458295,0.0007350507,0.0026033304],"study_design_scores_gemma":[0.00001361473,0.00001961342,0.00010108943,0.000010769758,0.0000044924113,0.00019935601,0.000047222773,0.015323411,0.00054438674,0.9807947,0.0029263152,0.000014966782],"about_ca_topic_score_codex":0.000813472,"about_ca_topic_score_gemma":0.00064057426,"teacher_disagreement_score":0.0057389634,"about_ca_system_score_codex":0.00089252845,"about_ca_system_score_gemma":0.00062914996,"threshold_uncertainty_score":0.019198775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7115106,0.0010953065,0.19156887,0.0023673978,0.00021928441,0.000062238985,0.00081725087,0.00023923235,0.09211989],"genre_scores_gemma":[0.9781827,0.0004955883,0.011711606,0.00030915276,0.00041606725,0.00005471795,0.0004959138,0.00009977094,0.0082345735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974101,0.00075918465,0.00018070442,0.00062187243,0.000582999,0.00044518727],"domain_scores_gemma":[0.98825663,0.006584727,0.001019157,0.0013040967,0.0017186775,0.0011166158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028720077,0.0005495575,0.0013771764,0.0029439072,0.003362644,0.004106999,0.0021637136,0.0011956568,0.006193747],"category_scores_gemma":[0.011771961,0.0007935957,0.00090256444,0.0023022264,0.0070828106,0.011498655,0.0043823197,0.003585808,0.0005668857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050437462,0.000014873158,0.0003373063,0.000012674385,0.0000051516563,0.000029883493,0.00021207523,0.0004263378,0.00025946758,0.99662316,0.000322811,0.0017058064],"study_design_scores_gemma":[0.000014252959,0.000021776446,0.000334791,0.000010109734,0.000008988166,0.00007773844,0.0001591379,0.0032744985,0.00040310333,0.9945509,0.0011296686,0.000015028821],"about_ca_topic_score_codex":0.0013755497,"about_ca_topic_score_gemma":0.00073019986,"teacher_disagreement_score":0.006193747,"about_ca_system_score_codex":0.0013781722,"about_ca_system_score_gemma":0.00074587116,"threshold_uncertainty_score":0.020720184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056228433,0.006014965,0.5127748,0.0047701667,0.0016349263,0.00012340175,0.00065041735,0.0004022014,0.41740072],"genre_scores_gemma":[0.76316214,0.005032128,0.15071745,0.0029994468,0.0023010229,0.0004732976,0.00076072343,0.00025089737,0.07430288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873966,0.0003854332,0.00006908757,0.00023919065,0.00037212324,0.00019444281],"domain_scores_gemma":[0.9973302,0.0015934324,0.00016574781,0.0002465157,0.00046716732,0.00019700242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012348819,0.0008387135,0.0010616771,0.0037894843,0.004206528,0.0056678895,0.0014039597,0.0023280238,0.01650871],"category_scores_gemma":[0.0040885084,0.0009128951,0.0013237465,0.0033451302,0.0046165567,0.008153194,0.0031606785,0.0031451718,0.0022079612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002282666,0.0000019120685,0.000009481052,0.0000066219473,0.0000010271478,0.000009326792,0.000030071384,0.00009430935,0.0000405727,0.9982823,0.00048816475,0.0010340539],"study_design_scores_gemma":[0.0000050107515,0.0000036351787,0.000013461859,0.000012062025,0.000003847901,0.000052975058,0.00003098994,0.0013186574,0.00010119839,0.99243426,0.0060189236,0.000005003617],"about_ca_topic_score_codex":0.0010399182,"about_ca_topic_score_gemma":0.0009054875,"teacher_disagreement_score":0.01650871,"about_ca_system_score_codex":0.002221178,"about_ca_system_score_gemma":0.0012332146,"threshold_uncertainty_score":0.0552271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75246716,0.002712419,0.13546361,0.002686076,0.00037009318,0.00007404069,0.00073563674,0.00024987094,0.10524109],"genre_scores_gemma":[0.9789697,0.0011878842,0.011876883,0.0002753512,0.00047391347,0.000060287257,0.00024371322,0.00011977267,0.0067925155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991961,0.00024974527,0.000028687786,0.00016096955,0.0002132543,0.00015124778],"domain_scores_gemma":[0.9888287,0.0072350004,0.0012557525,0.00074890355,0.0007980184,0.0011335635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016157243,0.0007157414,0.00086744566,0.0040370594,0.0017966195,0.0030911816,0.0013779661,0.0009682246,0.00619059],"category_scores_gemma":[0.009005841,0.00067109236,0.00042188304,0.0034290093,0.0033059241,0.005175046,0.0023225183,0.0022789834,0.00049282575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023855096,0.000038680508,0.0018286387,0.00009568889,0.000027266027,0.00007197213,0.00035556825,0.013253522,0.0038740404,0.9663118,0.0032681609,0.010635964],"study_design_scores_gemma":[0.000033393433,0.00005207171,0.0016483109,0.000052630225,0.000030667303,0.000110583394,0.00016340578,0.053089764,0.0013576511,0.9395821,0.0038456598,0.000033793123],"about_ca_topic_score_codex":0.0018255719,"about_ca_topic_score_gemma":0.0023996045,"teacher_disagreement_score":0.00619059,"about_ca_system_score_codex":0.002694392,"about_ca_system_score_gemma":0.00081382436,"threshold_uncertainty_score":0.020709634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41164362,0.0015373006,0.5227658,0.0010387165,0.00013026108,0.00023491871,0.0013989169,0.00060910825,0.060641237],"genre_scores_gemma":[0.87527704,0.0012765201,0.09798282,0.0002752725,0.00011297871,0.00024069255,0.00093392294,0.00033085505,0.023569876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00015259995,0.000036077443,0.00017066703,0.00013167402,0.00012337856],"domain_scores_gemma":[0.99672663,0.001915178,0.00035698604,0.00033095476,0.00029996832,0.00037021967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231121,0.0008000325,0.0012979376,0.0019405484,0.0013534429,0.0027874215,0.0010539929,0.0009889591,0.009466467],"category_scores_gemma":[0.0046650385,0.00092058466,0.0007904029,0.0020117317,0.0012011239,0.0033116671,0.0009238216,0.0013086101,0.0008574022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017736558,0.0000694575,0.0007453845,0.00020201925,0.000042150245,0.00013511266,0.0003589546,0.028063433,0.003310898,0.93364894,0.0037454346,0.02950089],"study_design_scores_gemma":[0.00005411096,0.000053962543,0.00042470213,0.000058637543,0.00003241919,0.00013805981,0.00014183218,0.059781175,0.001738816,0.93248004,0.005075141,0.000021270373],"about_ca_topic_score_codex":0.0028325107,"about_ca_topic_score_gemma":0.004934629,"teacher_disagreement_score":0.009466467,"about_ca_system_score_codex":0.0015200713,"about_ca_system_score_gemma":0.0009836705,"threshold_uncertainty_score":0.031668484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6900616,0.00072698836,0.23563132,0.00046699622,0.00011373871,0.0000868116,0.0006319444,0.00092259404,0.071357936],"genre_scores_gemma":[0.8648763,0.0003458709,0.11393897,0.00009865973,0.00006379861,0.00009117688,0.00073634175,0.00020640374,0.01964247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994311,0.00012148795,0.000023673498,0.000072027375,0.00023648486,0.000115172756],"domain_scores_gemma":[0.9983235,0.00078812864,0.000135307,0.00031529024,0.00035788974,0.00007990906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034476985,0.00035277175,0.00049768196,0.0011173828,0.00072908076,0.0011074704,0.00035969703,0.00038595925,0.0049517597],"category_scores_gemma":[0.0026340531,0.00023230512,0.0004449276,0.0011893173,0.000960018,0.00090787275,0.0006564279,0.00075916474,0.00097372883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050789997,0.00015299844,0.008632767,0.00061444496,0.00006194726,0.0008314435,0.0011060411,0.11954393,0.06341413,0.533282,0.012304551,0.25954783],"study_design_scores_gemma":[0.000069265065,0.0002885123,0.0049453834,0.000089576104,0.00005692891,0.0009911418,0.00058818795,0.32231528,0.07705777,0.5373109,0.05618005,0.000107051725],"about_ca_topic_score_codex":0.0008624155,"about_ca_topic_score_gemma":0.0014860526,"teacher_disagreement_score":0.0049517597,"about_ca_system_score_codex":0.0004953541,"about_ca_system_score_gemma":0.001046823,"threshold_uncertainty_score":0.016565263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31124637,0.0020382763,0.5982966,0.0023859402,0.0008416233,0.000058756366,0.00062732963,0.00030847793,0.08419665],"genre_scores_gemma":[0.93170244,0.0010149577,0.04713753,0.00074929773,0.0009025774,0.00006612974,0.0003509547,0.00011885997,0.017957246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992387,0.00021814743,0.000035589655,0.00016502458,0.00022880433,0.000113692855],"domain_scores_gemma":[0.9977163,0.0008053853,0.00036207843,0.00031704025,0.0005344239,0.00026489908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009213068,0.0008126864,0.0006887515,0.0015467759,0.0009292583,0.0026723922,0.000894029,0.0009902951,0.004220162],"category_scores_gemma":[0.004817183,0.0004300323,0.00055794045,0.0013158934,0.0028648055,0.0028759514,0.0010537489,0.001936091,0.0007383888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004660806,0.000012479144,0.00008144807,0.000030115392,0.000006435394,0.00004468284,0.00008643725,0.002393326,0.002431049,0.9872802,0.0010660336,0.0065210746],"study_design_scores_gemma":[0.000008289399,0.000023841172,0.00014954332,0.000011992051,0.0000032647786,0.00007336423,0.000027215272,0.01736297,0.0010315336,0.97961503,0.0016695242,0.00002353348],"about_ca_topic_score_codex":0.001007129,"about_ca_topic_score_gemma":0.00071892265,"teacher_disagreement_score":0.004220162,"about_ca_system_score_codex":0.00063578296,"about_ca_system_score_gemma":0.000878127,"threshold_uncertainty_score":0.014117837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65344965,0.00036231795,0.22780274,0.0004482653,0.00033996723,0.00009277157,0.00025526484,0.00046870217,0.11678027],"genre_scores_gemma":[0.96005344,0.00016919794,0.023315795,0.00012848794,0.00016753768,0.00006502082,0.0002605793,0.000116185285,0.01572382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924386,0.000116579016,0.000057166475,0.00014475241,0.00022279275,0.00021496421],"domain_scores_gemma":[0.9989084,0.00024497716,0.00017750256,0.00033750726,0.00017418245,0.00015735788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004495303,0.00042377264,0.00035625687,0.001067556,0.0009321425,0.0011714564,0.0005004952,0.0003465391,0.010255458],"category_scores_gemma":[0.0023548298,0.00028624485,0.0005733512,0.00049615087,0.002136398,0.001735964,0.001257331,0.00079821673,0.0011274334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017190694,0.000048687783,0.0012801279,0.00006250705,0.000013358187,0.0004055308,0.0004902856,0.0031520424,0.016553333,0.95094895,0.0022812139,0.024592105],"study_design_scores_gemma":[0.00005786874,0.00014301509,0.0021180138,0.000038110757,0.000020221041,0.0005341503,0.00032925748,0.02825996,0.011649349,0.9426633,0.014127615,0.000059154507],"about_ca_topic_score_codex":0.0007078211,"about_ca_topic_score_gemma":0.00073558476,"teacher_disagreement_score":0.010255458,"about_ca_system_score_codex":0.0003997331,"about_ca_system_score_gemma":0.00046544592,"threshold_uncertainty_score":0.034307897},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42790303,0.000256037,0.554224,0.00022683265,0.000050314175,0.00013708098,0.00026794168,0.00057686004,0.016357822],"genre_scores_gemma":[0.936267,0.00019022204,0.060548216,0.000033093896,0.000038896123,0.00010101181,0.0002906601,0.00007010161,0.0024608616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908817,0.0001792581,0.000037918642,0.00010700897,0.00034368242,0.00024392821],"domain_scores_gemma":[0.997532,0.0012933998,0.0003340244,0.00026156544,0.00036899123,0.00020996576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007436788,0.00056803366,0.00034879957,0.00086842687,0.0007728636,0.0011420873,0.0005690142,0.00048566415,0.0036278027],"category_scores_gemma":[0.004144779,0.00027179858,0.00038818063,0.0007023799,0.0015923013,0.0011530992,0.001603922,0.0008060756,0.00060967903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004199779,0.00010696682,0.0015096822,0.00012327467,0.000011655499,0.000742207,0.00053759123,0.032037456,0.05544713,0.8410662,0.0012357854,0.06676208],"study_design_scores_gemma":[0.00018831312,0.00042956008,0.0013264902,0.000053758624,0.00002595235,0.0011895038,0.0003511557,0.2818927,0.074005194,0.6325846,0.007859678,0.00009308956],"about_ca_topic_score_codex":0.0007929398,"about_ca_topic_score_gemma":0.00092386745,"teacher_disagreement_score":0.0036278027,"about_ca_system_score_codex":0.0007161362,"about_ca_system_score_gemma":0.000661863,"threshold_uncertainty_score":0.012136221},"labels":[],"label_agreement":null},{"id":"W2008014647","doi":"10.1002/jcd.20006","title":"Existence question for difference families and construction of some new families","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01650254630098339,"score_gpt":0.22735138555871107,"score_spread":0.21084883925772768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008014647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54490536,0.00076024677,0.43009838,0.0011532669,0.00012638171,0.0001040784,0.00032528702,0.00013537447,0.02239161],"genre_scores_gemma":[0.89141953,0.00028148462,0.10192198,0.00022936451,0.00010596421,0.00018925055,0.000308827,0.000051021176,0.005492661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897707,0.0003052988,0.00007269784,0.00025620137,0.00026278326,0.00012601759],"domain_scores_gemma":[0.995497,0.0027179508,0.0004611606,0.00038098183,0.0006156827,0.0003272396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971479,0.0003695731,0.00051491585,0.0014112655,0.001438299,0.0015314486,0.00068617176,0.0010993043,0.004940214],"category_scores_gemma":[0.00682938,0.00065686,0.0007167687,0.0007476571,0.0012590968,0.0033811023,0.001697543,0.0013660638,0.00033288248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030229051,0.000070655595,0.00390474,0.00014998198,0.000028431316,0.00032402616,0.0005118333,0.0030117808,0.016772486,0.9464887,0.0013134407,0.027121592],"study_design_scores_gemma":[0.00015217731,0.00040089883,0.002847043,0.00015600836,0.00008024107,0.0031424835,0.0007900296,0.08089259,0.026273215,0.8594093,0.025762465,0.00009358033],"about_ca_topic_score_codex":0.00012949716,"about_ca_topic_score_gemma":0.0000961653,"teacher_disagreement_score":0.004940214,"about_ca_system_score_codex":0.00095293776,"about_ca_system_score_gemma":0.00036995095,"threshold_uncertainty_score":0.01652664},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006120267,0.00073709275,0.9853892,0.00011093638,0.00012705753,0.00021749348,0.00017579262,0.00030109193,0.0068210354],"genre_scores_gemma":[0.30073097,0.001214154,0.68389666,0.00025372172,0.000111709436,0.00063625484,0.000916238,0.00010479099,0.012135612],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923646,0.00017669397,0.00005460897,0.00011920292,0.00034786089,0.000065210705],"domain_scores_gemma":[0.9990608,0.00015867071,0.00005713371,0.000118295095,0.0005433285,0.00006174971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038923134,0.00056150253,0.00052281626,0.00081552216,0.0005950627,0.0008708805,0.0013207034,0.00066721305,0.0034479338],"category_scores_gemma":[0.002041414,0.0002469106,0.00036220884,0.0010846133,0.00043962582,0.0006945149,0.0007468922,0.00066698,0.0017810676],"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.0003165066,0.000118769014,0.0014876634,0.000585859,0.00010319214,0.00042589442,0.00030557715,0.20150237,0.08559655,0.17680003,0.017881887,0.51487577],"study_design_scores_gemma":[0.000089792135,0.0002790134,0.00035870745,0.000071118935,0.000038110375,0.000759985,0.00008318326,0.88310486,0.032627795,0.03380265,0.04872234,0.000062320396],"about_ca_topic_score_codex":0.002490682,"about_ca_topic_score_gemma":0.0033241732,"teacher_disagreement_score":0.0034479338,"about_ca_system_score_codex":0.0007750774,"about_ca_system_score_gemma":0.0016757414,"threshold_uncertainty_score":0.011534452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7234562,0.00054178387,0.10622923,0.0010872284,0.00032677676,0.00025163894,0.0022123707,0.00080876367,0.16508602],"genre_scores_gemma":[0.9253375,0.00029028958,0.040062238,0.0002714949,0.00005313349,0.00010401118,0.001687465,0.0001353867,0.03205854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966633,0.00007210426,0.00002593378,0.00005738777,0.0000751094,0.000103172846],"domain_scores_gemma":[0.99936646,0.00017026823,0.00012831112,0.00012315014,0.000113410766,0.00009841991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002515024,0.0005060739,0.00054428383,0.0013926857,0.0014495475,0.001754278,0.0006225909,0.0009854847,0.015911827],"category_scores_gemma":[0.001023157,0.00030403215,0.00031060487,0.0015818501,0.0007404065,0.00089463743,0.00095296727,0.0010893549,0.0021748987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005565267,0.00009660426,0.0016529042,0.00023151844,0.00006455977,0.00078344543,0.00040677225,0.013283435,0.015622185,0.8918975,0.015003735,0.060400702],"study_design_scores_gemma":[0.00017404361,0.0002175315,0.0021173777,0.00008916278,0.000054523294,0.0012678093,0.0007206677,0.045515247,0.009725504,0.90797466,0.032093477,0.00004997755],"about_ca_topic_score_codex":0.0008801672,"about_ca_topic_score_gemma":0.002175671,"teacher_disagreement_score":0.015911827,"about_ca_system_score_codex":0.0006488341,"about_ca_system_score_gemma":0.0006190591,"threshold_uncertainty_score":0.053230345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5595187,0.0032425795,0.28281024,0.008148622,0.00037714545,0.00025787335,0.0018641205,0.00055694376,0.14322379],"genre_scores_gemma":[0.8777738,0.0027425224,0.09426522,0.00061055325,0.00045344394,0.00019292162,0.0033474145,0.0004866683,0.020127445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977417,0.00080474775,0.00012767919,0.00036780932,0.0004741718,0.0004839507],"domain_scores_gemma":[0.98498684,0.012030187,0.0008212807,0.0007702837,0.0008106472,0.00058078504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024252175,0.0011861551,0.0026468944,0.0027290923,0.0036965495,0.008281046,0.003031104,0.004486218,0.021165026],"category_scores_gemma":[0.015701467,0.0015286081,0.0016921278,0.005605096,0.0036451782,0.017747782,0.004213855,0.004961049,0.0012975939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005525105,0.00025909676,0.001449318,0.00034830088,0.00009255426,0.00039893057,0.0008024993,0.071705274,0.00095849676,0.86824065,0.015426903,0.0397655],"study_design_scores_gemma":[0.000050694045,0.000040451443,0.0002836678,0.000065688364,0.000037687998,0.00017261002,0.0006864018,0.092281,0.00053547084,0.90248936,0.0033299848,0.00002696354],"about_ca_topic_score_codex":0.004431261,"about_ca_topic_score_gemma":0.0039461525,"teacher_disagreement_score":0.021165026,"about_ca_system_score_codex":0.0034331472,"about_ca_system_score_gemma":0.001804115,"threshold_uncertainty_score":0.070804},"labels":[],"label_agreement":null},{"id":"W2008647334","doi":"10.1002/jcd.20171","title":"Super‐simple holey Steiner pentagon systems and related designs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Beijing Institute For Brain Disorders","keywords":"Pentagon; Simple (philosophy); Mathematics; Combinatorics; Type (biology); Geometry","score_opus":0.01786100687697741,"score_gpt":0.2316456012462305,"score_spread":0.21378459436925307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008647334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.824471,0.0005429513,0.13044888,0.0002378865,0.000099060366,0.00011404649,0.0002509991,0.00009441757,0.043740816],"genre_scores_gemma":[0.977358,0.00012723659,0.019431308,0.00003426019,0.000027161426,0.000032666278,0.000094943105,0.0000055224955,0.002888826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.00009780447,0.000027274255,0.00006144196,0.00011282461,0.00006772295],"domain_scores_gemma":[0.9990269,0.00022616536,0.00032439572,0.0001438272,0.00015124422,0.00012744984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140961,0.0001915025,0.00028115482,0.00075314863,0.00051894214,0.0006565721,0.00029312624,0.00031402154,0.004051341],"category_scores_gemma":[0.0011608186,0.00022855765,0.0002307046,0.00081176957,0.0006177388,0.00070335955,0.0009217827,0.0003012777,0.00032088754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035547285,0.000075337724,0.0053906157,0.00022813289,0.000051724914,0.00096540403,0.0004633223,0.053504054,0.014232997,0.8757335,0.002746513,0.04625292],"study_design_scores_gemma":[0.00015714984,0.00042862544,0.0044472273,0.000061100465,0.000047700047,0.0018188546,0.00057909894,0.1654434,0.0065243207,0.8034357,0.017006293,0.00005046477],"about_ca_topic_score_codex":0.00028382897,"about_ca_topic_score_gemma":0.0005319065,"teacher_disagreement_score":0.004051341,"about_ca_system_score_codex":0.0003673827,"about_ca_system_score_gemma":0.00022010779,"threshold_uncertainty_score":0.013553023},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59970284,0.001411739,0.19104369,0.0029130494,0.0003832298,0.00017514844,0.0007988491,0.0005309739,0.20304047],"genre_scores_gemma":[0.9505972,0.00073349656,0.020682238,0.0005046717,0.0004943557,0.00013150317,0.0009273645,0.00020628088,0.025723014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991849,0.0002448179,0.00003413706,0.00018559408,0.00021505076,0.00013549133],"domain_scores_gemma":[0.9975713,0.0012071169,0.00032104112,0.00030293813,0.0002816959,0.0003158366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901604,0.0008079881,0.0014154575,0.0028119602,0.0017086888,0.0040906873,0.0012270894,0.001130773,0.010039223],"category_scores_gemma":[0.0041711135,0.00082353957,0.001028761,0.0016406798,0.0031379084,0.0054320954,0.0029000319,0.002842799,0.00096243725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031562373,0.000023583147,0.0002527815,0.000026908461,0.000006430853,0.000034621007,0.00017419904,0.0010398894,0.00033773456,0.992458,0.0013857784,0.004228478],"study_design_scores_gemma":[0.000015530046,0.000010853721,0.00017788527,0.000009806174,0.000008117054,0.00006345551,0.0000946455,0.005034733,0.00022218066,0.99189353,0.0024643696,0.0000049410833],"about_ca_topic_score_codex":0.0009851275,"about_ca_topic_score_gemma":0.0012223469,"teacher_disagreement_score":0.010039223,"about_ca_system_score_codex":0.001166918,"about_ca_system_score_gemma":0.0005313936,"threshold_uncertainty_score":0.033584476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5180965,0.0013033783,0.33374792,0.0048327646,0.00040478332,0.00018494211,0.0011852613,0.0004385199,0.13980593],"genre_scores_gemma":[0.9474848,0.0010731714,0.034647163,0.0008523618,0.00027333564,0.00025459955,0.0007995359,0.0001081855,0.014506852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882084,0.00025211464,0.000074447664,0.0003801102,0.00028307518,0.00018951086],"domain_scores_gemma":[0.99717283,0.0013999344,0.0004697462,0.00040456268,0.00028577854,0.00026704255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011594688,0.0006401217,0.00094655016,0.0015424665,0.0024402693,0.0022753077,0.00087714725,0.0009250001,0.008276837],"category_scores_gemma":[0.0030776572,0.00041854507,0.001143199,0.0012591394,0.0031272692,0.0049639074,0.0030583707,0.0025238236,0.0011874117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054911747,0.0000114660525,0.00078032946,0.00004412161,0.00001468543,0.0000964041,0.00023988035,0.001598174,0.0014897776,0.98979455,0.0014398259,0.0044359146],"study_design_scores_gemma":[0.0000316778,0.000052252173,0.0007416754,0.000022865088,0.000033964905,0.00031082923,0.00026438315,0.009396901,0.0028443134,0.97346616,0.01280576,0.000029347066],"about_ca_topic_score_codex":0.00084954756,"about_ca_topic_score_gemma":0.0005645859,"teacher_disagreement_score":0.008276837,"about_ca_system_score_codex":0.0011808297,"about_ca_system_score_gemma":0.00046297107,"threshold_uncertainty_score":0.027688801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23137999,0.0026775736,0.7250938,0.004091555,0.0010322789,0.00011899378,0.0003952801,0.00033648912,0.03487399],"genre_scores_gemma":[0.88303024,0.0042321137,0.07701739,0.0011248916,0.0016550121,0.0002846191,0.0005145565,0.0003898055,0.03175146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985997,0.0006715264,0.000057591264,0.00018729725,0.00035692158,0.00012700836],"domain_scores_gemma":[0.976498,0.017431613,0.0017362204,0.000954664,0.002084798,0.0012947682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031708616,0.001679135,0.00117066,0.0025628253,0.0010746159,0.0023096148,0.0015618333,0.0017952815,0.0055944994],"category_scores_gemma":[0.025639301,0.0007769957,0.00072635425,0.001644087,0.0051271743,0.0060383254,0.0018021566,0.0029454161,0.0008021727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009714619,0.000034075903,0.00047647147,0.00009040473,0.000018415925,0.00024439793,0.00023342171,0.017122589,0.0019352034,0.97210896,0.0019430775,0.0056958855],"study_design_scores_gemma":[0.00002864577,0.000053271244,0.00040492727,0.00006523912,0.00001392618,0.00026556768,0.00007049746,0.23406471,0.0008092643,0.7620741,0.0021064235,0.00004348038],"about_ca_topic_score_codex":0.0016742256,"about_ca_topic_score_gemma":0.0013619795,"teacher_disagreement_score":0.0055944994,"about_ca_system_score_codex":0.0012697405,"about_ca_system_score_gemma":0.0010586148,"threshold_uncertainty_score":0.018715441},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03398963,0.00038420805,0.8953534,0.00072938146,0.00014633848,0.00014353884,0.00041878287,0.0002559552,0.06857877],"genre_scores_gemma":[0.40066847,0.0012949308,0.54448795,0.00075372757,0.00026334246,0.00076274533,0.001593953,0.0005174312,0.049657624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988997,0.00046845234,0.000047823167,0.00022101632,0.00022548491,0.00013744185],"domain_scores_gemma":[0.99751484,0.0010730262,0.0002181448,0.0005842732,0.00033723706,0.0002725799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948713,0.00097168534,0.00062507077,0.0016757182,0.0015623628,0.0030414404,0.0012985367,0.0011159404,0.011545768],"category_scores_gemma":[0.004001283,0.00083035836,0.0011859264,0.0018554237,0.0016693368,0.0042759706,0.0029012605,0.003483441,0.0020455536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016461196,0.000021989481,0.00007043865,0.000040252984,0.000006330809,0.00003520957,0.00013148846,0.0012474807,0.0006134966,0.98779815,0.0018412261,0.008177536],"study_design_scores_gemma":[0.000013558821,0.000010458038,0.00007541681,0.00003588321,0.0000162332,0.00010076987,0.000082570084,0.011995627,0.0007792464,0.97935915,0.0075229076,0.000008077377],"about_ca_topic_score_codex":0.00044134422,"about_ca_topic_score_gemma":0.0009971561,"teacher_disagreement_score":0.011545768,"about_ca_system_score_codex":0.0008640305,"about_ca_system_score_gemma":0.00066257745,"threshold_uncertainty_score":0.038624465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53523725,0.0011285326,0.32651404,0.0025091707,0.00048991403,0.00015165911,0.00084567367,0.0003826552,0.13274112],"genre_scores_gemma":[0.94231397,0.0007207748,0.030178899,0.00046040062,0.00023031198,0.00010116032,0.00032943208,0.000054467444,0.025610734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953413,0.00014674105,0.000027256245,0.00011178631,0.00010182239,0.00007816313],"domain_scores_gemma":[0.9976059,0.0011491623,0.00039969015,0.00035320717,0.0002616437,0.00023040525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005250386,0.00045006498,0.0005929365,0.0013639617,0.0013867526,0.0022416261,0.00064671214,0.0010766247,0.006265124],"category_scores_gemma":[0.0032981874,0.0005810454,0.00048871705,0.0011228716,0.0013315977,0.0022594861,0.0008848386,0.0011795138,0.0006559801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025841768,0.000018142708,0.00016630188,0.00001888487,0.000004660099,0.00006737902,0.000074054886,0.0012231154,0.00053577387,0.9924225,0.00091847853,0.004524772],"study_design_scores_gemma":[0.000015208398,0.00001154994,0.00010078192,0.000009244014,0.000008217595,0.000129175,0.00004659191,0.006060492,0.000313528,0.9905572,0.002740479,0.0000074794375],"about_ca_topic_score_codex":0.000592294,"about_ca_topic_score_gemma":0.0010590103,"teacher_disagreement_score":0.006265124,"about_ca_system_score_codex":0.00086221704,"about_ca_system_score_gemma":0.0006364984,"threshold_uncertainty_score":0.02095896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22096649,0.0008090157,0.7303728,0.00083191635,0.00025096853,0.0005588715,0.002111138,0.00095208373,0.043146722],"genre_scores_gemma":[0.6980033,0.00057255797,0.28207535,0.0004177825,0.00010292508,0.00076989504,0.0013068047,0.00013356931,0.01661776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850994,0.0006401585,0.000110127236,0.00015159907,0.00035671567,0.00023142569],"domain_scores_gemma":[0.9967506,0.00088325725,0.0005587742,0.000746821,0.0008795037,0.00018097785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018446678,0.00071676803,0.0008395003,0.0009319675,0.0007919348,0.0012537326,0.0007449456,0.00073876785,0.008494386],"category_scores_gemma":[0.004262248,0.0003806335,0.00042361044,0.0008674617,0.0004893039,0.0012954541,0.0007597086,0.00050735404,0.0019684713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047287866,0.00038300356,0.0032178,0.0005326753,0.0002322198,0.0003176721,0.00029562766,0.093114704,0.10654666,0.5669822,0.012287054,0.21136151],"study_design_scores_gemma":[0.0016083746,0.002890535,0.0026732185,0.0004048423,0.0003768931,0.0009099662,0.00017099976,0.421105,0.16591994,0.3305469,0.07319824,0.00019510133],"about_ca_topic_score_codex":0.0007072826,"about_ca_topic_score_gemma":0.0016544469,"teacher_disagreement_score":0.008494386,"about_ca_system_score_codex":0.0010904631,"about_ca_system_score_gemma":0.0017808321,"threshold_uncertainty_score":0.028416514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1310333,0.0003102323,0.8478807,0.00031190668,0.0000905872,0.00022357944,0.0006657811,0.0006645758,0.01881933],"genre_scores_gemma":[0.6451252,0.0003297573,0.342565,0.00028680963,0.000074598676,0.00047491185,0.00073274196,0.00012842452,0.010282648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790394,0.000799812,0.00015959752,0.00030437292,0.0005446029,0.00028767748],"domain_scores_gemma":[0.9940105,0.0022004629,0.00086011173,0.0017191124,0.00097431085,0.00023546776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019766393,0.0010644434,0.0012280698,0.00087987276,0.0006251402,0.0015585879,0.0011568266,0.001101535,0.006023379],"category_scores_gemma":[0.004993264,0.00070240267,0.0006217625,0.0009805873,0.00072918425,0.0015374325,0.0011330837,0.0010039844,0.0013821714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027154726,0.00031252854,0.0017216788,0.00041817728,0.0002033792,0.00036828828,0.00027712563,0.17609677,0.08912946,0.5481803,0.005862373,0.17471445],"study_design_scores_gemma":[0.00076761754,0.0014832226,0.00087796774,0.00017127619,0.00019235385,0.00050166895,0.000120722485,0.5964036,0.06654027,0.3153939,0.01744192,0.00010541016],"about_ca_topic_score_codex":0.00075062294,"about_ca_topic_score_gemma":0.0017342279,"teacher_disagreement_score":0.006023379,"about_ca_system_score_codex":0.00079307065,"about_ca_system_score_gemma":0.0016047851,"threshold_uncertainty_score":0.020150185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12996703,0.0005116329,0.82143945,0.00038685897,0.00019964678,0.00026282345,0.00073442556,0.00062074803,0.045877386],"genre_scores_gemma":[0.7251325,0.00047141145,0.26044303,0.00038682856,0.00013199807,0.00037922472,0.00051015225,0.00009342754,0.012451406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988531,0.00042548298,0.00008353747,0.00016473264,0.00031532903,0.00015775197],"domain_scores_gemma":[0.99736315,0.00080792455,0.00043640155,0.0006510487,0.00056889764,0.00017267138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013003468,0.00084054563,0.00092824595,0.0008255344,0.0005655419,0.0011821144,0.00076281023,0.00074318494,0.008184255],"category_scores_gemma":[0.0031149446,0.00043278988,0.0004863321,0.00093297067,0.0004833185,0.0012204394,0.0007901031,0.000527409,0.0017830993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002486468,0.0002716654,0.0027173834,0.00064223376,0.00029957586,0.00044731528,0.00022614293,0.079968445,0.15077429,0.5731892,0.008711796,0.18026556],"study_design_scores_gemma":[0.0007399073,0.0021137856,0.0023886154,0.00023934824,0.00046081695,0.0013741141,0.00012157396,0.45423076,0.06605016,0.43436506,0.037770692,0.00014528465],"about_ca_topic_score_codex":0.00047743408,"about_ca_topic_score_gemma":0.0015170758,"teacher_disagreement_score":0.008184255,"about_ca_system_score_codex":0.00056515686,"about_ca_system_score_gemma":0.000891224,"threshold_uncertainty_score":0.027379036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665184,0.0006129529,0.3839163,0.00030534848,0.000069162954,0.00031924725,0.00081218017,0.00090733916,0.04653904],"genre_scores_gemma":[0.82608163,0.000642281,0.14823349,0.00026146823,0.00004553444,0.00038453835,0.0014792404,0.0002551187,0.022616697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932146,0.00014860323,0.000052124007,0.00021368783,0.00014496811,0.00011906378],"domain_scores_gemma":[0.99829024,0.000614836,0.00033180695,0.0003606828,0.00023813228,0.00016427092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032167044,0.0005275325,0.00046976976,0.00078103517,0.0006181838,0.0009808994,0.0007626852,0.0005152939,0.0055945446],"category_scores_gemma":[0.0026648345,0.0005545547,0.0005836052,0.0008359975,0.0011097651,0.0017423865,0.0010669408,0.0006719771,0.00061556953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002912819,0.00011719428,0.0029359574,0.00048058538,0.000102855745,0.0010884042,0.0009573125,0.06930431,0.027119026,0.7798943,0.0049591553,0.11274958],"study_design_scores_gemma":[0.00013449976,0.00017996549,0.001747293,0.0000828005,0.00009717265,0.00069928746,0.0003756244,0.09055133,0.014129682,0.86217564,0.029750692,0.00007597223],"about_ca_topic_score_codex":0.0020550212,"about_ca_topic_score_gemma":0.0034774654,"teacher_disagreement_score":0.0055945446,"about_ca_system_score_codex":0.0007169207,"about_ca_system_score_gemma":0.0005609147,"threshold_uncertainty_score":0.01871562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12704629,0.000602725,0.82367635,0.0003846157,0.00022337757,0.0002878162,0.00087157567,0.00067987456,0.0462274],"genre_scores_gemma":[0.7479774,0.0004792131,0.23919556,0.000361152,0.0001231065,0.00033714506,0.0005719573,0.000083214814,0.010871267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890995,0.0003784947,0.00008102512,0.00015913953,0.00030533512,0.00016608476],"domain_scores_gemma":[0.9978161,0.00067140395,0.00034276347,0.0004999139,0.0005188514,0.0001509607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012503404,0.00077673735,0.00088970945,0.00071554194,0.00055846316,0.0011104345,0.0007099234,0.00070555956,0.008852308],"category_scores_gemma":[0.0027960897,0.0003477595,0.00049226586,0.0008409198,0.0004405082,0.0009849651,0.0007336686,0.0004542891,0.0019606722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032522173,0.00032886746,0.0034480563,0.00081957306,0.0003564826,0.00054975646,0.0002628815,0.09086012,0.17688839,0.4727328,0.010948447,0.23955236],"study_design_scores_gemma":[0.0008061183,0.0029801517,0.0032983276,0.000333718,0.0005554784,0.0017185698,0.0001534865,0.51906765,0.07857771,0.34387445,0.048470065,0.00016415237],"about_ca_topic_score_codex":0.00057673897,"about_ca_topic_score_gemma":0.0017523416,"teacher_disagreement_score":0.008852308,"about_ca_system_score_codex":0.0005483692,"about_ca_system_score_gemma":0.0009687421,"threshold_uncertainty_score":0.029613912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025554173,0.00003989174,0.9723031,0.000118585864,0.000011632919,0.00010484145,0.00013890985,0.0007555697,0.00097326026],"genre_scores_gemma":[0.2931011,0.000072046714,0.70335567,0.00006197224,0.000016893577,0.0005287973,0.00062422367,0.00014997004,0.002089293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920803,0.00019581252,0.00004917994,0.00022289864,0.00020787003,0.00011622804],"domain_scores_gemma":[0.99571985,0.002468936,0.00048255725,0.0006232888,0.000538869,0.00016654616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013643041,0.0008804586,0.0008508944,0.0014308848,0.0006931878,0.0014869346,0.0020817947,0.0016685296,0.005263383],"category_scores_gemma":[0.012143605,0.0006678391,0.0009774962,0.00067020295,0.00094614667,0.0020524247,0.0016823058,0.0019235134,0.0009716362],"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.0002551957,0.00023197992,0.007327747,0.00014219352,0.000059179387,0.000086076936,0.0002247003,0.8011999,0.006581417,0.048327632,0.003273345,0.13229057],"study_design_scores_gemma":[0.000019084888,0.0000246864,0.00031019733,0.000007139027,0.000005733771,0.000034177676,0.000019770903,0.98441535,0.0014017303,0.013284012,0.0004674574,0.000010683825],"about_ca_topic_score_codex":0.006111634,"about_ca_topic_score_gemma":0.005256153,"teacher_disagreement_score":0.006111634,"about_ca_system_score_codex":0.0016169555,"about_ca_system_score_gemma":0.0019888566,"threshold_uncertainty_score":0.017607808},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38923433,0.0006651227,0.582987,0.00087429653,0.000053017455,0.00021371152,0.00076704205,0.00052362273,0.024681913],"genre_scores_gemma":[0.7828075,0.00074487255,0.20240241,0.00026677392,0.0000619489,0.00045735162,0.0012098952,0.0002487619,0.011800442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885464,0.0003181657,0.000046016346,0.00019158216,0.00032364612,0.00026599487],"domain_scores_gemma":[0.99132115,0.0060190083,0.0007957648,0.0006265532,0.0006397142,0.0005978704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012394511,0.0007882302,0.0011748647,0.0014066786,0.0012293514,0.0025803188,0.0014401486,0.0015096427,0.006252665],"category_scores_gemma":[0.012242589,0.0012011926,0.000653053,0.0017993143,0.0014965193,0.0025458774,0.002528748,0.0016391004,0.00072345696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082815625,0.00018936781,0.0018927221,0.00025256953,0.000076971046,0.00021440041,0.00046427228,0.112093225,0.011900371,0.8207667,0.004890264,0.046431143],"study_design_scores_gemma":[0.00018733653,0.00017534627,0.0007367682,0.000060901162,0.000039593786,0.00021583955,0.00024609087,0.47120148,0.0054781996,0.51805234,0.0035702302,0.000035832756],"about_ca_topic_score_codex":0.0019804658,"about_ca_topic_score_gemma":0.0019928461,"teacher_disagreement_score":0.006252665,"about_ca_system_score_codex":0.0014801268,"about_ca_system_score_gemma":0.0018275889,"threshold_uncertainty_score":0.020917296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7680273,0.0006483614,0.10117879,0.0012275398,0.00030531123,0.0002150049,0.002163763,0.00056614686,0.12566769],"genre_scores_gemma":[0.95154524,0.0003492399,0.026785724,0.00025034847,0.00008111085,0.00011245437,0.0014468912,0.00012043257,0.019308515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915016,0.00015565053,0.000055192722,0.00012214121,0.0002666891,0.0002501576],"domain_scores_gemma":[0.99808866,0.00070495036,0.00037306888,0.0003141567,0.00029087765,0.00022816511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042736778,0.0006314327,0.0010726062,0.0015340442,0.0025025073,0.0026724762,0.00091670494,0.0013467445,0.013342594],"category_scores_gemma":[0.0017759452,0.0006165472,0.0007076676,0.0022781075,0.0014901373,0.0017285749,0.0016662063,0.0020524012,0.0014907888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002662075,0.000070136164,0.00049990485,0.00013078965,0.00003560876,0.00062930654,0.00064574543,0.0082740085,0.009243695,0.9598023,0.0053917896,0.015010502],"study_design_scores_gemma":[0.00009499574,0.00014584785,0.0005763736,0.000052920506,0.00003843878,0.0006576288,0.00064740947,0.02220121,0.009209248,0.9550517,0.011257755,0.00006649681],"about_ca_topic_score_codex":0.0015089113,"about_ca_topic_score_gemma":0.0024625878,"teacher_disagreement_score":0.013342594,"about_ca_system_score_codex":0.00149006,"about_ca_system_score_gemma":0.0016948615,"threshold_uncertainty_score":0.044635415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07007014,0.0011588804,0.8998226,0.00053310144,0.00029833324,0.00016831735,0.00018678016,0.0011040574,0.026657782],"genre_scores_gemma":[0.53492904,0.00067169644,0.45035273,0.00055267493,0.00014249433,0.00023858531,0.0003680749,0.00016248335,0.012582258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989392,0.00025622442,0.00007987588,0.000274238,0.00029239483,0.00015810583],"domain_scores_gemma":[0.9989249,0.00030153437,0.00016184023,0.00023952952,0.00029819884,0.00007394691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570563,0.00066399976,0.00048314992,0.0008462149,0.0008161756,0.00084120914,0.0011611948,0.00095849816,0.0053596473],"category_scores_gemma":[0.0015758526,0.00030495037,0.00037757566,0.00070511556,0.0006923295,0.0014074248,0.0010311366,0.00094925606,0.002092693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009421856,0.00022064337,0.0013019376,0.0005085432,0.000062500905,0.0004068297,0.0002715309,0.030680623,0.1993137,0.30927086,0.005469347,0.45155138],"study_design_scores_gemma":[0.0003148155,0.0016925551,0.0009963567,0.00016064379,0.00013443506,0.002379494,0.00019286893,0.23946352,0.40431347,0.24020365,0.11000623,0.00014193433],"about_ca_topic_score_codex":0.00020756303,"about_ca_topic_score_gemma":0.000361349,"teacher_disagreement_score":0.0053596473,"about_ca_system_score_codex":0.0006568935,"about_ca_system_score_gemma":0.00072409154,"threshold_uncertainty_score":0.017929792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67669654,0.00042075984,0.23796062,0.00051095267,0.00013994303,0.00015310237,0.00089204445,0.00084317604,0.08238281],"genre_scores_gemma":[0.9179886,0.0003040617,0.058949906,0.00020244002,0.000050859326,0.00011266817,0.0006131358,0.00017677552,0.021601634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997255,0.000043261054,0.000020425878,0.000067108784,0.000078489546,0.000065123146],"domain_scores_gemma":[0.99922967,0.0002307336,0.00012141321,0.00014990287,0.00009942845,0.00016889494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021469196,0.00046879193,0.0005272995,0.0007046443,0.00052747363,0.0009604938,0.0004972367,0.00044347267,0.0058632535],"category_scores_gemma":[0.0009893347,0.0003354667,0.0003592262,0.00053077657,0.00085012696,0.0013643542,0.001098618,0.00093466643,0.000759207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005470446,0.000106846644,0.00112067,0.00024124465,0.000035666413,0.0009060325,0.00038314634,0.010313715,0.0614523,0.8790342,0.004718139,0.04114097],"study_design_scores_gemma":[0.0003338334,0.00033954222,0.0024485714,0.0000750192,0.00010456985,0.001384827,0.00036935465,0.080243915,0.043100998,0.84130746,0.030224439,0.00006747199],"about_ca_topic_score_codex":0.0006172186,"about_ca_topic_score_gemma":0.0010402595,"teacher_disagreement_score":0.0058632535,"about_ca_system_score_codex":0.00043281936,"about_ca_system_score_gemma":0.00040761702,"threshold_uncertainty_score":0.019614518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6865393,0.00060718023,0.169111,0.0013723637,0.00067434664,0.00008315843,0.00037019377,0.0006375726,0.14060488],"genre_scores_gemma":[0.9000528,0.0004897612,0.037623983,0.00062928157,0.00032943,0.000088130655,0.0003453312,0.0004578125,0.059983484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996141,0.000104275816,0.000021854521,0.00008648528,0.000105282044,0.000067932684],"domain_scores_gemma":[0.9989453,0.00029834599,0.00017710228,0.00022853415,0.00015218489,0.00019859576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032305345,0.0005089273,0.00047665514,0.0011796695,0.0008518123,0.0016015482,0.0006574249,0.000763984,0.0113736],"category_scores_gemma":[0.0020619044,0.00045791615,0.0003258503,0.0006069202,0.0013646927,0.001708626,0.0015657559,0.0014543772,0.0019244627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012363061,0.000033708402,0.00034248005,0.000040199502,0.00001311755,0.00016972434,0.00026335748,0.00300319,0.008272458,0.9719885,0.0023392828,0.013410228],"study_design_scores_gemma":[0.000026550317,0.000051147363,0.00039906817,0.000016584368,0.000008728578,0.00024803012,0.00021513604,0.016679032,0.0030118783,0.97147894,0.007844436,0.000020424877],"about_ca_topic_score_codex":0.0004040884,"about_ca_topic_score_gemma":0.00040603805,"teacher_disagreement_score":0.0113736,"about_ca_system_score_codex":0.00043610632,"about_ca_system_score_gemma":0.00025462572,"threshold_uncertainty_score":0.038048506},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01820084,0.3455582,0.23716347,0.33065358,0.0055782306,0.00011583874,0.00018078405,0.000532967,0.062016085],"genre_scores_gemma":[0.3330932,0.397986,0.18820994,0.022015883,0.021798927,0.00044948678,0.00037257737,0.00015448811,0.03591949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828404,0.00040210932,0.000072393166,0.00021621908,0.00083794555,0.0001873863],"domain_scores_gemma":[0.9945045,0.0027293945,0.00032152902,0.00031447827,0.0016292917,0.0005007399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031811134,0.00073382986,0.00095244264,0.001116429,0.0016767229,0.004223851,0.0022206034,0.0067548654,0.0041173017],"category_scores_gemma":[0.0051545957,0.00049903535,0.00037804333,0.001226694,0.0029826176,0.008148406,0.0030295036,0.0045021996,0.0015122556],"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.000099409976,0.00022610625,0.0009946005,0.0014073943,0.000045691122,0.0005547013,0.00058781216,0.012195354,0.0036397357,0.5484567,0.056476388,0.3753162],"study_design_scores_gemma":[0.00003728936,0.00012819337,0.0005608542,0.0007374813,0.000021732236,0.0013211302,0.0014151366,0.054656874,0.0020432891,0.6656442,0.2733141,0.00011975642],"about_ca_topic_score_codex":0.000987631,"about_ca_topic_score_gemma":0.00093049026,"teacher_disagreement_score":0.0067548654,"about_ca_system_score_codex":0.0014187997,"about_ca_system_score_gemma":0.0023328364,"threshold_uncertainty_score":0.01682353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7126341,0.0003858224,0.2597879,0.0006681565,0.00010441966,0.00006774962,0.00038202302,0.00029407704,0.025675831],"genre_scores_gemma":[0.95725006,0.00021648686,0.033911616,0.00018954651,0.00006167934,0.000065018685,0.00035940425,0.00008138047,0.007864783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00020821905,0.000038986844,0.00011824711,0.00018821126,0.0001095042],"domain_scores_gemma":[0.9953643,0.002614447,0.0005592154,0.0004156691,0.00057193334,0.0004743642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074763066,0.00036184263,0.0006001493,0.0011356084,0.00093306263,0.0016822994,0.001319088,0.0011477519,0.0031024346],"category_scores_gemma":[0.0067670653,0.00054054044,0.0004062709,0.001056491,0.0012333808,0.0025532064,0.0011204942,0.002011277,0.00040273624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006484257,0.000031820575,0.00062129623,0.00003415937,0.0000093440685,0.00015467337,0.00022164053,0.011953784,0.0026562088,0.97633106,0.0008628835,0.00705831],"study_design_scores_gemma":[0.000023526683,0.000024858018,0.0003253419,0.000011299547,0.000007634885,0.00012938566,0.000098032426,0.045216758,0.0010833478,0.95146704,0.0016012331,0.000011579736],"about_ca_topic_score_codex":0.0011495113,"about_ca_topic_score_gemma":0.0021310435,"teacher_disagreement_score":0.0031024346,"about_ca_system_score_codex":0.0010099977,"about_ca_system_score_gemma":0.0007135539,"threshold_uncertainty_score":0.010378659},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041663535,0.0014456396,0.92788374,0.00024701122,0.00017237602,0.00031405225,0.00080996647,0.0003002274,0.027163373],"genre_scores_gemma":[0.6031614,0.0024351217,0.36776504,0.00043271587,0.00034770957,0.00088736066,0.0012367789,0.00020229467,0.023531603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872917,0.00043629762,0.00006583265,0.00019574145,0.00040008905,0.00017295932],"domain_scores_gemma":[0.9981128,0.0006573561,0.0003232534,0.0004986598,0.00033522918,0.00007269149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010927962,0.00077699864,0.0007065672,0.0006542706,0.00041578876,0.0013118709,0.0006291101,0.0007733112,0.009160105],"category_scores_gemma":[0.0026735743,0.00041259965,0.0004158726,0.0010726986,0.0006056236,0.0012101763,0.000567854,0.00061946246,0.0021869475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011035402,0.00024602184,0.0013105514,0.0006365849,0.00012682442,0.00023543525,0.00021864739,0.11107997,0.075850345,0.5509494,0.012136275,0.24610648],"study_design_scores_gemma":[0.00037180076,0.0013661275,0.0020118968,0.00034129698,0.0002833549,0.0010380677,0.00012798948,0.45653823,0.06728916,0.3921091,0.07840075,0.00012223865],"about_ca_topic_score_codex":0.0005899289,"about_ca_topic_score_gemma":0.0011719323,"teacher_disagreement_score":0.009160105,"about_ca_system_score_codex":0.00073970086,"about_ca_system_score_gemma":0.00092015404,"threshold_uncertainty_score":0.030643582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115414895,0.013019253,0.7819391,0.025907785,0.010554611,0.00040587253,0.001613516,0.0013213203,0.15369704],"genre_scores_gemma":[0.32587856,0.014430376,0.50836486,0.023736313,0.015543216,0.0019378316,0.0033310454,0.0035576094,0.10322025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97998834,0.0059451135,0.00091783784,0.0039805304,0.007228458,0.001939657],"domain_scores_gemma":[0.9469883,0.025953794,0.0014719815,0.0155725535,0.0077345045,0.0022788027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017572388,0.005585842,0.0062675974,0.009267426,0.007553773,0.010152187,0.011886336,0.008064215,0.022694357],"category_scores_gemma":[0.084756434,0.002178024,0.0067198128,0.01093428,0.0142597575,0.030989215,0.0219603,0.025574327,0.011827746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023324385,0.000103971746,0.00028591751,0.00037211456,0.0000695818,0.00012378489,0.0005185055,0.0017745966,0.0009347049,0.947146,0.025411155,0.023026358],"study_design_scores_gemma":[0.00007834372,0.00009979213,0.0004255108,0.00021047484,0.00012791208,0.00025063177,0.00017983184,0.018508993,0.0015738354,0.92837757,0.05003739,0.0001295872],"about_ca_topic_score_codex":0.007259444,"about_ca_topic_score_gemma":0.005730157,"teacher_disagreement_score":0.022694357,"about_ca_system_score_codex":0.0063512176,"about_ca_system_score_gemma":0.005653308,"threshold_uncertainty_score":0.09293276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09107264,0.00031896215,0.89305353,0.00041599356,0.00019907198,0.0004631123,0.00050223427,0.00059562584,0.013378873],"genre_scores_gemma":[0.5959714,0.00023929107,0.39468428,0.00045400305,0.00025953987,0.0010619718,0.0003316411,0.000079376456,0.00691845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99371356,0.0035872706,0.0003580824,0.0007934933,0.0010307252,0.00051685376],"domain_scores_gemma":[0.97714454,0.0115987705,0.0020332455,0.006386897,0.0020525195,0.00078402803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066320063,0.0010705048,0.0018936448,0.0012693517,0.0010465353,0.0013471884,0.0015007756,0.0013986849,0.009372177],"category_scores_gemma":[0.018074239,0.00078795943,0.0008520628,0.0015330213,0.0014643896,0.0015172268,0.0017120008,0.0010198365,0.0019792288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008036858,0.0006535776,0.007934217,0.00096242,0.0006043717,0.00082120666,0.00063965644,0.07681982,0.05433371,0.54053414,0.007621767,0.30103835],"study_design_scores_gemma":[0.002045511,0.0037381973,0.0031564815,0.0002342387,0.00048011096,0.0012321178,0.00016081137,0.31619936,0.020951081,0.6305175,0.021099174,0.00018550573],"about_ca_topic_score_codex":0.00034053728,"about_ca_topic_score_gemma":0.00082699175,"teacher_disagreement_score":0.009372177,"about_ca_system_score_codex":0.0007021149,"about_ca_system_score_gemma":0.0018032275,"threshold_uncertainty_score":0.035073817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53778756,0.0017268473,0.29454267,0.0044376464,0.0006542258,0.00015135965,0.00093716296,0.0006884303,0.15907408],"genre_scores_gemma":[0.9361922,0.0007238966,0.016723437,0.00054183643,0.0007018789,0.000157289,0.00058596605,0.0001553959,0.044218197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987954,0.00050303177,0.000043130218,0.00018042396,0.0002882746,0.00018977857],"domain_scores_gemma":[0.99703586,0.0016380773,0.00029103702,0.00030131682,0.000303224,0.00043051838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007206893,0.0011823542,0.0009362913,0.002306727,0.0012975279,0.0031804014,0.0008822385,0.00092472165,0.011711981],"category_scores_gemma":[0.0029575767,0.0005839766,0.0007509574,0.0015840431,0.0026772995,0.003784735,0.003053276,0.003016928,0.001488038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006024404,0.000037590584,0.00013160115,0.000032283268,0.000013048819,0.00004788283,0.00013355148,0.0013483124,0.0011415614,0.9909243,0.0015003281,0.004629379],"study_design_scores_gemma":[0.000026107036,0.00003529736,0.00014976125,0.000009982945,0.000009291066,0.00013263723,0.00007569646,0.007673728,0.001101791,0.98773056,0.0030417768,0.000013378369],"about_ca_topic_score_codex":0.00029544206,"about_ca_topic_score_gemma":0.00033800377,"teacher_disagreement_score":0.011711981,"about_ca_system_score_codex":0.0007195203,"about_ca_system_score_gemma":0.00046663827,"threshold_uncertainty_score":0.039180517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23601435,0.0008190622,0.57975763,0.0013551089,0.00034383204,0.00027985784,0.0011522181,0.0011562508,0.17912169],"genre_scores_gemma":[0.8271816,0.00067208114,0.1325898,0.00073016295,0.00016294453,0.00037284594,0.0007850085,0.00029599687,0.03720959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848783,0.0005428225,0.00008771646,0.00023057462,0.00034263605,0.0003083579],"domain_scores_gemma":[0.9972696,0.000978717,0.00034379077,0.00081441656,0.0004536169,0.0001398551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080744474,0.0005493433,0.00046710245,0.0010403343,0.000935885,0.0017645311,0.0007609185,0.00073212443,0.01616607],"category_scores_gemma":[0.004098944,0.00039069177,0.00024139545,0.001525413,0.0011818632,0.001612725,0.0015758023,0.0010160601,0.003207236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031948223,0.00006342471,0.00028322838,0.00009450544,0.000011720048,0.00012391775,0.00015438694,0.009375211,0.013639291,0.92294234,0.0050380407,0.04795457],"study_design_scores_gemma":[0.00020075924,0.00036717148,0.0005918186,0.00012894759,0.000032355107,0.00066790124,0.00041459405,0.0649616,0.03652747,0.83179444,0.064242534,0.00007040454],"about_ca_topic_score_codex":0.00057996897,"about_ca_topic_score_gemma":0.00073057157,"teacher_disagreement_score":0.01616607,"about_ca_system_score_codex":0.00064456527,"about_ca_system_score_gemma":0.0007327177,"threshold_uncertainty_score":0.054080844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6188197,0.0008759039,0.17208017,0.0009200231,0.0004428761,0.00025032254,0.0013698888,0.00035789725,0.20488317],"genre_scores_gemma":[0.8717049,0.0012587412,0.05186726,0.00054758764,0.00044160744,0.00040954773,0.0020451955,0.00040682204,0.07131828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933976,0.00009495319,0.000032309086,0.00016322522,0.00020854559,0.0001611394],"domain_scores_gemma":[0.998168,0.00086732826,0.00024512425,0.00020666033,0.00017560442,0.000337186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026115644,0.0006838532,0.0008194228,0.0017931764,0.0014453736,0.0026660946,0.0009046105,0.0007719683,0.021021483],"category_scores_gemma":[0.001549275,0.0008297197,0.00069570396,0.0019280454,0.0016103927,0.0021377646,0.0019495887,0.0024589333,0.0019314646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014623832,0.000093549694,0.00060644175,0.0001512801,0.00002386897,0.00033391165,0.0002900278,0.0055780294,0.003884891,0.9680876,0.0050588553,0.015745323],"study_design_scores_gemma":[0.000056777895,0.00008598212,0.0012819261,0.00005650446,0.00003243952,0.00065156893,0.00033436867,0.02055406,0.0026638017,0.9513354,0.02291679,0.000030462079],"about_ca_topic_score_codex":0.00088577444,"about_ca_topic_score_gemma":0.0010369903,"teacher_disagreement_score":0.021021483,"about_ca_system_score_codex":0.00067208346,"about_ca_system_score_gemma":0.00035987486,"threshold_uncertainty_score":0.070323884},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18807565,0.00237056,0.29896167,0.0044777887,0.001236169,0.00018958352,0.00044652363,0.00035701832,0.50388515],"genre_scores_gemma":[0.80389947,0.0021582455,0.13957149,0.001663766,0.0005993629,0.00024902343,0.00044239918,0.00027140154,0.05114479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.0002702409,0.000028529481,0.000094506,0.00014000648,0.000097545744],"domain_scores_gemma":[0.99754035,0.001547624,0.00011230084,0.00031585453,0.00035940993,0.00012455834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071635563,0.0006347966,0.0007664063,0.0017088474,0.0023688383,0.0032018835,0.0008585635,0.0014871301,0.04164156],"category_scores_gemma":[0.005436562,0.00035731675,0.00087919267,0.0019740297,0.0017176069,0.004955558,0.0017970138,0.0014648081,0.0026414015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027661454,0.00003302878,0.00012415307,0.00005571256,0.0000027154813,0.00008426518,0.00011981408,0.0008139843,0.0007972644,0.98287576,0.0017295337,0.013336121],"study_design_scores_gemma":[0.0000117425625,0.000021824475,0.000072852396,0.000052075833,0.000010297822,0.00029553825,0.00020970896,0.008420724,0.0012479532,0.9766326,0.013012114,0.000012621645],"about_ca_topic_score_codex":0.00044364601,"about_ca_topic_score_gemma":0.0006503161,"teacher_disagreement_score":0.04164156,"about_ca_system_score_codex":0.0007467844,"about_ca_system_score_gemma":0.0008106619,"threshold_uncertainty_score":0.13930494},"labels":[],"label_agreement":null},{"id":"W2018363124","doi":"10.1002/jcd.20204","title":"Almost resolvable cycle systems—an analogue of Hanani triple systems","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016510781878883555,"score_gpt":0.2267145336467825,"score_spread":0.21020375176789896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018363124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6561029,0.00059671135,0.23655404,0.0010092915,0.00020092526,0.00018984545,0.00028218402,0.00021752692,0.10484663],"genre_scores_gemma":[0.9512439,0.00016870968,0.034804,0.00018789648,0.000058621077,0.000078692734,0.00015635062,0.000026525904,0.013275305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993969,0.00014316215,0.000030663443,0.00010051144,0.00019677328,0.00013195926],"domain_scores_gemma":[0.9990207,0.0003546019,0.00017106335,0.0001662463,0.00018446382,0.00010297906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040909275,0.00023608605,0.00031836113,0.0007433061,0.0011335474,0.0012536251,0.00058849406,0.0008822864,0.008998644],"category_scores_gemma":[0.0015921572,0.00027695895,0.00035909723,0.00054837595,0.0010388987,0.0015824678,0.0013143859,0.0012878826,0.0005838252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056803932,0.00002315824,0.00029136456,0.00004704377,0.0000099145545,0.00018353434,0.00028868526,0.0050830804,0.006351318,0.9763179,0.0006256084,0.0107216425],"study_design_scores_gemma":[0.000027658374,0.00008493801,0.00032745194,0.00002541745,0.000007290894,0.0003105668,0.0002794652,0.03679229,0.005394573,0.94762266,0.009102018,0.000025586696],"about_ca_topic_score_codex":0.0005552907,"about_ca_topic_score_gemma":0.0009972284,"teacher_disagreement_score":0.008998644,"about_ca_system_score_codex":0.0004988458,"about_ca_system_score_gemma":0.00045728651,"threshold_uncertainty_score":0.030103445},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50707316,0.00072839775,0.34724313,0.01046184,0.00072390336,0.00026194326,0.00071983814,0.0029697635,0.129818],"genre_scores_gemma":[0.93594676,0.00022538497,0.038045418,0.0006416837,0.00017342529,0.00006298275,0.00034746472,0.0003965238,0.024160305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.00024400688,0.000056585057,0.00044734878,0.00024330258,0.00045871266],"domain_scores_gemma":[0.9966535,0.0010444818,0.00051354914,0.00039354264,0.00093195617,0.00046302757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012569369,0.0003279818,0.0005626903,0.00078419945,0.0016024016,0.003963091,0.0012491078,0.0024191134,0.018217428],"category_scores_gemma":[0.00801693,0.00035649573,0.00061728153,0.0005130908,0.0020473085,0.00635039,0.0013665896,0.00086001185,0.005236417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028288066,0.00025371165,0.014567247,0.00044640028,0.000116724485,0.0015593468,0.002191032,0.010410459,0.04842553,0.62931055,0.019144304,0.2707458],"study_design_scores_gemma":[0.0001707407,0.0007806374,0.004733929,0.00027911662,0.00014334777,0.0019353029,0.0058842576,0.07048773,0.04935411,0.78846896,0.077616595,0.00014531345],"about_ca_topic_score_codex":0.0017415656,"about_ca_topic_score_gemma":0.0013429174,"teacher_disagreement_score":0.018217428,"about_ca_system_score_codex":0.0008739463,"about_ca_system_score_gemma":0.0008208057,"threshold_uncertainty_score":0.060943305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77095914,0.0008504251,0.19987656,0.0005920409,0.00007634063,0.00011471228,0.0012994992,0.00033529405,0.025895929],"genre_scores_gemma":[0.92215925,0.00030455887,0.07221768,0.00012812951,0.00006388572,0.00015415344,0.00079487165,0.00006639396,0.0041112094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980135,0.00051003485,0.00016600078,0.000518721,0.00047967953,0.00031204562],"domain_scores_gemma":[0.99243563,0.004741769,0.0010595982,0.00092653354,0.0005122067,0.00032428678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010035,0.00043816358,0.0007876239,0.0016850798,0.0010582232,0.0018891924,0.0015977457,0.0014123605,0.009350133],"category_scores_gemma":[0.007433954,0.00042955,0.0005028153,0.0029034049,0.0015676954,0.004403047,0.0018078354,0.0009671495,0.00081246876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010433487,0.00017692772,0.030131595,0.0007661979,0.00013003775,0.0011903752,0.0012768303,0.066902556,0.03423236,0.7210382,0.007827373,0.13528414],"study_design_scores_gemma":[0.00012716238,0.00033738164,0.0076891906,0.00020404748,0.0001157471,0.003104623,0.0012227716,0.21071237,0.033895515,0.7126405,0.029809086,0.00014151464],"about_ca_topic_score_codex":0.00055820984,"about_ca_topic_score_gemma":0.0007619838,"teacher_disagreement_score":0.009350133,"about_ca_system_score_codex":0.00067624036,"about_ca_system_score_gemma":0.00040907794,"threshold_uncertainty_score":0.031279266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41715664,0.0021983827,0.4926411,0.002817376,0.0007474426,0.00008611466,0.0004440099,0.00041958469,0.08348931],"genre_scores_gemma":[0.9515431,0.000953225,0.019419292,0.0005278891,0.00072120654,0.00007772794,0.00024792846,0.00010057861,0.026409052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.00034531282,0.00002879884,0.00016077631,0.00020673679,0.00017526928],"domain_scores_gemma":[0.9961389,0.002026809,0.000541413,0.00030691628,0.00043836204,0.00054763624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000911375,0.00086202816,0.0010559647,0.001328934,0.0013127939,0.002142299,0.0012574579,0.00108013,0.008359861],"category_scores_gemma":[0.0057039596,0.00041619502,0.00055671175,0.002089335,0.0022962212,0.0027300257,0.0016337335,0.0018715175,0.0007477218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007793635,0.00004679752,0.00023282987,0.000031248223,0.000013363569,0.000072815914,0.00014080439,0.009539699,0.001190072,0.9778962,0.0026412525,0.008116984],"study_design_scores_gemma":[0.000017450606,0.000032256976,0.00020229096,0.000011194609,0.000005892386,0.00006913957,0.00004533216,0.054179292,0.00025175806,0.94344574,0.0017228955,0.000016730515],"about_ca_topic_score_codex":0.0019694085,"about_ca_topic_score_gemma":0.0018813297,"teacher_disagreement_score":0.008359861,"about_ca_system_score_codex":0.0010528935,"about_ca_system_score_gemma":0.0006347008,"threshold_uncertainty_score":0.0279665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28856537,0.001251086,0.7030743,0.0002816102,0.000074825155,0.00007039631,0.00005795554,0.000112479356,0.0065120417],"genre_scores_gemma":[0.83661485,0.00059470534,0.1609106,0.00010403699,0.00004399229,0.000101541234,0.00005356458,0.000017177214,0.0015595007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996332,0.00010877717,0.000008108714,0.000026426955,0.00018257149,0.00004086655],"domain_scores_gemma":[0.9988292,0.00068486703,0.00015356012,0.00012616318,0.00017222342,0.000033976252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043308228,0.00032468772,0.00016707074,0.00033677407,0.00020664363,0.00038989703,0.00030782082,0.00037147538,0.0008168097],"category_scores_gemma":[0.0017402547,0.00011531386,0.00016533324,0.00041845968,0.0005114175,0.0005208113,0.0003202766,0.00028009826,0.00016615013],"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.0001752893,0.00011313599,0.004059728,0.00023564839,0.00004520321,0.0003093631,0.00021255079,0.28421128,0.11866502,0.5058795,0.00081965915,0.08527351],"study_design_scores_gemma":[0.000024444056,0.00021327166,0.0007504106,0.000024386405,0.000013814305,0.00029258037,0.000020354784,0.9147927,0.023910183,0.055063702,0.0048697176,0.000024518442],"about_ca_topic_score_codex":0.00032250935,"about_ca_topic_score_gemma":0.00057455094,"teacher_disagreement_score":0.0008168097,"about_ca_system_score_codex":0.00037107684,"about_ca_system_score_gemma":0.00036371418,"threshold_uncertainty_score":0.0027325153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40259945,0.0036264972,0.19702329,0.00498356,0.0016247866,0.00011092403,0.00094649266,0.0011609229,0.3879241],"genre_scores_gemma":[0.898492,0.0023213394,0.027764143,0.00096622494,0.0011501584,0.00012458654,0.0008082579,0.00031421307,0.06805904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954224,0.00013058746,0.000020560843,0.00009095016,0.00013315468,0.00008250285],"domain_scores_gemma":[0.99853325,0.00069157063,0.00017682002,0.00022092472,0.00019345056,0.00018408232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022784292,0.00063240895,0.00073062937,0.0022896,0.0011825457,0.0027011055,0.0005554347,0.0009238163,0.011594422],"category_scores_gemma":[0.002267347,0.0005786424,0.0005494268,0.002340088,0.0010333089,0.0026684287,0.0016101956,0.0015780027,0.0017565825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027004173,0.000020728781,0.00024759764,0.000039058163,0.000009453735,0.000058290476,0.00017060929,0.0025247566,0.0013217675,0.9717106,0.0067431647,0.017126955],"study_design_scores_gemma":[0.000007372906,0.000015021777,0.00030303048,0.000017761968,0.000009952222,0.00016688983,0.0000966356,0.0105859,0.0006990997,0.974861,0.013227179,0.000010097077],"about_ca_topic_score_codex":0.00055515044,"about_ca_topic_score_gemma":0.0005387135,"teacher_disagreement_score":0.011594422,"about_ca_system_score_codex":0.00076922035,"about_ca_system_score_gemma":0.00026349092,"threshold_uncertainty_score":0.038787186},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15524322,0.0018007382,0.27417153,0.0035029314,0.001528124,0.00019369954,0.00073403935,0.0007393677,0.5620864],"genre_scores_gemma":[0.6829434,0.0019936631,0.063445374,0.0016168165,0.0008523348,0.00019368125,0.00043277928,0.0004156641,0.24810632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999009,0.00016768489,0.000051317176,0.0001927003,0.00034519998,0.00023405475],"domain_scores_gemma":[0.9984498,0.00053424074,0.00017970944,0.00035155617,0.00035303916,0.00013159917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005217258,0.0010781089,0.0006289006,0.0018927194,0.0016851816,0.002158117,0.00062968954,0.0012446523,0.021364251],"category_scores_gemma":[0.0037913853,0.00060955354,0.0005053231,0.0015571328,0.0021683502,0.002737429,0.0015815377,0.002585584,0.0074868007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003186825,0.000012568169,0.000054028766,0.000018672767,0.000003919949,0.000075668715,0.00010154653,0.000687523,0.0015914921,0.9838832,0.002403956,0.011135562],"study_design_scores_gemma":[0.000012747701,0.000032039374,0.00014548887,0.000032040654,0.000007310726,0.00022133622,0.00004882631,0.0031983173,0.004693266,0.9632824,0.028301137,0.000025149575],"about_ca_topic_score_codex":0.0013023999,"about_ca_topic_score_gemma":0.0015419283,"teacher_disagreement_score":0.021364251,"about_ca_system_score_codex":0.0010760613,"about_ca_system_score_gemma":0.001044898,"threshold_uncertainty_score":0.0714705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073117994,0.004881545,0.7820665,0.0064036176,0.00048368052,0.000059256603,0.00031766316,0.00041010225,0.13225968],"genre_scores_gemma":[0.8422004,0.0071507795,0.09931256,0.0026755612,0.0024406493,0.0003084071,0.00047497425,0.0004242025,0.04501251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993325,0.00026220875,0.000034940567,0.000117557574,0.00017020074,0.000082553604],"domain_scores_gemma":[0.9960323,0.00277971,0.00033415022,0.0003226916,0.0003474528,0.0001836915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014215404,0.00078728324,0.0011735405,0.003088871,0.0015813885,0.0033637788,0.0009657196,0.0014488016,0.007365212],"category_scores_gemma":[0.007799823,0.00051509036,0.0011008447,0.003406688,0.0037843643,0.0051950924,0.0020947054,0.0041033416,0.0015011173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013320935,0.000011278571,0.00006485042,0.000029947736,0.000005172415,0.00003993738,0.00007355436,0.0015571829,0.00045874034,0.9914384,0.0014474785,0.0048601255],"study_design_scores_gemma":[0.000007925462,0.00000967827,0.000051275736,0.000008203405,0.00000610537,0.00006731576,0.000030435633,0.008849259,0.00036913846,0.98759985,0.0029896738,0.0000110956935],"about_ca_topic_score_codex":0.00065193645,"about_ca_topic_score_gemma":0.0006231343,"teacher_disagreement_score":0.007365212,"about_ca_system_score_codex":0.0016029564,"about_ca_system_score_gemma":0.00064159156,"threshold_uncertainty_score":0.02463901},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12532394,0.0026481736,0.57550675,0.0035978653,0.00096528104,0.00012282991,0.0009197267,0.00031906494,0.29059634],"genre_scores_gemma":[0.71116865,0.005135508,0.14800712,0.0016211973,0.0013418478,0.00038225006,0.0014735621,0.00075854064,0.1301114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.00028636988,0.000021737567,0.00014220439,0.00027110343,0.00013190757],"domain_scores_gemma":[0.99876297,0.0007121969,0.00013434388,0.00011216034,0.00015997578,0.00011841794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053511735,0.0009839536,0.0011312147,0.001331275,0.0013035311,0.0027859134,0.001018354,0.0012284805,0.01909852],"category_scores_gemma":[0.0030515115,0.0006323041,0.00068468176,0.0017727097,0.0022033302,0.002248013,0.0023509446,0.003212365,0.0030955062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042420535,0.00002265367,0.00012240397,0.00005650758,0.00001125137,0.000068760826,0.000065566506,0.021666441,0.00067031273,0.9577996,0.0069561615,0.0125179505],"study_design_scores_gemma":[0.0000204391,0.000023616953,0.00016153778,0.00003344934,0.0000055244886,0.00010191229,0.00008253627,0.06824552,0.0003500228,0.91822994,0.012729151,0.00001639142],"about_ca_topic_score_codex":0.001754982,"about_ca_topic_score_gemma":0.0013039277,"teacher_disagreement_score":0.01909852,"about_ca_system_score_codex":0.0009678026,"about_ca_system_score_gemma":0.0006608432,"threshold_uncertainty_score":0.063890934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3664632,0.0026166954,0.4584926,0.0024409806,0.0008151129,0.00022619225,0.0005061108,0.0003908531,0.16804822],"genre_scores_gemma":[0.71854395,0.0041861576,0.1977861,0.0016966702,0.0006333883,0.00027183612,0.0011568277,0.0005312501,0.07519388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997923,0.000046987967,0.000007841215,0.000046163106,0.000046684636,0.00005999167],"domain_scores_gemma":[0.99919623,0.0003675167,0.00009912462,0.00014869728,0.000089494606,0.00009899095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044689435,0.001146994,0.0005452862,0.001378826,0.0010128351,0.0014691086,0.00079319003,0.0008686669,0.006669156],"category_scores_gemma":[0.0017593422,0.00031939507,0.00052415277,0.0017561335,0.001793086,0.00345206,0.0015177773,0.0014941464,0.00086680776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001847612,0.0000662726,0.00051272026,0.00016419233,0.000015256542,0.00015269096,0.00046043386,0.0104852095,0.0065201106,0.90919644,0.0070930645,0.06514888],"study_design_scores_gemma":[0.000011714308,0.000025957968,0.00034183968,0.000032964126,0.0000093786075,0.00008219835,0.00015852005,0.01425078,0.0013585759,0.97713566,0.0065784776,0.000013869438],"about_ca_topic_score_codex":0.001887757,"about_ca_topic_score_gemma":0.0031809954,"teacher_disagreement_score":0.006669156,"about_ca_system_score_codex":0.0009154846,"about_ca_system_score_gemma":0.0005496869,"threshold_uncertainty_score":0.022310555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08779938,0.014842967,0.60685384,0.018292658,0.002106657,0.0002162798,0.0012260682,0.0019260398,0.26673615],"genre_scores_gemma":[0.715719,0.008539671,0.23328103,0.0045772335,0.0018914945,0.0006161694,0.001151883,0.0012769822,0.032946516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945023,0.0012820716,0.00022089301,0.0009985236,0.0018293394,0.0011670089],"domain_scores_gemma":[0.968099,0.02499795,0.0007219038,0.0035129157,0.0012801103,0.0013881646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055504143,0.002120857,0.0019380482,0.003618373,0.0032221044,0.0060802703,0.004579699,0.0027502992,0.018683197],"category_scores_gemma":[0.023706388,0.0010731734,0.002588303,0.0038859346,0.0058805584,0.012767677,0.008497179,0.016479578,0.0035598152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034503173,0.00014115081,0.0015961076,0.0003475386,0.00005211406,0.00020705408,0.00045387747,0.013864096,0.0047654444,0.9172195,0.014307389,0.046700638],"study_design_scores_gemma":[0.00003182,0.00007236706,0.0004365899,0.00011976947,0.000041062805,0.00013411319,0.00008968197,0.0360677,0.0034876133,0.94422,0.015254181,0.000045190718],"about_ca_topic_score_codex":0.0028844199,"about_ca_topic_score_gemma":0.003841646,"teacher_disagreement_score":0.018683197,"about_ca_system_score_codex":0.0043286528,"about_ca_system_score_gemma":0.0013428528,"threshold_uncertainty_score":0.06250149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7007457,0.00071272417,0.14856315,0.0021510373,0.00038591764,0.0001629043,0.0042242217,0.0012052804,0.14184904],"genre_scores_gemma":[0.9522598,0.00013200783,0.029729487,0.00013865579,0.000027918099,0.000071955634,0.001180857,0.00016107378,0.016298234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978274,0.000032045362,0.00001097292,0.00003463265,0.000031837004,0.000107823966],"domain_scores_gemma":[0.9981517,0.001033317,0.00016850789,0.0002685132,0.0002459698,0.00013199546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055537035,0.00015578214,0.00021442662,0.0008293679,0.0008825159,0.0012452459,0.000761332,0.00076272077,0.03279523],"category_scores_gemma":[0.0045794863,0.00012262932,0.0003997691,0.00061151775,0.0006077804,0.00080391427,0.0004735818,0.00073188724,0.0022810618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023269204,0.00037332677,0.015988786,0.0004766289,0.00010906976,0.00094319216,0.0012600392,0.07065976,0.027717955,0.6576442,0.03827446,0.18422562],"study_design_scores_gemma":[0.00012455073,0.00030716995,0.020969134,0.00015890498,0.00010586262,0.0014050155,0.0015960558,0.2997005,0.046194453,0.57438296,0.05492662,0.00012872776],"about_ca_topic_score_codex":0.0015822788,"about_ca_topic_score_gemma":0.0028515984,"teacher_disagreement_score":0.03279523,"about_ca_system_score_codex":0.0004393512,"about_ca_system_score_gemma":0.00054307404,"threshold_uncertainty_score":0.10971093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26113552,0.0024907934,0.505213,0.0014221959,0.00089845137,0.00023269645,0.0015656888,0.0008371757,0.22620441],"genre_scores_gemma":[0.93394756,0.0018171527,0.048369594,0.0006710648,0.00030923003,0.00010284489,0.0007540193,0.00007923414,0.013949292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994417,0.000113228445,0.00003958766,0.00020838375,0.00011676845,0.00008033281],"domain_scores_gemma":[0.9987999,0.00039211655,0.00015155334,0.00024804886,0.00026537853,0.00014295823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040532756,0.00037643866,0.00039194518,0.0012759775,0.0011645838,0.001227311,0.000735302,0.00043358974,0.006687521],"category_scores_gemma":[0.0017460912,0.00024372291,0.00080662954,0.00090398284,0.0009773537,0.0022783244,0.00082784006,0.0014718896,0.00059410976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018345858,0.000020724996,0.00043625792,0.000099497825,0.000019988407,0.00034276763,0.0002403808,0.003300422,0.0026647905,0.9781366,0.002105637,0.012614517],"study_design_scores_gemma":[0.000021814116,0.000041302308,0.0006181073,0.000046313504,0.00003709022,0.0007159518,0.00020799153,0.020904949,0.0017910424,0.9480142,0.027574334,0.000026991303],"about_ca_topic_score_codex":0.002075803,"about_ca_topic_score_gemma":0.002228043,"teacher_disagreement_score":0.006687521,"about_ca_system_score_codex":0.0010423249,"about_ca_system_score_gemma":0.00051126495,"threshold_uncertainty_score":0.022372007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16988523,0.002050024,0.8167096,0.0004548693,0.00011717179,0.00008682061,0.000049933544,0.00027684972,0.010369447],"genre_scores_gemma":[0.9091269,0.0010744446,0.08665146,0.00007218982,0.00009234848,0.00006774405,0.000042463787,0.000019249801,0.0028532206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907553,0.0003523429,0.000021765558,0.00005857643,0.00037764176,0.000114054244],"domain_scores_gemma":[0.99864703,0.000785416,0.00019867928,0.00012169588,0.00021913847,0.000028018416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058389,0.00029458082,0.00042415783,0.0006182445,0.0005062495,0.00065429084,0.00048737257,0.00069095916,0.00053681544],"category_scores_gemma":[0.00288064,0.0001944722,0.00021895654,0.0006919915,0.00077827845,0.00074416335,0.0005846546,0.00041063555,0.00013754323],"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.00067402073,0.00009059916,0.0019202365,0.00031531916,0.00006367824,0.00039007692,0.00050528883,0.55838525,0.059670728,0.23204373,0.0020544368,0.14388654],"study_design_scores_gemma":[0.00007339508,0.00030530404,0.0005317394,0.000032012602,0.000046161673,0.00026990383,0.00010108863,0.9387375,0.019814668,0.034851525,0.005177236,0.00005950237],"about_ca_topic_score_codex":0.0032722496,"about_ca_topic_score_gemma":0.002535707,"teacher_disagreement_score":0.0032722496,"about_ca_system_score_codex":0.0008107217,"about_ca_system_score_gemma":0.0007706915,"threshold_uncertainty_score":0.0065063834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9673159,0.00020585749,0.03101397,0.00013591304,0.000023489727,0.000022072638,0.000060364386,0.00016609069,0.0010562377],"genre_scores_gemma":[0.9966697,0.000042538555,0.0030231688,0.000026107835,0.000004343971,0.000009497412,0.000026194477,0.000013168558,0.00018521307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979882,0.0008058891,0.00013688483,0.00019528702,0.00059712876,0.0002765949],"domain_scores_gemma":[0.9779068,0.017470002,0.0022725554,0.00079319446,0.0012692732,0.00028819728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002026278,0.00062427693,0.00056855264,0.00043677905,0.00044744363,0.00059476757,0.00032289117,0.0007542206,0.0008905703],"category_scores_gemma":[0.015640976,0.00038940244,0.0002891504,0.0006008762,0.0006601737,0.001097962,0.0006216167,0.000481078,0.00018831814],"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.0007122301,0.00008481536,0.008921402,0.000053510896,0.000087163615,0.00031147315,0.000099340745,0.96192497,0.017927522,0.0014530402,0.00012444291,0.008300139],"study_design_scores_gemma":[0.000050938732,0.00050109345,0.0059306077,0.000012610974,0.0000470157,0.0003198272,0.00006040898,0.95690215,0.035030678,0.0009264459,0.00017408613,0.000044200788],"about_ca_topic_score_codex":0.0022167515,"about_ca_topic_score_gemma":0.0015098354,"teacher_disagreement_score":0.0022167515,"about_ca_system_score_codex":0.0010316834,"about_ca_system_score_gemma":0.0005495559,"threshold_uncertainty_score":0.010716081},"labels":[],"label_agreement":null},{"id":"W2029060558","doi":"10.1002/jcd.20143","title":"Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular <i>n</i>‐queens solutions","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Latin square; Magic square; Mathematics; Combinatorics; Orthogonal array; Modular design; Diagonal; Construct (python library); Least-squares function approximation; Statistics; Computer science; Geometry; Chemistry","score_opus":0.020036007918038928,"score_gpt":0.21804263491021536,"score_spread":0.19800662699217644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029060558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5625455,0.00013785918,0.3809676,0.00033157953,0.00014922289,0.00019140363,0.00014134798,0.0003511988,0.055184398],"genre_scores_gemma":[0.73198843,0.00009971193,0.25620395,0.00016230161,0.00002280454,0.00012216483,0.00019054969,0.00010221008,0.011107901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974567,0.00007567641,0.000018269735,0.000052579086,0.00006482157,0.000043008684],"domain_scores_gemma":[0.99962175,0.00011536271,0.000073476156,0.00009725666,0.000054845095,0.00003723853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025690356,0.0003418126,0.00026148584,0.00033838936,0.0004803911,0.00042580525,0.00037316862,0.00027490617,0.0056003677],"category_scores_gemma":[0.0011063521,0.00023123951,0.00038347524,0.00031214766,0.0006527375,0.0007197833,0.0013690158,0.000403902,0.0006595665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037484433,0.00018439605,0.0047093243,0.0004226684,0.00007583189,0.00076099986,0.0006454938,0.04677074,0.09082586,0.58557296,0.005999718,0.26365712],"study_design_scores_gemma":[0.00026788883,0.00086466165,0.0032995557,0.00012504098,0.00009832323,0.002066318,0.00086720893,0.25494924,0.14772992,0.5308828,0.058748398,0.00010063206],"about_ca_topic_score_codex":0.0002569278,"about_ca_topic_score_gemma":0.00052974094,"teacher_disagreement_score":0.0056003677,"about_ca_system_score_codex":0.00021345932,"about_ca_system_score_gemma":0.00039652607,"threshold_uncertainty_score":0.018735051},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6326435,0.0011224684,0.20034844,0.0020714232,0.000644715,0.00018368663,0.000994031,0.00028684837,0.16170485],"genre_scores_gemma":[0.8898041,0.0011924274,0.029945923,0.00063997606,0.00040164654,0.00020045807,0.00074898644,0.00027498582,0.07679143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994281,0.00014993364,0.000016830028,0.00009914828,0.00015284473,0.00015314546],"domain_scores_gemma":[0.99866307,0.00059996423,0.00026213055,0.00011520208,0.00011960593,0.00023997262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040697036,0.0012291512,0.0011490346,0.0021503146,0.0018377955,0.002583617,0.0011245892,0.0016307296,0.01628719],"category_scores_gemma":[0.0018319809,0.0006883223,0.0008841357,0.0015348354,0.0025070428,0.001938752,0.00216335,0.0025551964,0.0015005586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010239952,0.000045800396,0.00018752462,0.00006209933,0.00001443348,0.00014777642,0.00018625436,0.018555077,0.0016767203,0.9705549,0.0026713302,0.0057956683],"study_design_scores_gemma":[0.00004655724,0.000051311967,0.0003669443,0.00003682763,0.000008323986,0.00013008741,0.00019441413,0.05175296,0.00077028055,0.9415,0.005112416,0.0000299205],"about_ca_topic_score_codex":0.0017874873,"about_ca_topic_score_gemma":0.0017853277,"teacher_disagreement_score":0.01628719,"about_ca_system_score_codex":0.0011989623,"about_ca_system_score_gemma":0.00049916067,"threshold_uncertainty_score":0.054486036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66837287,0.0009953826,0.28311482,0.0007521617,0.00019556076,0.0000733425,0.00013031928,0.00014849611,0.04621717],"genre_scores_gemma":[0.970463,0.00029912207,0.025427125,0.00007736082,0.00003725196,0.000041817893,0.0000613832,0.000023883675,0.0035690456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963987,0.00008949755,0.000023428753,0.0000655828,0.00010334599,0.00007824241],"domain_scores_gemma":[0.9978771,0.0010675815,0.00030688534,0.00023331401,0.00028454317,0.0002305734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077224744,0.00025815036,0.00063066377,0.0009801992,0.0014620662,0.0013819839,0.0007167425,0.00095637183,0.0030045628],"category_scores_gemma":[0.004538126,0.00039045865,0.0004984318,0.00063072296,0.0018624204,0.002568817,0.0020253335,0.0010920101,0.00020123312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080642596,0.000020510362,0.0004507489,0.00004563669,0.000008313556,0.00013724939,0.00028526605,0.008942597,0.003478087,0.97992927,0.00041144222,0.006210157],"study_design_scores_gemma":[0.000021874068,0.00009386729,0.00047772596,0.00003955326,0.000017520711,0.0002864499,0.0004875273,0.16253942,0.004183342,0.8287072,0.0031084446,0.00003702547],"about_ca_topic_score_codex":0.0007385577,"about_ca_topic_score_gemma":0.00068144477,"teacher_disagreement_score":0.0030045628,"about_ca_system_score_codex":0.0006666435,"about_ca_system_score_gemma":0.00061971997,"threshold_uncertainty_score":0.01005125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21344279,0.0011693207,0.4444593,0.0032158971,0.00042584605,0.00011954628,0.00042427483,0.00070103694,0.33604205],"genre_scores_gemma":[0.89969164,0.00079981727,0.057575736,0.00068830594,0.00027069662,0.00030081894,0.0004504575,0.0004051437,0.03981735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977119,0.0009569418,0.00009799419,0.00046243818,0.00044112763,0.00032953118],"domain_scores_gemma":[0.99634296,0.002120699,0.00024755977,0.0007207887,0.0002703311,0.00029770331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014909443,0.0011229455,0.0010602004,0.0026285243,0.0046631144,0.004908221,0.0019578263,0.0020137154,0.015360177],"category_scores_gemma":[0.0039500794,0.0012649562,0.0014497056,0.002895628,0.0063286074,0.008874798,0.004644065,0.0047275773,0.0016436802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057112193,0.000005801042,0.000030585747,0.000007705769,0.000001591606,0.000028356579,0.00009154174,0.0001630357,0.00010509405,0.9983308,0.0002828931,0.00094687764],"study_design_scores_gemma":[0.0000037647692,0.0000030062165,0.000021624892,0.0000064825563,0.0000041051685,0.00007621899,0.00005158464,0.00084603933,0.00024350097,0.9968867,0.0018516005,0.0000054807265],"about_ca_topic_score_codex":0.0006777146,"about_ca_topic_score_gemma":0.00071564736,"teacher_disagreement_score":0.015360177,"about_ca_system_score_codex":0.0012229553,"about_ca_system_score_gemma":0.0008094083,"threshold_uncertainty_score":0.051384926},"labels":[],"label_agreement":null},{"id":"W2031150529","doi":"10.1002/jcd.10038","title":"New families of strongly regular graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Zero (linguistics); Construct (python library); Discrete mathematics; Computer science; Geometry; Linguistics","score_opus":0.01171215837774376,"score_gpt":0.2047028187216017,"score_spread":0.19299066034385795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031150529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8129024,0.00026744328,0.14757794,0.00042574998,0.000120346835,0.00010697185,0.00018992314,0.0004526608,0.03795666],"genre_scores_gemma":[0.9622689,0.0001451297,0.028496327,0.00011576686,0.00004760791,0.00010890816,0.00026105088,0.00007687768,0.00847942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00022940867,0.000036407484,0.00018920632,0.00025358572,0.00012708199],"domain_scores_gemma":[0.99797136,0.0006723745,0.0003382877,0.00041363886,0.0003638103,0.00024043891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006133903,0.00038911242,0.00039703044,0.0013933384,0.0011957774,0.001171453,0.0007967041,0.00074963825,0.0034097624],"category_scores_gemma":[0.002955769,0.00049326423,0.0005652821,0.00044064978,0.0015365727,0.0013015226,0.0012123482,0.0010243464,0.0003044397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018295781,0.000083180756,0.0035230676,0.000113232134,0.000049543614,0.0010991972,0.0008298486,0.011624994,0.030536616,0.9229418,0.002160148,0.02685535],"study_design_scores_gemma":[0.000095412586,0.0003028853,0.0041622915,0.00007903428,0.00008786342,0.00376762,0.0008178699,0.10274425,0.022126026,0.83389497,0.03183335,0.00008838295],"about_ca_topic_score_codex":0.00023588717,"about_ca_topic_score_gemma":0.0004592175,"teacher_disagreement_score":0.0034097624,"about_ca_system_score_codex":0.00053952873,"about_ca_system_score_gemma":0.00030729218,"threshold_uncertainty_score":0.011406839},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06089541,0.0048088175,0.8629103,0.001789036,0.0015197621,0.00014868131,0.0024461676,0.00051744544,0.064964436],"genre_scores_gemma":[0.6174567,0.0057867155,0.3165287,0.0013520612,0.0011199695,0.00042876374,0.0037202237,0.0004180395,0.053188764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994362,0.00012282949,0.000037650738,0.00009700196,0.00018262258,0.00012365797],"domain_scores_gemma":[0.9989027,0.00024039447,0.00016184604,0.00013764741,0.00034707444,0.00021028215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075570226,0.001033595,0.0005397347,0.0016688856,0.0009875237,0.0020347328,0.00052186183,0.0005632701,0.016782673],"category_scores_gemma":[0.0034507052,0.00041777093,0.0006179738,0.0012288621,0.0011816482,0.0024031696,0.0014383263,0.0014408056,0.0046738274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016009582,0.00003927869,0.00043321945,0.00014922344,0.000020103555,0.0002019095,0.0004465851,0.0047260914,0.0043089576,0.9023824,0.033349965,0.05378217],"study_design_scores_gemma":[0.000025304178,0.0000580415,0.00043387807,0.000058792804,0.000012907702,0.0004142358,0.00017752197,0.026813654,0.0011005999,0.93882585,0.032034315,0.000044928525],"about_ca_topic_score_codex":0.0013145405,"about_ca_topic_score_gemma":0.0021608,"teacher_disagreement_score":0.016782673,"about_ca_system_score_codex":0.00063010864,"about_ca_system_score_gemma":0.0005757334,"threshold_uncertainty_score":0.05614364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.924073,0.000998789,0.031782787,0.00029603794,0.0001334989,0.00015529891,0.0032539447,0.00044904562,0.038857564],"genre_scores_gemma":[0.95980066,0.0007171824,0.025427174,0.00012651292,0.00007618831,0.00020135757,0.0061700945,0.0001275745,0.0073532686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934095,0.00008821237,0.000079617275,0.000119099146,0.00020398162,0.00016816249],"domain_scores_gemma":[0.99708766,0.0011022199,0.00043428183,0.0003296493,0.00065683504,0.00038930107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060204504,0.00039254047,0.00033103616,0.0030284252,0.00096820376,0.0012128345,0.0006463154,0.0007194613,0.0061634807],"category_scores_gemma":[0.0032612665,0.00017363287,0.00027682984,0.0017514878,0.00094525877,0.001385346,0.0007081807,0.0008074639,0.001111224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023317903,0.0006935437,0.08819255,0.00072617596,0.000091422,0.001431923,0.0021495363,0.0091617815,0.105753325,0.36827785,0.014872312,0.40631774],"study_design_scores_gemma":[0.00029020524,0.0015469901,0.1096208,0.00047970662,0.00014166691,0.0059594847,0.0032841011,0.08848378,0.124933824,0.5231445,0.14187507,0.00023988145],"about_ca_topic_score_codex":0.0006705933,"about_ca_topic_score_gemma":0.00048042863,"teacher_disagreement_score":0.0061634807,"about_ca_system_score_codex":0.00060523895,"about_ca_system_score_gemma":0.0006284407,"threshold_uncertainty_score":0.020618916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760365,0.00008940202,0.016068945,0.00018275323,0.000020340838,0.000035052428,0.00030459525,0.00026164288,0.0070007783],"genre_scores_gemma":[0.994436,0.000026933461,0.004874412,0.000013330564,0.0000028700845,0.000026679403,0.00007740717,0.000016760234,0.0005256545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977547,0.00005426744,0.000008402856,0.000025304182,0.000090001784,0.000046525623],"domain_scores_gemma":[0.99854136,0.0010514865,0.000085328495,0.000085944775,0.00019628483,0.00003960628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041839902,0.00037157597,0.00032713488,0.00026527277,0.00028205154,0.00033889303,0.0005348139,0.00077913405,0.0024281428],"category_scores_gemma":[0.0016678887,0.00017145167,0.00022181193,0.0002790989,0.00051690894,0.00032658517,0.00030259264,0.00038018887,0.00012758496],"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.00040514898,0.00016631316,0.0036149314,0.000117922995,0.000037365277,0.00025246746,0.00012805841,0.9657587,0.019727105,0.004775925,0.0005678934,0.00444822],"study_design_scores_gemma":[0.00004804826,0.00011254086,0.0005825128,0.000006622403,0.000007826962,0.00002935577,0.000020771065,0.9861413,0.01228355,0.0004659603,0.0002915218,0.000009908597],"about_ca_topic_score_codex":0.004170694,"about_ca_topic_score_gemma":0.0023267982,"teacher_disagreement_score":0.004170694,"about_ca_system_score_codex":0.0004310622,"about_ca_system_score_gemma":0.000283552,"threshold_uncertainty_score":0.008292794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99185467,0.00014939238,0.006852737,0.000049227227,0.000015006486,0.000008311375,0.000064927226,0.00015884456,0.00084683055],"genre_scores_gemma":[0.9920293,0.000086261505,0.00684985,0.00002576908,0.000009306688,0.000011756646,0.00013095434,0.00002057871,0.0008360517],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999032,0.0002326412,0.000070211005,0.00013228787,0.00043504612,0.000097780365],"domain_scores_gemma":[0.99671704,0.0013700656,0.0002685856,0.00021162727,0.0013261704,0.00010663373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082243694,0.00027575958,0.00037997853,0.00069391093,0.00036522443,0.00029074016,0.00037805774,0.0006823501,0.0011446544],"category_scores_gemma":[0.003522486,0.0001299157,0.00009529326,0.0006215782,0.00031291012,0.0006082698,0.00028670233,0.0003039745,0.00028928826],"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.001533451,0.00021811761,0.009606442,0.00023312641,0.0000958624,0.0002108238,0.0003406413,0.012190815,0.93884003,0.00084390014,0.00039822856,0.035488416],"study_design_scores_gemma":[0.000075281845,0.0014391928,0.02342586,0.000026759577,0.00007743162,0.00055597693,0.000111976384,0.0816692,0.8913925,0.00041695827,0.00074687664,0.00006191169],"about_ca_topic_score_codex":0.0007351906,"about_ca_topic_score_gemma":0.0007729163,"teacher_disagreement_score":0.0011446544,"about_ca_system_score_codex":0.00026168086,"about_ca_system_score_gemma":0.00016704177,"threshold_uncertainty_score":0.0043495297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904231,0.00011152278,0.008097971,0.000103746046,0.000012469874,0.000025185273,0.000055592245,0.0003593547,0.0008111571],"genre_scores_gemma":[0.9935828,0.000039938233,0.0053240345,0.000029672443,0.000012379405,0.000016008456,0.000047821508,0.000047399342,0.0008999221],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894136,0.00023943844,0.000063724896,0.00022500455,0.0003501923,0.0001802271],"domain_scores_gemma":[0.99683964,0.0013881549,0.00044984388,0.00029976867,0.0007234792,0.00029909532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009436062,0.0005847714,0.00077012985,0.0003703135,0.00058687024,0.0006094606,0.0010926219,0.0019544398,0.002451424],"category_scores_gemma":[0.002508925,0.00034142847,0.00036461247,0.0003348572,0.0005843151,0.0010489653,0.0006677328,0.00063684,0.0007353503],"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.0024004807,0.00017591366,0.0045762514,0.00016803706,0.0001591389,0.00050724973,0.000593701,0.0048655025,0.97533095,0.0006191405,0.00024647822,0.0103571],"study_design_scores_gemma":[0.00026359764,0.00855206,0.010095589,0.000029151552,0.0002370003,0.0021852262,0.0001669208,0.07071567,0.90586483,0.00027480305,0.0015287036,0.00008642436],"about_ca_topic_score_codex":0.0005579955,"about_ca_topic_score_gemma":0.0005182521,"teacher_disagreement_score":0.002451424,"about_ca_system_score_codex":0.00040554095,"about_ca_system_score_gemma":0.00028051462,"threshold_uncertainty_score":0.008200824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035709545,0.0004986208,0.9242455,0.00036762218,0.00014684288,0.00013261595,0.0004000164,0.0005153719,0.037983924],"genre_scores_gemma":[0.6501012,0.0010489904,0.3026842,0.0009156095,0.00024013435,0.00060564507,0.0009952134,0.00042055,0.04298845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966822,0.0011475587,0.00016167812,0.0005749238,0.0010387092,0.0003948681],"domain_scores_gemma":[0.9944963,0.0019037657,0.0005356811,0.0018743658,0.0008943272,0.0002955389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024426093,0.0011604395,0.001506944,0.0011246005,0.00097099453,0.0024975105,0.0011556878,0.0014948609,0.015548501],"category_scores_gemma":[0.008519935,0.0010290003,0.00070656143,0.0013826895,0.0013358868,0.003277567,0.002605831,0.0020999347,0.0031137026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026845804,0.000058026348,0.00025387396,0.00010821299,0.00003985682,0.000057234767,0.000106717125,0.030268101,0.006066475,0.9167381,0.0037160565,0.042318895],"study_design_scores_gemma":[0.000092358794,0.00021260977,0.00023513993,0.000074667216,0.000053543015,0.00013213028,0.00006151536,0.12741052,0.005498899,0.8507722,0.015422566,0.000033838984],"about_ca_topic_score_codex":0.0006480733,"about_ca_topic_score_gemma":0.0012647513,"teacher_disagreement_score":0.015548501,"about_ca_system_score_codex":0.0010622249,"about_ca_system_score_gemma":0.0015150959,"threshold_uncertainty_score":0.052014887},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07389941,0.023274437,0.7191444,0.015393872,0.001852889,0.00035528676,0.0021646873,0.0017628542,0.16215222],"genre_scores_gemma":[0.7836845,0.021083962,0.13481978,0.0058362465,0.0038708528,0.0015348309,0.0025976922,0.0018158645,0.04475625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886362,0.0028067722,0.00031547892,0.0011793894,0.004212146,0.002849964],"domain_scores_gemma":[0.9136841,0.07003727,0.0027294883,0.006540668,0.004632136,0.0023763103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009575779,0.0057552215,0.0044659968,0.008118759,0.0040955837,0.0106196,0.0056928126,0.004599805,0.02059726],"category_scores_gemma":[0.07542602,0.0024314993,0.0020292453,0.0100300005,0.008423593,0.020463938,0.011679522,0.01263551,0.004947117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007157432,0.00021062508,0.0006413116,0.0005474961,0.00008570757,0.00016155776,0.0005955322,0.047523595,0.0026649283,0.8793586,0.021314029,0.046180908],"study_design_scores_gemma":[0.00005476766,0.00007046882,0.00020022425,0.00024830113,0.00006458811,0.00008957495,0.000099851015,0.057623535,0.0013253972,0.9332533,0.006914005,0.00005607147],"about_ca_topic_score_codex":0.0052232714,"about_ca_topic_score_gemma":0.0053565847,"teacher_disagreement_score":0.02059726,"about_ca_system_score_codex":0.01136885,"about_ca_system_score_gemma":0.0047128657,"threshold_uncertainty_score":0.082487226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8501766,0.00032502983,0.088047475,0.00035852028,0.00013765051,0.000090023575,0.00034625008,0.00040447744,0.060114045],"genre_scores_gemma":[0.9706547,0.00010995989,0.022433989,0.000100802135,0.000030305313,0.00006976569,0.00019332934,0.000058492507,0.0063486537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926394,0.0001790962,0.00004056123,0.0001964784,0.00014492092,0.00017493608],"domain_scores_gemma":[0.9994043,0.00009781821,0.00008711523,0.00018964687,0.00009751335,0.00012366606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032809438,0.00044994915,0.00054255174,0.0010563326,0.0016380146,0.0016760988,0.0010102735,0.00051564106,0.007917877],"category_scores_gemma":[0.0010934565,0.00037223968,0.00046760944,0.001040212,0.0036293487,0.0025857647,0.003166125,0.0011380045,0.0007148703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011728648,0.000025286798,0.002040252,0.000081482896,0.000021114414,0.000544454,0.00056317507,0.007209827,0.005768233,0.9698434,0.0012023508,0.012583195],"study_design_scores_gemma":[0.00005476726,0.000118302814,0.003796471,0.000059634982,0.000028621174,0.0013444739,0.0012370787,0.0222173,0.0074733323,0.9479646,0.015606578,0.0000988227],"about_ca_topic_score_codex":0.00083769404,"about_ca_topic_score_gemma":0.0013244704,"teacher_disagreement_score":0.007917877,"about_ca_system_score_codex":0.0010349941,"about_ca_system_score_gemma":0.0004789999,"threshold_uncertainty_score":0.026487947},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5255112,0.000526216,0.34348875,0.0026500977,0.00047259658,0.0001846327,0.0008971871,0.000635265,0.12563401],"genre_scores_gemma":[0.960141,0.00018885976,0.017190197,0.00046268682,0.00022677353,0.0001251677,0.00032731262,0.00012814696,0.021209868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975555,0.000824133,0.0000914881,0.00045341477,0.00032056516,0.00075493456],"domain_scores_gemma":[0.9888586,0.005497206,0.0011972476,0.0016172795,0.00073491636,0.002094804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019347371,0.0006540608,0.0018305575,0.0010047259,0.0030967866,0.004913515,0.0013317836,0.0021875873,0.018573912],"category_scores_gemma":[0.011346635,0.00058458274,0.0010074419,0.0017105214,0.0023749343,0.003900591,0.002668916,0.0028471332,0.0013992285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004985388,0.00011383107,0.0017726879,0.000068381574,0.00008479925,0.00034731798,0.00034637275,0.008668471,0.0016775519,0.96029234,0.008286173,0.017843544],"study_design_scores_gemma":[0.00016250196,0.00008870773,0.00094520574,0.000014541812,0.000023098244,0.0002685679,0.00015881512,0.029187078,0.0004417147,0.9639482,0.0047341487,0.000027376582],"about_ca_topic_score_codex":0.0018524121,"about_ca_topic_score_gemma":0.0019809136,"teacher_disagreement_score":0.018573912,"about_ca_system_score_codex":0.0008360429,"about_ca_system_score_gemma":0.001148344,"threshold_uncertainty_score":0.062135935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2655379,0.0005598968,0.6724446,0.0005813561,0.000119807264,0.0001838586,0.00059733406,0.00034099023,0.059634253],"genre_scores_gemma":[0.84380025,0.0008992684,0.12982556,0.0004114866,0.000116570176,0.00035425133,0.00054507033,0.00016997976,0.02387761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988809,0.00046165273,0.00004173416,0.00015124159,0.0003017823,0.0001628248],"domain_scores_gemma":[0.9961117,0.0022455202,0.0004809777,0.00049006345,0.0004716878,0.000200167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014881203,0.0011900488,0.0007098473,0.0011141878,0.00072706863,0.0019369391,0.00077940355,0.0009602701,0.0059613455],"category_scores_gemma":[0.005155496,0.0006345952,0.00036978576,0.001262636,0.001187393,0.0019398789,0.0012370881,0.0007861269,0.00091791846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044975293,0.000049091544,0.00084456167,0.00010267077,0.000027675345,0.000118908385,0.00016023409,0.06121835,0.013708583,0.8985869,0.0027036362,0.022029676],"study_design_scores_gemma":[0.0001466196,0.0002278655,0.0005444416,0.00010874593,0.000051757055,0.0002105501,0.0001037095,0.2753896,0.0077724857,0.70774627,0.007644114,0.000053803476],"about_ca_topic_score_codex":0.0012577268,"about_ca_topic_score_gemma":0.0027658343,"teacher_disagreement_score":0.0059613455,"about_ca_system_score_codex":0.0014823244,"about_ca_system_score_gemma":0.0011279167,"threshold_uncertainty_score":0.01994276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085939996,0.002001449,0.68608075,0.0028065273,0.0014307592,0.00011640724,0.00072372943,0.0006661302,0.22023426],"genre_scores_gemma":[0.8059969,0.0018822815,0.09866028,0.001325776,0.0011814297,0.0001547966,0.0004885947,0.00025073477,0.09005925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936384,0.00018349933,0.000027937578,0.00013342402,0.00021216032,0.000079072306],"domain_scores_gemma":[0.99809915,0.0006413819,0.00019585338,0.00048028055,0.00046087676,0.00012250817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005085313,0.00089119043,0.0006510743,0.0018980697,0.0008900224,0.002110966,0.00070077926,0.0012099849,0.017585456],"category_scores_gemma":[0.0033725214,0.00032227117,0.00040371082,0.0019337917,0.0015222585,0.0025384608,0.00086047465,0.0017313112,0.0034407468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043196087,0.00001624293,0.00009761134,0.00003199434,0.0000074804275,0.00010535195,0.00009344193,0.0023720565,0.002575238,0.97658473,0.0025937806,0.015478803],"study_design_scores_gemma":[0.000013847361,0.000025769614,0.00017675296,0.000019671834,0.000006442428,0.00029835387,0.00004989495,0.018128514,0.002883339,0.96652526,0.011844824,0.00002729284],"about_ca_topic_score_codex":0.00039572397,"about_ca_topic_score_gemma":0.0003306047,"teacher_disagreement_score":0.017585456,"about_ca_system_score_codex":0.00057491736,"about_ca_system_score_gemma":0.00045477762,"threshold_uncertainty_score":0.05882919},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08760039,0.0010144945,0.7847565,0.0012005672,0.0003126744,0.00018797572,0.0003426895,0.00064906536,0.12393567],"genre_scores_gemma":[0.7203231,0.00089624146,0.25325733,0.00091406197,0.00024608357,0.00042729668,0.00029856386,0.00023247565,0.023404896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978319,0.0008053196,0.00014160911,0.00034934093,0.00050546415,0.00036653483],"domain_scores_gemma":[0.99698263,0.001199841,0.00037041155,0.00064689264,0.00049578334,0.000304342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019442525,0.0012012544,0.0007591752,0.0023424593,0.0018401833,0.0034819613,0.001435269,0.0026935376,0.007230285],"category_scores_gemma":[0.0048867087,0.0008337505,0.00095476676,0.0020105382,0.003142597,0.0020511397,0.0024862054,0.0026531958,0.0019821923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029365374,0.000007379691,0.000053093405,0.000020039985,0.0000034840448,0.000044773304,0.00008400408,0.0008529458,0.0018318588,0.99371743,0.00039968855,0.0029559163],"study_design_scores_gemma":[0.000036144884,0.00005437785,0.0001243497,0.000049379563,0.000011796642,0.00038550462,0.00007136405,0.013771256,0.0029099705,0.97521245,0.007327742,0.00004555849],"about_ca_topic_score_codex":0.0005405649,"about_ca_topic_score_gemma":0.0006204655,"teacher_disagreement_score":0.007230285,"about_ca_system_score_codex":0.0013220531,"about_ca_system_score_gemma":0.0010641022,"threshold_uncertainty_score":0.024187684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3616443,0.0038031172,0.56509167,0.0032056733,0.00047986582,0.000059555867,0.00064797926,0.00024630548,0.06482154],"genre_scores_gemma":[0.93736356,0.0022283758,0.04642585,0.00074159645,0.0012408026,0.00007694461,0.00043522887,0.000089302266,0.011398408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909914,0.00025866998,0.000043608292,0.00026801403,0.00024008636,0.00009050949],"domain_scores_gemma":[0.996093,0.0019903718,0.00048984936,0.00042580525,0.00068021205,0.00032091836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084262586,0.0004830804,0.00072638853,0.0016680722,0.0011554126,0.0019103513,0.00093237567,0.0009579792,0.004991488],"category_scores_gemma":[0.004465755,0.00033323973,0.0007937332,0.0020771895,0.0022518805,0.0051435675,0.0012323287,0.002220354,0.00057470397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005220244,0.000037144375,0.00039099052,0.00006866293,0.000010720161,0.00009224411,0.00029962373,0.002100801,0.0026949865,0.98482776,0.0014097509,0.008015148],"study_design_scores_gemma":[0.000011949726,0.00005215465,0.00041097798,0.000011191961,0.000009829764,0.0001937967,0.00007125291,0.024454335,0.0008791485,0.9716233,0.002257938,0.000024098306],"about_ca_topic_score_codex":0.0015170124,"about_ca_topic_score_gemma":0.0008226418,"teacher_disagreement_score":0.004991488,"about_ca_system_score_codex":0.00081764057,"about_ca_system_score_gemma":0.0005446616,"threshold_uncertainty_score":0.016698241},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27078795,0.0046604215,0.5782939,0.0022531727,0.00048134083,0.00052362937,0.0022039227,0.00044112306,0.14035445],"genre_scores_gemma":[0.80099815,0.004236653,0.14365712,0.0010258686,0.0005350745,0.0005738826,0.0027260918,0.0003076463,0.04593943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999395,0.0001291394,0.000033901477,0.00018953445,0.00013290369,0.0001193949],"domain_scores_gemma":[0.99786514,0.0009297018,0.00033886338,0.00024669402,0.00033454472,0.00028502807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441038,0.00095260236,0.00083628274,0.0024679373,0.0013344181,0.0035274706,0.0011761093,0.0012936181,0.0073470366],"category_scores_gemma":[0.003621773,0.00084429595,0.001080164,0.0027801835,0.0016772194,0.0037616699,0.0013336736,0.0024372323,0.00077462994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069573114,0.000035199948,0.0003661841,0.00010651444,0.000023906066,0.00010539678,0.00028286534,0.005527225,0.0015538184,0.97064227,0.004555373,0.016731644],"study_design_scores_gemma":[0.000021227042,0.000009983397,0.00020134088,0.000034104767,0.000017622826,0.00010888885,0.00011757255,0.01351463,0.0004667804,0.98023784,0.0052593034,0.000010740428],"about_ca_topic_score_codex":0.0021423602,"about_ca_topic_score_gemma":0.002162181,"teacher_disagreement_score":0.0073470366,"about_ca_system_score_codex":0.0014042652,"about_ca_system_score_gemma":0.0009152366,"threshold_uncertainty_score":0.024578333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019788675,0.00012191165,0.97756654,0.0001532645,0.00012884793,0.000071522736,0.000092873845,0.00034500548,0.0017312466],"genre_scores_gemma":[0.5648515,0.0002916614,0.42822722,0.00035778678,0.00045865306,0.00032208196,0.000565389,0.00025832138,0.004667381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675876,0.0015734446,0.00012814107,0.00037654908,0.0009859925,0.00017713646],"domain_scores_gemma":[0.9823632,0.013256345,0.00058393815,0.0014538864,0.0019152784,0.00042732785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039800066,0.0010960402,0.0014990045,0.0019452354,0.00051314634,0.0014829081,0.0020993373,0.0016863542,0.004466679],"category_scores_gemma":[0.028575405,0.00047562123,0.0007007201,0.0018445826,0.0016346454,0.0026656978,0.0019397025,0.001405662,0.0010489033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001611428,0.00037224175,0.0046405895,0.00045584855,0.00029256652,0.0007946823,0.00014309365,0.3718664,0.035778802,0.23142861,0.006671535,0.34594405],"study_design_scores_gemma":[0.00003727994,0.00010727028,0.00037260182,0.000012119762,0.00002262942,0.00015948783,0.000010447478,0.9692673,0.00292528,0.026238637,0.0008226754,0.000024230083],"about_ca_topic_score_codex":0.0014303011,"about_ca_topic_score_gemma":0.0010830954,"teacher_disagreement_score":0.004466679,"about_ca_system_score_codex":0.00061239704,"about_ca_system_score_gemma":0.0012781152,"threshold_uncertainty_score":0.021048546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21289358,0.00030969264,0.75378585,0.00065991876,0.000106400104,0.00009875441,0.00020588348,0.00044264735,0.03149732],"genre_scores_gemma":[0.8494146,0.00038120354,0.13385877,0.0003097678,0.00015892141,0.00012913642,0.00023550222,0.00011744802,0.015394726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988286,0.00041064163,0.0000645644,0.00022135476,0.00033125913,0.00014356733],"domain_scores_gemma":[0.9969886,0.001382794,0.0004761267,0.00051333953,0.00039348824,0.00024569116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009756976,0.0004490714,0.0006399012,0.0014711841,0.0009899508,0.0027575726,0.0009917043,0.0010140907,0.0060252347],"category_scores_gemma":[0.0050789095,0.0005244249,0.00050858,0.0017733646,0.0009869786,0.0046393923,0.0018684631,0.0011803837,0.00082452653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014684605,0.00007343889,0.00038156591,0.000054231376,0.000019576823,0.000103452796,0.00013871916,0.01311029,0.006037138,0.95320207,0.0015827373,0.02514997],"study_design_scores_gemma":[0.000038878003,0.000049761442,0.00020526588,0.0000145794875,0.000015782956,0.00018775152,0.00006878765,0.15566678,0.0045179753,0.8360604,0.0031518855,0.00002211086],"about_ca_topic_score_codex":0.00079019304,"about_ca_topic_score_gemma":0.0011092959,"teacher_disagreement_score":0.0060252347,"about_ca_system_score_codex":0.0009795644,"about_ca_system_score_gemma":0.00070275815,"threshold_uncertainty_score":0.020156384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77916324,0.00039680646,0.08839164,0.0007231066,0.00024667755,0.000121688165,0.0013151971,0.00023557404,0.12940592],"genre_scores_gemma":[0.96206594,0.00021307061,0.022769468,0.00016469815,0.000048477676,0.00013448799,0.0014365646,0.000068994166,0.013098332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999286,0.000132136,0.000059170783,0.000097551936,0.00026060035,0.00016446818],"domain_scores_gemma":[0.99901843,0.00029385387,0.00016389751,0.0001222884,0.000205659,0.00019586313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035409036,0.0006374248,0.0009638857,0.0021762953,0.0028568695,0.0035108377,0.0009348245,0.0012713155,0.010445766],"category_scores_gemma":[0.0012742268,0.0005715785,0.0008463112,0.0020660835,0.0015779751,0.0016712204,0.0024063406,0.001386083,0.0012608579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000265407,0.000077350094,0.0012381428,0.000112453825,0.0000581457,0.0009227058,0.0006168294,0.004914501,0.009140336,0.9634147,0.0035196524,0.015719894],"study_design_scores_gemma":[0.00008550691,0.000103916165,0.0018712941,0.000082950064,0.00007619334,0.001214595,0.0015275175,0.024159413,0.006849513,0.9510873,0.012862865,0.00007888452],"about_ca_topic_score_codex":0.00085025217,"about_ca_topic_score_gemma":0.00084962806,"teacher_disagreement_score":0.010445766,"about_ca_system_score_codex":0.0008768974,"about_ca_system_score_gemma":0.0005986525,"threshold_uncertainty_score":0.034944594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23799974,0.0015178216,0.6657806,0.0014851086,0.00044149774,0.00018621006,0.0008594515,0.00031744802,0.091412134],"genre_scores_gemma":[0.73097765,0.0013692451,0.22511658,0.0005166763,0.00021638267,0.0002807344,0.00092727883,0.00026809284,0.040327385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927586,0.00022449656,0.00004236772,0.00018721112,0.00018425964,0.00008575917],"domain_scores_gemma":[0.9977825,0.0012127324,0.0003430006,0.00023324497,0.0002509791,0.00017755954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038631083,0.00058204867,0.00072069,0.001797082,0.001106214,0.0018212134,0.0011948347,0.0012307198,0.010951517],"category_scores_gemma":[0.0028301198,0.0006358269,0.00043833215,0.0023579584,0.0018245261,0.0030095263,0.0016872268,0.0015648938,0.0012219457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007887945,0.000026702814,0.00044892004,0.0000939027,0.000011568942,0.00019675841,0.00037504596,0.009225801,0.0021941918,0.9655827,0.002037141,0.019728418],"study_design_scores_gemma":[0.000030309991,0.000029062812,0.00034670948,0.000034981,0.000013044385,0.00037491147,0.00041293746,0.039865095,0.0011270005,0.94273067,0.015022095,0.000013194498],"about_ca_topic_score_codex":0.0022093903,"about_ca_topic_score_gemma":0.0028490953,"teacher_disagreement_score":0.010951517,"about_ca_system_score_codex":0.00058686605,"about_ca_system_score_gemma":0.00030549074,"threshold_uncertainty_score":0.03663647},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02573487,0.019424124,0.5976953,0.019069461,0.011970768,0.00011021051,0.0009916974,0.0009881455,0.32401547],"genre_scores_gemma":[0.4956038,0.043812793,0.30818492,0.010630582,0.018056752,0.0003178262,0.0011727534,0.0009373879,0.12128324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992963,0.00022072213,0.000042966483,0.00018723654,0.0001818926,0.00007083145],"domain_scores_gemma":[0.9969555,0.0020025852,0.00011414288,0.0004459353,0.00030423794,0.00017764415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096323394,0.0010306092,0.0013392173,0.0017974988,0.0027474628,0.002536713,0.002073269,0.0014047715,0.008893982],"category_scores_gemma":[0.0033947953,0.0006668557,0.0012652328,0.0045311837,0.0035349152,0.008525653,0.0026854505,0.006290289,0.0030950485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023566608,0.000017168191,0.000078277466,0.00014813963,0.000008540292,0.00015374777,0.00015818425,0.0012600049,0.0007409773,0.9610929,0.014568275,0.021750297],"study_design_scores_gemma":[0.0000043285513,0.000010456544,0.00007605083,0.000028412316,0.000010479385,0.00013440197,0.00004106811,0.0021885226,0.00033098832,0.9540013,0.043159455,0.000014449323],"about_ca_topic_score_codex":0.002093703,"about_ca_topic_score_gemma":0.0028783248,"teacher_disagreement_score":0.008893982,"about_ca_system_score_codex":0.0013047912,"about_ca_system_score_gemma":0.0008837083,"threshold_uncertainty_score":0.029753387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159265,0.0005206922,0.056689087,0.00041248498,0.0001366839,0.000039534858,0.00018749549,0.00009867615,0.025988942],"genre_scores_gemma":[0.9779128,0.00017169547,0.015733343,0.00010251886,0.0000643016,0.000036403348,0.00015067574,0.000036495952,0.0057917144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949014,0.00012310162,0.00003484717,0.0001173175,0.00013821456,0.0000964583],"domain_scores_gemma":[0.9975344,0.0014273389,0.00033917374,0.00015929395,0.00032135544,0.00021851367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050654827,0.00034488525,0.00045460206,0.0009142756,0.0009247635,0.0012225605,0.00040190955,0.0006411743,0.0040582465],"category_scores_gemma":[0.0038857646,0.00022457434,0.00029885347,0.000761624,0.0011499379,0.0015136128,0.0007915387,0.0007762397,0.00040725738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033194688,0.000053955886,0.002691515,0.0001740082,0.000015290896,0.00094861933,0.00073098484,0.007292883,0.021532409,0.9444203,0.001430166,0.02037795],"study_design_scores_gemma":[0.00008794301,0.00032559887,0.0024597493,0.000073197065,0.000018782826,0.0021487456,0.00065829227,0.047288436,0.014720705,0.9156104,0.016555583,0.000052550397],"about_ca_topic_score_codex":0.00034735823,"about_ca_topic_score_gemma":0.00034576986,"teacher_disagreement_score":0.0040582465,"about_ca_system_score_codex":0.00062870607,"about_ca_system_score_gemma":0.0002781723,"threshold_uncertainty_score":0.01357615},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25585482,0.001096366,0.6682604,0.0018537303,0.0003388337,0.00018666353,0.00075970753,0.0014681179,0.0701813],"genre_scores_gemma":[0.6695431,0.0010066879,0.29843557,0.0011401519,0.0002847744,0.0003826526,0.0009600547,0.00061997026,0.027627127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985947,0.000523579,0.00009676937,0.00023065406,0.00034047102,0.00021386666],"domain_scores_gemma":[0.9950984,0.0027094574,0.00059814524,0.0010449182,0.00027344268,0.00027561755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011045897,0.0008853923,0.0011913544,0.0019117949,0.0018788726,0.0024609119,0.0012706285,0.0021208802,0.011524522],"category_scores_gemma":[0.005866095,0.0012774616,0.0008913059,0.0024026495,0.0017420042,0.003986174,0.0033084925,0.002940248,0.0028223216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028859687,0.00010518002,0.0003101364,0.00016016196,0.00003061106,0.00017657445,0.00032786687,0.019578863,0.0072993888,0.9156678,0.0053428374,0.05071196],"study_design_scores_gemma":[0.0000494014,0.00011875544,0.00014098483,0.00007140049,0.000013060614,0.00024763864,0.00009826252,0.049508877,0.0051576775,0.9378048,0.0067540356,0.000035167002],"about_ca_topic_score_codex":0.0002968303,"about_ca_topic_score_gemma":0.00044358472,"teacher_disagreement_score":0.011524522,"about_ca_system_score_codex":0.0007798794,"about_ca_system_score_gemma":0.0006555198,"threshold_uncertainty_score":0.038553417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03991382,0.0004164079,0.9243306,0.0006781737,0.00023206547,0.000111212314,0.00044683655,0.000415533,0.033455335],"genre_scores_gemma":[0.52139485,0.0015731932,0.44115695,0.0012877382,0.000399829,0.0005725727,0.0014355158,0.0005185323,0.031660743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979073,0.00029472026,0.00016065019,0.0006284952,0.0006649945,0.0003439724],"domain_scores_gemma":[0.99558073,0.002570256,0.00020445039,0.00081090594,0.000646864,0.00018681918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015759321,0.00081104826,0.0014741808,0.0013342934,0.0024080342,0.0032417818,0.0016089198,0.0015696178,0.008833304],"category_scores_gemma":[0.0094480235,0.00061973144,0.002151937,0.0019007237,0.0035098167,0.007841564,0.00366895,0.0044208854,0.002121822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007829928,0.000035930643,0.00031796118,0.00013313186,0.000019005667,0.000081504826,0.00016394188,0.016078092,0.0017224962,0.9404718,0.004437441,0.03646043],"study_design_scores_gemma":[0.000022470389,0.000034869463,0.00011145806,0.000027629458,0.000010424548,0.000110966146,0.00007945382,0.042723514,0.0021497384,0.94795173,0.006752454,0.000025195372],"about_ca_topic_score_codex":0.0011962588,"about_ca_topic_score_gemma":0.001068795,"teacher_disagreement_score":0.008833304,"about_ca_system_score_codex":0.0011061054,"about_ca_system_score_gemma":0.0015114371,"threshold_uncertainty_score":0.029550374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286118,0.003694438,0.21079731,0.005540088,0.0008423261,0.00007373899,0.00079257647,0.0005821125,0.14906551],"genre_scores_gemma":[0.96327376,0.0015944943,0.013745288,0.000266559,0.0007039886,0.000038973147,0.00024483044,0.00009756262,0.020034513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992623,0.00019401447,0.000035429533,0.00012462541,0.00022366203,0.00015995139],"domain_scores_gemma":[0.9968244,0.0014316856,0.00062019046,0.00020885935,0.0004518229,0.00046316438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011032636,0.0006988904,0.0006170336,0.0040169116,0.0010265138,0.0035204901,0.00081891386,0.00091414107,0.005929877],"category_scores_gemma":[0.0044875946,0.00033099417,0.0003094014,0.0030783915,0.0025042288,0.005410371,0.0011498086,0.0019244116,0.0011407743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007157975,0.000026891474,0.00040501423,0.000040064817,0.0000048123447,0.00007469107,0.00014850494,0.00181965,0.001128997,0.9845636,0.0013718982,0.010344334],"study_design_scores_gemma":[0.00001356507,0.00003350155,0.0004558432,0.000024592466,0.0000075268977,0.00021327352,0.00008002526,0.011213544,0.0012180245,0.98266935,0.004046772,0.000023850138],"about_ca_topic_score_codex":0.000550258,"about_ca_topic_score_gemma":0.0005032082,"teacher_disagreement_score":0.005929877,"about_ca_system_score_codex":0.0015211464,"about_ca_system_score_gemma":0.0011080907,"threshold_uncertainty_score":0.019837439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041446436,0.00022884304,0.9233717,0.00036598326,0.00024407118,0.00015495686,0.00014965089,0.0007379835,0.033300344],"genre_scores_gemma":[0.3625621,0.0004883668,0.59175324,0.00049188413,0.00021953096,0.00040876336,0.00039245322,0.0006598201,0.043023847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989209,0.00030332166,0.00006955803,0.000199753,0.000344943,0.00016151054],"domain_scores_gemma":[0.9983171,0.0006222504,0.00012357773,0.0005214584,0.0003018819,0.0001136876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010085035,0.0007679866,0.0006795822,0.0011741902,0.0012475912,0.0016705976,0.0013007778,0.0011336571,0.0077794353],"category_scores_gemma":[0.0030375433,0.0007192937,0.0012741103,0.00090457645,0.0019088828,0.0023185583,0.0023616562,0.0023819255,0.00332878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004074044,0.000037875383,0.00015541172,0.00006988721,0.000010466124,0.00009632366,0.00020549966,0.0022302472,0.008468038,0.93934184,0.0023485492,0.046995148],"study_design_scores_gemma":[0.00005699809,0.00013810473,0.00025434946,0.00006253124,0.000053167903,0.0005317072,0.0000839969,0.029536108,0.020631414,0.90891814,0.03966367,0.000069882684],"about_ca_topic_score_codex":0.00043137217,"about_ca_topic_score_gemma":0.00090640894,"teacher_disagreement_score":0.0077794353,"about_ca_system_score_codex":0.0010070456,"about_ca_system_score_gemma":0.00093247206,"threshold_uncertainty_score":0.026024878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68355155,0.0010066291,0.24604914,0.0014725724,0.00015835374,0.00005178859,0.00020640738,0.00014952791,0.06735403],"genre_scores_gemma":[0.97758764,0.0003682188,0.014394212,0.00022251812,0.00006416692,0.000053578406,0.00010453751,0.000023269393,0.007181806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951303,0.00015150396,0.00002348358,0.00007646696,0.00012984885,0.000105656814],"domain_scores_gemma":[0.9975382,0.0013751342,0.00030532727,0.00021002295,0.0003379135,0.00023326125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007952493,0.0004010006,0.0005843967,0.0010656655,0.0015019544,0.0017098555,0.0005910261,0.0012934468,0.0041185217],"category_scores_gemma":[0.0034738735,0.000436177,0.00038141676,0.00073923334,0.0022554789,0.002807398,0.0021546858,0.0014974944,0.00048930757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006920165,0.000011187555,0.00025245576,0.000027807888,0.000007862365,0.00005943913,0.00017854174,0.004988897,0.0015622394,0.98902166,0.0004846649,0.0033360175],"study_design_scores_gemma":[0.000017389391,0.000041932082,0.00022866199,0.000023892248,0.000006620991,0.00009395507,0.00018212832,0.041063573,0.0010517539,0.9560775,0.0011898886,0.000022757997],"about_ca_topic_score_codex":0.0008500816,"about_ca_topic_score_gemma":0.00071310933,"teacher_disagreement_score":0.0041185217,"about_ca_system_score_codex":0.000772179,"about_ca_system_score_gemma":0.0007197226,"threshold_uncertainty_score":0.013777852},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112648256,0.00031705803,0.81481004,0.0004720822,0.00026127158,0.00016296205,0.00017394849,0.00086142746,0.07029293],"genre_scores_gemma":[0.5438616,0.00035895273,0.420173,0.00036024355,0.00009532859,0.00027394912,0.00034724962,0.00051850785,0.034011032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937683,0.0002379134,0.000029931161,0.00012272348,0.00014590964,0.000086715794],"domain_scores_gemma":[0.99910694,0.00038741203,0.00005743053,0.00020528217,0.00016465323,0.000078346624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041020804,0.0004326956,0.0005581755,0.0007739769,0.00093413633,0.0014756782,0.0008734334,0.00058211305,0.009186278],"category_scores_gemma":[0.002007607,0.00039811913,0.0005394223,0.00074005907,0.0013979406,0.0012858626,0.0021266676,0.0011240698,0.0021194878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000650361,0.000037047976,0.00031516794,0.000078634126,0.0000130726075,0.0001757161,0.0002834923,0.005388467,0.012039182,0.94002414,0.0018113761,0.039768726],"study_design_scores_gemma":[0.00006915697,0.00011423239,0.0003920914,0.000058347756,0.000030487678,0.00046096806,0.00024394013,0.05977322,0.020737967,0.8774722,0.040601335,0.000045991615],"about_ca_topic_score_codex":0.00036814524,"about_ca_topic_score_gemma":0.0007912449,"teacher_disagreement_score":0.009186278,"about_ca_system_score_codex":0.00048269168,"about_ca_system_score_gemma":0.00065319426,"threshold_uncertainty_score":0.030731142},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43948668,0.00086255267,0.52230656,0.0009849961,0.00007293849,0.00016541265,0.00062279386,0.0009000438,0.034598064],"genre_scores_gemma":[0.8873492,0.00042572935,0.104943044,0.00027130073,0.00007135954,0.0003417815,0.0006159722,0.00014977506,0.0058319224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957172,0.0013712966,0.0002552015,0.0008218936,0.0012980631,0.00053624896],"domain_scores_gemma":[0.94945824,0.035643384,0.0033478008,0.006313437,0.0041014766,0.0011357355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031307272,0.00047918258,0.0009993027,0.0015652754,0.0013474367,0.0020866294,0.0017738248,0.0018956792,0.0060730996],"category_scores_gemma":[0.035379,0.0011163093,0.0009913269,0.001191948,0.0022135358,0.002961187,0.002201135,0.0028150454,0.00085367827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077436893,0.00023153279,0.0041479724,0.0005077917,0.00012467301,0.000345326,0.0006123073,0.07997672,0.02320846,0.84280074,0.0032697993,0.044000335],"study_design_scores_gemma":[0.00015406121,0.0004031247,0.0009148221,0.00013157888,0.00007407223,0.0007347806,0.00020073354,0.19087778,0.0132319685,0.7864102,0.006813969,0.000052902415],"about_ca_topic_score_codex":0.0004972227,"about_ca_topic_score_gemma":0.0007820119,"teacher_disagreement_score":0.0060730996,"about_ca_system_score_codex":0.0015479613,"about_ca_system_score_gemma":0.0010969798,"threshold_uncertainty_score":0.020316482},"labels":[],"label_agreement":null},{"id":"W2043898581","doi":"10.1002/jcd.20219","title":"The Hamilton–Waterloo problem for cycle sizes 3 and 4","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Università di Catania; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Hamiltonian path; Graph; Resolution (logic); Class (philosophy); Complete graph; Decomposition; Computer science; Artificial intelligence","score_opus":0.00926922698022215,"score_gpt":0.21362919230506672,"score_spread":0.20435996532484457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043898581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5462817,0.0010032303,0.3596862,0.0022885695,0.000112020025,0.00040744152,0.001000172,0.00036240483,0.08885828],"genre_scores_gemma":[0.8813098,0.00047522777,0.09726671,0.00037996023,0.00008981453,0.0002036183,0.0007000819,0.00010234013,0.019472511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989297,0.0002988975,0.00005038698,0.00019706579,0.00021861073,0.00030536676],"domain_scores_gemma":[0.9968659,0.0021116713,0.00030018395,0.00035379626,0.00017483094,0.00019364724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086962216,0.00042578555,0.0005823378,0.00077396,0.0011710102,0.0015936921,0.0012198641,0.001384086,0.010072342],"category_scores_gemma":[0.004588642,0.00046704191,0.0008683702,0.0006920363,0.0011298438,0.0020761588,0.0010393027,0.0013301617,0.0006219486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062705314,0.00017730078,0.0019057579,0.00028936204,0.00011323531,0.0004973849,0.00060940994,0.081187695,0.009339434,0.7920896,0.013362698,0.099801116],"study_design_scores_gemma":[0.00022414491,0.00010502075,0.00069189735,0.00006679116,0.000047918304,0.00028947176,0.00040123,0.13375728,0.0073072505,0.84291327,0.014140202,0.000055462246],"about_ca_topic_score_codex":0.0056148265,"about_ca_topic_score_gemma":0.0073752203,"teacher_disagreement_score":0.010072342,"about_ca_system_score_codex":0.000879439,"about_ca_system_score_gemma":0.0013107437,"threshold_uncertainty_score":0.03369534},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7944272,0.0030625688,0.14963317,0.0012517326,0.000069529524,0.0001536607,0.0009810178,0.00065446424,0.04976663],"genre_scores_gemma":[0.98996395,0.000431944,0.0077860854,0.000054171924,0.000013772475,0.00008642114,0.00016091486,0.000040702023,0.0014620102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992931,0.00029126223,0.000021659156,0.000039167742,0.0002035449,0.00015118155],"domain_scores_gemma":[0.9899198,0.008442992,0.00052141846,0.00027919371,0.00072866306,0.00010782368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013507934,0.00063194684,0.0006647701,0.0012225453,0.00053163985,0.0007447053,0.0008105912,0.0012145032,0.0021679932],"category_scores_gemma":[0.00820211,0.000248343,0.00039177967,0.0012124348,0.00078636245,0.00088948227,0.0006790807,0.0007383191,0.0001814918],"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.000040803618,0.000022643071,0.00057949015,0.000038873197,0.000009403492,0.000056701396,0.000053777574,0.98960996,0.00054710184,0.0072124465,0.00028666126,0.0015422095],"study_design_scores_gemma":[0.0000034826999,0.000008097644,0.00010030598,0.000008288598,0.000002431224,0.000013673567,0.000011710746,0.9982741,0.00036408834,0.0010990521,0.00011075015,0.0000041424873],"about_ca_topic_score_codex":0.010308144,"about_ca_topic_score_gemma":0.0036704508,"teacher_disagreement_score":0.010308144,"about_ca_system_score_codex":0.0016022818,"about_ca_system_score_gemma":0.0006306869,"threshold_uncertainty_score":0.020496309},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32497826,0.0006250354,0.5229843,0.0006027154,0.00024393451,0.00013231319,0.0007235196,0.0008638648,0.14884602],"genre_scores_gemma":[0.8339326,0.0007370178,0.13715042,0.00031235447,0.000079083846,0.00014477545,0.0009393983,0.00014332942,0.026560895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953985,0.00012934374,0.00002617101,0.00008312135,0.00013789687,0.000083633895],"domain_scores_gemma":[0.9994617,0.00013140556,0.00007118457,0.00017991112,0.00009803312,0.000057770736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022447329,0.0004741464,0.00050260994,0.00071195053,0.00056003936,0.0010484608,0.000476218,0.0008052725,0.009592486],"category_scores_gemma":[0.0009120778,0.00039641155,0.00046329602,0.0012608357,0.00036787614,0.00088600407,0.00095187745,0.0007523592,0.001859616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036035007,0.000085289,0.00093462615,0.00017240226,0.00007179869,0.00040126187,0.00022775074,0.04363969,0.026489511,0.79024464,0.0103326505,0.12704012],"study_design_scores_gemma":[0.00013907444,0.0004931696,0.0013589276,0.00009031811,0.00009329156,0.00138932,0.0002795587,0.23270816,0.028899243,0.68283725,0.051657878,0.000053751595],"about_ca_topic_score_codex":0.00027222364,"about_ca_topic_score_gemma":0.00038498838,"teacher_disagreement_score":0.009592486,"about_ca_system_score_codex":0.00042193892,"about_ca_system_score_gemma":0.000322677,"threshold_uncertainty_score":0.03209001},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24485795,0.0018768874,0.58415085,0.0022257515,0.0003487001,0.0002154093,0.0015747752,0.00034719458,0.16440251],"genre_scores_gemma":[0.6451322,0.0028852643,0.26229838,0.000996479,0.00041261388,0.0002707201,0.0042508063,0.00050179084,0.08325175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995167,0.00013271708,0.000022004195,0.0001182718,0.00010883038,0.00010143304],"domain_scores_gemma":[0.99868447,0.0005110375,0.00013714215,0.0002229568,0.00021317803,0.00023122167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058776955,0.0010425895,0.0008232296,0.0019769478,0.001332956,0.0027022902,0.00091750093,0.0009065056,0.008995799],"category_scores_gemma":[0.0019679132,0.00065575883,0.0012386629,0.0018348756,0.0017760778,0.0037466146,0.0020227432,0.0022722776,0.0011642267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005753459,0.000039249062,0.00022689602,0.00008012637,0.000017912247,0.00009399893,0.00032900233,0.0049071116,0.0013508322,0.97334903,0.0049353032,0.01461309],"study_design_scores_gemma":[0.000010777696,0.0000094436855,0.00017424587,0.00003942652,0.000012514728,0.000058456248,0.00012039045,0.009687909,0.00023876717,0.9833015,0.0063415575,0.000005005913],"about_ca_topic_score_codex":0.0018024817,"about_ca_topic_score_gemma":0.0025902563,"teacher_disagreement_score":0.008995799,"about_ca_system_score_codex":0.0011096124,"about_ca_system_score_gemma":0.00054459594,"threshold_uncertainty_score":0.030093968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33902532,0.0009636081,0.53688836,0.0012421358,0.00056116056,0.00028351686,0.00055543054,0.00094453414,0.11953598],"genre_scores_gemma":[0.85321486,0.00040343867,0.124382295,0.0006773384,0.00023773391,0.00023894131,0.00025377164,0.00008214398,0.02050943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982862,0.0007353851,0.00010588783,0.00017803993,0.00046727454,0.00022710864],"domain_scores_gemma":[0.9974577,0.0008183668,0.00036873194,0.0006820657,0.00044401403,0.00022912124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015503671,0.00069203594,0.0007410658,0.001289445,0.0011055445,0.0018371335,0.00080004893,0.0012722301,0.011325441],"category_scores_gemma":[0.0038378157,0.00054245326,0.0007091901,0.001084385,0.0010860163,0.0015400684,0.0015123824,0.0009593309,0.002711431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005982317,0.000059999864,0.000883802,0.0002026597,0.00006959382,0.00038495005,0.00022965098,0.007707093,0.018428862,0.9173771,0.0028932942,0.05116474],"study_design_scores_gemma":[0.0002675883,0.00052340294,0.0008294945,0.00011863295,0.00012576119,0.0010602548,0.00011876301,0.043980084,0.012565569,0.91728157,0.023046337,0.000082426115],"about_ca_topic_score_codex":0.0002723337,"about_ca_topic_score_gemma":0.0007132208,"teacher_disagreement_score":0.011325441,"about_ca_system_score_codex":0.0006514812,"about_ca_system_score_gemma":0.0010354463,"threshold_uncertainty_score":0.037887394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38197687,0.0011338415,0.52557987,0.0015186307,0.000914851,0.000043460663,0.00017224831,0.0003065032,0.08835378],"genre_scores_gemma":[0.95604354,0.00042556736,0.028107813,0.00028080842,0.00044293297,0.000035866604,0.00006401912,0.00006501618,0.014534547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939895,0.00019502631,0.00003270731,0.00010414178,0.00016198747,0.00010709904],"domain_scores_gemma":[0.9981686,0.0007755035,0.00023882167,0.0002704442,0.00034025757,0.0002062645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009834559,0.0007166072,0.0007145045,0.0015476282,0.0010254297,0.0024371373,0.0007577138,0.00086583913,0.0059247524],"category_scores_gemma":[0.0042107706,0.00035048436,0.00042774068,0.0011303158,0.0025560607,0.0029078256,0.00071489,0.0015004105,0.0005591953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008109297,0.000028449349,0.00010488997,0.00002449332,0.0000072982634,0.00011887133,0.00015373019,0.006691128,0.0038272254,0.9818796,0.00075422716,0.006328943],"study_design_scores_gemma":[0.000014341114,0.000027379125,0.00009774816,0.000011068667,0.0000047414355,0.00010915187,0.00006258889,0.043491706,0.001991078,0.95203066,0.002136831,0.000022678749],"about_ca_topic_score_codex":0.000561346,"about_ca_topic_score_gemma":0.00063030655,"teacher_disagreement_score":0.0059247524,"about_ca_system_score_codex":0.0007440743,"about_ca_system_score_gemma":0.0005154696,"threshold_uncertainty_score":0.019820273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08419062,0.0011138184,0.8614387,0.0011254638,0.0008437853,0.0005237973,0.0024382253,0.0027727166,0.045552924],"genre_scores_gemma":[0.60342175,0.0008313574,0.35762933,0.0004116609,0.00036187106,0.00067763525,0.0021333492,0.00046086995,0.034072157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.0001394154,0.000057100675,0.00012174021,0.00015798512,0.00029300287],"domain_scores_gemma":[0.9971095,0.0008280655,0.00015683469,0.0010853624,0.0005524894,0.0002678172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009768687,0.0008007273,0.0014802846,0.0013803396,0.0019156757,0.0016272299,0.0012469508,0.0016778838,0.01768606],"category_scores_gemma":[0.0059624594,0.0005079652,0.00052166014,0.0011973903,0.001022191,0.0019816142,0.0014901423,0.0012377682,0.0040930933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067547136,0.00066252716,0.0026926545,0.00038375246,0.00013082531,0.0010165853,0.0005532563,0.051338054,0.07907645,0.45927432,0.038823545,0.35929334],"study_design_scores_gemma":[0.00072589325,0.0010841491,0.002215813,0.00018714482,0.0002002766,0.00071889925,0.0003278013,0.38988724,0.086562544,0.42170182,0.09618887,0.0001996471],"about_ca_topic_score_codex":0.0051477854,"about_ca_topic_score_gemma":0.005366151,"teacher_disagreement_score":0.01768606,"about_ca_system_score_codex":0.0009378404,"about_ca_system_score_gemma":0.0015614927,"threshold_uncertainty_score":0.059165776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6228656,0.0008090564,0.29217666,0.0009157465,0.000371134,0.00018534776,0.000420791,0.0010790984,0.08117657],"genre_scores_gemma":[0.9134146,0.0005608431,0.06841454,0.00026889404,0.00009273722,0.00012791269,0.00030762688,0.00035696843,0.016455878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967,0.00009209741,0.00001697795,0.000060328264,0.00008494572,0.00007563512],"domain_scores_gemma":[0.99873644,0.0006142735,0.00013630357,0.00023823418,0.00011558649,0.00015914589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002930008,0.00051481376,0.00074372586,0.0009523546,0.0012602353,0.0017882856,0.00078994274,0.0009291764,0.007915263],"category_scores_gemma":[0.0017379251,0.0006704039,0.0006567639,0.0014131374,0.0013494999,0.0019745633,0.0019730483,0.0018568513,0.0009167534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003337851,0.00008242314,0.0007791482,0.00025382522,0.000035631932,0.0003353797,0.0006744975,0.045607932,0.027440963,0.86492896,0.00766484,0.05186251],"study_design_scores_gemma":[0.000084424704,0.000082119295,0.00045642484,0.000042803378,0.000030326735,0.0002942289,0.00030007056,0.12242296,0.009163932,0.8575013,0.00958078,0.000040668598],"about_ca_topic_score_codex":0.002155856,"about_ca_topic_score_gemma":0.0035787905,"teacher_disagreement_score":0.007915263,"about_ca_system_score_codex":0.0009815701,"about_ca_system_score_gemma":0.0005801705,"threshold_uncertainty_score":0.026479185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23225021,0.0025793817,0.6313051,0.0033792998,0.0006402173,0.00028803898,0.0013925382,0.0006547224,0.12751052],"genre_scores_gemma":[0.7892989,0.0022239937,0.15032606,0.0009641388,0.00080125796,0.000461087,0.002798459,0.0004256374,0.052700438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982204,0.0005596344,0.000105459,0.0002955097,0.0005068858,0.0003120609],"domain_scores_gemma":[0.9963904,0.0014678007,0.0005211449,0.0006871565,0.00044223573,0.000491239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013774617,0.0010167006,0.001181431,0.0025705318,0.0028402656,0.0057151476,0.001627223,0.0019883523,0.0075939544],"category_scores_gemma":[0.006208643,0.0010427212,0.0012114542,0.0029523952,0.0046455553,0.0059441538,0.004265775,0.005365072,0.0015913766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024026258,0.000011907071,0.00011859547,0.00004041127,0.000003508664,0.000026228341,0.00014298088,0.0013718168,0.00025742696,0.9902846,0.0020127466,0.005705774],"study_design_scores_gemma":[0.00001580762,0.000028609602,0.00018839817,0.00005053289,0.000008398383,0.00013773663,0.00012422397,0.007504339,0.0010170587,0.97794807,0.012952018,0.000024847612],"about_ca_topic_score_codex":0.0005044766,"about_ca_topic_score_gemma":0.00035414132,"teacher_disagreement_score":0.0075939544,"about_ca_system_score_codex":0.0014329343,"about_ca_system_score_gemma":0.0009103406,"threshold_uncertainty_score":0.025404334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61034393,0.0013668486,0.22050883,0.00347849,0.00027247795,0.00007066607,0.00033787813,0.00029687473,0.16332401],"genre_scores_gemma":[0.9710758,0.00045161898,0.012038999,0.0005578745,0.00018646597,0.00006466346,0.000156557,0.0000525968,0.0154155195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993845,0.00021432523,0.000023780463,0.00008028349,0.00015456228,0.00014245871],"domain_scores_gemma":[0.99855965,0.0005311904,0.00025038054,0.0002547123,0.00023060263,0.0001735419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818878,0.00034862637,0.0005834277,0.0014111672,0.0015225578,0.0022554724,0.0007747765,0.0014902026,0.0074102357],"category_scores_gemma":[0.0030597548,0.0002821653,0.0003651825,0.0009663578,0.0022411004,0.0029074429,0.0013370431,0.0015913032,0.00085057656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020006211,0.000014432779,0.00011116582,0.000007148738,0.0000030638153,0.00002833173,0.00005497867,0.0010004672,0.00023927857,0.9955296,0.0005930959,0.0023984457],"study_design_scores_gemma":[0.0000086753735,0.000007491617,0.00005641032,0.0000063696325,0.0000026816933,0.00004007957,0.000051987154,0.0055007916,0.00014697888,0.9933669,0.0008057255,0.000005915515],"about_ca_topic_score_codex":0.000824065,"about_ca_topic_score_gemma":0.0011202439,"teacher_disagreement_score":0.0074102357,"about_ca_system_score_codex":0.00059390056,"about_ca_system_score_gemma":0.00046700405,"threshold_uncertainty_score":0.024789691},"labels":[],"label_agreement":null},{"id":"W2047891102","doi":"10.1002/jcd.1010","title":"Balanced incomplete block designs with block size 8","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Value (mathematics); Construct (python library); Basis (linear algebra); Type (biology); Block design; Degree (music); Statistics; Discrete mathematics; Computer science; Geometry","score_opus":0.01703019996916811,"score_gpt":0.21518093293299134,"score_spread":0.19815073296382324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047891102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27542028,0.00041265183,0.69055367,0.00026560636,0.00014140822,0.0002528897,0.0007646213,0.000579667,0.031609207],"genre_scores_gemma":[0.80510026,0.00021345637,0.18458225,0.00013789628,0.000081178296,0.00039602706,0.00058957405,0.000060676815,0.008838695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888366,0.00035040724,0.000115816496,0.00013549272,0.00029625988,0.00021834314],"domain_scores_gemma":[0.99773055,0.0005335414,0.00048084982,0.0004903651,0.00058551074,0.00017911289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013577711,0.00039010932,0.0007618676,0.0005964069,0.00046383907,0.000763309,0.00047446176,0.0003656456,0.0062121246],"category_scores_gemma":[0.0035630881,0.0002876461,0.00030071897,0.00057899556,0.0005414129,0.0010398454,0.00082404906,0.0005357134,0.0013188387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031662553,0.00021639293,0.004656589,0.0004385055,0.000101176665,0.0004196025,0.00041688822,0.06312986,0.08098871,0.59005827,0.005844114,0.25056365],"study_design_scores_gemma":[0.001297899,0.004248157,0.003817811,0.00036454026,0.00018082006,0.0008848176,0.00033908873,0.34552795,0.11994953,0.42036858,0.10287606,0.00014468942],"about_ca_topic_score_codex":0.0005260836,"about_ca_topic_score_gemma":0.00083732174,"teacher_disagreement_score":0.0062121246,"about_ca_system_score_codex":0.00069262984,"about_ca_system_score_gemma":0.00068555016,"threshold_uncertainty_score":0.020781577},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015434241,0.00047609728,0.97773415,0.00032920242,0.0001570962,0.00033109213,0.00031464625,0.00053655857,0.0046869214],"genre_scores_gemma":[0.3627958,0.00050508435,0.6275177,0.0004854688,0.00022609932,0.0015121012,0.00033006808,0.00013014326,0.006497635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9660266,0.023945786,0.0014755198,0.0032627315,0.003940551,0.0013488089],"domain_scores_gemma":[0.9320831,0.040011846,0.0045009186,0.018429419,0.004136927,0.0008377274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025794646,0.0012483769,0.0025791237,0.001525042,0.0011510991,0.0019656948,0.0025367504,0.0030490537,0.010804807],"category_scores_gemma":[0.06953209,0.0020482226,0.001270095,0.0015866252,0.0020632246,0.0029019616,0.0018518594,0.0013475213,0.0025531228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065725623,0.00037878106,0.0046515483,0.0006978214,0.00071036967,0.0003584931,0.00045266957,0.086819984,0.007417985,0.66396207,0.0046698456,0.22330783],"study_design_scores_gemma":[0.0036461079,0.0031016767,0.0026994315,0.00031585174,0.0007190819,0.0010849119,0.00012249599,0.25528038,0.009852071,0.7002214,0.022746587,0.0002100064],"about_ca_topic_score_codex":0.0006358754,"about_ca_topic_score_gemma":0.00095172506,"teacher_disagreement_score":0.025794646,"about_ca_system_score_codex":0.00091998966,"about_ca_system_score_gemma":0.0026672678,"threshold_uncertainty_score":0.13641673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63066345,0.0003922125,0.30844167,0.0010550878,0.00008918919,0.000057311707,0.00031561326,0.00025340015,0.05873201],"genre_scores_gemma":[0.9706077,0.0002700633,0.016832363,0.00018548897,0.00007475195,0.00007468212,0.00021077506,0.000042447533,0.011701746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.0001403221,0.00001768796,0.00006523929,0.00009547979,0.00010590018],"domain_scores_gemma":[0.99759173,0.0012175478,0.00045439744,0.00017665194,0.00026777125,0.0002918579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005240393,0.0004590936,0.00033447528,0.0014597859,0.0019031108,0.0018673126,0.0005936182,0.000733847,0.004400537],"category_scores_gemma":[0.0023568324,0.00033234403,0.00040713875,0.00077601447,0.0016254731,0.0018261098,0.0007648519,0.0011857812,0.0003069528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000408578,0.000024061246,0.00036708833,0.000017511307,0.0000060592133,0.00010753424,0.00019333525,0.0028421194,0.0013325543,0.99226224,0.00067389064,0.0021327864],"study_design_scores_gemma":[0.000016748243,0.000019500028,0.00024103803,0.000012762016,0.000006479588,0.0001667532,0.00017727407,0.024136709,0.0009513035,0.97216976,0.0020864487,0.000015213107],"about_ca_topic_score_codex":0.0012814794,"about_ca_topic_score_gemma":0.0017995712,"teacher_disagreement_score":0.004400537,"about_ca_system_score_codex":0.0010452429,"about_ca_system_score_gemma":0.0008126318,"threshold_uncertainty_score":0.014721334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6440013,0.00027319952,0.21710944,0.0006779937,0.00005150491,0.00021939736,0.0021274844,0.00042303116,0.13511668],"genre_scores_gemma":[0.93836933,0.0002006711,0.026084362,0.00017028656,0.000037949318,0.000219303,0.0015286226,0.00013171996,0.033257745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949884,0.00013807887,0.000023452898,0.0001097567,0.00011323071,0.00011668095],"domain_scores_gemma":[0.9976349,0.0011044827,0.00040061073,0.000257767,0.00039959463,0.00020255975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044543555,0.00027901932,0.00027519488,0.0009277879,0.000879667,0.0012245459,0.00065598387,0.00043240204,0.016459266],"category_scores_gemma":[0.0022807755,0.00037239303,0.00037899162,0.00072792865,0.000951217,0.0014501177,0.0007600316,0.00076654955,0.0013821832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016415626,0.00003972025,0.00074475224,0.000058380694,0.000016498501,0.00011064497,0.00025011203,0.005595153,0.003214482,0.9771243,0.002751567,0.0099303285],"study_design_scores_gemma":[0.00006571066,0.000057104462,0.0014406106,0.00002957104,0.000025437721,0.00019875685,0.00018422368,0.040648233,0.0042056506,0.9462644,0.0068558594,0.000024527973],"about_ca_topic_score_codex":0.002810506,"about_ca_topic_score_gemma":0.0044218996,"teacher_disagreement_score":0.016459266,"about_ca_system_score_codex":0.0008642771,"about_ca_system_score_gemma":0.00091698486,"threshold_uncertainty_score":0.055061698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3707248,0.0010792858,0.34495956,0.0032012674,0.00066357333,0.00026064806,0.0009714164,0.0005801871,0.27755925],"genre_scores_gemma":[0.8163634,0.0012200762,0.06338013,0.0012131657,0.00034010902,0.0002511228,0.0008455615,0.00038978318,0.115996666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996138,0.000074164214,0.000014771183,0.00008615228,0.00010688063,0.00010426524],"domain_scores_gemma":[0.9987037,0.00046383697,0.0001895752,0.00017981687,0.00019916901,0.00026387192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003308901,0.0007121328,0.0007029327,0.0025159484,0.0021663876,0.0025748487,0.0007239735,0.001202634,0.022153068],"category_scores_gemma":[0.0018927229,0.00084867736,0.00092068635,0.0014049072,0.0020201884,0.0029691095,0.002091569,0.002870244,0.0018640716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026739372,0.0000149600555,0.000104556566,0.000025257725,0.000007072995,0.00006815042,0.0001485071,0.00066634314,0.0010383392,0.9919944,0.0015993111,0.00430627],"study_design_scores_gemma":[0.00001211873,0.00000969075,0.00021113794,0.000010478709,0.000006181849,0.000088871835,0.000110022076,0.0027815672,0.00045116362,0.99189115,0.0044194455,0.000008021282],"about_ca_topic_score_codex":0.0012144471,"about_ca_topic_score_gemma":0.002021805,"teacher_disagreement_score":0.022153068,"about_ca_system_score_codex":0.00076457503,"about_ca_system_score_gemma":0.0004983112,"threshold_uncertainty_score":0.074109435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106101185,0.001503262,0.8323163,0.00252838,0.0003525144,0.000278412,0.0010707477,0.0008657958,0.054983407],"genre_scores_gemma":[0.4651228,0.0021897194,0.4731112,0.00090700906,0.0007017702,0.00053090736,0.0024520538,0.00066192914,0.054322574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823296,0.00057199644,0.00010119568,0.00047003155,0.00036289232,0.00026094617],"domain_scores_gemma":[0.9954145,0.0024727567,0.0004573699,0.0008561051,0.00050206203,0.0002972243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014970617,0.0011825816,0.0013040104,0.0023755436,0.002018988,0.0039697313,0.0016784774,0.0016057786,0.0135412095],"category_scores_gemma":[0.008011941,0.0011419904,0.0017302863,0.0034344231,0.0022389765,0.007766957,0.0036454068,0.0025833407,0.0021229056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102620164,0.00008371797,0.00044759086,0.00011019274,0.000025357724,0.00004791663,0.0002317823,0.008140958,0.0008184543,0.9454897,0.0067618024,0.037739825],"study_design_scores_gemma":[0.000025974952,0.000015589007,0.00011152575,0.000019899777,0.000016332295,0.00009113489,0.000070146096,0.020070879,0.00038518533,0.9742398,0.004943699,0.00000984314],"about_ca_topic_score_codex":0.001709643,"about_ca_topic_score_gemma":0.002186035,"teacher_disagreement_score":0.0135412095,"about_ca_system_score_codex":0.0013696816,"about_ca_system_score_gemma":0.001127442,"threshold_uncertainty_score":0.045299888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.836933,0.0005659378,0.043586016,0.0011095317,0.00035930233,0.000101573845,0.00028411287,0.0003385766,0.11672192],"genre_scores_gemma":[0.97199655,0.00037783396,0.0069703287,0.0002445895,0.0002780773,0.00006900878,0.00022246799,0.00013594865,0.019705147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946755,0.00010920481,0.000025657284,0.00008182355,0.0001483351,0.00016743883],"domain_scores_gemma":[0.9992625,0.00018024602,0.00016607194,0.00009232327,0.000104323764,0.00019455091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006790183,0.0010541003,0.001047614,0.0031337943,0.003642026,0.0032127516,0.0013761078,0.0017793747,0.008108793],"category_scores_gemma":[0.0020004183,0.0004928892,0.0008065596,0.0016305371,0.0041842684,0.0039142324,0.001987204,0.0018928979,0.0011413776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006377848,0.00002436445,0.00019470743,0.000016446616,0.0000061017113,0.00012429287,0.00032620016,0.0012339405,0.00069789245,0.9940361,0.0005610794,0.0027150586],"study_design_scores_gemma":[0.000022715441,0.000016296288,0.00016154729,0.000011161814,0.0000038978533,0.000056969868,0.00016201199,0.0031607894,0.0003224572,0.99509996,0.00097164285,0.000010694014],"about_ca_topic_score_codex":0.0036142152,"about_ca_topic_score_gemma":0.0024967645,"teacher_disagreement_score":0.008108793,"about_ca_system_score_codex":0.0019518473,"about_ca_system_score_gemma":0.000832024,"threshold_uncertainty_score":0.02712661},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51200324,0.0014917488,0.420444,0.00053537684,0.00030985233,0.00010928328,0.00025034393,0.0004326046,0.06442358],"genre_scores_gemma":[0.90818864,0.00061000953,0.07438147,0.000171042,0.00017641172,0.000081071914,0.00024685825,0.00008705805,0.01605747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930465,0.00016138842,0.000037788148,0.00010737281,0.0002558102,0.0001330847],"domain_scores_gemma":[0.9981963,0.00059972616,0.0003390782,0.0002686028,0.00044578852,0.00015054454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045218586,0.00042220994,0.00029150146,0.0015246086,0.0008352435,0.0010482321,0.0003690536,0.00077854324,0.0024826569],"category_scores_gemma":[0.0026977372,0.00026199291,0.0003406152,0.00096805295,0.0012922013,0.0012467336,0.0009961354,0.0010087932,0.00059960556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018545355,0.000046383644,0.00080082484,0.000100352765,0.000016945984,0.0003710311,0.0002967077,0.011481859,0.017074814,0.9361217,0.0014759506,0.032027934],"study_design_scores_gemma":[0.00004539503,0.00018091722,0.00093209284,0.00007300312,0.00001883384,0.0015616094,0.00015532762,0.097215295,0.046156336,0.836184,0.017377472,0.00009973662],"about_ca_topic_score_codex":0.0005772851,"about_ca_topic_score_gemma":0.00061135745,"teacher_disagreement_score":0.0024826569,"about_ca_system_score_codex":0.00063575845,"about_ca_system_score_gemma":0.00046929513,"threshold_uncertainty_score":0.008305311},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2654944,0.0004703696,0.52320546,0.00089331274,0.0011652634,0.00037798862,0.0006830249,0.0006850406,0.2070251],"genre_scores_gemma":[0.7693234,0.0007524037,0.14104974,0.0013238977,0.00056585885,0.0005826214,0.0008873399,0.0007426882,0.08477195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934596,0.0001575474,0.000035882666,0.00010649552,0.00019948286,0.00015473181],"domain_scores_gemma":[0.9990941,0.00027409045,0.00011193196,0.0001577917,0.00023677267,0.00012529784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067397335,0.0007565175,0.00049313164,0.0018588639,0.0012626636,0.0018492066,0.0006612319,0.0010167802,0.015735537],"category_scores_gemma":[0.0017671856,0.00047633584,0.00072745985,0.00095011236,0.001594596,0.0015498026,0.0011548778,0.0013898106,0.0023306867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004018524,0.000024935765,0.00011333357,0.000030536787,0.0000072092425,0.0000890398,0.00010751964,0.0011120088,0.0034412143,0.9798258,0.0019837762,0.0132245375],"study_design_scores_gemma":[0.000019779367,0.000050254694,0.00014927295,0.000028580462,0.000012175991,0.00014954142,0.00010417733,0.008369845,0.00310751,0.9770982,0.010888783,0.000021898482],"about_ca_topic_score_codex":0.0010016513,"about_ca_topic_score_gemma":0.001646219,"teacher_disagreement_score":0.015735537,"about_ca_system_score_codex":0.0007955919,"about_ca_system_score_gemma":0.00088474585,"threshold_uncertainty_score":0.052640617},"labels":[],"label_agreement":null},{"id":"W2050377717","doi":"10.1002/1520-6610(2001)9:1<1::aid-jcd1>3.0.co;2-h","title":"The spectrum of ?-resolvable designs with block size four","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders","keywords":"Mathematics; Disjoint sets; Block (permutation group theory); Combinatorics; Block size; Class (philosophy); Block design; Property (philosophy); Point (geometry); Spectrum (functional analysis); Discrete mathematics; Computer science; Artificial intelligence; Key (lock)","score_opus":0.016396123411637556,"score_gpt":0.2046042192495821,"score_spread":0.18820809583794457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050377717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8007545,0.00069803646,0.15835021,0.00083243323,0.000049161714,0.00007911981,0.00053039234,0.0004136972,0.03829243],"genre_scores_gemma":[0.97561544,0.00022917222,0.021335343,0.00015243495,0.00005791138,0.00017115462,0.00022992681,0.000030619623,0.0021779905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820805,0.00045586,0.00014024379,0.00030245606,0.0005546136,0.00033870758],"domain_scores_gemma":[0.99132663,0.005358332,0.0011318491,0.0009898565,0.0006509898,0.0005423048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643257,0.0005677793,0.000742825,0.0017576991,0.0012401042,0.0018583562,0.00085121876,0.0014064761,0.0053617726],"category_scores_gemma":[0.0069749006,0.0006391086,0.0004907739,0.0008412095,0.001965882,0.0014953641,0.0015788459,0.00107255,0.0009347324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017933928,0.00016692252,0.0039518415,0.00035070057,0.00007748639,0.0008195351,0.00089504366,0.021121107,0.04844556,0.8602243,0.0021441956,0.060009878],"study_design_scores_gemma":[0.00048960483,0.0004569834,0.0019195761,0.00015791146,0.000050865543,0.0015807298,0.0003099299,0.08090668,0.019519173,0.88662976,0.007896093,0.00008266393],"about_ca_topic_score_codex":0.0002348692,"about_ca_topic_score_gemma":0.0001608776,"teacher_disagreement_score":0.0053617726,"about_ca_system_score_codex":0.0007206354,"about_ca_system_score_gemma":0.00052751333,"threshold_uncertainty_score":0.017936885},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020206574,0.0004600872,0.95333076,0.0010730863,0.00017482987,0.00018396547,0.00034133994,0.0005878177,0.02364145],"genre_scores_gemma":[0.29488572,0.00043435115,0.69258136,0.0004869714,0.00015826618,0.00040883888,0.00042134261,0.00034335905,0.010279831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913675,0.00034967336,0.000030063788,0.00012959167,0.00020846861,0.00014552109],"domain_scores_gemma":[0.99666554,0.0026878647,0.00011737854,0.00018153474,0.00024110322,0.000106617634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011600294,0.0014938711,0.001257846,0.0017411129,0.0008713279,0.0020161825,0.00144175,0.001697239,0.012784613],"category_scores_gemma":[0.007579332,0.0010939685,0.00083239033,0.0023749594,0.0010002566,0.0021390326,0.0019899001,0.001905584,0.0015082972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016759997,0.00023576716,0.00026284126,0.00017188139,0.000039371986,0.000060628885,0.000089788795,0.8367434,0.001346769,0.062145665,0.011161381,0.08757485],"study_design_scores_gemma":[0.000049819533,0.000030799893,0.000044652577,0.000016463151,0.000008513224,0.000016043363,0.00003177583,0.96452624,0.0003576984,0.03382447,0.0010862665,0.00000738554],"about_ca_topic_score_codex":0.0079338085,"about_ca_topic_score_gemma":0.0087607,"teacher_disagreement_score":0.012784613,"about_ca_system_score_codex":0.0016457018,"about_ca_system_score_gemma":0.0023198447,"threshold_uncertainty_score":0.042768776},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03191747,0.0006060839,0.96229064,0.00034301658,0.00005791707,0.00006069877,0.00012005401,0.00046049547,0.004143623],"genre_scores_gemma":[0.4872094,0.0010590319,0.5051598,0.00025677725,0.00020920992,0.0002538497,0.00020516285,0.00011376352,0.005533014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989085,0.0005310439,0.00006346935,0.00011420257,0.00031179574,0.00007107261],"domain_scores_gemma":[0.9931716,0.005189251,0.00038135104,0.0007638952,0.00040934363,0.00008465154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016447823,0.00066204346,0.00094139,0.0013160093,0.0004484855,0.00085041,0.00069492246,0.001192718,0.0026519948],"category_scores_gemma":[0.010994261,0.00042395105,0.0006636084,0.0016247629,0.00091062725,0.0010604414,0.0007329772,0.00087826245,0.00039472288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049283745,0.00010157142,0.0013363995,0.00024106563,0.00006663739,0.00040659404,0.00027793756,0.3186288,0.009356846,0.4913417,0.0032424529,0.17450705],"study_design_scores_gemma":[0.000046024685,0.00010079701,0.0002337275,0.000036297304,0.000029050198,0.00022704841,0.000014200612,0.7931798,0.0030546645,0.19952957,0.0035300371,0.0000187019],"about_ca_topic_score_codex":0.0016552821,"about_ca_topic_score_gemma":0.0017742426,"teacher_disagreement_score":0.0026519948,"about_ca_system_score_codex":0.0010374879,"about_ca_system_score_gemma":0.0010721867,"threshold_uncertainty_score":0.008871794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7173922,0.00090691226,0.19208144,0.0011976906,0.00016480885,0.00014164984,0.0012532289,0.0005558253,0.08630625],"genre_scores_gemma":[0.96347135,0.00059630675,0.025849896,0.00022082213,0.00016236736,0.0000790687,0.00087880885,0.00015658858,0.008584868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996525,0.000060239938,0.00002102752,0.00009195213,0.00009234099,0.000081914666],"domain_scores_gemma":[0.99677306,0.0017015492,0.00049755035,0.00031278003,0.0003847227,0.00033029163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281021,0.00033708182,0.0005799226,0.0016537713,0.0014559292,0.002783493,0.00051559095,0.00081608345,0.009673486],"category_scores_gemma":[0.0046364097,0.000503714,0.0005093215,0.0016542855,0.0012166799,0.0032883268,0.000715214,0.0011733286,0.00080487976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010899038,0.00005176606,0.0011184749,0.00008101919,0.000012663276,0.0002006878,0.00054559467,0.0028759637,0.004736212,0.97375226,0.0032375008,0.013278849],"study_design_scores_gemma":[0.000022362372,0.000024899278,0.0005968918,0.000022968936,0.000013361488,0.0002590055,0.00017271479,0.011866044,0.00094370014,0.9821708,0.0038907109,0.000016514756],"about_ca_topic_score_codex":0.0011778735,"about_ca_topic_score_gemma":0.00181064,"teacher_disagreement_score":0.009673486,"about_ca_system_score_codex":0.000659515,"about_ca_system_score_gemma":0.00045495623,"threshold_uncertainty_score":0.03236103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13317089,0.00084176956,0.8056769,0.0005066887,0.00012871693,0.00020592421,0.0004660825,0.00033074952,0.058672283],"genre_scores_gemma":[0.7167881,0.002084542,0.23837888,0.00059651927,0.00025707943,0.00055592984,0.00078170927,0.00023614638,0.04032105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811673,0.0008347147,0.00007274795,0.0002476398,0.00046307984,0.00026515074],"domain_scores_gemma":[0.9950831,0.0027882638,0.00064117956,0.000695672,0.0005693178,0.00022261533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016994592,0.0014426983,0.0010009177,0.001138078,0.0008370074,0.0018208355,0.001031771,0.0011160467,0.008336192],"category_scores_gemma":[0.005892211,0.0008355085,0.00051700085,0.0016149367,0.0012918438,0.002307719,0.0015647977,0.0010037066,0.0015622771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004412558,0.0000752293,0.00050800294,0.00017306113,0.000043670247,0.00023278197,0.00027238205,0.06969604,0.0111066615,0.86789554,0.004064126,0.045491256],"study_design_scores_gemma":[0.00015127589,0.00022193341,0.0003323894,0.00012233427,0.000064140855,0.00026571096,0.00009161129,0.18083635,0.004292972,0.8026752,0.010899834,0.000046271503],"about_ca_topic_score_codex":0.0015311496,"about_ca_topic_score_gemma":0.0026315902,"teacher_disagreement_score":0.008336192,"about_ca_system_score_codex":0.0013324902,"about_ca_system_score_gemma":0.0011410154,"threshold_uncertainty_score":0.027887344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7892161,0.00084226154,0.1260856,0.00074824074,0.00018671737,0.00014459944,0.0010378713,0.00016663242,0.08157191],"genre_scores_gemma":[0.9781845,0.00027280708,0.0090453755,0.0001252246,0.00004662917,0.000068898866,0.00036030117,0.000021174237,0.011875027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998416,0.000040154107,0.0000073238148,0.000035733632,0.000035714755,0.00003943439],"domain_scores_gemma":[0.9995353,0.00015344069,0.00009165141,0.00004156102,0.000083847866,0.00009416235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014158567,0.00030369352,0.00037436854,0.00082670414,0.0007065537,0.0009353265,0.00053660595,0.0005670454,0.0069444366],"category_scores_gemma":[0.0007785915,0.00021718029,0.00023651391,0.0006828135,0.00059402146,0.0006995318,0.0005496911,0.00051069685,0.00036795612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006357029,0.00004367001,0.0005486044,0.000078781035,0.000021345408,0.00026117958,0.00019522403,0.021051386,0.0042641377,0.96107364,0.0025631583,0.009835246],"study_design_scores_gemma":[0.000051575556,0.000049206043,0.00068558817,0.00001882213,0.000016137972,0.0001856119,0.00014062072,0.11052514,0.0013850563,0.88139397,0.005521616,0.000026632253],"about_ca_topic_score_codex":0.002091578,"about_ca_topic_score_gemma":0.002475411,"teacher_disagreement_score":0.0069444366,"about_ca_system_score_codex":0.00083051226,"about_ca_system_score_gemma":0.00059659226,"threshold_uncertainty_score":0.023231506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6215377,0.0007399752,0.3298253,0.00091298396,0.00061151414,0.00032107948,0.00081212464,0.001969097,0.04327012],"genre_scores_gemma":[0.8421352,0.00032828536,0.14600685,0.0004187501,0.00009709299,0.00022783923,0.00070156204,0.0008200159,0.00926445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790597,0.0007889031,0.00011566817,0.00032026856,0.00030763174,0.0005616106],"domain_scores_gemma":[0.9942762,0.0020097794,0.00025579103,0.002192334,0.0005770761,0.00068879995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284748,0.0008313511,0.0011720413,0.0011203373,0.0018782449,0.0026101586,0.0017994335,0.0012636074,0.01178932],"category_scores_gemma":[0.007121732,0.00087333226,0.0006734841,0.0013737084,0.0013547783,0.0027390409,0.0038501532,0.0017437738,0.0020883686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008439247,0.00082571164,0.005520758,0.0006250307,0.00023958083,0.0012014348,0.00214761,0.18507291,0.13471687,0.39005163,0.02664988,0.24450924],"study_design_scores_gemma":[0.00055887894,0.000519909,0.0029157985,0.00020718476,0.00018491261,0.0006590141,0.0015572621,0.3691611,0.056849267,0.5376371,0.029619394,0.00013015972],"about_ca_topic_score_codex":0.0013020538,"about_ca_topic_score_gemma":0.0040542437,"teacher_disagreement_score":0.01178932,"about_ca_system_score_codex":0.0011368239,"about_ca_system_score_gemma":0.0008422418,"threshold_uncertainty_score":0.0394392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8223238,0.00022407541,0.13217156,0.00027057255,0.000096298485,0.00006724442,0.00020765136,0.00042786775,0.044210892],"genre_scores_gemma":[0.8930515,0.00018199213,0.09005123,0.00015761076,0.000035290945,0.00011643475,0.00029500402,0.00015998684,0.01595104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961096,0.00009047566,0.000030357416,0.00006742337,0.000114962146,0.0000857916],"domain_scores_gemma":[0.99921644,0.00022246689,0.00014790277,0.00021656658,0.000089166206,0.00010739672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027821792,0.00023960505,0.0003702438,0.0005971939,0.0007826109,0.0010640656,0.00044733568,0.000734387,0.005057452],"category_scores_gemma":[0.0013443629,0.0006827807,0.0005292512,0.0005990078,0.00083214644,0.0012980989,0.00095607026,0.00070335215,0.00068008265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007260957,0.00013194502,0.00289829,0.00021812388,0.00005955889,0.0012472442,0.000961092,0.05600244,0.0897736,0.7803958,0.004320602,0.06326519],"study_design_scores_gemma":[0.00016940996,0.00060188223,0.0059440825,0.00013203252,0.000076815544,0.0020811118,0.00052076345,0.2228005,0.049788285,0.6889959,0.028803578,0.000085597065],"about_ca_topic_score_codex":0.0009336451,"about_ca_topic_score_gemma":0.0012781487,"teacher_disagreement_score":0.005057452,"about_ca_system_score_codex":0.00050222274,"about_ca_system_score_gemma":0.00040333808,"threshold_uncertainty_score":0.016918898},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16863894,0.001869831,0.73931473,0.0024704025,0.00025965887,0.0002722849,0.0006816476,0.00074990967,0.08574259],"genre_scores_gemma":[0.8145425,0.0036224585,0.1273208,0.0016056307,0.0006737853,0.0011633714,0.001184964,0.0006869494,0.049199633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956422,0.0011349068,0.00026781205,0.00095206633,0.0013343767,0.00066861045],"domain_scores_gemma":[0.95864415,0.033365183,0.0013938872,0.0027276778,0.0022740776,0.0015951328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004642582,0.0021566635,0.0027377987,0.002667718,0.003137276,0.004820197,0.003719957,0.0026530281,0.01573217],"category_scores_gemma":[0.031665288,0.002882044,0.0022410129,0.0026725472,0.0042690067,0.013775607,0.00787942,0.0087225875,0.0023679922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003992549,0.00022348102,0.0012358808,0.00053481926,0.00012292423,0.00035962596,0.00089310174,0.0192973,0.00973352,0.9425775,0.004239966,0.020382576],"study_design_scores_gemma":[0.00007790139,0.00014826348,0.00036811092,0.00009002031,0.00012001946,0.00029156927,0.00024317447,0.038721595,0.0037745833,0.95014966,0.005958454,0.00005659378],"about_ca_topic_score_codex":0.0009447131,"about_ca_topic_score_gemma":0.0009590179,"teacher_disagreement_score":0.01573217,"about_ca_system_score_codex":0.0016580485,"about_ca_system_score_gemma":0.0014733915,"threshold_uncertainty_score":0.05262935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4632705,0.00048056454,0.38368413,0.00102371,0.0007901698,0.00017552891,0.0003505538,0.0006060647,0.1496188],"genre_scores_gemma":[0.93869084,0.0002087619,0.033443518,0.00026562836,0.00012661361,0.00012630042,0.00029243875,0.0001545981,0.026691318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993358,0.00013443478,0.000043266962,0.00014179955,0.0001886098,0.00015614442],"domain_scores_gemma":[0.99902964,0.00020358655,0.00011450215,0.00016605826,0.00027900244,0.00020721604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046558125,0.00035005444,0.0005563606,0.0015830502,0.0017281545,0.0026629774,0.00049147184,0.0010607076,0.01054809],"category_scores_gemma":[0.001794505,0.00039504364,0.0007609436,0.000653392,0.0016448104,0.0024519674,0.0020246077,0.0019996036,0.0010014919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026297079,0.000013776877,0.00014176521,0.000013279857,0.0000045191923,0.00010559216,0.00016278218,0.00075333123,0.001647589,0.9934122,0.0005846992,0.0031341156],"study_design_scores_gemma":[0.000017859304,0.000033263652,0.00024041685,0.00001913498,0.0000074822556,0.00016856146,0.000256366,0.012309213,0.0022070224,0.97992665,0.0047968184,0.000017139195],"about_ca_topic_score_codex":0.00094711035,"about_ca_topic_score_gemma":0.00084150495,"teacher_disagreement_score":0.01054809,"about_ca_system_score_codex":0.0008612847,"about_ca_system_score_gemma":0.0006200922,"threshold_uncertainty_score":0.035286844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47558883,0.00028963186,0.4868029,0.00049054576,0.00010526931,0.00020630148,0.0008271781,0.0006213535,0.035067987],"genre_scores_gemma":[0.8047437,0.00038083337,0.17861916,0.00018243036,0.000038230402,0.00024282873,0.0008149253,0.00023557749,0.014742272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992193,0.00023046312,0.00006882553,0.00011087309,0.00020780678,0.00016263782],"domain_scores_gemma":[0.9972843,0.0012303704,0.0004180276,0.0005044689,0.0003436729,0.00021917257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006494271,0.00062132295,0.0009310512,0.00096650835,0.0008937061,0.0021424203,0.001036108,0.0014541197,0.006657686],"category_scores_gemma":[0.0032100405,0.00091075693,0.0006326112,0.0017530776,0.001073675,0.0022131274,0.001963225,0.0011437491,0.0012308699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007017388,0.00009796395,0.0013545256,0.00024349011,0.000074040356,0.0005446565,0.0004193986,0.11135197,0.035611905,0.81465703,0.004316274,0.030627035],"study_design_scores_gemma":[0.00018715046,0.00014172617,0.0006856519,0.000045264158,0.000051535437,0.00047510708,0.0002047323,0.272729,0.016231233,0.70389366,0.0053114183,0.000043447373],"about_ca_topic_score_codex":0.00092713314,"about_ca_topic_score_gemma":0.0016668774,"teacher_disagreement_score":0.006657686,"about_ca_system_score_codex":0.0011002288,"about_ca_system_score_gemma":0.00075550564,"threshold_uncertainty_score":0.02227217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76804584,0.0017590207,0.16719604,0.0015345832,0.00029407558,0.00022469905,0.00067809864,0.00054217735,0.0597254],"genre_scores_gemma":[0.9469958,0.001052649,0.02677357,0.0003995199,0.00020580883,0.00020886712,0.00078794477,0.00021465264,0.023361294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899787,0.00027682193,0.000063228224,0.00020234652,0.00027106152,0.00018873365],"domain_scores_gemma":[0.99252594,0.0044014887,0.00095494563,0.0007442144,0.00053866097,0.0008346462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058879,0.0008697937,0.0010980233,0.0030533646,0.002870786,0.0036202043,0.0023175792,0.0020409322,0.007644583],"category_scores_gemma":[0.008244799,0.001393489,0.00095541915,0.002738236,0.002379168,0.0040001413,0.0019558484,0.0024812734,0.00081007427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028918774,0.00018035278,0.0022790304,0.00027744606,0.000057496847,0.00083064404,0.001035093,0.015061653,0.0044866996,0.9476674,0.0048214695,0.023013579],"study_design_scores_gemma":[0.00005884654,0.00003919554,0.0007286221,0.00007181105,0.00004793415,0.00037748754,0.0003126063,0.040320616,0.0015985887,0.9526885,0.0037282116,0.000027552087],"about_ca_topic_score_codex":0.0020702493,"about_ca_topic_score_gemma":0.0038691175,"teacher_disagreement_score":0.007644583,"about_ca_system_score_codex":0.0011836844,"about_ca_system_score_gemma":0.0009449566,"threshold_uncertainty_score":0.02557373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321671,0.0030122695,0.21238934,0.004176154,0.00054211385,0.00008639545,0.0004083163,0.00044211757,0.14677618],"genre_scores_gemma":[0.9784064,0.0008567138,0.011975053,0.00037102288,0.00039357736,0.00005800266,0.00022631085,0.00006995963,0.0076431544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988154,0.00042536916,0.000049905124,0.00016873995,0.0003340057,0.00020661282],"domain_scores_gemma":[0.98035336,0.014142716,0.0010924543,0.001150709,0.0022684997,0.0009922063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016513075,0.00067448965,0.0010575922,0.0028375927,0.0015176667,0.0030897462,0.0014184281,0.0016860925,0.006515159],"category_scores_gemma":[0.027250564,0.00075385446,0.0005652727,0.001779444,0.0033858519,0.003871505,0.0027106549,0.0029094545,0.00063319603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015243923,0.000053415093,0.0009059805,0.00010825984,0.00001894263,0.00019679278,0.00031004468,0.009789477,0.00222907,0.9749536,0.0029092662,0.008372767],"study_design_scores_gemma":[0.000041754836,0.00004938076,0.0006010552,0.00006913064,0.000016633623,0.00037313302,0.00021961254,0.09934558,0.0013759925,0.895944,0.0019191807,0.00004458598],"about_ca_topic_score_codex":0.0013486851,"about_ca_topic_score_gemma":0.0012307914,"teacher_disagreement_score":0.006515159,"about_ca_system_score_codex":0.0013111907,"about_ca_system_score_gemma":0.0009961649,"threshold_uncertainty_score":0.021795332},"labels":[],"label_agreement":null},{"id":"W2052666099","doi":"10.1002/jcd.20109","title":"Constructions of 2‐cover‐free families and related separating hash families","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Manitoba","funders":"","keywords":"Cover (algebra); Mathematics; Construct (python library); Combinatorics; Hash function; Discrete mathematics; Computer science","score_opus":0.007049594916190552,"score_gpt":0.19678227760369268,"score_spread":0.18973268268750212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052666099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62249786,0.0004875412,0.34743938,0.0005600984,0.000059469203,0.00018498395,0.0008124118,0.00041716444,0.027541082],"genre_scores_gemma":[0.8958158,0.00034652406,0.096856155,0.00012583101,0.000039765077,0.00021713965,0.00075294473,0.000084674546,0.0057612853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991387,0.00022745937,0.00004476993,0.00012474648,0.000275354,0.00018895081],"domain_scores_gemma":[0.99547595,0.0026915476,0.0005089547,0.0007309773,0.00037153787,0.00022105318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010103894,0.00045135713,0.0003919949,0.0009079791,0.0015081068,0.0010078378,0.00065393833,0.00082602026,0.0074277017],"category_scores_gemma":[0.004416904,0.00055647193,0.0006342681,0.0010530184,0.0010238098,0.002448886,0.0015485368,0.0010122707,0.00060027716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073198637,0.000213554,0.0062946943,0.00029071196,0.00008141986,0.0007161201,0.0013079948,0.06572625,0.026637474,0.7886557,0.006696789,0.10264739],"study_design_scores_gemma":[0.00013395859,0.0003695989,0.0044464227,0.00010603475,0.000082603816,0.002264597,0.00077027426,0.20180471,0.05113012,0.70850074,0.030236436,0.00015443584],"about_ca_topic_score_codex":0.00052284315,"about_ca_topic_score_gemma":0.0005468013,"teacher_disagreement_score":0.0074277017,"about_ca_system_score_codex":0.0010741032,"about_ca_system_score_gemma":0.0005105041,"threshold_uncertainty_score":0.024848104},"labels":[],"label_agreement":null},{"id":"W2053412048","doi":"10.1002/jcd.20142","title":"Hill‐climbing to Pasch valleys","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isomorphism (crystallography); Mathematics; Combinatorics; Climbing; Hill climbing; Distribution (mathematics); Sample (material); Enumeration; Uniform distribution (continuous); Discrete mathematics; Algorithm; Statistics; Mathematical analysis; Geography","score_opus":0.015663260765045792,"score_gpt":0.23496170549880568,"score_spread":0.2192984447337599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053412048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34520215,0.0005102881,0.6287337,0.0009299079,0.00013914068,0.0005660308,0.000362183,0.0016254083,0.02193116],"genre_scores_gemma":[0.75457996,0.00014396019,0.2367679,0.00057667936,0.000045037483,0.0004974189,0.00073776953,0.0002370073,0.006414292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.00020383649,0.000026454949,0.0001094351,0.00014470363,0.00014617454],"domain_scores_gemma":[0.997922,0.0010007819,0.00014233397,0.00042521022,0.00032301477,0.00018679477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014799887,0.0005933243,0.001489799,0.0014199323,0.0012914754,0.0010024594,0.0017061504,0.0010984951,0.006020288],"category_scores_gemma":[0.005830575,0.0005874979,0.0010913382,0.0007690393,0.0010142975,0.0009852477,0.0016989075,0.0012296442,0.0009365987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042030995,0.0004557125,0.0063868985,0.00023240781,0.00019735804,0.0003362316,0.0006135639,0.7510632,0.0064195227,0.06715268,0.017735219,0.14898685],"study_design_scores_gemma":[0.000054555516,0.00016467506,0.0006807215,0.00002232587,0.00001819153,0.000093157105,0.000115356765,0.9645188,0.00102219,0.029810408,0.0034849315,0.000014671758],"about_ca_topic_score_codex":0.002471706,"about_ca_topic_score_gemma":0.003279242,"teacher_disagreement_score":0.006020288,"about_ca_system_score_codex":0.00080305064,"about_ca_system_score_gemma":0.00079916616,"threshold_uncertainty_score":0.020139813},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6916661,0.0008429645,0.20370542,0.0019854757,0.00034540516,0.00021481822,0.00073311006,0.00038884775,0.10011777],"genre_scores_gemma":[0.95958185,0.0004334636,0.017271712,0.00026733684,0.0001225229,0.00013733005,0.00037556782,0.00013820849,0.021671971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.00010348074,0.000017742375,0.000077825534,0.0000925902,0.00013399529],"domain_scores_gemma":[0.99734336,0.0013674193,0.00026721205,0.00026653582,0.00035815215,0.00039731906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059260207,0.0008560976,0.0008153364,0.0018253704,0.0019937067,0.0026356094,0.0011040932,0.0014274714,0.011687159],"category_scores_gemma":[0.003930304,0.00053575705,0.00052837137,0.0016642428,0.002106198,0.0032036405,0.0022800341,0.0015504298,0.00074139354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106533145,0.000022348604,0.0003449981,0.000043314154,0.000007138821,0.00006200479,0.00015848281,0.010876566,0.0019408466,0.9813565,0.0017033156,0.0033778795],"study_design_scores_gemma":[0.00003754472,0.000042063533,0.00026666326,0.000028383465,0.000010815952,0.00006779261,0.00016302681,0.07046106,0.001081008,0.92540455,0.0024110442,0.00002605532],"about_ca_topic_score_codex":0.0026647397,"about_ca_topic_score_gemma":0.0040747677,"teacher_disagreement_score":0.011687159,"about_ca_system_score_codex":0.001955356,"about_ca_system_score_gemma":0.001080042,"threshold_uncertainty_score":0.03909743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331942,0.0003249453,0.09061984,0.0007702597,0.00024747362,0.0001060684,0.0014156608,0.00069561123,0.17262597],"genre_scores_gemma":[0.9415814,0.00012113987,0.019117061,0.00015307966,0.000045279743,0.00005122248,0.0010900239,0.00009111178,0.03774977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959725,0.00006390811,0.000022271674,0.00007753565,0.00010435861,0.00013460506],"domain_scores_gemma":[0.9988562,0.00038206004,0.00013723991,0.0003068895,0.00015287707,0.00016471397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032060195,0.00027010214,0.00038133244,0.0009719432,0.0013851369,0.0011291406,0.00040557337,0.0005098811,0.013782416],"category_scores_gemma":[0.0014707407,0.00020244556,0.00035394504,0.0005898218,0.001129735,0.0013885723,0.0018395459,0.00091009814,0.0018236578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037306413,0.00013718674,0.0046357303,0.00013781303,0.00003222567,0.0011371494,0.00084172585,0.00265431,0.026572797,0.9202488,0.008744117,0.034484997],"study_design_scores_gemma":[0.000040830375,0.000103571474,0.00626811,0.0000975667,0.000043695196,0.001995853,0.0008463692,0.016274871,0.01977836,0.8997727,0.05474056,0.00003746084],"about_ca_topic_score_codex":0.000843813,"about_ca_topic_score_gemma":0.0026182525,"teacher_disagreement_score":0.013782416,"about_ca_system_score_codex":0.00053330866,"about_ca_system_score_gemma":0.0004808497,"threshold_uncertainty_score":0.046106756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47892293,0.0010514723,0.19159867,0.0013588691,0.0002811443,0.00022184981,0.0030607553,0.00082188187,0.32268244],"genre_scores_gemma":[0.8657569,0.00062226504,0.061741963,0.00046519242,0.00011233039,0.00018765374,0.002578585,0.00038610003,0.06814905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956614,0.00007845863,0.000023354794,0.000096644275,0.000095569,0.00013986776],"domain_scores_gemma":[0.999213,0.0002236175,0.00013242949,0.00013202496,0.00013850645,0.00016040343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003179083,0.00062092603,0.0004287541,0.0013239313,0.0013524785,0.0023814193,0.0007957322,0.0006813412,0.013397506],"category_scores_gemma":[0.0013223095,0.0005085849,0.0005143586,0.0011937069,0.000947921,0.0015904412,0.0013194631,0.001445245,0.0021715425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014438828,0.00006632445,0.0005701617,0.00012507029,0.000021818189,0.0002726139,0.0005678005,0.0038769976,0.0070668636,0.95331776,0.010724491,0.023245692],"study_design_scores_gemma":[0.000042302454,0.00003002229,0.0008695746,0.000048725222,0.000023468014,0.0003279098,0.00034086592,0.009472166,0.003039247,0.96785694,0.017928863,0.000019956327],"about_ca_topic_score_codex":0.0016625379,"about_ca_topic_score_gemma":0.0026843166,"teacher_disagreement_score":0.013397506,"about_ca_system_score_codex":0.0012917338,"about_ca_system_score_gemma":0.00052044337,"threshold_uncertainty_score":0.044819176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21961844,0.0012971498,0.6434333,0.006853388,0.00023310551,0.00037289216,0.004375308,0.00046143713,0.12335508],"genre_scores_gemma":[0.8795477,0.0009537856,0.058571,0.0005212158,0.00015145769,0.00029519916,0.0013637888,0.00010333522,0.058492396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933463,0.00023502341,0.000017232165,0.00016620973,0.00009920182,0.00014757365],"domain_scores_gemma":[0.9986443,0.00082976616,0.0001564488,0.000073985095,0.00010919409,0.00018632661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062390184,0.00078594865,0.001300408,0.00066578604,0.00093379675,0.0030026883,0.0022018314,0.002633115,0.011085587],"category_scores_gemma":[0.002400646,0.00064227864,0.00069011684,0.0016852723,0.0015077018,0.0019931914,0.0011696968,0.0022542977,0.0008715695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108336826,0.00015179113,0.0003730863,0.00014487767,0.000034975976,0.0003159649,0.00012471431,0.35582274,0.00076095265,0.6271497,0.008728864,0.0062840236],"study_design_scores_gemma":[0.000073335075,0.000035678815,0.00013037048,0.000014272187,0.00001303422,0.000059893853,0.000065063105,0.7223574,0.00014585242,0.2740801,0.0030088562,0.000016160819],"about_ca_topic_score_codex":0.01540596,"about_ca_topic_score_gemma":0.01708575,"teacher_disagreement_score":0.01540596,"about_ca_system_score_codex":0.0029637867,"about_ca_system_score_gemma":0.002298522,"threshold_uncertainty_score":0.037084997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54205227,0.00046845144,0.27139693,0.0019035952,0.0003336868,0.000110758156,0.0012791944,0.0005778235,0.18187727],"genre_scores_gemma":[0.93041885,0.00028449015,0.03604108,0.00035861172,0.00019373141,0.0001310185,0.0008397921,0.00017159872,0.031560738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992854,0.00013368763,0.00004440302,0.00019963825,0.0002000816,0.0001367708],"domain_scores_gemma":[0.9976445,0.0010519827,0.00043177282,0.00034697395,0.00028879414,0.00023601147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039285363,0.00055149745,0.00056436774,0.0014373844,0.0017334125,0.0033163938,0.0010677635,0.0011966999,0.015692126],"category_scores_gemma":[0.0028716023,0.0006806886,0.0007167271,0.0021653725,0.002676643,0.0037306054,0.0015394591,0.0022050627,0.0016392011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068682035,0.000021853275,0.00032307507,0.000044918805,0.000008687825,0.0002492679,0.00025883547,0.0012862742,0.0020692723,0.9848519,0.0016333129,0.009183943],"study_design_scores_gemma":[0.000015114251,0.000019057254,0.0003377837,0.00001034327,0.0000058270243,0.00044193913,0.00017713806,0.00511232,0.0011663394,0.99022454,0.0024707376,0.000018913799],"about_ca_topic_score_codex":0.00074679154,"about_ca_topic_score_gemma":0.000922098,"teacher_disagreement_score":0.015692126,"about_ca_system_score_codex":0.0006873852,"about_ca_system_score_gemma":0.0005717191,"threshold_uncertainty_score":0.05249536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42678648,0.00035198935,0.4012166,0.00203024,0.0011685197,0.0002557553,0.0005503499,0.0010142549,0.16662574],"genre_scores_gemma":[0.87983894,0.00027029548,0.06656062,0.0006980249,0.00048837205,0.00039546462,0.00035478472,0.0002892798,0.051104307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841547,0.00049453496,0.000119871096,0.00020712815,0.0003476941,0.0004153586],"domain_scores_gemma":[0.9972703,0.0012504675,0.0002094136,0.0005398137,0.0003496018,0.00038039792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022605162,0.0008773074,0.0008816406,0.00234808,0.0027587162,0.0032791141,0.0009516838,0.0019515668,0.010640327],"category_scores_gemma":[0.0031350623,0.000658249,0.0011000858,0.0009846231,0.002581303,0.0047136513,0.0023399978,0.0021132294,0.0020210769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000719795,0.000025651281,0.00008680191,0.000014665379,0.0000038880034,0.00007051598,0.00008513268,0.00038288682,0.002334996,0.9942205,0.0005583683,0.0021447332],"study_design_scores_gemma":[0.000060853657,0.00008312214,0.0001499012,0.000018174505,0.000011442354,0.0001754118,0.00010323026,0.006101856,0.006791521,0.98159057,0.004876622,0.00003736742],"about_ca_topic_score_codex":0.00017952215,"about_ca_topic_score_gemma":0.00036591865,"teacher_disagreement_score":0.010640327,"about_ca_system_score_codex":0.00091583846,"about_ca_system_score_gemma":0.00085679255,"threshold_uncertainty_score":0.035595417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02993217,0.0014023985,0.7223989,0.0044168155,0.0021945878,0.00007341381,0.00053955684,0.001739139,0.23730308],"genre_scores_gemma":[0.544727,0.001981444,0.3101873,0.0028847137,0.0014549906,0.00016488263,0.00083653734,0.0016133061,0.13614982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990441,0.00039265404,0.0000332632,0.00017592657,0.00026079456,0.000093271694],"domain_scores_gemma":[0.9987191,0.00042554273,0.00006511233,0.00042051045,0.00023295014,0.00013681393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010174864,0.00069992227,0.00078413746,0.0017021057,0.0016458734,0.0033511226,0.001013417,0.0012452026,0.039469972],"category_scores_gemma":[0.004606744,0.00040651925,0.0009145278,0.001273195,0.0019634762,0.010011387,0.002163144,0.0018582101,0.004384403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020351848,0.000013108513,0.000074929594,0.00003895382,0.000006717814,0.000029755147,0.0001596295,0.0014186631,0.00042136162,0.97737724,0.0060196514,0.014419689],"study_design_scores_gemma":[0.0000068644463,0.0000043766017,0.0000274375,0.000014530453,0.000005231886,0.00004161173,0.00004516066,0.003053393,0.00023810791,0.96833825,0.028216222,0.000008827162],"about_ca_topic_score_codex":0.0016624611,"about_ca_topic_score_gemma":0.0026831413,"teacher_disagreement_score":0.039469972,"about_ca_system_score_codex":0.0010090345,"about_ca_system_score_gemma":0.00045586354,"threshold_uncertainty_score":0.13204026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69063586,0.0004894791,0.16200946,0.0012575,0.00026271262,0.00006844813,0.00052775466,0.0004690741,0.14427978],"genre_scores_gemma":[0.9561574,0.00028557508,0.02050803,0.00028749582,0.0001896869,0.00005335873,0.0004324172,0.00017698004,0.021908939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885654,0.0001996723,0.00006672162,0.00033785848,0.00032641884,0.00021291769],"domain_scores_gemma":[0.9975368,0.00084875233,0.00045326294,0.00042735494,0.00030663586,0.0004271447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065178575,0.0007289925,0.0008456164,0.0022482534,0.002549241,0.003926037,0.0016207803,0.0011952769,0.011614484],"category_scores_gemma":[0.0028960318,0.0008418177,0.00089706713,0.0014689462,0.0028115257,0.004277126,0.0036069003,0.003062402,0.0015517288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057418598,0.000028011518,0.00027547262,0.000023270473,0.000008956179,0.00010888624,0.00021882205,0.0016089283,0.0010596813,0.99235064,0.0007058269,0.0035541044],"study_design_scores_gemma":[0.000017281478,0.000027092692,0.00048618807,0.000013139259,0.000014592599,0.00018504981,0.000199266,0.006202307,0.0013532732,0.98757744,0.0039039291,0.000020560501],"about_ca_topic_score_codex":0.0010708863,"about_ca_topic_score_gemma":0.0010828478,"teacher_disagreement_score":0.011614484,"about_ca_system_score_codex":0.001006403,"about_ca_system_score_gemma":0.00040618278,"threshold_uncertainty_score":0.0388543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30573413,0.0020896357,0.5478349,0.0022740266,0.0010338599,0.00027324422,0.00031123502,0.0017768486,0.13867214],"genre_scores_gemma":[0.80470264,0.0010787979,0.1774082,0.0005381504,0.00044571277,0.00019881887,0.00028372623,0.00023037124,0.015113689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920875,0.00019539594,0.00005653001,0.00022120956,0.00015651918,0.00016152674],"domain_scores_gemma":[0.99891734,0.0005040595,0.0001317433,0.00023298261,0.00010487197,0.00010897921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007150338,0.0006120008,0.000558041,0.0010300992,0.0017139129,0.0027278634,0.0005400883,0.0009242578,0.005341561],"category_scores_gemma":[0.00336889,0.00047816554,0.00068693433,0.0007698943,0.0020193167,0.0041681556,0.0024758407,0.001489545,0.0014617383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025470348,0.000045770546,0.0014128195,0.000091474816,0.000010520972,0.00063777214,0.0008307953,0.0032659243,0.01496885,0.92249095,0.0046386817,0.05135169],"study_design_scores_gemma":[0.000024220979,0.00006712636,0.00034920961,0.000048712205,0.000016096888,0.0006337085,0.0002537953,0.016129414,0.011020304,0.9341972,0.037224784,0.000035358233],"about_ca_topic_score_codex":0.00057531724,"about_ca_topic_score_gemma":0.0009855147,"teacher_disagreement_score":0.005341561,"about_ca_system_score_codex":0.0008202517,"about_ca_system_score_gemma":0.0007778099,"threshold_uncertainty_score":0.017869294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4898089,0.007352803,0.31882563,0.005804632,0.0014551796,0.00007583558,0.0015178743,0.00058431766,0.17457493],"genre_scores_gemma":[0.9616806,0.0018362975,0.014860802,0.00054646016,0.0011305033,0.000066205976,0.00040925376,0.000104473875,0.019365482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824595,0.0005544326,0.0001408523,0.00028365434,0.00050553307,0.00026955747],"domain_scores_gemma":[0.9939131,0.0031497674,0.00087198365,0.00046591694,0.0010016935,0.0005974928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020941284,0.0008449693,0.0012148619,0.0044153715,0.0016224757,0.0069083055,0.0012486754,0.0011903776,0.010911232],"category_scores_gemma":[0.0074009714,0.0007262048,0.0006236569,0.0033527985,0.004344267,0.009023542,0.0021116433,0.0027458272,0.0013621625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037244365,0.00002438228,0.00014522528,0.000033587978,0.000004935472,0.000033947785,0.00014113217,0.000568802,0.00034703466,0.9925896,0.0010605431,0.0050136275],"study_design_scores_gemma":[0.000009555986,0.000018170014,0.00012414737,0.00001424233,0.0000068072927,0.00008126199,0.00005163844,0.004363847,0.0003709273,0.9935609,0.0013746475,0.000023929428],"about_ca_topic_score_codex":0.0008873999,"about_ca_topic_score_gemma":0.0009415039,"teacher_disagreement_score":0.010911232,"about_ca_system_score_codex":0.0013744392,"about_ca_system_score_gemma":0.0010089523,"threshold_uncertainty_score":0.036501706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055347804,0.00058228656,0.9275929,0.0005312826,0.00018680647,0.00027366672,0.0002182873,0.0015798404,0.013687129],"genre_scores_gemma":[0.20943251,0.00017066875,0.784582,0.00016803111,0.000085222106,0.00031136404,0.00038286563,0.00023645439,0.004630945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907136,0.0003128379,0.0000433095,0.00014819443,0.00021242595,0.00021171285],"domain_scores_gemma":[0.99680114,0.0021018893,0.00014638295,0.00042816857,0.00035401963,0.00016836336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010034182,0.0013504254,0.0015293208,0.0017225926,0.0015788127,0.0020854552,0.002440505,0.0020537288,0.01152187],"category_scores_gemma":[0.006563724,0.0010449408,0.0010814458,0.0022858037,0.0010157262,0.0026441126,0.0019469915,0.0015901779,0.0016398443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081151136,0.0005720536,0.00085021945,0.00043215993,0.0001188946,0.00025557936,0.00034159044,0.53440726,0.005473796,0.10923425,0.016536014,0.33096665],"study_design_scores_gemma":[0.00020465242,0.0000798807,0.00009070196,0.000023692452,0.000021514981,0.00006458039,0.00008611961,0.9268959,0.0014734756,0.06908576,0.0019523395,0.000021299295],"about_ca_topic_score_codex":0.0055665877,"about_ca_topic_score_gemma":0.01090958,"teacher_disagreement_score":0.01152187,"about_ca_system_score_codex":0.0016203676,"about_ca_system_score_gemma":0.0025497335,"threshold_uncertainty_score":0.038544536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6293408,0.00044580377,0.28344667,0.0012917746,0.00040647262,0.0000764552,0.00032737333,0.00073696766,0.08392765],"genre_scores_gemma":[0.88433105,0.00022975804,0.093261056,0.0004504493,0.00019316224,0.000105580446,0.00036956902,0.00026087387,0.020798517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992574,0.00020309613,0.000040489238,0.00018872436,0.0001850981,0.00012510923],"domain_scores_gemma":[0.99536717,0.0021299548,0.00071209355,0.0005877512,0.00071396655,0.0004890683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056115026,0.0006484635,0.00063433487,0.0013302409,0.0013658194,0.0017679991,0.000948268,0.00134944,0.006554874],"category_scores_gemma":[0.0052751,0.0008055791,0.0004950051,0.0008575541,0.001804577,0.001917875,0.0019389939,0.0011900035,0.0014975609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021109804,0.0000620836,0.0010941,0.00010854256,0.000030163841,0.00034490845,0.00032599075,0.0037698208,0.021156756,0.95542353,0.0031144863,0.0143585345],"study_design_scores_gemma":[0.000098231176,0.00014977237,0.0010370043,0.00003649907,0.000029493955,0.001426874,0.00044575377,0.052119847,0.01883788,0.9186925,0.0070431167,0.00008291608],"about_ca_topic_score_codex":0.000267824,"about_ca_topic_score_gemma":0.00033795252,"teacher_disagreement_score":0.006554874,"about_ca_system_score_codex":0.00033127167,"about_ca_system_score_gemma":0.0005195363,"threshold_uncertainty_score":0.02192825},"labels":[],"label_agreement":null},{"id":"W2059478281","doi":"10.1002/jcd.20052","title":"Self‐dual codes and the (22,8,4) balanced incomplete block design","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Concordia University","funders":"Beijing Institute For Brain Disorders","keywords":"Combinatorial design; Combinatorics; Mathematics; Row; Block (permutation group theory); Dual (grammatical number); Automorphism; Binary number; Discrete mathematics; Automorphism group; Block design; Matrix (chemical analysis); Orthogonal array; Arithmetic; Computer science; Statistics","score_opus":0.01350705680339325,"score_gpt":0.20963026954122202,"score_spread":0.19612321273782876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059478281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78046775,0.0006515003,0.16677062,0.0006126267,0.00015178,0.00009726349,0.0005993965,0.00017102117,0.050478034],"genre_scores_gemma":[0.9351269,0.00028642095,0.05353691,0.00013071479,0.000033492375,0.000087843335,0.00032383556,0.000021196021,0.010452777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967754,0.000085387146,0.000023236003,0.00003983813,0.000106963096,0.000066964276],"domain_scores_gemma":[0.99935895,0.00019685269,0.0001563152,0.00010938274,0.00013038248,0.000048226935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037396047,0.00019954602,0.00019941285,0.00052278535,0.00046912272,0.0005518921,0.00022737634,0.00034535935,0.004387287],"category_scores_gemma":[0.0012687359,0.00014808326,0.00015358465,0.0003446021,0.00041864798,0.0005469616,0.00047475428,0.00029214445,0.0006322854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006189598,0.00012740942,0.006498922,0.00016346312,0.000035113226,0.00064557523,0.00035673665,0.019998083,0.04119344,0.78678155,0.005867027,0.13771378],"study_design_scores_gemma":[0.00018742564,0.00067098,0.005666724,0.0001600393,0.00008063206,0.0027214922,0.00036082373,0.1537842,0.07073908,0.6712788,0.094252974,0.00009687684],"about_ca_topic_score_codex":0.0004490324,"about_ca_topic_score_gemma":0.0009365286,"teacher_disagreement_score":0.004387287,"about_ca_system_score_codex":0.0003924703,"about_ca_system_score_gemma":0.00041695056,"threshold_uncertainty_score":0.0146769285},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.691989,0.0011726606,0.17836586,0.002291077,0.00032560984,0.000043706503,0.00026265322,0.00023355882,0.12531589],"genre_scores_gemma":[0.9725752,0.0005318619,0.01687238,0.00039081305,0.00030185236,0.00006201112,0.00013529368,0.00011278904,0.009017708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990458,0.00033520162,0.000037928425,0.00013513502,0.00026197583,0.0001839381],"domain_scores_gemma":[0.99689937,0.0017629936,0.00037795666,0.00035330994,0.00031422137,0.00029226678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073408,0.00066301617,0.00051018037,0.0030196558,0.0011862377,0.0029239014,0.0006646316,0.0014979579,0.006029677],"category_scores_gemma":[0.004229866,0.00051542016,0.00043541077,0.001315379,0.0028553186,0.002657651,0.0014375993,0.0010714624,0.00065123563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051572017,0.000016340819,0.00021001017,0.000014607013,0.0000028841694,0.000058029505,0.00011611973,0.0012389903,0.0025524937,0.9913229,0.0004970487,0.003918987],"study_design_scores_gemma":[0.000016665952,0.000016172402,0.00032105675,0.00002390737,0.000005400827,0.00018541193,0.00011514245,0.018920453,0.0011002799,0.97779626,0.0014774626,0.00002171955],"about_ca_topic_score_codex":0.0005461476,"about_ca_topic_score_gemma":0.0005657549,"teacher_disagreement_score":0.006029677,"about_ca_system_score_codex":0.0007696383,"about_ca_system_score_gemma":0.00047117367,"threshold_uncertainty_score":0.020171225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08551003,0.0031943803,0.8702436,0.00092592154,0.0001455085,0.000051727275,0.00032087872,0.00045795218,0.039150015],"genre_scores_gemma":[0.9529372,0.0016530569,0.04177847,0.00018546016,0.00015480739,0.00013106072,0.0001435071,0.00011672065,0.0028996826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979388,0.0006061154,0.00005754151,0.0001851363,0.0008089175,0.00040343194],"domain_scores_gemma":[0.98579943,0.01160249,0.00046416686,0.00068316073,0.0012572356,0.00019354484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021252604,0.0011347785,0.0008916135,0.0015506174,0.0007696577,0.0015755369,0.0015460515,0.0008145684,0.0029053867],"category_scores_gemma":[0.014006893,0.0003884827,0.0004215299,0.0013661023,0.0022404513,0.002437588,0.002031858,0.002080544,0.00042856415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012574952,0.00006531874,0.0006336113,0.00031437966,0.000045871253,0.0002069871,0.00019540262,0.54202193,0.013256826,0.41210142,0.002398393,0.028634112],"study_design_scores_gemma":[0.0000037639202,0.000016881788,0.00023648207,0.000027541908,0.0000082288525,0.000050199582,0.0000232566,0.91441137,0.002927288,0.081380084,0.0008958269,0.0000191656],"about_ca_topic_score_codex":0.002460115,"about_ca_topic_score_gemma":0.002075669,"teacher_disagreement_score":0.0029053867,"about_ca_system_score_codex":0.0020992714,"about_ca_system_score_gemma":0.0012954805,"threshold_uncertainty_score":0.015231371},"labels":[],"label_agreement":null},{"id":"W2060964556","doi":"10.1002/1520-6610(2001)9:1<72::aid-jcd6>3.0.co;2-m","title":"Bush-type Hadamard matrices and symmetric designs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hadamard transform; Combinatorics; Integer (computer science); Hadamard matrix; Block (permutation group theory); Class (philosophy); Type (biology); Matrix (chemical analysis); Order (exchange); Point (geometry); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.022920587970493445,"score_gpt":0.22988340870295726,"score_spread":0.2069628207324638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060964556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12946498,0.00034696408,0.8469614,0.00020265604,0.00009068076,0.00013422404,0.00014052333,0.0002678644,0.022390723],"genre_scores_gemma":[0.6569799,0.0002826834,0.33313337,0.00019592984,0.00007721118,0.00027892843,0.00021114534,0.000048625618,0.0087922085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985051,0.0005688054,0.000101086,0.00025423855,0.00041473805,0.0001561136],"domain_scores_gemma":[0.99691296,0.0010698793,0.0006216235,0.00072408316,0.000494943,0.00017642774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429987,0.00053137925,0.00037853577,0.00072639826,0.00047753283,0.0009491818,0.00042497818,0.0007138865,0.004164527],"category_scores_gemma":[0.0038300392,0.00035934776,0.00044914157,0.0006330138,0.0013819226,0.0012348426,0.00064503547,0.0008951959,0.0007672485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039535185,0.0000684453,0.0009633179,0.00012212113,0.000030489924,0.00022590774,0.0002149175,0.029982936,0.030908259,0.8603284,0.0015681973,0.07519168],"study_design_scores_gemma":[0.00019502416,0.00091909076,0.0008610312,0.00006428896,0.000036562375,0.0010660042,0.00012480283,0.1607126,0.03847121,0.7750486,0.022419699,0.000080983526],"about_ca_topic_score_codex":0.0003879566,"about_ca_topic_score_gemma":0.00068199506,"teacher_disagreement_score":0.004164527,"about_ca_system_score_codex":0.00071293296,"about_ca_system_score_gemma":0.00060513744,"threshold_uncertainty_score":0.013931692},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2539454,0.0010379751,0.27803776,0.0035905633,0.0019975398,0.0003466154,0.003924475,0.0019076278,0.45521197],"genre_scores_gemma":[0.6888967,0.0009970702,0.13354146,0.0019544645,0.00045892177,0.0005432484,0.004557104,0.0013772881,0.16767365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900645,0.00020669532,0.000051921113,0.00021016524,0.00020945452,0.0003153558],"domain_scores_gemma":[0.997647,0.00074277347,0.00018207118,0.00045808102,0.00042019805,0.0005499227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060053664,0.0011466531,0.00088188925,0.0019869201,0.003106829,0.0035361417,0.0013271398,0.001172842,0.033984378],"category_scores_gemma":[0.0020072202,0.00089366746,0.0013781119,0.0020768612,0.0016737077,0.0026332464,0.0021421553,0.0037889834,0.005433941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001044644,0.000060896535,0.00021863199,0.00007871644,0.000015049739,0.00013438231,0.00034282313,0.0013171912,0.00259107,0.9692693,0.01219311,0.013674453],"study_design_scores_gemma":[0.000029732064,0.000017765444,0.00025364175,0.000024147343,0.000012074588,0.00016818567,0.00018874976,0.0035459823,0.0017250804,0.97528994,0.018726064,0.000018604678],"about_ca_topic_score_codex":0.0019890014,"about_ca_topic_score_gemma":0.002849777,"teacher_disagreement_score":0.033984378,"about_ca_system_score_codex":0.0016843589,"about_ca_system_score_gemma":0.0010172364,"threshold_uncertainty_score":0.113689125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040634427,0.0018740287,0.9295187,0.002029029,0.00032258272,0.00007157216,0.0004416392,0.00030756762,0.024800422],"genre_scores_gemma":[0.7319315,0.0046995184,0.21387133,0.0031602657,0.002061383,0.0013025751,0.0011409189,0.0006184497,0.041214023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961791,0.0011932454,0.00022332839,0.0009022401,0.0011336847,0.00036828037],"domain_scores_gemma":[0.9788855,0.015722385,0.00097447535,0.0009963827,0.0021750673,0.0012462316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063021244,0.0017000013,0.0027158777,0.004571609,0.0030578035,0.005424944,0.0036811715,0.002663793,0.006844967],"category_scores_gemma":[0.020937137,0.0013229751,0.0035394246,0.003439903,0.0052037295,0.012259104,0.0064046127,0.006047843,0.001006354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022898645,0.000027051223,0.0001846475,0.000060676266,0.00003251811,0.00006072113,0.00014654006,0.002749434,0.0005117097,0.9920838,0.0007808102,0.0033392673],"study_design_scores_gemma":[0.000014153649,0.000022096925,0.00011128429,0.000026573221,0.000017699722,0.00012650322,0.000035561203,0.040614117,0.0003849084,0.95689297,0.0017336801,0.000020459092],"about_ca_topic_score_codex":0.001770181,"about_ca_topic_score_gemma":0.0010617257,"teacher_disagreement_score":0.006844967,"about_ca_system_score_codex":0.002219694,"about_ca_system_score_gemma":0.001519836,"threshold_uncertainty_score":0.03332919},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1079217,0.003142566,0.6035883,0.002854136,0.00096934795,0.0008742017,0.015608569,0.001759375,0.26328182],"genre_scores_gemma":[0.60876316,0.0028125746,0.28960186,0.0020649699,0.00044111017,0.0013843456,0.01414157,0.00037582053,0.080414645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878746,0.00041675512,0.000070452894,0.00034837087,0.00019274282,0.0001841436],"domain_scores_gemma":[0.99727434,0.0014530477,0.00034157504,0.00032288517,0.0003901523,0.00021805291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776316,0.0009173047,0.00070986117,0.0024127983,0.0021847384,0.0027137126,0.0012956125,0.0019270502,0.022387408],"category_scores_gemma":[0.0045214365,0.0006464223,0.0006631982,0.0021971955,0.0012082602,0.0032874704,0.0014634667,0.0014063322,0.004228916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028679075,0.00016191165,0.0010668684,0.0006048307,0.00013086807,0.0009831941,0.00029050055,0.0049010143,0.0076780296,0.9079763,0.021694759,0.054224882],"study_design_scores_gemma":[0.00005481802,0.00004853422,0.0005813471,0.00019126802,0.00009839203,0.0010778487,0.00028257337,0.015057039,0.004087843,0.8985712,0.07990839,0.000040729912],"about_ca_topic_score_codex":0.001371797,"about_ca_topic_score_gemma":0.0023554661,"teacher_disagreement_score":0.022387408,"about_ca_system_score_codex":0.00097071606,"about_ca_system_score_gemma":0.0011131809,"threshold_uncertainty_score":0.074893355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5330342,0.00021828848,0.38750538,0.0012706489,0.00055911194,0.00014827798,0.00023088821,0.000592361,0.07644078],"genre_scores_gemma":[0.9326329,0.00017588085,0.040001504,0.00042821927,0.00026559268,0.00018670477,0.00025537948,0.00021846412,0.025835318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798167,0.0004035828,0.00016015675,0.00028324462,0.0005535157,0.0006178042],"domain_scores_gemma":[0.9954016,0.0021192126,0.0004843865,0.0008232367,0.00052865746,0.0006429103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026903078,0.00088740874,0.001243712,0.0025723162,0.0029537908,0.00406196,0.0011348601,0.0019291524,0.00669229],"category_scores_gemma":[0.0046781707,0.00084815023,0.0017012415,0.0012299166,0.0043237624,0.005963918,0.0034086313,0.0025018037,0.0011956572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009972602,0.000031061514,0.00023895418,0.00001692852,0.000008826346,0.000118833625,0.00016252795,0.00047588695,0.0029732005,0.99266887,0.0004271482,0.002778124],"study_design_scores_gemma":[0.00007306435,0.0000957258,0.00030050092,0.000015047486,0.000016491684,0.00024201254,0.00019876716,0.0056029414,0.00569219,0.9847068,0.003024697,0.000031801137],"about_ca_topic_score_codex":0.00036483275,"about_ca_topic_score_gemma":0.00050253666,"teacher_disagreement_score":0.00669229,"about_ca_system_score_codex":0.0012139538,"about_ca_system_score_gemma":0.001134959,"threshold_uncertainty_score":0.022387922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070249826,0.003608786,0.6048268,0.006112242,0.0020265013,0.000078463876,0.0009751341,0.000310471,0.31181177],"genre_scores_gemma":[0.7755485,0.0032396659,0.11944635,0.0036785551,0.0020044115,0.00026892681,0.0007522778,0.0005430476,0.09451822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985672,0.0004101276,0.00009769266,0.00027700092,0.0004175073,0.0002304338],"domain_scores_gemma":[0.99720865,0.0016008894,0.00019930299,0.00026930816,0.0005199845,0.00020179852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023577565,0.0012094105,0.0016056082,0.0027825413,0.0024591507,0.003464857,0.0018800416,0.0021335587,0.014709294],"category_scores_gemma":[0.004408041,0.0006609178,0.0015880346,0.0028041855,0.0041098436,0.008869615,0.0027504025,0.005435889,0.002342897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020399128,0.000008475551,0.00005060252,0.000026121703,0.00000593435,0.00005484665,0.00005793756,0.0003865714,0.0007314899,0.99522394,0.00149122,0.0019425151],"study_design_scores_gemma":[0.0000061430137,0.000012337696,0.00010790269,0.000013983228,0.0000077923,0.00010100776,0.000027059721,0.006250685,0.00063577254,0.98957247,0.0032463227,0.00001840318],"about_ca_topic_score_codex":0.0018416896,"about_ca_topic_score_gemma":0.0020218415,"teacher_disagreement_score":0.014709294,"about_ca_system_score_codex":0.0020412684,"about_ca_system_score_gemma":0.00095527637,"threshold_uncertainty_score":0.04920751},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24669239,0.0024614178,0.6413616,0.0025908973,0.00078172167,0.00013045211,0.0006070566,0.0006258937,0.104748584],"genre_scores_gemma":[0.8292576,0.0019932436,0.11857936,0.0005158017,0.0004663597,0.000161483,0.00051892345,0.0002583951,0.04824881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999302,0.0002542949,0.000055996123,0.00014068875,0.00012601352,0.00012100181],"domain_scores_gemma":[0.99686795,0.001675256,0.00036894117,0.00021998005,0.0003158383,0.0005519434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011356998,0.0005857395,0.0007710654,0.0023962178,0.0023741426,0.0049273223,0.00077681657,0.0010930935,0.008412412],"category_scores_gemma":[0.004290293,0.0007375804,0.00070379034,0.0021003515,0.0034912277,0.0058860946,0.0024275444,0.0018550607,0.00092115405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031341704,0.000007686213,0.00020019046,0.000024093255,0.0000032427622,0.000059032172,0.00014255824,0.0015902256,0.000267477,0.9927563,0.0007105871,0.0042072837],"study_design_scores_gemma":[0.000010830917,0.00000953378,0.00010670217,0.000026600957,0.000008541666,0.00007428914,0.00018318882,0.0064773965,0.00036639298,0.9863485,0.0063805566,0.000007417633],"about_ca_topic_score_codex":0.001943372,"about_ca_topic_score_gemma":0.0027608566,"teacher_disagreement_score":0.008412412,"about_ca_system_score_codex":0.00140534,"about_ca_system_score_gemma":0.00058931357,"threshold_uncertainty_score":0.028142333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83319765,0.00047404447,0.10173081,0.00096719124,0.000086098255,0.00010196036,0.0012599006,0.00046663522,0.06171569],"genre_scores_gemma":[0.9565739,0.00023659445,0.029560126,0.00011657071,0.000026347352,0.00006860123,0.0008056184,0.00008762407,0.0125246225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995153,0.00014879699,0.000039778064,0.00008869353,0.00009229988,0.000115055554],"domain_scores_gemma":[0.99864167,0.0007116712,0.00024704073,0.00010161125,0.00011506214,0.0001828528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043425593,0.00049580645,0.0005513171,0.0013871461,0.0018794618,0.0024384463,0.0006188157,0.0011661696,0.0098641245],"category_scores_gemma":[0.0022890465,0.00060958375,0.0004449191,0.0018988756,0.0011753628,0.0018229072,0.001202968,0.0010436091,0.00095785275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004856131,0.00007587717,0.0030953188,0.00024714033,0.000071078524,0.00065060536,0.0008798338,0.034629878,0.007949732,0.91537046,0.00782889,0.028715631],"study_design_scores_gemma":[0.00008449499,0.000087794644,0.0017437361,0.00005993198,0.000048237325,0.0006007779,0.0007616587,0.05323834,0.005337336,0.93051124,0.0074995263,0.00002701743],"about_ca_topic_score_codex":0.00111306,"about_ca_topic_score_gemma":0.00225062,"teacher_disagreement_score":0.0098641245,"about_ca_system_score_codex":0.0010040044,"about_ca_system_score_gemma":0.00078060065,"threshold_uncertainty_score":0.0329988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7675471,0.0010428702,0.14709398,0.004348412,0.001282153,0.0010673457,0.00092108443,0.0022434024,0.07445371],"genre_scores_gemma":[0.9133244,0.00031554987,0.07981053,0.000230371,0.0000828376,0.0002355958,0.00017055025,0.000070610426,0.005759478],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953485,0.000079616926,0.000017320213,0.000056256813,0.00025516856,0.00005684059],"domain_scores_gemma":[0.99933004,0.00027883332,0.000089241,0.00009128091,0.00010038899,0.00011025585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085309206,0.00046133445,0.00031028138,0.00023949725,0.0006919671,0.00054636056,0.000977762,0.00089674065,0.005618547],"category_scores_gemma":[0.00066829013,0.00027072142,0.00025830744,0.0001918609,0.0011357053,0.00050512305,0.00061732007,0.0011407156,0.0008837268],"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.00028233527,0.00035596243,0.0008356897,0.00024183594,0.000043244734,0.0007300477,0.00026590182,0.0013588108,0.93703705,0.041318227,0.0045191655,0.013011659],"study_design_scores_gemma":[0.00028123183,0.00097567705,0.0013263533,0.000026024469,0.000021653515,0.00051879004,0.00008655964,0.018837022,0.95722395,0.0032448217,0.017411772,0.00004605714],"about_ca_topic_score_codex":0.0005855168,"about_ca_topic_score_gemma":0.00065412006,"teacher_disagreement_score":0.005618547,"about_ca_system_score_codex":0.00031810778,"about_ca_system_score_gemma":0.00051338144,"threshold_uncertainty_score":0.018795907},"labels":[],"label_agreement":null},{"id":"W2063916523","doi":"10.1002/jcd.20130","title":"The spectrum of equitable, 4‐chromatic Steiner quadruple systems","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Hypergraph; Order (exchange); Existential quantification; Set (abstract data type); Spectrum (functional analysis); Discrete mathematics; Computer science; Physics","score_opus":0.009154970012086322,"score_gpt":0.1990968129694868,"score_spread":0.1899418429574005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063916523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492596,0.00023971379,0.027276898,0.00021376983,0.000021872123,0.000023362336,0.00020589044,0.00009120862,0.02266778],"genre_scores_gemma":[0.9925884,0.00010755779,0.0048691337,0.000040400962,0.000014339273,0.00003135428,0.00014029758,0.000014911282,0.0021936568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945265,0.00010471016,0.000037576203,0.00009305123,0.00015228207,0.00015978335],"domain_scores_gemma":[0.99889416,0.00038029603,0.00020976817,0.00015001153,0.00016694698,0.00019883554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000507393,0.00031548744,0.00032077744,0.0016779988,0.0015374442,0.0013413088,0.00051720935,0.0004998613,0.0053364104],"category_scores_gemma":[0.0013284354,0.0003831179,0.00024404425,0.0009829946,0.0012768711,0.0012810109,0.0013898013,0.00039782058,0.00040612862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034772142,0.00007062597,0.004445076,0.00011172142,0.00003537259,0.0005892625,0.0008893955,0.021457424,0.021379482,0.92971134,0.0021105553,0.018851977],"study_design_scores_gemma":[0.0001343554,0.00018818893,0.0036160785,0.000072370654,0.00003855644,0.000983684,0.0009834345,0.07196577,0.011784468,0.89823747,0.011941906,0.000053758587],"about_ca_topic_score_codex":0.0007362268,"about_ca_topic_score_gemma":0.0008675076,"teacher_disagreement_score":0.0053364104,"about_ca_system_score_codex":0.0009166796,"about_ca_system_score_gemma":0.00032273112,"threshold_uncertainty_score":0.017852068},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49582174,0.00032979442,0.4280171,0.0005870828,0.00012206654,0.0001758308,0.00057841983,0.0005877416,0.07378025],"genre_scores_gemma":[0.90840364,0.0003576417,0.068986796,0.00023206518,0.00007004511,0.00015266394,0.000726155,0.00034192798,0.020728964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991295,0.00020848998,0.000060661605,0.00014744361,0.0002090943,0.00024482067],"domain_scores_gemma":[0.99740124,0.001071798,0.00025299005,0.0006948577,0.00030724108,0.00027186016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008026758,0.00055955997,0.00092140597,0.0012634889,0.0016576414,0.002205349,0.0010199302,0.0010964391,0.012648598],"category_scores_gemma":[0.0035392935,0.0006132208,0.0005623483,0.0019124327,0.0013238286,0.0042888965,0.0023875092,0.0019197526,0.0011416705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026762346,0.00009804651,0.0007033041,0.00013579502,0.00002166203,0.00031261952,0.00060529035,0.013620729,0.010632339,0.9323165,0.0034865702,0.037799522],"study_design_scores_gemma":[0.000034432967,0.000045765206,0.00038410848,0.000029473853,0.000027710921,0.0002581714,0.00024800227,0.031823467,0.0055553634,0.9550305,0.006544158,0.000018793184],"about_ca_topic_score_codex":0.00082218694,"about_ca_topic_score_gemma":0.001785038,"teacher_disagreement_score":0.012648598,"about_ca_system_score_codex":0.0010866377,"about_ca_system_score_gemma":0.0006146023,"threshold_uncertainty_score":0.042313814},"labels":[],"label_agreement":null},{"id":"W2064625927","doi":"10.1002/jcd.20132","title":"There is no 2‐(22, 8, 4) block design","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Lethbridge; Concordia University","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Block design; Arithmetic","score_opus":0.01326745694562284,"score_gpt":0.203416123957026,"score_spread":0.19014866701140315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064625927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42554384,0.0013317122,0.40275794,0.0027157369,0.0010772584,0.00062598835,0.0010148281,0.0012709559,0.16366176],"genre_scores_gemma":[0.7856817,0.0003053486,0.17468877,0.0010190661,0.00014440893,0.00066041155,0.00069366914,0.00016177261,0.036644857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997924,0.00072934333,0.00015302263,0.0003509494,0.00050034473,0.0003423662],"domain_scores_gemma":[0.99784136,0.00080724835,0.00035240702,0.00041893695,0.00041513916,0.00016480293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110163,0.0006711211,0.000760701,0.0005862463,0.0010913559,0.0013559879,0.00083716173,0.0015405663,0.028234262],"category_scores_gemma":[0.0036721618,0.0005891125,0.0005860075,0.0004475257,0.00081083644,0.001817167,0.0011064643,0.0009332493,0.005576563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030148576,0.0006671515,0.007146973,0.0013937283,0.0003891631,0.0016152074,0.00052108336,0.0334835,0.108265765,0.47709468,0.0269695,0.33943847],"study_design_scores_gemma":[0.0016817439,0.0061070337,0.0036523007,0.0005301526,0.00044448324,0.0037886272,0.00051834295,0.14997597,0.08107272,0.48057106,0.2713681,0.00028958626],"about_ca_topic_score_codex":0.00046221213,"about_ca_topic_score_gemma":0.0009746598,"teacher_disagreement_score":0.028234262,"about_ca_system_score_codex":0.00062558276,"about_ca_system_score_gemma":0.0011708819,"threshold_uncertainty_score":0.09445304},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1269928,0.0015508515,0.82471067,0.0017311701,0.00024155981,0.00035338083,0.0012609939,0.0014724793,0.041686203],"genre_scores_gemma":[0.59004384,0.00091217924,0.39234284,0.0011998526,0.00027072057,0.0011456971,0.0010659677,0.00028923288,0.012729706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99251854,0.0038983957,0.00042104642,0.0009407928,0.0013225555,0.0008986565],"domain_scores_gemma":[0.9791812,0.012219096,0.001737503,0.0047208206,0.001579796,0.0005616395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040998706,0.0020707282,0.0021280795,0.0015173359,0.0014068057,0.0025230893,0.0023794703,0.0030150267,0.008992888],"category_scores_gemma":[0.017044215,0.0016092714,0.0012741061,0.0016179279,0.0015380761,0.0030621614,0.0030727584,0.0021607988,0.0024560555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040994533,0.00041815138,0.0017891816,0.0009936433,0.0003460674,0.00034132003,0.0006397057,0.10386119,0.07578305,0.6315702,0.009806852,0.17035119],"study_design_scores_gemma":[0.0012231339,0.0017105574,0.0012106785,0.0004656611,0.00026327296,0.00080438546,0.00018363085,0.24780087,0.06360209,0.6622089,0.020320289,0.00020654227],"about_ca_topic_score_codex":0.00052107597,"about_ca_topic_score_gemma":0.0012344862,"teacher_disagreement_score":0.008992888,"about_ca_system_score_codex":0.0014062439,"about_ca_system_score_gemma":0.002720459,"threshold_uncertainty_score":0.030084193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59818614,0.0011414414,0.3108814,0.00076715637,0.0001371606,0.0001998269,0.001246738,0.00091942906,0.086520806],"genre_scores_gemma":[0.8992213,0.00065223215,0.082790695,0.00018218286,0.00008492247,0.00014542653,0.0013215811,0.00014435977,0.015457361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942434,0.00008832935,0.000028709723,0.00014893024,0.00014598324,0.0001638164],"domain_scores_gemma":[0.9983113,0.00061621907,0.00028425947,0.00018436043,0.00024774292,0.0003560673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039239004,0.00052327715,0.00040533667,0.0020545577,0.0010496095,0.0018303599,0.0005459298,0.0007577608,0.011986556],"category_scores_gemma":[0.0024763625,0.0004714073,0.0004675121,0.000993706,0.0014899189,0.002531817,0.0012244083,0.0013389762,0.00095122104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002888033,0.00006546932,0.001288736,0.00020646909,0.000030787298,0.00065846305,0.0005701306,0.015454452,0.010459295,0.9453432,0.0032709027,0.022363268],"study_design_scores_gemma":[0.000049968785,0.000077904784,0.0013857172,0.000070030146,0.0000273979,0.0007771042,0.0005881056,0.040543232,0.0042859754,0.94153774,0.010620388,0.000036371304],"about_ca_topic_score_codex":0.0010701101,"about_ca_topic_score_gemma":0.00226851,"teacher_disagreement_score":0.011986556,"about_ca_system_score_codex":0.0006055889,"about_ca_system_score_gemma":0.00058706076,"threshold_uncertainty_score":0.040099025},"labels":[],"label_agreement":null},{"id":"W2065282626","doi":"10.1002/jcd.20019","title":"Upper bounds on the general covering number <i>C</i><sub>λ</sub>(<i>v</i>, <i>k</i>, <i>t</i>, <i>m</i>)","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Block (permutation group theory); Lambda; Physics; Mathematical analysis","score_opus":0.011309506145559475,"score_gpt":0.21135197271658804,"score_spread":0.20004246657102856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065282626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5865705,0.0064018886,0.33201212,0.0022394012,0.00016689338,0.00027516606,0.0015711405,0.0015448361,0.069218054],"genre_scores_gemma":[0.9044652,0.0014126817,0.0893629,0.00021809178,0.0002031149,0.00030635,0.0008573043,0.00025233766,0.0029219373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954894,0.001094116,0.00023544057,0.00092201,0.0011571546,0.0011017973],"domain_scores_gemma":[0.9628809,0.026353838,0.0026899183,0.0047023427,0.0011405537,0.002232458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046362244,0.0014157582,0.0017030371,0.0023506025,0.0020607852,0.0038540359,0.002810327,0.0017288686,0.00617833],"category_scores_gemma":[0.024847286,0.0012570746,0.0011733784,0.0027506824,0.0023130872,0.004802525,0.0036152985,0.002418844,0.0010300595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004625967,0.0008568595,0.029000517,0.0013022382,0.0004924995,0.00089588494,0.0011642136,0.37599832,0.07673304,0.3380736,0.022154927,0.14870194],"study_design_scores_gemma":[0.00020596289,0.0006604623,0.011260512,0.0002665185,0.0003532265,0.0022753638,0.0003044763,0.6628151,0.039150875,0.2661149,0.016414281,0.00017840487],"about_ca_topic_score_codex":0.0009942311,"about_ca_topic_score_gemma":0.0017298541,"teacher_disagreement_score":0.00617833,"about_ca_system_score_codex":0.0038924317,"about_ca_system_score_gemma":0.0010107259,"threshold_uncertainty_score":0.028241754},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32625496,0.0004960723,0.14740105,0.0033134543,0.00048165282,0.00016417493,0.0004981905,0.0009418103,0.5204486],"genre_scores_gemma":[0.9599851,0.00020894657,0.020022288,0.0005450419,0.000115144365,0.00017806716,0.000474068,0.00028398013,0.018187346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786395,0.00058715034,0.00011795647,0.00039565313,0.0004517333,0.0005835018],"domain_scores_gemma":[0.993238,0.0036930614,0.00046428706,0.0009591363,0.0006103273,0.0010351641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015344826,0.00083302945,0.0010151037,0.0024399396,0.004483291,0.0061232485,0.0020580618,0.004050864,0.02500054],"category_scores_gemma":[0.013918031,0.00094229716,0.00093732757,0.0015712468,0.005703911,0.007460721,0.004611312,0.0043210145,0.0029885068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001596249,0.00007249497,0.0006030616,0.0000530201,0.000008696656,0.00094556634,0.00046984493,0.0011025226,0.0009854339,0.9868875,0.0034165669,0.005295721],"study_design_scores_gemma":[0.00003884595,0.000009084159,0.00012814793,0.00003562978,0.000009383808,0.0005239396,0.00037429103,0.004981145,0.00082927756,0.9908524,0.002202342,0.000015481544],"about_ca_topic_score_codex":0.00090071786,"about_ca_topic_score_gemma":0.0009847601,"teacher_disagreement_score":0.02500054,"about_ca_system_score_codex":0.0009193823,"about_ca_system_score_gemma":0.0009481871,"threshold_uncertainty_score":0.08363515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01776321,0.0461379,0.90685546,0.005080748,0.0005731382,0.00005127193,0.00015377745,0.0003772346,0.023007382],"genre_scores_gemma":[0.46642852,0.03966503,0.48307985,0.0023440572,0.0023122763,0.00019163347,0.00031161547,0.00022745451,0.00543961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98760366,0.006262554,0.0006261079,0.0025906593,0.0025037488,0.00041324776],"domain_scores_gemma":[0.8641455,0.11559786,0.004198351,0.010215965,0.0051488644,0.00069341826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023967946,0.0008279857,0.0018797411,0.0019361473,0.0010049983,0.0029590183,0.0022697365,0.0023976204,0.005363507],"category_scores_gemma":[0.089448966,0.0012381378,0.0007936202,0.0021243829,0.004358145,0.006740302,0.002614584,0.002588766,0.0009613206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042792532,0.00004888428,0.0016883955,0.0008766844,0.000115468734,0.00016278685,0.0002501409,0.016310418,0.001701138,0.7486808,0.0023514233,0.22738592],"study_design_scores_gemma":[0.00012248862,0.00018907164,0.00057651027,0.00033519935,0.000116999916,0.0007151424,0.000063914944,0.031869262,0.0037445528,0.9260525,0.036134608,0.00007968078],"about_ca_topic_score_codex":0.0005539516,"about_ca_topic_score_gemma":0.00053698453,"teacher_disagreement_score":0.023967946,"about_ca_system_score_codex":0.0016015772,"about_ca_system_score_gemma":0.0020302644,"threshold_uncertainty_score":0.12675613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80641115,0.004242187,0.12817283,0.005932372,0.0006336493,0.00005266457,0.0011132605,0.00017268954,0.05326926],"genre_scores_gemma":[0.9840808,0.0011753184,0.0074362685,0.00036112458,0.0008622623,0.000056367873,0.00037512003,0.00004391446,0.0056087696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988117,0.00040607364,0.000055345936,0.00022882262,0.00028206498,0.00021597838],"domain_scores_gemma":[0.9928039,0.0043271575,0.0008212148,0.00034065454,0.0006376668,0.0010694349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015119683,0.0008084498,0.0009774775,0.0035143176,0.0014105942,0.004001768,0.0013671526,0.0010501047,0.0057283286],"category_scores_gemma":[0.0060183425,0.000510212,0.0005440367,0.0016611022,0.004775447,0.006296662,0.0028564308,0.0023925696,0.0005104182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012541957,0.00005203558,0.0010560439,0.000058618713,0.000021712745,0.000063208514,0.00043163187,0.0030069065,0.0012665744,0.9869197,0.0017515812,0.005246689],"study_design_scores_gemma":[0.00001499043,0.000028670303,0.0005853044,0.000019188015,0.000008639589,0.000089859925,0.00013056076,0.014097451,0.00052412506,0.98305583,0.0014147147,0.000030628456],"about_ca_topic_score_codex":0.00067601935,"about_ca_topic_score_gemma":0.0005671073,"teacher_disagreement_score":0.0057283286,"about_ca_system_score_codex":0.0010877122,"about_ca_system_score_gemma":0.0007591629,"threshold_uncertainty_score":0.019163191},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060709573,0.00046171693,0.88337153,0.0017217541,0.00020081915,0.00019618534,0.00023068361,0.00056645996,0.052541178],"genre_scores_gemma":[0.5961949,0.0012702537,0.35354427,0.00085339823,0.00028329162,0.00052650325,0.00058153283,0.00041676254,0.046329085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908435,0.00037117224,0.00003926985,0.00010187076,0.00025614194,0.00014712795],"domain_scores_gemma":[0.9982332,0.00084444234,0.00016736543,0.0004703211,0.0001781548,0.000106529835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009775474,0.0007308968,0.0004841951,0.0009525896,0.0016249229,0.0018754989,0.00085198117,0.0014148435,0.0060392586],"category_scores_gemma":[0.0035449653,0.0006174869,0.000796372,0.0014213983,0.0020850196,0.0026309509,0.002093993,0.0025094862,0.0019449819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047524238,0.000019350651,0.000109025226,0.000034060507,0.0000053844233,0.00006824902,0.00015711944,0.0060271756,0.0019131012,0.9736242,0.002227533,0.015767206],"study_design_scores_gemma":[0.000031978856,0.000051980667,0.00008122383,0.000039730905,0.000012984848,0.00017933596,0.000058567304,0.02779824,0.0061084894,0.94639075,0.01922172,0.00002494802],"about_ca_topic_score_codex":0.0006319977,"about_ca_topic_score_gemma":0.0008723227,"teacher_disagreement_score":0.0060392586,"about_ca_system_score_codex":0.0013698159,"about_ca_system_score_gemma":0.0010634597,"threshold_uncertainty_score":0.020203352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21278541,0.000438713,0.6381098,0.0011894152,0.0015648151,0.00045996858,0.0010696884,0.0022265282,0.14215568],"genre_scores_gemma":[0.61286896,0.0006708282,0.3107314,0.00050541747,0.00023623423,0.00066496123,0.0011568432,0.0013130785,0.0718523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935585,0.000074752905,0.000035752906,0.00015388394,0.0001809406,0.0001987562],"domain_scores_gemma":[0.9991047,0.00015543266,0.000109855806,0.0004047429,0.000116618365,0.00010875533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031544382,0.0010926276,0.000993619,0.0008808744,0.0012325929,0.0020756284,0.0012784341,0.0010844117,0.015343137],"category_scores_gemma":[0.0017796948,0.00059847336,0.00090887194,0.0012128553,0.0022875858,0.00232077,0.0033994836,0.0017358466,0.0060014674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030185254,0.00038295356,0.002606073,0.000655586,0.00012388463,0.0022591685,0.0011316239,0.023591837,0.19964997,0.42996868,0.023184547,0.3134272],"study_design_scores_gemma":[0.0007856148,0.0016317856,0.0027075587,0.000300944,0.00022031357,0.0036652486,0.002312662,0.10490286,0.23526269,0.36906686,0.2788219,0.00032158406],"about_ca_topic_score_codex":0.00056638883,"about_ca_topic_score_gemma":0.0007400919,"teacher_disagreement_score":0.015343137,"about_ca_system_score_codex":0.00033426745,"about_ca_system_score_gemma":0.0006900997,"threshold_uncertainty_score":0.051327884},"labels":[],"label_agreement":null},{"id":"W2068073986","doi":"10.1002/jcd.20024","title":"On the maximum number of different ordered pairs of symbols in sets of latin squares","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Latin square; Prime power; Order (exchange); Set (abstract data type); Prime (order theory); Discrete mathematics; Computer science","score_opus":0.018857131427791086,"score_gpt":0.2324954432858922,"score_spread":0.21363831185810112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068073986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8028343,0.001661012,0.18407735,0.0015363606,0.00009098864,0.00012573664,0.00043166545,0.0006886754,0.008553937],"genre_scores_gemma":[0.9096978,0.00047939774,0.087515265,0.00019554634,0.00013525516,0.00013509725,0.000355352,0.00014575379,0.0013405052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927168,0.0036478736,0.00046073797,0.0012137126,0.0012662279,0.00069458975],"domain_scores_gemma":[0.9109154,0.072448395,0.007174338,0.005379836,0.0020663452,0.0020157737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055424115,0.0010983256,0.0022116303,0.0015867423,0.0021708938,0.004063556,0.003216978,0.0019991419,0.0044572176],"category_scores_gemma":[0.04044688,0.0013038104,0.0010536811,0.0022757505,0.0031703927,0.007484508,0.003110225,0.0017595909,0.0006952964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055850917,0.0009028399,0.027333904,0.0013469472,0.00061330607,0.0010444688,0.001111728,0.5676016,0.07577579,0.14428687,0.005743843,0.1686536],"study_design_scores_gemma":[0.00036226117,0.0011588455,0.0049388604,0.00014417424,0.0003296023,0.0022249587,0.000771779,0.75523436,0.0762497,0.1535348,0.0049170586,0.00013359368],"about_ca_topic_score_codex":0.0003300747,"about_ca_topic_score_gemma":0.0005959064,"teacher_disagreement_score":0.0055424115,"about_ca_system_score_codex":0.0016759576,"about_ca_system_score_gemma":0.000899189,"threshold_uncertainty_score":0.029311419},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09253828,0.14209929,0.4322566,0.018581197,0.011191769,0.00040903004,0.00040768765,0.0004781512,0.30203792],"genre_scores_gemma":[0.58120817,0.055888932,0.27085668,0.0047502755,0.005630614,0.00048434723,0.00020089738,0.00008510572,0.080895014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846184,0.00056861615,0.00006111768,0.00021225019,0.00058668887,0.00010958648],"domain_scores_gemma":[0.9989987,0.00044749104,0.00014613678,0.0001397032,0.00019001971,0.000077929064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273437,0.00033201752,0.00032850346,0.00086204946,0.00078713056,0.0023903672,0.0005830898,0.0016369091,0.0027684146],"category_scores_gemma":[0.0033819957,0.00021030799,0.00018777861,0.0019901555,0.0024824196,0.002474753,0.0013471602,0.0016900644,0.000705212],"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.000119288234,0.00005115573,0.0015946956,0.00019367988,0.000026980786,0.00019256872,0.00021821668,0.007215071,0.006818774,0.80940175,0.00504604,0.16912183],"study_design_scores_gemma":[0.000033409502,0.00041136524,0.004346999,0.0003226319,0.0000540855,0.0010429634,0.00034967062,0.035187747,0.0087351315,0.47418737,0.47523722,0.000091341164],"about_ca_topic_score_codex":0.0022741584,"about_ca_topic_score_gemma":0.0022218693,"teacher_disagreement_score":0.0027684146,"about_ca_system_score_codex":0.0013329503,"about_ca_system_score_gemma":0.0011353234,"threshold_uncertainty_score":0.009671271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6762258,0.00118231,0.079945296,0.00160598,0.00038391657,0.0003529534,0.0026194386,0.00047572135,0.23720852],"genre_scores_gemma":[0.88784355,0.00068768195,0.031985182,0.00040658435,0.00011766613,0.00025261397,0.0025528553,0.0003541457,0.07579964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996942,0.00003179487,0.000016670721,0.000069085836,0.00006495437,0.0001233236],"domain_scores_gemma":[0.9993285,0.00014446705,0.00012077352,0.000079688594,0.00016900366,0.0001575089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021984267,0.00050540816,0.00034247967,0.0022667462,0.001663146,0.0028772878,0.00076622784,0.0007537564,0.016833033],"category_scores_gemma":[0.0009742396,0.0004817537,0.0005427894,0.0014516582,0.0011084377,0.0016137618,0.00086392596,0.0011735567,0.0022854742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013390082,0.000059331152,0.00069028424,0.00008734241,0.000010895754,0.00015602158,0.0006639924,0.0014412823,0.005663114,0.96908915,0.0056993035,0.016305367],"study_design_scores_gemma":[0.000037928497,0.000036748872,0.0020575242,0.000076392214,0.000026004112,0.00027236342,0.00062446034,0.011141955,0.0042669256,0.96147776,0.019951655,0.000030304886],"about_ca_topic_score_codex":0.0024824538,"about_ca_topic_score_gemma":0.0027738146,"teacher_disagreement_score":0.016833033,"about_ca_system_score_codex":0.0010740868,"about_ca_system_score_gemma":0.0006347709,"threshold_uncertainty_score":0.056312144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76975167,0.00031201303,0.13367814,0.0010067458,0.00015852418,0.00011948917,0.0010573415,0.0007381912,0.09317788],"genre_scores_gemma":[0.96335274,0.0001233007,0.02194142,0.00020891191,0.00005410823,0.00010701013,0.000465625,0.0001132192,0.013633693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901235,0.00030723182,0.000042383534,0.00015031356,0.00019591089,0.00029174748],"domain_scores_gemma":[0.9978295,0.0011424362,0.00018633428,0.0003278487,0.0002822163,0.00023165492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083710277,0.00031458578,0.0005084855,0.0009117085,0.0016843267,0.0014999255,0.00083372864,0.00070553937,0.010656477],"category_scores_gemma":[0.0025436166,0.00035680918,0.0003982237,0.00081285794,0.0011763161,0.0012028877,0.0012783775,0.000901704,0.0013870609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000577514,0.000095604075,0.001338259,0.000062971754,0.000018486775,0.00033969758,0.00042049892,0.0023709547,0.015148655,0.9529933,0.004452403,0.022181742],"study_design_scores_gemma":[0.00026483688,0.00031115132,0.0015701252,0.0000634041,0.000051108535,0.001016258,0.00046676546,0.022843951,0.025346424,0.91837597,0.029598458,0.0000915649],"about_ca_topic_score_codex":0.0007605876,"about_ca_topic_score_gemma":0.00086490606,"teacher_disagreement_score":0.010656477,"about_ca_system_score_codex":0.00096282555,"about_ca_system_score_gemma":0.00079420535,"threshold_uncertainty_score":0.03564948},"labels":[],"label_agreement":null},{"id":"W2069219864","doi":"10.1002/jcd.10033","title":"Slope packings and coverings, and generic algorithms for the discrete logarithm problem","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Logarithm; Prime (order theory); Affine transformation; Order (exchange); Combinatorics; Discrete logarithm; Point (geometry); Set (abstract data type); Plane (geometry); Algorithm; Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.026660759426930178,"score_gpt":0.21846771219749944,"score_spread":0.19180695277056925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069219864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5575461,0.0009000095,0.42265844,0.0011045081,0.000053885742,0.00030959919,0.0006060458,0.0009020624,0.015919443],"genre_scores_gemma":[0.79947835,0.0006039986,0.19527805,0.00013920666,0.00006887754,0.00021089494,0.0011475311,0.000110805006,0.002962238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983469,0.0005412247,0.00016432069,0.00040623185,0.0003081333,0.0002331829],"domain_scores_gemma":[0.99521977,0.0023349286,0.0007212166,0.0012866484,0.00018202772,0.00025543282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015599048,0.0007079891,0.0009982641,0.0010920251,0.0014653619,0.0033861045,0.0014682302,0.0013613312,0.0037526975],"category_scores_gemma":[0.009602647,0.00049421587,0.0011144446,0.0027334108,0.0014537978,0.0064407256,0.0025109535,0.001184386,0.00051115704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010111977,0.0004439352,0.012540801,0.0006114004,0.00017380067,0.00046874414,0.0017497826,0.115754195,0.012076681,0.5749098,0.007902175,0.27235743],"study_design_scores_gemma":[0.00018672763,0.00024299398,0.0018474543,0.000067023946,0.00008904806,0.0011961861,0.0004989202,0.32731867,0.009101906,0.6501999,0.009206605,0.00004452308],"about_ca_topic_score_codex":0.00041088808,"about_ca_topic_score_gemma":0.00051272317,"teacher_disagreement_score":0.0037526975,"about_ca_system_score_codex":0.0016073762,"about_ca_system_score_gemma":0.0007712499,"threshold_uncertainty_score":0.0125540495},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32476777,0.014595194,0.36997956,0.023405066,0.0017561911,0.00043963292,0.0039231093,0.0034808053,0.25765276],"genre_scores_gemma":[0.87836057,0.0070356308,0.073018774,0.0028969825,0.0016476666,0.00083308935,0.0029092461,0.0010836446,0.032214247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99147063,0.0016042968,0.00037715308,0.00092368195,0.003443427,0.00218084],"domain_scores_gemma":[0.92627996,0.057689045,0.0022181224,0.0067627206,0.004029376,0.0030207715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005759072,0.004559519,0.003856056,0.0069657117,0.004572054,0.011066779,0.007092633,0.0038964825,0.017660638],"category_scores_gemma":[0.040380992,0.001989401,0.0018284502,0.009692769,0.00754847,0.0142609505,0.01293205,0.0099757025,0.0054760124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021138084,0.00033628603,0.0026074743,0.00064106315,0.00015213854,0.00046377935,0.0013313454,0.054677114,0.0075840633,0.827515,0.022565527,0.0800124],"study_design_scores_gemma":[0.00014237023,0.0002055129,0.0006582979,0.00023918321,0.00013116887,0.00040098492,0.00024012895,0.08020595,0.0050768107,0.9012691,0.011308591,0.000121954465],"about_ca_topic_score_codex":0.0039345534,"about_ca_topic_score_gemma":0.0045491015,"teacher_disagreement_score":0.017660638,"about_ca_system_score_codex":0.009388389,"about_ca_system_score_gemma":0.0056334,"threshold_uncertainty_score":0.06811786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59789515,0.0009419634,0.2897226,0.002409741,0.00033181577,0.0001402485,0.0006879279,0.0004249983,0.10744555],"genre_scores_gemma":[0.9721143,0.00027979547,0.013354677,0.00020874912,0.0002579183,0.000099365745,0.00028792024,0.00006296717,0.013334238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.000156934,0.000029744606,0.00013397365,0.00020589825,0.00013670532],"domain_scores_gemma":[0.9975097,0.00095563487,0.00044864113,0.00019245662,0.0004264241,0.00046712955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072080543,0.00041586903,0.00063253194,0.0015285661,0.0013221243,0.0022597194,0.0010159134,0.0009354598,0.00857384],"category_scores_gemma":[0.0045527564,0.00029512533,0.00033447784,0.0013500083,0.0013726961,0.0015185486,0.00076985836,0.0014903729,0.0011270844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012544707,0.000080287275,0.0009151038,0.00004291497,0.00002238383,0.00013413084,0.00020855581,0.007096239,0.0073635923,0.9676427,0.0034757266,0.012892916],"study_design_scores_gemma":[0.000057384124,0.000083302366,0.0011089677,0.00001674084,0.000012582211,0.0003447368,0.00010691564,0.0903358,0.0025913422,0.89952976,0.00575021,0.00006220339],"about_ca_topic_score_codex":0.0013401896,"about_ca_topic_score_gemma":0.0010902606,"teacher_disagreement_score":0.00857384,"about_ca_system_score_codex":0.00074440415,"about_ca_system_score_gemma":0.0007954206,"threshold_uncertainty_score":0.028682292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6738259,0.000566176,0.2791271,0.001034466,0.00012569217,0.00032046778,0.0003447176,0.0010372523,0.04361825],"genre_scores_gemma":[0.9070809,0.000180291,0.08649848,0.0001796604,0.00005261729,0.000232243,0.00011276041,0.000051849383,0.005611176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986156,0.00060495746,0.000078971665,0.00016784377,0.00022898594,0.00030362426],"domain_scores_gemma":[0.99400324,0.0022494665,0.0011244792,0.0017211997,0.00048131045,0.00042025765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020762228,0.0007695738,0.00081763865,0.0012144962,0.0010830433,0.0012771776,0.00095713895,0.0013947543,0.0050376477],"category_scores_gemma":[0.0084911585,0.00058319815,0.00040588784,0.0010914884,0.0010918675,0.0016475705,0.0013535841,0.0009702053,0.0010628134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0059367395,0.0004240086,0.009371364,0.0005081729,0.00015151112,0.0009434575,0.0007551299,0.051915374,0.09610306,0.69759333,0.0055093192,0.13078858],"study_design_scores_gemma":[0.0015473691,0.003937341,0.003831116,0.0002301656,0.00025892977,0.0028600257,0.00038025164,0.18436782,0.123490706,0.6526418,0.026289374,0.00016515086],"about_ca_topic_score_codex":0.00024239733,"about_ca_topic_score_gemma":0.0004997272,"teacher_disagreement_score":0.0050376477,"about_ca_system_score_codex":0.00079716544,"about_ca_system_score_gemma":0.00094402255,"threshold_uncertainty_score":0.016852558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6956177,0.0012142614,0.1693869,0.0019137019,0.0007809184,0.00018030252,0.00051749026,0.00035350758,0.1300352],"genre_scores_gemma":[0.94513565,0.00061381806,0.022683376,0.0006124843,0.0005125813,0.0001409723,0.00027146912,0.000101560436,0.02992816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996369,0.00008694491,0.000020951085,0.000042908556,0.00013055051,0.000081680846],"domain_scores_gemma":[0.9993981,0.00019442354,0.00012039989,0.0001107022,0.00008482087,0.00009150687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036162365,0.00072074425,0.00048059193,0.0015180511,0.0007972376,0.0015587155,0.00044040367,0.0012698501,0.0062160706],"category_scores_gemma":[0.0013259161,0.00034696667,0.00042579608,0.0009391772,0.0012084536,0.0019576466,0.0018904821,0.0010015424,0.0010805889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010195924,0.000031341613,0.00031580363,0.000043459855,0.000008229282,0.00014693869,0.00024307995,0.0024990146,0.0075157024,0.9751091,0.0012161831,0.01276919],"study_design_scores_gemma":[0.00006131506,0.000080688566,0.00053244556,0.000030605835,0.000011549393,0.00043883524,0.00013253403,0.025059173,0.0044654286,0.96125764,0.007880033,0.0000497436],"about_ca_topic_score_codex":0.00023308628,"about_ca_topic_score_gemma":0.0002818776,"teacher_disagreement_score":0.0062160706,"about_ca_system_score_codex":0.0004135171,"about_ca_system_score_gemma":0.0005290557,"threshold_uncertainty_score":0.020794868},"labels":[],"label_agreement":null},{"id":"W2071186718","doi":"10.1002/jcd.20064","title":"Coloring 4‐cycle systems","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Partition (number theory); Monochromatic color; Integer (computer science); Graph; Order (exchange); Discrete mathematics; Physics; Computer science","score_opus":0.013809098564854424,"score_gpt":0.21316624790662134,"score_spread":0.1993571493417669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071186718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.764636,0.0006097043,0.16449113,0.0003528743,0.00016901855,0.00027838183,0.000441439,0.00035280365,0.068668686],"genre_scores_gemma":[0.9149723,0.0002811561,0.0651107,0.00015905329,0.00003680429,0.00021810697,0.00053433457,0.00008440002,0.018603165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952006,0.000105231484,0.00002309247,0.000088271525,0.00008051399,0.00018277572],"domain_scores_gemma":[0.99943846,0.00012800161,0.000095834504,0.00012463513,0.00013146567,0.00008169205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027788334,0.00041952633,0.00030273836,0.00084028667,0.0011148104,0.0010260894,0.00055888435,0.0004819039,0.009968113],"category_scores_gemma":[0.0007554582,0.0003426707,0.000444327,0.0007295402,0.0008151341,0.0009761536,0.0012680087,0.00045041004,0.0008226599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005836868,0.00016746798,0.0063568447,0.00042795864,0.00011425465,0.0005717617,0.0011976904,0.0816445,0.1007861,0.70978826,0.0108942585,0.08746726],"study_design_scores_gemma":[0.00019507715,0.00036839457,0.0030612762,0.000093256465,0.00006738061,0.00071493717,0.00077601854,0.19749404,0.057872817,0.6437339,0.095513515,0.00010943035],"about_ca_topic_score_codex":0.0024612057,"about_ca_topic_score_gemma":0.004228757,"teacher_disagreement_score":0.009968113,"about_ca_system_score_codex":0.0011072699,"about_ca_system_score_gemma":0.00069939415,"threshold_uncertainty_score":0.033346593},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07319368,0.00044692418,0.9179797,0.00040075532,0.00007275686,0.000067004716,0.00008375589,0.00019982368,0.007555604],"genre_scores_gemma":[0.79312456,0.0004624002,0.20298515,0.00011341713,0.00009888852,0.0000748577,0.00003235367,0.000034174373,0.003074226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942493,0.00020554755,0.00002800443,0.00010618265,0.00016906591,0.00006631434],"domain_scores_gemma":[0.9992525,0.0003626795,0.00013624673,0.00008269576,0.00011443413,0.00005138885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007270932,0.00055750296,0.0003831471,0.00047690442,0.0003892651,0.0007719212,0.0007649313,0.00068613706,0.0015099283],"category_scores_gemma":[0.002372431,0.0002372502,0.00019570418,0.00055011874,0.0007729863,0.0009912782,0.0005491082,0.00044895365,0.00034294592],"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.00095541653,0.00018801438,0.0005780113,0.00030842665,0.00003815139,0.00016314951,0.00016005512,0.24360938,0.11434161,0.4962989,0.003087667,0.14027116],"study_design_scores_gemma":[0.00009616698,0.00015908523,0.00016463791,0.000023626522,0.000020805603,0.0001463767,0.00002021485,0.94427824,0.01118181,0.04160382,0.0022722306,0.000033010492],"about_ca_topic_score_codex":0.00050224597,"about_ca_topic_score_gemma":0.0010192133,"teacher_disagreement_score":0.0015099283,"about_ca_system_score_codex":0.00084457395,"about_ca_system_score_gemma":0.0010790172,"threshold_uncertainty_score":0.0061277747},"labels":[],"label_agreement":null},{"id":"W2072012053","doi":"10.1002/jcd.20176","title":"A S(3, {4, 6}, 18) with a subdesign S(3, 4, 8) does not exist","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics","score_opus":0.019203955240580505,"score_gpt":0.22985446570618256,"score_spread":0.21065051046560207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072012053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81433403,0.00024576802,0.15482348,0.0004498706,0.00010745907,0.00035994692,0.0005345711,0.0005627114,0.028582199],"genre_scores_gemma":[0.8946479,0.00006369791,0.098395675,0.00019306339,0.000019928353,0.00024549084,0.00030898757,0.000024705632,0.0061005545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902475,0.00030455063,0.00011355486,0.00025039588,0.00017599667,0.00013073935],"domain_scores_gemma":[0.9974292,0.000661311,0.0005484152,0.0005935782,0.00048600032,0.00028153596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091965,0.0004368671,0.0004373463,0.00040910274,0.00056732004,0.0007581334,0.00039221445,0.00065622275,0.00578032],"category_scores_gemma":[0.0020165567,0.00023139457,0.0003657324,0.000312384,0.0006824206,0.00071260426,0.0005591932,0.00049026165,0.00095527904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010076158,0.0015042841,0.037092146,0.0009563608,0.00035692586,0.0017113662,0.0008062614,0.055630755,0.29077777,0.26486757,0.011941714,0.32427856],"study_design_scores_gemma":[0.0018810349,0.018071227,0.019597726,0.0004227536,0.00057486095,0.005807347,0.0010945606,0.3017387,0.2475448,0.25435403,0.14872853,0.00018439251],"about_ca_topic_score_codex":0.0004237502,"about_ca_topic_score_gemma":0.0012438543,"teacher_disagreement_score":0.00578032,"about_ca_system_score_codex":0.0006137342,"about_ca_system_score_gemma":0.0008725272,"threshold_uncertainty_score":0.019337058},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41246507,0.00033031244,0.5066419,0.0005380139,0.00020933215,0.000094446754,0.00030926167,0.00039475504,0.079016864],"genre_scores_gemma":[0.9044371,0.00032771612,0.056265924,0.00029059328,0.00017378335,0.00012905298,0.00035286284,0.00018582598,0.03783715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996191,0.00015372306,0.000011326124,0.000059801423,0.00010133407,0.000054752454],"domain_scores_gemma":[0.9969695,0.0018098465,0.00019935517,0.00036389593,0.0004265136,0.00023089419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005587318,0.0003180353,0.000391702,0.0011788821,0.0006358475,0.001083374,0.00067409896,0.0007110318,0.0070699756],"category_scores_gemma":[0.0034974758,0.00036520144,0.00038393488,0.00085025735,0.000777742,0.0015109573,0.0013668603,0.0008111271,0.00061783835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047680565,0.000039506984,0.00030405683,0.00004317623,0.000011266051,0.000111697416,0.00014105086,0.008478808,0.0043822215,0.97271335,0.001751561,0.011975696],"study_design_scores_gemma":[0.000031566666,0.000030760704,0.00034685488,0.000017194576,0.000013812106,0.00019663009,0.00009949868,0.09520985,0.0042765737,0.8959927,0.0037706993,0.0000138907435],"about_ca_topic_score_codex":0.00022410032,"about_ca_topic_score_gemma":0.00039104573,"teacher_disagreement_score":0.0070699756,"about_ca_system_score_codex":0.0005068743,"about_ca_system_score_gemma":0.0002794421,"threshold_uncertainty_score":0.023651421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71369183,0.0019168438,0.16485052,0.001992692,0.0003197053,0.000079194666,0.0009517278,0.00035402834,0.11584345],"genre_scores_gemma":[0.953521,0.00144553,0.02847847,0.00031470644,0.00036848287,0.00007880141,0.0006945395,0.0003482865,0.014750059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929404,0.00019303121,0.000024787507,0.00013376187,0.00018919243,0.00016520711],"domain_scores_gemma":[0.99151003,0.0052731056,0.0009416711,0.000649417,0.0007253954,0.00090037775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012847682,0.0007712829,0.000874469,0.0048928573,0.0019032874,0.0037713642,0.0014272403,0.0011950561,0.010131526],"category_scores_gemma":[0.008686413,0.0006904576,0.0004941862,0.003918267,0.003079037,0.0053463685,0.0017458451,0.0025774792,0.00079802476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025007912,0.000055337234,0.0018919524,0.00007886503,0.000022567212,0.00006926561,0.00044082667,0.018253507,0.0033920123,0.9536685,0.004885467,0.016991591],"study_design_scores_gemma":[0.000032435124,0.00003743492,0.0015172672,0.00005456107,0.00002798446,0.000097091026,0.00020570269,0.07331254,0.0010643515,0.91934997,0.004272649,0.000027969361],"about_ca_topic_score_codex":0.0035712097,"about_ca_topic_score_gemma":0.004250918,"teacher_disagreement_score":0.010131526,"about_ca_system_score_codex":0.0029045425,"about_ca_system_score_gemma":0.00080383004,"threshold_uncertainty_score":0.033893347},"labels":[],"label_agreement":null},{"id":"W2074300802","doi":"10.1002/jcd.1017","title":"Bounds on the number of Hadamard designs of even order","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Upper and lower bounds; Order (exchange); Hadamard matrix; Hadamard's maximal determinant problem; Prime (order theory); Hadamard's inequality; Discrete mathematics","score_opus":0.02602588023385388,"score_gpt":0.24733068587122356,"score_spread":0.22130480563736968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074300802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5867232,0.005021601,0.31922472,0.003524711,0.00078046654,0.00029705578,0.0014248115,0.0013574051,0.081646],"genre_scores_gemma":[0.8987388,0.0013744407,0.08084381,0.00045637184,0.00044474564,0.00045776233,0.0010664397,0.00017526792,0.016442351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99303716,0.0015767713,0.00049683626,0.0009953537,0.0027085708,0.0011853849],"domain_scores_gemma":[0.974151,0.014992067,0.0023470768,0.0044978755,0.0024431818,0.0015687512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036842455,0.0014502069,0.001797539,0.002050525,0.0020451292,0.0036893368,0.0021575359,0.0019288706,0.0129855415],"category_scores_gemma":[0.017678747,0.0010999988,0.0013085266,0.0012715153,0.0025142985,0.005489225,0.0023521183,0.0025174457,0.0021770524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056112255,0.00068945996,0.014150397,0.0013237006,0.0003317037,0.0012037728,0.0007612952,0.12388975,0.084937125,0.5649953,0.01807607,0.1840302],"study_design_scores_gemma":[0.00068900234,0.0011599371,0.0040164515,0.0002643382,0.00023846349,0.0024310453,0.00024278442,0.21189415,0.08279665,0.6613714,0.034666933,0.0002287999],"about_ca_topic_score_codex":0.00060516055,"about_ca_topic_score_gemma":0.00081621256,"teacher_disagreement_score":0.0129855415,"about_ca_system_score_codex":0.0027554412,"about_ca_system_score_gemma":0.0016082771,"threshold_uncertainty_score":0.043440938},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57490456,0.00080803165,0.1528967,0.0011872272,0.0004901422,0.000108218235,0.00041627872,0.00041614933,0.26877257],"genre_scores_gemma":[0.9526753,0.00036801616,0.025713688,0.0003200142,0.000086572145,0.000070246526,0.00031729168,0.000048465503,0.02040042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997744,0.00006570957,0.000011468781,0.00004055665,0.000064298125,0.00004361592],"domain_scores_gemma":[0.99967134,0.00007921636,0.000048552403,0.0000655224,0.000057166173,0.000078279954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014647513,0.0003414213,0.0005248227,0.0008479381,0.0008781474,0.0013934001,0.00054840633,0.0009473839,0.011565201],"category_scores_gemma":[0.00073921535,0.00031051665,0.00031426022,0.00072750216,0.0006644188,0.001181893,0.001031088,0.0008796473,0.0011209416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010548681,0.000034643897,0.00036227654,0.00007554356,0.000014241495,0.00034342892,0.00012691805,0.008096348,0.0062899017,0.9700828,0.0029119025,0.011556484],"study_design_scores_gemma":[0.000051275754,0.000052097836,0.00068383454,0.000028308792,0.000015935331,0.00066152745,0.00032645487,0.046910882,0.0029460022,0.9382094,0.010088701,0.000025573374],"about_ca_topic_score_codex":0.00031677136,"about_ca_topic_score_gemma":0.00052899093,"teacher_disagreement_score":0.011565201,"about_ca_system_score_codex":0.0003368157,"about_ca_system_score_gemma":0.00027598784,"threshold_uncertainty_score":0.038689494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1982476,0.0017528376,0.77759236,0.0024104586,0.0002849547,0.00008231862,0.0002622804,0.00029048393,0.019076794],"genre_scores_gemma":[0.90445954,0.0018608075,0.07324146,0.0002589579,0.00038303592,0.00017150205,0.00032983316,0.00010359823,0.019191254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907315,0.0003788202,0.000025835841,0.00017907821,0.000181662,0.00016146555],"domain_scores_gemma":[0.99563193,0.0029544134,0.00045798798,0.000337533,0.00036983582,0.00024834968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010084257,0.0006314026,0.0009515565,0.0015752022,0.0015837883,0.0024632518,0.0016110705,0.0013798618,0.004376681],"category_scores_gemma":[0.010031061,0.000684671,0.00045508982,0.0026962312,0.0017918446,0.003265976,0.0013013515,0.0012260777,0.00054251944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001993477,0.00011907336,0.0017600151,0.00016683938,0.00005825974,0.000109318935,0.00026699837,0.41469818,0.0012572954,0.49471813,0.008009222,0.07863725],"study_design_scores_gemma":[0.000034741093,0.000028336957,0.00040433303,0.000019409066,0.000027682778,0.00006495419,0.00012153665,0.43145093,0.00030346905,0.5647573,0.0027715706,0.000015790916],"about_ca_topic_score_codex":0.0038667012,"about_ca_topic_score_gemma":0.004129993,"teacher_disagreement_score":0.004376681,"about_ca_system_score_codex":0.0016732344,"about_ca_system_score_gemma":0.0015506254,"threshold_uncertainty_score":0.014641464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0263098,0.0010859104,0.9405404,0.0019721242,0.0006160911,0.00007312287,0.0001828411,0.0005680918,0.028651638],"genre_scores_gemma":[0.24793579,0.0015222329,0.72228533,0.0021096675,0.0004162224,0.00018703126,0.00026796537,0.0005551323,0.024720669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989556,0.00047958273,0.000045029068,0.00015201225,0.0002910448,0.000076753946],"domain_scores_gemma":[0.99782515,0.0009170473,0.00011883415,0.000765847,0.00026895347,0.00010420858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015610118,0.000727592,0.00073378684,0.0012095015,0.0012899861,0.0020734791,0.0011731029,0.001480719,0.009928653],"category_scores_gemma":[0.0039411383,0.0006065617,0.0011965004,0.0010223113,0.002999133,0.0053506764,0.002368694,0.0035941424,0.0028175602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088024695,0.00003462575,0.00020026448,0.00016159522,0.000023997552,0.00006930876,0.00036923046,0.0027030138,0.005404633,0.92604506,0.0031505649,0.061749615],"study_design_scores_gemma":[0.000026563748,0.00009886389,0.000093957504,0.00007910763,0.000016300872,0.00020379326,0.00010439858,0.005407307,0.0038831362,0.96142566,0.028616762,0.000044155633],"about_ca_topic_score_codex":0.00034623052,"about_ca_topic_score_gemma":0.00074568955,"teacher_disagreement_score":0.009928653,"about_ca_system_score_codex":0.0006560598,"about_ca_system_score_gemma":0.0007069969,"threshold_uncertainty_score":0.03321463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016540967,0.00036576774,0.9769508,0.00046370446,0.00011106625,0.000054234522,0.00016396224,0.00022092732,0.0051284474],"genre_scores_gemma":[0.44999906,0.0008553049,0.5334046,0.0006571203,0.0004345486,0.00047536293,0.00047809214,0.00043599628,0.013259874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949439,0.0030734318,0.00017034757,0.00072913605,0.00081083487,0.00027236703],"domain_scores_gemma":[0.9637552,0.029060587,0.0017371239,0.003453056,0.0016004456,0.00039367782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041816304,0.001165777,0.0017524884,0.0012469876,0.00083907845,0.001568127,0.0017801328,0.0015069785,0.005982757],"category_scores_gemma":[0.037095938,0.0014492873,0.00079488487,0.0025170492,0.003207974,0.003447416,0.0031621424,0.001585731,0.0009350544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024539296,0.00006533059,0.0010501745,0.00022815581,0.000107868495,0.0002976976,0.00020918273,0.13572603,0.002659156,0.7995257,0.0047837696,0.05510166],"study_design_scores_gemma":[0.000049942697,0.000034573946,0.00032486327,0.000034370874,0.000021494268,0.00022860541,0.00006292083,0.36597297,0.0010099085,0.62937164,0.0028587193,0.000029966577],"about_ca_topic_score_codex":0.00140547,"about_ca_topic_score_gemma":0.0015365302,"teacher_disagreement_score":0.005982757,"about_ca_system_score_codex":0.0006171589,"about_ca_system_score_gemma":0.0010756478,"threshold_uncertainty_score":0.022114813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03229604,0.002037098,0.927511,0.0016061676,0.0005786796,0.000133532,0.00018095571,0.00023296235,0.0354235],"genre_scores_gemma":[0.40164936,0.004525748,0.56484747,0.0009510584,0.0013120194,0.0006517385,0.00030851373,0.00019587317,0.025558185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867755,0.00063158275,0.00007428678,0.00017969593,0.00035327228,0.00008366087],"domain_scores_gemma":[0.9938433,0.003953041,0.0005711527,0.0007326651,0.00065367087,0.0002461475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017874159,0.00089121336,0.0008193257,0.002272654,0.0012410228,0.0032123437,0.0013462405,0.0018606182,0.0070897457],"category_scores_gemma":[0.009788048,0.0008910584,0.00090181053,0.0031225546,0.0031592248,0.002957284,0.0016200375,0.0026336336,0.0011600765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047981157,0.00003610617,0.00011808921,0.000082170794,0.00001162905,0.000050599825,0.00006411661,0.013640317,0.0012796989,0.9598591,0.0017208839,0.023089219],"study_design_scores_gemma":[0.000043174787,0.000045334036,0.00008586446,0.000035249857,0.000017734821,0.00014675572,0.00003396078,0.082497895,0.0007575283,0.9095948,0.0067113703,0.00003039589],"about_ca_topic_score_codex":0.0003271527,"about_ca_topic_score_gemma":0.0008128486,"teacher_disagreement_score":0.0070897457,"about_ca_system_score_codex":0.0012114131,"about_ca_system_score_gemma":0.0008573311,"threshold_uncertainty_score":0.023717523},"labels":[],"label_agreement":null},{"id":"W2075668496","doi":"10.1002/jcd.20108","title":"Orthogonal designs via computational algebra","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Orthogonal array; Hadamard matrix; Quaternion; Hadamard transform; Order (exchange); Orthogonal matrix; Combinatorics; Matrix (chemical analysis); Complex Hadamard matrix; Clifford algebra; Algebra over a field; Quaternion algebra; Analogy; Pure mathematics; Orthogonal basis; Division algebra; Geometry; Algebra representation; Mathematical analysis; Taguchi methods","score_opus":0.01213506156045652,"score_gpt":0.20925554002383573,"score_spread":0.1971204784633792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075668496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067519434,0.0007840339,0.8028424,0.0010481452,0.0003837956,0.00027129202,0.00031295224,0.00036698073,0.12647094],"genre_scores_gemma":[0.6027462,0.00095649593,0.3642452,0.0006493512,0.0005792913,0.0006145395,0.0005711223,0.0001668286,0.029471003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969574,0.001115735,0.00020127608,0.00046842315,0.00087990856,0.00037720375],"domain_scores_gemma":[0.9975811,0.0010824188,0.00022396327,0.00058240484,0.00039965316,0.00013043657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024518685,0.0006847826,0.0006502985,0.0016787514,0.001579554,0.0030853609,0.0009873775,0.0007239356,0.014736338],"category_scores_gemma":[0.005186046,0.00045781492,0.001279781,0.0015819148,0.0036283715,0.004409276,0.00283689,0.0019319208,0.0024901906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015202777,0.000013957695,0.000045608835,0.000024688408,0.0000036475153,0.000014469123,0.00005314506,0.001607609,0.00035640405,0.9866263,0.00064014853,0.010598681],"study_design_scores_gemma":[0.000014006557,0.000032103337,0.000033379736,0.000018333129,0.000005783019,0.00004086995,0.000027353899,0.008209935,0.0010714231,0.98061943,0.009914228,0.000013138281],"about_ca_topic_score_codex":0.00054372614,"about_ca_topic_score_gemma":0.0008421748,"teacher_disagreement_score":0.014736338,"about_ca_system_score_codex":0.0013603347,"about_ca_system_score_gemma":0.0011559344,"threshold_uncertainty_score":0.04929793},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06613879,0.013782924,0.8165887,0.02567682,0.005874256,0.00007100608,0.0012484645,0.000718699,0.06990049],"genre_scores_gemma":[0.6713664,0.009507241,0.25629976,0.010346037,0.009995761,0.00031628905,0.0016600644,0.0021637625,0.03834484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99334246,0.002908221,0.0002557112,0.0011486463,0.0019118955,0.00043305723],"domain_scores_gemma":[0.91506135,0.07125491,0.0021022053,0.005325597,0.0036437172,0.0026122357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009596658,0.002571503,0.002851848,0.0037934065,0.0018495225,0.004125263,0.0052545876,0.004319242,0.007959321],"category_scores_gemma":[0.07433889,0.001453885,0.0022647262,0.003169132,0.009648891,0.011666496,0.008606299,0.015579485,0.0015961302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024125141,0.000048551745,0.00092435005,0.00022785788,0.0000516079,0.00022779683,0.00029884846,0.016525637,0.0026727857,0.9583233,0.010415857,0.010042154],"study_design_scores_gemma":[0.000025838302,0.00006135816,0.00052401546,0.000084769345,0.000025679292,0.00021988481,0.00006309257,0.09880548,0.00093625754,0.8912801,0.007904274,0.0000691893],"about_ca_topic_score_codex":0.0022831918,"about_ca_topic_score_gemma":0.0014688532,"teacher_disagreement_score":0.009596658,"about_ca_system_score_codex":0.0027502105,"about_ca_system_score_gemma":0.0012019954,"threshold_uncertainty_score":0.05075258},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5202897,0.0004553293,0.4182988,0.0009532787,0.00031575208,0.000121507444,0.00044380076,0.0011398464,0.057981994],"genre_scores_gemma":[0.88311523,0.0002966045,0.10702698,0.00012877316,0.00008344692,0.00003576447,0.00042305962,0.00022704562,0.008663141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945337,0.00011884997,0.00004188587,0.000099873665,0.00017576046,0.0001101842],"domain_scores_gemma":[0.9984534,0.0009112451,0.00011119042,0.0002065937,0.00024147698,0.00007606321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006887623,0.0007616252,0.0006911067,0.0014556603,0.00077446643,0.0030037786,0.000772115,0.00057941454,0.010728713],"category_scores_gemma":[0.0055809915,0.00040348497,0.00047343352,0.0013516846,0.0016427173,0.0037698955,0.0013631735,0.0010247051,0.0017321307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045464316,0.00016198221,0.0028744624,0.00024788917,0.00003941002,0.00032205624,0.0008959399,0.05114209,0.009929363,0.7520686,0.0073044747,0.17455913],"study_design_scores_gemma":[0.00006212494,0.00008153065,0.00034959897,0.000046578843,0.00002017796,0.00009406134,0.00038437132,0.11513935,0.0071791746,0.87142,0.0051966966,0.000026367818],"about_ca_topic_score_codex":0.001267333,"about_ca_topic_score_gemma":0.003644146,"teacher_disagreement_score":0.010728713,"about_ca_system_score_codex":0.00079032226,"about_ca_system_score_gemma":0.00062254403,"threshold_uncertainty_score":0.035891116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5356558,0.00072499755,0.35845584,0.0011733301,0.00032433422,0.00019380248,0.0018154677,0.00046817778,0.10118823],"genre_scores_gemma":[0.85167646,0.0007242998,0.09894436,0.0005547055,0.00033971813,0.00020804701,0.001997119,0.00027511202,0.045280196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914527,0.0001586106,0.000045594457,0.00026398076,0.00020113746,0.0001853923],"domain_scores_gemma":[0.99760675,0.00085178216,0.00043998545,0.00036235334,0.00036399416,0.0003750246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308847,0.0008102128,0.0008323915,0.0015775942,0.0015104465,0.0025118014,0.0008588155,0.0009486986,0.01309701],"category_scores_gemma":[0.002172151,0.00081627903,0.00087867683,0.0011766712,0.0013702458,0.0035144563,0.001240005,0.0020907102,0.0017857655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020624782,0.00008824286,0.00044952703,0.00010907133,0.000024301826,0.0003245515,0.00069931214,0.005741637,0.005281268,0.9667712,0.0056366418,0.014667938],"study_design_scores_gemma":[0.000025155106,0.000028258275,0.0003874902,0.000020555175,0.000009139285,0.00021071757,0.00015913595,0.010559567,0.00069016026,0.9830467,0.0048486725,0.000014407678],"about_ca_topic_score_codex":0.0010885342,"about_ca_topic_score_gemma":0.0019192155,"teacher_disagreement_score":0.01309701,"about_ca_system_score_codex":0.0007186672,"about_ca_system_score_gemma":0.00043804082,"threshold_uncertainty_score":0.043813884},"labels":[],"label_agreement":null},{"id":"W2078909675","doi":"10.1002/jcd.20210","title":"Graphs with the <i>n</i>‐e.c. adjacency property constructed from resolvable designs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Adjacency list; Combinatorics; Adjacency matrix; Affine transformation; Discrete mathematics; Property (philosophy); Extension (predicate logic); Graph; Pure mathematics; Computer science","score_opus":0.014712632749133009,"score_gpt":0.19691762003460528,"score_spread":0.18220498728547227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078909675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4558454,0.0001307757,0.52365273,0.000258907,0.000038609403,0.00008496455,0.0002597344,0.00032290624,0.019405972],"genre_scores_gemma":[0.914323,0.00009248306,0.08243621,0.00009390327,0.000015666434,0.00010750652,0.0002587434,0.000058768655,0.0026136297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992199,0.00026687083,0.00004651494,0.00015502407,0.00020396584,0.00010773552],"domain_scores_gemma":[0.9966742,0.00150294,0.0005862266,0.0008240608,0.00029501706,0.00011752719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056613976,0.00028217607,0.00026228157,0.00062032125,0.0005301686,0.00084757624,0.000589513,0.00054830336,0.00202285],"category_scores_gemma":[0.0025410482,0.00032911066,0.0005187908,0.00054336246,0.0011927878,0.0006344271,0.0006019455,0.0008961397,0.00030998333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002594904,0.00012498834,0.0029985073,0.00013361372,0.000052755684,0.0005363461,0.00025658612,0.103512466,0.05451235,0.79391694,0.0015973656,0.04209855],"study_design_scores_gemma":[0.000113702416,0.0004258554,0.002629834,0.00007457043,0.000086124484,0.0016282337,0.00019580923,0.30809674,0.10386187,0.5672182,0.015583719,0.00008539909],"about_ca_topic_score_codex":0.00036204228,"about_ca_topic_score_gemma":0.00049037265,"teacher_disagreement_score":0.00202285,"about_ca_system_score_codex":0.00055657566,"about_ca_system_score_gemma":0.00043746555,"threshold_uncertainty_score":0.0067671537},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25686166,0.0025542472,0.5086723,0.0035325591,0.0009640046,0.00010716669,0.00060240517,0.0003364708,0.22636917],"genre_scores_gemma":[0.91206473,0.0015777822,0.036148764,0.0011902809,0.00038620512,0.000098087454,0.000418302,0.0001219008,0.04799401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997445,0.000053704018,0.000014258118,0.000050443763,0.0000795647,0.000057466685],"domain_scores_gemma":[0.9990355,0.00041921635,0.00010774923,0.000114508395,0.00019201363,0.00013104423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049750385,0.00083378743,0.0008248397,0.0011672032,0.0015461382,0.0013206085,0.0007064029,0.0009316928,0.013879903],"category_scores_gemma":[0.0016142582,0.00034168785,0.0011121539,0.0015681955,0.001220901,0.0034086911,0.0018776747,0.0023024476,0.0010090936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006449563,0.000031733583,0.00023644946,0.00010749891,0.00002069109,0.0001309578,0.00026473636,0.009396672,0.0029423076,0.97534126,0.0020134777,0.009449733],"study_design_scores_gemma":[0.000010371048,0.00003474742,0.00023400008,0.000018457033,0.000015607826,0.000090701265,0.00016646298,0.02524925,0.00092343095,0.96925676,0.0039830464,0.000017087817],"about_ca_topic_score_codex":0.0021165493,"about_ca_topic_score_gemma":0.0020902168,"teacher_disagreement_score":0.013879903,"about_ca_system_score_codex":0.0008852219,"about_ca_system_score_gemma":0.00056549854,"threshold_uncertainty_score":0.046432853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4972508,0.00054726197,0.3816663,0.0018475114,0.00037464162,0.00022598488,0.0008424382,0.0006989541,0.1165461],"genre_scores_gemma":[0.866292,0.00063424616,0.058743175,0.0003580391,0.00015350345,0.0002249668,0.00037575528,0.00015432882,0.07306408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999676,0.000064390835,0.000019739,0.000075268304,0.00007257546,0.000091961214],"domain_scores_gemma":[0.99834037,0.00063228776,0.00021108877,0.00018912295,0.00022728476,0.00039979487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038256825,0.00046319133,0.0005649412,0.0010936831,0.0011467902,0.001660412,0.00045474575,0.00058875914,0.008201009],"category_scores_gemma":[0.0017478556,0.00042443888,0.0003842556,0.00063142664,0.0014795434,0.002346769,0.0015201668,0.0010102326,0.0012477469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021379734,0.00003635253,0.0006944085,0.000097291646,0.000011390388,0.00017313671,0.0002285228,0.0053806757,0.008160469,0.96781766,0.0020945198,0.015091721],"study_design_scores_gemma":[0.00006947627,0.00012548703,0.00073532155,0.00004223198,0.000027179885,0.00030263016,0.0002492242,0.018496778,0.008668086,0.9487565,0.022497699,0.000029301094],"about_ca_topic_score_codex":0.00082087494,"about_ca_topic_score_gemma":0.0016809833,"teacher_disagreement_score":0.008201009,"about_ca_system_score_codex":0.0006410787,"about_ca_system_score_gemma":0.0005399902,"threshold_uncertainty_score":0.027435064},"labels":[],"label_agreement":null},{"id":"W2079936473","doi":"10.1002/jcd.20215","title":"On list coloring Steiner triple systems","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Steiner system; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.015618636098015773,"score_gpt":0.22014537530343356,"score_spread":0.20452673920541778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079936473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80325043,0.00059909926,0.14932916,0.0005125709,0.0001199289,0.000068454094,0.0004379811,0.00021775941,0.045464654],"genre_scores_gemma":[0.97239155,0.000308094,0.021395084,0.000077439276,0.000047515696,0.000043882643,0.00026466616,0.000053792297,0.005417913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938095,0.000149096,0.000022703085,0.000091011665,0.00016040134,0.00019582549],"domain_scores_gemma":[0.99810374,0.00091645,0.0002715011,0.00018661864,0.00030246974,0.00021914818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004820863,0.00035085477,0.0003599977,0.0013319422,0.0013930491,0.0014445742,0.0005118123,0.0006859994,0.0072162384],"category_scores_gemma":[0.002403881,0.00030357164,0.00035094426,0.0019745822,0.00109587,0.0019089316,0.001015553,0.0007324688,0.0005178978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056509586,0.000073560375,0.0042505814,0.00021532178,0.000046807345,0.0005777331,0.00070961996,0.10803992,0.022232704,0.8203203,0.00691192,0.036056366],"study_design_scores_gemma":[0.00009101645,0.00025504016,0.0026270724,0.00008809654,0.000045213004,0.00095368375,0.0007755642,0.38074765,0.015379296,0.5831919,0.015769446,0.00007610992],"about_ca_topic_score_codex":0.00229695,"about_ca_topic_score_gemma":0.0028255899,"teacher_disagreement_score":0.0072162384,"about_ca_system_score_codex":0.001767835,"about_ca_system_score_gemma":0.0006036023,"threshold_uncertainty_score":0.024140716},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39427313,0.0017175737,0.5311141,0.006325206,0.00030161857,0.00040004292,0.0019412019,0.0018087055,0.062118534],"genre_scores_gemma":[0.78603905,0.0011972382,0.19667052,0.00063578476,0.00032161272,0.00029843763,0.002261261,0.0007060318,0.011870056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927927,0.002834251,0.0004554871,0.00081040605,0.002343655,0.00076340756],"domain_scores_gemma":[0.9209332,0.06693614,0.0020647089,0.0071964157,0.0021390116,0.00073049974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039401934,0.00083086925,0.0020519227,0.0015564663,0.002412236,0.0076575903,0.002922459,0.0022561313,0.017572494],"category_scores_gemma":[0.048232447,0.0010259594,0.0018199102,0.0028300849,0.0032937464,0.014951243,0.004428584,0.004186931,0.0022162811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001180774,0.00038881868,0.0034924806,0.00059613434,0.00012361177,0.00045394653,0.00097095163,0.16144517,0.004218404,0.6368526,0.017043183,0.17323393],"study_design_scores_gemma":[0.00010313821,0.00005849815,0.00046989732,0.000050578205,0.000043599975,0.0001592611,0.00021715577,0.22062463,0.0021102258,0.77341175,0.0027138197,0.000037513906],"about_ca_topic_score_codex":0.004280206,"about_ca_topic_score_gemma":0.0052503273,"teacher_disagreement_score":0.017572494,"about_ca_system_score_codex":0.002707904,"about_ca_system_score_gemma":0.0028962991,"threshold_uncertainty_score":0.058785856},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31988877,0.000556122,0.62250745,0.0012265871,0.00043840337,0.00027288354,0.00026816624,0.0012193909,0.05362223],"genre_scores_gemma":[0.6244169,0.00043626726,0.3572222,0.00059172144,0.0001247301,0.00022467966,0.0003990621,0.00044517705,0.016139336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991423,0.0003596848,0.000042922926,0.00015032034,0.00017831757,0.00012655272],"domain_scores_gemma":[0.9978635,0.00115806,0.00014845365,0.00044393612,0.00023261676,0.00015342557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866974,0.0007989431,0.00084293424,0.00075271376,0.0010498286,0.0014382196,0.0008643068,0.00081844465,0.006236452],"category_scores_gemma":[0.0042334483,0.0006220974,0.0005862408,0.0010187377,0.0014392362,0.0015087445,0.0025464965,0.0012049811,0.0017357747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008248848,0.00025235035,0.0038948809,0.0005111072,0.000118970645,0.0009766925,0.0010677115,0.05429193,0.047464818,0.6791926,0.012483652,0.19892043],"study_design_scores_gemma":[0.00028906658,0.00051830866,0.0008981614,0.00013156034,0.00010073497,0.0010789908,0.0008020359,0.18855691,0.035721097,0.7412929,0.030525016,0.000085268504],"about_ca_topic_score_codex":0.00055770704,"about_ca_topic_score_gemma":0.0012845106,"teacher_disagreement_score":0.006236452,"about_ca_system_score_codex":0.00052865595,"about_ca_system_score_gemma":0.0010859935,"threshold_uncertainty_score":0.020863056},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040665228,0.0014561922,0.55711395,0.0026741475,0.0012802314,0.000266207,0.0022403917,0.0025814823,0.39172223],"genre_scores_gemma":[0.38318563,0.0017243087,0.28959483,0.0018715179,0.0007440842,0.00073131337,0.0044132243,0.002137689,0.3155974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975472,0.0005112004,0.00020086861,0.000667377,0.00075061515,0.000322786],"domain_scores_gemma":[0.9944537,0.0019885998,0.0005882698,0.0009678721,0.0016886704,0.00031284007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022439726,0.0013901355,0.0013230067,0.0013613222,0.0018234747,0.0038744928,0.0010052166,0.0017607177,0.10761767],"category_scores_gemma":[0.009489907,0.0009805639,0.0021630721,0.0010269124,0.0019697666,0.0053839725,0.0021390528,0.0023318722,0.03873792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000428412,0.00018292374,0.0009399407,0.0007370281,0.000100431054,0.00047859497,0.0007574448,0.0023874405,0.009442532,0.8349151,0.036847413,0.11278272],"study_design_scores_gemma":[0.00023717992,0.00044665695,0.001166559,0.00037472422,0.000111929716,0.0012734379,0.00054470566,0.0062445463,0.018188773,0.7196905,0.2515729,0.0001481793],"about_ca_topic_score_codex":0.0008542337,"about_ca_topic_score_gemma":0.0015943159,"teacher_disagreement_score":0.10761767,"about_ca_system_score_codex":0.0015131487,"about_ca_system_score_gemma":0.0015700511,"threshold_uncertainty_score":0.360017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22171237,0.0028476438,0.41205963,0.0065566446,0.0014992553,0.00016538003,0.00070646306,0.0010026664,0.35344997],"genre_scores_gemma":[0.78508896,0.0027389857,0.072117195,0.002232344,0.0014604983,0.00028084024,0.0009468176,0.0008921213,0.13424225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985092,0.0003827344,0.000046034973,0.00031186498,0.00047140615,0.00027870477],"domain_scores_gemma":[0.9954804,0.0027837565,0.00024813338,0.0005969408,0.0005565565,0.00033420644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012210738,0.001522713,0.0013370094,0.0023405042,0.0029047346,0.0028471535,0.0015472575,0.0018233411,0.013849151],"category_scores_gemma":[0.0090454025,0.0007292117,0.0009821203,0.002965925,0.0044335607,0.0063672713,0.0050235875,0.0051326132,0.0025656072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053141935,0.000009908607,0.00007961801,0.000025000863,0.0000042094434,0.000027167676,0.00012070811,0.001551133,0.0003792613,0.98879415,0.002092696,0.0068631],"study_design_scores_gemma":[0.000010245907,0.000008248567,0.000055994104,0.000017903449,0.000006402376,0.00004507963,0.0000426153,0.005926408,0.00063303666,0.98941725,0.003826926,0.000009936698],"about_ca_topic_score_codex":0.0025167945,"about_ca_topic_score_gemma":0.0017294128,"teacher_disagreement_score":0.013849151,"about_ca_system_score_codex":0.0023409585,"about_ca_system_score_gemma":0.0013455445,"threshold_uncertainty_score":0.046329975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47262233,0.0014298337,0.43541068,0.0039047513,0.00027954648,0.0000710606,0.0005329885,0.00053136906,0.085217394],"genre_scores_gemma":[0.9599763,0.00053957704,0.025079055,0.00052052946,0.00027273674,0.00014588497,0.00030567622,0.00018437405,0.012975941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987753,0.00042078324,0.00004001974,0.00017511839,0.0002790397,0.00030968344],"domain_scores_gemma":[0.99186677,0.005980098,0.0005328463,0.0005238767,0.0005554041,0.0005411379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331486,0.0015056954,0.00081500394,0.001979713,0.0013789725,0.0024575465,0.002096644,0.0018062209,0.008931149],"category_scores_gemma":[0.010212105,0.0005426717,0.0006391457,0.001712886,0.0022841187,0.0031602266,0.0023374055,0.0031504969,0.0009873445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034958322,0.00008892834,0.00085082464,0.00015336393,0.00003722801,0.00018714358,0.00030791413,0.021307876,0.0062779565,0.9485442,0.003694469,0.018200645],"study_design_scores_gemma":[0.000034823188,0.00005627657,0.00074518984,0.00006296117,0.000024434064,0.00026705227,0.00011680275,0.1201086,0.0035255642,0.87356526,0.0014453745,0.00004777388],"about_ca_topic_score_codex":0.0006247226,"about_ca_topic_score_gemma":0.000763421,"teacher_disagreement_score":0.008931149,"about_ca_system_score_codex":0.0013367949,"about_ca_system_score_gemma":0.0007175472,"threshold_uncertainty_score":0.029877722},"labels":[],"label_agreement":null},{"id":"W2080969535","doi":"10.1002/jcd.20284","title":"Geometrical constructions of class-uniformly resolvable structure","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Block (permutation group theory); Construct (python library); Class (philosophy); Block size; Combinatorics; Block design; Variety (cybernetics); Discrete mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.025103032435483303,"score_gpt":0.20433610972306407,"score_spread":0.17923307728758076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080969535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1580922,0.0003462801,0.78478193,0.00027162503,0.000113948896,0.00013075375,0.0005083381,0.0009475126,0.054807376],"genre_scores_gemma":[0.66510785,0.00030849635,0.32046694,0.00015571286,0.000046797068,0.00021981978,0.0007673056,0.00024739222,0.012679709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910223,0.0002170647,0.000056300716,0.00017783236,0.00027164858,0.00017487127],"domain_scores_gemma":[0.99747413,0.0008474005,0.00037280752,0.0007978928,0.00029839083,0.00020942284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126886,0.00054336607,0.00044772838,0.0015533676,0.0012697593,0.0014197681,0.0010479799,0.0006540349,0.0072726924],"category_scores_gemma":[0.0026768835,0.0004914461,0.0007578618,0.0010559673,0.001308027,0.0018032644,0.0018243265,0.0015565293,0.0012906976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075592776,0.00004168642,0.00067176344,0.000093939656,0.0000157588,0.00020571168,0.00029894186,0.014966216,0.011656984,0.93423635,0.0016945823,0.036042646],"study_design_scores_gemma":[0.00007994711,0.00025232873,0.001047132,0.00011160772,0.000043786433,0.001206487,0.00042784138,0.093589425,0.0707641,0.77121526,0.061157353,0.00010471325],"about_ca_topic_score_codex":0.0005795794,"about_ca_topic_score_gemma":0.0009955757,"teacher_disagreement_score":0.0072726924,"about_ca_system_score_codex":0.0010739338,"about_ca_system_score_gemma":0.00065881363,"threshold_uncertainty_score":0.024329603},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77151585,0.00083652284,0.11462484,0.00095047365,0.0005877717,0.0001150743,0.00038109274,0.0002834224,0.11070487],"genre_scores_gemma":[0.96735495,0.0002069964,0.012133308,0.0002391727,0.00012913799,0.00006853047,0.00017341276,0.000054198514,0.019640367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996087,0.000063491,0.000020029116,0.00005878346,0.00012691961,0.00012213156],"domain_scores_gemma":[0.99933857,0.00012527987,0.00014077267,0.00007904572,0.00016608,0.00015025787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034889102,0.0003314268,0.00066832994,0.0014727518,0.0020678372,0.0016601479,0.0004959324,0.00094272563,0.009254362],"category_scores_gemma":[0.0011461595,0.0003488328,0.0004888328,0.0008610972,0.0013297461,0.0020479623,0.0011075215,0.0014404249,0.00067206804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047856713,0.00001412171,0.0002386655,0.000017856315,0.0000066561474,0.00011395376,0.00017029364,0.0011712792,0.0022804406,0.9918224,0.000826729,0.0032897275],"study_design_scores_gemma":[0.00002150802,0.000058242313,0.0006746579,0.000011087494,0.00000829091,0.00023260429,0.00035845503,0.016624922,0.0018541162,0.9762418,0.0038809443,0.00003334692],"about_ca_topic_score_codex":0.0010249161,"about_ca_topic_score_gemma":0.0012895524,"teacher_disagreement_score":0.009254362,"about_ca_system_score_codex":0.0007726431,"about_ca_system_score_gemma":0.0006641235,"threshold_uncertainty_score":0.03095895},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12540014,0.0007073781,0.109637775,0.008756251,0.0028753881,0.00012838938,0.0007456805,0.0005841132,0.7511648],"genre_scores_gemma":[0.83317506,0.000659721,0.021169659,0.0036325254,0.0013958298,0.00014662849,0.0004900316,0.0003252382,0.13900527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990515,0.00016161503,0.000048585043,0.00033295836,0.0001731586,0.00023214574],"domain_scores_gemma":[0.99902356,0.00024831077,0.00009559549,0.00020640554,0.00025548888,0.00017063465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076652324,0.0008231555,0.0007908379,0.0012987495,0.0027584198,0.0024655554,0.000790966,0.0012156137,0.03135104],"category_scores_gemma":[0.0015248008,0.00046893628,0.00074116146,0.0006969509,0.003333428,0.0055895033,0.0025142794,0.003072225,0.0044489014],"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.000015440351,0.000011441252,0.00003324053,0.000009526106,0.000002865074,0.000052696654,0.00007780214,0.000027127775,0.00037538432,0.99590886,0.0017442582,0.0017414882],"study_design_scores_gemma":[0.000016277287,0.000014097945,0.0001310872,0.0000064484066,0.000004778718,0.00022597579,0.00010019127,0.00023907804,0.000614173,0.9882421,0.010395962,0.000009865097],"about_ca_topic_score_codex":0.00051149336,"about_ca_topic_score_gemma":0.00065236125,"teacher_disagreement_score":0.03135104,"about_ca_system_score_codex":0.0007386703,"about_ca_system_score_gemma":0.0006197297,"threshold_uncertainty_score":0.10487962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6672843,0.0010406468,0.19081534,0.002083647,0.00057845784,0.00014105729,0.00047176797,0.0005883539,0.13699637],"genre_scores_gemma":[0.96524054,0.00035969898,0.017083509,0.0004359162,0.00022286217,0.00011493863,0.0001462592,0.00008678059,0.016309425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999458,0.00014789522,0.000021683916,0.000086613574,0.000090517744,0.00019527868],"domain_scores_gemma":[0.9977563,0.00087890675,0.00036038028,0.0004108546,0.000231941,0.0003615869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887702,0.00081526116,0.0007772305,0.0018488518,0.0018028334,0.0019704152,0.0006709462,0.0016859149,0.008959348],"category_scores_gemma":[0.004099814,0.00044111098,0.00036350047,0.0007208336,0.0020276865,0.002612194,0.0018067274,0.0013313789,0.00090940297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017437025,0.000026643203,0.0003308376,0.000034057226,0.0000051149923,0.0001336637,0.00016838608,0.0015741695,0.004787152,0.9842296,0.001967966,0.006568028],"study_design_scores_gemma":[0.000059707752,0.00014228743,0.0006641269,0.00003419346,0.000014025316,0.00022936438,0.00027433655,0.024141721,0.005905752,0.9636129,0.004871277,0.00005021701],"about_ca_topic_score_codex":0.00067013776,"about_ca_topic_score_gemma":0.00071972393,"teacher_disagreement_score":0.008959348,"about_ca_system_score_codex":0.00083591667,"about_ca_system_score_gemma":0.00060642126,"threshold_uncertainty_score":0.029972017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010513316,0.0011993857,0.9434161,0.00083755126,0.00022382176,0.00003668321,0.0001794244,0.00026617286,0.043327514],"genre_scores_gemma":[0.46158704,0.0043614614,0.4478508,0.001328591,0.0018265271,0.0005766306,0.0011298569,0.0010401581,0.08029894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985147,0.0006973205,0.000067206274,0.00021976633,0.000381043,0.00011994373],"domain_scores_gemma":[0.99650514,0.00234881,0.00018492906,0.0004331015,0.00041759346,0.00011048581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016505773,0.0013259321,0.0013330951,0.0036150462,0.0017742114,0.0034612927,0.0024215933,0.001083836,0.019153353],"category_scores_gemma":[0.005381713,0.0008272451,0.0018152213,0.00343577,0.0035715948,0.005851414,0.0023383964,0.005350722,0.0033014729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008763211,0.00001995878,0.000050997547,0.000047904294,0.000009811327,0.000019032546,0.000085615626,0.0030577995,0.00019717986,0.98638064,0.0015086367,0.008613564],"study_design_scores_gemma":[0.000004395776,0.0000030841143,0.00001617371,0.000010539218,0.000004258311,0.00001439763,0.000020992287,0.011896208,0.0001285009,0.98590696,0.001988005,0.0000064599253],"about_ca_topic_score_codex":0.001846082,"about_ca_topic_score_gemma":0.0028421273,"teacher_disagreement_score":0.019153353,"about_ca_system_score_codex":0.0017589679,"about_ca_system_score_gemma":0.000920571,"threshold_uncertainty_score":0.06407434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08338217,0.0032294688,0.9017444,0.00031885356,0.00052742363,0.00017403619,0.000121267636,0.0010735973,0.009428819],"genre_scores_gemma":[0.31495348,0.0029655113,0.6723852,0.0004510946,0.00018192804,0.00009372402,0.0001499036,0.0003246006,0.008494546],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996952,0.0000952364,0.000013595649,0.000033712317,0.00014507766,0.00001731754],"domain_scores_gemma":[0.99900997,0.00045555516,0.000071886905,0.00013119068,0.00030934115,0.0000218823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048594238,0.00045259384,0.00019498242,0.000642575,0.00016270227,0.0005311592,0.00037325846,0.00041272986,0.0042265994],"category_scores_gemma":[0.0015338389,0.000121496574,0.00027529013,0.0007357404,0.00035351608,0.0007379892,0.00028015408,0.00046184685,0.00077529607],"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.00042825736,0.00012807715,0.00070413866,0.0007042552,0.00005609671,0.0003877057,0.00019935064,0.0074955216,0.5683158,0.0097314045,0.0025079679,0.4093415],"study_design_scores_gemma":[0.00006104657,0.0010858506,0.0056913034,0.00008792383,0.00013270836,0.004500056,0.00013922874,0.10692672,0.8212194,0.0047494723,0.055300258,0.00010596418],"about_ca_topic_score_codex":0.00037845602,"about_ca_topic_score_gemma":0.00057529344,"teacher_disagreement_score":0.0042265994,"about_ca_system_score_codex":0.00018805618,"about_ca_system_score_gemma":0.00015239544,"threshold_uncertainty_score":0.014139354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013074117,0.00016554481,0.98205155,0.0001814186,0.00006673559,0.00017617163,0.00015184887,0.0002544567,0.0038781313],"genre_scores_gemma":[0.37839434,0.00046614496,0.61281765,0.0006157918,0.00033736834,0.0015123506,0.00038160762,0.00017638046,0.0052982667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98528033,0.01007391,0.0004713241,0.0016915151,0.0019856198,0.00049726944],"domain_scores_gemma":[0.91351,0.06266157,0.003120169,0.01575504,0.0039351033,0.0010181442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013532475,0.0014279642,0.0018068803,0.0012060198,0.00096429256,0.0013763799,0.0018233176,0.001809831,0.008519097],"category_scores_gemma":[0.055719737,0.0015054804,0.0010629091,0.0020379596,0.0023872093,0.0026897897,0.002301507,0.0018225315,0.0019008315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020641088,0.0002903221,0.004551864,0.00072238967,0.0004446361,0.00049005914,0.00034409625,0.116503276,0.022371951,0.63598174,0.0055579143,0.21067771],"study_design_scores_gemma":[0.00041973984,0.0009556547,0.0018470024,0.00013428964,0.00027048154,0.0006785861,0.00007138432,0.4059611,0.008021089,0.5724608,0.009071294,0.00010859396],"about_ca_topic_score_codex":0.000496793,"about_ca_topic_score_gemma":0.0012799638,"teacher_disagreement_score":0.013532475,"about_ca_system_score_codex":0.0007371398,"about_ca_system_score_gemma":0.0022055944,"threshold_uncertainty_score":0.071567416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8029417,0.001054019,0.09227626,0.0014713921,0.00031931346,0.000048641174,0.00052393804,0.00038917668,0.10097548],"genre_scores_gemma":[0.98236173,0.00038567488,0.005151098,0.00022234827,0.00022003299,0.00003889072,0.00023443015,0.00007026622,0.011315499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996519,0.00007556554,0.00001387255,0.00007273918,0.00010000112,0.00008592474],"domain_scores_gemma":[0.999226,0.0002541473,0.00014653055,0.00007028635,0.00013564984,0.00016738607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034415873,0.00063340843,0.00048684652,0.0021932016,0.0009012724,0.0018575541,0.0007628356,0.0008553777,0.010416741],"category_scores_gemma":[0.0008814067,0.00026207336,0.00042685008,0.001013447,0.0014157082,0.0015760636,0.00077568623,0.0008298181,0.0009805051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006545016,0.000035055935,0.00020512626,0.000025779203,0.00000781391,0.00014271503,0.00017359054,0.0017130681,0.0051588905,0.9860773,0.0011796779,0.00521548],"study_design_scores_gemma":[0.000029980258,0.000038736478,0.0004923629,0.000021556027,0.00000641868,0.00018803179,0.00014982796,0.015765006,0.0017531263,0.97923297,0.0023005684,0.000021338361],"about_ca_topic_score_codex":0.00094104337,"about_ca_topic_score_gemma":0.0007449765,"teacher_disagreement_score":0.010416741,"about_ca_system_score_codex":0.00071218464,"about_ca_system_score_gemma":0.00060742546,"threshold_uncertainty_score":0.034847498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65301996,0.0007519603,0.18741795,0.0032715139,0.0006458821,0.00018305141,0.00086264865,0.0010443934,0.15280262],"genre_scores_gemma":[0.898105,0.00033427248,0.051570974,0.0007378621,0.0004219781,0.00022263057,0.0010269105,0.0003302253,0.047250237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915504,0.00017043868,0.000050487637,0.000161817,0.00019305297,0.00026909987],"domain_scores_gemma":[0.99698,0.001222935,0.00045745907,0.00024637772,0.0005342967,0.00055887457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930326,0.0013382719,0.0012667937,0.0022250144,0.0023733522,0.0028670044,0.001104947,0.0024628325,0.018347874],"category_scores_gemma":[0.0043960228,0.0009135433,0.0010960887,0.00090991426,0.002382923,0.0029401723,0.0039001189,0.002534676,0.0023183567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079232466,0.00024380599,0.0024867405,0.00034459084,0.00008369067,0.00069916603,0.00089095737,0.0063244137,0.01670029,0.94052905,0.008675374,0.02222951],"study_design_scores_gemma":[0.00024223122,0.00021805851,0.0017537569,0.000070200265,0.000052186766,0.00075497734,0.0010338561,0.040941376,0.007200239,0.9339141,0.013739899,0.000079165664],"about_ca_topic_score_codex":0.00026093295,"about_ca_topic_score_gemma":0.00031790102,"teacher_disagreement_score":0.018347874,"about_ca_system_score_codex":0.0007102638,"about_ca_system_score_gemma":0.00051455374,"threshold_uncertainty_score":0.06137979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9588555,0.000061326835,0.0110217,0.00018828377,0.000050427127,0.0000326842,0.000062992985,0.00006542068,0.029661698],"genre_scores_gemma":[0.9923574,0.00005566651,0.0029961036,0.000055850178,0.00004262864,0.000029729605,0.000109963934,0.000016660772,0.004336071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953437,0.000064529355,0.00002948689,0.0000995437,0.00010492074,0.00016721721],"domain_scores_gemma":[0.9995134,0.00014137721,0.00009176353,0.000064088155,0.000043511274,0.00014593653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003007026,0.0002570699,0.000301222,0.0015497494,0.001524075,0.0019680967,0.00029749973,0.0006339194,0.00574438],"category_scores_gemma":[0.0013580407,0.00025732297,0.00031044648,0.00056127086,0.0015817569,0.0012110578,0.001400183,0.00071284396,0.0005882577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000248604,0.00012997967,0.0041675265,0.00002456347,0.000011155022,0.00072356896,0.0008248843,0.00071593747,0.01830131,0.9558835,0.0011154985,0.017853409],"study_design_scores_gemma":[0.0001715097,0.00025208853,0.006948539,0.000049438153,0.000029659934,0.001892727,0.0014293356,0.015797293,0.01993537,0.9389341,0.014502939,0.000056983823],"about_ca_topic_score_codex":0.00039093933,"about_ca_topic_score_gemma":0.000412853,"teacher_disagreement_score":0.00574438,"about_ca_system_score_codex":0.0006950794,"about_ca_system_score_gemma":0.00030469664,"threshold_uncertainty_score":0.019216835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7475958,0.0009350156,0.19161905,0.00060148357,0.00015911515,0.00003787702,0.000363541,0.00027361186,0.058414444],"genre_scores_gemma":[0.9766167,0.0003075847,0.01817866,0.00008919049,0.000116882125,0.00004540346,0.00023053821,0.00007132688,0.004343673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982893,0.00033923835,0.00011726061,0.00031081802,0.0006853237,0.00025804975],"domain_scores_gemma":[0.99222046,0.0043036253,0.0006688072,0.0006321683,0.0011705481,0.0010044914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011565974,0.0004886341,0.0007236401,0.0020494256,0.0010646214,0.0024760114,0.001348736,0.00066419,0.005631464],"category_scores_gemma":[0.0115405135,0.0002885451,0.00033105825,0.00064811995,0.0023296268,0.0033653826,0.0029794162,0.001712458,0.001244608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031642214,0.00007598883,0.0020810082,0.00016223786,0.000027615533,0.0002135395,0.0004420245,0.01177669,0.009479284,0.95383656,0.001132152,0.020456515],"study_design_scores_gemma":[0.000018365337,0.00009447677,0.0008246236,0.00004033881,0.000009888883,0.00035301218,0.00014990174,0.020820284,0.008519985,0.96561116,0.0035269368,0.000031025796],"about_ca_topic_score_codex":0.00015781351,"about_ca_topic_score_gemma":0.00016058868,"teacher_disagreement_score":0.005631464,"about_ca_system_score_codex":0.0007433178,"about_ca_system_score_gemma":0.00038093605,"threshold_uncertainty_score":0.01883918},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01682758,0.00992049,0.8716473,0.006168152,0.0013298385,0.00009297794,0.00052836444,0.0017645452,0.091720805],"genre_scores_gemma":[0.63430387,0.011488621,0.27540082,0.00413326,0.004829801,0.0010414493,0.0008662405,0.003524031,0.06441198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928572,0.0027832687,0.00020642753,0.001109939,0.002093005,0.00095012464],"domain_scores_gemma":[0.9597597,0.031216927,0.001379884,0.0035942672,0.0024480077,0.0016012347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0115964,0.0058457833,0.0045408495,0.008179218,0.0028042533,0.0075201024,0.007297764,0.004838473,0.024739934],"category_scores_gemma":[0.04483085,0.0018799807,0.0025500038,0.005798349,0.0074413787,0.017755158,0.010367819,0.011710447,0.009098329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039859957,0.000117958145,0.00035978857,0.00048246104,0.000089248104,0.00011041026,0.00034447887,0.025085818,0.0026316347,0.9197655,0.013944034,0.03667001],"study_design_scores_gemma":[0.000027062335,0.000057366848,0.0002797337,0.00022817925,0.00007818188,0.00011790878,0.000064018466,0.1056459,0.0020495192,0.8845282,0.0068446696,0.000079251],"about_ca_topic_score_codex":0.0010538438,"about_ca_topic_score_gemma":0.0019306,"teacher_disagreement_score":0.024739934,"about_ca_system_score_codex":0.0044512907,"about_ca_system_score_gemma":0.002547348,"threshold_uncertainty_score":0.082763255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47273794,0.00034046054,0.48408017,0.0004060492,0.000066987224,0.0001494876,0.0004019456,0.00033855866,0.041478354],"genre_scores_gemma":[0.86468583,0.00027633892,0.11957303,0.00014627693,0.00003064032,0.00027500733,0.00045122724,0.00010739779,0.014454174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.00012619051,0.000026296937,0.000081434795,0.000109788256,0.00008654506],"domain_scores_gemma":[0.99929655,0.00023738414,0.00013855187,0.00010281601,0.00014016301,0.00008442345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003716812,0.0006216238,0.00046284572,0.0006783077,0.0006053255,0.0012776363,0.000642417,0.0008811669,0.007164654],"category_scores_gemma":[0.0014900848,0.00054843404,0.00035266613,0.0005567025,0.00054794626,0.0013803252,0.0011815515,0.0008019663,0.0008741728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007488673,0.00013705091,0.0012643561,0.00031435865,0.00007034138,0.00035903795,0.00049980433,0.10467919,0.047107078,0.7507509,0.003271523,0.09079753],"study_design_scores_gemma":[0.00018805041,0.00043918405,0.0012348653,0.00012017242,0.000059292215,0.0003143194,0.00028773618,0.32033676,0.023387957,0.63575494,0.01782772,0.00004898893],"about_ca_topic_score_codex":0.00079243263,"about_ca_topic_score_gemma":0.0010888169,"teacher_disagreement_score":0.007164654,"about_ca_system_score_codex":0.0008000047,"about_ca_system_score_gemma":0.0005532217,"threshold_uncertainty_score":0.02396816},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0764201,0.29334265,0.3821147,0.006674858,0.0039898204,0.00021684365,0.00068261294,0.0010849956,0.2354734],"genre_scores_gemma":[0.48757392,0.1789149,0.28407553,0.0023461075,0.0042787977,0.00038423942,0.0009718982,0.00077701226,0.040677544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861586,0.00044517763,0.00015307091,0.00030785354,0.0003820583,0.0000959582],"domain_scores_gemma":[0.9971982,0.0016707379,0.00018626114,0.0003809164,0.0004370782,0.00012678391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002111812,0.000782945,0.0010355755,0.0054762745,0.0016047698,0.0023481036,0.0012611552,0.0014384998,0.0052208784],"category_scores_gemma":[0.0059334086,0.00069053355,0.000638372,0.007767064,0.0025283475,0.005535834,0.0016969256,0.0022002952,0.0025171475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057617865,0.000049175236,0.0004710953,0.00056097767,0.000010464491,0.00011635743,0.00040156447,0.0015178729,0.0014077714,0.8547353,0.004164882,0.13650696],"study_design_scores_gemma":[0.000017525777,0.00012082135,0.0005615065,0.00068821694,0.000019294452,0.0013649664,0.00021236845,0.0061137215,0.0034682683,0.6054684,0.3818774,0.0000876045],"about_ca_topic_score_codex":0.00050844817,"about_ca_topic_score_gemma":0.00039195194,"teacher_disagreement_score":0.0054762745,"about_ca_system_score_codex":0.0019073834,"about_ca_system_score_gemma":0.0010631628,"threshold_uncertainty_score":0.017465591},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07112115,0.024738885,0.58811283,0.024960347,0.0022024098,0.00054223445,0.006692523,0.0034109964,0.27821875],"genre_scores_gemma":[0.77176267,0.014374828,0.12279766,0.0062187784,0.003538509,0.0019674578,0.00638522,0.0022865096,0.0706683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918516,0.0019473354,0.0002304688,0.0011639444,0.002215956,0.00259063],"domain_scores_gemma":[0.93823,0.05018081,0.0015624708,0.0041712862,0.003622468,0.0022330203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009451835,0.0046592015,0.0044330726,0.0053091473,0.0038055805,0.011359036,0.0055915685,0.003925621,0.029911272],"category_scores_gemma":[0.05259462,0.0015871456,0.0025857904,0.004681403,0.0050476287,0.013111434,0.0073413593,0.011446001,0.00890618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023312294,0.0006668573,0.0028276504,0.0022843196,0.00032314006,0.00041972214,0.0013322767,0.09976795,0.008902457,0.68762755,0.11029198,0.083224945],"study_design_scores_gemma":[0.00017119334,0.00028166367,0.0018892599,0.0007173565,0.000354154,0.0005056493,0.00053577014,0.28242934,0.0056313258,0.67858624,0.028751211,0.00014683412],"about_ca_topic_score_codex":0.006013136,"about_ca_topic_score_gemma":0.009384292,"teacher_disagreement_score":0.029911272,"about_ca_system_score_codex":0.010805185,"about_ca_system_score_gemma":0.0062882984,"threshold_uncertainty_score":0.100063205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7270847,0.0006121647,0.12785767,0.0016952582,0.00044422076,0.00006384988,0.00025417877,0.00038735467,0.14160062],"genre_scores_gemma":[0.9733131,0.00020870996,0.008364584,0.0002645214,0.00011500036,0.0000401229,0.00008929841,0.00006618763,0.017538473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.000076507604,0.000012814513,0.000049488826,0.00007069255,0.0000798105],"domain_scores_gemma":[0.9991923,0.0003084925,0.00011339381,0.00013644916,0.00011106153,0.0001383965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037389918,0.0004989949,0.00050698855,0.0012345938,0.001474798,0.0027244072,0.00068041333,0.0011136858,0.008465661],"category_scores_gemma":[0.0027045503,0.00034643552,0.00032207643,0.0007814722,0.002322083,0.0029956973,0.0016276799,0.0010630591,0.0008436446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000591209,0.000016421103,0.00026991233,0.000016605307,0.000002144406,0.00016060646,0.00011509934,0.0005410573,0.002043082,0.99268806,0.00061747414,0.0034704313],"study_design_scores_gemma":[0.000009136163,0.000009723317,0.0001145294,0.0000069531047,0.000002966539,0.00019316327,0.00010613381,0.004989727,0.0010981865,0.99206233,0.0013973045,0.000009933121],"about_ca_topic_score_codex":0.00026797623,"about_ca_topic_score_gemma":0.00046309727,"teacher_disagreement_score":0.008465661,"about_ca_system_score_codex":0.00042609227,"about_ca_system_score_gemma":0.00054607086,"threshold_uncertainty_score":0.028320432},"labels":[],"label_agreement":null},{"id":"W2085573612","doi":"10.1002/jcd.20193","title":"Enumeration of generalized Hadamard matrices of order 16 and related designs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; St. Peter's Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Combinatorics; Enumeration; Order (exchange); Hadamard matrix; Discrete mathematics; Mathematical analysis","score_opus":0.018614123445215187,"score_gpt":0.21668646009965148,"score_spread":0.1980723366544363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085573612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83452666,0.00046170317,0.1450042,0.00028960424,0.000046822424,0.00014210347,0.0003566728,0.00024042398,0.018931733],"genre_scores_gemma":[0.90150833,0.00018642079,0.091706604,0.000058353744,0.000023512312,0.00010036354,0.00041021276,0.00003443863,0.0059717605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998904,0.00031770536,0.000095062605,0.0001280452,0.00036855906,0.00018665395],"domain_scores_gemma":[0.9972474,0.0011826465,0.0006283831,0.00043504435,0.0003591441,0.0001473757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007072105,0.00045502608,0.00042537256,0.0012262635,0.00067796337,0.0012936206,0.0004196383,0.0006380885,0.0033325998],"category_scores_gemma":[0.0033593583,0.000320502,0.000516165,0.001282937,0.0009250578,0.0014230047,0.00069571,0.0005390628,0.0004648952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008018242,0.00030552215,0.011591884,0.0004210172,0.000074079704,0.0013308754,0.00093726924,0.101804495,0.06265375,0.63641596,0.0028179064,0.18084547],"study_design_scores_gemma":[0.00020069725,0.00094907376,0.0038115496,0.00015815136,0.00007240545,0.0024854767,0.000601412,0.2565195,0.07538683,0.637365,0.022309577,0.00014036403],"about_ca_topic_score_codex":0.00045763317,"about_ca_topic_score_gemma":0.0007687272,"teacher_disagreement_score":0.0033325998,"about_ca_system_score_codex":0.0007056429,"about_ca_system_score_gemma":0.00069447455,"threshold_uncertainty_score":0.011148632},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232293,0.00070571294,0.21394998,0.0015079306,0.0005300508,0.000109075794,0.00024722467,0.00030737135,0.05941332],"genre_scores_gemma":[0.9355454,0.00037009508,0.039089587,0.0003487361,0.00023853079,0.000096899086,0.00013300353,0.00005281895,0.02412487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00024502465,0.000043563152,0.00010809276,0.00016485795,0.00017055517],"domain_scores_gemma":[0.99839336,0.0005726213,0.00042356024,0.00020850393,0.00019628588,0.000205607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667852,0.00074542174,0.00060215034,0.0016627405,0.0012697382,0.0024962716,0.0006757353,0.0011473338,0.004597432],"category_scores_gemma":[0.0017533654,0.00043108175,0.00054492644,0.0012263632,0.0021878018,0.0028661855,0.0012220942,0.0014444394,0.00057765824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010452838,0.000017532968,0.00024233795,0.000021639777,0.0000082059,0.00012864225,0.00014874879,0.0039005168,0.001930858,0.9879067,0.0004784574,0.005111912],"study_design_scores_gemma":[0.0000274813,0.000053898882,0.00018834136,0.000019618414,0.000010016265,0.00016120187,0.00012392552,0.018957531,0.002953607,0.97456914,0.002908255,0.000026891152],"about_ca_topic_score_codex":0.00097288314,"about_ca_topic_score_gemma":0.0014966925,"teacher_disagreement_score":0.004597432,"about_ca_system_score_codex":0.0012843485,"about_ca_system_score_gemma":0.00096847594,"threshold_uncertainty_score":0.015379906},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25913692,0.0024784491,0.14481618,0.003574628,0.0012714104,0.00011892302,0.0009985222,0.0003595602,0.5872454],"genre_scores_gemma":[0.9166442,0.0011000803,0.02920009,0.001056121,0.0006159867,0.00014424961,0.00054626924,0.00012470412,0.050568253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00021419501,0.000037348236,0.0001338025,0.00020396338,0.00014276085],"domain_scores_gemma":[0.9976788,0.00137164,0.00019270707,0.00014662983,0.00039888575,0.00021140625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663291,0.00048171126,0.00061139767,0.0026505121,0.0021340083,0.0045316787,0.0005570527,0.00111313,0.018831702],"category_scores_gemma":[0.0050743697,0.00040210577,0.00061690866,0.0019575786,0.0019976546,0.00374733,0.0016351965,0.0014572234,0.0016035235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020943478,0.000008393606,0.000077477984,0.000015441414,0.000002622742,0.000045746117,0.000065457774,0.00012863324,0.00033650463,0.9941004,0.0012500606,0.003948236],"study_design_scores_gemma":[0.000010314904,0.000007729235,0.00012690896,0.000023162012,0.000014731477,0.00022179841,0.00009550509,0.002198344,0.0010364583,0.9881777,0.008075638,0.000011573272],"about_ca_topic_score_codex":0.00095924316,"about_ca_topic_score_gemma":0.0011739575,"teacher_disagreement_score":0.018831702,"about_ca_system_score_codex":0.001240237,"about_ca_system_score_gemma":0.0007794912,"threshold_uncertainty_score":0.062998295},"labels":[],"label_agreement":null},{"id":"W2086203055","doi":"10.1002/jcd.20253","title":"New results on GDDs, covering, packing and directable designs with block size 5","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Northern British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Block size; Block (permutation group theory); Type (biology); Upper and lower bounds; Extension (predicate logic); Class (philosophy); Discrete mathematics; Computer science","score_opus":0.010785763754290831,"score_gpt":0.20712132106714284,"score_spread":0.19633555731285202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086203055","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51881796,0.0020431024,0.41080573,0.00044549786,0.00021497656,0.00016415009,0.00032595076,0.0005504253,0.06663217],"genre_scores_gemma":[0.8000137,0.000851898,0.18572007,0.00018886696,0.00014298555,0.00015156996,0.00038738607,0.000088850175,0.012454615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999258,0.00019703471,0.00005468321,0.00009323775,0.00027962006,0.00011745502],"domain_scores_gemma":[0.9988331,0.00060743664,0.00018336586,0.00017800587,0.000120243836,0.00007787484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056788995,0.00066870014,0.00054059917,0.00095369894,0.00039326053,0.00079406955,0.0005656209,0.0005656082,0.0049154735],"category_scores_gemma":[0.0023452467,0.00043584386,0.0006407486,0.0008020171,0.0008897285,0.0011523552,0.0007985222,0.0007161574,0.00065818947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044097775,0.00028470167,0.004570505,0.0007045601,0.00009886593,0.0006276039,0.0005050979,0.14778939,0.03857963,0.6112852,0.006220693,0.18889266],"study_design_scores_gemma":[0.00026195723,0.0018261969,0.0032894844,0.00019047491,0.00011835499,0.0016977856,0.00029782462,0.36397606,0.04092282,0.5242614,0.06307712,0.00008047145],"about_ca_topic_score_codex":0.00075575407,"about_ca_topic_score_gemma":0.0010140771,"teacher_disagreement_score":0.0049154735,"about_ca_system_score_codex":0.00081199204,"about_ca_system_score_gemma":0.0004510384,"threshold_uncertainty_score":0.016443908},"labels":[],"label_agreement":null},{"id":"W2086211490","doi":"10.1002/1520-6610(2001)9:2<79::aid-jcd1000>3.0.co;2-b","title":"Class-uniformly resolvable designs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Class (philosophy); Block (permutation group theory); Block size; Resolution (logic); Discrete mathematics; Block design; Computer science; Key (lock)","score_opus":0.025362088995684495,"score_gpt":0.22952727849013357,"score_spread":0.2041651894944491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086211490","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47750878,0.0011135829,0.46417737,0.0003735373,0.000080339225,0.00020953195,0.0006035323,0.00046319747,0.055470034],"genre_scores_gemma":[0.9028491,0.00035760985,0.091283135,0.00014963716,0.00004695735,0.0001519223,0.00042739886,0.000052683605,0.0046815695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978288,0.0005866287,0.00010128714,0.00043023747,0.00057081087,0.00048209543],"domain_scores_gemma":[0.99007773,0.0051769014,0.0014175756,0.002287646,0.000756412,0.00028360207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017216146,0.0004849961,0.00062576577,0.0011655649,0.0010695389,0.0014166145,0.0012464545,0.0010753302,0.006093122],"category_scores_gemma":[0.0090183625,0.00036579743,0.0007165283,0.00097484456,0.0011765513,0.0017695441,0.000999614,0.0012937536,0.00081506645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004374778,0.0001421006,0.0032592623,0.0002494155,0.00007383403,0.00029045306,0.00026635022,0.049972072,0.020644179,0.8240342,0.0024561551,0.098174475],"study_design_scores_gemma":[0.00017650885,0.0005406566,0.0019837609,0.00013808855,0.00008823073,0.0026355304,0.00029551663,0.25638348,0.070877306,0.6378356,0.028922861,0.00012236652],"about_ca_topic_score_codex":0.0003254818,"about_ca_topic_score_gemma":0.00054508203,"teacher_disagreement_score":0.006093122,"about_ca_system_score_codex":0.0009005119,"about_ca_system_score_gemma":0.00072479364,"threshold_uncertainty_score":0.020383477},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70561504,0.000747817,0.15590408,0.0012040811,0.0002787952,0.00013363504,0.0007450636,0.00028277969,0.13508871],"genre_scores_gemma":[0.9474522,0.000509847,0.026004633,0.00037197935,0.0001477408,0.0001347572,0.00072060374,0.00012393868,0.024534442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996039,0.00008416062,0.00001657003,0.000072840085,0.0001273748,0.00009514437],"domain_scores_gemma":[0.9989561,0.0003477631,0.00021601228,0.00010132753,0.00018489799,0.0001937899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028452175,0.00054257375,0.0006690214,0.0023872887,0.0022283047,0.0026414203,0.0009240545,0.0011517506,0.011689295],"category_scores_gemma":[0.0014915046,0.0005538949,0.00044396246,0.002008808,0.0013116311,0.0022198227,0.0012428038,0.0018368773,0.001083079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052843043,0.000017319602,0.00027721675,0.000034509707,0.0000062702684,0.00010700895,0.00019799868,0.0020451052,0.00127451,0.9879814,0.0015814009,0.0064244303],"study_design_scores_gemma":[0.0000139939975,0.000014958003,0.0003896454,0.000020646276,0.000007497558,0.00013184734,0.00022878301,0.011827232,0.0006082082,0.9825865,0.00415864,0.000011957949],"about_ca_topic_score_codex":0.0022012135,"about_ca_topic_score_gemma":0.003422901,"teacher_disagreement_score":0.011689295,"about_ca_system_score_codex":0.0011796902,"about_ca_system_score_gemma":0.00054057036,"threshold_uncertainty_score":0.03910464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6555255,0.00089624693,0.10593303,0.003919261,0.00020167413,0.00018265232,0.0011037375,0.00042064977,0.23181719],"genre_scores_gemma":[0.91609526,0.00092240534,0.038032092,0.00071229605,0.00015930287,0.00030816358,0.0011665028,0.00038140718,0.042222608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985979,0.00039412867,0.0000528136,0.00014489755,0.0003116227,0.00049855013],"domain_scores_gemma":[0.9906871,0.0060275216,0.0011754083,0.0004915034,0.00061878,0.0009997762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905772,0.00083804806,0.0011556107,0.0026040669,0.006411736,0.004793119,0.0020681797,0.0015772682,0.014863294],"category_scores_gemma":[0.0066396412,0.0010239459,0.00093964254,0.0018618725,0.0034883555,0.0035352577,0.0020876555,0.0032043883,0.0016372248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020266217,0.000051196766,0.00029885644,0.00003442079,0.0000080176915,0.000054399854,0.00044826887,0.0068533383,0.0011715039,0.98480356,0.002919769,0.0031540901],"study_design_scores_gemma":[0.00007001926,0.000032937074,0.0006496528,0.000053446704,0.000019927662,0.00009078126,0.00043048023,0.042253118,0.0013503651,0.9510313,0.0039835433,0.00003431272],"about_ca_topic_score_codex":0.0087020835,"about_ca_topic_score_gemma":0.009798873,"teacher_disagreement_score":0.014863294,"about_ca_system_score_codex":0.0033783957,"about_ca_system_score_gemma":0.003058331,"threshold_uncertainty_score":0.049722612},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90613526,0.00046567057,0.05279346,0.00067634747,0.0001280886,0.000036929992,0.00017302578,0.00016863234,0.03942257],"genre_scores_gemma":[0.9804128,0.00015477573,0.012767751,0.00011307048,0.00009148111,0.000040598137,0.00014464073,0.000037725094,0.0062371613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951625,0.00010908585,0.00003637421,0.000109475106,0.000119563454,0.00010937721],"domain_scores_gemma":[0.99784946,0.0009779371,0.00032990807,0.00038540378,0.00017826643,0.00027902628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006358554,0.0004951261,0.000530917,0.0016274251,0.0014230757,0.0021682335,0.0007233001,0.0014828764,0.0026387323],"category_scores_gemma":[0.002774643,0.0004677597,0.0006342041,0.0007007605,0.0027439583,0.0023540144,0.0009401118,0.0014498339,0.00029636428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009959912,0.000028478562,0.0004921964,0.000030454941,0.000006100004,0.00018475232,0.00024859267,0.00081158016,0.0051872544,0.9884545,0.00050487934,0.00395156],"study_design_scores_gemma":[0.000063752086,0.00009098796,0.0007365542,0.00002613834,0.000017481938,0.0009668936,0.00015914123,0.016038023,0.00683858,0.9705611,0.0044468944,0.000054496722],"about_ca_topic_score_codex":0.0003389455,"about_ca_topic_score_gemma":0.00043101684,"teacher_disagreement_score":0.0026387323,"about_ca_system_score_codex":0.0008750736,"about_ca_system_score_gemma":0.00069633743,"threshold_uncertainty_score":0.008827448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29816246,0.008557138,0.40728867,0.0034847194,0.0011447796,0.00019129681,0.0012328374,0.0032503295,0.27668768],"genre_scores_gemma":[0.9363834,0.000876862,0.049251538,0.0006036075,0.00043490727,0.00016059406,0.0006913639,0.0006321157,0.010965621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976903,0.0005954427,0.000074216594,0.0002886455,0.00065730413,0.0006940616],"domain_scores_gemma":[0.9896549,0.0073774783,0.0008142165,0.0011299517,0.00046033954,0.0005630014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017046096,0.0012860413,0.0012683499,0.0040175603,0.0021435288,0.0033766895,0.0036802343,0.0016395288,0.022965662],"category_scores_gemma":[0.016411828,0.0008810154,0.001275008,0.0023982078,0.003152813,0.005778638,0.0038063868,0.004256945,0.0024196866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005128161,0.0003116297,0.006595832,0.00050931104,0.00012464265,0.0011711641,0.00053137523,0.087794624,0.0017183947,0.80630624,0.025855679,0.06856835],"study_design_scores_gemma":[0.00003053377,0.000025635476,0.00060632377,0.00009986493,0.00002511242,0.00025219304,0.00011257075,0.14944103,0.000988021,0.8441524,0.0042239525,0.000042342894],"about_ca_topic_score_codex":0.0024718763,"about_ca_topic_score_gemma":0.0042906418,"teacher_disagreement_score":0.022965662,"about_ca_system_score_codex":0.0015028464,"about_ca_system_score_gemma":0.0008177333,"threshold_uncertainty_score":0.076827824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7317035,0.00081504625,0.089241266,0.004801544,0.0006698616,0.000052004532,0.00069635926,0.0006569423,0.17136341],"genre_scores_gemma":[0.97507215,0.00025107598,0.011142226,0.00051770644,0.00029445605,0.000026636551,0.00047177981,0.00015545642,0.012068576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894756,0.00016246541,0.000043953747,0.00041113864,0.0001957165,0.00023913893],"domain_scores_gemma":[0.99681073,0.0013947275,0.00055477367,0.0004936213,0.00045128536,0.00029477762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007631439,0.0002927079,0.00058937137,0.00076075,0.0015977314,0.0028081015,0.0007391622,0.0018320394,0.013869322],"category_scores_gemma":[0.0057417527,0.00048214884,0.00045456045,0.00092800235,0.0040201466,0.006122758,0.0010824837,0.001206488,0.0011684535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002655692,0.000034151355,0.0020218927,0.00013021375,0.000026710648,0.000619695,0.000568586,0.001855301,0.0051569277,0.961067,0.005858731,0.022395294],"study_design_scores_gemma":[0.00004169864,0.00009312094,0.0025637657,0.000044538843,0.000035095833,0.001457015,0.0020186675,0.006090404,0.0072382363,0.963625,0.016709141,0.00008328891],"about_ca_topic_score_codex":0.0012444545,"about_ca_topic_score_gemma":0.0015048197,"teacher_disagreement_score":0.013869322,"about_ca_system_score_codex":0.0007363945,"about_ca_system_score_gemma":0.0007542285,"threshold_uncertainty_score":0.046397507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08546548,0.0015163195,0.7626668,0.003663699,0.0009254673,0.00050836615,0.0028164308,0.0020373652,0.14040004],"genre_scores_gemma":[0.50421995,0.0014233844,0.42078307,0.0016109012,0.000290667,0.00054200523,0.0022340314,0.0004607389,0.06843533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987696,0.0003561407,0.00010588658,0.00016175736,0.00033003598,0.00027655155],"domain_scores_gemma":[0.9984914,0.00063330686,0.00010025158,0.0004654777,0.00021991215,0.000089622896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010173314,0.0005526604,0.00062854885,0.0009257945,0.002003278,0.0022287725,0.0009836588,0.0014008539,0.011737905],"category_scores_gemma":[0.0031041056,0.00039938532,0.00060998276,0.0012566467,0.0010869618,0.0021444815,0.0027150605,0.001797759,0.0052307863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033771782,0.000074901574,0.0003034327,0.00018738872,0.00003118321,0.00019552336,0.0004535748,0.0065608625,0.012779946,0.87481016,0.01626304,0.088002354],"study_design_scores_gemma":[0.00020209045,0.00016083485,0.00033369134,0.00019221785,0.00005290071,0.0005243187,0.00020138724,0.03685186,0.018366124,0.88121843,0.0617834,0.00011270092],"about_ca_topic_score_codex":0.001324432,"about_ca_topic_score_gemma":0.002266071,"teacher_disagreement_score":0.011737905,"about_ca_system_score_codex":0.0012686659,"about_ca_system_score_gemma":0.002489429,"threshold_uncertainty_score":0.039267242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17444335,0.0015431563,0.613149,0.0026699523,0.0016180957,0.00014439765,0.00022895634,0.00073749386,0.2054656],"genre_scores_gemma":[0.78294075,0.0013275685,0.1295636,0.0019421211,0.0009767791,0.00028495258,0.00020352371,0.0004567403,0.08230395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870956,0.0006127944,0.000062376756,0.00023250181,0.00026771362,0.000114963565],"domain_scores_gemma":[0.9975655,0.0010891585,0.00042106528,0.00046452257,0.0003092939,0.00015043293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007962093,0.00091349974,0.00062479475,0.0013349525,0.00086519826,0.0020773099,0.0006253712,0.0014839444,0.010989321],"category_scores_gemma":[0.005396284,0.0005088916,0.0004679871,0.0015779779,0.0019038655,0.0025009685,0.002019334,0.0012851977,0.0029047872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006106519,0.000020784946,0.00019916221,0.000040750336,0.000014188357,0.00015997778,0.00011025793,0.0022044934,0.004870683,0.9719092,0.0021600965,0.018249314],"study_design_scores_gemma":[0.000028530827,0.00004986929,0.00025798313,0.000030994237,0.0000134738975,0.0006911563,0.000089238085,0.019666668,0.005934665,0.9618923,0.011316373,0.00002868065],"about_ca_topic_score_codex":0.00012654708,"about_ca_topic_score_gemma":0.00019328835,"teacher_disagreement_score":0.010989321,"about_ca_system_score_codex":0.00044981623,"about_ca_system_score_gemma":0.00042406077,"threshold_uncertainty_score":0.036762893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12633455,0.0006814623,0.70945233,0.0012952111,0.00030796867,0.000321396,0.00094816886,0.0010028499,0.15965615],"genre_scores_gemma":[0.70691615,0.00091681,0.23267108,0.000778999,0.00016651016,0.00040411318,0.0009934681,0.0002787688,0.05687405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992316,0.0002243702,0.000031452346,0.00016099369,0.0002317949,0.00011976845],"domain_scores_gemma":[0.99839574,0.00049475493,0.00016330012,0.00047206902,0.00033958963,0.00013459298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381895,0.00049,0.00052313355,0.0008827338,0.0008934043,0.0014052498,0.00083380373,0.0009579777,0.014522293],"category_scores_gemma":[0.002970869,0.00038946627,0.00043012085,0.0014533229,0.00068649714,0.0015074235,0.0012965637,0.0012065805,0.0020882117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016554665,0.00007798972,0.00032370756,0.00017001801,0.000026969314,0.00008344572,0.00016085857,0.021103786,0.0071796603,0.8661077,0.011362214,0.09323827],"study_design_scores_gemma":[0.000114981565,0.00014964606,0.00039817442,0.00005376285,0.000040800925,0.0002570975,0.00014693216,0.12258096,0.0066700773,0.837946,0.031612363,0.00002910612],"about_ca_topic_score_codex":0.0011871114,"about_ca_topic_score_gemma":0.002232349,"teacher_disagreement_score":0.014522293,"about_ca_system_score_codex":0.00093518535,"about_ca_system_score_gemma":0.0011288642,"threshold_uncertainty_score":0.0485819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11276666,0.0010499646,0.80712336,0.0010033221,0.00020940113,0.00006926509,0.00034231934,0.0002818564,0.07715379],"genre_scores_gemma":[0.80556464,0.001600933,0.16078807,0.00089234597,0.00038261502,0.00026596294,0.0005609587,0.00021285051,0.0297317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993081,0.0001792892,0.00004628654,0.00016347898,0.00020803504,0.000094738076],"domain_scores_gemma":[0.9976882,0.0014966932,0.0002021142,0.00027825843,0.00021261266,0.00012216959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010304571,0.00089002703,0.0007728261,0.0015698874,0.0011126895,0.0022356394,0.0009972175,0.0013035417,0.008680572],"category_scores_gemma":[0.0033109873,0.00062750257,0.0011417837,0.0012334384,0.0021295473,0.0049352096,0.0019539988,0.0025273652,0.000970348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025547244,0.000017810919,0.00008971147,0.000046324807,0.000009621099,0.00003671282,0.00011197798,0.0025518427,0.0009912382,0.9865893,0.0008163385,0.008713563],"study_design_scores_gemma":[0.0000136850185,0.00003189664,0.00008464469,0.000027427299,0.000013138557,0.00012977138,0.000049127637,0.011055965,0.0010075694,0.9832827,0.0042885863,0.000015482923],"about_ca_topic_score_codex":0.0004859512,"about_ca_topic_score_gemma":0.0004590142,"teacher_disagreement_score":0.008680572,"about_ca_system_score_codex":0.001008031,"about_ca_system_score_gemma":0.00045128094,"threshold_uncertainty_score":0.029039443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07096519,0.0014111855,0.8962582,0.0010371457,0.00018299588,0.00008518113,0.00014624571,0.00048731003,0.02942653],"genre_scores_gemma":[0.85146415,0.0018655389,0.13062213,0.00052699086,0.00023852265,0.00015761537,0.0001583793,0.00012821092,0.014838464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993206,0.00019108367,0.000026037922,0.000080774684,0.0002760486,0.00010538613],"domain_scores_gemma":[0.9976659,0.0012388491,0.00025537977,0.0004255101,0.00034016324,0.00007424565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067978265,0.0005482443,0.00038770723,0.0006147699,0.00061010016,0.0011630555,0.0005907774,0.0008312109,0.004271825],"category_scores_gemma":[0.004746637,0.00016088557,0.00033093392,0.0010298231,0.0016122751,0.0016040113,0.0011670948,0.0012849566,0.0010274721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007367418,0.000034225555,0.00033267002,0.00011116515,0.000010717153,0.00016255293,0.00016319896,0.09286997,0.011215013,0.8471991,0.0018499568,0.045977715],"study_design_scores_gemma":[0.000021948921,0.00013254047,0.00013165182,0.00005004895,0.000016076468,0.00033283516,0.00006936187,0.4643854,0.016595531,0.507597,0.010622363,0.00004530602],"about_ca_topic_score_codex":0.0007226057,"about_ca_topic_score_gemma":0.0008361601,"teacher_disagreement_score":0.004271825,"about_ca_system_score_codex":0.0010251357,"about_ca_system_score_gemma":0.00082971295,"threshold_uncertainty_score":0.01429069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6467517,0.0032317636,0.12131134,0.005882751,0.0008322257,0.00011907737,0.0009332948,0.00050468376,0.22043325],"genre_scores_gemma":[0.95768344,0.0014069409,0.021064563,0.00067859254,0.001878519,0.00009028808,0.0006688854,0.00017648052,0.016352357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932873,0.00015622315,0.00004653474,0.00016233037,0.00022298533,0.000083134386],"domain_scores_gemma":[0.9961068,0.0021383103,0.0005443428,0.00048728907,0.00033378456,0.0003894682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007214951,0.0006807061,0.0007818908,0.0032163374,0.0014384922,0.004419087,0.0011426569,0.0008660516,0.010212534],"category_scores_gemma":[0.0030743699,0.00065338914,0.00069480686,0.0027600045,0.0034135527,0.007022893,0.0015530984,0.0024783998,0.00083722116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063057196,0.000063011146,0.0008373737,0.00006351129,0.000011617647,0.00018982896,0.00044480452,0.00074739294,0.0017967307,0.9806886,0.002394033,0.012700065],"study_design_scores_gemma":[0.000025309799,0.000022281565,0.0005712271,0.00001322228,0.000015318381,0.00041821887,0.00020001591,0.0026245352,0.00060202874,0.9902075,0.0052831736,0.000017146187],"about_ca_topic_score_codex":0.00028862542,"about_ca_topic_score_gemma":0.00043502965,"teacher_disagreement_score":0.010212534,"about_ca_system_score_codex":0.00093394803,"about_ca_system_score_gemma":0.0003238481,"threshold_uncertainty_score":0.03416437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08851928,0.00029939986,0.7759391,0.0016281069,0.0005295869,0.00017733053,0.00030376096,0.00076624146,0.13183717],"genre_scores_gemma":[0.721426,0.00058289093,0.19641668,0.00089142116,0.00026302307,0.00047871997,0.00049386814,0.00075632293,0.078691155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876946,0.0003866128,0.00008120974,0.00017000463,0.0003532354,0.00023938126],"domain_scores_gemma":[0.9982332,0.000682445,0.00016374353,0.0004150488,0.00028840787,0.00021708531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012168782,0.0008094268,0.000707406,0.0020603605,0.0027941335,0.003592421,0.0013364913,0.0018789558,0.016873287],"category_scores_gemma":[0.004307516,0.0008530323,0.0012043071,0.0020349226,0.0032305785,0.005508459,0.003590645,0.003327665,0.0034224342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000990094,0.000008572196,0.000028251918,0.000010183444,0.0000015911121,0.00004192796,0.00007513145,0.0001600255,0.0005977339,0.9957897,0.00053760456,0.0027394595],"study_design_scores_gemma":[0.000009936274,0.000008695482,0.000021269918,0.000009219679,0.0000037802101,0.00007484913,0.00005329144,0.0021113174,0.0010126599,0.99300295,0.0036842264,0.0000078748035],"about_ca_topic_score_codex":0.00026568942,"about_ca_topic_score_gemma":0.00047365087,"teacher_disagreement_score":0.016873287,"about_ca_system_score_codex":0.00087506615,"about_ca_system_score_gemma":0.0007238228,"threshold_uncertainty_score":0.05644679},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32574722,0.0024781653,0.524974,0.003364219,0.00087791076,0.000072401985,0.000537647,0.00049646274,0.14145194],"genre_scores_gemma":[0.9389049,0.0011703856,0.02524163,0.00041789233,0.00078796106,0.000047668986,0.00021829417,0.00010464265,0.03310664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949276,0.00014274001,0.000018610392,0.000107096734,0.00015229719,0.00008657215],"domain_scores_gemma":[0.9981933,0.0006508807,0.0003271199,0.00017216927,0.00040940044,0.00024705657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065658026,0.00048081324,0.00047903048,0.0019233009,0.0005101653,0.0017649679,0.0006727095,0.0007541379,0.006841759],"category_scores_gemma":[0.003661932,0.00023410635,0.00028593582,0.0011392876,0.0015818999,0.0032537607,0.0010259721,0.0015576992,0.0012010519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006277243,0.000017262288,0.00022417691,0.00003513985,0.000004927311,0.00006909032,0.0000691122,0.003482286,0.0022176919,0.9806371,0.001447676,0.0117327925],"study_design_scores_gemma":[0.000014217896,0.000040963027,0.00034014857,0.000014706016,0.0000049374166,0.00027566514,0.000034550132,0.036733393,0.0015576093,0.9557675,0.005191882,0.000024435683],"about_ca_topic_score_codex":0.00050527713,"about_ca_topic_score_gemma":0.0003526038,"teacher_disagreement_score":0.006841759,"about_ca_system_score_codex":0.0008596785,"about_ca_system_score_gemma":0.0008038618,"threshold_uncertainty_score":0.022887945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23529509,0.0016949882,0.7077589,0.0010099986,0.00039890234,0.00038359576,0.0007610891,0.0009474581,0.0517499],"genre_scores_gemma":[0.80105996,0.0010594642,0.17866604,0.00076886965,0.00023924171,0.0005341394,0.0007653719,0.00023042344,0.016676418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00026051834,0.00005237388,0.000081207116,0.00028561032,0.00013340739],"domain_scores_gemma":[0.99838924,0.00074205507,0.00023479122,0.0003448383,0.00019554034,0.00009348528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083535776,0.00085323385,0.0005512993,0.0011803613,0.00059286196,0.0009705617,0.0005248444,0.0015992633,0.0052958373],"category_scores_gemma":[0.003041027,0.0004165759,0.0005457641,0.0011071782,0.0010814149,0.0010487995,0.0012659903,0.0011693191,0.0019548044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000985209,0.00010124423,0.0007291517,0.0003589779,0.00004829569,0.0003454559,0.00039309342,0.03308827,0.071070924,0.7908625,0.0044549694,0.097561985],"study_design_scores_gemma":[0.0002674377,0.000705554,0.0010895793,0.00033938172,0.00006567602,0.0009402233,0.000074401796,0.12314369,0.09727909,0.74774265,0.028211322,0.00014099013],"about_ca_topic_score_codex":0.0004003465,"about_ca_topic_score_gemma":0.0007490213,"teacher_disagreement_score":0.0052958373,"about_ca_system_score_codex":0.0008349877,"about_ca_system_score_gemma":0.0012917946,"threshold_uncertainty_score":0.017716348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112616435,0.0005867748,0.5988878,0.0011973277,0.0007059869,0.0005324375,0.0012555644,0.0011208971,0.28309682],"genre_scores_gemma":[0.699192,0.000968925,0.15138626,0.001250747,0.0004100054,0.000608546,0.0015226505,0.000446305,0.14421462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984977,0.0004481135,0.00006542795,0.0004062773,0.00038435258,0.00019809091],"domain_scores_gemma":[0.9978357,0.0005232389,0.00021293592,0.00075212505,0.00048666738,0.00018934417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173076,0.0008442139,0.0006173089,0.0014409133,0.0012392417,0.0022164993,0.00095713243,0.0011498897,0.026368707],"category_scores_gemma":[0.0028675213,0.00053286605,0.00071671954,0.0011188426,0.0011281553,0.0028394607,0.0015843388,0.001155609,0.005577838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005314596,0.000046940117,0.00012228076,0.000055229066,0.000012199485,0.000049268456,0.00007165852,0.0013373302,0.0028807695,0.9665359,0.004234263,0.024600992],"study_design_scores_gemma":[0.000047688238,0.00006820817,0.00013679473,0.00003087647,0.000029393546,0.00021204932,0.000084947016,0.008860822,0.004896888,0.95738876,0.02822594,0.000017610724],"about_ca_topic_score_codex":0.00038943323,"about_ca_topic_score_gemma":0.00071765285,"teacher_disagreement_score":0.026368707,"about_ca_system_score_codex":0.00096845237,"about_ca_system_score_gemma":0.0011510684,"threshold_uncertainty_score":0.08821213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5770623,0.00069416437,0.3455781,0.0033388818,0.00015296221,0.00023569285,0.0022177328,0.0005271831,0.070192926],"genre_scores_gemma":[0.9300704,0.0008648576,0.046537794,0.000855656,0.00049367966,0.00034154815,0.0031151876,0.00036020167,0.017360695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984487,0.00046781974,0.00011183927,0.0004189176,0.0003339267,0.00021861156],"domain_scores_gemma":[0.9866665,0.008121063,0.0015281051,0.00094287586,0.0013630656,0.0013783613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014793912,0.0009987772,0.0011959763,0.0043825777,0.00266239,0.004728055,0.0022376347,0.0017103342,0.008439316],"category_scores_gemma":[0.011403675,0.0009925914,0.00095009385,0.0041939137,0.0028449125,0.0074216216,0.0032829582,0.002937023,0.0010752964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000168016,0.0001146853,0.0031344683,0.00013900433,0.000021850656,0.0001547219,0.00057677564,0.002946573,0.0055100387,0.9689078,0.004116909,0.014209141],"study_design_scores_gemma":[0.000020765332,0.00005650802,0.0014156171,0.000057714824,0.000028789365,0.0004178664,0.00038245926,0.033158455,0.0017704319,0.9567526,0.0059136483,0.000025107825],"about_ca_topic_score_codex":0.00077312667,"about_ca_topic_score_gemma":0.00069790805,"teacher_disagreement_score":0.008439316,"about_ca_system_score_codex":0.0015289591,"about_ca_system_score_gemma":0.000669913,"threshold_uncertainty_score":0.028232276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26082203,0.005709879,0.48415563,0.0075413836,0.0024213262,0.0001393135,0.000769483,0.002703883,0.23573725],"genre_scores_gemma":[0.78684807,0.0015788642,0.14194918,0.0027449485,0.0007175864,0.00024614934,0.00078058505,0.00028290955,0.06485163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764794,0.00053404184,0.00017101117,0.0005213371,0.0007071566,0.00041846168],"domain_scores_gemma":[0.9924722,0.0030683368,0.000783757,0.0020692123,0.0012290828,0.00037750637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011224824,0.0011792161,0.0018992923,0.0014331712,0.0023193725,0.0043086223,0.0016352261,0.0032966216,0.019275093],"category_scores_gemma":[0.0076957927,0.0007949819,0.00055117527,0.0013834488,0.0022471072,0.0073154164,0.002041451,0.0023073042,0.008313785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014177111,0.0002597441,0.0027752896,0.00068223954,0.00010851956,0.00036044087,0.00045904497,0.0057481322,0.04565978,0.7489811,0.016506616,0.17704135],"study_design_scores_gemma":[0.00017167072,0.00034261614,0.0011495531,0.00015270182,0.00008432264,0.0014162741,0.0006412527,0.01875154,0.04259225,0.856507,0.07797322,0.00021765445],"about_ca_topic_score_codex":0.00018825081,"about_ca_topic_score_gemma":0.00033946533,"teacher_disagreement_score":0.019275093,"about_ca_system_score_codex":0.0006056152,"about_ca_system_score_gemma":0.0006006792,"threshold_uncertainty_score":0.064481616},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028905742,0.00020390627,0.96097946,0.00020011861,0.00040054074,0.00006356387,0.00011651505,0.00041749683,0.008712712],"genre_scores_gemma":[0.25913432,0.00032716387,0.72314787,0.00030821847,0.00018718766,0.00010853228,0.00029025722,0.00021954796,0.016276855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971133,0.000071413706,0.0000118847265,0.00005377178,0.00012385326,0.000027736894],"domain_scores_gemma":[0.99948186,0.00014278243,0.000047817917,0.00010966224,0.00015483612,0.00006306659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259128,0.00082787126,0.000461936,0.0006451317,0.0003599859,0.0007145181,0.00072900957,0.0008532623,0.004751847],"category_scores_gemma":[0.0015476259,0.00031730332,0.00043664334,0.00097592775,0.00039501936,0.0007176241,0.00048862176,0.0008521796,0.0012863018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004990506,0.0002671944,0.000689658,0.00026704717,0.00011650894,0.0004929177,0.000129066,0.1022891,0.1877337,0.32926363,0.012725336,0.36552668],"study_design_scores_gemma":[0.00009826195,0.00019109347,0.00081624667,0.000036223504,0.00009520924,0.00067025033,0.000037947826,0.85156566,0.038866784,0.0849362,0.022578705,0.00010744662],"about_ca_topic_score_codex":0.00048375243,"about_ca_topic_score_gemma":0.0013848704,"teacher_disagreement_score":0.004751847,"about_ca_system_score_codex":0.00028951478,"about_ca_system_score_gemma":0.00047218218,"threshold_uncertainty_score":0.015896559},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10477389,0.0011226252,0.8480242,0.0007692605,0.00018393484,0.00016388079,0.00037997557,0.00021171213,0.0443704],"genre_scores_gemma":[0.48632163,0.0014404963,0.5000837,0.0004891847,0.00017020994,0.00064260303,0.0006531535,0.00016952025,0.0100295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989619,0.00033761773,0.00007975317,0.00014473406,0.00034524067,0.00013065698],"domain_scores_gemma":[0.9980679,0.00097432337,0.00031934815,0.00025760435,0.0002512576,0.00012950836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008289803,0.00078381214,0.0006949652,0.0017689125,0.0008792718,0.001966594,0.0008220381,0.00081479584,0.003122274],"category_scores_gemma":[0.0035221078,0.00075814384,0.00084926793,0.0018176334,0.0014384141,0.0016218919,0.0017611871,0.0014333377,0.0006033105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006785923,0.00006893714,0.0003676877,0.00016912931,0.000022488357,0.00013405374,0.00014376012,0.05607608,0.0053799776,0.8982512,0.0029306693,0.03638812],"study_design_scores_gemma":[0.00009293189,0.00014841864,0.0004196687,0.00009614354,0.000035707064,0.0004198811,0.00012735007,0.24818017,0.006951809,0.7266356,0.016805908,0.000086517925],"about_ca_topic_score_codex":0.00038178728,"about_ca_topic_score_gemma":0.0005886789,"teacher_disagreement_score":0.003122274,"about_ca_system_score_codex":0.001231681,"about_ca_system_score_gemma":0.0008412432,"threshold_uncertainty_score":0.010445058},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2778026,0.0013060434,0.68062365,0.0018888133,0.00017149738,0.000115402385,0.00015150086,0.00034862346,0.03759194],"genre_scores_gemma":[0.9660887,0.00040834965,0.030696725,0.00012971039,0.000044064156,0.00010310237,0.0000408322,0.000067228466,0.0024212478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996296,0.00016545971,0.000008381033,0.000020747608,0.00012685874,0.00004889944],"domain_scores_gemma":[0.9973636,0.0020024835,0.00013403264,0.00017700477,0.0002544487,0.000068407055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016022437,0.00046531908,0.0006964842,0.0007958361,0.0008351301,0.00094308483,0.0009945745,0.0010982701,0.0018990301],"category_scores_gemma":[0.0050884406,0.00035431338,0.00045832843,0.00075177767,0.0016197715,0.0016047705,0.00072256057,0.0009445772,0.00024160363],"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.00001638681,0.000013879574,0.00012499743,0.000019591453,0.000006767254,0.00002262454,0.0000169911,0.9611237,0.0006045833,0.036903106,0.00012938141,0.0010180183],"study_design_scores_gemma":[0.0000017951184,0.0000018867336,0.000013147797,0.0000021475066,9.183497e-7,0.0000022475303,0.0000017197428,0.9972607,0.00010166436,0.0025720568,0.00003997921,0.000001829503],"about_ca_topic_score_codex":0.00642841,"about_ca_topic_score_gemma":0.00565252,"teacher_disagreement_score":0.00642841,"about_ca_system_score_codex":0.0014729509,"about_ca_system_score_gemma":0.0013622462,"threshold_uncertainty_score":0.012781978},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22292833,0.0010272439,0.7336906,0.0007549357,0.00034377986,0.000698628,0.0012653138,0.00095535035,0.03833574],"genre_scores_gemma":[0.75740767,0.00050874695,0.23502797,0.00030245347,0.000111578185,0.00067351374,0.00059487,0.00012041822,0.005252697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996415,0.0018693908,0.00014764164,0.00029645156,0.0006598344,0.0006116676],"domain_scores_gemma":[0.9876195,0.0058403905,0.0015421548,0.0028131087,0.0016741345,0.00051058363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022694115,0.0007449708,0.0006411805,0.0012566276,0.0010157678,0.0009795873,0.001039733,0.0009885206,0.007234082],"category_scores_gemma":[0.013671334,0.0005132254,0.00052150304,0.0019134934,0.0013252553,0.0006114493,0.0009910903,0.00071754615,0.0015932748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061078873,0.00046251316,0.0061647277,0.00070530584,0.00028180555,0.0011244725,0.0006649977,0.2875584,0.042158846,0.4174211,0.015070295,0.22227961],"study_design_scores_gemma":[0.0015190336,0.0042902487,0.00455094,0.00036009875,0.00040008605,0.0025024263,0.00042608724,0.6612133,0.06515328,0.2015711,0.05764016,0.0003732797],"about_ca_topic_score_codex":0.0019280096,"about_ca_topic_score_gemma":0.0033288242,"teacher_disagreement_score":0.007234082,"about_ca_system_score_codex":0.00083365676,"about_ca_system_score_gemma":0.0017477417,"threshold_uncertainty_score":0.02420044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045749877,0.0020439094,0.9422351,0.0004357322,0.00017803667,0.00008376511,0.00011919716,0.0002857371,0.008868589],"genre_scores_gemma":[0.8410998,0.0023668397,0.14693461,0.0001722608,0.0002040317,0.00019313097,0.00021364565,0.000061210216,0.008754436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960715,0.00011508324,0.000013204738,0.0000331216,0.00019704305,0.000034350025],"domain_scores_gemma":[0.9989378,0.00065923564,0.000104177234,0.00009470387,0.00018011253,0.000023977564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004270147,0.0004933792,0.00028866975,0.0004406054,0.00039076735,0.0006004351,0.0005352874,0.0006336198,0.0013328589],"category_scores_gemma":[0.0029688608,0.00020366005,0.00020877857,0.00064768863,0.0006635927,0.000573977,0.0005328841,0.0005755984,0.00041262168],"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.00021172351,0.000057609912,0.0005380191,0.00024200867,0.00003523004,0.00022155647,0.00017095676,0.2606852,0.026586516,0.6023878,0.002450271,0.10641324],"study_design_scores_gemma":[0.000035160174,0.0000519122,0.00015043959,0.000033567194,0.000013673711,0.00009993569,0.000017164552,0.8243364,0.0049315672,0.16665277,0.0036608109,0.00001667381],"about_ca_topic_score_codex":0.0014263781,"about_ca_topic_score_gemma":0.0018117324,"teacher_disagreement_score":0.0014263781,"about_ca_system_score_codex":0.0007724859,"about_ca_system_score_gemma":0.0008595994,"threshold_uncertainty_score":0.005604863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86666256,0.00033222247,0.12975416,0.00016647781,0.00001774463,0.000024905235,0.000018710243,0.00015172079,0.0028714372],"genre_scores_gemma":[0.992722,0.000108346394,0.006671223,0.000015212982,0.000009941102,0.0000071813015,0.000007931,0.000012753688,0.00044534088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993893,0.00021781833,0.000013931435,0.000047859838,0.000225294,0.000105751795],"domain_scores_gemma":[0.99542737,0.0035639086,0.0005318728,0.00013791514,0.00024336146,0.00009553895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010971982,0.0004477109,0.00037667272,0.00047036863,0.00028544338,0.0006362379,0.00037500792,0.0005359345,0.00045045684],"category_scores_gemma":[0.005900395,0.00021381884,0.00018742589,0.0004985532,0.0009985104,0.0010899802,0.0006523501,0.00033835857,0.0000886797],"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.0014865585,0.0002708533,0.0057774163,0.00018710947,0.00009694798,0.00078427466,0.0003459836,0.60281694,0.2613482,0.08939249,0.00029278715,0.037200414],"study_design_scores_gemma":[0.00003625984,0.00019488983,0.0010135267,0.000008529389,0.000022420976,0.0001269237,0.000031766016,0.95993084,0.027963264,0.010479099,0.0001742934,0.0000181474],"about_ca_topic_score_codex":0.00097243226,"about_ca_topic_score_gemma":0.0008810674,"teacher_disagreement_score":0.0010971982,"about_ca_system_score_codex":0.00074702676,"about_ca_system_score_gemma":0.00041806814,"threshold_uncertainty_score":0.0058026314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8710342,0.0011982197,0.10387908,0.0009342064,0.000027001961,0.000047431877,0.00047185156,0.0002772587,0.022130767],"genre_scores_gemma":[0.9812275,0.0008261092,0.013918709,0.00015092024,0.00006632557,0.000053013267,0.0003382412,0.00006196773,0.0033572426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993981,0.00022256866,0.000027420636,0.00010431464,0.0000932391,0.00015436139],"domain_scores_gemma":[0.99581593,0.0028086843,0.00053542934,0.0003466635,0.00018447558,0.000308828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063479727,0.00044924606,0.00047994597,0.0017371908,0.0008641882,0.0014225154,0.0005560078,0.0004845446,0.0027264876],"category_scores_gemma":[0.004839545,0.00045101476,0.00036034436,0.00177552,0.0013627758,0.0029213752,0.0013070606,0.00063966925,0.00026495708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044032375,0.00008785536,0.010705226,0.00029360628,0.00005166194,0.00097463315,0.0014779307,0.074722536,0.02379995,0.8350481,0.003172442,0.049225703],"study_design_scores_gemma":[0.000040407365,0.00005043215,0.0060265767,0.00007404334,0.000043158463,0.0005959285,0.0003510219,0.16984648,0.0069825794,0.8110014,0.0049542286,0.000033641347],"about_ca_topic_score_codex":0.0037021597,"about_ca_topic_score_gemma":0.004724401,"teacher_disagreement_score":0.0037021597,"about_ca_system_score_codex":0.0017885375,"about_ca_system_score_gemma":0.000400642,"threshold_uncertainty_score":0.012976825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954034,0.00007597273,0.0038522042,0.000023723032,0.000008203779,0.00001857739,0.000031803833,0.00007134411,0.00051472563],"genre_scores_gemma":[0.9938519,0.000055484186,0.0053310534,0.000022500162,0.0000091657275,0.000032420852,0.00005363146,0.000020614354,0.0006232683],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895215,0.0003121265,0.0000652047,0.00016826035,0.0003510347,0.00015112277],"domain_scores_gemma":[0.9953158,0.0025870076,0.00036988818,0.00029714068,0.0012466761,0.00018359929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010082999,0.00035368063,0.00037406333,0.0005062731,0.00045742907,0.0004288729,0.0005101346,0.0005497039,0.0011962799],"category_scores_gemma":[0.0031062593,0.00027295706,0.00014309003,0.00045528705,0.0005527078,0.0006505567,0.0005115867,0.00033711153,0.00016693078],"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.001569149,0.00035626904,0.002597682,0.000132185,0.000056942026,0.00012531994,0.0003308379,0.004031688,0.976819,0.00067540864,0.00012998098,0.013175616],"study_design_scores_gemma":[0.00012369886,0.0029174401,0.006288598,0.000017234306,0.000078680736,0.00014829318,0.00010999467,0.021459205,0.96815914,0.00027367007,0.00038573355,0.00003824258],"about_ca_topic_score_codex":0.0007558009,"about_ca_topic_score_gemma":0.0009120513,"teacher_disagreement_score":0.0011962799,"about_ca_system_score_codex":0.00036773307,"about_ca_system_score_gemma":0.00020870731,"threshold_uncertainty_score":0.00533247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.737743,0.0014414957,0.17704211,0.0006648465,0.00043372624,0.00010095267,0.0003410532,0.0005780885,0.081654586],"genre_scores_gemma":[0.9365653,0.00055462326,0.032575667,0.00027753768,0.00044313085,0.00016340715,0.00054308283,0.00022248374,0.028654821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988882,0.0001980369,0.000081287275,0.00021919452,0.00037712202,0.00023616533],"domain_scores_gemma":[0.9976301,0.0010658733,0.00029347264,0.00026055265,0.00035367566,0.0003962219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009144647,0.00079950434,0.00086140895,0.0022412103,0.001966873,0.002210263,0.0008518334,0.00073272677,0.006293861],"category_scores_gemma":[0.0052801166,0.00039792902,0.00070475176,0.001129762,0.0017812508,0.003876954,0.002993714,0.001310436,0.0011589625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019802962,0.00006410309,0.0020087487,0.00011799744,0.000021837868,0.0006205449,0.00063668273,0.0030021532,0.009137423,0.96269083,0.0014318546,0.020069746],"study_design_scores_gemma":[0.000023156541,0.00011395462,0.0011535678,0.0000755502,0.000036167334,0.0008604721,0.00022007662,0.026485248,0.008704568,0.9536134,0.008670902,0.000043038497],"about_ca_topic_score_codex":0.00046051526,"about_ca_topic_score_gemma":0.0004454712,"teacher_disagreement_score":0.006293861,"about_ca_system_score_codex":0.00096569426,"about_ca_system_score_gemma":0.00049541576,"threshold_uncertainty_score":0.021055043},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42911685,0.0006363364,0.5609029,0.0005365574,0.00005748825,0.00007434553,0.00008912569,0.0011189634,0.007467358],"genre_scores_gemma":[0.9695967,0.00013706925,0.02902999,0.000052236217,0.000026518417,0.000018763423,0.00003924288,0.000024354818,0.0010751801],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959475,0.000101184436,0.000008414712,0.000042018466,0.00017971436,0.000073955496],"domain_scores_gemma":[0.9977068,0.0011387356,0.00020301995,0.00029744345,0.0005649466,0.00008911015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046527537,0.0002691361,0.00023194501,0.00049316196,0.0003897404,0.00053028937,0.0007516723,0.00045486906,0.00136715],"category_scores_gemma":[0.0029095584,0.00011670836,0.0000910588,0.0003573922,0.00058844103,0.001285691,0.00042538103,0.0004939622,0.0001413151],"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.0008212113,0.0003810369,0.011702398,0.00032584104,0.00006740566,0.0008194793,0.00047000966,0.107424915,0.29842046,0.10268359,0.007111674,0.469772],"study_design_scores_gemma":[0.000029972402,0.00024951232,0.0032372063,0.000016146847,0.000020181,0.0007427766,0.000064117354,0.84656394,0.123051554,0.020918993,0.0050762957,0.000029309522],"about_ca_topic_score_codex":0.0012825821,"about_ca_topic_score_gemma":0.0013071365,"teacher_disagreement_score":0.00136715,"about_ca_system_score_codex":0.00064769975,"about_ca_system_score_gemma":0.00037928167,"threshold_uncertainty_score":0.0046993494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2026747,0.00008945196,0.7687614,0.0001224744,0.000078175784,0.00011702349,0.000077002245,0.00024101548,0.027838893],"genre_scores_gemma":[0.7892909,0.0002643305,0.19410868,0.0000890387,0.000098741824,0.00022715979,0.00015762776,0.00027525212,0.015488383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915123,0.0001919044,0.00005763263,0.00013530701,0.00034009333,0.00012383146],"domain_scores_gemma":[0.9988105,0.00048038617,0.00010822686,0.00021931108,0.00023504042,0.00014650944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010432304,0.0003233705,0.00045500827,0.0014762818,0.0014016251,0.002511197,0.00090735045,0.0005680177,0.0048771417],"category_scores_gemma":[0.004256066,0.00034054831,0.0005753291,0.0008489261,0.0018884625,0.00273511,0.0017949397,0.0012227749,0.0010796856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017022798,0.00001776814,0.0003171662,0.000014198321,0.0000024035626,0.000099660494,0.00022432551,0.0031210924,0.0035001196,0.98341745,0.00019836951,0.009070407],"study_design_scores_gemma":[0.000016451366,0.000035420057,0.00032771836,0.000018674209,0.0000100390125,0.00036473537,0.00019262334,0.1071964,0.015101261,0.8714253,0.0052850144,0.000026345657],"about_ca_topic_score_codex":0.0004492801,"about_ca_topic_score_gemma":0.00048220146,"teacher_disagreement_score":0.0048771417,"about_ca_system_score_codex":0.00091050315,"about_ca_system_score_gemma":0.00064227346,"threshold_uncertainty_score":0.016315699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4927932,0.00061951,0.42134458,0.0016249802,0.00019162784,0.000104852836,0.000439352,0.00046723773,0.08241465],"genre_scores_gemma":[0.94829834,0.00035891793,0.037579406,0.00030402836,0.00026446252,0.00014081388,0.0003792999,0.00015494906,0.012519853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950193,0.0018736856,0.00028482513,0.0008935023,0.0012783117,0.00065031013],"domain_scores_gemma":[0.94746643,0.04033247,0.0025014444,0.006087836,0.0023499816,0.0012618555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036083038,0.0008341634,0.0013182497,0.0019458178,0.0027036988,0.0059957216,0.002551456,0.0021811104,0.0077318787],"category_scores_gemma":[0.022112696,0.0013851725,0.0017015791,0.0012638447,0.005879257,0.005037982,0.003197917,0.0048368247,0.0011551953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016420455,0.000060123337,0.00038512616,0.000048658585,0.000022090377,0.0001285814,0.00032722377,0.006787649,0.0021520988,0.98304594,0.000563433,0.006314906],"study_design_scores_gemma":[0.000034597335,0.00003407489,0.00007384411,0.000020256088,0.000012472691,0.00008863609,0.0000405914,0.011677013,0.001182,0.9860049,0.00081329216,0.000018397755],"about_ca_topic_score_codex":0.00069349405,"about_ca_topic_score_gemma":0.0009324885,"teacher_disagreement_score":0.0077318787,"about_ca_system_score_codex":0.0014812173,"about_ca_system_score_gemma":0.0015223961,"threshold_uncertainty_score":0.025865734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2355431,0.0007416476,0.7592024,0.00042594312,0.0000731954,0.00007306192,0.00004885649,0.00068491633,0.0032068335],"genre_scores_gemma":[0.85267437,0.00016595275,0.14612918,0.000115626,0.000037462767,0.00004253987,0.000034632132,0.000015247623,0.0007848991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966216,0.000077201265,0.000011623402,0.000043142827,0.00017735314,0.000028556136],"domain_scores_gemma":[0.9993807,0.00029121918,0.00011472704,0.00009071121,0.00009964341,0.000023024735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003176956,0.000377197,0.00023849419,0.00067889085,0.00032419624,0.00044193654,0.000631976,0.00051375,0.00040410206],"category_scores_gemma":[0.00085305184,0.00014830327,0.0002062002,0.00032428402,0.00051589817,0.00086857134,0.000483362,0.0002974246,0.0000982091],"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.00048701043,0.00026655805,0.0071145147,0.00026324484,0.00006364015,0.00030075863,0.00021840357,0.14745562,0.38797945,0.04336006,0.0014334496,0.41105723],"study_design_scores_gemma":[0.000044867822,0.0002883982,0.0011366509,0.000019041418,0.00003325741,0.0003115686,0.000018137613,0.89295715,0.09786755,0.005365171,0.0019210256,0.000037130667],"about_ca_topic_score_codex":0.00080502435,"about_ca_topic_score_gemma":0.0018009216,"teacher_disagreement_score":0.00080502435,"about_ca_system_score_codex":0.00044439035,"about_ca_system_score_gemma":0.0003452333,"threshold_uncertainty_score":0.0032243729},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18572529,0.00039411423,0.8079659,0.00013201714,0.000055796412,0.000065709515,0.000025047137,0.000289749,0.005346371],"genre_scores_gemma":[0.9409232,0.00009685052,0.057418607,0.000034639917,0.000033020435,0.000040063776,0.0000138666555,0.000012161332,0.0014276191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.00009337913,0.000015288246,0.00004610504,0.00012101861,0.00006320072],"domain_scores_gemma":[0.99975866,0.00008759322,0.000040194835,0.000041569674,0.000049499085,0.000022513912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004103745,0.00042447532,0.00041727937,0.00034862204,0.0004407388,0.00054579065,0.00081924914,0.00034777043,0.0015214512],"category_scores_gemma":[0.00060086156,0.00017843883,0.00018927854,0.00035233313,0.00042891872,0.0007920107,0.0005821976,0.00028877435,0.00020765646],"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.0007172084,0.00030447898,0.0009369418,0.00018069906,0.00009467019,0.00040962335,0.00025345664,0.59248245,0.09452705,0.044557054,0.0014698472,0.26406655],"study_design_scores_gemma":[0.000034134413,0.00010632631,0.0001748875,0.000005603096,0.000020107505,0.00008255808,0.00001943726,0.98756534,0.0075271744,0.003303635,0.001146067,0.000014727839],"about_ca_topic_score_codex":0.0009035178,"about_ca_topic_score_gemma":0.0014315179,"teacher_disagreement_score":0.0015214512,"about_ca_system_score_codex":0.00040409644,"about_ca_system_score_gemma":0.0003280941,"threshold_uncertainty_score":0.0050897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61940634,0.0010972684,0.3218166,0.0012263232,0.00009346441,0.000056119763,0.00044829518,0.00034501855,0.055510525],"genre_scores_gemma":[0.98215336,0.00048653944,0.010994979,0.00009755514,0.00015341227,0.00003125564,0.00019958534,0.000070867834,0.0058125067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.00017098275,0.000021787331,0.00010294468,0.0001631342,0.000105013525],"domain_scores_gemma":[0.99387383,0.0035042034,0.0010390541,0.00036312357,0.000683037,0.00053674524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007867294,0.00079950056,0.0005921851,0.0026914557,0.0007919129,0.002455809,0.0008428973,0.00087005063,0.006960581],"category_scores_gemma":[0.007124255,0.0005077239,0.00032040427,0.0012929462,0.0020124842,0.0024617012,0.0010635605,0.0018152178,0.00062332203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015542719,0.00004041497,0.0009578729,0.00006727209,0.000022416409,0.00020495993,0.00027125212,0.014266638,0.006400437,0.9674895,0.0015204966,0.008603453],"study_design_scores_gemma":[0.000030750944,0.000076784265,0.0015134505,0.00003703358,0.000018075338,0.0003070319,0.00022345867,0.12796597,0.0032887124,0.8645447,0.0019520138,0.00004208602],"about_ca_topic_score_codex":0.0006631255,"about_ca_topic_score_gemma":0.00068122434,"teacher_disagreement_score":0.006960581,"about_ca_system_score_codex":0.000789557,"about_ca_system_score_gemma":0.00039937146,"threshold_uncertainty_score":0.023285449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30282092,0.0066961297,0.47794038,0.008255721,0.0014625873,0.000047799957,0.00045110506,0.00015607612,0.20216933],"genre_scores_gemma":[0.92237717,0.0029038885,0.021073822,0.0013085289,0.0011089725,0.00006426591,0.0002539365,0.0001411901,0.050768152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995739,0.0001622722,0.000016080581,0.00006489109,0.0001163751,0.00006640125],"domain_scores_gemma":[0.9983631,0.001116556,0.00013188172,0.000116947405,0.00016593687,0.00010563938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084508077,0.0006396183,0.0006129544,0.001681558,0.0008336941,0.001486987,0.0008569554,0.0015575576,0.0088467365],"category_scores_gemma":[0.003517216,0.00029319362,0.00035980422,0.0015029996,0.0025705856,0.0030519452,0.001206638,0.0015140891,0.0008393703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021604994,0.000010705585,0.00009904992,0.000026619164,0.000005427542,0.00003519787,0.0000668012,0.0063382937,0.00070687034,0.9874407,0.0009251739,0.004323592],"study_design_scores_gemma":[0.000003770007,0.0000067086107,0.00011585013,0.000012237981,0.0000018830262,0.000035492376,0.000031971373,0.019492982,0.00015298273,0.979055,0.0010817529,0.000009478321],"about_ca_topic_score_codex":0.000767593,"about_ca_topic_score_gemma":0.0007283922,"teacher_disagreement_score":0.0088467365,"about_ca_system_score_codex":0.00067273935,"about_ca_system_score_gemma":0.0003798427,"threshold_uncertainty_score":0.029595256},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16741817,0.0012623399,0.35085854,0.0037324072,0.00066037336,0.00012933694,0.001289241,0.0009163691,0.47373316],"genre_scores_gemma":[0.8144116,0.0008522957,0.050241064,0.0009407711,0.00033592168,0.00007790112,0.00070669455,0.0005438149,0.13188988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.00011406521,0.000030987147,0.00019121903,0.00029224178,0.00018282425],"domain_scores_gemma":[0.9988071,0.00041073968,0.00007496001,0.00024282455,0.00023319006,0.00023120178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005471673,0.0008422109,0.0010327342,0.0022489876,0.0022521107,0.00435485,0.0012832932,0.0014114099,0.024664052],"category_scores_gemma":[0.0021897252,0.00066880975,0.0009437541,0.0015642426,0.0032438908,0.006817191,0.004640584,0.0047905426,0.0029203396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006469775,0.0000050712447,0.00002838717,0.000010755296,0.0000018693609,0.000013752008,0.00007840132,0.00026367168,0.00028627462,0.9963492,0.00077270373,0.0021833559],"study_design_scores_gemma":[0.0000029721546,0.000003241262,0.00004134316,0.000005409231,0.0000032538146,0.00004059079,0.00004095681,0.0011016229,0.00028615168,0.99305445,0.005414697,0.0000054285015],"about_ca_topic_score_codex":0.0018110055,"about_ca_topic_score_gemma":0.0022801058,"teacher_disagreement_score":0.024664052,"about_ca_system_score_codex":0.0018744932,"about_ca_system_score_gemma":0.0006179349,"threshold_uncertainty_score":0.08250946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007451967,0.00004445732,0.99115115,0.0000413306,0.000017185195,0.000044819597,0.000017488464,0.00015164111,0.0010798839],"genre_scores_gemma":[0.068200134,0.00007182888,0.92990375,0.000052586623,0.000017848426,0.000119477496,0.00009783961,0.000051959,0.0014844881],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999278,0.00018373117,0.00003986385,0.00010644746,0.00031341417,0.00007845696],"domain_scores_gemma":[0.99921846,0.00035429437,0.00007686726,0.00014902685,0.00016712466,0.000034242228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000594917,0.00051275693,0.00040457502,0.0007123611,0.0005982253,0.0005964462,0.0009594173,0.0006176329,0.0013168807],"category_scores_gemma":[0.0020251174,0.00029813094,0.0005270957,0.0006701895,0.0006934429,0.00075366837,0.001157526,0.0008249611,0.0006632177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033075723,0.00014632288,0.00094996666,0.0001575925,0.00007994125,0.00020043789,0.00026089378,0.22435091,0.05346359,0.1429716,0.0033864356,0.57370156],"study_design_scores_gemma":[0.00012263212,0.00022245127,0.00028138421,0.000032510274,0.00003940708,0.0005182367,0.00006454129,0.8742253,0.040891442,0.07018948,0.013346962,0.00006563254],"about_ca_topic_score_codex":0.0006379882,"about_ca_topic_score_gemma":0.00089867413,"teacher_disagreement_score":0.0013168807,"about_ca_system_score_codex":0.00055140676,"about_ca_system_score_gemma":0.0010630069,"threshold_uncertainty_score":0.0044053793},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06951741,0.014505778,0.56825364,0.0034894887,0.00422112,0.00023324759,0.0006203083,0.00027987605,0.33887923],"genre_scores_gemma":[0.5516812,0.025571167,0.28818092,0.00465185,0.006221806,0.00077955506,0.001577858,0.0003872523,0.12094838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984719,0.00046480674,0.00009775547,0.00029539282,0.00044044512,0.00022975398],"domain_scores_gemma":[0.9984269,0.0006756173,0.00019705886,0.00024085696,0.0003677116,0.00009193185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011255002,0.0010449128,0.00052805746,0.0015400457,0.0013135793,0.0016876278,0.0006012835,0.0010426978,0.012890162],"category_scores_gemma":[0.0040873555,0.00042071336,0.00094030175,0.0013487848,0.0025105833,0.003584316,0.0023671654,0.002400744,0.0026286107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000128817865,0.0000130567605,0.000106416825,0.00006927575,0.000004477206,0.000060697195,0.00014378244,0.0010323524,0.00081534084,0.97839284,0.0029028752,0.016446112],"study_design_scores_gemma":[0.00000924995,0.000052017753,0.0001242143,0.000065176166,0.000005241091,0.00020873702,0.00007064638,0.0046021407,0.0009806675,0.9463103,0.047555335,0.00001637826],"about_ca_topic_score_codex":0.000765549,"about_ca_topic_score_gemma":0.0007270824,"teacher_disagreement_score":0.012890162,"about_ca_system_score_codex":0.0008947559,"about_ca_system_score_gemma":0.00071518373,"threshold_uncertainty_score":0.043121874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9711751,0.00007160626,0.02155767,0.00014426067,0.00003625418,0.000024511533,0.0000758244,0.00026864963,0.006646182],"genre_scores_gemma":[0.989032,0.000041628893,0.010251344,0.000019829875,0.000005105936,0.0000126415935,0.00002671113,0.000012490895,0.00059839454],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998871,0.000017593964,0.000004419755,0.000012776063,0.00006011718,0.00001798459],"domain_scores_gemma":[0.99978,0.000088051376,0.000026436484,0.000031970485,0.00003739729,0.000036122845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017405655,0.00018621671,0.00010660072,0.00014179658,0.00024858394,0.0002871099,0.00043301517,0.00023508248,0.00093764736],"category_scores_gemma":[0.00035496269,0.0000945944,0.0000736357,0.0001065496,0.00034067887,0.00030849507,0.00041809844,0.00033464973,0.00014931198],"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.00011837933,0.000055627384,0.00037531284,0.000042514344,0.000006023844,0.00016044806,0.00008147949,0.0009862547,0.9809474,0.0074735354,0.00023559161,0.009517418],"study_design_scores_gemma":[0.000021453901,0.00017995917,0.00086494937,0.000005550237,0.00000503653,0.00014903356,0.000022296193,0.023700157,0.9708164,0.002522242,0.0017048359,0.000008082203],"about_ca_topic_score_codex":0.00033468546,"about_ca_topic_score_gemma":0.00041818753,"teacher_disagreement_score":0.00093764736,"about_ca_system_score_codex":0.00018199661,"about_ca_system_score_gemma":0.00015613176,"threshold_uncertainty_score":0.0031366944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68762064,0.0039497344,0.18679558,0.0029521382,0.00046020147,0.00011318461,0.0010053758,0.0002651056,0.11683811],"genre_scores_gemma":[0.96083707,0.0016705316,0.016121555,0.00036534714,0.0002887299,0.00006529937,0.00043438838,0.000049707563,0.020167423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996105,0.00008119585,0.000012625459,0.00006980402,0.000109396184,0.00011656019],"domain_scores_gemma":[0.99886024,0.0004565171,0.00023972172,0.0001748559,0.0001241637,0.00014453464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029897003,0.00035971316,0.0005783502,0.0013029905,0.00108647,0.0016988171,0.00041196472,0.00070306496,0.007853348],"category_scores_gemma":[0.0018130773,0.00029218485,0.00032100565,0.0015231429,0.0024447143,0.0015527568,0.0012059278,0.0014465014,0.0007362061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008510559,0.000023656106,0.00048708293,0.0000342331,0.0000075603834,0.00007876117,0.00012129143,0.009547128,0.00090898416,0.9687034,0.0034840289,0.016518697],"study_design_scores_gemma":[0.000024763525,0.000039568346,0.00046154475,0.00002313773,0.000005585426,0.0001360308,0.00015547876,0.018440986,0.00059389096,0.9735796,0.0065203714,0.000019050556],"about_ca_topic_score_codex":0.0025190627,"about_ca_topic_score_gemma":0.0018626392,"teacher_disagreement_score":0.007853348,"about_ca_system_score_codex":0.0007305169,"about_ca_system_score_gemma":0.0005532512,"threshold_uncertainty_score":0.026272118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40742773,0.010972148,0.2559655,0.02076314,0.0038868014,0.0000645672,0.00054370565,0.00035222483,0.3000241],"genre_scores_gemma":[0.9037522,0.003981524,0.02577015,0.0022384308,0.003723314,0.00006337337,0.00027696355,0.00014412568,0.06004995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995641,0.0001765324,0.000015130326,0.00008821903,0.000084047555,0.00007193707],"domain_scores_gemma":[0.99758136,0.0011062459,0.00045236744,0.00021555008,0.00036918867,0.00027530495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009212901,0.00076994346,0.0005404627,0.0025986827,0.0013096144,0.00246592,0.0006084768,0.0014646937,0.010454248],"category_scores_gemma":[0.0042028367,0.00042481537,0.0005043143,0.0017306299,0.0024415778,0.004568557,0.00097277097,0.0025166292,0.0009674813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013835989,0.000007069024,0.000053904634,0.000012667493,0.0000024261885,0.00002154061,0.000035386063,0.00048398876,0.00020147543,0.99614584,0.0010187308,0.0020031594],"study_design_scores_gemma":[0.00000684501,0.0000061151245,0.00007750841,0.0000057514417,0.0000019931765,0.000053592437,0.000019643,0.0018185701,0.000114896175,0.9953029,0.0025863296,0.000005723891],"about_ca_topic_score_codex":0.00081568735,"about_ca_topic_score_gemma":0.000701408,"teacher_disagreement_score":0.010454248,"about_ca_system_score_codex":0.001150883,"about_ca_system_score_gemma":0.00052856177,"threshold_uncertainty_score":0.034972906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8391098,0.0007157783,0.12967995,0.00043349815,0.00010432207,0.0001286407,0.00059234013,0.00051956193,0.028716223],"genre_scores_gemma":[0.94871014,0.00035557203,0.042794634,0.00015981222,0.000077360295,0.000058201967,0.00066391414,0.00012694002,0.007053405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993285,0.00011860675,0.000041054143,0.00020955861,0.00011377954,0.00018854853],"domain_scores_gemma":[0.9977679,0.00083977083,0.00043222588,0.000501851,0.00021253276,0.00024567344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004153221,0.0004426474,0.0004607464,0.00095745263,0.0011996061,0.0012516315,0.0006704419,0.0006637669,0.0056934496],"category_scores_gemma":[0.0037884617,0.00047777986,0.0006866765,0.0007230379,0.0014800247,0.0018312641,0.0009088304,0.00080633594,0.0006807476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005909821,0.00014882382,0.007012727,0.0002831461,0.00005942111,0.000939413,0.0010414005,0.029574057,0.041910864,0.8513208,0.00575198,0.061366312],"study_design_scores_gemma":[0.000115954506,0.00027437857,0.004598863,0.00010019267,0.00007690651,0.0015143668,0.00078744156,0.06401171,0.022353375,0.8765571,0.029514534,0.00009510672],"about_ca_topic_score_codex":0.0018386741,"about_ca_topic_score_gemma":0.002940674,"teacher_disagreement_score":0.0056934496,"about_ca_system_score_codex":0.00072555663,"about_ca_system_score_gemma":0.00052079867,"threshold_uncertainty_score":0.019046426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8857312,0.0004719672,0.097226195,0.00023853421,0.00005236714,0.00003653512,0.0002857294,0.00036292532,0.015594555],"genre_scores_gemma":[0.99600536,0.000068623005,0.0031062537,0.000016109083,0.000009446111,0.000014529477,0.00005415057,0.000013291763,0.0007122131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999395,0.0001696565,0.000018745794,0.00005617662,0.00023302311,0.00012740381],"domain_scores_gemma":[0.9961662,0.0023589763,0.00021687333,0.00031310783,0.0008526232,0.00009226561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010952449,0.00036948745,0.000580431,0.00058824255,0.00058009446,0.00089491997,0.00079548993,0.00061898003,0.001843755],"category_scores_gemma":[0.0043980326,0.00021676344,0.00029739455,0.00063558546,0.0010360256,0.001107148,0.00068477314,0.0004265125,0.0002712464],"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.00023335747,0.00004704073,0.0009691577,0.00008965863,0.00004206217,0.00016942424,0.000094470626,0.8974334,0.01792525,0.075376764,0.0007207733,0.0068986397],"study_design_scores_gemma":[0.0000055833925,0.000016962864,0.00017484599,0.0000034739628,0.00000572634,0.000031156964,0.00000751815,0.99206537,0.0021323306,0.005400405,0.00014652855,0.0000100678635],"about_ca_topic_score_codex":0.0038510405,"about_ca_topic_score_gemma":0.0023226265,"teacher_disagreement_score":0.0038510405,"about_ca_system_score_codex":0.0010622563,"about_ca_system_score_gemma":0.0013510083,"threshold_uncertainty_score":0.007707238},"labels":[],"label_agreement":null},{"id":"W2107173441","doi":"10.1002/jcd.20027","title":"Existence of non‐resolvable Steiner triple systems","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Steiner system; Discrete mathematics","score_opus":0.015950432283600536,"score_gpt":0.21961820395871795,"score_spread":0.2036677716751174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107173441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55010104,0.0009853742,0.36482546,0.0006145889,0.00020709504,0.00012793829,0.00048161054,0.00041296816,0.082243934],"genre_scores_gemma":[0.91667473,0.00042300546,0.07017647,0.00012161325,0.000048529117,0.00010250693,0.0006918377,0.00007538051,0.011685924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852175,0.00033447798,0.000102391794,0.00025017126,0.0004909901,0.00030019353],"domain_scores_gemma":[0.99643683,0.0015331679,0.00056761847,0.00061922724,0.00054025074,0.00030288956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084239786,0.00043851958,0.00050544814,0.0012412735,0.0015970492,0.0026594982,0.0009891471,0.0014335951,0.009211324],"category_scores_gemma":[0.0033111696,0.0008052065,0.0007248717,0.0010863391,0.0013692805,0.0025139973,0.00231269,0.0017465367,0.0016614106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010547947,0.000050395716,0.00077039364,0.00014679373,0.000029202956,0.00049673795,0.00048159453,0.0083830645,0.012086959,0.9540809,0.0017965573,0.021572037],"study_design_scores_gemma":[0.00008594931,0.00016605189,0.00069920125,0.000109359484,0.000046182497,0.0013491214,0.0006912507,0.03931106,0.021193398,0.91099733,0.025269557,0.00008159104],"about_ca_topic_score_codex":0.00031296205,"about_ca_topic_score_gemma":0.0006513213,"teacher_disagreement_score":0.009211324,"about_ca_system_score_codex":0.0007825057,"about_ca_system_score_gemma":0.000723203,"threshold_uncertainty_score":0.030814946},"labels":[],"label_agreement":null},{"id":"W2108238762","doi":"10.1002/jcd.20228","title":"Closed trail decompositions of complete equipartite graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.023775411428861366,"score_gpt":0.240176696414461,"score_spread":0.21640128498559963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108238762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6310166,0.00044708786,0.32537004,0.00038913707,0.00010423992,0.0002582368,0.0016464527,0.0003730733,0.040395144],"genre_scores_gemma":[0.9228686,0.00021398439,0.0627668,0.0001386148,0.00003999442,0.00018225874,0.0016583038,0.00008647681,0.012044823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914825,0.0001656945,0.0000661593,0.0001592144,0.000233864,0.00022689196],"domain_scores_gemma":[0.9964148,0.0008577433,0.00063227606,0.0004710068,0.0007810643,0.00084304076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061921333,0.000378919,0.00044910307,0.0017928538,0.0012113722,0.0026335784,0.00071749487,0.0005998445,0.008131563],"category_scores_gemma":[0.0036578667,0.00053358375,0.0005122654,0.0012413634,0.0012020796,0.00237315,0.0011074544,0.0012295757,0.0009053098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007865425,0.00036230692,0.003025013,0.00028130418,0.000072096766,0.00091327704,0.0008407319,0.054559458,0.015730595,0.85764396,0.010235713,0.055548973],"study_design_scores_gemma":[0.00011883332,0.00014898059,0.0013973999,0.000108388784,0.000039954015,0.00048687813,0.0005299793,0.20001121,0.005212356,0.7811481,0.010754422,0.00004358528],"about_ca_topic_score_codex":0.0018075885,"about_ca_topic_score_gemma":0.0026286258,"teacher_disagreement_score":0.008131563,"about_ca_system_score_codex":0.0011051575,"about_ca_system_score_gemma":0.0008177614,"threshold_uncertainty_score":0.027202785},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21799712,0.0030646524,0.24542995,0.0036551163,0.0013005757,0.00014189046,0.001448137,0.00032842005,0.52663404],"genre_scores_gemma":[0.75097656,0.003123304,0.09254093,0.0007794618,0.0014299555,0.0002229137,0.0017442725,0.00042423836,0.14875834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994979,0.000111728325,0.00001599753,0.00008149202,0.0002122833,0.00008055198],"domain_scores_gemma":[0.99960226,0.00012504694,0.000039821152,0.000038701914,0.00008070881,0.00011359591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737752,0.0006920789,0.0010276042,0.0013278447,0.0016863438,0.003244139,0.0010560825,0.0008889379,0.014037943],"category_scores_gemma":[0.0011440597,0.00046274957,0.0006068488,0.0011433342,0.0021629517,0.002526989,0.001625795,0.0030190083,0.0022784641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029530096,0.000014273804,0.00006849871,0.000041901978,0.000004293464,0.000059300935,0.000072601266,0.0026471352,0.00057148194,0.98225594,0.00404791,0.010187218],"study_design_scores_gemma":[0.000010436407,0.000018298097,0.00016257547,0.000014541177,0.0000028812037,0.0001377504,0.00009923662,0.009449911,0.00026523965,0.97765416,0.012172881,0.000012144976],"about_ca_topic_score_codex":0.0024628874,"about_ca_topic_score_gemma":0.0021209416,"teacher_disagreement_score":0.014037943,"about_ca_system_score_codex":0.0011616694,"about_ca_system_score_gemma":0.00051550765,"threshold_uncertainty_score":0.046961606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.778309,0.00050057605,0.18092841,0.00071133993,0.00008728158,0.000079557525,0.0002886566,0.00027160184,0.0388236],"genre_scores_gemma":[0.96117646,0.0002551878,0.03275268,0.00018503513,0.00004569928,0.00006350691,0.00019248079,0.000028217219,0.005300673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997032,0.000059594768,0.0000160057,0.0000724665,0.00006267615,0.00008602845],"domain_scores_gemma":[0.9985006,0.00066354143,0.00030582183,0.00021660613,0.0001553978,0.00015803942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024259408,0.00037429683,0.00025282736,0.00066015613,0.0007553128,0.0009097098,0.0003496237,0.0005995707,0.001958271],"category_scores_gemma":[0.0016128492,0.0002876532,0.00041747236,0.0006650742,0.001511312,0.0009728567,0.00066063856,0.0010901043,0.00028918954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105515064,0.000038796545,0.0011275503,0.000051746658,0.000012332625,0.0005588844,0.00039563735,0.009831054,0.012976954,0.96013224,0.0013834718,0.013385835],"study_design_scores_gemma":[0.00003125733,0.00009187407,0.0012627399,0.000015947471,0.000014417881,0.00096976245,0.0002099834,0.04322305,0.008236815,0.9377804,0.008129995,0.000033767265],"about_ca_topic_score_codex":0.0011173217,"about_ca_topic_score_gemma":0.0011193996,"teacher_disagreement_score":0.001958271,"about_ca_system_score_codex":0.00049003225,"about_ca_system_score_gemma":0.00033050324,"threshold_uncertainty_score":0.006551087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6705472,0.0008371745,0.3167583,0.00021004824,0.000029030438,0.000046416437,0.000051116454,0.00047255494,0.011048137],"genre_scores_gemma":[0.96276027,0.00016830914,0.03548061,0.000029019444,0.000010179091,0.000015984084,0.000022899987,0.00003997681,0.0014727294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.00018166922,0.000015575928,0.000055476303,0.00010694551,0.00007468314],"domain_scores_gemma":[0.99913365,0.0004672125,0.000096603195,0.000098159384,0.00017215373,0.000032242624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047616175,0.00045021472,0.00030687643,0.0003890195,0.00029058303,0.0005439169,0.00032048946,0.00033767553,0.0011305043],"category_scores_gemma":[0.0015280975,0.00017922335,0.00007891957,0.0003856731,0.00025906536,0.00079199293,0.00036027236,0.0001767047,0.00039557213],"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.0006765139,0.00022295967,0.0042138165,0.00016579808,0.000051730338,0.00019155465,0.00019421784,0.45422962,0.35314786,0.02741468,0.0014717137,0.15801953],"study_design_scores_gemma":[0.00004421782,0.00020958643,0.0010994202,0.000015115615,0.000026490101,0.0001448256,0.000047509562,0.85808307,0.1311278,0.006926571,0.0022522083,0.000023154224],"about_ca_topic_score_codex":0.00037419246,"about_ca_topic_score_gemma":0.0007568031,"teacher_disagreement_score":0.0011305043,"about_ca_system_score_codex":0.00048591298,"about_ca_system_score_gemma":0.00036752384,"threshold_uncertainty_score":0.003781855},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099313684,0.0011300901,0.89054585,0.00022616108,0.00014760211,0.00010107366,0.0001309658,0.0004142534,0.007990276],"genre_scores_gemma":[0.510175,0.0010866039,0.47926983,0.00026272473,0.0000944779,0.00034074986,0.00032938,0.00012261567,0.008318673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966514,0.000079960766,0.00001613145,0.000055754677,0.00014969413,0.000033385353],"domain_scores_gemma":[0.99901354,0.00036764637,0.00014361626,0.00015767309,0.00025019186,0.00006725595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036679214,0.00042850146,0.0002236747,0.0005758459,0.00040893233,0.0005425476,0.00042630805,0.0004162246,0.0009020439],"category_scores_gemma":[0.0015005163,0.00016801602,0.0003071955,0.0004789716,0.000552076,0.0005886711,0.00037097937,0.00061358884,0.00036735937],"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.00022111114,0.00013477182,0.0028469209,0.0002497503,0.00006170709,0.0004693032,0.00031525557,0.15143245,0.15471192,0.4735026,0.0048483163,0.21120588],"study_design_scores_gemma":[0.000066554494,0.00033806672,0.001044782,0.00006697696,0.0000332627,0.0015728782,0.00004539791,0.768681,0.06425589,0.09295546,0.07084382,0.000095959746],"about_ca_topic_score_codex":0.0003937163,"about_ca_topic_score_gemma":0.00057703373,"teacher_disagreement_score":0.0009020439,"about_ca_system_score_codex":0.00039312674,"about_ca_system_score_gemma":0.0005608922,"threshold_uncertainty_score":0.003017664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53629464,0.00040205792,0.39932528,0.0006283923,0.00020087029,0.00015911447,0.0009212475,0.0006336749,0.06143469],"genre_scores_gemma":[0.8774119,0.00033889024,0.10599051,0.00014133286,0.000038717262,0.00011016023,0.00078956736,0.00018916826,0.01498986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996487,0.00009612196,0.000024402887,0.00006265671,0.00008890235,0.00007921381],"domain_scores_gemma":[0.9994197,0.00017805945,0.00014322715,0.000088124296,0.000086638174,0.000084328996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026418242,0.00051667274,0.000387538,0.0011326105,0.0006940028,0.0019344066,0.00052694726,0.0007568871,0.008840847],"category_scores_gemma":[0.0011947517,0.00052018446,0.00036529946,0.0014948993,0.0007150276,0.0019478181,0.0016064752,0.0012392098,0.0012655347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003348171,0.000097044045,0.0014754521,0.00018194162,0.00004727574,0.00044956408,0.0008271032,0.03253467,0.017175863,0.8592693,0.0073699686,0.08023704],"study_design_scores_gemma":[0.00006787559,0.00019658386,0.0012910477,0.00006303472,0.0000378123,0.0005195886,0.00092978566,0.09002111,0.010694086,0.87508047,0.021059684,0.000038949765],"about_ca_topic_score_codex":0.0006802992,"about_ca_topic_score_gemma":0.0011477218,"teacher_disagreement_score":0.008840847,"about_ca_system_score_codex":0.00070035766,"about_ca_system_score_gemma":0.00039331472,"threshold_uncertainty_score":0.029575646},"labels":[],"label_agreement":null},{"id":"W2112800816","doi":"10.1002/jcd.21404","title":"Orthogonally Resolvable Cycle Decompositions","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Discovery Centre; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Lexicographical order; Graph; Vertex (graph theory); Cycle basis; Discrete mathematics; Graph power; Line graph","score_opus":0.00810714327679006,"score_gpt":0.20694116070078067,"score_spread":0.1988340174239906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112800816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64476836,0.0004236352,0.31865752,0.0002316611,0.00006990641,0.00011206085,0.00043001052,0.00028471876,0.035022035],"genre_scores_gemma":[0.90916693,0.00017680836,0.08143579,0.00013352903,0.000029483293,0.000104428516,0.0006823802,0.00006434028,0.008206289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994469,0.00009231505,0.000037313985,0.00012512342,0.00015582674,0.00014249382],"domain_scores_gemma":[0.99896073,0.00022677756,0.00018710016,0.00023344556,0.0002408858,0.00015101081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003415792,0.0002981997,0.0003016778,0.0010231847,0.00069986924,0.0008887575,0.00046983204,0.0003817933,0.0036900067],"category_scores_gemma":[0.0014474797,0.00027026574,0.0004980161,0.00064448826,0.0007239321,0.0009639164,0.001066856,0.00068278034,0.0003668759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023972834,0.00012551305,0.0030924657,0.00014738884,0.000056212513,0.0005762568,0.0004725668,0.016461248,0.040600393,0.8729196,0.0029621802,0.06234643],"study_design_scores_gemma":[0.00007990273,0.00021653445,0.0028261126,0.000113314345,0.000066397406,0.0017152809,0.00076746615,0.14580917,0.042201634,0.76876247,0.037354175,0.00008746222],"about_ca_topic_score_codex":0.00082248624,"about_ca_topic_score_gemma":0.0012311765,"teacher_disagreement_score":0.0036900067,"about_ca_system_score_codex":0.0004715158,"about_ca_system_score_gemma":0.00044378013,"threshold_uncertainty_score":0.012344301},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53736985,0.0006510579,0.12755081,0.0034322527,0.00073320785,0.0004887726,0.0037497375,0.0016636209,0.32436076],"genre_scores_gemma":[0.90277976,0.0006119941,0.020487366,0.0013383598,0.00018229398,0.0002597325,0.002709991,0.00024659763,0.071383946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.000085021435,0.000024638995,0.00014681899,0.0001249696,0.00025417935],"domain_scores_gemma":[0.9984888,0.0004805989,0.00028417967,0.0001949182,0.00026901482,0.00028257977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035193164,0.00063245476,0.00047456648,0.00078049727,0.0015982707,0.0019981756,0.00078774814,0.0008027626,0.026753925],"category_scores_gemma":[0.0016597781,0.000605875,0.0006701618,0.00079276913,0.0013665324,0.00216247,0.0008619887,0.0012381715,0.0032077895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018016399,0.00014329432,0.0011293417,0.00018410131,0.000061898136,0.0013159394,0.0005504339,0.0028748736,0.008484881,0.95285994,0.021292774,0.010922341],"study_design_scores_gemma":[0.00018916307,0.00011569174,0.0014832147,0.00003995303,0.00004050444,0.00087770016,0.00062475214,0.0121593615,0.006941167,0.9481939,0.029274654,0.00005981483],"about_ca_topic_score_codex":0.0025065492,"about_ca_topic_score_gemma":0.003879028,"teacher_disagreement_score":0.026753925,"about_ca_system_score_codex":0.0012366576,"about_ca_system_score_gemma":0.001263149,"threshold_uncertainty_score":0.089500844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13231319,0.0048254887,0.6333288,0.006271216,0.0033830334,0.00014315918,0.0007839857,0.00072873203,0.21822241],"genre_scores_gemma":[0.7368328,0.004286331,0.20178226,0.0014489129,0.0048875567,0.00013811528,0.000845297,0.0005764751,0.049202226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986467,0.0003889019,0.000064479435,0.00032096636,0.00042955246,0.0001493626],"domain_scores_gemma":[0.9961669,0.0018171326,0.00032012354,0.00059808,0.0005729857,0.0005247195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026347,0.0006201521,0.0008613844,0.0013816245,0.0020541062,0.0018230253,0.0008369097,0.00076208066,0.008322376],"category_scores_gemma":[0.0056228563,0.00041272966,0.0008839967,0.0010561716,0.0044191796,0.0044660172,0.0030856275,0.003992866,0.0012006973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020268357,0.0000095355135,0.00010382274,0.000054623673,0.0000032437351,0.00010793005,0.00017465345,0.0016103454,0.0007972381,0.98703694,0.0029222742,0.007159156],"study_design_scores_gemma":[0.0000066208245,0.000056687895,0.00015059217,0.000021148626,0.0000035285277,0.00028067402,0.00009540796,0.0051368163,0.0011119087,0.96614033,0.026973741,0.00002261584],"about_ca_topic_score_codex":0.001064992,"about_ca_topic_score_gemma":0.00082901353,"teacher_disagreement_score":0.008322376,"about_ca_system_score_codex":0.00068431284,"about_ca_system_score_gemma":0.0007809544,"threshold_uncertainty_score":0.02784115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028727274,0.00017472927,0.96816206,0.00011327555,0.000053677977,0.000046415626,0.000014067279,0.0001894154,0.002519068],"genre_scores_gemma":[0.6555725,0.00018375796,0.34035504,0.000094196825,0.00004572157,0.00010888805,0.000038280643,0.00003631549,0.0035653936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995567,0.00013147596,0.000014113647,0.00007410716,0.00013955773,0.00008414477],"domain_scores_gemma":[0.99932027,0.0004161674,0.00006162483,0.00006464623,0.00009920994,0.000038086862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000984556,0.0004204349,0.00051477284,0.00040297894,0.000710706,0.0008133616,0.0011617203,0.0005495572,0.0012376339],"category_scores_gemma":[0.0018494548,0.00019564653,0.00029771085,0.000382849,0.0007851117,0.0012498712,0.0006137488,0.00051117875,0.00014866571],"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.0001756179,0.00011332129,0.0004198492,0.00004913576,0.000034238983,0.00006699698,0.00009618223,0.823345,0.006317604,0.07952122,0.0013890057,0.08847179],"study_design_scores_gemma":[0.000012539384,0.000014383949,0.000026930942,0.0000020483983,0.000003414126,0.00001350192,0.0000047141093,0.99314696,0.00071041944,0.0055592237,0.0005023902,0.0000034752172],"about_ca_topic_score_codex":0.0037489112,"about_ca_topic_score_gemma":0.0045557288,"teacher_disagreement_score":0.0037489112,"about_ca_system_score_codex":0.0014052598,"about_ca_system_score_gemma":0.0015455664,"threshold_uncertainty_score":0.010195851},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015231603,0.001047527,0.3902779,0.0036216036,0.0032480583,0.00024289092,0.0066380585,0.0061063617,0.57358605],"genre_scores_gemma":[0.20836721,0.0024699648,0.2322904,0.0020109783,0.00075329916,0.0005249381,0.0086706355,0.004034186,0.54087836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959916,0.00008739585,0.000018788178,0.00006518629,0.00015852382,0.00007097133],"domain_scores_gemma":[0.9992731,0.00024929046,0.00008744654,0.00014541429,0.00021088941,0.000033934473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032761958,0.00062431913,0.000274093,0.0018471737,0.00094201847,0.0023835555,0.0005832824,0.0010931268,0.11314587],"category_scores_gemma":[0.0027700237,0.00041911862,0.0003021536,0.0020233104,0.0008147501,0.002503123,0.0007325337,0.0014613004,0.033143535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017227467,0.00006405345,0.00028894894,0.00016153454,0.000008438231,0.00013290104,0.00020255636,0.0019587919,0.0060898005,0.68812716,0.18149133,0.12130222],"study_design_scores_gemma":[0.000044643595,0.000048721333,0.00089638453,0.00012067423,0.000010970494,0.00043747327,0.0002110457,0.020142082,0.023658875,0.25738788,0.69697917,0.00006202205],"about_ca_topic_score_codex":0.0040717483,"about_ca_topic_score_gemma":0.0054925345,"teacher_disagreement_score":0.11314587,"about_ca_system_score_codex":0.001118053,"about_ca_system_score_gemma":0.0008149694,"threshold_uncertainty_score":0.37851065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30336574,0.0030019756,0.6728986,0.000963108,0.00015410909,0.00007300803,0.00012500944,0.00020483341,0.019213641],"genre_scores_gemma":[0.942941,0.00082352053,0.054009058,0.00012782284,0.00006896072,0.00003855753,0.00002847713,0.000018695644,0.0019438283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988965,0.00044713277,0.000020744812,0.00011891658,0.00031739316,0.0001993652],"domain_scores_gemma":[0.9987116,0.0008069244,0.0001221612,0.00010255102,0.00020611373,0.000050674436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012720992,0.0007782302,0.00070243975,0.00048455017,0.00047860056,0.0012777135,0.0006097107,0.001283992,0.0005691305],"category_scores_gemma":[0.0035823258,0.0003848213,0.00024870603,0.0006437273,0.0013730949,0.0014324985,0.0008186443,0.00043668124,0.00019723672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000411732,0.00006971703,0.0013791781,0.00013882961,0.000051997642,0.00020904971,0.0001039083,0.6943664,0.018420303,0.25831676,0.001236709,0.025295405],"study_design_scores_gemma":[0.000023342565,0.000051901217,0.00014339147,0.000011668672,0.000008087951,0.00008832855,0.000013883413,0.9500432,0.0038068595,0.045277134,0.0005120354,0.000020207492],"about_ca_topic_score_codex":0.0016651715,"about_ca_topic_score_gemma":0.0017198224,"teacher_disagreement_score":0.0016651715,"about_ca_system_score_codex":0.0011340291,"about_ca_system_score_gemma":0.0011332231,"threshold_uncertainty_score":0.008227944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68076867,0.00056961935,0.21856862,0.0036717986,0.0007101122,0.00024231733,0.00091525423,0.0038205853,0.09073301],"genre_scores_gemma":[0.93700445,0.0003465589,0.0383498,0.00048040977,0.00013787909,0.000094367984,0.0006311469,0.00041906163,0.022536425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927086,0.000107122185,0.000034850025,0.0001395101,0.00011481983,0.00033272605],"domain_scores_gemma":[0.9933074,0.0036675096,0.00041747966,0.0011613264,0.0006526431,0.0007936109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396437,0.00045987914,0.0006586039,0.001296321,0.001905011,0.0031415455,0.0010819832,0.0018464609,0.016995711],"category_scores_gemma":[0.0065529714,0.00036582464,0.0004194953,0.001277817,0.0014276331,0.0037757417,0.0014433517,0.001424296,0.0016208182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043511847,0.00059920526,0.012118605,0.0009002019,0.00008886758,0.0032491765,0.0016310255,0.051991053,0.11464157,0.594109,0.047631,0.16868915],"study_design_scores_gemma":[0.0003002033,0.00029337793,0.0037322198,0.000102540704,0.00009091831,0.0017841987,0.0009211157,0.19723625,0.06038371,0.71315944,0.021861225,0.00013478451],"about_ca_topic_score_codex":0.002699453,"about_ca_topic_score_gemma":0.004303871,"teacher_disagreement_score":0.016995711,"about_ca_system_score_codex":0.0015155199,"about_ca_system_score_gemma":0.0010376885,"threshold_uncertainty_score":0.056856275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.528562,0.0049851798,0.38691473,0.005145237,0.00044372186,0.00012516782,0.00060341967,0.0010721422,0.07214835],"genre_scores_gemma":[0.98209333,0.0006779115,0.015203292,0.000112057205,0.00005464462,0.000034096018,0.000045085402,0.000038984203,0.0017405984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951196,0.0001226226,0.00001065542,0.000050208877,0.0001117136,0.0001928534],"domain_scores_gemma":[0.997267,0.001727262,0.00022953362,0.0002536384,0.00042627848,0.00009623109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010004563,0.00051199284,0.00057038065,0.00070455234,0.0004800116,0.00096537324,0.001070022,0.001006181,0.0046519428],"category_scores_gemma":[0.0059424713,0.00024653354,0.0002906113,0.0008301135,0.0011236581,0.0029195563,0.0008916176,0.0006097232,0.0005412246],"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.00026933826,0.00011946474,0.0014478794,0.00033297585,0.00006739666,0.00024780098,0.00015090816,0.7460416,0.024013044,0.15496133,0.0047029187,0.067645386],"study_design_scores_gemma":[0.000024916613,0.00014583723,0.00041691336,0.00006393732,0.000039886523,0.00018399721,0.00009720998,0.9247067,0.012816907,0.05769797,0.0037640047,0.00004175618],"about_ca_topic_score_codex":0.0022839385,"about_ca_topic_score_gemma":0.00242683,"teacher_disagreement_score":0.0046519428,"about_ca_system_score_codex":0.0011184333,"about_ca_system_score_gemma":0.0010106965,"threshold_uncertainty_score":0.015562296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052904125,0.0011654645,0.9391644,0.00024681038,0.0002565781,0.00010211111,0.00007252662,0.0016739834,0.0044140406],"genre_scores_gemma":[0.35452765,0.0006377359,0.6339748,0.00039791892,0.00043491385,0.00016905024,0.00023704252,0.00011100127,0.009509888],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947363,0.00011470893,0.00002345933,0.000073957475,0.00025632238,0.000057911817],"domain_scores_gemma":[0.9992187,0.00018492948,0.00008410059,0.0001048706,0.0003705526,0.000036782618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080485904,0.00045412974,0.0005151665,0.00059857976,0.00039723713,0.0006478118,0.0009937675,0.00081748475,0.0019405715],"category_scores_gemma":[0.00096025446,0.00032887826,0.00030313057,0.00062168605,0.00036057958,0.0010548573,0.00032694283,0.0009894939,0.0008142142],"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.00079315103,0.00037930402,0.0022157452,0.00042029677,0.00020212692,0.0005605392,0.00015479646,0.044038545,0.5890162,0.06548823,0.006636541,0.29009452],"study_design_scores_gemma":[0.00025841815,0.0014722251,0.0034690974,0.00006133557,0.00028148328,0.0017323302,0.000024552892,0.7682113,0.1895339,0.00625287,0.0285634,0.00013905519],"about_ca_topic_score_codex":0.0005908227,"about_ca_topic_score_gemma":0.0019008613,"teacher_disagreement_score":0.0019405715,"about_ca_system_score_codex":0.00053137064,"about_ca_system_score_gemma":0.00069486746,"threshold_uncertainty_score":0.0064918995},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008156893,0.010973311,0.004527991,0.14638238,0.09526317,0.00014543791,0.013131918,0.0026171848,0.72614294],"genre_scores_gemma":[0.00738422,0.007976718,0.002084985,0.018246211,0.035195187,0.00023427246,0.009665887,0.0016498766,0.91756254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997253,0.00037285924,0.00013649119,0.00036869934,0.0015805397,0.00028843206],"domain_scores_gemma":[0.9926461,0.0017125575,0.00028905735,0.0009894399,0.0031521125,0.0012106657],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028131653,0.0022567788,0.0014561727,0.0028573968,0.0036866579,0.011933838,0.0017008398,0.003793733,0.33350146],"category_scores_gemma":[0.009213739,0.001013995,0.0012240065,0.0033872246,0.0013575876,0.0058699166,0.0021142513,0.0069433413,0.18839538],"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.000005790417,0.0000074513764,0.000019450177,0.000019253408,0.0000017259786,0.0000057201796,0.0000027965323,0.000028194672,0.000014657672,0.001574278,0.99411607,0.004204613],"study_design_scores_gemma":[0.00001387995,0.000009599271,0.00021326255,0.00006232897,0.0000046431396,0.000022791692,0.000020526388,0.00021929837,0.00008996837,0.0028075061,0.99652916,0.0000071032136],"about_ca_topic_score_codex":0.01838673,"about_ca_topic_score_gemma":0.03430089,"teacher_disagreement_score":0.33350146,"about_ca_system_score_codex":0.0062811514,"about_ca_system_score_gemma":0.0044394643,"threshold_uncertainty_score":0.9506793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34808818,0.0014260914,0.5581511,0.0014368728,0.00045309335,0.00016858062,0.00026942315,0.0003510055,0.089655735],"genre_scores_gemma":[0.8870853,0.001023485,0.08439453,0.00063603045,0.00038989412,0.00020033064,0.00020204419,0.00012787031,0.02594036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813974,0.00088521396,0.000065061155,0.00018957352,0.0004387728,0.0002815026],"domain_scores_gemma":[0.99276227,0.0046424493,0.0009534538,0.0007612693,0.0005885627,0.0002920348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021270318,0.0009239761,0.0008513956,0.0015181596,0.0012486218,0.0018279237,0.0010270375,0.001507478,0.0067565],"category_scores_gemma":[0.009132831,0.0006370734,0.00058664713,0.0014679037,0.0020971787,0.0019191735,0.0017073895,0.0012932176,0.00091796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003854244,0.000037139802,0.0004390872,0.00009411073,0.000020060084,0.00015042066,0.0002602158,0.0142055955,0.0034975086,0.96109617,0.0020287104,0.017785538],"study_design_scores_gemma":[0.00010907793,0.00015409161,0.00027994072,0.00006945519,0.000029717618,0.0002727069,0.00009993234,0.07054199,0.00313646,0.9194855,0.0057794084,0.000041591502],"about_ca_topic_score_codex":0.0007027793,"about_ca_topic_score_gemma":0.0010175311,"teacher_disagreement_score":0.0067565,"about_ca_system_score_codex":0.0013773463,"about_ca_system_score_gemma":0.0008862996,"threshold_uncertainty_score":0.022602797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5769003,0.0013284228,0.25107652,0.005334987,0.00054200855,0.00009308908,0.0005991446,0.0005868239,0.16353874],"genre_scores_gemma":[0.9456517,0.0007563531,0.024489535,0.0006582691,0.00038300166,0.00012238353,0.0004806199,0.00030883538,0.027149297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.00016685374,0.000032357246,0.00017957012,0.00021913755,0.00014747896],"domain_scores_gemma":[0.99682236,0.0015386419,0.0004324501,0.00039380364,0.0003015987,0.0005111311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955356,0.0010761669,0.0012100235,0.0019969426,0.0020063824,0.0034675915,0.001299472,0.0017310535,0.008807445],"category_scores_gemma":[0.004472807,0.0009895029,0.0009624285,0.0010932231,0.0029090522,0.0075522466,0.0052395076,0.004512979,0.0010139158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040070496,0.000014503882,0.00018045821,0.000029990126,0.000006867961,0.00005257722,0.00021077653,0.0009589535,0.00069282897,0.99383175,0.0009801799,0.003000984],"study_design_scores_gemma":[0.000013169451,0.000013359449,0.00019039803,0.000011565257,0.0000067658893,0.000073513984,0.00011235402,0.004225541,0.0003066713,0.9929309,0.0021090664,0.0000067388432],"about_ca_topic_score_codex":0.0003666633,"about_ca_topic_score_gemma":0.0004744145,"teacher_disagreement_score":0.008807445,"about_ca_system_score_codex":0.0010982779,"about_ca_system_score_gemma":0.00027965746,"threshold_uncertainty_score":0.029463828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6046849,0.0019666262,0.07269492,0.016411811,0.0017492387,0.00007368504,0.00044974408,0.00035526115,0.30161378],"genre_scores_gemma":[0.9697174,0.00046330967,0.013509705,0.0012766115,0.0006862413,0.00004812292,0.00026979807,0.000062849474,0.013966045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986241,0.00040179695,0.00006439335,0.0002618298,0.00036360792,0.0002843689],"domain_scores_gemma":[0.9977617,0.00094029785,0.0002522201,0.00065663096,0.000178579,0.00021054033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017533479,0.00058756286,0.00097233773,0.0013574692,0.00342321,0.0036515116,0.0012919755,0.002831952,0.008752824],"category_scores_gemma":[0.004401055,0.0006000509,0.000923086,0.0010551221,0.005699553,0.005517319,0.0022350247,0.0028018544,0.0009740963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007317004,0.00003922046,0.0003478614,0.000033149845,0.000006278607,0.00014214324,0.0002637456,0.0011074424,0.00045769633,0.9904073,0.0026598473,0.004462172],"study_design_scores_gemma":[0.000011067009,0.0000046493865,0.000091768365,0.000007850858,0.0000015831569,0.000054757224,0.00005982837,0.0014576361,0.00013052895,0.99675226,0.0014234085,0.000004650282],"about_ca_topic_score_codex":0.0013864085,"about_ca_topic_score_gemma":0.0014778861,"teacher_disagreement_score":0.008752824,"about_ca_system_score_codex":0.0011034218,"about_ca_system_score_gemma":0.00092825963,"threshold_uncertainty_score":0.02928108},"labels":[],"label_agreement":null},{"id":"W2118518205","doi":"10.1002/jcd.20117","title":"Binary caps with many free pairs of points","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Maximization; Point (geometry); Binary number; Upper and lower bounds; Space (punctuation); Discrete mathematics; Arithmetic; Computer science; Geometry; Mathematical optimization","score_opus":0.007973961774066958,"score_gpt":0.18376682079341125,"score_spread":0.1757928590193443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118518205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35787413,0.0018616968,0.60301185,0.0018922345,0.00026251154,0.00047241486,0.0012321804,0.0005812065,0.032811776],"genre_scores_gemma":[0.89607406,0.0004427395,0.09401756,0.0004983829,0.00032415954,0.000797769,0.0008218003,0.00014044336,0.006883114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98757964,0.0063992464,0.0005687533,0.0023691612,0.0019894973,0.0010937216],"domain_scores_gemma":[0.95587367,0.02559938,0.0059001977,0.007981117,0.0019973859,0.0026482637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071263025,0.0012869965,0.0035247079,0.001898262,0.0031658225,0.0048098145,0.0025661087,0.00220959,0.0106727425],"category_scores_gemma":[0.026384039,0.0015531863,0.0014020109,0.0019179473,0.0047981306,0.0069366083,0.006429479,0.0030482102,0.0014296126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00285594,0.00032171776,0.0064480472,0.00073661836,0.0003003258,0.00079972553,0.0007793017,0.057813156,0.018202798,0.8396938,0.007561637,0.06448699],"study_design_scores_gemma":[0.00039282112,0.0006591628,0.0032285615,0.00017479541,0.0001706644,0.0015069563,0.000524568,0.15571922,0.019990392,0.80087423,0.016602838,0.00015581209],"about_ca_topic_score_codex":0.00027628563,"about_ca_topic_score_gemma":0.00021072185,"teacher_disagreement_score":0.0106727425,"about_ca_system_score_codex":0.0011861258,"about_ca_system_score_gemma":0.0008452869,"threshold_uncertainty_score":0.037687957},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67444897,0.00052136456,0.31254393,0.00042303084,0.0002395214,0.0004172872,0.00012817528,0.0034469988,0.007830768],"genre_scores_gemma":[0.9001068,0.00017774907,0.09559882,0.00007404259,0.000028005421,0.00013573679,0.00009734942,0.000043540924,0.0037380573],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997105,0.00003688364,0.000010732197,0.0000389035,0.00013203766,0.00007096692],"domain_scores_gemma":[0.9997502,0.000039380804,0.000043210868,0.00004621433,0.000062093415,0.00005887145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002566367,0.0004976566,0.00027214788,0.0003769768,0.0005251141,0.0006531445,0.0008776506,0.00045395724,0.0013785904],"category_scores_gemma":[0.00033571257,0.00020612175,0.00018858156,0.00018146515,0.00042582248,0.0011281929,0.00087692705,0.00052089675,0.00050923607],"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.00043317192,0.00031789718,0.0018787727,0.00016460626,0.00004194676,0.001158664,0.00025462767,0.011625752,0.9028528,0.03142483,0.0021276812,0.047719266],"study_design_scores_gemma":[0.0001791479,0.0028294974,0.0026703745,0.000038112466,0.0000927514,0.0013296489,0.00011736332,0.24225189,0.7147916,0.0038527504,0.03175562,0.00009123187],"about_ca_topic_score_codex":0.00051001576,"about_ca_topic_score_gemma":0.0006653364,"teacher_disagreement_score":0.0013785904,"about_ca_system_score_codex":0.00046534545,"about_ca_system_score_gemma":0.0005042814,"threshold_uncertainty_score":0.00461185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42056313,0.00025392135,0.48583862,0.0004351597,0.0003162767,0.00019610894,0.00038313816,0.00078722736,0.09122648],"genre_scores_gemma":[0.855254,0.0002209201,0.10829217,0.0002553667,0.00007426621,0.0001540238,0.00053063896,0.00032625117,0.034892507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.000070097245,0.000025790192,0.00006849919,0.00016138711,0.0000946539],"domain_scores_gemma":[0.9993012,0.00015341368,0.000071828836,0.00019646286,0.00015581383,0.000121300836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969738,0.00041738342,0.00035897148,0.0007499401,0.0005687377,0.0009838805,0.00060840696,0.00041223638,0.009805052],"category_scores_gemma":[0.0017496245,0.00029254414,0.00037885274,0.00051543245,0.0010394967,0.0014279153,0.0021474294,0.00067670713,0.0020303242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002093654,0.00007338114,0.0010022644,0.00016312892,0.000017845157,0.0007075436,0.00060717005,0.0059288414,0.054465313,0.84511787,0.0054103113,0.08629691],"study_design_scores_gemma":[0.00007258373,0.00021368447,0.0005602509,0.000055804092,0.000020294068,0.0007761249,0.00034263363,0.059890967,0.04737832,0.86783767,0.022797016,0.00005471791],"about_ca_topic_score_codex":0.00017566314,"about_ca_topic_score_gemma":0.00046530846,"teacher_disagreement_score":0.009805052,"about_ca_system_score_codex":0.00031419855,"about_ca_system_score_gemma":0.00041716764,"threshold_uncertainty_score":0.03280115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33604038,0.003156447,0.3303786,0.006151035,0.0007191487,0.00030058465,0.001557814,0.0015029189,0.3201931],"genre_scores_gemma":[0.8126265,0.0021761064,0.103212155,0.0016885317,0.00068978907,0.00033714465,0.0021784613,0.00072246057,0.07636885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966989,0.00080658065,0.00025908425,0.0006191831,0.0009665316,0.0006496125],"domain_scores_gemma":[0.9933078,0.0040863743,0.0006184441,0.00083647325,0.0004916702,0.00065915455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019338496,0.0010842124,0.0018937043,0.004581317,0.008790053,0.010550285,0.0029045066,0.0034297425,0.020212164],"category_scores_gemma":[0.010585201,0.0017224099,0.0021486008,0.005463543,0.004524122,0.012769493,0.00574999,0.005635476,0.0026582668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029519997,0.000049719627,0.00014459724,0.000043528402,0.000012463677,0.00007845034,0.00048543958,0.0010593646,0.00032165038,0.9912157,0.0016992666,0.0048602344],"study_design_scores_gemma":[0.000011246206,0.0000058760893,0.0000918735,0.000016005253,0.000019339137,0.00007932486,0.00021916693,0.0020083282,0.0003323288,0.9931225,0.004077496,0.000016437269],"about_ca_topic_score_codex":0.0029270046,"about_ca_topic_score_gemma":0.0038000743,"teacher_disagreement_score":0.020212164,"about_ca_system_score_codex":0.0022562654,"about_ca_system_score_gemma":0.0016566316,"threshold_uncertainty_score":0.06761646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46474805,0.001769384,0.5257904,0.00028236693,0.00009018391,0.00014124456,0.000045262244,0.00047161325,0.006661461],"genre_scores_gemma":[0.85535383,0.0005719898,0.14195205,0.00009027996,0.00005593056,0.000093039576,0.000032044394,0.000012158156,0.0018386251],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00013276748,0.000015398395,0.00006784974,0.00011652714,0.000031501524],"domain_scores_gemma":[0.9996043,0.00019194017,0.00007830531,0.000053512707,0.00004845728,0.000023482498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003646549,0.000604317,0.00028451145,0.00054360984,0.00035983094,0.00060137635,0.0004253241,0.0004424915,0.00042632144],"category_scores_gemma":[0.00078384357,0.00026559443,0.00019980532,0.0005010367,0.00065163046,0.0012659361,0.0005963223,0.00030597285,0.00013002413],"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.0007843204,0.00027566325,0.0034160165,0.000588028,0.00012664533,0.0013061521,0.00062647276,0.12033159,0.45622772,0.16585553,0.0014189394,0.24904299],"study_design_scores_gemma":[0.00025958032,0.0015200253,0.0019553,0.00007289979,0.00009865815,0.001937767,0.0001199361,0.7303892,0.20515697,0.04079714,0.017573131,0.00011947023],"about_ca_topic_score_codex":0.0005503425,"about_ca_topic_score_gemma":0.0010555609,"teacher_disagreement_score":0.000604317,"about_ca_system_score_codex":0.0004588191,"about_ca_system_score_gemma":0.00039003533,"threshold_uncertainty_score":0.003328979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89339733,0.00054762606,0.09819245,0.00045118204,0.00025895814,0.0003839525,0.0003430208,0.0010363386,0.0053890874],"genre_scores_gemma":[0.9113849,0.00027978251,0.082823195,0.0001674192,0.000076652366,0.00021319857,0.00022018387,0.00009281468,0.0047418303],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983475,0.00024724018,0.00005744366,0.00024012754,0.0009356285,0.00017201088],"domain_scores_gemma":[0.9979353,0.0004099333,0.00028175834,0.0003194571,0.0008742309,0.0001793967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022111118,0.0004979382,0.00058142876,0.00039948453,0.00056384865,0.0007349566,0.0016941936,0.001381974,0.0018249092],"category_scores_gemma":[0.0018375507,0.00032338715,0.0002891358,0.0003396476,0.0007608628,0.0011266067,0.0006870954,0.0010830063,0.0011734365],"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.0006271299,0.00059731706,0.001371031,0.00025432563,0.00006103198,0.00019167521,0.0002980028,0.002869499,0.976543,0.0035617824,0.00065827783,0.012966939],"study_design_scores_gemma":[0.000200901,0.0039261803,0.0016968249,0.000026360169,0.00006099151,0.00023222304,0.000095305055,0.031411145,0.95566833,0.00044576,0.0061768224,0.000059262435],"about_ca_topic_score_codex":0.00089652237,"about_ca_topic_score_gemma":0.000672021,"teacher_disagreement_score":0.0022111118,"about_ca_system_score_codex":0.0005719523,"about_ca_system_score_gemma":0.0006156402,"threshold_uncertainty_score":0.011693597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38834277,0.0009889074,0.59603363,0.00051482074,0.00025800132,0.00015663113,0.000103074075,0.0008730577,0.012729153],"genre_scores_gemma":[0.7401686,0.0003189942,0.25508627,0.00010773341,0.000074731375,0.000057089408,0.000055070883,0.000015688825,0.0041159294],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998437,0.000025805173,0.000009730911,0.000026619897,0.000077482466,0.000016569893],"domain_scores_gemma":[0.99989045,0.000019653698,0.00002687808,0.00001949445,0.0000332797,0.000010367346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012431815,0.00024120358,0.00018481082,0.00023072198,0.00020742691,0.0002607733,0.00046158937,0.0002694373,0.00071469246],"category_scores_gemma":[0.00020852053,0.00012349816,0.0001122826,0.00025871536,0.0002922542,0.00041597846,0.00019639338,0.0002680084,0.00026354395],"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.00024822232,0.00017346635,0.00090634427,0.000120272525,0.000025233727,0.00022309468,0.000095158284,0.012511006,0.83509547,0.029928768,0.0009146279,0.1197584],"study_design_scores_gemma":[0.000105877974,0.000490203,0.0009201247,0.000016813534,0.000044936987,0.00059398764,0.000022034283,0.36851618,0.6129812,0.0039764326,0.012292567,0.000039617855],"about_ca_topic_score_codex":0.0004297622,"about_ca_topic_score_gemma":0.0009081305,"teacher_disagreement_score":0.00071469246,"about_ca_system_score_codex":0.00025329835,"about_ca_system_score_gemma":0.00028864827,"threshold_uncertainty_score":0.0023908615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9345714,0.0005655146,0.05585563,0.0002761003,0.000023583869,0.000047604208,0.0005055642,0.00013278298,0.008021808],"genre_scores_gemma":[0.96665835,0.000547752,0.026657645,0.0001284572,0.00010848671,0.00021681283,0.0014571619,0.00005934103,0.004166007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641716,0.0006070935,0.00038155133,0.0010342652,0.00097011885,0.00058982347],"domain_scores_gemma":[0.9789684,0.01406918,0.0024916343,0.0018456772,0.0015275882,0.001097496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019154313,0.00074826856,0.0014707863,0.0026096,0.0025324144,0.00422564,0.0011944704,0.0017505776,0.0028726386],"category_scores_gemma":[0.014998818,0.0006943528,0.0010191464,0.002910909,0.0034985112,0.007966802,0.0028245866,0.0015338456,0.00056500174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014585373,0.00017885656,0.029059958,0.0005415907,0.00016303241,0.0016582222,0.003596933,0.01780667,0.037872188,0.8342939,0.0019068683,0.071463324],"study_design_scores_gemma":[0.00011590987,0.00050031894,0.013892586,0.00017742525,0.00018600692,0.0038812545,0.0019232439,0.051539727,0.04626529,0.8687122,0.012680488,0.00012557695],"about_ca_topic_score_codex":0.0006606788,"about_ca_topic_score_gemma":0.0004107209,"teacher_disagreement_score":0.00422564,"about_ca_system_score_codex":0.001647042,"about_ca_system_score_gemma":0.0005210725,"threshold_uncertainty_score":0.011950195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05473068,0.0003153598,0.9419446,0.000057835154,0.000044220607,0.00002727727,0.00007177097,0.00009854929,0.0027097205],"genre_scores_gemma":[0.7302178,0.0006195307,0.26383334,0.00012477984,0.00013803875,0.00015546186,0.0005259934,0.00014132424,0.0042437324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985367,0.00040143853,0.00008707779,0.00028396165,0.00055506825,0.0001356512],"domain_scores_gemma":[0.995255,0.0029234816,0.000540659,0.0004201399,0.0007158035,0.00014502488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014499541,0.00073365745,0.0007213332,0.0018177469,0.0005381369,0.0011113447,0.0009655158,0.00064822345,0.0023403517],"category_scores_gemma":[0.008318076,0.00033705705,0.00043177884,0.0016545044,0.0011847923,0.002028222,0.0010183816,0.0009161989,0.0004389968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040400217,0.00008748148,0.0021481782,0.00030898413,0.00006962756,0.00041245512,0.00031416674,0.33290458,0.022837019,0.5431705,0.0011982817,0.09614468],"study_design_scores_gemma":[0.000018702216,0.00011120655,0.00059063634,0.00003032368,0.000016924945,0.00017582173,0.000049468796,0.87987584,0.00988679,0.106180325,0.0030281849,0.000035746183],"about_ca_topic_score_codex":0.0005708693,"about_ca_topic_score_gemma":0.00042599422,"teacher_disagreement_score":0.0023403517,"about_ca_system_score_codex":0.00072782807,"about_ca_system_score_gemma":0.00054603413,"threshold_uncertainty_score":0.007829249},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0435606,0.00039204865,0.952534,0.00011995732,0.000055295128,0.00002932675,0.000019364858,0.00030580454,0.0029835987],"genre_scores_gemma":[0.4270156,0.00047175607,0.56810385,0.00014336384,0.000075963646,0.00005405247,0.00006062683,0.000028473602,0.004046334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958307,0.00012981337,0.000012411562,0.000060267932,0.00018047467,0.00003391413],"domain_scores_gemma":[0.9997048,0.00013666935,0.000030294554,0.000040454244,0.00007282896,0.000014989027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037322665,0.00033497502,0.00030513183,0.00031098325,0.00022109276,0.0004892894,0.00044778237,0.00048658668,0.0006078196],"category_scores_gemma":[0.0008947362,0.0001465858,0.00022853413,0.000430371,0.00038228426,0.0005920192,0.0005258196,0.00041544624,0.00048718587],"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.00078002014,0.00023100823,0.00208065,0.0001794974,0.000108565335,0.0001770764,0.00010518761,0.067901276,0.26468062,0.06950021,0.002073611,0.5921823],"study_design_scores_gemma":[0.00005070331,0.00029629705,0.0005535352,0.000015596053,0.000024465147,0.00042146794,0.000015464107,0.8915121,0.08983468,0.0104336515,0.0068094432,0.000032630604],"about_ca_topic_score_codex":0.00038929685,"about_ca_topic_score_gemma":0.00050488353,"teacher_disagreement_score":0.0006078196,"about_ca_system_score_codex":0.00020472679,"about_ca_system_score_gemma":0.0003757714,"threshold_uncertainty_score":0.0020333529},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04366108,0.038855013,0.7209745,0.014015882,0.008265034,0.00071548,0.0056788446,0.005002514,0.16283168],"genre_scores_gemma":[0.41790912,0.012461803,0.51323646,0.0066480776,0.006858097,0.002041815,0.0053004613,0.0034505632,0.032093555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9667654,0.007166351,0.0016517256,0.006937425,0.012069041,0.005409977],"domain_scores_gemma":[0.8725702,0.09672159,0.002977594,0.015461646,0.00926864,0.0030002836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021036424,0.008798363,0.0058754846,0.011280557,0.0057361345,0.010913043,0.016917791,0.007860272,0.036750015],"category_scores_gemma":[0.098417625,0.0031526138,0.0059254975,0.010222077,0.009810762,0.02770329,0.020229036,0.024662923,0.013754846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004704959,0.0022365141,0.004480677,0.0025559047,0.00058890623,0.0005335344,0.0012466324,0.110420726,0.01633697,0.4938151,0.09418305,0.268897],"study_design_scores_gemma":[0.00030771166,0.00046552173,0.0023063633,0.00067926693,0.0005109646,0.00069573213,0.00029439366,0.3506248,0.013159331,0.59652805,0.03402123,0.00040664157],"about_ca_topic_score_codex":0.0051052603,"about_ca_topic_score_gemma":0.011286383,"teacher_disagreement_score":0.036750015,"about_ca_system_score_codex":0.011216672,"about_ca_system_score_gemma":0.00708263,"threshold_uncertainty_score":0.12294108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9728443,0.000082163766,0.020013476,0.00025872586,0.000049814556,0.0000618441,0.00037412797,0.00034674545,0.0059686466],"genre_scores_gemma":[0.99512756,0.000035133547,0.003662982,0.000029058787,0.0000049809205,0.000037141104,0.00016147952,0.000021079053,0.00092053326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942905,0.00016587405,0.000023488235,0.00006842788,0.00014502852,0.0001681462],"domain_scores_gemma":[0.9944391,0.0039039375,0.00028208125,0.00023225909,0.000913224,0.0002292983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008735499,0.00049100176,0.00053440983,0.00050031085,0.00048160285,0.0005179089,0.00095573463,0.0010503744,0.0029570702],"category_scores_gemma":[0.0036320605,0.00026449317,0.00034490792,0.0005921007,0.0008355105,0.0007178276,0.00044133622,0.00091815507,0.00025241022],"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.00025043168,0.00015107494,0.0026114453,0.000033452852,0.00002971822,0.00015052283,0.000097164644,0.98722935,0.0034483522,0.0038324143,0.00046826055,0.0016978207],"study_design_scores_gemma":[0.000029340992,0.00007603974,0.00031113235,0.0000022344825,0.000007152226,0.000015444757,0.000033586464,0.99742126,0.0015457402,0.00041877772,0.00013300945,0.0000063366906],"about_ca_topic_score_codex":0.010614817,"about_ca_topic_score_gemma":0.0064495075,"teacher_disagreement_score":0.010614817,"about_ca_system_score_codex":0.0010809158,"about_ca_system_score_gemma":0.00075647497,"threshold_uncertainty_score":0.021106064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.403715,0.0010281118,0.32652214,0.0029260733,0.00025497412,0.0002582535,0.0020048756,0.00081616186,0.2624744],"genre_scores_gemma":[0.8772634,0.00082639256,0.04211959,0.0006777481,0.00026567336,0.00027881868,0.001446242,0.00024880064,0.076873384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990351,0.00030671715,0.000041885833,0.00026952548,0.00019166942,0.00015516904],"domain_scores_gemma":[0.99546957,0.0019728113,0.0005915054,0.00063773594,0.00058485614,0.00074366014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641258,0.00050018425,0.0006733978,0.0020569614,0.0027591293,0.002942831,0.0012361135,0.0014798745,0.024953302],"category_scores_gemma":[0.0036889268,0.00059181015,0.00068182545,0.0022537431,0.0011452498,0.005043229,0.0021655764,0.002002624,0.002972967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009032201,0.00006529793,0.0011929997,0.000098968856,0.00004663536,0.00050804537,0.00077738054,0.0018368907,0.0019255397,0.96361923,0.007683894,0.022154782],"study_design_scores_gemma":[0.000033083204,0.000024050509,0.000982397,0.00003329546,0.0000375188,0.0006100623,0.00044095248,0.010062398,0.0012972545,0.9674488,0.019011725,0.000018406272],"about_ca_topic_score_codex":0.000810816,"about_ca_topic_score_gemma":0.0010804614,"teacher_disagreement_score":0.024953302,"about_ca_system_score_codex":0.00071080413,"about_ca_system_score_gemma":0.0003682295,"threshold_uncertainty_score":0.08347714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564007,0.003009041,0.12785348,0.0058092177,0.0005323189,0.00008003603,0.0009356629,0.000400922,0.20497864],"genre_scores_gemma":[0.9672075,0.0019074386,0.012407125,0.0004946722,0.00060380594,0.00010808773,0.00052080397,0.00020350194,0.016547086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990687,0.00029991943,0.000027885411,0.00021010118,0.00018697053,0.0002065265],"domain_scores_gemma":[0.987649,0.009165664,0.00093348196,0.00073701754,0.00062962226,0.00088507024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016155082,0.0010377622,0.0009463703,0.004468062,0.0022399332,0.0045083864,0.002070809,0.0013523755,0.0107421735],"category_scores_gemma":[0.010500664,0.0007741141,0.0005913022,0.0037290107,0.006313661,0.007873175,0.0026568917,0.0034124204,0.0007430129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012455558,0.00002788641,0.0010031639,0.000063057916,0.000011538029,0.000036697093,0.00027377007,0.008179095,0.00088325114,0.97918403,0.0026442162,0.0075687547],"study_design_scores_gemma":[0.000023834566,0.000019464303,0.000855365,0.000034541317,0.000017190461,0.00005911203,0.00012489039,0.020037914,0.0005326271,0.97565573,0.002616123,0.000023232822],"about_ca_topic_score_codex":0.0038795313,"about_ca_topic_score_gemma":0.0033514986,"teacher_disagreement_score":0.0107421735,"about_ca_system_score_codex":0.0034618194,"about_ca_system_score_gemma":0.0010012706,"threshold_uncertainty_score":0.035936177},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44418582,0.0013457584,0.46356493,0.0006965642,0.00026182862,0.00017585099,0.0005439332,0.00048780083,0.08873754],"genre_scores_gemma":[0.91942537,0.00036247703,0.06709746,0.00017847965,0.00009493621,0.00017656642,0.00030551877,0.000078651305,0.012280574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909055,0.00017348719,0.00003901733,0.00020569778,0.00019331354,0.0002978483],"domain_scores_gemma":[0.9980368,0.0007810662,0.00028805787,0.00043476734,0.00019106764,0.0002682824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010003871,0.00043184185,0.00043427144,0.0008396771,0.0018734542,0.0019419582,0.00060766196,0.0009380369,0.0067984234],"category_scores_gemma":[0.003957401,0.0003563158,0.00057290413,0.00066850515,0.0019716234,0.0029344524,0.0015595024,0.001651946,0.00073458476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051156174,0.0000137595325,0.00031899544,0.00003479912,0.0000048768165,0.0000844751,0.00022001442,0.00089377596,0.0022638252,0.98543614,0.0007681492,0.009910078],"study_design_scores_gemma":[0.000038230235,0.0000918984,0.0004515205,0.000067124245,0.000020938252,0.0004160693,0.00032272885,0.010327087,0.010890801,0.9559762,0.021365825,0.000031601317],"about_ca_topic_score_codex":0.00060458604,"about_ca_topic_score_gemma":0.0006780409,"teacher_disagreement_score":0.0067984234,"about_ca_system_score_codex":0.0011136354,"about_ca_system_score_gemma":0.0005333442,"threshold_uncertainty_score":0.022742987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2704188,0.0006315957,0.7234,0.0002502132,0.000060005135,0.00015114421,0.00011900908,0.00053175853,0.0044374447],"genre_scores_gemma":[0.693452,0.00023042278,0.30434588,0.00010339341,0.0000181533,0.0001665835,0.00010500921,0.00005730154,0.0015212502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993259,0.00026089276,0.000020842032,0.0000595975,0.00027234835,0.00006050913],"domain_scores_gemma":[0.9981285,0.0010091267,0.00025516018,0.00016880281,0.00036807178,0.00007049006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075309514,0.00047900583,0.00028707212,0.0006800288,0.00035659768,0.00051681366,0.0004084886,0.0006073004,0.0006514831],"category_scores_gemma":[0.0032788697,0.0002926599,0.0001990379,0.00054176134,0.0005146943,0.00048276622,0.00050592073,0.00034049962,0.00025958236],"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.0004065854,0.00012825198,0.002676415,0.00017249174,0.000056545643,0.00013461564,0.00023836186,0.77600276,0.07011897,0.04192581,0.0011994151,0.106939696],"study_design_scores_gemma":[0.000034792214,0.0002066174,0.00033648306,0.000009406149,0.000006684987,0.00008153905,0.000015083109,0.9712072,0.020283688,0.0063881897,0.0014137381,0.00001653036],"about_ca_topic_score_codex":0.001250908,"about_ca_topic_score_gemma":0.0018210644,"teacher_disagreement_score":0.001250908,"about_ca_system_score_codex":0.0009588526,"about_ca_system_score_gemma":0.00088960223,"threshold_uncertainty_score":0.006957054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05364364,0.00030697827,0.9302945,0.0011642451,0.00008494136,0.00013320209,0.0002922892,0.0009626995,0.013117428],"genre_scores_gemma":[0.561717,0.00046948268,0.4251458,0.00046931746,0.00015545364,0.00057775166,0.00047363303,0.00045591933,0.010535592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692696,0.00075772096,0.00023395462,0.0007735884,0.0007645532,0.0005431674],"domain_scores_gemma":[0.98461086,0.007829029,0.00059738365,0.0052454257,0.0009925414,0.00072467374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034613821,0.0005932002,0.001105135,0.001618555,0.003143381,0.003127868,0.0020723871,0.0023797532,0.009190337],"category_scores_gemma":[0.014419472,0.0014061186,0.001343529,0.0019685277,0.0040640845,0.008574907,0.008028861,0.004016923,0.0016687154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032847692,0.00009221878,0.0010740495,0.00015587236,0.000027412614,0.00009940711,0.00049977674,0.006337016,0.0077910656,0.9271138,0.0033412236,0.053139806],"study_design_scores_gemma":[0.00018912514,0.00015934273,0.0005424945,0.00009262109,0.00009976635,0.00076698605,0.0003148916,0.07310575,0.024762308,0.8851718,0.014668307,0.00012659488],"about_ca_topic_score_codex":0.000635544,"about_ca_topic_score_gemma":0.00066641456,"teacher_disagreement_score":0.009190337,"about_ca_system_score_codex":0.0019023925,"about_ca_system_score_gemma":0.0018474815,"threshold_uncertainty_score":0.030744791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1778417,0.00039780987,0.6898603,0.0014150388,0.00035733965,0.00020868857,0.00060659804,0.001355082,0.12795745],"genre_scores_gemma":[0.8085682,0.00044478793,0.14920321,0.0005751248,0.0001496987,0.0002362012,0.00051945914,0.000520228,0.039783053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982666,0.00033799917,0.00012328544,0.00032704402,0.0005257202,0.00041931297],"domain_scores_gemma":[0.99742365,0.0008557776,0.00014260736,0.0010413487,0.00029784552,0.00023880441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015255335,0.0006571104,0.00093456666,0.0010997395,0.0027879118,0.0032138834,0.0012508032,0.0012515003,0.012477538],"category_scores_gemma":[0.0033989842,0.00062883645,0.001018448,0.0017362839,0.0026803368,0.0059579215,0.004193565,0.0035913172,0.0018759114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007339293,0.0000140631,0.00004306347,0.000023737084,0.0000033122121,0.000025399402,0.00011555779,0.0009755301,0.0010465585,0.99154156,0.0006606076,0.0054772086],"study_design_scores_gemma":[0.000020134987,0.000014545848,0.00004678646,0.000012177318,0.000010252942,0.000042337233,0.000049294675,0.005683195,0.0026458665,0.9863193,0.005143528,0.0000126337245],"about_ca_topic_score_codex":0.001328629,"about_ca_topic_score_gemma":0.0014822001,"teacher_disagreement_score":0.012477538,"about_ca_system_score_codex":0.0015358581,"about_ca_system_score_gemma":0.0012637947,"threshold_uncertainty_score":0.04174155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091851994,0.000121302626,0.9027817,0.000128768,0.000029380219,0.000042641084,0.00002603395,0.00028198352,0.004736171],"genre_scores_gemma":[0.5272046,0.00018574223,0.46891168,0.00012272024,0.000031862233,0.00008855838,0.000061424784,0.00009237183,0.003301023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999323,0.00021523068,0.000031158095,0.000087575754,0.00024533534,0.00009769959],"domain_scores_gemma":[0.99738497,0.0013681019,0.00032233086,0.00054424757,0.00029558383,0.00008480176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007727602,0.0005121798,0.00035719722,0.0006245947,0.0003153551,0.00064274337,0.00089134456,0.00046469367,0.0014886524],"category_scores_gemma":[0.003458585,0.00023116433,0.00045410614,0.0006687638,0.0007887092,0.0011180771,0.0010990257,0.0007685503,0.0003443417],"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.00055834564,0.00021301158,0.001024458,0.0001837976,0.000066419794,0.00018845253,0.00025021,0.33761126,0.1497898,0.3038602,0.0014438364,0.20481028],"study_design_scores_gemma":[0.00007145786,0.00036620683,0.0003563076,0.0000207264,0.00003739283,0.00028087426,0.000043081676,0.8073904,0.11473707,0.07045821,0.006191902,0.000046360805],"about_ca_topic_score_codex":0.00034514707,"about_ca_topic_score_gemma":0.0005256971,"teacher_disagreement_score":0.0014886524,"about_ca_system_score_codex":0.00055337435,"about_ca_system_score_gemma":0.00055261765,"threshold_uncertainty_score":0.0049800277},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011978954,0.00059523695,0.9727817,0.0003138324,0.00007935471,0.00004481827,0.00011416152,0.0004228727,0.013669171],"genre_scores_gemma":[0.4689904,0.0015734329,0.51617587,0.0004927855,0.00024782153,0.00013938714,0.0003830608,0.00010105942,0.011896113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939144,0.00017146106,0.000031906293,0.00012892617,0.00020916767,0.00006708585],"domain_scores_gemma":[0.99930334,0.00030626773,0.0000422779,0.00014140885,0.0001501162,0.00005658898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006335576,0.0005871133,0.00071225385,0.0006327659,0.00036570764,0.0010707679,0.0008662979,0.0012267277,0.0028275398],"category_scores_gemma":[0.0017562639,0.00025056535,0.0004287421,0.0012614441,0.0009902111,0.0009862027,0.0011104948,0.0007322758,0.0011888886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032957844,0.00009057298,0.0007328359,0.00021447918,0.000046056954,0.0005150417,0.00010110248,0.49302283,0.023165852,0.32829338,0.0061160387,0.14737222],"study_design_scores_gemma":[0.000027351707,0.000054004082,0.00005879175,0.000010651187,0.0000069151793,0.0002558226,0.000013248639,0.9546686,0.0048625306,0.03504337,0.0049825534,0.000016251503],"about_ca_topic_score_codex":0.0020589014,"about_ca_topic_score_gemma":0.0014649314,"teacher_disagreement_score":0.0028275398,"about_ca_system_score_codex":0.0007482012,"about_ca_system_score_gemma":0.0013964808,"threshold_uncertainty_score":0.009459019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5961767,0.0017067385,0.36031523,0.00048570632,0.000035092628,0.000039542643,0.000065084096,0.00032234716,0.04085357],"genre_scores_gemma":[0.98821354,0.00050625653,0.009527486,0.00005715076,0.000015044869,0.000023403816,0.000024312363,0.000023057502,0.001609691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943644,0.00017518319,0.000016311024,0.000045850476,0.0002519565,0.000074247786],"domain_scores_gemma":[0.99902403,0.00060520717,0.0000888174,0.00011424246,0.00012365651,0.000043998003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965804,0.0003207802,0.0003107355,0.00064266653,0.0003262233,0.00091798935,0.000420374,0.0005521481,0.00089844904],"category_scores_gemma":[0.002652613,0.00021699193,0.00009495545,0.0003875694,0.0010590627,0.0009570905,0.0005240174,0.00035367708,0.0003060332],"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.00030552782,0.00009550668,0.0013708081,0.00011272084,0.00002472012,0.00026882242,0.00027559474,0.08226956,0.127284,0.7459679,0.00088952045,0.041135296],"study_design_scores_gemma":[0.000059228518,0.00021901005,0.0014949517,0.000101323756,0.000024867351,0.00052683783,0.000104456296,0.639727,0.058662165,0.2952442,0.0037932287,0.00004271794],"about_ca_topic_score_codex":0.0002980278,"about_ca_topic_score_gemma":0.00018329841,"teacher_disagreement_score":0.00091798935,"about_ca_system_score_codex":0.00043596103,"about_ca_system_score_gemma":0.00021378255,"threshold_uncertainty_score":0.0036839247},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09123225,0.09989786,0.4509097,0.036182057,0.005046224,0.00013070568,0.000088465684,0.00020338157,0.3163093],"genre_scores_gemma":[0.7894358,0.065087326,0.109127074,0.0027274024,0.004247722,0.00012124973,0.00002969582,0.000046301546,0.029177394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995196,0.00021141066,0.000015527545,0.00007342522,0.00012262109,0.00005752322],"domain_scores_gemma":[0.99896216,0.0006817909,0.000088704655,0.00009418342,0.000113014714,0.000060126502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360957,0.0002951501,0.0002461744,0.0005345935,0.0012088432,0.002229638,0.00049980724,0.0011983458,0.0015507755],"category_scores_gemma":[0.0020810172,0.00019837401,0.00016931337,0.00066317123,0.0031355896,0.0034512528,0.0006306178,0.001062145,0.00032483204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000958022,0.00001058415,0.00022349312,0.000039903807,0.000003011883,0.000056231864,0.00010401834,0.0034595774,0.0011947283,0.97443545,0.0010493305,0.019414129],"study_design_scores_gemma":[0.000006374688,0.00006494714,0.00038268615,0.00007413836,0.0000069936104,0.0002305076,0.00015607178,0.018199716,0.0012634662,0.9199556,0.059639007,0.00002045805],"about_ca_topic_score_codex":0.0011689834,"about_ca_topic_score_gemma":0.0009996265,"teacher_disagreement_score":0.002229638,"about_ca_system_score_codex":0.0010595365,"about_ca_system_score_gemma":0.00051225035,"threshold_uncertainty_score":0.007687509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8411538,0.00053273235,0.14869137,0.0006841006,0.00015448815,0.00021168633,0.00014742657,0.0028451942,0.005579137],"genre_scores_gemma":[0.88262206,0.00009687587,0.112571806,0.00017766345,0.00008129992,0.000073233496,0.00007909991,0.00006975963,0.0042281835],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989722,0.00017263586,0.000052016818,0.00018686692,0.0005065463,0.00010974868],"domain_scores_gemma":[0.9986796,0.00039814968,0.00016286434,0.00022992144,0.00038720676,0.00014226513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009265808,0.00033499705,0.00046690635,0.00030876108,0.00044625858,0.0005348743,0.0011275117,0.0010473158,0.0014969384],"category_scores_gemma":[0.0013615465,0.00024009537,0.00026671984,0.00017250971,0.0005151198,0.00076069776,0.00069509237,0.0007060862,0.0006108543],"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.00020210071,0.00012689861,0.0008608769,0.0000764493,0.00004488667,0.00042942225,0.0002497911,0.00084585557,0.97604173,0.0017610525,0.0007127119,0.01864821],"study_design_scores_gemma":[0.00012799709,0.0014289025,0.0019360485,0.000012879551,0.000060680995,0.0021916942,0.000043809036,0.023809524,0.9634154,0.00052050303,0.006402544,0.00005013332],"about_ca_topic_score_codex":0.00043909243,"about_ca_topic_score_gemma":0.0005923262,"teacher_disagreement_score":0.0014969384,"about_ca_system_score_codex":0.00028096294,"about_ca_system_score_gemma":0.0003257655,"threshold_uncertainty_score":0.005007744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80602765,0.00046250058,0.18729806,0.000072325325,0.000008613432,0.000019119725,0.000060393086,0.00012492764,0.00592636],"genre_scores_gemma":[0.9918794,0.00011357254,0.0074243704,0.000006610198,0.000004137499,0.000008637256,0.000038056154,0.000016402328,0.00050883327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995159,0.00011964359,0.000012959284,0.000041601095,0.00025112345,0.000058741796],"domain_scores_gemma":[0.9978758,0.0014688862,0.00014358464,0.00015551384,0.00032802654,0.000028102064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058080954,0.0002871187,0.0002885503,0.00060811563,0.00018370031,0.00041388423,0.00038613132,0.00029354938,0.0008152424],"category_scores_gemma":[0.0034741708,0.00012607421,0.00019119034,0.0004186979,0.00051706715,0.0005887336,0.0002308802,0.00026783627,0.00018395393],"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.00052616926,0.00013379104,0.00759522,0.0001444627,0.00012214851,0.00037191622,0.00023903273,0.5735293,0.2525368,0.107690915,0.0003356588,0.056774627],"study_design_scores_gemma":[0.000013413968,0.00009218428,0.003445007,0.000013022594,0.00002266868,0.00022626792,0.000032598102,0.9260372,0.05897503,0.010311914,0.0008066889,0.000024020064],"about_ca_topic_score_codex":0.0005101728,"about_ca_topic_score_gemma":0.00038049268,"teacher_disagreement_score":0.0008152424,"about_ca_system_score_codex":0.00049224735,"about_ca_system_score_gemma":0.00022294653,"threshold_uncertainty_score":0.0035715103},"labels":[],"label_agreement":null},{"id":"W2131023786","doi":"10.1002/jcd.1006","title":"More on the existence of small quasimultiples of affine and projective planes of arbitrary order","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Affine transformation; Projective plane; Order (exchange); Projective test; Integer (computer science); Discrete mathematics; Pure mathematics; Geometry; Computer science","score_opus":0.031767186384510225,"score_gpt":0.22858677587691043,"score_spread":0.1968195894924002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131023786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7942616,0.0034874058,0.09782351,0.002534368,0.00022730498,0.000056849167,0.00013344143,0.00011514147,0.101360336],"genre_scores_gemma":[0.98611164,0.0005331442,0.007433352,0.00016050834,0.00009135116,0.000022902983,0.00004612318,0.000017977065,0.0055831387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995316,0.00012219064,0.000021470347,0.00011757764,0.00013301951,0.00007416618],"domain_scores_gemma":[0.9979049,0.001012115,0.00042452448,0.00029643087,0.00015063572,0.00021135215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085978006,0.0005206567,0.0005018653,0.0011276717,0.00105857,0.0016816244,0.00031036453,0.0006217035,0.00989171],"category_scores_gemma":[0.0027644995,0.00031300262,0.0003900717,0.0007327914,0.002111794,0.0035086363,0.0011508419,0.0012781218,0.0004443374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029516322,0.000058261983,0.003249478,0.00011396052,0.000024610179,0.00076035433,0.0004604386,0.0043432447,0.023762798,0.9435415,0.0014961361,0.02189407],"study_design_scores_gemma":[0.00010723415,0.00060803693,0.005599713,0.00013104714,0.00004813192,0.0026479678,0.0009462347,0.02363436,0.032023825,0.9085913,0.025583789,0.00007842889],"about_ca_topic_score_codex":0.00037893653,"about_ca_topic_score_gemma":0.00042663995,"teacher_disagreement_score":0.00989171,"about_ca_system_score_codex":0.00067220454,"about_ca_system_score_gemma":0.00017131049,"threshold_uncertainty_score":0.03309107},"labels":[],"label_agreement":null},{"id":"W2131599704","doi":"10.1002/jcd.20245","title":"On the classification of Hadamard matrices of order 32","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"School of Mathematics, Institute for Research in Fundamental Sciences; University of Lethbridge","keywords":"Hadamard transform; Complex Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Hadamard matrix; Hadamard's inequality; Combinatorics; Equivalence (formal languages); Hadamard product; Order (exchange); Hadamard three-lines theorem; Type (biology); Discrete mathematics; Mathematical analysis","score_opus":0.01717917542251244,"score_gpt":0.2250459578724909,"score_spread":0.20786678244997847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131599704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8966674,0.00095787627,0.07203365,0.0006898956,0.00017551439,0.00014049336,0.0004429418,0.00019832152,0.0286939],"genre_scores_gemma":[0.9768034,0.00021112978,0.018834414,0.000101682344,0.000113381204,0.00005062555,0.0004881369,0.000026640442,0.0033704662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978023,0.0004247661,0.00016759419,0.0003235871,0.00087248656,0.00040924555],"domain_scores_gemma":[0.99325824,0.0030883797,0.0011348714,0.001039846,0.0009636498,0.00051488756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014536019,0.0006171912,0.00078805565,0.0041636257,0.0013578229,0.002112213,0.0005427297,0.0009798448,0.005849068],"category_scores_gemma":[0.008508909,0.0003178586,0.00046735274,0.0019767438,0.0019256171,0.0020559025,0.0009362538,0.0012121496,0.00069665944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012287174,0.00030617716,0.017639102,0.00020718329,0.00004517651,0.0009294396,0.0016749364,0.0180271,0.04061517,0.780453,0.0064734994,0.1324005],"study_design_scores_gemma":[0.0001534333,0.0005207052,0.009964576,0.000109217275,0.000022489241,0.0023359589,0.00054496474,0.07529471,0.015403772,0.87343675,0.022101102,0.00011228579],"about_ca_topic_score_codex":0.00089596084,"about_ca_topic_score_gemma":0.0005639529,"teacher_disagreement_score":0.005849068,"about_ca_system_score_codex":0.000849986,"about_ca_system_score_gemma":0.0005626544,"threshold_uncertainty_score":0.019567072},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25616044,0.0011015442,0.7193474,0.0005340212,0.00003054798,0.00024476496,0.0012819569,0.0019895076,0.019309862],"genre_scores_gemma":[0.44779304,0.00030137022,0.54456913,0.000115095325,0.000024845267,0.00023033691,0.0017928908,0.00017535871,0.004997957],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995247,0.0001504499,0.00002676031,0.000059089496,0.00016253401,0.00007646246],"domain_scores_gemma":[0.99849117,0.0010264457,0.00011120195,0.00010438719,0.00022341912,0.00004340365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005772147,0.00046696136,0.00079061906,0.0019268079,0.0005597805,0.000719302,0.00051995,0.0005529227,0.006343612],"category_scores_gemma":[0.004322816,0.0003532922,0.00029305444,0.00119433,0.00044622776,0.00094421906,0.00067708874,0.00031352826,0.001469042],"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.0012875594,0.0003743622,0.0046060383,0.0006921344,0.000085847816,0.00054114737,0.00045738128,0.26824957,0.03351674,0.06242741,0.011885441,0.6158764],"study_design_scores_gemma":[0.00030430945,0.00025348892,0.0018617399,0.00006582942,0.00004444868,0.00032635467,0.00034630968,0.89453524,0.018186145,0.07636495,0.0076673874,0.000043761695],"about_ca_topic_score_codex":0.001578289,"about_ca_topic_score_gemma":0.003213596,"teacher_disagreement_score":0.006343612,"about_ca_system_score_codex":0.00051162625,"about_ca_system_score_gemma":0.0016503211,"threshold_uncertainty_score":0.021221459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57083315,0.002184256,0.20902775,0.0011037309,0.0005362984,0.00026106604,0.0021188732,0.00089532876,0.21303956],"genre_scores_gemma":[0.95085067,0.00078468106,0.027742296,0.00038005627,0.00018925921,0.00012290283,0.001725286,0.00007974249,0.018125106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967015,0.000046053738,0.000016852066,0.00012275949,0.00007855177,0.00006576485],"domain_scores_gemma":[0.99927646,0.0001787149,0.00013412433,0.00014523695,0.000119293334,0.00014625174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015976043,0.00033351334,0.0002986837,0.00077113486,0.0011184951,0.0015602821,0.00044330972,0.00044186495,0.0070684724],"category_scores_gemma":[0.0007711992,0.00020119878,0.00040448632,0.0007319305,0.0006829183,0.0015910228,0.0007013515,0.0008149019,0.0007681363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004404437,0.000048523023,0.0011674459,0.00009408855,0.000020708625,0.0005122274,0.00035956077,0.0014818838,0.0053961207,0.9652838,0.003525652,0.02206585],"study_design_scores_gemma":[0.000045314453,0.000098344055,0.0017437645,0.00004787863,0.000031785155,0.0010287225,0.00039439494,0.009055521,0.003323732,0.92679745,0.05740467,0.00002845868],"about_ca_topic_score_codex":0.00079294364,"about_ca_topic_score_gemma":0.00096050574,"teacher_disagreement_score":0.0070684724,"about_ca_system_score_codex":0.0005824865,"about_ca_system_score_gemma":0.0004565702,"threshold_uncertainty_score":0.023646414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1979418,0.0007988627,0.5575082,0.002113912,0.0005240494,0.00022706242,0.00059782434,0.0006688311,0.23961943],"genre_scores_gemma":[0.77182716,0.00074436166,0.1254693,0.001138711,0.00032476263,0.00023026814,0.00056902354,0.0002030941,0.0994933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991978,0.00025064283,0.00002892715,0.00024418402,0.0001850959,0.00009337442],"domain_scores_gemma":[0.9976724,0.00084965257,0.00023383189,0.0006745082,0.00035064918,0.00021905346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050655263,0.00064722926,0.00053728226,0.0010688616,0.0012960852,0.001975273,0.0007371767,0.0009573801,0.018258525],"category_scores_gemma":[0.0025147195,0.00052799325,0.00038859344,0.000955118,0.001061666,0.001975536,0.0013577329,0.0017476426,0.0022703477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052552838,0.000036642476,0.00023819746,0.000040592648,0.000011569742,0.000054284785,0.00007653418,0.0024002804,0.0024952588,0.9633554,0.003579695,0.027658977],"study_design_scores_gemma":[0.00002695654,0.000041115658,0.00020279374,0.000029044306,0.00001620886,0.00019751802,0.00004416728,0.0096637895,0.0018696709,0.95977443,0.028122017,0.000012365508],"about_ca_topic_score_codex":0.00030065706,"about_ca_topic_score_gemma":0.00057262706,"teacher_disagreement_score":0.018258525,"about_ca_system_score_codex":0.00089182623,"about_ca_system_score_gemma":0.0004791401,"threshold_uncertainty_score":0.061080813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25336283,0.00050518586,0.65268934,0.00067404803,0.00030851987,0.00020508213,0.00092744664,0.00084135163,0.0904862],"genre_scores_gemma":[0.7432172,0.0007145976,0.19842932,0.00042252772,0.00026667275,0.00023848285,0.0019491295,0.0005814817,0.054180656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.0001732099,0.000066135835,0.00020279703,0.00018085421,0.00022493488],"domain_scores_gemma":[0.99853146,0.0005332612,0.00019043432,0.00030079507,0.00024439566,0.00019965436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006227912,0.0007658953,0.0007993848,0.0010979438,0.001421816,0.0025293843,0.00070623227,0.0007583459,0.014654529],"category_scores_gemma":[0.0023370106,0.0006319583,0.0011999449,0.0010774984,0.0014613875,0.0029917606,0.0014716821,0.0015369509,0.003315335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015597233,0.00005454989,0.0002583609,0.00007832885,0.000013956005,0.00012138939,0.00036202956,0.0023530915,0.00465342,0.964539,0.0035710905,0.0238389],"study_design_scores_gemma":[0.00002501472,0.00005454913,0.00017544994,0.000027223878,0.000015594254,0.00013866478,0.0001229014,0.0058039953,0.002089805,0.9832855,0.008246278,0.000015063415],"about_ca_topic_score_codex":0.00075201906,"about_ca_topic_score_gemma":0.00124433,"teacher_disagreement_score":0.014654529,"about_ca_system_score_codex":0.00066569564,"about_ca_system_score_gemma":0.0007679379,"threshold_uncertainty_score":0.049024224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9198627,0.00013529048,0.07554794,0.00022057454,0.000037386882,0.000087576154,0.00024972306,0.00058115704,0.003277607],"genre_scores_gemma":[0.9904668,0.000035715842,0.0091324765,0.000009284783,0.0000039599927,0.000025021289,0.000053645188,0.0000120668465,0.00026108834],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909675,0.00018894378,0.000038175425,0.00009616266,0.0004852878,0.00009463397],"domain_scores_gemma":[0.9949468,0.003203969,0.00029463103,0.0006756822,0.00079891365,0.000080021106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407422,0.0006136254,0.00032863594,0.00036919996,0.0004499178,0.0003597579,0.00084255805,0.00071541854,0.0016336645],"category_scores_gemma":[0.0071697063,0.00024256171,0.00021069354,0.00026250098,0.00097316026,0.0007990539,0.00038784955,0.00051615934,0.00025365117],"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.0010155254,0.00040678214,0.0048896023,0.0002382812,0.00009074728,0.0005828375,0.00030667163,0.25352794,0.702029,0.023329258,0.0006064268,0.012976975],"study_design_scores_gemma":[0.000044904813,0.00037204172,0.001319171,0.000015522093,0.000014337064,0.00009731024,0.000031483978,0.49845526,0.49752653,0.0015328532,0.00055622257,0.000034420194],"about_ca_topic_score_codex":0.0027679934,"about_ca_topic_score_gemma":0.0014063556,"teacher_disagreement_score":0.0027679934,"about_ca_system_score_codex":0.0007092012,"about_ca_system_score_gemma":0.0004569403,"threshold_uncertainty_score":0.0074431896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15628509,0.003345892,0.6666844,0.0032445923,0.00061664655,0.00015400852,0.00033393365,0.00053665333,0.1687988],"genre_scores_gemma":[0.76754856,0.002790167,0.17522657,0.0013250108,0.000554729,0.00031704383,0.0004038681,0.00027440058,0.051559657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985006,0.0005935968,0.00006290704,0.0003095513,0.00035069702,0.00018278287],"domain_scores_gemma":[0.9971438,0.0014031396,0.00029821636,0.0007529129,0.0002086286,0.00019331663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771409,0.0012492851,0.0008825357,0.0021449917,0.0022315895,0.003786911,0.0012586364,0.0019528414,0.012549576],"category_scores_gemma":[0.004105815,0.0010709015,0.0007939542,0.0034014322,0.00297151,0.005615093,0.0031079296,0.0033685106,0.0014800972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016820797,0.00001594803,0.000067398985,0.000028053504,0.0000034703933,0.000026866694,0.0001005716,0.0011024645,0.00041304328,0.9907663,0.0008088036,0.006650316],"study_design_scores_gemma":[0.000008212702,0.000011704182,0.000042860862,0.0000233271,0.000006072739,0.000074607015,0.00005442055,0.0035318504,0.0006374621,0.99012977,0.0054724915,0.000007278091],"about_ca_topic_score_codex":0.00047608477,"about_ca_topic_score_gemma":0.0007567436,"teacher_disagreement_score":0.012549576,"about_ca_system_score_codex":0.001491734,"about_ca_system_score_gemma":0.00064194604,"threshold_uncertainty_score":0.04198253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6571806,0.0007621453,0.18581675,0.0016703486,0.00052463845,0.00021566723,0.0004625302,0.0009120998,0.15245526],"genre_scores_gemma":[0.91200733,0.00025456343,0.051361784,0.00042654655,0.00010085866,0.000119723416,0.00017682266,0.00012255694,0.035429835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993562,0.00017797617,0.000042703647,0.00008617929,0.0001613561,0.0001756683],"domain_scores_gemma":[0.99912304,0.00025608882,0.00014603989,0.00020381501,0.00017180647,0.000099243916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066519016,0.00049333007,0.0006329203,0.0010545086,0.0012576837,0.0019991552,0.0005203317,0.00074753736,0.009388586],"category_scores_gemma":[0.001749374,0.0003268353,0.0004483489,0.0007508594,0.001718833,0.0013467419,0.0013069223,0.0012414267,0.0015476597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029954722,0.000035662342,0.00043539036,0.00006273111,0.000011715216,0.00011347507,0.00025454749,0.003590462,0.0056767445,0.96788454,0.0015066877,0.020128509],"study_design_scores_gemma":[0.000113673465,0.00026341953,0.00033510337,0.00009440664,0.000018548437,0.00021988439,0.00024017211,0.019983077,0.012466279,0.94102305,0.025201188,0.00004116038],"about_ca_topic_score_codex":0.0005578636,"about_ca_topic_score_gemma":0.0009937102,"teacher_disagreement_score":0.009388586,"about_ca_system_score_codex":0.0012778182,"about_ca_system_score_gemma":0.0008948241,"threshold_uncertainty_score":0.031407952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9405689,0.00048485614,0.05116743,0.00053945935,0.000024031586,0.000044432203,0.000112905065,0.00008511183,0.0069729523],"genre_scores_gemma":[0.9963954,0.00015951516,0.002694753,0.000020615971,0.000006718363,0.000015505191,0.000026357015,0.000012822079,0.0006682171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993349,0.00026968378,0.000013069049,0.000035773337,0.00017661146,0.00016988398],"domain_scores_gemma":[0.9871594,0.010491102,0.0009724165,0.00031304607,0.0008878114,0.00017627898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014042103,0.00044348725,0.00047060993,0.00075066905,0.0006743856,0.0009930775,0.0005159392,0.00067342824,0.0007046739],"category_scores_gemma":[0.012304408,0.00030178222,0.0002392152,0.0008597538,0.0021703928,0.0015248763,0.0007164191,0.00047968802,0.00006924276],"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.000029513001,0.000009592678,0.00063808734,0.000013502724,0.0000058480205,0.00005225284,0.000028939685,0.9903223,0.00035080579,0.0076628663,0.000089121626,0.00079715514],"study_design_scores_gemma":[0.000008462136,0.000018955541,0.00029154358,0.000005981915,0.000006617374,0.000019432153,0.00002600473,0.99397755,0.0007448097,0.004810633,0.00008550465,0.0000044994345],"about_ca_topic_score_codex":0.01763311,"about_ca_topic_score_gemma":0.013800673,"teacher_disagreement_score":0.01763311,"about_ca_system_score_codex":0.0020680744,"about_ca_system_score_gemma":0.0012420375,"threshold_uncertainty_score":0.035060942},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12573238,0.0011699182,0.8644271,0.00030988452,0.000060295002,0.00023582215,0.00015182627,0.0008176962,0.0070951614],"genre_scores_gemma":[0.58250266,0.00059124245,0.4135311,0.00018303761,0.000029159215,0.00038483285,0.0002541143,0.00013539715,0.0023884848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917465,0.00053836306,0.000027023581,0.00007174012,0.00010790513,0.00008020694],"domain_scores_gemma":[0.9984475,0.0011234065,0.00013583763,0.000110589834,0.00012406032,0.00005878386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015853748,0.0007233942,0.0007870008,0.0015207067,0.0008686032,0.001373626,0.001279464,0.0012916194,0.002749483],"category_scores_gemma":[0.004778659,0.00047100958,0.00043443392,0.001910786,0.0011678921,0.0014770179,0.0008086498,0.0006196727,0.0004574585],"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.00013608274,0.000065149405,0.0007517773,0.00005506951,0.000033066022,0.000033070915,0.000107071515,0.9269849,0.0008679384,0.008217271,0.0009059306,0.061842598],"study_design_scores_gemma":[0.000039981816,0.00006528112,0.000113481794,0.000017886568,0.000013653803,0.000017259597,0.000060279785,0.98836374,0.00072194805,0.009626741,0.0009515307,0.000008297973],"about_ca_topic_score_codex":0.0060001877,"about_ca_topic_score_gemma":0.0061741653,"teacher_disagreement_score":0.0060001877,"about_ca_system_score_codex":0.0010819471,"about_ca_system_score_gemma":0.00112861,"threshold_uncertainty_score":0.011930525},"labels":[],"label_agreement":null},{"id":"W2135235789","doi":"10.1002/jcd.20115","title":"Block designs which are divisible in multiple ways","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Set (abstract data type); Point (geometry); Dual (grammatical number); Arithmetic; Block design; Discrete mathematics; Computer science; Linguistics; Programming language; Geometry","score_opus":0.02620789169931127,"score_gpt":0.2106389366666364,"score_spread":0.18443104496732515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135235789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36219192,0.00044253844,0.57654774,0.0003310631,0.0001962807,0.00035345452,0.00043131315,0.0007914684,0.0587143],"genre_scores_gemma":[0.74162525,0.00027464938,0.23145951,0.0001440575,0.00007713968,0.00038420793,0.000581537,0.00017237989,0.025281174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985812,0.00034028463,0.000098736135,0.00026903074,0.0004322594,0.00027856303],"domain_scores_gemma":[0.9972018,0.00077242585,0.00051940756,0.00093405443,0.00033112607,0.00024127598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092214637,0.0006540845,0.000924689,0.0008911195,0.0007793067,0.0015203448,0.0008582445,0.00070349633,0.008753221],"category_scores_gemma":[0.0021611587,0.0006747391,0.000674769,0.00084154744,0.0012115879,0.0018310569,0.0016852387,0.0011547485,0.0018164521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008241,0.00019935139,0.0013105322,0.00024948956,0.00004870392,0.00053757854,0.00034994716,0.014283714,0.09678726,0.7916761,0.0019753904,0.091757804],"study_design_scores_gemma":[0.0003389857,0.001390174,0.00076343387,0.0001446792,0.00010951372,0.0013699605,0.00018544325,0.055459123,0.15402198,0.72779405,0.058339335,0.00008345248],"about_ca_topic_score_codex":0.00012626636,"about_ca_topic_score_gemma":0.00030773663,"teacher_disagreement_score":0.008753221,"about_ca_system_score_codex":0.00061682664,"about_ca_system_score_gemma":0.00045720435,"threshold_uncertainty_score":0.029282391},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51167613,0.0020597223,0.3770486,0.0012047528,0.00028179458,0.00018288496,0.0012791004,0.00032447896,0.10594254],"genre_scores_gemma":[0.8903881,0.001642992,0.06319726,0.00033481396,0.0002974871,0.00018470128,0.0013915198,0.00030131434,0.042261817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962616,0.00010355906,0.000016106656,0.00006797965,0.00010228523,0.000084007246],"domain_scores_gemma":[0.9986374,0.00047678675,0.00024845847,0.00014251046,0.0002551097,0.00023974733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059204426,0.0008112093,0.0007033924,0.0024778848,0.0011212699,0.0021026984,0.00078841916,0.00076560525,0.009114847],"category_scores_gemma":[0.0019781243,0.00056647306,0.00075580773,0.0017628798,0.0014628515,0.0026764176,0.0009205898,0.0015188647,0.0007644657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032296208,0.000019721067,0.0001753034,0.000034515728,0.000008576441,0.00004624868,0.00020103445,0.004421685,0.00082347787,0.98620784,0.0018892221,0.006140087],"study_design_scores_gemma":[0.000008183579,0.000010412784,0.00018374612,0.000015378138,0.000006034814,0.000030113386,0.00008166711,0.020846725,0.0001975484,0.9765387,0.0020740195,0.000007485956],"about_ca_topic_score_codex":0.0031983806,"about_ca_topic_score_gemma":0.0044512926,"teacher_disagreement_score":0.009114847,"about_ca_system_score_codex":0.001365827,"about_ca_system_score_gemma":0.00067447464,"threshold_uncertainty_score":0.030492127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017480038,0.0011850742,0.9644778,0.00033008464,0.00043870066,0.00015662872,0.0003366062,0.00093008496,0.014664939],"genre_scores_gemma":[0.30859688,0.0009630546,0.6680795,0.00035695502,0.00022180314,0.00020701157,0.0005626313,0.0001131225,0.020899031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882525,0.00022215869,0.000053933363,0.00016566922,0.0005996826,0.0001333043],"domain_scores_gemma":[0.9979482,0.00050021516,0.00014703578,0.0006462983,0.00067012577,0.00008811683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193861,0.0004992002,0.0005632387,0.0011777427,0.0009972944,0.00087848265,0.0011840836,0.0009194328,0.0035213917],"category_scores_gemma":[0.003315762,0.00027854968,0.00048101606,0.0012628855,0.001045358,0.0010268678,0.001100829,0.0009793876,0.0013552835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039418752,0.000085897074,0.0010575602,0.0002474912,0.00006414415,0.00030856888,0.00027998153,0.08662304,0.03167842,0.6038995,0.010912042,0.2644492],"study_design_scores_gemma":[0.0001296441,0.00029896604,0.0009449083,0.00008942471,0.000082341285,0.000767109,0.000059447393,0.6640863,0.0891355,0.16377838,0.080500014,0.00012796544],"about_ca_topic_score_codex":0.0031438684,"about_ca_topic_score_gemma":0.0059696957,"teacher_disagreement_score":0.0035213917,"about_ca_system_score_codex":0.0010460514,"about_ca_system_score_gemma":0.0014834272,"threshold_uncertainty_score":0.011780202},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19651528,0.0032051862,0.7081694,0.0124011,0.00025943312,0.00035422412,0.0008191934,0.0010394212,0.07723671],"genre_scores_gemma":[0.8690728,0.0014401872,0.12151768,0.00081916386,0.00041902944,0.00034021738,0.0004814454,0.00017462425,0.005734767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99139625,0.0026373153,0.00049731694,0.0007207891,0.003728789,0.0010195934],"domain_scores_gemma":[0.9557856,0.03512114,0.0018147404,0.0036180988,0.002822404,0.00083815365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052337646,0.00071783544,0.0009208004,0.002722391,0.0022349686,0.00722067,0.002694432,0.0015498343,0.0092157945],"category_scores_gemma":[0.02787193,0.0008862613,0.0019752504,0.0023268834,0.008044602,0.019257938,0.004507946,0.006627493,0.00076875795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021093376,0.000021507109,0.00017327268,0.00005852285,0.000011031536,0.00002617688,0.00013682914,0.002175881,0.00037465876,0.9911498,0.0006426659,0.005208539],"study_design_scores_gemma":[0.000019805477,0.000013861796,0.00012368122,0.000014547153,0.000013813747,0.000045832116,0.000059238293,0.01420064,0.0009483612,0.98230356,0.002242803,0.000013894049],"about_ca_topic_score_codex":0.0017446205,"about_ca_topic_score_gemma":0.0013591717,"teacher_disagreement_score":0.0092157945,"about_ca_system_score_codex":0.004996265,"about_ca_system_score_gemma":0.0023465825,"threshold_uncertainty_score":0.03625065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13983239,0.00060999097,0.8379135,0.0006213144,0.00016717872,0.000097468284,0.00007313123,0.0010272621,0.019657696],"genre_scores_gemma":[0.7788752,0.00043422863,0.21555758,0.00026430015,0.00010540078,0.00008770349,0.00009732252,0.000037954775,0.0045403554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998252,0.000041148178,0.0000047009075,0.000017443552,0.00008354711,0.000028022912],"domain_scores_gemma":[0.9997694,0.000062429855,0.000031594856,0.000064514505,0.000052742147,0.000019262556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519697,0.0003142255,0.00013805674,0.00029581183,0.00034468243,0.00047160167,0.00050849863,0.00034973756,0.0009147431],"category_scores_gemma":[0.0004701062,0.00009536143,0.00017721039,0.00033627937,0.00046700606,0.0007957417,0.0005583075,0.0004420636,0.00023385894],"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.00044992493,0.00017010485,0.0014447139,0.00022325022,0.00005432503,0.00072229846,0.00023815206,0.10123097,0.21480411,0.4612811,0.0062334496,0.21314763],"study_design_scores_gemma":[0.00007148959,0.00029596954,0.0008919446,0.000028684204,0.00005769902,0.0008820812,0.00005425017,0.7765764,0.06962923,0.096816055,0.05464986,0.00004626106],"about_ca_topic_score_codex":0.0006069671,"about_ca_topic_score_gemma":0.0012983555,"teacher_disagreement_score":0.0009147431,"about_ca_system_score_codex":0.0003135958,"about_ca_system_score_gemma":0.00044905982,"threshold_uncertainty_score":0.003060162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5203769,0.00076454924,0.4222337,0.0026350222,0.00023509651,0.00032113295,0.0010476707,0.00041719706,0.051968716],"genre_scores_gemma":[0.77889407,0.0007080418,0.19960268,0.000501944,0.00018668396,0.00019667314,0.0011253477,0.000108340515,0.018676192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995765,0.000097948585,0.000023464587,0.00010202744,0.00007536122,0.00012475118],"domain_scores_gemma":[0.99874854,0.00058655656,0.00018164853,0.00017854435,0.00013770549,0.0001668741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576878,0.00062728673,0.0005831064,0.0006338219,0.0012065845,0.0011863229,0.0007377473,0.0012455217,0.0063435724],"category_scores_gemma":[0.0031253982,0.00039824005,0.000534144,0.0007906917,0.0007940839,0.0023919232,0.0011148348,0.0011238416,0.0006951811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000859723,0.00021971251,0.0021582395,0.00052003446,0.000077173296,0.0006582553,0.00077235914,0.081057034,0.012624173,0.71888036,0.029101055,0.15307188],"study_design_scores_gemma":[0.00019930782,0.000140393,0.0005749671,0.00006707878,0.000042675987,0.00049528456,0.0005118899,0.16744916,0.004805602,0.8072703,0.01839355,0.000049752638],"about_ca_topic_score_codex":0.0021315394,"about_ca_topic_score_gemma":0.0035736659,"teacher_disagreement_score":0.0063435724,"about_ca_system_score_codex":0.0006764879,"about_ca_system_score_gemma":0.0007729281,"threshold_uncertainty_score":0.02122134},"labels":[],"label_agreement":null},{"id":"W2136980365","doi":"10.1002/jcd.21346","title":"From Squashed 6‐Cycles to Steiner Triple Systems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Steiner system","score_opus":0.014087512407547543,"score_gpt":0.21454753748302668,"score_spread":0.20046002507547914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136980365","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85504633,0.00087963307,0.09374934,0.00029721923,0.00014593078,0.000041377705,0.00024299577,0.00016458168,0.04943264],"genre_scores_gemma":[0.9855047,0.00024838888,0.010315547,0.00008631975,0.000040944105,0.000018964953,0.00009908611,0.000020220128,0.0036658177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984,0.000032442404,0.000012154712,0.000031178617,0.00004858343,0.000035532266],"domain_scores_gemma":[0.99970394,0.000090181005,0.00005678383,0.000040062907,0.00006094014,0.000048157533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015680837,0.00026250622,0.00021051039,0.000921481,0.00047010797,0.0008207071,0.00029399106,0.0004836443,0.006656582],"category_scores_gemma":[0.00049924967,0.0001994047,0.00022415632,0.0005291349,0.0007248005,0.0011940565,0.0010157785,0.00054968323,0.0004859584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000798591,0.000028670393,0.00070186425,0.00011312951,0.000011166685,0.0004171997,0.00028491547,0.017475953,0.016374635,0.94563204,0.0015151782,0.017365398],"study_design_scores_gemma":[0.000012909877,0.000077844794,0.00051086466,0.000034831617,0.000004751245,0.00041762018,0.00012431474,0.03235116,0.0046768724,0.95671344,0.0050593964,0.000015896574],"about_ca_topic_score_codex":0.00023701912,"about_ca_topic_score_gemma":0.0003066536,"teacher_disagreement_score":0.006656582,"about_ca_system_score_codex":0.00028583797,"about_ca_system_score_gemma":0.00015643248,"threshold_uncertainty_score":0.022268474},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122304885,0.00054574147,0.97376156,0.0005015853,0.000059730744,0.00003575943,0.00004467142,0.00006996784,0.012750497],"genre_scores_gemma":[0.8157713,0.0029961744,0.16772914,0.00054075004,0.0007525187,0.00028761406,0.00014239055,0.00027852194,0.011501634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977983,0.0012149446,0.00005237118,0.00012595921,0.0006036866,0.0002047552],"domain_scores_gemma":[0.9938169,0.004781978,0.00032804068,0.00043058043,0.0005414574,0.00010109469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003466906,0.0016785989,0.0011030576,0.0019264026,0.00056913303,0.0022903406,0.0015828814,0.0014457116,0.0038990874],"category_scores_gemma":[0.011710806,0.00043367821,0.0008899931,0.0014195653,0.0020653945,0.0025386708,0.0014947783,0.001751326,0.0008436711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053499683,0.000059488524,0.00025872397,0.0001383779,0.000054094664,0.000056876732,0.0000666845,0.34281346,0.004258321,0.6219511,0.0019399719,0.028349457],"study_design_scores_gemma":[0.00000617692,0.000036639874,0.00008690612,0.000020485868,0.000012699468,0.000044376295,0.000015319929,0.8794641,0.0011861752,0.11831982,0.0007944321,0.000012841227],"about_ca_topic_score_codex":0.0007792421,"about_ca_topic_score_gemma":0.0003363015,"teacher_disagreement_score":0.0038990874,"about_ca_system_score_codex":0.002014066,"about_ca_system_score_gemma":0.0010267876,"threshold_uncertainty_score":0.018334985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038386486,0.00045682842,0.9479795,0.00061846763,0.00019938008,0.00020180941,0.00006473208,0.00085194636,0.011240782],"genre_scores_gemma":[0.44505912,0.00043006783,0.5264377,0.00027089356,0.00017378316,0.00040857118,0.00023003116,0.00006151833,0.026928322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998098,0.000025056243,0.000011462933,0.000032695894,0.00009685803,0.000024088724],"domain_scores_gemma":[0.9999256,0.0000066832126,0.000012042283,0.0000071529867,0.00004017905,0.0000083404675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019639375,0.00026910225,0.00019391376,0.00032822858,0.00040649888,0.00055853184,0.0005995744,0.00039361816,0.0015315287],"category_scores_gemma":[0.00016150375,0.000117242445,0.00018753957,0.00020031577,0.00018392518,0.0005622365,0.0003480283,0.00043010383,0.0003498329],"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.00013968226,0.0003187452,0.0009935377,0.0002544013,0.00007519794,0.00042408204,0.0002526349,0.041537866,0.24718536,0.16173679,0.015925786,0.531156],"study_design_scores_gemma":[0.00016905354,0.00040207023,0.0015893392,0.000040741088,0.00012855949,0.00074056454,0.00019590309,0.73956877,0.118582144,0.042270124,0.096254095,0.000058690108],"about_ca_topic_score_codex":0.0011297496,"about_ca_topic_score_gemma":0.0022573487,"teacher_disagreement_score":0.0015315287,"about_ca_system_score_codex":0.0006810913,"about_ca_system_score_gemma":0.00083409145,"threshold_uncertainty_score":0.005123496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67702764,0.00045882488,0.28991064,0.00050132157,0.00012988909,0.00014767275,0.00027264,0.00017918968,0.03137224],"genre_scores_gemma":[0.9316708,0.00014581086,0.06412321,0.00013214636,0.00007448085,0.00012975663,0.00017433308,0.000028886949,0.0035206245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991899,0.00022682245,0.0000503464,0.00015842688,0.00021117854,0.0001632744],"domain_scores_gemma":[0.9981357,0.0007301411,0.00052082347,0.00021342287,0.00023438754,0.00016553828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075515045,0.0004312153,0.00036186905,0.001083371,0.00091835373,0.0010067065,0.00047357616,0.0007350144,0.004357441],"category_scores_gemma":[0.0035675364,0.00023387186,0.00033838116,0.00090581324,0.0013940086,0.0018784719,0.00090327166,0.0007395134,0.0004834473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025781762,0.000049343696,0.001656727,0.000090089576,0.000013493689,0.0005987166,0.0002505715,0.009160063,0.020037368,0.9537781,0.00072160835,0.013386097],"study_design_scores_gemma":[0.00006634889,0.0005563824,0.0013963701,0.000064003405,0.00002739169,0.001761607,0.00027854997,0.089865714,0.040620398,0.85254884,0.012725698,0.00008875525],"about_ca_topic_score_codex":0.00019244831,"about_ca_topic_score_gemma":0.00016086701,"teacher_disagreement_score":0.004357441,"about_ca_system_score_codex":0.00060009357,"about_ca_system_score_gemma":0.0004986668,"threshold_uncertainty_score":0.014577031},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20759392,0.005121908,0.13851637,0.05599853,0.00472683,0.00006491593,0.001132689,0.0008952884,0.5859495],"genre_scores_gemma":[0.9069185,0.003277805,0.013408499,0.008993425,0.005932019,0.00015298375,0.001215346,0.00039618852,0.059705198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883264,0.00030340505,0.000029715824,0.00028181545,0.00035840593,0.00019403243],"domain_scores_gemma":[0.9952951,0.0030822833,0.0002181756,0.00060309283,0.00043247928,0.00036888465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014950259,0.0010269915,0.0015729826,0.0015019494,0.0026034417,0.0037502917,0.001464559,0.0028031,0.019862989],"category_scores_gemma":[0.008638826,0.00048364847,0.00070491235,0.0018722872,0.0039508543,0.009478234,0.0032621967,0.0061687897,0.00345495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006076231,0.000023837174,0.00016775858,0.00003683955,0.000005522947,0.000055806024,0.000106636384,0.000731212,0.00025319876,0.9854114,0.008144846,0.005002241],"study_design_scores_gemma":[0.000012528589,0.000005879395,0.000055476456,0.000011391125,0.0000029872028,0.000032929613,0.000026797767,0.0013641281,0.00009168862,0.99535996,0.003032554,0.0000036444071],"about_ca_topic_score_codex":0.0010056285,"about_ca_topic_score_gemma":0.00051544205,"teacher_disagreement_score":0.019862989,"about_ca_system_score_codex":0.0012980365,"about_ca_system_score_gemma":0.00069134776,"threshold_uncertainty_score":0.06644827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17066856,0.0010992846,0.524313,0.0029996778,0.00064585014,0.00013810986,0.0005137336,0.00083846867,0.2987834],"genre_scores_gemma":[0.83493793,0.00077389827,0.08963643,0.0010215068,0.0003724458,0.00028893765,0.0007491,0.00050936826,0.07171034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998054,0.00060576753,0.00008059733,0.00043594925,0.0004362618,0.00038742283],"domain_scores_gemma":[0.9960502,0.0023055184,0.00024302836,0.0007017915,0.00039742194,0.00030208877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096470374,0.00079818064,0.0012282641,0.0018581616,0.0037162635,0.0026719854,0.003056853,0.001429086,0.014219223],"category_scores_gemma":[0.003559494,0.00097405823,0.001703689,0.00200281,0.004647712,0.005439167,0.0041360515,0.006512422,0.0024064127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017672728,0.000018260347,0.00007222975,0.000017209275,0.0000045287056,0.000084797946,0.00014145959,0.00059599034,0.00038387554,0.9945004,0.0009160533,0.0032475083],"study_design_scores_gemma":[0.000005082802,0.0000037988498,0.000034154713,0.0000057415486,0.000003599664,0.00005619117,0.000030009407,0.001318634,0.00035562276,0.99667716,0.0015044775,0.000005528696],"about_ca_topic_score_codex":0.0012495285,"about_ca_topic_score_gemma":0.0014873169,"teacher_disagreement_score":0.014219223,"about_ca_system_score_codex":0.0015074557,"about_ca_system_score_gemma":0.0007662457,"threshold_uncertainty_score":0.047568023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17993093,0.0024537449,0.8005981,0.00037098033,0.00027202227,0.00015979336,0.00007518382,0.00044586573,0.015693437],"genre_scores_gemma":[0.8242864,0.0013565819,0.1672846,0.00019648348,0.00015471029,0.00009510123,0.000052338284,0.00002435224,0.0065493532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993773,0.00018591824,0.000026106583,0.00006107462,0.00028828168,0.00006134975],"domain_scores_gemma":[0.99896383,0.0003927491,0.00013568281,0.00013405872,0.00033440883,0.000039309434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046612968,0.000395248,0.00033088189,0.00046962698,0.0002778823,0.0005372961,0.00046075764,0.00071373826,0.0007127387],"category_scores_gemma":[0.0025487212,0.0001565211,0.00022686832,0.0006763754,0.00070621446,0.0007551314,0.00046050403,0.00037874476,0.0003460759],"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.00097646576,0.00017532245,0.0040017725,0.0007711827,0.00010933868,0.0011706073,0.00041030196,0.19373113,0.12900603,0.25555453,0.0022743794,0.41181892],"study_design_scores_gemma":[0.000057008638,0.0005670956,0.0011852061,0.000050949948,0.00007219906,0.0018178968,0.000050535233,0.89300656,0.060488686,0.029022472,0.0136223845,0.00005898484],"about_ca_topic_score_codex":0.0006531772,"about_ca_topic_score_gemma":0.00083136343,"teacher_disagreement_score":0.00071373826,"about_ca_system_score_codex":0.00032451877,"about_ca_system_score_gemma":0.00057803915,"threshold_uncertainty_score":0.002465129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8283765,0.00028629584,0.15476617,0.00066661736,0.00026431654,0.000120976925,0.00023876186,0.00066332036,0.014617076],"genre_scores_gemma":[0.93815064,0.00010736681,0.059538554,0.000108665474,0.000018929113,0.000046866626,0.0000547425,0.00002498724,0.0019492711],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969983,0.000044211807,0.000015822887,0.000024717932,0.000165136,0.00005025185],"domain_scores_gemma":[0.99952984,0.0002156303,0.000054428543,0.000048578368,0.00009827054,0.000053247477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002933225,0.00032563074,0.00016643522,0.00030690158,0.00033500692,0.00043809047,0.0003567648,0.0004764112,0.0009966813],"category_scores_gemma":[0.0011096833,0.0001910757,0.000093982286,0.00024149468,0.0004449668,0.00032922113,0.00043418494,0.00037569567,0.00022284132],"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.00020252127,0.00008537721,0.0012146005,0.00010098015,0.000014626502,0.0006594628,0.00033228868,0.002892508,0.9269555,0.026745873,0.000847004,0.039949205],"study_design_scores_gemma":[0.00009230309,0.000366528,0.0014279402,0.000017210437,0.00001368153,0.00073611113,0.000052545744,0.05707197,0.9300275,0.0056002866,0.0045584077,0.0000355285],"about_ca_topic_score_codex":0.000643195,"about_ca_topic_score_gemma":0.0010584173,"teacher_disagreement_score":0.0009966813,"about_ca_system_score_codex":0.00029859802,"about_ca_system_score_gemma":0.00043487485,"threshold_uncertainty_score":0.0033342242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16941269,0.00031568555,0.8278247,0.00021830581,0.000023416675,0.000025821922,0.000017652348,0.00027068253,0.0018909875],"genre_scores_gemma":[0.9421788,0.00012507684,0.056985017,0.000030299816,0.0000128985985,0.000021111971,0.00001298705,0.00001769012,0.00061602413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992995,0.000259478,0.000021488895,0.00008049868,0.00024488615,0.000094060444],"domain_scores_gemma":[0.99833715,0.0010290899,0.00027372479,0.000101948855,0.00020760845,0.000050491548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087793864,0.00026437998,0.00041387812,0.00028148713,0.00020717175,0.00061819295,0.0004802281,0.00040125108,0.0004353848],"category_scores_gemma":[0.0035314618,0.00019832939,0.00012981315,0.00037285252,0.0007128582,0.0010023874,0.00044833266,0.00045241223,0.000092892515],"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.00029691076,0.00006738369,0.0009133945,0.00009553574,0.000025625528,0.00024244798,0.00016705196,0.7853829,0.10314317,0.05718936,0.0006933517,0.05178285],"study_design_scores_gemma":[0.000012634474,0.000048131566,0.00010416068,0.0000030841518,0.0000034647521,0.00003745335,0.00001212567,0.9780393,0.013506282,0.007949529,0.0002767214,0.000007090853],"about_ca_topic_score_codex":0.0005054325,"about_ca_topic_score_gemma":0.0006006469,"teacher_disagreement_score":0.00087793864,"about_ca_system_score_codex":0.0006532002,"about_ca_system_score_gemma":0.0004254403,"threshold_uncertainty_score":0.004739344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18076715,0.002093201,0.7315525,0.013508247,0.0011415718,0.00031440475,0.0010790346,0.0004360014,0.06910794],"genre_scores_gemma":[0.6489673,0.0029911823,0.28548643,0.002210295,0.0018406755,0.0003510385,0.0014517495,0.0005459213,0.05615537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984491,0.00053626375,0.000079493286,0.0004500441,0.00023762567,0.00024754682],"domain_scores_gemma":[0.9921257,0.006122138,0.0005480101,0.00048335368,0.0004010375,0.0003197149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636877,0.0010916849,0.0021772783,0.001110853,0.0020489506,0.0032440373,0.001731843,0.0057263714,0.016022403],"category_scores_gemma":[0.018057086,0.0009878771,0.0013269794,0.002144563,0.003555067,0.0090551535,0.0032899417,0.0036253904,0.0016175321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042955545,0.00016731516,0.00042046382,0.000338003,0.000053825624,0.00016304092,0.00030493175,0.03365811,0.0013490458,0.90785694,0.016235676,0.039023187],"study_design_scores_gemma":[0.00006785573,0.00004860635,0.00012531267,0.000039104827,0.000015910127,0.000099717785,0.00017410255,0.062991545,0.00040845355,0.9324659,0.003542812,0.000020748144],"about_ca_topic_score_codex":0.0028729173,"about_ca_topic_score_gemma":0.0016490121,"teacher_disagreement_score":0.016022403,"about_ca_system_score_codex":0.0013826097,"about_ca_system_score_gemma":0.0017928334,"threshold_uncertainty_score":0.05360031},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16099997,0.00036685946,0.8339625,0.0002479929,0.000026977676,0.000038383692,0.000021739444,0.00023847584,0.004097071],"genre_scores_gemma":[0.68213755,0.0005745584,0.31331638,0.00020476452,0.00005587427,0.00008980956,0.000044598153,0.00005348457,0.0035230205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992079,0.00032505285,0.00001603409,0.00005832542,0.0003298645,0.000062803134],"domain_scores_gemma":[0.9988606,0.00076804054,0.00011599775,0.000079191,0.00014888456,0.000027368227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056502,0.00044080836,0.0003909041,0.000457636,0.00028859792,0.0005982085,0.0005660963,0.0006020499,0.0005673511],"category_scores_gemma":[0.0024111806,0.000320957,0.00022718824,0.00049193355,0.0008128243,0.00086845254,0.0006468049,0.00042583447,0.00032413722],"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.00041574502,0.000196209,0.0023233641,0.0003189732,0.000070167014,0.00048530876,0.0006529148,0.4864529,0.23085299,0.19840388,0.0012645158,0.07856305],"study_design_scores_gemma":[0.000041280146,0.00013159354,0.00038570995,0.000015563142,0.000014147851,0.0002843727,0.000043096057,0.9388034,0.034771368,0.023122182,0.0023628185,0.000024502502],"about_ca_topic_score_codex":0.00073826284,"about_ca_topic_score_gemma":0.0008698327,"teacher_disagreement_score":0.0009056502,"about_ca_system_score_codex":0.00051058293,"about_ca_system_score_gemma":0.00048592547,"threshold_uncertainty_score":0.004789591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98824,0.00031517333,0.009902573,0.00013747123,0.000027990889,0.000013541862,0.00011886947,0.0002305147,0.0010138517],"genre_scores_gemma":[0.99626774,0.00008967995,0.002812382,0.000043512664,0.000015571573,0.000011641244,0.00008481233,0.000056729787,0.0006179967],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826753,0.0005417693,0.00014477436,0.00024566546,0.00052895484,0.0002712563],"domain_scores_gemma":[0.9842779,0.011639533,0.001845828,0.00050624355,0.0014486922,0.0002817746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014490446,0.0006538358,0.0007859845,0.00048494106,0.0005435067,0.0006272063,0.00035154502,0.0012359804,0.0024802242],"category_scores_gemma":[0.010960466,0.00047118517,0.00022872858,0.0006641425,0.00037908432,0.0012567545,0.00054032303,0.0004681437,0.00047449503],"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.008181009,0.00047633948,0.022871368,0.00041210992,0.0003112962,0.001551048,0.00047144684,0.4159567,0.5128371,0.002098519,0.00063723064,0.034195837],"study_design_scores_gemma":[0.00021171349,0.0018319383,0.017697766,0.000044507186,0.00018275985,0.0010308718,0.00016881613,0.4367997,0.54051703,0.00077027513,0.0006064166,0.00013816913],"about_ca_topic_score_codex":0.0017649897,"about_ca_topic_score_gemma":0.0012729137,"teacher_disagreement_score":0.0024802242,"about_ca_system_score_codex":0.00068114157,"about_ca_system_score_gemma":0.00041637738,"threshold_uncertainty_score":0.008297205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063089505,0.012870181,0.77821076,0.003207325,0.00077680213,0.0002035637,0.003689715,0.0030713512,0.13488068],"genre_scores_gemma":[0.5054618,0.018292405,0.36433604,0.0023360068,0.0021324106,0.0005696168,0.007847391,0.0013603624,0.09766404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998357,0.0004656934,0.00011041384,0.0005016237,0.00032506112,0.00024023725],"domain_scores_gemma":[0.9970797,0.0016232881,0.00033377236,0.0004958815,0.0003182188,0.00014915725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357593,0.001387374,0.00081105094,0.0022155894,0.0011093614,0.0033775817,0.0015493894,0.001210536,0.020778477],"category_scores_gemma":[0.005165785,0.00094684603,0.001082411,0.0047157346,0.002583633,0.0060890834,0.0020368504,0.002424189,0.0055105463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088883455,0.00003993973,0.00033017565,0.0004680509,0.00002349916,0.0001289033,0.00042666582,0.019365808,0.0020773092,0.90924144,0.012619094,0.055190258],"study_design_scores_gemma":[0.00002813772,0.000041871055,0.00029323142,0.000062692285,0.000011782262,0.00018653879,0.000103531114,0.017358309,0.00060442596,0.95276433,0.028519055,0.000026060714],"about_ca_topic_score_codex":0.00229078,"about_ca_topic_score_gemma":0.0027377165,"teacher_disagreement_score":0.020778477,"about_ca_system_score_codex":0.0029115318,"about_ca_system_score_gemma":0.000637129,"threshold_uncertainty_score":0.06951094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785057,0.00080375257,0.016338807,0.00010924182,0.000014681255,0.00001555303,0.000081158716,0.00014843036,0.003982651],"genre_scores_gemma":[0.9976835,0.00019167259,0.0016380764,0.000013278766,0.00000903077,0.000013923662,0.000087205415,0.000012969718,0.00035033686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985183,0.00048747004,0.00006662693,0.00012576935,0.00036410688,0.00043770022],"domain_scores_gemma":[0.99486107,0.00317573,0.0005865737,0.0003885201,0.00070295326,0.0002851674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016538397,0.0004192171,0.0004923154,0.001390491,0.00046593446,0.0010152565,0.00058821874,0.0004131597,0.00059221615],"category_scores_gemma":[0.007293702,0.00017942683,0.00024039543,0.0015810356,0.0006989614,0.0013750414,0.0006405431,0.00020467,0.00018192148],"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.004613417,0.00051455246,0.06245093,0.00034751257,0.00024033691,0.0013421661,0.0008730619,0.6330885,0.072473265,0.050941013,0.0019942394,0.17112096],"study_design_scores_gemma":[0.00006220322,0.001001191,0.045298718,0.000075420816,0.00019241813,0.0014828278,0.0008546123,0.8735405,0.056958728,0.016833926,0.0036301578,0.00006931433],"about_ca_topic_score_codex":0.001810561,"about_ca_topic_score_gemma":0.0017655452,"teacher_disagreement_score":0.001810561,"about_ca_system_score_codex":0.0011845338,"about_ca_system_score_gemma":0.00070864346,"threshold_uncertainty_score":0.008746445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1754059,0.0008139418,0.7770145,0.00037228636,0.0003866498,0.0001793769,0.0006784385,0.0012271932,0.04392174],"genre_scores_gemma":[0.5621314,0.0010860435,0.41798744,0.00016694599,0.00016253712,0.00025990407,0.001569627,0.00036035257,0.016275764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942064,0.00014451466,0.000038509785,0.000060146755,0.0002529625,0.00008335592],"domain_scores_gemma":[0.99880075,0.00043522424,0.00015311531,0.00030138652,0.00021300247,0.00009653307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033789984,0.0005100206,0.00054284994,0.0011892607,0.00095042563,0.0010542927,0.0004608973,0.0004086496,0.0060704006],"category_scores_gemma":[0.0025255242,0.00033608064,0.0004966801,0.0017970745,0.00087525754,0.0013417228,0.0012761671,0.00086331007,0.0015647068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082136027,0.00018019608,0.0018379911,0.0003809799,0.000043294513,0.0011869022,0.0008030087,0.08985039,0.038608164,0.6079082,0.017142188,0.24123734],"study_design_scores_gemma":[0.00014439099,0.00040650496,0.0013614341,0.00011834652,0.000030243978,0.0021782382,0.00036918963,0.48718283,0.11189535,0.34369949,0.05247275,0.00014135777],"about_ca_topic_score_codex":0.0011274017,"about_ca_topic_score_gemma":0.0016729085,"teacher_disagreement_score":0.0060704006,"about_ca_system_score_codex":0.00060568826,"about_ca_system_score_gemma":0.0006248772,"threshold_uncertainty_score":0.02030754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16618985,0.0011194567,0.8254535,0.00026147978,0.00021138195,0.000109503824,0.000024911524,0.0007624908,0.005867386],"genre_scores_gemma":[0.8042372,0.00056597637,0.19088174,0.00012304175,0.00014971088,0.00007077819,0.000037900987,0.000021760576,0.003911913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996438,0.00009625882,0.000016557988,0.000055072942,0.00014509994,0.000043172287],"domain_scores_gemma":[0.9996908,0.00009473369,0.000046709287,0.00004633996,0.00008642942,0.00003511433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038959697,0.00042517472,0.0003746827,0.00034675258,0.00030166286,0.00053579867,0.00076670805,0.0004221383,0.0008289033],"category_scores_gemma":[0.00049397023,0.00016833817,0.0002805478,0.0002620284,0.00035953638,0.00094124646,0.00036637907,0.00044451404,0.00021703228],"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.0009092474,0.0006378317,0.00345467,0.00040411938,0.0001999178,0.00097154867,0.0003287721,0.2358738,0.26632395,0.04342017,0.0022968918,0.44517902],"study_design_scores_gemma":[0.00022436347,0.00067887595,0.00081966905,0.000019095609,0.00010757072,0.0005521844,0.00002490836,0.94867766,0.037286364,0.004433192,0.0071282065,0.000047801772],"about_ca_topic_score_codex":0.0007607257,"about_ca_topic_score_gemma":0.00088494486,"teacher_disagreement_score":0.0008289033,"about_ca_system_score_codex":0.00025317905,"about_ca_system_score_gemma":0.0002664301,"threshold_uncertainty_score":0.0027729273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41421822,0.0044912044,0.19460525,0.008527447,0.00065932586,0.000067355024,0.00038006355,0.00018936762,0.37686175],"genre_scores_gemma":[0.9367391,0.0026014422,0.037977103,0.0011154442,0.0007650097,0.000050246,0.00036879923,0.000085475076,0.020297369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935395,0.00014794583,0.000032647877,0.000131109,0.0002121127,0.00012227721],"domain_scores_gemma":[0.99789906,0.0008431765,0.00026173127,0.00043037592,0.0003673115,0.0001983363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063267694,0.00041359814,0.00040478873,0.0014756606,0.00085915555,0.0020769285,0.00050447346,0.0005367346,0.0076772114],"category_scores_gemma":[0.003122339,0.00018031265,0.00043937925,0.0012619819,0.002978677,0.004336387,0.001751828,0.0017166522,0.000450407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127953035,0.000021094036,0.00059731083,0.00003459678,0.0000037839873,0.00007268985,0.0001499341,0.00074656954,0.0017619234,0.98325366,0.00083317666,0.012512456],"study_design_scores_gemma":[0.000005430253,0.00006369261,0.0013384615,0.00003080006,0.0000065082113,0.00041733726,0.0003792841,0.0061366283,0.0010832521,0.9727084,0.017816842,0.000013410507],"about_ca_topic_score_codex":0.00036319514,"about_ca_topic_score_gemma":0.00040033105,"teacher_disagreement_score":0.0076772114,"about_ca_system_score_codex":0.00046519953,"about_ca_system_score_gemma":0.00028650695,"threshold_uncertainty_score":0.025682807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8740211,0.0015598778,0.11375423,0.00017638155,0.00007882563,0.00012241222,0.00045556147,0.00041187057,0.009419787],"genre_scores_gemma":[0.95706284,0.0004066271,0.041226592,0.000027928101,0.000022876877,0.00008132066,0.00042002928,0.00005145025,0.0007001496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981059,0.0006555998,0.00013533892,0.00011002893,0.00085663865,0.00013645037],"domain_scores_gemma":[0.9886348,0.0069075567,0.00081635744,0.00091140065,0.00245436,0.0002755618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022966343,0.0005716425,0.00057555694,0.003522362,0.00041661065,0.0008381503,0.00040993738,0.0003956276,0.00062283716],"category_scores_gemma":[0.01372221,0.00013803806,0.0002772123,0.0032801882,0.0005258532,0.0013192985,0.00063970825,0.00028548445,0.00017751157],"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.0027884443,0.000349583,0.032420594,0.00050710584,0.00045010462,0.00033521006,0.0003926708,0.48844728,0.14422444,0.036789954,0.001563605,0.29173103],"study_design_scores_gemma":[0.00010139058,0.002343486,0.027570907,0.000080858284,0.00015453082,0.0010089764,0.00040204581,0.7975228,0.14610635,0.018707337,0.0058573326,0.000143971],"about_ca_topic_score_codex":0.0010439487,"about_ca_topic_score_gemma":0.0014511987,"teacher_disagreement_score":0.003522362,"about_ca_system_score_codex":0.00087707833,"about_ca_system_score_gemma":0.00055437186,"threshold_uncertainty_score":0.0121459365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41634235,0.0010870097,0.4043043,0.0010171555,0.00024153778,0.00018970699,0.0030946527,0.00035614154,0.173367],"genre_scores_gemma":[0.8508242,0.00070316,0.05508052,0.00038852406,0.00015243505,0.00018687299,0.0027379824,0.0002904463,0.08963601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997602,0.000052504784,0.000012188644,0.000051324132,0.00005424462,0.00006956318],"domain_scores_gemma":[0.99938786,0.00016671917,0.000104103776,0.00007684701,0.00012657732,0.00013788919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022924186,0.00029357232,0.00024049403,0.0012205587,0.00068953267,0.0013287708,0.0005192628,0.0005057151,0.019237002],"category_scores_gemma":[0.0009425652,0.00031255264,0.00036046165,0.0007422871,0.00071324117,0.001472885,0.0008069486,0.0007104161,0.0014190922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044385175,0.00002394759,0.00021896728,0.00006580405,0.000013851002,0.00012160638,0.0002228563,0.0046650297,0.0024600166,0.9764885,0.0054687033,0.010206351],"study_design_scores_gemma":[0.00003195793,0.000017398439,0.0007531452,0.00002889191,0.00001126284,0.00010420453,0.00021269747,0.018806953,0.0011131639,0.97082,0.0080879135,0.000012550786],"about_ca_topic_score_codex":0.0011491161,"about_ca_topic_score_gemma":0.0029207352,"teacher_disagreement_score":0.019237002,"about_ca_system_score_codex":0.0008041917,"about_ca_system_score_gemma":0.00036027443,"threshold_uncertainty_score":0.06435424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019888964,0.00030691343,0.95655066,0.00012791115,0.00016817612,0.00037240158,0.00019385644,0.014317209,0.008073867],"genre_scores_gemma":[0.23658916,0.0005553636,0.743135,0.00013709647,0.000073537136,0.00092610257,0.00063297316,0.0020489201,0.015901843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914765,0.00024488886,0.000038969207,0.00006705221,0.00042940048,0.0000720259],"domain_scores_gemma":[0.99885035,0.0005874668,0.00007358235,0.00016503425,0.00025900864,0.00006454937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096269115,0.0007926611,0.00037998756,0.00068090984,0.00029353343,0.0005282827,0.0010256545,0.00047954085,0.01100254],"category_scores_gemma":[0.002271934,0.00038618746,0.00030537279,0.0002457476,0.0002840607,0.0006308096,0.0005240601,0.0007299762,0.0022547932],"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.0008292652,0.00019175524,0.00079205824,0.00090319006,0.000076121134,0.0014839689,0.0006653199,0.07523369,0.3244407,0.033406045,0.024135333,0.5378426],"study_design_scores_gemma":[0.0006350096,0.0022484572,0.0019025877,0.00022010213,0.00008894466,0.0025503435,0.00009016097,0.3408077,0.4263097,0.009616322,0.21533711,0.00019355104],"about_ca_topic_score_codex":0.00045956604,"about_ca_topic_score_gemma":0.0004437594,"teacher_disagreement_score":0.01100254,"about_ca_system_score_codex":0.0002622308,"about_ca_system_score_gemma":0.0004216971,"threshold_uncertainty_score":0.03680718},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028512752,0.008578405,0.8130241,0.0032735022,0.00079817174,0.00019921131,0.0010614916,0.0021310088,0.14242135],"genre_scores_gemma":[0.43758348,0.013083104,0.44640538,0.0012132038,0.0007632376,0.00035212023,0.002313823,0.00095323304,0.09733248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988638,0.00024139248,0.000031083127,0.00029189806,0.00036424384,0.00020758926],"domain_scores_gemma":[0.99756384,0.0011607205,0.0002366471,0.0005188781,0.00039123668,0.00012864254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000570154,0.0013149894,0.0009188333,0.0015925159,0.001433851,0.0027243646,0.0017528613,0.0008632104,0.014794107],"category_scores_gemma":[0.004005641,0.00045885582,0.00056452677,0.003901416,0.001604403,0.0034781978,0.002001459,0.0023407838,0.0028767006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113336624,0.00010226211,0.00050173607,0.0003708097,0.00004048008,0.00012335423,0.00014907526,0.11374502,0.0027913386,0.6429767,0.044541065,0.19454479],"study_design_scores_gemma":[0.00003269661,0.00003824087,0.00042018155,0.000098010314,0.00003244368,0.00031735664,0.00013111853,0.23400725,0.0036402454,0.68209976,0.07914942,0.000033325443],"about_ca_topic_score_codex":0.006073226,"about_ca_topic_score_gemma":0.0069426517,"teacher_disagreement_score":0.014794107,"about_ca_system_score_codex":0.0031168214,"about_ca_system_score_gemma":0.0015448497,"threshold_uncertainty_score":0.049491227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07353293,0.00018127769,0.9187374,0.00018155364,0.00005063559,0.0002033378,0.0003262451,0.00019760025,0.0065890155],"genre_scores_gemma":[0.64242053,0.00019160574,0.3511812,0.00015208969,0.00004611841,0.0007354798,0.00076223386,0.000045696102,0.004465084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720275,0.0014364832,0.00014458147,0.00029344202,0.0005620067,0.00036075615],"domain_scores_gemma":[0.9953755,0.0020112053,0.0004952408,0.00091711,0.0008210265,0.00037985336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022579364,0.00047765032,0.00075211545,0.00072885223,0.00059786875,0.0007622721,0.000734288,0.0005405693,0.0043051955],"category_scores_gemma":[0.0055988086,0.00036727745,0.00035851952,0.0010186533,0.0010238463,0.00090759515,0.0015600265,0.0007319726,0.0007003346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023458744,0.0003643929,0.008281159,0.00023103078,0.00010462548,0.0003352076,0.0003045083,0.3051246,0.019341398,0.47944918,0.0054764054,0.1786415],"study_design_scores_gemma":[0.0003498775,0.0010632158,0.0032425895,0.00008525553,0.000051882093,0.00033573122,0.000235232,0.7643614,0.014538248,0.19606975,0.019605726,0.000061047685],"about_ca_topic_score_codex":0.0014105419,"about_ca_topic_score_gemma":0.00099225,"teacher_disagreement_score":0.0043051955,"about_ca_system_score_codex":0.00058053865,"about_ca_system_score_gemma":0.0010304565,"threshold_uncertainty_score":0.01440227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5518076,0.0011194273,0.1491214,0.0046381583,0.000747135,0.00016847684,0.0050560078,0.0017444049,0.2855974],"genre_scores_gemma":[0.8818027,0.00049996976,0.02658817,0.00067843474,0.00028871998,0.000100556535,0.003896787,0.00034563924,0.085799046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00008493457,0.000032727396,0.0001333512,0.00014899771,0.00023558736],"domain_scores_gemma":[0.99510175,0.0021643704,0.0004604073,0.00052368775,0.0009224313,0.0008273535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047701373,0.00052374025,0.00051051064,0.0019740297,0.0023086525,0.0030652962,0.00053464243,0.0009551975,0.038117554],"category_scores_gemma":[0.0038352131,0.0005110891,0.0008280725,0.0009916882,0.0013551757,0.0029250237,0.002283041,0.0014419025,0.006313898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038224933,0.000108370725,0.003945738,0.0002192456,0.000046756584,0.000489208,0.0005455355,0.0010727219,0.005445716,0.94811094,0.020150619,0.019482942],"study_design_scores_gemma":[0.0001231284,0.00010541739,0.004750234,0.00012118248,0.000063857886,0.0011964424,0.0013556816,0.012438482,0.013187044,0.9073572,0.059239294,0.00006203821],"about_ca_topic_score_codex":0.00085347414,"about_ca_topic_score_gemma":0.0014608603,"teacher_disagreement_score":0.038117554,"about_ca_system_score_codex":0.0011761911,"about_ca_system_score_gemma":0.00080108835,"threshold_uncertainty_score":0.12751591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49654105,0.0017606583,0.27402672,0.003877479,0.00066092,0.00025809152,0.0061098477,0.0014898389,0.21527545],"genre_scores_gemma":[0.88946164,0.0008235055,0.050582636,0.0005455304,0.00022785677,0.00016443478,0.00515315,0.00042493726,0.05261633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912244,0.00010574473,0.000051044186,0.00022156266,0.00021673668,0.00028241763],"domain_scores_gemma":[0.99529654,0.0019445559,0.0006099168,0.0007013809,0.0008916756,0.0005558991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061295787,0.0005525666,0.00067240663,0.0016571743,0.0023602466,0.0029109407,0.0008149112,0.0011563606,0.023576962],"category_scores_gemma":[0.00515364,0.00057423394,0.0009365438,0.0011573166,0.0013411472,0.002647413,0.0021534653,0.0014974516,0.0049889428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036753571,0.00010562833,0.002544768,0.00031373682,0.000047420235,0.00046530666,0.00074625417,0.0025953983,0.010783753,0.94113433,0.017954001,0.02294196],"study_design_scores_gemma":[0.00013539997,0.00014713965,0.00252146,0.00017824862,0.000075196884,0.0014866673,0.000659888,0.023768593,0.023809474,0.8934777,0.05363825,0.00010204806],"about_ca_topic_score_codex":0.0018738956,"about_ca_topic_score_gemma":0.0023943186,"teacher_disagreement_score":0.023576962,"about_ca_system_score_codex":0.001520106,"about_ca_system_score_gemma":0.0016326436,"threshold_uncertainty_score":0.07887286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06463365,0.000091854134,0.9223653,0.00013058032,0.00007480854,0.00024105143,0.00027147695,0.0042786286,0.007912645],"genre_scores_gemma":[0.5254079,0.00011876051,0.46560702,0.00012932756,0.000023801149,0.00038839268,0.0005302915,0.0006625515,0.007131957],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997261,0.000064511645,0.00002108622,0.000039759598,0.000113001945,0.00003554754],"domain_scores_gemma":[0.9994703,0.00018428249,0.00006865884,0.00011075984,0.00014853779,0.000017457494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000307395,0.00032630385,0.00017871433,0.00037839648,0.00026773743,0.0003990417,0.000489025,0.00022984548,0.0034898226],"category_scores_gemma":[0.00092870387,0.00015709721,0.00016645427,0.00020203715,0.00030111344,0.00036610445,0.0002438333,0.00030262148,0.00077260553],"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.0004048337,0.00019174397,0.0020608697,0.0006082756,0.000054970104,0.000923384,0.000573852,0.16278169,0.42363527,0.09578256,0.011785117,0.30119744],"study_design_scores_gemma":[0.00012508797,0.0005583917,0.00061312324,0.000045154193,0.000034944504,0.00059181085,0.000055995224,0.43446842,0.5089393,0.0127726095,0.04175013,0.000044966917],"about_ca_topic_score_codex":0.0007303858,"about_ca_topic_score_gemma":0.0015436927,"teacher_disagreement_score":0.0034898226,"about_ca_system_score_codex":0.00050417014,"about_ca_system_score_gemma":0.0006031193,"threshold_uncertainty_score":0.011674643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28966105,0.0013794092,0.7010633,0.00029801278,0.000118538235,0.00013313588,0.000039346447,0.0004237775,0.0068833986],"genre_scores_gemma":[0.78415537,0.0006806348,0.21279,0.00014556569,0.00008815216,0.00012961905,0.000047473142,0.000015692363,0.0019475203],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995943,0.00015981757,0.000013649813,0.00007756656,0.00012279164,0.00003195315],"domain_scores_gemma":[0.9996259,0.00019275697,0.000059192098,0.000052279203,0.000049595044,0.000020279094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003289607,0.0005316749,0.00026911456,0.00053469336,0.00033879562,0.000597697,0.0004050991,0.0005163665,0.00047961716],"category_scores_gemma":[0.0007433457,0.00027545396,0.00023584669,0.00052861794,0.00060740486,0.001224568,0.0006006586,0.00032283054,0.0001457829],"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.0006472736,0.00025051073,0.003345775,0.0005427738,0.00015477973,0.001376211,0.00073765125,0.15949786,0.35429558,0.17306967,0.0018935718,0.30418834],"study_design_scores_gemma":[0.00020330831,0.0011329617,0.0017077343,0.00005950749,0.00010490247,0.0020156435,0.00010410795,0.84133786,0.09701944,0.03963623,0.01657475,0.00010347524],"about_ca_topic_score_codex":0.0005852102,"about_ca_topic_score_gemma":0.001102105,"teacher_disagreement_score":0.000597697,"about_ca_system_score_codex":0.0004126679,"about_ca_system_score_gemma":0.00039731953,"threshold_uncertainty_score":0.0029941797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75115526,0.0005042625,0.1483279,0.0009752756,0.00017096789,0.00011446016,0.0010386014,0.0005454047,0.09716786],"genre_scores_gemma":[0.96413755,0.0004013396,0.015661983,0.00027166837,0.00019085222,0.0001376839,0.0009094962,0.00024983528,0.018039547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993087,0.00012048146,0.000031175216,0.00012918947,0.00022162299,0.00018882802],"domain_scores_gemma":[0.99766386,0.0011694863,0.00038750045,0.00030883183,0.0002170859,0.00025332323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041356793,0.0006195062,0.000499858,0.0017102618,0.001206423,0.0026253422,0.000691217,0.0010277266,0.0063730027],"category_scores_gemma":[0.0027062858,0.00040943455,0.00055632717,0.0009721641,0.0016966058,0.0022944391,0.0016109431,0.0014997785,0.000727343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011180336,0.000051166957,0.0008488668,0.000051302104,0.00000926259,0.000097512624,0.00027264733,0.0027744954,0.0038551346,0.97486055,0.002250858,0.014816372],"study_design_scores_gemma":[0.00006443388,0.00005112923,0.0013616666,0.000043859953,0.00001731755,0.0003757705,0.00022794915,0.020944385,0.0053311246,0.96192443,0.009624666,0.00003319781],"about_ca_topic_score_codex":0.00063979207,"about_ca_topic_score_gemma":0.0005995367,"teacher_disagreement_score":0.0063730027,"about_ca_system_score_codex":0.0008706416,"about_ca_system_score_gemma":0.0006765785,"threshold_uncertainty_score":0.021319747},"labels":[],"label_agreement":null},{"id":"W2150371189","doi":"10.1002/jcd.20232","title":"Embedding partial odd‐cycle systems in systems with orders in all admissible congruence classes","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Mathematics; Embedding; Congruence (geometry); Combinatorics; Order (exchange); Discrete mathematics; Geometry; Computer science","score_opus":0.019975682053149414,"score_gpt":0.2577288350817729,"score_spread":0.2377531530286235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150371189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7596947,0.00028193658,0.19269182,0.00028618643,0.00010388834,0.00012723071,0.00016582577,0.00031996323,0.046328522],"genre_scores_gemma":[0.9725529,0.00010512853,0.021308864,0.000048905913,0.000026155238,0.000057735815,0.00013144639,0.000054390686,0.0057144403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946266,0.000083784056,0.000033350396,0.00011880053,0.00016063398,0.00014078787],"domain_scores_gemma":[0.99920243,0.0001923707,0.00013898741,0.00019523004,0.000137808,0.00013312353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032600347,0.0004306911,0.00032669544,0.00065267127,0.0009503334,0.0016945944,0.00044546844,0.00042849203,0.006197943],"category_scores_gemma":[0.001586922,0.00037578467,0.00036751665,0.00038334148,0.0015811493,0.0018389855,0.0020580315,0.0010604125,0.00065210945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002246275,0.000082596445,0.003059895,0.0001263396,0.000019468971,0.00029901403,0.0010361561,0.0148064485,0.02218721,0.9225187,0.0009907973,0.034648824],"study_design_scores_gemma":[0.00007681479,0.0002507207,0.001783524,0.000089764566,0.00003556949,0.00036476235,0.0008695735,0.09497974,0.031539228,0.8440463,0.025911823,0.000052191204],"about_ca_topic_score_codex":0.0009908638,"about_ca_topic_score_gemma":0.0011094644,"teacher_disagreement_score":0.006197943,"about_ca_system_score_codex":0.00082382874,"about_ca_system_score_gemma":0.00051812467,"threshold_uncertainty_score":0.020734131},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96256626,0.00032981145,0.035583053,0.000055980556,0.000008230354,0.000010026802,0.000018900078,0.00015831122,0.001269465],"genre_scores_gemma":[0.9979031,0.00007705917,0.001812807,0.000009228482,0.000003828626,0.0000030906676,0.000009759934,0.00000911049,0.00017196186],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993673,0.00014845449,0.000020003932,0.00007434943,0.00027368026,0.00011623715],"domain_scores_gemma":[0.9965305,0.002337201,0.0005027002,0.0002050508,0.00035652288,0.000067995454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006403466,0.00035835602,0.0003565188,0.00036115872,0.0002498304,0.00044292622,0.0003122402,0.0005556727,0.00042212062],"category_scores_gemma":[0.004899697,0.0001481988,0.00018121928,0.0004404996,0.00053497194,0.0006499983,0.0004909561,0.0003118734,0.00013873941],"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.0013498516,0.0001886877,0.013777074,0.00023838489,0.00012822487,0.0008153256,0.00031101628,0.3118739,0.6196437,0.005953277,0.00019758145,0.045523014],"study_design_scores_gemma":[0.000030622166,0.000643051,0.007334558,0.000015817785,0.00006264665,0.00051988993,0.00005433743,0.8083333,0.18094847,0.0017620723,0.00026103144,0.00003422019],"about_ca_topic_score_codex":0.0008845823,"about_ca_topic_score_gemma":0.0004381529,"teacher_disagreement_score":0.0008845823,"about_ca_system_score_codex":0.0005018796,"about_ca_system_score_gemma":0.00026084465,"threshold_uncertainty_score":0.0036414266},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15213631,0.001149531,0.34652072,0.0009860687,0.00042423594,0.0003049718,0.0010680436,0.0006892054,0.49672085],"genre_scores_gemma":[0.7262433,0.0013535235,0.15467918,0.0003272016,0.00016483762,0.000256142,0.0009355526,0.00032154686,0.1157187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990387,0.00026281553,0.000046697478,0.00016147648,0.00032907317,0.00016131284],"domain_scores_gemma":[0.99884015,0.00033457857,0.00009793469,0.00012399271,0.00042086956,0.00018254257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792517,0.00057050574,0.0005053024,0.0020807092,0.001466584,0.0021214383,0.0009999074,0.0010214628,0.015523799],"category_scores_gemma":[0.002097482,0.0004407344,0.00045464627,0.0017391674,0.001142917,0.003047303,0.0013203897,0.0014855088,0.0026493212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030798827,0.0000138855075,0.000101173144,0.000062872816,0.000004993289,0.00010715823,0.00013795232,0.0008310058,0.0020828163,0.97923297,0.0019961959,0.015398174],"study_design_scores_gemma":[0.000026504391,0.000027648106,0.00028852827,0.00007307943,0.000014768259,0.00062950596,0.0002914064,0.007405307,0.0041681062,0.9161295,0.07091772,0.000027864395],"about_ca_topic_score_codex":0.0008886462,"about_ca_topic_score_gemma":0.0009217242,"teacher_disagreement_score":0.015523799,"about_ca_system_score_codex":0.0010622937,"about_ca_system_score_gemma":0.0006014171,"threshold_uncertainty_score":0.051932275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65211684,0.0022937953,0.1510806,0.0043727425,0.0006807737,0.000101142155,0.00062675844,0.00020406253,0.18852329],"genre_scores_gemma":[0.95922756,0.00095661054,0.017577061,0.0004647804,0.00057531963,0.000083348175,0.00040292498,0.00009690121,0.020615527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993594,0.00014212295,0.000033667522,0.00012283644,0.00025464105,0.00008734707],"domain_scores_gemma":[0.99886453,0.00030064728,0.00022666577,0.000108771404,0.00023442988,0.0002649107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008182774,0.00056828954,0.0006499633,0.0021647762,0.0013198723,0.0033629762,0.0010589891,0.0010461989,0.0051644817],"category_scores_gemma":[0.0034868773,0.00042927172,0.00048524,0.0011598875,0.0026242014,0.003962466,0.0015461147,0.003076063,0.0005093742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016012502,0.000010391252,0.00011694553,0.000009918475,0.0000019685037,0.000034902947,0.00008239711,0.0003962539,0.00038674407,0.99535614,0.0006377858,0.0029505151],"study_design_scores_gemma":[0.00001106592,0.000012870414,0.00024390318,0.000006400379,0.0000025535837,0.0001070621,0.00010149485,0.0038872627,0.00018557193,0.99337006,0.0020639615,0.0000077203595],"about_ca_topic_score_codex":0.0014618448,"about_ca_topic_score_gemma":0.0010393333,"teacher_disagreement_score":0.0051644817,"about_ca_system_score_codex":0.0010019505,"about_ca_system_score_gemma":0.0006546913,"threshold_uncertainty_score":0.017276883},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4383825,0.0016561769,0.42361662,0.0018475795,0.00076046214,0.0004119369,0.0019832922,0.0018880666,0.12945329],"genre_scores_gemma":[0.92182463,0.0006802888,0.04911617,0.0008272911,0.00031383737,0.00027246028,0.0008060776,0.0003263934,0.025832752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.0002824843,0.00005219955,0.00013853624,0.00034042212,0.0003931984],"domain_scores_gemma":[0.9930821,0.0026626722,0.00055818976,0.0017927418,0.0015288632,0.00037549553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071540836,0.00068403967,0.00070302916,0.0011474731,0.0010489029,0.0011608967,0.0006485936,0.0010657787,0.011807673],"category_scores_gemma":[0.0058399634,0.0002929078,0.0003731288,0.0016775324,0.00096472685,0.0010699292,0.0012433887,0.0011193239,0.002016526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015858578,0.00020332533,0.0020153518,0.00030086184,0.00008941398,0.0007087884,0.00031013734,0.028428681,0.071969375,0.77185684,0.022424659,0.10010671],"study_design_scores_gemma":[0.00026800722,0.0005649632,0.0028625058,0.00015391008,0.00009030157,0.0013704811,0.00019886847,0.27005285,0.06306128,0.6154992,0.04575895,0.00011862097],"about_ca_topic_score_codex":0.0016399652,"about_ca_topic_score_gemma":0.0022292645,"teacher_disagreement_score":0.011807673,"about_ca_system_score_codex":0.0008362624,"about_ca_system_score_gemma":0.0015514585,"threshold_uncertainty_score":0.039500654},"labels":[],"label_agreement":null},{"id":"W2153397321","doi":"10.1002/jcd.20080","title":"On isomorphic factorizations of circulant graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Conjecture; Circulant graph; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01612969014607039,"score_gpt":0.21551202290486426,"score_spread":0.19938233275879388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153397321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82923883,0.0005058741,0.11492074,0.00067220366,0.00018808743,0.00009856106,0.000292397,0.00033125668,0.053752013],"genre_scores_gemma":[0.9776804,0.00020527099,0.015062995,0.0002085841,0.0001486338,0.000040741394,0.0003755638,0.00005959558,0.0062182215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986766,0.00028279363,0.000047226975,0.00030809196,0.0002738048,0.00041143244],"domain_scores_gemma":[0.99803585,0.0007020485,0.0003054621,0.00040197695,0.00025986537,0.00029486057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072025816,0.00054614915,0.000595497,0.0012712931,0.0015397759,0.0019950534,0.00049066276,0.0006962194,0.0080897305],"category_scores_gemma":[0.0035020122,0.00038665088,0.00066763605,0.00076071697,0.0018090844,0.0024856864,0.0011440892,0.00092539104,0.00071397325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033670152,0.00014109454,0.0018483341,0.000078790494,0.000018257693,0.00041614217,0.0007908624,0.006157516,0.00824096,0.9552072,0.004229183,0.022534898],"study_design_scores_gemma":[0.00006001517,0.00012703551,0.001096482,0.00003586028,0.000021979187,0.00057023676,0.0006026524,0.028428437,0.0040593697,0.95614487,0.008817546,0.000035464],"about_ca_topic_score_codex":0.0020204796,"about_ca_topic_score_gemma":0.0023231637,"teacher_disagreement_score":0.0080897305,"about_ca_system_score_codex":0.00096407445,"about_ca_system_score_gemma":0.00044315445,"threshold_uncertainty_score":0.027062833},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96636724,0.00079949363,0.02402175,0.00016882198,0.0000621181,0.00003331462,0.00007497419,0.0006571145,0.007815214],"genre_scores_gemma":[0.99327976,0.00013297633,0.0052576195,0.000032376363,0.00002376285,0.000012275094,0.00006446287,0.000015019322,0.001181675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.00017458915,0.000016626202,0.000061884566,0.0001853923,0.00009029364],"domain_scores_gemma":[0.99855465,0.0007179698,0.00007770655,0.00008451506,0.0005038582,0.000061190025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006702678,0.00019267744,0.00026702593,0.0006478569,0.0003045108,0.00063741935,0.00025702064,0.00037459985,0.0013467163],"category_scores_gemma":[0.0021736356,0.00006887405,0.00007917164,0.000497054,0.00021240723,0.000417312,0.00022516094,0.00013653848,0.0002592116],"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.010189091,0.0006778639,0.03467025,0.00057048665,0.00027385016,0.00049315975,0.00067079574,0.14202036,0.26226568,0.0120231705,0.0041773436,0.53196794],"study_design_scores_gemma":[0.0003235332,0.0037371072,0.020731268,0.000045150802,0.00029388472,0.00074205705,0.0003006968,0.7922114,0.17103423,0.0024292613,0.008067818,0.00008360886],"about_ca_topic_score_codex":0.0019427355,"about_ca_topic_score_gemma":0.0019692734,"teacher_disagreement_score":0.0019427355,"about_ca_system_score_codex":0.00062953687,"about_ca_system_score_gemma":0.00039062582,"threshold_uncertainty_score":0.0045676827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62724406,0.00061862665,0.3484638,0.00039264036,0.000028686823,0.00007086826,0.00016125134,0.00045251174,0.022567565],"genre_scores_gemma":[0.9886358,0.00015284012,0.008800809,0.000040171297,0.0000071049576,0.000054263608,0.00007490677,0.000033854958,0.0022003343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.00025870066,0.000017719576,0.00007677634,0.0003674764,0.00011128296],"domain_scores_gemma":[0.99790263,0.001377458,0.00012248986,0.00017970485,0.00036047676,0.000057212867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074333296,0.00045573318,0.0005182338,0.0006668027,0.0004079589,0.00095101894,0.00070695614,0.0008598067,0.0015400625],"category_scores_gemma":[0.0044057146,0.00024979824,0.00029162713,0.00039295474,0.0009475937,0.0012438074,0.0004892239,0.0006038924,0.00059728016],"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.0003054252,0.0001573924,0.0031861053,0.00010544166,0.00006926636,0.00034785815,0.00016515201,0.723443,0.061919756,0.1933167,0.0009886901,0.015995143],"study_design_scores_gemma":[0.000010802181,0.000040625226,0.0003886761,0.000009313837,0.000007968789,0.00009511237,0.00001449076,0.97393554,0.007751417,0.017251315,0.0004830751,0.000011704876],"about_ca_topic_score_codex":0.0010950764,"about_ca_topic_score_gemma":0.00040251075,"teacher_disagreement_score":0.0015400625,"about_ca_system_score_codex":0.0011487714,"about_ca_system_score_gemma":0.0004300085,"threshold_uncertainty_score":0.008334994},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003189208,0.00015337585,0.94065595,0.00014817317,0.000080422644,0.00008646394,0.00023204935,0.05280929,0.002645153],"genre_scores_gemma":[0.07824004,0.00034578456,0.9023742,0.00027514173,0.00012367159,0.0004234704,0.0016140264,0.011509237,0.0050945254],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814475,0.00039701234,0.0002441883,0.0003425649,0.0007413971,0.00013005552],"domain_scores_gemma":[0.9926122,0.0030251225,0.00039520994,0.002846429,0.00088595244,0.00023510578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005151789,0.0010449861,0.0012609408,0.0025730284,0.0012441428,0.004138197,0.0039297906,0.0019525877,0.009525409],"category_scores_gemma":[0.0110044805,0.0013694812,0.0019988033,0.0018275279,0.0014031985,0.0052773,0.0030785569,0.0030054527,0.0035947554],"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.0012577329,0.00036527403,0.006232295,0.001232453,0.0007614496,0.0019372879,0.0017791961,0.02339906,0.05418534,0.37477252,0.049867533,0.48420984],"study_design_scores_gemma":[0.00046268478,0.00047434456,0.0014057556,0.0004039728,0.00034013676,0.0020723764,0.00022244087,0.33431384,0.12220548,0.25394326,0.28379652,0.0003592289],"about_ca_topic_score_codex":0.00087128184,"about_ca_topic_score_gemma":0.0009080972,"teacher_disagreement_score":0.009525409,"about_ca_system_score_codex":0.0010496116,"about_ca_system_score_gemma":0.0015423475,"threshold_uncertainty_score":0.031865716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077470206,0.00012786881,0.9121465,0.00023408448,0.000028829301,0.00006391962,0.00007661793,0.00019729153,0.009654687],"genre_scores_gemma":[0.4922421,0.0001582225,0.50427055,0.00007873338,0.000015612364,0.00016665693,0.00009495536,0.00009699676,0.0028761306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983895,0.00003949831,0.0000034018367,0.000014344371,0.000084418374,0.000019304265],"domain_scores_gemma":[0.99961543,0.00021325062,0.000046734327,0.000028130444,0.00008430402,0.000012141208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237927,0.0003834917,0.00025326406,0.0002627514,0.00020401788,0.0003220559,0.00049224496,0.00048380689,0.0010346081],"category_scores_gemma":[0.0013650871,0.00022383106,0.00023503743,0.00029877428,0.0004941581,0.00041131506,0.00023464962,0.00040657775,0.00022614007],"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.00001663798,0.00002406756,0.00020380215,0.000048417365,0.000013984953,0.000025248699,0.000024225828,0.9513479,0.011415879,0.031294644,0.0003390354,0.00524605],"study_design_scores_gemma":[0.0000043427603,0.0000067677074,0.00003121118,0.0000022057943,0.0000019322981,0.0000044427584,0.000002595769,0.9963882,0.0012815832,0.0020350968,0.00023919983,0.000002448188],"about_ca_topic_score_codex":0.002550517,"about_ca_topic_score_gemma":0.004079583,"teacher_disagreement_score":0.002550517,"about_ca_system_score_codex":0.00086153834,"about_ca_system_score_gemma":0.0010983762,"threshold_uncertainty_score":0.006250918},"labels":[],"label_agreement":null},{"id":"W2154750111","doi":"10.1002/jcd.20105","title":"Small latin squares, quasigroups, and loops","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Latin square; Combinatorics; Order (exchange); Quasigroup; Orthogonal array; Discrete mathematics; Statistics","score_opus":0.016444570046306017,"score_gpt":0.19053457647846297,"score_spread":0.17409000643215697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154750111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.907395,0.0014292795,0.029607812,0.0005050432,0.00016550445,0.000055478722,0.00023739002,0.00025291325,0.06035165],"genre_scores_gemma":[0.98570895,0.0004230704,0.007353215,0.00007368809,0.0000989242,0.00003063153,0.00016721513,0.000023508752,0.0061208047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00014577809,0.000043450196,0.00016447862,0.00021020652,0.00017138045],"domain_scores_gemma":[0.99703205,0.0015257795,0.00053496344,0.0004014817,0.00021140926,0.00029424814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539102,0.00038608786,0.0003221437,0.0019017961,0.0009568457,0.0019165804,0.00037171997,0.00046518203,0.010417336],"category_scores_gemma":[0.0023428649,0.00019970913,0.00039657974,0.00076913723,0.0030731703,0.0025118543,0.00111495,0.0006234682,0.0007719785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068606733,0.00013250318,0.013734788,0.0002486933,0.000028630635,0.0005983318,0.00084820355,0.0036710456,0.02375107,0.852577,0.0028648747,0.10085886],"study_design_scores_gemma":[0.00007942194,0.00041190808,0.009295457,0.000106537875,0.000049141716,0.002094397,0.00079500483,0.0095241135,0.027406177,0.9082442,0.0419327,0.00006105395],"about_ca_topic_score_codex":0.00036933832,"about_ca_topic_score_gemma":0.00047453278,"teacher_disagreement_score":0.010417336,"about_ca_system_score_codex":0.0006699382,"about_ca_system_score_gemma":0.00036090007,"threshold_uncertainty_score":0.034849465},"labels":[],"label_agreement":null},{"id":"W2154983517","doi":"10.1002/jcd.20203","title":"On the amicability of orthogonal designs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Orthogonal array; Combinatorics; Combinatorial design; Integer (computer science); Order (exchange); Zero (linguistics); Construct (python library); Connection (principal bundle); Space (punctuation); Discrete mathematics; Statistics; Computer science","score_opus":0.022226344966923328,"score_gpt":0.22729121147593112,"score_spread":0.2050648665090078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154983517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2928134,0.0005195176,0.6769064,0.0006065776,0.00016435831,0.00019493217,0.00019635916,0.00026600933,0.028332546],"genre_scores_gemma":[0.83146137,0.00031011814,0.1615571,0.0003088502,0.0001895781,0.00044564012,0.0002000355,0.000054845394,0.005472426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922043,0.0033502893,0.00049942645,0.000965669,0.0023430472,0.00063740567],"domain_scores_gemma":[0.965906,0.02126216,0.0037583245,0.005188726,0.0027421855,0.0011425528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004532879,0.00078414084,0.00088448205,0.002058964,0.0012597836,0.0017869165,0.00090085436,0.0015497693,0.0052914163],"category_scores_gemma":[0.0288904,0.0007216161,0.00089351495,0.0009878281,0.0035312322,0.0026685097,0.003438844,0.002793282,0.00075401075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065439893,0.000102788195,0.0018728372,0.000117164345,0.000051207673,0.00021393214,0.00034129643,0.030467296,0.016331626,0.8966682,0.0009915952,0.052187677],"study_design_scores_gemma":[0.00016549342,0.00080597505,0.00090697146,0.00012813244,0.000036519763,0.0006666288,0.00016944869,0.1285717,0.017059272,0.84324664,0.00814743,0.000095768824],"about_ca_topic_score_codex":0.00023425797,"about_ca_topic_score_gemma":0.00022483229,"teacher_disagreement_score":0.0052914163,"about_ca_system_score_codex":0.00069449935,"about_ca_system_score_gemma":0.0009607981,"threshold_uncertainty_score":0.023972392},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35102063,0.0009826927,0.52012616,0.0014000712,0.00024346719,0.00016669116,0.0010029054,0.0009511028,0.12410628],"genre_scores_gemma":[0.91980046,0.0006652332,0.06093921,0.0002793924,0.00032049458,0.0003181054,0.00081607845,0.00019385865,0.016667118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850035,0.00035046288,0.00009470248,0.00028947857,0.0004679695,0.0002969539],"domain_scores_gemma":[0.9977391,0.0010092627,0.00037582932,0.00039925124,0.00024941107,0.00022711323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057224266,0.0005489549,0.00047330785,0.0012838115,0.0016408851,0.0032034484,0.0006939727,0.00083056005,0.008460415],"category_scores_gemma":[0.003214786,0.00043123442,0.00064428494,0.0014702029,0.0021014533,0.0044201217,0.0018914128,0.001687554,0.0012394264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023854594,0.000012668693,0.00026001126,0.000022365633,0.000004319577,0.0000935192,0.000137129,0.0020261754,0.001110613,0.9871967,0.0009670072,0.008145681],"study_design_scores_gemma":[0.000015874528,0.000052571104,0.00032555044,0.000017572156,0.000006363722,0.0003890811,0.00015630752,0.012246462,0.0024917214,0.9704949,0.013778708,0.000024899326],"about_ca_topic_score_codex":0.00031065373,"about_ca_topic_score_gemma":0.00017619072,"teacher_disagreement_score":0.008460415,"about_ca_system_score_codex":0.00073922385,"about_ca_system_score_gemma":0.00040726823,"threshold_uncertainty_score":0.028302848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63141274,0.0014684579,0.32522425,0.0051224725,0.00016196149,0.00023729775,0.0024193178,0.00074565056,0.033207893],"genre_scores_gemma":[0.88044316,0.00069876213,0.107250564,0.0011009594,0.0002685946,0.00021558793,0.002080458,0.00027255598,0.0076694214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636227,0.0013481068,0.00012983044,0.0007808496,0.00069206435,0.000686841],"domain_scores_gemma":[0.98311687,0.012711034,0.000985167,0.0019300805,0.00063553744,0.00062127714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481036,0.0009433482,0.002536673,0.0012641726,0.0021425814,0.0044124587,0.0040985993,0.002871979,0.011509675],"category_scores_gemma":[0.014091133,0.0007988974,0.00096340914,0.0033562577,0.003095356,0.0107147135,0.0034133662,0.0033213415,0.0012973092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025438366,0.0005928257,0.004533186,0.000817908,0.00020442776,0.00046266173,0.0009433579,0.26306584,0.0076951906,0.60836196,0.029966244,0.08081261],"study_design_scores_gemma":[0.00022163927,0.000121219084,0.0008522165,0.000056715926,0.000052937205,0.0005159931,0.00047225071,0.35845983,0.0029219482,0.6304966,0.005775381,0.00005328929],"about_ca_topic_score_codex":0.0030107212,"about_ca_topic_score_gemma":0.0021486967,"teacher_disagreement_score":0.011509675,"about_ca_system_score_codex":0.002428139,"about_ca_system_score_gemma":0.0011405505,"threshold_uncertainty_score":0.038503766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6150886,0.0016069998,0.26875454,0.0032245624,0.00034209288,0.00012617136,0.002337208,0.0009362264,0.10758354],"genre_scores_gemma":[0.84040886,0.00068780326,0.12618135,0.00039375568,0.00009007863,0.00009755831,0.0016850763,0.00016431884,0.030291213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00009627574,0.000022373288,0.00006780968,0.0001777255,0.000052711304],"domain_scores_gemma":[0.99908626,0.000445209,0.00007284257,0.00015102979,0.00017857082,0.00006604903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028258772,0.00029030058,0.00026806924,0.0007290231,0.00070172956,0.0006650666,0.00041538663,0.00045896406,0.008869067],"category_scores_gemma":[0.0031025212,0.00025546513,0.00024652225,0.00053013524,0.0006293689,0.0010069305,0.0007962601,0.00069842674,0.0024953138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060246885,0.000081826816,0.0091424165,0.00044852006,0.000055952114,0.0006334428,0.00074676564,0.023727298,0.035868596,0.6059441,0.049048908,0.2736996],"study_design_scores_gemma":[0.00009338281,0.00016590388,0.004408693,0.00013313969,0.000039444993,0.0013793521,0.00044327573,0.07385881,0.03428001,0.7955839,0.089522645,0.00009143229],"about_ca_topic_score_codex":0.0013781328,"about_ca_topic_score_gemma":0.0028957136,"teacher_disagreement_score":0.008869067,"about_ca_system_score_codex":0.00036869984,"about_ca_system_score_gemma":0.0005457139,"threshold_uncertainty_score":0.02967006},"labels":[],"label_agreement":null},{"id":"W2156872656","doi":"10.1002/jcd.20157","title":"Pair covering and other designs with block size 6","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Upper and lower bounds; Prime (order theory); Mathematical analysis","score_opus":0.014569718599967979,"score_gpt":0.21444943629866944,"score_spread":0.19987971769870147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156872656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7576328,0.0011150587,0.21317567,0.00028117272,0.00013272896,0.00015739273,0.00037221707,0.00069227646,0.026440639],"genre_scores_gemma":[0.90757245,0.00020606478,0.08800105,0.00010781429,0.000037505757,0.000154887,0.00022330778,0.000049231414,0.0036475628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991328,0.00027252646,0.00008025622,0.00012910343,0.00018225264,0.0002031111],"domain_scores_gemma":[0.99825186,0.00065734243,0.0004117641,0.000296112,0.00025580867,0.00012713108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073475944,0.00049558486,0.0005329143,0.0010693372,0.0005620758,0.0007086604,0.00056744355,0.0007443236,0.0042573838],"category_scores_gemma":[0.0026692385,0.00037262723,0.00048515556,0.0009030475,0.00043535407,0.0010364106,0.00063522847,0.00044012396,0.00076405425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025627648,0.000776481,0.011765728,0.0007423085,0.00023044711,0.00092115876,0.0007139919,0.225226,0.19282669,0.29217514,0.008381274,0.26367816],"study_design_scores_gemma":[0.0004330404,0.0062645543,0.0070109544,0.0002456861,0.0002219843,0.0025138303,0.00036084943,0.6315552,0.14851095,0.14583124,0.056852076,0.00019969777],"about_ca_topic_score_codex":0.0005425574,"about_ca_topic_score_gemma":0.0008753301,"teacher_disagreement_score":0.0042573838,"about_ca_system_score_codex":0.00079210877,"about_ca_system_score_gemma":0.00045876575,"threshold_uncertainty_score":0.014242351},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78422654,0.00090008636,0.10618899,0.01275112,0.00078744104,0.00007980239,0.00079165096,0.0005749225,0.09369943],"genre_scores_gemma":[0.9785478,0.00025282134,0.01296383,0.0007083433,0.00033640384,0.000065864326,0.00042413987,0.000043508262,0.0066572786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981261,0.00042518403,0.00012702223,0.00049563206,0.00038469347,0.00044127958],"domain_scores_gemma":[0.99481094,0.0026757026,0.00047995948,0.0010050702,0.0005040737,0.00052422367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020787884,0.0004610733,0.0009875746,0.0008787978,0.0019166707,0.0027356304,0.0010168338,0.0022977053,0.0089839],"category_scores_gemma":[0.006481428,0.00040712656,0.0009408775,0.0009158192,0.0060396795,0.006912154,0.00322763,0.0026687258,0.0012352896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002780732,0.00003972765,0.0014807837,0.00011222387,0.000014708794,0.00020599773,0.00058307406,0.0033564926,0.0018056206,0.97809327,0.005314127,0.0087158615],"study_design_scores_gemma":[0.00003725937,0.000024941344,0.000275189,0.000020866239,0.0000068192467,0.000101620295,0.00022639516,0.0060288734,0.0010218658,0.9879219,0.0043203,0.000013869457],"about_ca_topic_score_codex":0.00081247813,"about_ca_topic_score_gemma":0.0006488115,"teacher_disagreement_score":0.0089839,"about_ca_system_score_codex":0.0010773251,"about_ca_system_score_gemma":0.000816125,"threshold_uncertainty_score":0.030054152},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42919335,0.0032993397,0.4322082,0.00781767,0.0005239938,0.000428386,0.0027928257,0.00061879196,0.123117484],"genre_scores_gemma":[0.6638268,0.0051376354,0.2637505,0.0009175397,0.0010155531,0.00028844282,0.004667038,0.00063148775,0.059764978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892944,0.00035946246,0.0000662836,0.00024124078,0.00022030067,0.00018320123],"domain_scores_gemma":[0.9936231,0.0045549264,0.00036594868,0.000532406,0.00036594362,0.00055772794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011681914,0.00086394657,0.0013603786,0.0013711394,0.0017711916,0.004184425,0.0020105324,0.0026546952,0.011404745],"category_scores_gemma":[0.008381175,0.001195745,0.0010143265,0.0040194057,0.0015488,0.0086256545,0.0015784588,0.0034713983,0.00097263977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005801302,0.00047817244,0.0014659206,0.0008345736,0.00009217028,0.00057758694,0.00081128685,0.05551493,0.0047072605,0.80110717,0.025497233,0.10833363],"study_design_scores_gemma":[0.00007999443,0.00004740833,0.0004343947,0.00007213612,0.000033628574,0.00019558893,0.00034409607,0.059271764,0.0015175752,0.92859983,0.009381817,0.00002170669],"about_ca_topic_score_codex":0.002472716,"about_ca_topic_score_gemma":0.0025359339,"teacher_disagreement_score":0.011404745,"about_ca_system_score_codex":0.0014260603,"about_ca_system_score_gemma":0.0012952423,"threshold_uncertainty_score":0.038152695},"labels":[],"label_agreement":null},{"id":"W2158050621","doi":"10.1002/jcd.20249","title":"Hadamard matrices of small order and Yang conjecture","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Hadamard transform; Combinatorics; Hadamard matrix; Order (exchange); Equivalence (formal languages); Hadamard's maximal determinant problem; Equivalence class (music); Class (philosophy); Matrix (chemical analysis); Complex Hadamard matrix; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.008780618604829458,"score_gpt":0.2003418539122833,"score_spread":0.19156123530745384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158050621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8259616,0.0013287568,0.087024786,0.0045822314,0.00048057013,0.000044826433,0.00018737001,0.00031977444,0.08007003],"genre_scores_gemma":[0.98556584,0.00024048724,0.009396794,0.00032365634,0.00016270319,0.000035670455,0.0000907743,0.000022879132,0.004161172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.0002923351,0.00005756469,0.00018993948,0.0003740742,0.00022145902],"domain_scores_gemma":[0.9960621,0.0018619582,0.0005287006,0.000838735,0.0004285053,0.0002799018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014489824,0.00040991255,0.0005916675,0.000921719,0.0014115154,0.0016227963,0.00060440425,0.0010685408,0.0067275255],"category_scores_gemma":[0.007554084,0.00034924294,0.00045198185,0.00070671766,0.0030117962,0.0035168952,0.0015798693,0.0018906092,0.00080201245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002705663,0.000040340852,0.0022193957,0.0000460001,0.000008550659,0.00021900097,0.00035167433,0.006190685,0.0043165344,0.9687519,0.002347009,0.015238469],"study_design_scores_gemma":[0.00004262395,0.00008908818,0.00052541506,0.000021831558,0.000005601581,0.00032492945,0.00018973964,0.020542463,0.004318183,0.9680425,0.0058669425,0.000030569467],"about_ca_topic_score_codex":0.00065412035,"about_ca_topic_score_gemma":0.0004788362,"teacher_disagreement_score":0.0067275255,"about_ca_system_score_codex":0.00083119504,"about_ca_system_score_gemma":0.0007930679,"threshold_uncertainty_score":0.02250576},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9562026,0.00015279546,0.030525248,0.0004900663,0.000086985536,0.000057066696,0.00006551464,0.00063032017,0.011789341],"genre_scores_gemma":[0.97975093,0.00005380729,0.01876219,0.00003822508,0.000010271024,0.000021269985,0.000016640606,0.000016569726,0.0013300334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983704,0.000018668947,0.00000498129,0.000019160487,0.00009153998,0.000028580476],"domain_scores_gemma":[0.9997396,0.000105887775,0.000022010527,0.00003133537,0.000054133736,0.000046978992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020507864,0.00014774433,0.00013387625,0.00016065853,0.00033052656,0.00024810823,0.00045615845,0.00041499521,0.001210762],"category_scores_gemma":[0.00036729863,0.00010100369,0.00010699434,0.00009351421,0.0004627994,0.00032234183,0.00034550723,0.00042332185,0.00023267641],"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.00010540767,0.00007277927,0.000488702,0.00004356239,0.0000073511183,0.00037967286,0.0001430095,0.0021163884,0.97550255,0.01099722,0.00054816646,0.009595313],"study_design_scores_gemma":[0.000072239745,0.00041675818,0.001525187,0.00001261269,0.00001112564,0.0006215082,0.000060266077,0.06823672,0.92187816,0.0022531145,0.004885996,0.000026420612],"about_ca_topic_score_codex":0.0013086904,"about_ca_topic_score_gemma":0.0010829191,"teacher_disagreement_score":0.0013086904,"about_ca_system_score_codex":0.00026740122,"about_ca_system_score_gemma":0.00039420906,"threshold_uncertainty_score":0.004050374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8255804,0.0003440205,0.13782941,0.00084394414,0.00018256238,0.000082967905,0.00031228305,0.0005418167,0.034282673],"genre_scores_gemma":[0.9490333,0.00027671762,0.04052024,0.00020111506,0.00006580334,0.00008419185,0.00030460194,0.00013585952,0.009378044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00033636295,0.000065224405,0.00018519232,0.00018852174,0.00025828165],"domain_scores_gemma":[0.9932088,0.004034301,0.0009590647,0.00069672306,0.0002921071,0.0008089917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069769396,0.00069372373,0.0008223163,0.0024020337,0.0030987407,0.0039334414,0.0013064052,0.0024670204,0.0076921848],"category_scores_gemma":[0.0049227956,0.0009756641,0.0006505226,0.0028059965,0.0031169741,0.004368859,0.0025539498,0.002022212,0.00092675735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041571216,0.00020060444,0.0018999685,0.00018139665,0.000034884666,0.0007204167,0.0012232363,0.014059407,0.0095725525,0.94658405,0.002876952,0.022230832],"study_design_scores_gemma":[0.000042417487,0.00005343517,0.00052588625,0.000043294127,0.000017390696,0.00024858065,0.00040046978,0.02783982,0.0027388856,0.9663191,0.0017509485,0.000019835508],"about_ca_topic_score_codex":0.0013607868,"about_ca_topic_score_gemma":0.0022838318,"teacher_disagreement_score":0.0076921848,"about_ca_system_score_codex":0.0012276097,"about_ca_system_score_gemma":0.0008303251,"threshold_uncertainty_score":0.025732934},"labels":[],"label_agreement":null},{"id":"W2159652182","doi":"10.1002/jcd.20280","title":"An existence theory for loopy graph decompositions","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Simple graph; Complement graph; Line graph; Graph power","score_opus":0.03905277402300821,"score_gpt":0.2514002905828278,"score_spread":0.2123475165598196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159652182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12631847,0.0026750693,0.79407007,0.0012345288,0.00012692361,0.00010278361,0.00046957817,0.00047917507,0.074523315],"genre_scores_gemma":[0.7727302,0.0021227745,0.19364294,0.0005977795,0.0003509854,0.0003812233,0.00074884953,0.0001863403,0.029239004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901867,0.00022377475,0.00006242415,0.00026655383,0.00026412736,0.00016444724],"domain_scores_gemma":[0.9958157,0.0026126208,0.0003775091,0.00036941914,0.0005503657,0.0002743814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015320932,0.0005115406,0.00054900046,0.002940136,0.001531856,0.0022343176,0.0008352248,0.0011931116,0.008431268],"category_scores_gemma":[0.005882284,0.0009068496,0.0008759116,0.001762544,0.0026341456,0.005005575,0.0024174259,0.0022357067,0.0011462949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014055484,0.000011345705,0.00020150446,0.00005590851,0.000005091287,0.00003147281,0.00024040941,0.0014423133,0.0004157261,0.9882195,0.00100903,0.008353637],"study_design_scores_gemma":[0.000014517057,0.000032295156,0.00019796715,0.000056241468,0.000016507074,0.00014497116,0.00015369413,0.014387309,0.00068995653,0.97320503,0.011090097,0.000011380886],"about_ca_topic_score_codex":0.00048344774,"about_ca_topic_score_gemma":0.0005090308,"teacher_disagreement_score":0.008431268,"about_ca_system_score_codex":0.0015610757,"about_ca_system_score_gemma":0.0004570736,"threshold_uncertainty_score":0.028205335},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022596063,0.0008080018,0.9567423,0.001672519,0.00006403776,0.00025666333,0.00042813743,0.0010870695,0.016345218],"genre_scores_gemma":[0.33038908,0.0015533386,0.65695715,0.00068127987,0.00035951237,0.0006456629,0.0015390598,0.0008258875,0.007049004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98741037,0.0041696313,0.0008319226,0.0018708407,0.0043285065,0.0013887245],"domain_scores_gemma":[0.94461405,0.04495379,0.0017223536,0.006589426,0.0016401057,0.00048034717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068144086,0.001339341,0.0015825363,0.0021453633,0.002046832,0.008039156,0.0057526953,0.0024606744,0.02011345],"category_scores_gemma":[0.03892464,0.000959091,0.0037583334,0.003559553,0.0032684184,0.015637072,0.005350575,0.0075581386,0.0016876728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030334777,0.00036979947,0.0014652987,0.0014836001,0.0001742892,0.00027689885,0.0006608172,0.08776175,0.0048038308,0.78208697,0.005909213,0.11470417],"study_design_scores_gemma":[0.00006439943,0.0000650973,0.00034926567,0.00013037409,0.00010236108,0.00030833483,0.00019016393,0.25614652,0.010746764,0.7251694,0.006684862,0.000042492615],"about_ca_topic_score_codex":0.0011896266,"about_ca_topic_score_gemma":0.0014385072,"teacher_disagreement_score":0.02011345,"about_ca_system_score_codex":0.003152332,"about_ca_system_score_gemma":0.0023213848,"threshold_uncertainty_score":0.067286134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68792915,0.0013236306,0.155137,0.0005999048,0.00007798752,0.000117290605,0.0030916755,0.0004405175,0.15128274],"genre_scores_gemma":[0.9028574,0.00095831015,0.07495006,0.00013356033,0.00008172418,0.00018114521,0.002695718,0.00017110947,0.017970948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999519,0.000059671016,0.00002183661,0.000067055254,0.0002271158,0.00010535318],"domain_scores_gemma":[0.9982792,0.00083639094,0.00020183338,0.00021924984,0.0002551924,0.00020820589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034301783,0.0003610484,0.00041343272,0.0017240914,0.0008850785,0.0013427084,0.0006318098,0.00037360183,0.006008187],"category_scores_gemma":[0.002576755,0.0003202494,0.0006562875,0.0015110126,0.0010214881,0.0009866562,0.00072481856,0.001134095,0.0007487808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003132757,0.00016451167,0.0029213864,0.00031055746,0.00004857774,0.00032340887,0.00033890014,0.077334404,0.013787944,0.84329253,0.008292458,0.05287206],"study_design_scores_gemma":[0.000054684475,0.00011291556,0.0037823778,0.00005623877,0.000028523018,0.0005266546,0.00026411412,0.120297976,0.0141380215,0.83947915,0.021192834,0.00006648595],"about_ca_topic_score_codex":0.0016637177,"about_ca_topic_score_gemma":0.0018319348,"teacher_disagreement_score":0.006008187,"about_ca_system_score_codex":0.00077018054,"about_ca_system_score_gemma":0.00063109334,"threshold_uncertainty_score":0.020099342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5761489,0.00051851413,0.39955643,0.00047153115,0.00014144747,0.000072785304,0.00006365464,0.00062588125,0.02240096],"genre_scores_gemma":[0.8789838,0.00022497731,0.11688992,0.00015685141,0.00004050949,0.000037165268,0.000027182681,0.000012683518,0.003626901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999833,0.00004443574,0.000007046146,0.00003110507,0.000057715533,0.000026691858],"domain_scores_gemma":[0.9998667,0.00003881859,0.00001575908,0.000030769712,0.000032012194,0.000015893043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024416344,0.00015574427,0.00014872882,0.0002304588,0.00034300066,0.0006073212,0.00028783237,0.00039626344,0.0004351458],"category_scores_gemma":[0.00029849727,0.0001409726,0.00013465055,0.00017171295,0.00043491257,0.0007449101,0.00049625395,0.00027353282,0.0001049467],"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.0003187602,0.00016923981,0.0026228356,0.0001753365,0.00003157745,0.0014643539,0.00051944226,0.056214884,0.36458346,0.46865764,0.002377103,0.102865346],"study_design_scores_gemma":[0.00007600589,0.0004336238,0.0021154117,0.000029295337,0.00004824971,0.0016056901,0.00016059235,0.81851906,0.06562526,0.09736818,0.013958549,0.00006010428],"about_ca_topic_score_codex":0.0004926811,"about_ca_topic_score_gemma":0.0008279896,"teacher_disagreement_score":0.0006073212,"about_ca_system_score_codex":0.00033698362,"about_ca_system_score_gemma":0.0003210788,"threshold_uncertainty_score":0.0024450421},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00902909,0.0037065118,0.31119013,0.0024074586,0.00068417616,0.00006971812,0.0006086774,0.00025728648,0.6720469],"genre_scores_gemma":[0.47205913,0.012132114,0.15763862,0.001556578,0.0022946347,0.00064769795,0.0024501444,0.0007343398,0.3504868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994307,0.00016978607,0.00001753519,0.00007538804,0.00025172278,0.000054789554],"domain_scores_gemma":[0.9995259,0.00020684382,0.000033053624,0.00009238698,0.00010187508,0.000039937906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045949308,0.0011440308,0.00073361973,0.001457451,0.0010481043,0.0029863932,0.0014223373,0.00093388266,0.026342014],"category_scores_gemma":[0.0016681388,0.00058129797,0.0007277636,0.0025715712,0.0016120232,0.002624355,0.001326942,0.0032759348,0.005864032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008511513,0.000011808527,0.000016527514,0.00005116766,0.0000046883897,0.000013105449,0.000026701911,0.0017656724,0.00023267811,0.9757371,0.008651486,0.013480428],"study_design_scores_gemma":[0.00000557481,0.0000060565494,0.00003338949,0.000026658809,0.000003922047,0.000032374082,0.00001730023,0.0044243503,0.00018584625,0.9728223,0.022436813,0.0000054707752],"about_ca_topic_score_codex":0.0006676717,"about_ca_topic_score_gemma":0.000828216,"teacher_disagreement_score":0.026342014,"about_ca_system_score_codex":0.0014989054,"about_ca_system_score_gemma":0.000720379,"threshold_uncertainty_score":0.088122785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049010303,0.00029738797,0.9330346,0.0006501534,0.00014623778,0.00019634918,0.00063104095,0.0048303003,0.011203655],"genre_scores_gemma":[0.2747395,0.00032373736,0.70532244,0.00039405806,0.00015916176,0.00032756786,0.0033851354,0.00071704027,0.014631332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998898,0.0001283222,0.00007497613,0.0003770308,0.00026811397,0.00025338976],"domain_scores_gemma":[0.99815875,0.0006574447,0.00012884996,0.00054017757,0.00038147246,0.00013327495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057771,0.0010201023,0.0011416537,0.0011051365,0.0011810333,0.0023640953,0.0019261478,0.0015083101,0.012034805],"category_scores_gemma":[0.0034686052,0.0006992422,0.0009418269,0.0017656476,0.000634585,0.004576331,0.0024818222,0.0019521818,0.006014114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009933097,0.00049792416,0.0010134586,0.0002374101,0.000051745734,0.00014938353,0.00025139123,0.032217797,0.04601656,0.06972508,0.0327174,0.8161286],"study_design_scores_gemma":[0.00050137384,0.00042480737,0.0009809755,0.000079005265,0.000089234374,0.0005503511,0.00025318709,0.6794631,0.04429999,0.24697763,0.026278192,0.00010218563],"about_ca_topic_score_codex":0.0033930552,"about_ca_topic_score_gemma":0.003990312,"teacher_disagreement_score":0.012034805,"about_ca_system_score_codex":0.0012536771,"about_ca_system_score_gemma":0.0018447206,"threshold_uncertainty_score":0.040260434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07893328,0.0008185398,0.90872246,0.0003834894,0.00008522591,0.000056304994,0.00002780336,0.00049675413,0.010476081],"genre_scores_gemma":[0.5229591,0.00065412815,0.47083378,0.00025389547,0.00006261286,0.00010561816,0.000044086264,0.00005720136,0.00502951],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996877,0.00006848248,0.000012790141,0.0000399606,0.00016069574,0.000030484383],"domain_scores_gemma":[0.99970704,0.00009206314,0.00003759577,0.000050890176,0.00009858846,0.000013851607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034880155,0.00031138674,0.00021296246,0.00062386645,0.0003882879,0.00044990648,0.0006635152,0.00039039427,0.0006749765],"category_scores_gemma":[0.0006262393,0.00013098307,0.00020205486,0.0005134935,0.00054404733,0.00086288276,0.00047360524,0.00035751794,0.00020602903],"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.00014986677,0.00017096644,0.00095994666,0.0002988691,0.00008183205,0.00025124793,0.0002961582,0.049964454,0.47794306,0.2567621,0.0022453074,0.21087629],"study_design_scores_gemma":[0.00010649854,0.00030462333,0.00085604313,0.000040024304,0.00007606543,0.0009518518,0.00007980146,0.6787872,0.2320912,0.054641865,0.031990085,0.0000747287],"about_ca_topic_score_codex":0.00047436298,"about_ca_topic_score_gemma":0.00084593473,"teacher_disagreement_score":0.0006749765,"about_ca_system_score_codex":0.0004990182,"about_ca_system_score_gemma":0.0004484374,"threshold_uncertainty_score":0.0036206841},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030838134,0.004671944,0.91158295,0.0028327086,0.00062227773,0.00009281528,0.00012154117,0.0007080873,0.048529573],"genre_scores_gemma":[0.8333284,0.0042781224,0.13394152,0.0006689585,0.00060452404,0.00014323842,0.00015804247,0.000072991905,0.026804278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994735,0.0001547281,0.000010202787,0.000083722196,0.00019986558,0.000078011246],"domain_scores_gemma":[0.9992792,0.00025090933,0.00009518061,0.00010908015,0.00020361469,0.0000620076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005176994,0.0003611379,0.0003139084,0.00048775482,0.0007088124,0.001480929,0.0009664785,0.0010882843,0.0038870233],"category_scores_gemma":[0.0016858493,0.00014060663,0.00018175539,0.0010728233,0.00087918265,0.0015760507,0.0009837769,0.000896554,0.0007499955],"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.00011276531,0.000094859526,0.0006028296,0.00021145797,0.000033540284,0.00018074663,0.00010770747,0.045802686,0.013899168,0.69528717,0.01688404,0.22678299],"study_design_scores_gemma":[0.000031610416,0.000084997075,0.00095217396,0.000050511568,0.00003489181,0.0003960568,0.00007612718,0.60384554,0.008836498,0.31174865,0.07390506,0.000037952002],"about_ca_topic_score_codex":0.0020282606,"about_ca_topic_score_gemma":0.0026653125,"teacher_disagreement_score":0.0038870233,"about_ca_system_score_codex":0.0012327038,"about_ca_system_score_gemma":0.0009686683,"threshold_uncertainty_score":0.013003409},"labels":[],"label_agreement":null},{"id":"W2162400339","doi":"10.1002/jcd.20180","title":"Skew‐Hadamard matrices of orders 436, 580, and 988 exist","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Skew; Combinatorics; Construct (python library); Order (exchange); Mathematical analysis; Computer science; Telecommunications","score_opus":0.017542440485355474,"score_gpt":0.20827647295620788,"score_spread":0.1907340324708524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162400339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86653376,0.00022420209,0.093388155,0.00019780973,0.0001608065,0.00005058771,0.00022787244,0.00015594496,0.039060842],"genre_scores_gemma":[0.96419317,0.000111718284,0.030872602,0.00006667301,0.000037455782,0.00004196841,0.00022291436,0.000019169076,0.0044342936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961275,0.000060822065,0.000020029634,0.000072486764,0.00015974356,0.0000741374],"domain_scores_gemma":[0.9992053,0.00023477526,0.00018163321,0.00012535398,0.00015964541,0.000093352246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554681,0.0004003877,0.00028449218,0.00066724134,0.00072426343,0.0005436492,0.00027418687,0.00033320664,0.005227525],"category_scores_gemma":[0.0011262392,0.000237764,0.000334335,0.00035130058,0.0005862097,0.00064359297,0.00035054202,0.0005363293,0.0007346439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000804549,0.00016905164,0.0068645678,0.0001289356,0.000041330768,0.0007867763,0.00081094116,0.010253462,0.14312288,0.7236352,0.0029227955,0.11045947],"study_design_scores_gemma":[0.00023937774,0.0013900024,0.00920378,0.00008250164,0.00007758283,0.0032451635,0.0008463327,0.06407327,0.26531982,0.5892934,0.06603645,0.0001923498],"about_ca_topic_score_codex":0.00022832112,"about_ca_topic_score_gemma":0.00023409318,"teacher_disagreement_score":0.005227525,"about_ca_system_score_codex":0.00029131921,"about_ca_system_score_gemma":0.0003251998,"threshold_uncertainty_score":0.017487824},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28259498,0.0007259568,0.66290635,0.0012767601,0.00035313802,0.00040846795,0.0004581405,0.0011368527,0.05013939],"genre_scores_gemma":[0.7854605,0.00035066053,0.19606668,0.0006359259,0.0001448243,0.00035466443,0.00023267494,0.00010243738,0.016651602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976713,0.0008501679,0.00016641899,0.00040200548,0.00055144547,0.00035858573],"domain_scores_gemma":[0.9952429,0.0017172162,0.00065537693,0.0014946354,0.00060262164,0.00028723778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020448957,0.0007390009,0.0008913178,0.0010963738,0.0008338196,0.001980763,0.0011726884,0.001367098,0.009755677],"category_scores_gemma":[0.0066808346,0.00055469107,0.0004407619,0.001344501,0.0008908292,0.0018909888,0.0017191661,0.0010306186,0.0018003286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024371515,0.00032471595,0.0018919437,0.0003447395,0.0001345862,0.00025309456,0.0002979221,0.03480469,0.054439154,0.72718436,0.005726867,0.17216074],"study_design_scores_gemma":[0.00086321065,0.0014766878,0.000734955,0.00016391213,0.00014506473,0.00050010567,0.00014360526,0.18707846,0.047036514,0.7297696,0.03200221,0.00008569118],"about_ca_topic_score_codex":0.00040899278,"about_ca_topic_score_gemma":0.0005814981,"teacher_disagreement_score":0.009755677,"about_ca_system_score_codex":0.0012904247,"about_ca_system_score_gemma":0.0012139995,"threshold_uncertainty_score":0.032635987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71065915,0.011071564,0.18261155,0.0012506823,0.00044662293,0.0002856704,0.00053368346,0.0012420897,0.09189898],"genre_scores_gemma":[0.9561059,0.0023357738,0.036857374,0.00019445158,0.00010828994,0.00010277041,0.00021126229,0.00009669996,0.003987453],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991522,0.00021682274,0.00003069671,0.00004278174,0.0004743189,0.00008320726],"domain_scores_gemma":[0.99695086,0.0015616236,0.00016508462,0.00020354848,0.0010340827,0.00008483746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089210115,0.00037904998,0.0003453421,0.0017309026,0.00044535467,0.0010041595,0.00052022736,0.0006935945,0.0040338743],"category_scores_gemma":[0.0041391817,0.0001442241,0.00023696781,0.0010384495,0.00036007733,0.0010680351,0.00060808926,0.00029560912,0.00056005537],"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.007115669,0.00044054582,0.0048264787,0.0014709986,0.00025771247,0.00040184346,0.00046167837,0.06424449,0.30261958,0.11733528,0.0035338812,0.49729183],"study_design_scores_gemma":[0.001041786,0.0051455693,0.014494595,0.0007513987,0.0007849791,0.0014333571,0.00094925467,0.39110598,0.46687037,0.056778163,0.060312673,0.0003319143],"about_ca_topic_score_codex":0.0007381443,"about_ca_topic_score_gemma":0.0007674441,"teacher_disagreement_score":0.0040338743,"about_ca_system_score_codex":0.00073005626,"about_ca_system_score_gemma":0.0004660002,"threshold_uncertainty_score":0.013494611},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12751304,0.001094962,0.6719705,0.001109142,0.0007866382,0.0002483776,0.0007076878,0.0009947595,0.19557498],"genre_scores_gemma":[0.68555075,0.0012508491,0.21801837,0.0013646517,0.00057310035,0.0005410725,0.0012673504,0.00056782924,0.090866014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855274,0.000446974,0.00006163202,0.00035852147,0.00038030744,0.00019973783],"domain_scores_gemma":[0.9982836,0.00041748566,0.0001686718,0.00068122445,0.00028626694,0.00016277167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007015938,0.0010988871,0.0011029651,0.0015270618,0.0013990479,0.002610186,0.001037423,0.0017852207,0.021044636],"category_scores_gemma":[0.003223028,0.00084017176,0.0009118854,0.0019976879,0.001461398,0.002705147,0.0024147169,0.0019122162,0.0045346417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010343356,0.000035720666,0.00017235745,0.00007351947,0.000022438813,0.00009606266,0.000110568064,0.0043177065,0.003755095,0.95259494,0.0047944076,0.03392377],"study_design_scores_gemma":[0.000051451454,0.00009221795,0.0002587619,0.00004463581,0.000033252105,0.00032872029,0.00008858117,0.029032277,0.0040221815,0.94630384,0.019715266,0.000028789626],"about_ca_topic_score_codex":0.00034575618,"about_ca_topic_score_gemma":0.00051180256,"teacher_disagreement_score":0.021044636,"about_ca_system_score_codex":0.00075144815,"about_ca_system_score_gemma":0.00074060267,"threshold_uncertainty_score":0.07040131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5001224,0.0009434996,0.20348239,0.0024617834,0.0015426589,0.00022875213,0.0009841289,0.00054071244,0.28969377],"genre_scores_gemma":[0.9102655,0.0005055152,0.047459837,0.00073564437,0.0004672572,0.00015599506,0.0009198875,0.00026017497,0.03923029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982247,0.0004062429,0.00013356675,0.00033828677,0.00039671408,0.00050051074],"domain_scores_gemma":[0.9978655,0.00083901006,0.00021940406,0.00042373515,0.00035293994,0.00029945225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012946029,0.0009642555,0.0010187058,0.0020962069,0.002838767,0.0043939506,0.0010342519,0.001854021,0.020840062],"category_scores_gemma":[0.0034887944,0.00083758304,0.0013328837,0.0012103613,0.0034716935,0.004619759,0.0020301503,0.0026710592,0.0026676026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035678026,0.00002950414,0.00009345918,0.000016506849,0.0000034546229,0.00009422723,0.00020128895,0.00029258613,0.0007189962,0.9940884,0.0010365851,0.0033893348],"study_design_scores_gemma":[0.00001580014,0.000010902767,0.00007679806,0.000012301617,0.0000042586335,0.00010406644,0.000112653535,0.0013371465,0.00029787837,0.9955342,0.0024832468,0.000010689563],"about_ca_topic_score_codex":0.0008709597,"about_ca_topic_score_gemma":0.0013012796,"teacher_disagreement_score":0.020840062,"about_ca_system_score_codex":0.0012781299,"about_ca_system_score_gemma":0.00077847944,"threshold_uncertainty_score":0.06971693},"labels":[],"label_agreement":null},{"id":"W2166664532","doi":"10.1002/jcd.10054","title":"Some New uniform frames with block size four and index one or three","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Index (typography); Combinatorics; Computer science","score_opus":0.019847447336637417,"score_gpt":0.2075589500617135,"score_spread":0.18771150272507608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166664532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58289605,0.0026491617,0.37926337,0.0003488194,0.00053094944,0.00014058709,0.00036482196,0.0004392628,0.033367082],"genre_scores_gemma":[0.8484858,0.001149154,0.1353322,0.00021030624,0.0001959879,0.0001377374,0.00058163854,0.00008796868,0.013819046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997137,0.000054990825,0.000024476942,0.000056876244,0.000066871224,0.00008311559],"domain_scores_gemma":[0.99952173,0.00011615049,0.00009138135,0.00007234929,0.00012862807,0.00006970276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004071234,0.00047966652,0.0005236519,0.00088697,0.0009731997,0.0005987552,0.00044822993,0.00044688457,0.003030685],"category_scores_gemma":[0.0013120676,0.00026756214,0.00042520592,0.0006953461,0.0005792105,0.00116395,0.0006787844,0.0005553897,0.00034450277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001868766,0.00018213555,0.0033067872,0.0005969265,0.00010163526,0.0026692294,0.0011531315,0.018771594,0.13107298,0.55701315,0.009839655,0.27342394],"study_design_scores_gemma":[0.0005936267,0.0018335733,0.007334195,0.00027813396,0.0004483013,0.0052975304,0.0010763542,0.25965986,0.22523242,0.36345914,0.1343879,0.000398848],"about_ca_topic_score_codex":0.0008124448,"about_ca_topic_score_gemma":0.0012520304,"teacher_disagreement_score":0.003030685,"about_ca_system_score_codex":0.0005000462,"about_ca_system_score_gemma":0.00032207032,"threshold_uncertainty_score":0.010138631},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92831594,0.0005870511,0.066673726,0.000063129104,0.000034229408,0.00002127074,0.000046379126,0.00023304296,0.0040253],"genre_scores_gemma":[0.99625164,0.00011111211,0.0031789131,0.000010168297,0.000012361659,0.0000040826753,0.00002688026,0.000011107233,0.0003938055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985442,0.0005922684,0.000046961948,0.0001257232,0.0004907147,0.0002001587],"domain_scores_gemma":[0.9962148,0.0026410166,0.00027905815,0.00021415361,0.0005578851,0.00009298395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606916,0.0006661952,0.0006524477,0.0005792254,0.0003121286,0.0007422546,0.00038717795,0.0006665956,0.0010015945],"category_scores_gemma":[0.0036359124,0.00016816396,0.00029940874,0.00037719015,0.00038449693,0.000671593,0.0005343986,0.0004594537,0.00021946423],"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.0030366785,0.0002432468,0.008584866,0.00026549277,0.00023164331,0.0005239175,0.00021510043,0.81550246,0.112301685,0.004670367,0.00032472936,0.05409984],"study_design_scores_gemma":[0.000022611604,0.00089849945,0.0019584508,0.0000070088777,0.00005896776,0.00027314303,0.00003416335,0.9700655,0.026153183,0.0003102877,0.00019407143,0.00002424518],"about_ca_topic_score_codex":0.0010800029,"about_ca_topic_score_gemma":0.00062741706,"teacher_disagreement_score":0.0015606916,"about_ca_system_score_codex":0.0004933545,"about_ca_system_score_gemma":0.0002872438,"threshold_uncertainty_score":0.008253813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075919656,0.00010777035,0.9888094,0.000046768968,0.000028436507,0.00006470123,0.000032960572,0.00023930657,0.0030787145],"genre_scores_gemma":[0.11699838,0.00017960032,0.8801908,0.000083476676,0.000020938163,0.00021292806,0.00022904489,0.00018546445,0.0018993896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857557,0.00035090803,0.00009039979,0.00018493195,0.00065983896,0.00013843513],"domain_scores_gemma":[0.997056,0.0016153399,0.00013519735,0.00054106896,0.00053848326,0.00011399925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012142123,0.0007843254,0.0011815795,0.0019294645,0.0009433585,0.0012914392,0.0019442156,0.00078828237,0.0049755513],"category_scores_gemma":[0.00805465,0.0006592561,0.0009487157,0.001674141,0.0007287553,0.0017840271,0.0022630084,0.001958066,0.0014396666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029014784,0.00021630098,0.0012161386,0.00039828027,0.00008208794,0.0002547262,0.00043284253,0.51582193,0.033406764,0.119928695,0.005570055,0.322382],"study_design_scores_gemma":[0.00003375576,0.00011965118,0.0002368524,0.00003225713,0.000011657116,0.00010986178,0.000041741838,0.94060963,0.008773233,0.043002754,0.006995618,0.00003301094],"about_ca_topic_score_codex":0.0026170188,"about_ca_topic_score_gemma":0.003860867,"teacher_disagreement_score":0.0049755513,"about_ca_system_score_codex":0.000996847,"about_ca_system_score_gemma":0.00081806217,"threshold_uncertainty_score":0.016644895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5393567,0.0009808635,0.45276657,0.00050056865,0.00018054567,0.0001193902,0.00006419615,0.0005907485,0.005440479],"genre_scores_gemma":[0.91973364,0.0002392417,0.0776228,0.00010195756,0.0000737631,0.00005966765,0.000029054965,0.000007921353,0.0021320188],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994324,0.00017927078,0.000027556824,0.000112343994,0.00019234746,0.000056118268],"domain_scores_gemma":[0.9992999,0.00027342912,0.000103196515,0.00013763743,0.00012872959,0.000057121553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037856697,0.0005399437,0.0005041314,0.00036402725,0.0005275697,0.0008002094,0.0006542294,0.000792609,0.0008356288],"category_scores_gemma":[0.00088772376,0.00032806088,0.00028457245,0.00042741094,0.0005646887,0.0012812841,0.00067060516,0.00042786263,0.00025456163],"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.001649269,0.00073167344,0.011792431,0.00081233657,0.00048455555,0.0034941877,0.0008384835,0.27471417,0.46256536,0.07719475,0.00307776,0.16264513],"study_design_scores_gemma":[0.00016914144,0.00052789826,0.0014203409,0.000021722446,0.00011319311,0.0015584201,0.00009350967,0.928877,0.05334736,0.008338151,0.005438363,0.00009503624],"about_ca_topic_score_codex":0.00066402287,"about_ca_topic_score_gemma":0.001119471,"teacher_disagreement_score":0.0008356288,"about_ca_system_score_codex":0.00044247505,"about_ca_system_score_gemma":0.00041427606,"threshold_uncertainty_score":0.0032104254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609698,0.00014810188,0.028506348,0.00026223928,0.000043618886,0.000039882907,0.00008256636,0.00045283124,0.009494565],"genre_scores_gemma":[0.9767259,0.00006713731,0.0194515,0.000089674446,0.000024347544,0.000027166518,0.00006543645,0.000020219832,0.0035286266],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990601,0.00013776551,0.00002407445,0.00010226289,0.0005197535,0.00015605667],"domain_scores_gemma":[0.9981188,0.0005981776,0.0001338747,0.00016469977,0.0008318929,0.00015250292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703505,0.00028331528,0.0003026968,0.00050677045,0.00059016846,0.000431344,0.0005782317,0.00063002127,0.0029461137],"category_scores_gemma":[0.0013299957,0.00017503215,0.00009126874,0.00040989614,0.0007106551,0.0006873341,0.00053456397,0.0006072567,0.00073652476],"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.00052266725,0.00034590962,0.0029239885,0.00008366936,0.000051013452,0.0005063913,0.00055699033,0.004391428,0.94449556,0.008919319,0.0012438913,0.03595925],"study_design_scores_gemma":[0.00014209792,0.0017525386,0.006870005,0.0000371034,0.000105287894,0.0011303123,0.00034380468,0.16750728,0.8079374,0.0043537547,0.009744017,0.0000764661],"about_ca_topic_score_codex":0.0016451167,"about_ca_topic_score_gemma":0.0024292113,"teacher_disagreement_score":0.0029461137,"about_ca_system_score_codex":0.0004015995,"about_ca_system_score_gemma":0.0005791992,"threshold_uncertainty_score":0.009855688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021850057,0.0001324611,0.9674265,0.00026171128,0.00006371963,0.00016078436,0.00016218176,0.001864868,0.008077863],"genre_scores_gemma":[0.1949664,0.00012831138,0.795316,0.00025677565,0.000081750855,0.0004565192,0.0006978315,0.00057625043,0.0075202],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980876,0.00065555034,0.00010249555,0.00036299223,0.0005855505,0.00020590324],"domain_scores_gemma":[0.9966293,0.001829073,0.00028112327,0.0007790161,0.00035813916,0.00012337868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011098931,0.00072157517,0.0006142474,0.0007306945,0.00085719104,0.0010080963,0.00082475756,0.00062220055,0.011776533],"category_scores_gemma":[0.004269708,0.00046300635,0.00080958346,0.00082768913,0.0012694327,0.0017811303,0.0021179123,0.0009955249,0.0036977509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006896238,0.0002797327,0.0015235005,0.0006632031,0.000093278955,0.0004384262,0.0005534019,0.06410804,0.10283702,0.3770279,0.013557119,0.43822876],"study_design_scores_gemma":[0.00043987719,0.00060649525,0.0006361498,0.000088110704,0.00006756945,0.0006893806,0.00027759274,0.32358456,0.08731275,0.5327312,0.053485774,0.0000805815],"about_ca_topic_score_codex":0.000408218,"about_ca_topic_score_gemma":0.00068786263,"teacher_disagreement_score":0.011776533,"about_ca_system_score_codex":0.00065536366,"about_ca_system_score_gemma":0.0008757013,"threshold_uncertainty_score":0.039396465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95517015,0.00015184026,0.037404716,0.00015846151,0.000021928592,0.000034514414,0.00016978904,0.00021462588,0.00667396],"genre_scores_gemma":[0.99530303,0.0000560816,0.0037677793,0.000027783408,0.0000028788234,0.000018461958,0.0000439357,0.00003436579,0.0007456621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968934,0.00010671962,0.000012364819,0.000029464194,0.00010844136,0.00005363145],"domain_scores_gemma":[0.99876344,0.000792987,0.00015836471,0.000067579706,0.0001809983,0.000036639605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129187,0.00040332618,0.00041645835,0.0003492982,0.00032355613,0.0005289092,0.0002914209,0.0006092942,0.0012483175],"category_scores_gemma":[0.0028846955,0.00030996502,0.00024171098,0.00034997752,0.0003379042,0.0007596915,0.00035562977,0.0002879438,0.00017849395],"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.00009010708,0.000018927536,0.0009294863,0.000020428768,0.000015088448,0.000065292,0.000031898955,0.9888291,0.007331497,0.0013618089,0.000066279164,0.001240171],"study_design_scores_gemma":[0.000016018043,0.00004005211,0.00040355237,0.0000027694819,0.000008150532,0.000013518473,0.000009311014,0.99458545,0.0045178533,0.00030395322,0.00009170495,0.000007774445],"about_ca_topic_score_codex":0.0056064283,"about_ca_topic_score_gemma":0.0028338851,"teacher_disagreement_score":0.0056064283,"about_ca_system_score_codex":0.000643758,"about_ca_system_score_gemma":0.00052461034,"threshold_uncertainty_score":0.011147618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0738181,0.0022067311,0.8277303,0.0030170563,0.00086508313,0.000145665,0.00033599022,0.00064892904,0.09123216],"genre_scores_gemma":[0.69851166,0.0020036611,0.22296892,0.0013231278,0.0007174859,0.00043881248,0.00036007026,0.00025633106,0.07342002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888974,0.0003264216,0.0000948993,0.00025003732,0.0002811288,0.00015778274],"domain_scores_gemma":[0.99852693,0.0008854137,0.00010766901,0.00023961317,0.00017266195,0.00006752917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009258606,0.0006019418,0.00060193747,0.0010480578,0.001449139,0.0041279322,0.001098233,0.0013304721,0.007049008],"category_scores_gemma":[0.003404539,0.0004949211,0.00077095744,0.0016207208,0.0030494898,0.006550479,0.0022309313,0.0023674842,0.0014054124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013618884,0.0000061125975,0.000031044077,0.000017353985,0.000002963169,0.00003671044,0.00008307216,0.00053236604,0.00036373295,0.99158865,0.00044001092,0.006884331],"study_design_scores_gemma":[0.000008045782,0.000010302062,0.000035419336,0.000012435171,0.000010012487,0.00008281275,0.000028336819,0.004109836,0.0010920588,0.98646754,0.008135497,0.000007734638],"about_ca_topic_score_codex":0.00049341726,"about_ca_topic_score_gemma":0.00068113767,"teacher_disagreement_score":0.007049008,"about_ca_system_score_codex":0.0010952271,"about_ca_system_score_gemma":0.000827751,"threshold_uncertainty_score":0.023581207},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81904197,0.001283567,0.17652625,0.00015207357,0.000030067195,0.000042286854,0.000025841675,0.00014092568,0.002757126],"genre_scores_gemma":[0.99459875,0.00022730183,0.0047730966,0.0000147034825,0.000009985346,0.0000094369825,0.000009377645,0.000005636805,0.00035174942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917054,0.00034641312,0.000018283112,0.00006151754,0.00024918097,0.00015414384],"domain_scores_gemma":[0.9954814,0.0034140768,0.0005057235,0.0001636081,0.0003538832,0.00008128554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014443769,0.00039894623,0.00051598693,0.00062330783,0.0004176439,0.0005210186,0.00066693936,0.0005593808,0.0002743911],"category_scores_gemma":[0.004510212,0.00026360148,0.0003091151,0.0006033036,0.0010188591,0.000719232,0.00053296995,0.00033283012,0.000068087145],"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.00039561192,0.000040432074,0.0032791907,0.000096795055,0.00009065622,0.00037762767,0.0003516631,0.94960916,0.021321421,0.011837792,0.00022074017,0.01237893],"study_design_scores_gemma":[0.000028463173,0.00030631278,0.0012131197,0.000007722979,0.00006103932,0.0002731489,0.000096271586,0.9891215,0.0053912033,0.003153764,0.00031824893,0.000029225852],"about_ca_topic_score_codex":0.0031941968,"about_ca_topic_score_gemma":0.0024669971,"teacher_disagreement_score":0.0031941968,"about_ca_system_score_codex":0.0008031444,"about_ca_system_score_gemma":0.00046492447,"threshold_uncertainty_score":0.0076386333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038625754,0.0014323704,0.94536376,0.000603705,0.00008763468,0.000046530626,0.000039224364,0.00017480156,0.013626147],"genre_scores_gemma":[0.75448716,0.0016769056,0.23658524,0.00023090186,0.00007944598,0.00009982564,0.00004558728,0.00004821041,0.006746789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985325,0.000055230033,0.0000037683028,0.000019687222,0.000051946343,0.000016025851],"domain_scores_gemma":[0.9996698,0.00019386271,0.000028875722,0.00003999367,0.000054844175,0.000012683824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037089718,0.00032825017,0.00019913622,0.0003612779,0.00047673192,0.0007093425,0.0003699843,0.0003495522,0.0019361492],"category_scores_gemma":[0.0010452409,0.00015398585,0.00018699211,0.00038710213,0.00048879924,0.00066970877,0.00043786774,0.0005531444,0.00028589793],"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.00012310028,0.0000660655,0.0004346871,0.00023743683,0.00002113837,0.0001469303,0.00019443283,0.16327715,0.03397742,0.6807444,0.005005745,0.115771405],"study_design_scores_gemma":[0.000016541138,0.00004311441,0.00018543605,0.000024610403,0.00001582327,0.00010901649,0.000035451118,0.84265697,0.0075664,0.14146292,0.00786852,0.000015181664],"about_ca_topic_score_codex":0.00097125076,"about_ca_topic_score_gemma":0.0024810135,"teacher_disagreement_score":0.0019361492,"about_ca_system_score_codex":0.0010114184,"about_ca_system_score_gemma":0.0009581448,"threshold_uncertainty_score":0.007338345},"labels":[],"label_agreement":null},{"id":"W2170886510","doi":"10.1002/jcd.21323","title":"Hadamard Matrices of Order 32","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Institute for Research in Fundamental Sciences; University of Lethbridge","keywords":"Mathematics; Hadamard transform; Combinatorics; Hadamard matrix; Complex Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Equivalence (formal languages); Sequence (biology); Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.01570326075954689,"score_gpt":0.22395823546161986,"score_spread":0.20825497470207296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170886510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7356071,0.0020223137,0.12641206,0.0011587769,0.00077127345,0.00022913225,0.0010591048,0.0004045591,0.13233577],"genre_scores_gemma":[0.96174544,0.00026127367,0.028038623,0.00015845583,0.0001926188,0.00005713355,0.00041427906,0.000030200094,0.009102009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810094,0.00033627098,0.0001635823,0.00033796625,0.000681591,0.00037976197],"domain_scores_gemma":[0.998384,0.00039140118,0.00033601047,0.0003055328,0.0004503574,0.00013271303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068609195,0.0006837917,0.0006914295,0.0017411363,0.0011181073,0.001849055,0.0004204307,0.00089195836,0.010302314],"category_scores_gemma":[0.0026563571,0.00023603093,0.00045579075,0.0010715302,0.0015952376,0.0016099694,0.00070562446,0.0010520522,0.001129705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044054908,0.00009186452,0.0018136924,0.00012460756,0.000020696036,0.000710635,0.0003899155,0.00490714,0.018931413,0.91918254,0.0034318753,0.049955096],"study_design_scores_gemma":[0.000061623614,0.00028781293,0.0017251294,0.00007035698,0.0000143460975,0.0011387788,0.00020050602,0.013899393,0.010986656,0.9466504,0.02488601,0.000079133606],"about_ca_topic_score_codex":0.0005745813,"about_ca_topic_score_gemma":0.0004063222,"teacher_disagreement_score":0.010302314,"about_ca_system_score_codex":0.00056423625,"about_ca_system_score_gemma":0.00056906714,"threshold_uncertainty_score":0.034464657},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11053683,0.0010003021,0.8562296,0.00050437794,0.0001253228,0.000065449596,0.000095303185,0.00018367244,0.031259134],"genre_scores_gemma":[0.8253069,0.0010187767,0.1502702,0.00023533255,0.00021796484,0.00023208787,0.00011509965,0.00011124553,0.022492412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815637,0.0008000468,0.00008113668,0.00032377447,0.00049978733,0.00013886497],"domain_scores_gemma":[0.99264354,0.0045534074,0.00079326273,0.0011898362,0.0005466921,0.0002732761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016735443,0.0007708699,0.0011113627,0.0015672834,0.001070538,0.0022027462,0.00097416545,0.0016191162,0.005987994],"category_scores_gemma":[0.00889827,0.0010061896,0.0004603974,0.0014056822,0.0034742316,0.0036184073,0.001603154,0.0021845524,0.0009686315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006711956,0.000016989492,0.0002049071,0.00003620383,0.0000077948125,0.000043414446,0.00010253795,0.0078537315,0.00078274217,0.9789394,0.0003041874,0.011640961],"study_design_scores_gemma":[0.00002006183,0.00004035532,0.00009431238,0.00001607727,0.0000067094475,0.00005596122,0.0000356358,0.020564472,0.0006215382,0.97658825,0.001947677,0.000008900152],"about_ca_topic_score_codex":0.0005104036,"about_ca_topic_score_gemma":0.00055072684,"teacher_disagreement_score":0.005987994,"about_ca_system_score_codex":0.00074147515,"about_ca_system_score_gemma":0.00056137197,"threshold_uncertainty_score":0.02003187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12051346,0.004306694,0.77309066,0.0032738552,0.0013588291,0.0004429866,0.00050690386,0.002692928,0.093813725],"genre_scores_gemma":[0.8575639,0.00261857,0.10185901,0.000938051,0.0005922513,0.00021152159,0.00038593734,0.00002834725,0.03580241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997652,0.000043314707,0.000008895991,0.000054250322,0.00008226007,0.000046063393],"domain_scores_gemma":[0.9998122,0.000046551122,0.000029643586,0.00003065518,0.000057859048,0.000023106051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016648634,0.00030495267,0.00029833792,0.00035847115,0.0008101183,0.00078850484,0.00069220184,0.00060099043,0.0059081665],"category_scores_gemma":[0.00039561666,0.00009073592,0.00015763575,0.0004083758,0.00027525023,0.0009197968,0.0006053356,0.00032614617,0.0014089979],"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.00033575817,0.00030303127,0.0035616602,0.0004594144,0.00012754837,0.0012716779,0.00031985302,0.038132653,0.09566974,0.34484202,0.03411981,0.48085678],"study_design_scores_gemma":[0.00021969032,0.0009784112,0.0026478658,0.00011140799,0.00025341005,0.0033884908,0.00023162294,0.44447187,0.04943882,0.1102965,0.38778654,0.00017535381],"about_ca_topic_score_codex":0.0006955526,"about_ca_topic_score_gemma":0.00081555406,"teacher_disagreement_score":0.0059081665,"about_ca_system_score_codex":0.00034707817,"about_ca_system_score_gemma":0.00033152915,"threshold_uncertainty_score":0.019764781},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38706315,0.002650869,0.31440675,0.0044034533,0.0008005156,0.00021876793,0.0011752468,0.00052270613,0.28875867],"genre_scores_gemma":[0.76318395,0.0024162151,0.13384257,0.0010043986,0.000678992,0.00021766558,0.0011875352,0.00035999008,0.09710876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996822,0.00007715961,0.000013636662,0.000074097734,0.00007780446,0.00007517336],"domain_scores_gemma":[0.9993979,0.00025638877,0.000076150034,0.000115646704,0.000076560806,0.000077305944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044172426,0.00078042364,0.0007336672,0.0010591137,0.0016010023,0.0021118543,0.0008399431,0.0013536164,0.01302051],"category_scores_gemma":[0.001962952,0.0006549297,0.00075598207,0.0013983859,0.0013628062,0.0036177302,0.0013102313,0.0023173918,0.0017534549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010683555,0.000036323876,0.00012038839,0.00012499634,0.000012677958,0.00008214827,0.0003578529,0.0040959385,0.0025359264,0.95404524,0.01237166,0.02611017],"study_design_scores_gemma":[0.000024672945,0.000012528778,0.00008762297,0.000016043725,0.000006015881,0.0000845526,0.00008015202,0.0063787634,0.00053087133,0.9872164,0.005552705,0.0000096991225],"about_ca_topic_score_codex":0.001171626,"about_ca_topic_score_gemma":0.0022050005,"teacher_disagreement_score":0.01302051,"about_ca_system_score_codex":0.0007111436,"about_ca_system_score_gemma":0.00062441407,"threshold_uncertainty_score":0.043557942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16062255,0.0059895706,0.21009932,0.0021035078,0.0009426005,0.00018454595,0.0017249873,0.0003693456,0.6179636],"genre_scores_gemma":[0.70173895,0.0047305888,0.13906689,0.00082169095,0.0006932982,0.0004380701,0.0025349576,0.00045423006,0.14952128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933416,0.00014451402,0.0000489125,0.000119732205,0.00026645602,0.000086162596],"domain_scores_gemma":[0.99934834,0.00026903258,0.000062598476,0.0001222187,0.00014708532,0.000050765102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004685587,0.0006201521,0.0011797155,0.002418078,0.0032842348,0.004031423,0.0013181751,0.0011209288,0.012195821],"category_scores_gemma":[0.00124668,0.00095161994,0.0013475233,0.0030488346,0.002331647,0.004543204,0.0015071807,0.0031319791,0.0020008779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017545492,0.000007763092,0.000059191876,0.000041027844,0.0000067298233,0.000047704238,0.00018347029,0.00083969434,0.00045392275,0.98915756,0.0023625076,0.0068227844],"study_design_scores_gemma":[0.0000069522425,0.000009597077,0.00009680234,0.000035455367,0.000008319863,0.00014683529,0.00015692353,0.0018738334,0.0005090827,0.9818547,0.015292893,0.000008505955],"about_ca_topic_score_codex":0.00146639,"about_ca_topic_score_gemma":0.0018277698,"teacher_disagreement_score":0.012195821,"about_ca_system_score_codex":0.0019604585,"about_ca_system_score_gemma":0.00076285994,"threshold_uncertainty_score":0.04079908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07511942,0.0027430844,0.8231284,0.0021022372,0.00023500835,0.00009163832,0.00065854436,0.00030505497,0.095616594],"genre_scores_gemma":[0.79601926,0.0033233133,0.14722288,0.00095453946,0.00055281713,0.00050909934,0.0013014306,0.00019859537,0.049918015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.0002805309,0.000060960792,0.00019841085,0.00030596746,0.0001676186],"domain_scores_gemma":[0.99712,0.0016981544,0.00020965037,0.00022858194,0.0005917949,0.00015176882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016343801,0.0007659661,0.0009645803,0.002098173,0.0022544265,0.0030490523,0.0009917865,0.0019987016,0.009893233],"category_scores_gemma":[0.0033848477,0.00095041475,0.0011016751,0.0015627637,0.002061095,0.0062640733,0.002522956,0.0032098237,0.0017699281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010492549,0.000009472106,0.000060541493,0.000055107357,0.000007539502,0.000027362954,0.00013755684,0.0017432674,0.00030160873,0.9914334,0.0017873774,0.004426228],"study_design_scores_gemma":[0.000011310429,0.00003270042,0.00011948422,0.000046859193,0.000011744654,0.00009777589,0.000109643515,0.024681488,0.00050067605,0.9654698,0.008900883,0.00001758177],"about_ca_topic_score_codex":0.0005637562,"about_ca_topic_score_gemma":0.00064824807,"teacher_disagreement_score":0.009893233,"about_ca_system_score_codex":0.0015018693,"about_ca_system_score_gemma":0.0007688115,"threshold_uncertainty_score":0.033096194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68709624,0.0007312743,0.1856448,0.0007613186,0.00075663696,0.00021744723,0.0005109046,0.00041072464,0.12387062],"genre_scores_gemma":[0.93042463,0.00034298707,0.0461494,0.00020590855,0.000084549276,0.00014647127,0.0002865152,0.000059219255,0.022300381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975735,0.000021622833,0.000014693901,0.00006376309,0.000050708004,0.00009197388],"domain_scores_gemma":[0.9998493,0.000026405382,0.000034210952,0.00005167754,0.000014653116,0.00002366796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007693827,0.00033813977,0.0003038719,0.00018469155,0.0006138134,0.0008405581,0.0003752096,0.00041787766,0.006323739],"category_scores_gemma":[0.0004193486,0.00013539394,0.00037126738,0.00033989947,0.0013687778,0.00076614897,0.000986911,0.0005004045,0.0012675396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013805474,0.00017821188,0.0059524924,0.00041949347,0.00007666962,0.0029902265,0.0010035998,0.03837513,0.20081113,0.59017086,0.011523429,0.14711817],"study_design_scores_gemma":[0.0003469521,0.0014524813,0.00737628,0.00012666864,0.000105581355,0.003193844,0.0026565033,0.13796209,0.17869191,0.47660384,0.19128342,0.00020041507],"about_ca_topic_score_codex":0.0009960368,"about_ca_topic_score_gemma":0.0012906945,"teacher_disagreement_score":0.006323739,"about_ca_system_score_codex":0.00026482777,"about_ca_system_score_gemma":0.00034180202,"threshold_uncertainty_score":0.02115494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03388998,0.00028273615,0.9380857,0.00015055752,0.00015499874,0.00012529074,0.00017432729,0.00062354596,0.026512837],"genre_scores_gemma":[0.37437645,0.00031532726,0.6047135,0.0001524285,0.000068205685,0.00029197428,0.0003255997,0.00022435334,0.019532103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945956,0.00015208387,0.00003573647,0.000099155666,0.00016962281,0.0000837846],"domain_scores_gemma":[0.9996679,0.00010291034,0.000028115775,0.00010244306,0.000063468004,0.00003510683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006071011,0.00033173437,0.00042491133,0.00062410434,0.0008986613,0.0010820564,0.0006308498,0.00036765967,0.007147525],"category_scores_gemma":[0.00096687954,0.00038666232,0.0004931241,0.00052395096,0.0008461476,0.00127494,0.0013997622,0.00096022803,0.0018948221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022604242,0.000042834836,0.00026983034,0.00019560121,0.000017273942,0.00015126629,0.00032287408,0.009712794,0.035982527,0.8660067,0.0032620404,0.083810315],"study_design_scores_gemma":[0.00023578921,0.00077751133,0.00059039006,0.00015882551,0.0000928303,0.0009120704,0.00028297512,0.09540866,0.121351324,0.6346763,0.14539844,0.00011494462],"about_ca_topic_score_codex":0.00028642477,"about_ca_topic_score_gemma":0.0004997053,"teacher_disagreement_score":0.007147525,"about_ca_system_score_codex":0.00064275536,"about_ca_system_score_gemma":0.00046745504,"threshold_uncertainty_score":0.02391082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79079354,0.00029140437,0.18366617,0.00039651195,0.000058101174,0.000041960084,0.0006107559,0.0003483897,0.023793256],"genre_scores_gemma":[0.96671057,0.00013095266,0.028829118,0.00006910335,0.000031967407,0.000031813364,0.0005765433,0.00007845685,0.0035414575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971694,0.00004156532,0.000010289581,0.00005698855,0.00006277523,0.000111379035],"domain_scores_gemma":[0.99875414,0.00056590786,0.00017787504,0.00021674586,0.00010453046,0.00018082184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028836634,0.00038228772,0.00048135433,0.0008394767,0.0007196574,0.0013504403,0.0006692309,0.0006263112,0.007527184],"category_scores_gemma":[0.0025129858,0.0003728047,0.00046981077,0.0006370057,0.00075115706,0.0013917437,0.0009002352,0.00088071666,0.00054627936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006469457,0.00014311477,0.005559454,0.00023479597,0.000045423498,0.0006901501,0.00084084744,0.33243766,0.03392544,0.5701287,0.0076753804,0.047672067],"study_design_scores_gemma":[0.000041419273,0.00008464435,0.0015229112,0.00003219841,0.00001924618,0.0003022121,0.00032998555,0.64192194,0.010443962,0.34141898,0.003863347,0.000019101411],"about_ca_topic_score_codex":0.0015730386,"about_ca_topic_score_gemma":0.0023792428,"teacher_disagreement_score":0.007527184,"about_ca_system_score_codex":0.0005606557,"about_ca_system_score_gemma":0.00022166141,"threshold_uncertainty_score":0.025180876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6693507,0.004048206,0.11569367,0.00705883,0.0009094568,0.00008239223,0.0009184907,0.00037704816,0.20156121],"genre_scores_gemma":[0.96493906,0.0018214772,0.013321599,0.0005698699,0.0006250237,0.000092967864,0.00037563848,0.0001909772,0.018063338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.0002499665,0.000018669412,0.00015372477,0.00014502922,0.00013211083],"domain_scores_gemma":[0.9925678,0.005240592,0.0007632692,0.0003858709,0.0004905487,0.0005519302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010304933,0.0008011368,0.00068509526,0.0038540545,0.0015862173,0.0029231107,0.0014301826,0.0010866118,0.0115757305],"category_scores_gemma":[0.008095817,0.000505045,0.00037497003,0.0029339904,0.003907515,0.0038118025,0.0016074169,0.0019809674,0.0007582374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028540616,0.000049827937,0.0015912036,0.00013255553,0.000025318483,0.00007801357,0.00039072087,0.03563911,0.0036156632,0.9344148,0.008042348,0.015735088],"study_design_scores_gemma":[0.00004654429,0.000042934505,0.0014550426,0.00007538589,0.000024759569,0.00011162786,0.00024322383,0.096465535,0.001367433,0.8936944,0.0064293784,0.000043695345],"about_ca_topic_score_codex":0.004242399,"about_ca_topic_score_gemma":0.0049207383,"teacher_disagreement_score":0.0115757305,"about_ca_system_score_codex":0.002973135,"about_ca_system_score_gemma":0.00094154425,"threshold_uncertainty_score":0.03872466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053803734,0.0023981726,0.7360151,0.002557373,0.0015758064,0.00009169502,0.00035242332,0.00034450414,0.2028612],"genre_scores_gemma":[0.77133787,0.003199087,0.16973825,0.0027601481,0.002642541,0.00015173432,0.00037039962,0.00022237937,0.04957757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989839,0.00018642179,0.000055263958,0.00029948214,0.0003274011,0.00014754788],"domain_scores_gemma":[0.9982243,0.00055406016,0.00015518024,0.000479958,0.0004648404,0.00012167071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215551,0.00057816174,0.000597644,0.0013718499,0.0009498965,0.0015740172,0.000859409,0.00085470837,0.005225943],"category_scores_gemma":[0.0027639251,0.00027981747,0.00095445575,0.0010680346,0.0024870194,0.002877583,0.0014104559,0.002474628,0.0014555681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010474389,0.000006613502,0.00007327265,0.000027416336,0.0000051043708,0.00009729487,0.000102617545,0.00092264067,0.0009999403,0.99055976,0.001768905,0.005425826],"study_design_scores_gemma":[0.0000075583193,0.000024896646,0.00016477704,0.000015790794,0.0000046078467,0.00039227214,0.000036880054,0.008162901,0.0014601313,0.97230536,0.017406035,0.0000189384],"about_ca_topic_score_codex":0.000966922,"about_ca_topic_score_gemma":0.000541123,"teacher_disagreement_score":0.005225943,"about_ca_system_score_codex":0.00092148583,"about_ca_system_score_gemma":0.00048246715,"threshold_uncertainty_score":0.017482579},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41422403,0.0026008121,0.15585642,0.002926313,0.001249482,0.0001375451,0.00089966954,0.00072423863,0.42138147],"genre_scores_gemma":[0.8760958,0.0013891171,0.02809938,0.00032548446,0.00046094693,0.000061902945,0.00053338235,0.00025876611,0.092775285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998035,0.000043854056,0.0000059457307,0.00003308441,0.0000669388,0.000046639947],"domain_scores_gemma":[0.9998952,0.00002164461,0.00001831928,0.00001794153,0.000017709403,0.000029043544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012494599,0.00066925545,0.00036813173,0.0009168263,0.00070550235,0.0014662001,0.00045153286,0.0004105974,0.009675163],"category_scores_gemma":[0.00024967917,0.0002443954,0.00023008822,0.00075264386,0.0010225562,0.0011178001,0.0009989153,0.0016672623,0.0017925629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001301981,0.00004213334,0.00016290444,0.00006963872,0.000012022301,0.00032169677,0.0005038338,0.002268527,0.0065720715,0.9457654,0.006488979,0.037662607],"study_design_scores_gemma":[0.00005738245,0.00014928782,0.0010935144,0.000038074475,0.0000206854,0.0007154986,0.00041444233,0.0066153808,0.005480577,0.8986384,0.08673944,0.000037200072],"about_ca_topic_score_codex":0.0008229151,"about_ca_topic_score_gemma":0.00073408795,"teacher_disagreement_score":0.009675163,"about_ca_system_score_codex":0.0004886846,"about_ca_system_score_gemma":0.00026307523,"threshold_uncertainty_score":0.032366693},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076057855,0.0031890157,0.078894205,0.0021487551,0.0045471583,0.00007557587,0.0014403921,0.0020625207,0.90003663],"genre_scores_gemma":[0.10965749,0.0042291996,0.05280956,0.0016321025,0.001625772,0.00013409666,0.0012747244,0.0019113695,0.8267258],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960786,0.00007703154,0.000015917502,0.00008102561,0.00017486117,0.000043383952],"domain_scores_gemma":[0.999622,0.000060899594,0.000024729967,0.00009421525,0.0001627507,0.00003530249],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004465652,0.0008367315,0.00054530054,0.0015758977,0.00062528945,0.0015145736,0.00039585982,0.0005878211,0.35625345],"category_scores_gemma":[0.0017409672,0.00023500674,0.00060375454,0.0015853626,0.0007030275,0.0014259767,0.0011092721,0.0011137627,0.1935106],"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.00015862823,0.000049044236,0.00060610176,0.00035417097,0.000031117743,0.00017140307,0.00013578976,0.001473454,0.0068259826,0.31276944,0.36093298,0.3164919],"study_design_scores_gemma":[0.000035236266,0.00007719441,0.0020536715,0.00016624169,0.000031727934,0.0009242359,0.00012094224,0.004818965,0.010400179,0.20421638,0.77710444,0.000050607763],"about_ca_topic_score_codex":0.0010286424,"about_ca_topic_score_gemma":0.0014305081,"teacher_disagreement_score":0.35625345,"about_ca_system_score_codex":0.0007779377,"about_ca_system_score_gemma":0.00041870488,"threshold_uncertainty_score":0.91822636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59469324,0.0005009354,0.32721114,0.00072651805,0.00018607365,0.00020579767,0.0010650974,0.00047173508,0.074939474],"genre_scores_gemma":[0.9331904,0.00021845069,0.05355512,0.00009606721,0.000085969834,0.000118654556,0.00088672934,0.00007781667,0.011770878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980413,0.00037348864,0.00008897848,0.0006072309,0.0005759264,0.00031297642],"domain_scores_gemma":[0.99736315,0.00070613396,0.0004793576,0.00032009132,0.0004690929,0.0006621481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007241474,0.0005772251,0.0006966405,0.001117665,0.0010954818,0.0029170797,0.0008767629,0.00055926485,0.008501779],"category_scores_gemma":[0.0031515816,0.00051327987,0.00064555387,0.0006984317,0.0032593156,0.003223647,0.0017918624,0.0020318804,0.00085185166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049717026,0.0001321002,0.0038573947,0.00014924839,0.00004500874,0.0008032856,0.00042582708,0.034212906,0.009608799,0.92269737,0.0038016601,0.023769286],"study_design_scores_gemma":[0.000105876934,0.00026234347,0.0032939895,0.000041260755,0.000033220127,0.0018046198,0.0010120099,0.16024224,0.008491681,0.7948625,0.02977381,0.00007631362],"about_ca_topic_score_codex":0.0011961557,"about_ca_topic_score_gemma":0.0009839573,"teacher_disagreement_score":0.008501779,"about_ca_system_score_codex":0.001240725,"about_ca_system_score_gemma":0.00037932853,"threshold_uncertainty_score":0.02844125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3997913,0.0007959293,0.59017,0.00029229032,0.000051010986,0.00003428892,0.000022192049,0.00017696986,0.008665932],"genre_scores_gemma":[0.96999884,0.00029527635,0.028730726,0.00003430877,0.000016916116,0.000018284054,0.00000736833,0.000013654689,0.0008847024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929476,0.0003645183,0.000018691824,0.000030554056,0.00021282631,0.00007859127],"domain_scores_gemma":[0.9980281,0.0014257797,0.00015909444,0.00014114841,0.00019946753,0.000046372876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009093341,0.00050035946,0.00043821768,0.00044726089,0.00038528192,0.00071820733,0.00056722836,0.0007175222,0.00047631763],"category_scores_gemma":[0.003858357,0.00024461478,0.0003372689,0.0005044929,0.0011573711,0.0008987089,0.00056457944,0.00036086017,0.00011936205],"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.000099324316,0.000029837274,0.00080032,0.000043327364,0.000027927863,0.00021337521,0.000094249095,0.90315,0.00991638,0.07579496,0.00016189444,0.009668413],"study_design_scores_gemma":[0.000009012163,0.00003193225,0.000120813806,0.0000052784803,0.000008764744,0.000045887333,0.000009704779,0.9849926,0.0048298915,0.009713543,0.00022414529,0.0000084877765],"about_ca_topic_score_codex":0.0014233752,"about_ca_topic_score_gemma":0.0015434839,"teacher_disagreement_score":0.0014233752,"about_ca_system_score_codex":0.0006622943,"about_ca_system_score_gemma":0.0007447678,"threshold_uncertainty_score":0.004809022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34098944,0.0021397772,0.5634026,0.0016756825,0.00052747456,0.0002691711,0.0014250168,0.00095955096,0.088611364],"genre_scores_gemma":[0.7404122,0.0021568232,0.21587935,0.0008675003,0.00061313243,0.0005769583,0.0015185481,0.0005574697,0.03741806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724567,0.0006217301,0.00021289669,0.0005361361,0.00090727484,0.00047630077],"domain_scores_gemma":[0.9876364,0.00709515,0.0009237754,0.0025815433,0.00092248654,0.00084075105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026417107,0.0015327119,0.0014603859,0.0015121828,0.0015824399,0.003528639,0.0024863086,0.0021593918,0.015152864],"category_scores_gemma":[0.011851949,0.001084405,0.0013039756,0.0012968632,0.002348166,0.0059465016,0.0034113196,0.0037668291,0.0025712654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024787735,0.00036420877,0.0049209427,0.00079178315,0.00017175857,0.0009880046,0.000577107,0.053119272,0.07368058,0.73181003,0.01391629,0.11718126],"study_design_scores_gemma":[0.00019286002,0.0005984673,0.0013686036,0.00021158073,0.00018640532,0.0015728271,0.0001659994,0.18758987,0.028879032,0.7625309,0.016588453,0.00011486869],"about_ca_topic_score_codex":0.00030636808,"about_ca_topic_score_gemma":0.00080941763,"teacher_disagreement_score":0.015152864,"about_ca_system_score_codex":0.0013621398,"about_ca_system_score_gemma":0.0012847737,"threshold_uncertainty_score":0.050691426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03538343,0.00088276353,0.6643209,0.0011527882,0.0010432756,0.00019915307,0.0003905592,0.0009648565,0.29566225],"genre_scores_gemma":[0.3865388,0.0014615613,0.45547718,0.00103164,0.0005075151,0.00036619316,0.0005351246,0.001026783,0.1530553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976474,0.000051585524,0.000012246853,0.00006646866,0.000077211254,0.00002770612],"domain_scores_gemma":[0.99974316,0.000055503788,0.000022509956,0.00006108777,0.000080708945,0.000037018406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023814039,0.00062366406,0.0003867069,0.001158558,0.0009785468,0.0019194813,0.0008552982,0.0010275161,0.023031369],"category_scores_gemma":[0.0009388716,0.00044335198,0.00042672295,0.00079156505,0.0013708345,0.0018999008,0.0011601814,0.0019519466,0.0068045696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018030598,0.000013256062,0.000051223462,0.000040956344,0.0000037175398,0.000097913166,0.00014859265,0.0004318344,0.0034408113,0.96692765,0.0040027034,0.024823263],"study_design_scores_gemma":[0.000025230616,0.000052007887,0.0001411949,0.00004387312,0.000008536608,0.00051335816,0.00013506658,0.004440019,0.004284581,0.8897354,0.10059476,0.000026005097],"about_ca_topic_score_codex":0.00021618347,"about_ca_topic_score_gemma":0.00024765305,"teacher_disagreement_score":0.023031369,"about_ca_system_score_codex":0.00044784552,"about_ca_system_score_gemma":0.00023190808,"threshold_uncertainty_score":0.077047646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6526202,0.001772714,0.20759052,0.0023402157,0.00026771126,0.000090470385,0.00051944616,0.00024258325,0.13455616],"genre_scores_gemma":[0.9591248,0.0009890124,0.023472458,0.00029014892,0.00017044845,0.00008563578,0.0003415117,0.00008228054,0.0154436575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940383,0.00015114684,0.000027497732,0.00014696532,0.00013086497,0.00013976252],"domain_scores_gemma":[0.9953034,0.0028822129,0.00045399804,0.00047270767,0.00044173872,0.00044605692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073179026,0.0005109347,0.00063342147,0.0017128052,0.0014523158,0.0023805492,0.001149439,0.0013534216,0.010867121],"category_scores_gemma":[0.0061414526,0.0006741153,0.00049052696,0.0011450028,0.002107272,0.005108538,0.0029666966,0.002387299,0.0007777761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009436901,0.000030067602,0.00044379375,0.00008037872,0.000012831914,0.00009989813,0.0002143279,0.0059913476,0.001400167,0.9818649,0.00136999,0.008397865],"study_design_scores_gemma":[0.000017990766,0.000019216934,0.00016281297,0.000023814191,0.000007881229,0.000078477,0.00009614277,0.015777728,0.0005493337,0.9807982,0.0024589617,0.000009443893],"about_ca_topic_score_codex":0.0005962396,"about_ca_topic_score_gemma":0.00075872213,"teacher_disagreement_score":0.010867121,"about_ca_system_score_codex":0.00080998667,"about_ca_system_score_gemma":0.00064874074,"threshold_uncertainty_score":0.036354125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06715035,0.004645158,0.58360106,0.0028559207,0.001576717,0.00016479088,0.0011927125,0.0008581885,0.33795506],"genre_scores_gemma":[0.5550264,0.0040419013,0.3451599,0.0020126638,0.0008095275,0.0002417841,0.0011942815,0.0005654092,0.09094813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993337,0.0001364992,0.000038962044,0.00011513749,0.00025618752,0.00011959943],"domain_scores_gemma":[0.9988097,0.00044957252,0.00010421882,0.0002579478,0.00024848196,0.00013009463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054046215,0.0009546921,0.0005409355,0.0011634756,0.0006485157,0.0018834854,0.0007620503,0.001004455,0.016332122],"category_scores_gemma":[0.0027934944,0.00049857225,0.00052431115,0.0009836325,0.0010376534,0.0013824116,0.00094541773,0.001500352,0.004033449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016095993,0.000073282215,0.00022632736,0.0001916382,0.000020976811,0.00007777659,0.00008295833,0.010324598,0.0091246255,0.90064865,0.018485133,0.060583156],"study_design_scores_gemma":[0.000056851553,0.000101897196,0.00027650048,0.00009006523,0.00001986771,0.0003846514,0.00009550964,0.0414816,0.008936494,0.90980506,0.03870359,0.0000478404],"about_ca_topic_score_codex":0.0006909467,"about_ca_topic_score_gemma":0.0011360917,"teacher_disagreement_score":0.016332122,"about_ca_system_score_codex":0.0008138923,"about_ca_system_score_gemma":0.0010531468,"threshold_uncertainty_score":0.05463636},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069445395,0.101809345,0.0120646395,0.26524526,0.06020591,0.000052184925,0.00029402337,0.00030781957,0.55307627],"genre_scores_gemma":[0.19184648,0.054224245,0.0065785744,0.06412732,0.021635043,0.00009646583,0.0001842928,0.00036741694,0.6609401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984736,0.0003114707,0.000055980123,0.00030444443,0.000530066,0.00032455512],"domain_scores_gemma":[0.9983681,0.000665498,0.00007496215,0.00020839866,0.00039645564,0.00028665178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017028775,0.00035153862,0.00037705534,0.0007031373,0.0028172866,0.0026610317,0.0010208727,0.002478026,0.01589188],"category_scores_gemma":[0.0032107686,0.00018915134,0.0004135445,0.00066226616,0.0039522075,0.003712094,0.0015854337,0.0048016566,0.0049401084],"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.000031938074,0.0000095625355,0.00015524954,0.00010253141,0.0000067126057,0.00017254926,0.00031064494,0.00017767954,0.000499597,0.7235526,0.22146904,0.053511925],"study_design_scores_gemma":[0.0000018765638,0.0000055101755,0.00010907615,0.00003649964,0.000001550255,0.00006487279,0.00006962967,0.0000491296,0.00017581155,0.034617197,0.96486306,0.0000059390295],"about_ca_topic_score_codex":0.013061186,"about_ca_topic_score_gemma":0.022602892,"teacher_disagreement_score":0.01589188,"about_ca_system_score_codex":0.004096817,"about_ca_system_score_gemma":0.0023754002,"threshold_uncertainty_score":0.053163648},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14258775,0.0029704268,0.7716571,0.0033508097,0.00051474693,0.000112085094,0.00029684487,0.00052243477,0.07798781],"genre_scores_gemma":[0.8356058,0.004093147,0.12452819,0.0014531497,0.0014069648,0.00056881795,0.00070721103,0.00036821177,0.031268556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964445,0.0012060215,0.00019184231,0.0008041573,0.00091259717,0.00044082908],"domain_scores_gemma":[0.9665772,0.025274325,0.0021231037,0.0019107751,0.0029390187,0.0011755738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040643355,0.0016275559,0.0011971074,0.0024220773,0.0020647105,0.002390383,0.0018215576,0.002149918,0.008445379],"category_scores_gemma":[0.041430995,0.0012513328,0.0019810419,0.0016913555,0.0047500166,0.0073638908,0.0043710475,0.005921451,0.0016833111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011378362,0.00009145501,0.001270801,0.00027692525,0.00005069358,0.00032312056,0.00049742055,0.0097494945,0.005406539,0.9607713,0.0037921818,0.017656209],"study_design_scores_gemma":[0.00003528851,0.00014417077,0.0005750355,0.0001131959,0.000046751014,0.0006741369,0.00024801056,0.08781356,0.0036141842,0.90064096,0.0060180305,0.000076634264],"about_ca_topic_score_codex":0.0004815501,"about_ca_topic_score_gemma":0.00039865574,"teacher_disagreement_score":0.008445379,"about_ca_system_score_codex":0.0014157845,"about_ca_system_score_gemma":0.0010626748,"threshold_uncertainty_score":0.028252602},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23200311,0.0012551436,0.6308284,0.0007171022,0.00043846498,0.00018140662,0.0007969091,0.00052240054,0.13325712],"genre_scores_gemma":[0.66444343,0.0010490206,0.2780674,0.00028957715,0.00038486382,0.0002948659,0.0014516874,0.0002847073,0.053734444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921143,0.000113370465,0.000069747206,0.00019982271,0.00023210543,0.00017340413],"domain_scores_gemma":[0.9989767,0.0003981844,0.00014891138,0.00015515731,0.0001990305,0.00012211593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072585535,0.0006531199,0.000575226,0.0009772843,0.0009268284,0.0015422631,0.00057483604,0.0005292166,0.010954834],"category_scores_gemma":[0.002203026,0.00033439143,0.0009828667,0.0006855841,0.0013934943,0.0023368627,0.0008670498,0.0013894526,0.0027624143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014975973,0.000027790986,0.0005839051,0.00012538336,0.00001239457,0.00015828402,0.00033152846,0.0034534202,0.008866952,0.93788964,0.0038535167,0.04454731],"study_design_scores_gemma":[0.000023259267,0.00015498986,0.00065189286,0.00006547093,0.000025053845,0.00054545095,0.00020658683,0.016261801,0.008530953,0.9367964,0.03670767,0.000030478066],"about_ca_topic_score_codex":0.00065560633,"about_ca_topic_score_gemma":0.0011848706,"teacher_disagreement_score":0.010954834,"about_ca_system_score_codex":0.0007421227,"about_ca_system_score_gemma":0.0005454087,"threshold_uncertainty_score":0.03664756},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7599423,0.0005296677,0.15953083,0.00057852676,0.00016822085,0.00012439294,0.00043837918,0.00028139283,0.078406274],"genre_scores_gemma":[0.98110354,0.00009606491,0.013993595,0.00010274454,0.000021933545,0.000043086475,0.00018202711,0.00002758744,0.004429435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958736,0.0000818731,0.000022691016,0.0000768864,0.00012676678,0.00010444848],"domain_scores_gemma":[0.9989165,0.00041724608,0.000111756126,0.0001910904,0.00016235148,0.00020116947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002676767,0.0002320158,0.00049269915,0.0005243179,0.000821811,0.0014897018,0.0005989344,0.0006615524,0.013163022],"category_scores_gemma":[0.00223242,0.0002595039,0.0002851507,0.0003455901,0.0013651722,0.0019490847,0.0016767516,0.0009445196,0.0007234118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012554586,0.000038139504,0.0009974352,0.00010941421,0.00001409041,0.00015917669,0.00020733132,0.013003108,0.009507387,0.9662202,0.0011136953,0.008504463],"study_design_scores_gemma":[0.00009874506,0.00012778073,0.00096488785,0.00004017135,0.000016447453,0.00032487622,0.00045375433,0.08987191,0.006381733,0.8910842,0.010603428,0.000032049822],"about_ca_topic_score_codex":0.00080816675,"about_ca_topic_score_gemma":0.0012832681,"teacher_disagreement_score":0.013163022,"about_ca_system_score_codex":0.0004763519,"about_ca_system_score_gemma":0.00027664992,"threshold_uncertainty_score":0.04403472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046478407,0.00012774888,0.9909609,0.00020282491,0.000034773122,0.00010137701,0.00006605226,0.00042601733,0.0034324229],"genre_scores_gemma":[0.10125816,0.00028227718,0.89495045,0.00016243798,0.00009795325,0.00041627747,0.00036113686,0.00017900653,0.0022922999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701846,0.0014033092,0.00012281416,0.00044570476,0.00068793277,0.00032187335],"domain_scores_gemma":[0.99066436,0.006411899,0.00054978876,0.0012348825,0.00083610974,0.00030298598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032173053,0.0017641388,0.0011963847,0.0017179144,0.0010953638,0.002525624,0.0034031055,0.0018245251,0.0041595986],"category_scores_gemma":[0.012012974,0.00071898324,0.0014580812,0.0027358243,0.002122853,0.00282487,0.0029662468,0.0026700497,0.0010207769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019361309,0.000308644,0.00068638,0.0002806321,0.0000686233,0.00014435878,0.00032531287,0.44516876,0.0019255328,0.34458986,0.008315849,0.19799238],"study_design_scores_gemma":[0.00011742207,0.00006865884,0.00010118274,0.000029464398,0.00003068614,0.00009340274,0.00008803679,0.8442116,0.0017977649,0.1480609,0.0053808214,0.000020050209],"about_ca_topic_score_codex":0.0025455046,"about_ca_topic_score_gemma":0.003446258,"teacher_disagreement_score":0.0041595986,"about_ca_system_score_codex":0.0021888523,"about_ca_system_score_gemma":0.0026952839,"threshold_uncertainty_score":0.01701498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5633338,0.0007550783,0.35646972,0.0008302998,0.00012493563,0.0001423359,0.0013158228,0.00091128045,0.07611672],"genre_scores_gemma":[0.9390022,0.00047008655,0.040902756,0.00029025425,0.000091888556,0.0002192873,0.0010178924,0.0002045238,0.01780098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975668,0.0007361061,0.000107902386,0.000455009,0.00054600945,0.000588224],"domain_scores_gemma":[0.9945803,0.0028505553,0.0005470055,0.00085480296,0.0005975462,0.00056970754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010437529,0.0010878656,0.0012588815,0.0021411781,0.0019424177,0.002748282,0.0011786518,0.0014087342,0.011658356],"category_scores_gemma":[0.006099536,0.0010983151,0.00072406844,0.0023266366,0.0012096092,0.003003546,0.0025245983,0.0014781675,0.0020776698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055294303,0.00009968249,0.00170156,0.0001774548,0.000053635256,0.0006144391,0.00044870618,0.01372423,0.012370757,0.9317608,0.004637501,0.033858392],"study_design_scores_gemma":[0.00009505781,0.0001375543,0.00082566513,0.00008304986,0.00006178289,0.0005249398,0.000271026,0.05207719,0.005811297,0.9308794,0.009194229,0.000038781585],"about_ca_topic_score_codex":0.0013082518,"about_ca_topic_score_gemma":0.0013809227,"teacher_disagreement_score":0.011658356,"about_ca_system_score_codex":0.0010464775,"about_ca_system_score_gemma":0.000655483,"threshold_uncertainty_score":0.039001048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64444906,0.00054825295,0.2599399,0.0011101721,0.0008723839,0.00018244945,0.0006851793,0.00095423893,0.09125832],"genre_scores_gemma":[0.93906325,0.00033131518,0.038834155,0.00047721475,0.000376211,0.00021358905,0.000580999,0.0005346527,0.019588524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951851,0.0010640939,0.00044474943,0.0009978482,0.00094870373,0.0013595191],"domain_scores_gemma":[0.98958325,0.0037341348,0.0017475244,0.0019742704,0.0016290474,0.0013317966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002346175,0.00079355744,0.0009726857,0.0015031077,0.0019449523,0.0040769493,0.0010220731,0.001188009,0.0164458],"category_scores_gemma":[0.012233828,0.00083447143,0.0013513055,0.001019531,0.0043363147,0.005812234,0.004824687,0.0029212476,0.002458021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007881691,0.00009512398,0.0042542685,0.00015221529,0.000027446802,0.001008295,0.0013320239,0.0021024246,0.022579862,0.93249536,0.0026136404,0.032551177],"study_design_scores_gemma":[0.00014562822,0.00074718776,0.0024121704,0.00010287201,0.00004562333,0.0020316956,0.0011937898,0.014603838,0.023796842,0.9328576,0.021956423,0.00010633325],"about_ca_topic_score_codex":0.0007357155,"about_ca_topic_score_gemma":0.00050065597,"teacher_disagreement_score":0.0164458,"about_ca_system_score_codex":0.0010012863,"about_ca_system_score_gemma":0.0010212633,"threshold_uncertainty_score":0.055016637},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015463329,0.00006242535,0.98140544,0.000058656846,0.000008660123,0.00002148411,0.000014109308,0.00015199563,0.002813863],"genre_scores_gemma":[0.6394511,0.00037349763,0.35227108,0.00009273173,0.000025427622,0.00019259372,0.0000724342,0.00012960254,0.0073914463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997199,0.00007687217,0.000008961663,0.00005146872,0.000100889425,0.00004183224],"domain_scores_gemma":[0.9997327,0.00013622007,0.000044680153,0.000018913734,0.00005950055,0.0000080753025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044131564,0.000599549,0.00044348955,0.00023646995,0.0002612972,0.00092555024,0.0005383157,0.0007696291,0.0018690588],"category_scores_gemma":[0.00095571275,0.0003391532,0.0004840423,0.0002265419,0.00047099407,0.0006758989,0.00032960426,0.0006489491,0.0004111416],"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.00006046196,0.000041949326,0.0003642569,0.00007897308,0.000022832046,0.0000665393,0.00010615705,0.88537157,0.04087717,0.0252729,0.0005410678,0.04719613],"study_design_scores_gemma":[0.000009155007,0.000049273032,0.000077362274,0.000007910594,0.000008414248,0.000019132312,0.00001410232,0.98821694,0.0071580997,0.002894069,0.0015408746,0.00000470597],"about_ca_topic_score_codex":0.0021744997,"about_ca_topic_score_gemma":0.0024032989,"teacher_disagreement_score":0.0021744997,"about_ca_system_score_codex":0.000885302,"about_ca_system_score_gemma":0.0007132663,"threshold_uncertainty_score":0.0064234138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3713729,0.0016367603,0.54484594,0.0010084797,0.00019032192,0.00014298347,0.0004374923,0.0005529382,0.079812124],"genre_scores_gemma":[0.79308915,0.0010564389,0.18610509,0.00020186676,0.00022852261,0.00014594792,0.00048998144,0.00010663287,0.018576415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941266,0.00010442485,0.00003732242,0.0001015453,0.00020305139,0.00014106897],"domain_scores_gemma":[0.99884975,0.0005979798,0.00015196396,0.00016381576,0.0001532473,0.00008329003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007112642,0.0004745283,0.00057592767,0.0016491251,0.0013044061,0.0014930612,0.00062793604,0.0007101849,0.005306612],"category_scores_gemma":[0.0034520237,0.00027308357,0.0006776426,0.0014705369,0.0027969596,0.0043438375,0.0011683105,0.0014950607,0.0008238923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000282452,0.000011695319,0.00035063646,0.00004685142,0.0000024661792,0.000060253326,0.00017393094,0.00175322,0.0010467333,0.98132575,0.00067556533,0.014524659],"study_design_scores_gemma":[0.0000039527195,0.000024829162,0.00013547429,0.000017305354,0.000003826506,0.00010024777,0.00009861652,0.007718216,0.0013632482,0.9869294,0.0035949703,0.000009884443],"about_ca_topic_score_codex":0.001039725,"about_ca_topic_score_gemma":0.0015838728,"teacher_disagreement_score":0.005306612,"about_ca_system_score_codex":0.0010580613,"about_ca_system_score_gemma":0.0006705342,"threshold_uncertainty_score":0.01775235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70853716,0.0007497226,0.1793412,0.0010536702,0.00035527916,0.00009138884,0.00020860543,0.00031294723,0.109350085],"genre_scores_gemma":[0.9641247,0.00039070772,0.025647026,0.00014040241,0.000119583055,0.00003066394,0.00015352455,0.000041986492,0.009351448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998491,0.000024475725,0.000010297116,0.000031885185,0.00003958639,0.0000447518],"domain_scores_gemma":[0.9996749,0.000096517906,0.000050273706,0.00004343604,0.00005446843,0.000080371334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018360767,0.00021321034,0.00018834975,0.0009098489,0.0008545243,0.0013282652,0.000246633,0.00032413844,0.004102757],"category_scores_gemma":[0.00050343276,0.00017848561,0.00035576947,0.0006073247,0.0012449619,0.0012768741,0.0013312883,0.00091043505,0.00040388718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032061875,0.00003173074,0.000724064,0.00003101977,0.000004130848,0.0003248679,0.000445407,0.0009937364,0.0050477604,0.9730381,0.0010684967,0.01825857],"study_design_scores_gemma":[0.000012524742,0.000045864177,0.0006157632,0.000016208607,0.000006854201,0.0003370635,0.00040525847,0.008070844,0.0044679237,0.97698236,0.009026212,0.000013094497],"about_ca_topic_score_codex":0.0008195114,"about_ca_topic_score_gemma":0.000817327,"teacher_disagreement_score":0.004102757,"about_ca_system_score_codex":0.00049211434,"about_ca_system_score_gemma":0.00037975906,"threshold_uncertainty_score":0.013725102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7394291,0.00041351645,0.10239957,0.0028292262,0.00033794125,0.00020709615,0.0012525615,0.000895237,0.1522357],"genre_scores_gemma":[0.96691227,0.00019529702,0.011775071,0.00037420346,0.00016218479,0.00007069993,0.0003326018,0.00016508276,0.02001259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922526,0.00013397977,0.000028936582,0.00016386845,0.00016846147,0.00027946002],"domain_scores_gemma":[0.9989373,0.0002646083,0.00022347739,0.00019389183,0.00011367352,0.00026699467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087146537,0.00076979236,0.0005424481,0.0010926058,0.0015215563,0.0022497175,0.0008598209,0.0009799915,0.011302058],"category_scores_gemma":[0.0016597457,0.0002854439,0.00074509863,0.0009895891,0.0021234036,0.002824961,0.002634861,0.0026013867,0.0017104074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041169132,0.0001059581,0.0006836482,0.00013354309,0.000014151477,0.0004512987,0.000594101,0.0038138204,0.008092223,0.96735215,0.004964347,0.0133829815],"study_design_scores_gemma":[0.00018182043,0.00016714435,0.0013327976,0.00008730215,0.000029871744,0.000842519,0.00039362605,0.013529277,0.011039126,0.9404141,0.0318945,0.000088064444],"about_ca_topic_score_codex":0.0010383085,"about_ca_topic_score_gemma":0.001195212,"teacher_disagreement_score":0.011302058,"about_ca_system_score_codex":0.0020322923,"about_ca_system_score_gemma":0.00097138825,"threshold_uncertainty_score":0.037809134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49070123,0.0004713616,0.43455282,0.00044490083,0.00014837376,0.00018999324,0.0009612318,0.0002926635,0.07223746],"genre_scores_gemma":[0.90801555,0.00044083194,0.077768415,0.00019134454,0.00006333397,0.00009227333,0.0009912908,0.000062491075,0.012374538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967694,0.00006577301,0.000024262186,0.00010308867,0.000067189605,0.00006266362],"domain_scores_gemma":[0.9991285,0.00027789455,0.00017134567,0.00015216097,0.00011445332,0.0001556304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038032318,0.00031216966,0.00042320948,0.0011536843,0.0009854645,0.0014899905,0.0004240753,0.0003536304,0.0045804903],"category_scores_gemma":[0.0010137487,0.0003078678,0.0006012382,0.0008490066,0.0010786072,0.0019366726,0.000671132,0.0009256014,0.0004857021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003720784,0.000025582793,0.0007100377,0.00006188796,0.000014289301,0.00039168037,0.00041493916,0.002183775,0.0032043857,0.98354185,0.00075909274,0.008655118],"study_design_scores_gemma":[0.000030266516,0.000074194606,0.0011581134,0.00004438503,0.000038600945,0.0009953425,0.0005301931,0.018608926,0.0026815853,0.9589738,0.016843487,0.000021064367],"about_ca_topic_score_codex":0.0009681032,"about_ca_topic_score_gemma":0.0016155766,"teacher_disagreement_score":0.0045804903,"about_ca_system_score_codex":0.0006243745,"about_ca_system_score_gemma":0.00039881314,"threshold_uncertainty_score":0.015323281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48213932,0.00051394495,0.4696997,0.00039207644,0.000059946342,0.00022998922,0.0017795517,0.0006592215,0.044526298],"genre_scores_gemma":[0.8406243,0.0004229117,0.13900325,0.00027652836,0.000065171356,0.00025340845,0.003313338,0.00020424546,0.015836965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948466,0.00011690785,0.000031581185,0.00013912033,0.000111079404,0.000116678195],"domain_scores_gemma":[0.99891984,0.0003343571,0.00022901704,0.00021839312,0.0001338095,0.0001645877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037531604,0.0004856525,0.00038446614,0.00096269115,0.00046227494,0.0009973604,0.00046322422,0.00036298798,0.004630815],"category_scores_gemma":[0.0015073668,0.0005540169,0.00066225894,0.0006254587,0.0006317337,0.0015083825,0.0008015671,0.00072680606,0.0007440733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000540018,0.000191647,0.0042946385,0.0003678312,0.00009902233,0.0008474431,0.00085604755,0.053527348,0.03975427,0.8352239,0.0089871995,0.05531075],"study_design_scores_gemma":[0.00008450688,0.00011694726,0.004043656,0.000067436406,0.00006627899,0.0008462967,0.00044215732,0.13533603,0.010881858,0.83245945,0.015617754,0.000037698133],"about_ca_topic_score_codex":0.0009208662,"about_ca_topic_score_gemma":0.0020568878,"teacher_disagreement_score":0.004630815,"about_ca_system_score_codex":0.00050882366,"about_ca_system_score_gemma":0.00041104716,"threshold_uncertainty_score":0.015491605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4911156,0.0021165104,0.23802152,0.0059025744,0.00630001,0.00022377956,0.00088278344,0.0008840669,0.25455314],"genre_scores_gemma":[0.8459497,0.00075363397,0.09528381,0.0013072474,0.00085415394,0.000347012,0.00033104757,0.0003079121,0.054865547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992167,0.00021030751,0.000053747277,0.00017890899,0.00017449711,0.00016589559],"domain_scores_gemma":[0.99753076,0.0009629626,0.0005118656,0.00035604174,0.0002459894,0.000392441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010451135,0.0007270142,0.0004509995,0.0034800477,0.0023120202,0.0037856824,0.001001128,0.0020906257,0.016275605],"category_scores_gemma":[0.005313984,0.00036223506,0.00031663728,0.0021982715,0.0030854575,0.0051282956,0.0013203808,0.0027990097,0.0016981411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015329992,0.00003732941,0.0002970309,0.000053398224,0.0000045127836,0.00015322948,0.00022925074,0.00048318188,0.0030528356,0.9757376,0.0034182263,0.016380243],"study_design_scores_gemma":[0.00009911917,0.00009419033,0.00059115596,0.000111908834,0.000027123115,0.0007123953,0.0004418032,0.0069192573,0.01142896,0.9072315,0.072240606,0.00010198447],"about_ca_topic_score_codex":0.00028564862,"about_ca_topic_score_gemma":0.00054387335,"teacher_disagreement_score":0.016275605,"about_ca_system_score_codex":0.00093333557,"about_ca_system_score_gemma":0.0007634316,"threshold_uncertainty_score":0.054447353},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13597615,0.0024064884,0.3083326,0.011244243,0.002960956,0.00008561835,0.00019104702,0.00052575645,0.53827715],"genre_scores_gemma":[0.9121799,0.0009356567,0.03354586,0.0029865555,0.0013519091,0.00007988508,0.000081865175,0.0002269914,0.048611395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833566,0.00040980297,0.00006614901,0.0001975127,0.00074658473,0.00024432168],"domain_scores_gemma":[0.9981096,0.0007010311,0.00016070546,0.00037923994,0.0003612919,0.0002881407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018683323,0.0007704874,0.0009854161,0.0016031213,0.0024029799,0.0034937582,0.001838639,0.0022552526,0.01911109],"category_scores_gemma":[0.005492946,0.00040816684,0.0012081751,0.0013141338,0.005893379,0.005897758,0.0033278246,0.004468448,0.0030712322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059132544,0.0000057602383,0.000024156778,0.0000097645025,0.000001574248,0.00014880352,0.000042605607,0.0002092916,0.0001953478,0.997177,0.0008034528,0.0013763475],"study_design_scores_gemma":[0.0000057693246,0.000011770421,0.000045984238,0.00001190274,0.000002631345,0.00041451148,0.000027899045,0.004933474,0.00046734116,0.99033993,0.00372858,0.000010250603],"about_ca_topic_score_codex":0.0014568898,"about_ca_topic_score_gemma":0.0010614212,"teacher_disagreement_score":0.01911109,"about_ca_system_score_codex":0.0017125575,"about_ca_system_score_gemma":0.0011884879,"threshold_uncertainty_score":0.063933015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21665,0.010072021,0.14936644,0.0031406179,0.0031089953,0.00022377669,0.001135243,0.0014106139,0.61489236],"genre_scores_gemma":[0.7456833,0.0038243842,0.056059178,0.0010750092,0.0014136547,0.0002748016,0.00079310255,0.0006621035,0.1902144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996654,0.000066033004,0.00001529444,0.00006095453,0.00011782844,0.000074518284],"domain_scores_gemma":[0.99946934,0.00017009003,0.0000685881,0.00012615415,0.00010218319,0.00006357243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028102082,0.0007375628,0.00069396646,0.001983894,0.0014737304,0.0017205643,0.0005690153,0.0012757331,0.02174769],"category_scores_gemma":[0.0018285016,0.0004358183,0.00033047897,0.0018274531,0.0011902824,0.0018169968,0.0012227888,0.0014084493,0.0059575015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022429049,0.00003892625,0.00021367581,0.00018610743,0.000015595355,0.00035494185,0.00030560352,0.0015971562,0.0071723787,0.8775481,0.018306904,0.094036356],"study_design_scores_gemma":[0.000036127407,0.00011818673,0.00044048263,0.000090053996,0.000014731915,0.0011999349,0.0001833613,0.004414036,0.004960186,0.91798043,0.07051818,0.00004438732],"about_ca_topic_score_codex":0.00018083195,"about_ca_topic_score_gemma":0.0001960568,"teacher_disagreement_score":0.02174769,"about_ca_system_score_codex":0.00047525275,"about_ca_system_score_gemma":0.00048915885,"threshold_uncertainty_score":0.07275325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9554805,0.00069887505,0.02609841,0.00075149006,0.00008437538,0.000035657853,0.00042891424,0.00027490305,0.01614682],"genre_scores_gemma":[0.98921657,0.00022220571,0.0073466166,0.0000855906,0.00005933659,0.000053406577,0.00027052377,0.000053760195,0.0026919413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903715,0.00019693989,0.000049731556,0.00018135583,0.0002762955,0.0002584643],"domain_scores_gemma":[0.993507,0.0038686881,0.00063796446,0.0005395178,0.0006199341,0.00082682166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071567803,0.00050623814,0.00055174564,0.0017792926,0.0015228571,0.0018862311,0.0009589444,0.0011707201,0.004117603],"category_scores_gemma":[0.0069529717,0.00049994374,0.00033312663,0.0008287371,0.0022769514,0.0034476141,0.0011509121,0.0010565595,0.00058532454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043040235,0.00024142544,0.014634773,0.0007778036,0.00012225457,0.0014206679,0.0014747757,0.05035596,0.19375558,0.67493254,0.007856167,0.050124057],"study_design_scores_gemma":[0.0002626866,0.00053373293,0.012294142,0.00018306592,0.00009190756,0.0019171856,0.00056037353,0.2112636,0.08276591,0.6803143,0.009541147,0.00027191784],"about_ca_topic_score_codex":0.00055960583,"about_ca_topic_score_gemma":0.00085785403,"teacher_disagreement_score":0.004117603,"about_ca_system_score_codex":0.00095255557,"about_ca_system_score_gemma":0.0005563261,"threshold_uncertainty_score":0.013774753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6676427,0.012999688,0.26897976,0.002107485,0.0002706401,0.00013066572,0.00007133541,0.00035982937,0.04743793],"genre_scores_gemma":[0.92997193,0.0059363944,0.05801976,0.00017367434,0.00009425946,0.000048419057,0.000051560943,0.00001452548,0.00568956],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960405,0.0000745979,0.000008660834,0.000052918716,0.00021831022,0.00004148745],"domain_scores_gemma":[0.9995735,0.00016120616,0.000052842264,0.000045760044,0.00014196942,0.000024838293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042418347,0.00023592246,0.00021751475,0.0003359583,0.00025524237,0.00060269376,0.00032249524,0.000402289,0.0007805582],"category_scores_gemma":[0.00082050887,0.0001331573,0.00014264905,0.00039709496,0.00057873456,0.0010031244,0.00024146544,0.00036724983,0.00018460264],"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.00017777333,0.00031066313,0.0057941214,0.0007138887,0.000053526383,0.0004314908,0.00055832235,0.02388339,0.54232395,0.26883078,0.0013207548,0.1556014],"study_design_scores_gemma":[0.0001057287,0.0014813865,0.0075866333,0.0001361664,0.000114525676,0.0020305119,0.00038061006,0.25056398,0.6182206,0.053214308,0.066075,0.00009046026],"about_ca_topic_score_codex":0.0007596344,"about_ca_topic_score_gemma":0.00048573353,"teacher_disagreement_score":0.0007805582,"about_ca_system_score_codex":0.0005301145,"about_ca_system_score_gemma":0.00059362303,"threshold_uncertainty_score":0.0038462281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24253476,0.0021854849,0.50992507,0.0021237119,0.0005801732,0.00022622703,0.0027385468,0.0008061793,0.23887986],"genre_scores_gemma":[0.8398796,0.001293831,0.0980435,0.0006658849,0.00032236116,0.00021862256,0.0023224885,0.00031883596,0.056935005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937457,0.00016145098,0.000024308732,0.00011917098,0.0001708363,0.00014963749],"domain_scores_gemma":[0.99834096,0.000626553,0.00021476627,0.0003083893,0.00027828733,0.00023096851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004324548,0.00046757047,0.0005767233,0.0013231334,0.0015541695,0.0024064516,0.0005932607,0.00079355476,0.018254174],"category_scores_gemma":[0.0024580504,0.0004546302,0.0007028131,0.0010896568,0.0011786693,0.003274061,0.0015611828,0.0014998856,0.002641051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055375374,0.000028746399,0.00025242957,0.00005950715,0.000014348212,0.000121655685,0.0001562373,0.0051637148,0.001691573,0.9734935,0.0079789385,0.01098397],"study_design_scores_gemma":[0.000011972212,0.000013176645,0.00023244479,0.000029846542,0.00000825072,0.00015543046,0.00013065833,0.01732115,0.00085628725,0.9711483,0.0100809075,0.0000115298035],"about_ca_topic_score_codex":0.0018550563,"about_ca_topic_score_gemma":0.0034233301,"teacher_disagreement_score":0.018254174,"about_ca_system_score_codex":0.0009621942,"about_ca_system_score_gemma":0.0006524841,"threshold_uncertainty_score":0.06106627},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32300824,0.0019370974,0.46596053,0.0009662537,0.0003384493,0.00032983255,0.0038097596,0.000642816,0.2030071],"genre_scores_gemma":[0.8625559,0.00097208977,0.07431786,0.00027750037,0.00013646488,0.00019403156,0.0024681864,0.00018510224,0.05889282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997062,0.00007079741,0.00001882951,0.000060176335,0.00007209902,0.00007185041],"domain_scores_gemma":[0.99924505,0.00020686322,0.00013786738,0.00008863885,0.00018474735,0.00013691769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029588176,0.00047161404,0.00035828634,0.0018080239,0.00072974525,0.0014385688,0.0005366694,0.00045568298,0.013051215],"category_scores_gemma":[0.0012185937,0.00032677612,0.0004442419,0.0010353038,0.0006594581,0.0015430995,0.0006226989,0.00075169164,0.0012783568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041568837,0.000026589547,0.00026586617,0.000062708015,0.000013232722,0.000095864474,0.00012750171,0.0035631002,0.0017400515,0.97728217,0.0036814502,0.013099921],"study_design_scores_gemma":[0.000018298408,0.00002083849,0.00044757623,0.00003102617,0.00001925008,0.00014663365,0.000118844306,0.031814072,0.0010014917,0.95487183,0.01149495,0.00001518343],"about_ca_topic_score_codex":0.0026657423,"about_ca_topic_score_gemma":0.004631395,"teacher_disagreement_score":0.013051215,"about_ca_system_score_codex":0.001077845,"about_ca_system_score_gemma":0.0006841257,"threshold_uncertainty_score":0.04366064},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33818442,0.0057186666,0.25688896,0.0135247605,0.0018750007,0.00022024947,0.001204431,0.00064122875,0.38174236],"genre_scores_gemma":[0.89089274,0.0025501507,0.03431995,0.0014618582,0.0007699294,0.00019856758,0.0006937233,0.00034821074,0.06876481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831724,0.0005665287,0.00007867374,0.0003443683,0.00031054762,0.0003827849],"domain_scores_gemma":[0.99240017,0.0038440025,0.0007745553,0.0015222011,0.0007269529,0.00073213025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012617175,0.0006385938,0.0007283523,0.0022107225,0.004180507,0.0035147169,0.0015873157,0.0019812568,0.019612737],"category_scores_gemma":[0.014594911,0.00064180803,0.0008406682,0.0019364597,0.004695434,0.008952074,0.004323368,0.0037284405,0.0025137616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011675908,0.000029206338,0.0005620547,0.000074917036,0.000014663589,0.00025595335,0.0004808678,0.003160914,0.00050810934,0.9701184,0.008017609,0.016660525],"study_design_scores_gemma":[0.000011909029,0.000017206306,0.00028505723,0.000039872622,0.000012883831,0.00025856085,0.00030118183,0.007379575,0.00044106005,0.9799733,0.011263868,0.000015524098],"about_ca_topic_score_codex":0.0026743996,"about_ca_topic_score_gemma":0.0029691546,"teacher_disagreement_score":0.019612737,"about_ca_system_score_codex":0.0013572947,"about_ca_system_score_gemma":0.0009108945,"threshold_uncertainty_score":0.065611124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5063661,0.0024640844,0.28818896,0.0033992368,0.0007922547,0.00021066415,0.0015264687,0.0012965632,0.19575566],"genre_scores_gemma":[0.9204446,0.00057538314,0.064449996,0.00026022203,0.00012601614,0.00011473297,0.00026974632,0.00021628497,0.013543064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992206,0.00023954968,0.00002956807,0.00017341251,0.00015186823,0.00018501222],"domain_scores_gemma":[0.99554527,0.0027778845,0.00027523792,0.00050543994,0.00037114936,0.00052511715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010311311,0.0005627252,0.0005544928,0.0011922915,0.0011203447,0.0021383099,0.0010508442,0.0010320628,0.014801406],"category_scores_gemma":[0.012557957,0.00039238483,0.00023593911,0.00089859706,0.0012078551,0.0034112548,0.0010668646,0.0012544619,0.0016619712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011481688,0.0001801258,0.0015562185,0.00036499643,0.000038600327,0.00013940776,0.00016802127,0.08656463,0.019054543,0.71246004,0.025048366,0.15327685],"study_design_scores_gemma":[0.000109064,0.00023907775,0.0010464309,0.000100419864,0.00004226961,0.00027431425,0.0002084118,0.25577176,0.011242862,0.7180177,0.012896824,0.000050854702],"about_ca_topic_score_codex":0.0013597861,"about_ca_topic_score_gemma":0.0034990567,"teacher_disagreement_score":0.014801406,"about_ca_system_score_codex":0.0013993531,"about_ca_system_score_gemma":0.0017331409,"threshold_uncertainty_score":0.049515665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06288219,0.00046831073,0.8711167,0.00050303136,0.00029757156,0.00014055293,0.0005344048,0.00086832425,0.063188896],"genre_scores_gemma":[0.52045417,0.0005240288,0.45082894,0.0004140196,0.00020145247,0.00042901217,0.0010694842,0.00057540816,0.025503535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00021865677,0.00005503359,0.00019828924,0.00032192862,0.00009176644],"domain_scores_gemma":[0.997985,0.0009906426,0.00012518872,0.00045869595,0.00024139225,0.00019915611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009466625,0.0004939512,0.0006728676,0.0014053007,0.0017441339,0.0020906914,0.001329586,0.000890418,0.01263858],"category_scores_gemma":[0.0032745479,0.0006638308,0.0009792793,0.0011157108,0.0016446969,0.0037596386,0.0036687339,0.002268864,0.0028609354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055827455,0.000036638106,0.00021627753,0.00010731835,0.000015388228,0.00014428145,0.0002531617,0.002450317,0.0049634036,0.9611081,0.0037246873,0.026924582],"study_design_scores_gemma":[0.000024907105,0.00006084892,0.00014715214,0.000041631913,0.000026013482,0.00037926267,0.000096709984,0.01718833,0.005936025,0.9531305,0.022933384,0.000035292436],"about_ca_topic_score_codex":0.0003366067,"about_ca_topic_score_gemma":0.00063213776,"teacher_disagreement_score":0.01263858,"about_ca_system_score_codex":0.00063899835,"about_ca_system_score_gemma":0.000536929,"threshold_uncertainty_score":0.042280197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14307946,0.0012973008,0.77153695,0.0007193846,0.00021532476,0.00013440746,0.00022358354,0.0003077455,0.08248581],"genre_scores_gemma":[0.81325287,0.0009090574,0.16415413,0.00037207562,0.00012398305,0.00046133544,0.00036600753,0.000097519616,0.020263055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983455,0.00052964076,0.00012977463,0.0002689185,0.00054237724,0.00018390226],"domain_scores_gemma":[0.9920936,0.0056861383,0.00069717766,0.00073377124,0.0005079656,0.00028127883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019977193,0.00071143,0.00054669473,0.0015057091,0.0015819255,0.0021555463,0.00091890426,0.0014629727,0.0094286],"category_scores_gemma":[0.008104651,0.00092982023,0.0010030341,0.0010277315,0.001911459,0.0036325473,0.0020867358,0.002409259,0.001186844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009912831,0.000037844267,0.0006684078,0.00016532943,0.0000301395,0.0002061453,0.00030117275,0.007413118,0.0078057614,0.95939475,0.001821276,0.02205697],"study_design_scores_gemma":[0.000049121798,0.00036880234,0.00095374836,0.00018267262,0.000070705246,0.0018515495,0.00037605045,0.068560995,0.019957222,0.8877066,0.019852081,0.000070427646],"about_ca_topic_score_codex":0.00019611906,"about_ca_topic_score_gemma":0.00036280928,"teacher_disagreement_score":0.0094286,"about_ca_system_score_codex":0.0009779587,"about_ca_system_score_gemma":0.0005569904,"threshold_uncertainty_score":0.031541765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5624568,0.00086247304,0.03077742,0.004627468,0.0014315662,0.000090012254,0.0019348459,0.00066408765,0.39715526],"genre_scores_gemma":[0.9240524,0.00034237982,0.010191424,0.00065912725,0.00013355807,0.000080948295,0.0007316742,0.00023859786,0.06356985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965453,0.00006051108,0.000010614704,0.000061373205,0.00006737186,0.00014561192],"domain_scores_gemma":[0.99963295,0.00011940123,0.00005819057,0.000061392246,0.000041143132,0.0000869139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859489,0.00050473365,0.00040798556,0.0011308931,0.002084339,0.0017533612,0.0006111964,0.0010373396,0.031496987],"category_scores_gemma":[0.0010817864,0.00021551253,0.00035919383,0.00071334105,0.0014908222,0.0018670567,0.0010153957,0.0010798023,0.0047835573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007810158,0.00012237397,0.0022823615,0.00029329152,0.000044278117,0.0009689468,0.00048389414,0.002420313,0.027905742,0.8814403,0.034468524,0.04878907],"study_design_scores_gemma":[0.00014897274,0.00011201619,0.0052996865,0.0001306441,0.000056610585,0.001429938,0.0007293065,0.009183811,0.026677562,0.86822987,0.087887816,0.00011379276],"about_ca_topic_score_codex":0.0009633183,"about_ca_topic_score_gemma":0.0015259942,"teacher_disagreement_score":0.031496987,"about_ca_system_score_codex":0.0006807726,"about_ca_system_score_gemma":0.000646633,"threshold_uncertainty_score":0.10536784},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37703073,0.0008196759,0.42583466,0.0013144634,0.00034614146,0.0002397716,0.0029232106,0.0013789964,0.19011228],"genre_scores_gemma":[0.75629896,0.00053282117,0.16975185,0.00063991244,0.00011621475,0.00027352184,0.004051285,0.00057452923,0.0677608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990877,0.00020339307,0.000051304287,0.00022161708,0.00018069946,0.00025528215],"domain_scores_gemma":[0.9977871,0.0010545648,0.00027563472,0.00044772457,0.00020643476,0.00022844253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004968089,0.00053357356,0.0003939656,0.0011636436,0.001605498,0.0021814343,0.0010255069,0.0009491041,0.022005258],"category_scores_gemma":[0.0024505265,0.00063222455,0.00085659535,0.0009319516,0.0009516363,0.0027307356,0.0021408866,0.0018973371,0.0042621223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065846776,0.0002760314,0.0011310424,0.00026471508,0.000076771124,0.0009485973,0.0012728627,0.0072565796,0.015313251,0.9064954,0.013717432,0.05258887],"study_design_scores_gemma":[0.000078961966,0.00005700732,0.0012234949,0.00008698723,0.000036254754,0.0007377211,0.00049172755,0.013249608,0.006393697,0.95300573,0.024598364,0.000040415995],"about_ca_topic_score_codex":0.00085979764,"about_ca_topic_score_gemma":0.0018158624,"teacher_disagreement_score":0.022005258,"about_ca_system_score_codex":0.0008743765,"about_ca_system_score_gemma":0.00077819236,"threshold_uncertainty_score":0.073614955},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2704145,0.0013034535,0.34128162,0.0014247183,0.0009832463,0.00049403874,0.0021407104,0.0012719592,0.38068566],"genre_scores_gemma":[0.834983,0.00063614507,0.08286335,0.00062091294,0.00016648462,0.00047370317,0.0009974341,0.00023632825,0.07902267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900216,0.0003426431,0.00005094759,0.00016323359,0.00021448919,0.00022654097],"domain_scores_gemma":[0.99905735,0.0002158439,0.0001695691,0.0002859486,0.00018102098,0.000090186564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006364769,0.00056775165,0.00042657412,0.0008935175,0.0011837453,0.002158308,0.00059847056,0.0011369924,0.016057089],"category_scores_gemma":[0.002087112,0.00040815127,0.00058151106,0.00068124256,0.0009508623,0.00135623,0.000976076,0.0008092541,0.004043549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002331387,0.000046601956,0.00035306683,0.00009263593,0.000026939908,0.00019496994,0.00015365561,0.0035186766,0.0065077245,0.9544455,0.007778234,0.026648672],"study_design_scores_gemma":[0.00015416941,0.00017949441,0.00070845126,0.000107835134,0.000044026576,0.00055926555,0.00018539415,0.021339538,0.0099712415,0.9140991,0.052590586,0.000060935683],"about_ca_topic_score_codex":0.0011510388,"about_ca_topic_score_gemma":0.0019857292,"teacher_disagreement_score":0.016057089,"about_ca_system_score_codex":0.0008452567,"about_ca_system_score_gemma":0.0013120483,"threshold_uncertainty_score":0.05371636},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34251767,0.002735116,0.28286168,0.0030123512,0.0004887669,0.00020529427,0.0022319844,0.00048755202,0.36545962],"genre_scores_gemma":[0.9358935,0.0014568872,0.030818775,0.00066496513,0.00040278476,0.000107551175,0.0010266233,0.0000957595,0.029533224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.00011875734,0.00003263576,0.00011457502,0.00015050467,0.00009158749],"domain_scores_gemma":[0.9975145,0.0011503755,0.00039163954,0.00020543383,0.0004219029,0.0003162017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043685257,0.00038928122,0.0004102853,0.002145544,0.0017205554,0.0030527185,0.0006437384,0.00081074995,0.010841937],"category_scores_gemma":[0.0032582115,0.00038342996,0.00045641986,0.002155096,0.0013979297,0.0026982902,0.0010139719,0.0014588104,0.0012902478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015862171,0.000023943056,0.0002294045,0.00004902527,0.000008051246,0.00012103903,0.0001453473,0.00092749734,0.0009512053,0.98946,0.002052461,0.006016213],"study_design_scores_gemma":[0.00001531661,0.000019160958,0.00044449474,0.000026374726,0.000014985377,0.00037123114,0.00013299123,0.008073415,0.0005917121,0.98013365,0.010160794,0.000015855767],"about_ca_topic_score_codex":0.0014398812,"about_ca_topic_score_gemma":0.002418423,"teacher_disagreement_score":0.010841937,"about_ca_system_score_codex":0.0014042023,"about_ca_system_score_gemma":0.00069174456,"threshold_uncertainty_score":0.036269903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74312294,0.0014269971,0.2007154,0.0007118636,0.00011538901,0.00027173618,0.00149993,0.0003835182,0.05175219],"genre_scores_gemma":[0.88269943,0.00049329264,0.10386462,0.00030500616,0.000054333203,0.00020299361,0.0020089375,0.00012287893,0.010248553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.00010942211,0.000039210106,0.00013666785,0.00011969308,0.00015851994],"domain_scores_gemma":[0.9981741,0.00056972035,0.00030529674,0.0003983307,0.00021401176,0.00033843116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046226324,0.00050129084,0.0003402194,0.0014500458,0.00086949795,0.0011140386,0.000465251,0.00045254378,0.0040756213],"category_scores_gemma":[0.0017135213,0.00040472505,0.0006668911,0.00080694316,0.000990398,0.0012807302,0.0010544037,0.0008685055,0.00062944775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071350415,0.00023066475,0.006276287,0.00054137746,0.00012224616,0.0007831701,0.0013858767,0.03994117,0.047086395,0.7974787,0.01317812,0.09226255],"study_design_scores_gemma":[0.000113667316,0.00015838062,0.0042687124,0.00016722409,0.00008337853,0.0010013209,0.0008117544,0.08510556,0.01747009,0.86702955,0.02374519,0.000045221583],"about_ca_topic_score_codex":0.001442651,"about_ca_topic_score_gemma":0.0028348363,"teacher_disagreement_score":0.0040756213,"about_ca_system_score_codex":0.0010885493,"about_ca_system_score_gemma":0.00061048265,"threshold_uncertainty_score":0.013634324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060921125,0.0075009833,0.7196613,0.005306244,0.0014326182,0.00012414414,0.0006848765,0.00067637675,0.20369245],"genre_scores_gemma":[0.6620886,0.0070738266,0.24046668,0.0019014078,0.0028830634,0.00042703658,0.0008933184,0.00051063544,0.08375543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862444,0.000585326,0.00006964085,0.00029661375,0.00029528415,0.00012880316],"domain_scores_gemma":[0.9949185,0.0034237017,0.0003026017,0.0005464666,0.00046995384,0.00033885258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019846428,0.000798881,0.0009815164,0.004815396,0.004590908,0.004377972,0.0013567474,0.0016545549,0.011076526],"category_scores_gemma":[0.008986656,0.0007229428,0.0016172556,0.0049509425,0.0040691076,0.0077917716,0.0038504496,0.003744547,0.0016510772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018523082,0.0000126848345,0.00017549524,0.00002779711,0.000007564657,0.00006981764,0.000098350356,0.0009781233,0.00015342979,0.9883583,0.0029257187,0.00717402],"study_design_scores_gemma":[0.000008349104,0.000011432394,0.00015989911,0.000032404685,0.00001212216,0.00028700076,0.00012089897,0.010443889,0.00020177242,0.97827005,0.010440806,0.00001136439],"about_ca_topic_score_codex":0.0011295833,"about_ca_topic_score_gemma":0.0014470574,"teacher_disagreement_score":0.011076526,"about_ca_system_score_codex":0.0020714821,"about_ca_system_score_gemma":0.000875127,"threshold_uncertainty_score":0.037054718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4400506,0.0008993422,0.33133203,0.000653952,0.0004996105,0.00026943893,0.0007133525,0.0012794969,0.22430216],"genre_scores_gemma":[0.8756981,0.00043924837,0.08046907,0.00038277337,0.000051220126,0.00020856189,0.00038309148,0.00016123963,0.0422067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999726,0.00006678594,0.0000169149,0.00004752206,0.000077174765,0.000065479384],"domain_scores_gemma":[0.9995989,0.00009860403,0.000051306364,0.00012250552,0.00006988727,0.000058859285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022676427,0.00020407254,0.00020211267,0.000459344,0.0005636273,0.000776067,0.00035465165,0.00056391204,0.015275739],"category_scores_gemma":[0.0010631406,0.00033349267,0.00042931095,0.00030240664,0.00060192856,0.0010921119,0.0009839779,0.0007072001,0.0021138971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019550236,0.000055238503,0.00057690527,0.00014180652,0.000022630738,0.00033752117,0.0002727276,0.011997567,0.03485274,0.8923436,0.0045151156,0.054688655],"study_design_scores_gemma":[0.00009527575,0.00027995248,0.001196077,0.000102271435,0.000035910718,0.0007723524,0.00019156448,0.049164742,0.027913306,0.8565302,0.06366611,0.000052322284],"about_ca_topic_score_codex":0.0007812391,"about_ca_topic_score_gemma":0.001033371,"teacher_disagreement_score":0.015275739,"about_ca_system_score_codex":0.00043923248,"about_ca_system_score_gemma":0.00046741668,"threshold_uncertainty_score":0.05110246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1092655,0.0009782006,0.8812673,0.00071555754,0.00014847555,0.00026140435,0.0017019064,0.0019490488,0.003712618],"genre_scores_gemma":[0.41071773,0.00046958323,0.5800552,0.00024125967,0.00014857356,0.0003978847,0.0038252014,0.00036285678,0.0037816912],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678254,0.0006367867,0.00034506503,0.0010158418,0.0009052376,0.00031455958],"domain_scores_gemma":[0.99313545,0.004036583,0.0005709297,0.0012633211,0.0006400552,0.00035374638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022537413,0.0014405127,0.0031814429,0.0053472873,0.001994052,0.0030325814,0.0041603176,0.0033816274,0.006842471],"category_scores_gemma":[0.020098343,0.00095566595,0.0017542145,0.005852415,0.0018708176,0.007867646,0.003845701,0.0027364541,0.0020967207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024841395,0.0007710834,0.006151683,0.0010742532,0.0003332758,0.0002306858,0.00081848423,0.28484935,0.014083231,0.18561374,0.014888278,0.48870182],"study_design_scores_gemma":[0.00012243881,0.00024202531,0.00081919687,0.00006885273,0.000068746434,0.00021758371,0.0002062695,0.7097119,0.0041124295,0.28184855,0.0025277731,0.000054212804],"about_ca_topic_score_codex":0.002754346,"about_ca_topic_score_gemma":0.0046337103,"teacher_disagreement_score":0.006842471,"about_ca_system_score_codex":0.0021287845,"about_ca_system_score_gemma":0.0018978168,"threshold_uncertainty_score":0.02289033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4642581,0.00095493085,0.22060339,0.0010683612,0.00054987345,0.00037896822,0.0016162888,0.0013566236,0.3092135],"genre_scores_gemma":[0.8855624,0.00036978236,0.07588116,0.00034764133,0.00007324589,0.0001934873,0.0009077363,0.00016057635,0.036503874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993642,0.00015236852,0.000042722604,0.000095051,0.00019022323,0.00015537952],"domain_scores_gemma":[0.9992316,0.00019779857,0.000117694675,0.00021628503,0.00011495808,0.00012173159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032164654,0.0006352339,0.00051109196,0.0006273803,0.0012694442,0.0016467347,0.0009441435,0.0009416828,0.018668925],"category_scores_gemma":[0.0017821523,0.00044219595,0.00031352017,0.0009984652,0.0007101978,0.0015619313,0.0014023661,0.00081392325,0.0039052705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013063924,0.0002944095,0.0013160849,0.00039851648,0.000083783554,0.0007794103,0.00046689733,0.012529204,0.03183514,0.83729655,0.02085473,0.09283879],"study_design_scores_gemma":[0.00033138302,0.0006336026,0.0014137416,0.00014579407,0.000093910254,0.0014066704,0.0004975291,0.053702574,0.028882595,0.85106826,0.06171954,0.00010441257],"about_ca_topic_score_codex":0.00052177627,"about_ca_topic_score_gemma":0.0012621057,"teacher_disagreement_score":0.018668925,"about_ca_system_score_codex":0.00058896514,"about_ca_system_score_gemma":0.0007364058,"threshold_uncertainty_score":0.062453747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48411107,0.001474758,0.17917089,0.0028533854,0.0007957495,0.00012432956,0.00089229795,0.00040008387,0.3301774],"genre_scores_gemma":[0.93530685,0.00064880686,0.020043805,0.00051539636,0.00028702247,0.00013731226,0.0005232292,0.00008536905,0.042452287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990408,0.00026870624,0.000055078475,0.00017097054,0.00020771615,0.00025683813],"domain_scores_gemma":[0.998278,0.0007095324,0.00029867174,0.00028800248,0.00018183813,0.00024390062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048318953,0.0006075971,0.00057369017,0.0012444035,0.0015729683,0.0025444576,0.0010827044,0.0006782092,0.011059846],"category_scores_gemma":[0.0022059986,0.0002934867,0.0006745948,0.00090174004,0.0028683762,0.0036177922,0.0031132468,0.001548273,0.0019251535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055689095,0.00001354748,0.0001314249,0.000016732958,0.000006805685,0.00010041537,0.00014792585,0.0010903287,0.0006521764,0.9915167,0.0011734928,0.0050947084],"study_design_scores_gemma":[0.000013760998,0.000018842933,0.00015956302,0.000016973694,0.0000062478475,0.00014336294,0.0001823141,0.0032126587,0.0010682169,0.988279,0.0068856096,0.000013375217],"about_ca_topic_score_codex":0.0014952025,"about_ca_topic_score_gemma":0.0014798336,"teacher_disagreement_score":0.011059846,"about_ca_system_score_codex":0.0010122813,"about_ca_system_score_gemma":0.0007880406,"threshold_uncertainty_score":0.036998868},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037288398,0.0049147485,0.23360208,0.01553535,0.018171778,0.000182153,0.0010929911,0.00076274626,0.68844974],"genre_scores_gemma":[0.65672535,0.0045778346,0.19744542,0.011658704,0.006393373,0.00052289513,0.0009692205,0.00061932876,0.12108789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990747,0.00022214046,0.00004338265,0.00021132705,0.00030999823,0.00013840859],"domain_scores_gemma":[0.9983651,0.0009465689,0.000083452636,0.00028313926,0.00019957143,0.00012220505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010654401,0.00073083694,0.0008056417,0.001589639,0.002402269,0.0017262241,0.0018755918,0.0011379388,0.02823217],"category_scores_gemma":[0.0030731456,0.00033391325,0.0006762165,0.001468793,0.0032528825,0.0047422303,0.0036671357,0.00409238,0.004483093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087102315,0.000024867284,0.000100728255,0.00007975856,0.000007806234,0.00013749878,0.00012971871,0.00039396936,0.0013827892,0.9699636,0.013855487,0.013836658],"study_design_scores_gemma":[0.000018815095,0.00006482272,0.00042726402,0.000042567517,0.000013963403,0.0004220849,0.000079239595,0.0012447576,0.0023063195,0.9122233,0.083128065,0.000028960669],"about_ca_topic_score_codex":0.00073762186,"about_ca_topic_score_gemma":0.0011095321,"teacher_disagreement_score":0.02823217,"about_ca_system_score_codex":0.00086329115,"about_ca_system_score_gemma":0.00045520088,"threshold_uncertainty_score":0.094446},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16599399,0.0029236344,0.1823714,0.0044549415,0.0016346878,0.0001426582,0.0008120931,0.0005494394,0.64111716],"genre_scores_gemma":[0.8142364,0.0017229171,0.046135172,0.0018808272,0.0007592249,0.0001987512,0.00088479003,0.00022670474,0.13395512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913245,0.00024978057,0.000040067316,0.00014566847,0.00022038707,0.00021178779],"domain_scores_gemma":[0.9990814,0.0002814832,0.00018338974,0.00011764691,0.00016939893,0.00016666882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054032303,0.0008055158,0.0004623459,0.0028329394,0.001764951,0.0024788266,0.0006901099,0.0009063981,0.022118224],"category_scores_gemma":[0.0014319863,0.0002742896,0.0006453638,0.0012739543,0.0019017643,0.0028664432,0.002674004,0.0019120278,0.0049715796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029174686,0.000016641477,0.00011395618,0.00002818696,0.0000066999205,0.000055876964,0.00012799064,0.0003910803,0.00059980375,0.9883781,0.002871868,0.00738063],"study_design_scores_gemma":[0.000014425162,0.000019424548,0.00023796968,0.00003323153,0.0000057038064,0.00011349201,0.00013633465,0.0022951993,0.0006047616,0.97942114,0.017107472,0.0000108999775],"about_ca_topic_score_codex":0.0012851182,"about_ca_topic_score_gemma":0.001512671,"teacher_disagreement_score":0.022118224,"about_ca_system_score_codex":0.0012165236,"about_ca_system_score_gemma":0.00055179896,"threshold_uncertainty_score":0.07399279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41240925,0.0013390001,0.2511489,0.005710272,0.00083275704,0.00016039555,0.0016036655,0.0006751555,0.32612053],"genre_scores_gemma":[0.9178841,0.0008272892,0.03440366,0.0007844802,0.00036587776,0.00019677894,0.0006719435,0.00018775775,0.044678155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994404,0.00009006176,0.000024805018,0.00015740383,0.00013611169,0.00015129586],"domain_scores_gemma":[0.99789256,0.0008763119,0.0003079226,0.00032353334,0.00028114024,0.00031860432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043917613,0.0004630333,0.00053684687,0.0013490032,0.0018789896,0.002283256,0.0006256409,0.0012802638,0.016079359],"category_scores_gemma":[0.0033222574,0.00032940164,0.00042836196,0.0011791105,0.0023180733,0.0039453767,0.0014001449,0.0020355645,0.0026792677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008894155,0.000035738605,0.0003515641,0.00007319685,0.000006345401,0.0002326029,0.00016982379,0.0017363349,0.004397121,0.9714485,0.0076659806,0.013793786],"study_design_scores_gemma":[0.000022174028,0.00003582543,0.00069280167,0.000024331119,0.0000066485363,0.0005261357,0.00008343226,0.00807919,0.002760399,0.9795518,0.008193258,0.000024077006],"about_ca_topic_score_codex":0.0011622449,"about_ca_topic_score_gemma":0.0014186125,"teacher_disagreement_score":0.016079359,"about_ca_system_score_codex":0.0009007324,"about_ca_system_score_gemma":0.0008315603,"threshold_uncertainty_score":0.053790867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3319713,0.0013110217,0.6165966,0.0044091092,0.0002874693,0.0001248418,0.00074510975,0.00035928763,0.044195313],"genre_scores_gemma":[0.94779044,0.0006066508,0.0455779,0.00037915152,0.00018391959,0.00010942341,0.0004027415,0.00007230418,0.0048774993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987451,0.0004293523,0.000058424128,0.00026331045,0.00025224534,0.00025146044],"domain_scores_gemma":[0.99554235,0.0022642254,0.0005871828,0.00084548723,0.00043176222,0.0003289771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009668791,0.0005534141,0.0006607409,0.0004887126,0.0009630472,0.0017400905,0.0011307773,0.0011569688,0.007313765],"category_scores_gemma":[0.008159227,0.00051293336,0.0014582784,0.0006375834,0.0014298346,0.0032114172,0.0014033146,0.0014780423,0.00071696413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035212084,0.00011335505,0.009429091,0.00036826605,0.000105415354,0.0006932312,0.0007403699,0.3678142,0.006236523,0.5686142,0.01521063,0.030322656],"study_design_scores_gemma":[0.000050856346,0.00025532054,0.0022063483,0.000055993813,0.00003480019,0.00088421116,0.0005323419,0.5359089,0.0024458806,0.4479651,0.00961547,0.000044823253],"about_ca_topic_score_codex":0.0027237788,"about_ca_topic_score_gemma":0.0024710651,"teacher_disagreement_score":0.007313765,"about_ca_system_score_codex":0.0010141298,"about_ca_system_score_gemma":0.0006029845,"threshold_uncertainty_score":0.024466932},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26714152,0.0034067617,0.37493938,0.0029345443,0.0006705116,0.0001192455,0.0006943211,0.0005198628,0.34957394],"genre_scores_gemma":[0.9083832,0.0022898507,0.030597862,0.0008331845,0.00032978502,0.000097581564,0.00045139634,0.00016082021,0.05685649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995523,0.00012880289,0.000013942853,0.00008570095,0.000107015,0.000112256166],"domain_scores_gemma":[0.9986193,0.0008144392,0.00017045227,0.00014177465,0.00014179223,0.00011220808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003027687,0.00045179724,0.0003654877,0.0015310504,0.00093251653,0.0010639633,0.00068925344,0.0007271944,0.014140875],"category_scores_gemma":[0.0028253011,0.00024479977,0.00031095956,0.0010043967,0.0012391512,0.002290454,0.0015277155,0.001162128,0.0015741993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000377879,0.000017470673,0.000260648,0.000081903505,0.000008312046,0.00011836348,0.00016963795,0.006031554,0.0016797811,0.9727806,0.005285557,0.013528336],"study_design_scores_gemma":[0.0000119976185,0.00001779596,0.00031793557,0.000036269914,0.000008064075,0.00019868446,0.00016418105,0.02392605,0.0008432718,0.9618077,0.012656728,0.000011260181],"about_ca_topic_score_codex":0.0014493212,"about_ca_topic_score_gemma":0.0021832618,"teacher_disagreement_score":0.014140875,"about_ca_system_score_codex":0.00092690263,"about_ca_system_score_gemma":0.00038297952,"threshold_uncertainty_score":0.04730594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4077579,0.0024298148,0.25132903,0.0029938137,0.0007723614,0.00014646274,0.0010643016,0.00045719024,0.33304912],"genre_scores_gemma":[0.8946622,0.0015151823,0.05735081,0.0011080268,0.00048051335,0.000109261324,0.0009061697,0.0002458647,0.04362192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986929,0.0004567709,0.000056593635,0.00028788543,0.00024687467,0.00025891647],"domain_scores_gemma":[0.9967789,0.0017699896,0.0004118881,0.0003407207,0.00036326057,0.00033530282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008257987,0.0005971959,0.000588781,0.002377782,0.0026656839,0.002669208,0.001065058,0.0013620782,0.013187555],"category_scores_gemma":[0.0045743203,0.0005587307,0.00075620867,0.0017742729,0.0028498934,0.005236307,0.0029450536,0.0024031377,0.0016026091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006966772,0.00003075416,0.00040347181,0.0000686272,0.000015027138,0.00030072138,0.00039425978,0.0017839673,0.0012840352,0.98328143,0.0027954155,0.009572554],"study_design_scores_gemma":[0.000010301765,0.000011079788,0.00037938435,0.000030095418,0.000013524146,0.00032253435,0.00024844994,0.0035890813,0.0005653667,0.9891861,0.005630308,0.000013698005],"about_ca_topic_score_codex":0.0018063551,"about_ca_topic_score_gemma":0.002977949,"teacher_disagreement_score":0.013187555,"about_ca_system_score_codex":0.0016897556,"about_ca_system_score_gemma":0.00065302063,"threshold_uncertainty_score":0.044116795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07023521,0.00044368088,0.8704628,0.00062447874,0.00017677549,0.00013033315,0.0006911855,0.0010582523,0.056177307],"genre_scores_gemma":[0.54559666,0.0007309991,0.43015325,0.00047939454,0.00011329049,0.00021087115,0.0015663598,0.00044231248,0.020706883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946386,0.0001888732,0.000029104642,0.00011299213,0.00013499227,0.000070211754],"domain_scores_gemma":[0.9984315,0.0005369603,0.00015120253,0.000399802,0.00021605084,0.0002645407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040958697,0.00038623755,0.00041420868,0.001167281,0.001182527,0.0012695217,0.000830051,0.000529796,0.0057672965],"category_scores_gemma":[0.002203177,0.0004438867,0.00060276187,0.0012327108,0.001233076,0.0018692554,0.0026761312,0.0015823027,0.0016736272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006403268,0.000048502487,0.00038717804,0.00010126096,0.000011954846,0.00018332739,0.00036142484,0.0036265436,0.005538065,0.9520612,0.0051368265,0.032479737],"study_design_scores_gemma":[0.000027206095,0.000049835737,0.00042302892,0.000049949795,0.000020092779,0.00056442677,0.00030213434,0.025805928,0.00462835,0.9408254,0.027275527,0.00002815279],"about_ca_topic_score_codex":0.0005812381,"about_ca_topic_score_gemma":0.0009343246,"teacher_disagreement_score":0.0057672965,"about_ca_system_score_codex":0.0005113988,"about_ca_system_score_gemma":0.0003969979,"threshold_uncertainty_score":0.019293487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48210135,0.0013327013,0.15732615,0.0023373691,0.0005009504,0.00022501797,0.0036736769,0.0006587799,0.351844],"genre_scores_gemma":[0.9262311,0.000625849,0.030834053,0.000570374,0.00015240427,0.00014033461,0.0016790369,0.00012821898,0.03963863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995408,0.000103056846,0.00002334131,0.00008846424,0.00008041429,0.00016385797],"domain_scores_gemma":[0.998408,0.0007277432,0.00030032624,0.00023422265,0.00013247799,0.00019723148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730729,0.0004609204,0.00030622995,0.0014682127,0.0016956845,0.0015741265,0.00088256394,0.0010575041,0.023754882],"category_scores_gemma":[0.0020087175,0.00031111226,0.0005187463,0.0010887971,0.0012416111,0.0021112845,0.00163368,0.0014323007,0.0018996105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020257506,0.00005335246,0.00071644963,0.00009623714,0.000018751172,0.0004776408,0.0003105021,0.0024604634,0.0019684571,0.96886015,0.008274981,0.016560381],"study_design_scores_gemma":[0.000023920971,0.000029323488,0.0010456301,0.000036638492,0.000016104379,0.000280229,0.00027146924,0.0071485694,0.001711962,0.9759902,0.013425803,0.000020223533],"about_ca_topic_score_codex":0.0017169742,"about_ca_topic_score_gemma":0.002428845,"teacher_disagreement_score":0.023754882,"about_ca_system_score_codex":0.000659067,"about_ca_system_score_gemma":0.0005126174,"threshold_uncertainty_score":0.07946801},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23115204,0.001971774,0.37831852,0.0013022523,0.00065022666,0.00015219362,0.0013448043,0.0010619494,0.3840462],"genre_scores_gemma":[0.870458,0.00076736213,0.058014005,0.00040785654,0.00024461793,0.000055828437,0.0008228124,0.00019963265,0.06902992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995902,0.00005838285,0.000017005324,0.00010325407,0.00008412737,0.00014697913],"domain_scores_gemma":[0.9992435,0.00019962208,0.00009875114,0.0001748773,0.00013639944,0.00014690432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022666765,0.0003641642,0.000470574,0.0011394,0.0018762704,0.0020984276,0.0004468573,0.00065863814,0.023198416],"category_scores_gemma":[0.0014249906,0.0003263032,0.00052299094,0.000728856,0.0011292138,0.0019553665,0.0012759422,0.0010981293,0.0045033405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006378242,0.00002209837,0.00037905356,0.000052135645,0.000011299064,0.00021228228,0.0002517923,0.0012828854,0.0044025467,0.9660701,0.008716706,0.018535335],"study_design_scores_gemma":[0.000019413368,0.000033861197,0.00081314356,0.00004978052,0.000018261606,0.00053058827,0.00038786288,0.00888411,0.0024575002,0.946732,0.040052403,0.000021147178],"about_ca_topic_score_codex":0.001985012,"about_ca_topic_score_gemma":0.00402205,"teacher_disagreement_score":0.023198416,"about_ca_system_score_codex":0.0008323194,"about_ca_system_score_gemma":0.00043044752,"threshold_uncertainty_score":0.07760644},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15632506,0.0010103909,0.4550536,0.0017212187,0.0007643804,0.0002020747,0.0010253116,0.0011746499,0.3827234],"genre_scores_gemma":[0.8249571,0.001019352,0.09768373,0.0009999792,0.00032072427,0.00026719607,0.0015107301,0.00042413844,0.072817035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873143,0.00040397904,0.00007397702,0.00028553137,0.00028377172,0.00022145019],"domain_scores_gemma":[0.9977609,0.0010120306,0.00026835996,0.00037090015,0.0003019964,0.00028578023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006202902,0.0004870159,0.00031935395,0.0029599934,0.0016448159,0.002763652,0.0006391637,0.0010120026,0.019092193],"category_scores_gemma":[0.0033141514,0.00041608873,0.00082224293,0.0014909471,0.0014805638,0.0037723281,0.0025440606,0.0018359353,0.0028737972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002624459,0.000034705095,0.0002882637,0.00003352646,0.000008671699,0.00018662501,0.00024320488,0.0005402208,0.0010235154,0.98025185,0.002842407,0.014520751],"study_design_scores_gemma":[0.000009934584,0.00001255339,0.00034972923,0.000025953272,0.0000091355905,0.00032756128,0.00021351685,0.003183542,0.0011255695,0.97762054,0.017108753,0.000013053],"about_ca_topic_score_codex":0.0010248051,"about_ca_topic_score_gemma":0.0012621159,"teacher_disagreement_score":0.019092193,"about_ca_system_score_codex":0.0009928955,"about_ca_system_score_gemma":0.0006126635,"threshold_uncertainty_score":0.063869774},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0500274,0.0012143184,0.3126708,0.004978266,0.0021883743,0.00019401617,0.0012277535,0.0004573523,0.6270417],"genre_scores_gemma":[0.5174322,0.0010359801,0.13805339,0.003869449,0.001030585,0.00029798408,0.0011290257,0.000501594,0.33664978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890876,0.00029615714,0.00006931885,0.00021169575,0.00027633825,0.00023774005],"domain_scores_gemma":[0.99909127,0.00023930999,0.00009578559,0.00030872467,0.000183628,0.000081269536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001330799,0.0006524477,0.00063344475,0.001518036,0.0032425525,0.0026118474,0.0012974105,0.0021605704,0.033087794],"category_scores_gemma":[0.0024823123,0.00034311725,0.0010871083,0.0016585119,0.002179462,0.0077111092,0.0021867133,0.0029728552,0.006010158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013159796,0.000021557411,0.000111250374,0.000024209025,0.0000037646537,0.00010359623,0.00023648934,0.00022111596,0.00045665423,0.9899856,0.0055460692,0.0032765262],"study_design_scores_gemma":[0.000008962228,0.0000058019154,0.00018427402,0.00002474732,0.000010053227,0.00020323742,0.00010644467,0.0027301651,0.0006831436,0.9600166,0.03600945,0.00001705525],"about_ca_topic_score_codex":0.003159869,"about_ca_topic_score_gemma":0.006466326,"teacher_disagreement_score":0.033087794,"about_ca_system_score_codex":0.0014404462,"about_ca_system_score_gemma":0.0010011275,"threshold_uncertainty_score":0.1106897},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19607945,0.00046803543,0.7740083,0.00020911239,0.00008693556,0.0002795515,0.00046013657,0.00036979708,0.02803876],"genre_scores_gemma":[0.65686506,0.00040951456,0.32441506,0.00024572288,0.00016063527,0.0007649075,0.0011207988,0.00016038303,0.01585807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986815,0.0004157178,0.00014067622,0.00031340038,0.00031255063,0.0001360959],"domain_scores_gemma":[0.9943538,0.0027878333,0.00073121453,0.0014377667,0.00036792646,0.00032143464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014789299,0.00058455433,0.00059041375,0.0012835066,0.0010189844,0.0013869368,0.0006053079,0.0006722778,0.0069309734],"category_scores_gemma":[0.0047016223,0.00061646843,0.0014494538,0.0008645621,0.0018149974,0.0023817602,0.002417174,0.0013490579,0.0011214028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034334598,0.00010392647,0.0012194191,0.00039421086,0.00008750618,0.00037989026,0.00065119955,0.023982652,0.030152492,0.8785036,0.001997248,0.062184528],"study_design_scores_gemma":[0.00013101516,0.00043989232,0.0010471428,0.00010397208,0.00008900551,0.0007537454,0.00024088022,0.056552276,0.03385187,0.8862573,0.020468459,0.00006448826],"about_ca_topic_score_codex":0.00017864873,"about_ca_topic_score_gemma":0.0003035699,"teacher_disagreement_score":0.0069309734,"about_ca_system_score_codex":0.00067594275,"about_ca_system_score_gemma":0.0004576822,"threshold_uncertainty_score":0.023186445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20853887,0.0018041724,0.67147934,0.0012923398,0.00033704983,0.00024535117,0.0014910827,0.0006791609,0.11413262],"genre_scores_gemma":[0.70687217,0.0011107827,0.23543164,0.00083067885,0.00035453556,0.00033367748,0.0023917574,0.00044100196,0.052233797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844944,0.00048871414,0.00013940393,0.0004079191,0.00034417716,0.0001703599],"domain_scores_gemma":[0.9951735,0.002162818,0.00073704735,0.00080564007,0.0006906502,0.00043026966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009560571,0.00049424695,0.00066328346,0.0018379041,0.0014635079,0.0027308434,0.0010400668,0.00088247773,0.014207118],"category_scores_gemma":[0.005213093,0.0008717456,0.001018531,0.001960913,0.0013223271,0.0053046164,0.0024515372,0.0020613277,0.0024634863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010263777,0.000064560074,0.0006122568,0.00016160728,0.00003916196,0.00019185503,0.00032072974,0.0039242757,0.0024020907,0.9574123,0.0053578527,0.029410677],"study_design_scores_gemma":[0.000021974487,0.000034666664,0.00037568688,0.00006700367,0.000022966735,0.00045456318,0.00021250757,0.018535169,0.002784841,0.96538234,0.012088713,0.000019548355],"about_ca_topic_score_codex":0.00044366994,"about_ca_topic_score_gemma":0.0009828925,"teacher_disagreement_score":0.014207118,"about_ca_system_score_codex":0.0007181841,"about_ca_system_score_gemma":0.0005636522,"threshold_uncertainty_score":0.04752755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2651553,0.0011498327,0.6294088,0.0008486246,0.00030342792,0.00020966827,0.0012650056,0.0005291357,0.101130165],"genre_scores_gemma":[0.77795213,0.0017220925,0.16278362,0.0007748791,0.0005647969,0.0003382229,0.002126823,0.0006074876,0.05313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994112,0.00015225673,0.000028466404,0.0001266712,0.0001628131,0.00011847593],"domain_scores_gemma":[0.997413,0.00095718075,0.00038559322,0.000378129,0.0005011144,0.0003649435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005069898,0.00083318347,0.0006883223,0.002416352,0.0010661341,0.0023850775,0.0008385605,0.0007641026,0.008269052],"category_scores_gemma":[0.0029060233,0.000579562,0.0007796227,0.001366466,0.0012887788,0.0020678472,0.0008981109,0.001540796,0.0011279833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040296592,0.00004359719,0.00020248385,0.000060854913,0.000014924634,0.00008409728,0.00018638963,0.0067873388,0.0025314018,0.9745238,0.0039457763,0.011579058],"study_design_scores_gemma":[0.00001417482,0.00001902598,0.00033270937,0.000023854594,0.0000126507275,0.00009626742,0.00008458584,0.03047797,0.0007037643,0.96319413,0.005028018,0.000012827346],"about_ca_topic_score_codex":0.0012876372,"about_ca_topic_score_gemma":0.0019029396,"teacher_disagreement_score":0.008269052,"about_ca_system_score_codex":0.00084606494,"about_ca_system_score_gemma":0.000691384,"threshold_uncertainty_score":0.027662694},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111709386,0.0048466404,0.7068081,0.0028936001,0.0012771735,0.00037181194,0.0010726578,0.0008715258,0.17014912],"genre_scores_gemma":[0.64326465,0.0022974506,0.30462244,0.002206596,0.0003038816,0.0007244515,0.0009224749,0.00019060606,0.045467418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990109,0.00022529742,0.000069198526,0.00028903256,0.00025102723,0.0001544902],"domain_scores_gemma":[0.9986908,0.00044249962,0.00017303467,0.00039359997,0.00021302047,0.00008714938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089816,0.0006273459,0.00040005063,0.0004029019,0.0007694422,0.0011134131,0.0005494318,0.0008992853,0.007676132],"category_scores_gemma":[0.002261385,0.0003721155,0.0005915395,0.00049725425,0.001464377,0.0017815586,0.00097438495,0.0014071186,0.002060193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018922957,0.00006900662,0.0007917566,0.00036686714,0.000032449527,0.0002138224,0.0002326523,0.0039564297,0.013291763,0.9170955,0.0076595712,0.05610096],"study_design_scores_gemma":[0.000078732555,0.000404299,0.00072550966,0.00007740835,0.00005396959,0.0011341387,0.00011993884,0.010987476,0.020156583,0.83353496,0.13269708,0.000029922578],"about_ca_topic_score_codex":0.000529637,"about_ca_topic_score_gemma":0.0011306222,"teacher_disagreement_score":0.007676132,"about_ca_system_score_codex":0.00069305865,"about_ca_system_score_gemma":0.0008518878,"threshold_uncertainty_score":0.025679171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27519608,0.003948124,0.42366406,0.0018993416,0.0009902471,0.00019626845,0.00076452305,0.0008316376,0.2925097],"genre_scores_gemma":[0.8644579,0.0021893296,0.06658998,0.0006583334,0.00041793677,0.00012185798,0.00052399066,0.0002773997,0.06476319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993781,0.00018284425,0.000031714506,0.000117659285,0.00012831997,0.00016138918],"domain_scores_gemma":[0.99867934,0.00063187303,0.00019890392,0.00017335097,0.00014292164,0.00017356667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041498392,0.00063835434,0.0005103715,0.0014936286,0.0013074408,0.0018916901,0.0005788258,0.0008784316,0.020642122],"category_scores_gemma":[0.0025767388,0.000398549,0.00053637096,0.0012141614,0.0018425357,0.0032294637,0.0016218047,0.0011445105,0.0034741922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000871071,0.000033113847,0.00049849274,0.00008458046,0.000011714015,0.00021113208,0.0003316329,0.0044258917,0.0016476922,0.9658261,0.004912354,0.021930179],"study_design_scores_gemma":[0.000019490111,0.000028751658,0.00025676563,0.00005102595,0.000008867902,0.00030918198,0.00026433458,0.01072081,0.0009968099,0.967817,0.019510765,0.000016261163],"about_ca_topic_score_codex":0.0022067418,"about_ca_topic_score_gemma":0.003526611,"teacher_disagreement_score":0.020642122,"about_ca_system_score_codex":0.00081435696,"about_ca_system_score_gemma":0.00039200686,"threshold_uncertainty_score":0.06905478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18351844,0.0033913841,0.50232863,0.0018649668,0.0008850076,0.0001582699,0.0005480551,0.0003479895,0.30695727],"genre_scores_gemma":[0.8716059,0.0025948472,0.07757433,0.0014101717,0.000702275,0.00023328092,0.00038034428,0.000114807095,0.04538404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871266,0.0005244835,0.000053632888,0.00017664682,0.00034409165,0.00018858802],"domain_scores_gemma":[0.9975073,0.0013518356,0.00031041788,0.0003755072,0.00030375848,0.0001513781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726868,0.00066796254,0.00047204786,0.0016799514,0.0010408151,0.0013880274,0.0004997701,0.0011005485,0.012796891],"category_scores_gemma":[0.0033900186,0.0004039605,0.000558125,0.0012500404,0.0017989016,0.0025102738,0.0015770947,0.0012916685,0.0020171106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003996217,0.0000150191945,0.000152191,0.000059834343,0.0000080445325,0.000094699986,0.00011960496,0.0023954187,0.0014144419,0.98225754,0.0020006218,0.0114426585],"study_design_scores_gemma":[0.000012338102,0.000029673794,0.00013794971,0.00003761167,0.000006328155,0.00018627645,0.000043947388,0.0074677574,0.0006618171,0.9838161,0.007586276,0.000014076748],"about_ca_topic_score_codex":0.00056543306,"about_ca_topic_score_gemma":0.0011854256,"teacher_disagreement_score":0.012796891,"about_ca_system_score_codex":0.0008252009,"about_ca_system_score_gemma":0.0005528126,"threshold_uncertainty_score":0.042809844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5619835,0.0025048556,0.07644019,0.005874808,0.0012001133,0.00008868144,0.0019491005,0.00063125475,0.34932745],"genre_scores_gemma":[0.96149474,0.000823425,0.009943766,0.0004811353,0.0005569171,0.00009727393,0.0005080925,0.0001536845,0.025940983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921334,0.00027625886,0.000030394172,0.00014747906,0.0001793435,0.00015317944],"domain_scores_gemma":[0.9959735,0.0024388307,0.00047820332,0.00032180996,0.00025911204,0.0005284769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012843008,0.00059963646,0.00069932814,0.00271161,0.0016799257,0.0029900072,0.0010465194,0.00077288167,0.014271446],"category_scores_gemma":[0.0065116165,0.00041395015,0.00037687132,0.0012861302,0.002594922,0.004529904,0.0015545816,0.0012363166,0.0013329053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013965112,0.000027660484,0.00095934747,0.00008689753,0.000014129022,0.000094874544,0.00012210548,0.0024214499,0.0009395716,0.9679222,0.010436181,0.016835842],"study_design_scores_gemma":[0.00001824951,0.000018585648,0.0006568098,0.00003772335,0.000015173519,0.00030018837,0.00008331781,0.010116341,0.0010414936,0.97990936,0.007787605,0.0000152476],"about_ca_topic_score_codex":0.0005171186,"about_ca_topic_score_gemma":0.00087458355,"teacher_disagreement_score":0.014271446,"about_ca_system_score_codex":0.0012021111,"about_ca_system_score_gemma":0.00077122817,"threshold_uncertainty_score":0.047742724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17155014,0.00302356,0.5397839,0.002388178,0.0005450089,0.00018808566,0.00078726717,0.00040487607,0.28132898],"genre_scores_gemma":[0.8460558,0.0025335648,0.08922236,0.0011381515,0.0005758832,0.00030786527,0.0004986716,0.00013025272,0.05953742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827373,0.0007125055,0.00006520829,0.00023257197,0.00041666473,0.00029939885],"domain_scores_gemma":[0.99635494,0.002073963,0.00046319843,0.0005398812,0.00038060552,0.0001874372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011053513,0.0007169716,0.0004854859,0.0018190484,0.001194841,0.0019092007,0.00061841717,0.0011679545,0.013445106],"category_scores_gemma":[0.004962523,0.00041619362,0.0004920489,0.0017474239,0.002193096,0.0025260074,0.0019678308,0.0011860371,0.0020482847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005268945,0.000018157225,0.00022513155,0.00006351277,0.000009951161,0.00007885123,0.0001297248,0.0030328755,0.0013305455,0.976185,0.0029011432,0.015972242],"study_design_scores_gemma":[0.00002279315,0.00003805478,0.00020067491,0.000060334674,0.000010168027,0.00022367612,0.00007903375,0.011662455,0.0012151689,0.9766816,0.00978792,0.000018069442],"about_ca_topic_score_codex":0.00081190694,"about_ca_topic_score_gemma":0.0015852759,"teacher_disagreement_score":0.013445106,"about_ca_system_score_codex":0.0014785153,"about_ca_system_score_gemma":0.0009008397,"threshold_uncertainty_score":0.04497838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1835447,0.0015625472,0.7386944,0.0020101147,0.00033087042,0.000111696616,0.00031950526,0.0005358361,0.07289031],"genre_scores_gemma":[0.80924034,0.0016871088,0.13697296,0.0010226395,0.0003820151,0.0001977288,0.00040114485,0.00033934577,0.049756635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984281,0.0006809665,0.000059690195,0.00025978035,0.0003861889,0.00018518257],"domain_scores_gemma":[0.9906713,0.005978983,0.0004769905,0.0012492737,0.0009110624,0.0007123185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014976022,0.00074020046,0.0008560226,0.0019357271,0.0018080221,0.002346233,0.0014847112,0.0014484609,0.007400281],"category_scores_gemma":[0.01123997,0.0006244855,0.0008488941,0.0011551331,0.0030955651,0.0047552767,0.003442773,0.0033419,0.0017334248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007541514,0.000029453422,0.00026647333,0.000065783206,0.000021748929,0.0001584025,0.00035473015,0.0105929375,0.0018247367,0.9700754,0.0035998852,0.012934849],"study_design_scores_gemma":[0.000011640227,0.000025907611,0.00010707278,0.000031779167,0.000008905301,0.00016376676,0.00010327083,0.035338767,0.0008725764,0.9601936,0.0031289821,0.000013843693],"about_ca_topic_score_codex":0.000881253,"about_ca_topic_score_gemma":0.0011243547,"teacher_disagreement_score":0.007400281,"about_ca_system_score_codex":0.00092044036,"about_ca_system_score_gemma":0.00061348005,"threshold_uncertainty_score":0.024756372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5860797,0.0009673944,0.1639727,0.0016711251,0.00023828637,0.00028111358,0.0028119523,0.00096738973,0.24301022],"genre_scores_gemma":[0.892521,0.0004989232,0.05836315,0.00050017604,0.000067512636,0.00023325435,0.0027200019,0.00012786782,0.044968095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994374,0.0001339465,0.00003089682,0.00015212037,0.000097722135,0.00014800293],"domain_scores_gemma":[0.99867874,0.0004647492,0.000286247,0.00022699934,0.00013689257,0.00020637306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026730896,0.0007623676,0.0005619791,0.0010603504,0.0014852096,0.0015828407,0.0013965672,0.0012516249,0.017174857],"category_scores_gemma":[0.0021931066,0.0004027896,0.0003491865,0.0011431,0.0010111665,0.0016569345,0.0019914943,0.00089570775,0.0026648853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017931053,0.00036730026,0.006060914,0.0007808935,0.0001517986,0.0035019354,0.0011812818,0.02080876,0.037299823,0.77703846,0.034800548,0.11621517],"study_design_scores_gemma":[0.00027675813,0.00045030026,0.010810722,0.00026610142,0.00016025371,0.0038233404,0.0017873937,0.04576653,0.041706033,0.7769152,0.11792165,0.000115716735],"about_ca_topic_score_codex":0.0012178731,"about_ca_topic_score_gemma":0.002209343,"teacher_disagreement_score":0.017174857,"about_ca_system_score_codex":0.0006969599,"about_ca_system_score_gemma":0.0004910998,"threshold_uncertainty_score":0.05745566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4944068,0.005351019,0.23978959,0.012522828,0.0008558168,0.00044155825,0.0046741283,0.0009795949,0.24097861],"genre_scores_gemma":[0.8207619,0.0037070068,0.11621241,0.002044551,0.0007163281,0.00033416526,0.003872821,0.0006277549,0.05172304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901307,0.00032412467,0.000037707978,0.00017702581,0.0001648824,0.00028312506],"domain_scores_gemma":[0.9961457,0.0027981976,0.00035846277,0.00027265915,0.0001603096,0.0002645595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009538847,0.000953356,0.0011451603,0.0010824538,0.0021823894,0.0034030816,0.0018653042,0.00247174,0.018531386],"category_scores_gemma":[0.0080014495,0.00070299266,0.000781324,0.0021627478,0.0014573607,0.004617416,0.002462925,0.0026426732,0.0023507075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010391283,0.0004884467,0.0019892035,0.0009193155,0.00016725781,0.00082545663,0.00085984654,0.11688267,0.0049897023,0.646446,0.13514392,0.09024902],"study_design_scores_gemma":[0.00011434283,0.000100485624,0.0010945349,0.00014923773,0.000045400273,0.00051169016,0.0006004145,0.14265828,0.002051571,0.83727014,0.015365117,0.000038657912],"about_ca_topic_score_codex":0.0036252595,"about_ca_topic_score_gemma":0.0042360323,"teacher_disagreement_score":0.018531386,"about_ca_system_score_codex":0.0016369442,"about_ca_system_score_gemma":0.001139376,"threshold_uncertainty_score":0.06199366},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39176577,0.0010242916,0.08498331,0.0030642492,0.00061333424,0.00022935889,0.0039601475,0.0009527109,0.5134068],"genre_scores_gemma":[0.91398996,0.00040255729,0.018505875,0.0005288004,0.000118455835,0.00007333448,0.0013704037,0.00013172528,0.064878866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975055,0.000040617535,0.000007367806,0.00003705418,0.00008360424,0.00008082794],"domain_scores_gemma":[0.9993235,0.00018837037,0.00011312418,0.00012890056,0.00014899235,0.00009704672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014614017,0.00031287642,0.00031049442,0.0008883753,0.0010620184,0.0012094652,0.00056860165,0.0006215261,0.021297608],"category_scores_gemma":[0.0010349586,0.00020183112,0.0002773331,0.00088413706,0.00080193224,0.000903177,0.0008673275,0.0011457152,0.0019604426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019334443,0.000059372665,0.0005300529,0.00011675857,0.00001669171,0.00047515216,0.00018864403,0.0044424566,0.0068440707,0.9434799,0.01792461,0.025728885],"study_design_scores_gemma":[0.000060927232,0.00004362586,0.0014720655,0.000033262313,0.000015097859,0.0004554781,0.0002485325,0.0200603,0.005118717,0.93130934,0.041148983,0.00003356248],"about_ca_topic_score_codex":0.0067658885,"about_ca_topic_score_gemma":0.010981322,"teacher_disagreement_score":0.021297608,"about_ca_system_score_codex":0.0013620555,"about_ca_system_score_gemma":0.0014735423,"threshold_uncertainty_score":0.07124758},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34709883,0.00050910946,0.22833139,0.0017533744,0.00068613014,0.00046296895,0.00412807,0.0012439701,0.41578615],"genre_scores_gemma":[0.7320511,0.0004456278,0.08403564,0.0007793961,0.000116005096,0.00022961255,0.0043195295,0.00050830445,0.17751487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999788,0.000033320874,0.0000069114153,0.00003928754,0.000051582443,0.0000809165],"domain_scores_gemma":[0.9996805,0.000057710913,0.000040349307,0.000056657544,0.000077776596,0.00008686483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012556431,0.00042775192,0.00026078522,0.00082927506,0.0009160309,0.0013595388,0.0005085904,0.0006770597,0.033626936],"category_scores_gemma":[0.00040113536,0.00019873523,0.0004932306,0.00059640605,0.0006982606,0.0008811728,0.0008427021,0.0007943461,0.00581523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005365469,0.00029504992,0.0013111515,0.0003174856,0.00005445342,0.0019081855,0.00093455147,0.013073452,0.04183308,0.83351696,0.037053823,0.0691654],"study_design_scores_gemma":[0.00009790735,0.0001438227,0.0039328053,0.000110572604,0.00004864877,0.0011194766,0.0012179784,0.03462512,0.011490663,0.84847564,0.0986966,0.00004082577],"about_ca_topic_score_codex":0.0027248156,"about_ca_topic_score_gemma":0.004363728,"teacher_disagreement_score":0.033626936,"about_ca_system_score_codex":0.00067554985,"about_ca_system_score_gemma":0.0006139811,"threshold_uncertainty_score":0.112493336},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12141726,0.0062730242,0.36573324,0.011051632,0.0016026789,0.00019577831,0.0014604224,0.00053344655,0.49173254],"genre_scores_gemma":[0.8775808,0.0039603747,0.04542082,0.0041690646,0.0016437661,0.0001923909,0.0010167602,0.00026223238,0.06575381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931276,0.00015227601,0.000029411889,0.00015459569,0.00019707765,0.00015385397],"domain_scores_gemma":[0.9952076,0.0028657683,0.0004618953,0.00052398676,0.00041878643,0.0005220121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006829238,0.00064465654,0.0005108146,0.002550432,0.0012431323,0.0020648353,0.001160392,0.0013793048,0.014840765],"category_scores_gemma":[0.0047028163,0.00045510393,0.0008574226,0.001673044,0.0025261154,0.0031334844,0.002218642,0.002334745,0.0016625323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004497007,0.000057580983,0.00051628065,0.00015323362,0.000015394908,0.00026636227,0.0003392037,0.0015267552,0.0020281037,0.9706768,0.009579006,0.01479626],"study_design_scores_gemma":[0.000027075233,0.000042421285,0.00086122786,0.00005973461,0.000024814704,0.0004613088,0.00021257342,0.0059130336,0.0021405073,0.97320807,0.01702171,0.000027503993],"about_ca_topic_score_codex":0.0014512609,"about_ca_topic_score_gemma":0.0021162683,"teacher_disagreement_score":0.014840765,"about_ca_system_score_codex":0.0013541585,"about_ca_system_score_gemma":0.00080645434,"threshold_uncertainty_score":0.04964727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32403484,0.0016429003,0.3518389,0.0050891493,0.00067424454,0.00025677073,0.0011224343,0.0009736493,0.31436718],"genre_scores_gemma":[0.8972187,0.0004601767,0.050777197,0.0008692641,0.00020265965,0.00023271145,0.00038010412,0.00012584025,0.049733263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987717,0.00049729226,0.000050637966,0.00017302096,0.00022611665,0.0002812857],"domain_scores_gemma":[0.99774146,0.00088691496,0.00050776725,0.00039623945,0.0002709598,0.0001966522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121169,0.0005491122,0.00037177032,0.00130605,0.0014874607,0.0024712698,0.00072517013,0.0011866812,0.013572647],"category_scores_gemma":[0.0033142115,0.00031303277,0.0005423028,0.00085619965,0.0017871114,0.0025372945,0.0016272097,0.001235376,0.0023587728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088890476,0.000024110073,0.00023358113,0.000033089946,0.000007845413,0.00011082946,0.00011516794,0.002065799,0.0009990332,0.98507255,0.0031303596,0.008118749],"study_design_scores_gemma":[0.000034978035,0.000031291733,0.00017276299,0.00003441769,0.000009559954,0.0001738918,0.00009587505,0.009154092,0.0009982558,0.97885084,0.010427486,0.000016504498],"about_ca_topic_score_codex":0.001167713,"about_ca_topic_score_gemma":0.0020089822,"teacher_disagreement_score":0.013572647,"about_ca_system_score_codex":0.0015980098,"about_ca_system_score_gemma":0.0012308682,"threshold_uncertainty_score":0.04540497},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013431662,0.017831564,0.13597788,0.13392515,0.036404364,0.00015862403,0.000990051,0.0007910451,0.6604897],"genre_scores_gemma":[0.32822767,0.031694222,0.13740377,0.15486528,0.03418561,0.0006539346,0.0012148517,0.0011214791,0.31063312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987852,0.00038879228,0.000051975545,0.00021911299,0.0004053287,0.00014963812],"domain_scores_gemma":[0.99812907,0.0010038072,0.00012317456,0.0002780805,0.00033094003,0.0001350105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012834405,0.00087827205,0.00068385486,0.0011103172,0.0023770086,0.002315114,0.002063968,0.0024405108,0.03537612],"category_scores_gemma":[0.0053806975,0.00031250916,0.0007912212,0.0010721786,0.0038773958,0.005660238,0.0022547578,0.0047296686,0.0075600813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006697417,0.00004344166,0.00032536383,0.00031580124,0.000029011033,0.0005450622,0.00029171878,0.0011108887,0.0013140267,0.8708547,0.105319135,0.019783987],"study_design_scores_gemma":[0.00001517768,0.00004247574,0.00052132,0.00010622536,0.000010301799,0.00040365977,0.00032285732,0.00082021055,0.00067083596,0.7918822,0.2051801,0.000024667945],"about_ca_topic_score_codex":0.0019249878,"about_ca_topic_score_gemma":0.00236825,"teacher_disagreement_score":0.03537612,"about_ca_system_score_codex":0.000916711,"about_ca_system_score_gemma":0.00041587476,"threshold_uncertainty_score":0.11834496},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29278103,0.010900818,0.18884805,0.010431052,0.0020212233,0.000095380674,0.0004973798,0.00029120455,0.49413392],"genre_scores_gemma":[0.9209778,0.0035815379,0.016372733,0.0012636359,0.0021279827,0.000089533794,0.0002553243,0.000114213355,0.055217296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00019666845,0.000022521486,0.000076841345,0.00012859303,0.00011056863],"domain_scores_gemma":[0.99888974,0.00058224355,0.00012848865,0.00015081129,0.00011629855,0.00013244576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672124,0.00066559156,0.0005578926,0.0018677312,0.0012894438,0.0018302039,0.00060659525,0.0009645108,0.01016983],"category_scores_gemma":[0.0029496371,0.00029554148,0.00053206575,0.0010406426,0.0037118613,0.005289863,0.0019384773,0.0017833234,0.0016818006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138000805,0.000007831467,0.00008346597,0.000015319472,0.0000030992712,0.000042027965,0.00011102035,0.00038715173,0.00029420396,0.99401546,0.0014988135,0.0035278227],"study_design_scores_gemma":[0.000005900574,0.000008110094,0.000089498346,0.000009784778,0.0000024573944,0.000058069476,0.000043844764,0.0013616189,0.00014135659,0.99453676,0.0037390764,0.000003670688],"about_ca_topic_score_codex":0.0007040798,"about_ca_topic_score_gemma":0.00074115023,"teacher_disagreement_score":0.01016983,"about_ca_system_score_codex":0.000856222,"about_ca_system_score_gemma":0.0004118212,"threshold_uncertainty_score":0.034021497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5150805,0.0011852556,0.21144411,0.010854324,0.0026054136,0.0008915988,0.010370704,0.0035919268,0.24397625],"genre_scores_gemma":[0.9331399,0.00046109478,0.04315648,0.0015821427,0.0007204205,0.00042088956,0.0047066803,0.00027568135,0.015536785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797314,0.0002768377,0.00021736785,0.00068539096,0.00036491596,0.00048237538],"domain_scores_gemma":[0.98368293,0.007183248,0.0018167709,0.0017049657,0.002858164,0.002753896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123099,0.00086149276,0.0011057578,0.0021508683,0.0030219231,0.0032969632,0.0015624356,0.0029183074,0.03005646],"category_scores_gemma":[0.01933116,0.00096170756,0.0012277307,0.0014919903,0.0032785966,0.005666296,0.002947593,0.0035993867,0.0058618556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011133472,0.0006509409,0.007887295,0.0008782055,0.00013007966,0.004018365,0.0010903663,0.0057353205,0.036027208,0.88011193,0.036717415,0.02563959],"study_design_scores_gemma":[0.00049916323,0.00050609827,0.0074002743,0.00035888172,0.00014970785,0.004935476,0.002080342,0.024476975,0.025436006,0.8855175,0.048409384,0.00023025482],"about_ca_topic_score_codex":0.0021280714,"about_ca_topic_score_gemma":0.0033749938,"teacher_disagreement_score":0.03005646,"about_ca_system_score_codex":0.0011206142,"about_ca_system_score_gemma":0.0019835087,"threshold_uncertainty_score":0.100548804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5702141,0.0010996734,0.18758722,0.004463896,0.00046164368,0.00009846928,0.0015890879,0.0005232081,0.2339628],"genre_scores_gemma":[0.9673808,0.00047091884,0.014507099,0.00065061176,0.000125545,0.000052779273,0.00055774976,0.00011603664,0.01613845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996208,0.00006467578,0.000018471486,0.000114280294,0.0000754059,0.00010637192],"domain_scores_gemma":[0.99783725,0.0013171285,0.0002666274,0.00027326387,0.000109063185,0.00019670109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041553282,0.00034830594,0.0003961637,0.0005765524,0.00086047995,0.0014915038,0.00082507235,0.00080292096,0.014632986],"category_scores_gemma":[0.0027082749,0.00033955305,0.000707895,0.00085526594,0.0013730709,0.0030925248,0.0014188895,0.0017736861,0.0010071103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034863278,0.000083627034,0.00327397,0.00033571344,0.000041399486,0.0004277561,0.00041726397,0.009976896,0.010929429,0.92969775,0.014037767,0.030429643],"study_design_scores_gemma":[0.00006107982,0.000068027264,0.0020942658,0.00004311344,0.000037670296,0.00069490785,0.00015119737,0.014289206,0.0041955514,0.96827996,0.010056896,0.0000282226],"about_ca_topic_score_codex":0.0009416631,"about_ca_topic_score_gemma":0.0010976164,"teacher_disagreement_score":0.014632986,"about_ca_system_score_codex":0.0006456698,"about_ca_system_score_gemma":0.00046466288,"threshold_uncertainty_score":0.04895228},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2610222,0.0017726201,0.31576473,0.004205071,0.00093098124,0.00031917295,0.0037114613,0.0015422954,0.41073146],"genre_scores_gemma":[0.82705647,0.001437296,0.0633448,0.0012623003,0.00027432662,0.00027237955,0.002495945,0.00030044216,0.10355609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999159,0.00016579824,0.0000619684,0.00024723262,0.00017763262,0.00018842955],"domain_scores_gemma":[0.9966258,0.0013118117,0.00053642766,0.0006790717,0.00052252074,0.00032437214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044734485,0.000727394,0.0005367246,0.0021212758,0.0021279743,0.002827528,0.0013338514,0.0014372051,0.020726651],"category_scores_gemma":[0.0039113294,0.0005533271,0.00065526937,0.0019028762,0.001870815,0.0042129885,0.001988818,0.0017015622,0.004596413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014112596,0.0000605844,0.0005522165,0.0001741133,0.00003579842,0.0004053494,0.0002341137,0.0024110763,0.0026542742,0.9670537,0.009046483,0.017231023],"study_design_scores_gemma":[0.000028064964,0.00002304195,0.0006013487,0.00008077881,0.000033895416,0.0005344949,0.00020406417,0.0081238765,0.0020990702,0.9604652,0.027780542,0.00002567656],"about_ca_topic_score_codex":0.0014141486,"about_ca_topic_score_gemma":0.002247784,"teacher_disagreement_score":0.020726651,"about_ca_system_score_codex":0.00094339135,"about_ca_system_score_gemma":0.00081611925,"threshold_uncertainty_score":0.06933755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.752605,0.00050888717,0.20400596,0.00018969699,0.00003592849,0.0001282355,0.001284483,0.0005691806,0.040672615],"genre_scores_gemma":[0.8481698,0.00015133443,0.1433822,0.00006038112,0.00001007318,0.00008154092,0.0007532282,0.00009241154,0.0072990553],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997354,0.000064564934,0.000016584858,0.000057700763,0.000058063986,0.00006765721],"domain_scores_gemma":[0.9994499,0.00014992389,0.00014947903,0.00010184606,0.00008415038,0.00006469822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020076416,0.00038686418,0.00027456591,0.00034560525,0.0003016174,0.0005378164,0.00028823715,0.00042052066,0.005175444],"category_scores_gemma":[0.00096915616,0.00034540743,0.00027350255,0.0003303744,0.00034531808,0.0007414137,0.00044541009,0.00030486606,0.000916615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024158154,0.0003678337,0.011350191,0.0011906628,0.0001835363,0.0011513192,0.0006868638,0.15308815,0.5087449,0.13452102,0.007635431,0.17866434],"study_design_scores_gemma":[0.0004935803,0.0038927482,0.01947097,0.0003223575,0.00031800164,0.003060765,0.0009970792,0.3849186,0.31644922,0.18537451,0.08456844,0.00013370218],"about_ca_topic_score_codex":0.00076310243,"about_ca_topic_score_gemma":0.0016587409,"teacher_disagreement_score":0.005175444,"about_ca_system_score_codex":0.000510839,"about_ca_system_score_gemma":0.0004704166,"threshold_uncertainty_score":0.0173136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50669485,0.0007558371,0.2301463,0.0016068477,0.0011465503,0.00036020597,0.006861159,0.002018732,0.25040948],"genre_scores_gemma":[0.9358707,0.00023550993,0.035547744,0.00035330266,0.000062855645,0.00013436098,0.0023176572,0.0001338369,0.025344016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996327,0.00006298665,0.00002621126,0.00008399122,0.000060948936,0.00013323534],"domain_scores_gemma":[0.9993388,0.000103362276,0.00011405928,0.00016210876,0.00013444466,0.00014718059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027741032,0.00037793812,0.0004130274,0.0012426019,0.001899577,0.0015400545,0.00057714316,0.0009970061,0.027832512],"category_scores_gemma":[0.0010182618,0.00019456568,0.00045015677,0.0008963237,0.0008620363,0.0015414181,0.0012065495,0.0005898432,0.0035834424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003324219,0.00007694096,0.0021811668,0.00033401014,0.00006686724,0.0008097018,0.00034607228,0.004396517,0.020092107,0.9222788,0.02496123,0.02412414],"study_design_scores_gemma":[0.000087240674,0.00024189422,0.0036937932,0.00013353102,0.0001077258,0.0019639013,0.0012299834,0.028285528,0.02272873,0.8759852,0.06543152,0.00011097191],"about_ca_topic_score_codex":0.0014330101,"about_ca_topic_score_gemma":0.0022909446,"teacher_disagreement_score":0.027832512,"about_ca_system_score_codex":0.00066262257,"about_ca_system_score_gemma":0.0008517652,"threshold_uncertainty_score":0.09310901},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2918932,0.0059199436,0.41848263,0.0046602413,0.0007100846,0.00010837844,0.0011296201,0.00032087686,0.27677497],"genre_scores_gemma":[0.9275613,0.0030876936,0.047383346,0.000640091,0.00035342845,0.000103566956,0.0007155381,0.00009727684,0.02005789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992225,0.0002503509,0.0000407888,0.0001134629,0.00020653212,0.00016637347],"domain_scores_gemma":[0.99525225,0.003194228,0.0003669399,0.00037278197,0.0004693508,0.00034437314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090001523,0.0004111236,0.0005900785,0.0019666653,0.0017037651,0.0026980618,0.0007351034,0.0014413998,0.011149171],"category_scores_gemma":[0.0060487804,0.0006276425,0.00046897156,0.0015178757,0.0024284082,0.0059839115,0.0022294596,0.0022005204,0.0015018872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028309485,0.000015375696,0.00023850336,0.000054251643,0.000007796387,0.00008839272,0.00014790265,0.0019956145,0.00067579874,0.9882576,0.0029425588,0.0055478844],"study_design_scores_gemma":[0.000008518283,0.000013133293,0.0001468582,0.000027864604,0.0000057682455,0.00016513729,0.00017131583,0.006289059,0.0003735022,0.98938155,0.0034081792,0.000009232815],"about_ca_topic_score_codex":0.00067873683,"about_ca_topic_score_gemma":0.001130297,"teacher_disagreement_score":0.011149171,"about_ca_system_score_codex":0.0009231472,"about_ca_system_score_gemma":0.00058247324,"threshold_uncertainty_score":0.037297666},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21223298,0.01969216,0.22095834,0.010582068,0.0029501305,0.00026414686,0.0028309529,0.0017745597,0.5287147],"genre_scores_gemma":[0.9140094,0.005067581,0.043049064,0.0014256513,0.00251521,0.000359151,0.0011546961,0.00055086496,0.03186832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710506,0.00041659348,0.00011249671,0.0005963535,0.0010137946,0.00075572],"domain_scores_gemma":[0.98102725,0.012088309,0.0011712402,0.0021271599,0.0011209105,0.0024651096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023848654,0.0015874548,0.002231412,0.005027357,0.003324399,0.00687786,0.0044889897,0.0029959634,0.018268827],"category_scores_gemma":[0.029272227,0.00091299333,0.001118176,0.0036162776,0.004178891,0.010133329,0.0050939284,0.006576191,0.0039078626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034871013,0.00011161752,0.0012819187,0.00033496623,0.000052441952,0.00023794231,0.00037163778,0.0071592135,0.0041202456,0.9460904,0.020512978,0.019377928],"study_design_scores_gemma":[0.000051621,0.00008873731,0.0010584625,0.00016280776,0.00008262397,0.0006304457,0.000121658595,0.042445324,0.0033015832,0.93490154,0.017088016,0.000067130284],"about_ca_topic_score_codex":0.0014758869,"about_ca_topic_score_gemma":0.001537557,"teacher_disagreement_score":0.018268827,"about_ca_system_score_codex":0.0040364037,"about_ca_system_score_gemma":0.0020310848,"threshold_uncertainty_score":0.061115324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36927158,0.0012979987,0.41437212,0.00196203,0.00036778557,0.00017028832,0.0019737023,0.00089792913,0.2096866],"genre_scores_gemma":[0.90070987,0.0009385199,0.063600816,0.00071156566,0.00027868152,0.00026937452,0.0012391198,0.00029760678,0.031954486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997195,0.00078197115,0.00016639555,0.0005424659,0.0007349022,0.0005792133],"domain_scores_gemma":[0.9938806,0.0033915846,0.000619484,0.0011219726,0.00061657117,0.000369681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013716755,0.0008654403,0.00095226936,0.0017021511,0.0018221247,0.0033511845,0.0011559355,0.001480427,0.019656418],"category_scores_gemma":[0.0060284766,0.00062112755,0.00089573127,0.0014066263,0.0020689287,0.0032863894,0.002830307,0.0022526477,0.00445864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033939822,0.00008456722,0.0005728348,0.00016652486,0.000035394954,0.0002746738,0.00036587392,0.003996183,0.0069504343,0.94841594,0.0044852397,0.03431296],"study_design_scores_gemma":[0.00006759961,0.00005606546,0.00041865275,0.000051035087,0.000013708008,0.00037017238,0.00015255484,0.0061510806,0.0025470427,0.98111236,0.0090340255,0.000025732928],"about_ca_topic_score_codex":0.0004928363,"about_ca_topic_score_gemma":0.0005605296,"teacher_disagreement_score":0.019656418,"about_ca_system_score_codex":0.00075477385,"about_ca_system_score_gemma":0.00085213216,"threshold_uncertainty_score":0.065757275},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29425007,0.0014431428,0.2640369,0.005034859,0.0009592958,0.00025843017,0.0044480194,0.0009389783,0.42863026],"genre_scores_gemma":[0.79356194,0.00064377004,0.08757823,0.0013681155,0.00034837823,0.00025645673,0.0025136753,0.00015388938,0.113575585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00015150674,0.00004556734,0.00015815793,0.00015145661,0.00016309174],"domain_scores_gemma":[0.9988464,0.00038539246,0.00022040067,0.0002330454,0.00018007768,0.0001347222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026716728,0.00054352457,0.00044665392,0.000870158,0.0014843958,0.0025469856,0.0012487491,0.0012317278,0.026449049],"category_scores_gemma":[0.0014893465,0.00040429644,0.00058912684,0.0010806107,0.00085168204,0.0029985027,0.0014229965,0.0016151014,0.004209851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025805185,0.0001337173,0.0006783398,0.0001860199,0.000067311,0.000447554,0.00023354564,0.0048965337,0.00802248,0.93241906,0.017186765,0.0354706],"study_design_scores_gemma":[0.000074929885,0.00009329035,0.00090525724,0.000085371765,0.00006042932,0.0008912951,0.0003538035,0.024313662,0.008000907,0.89308935,0.072092004,0.000039734587],"about_ca_topic_score_codex":0.0010684707,"about_ca_topic_score_gemma":0.0021168243,"teacher_disagreement_score":0.026449049,"about_ca_system_score_codex":0.0010859304,"about_ca_system_score_gemma":0.0006911623,"threshold_uncertainty_score":0.08848089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4328569,0.0025274958,0.13250327,0.0033207152,0.00056138006,0.00009420369,0.0025682827,0.0005819955,0.42498583],"genre_scores_gemma":[0.9468956,0.0010080903,0.017454123,0.0003078953,0.00012887655,0.00006679704,0.0009763784,0.00011856483,0.03304361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.000094174975,0.000015532905,0.00011132679,0.00015446056,0.00016025173],"domain_scores_gemma":[0.9983255,0.0008668718,0.00015754616,0.00021331267,0.00019584905,0.00024080678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040293648,0.0004894284,0.0004988929,0.001952544,0.0017194869,0.0025799335,0.00086456997,0.00082473597,0.021168327],"category_scores_gemma":[0.002477721,0.00033065135,0.00035292076,0.0016458131,0.0012519534,0.0027004005,0.0014136106,0.0017505592,0.0022653814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020523637,0.000053578176,0.0009918276,0.00019602683,0.000026572492,0.00016580288,0.00029182574,0.01474685,0.0095937615,0.92877597,0.01941424,0.02553825],"study_design_scores_gemma":[0.000031577176,0.0000511078,0.0014728651,0.000065176646,0.000034500234,0.0003831035,0.00025030837,0.044448067,0.0054685655,0.9263047,0.02146184,0.000028256025],"about_ca_topic_score_codex":0.002528665,"about_ca_topic_score_gemma":0.005330956,"teacher_disagreement_score":0.021168327,"about_ca_system_score_codex":0.0022853678,"about_ca_system_score_gemma":0.00080703315,"threshold_uncertainty_score":0.07081509},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112979874,0.0071719345,0.20781396,0.011236068,0.001987801,0.00018486274,0.0014699288,0.00053298357,0.6566226],"genre_scores_gemma":[0.80683,0.004382345,0.06372332,0.0044826316,0.002557049,0.00034768035,0.0023309332,0.00038075575,0.11496519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831957,0.00031747046,0.000100750694,0.0003565468,0.000579153,0.00032647647],"domain_scores_gemma":[0.9945134,0.0028775355,0.00036394037,0.000789933,0.0006271419,0.00082799944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013079429,0.00090611674,0.0011005271,0.0037324436,0.0027801925,0.0032117637,0.001617583,0.001612094,0.014848902],"category_scores_gemma":[0.0052957595,0.00051124673,0.0012586106,0.0028877023,0.0032031713,0.008036114,0.0039862134,0.0046317116,0.0024847372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053485768,0.000058036658,0.00033121178,0.000106478554,0.0000137111265,0.00013859055,0.00025730624,0.0004402333,0.0008299315,0.98360956,0.0055601713,0.008601375],"study_design_scores_gemma":[0.000022271728,0.000042756354,0.0007715383,0.000052939435,0.000028799255,0.00051130605,0.00021573111,0.0030933958,0.0018614522,0.9697058,0.023671387,0.000022504752],"about_ca_topic_score_codex":0.0010393546,"about_ca_topic_score_gemma":0.0011946122,"teacher_disagreement_score":0.014848902,"about_ca_system_score_codex":0.0023295328,"about_ca_system_score_gemma":0.00089040323,"threshold_uncertainty_score":0.04967445},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3450368,0.0025544825,0.23193312,0.0027846997,0.00067777775,0.00009462666,0.0007516782,0.00037191878,0.4157949],"genre_scores_gemma":[0.9395861,0.000894283,0.02369777,0.00037459037,0.00021876216,0.000073437746,0.00038756756,0.000094974894,0.034672514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910814,0.0003428872,0.000037014797,0.0001174672,0.00022548788,0.00016894897],"domain_scores_gemma":[0.9987795,0.0006161807,0.00016058741,0.00011555982,0.0001790669,0.0001490593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047568307,0.00047104305,0.00037387578,0.0018063302,0.0015871397,0.0033177808,0.000503213,0.00075889385,0.0122963665],"category_scores_gemma":[0.0022600817,0.00034569588,0.0004344474,0.001145197,0.002595807,0.00391511,0.0018441281,0.0016560017,0.0013535338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011604108,0.0000050721865,0.00006726798,0.000011167408,0.0000024140068,0.000049847647,0.00005181259,0.00036156792,0.00021292751,0.9966275,0.00062587176,0.0019729112],"study_design_scores_gemma":[0.0000113490805,0.000011694297,0.00017395172,0.000022362901,0.0000057384555,0.00020124539,0.0001799706,0.004276232,0.0008161635,0.9864079,0.0078838,0.000009733191],"about_ca_topic_score_codex":0.0012378466,"about_ca_topic_score_gemma":0.0016867587,"teacher_disagreement_score":0.0122963665,"about_ca_system_score_codex":0.0010372116,"about_ca_system_score_gemma":0.0005883931,"threshold_uncertainty_score":0.04113549},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32872328,0.0012890832,0.20686105,0.0044807754,0.0014260429,0.00026186838,0.0033147228,0.0007707921,0.4528724],"genre_scores_gemma":[0.8571833,0.00061686814,0.05260676,0.0014627186,0.00034301289,0.00026628762,0.0024708235,0.00037070643,0.0846795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975345,0.0006400292,0.000107972795,0.0004498204,0.00058763643,0.00067994895],"domain_scores_gemma":[0.9967393,0.0017960316,0.00027597937,0.00050974014,0.00039783953,0.00028102993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912136,0.00080813176,0.001025018,0.002444291,0.0031158244,0.0029194024,0.0014376965,0.0012732944,0.035291627],"category_scores_gemma":[0.0045867455,0.0004797173,0.00080546364,0.0019600694,0.0025033667,0.004341908,0.003884327,0.0024869116,0.0063872007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017996755,0.00006848859,0.00023454605,0.00006119094,0.00001460238,0.00017235099,0.00023918503,0.0012747481,0.0012827226,0.97648025,0.007440232,0.012551705],"study_design_scores_gemma":[0.000051686115,0.000024662477,0.0002760314,0.00004171304,0.000011293609,0.00016057972,0.00017559399,0.004083152,0.001180431,0.9826627,0.011312745,0.00001939339],"about_ca_topic_score_codex":0.00137645,"about_ca_topic_score_gemma":0.0023201052,"teacher_disagreement_score":0.035291627,"about_ca_system_score_codex":0.0018205296,"about_ca_system_score_gemma":0.00088120304,"threshold_uncertainty_score":0.11806232},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31314754,0.001522601,0.28018087,0.002761341,0.0005936344,0.00026492594,0.0006622009,0.00054078765,0.4003261],"genre_scores_gemma":[0.88830805,0.0008168953,0.074150085,0.00050527835,0.00013131095,0.00022478553,0.00036744692,0.00015282957,0.035343405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.00048747746,0.00005469054,0.00013126186,0.00020288552,0.00021780186],"domain_scores_gemma":[0.9984465,0.0007803472,0.0001917912,0.00031337148,0.00015321434,0.00011485702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008787112,0.0005803052,0.00036511474,0.0010180183,0.0018028814,0.0021225954,0.00063191645,0.0013389967,0.016901217],"category_scores_gemma":[0.0031737462,0.00045913827,0.0008205203,0.0006365933,0.0021149174,0.0025281154,0.001260071,0.001234424,0.0024626872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013404507,0.000035850997,0.00044646466,0.00006985055,0.000017830387,0.000277134,0.00023825598,0.004480785,0.0022684128,0.9719344,0.0032517505,0.016845295],"study_design_scores_gemma":[0.000038037175,0.000060610855,0.00030233403,0.000079962156,0.000028039796,0.00034143912,0.00018015577,0.010225601,0.001893227,0.971686,0.015138639,0.00002592137],"about_ca_topic_score_codex":0.0007042022,"about_ca_topic_score_gemma":0.0013940332,"teacher_disagreement_score":0.016901217,"about_ca_system_score_codex":0.00084072794,"about_ca_system_score_gemma":0.0007952471,"threshold_uncertainty_score":0.05654025},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36929014,0.0010648402,0.23495881,0.0024062246,0.0012862033,0.0006229174,0.01367114,0.0013045109,0.37539512],"genre_scores_gemma":[0.7562272,0.00068593357,0.10211014,0.0009809189,0.00009606379,0.00027083093,0.0121491505,0.0004482546,0.12703148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997912,0.000027177226,0.000008707181,0.000052866726,0.00003124391,0.0000887936],"domain_scores_gemma":[0.99978346,0.000036123798,0.000033932964,0.000033833632,0.000052777104,0.000059885908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011142717,0.00063851435,0.00038464795,0.000985642,0.00093522633,0.0011702842,0.0007008664,0.00066883647,0.038948916],"category_scores_gemma":[0.00038049088,0.00020733083,0.00038626828,0.0007118304,0.00065860833,0.00075640687,0.0008851384,0.0009534154,0.009116996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013469688,0.00051885576,0.0034690136,0.0010346832,0.00016626413,0.0034003467,0.0009173003,0.011801143,0.08459285,0.7017532,0.076112695,0.114886776],"study_design_scores_gemma":[0.0002260357,0.0001719499,0.00884169,0.00031734406,0.00011483228,0.0031317258,0.0025641737,0.024899894,0.020312306,0.77017826,0.16916944,0.00007235843],"about_ca_topic_score_codex":0.0018289142,"about_ca_topic_score_gemma":0.0020475597,"teacher_disagreement_score":0.038948916,"about_ca_system_score_codex":0.0005308224,"about_ca_system_score_gemma":0.00056288106,"threshold_uncertainty_score":0.13029712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29288238,0.0009787239,0.6306033,0.0011896543,0.00024765282,0.00021708639,0.0010840142,0.0009228987,0.071874246],"genre_scores_gemma":[0.78071773,0.00087593845,0.19311368,0.00058442965,0.000268401,0.00022947573,0.0015219386,0.00030883722,0.022379585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.00020562751,0.00007179169,0.000406189,0.00015330363,0.00028911588],"domain_scores_gemma":[0.99780244,0.00076572,0.0002497301,0.00043850637,0.00033595858,0.00040758072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010073488,0.00058451394,0.0005058817,0.0006263771,0.0014154771,0.0016242602,0.000479967,0.0007394475,0.011267816],"category_scores_gemma":[0.003129739,0.0006450942,0.0015427932,0.0006176535,0.0018322408,0.005000654,0.002398436,0.0024681955,0.001973888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022438988,0.00007453043,0.0011686985,0.00014843888,0.000023515913,0.00055608444,0.00121461,0.0075968346,0.010488937,0.942207,0.005424314,0.030872656],"study_design_scores_gemma":[0.00004696724,0.00011212939,0.00083076156,0.00008656024,0.000024784176,0.0005423472,0.00052127364,0.020386897,0.0042089866,0.9561293,0.017065827,0.000044245866],"about_ca_topic_score_codex":0.0018067455,"about_ca_topic_score_gemma":0.0023665123,"teacher_disagreement_score":0.011267816,"about_ca_system_score_codex":0.00079559686,"about_ca_system_score_gemma":0.00062702666,"threshold_uncertainty_score":0.037694573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14110792,0.0009760344,0.55886555,0.0008910818,0.0008252075,0.00095946697,0.005439741,0.0018520994,0.28908294],"genre_scores_gemma":[0.7076963,0.00069789746,0.19109835,0.00064883503,0.00013715398,0.00095393637,0.0052769464,0.0006753483,0.092815176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992086,0.00018621245,0.000053823424,0.0001802399,0.00016980678,0.00020123788],"domain_scores_gemma":[0.99844235,0.00045201648,0.00012509042,0.00050654716,0.00031556873,0.00015847755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047129046,0.0006517733,0.00055071164,0.0015533528,0.0019439268,0.002483396,0.001132186,0.00115511,0.021791833],"category_scores_gemma":[0.002605628,0.00041126646,0.0005773979,0.0013947809,0.0011645327,0.0026375053,0.0014522618,0.0010266276,0.0046682367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029296763,0.000088890185,0.0006197158,0.00018371933,0.00003555853,0.00033506515,0.0003029505,0.0051312074,0.008680522,0.93980646,0.013511778,0.031011201],"study_design_scores_gemma":[0.000092215174,0.00009262184,0.0007282751,0.00016331841,0.000062766776,0.00075927237,0.00056677294,0.028967533,0.016354883,0.8443038,0.10784984,0.00005869256],"about_ca_topic_score_codex":0.0014699901,"about_ca_topic_score_gemma":0.0033270593,"teacher_disagreement_score":0.021791833,"about_ca_system_score_codex":0.0009925966,"about_ca_system_score_gemma":0.0010198837,"threshold_uncertainty_score":0.07290101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96741986,0.00007765685,0.023583952,0.00015278516,0.000015658079,0.000016374119,0.00013051991,0.00009377018,0.0085093565],"genre_scores_gemma":[0.990026,0.000041804033,0.005852659,0.000020864307,0.000018835783,0.000013148517,0.00017386815,0.000032365788,0.0038204934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975437,0.000040200262,0.000012397269,0.000058046484,0.000046420315,0.00008857711],"domain_scores_gemma":[0.9994287,0.00023071244,0.00011108516,0.000058406833,0.00005469156,0.000116398034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027661773,0.00033062522,0.0002896843,0.0014820788,0.0006569414,0.0018642907,0.00044836968,0.00037250007,0.0053626015],"category_scores_gemma":[0.0013507181,0.00019143916,0.00043611776,0.0007241857,0.0014598923,0.0021870618,0.0009093483,0.0006493305,0.0008572621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010213339,0.00021364632,0.018626958,0.00014847817,0.00003540948,0.0010882051,0.0030380052,0.007135922,0.029686524,0.84891766,0.0026127275,0.08747519],"study_design_scores_gemma":[0.00009754027,0.000275602,0.012454283,0.000043810862,0.00003949946,0.00090586493,0.0015606235,0.09038778,0.042253796,0.8431609,0.008717303,0.000103031416],"about_ca_topic_score_codex":0.0008453486,"about_ca_topic_score_gemma":0.001008616,"teacher_disagreement_score":0.0053626015,"about_ca_system_score_codex":0.00083559053,"about_ca_system_score_gemma":0.00041301284,"threshold_uncertainty_score":0.017939687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21174176,0.00043727693,0.7128657,0.0005597892,0.00009147074,0.00016558316,0.0010751464,0.0004208202,0.07264242],"genre_scores_gemma":[0.6414639,0.00069383974,0.31283548,0.00029147128,0.00007674256,0.00019196869,0.002389965,0.00031933494,0.04173723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973816,0.00005449386,0.000014529734,0.000060938335,0.000073750154,0.000058137724],"domain_scores_gemma":[0.99902797,0.00028713574,0.00013810875,0.00020573572,0.00020698895,0.00013405569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026389846,0.00049233815,0.00035352353,0.0011317644,0.0007343139,0.0015352739,0.00071653246,0.00056726864,0.009403807],"category_scores_gemma":[0.0012163313,0.00037758498,0.00066390703,0.0009367013,0.00081328064,0.0018785094,0.00085979106,0.0010822017,0.0010424486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017283077,0.00007592123,0.0007868773,0.00015982983,0.000025771767,0.0001985095,0.00047649938,0.018385768,0.008908066,0.91427356,0.0051563648,0.051380012],"study_design_scores_gemma":[0.00003057509,0.000041666553,0.00089566415,0.000056758505,0.000027028676,0.00028020662,0.00032013265,0.052353993,0.003272032,0.92500395,0.01770188,0.000016119347],"about_ca_topic_score_codex":0.0015825221,"about_ca_topic_score_gemma":0.0024152454,"teacher_disagreement_score":0.009403807,"about_ca_system_score_codex":0.0006220283,"about_ca_system_score_gemma":0.0005324637,"threshold_uncertainty_score":0.031458855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9138596,0.00062119623,0.007921087,0.0014136379,0.00007292311,0.000052361498,0.003966587,0.0002629059,0.07182975],"genre_scores_gemma":[0.9885309,0.00026856904,0.0032022758,0.000073334384,0.000040262603,0.00007476652,0.001280478,0.000051579915,0.0064778007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994404,0.00012726885,0.000024798157,0.00012019916,0.00013887529,0.00014849268],"domain_scores_gemma":[0.99306774,0.0046332274,0.00079932733,0.0003770194,0.0004570503,0.00066560006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172433,0.0003115652,0.00026469954,0.0026451652,0.0013048036,0.0022038552,0.0008891519,0.0008980086,0.0118566295],"category_scores_gemma":[0.0071954397,0.00024566488,0.0002521817,0.001401645,0.0014095327,0.0017396822,0.00088963186,0.0007732206,0.0010399276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035013661,0.00033394832,0.027357724,0.00074285583,0.00020867263,0.0012819091,0.0019772768,0.066589534,0.04594883,0.7354976,0.041967068,0.074593216],"study_design_scores_gemma":[0.0002740569,0.00018261348,0.043701153,0.00024903571,0.00017658334,0.0031773106,0.0013789313,0.16965716,0.019850628,0.7318043,0.029375423,0.00017282556],"about_ca_topic_score_codex":0.0015303966,"about_ca_topic_score_gemma":0.0033434902,"teacher_disagreement_score":0.0118566295,"about_ca_system_score_codex":0.0010789433,"about_ca_system_score_gemma":0.00093528914,"threshold_uncertainty_score":0.039664328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40478903,0.0020677221,0.27189395,0.0016222548,0.00043418407,0.00021078104,0.0022819727,0.0005528046,0.3161473],"genre_scores_gemma":[0.9100092,0.0007660133,0.04576089,0.00040764874,0.00029668902,0.0002648521,0.0012933078,0.00013662469,0.04106475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904007,0.00021408695,0.0000646138,0.0002457503,0.00022328584,0.00021206608],"domain_scores_gemma":[0.9969496,0.0013712429,0.00047192659,0.00041861704,0.00039192202,0.0003966266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007100678,0.00040341675,0.0004871935,0.00223525,0.0016933437,0.0037516584,0.0008793854,0.0009933141,0.014872519],"category_scores_gemma":[0.0035351235,0.0003796013,0.00067052717,0.00187367,0.0019945141,0.005154104,0.001664181,0.001602967,0.0014607434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029224117,0.000013129311,0.00023565278,0.000026759488,0.0000058654614,0.00007635088,0.00011574389,0.00047489264,0.0004746744,0.9920025,0.0013880151,0.005157176],"study_design_scores_gemma":[0.00001605495,0.000017259075,0.00035858474,0.000029121291,0.000011044397,0.00023930901,0.00014582185,0.0047294223,0.0005669618,0.98152965,0.012343573,0.000013179568],"about_ca_topic_score_codex":0.0010187799,"about_ca_topic_score_gemma":0.0012053979,"teacher_disagreement_score":0.014872519,"about_ca_system_score_codex":0.0014439162,"about_ca_system_score_gemma":0.00066360336,"threshold_uncertainty_score":0.049753547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7196638,0.00047932827,0.18164074,0.00046078945,0.00022628653,0.0003206172,0.0015319763,0.0007691955,0.09490728],"genre_scores_gemma":[0.86770093,0.00019939283,0.08996081,0.00022395003,0.000048721206,0.000103203005,0.0020544608,0.00029388897,0.039414644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.000079535894,0.000035644607,0.00014652123,0.00009278385,0.00014089653],"domain_scores_gemma":[0.9992848,0.00016190534,0.00015932486,0.00016005663,0.00013280327,0.00010122564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002415557,0.00041514673,0.00030116743,0.00071622216,0.00094537984,0.001111835,0.00052563165,0.00046200052,0.017068902],"category_scores_gemma":[0.0007866218,0.00033223696,0.0006294373,0.0005503438,0.0005565091,0.0018465637,0.0012599588,0.00072950614,0.0027806354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015357413,0.0005430089,0.005640005,0.0007130828,0.00016321312,0.00268151,0.0018145553,0.009360478,0.09742933,0.7145837,0.01768594,0.14784944],"study_design_scores_gemma":[0.00018763402,0.000735539,0.009026549,0.00023344126,0.00015344634,0.0040598074,0.0019815029,0.033924844,0.1546663,0.6990241,0.09586514,0.00014161762],"about_ca_topic_score_codex":0.0009655866,"about_ca_topic_score_gemma":0.0025242884,"teacher_disagreement_score":0.017068902,"about_ca_system_score_codex":0.0005222186,"about_ca_system_score_gemma":0.0005199386,"threshold_uncertainty_score":0.05710113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09730024,0.0019622466,0.67829514,0.002539084,0.0014245028,0.00013810613,0.0011505196,0.0008563759,0.21633376],"genre_scores_gemma":[0.7822435,0.0011135316,0.10141092,0.0011449644,0.0007877694,0.00014645538,0.00072196807,0.00026407524,0.112166755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999501,0.000116325115,0.0000119415245,0.00008767434,0.0001755159,0.00010755206],"domain_scores_gemma":[0.9991302,0.0002004961,0.000093798015,0.00018722613,0.00025850907,0.00012979552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004129396,0.00061696453,0.0004104142,0.001214266,0.00067674,0.0013624124,0.00044055356,0.0007861812,0.021421183],"category_scores_gemma":[0.0015894679,0.0002113821,0.00042284094,0.00061072066,0.0010051817,0.0013298849,0.0007539231,0.0012239342,0.005079642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007348403,0.00003005411,0.00026757625,0.00008048229,0.00001384812,0.00026177397,0.00020398959,0.0036692766,0.009057069,0.9565918,0.01095524,0.018795324],"study_design_scores_gemma":[0.000032873682,0.00010485884,0.0008764691,0.00006211543,0.0000140107295,0.00086069194,0.00024853114,0.060346656,0.0064718854,0.8909905,0.039926752,0.00006465139],"about_ca_topic_score_codex":0.0015250252,"about_ca_topic_score_gemma":0.002496052,"teacher_disagreement_score":0.021421183,"about_ca_system_score_codex":0.00063291396,"about_ca_system_score_gemma":0.00074387866,"threshold_uncertainty_score":0.071661055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82981646,0.0009712566,0.102853335,0.00057522336,0.00005734533,0.00014420657,0.001381699,0.00018289618,0.06401752],"genre_scores_gemma":[0.9697109,0.00040382327,0.017981447,0.0001565736,0.00011829125,0.00019864977,0.0013723368,0.0000745811,0.009983595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918956,0.00019708794,0.00004096873,0.00019376128,0.0001559662,0.00022266827],"domain_scores_gemma":[0.9975867,0.0009284918,0.00038488474,0.000404016,0.00029359368,0.0004023515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746176,0.00032313133,0.00031959914,0.0013211778,0.0014226042,0.0019580324,0.00067112653,0.00047919492,0.0066086375],"category_scores_gemma":[0.0029981462,0.00054172473,0.00051522226,0.0015875311,0.0017740754,0.0026226207,0.0016896841,0.00088925014,0.00038581912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015879728,0.000031376694,0.0018889223,0.00008198979,0.000018271869,0.00019355056,0.000480357,0.011266445,0.0034317472,0.97002923,0.0023853793,0.010033871],"study_design_scores_gemma":[0.0000883066,0.000066902634,0.0041540954,0.00007242432,0.00003419654,0.0004815863,0.0006079768,0.067757934,0.004677607,0.9040058,0.018009262,0.00004388319],"about_ca_topic_score_codex":0.0031009142,"about_ca_topic_score_gemma":0.0043724175,"teacher_disagreement_score":0.0066086375,"about_ca_system_score_codex":0.0022053584,"about_ca_system_score_gemma":0.00081441127,"threshold_uncertainty_score":0.022108078},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10275453,0.0017058,0.40171304,0.0016696359,0.0008513669,0.00008071591,0.0005203924,0.0004527409,0.49025178],"genre_scores_gemma":[0.812862,0.0020163096,0.072524436,0.0011558916,0.0005127147,0.00014741375,0.00059394666,0.00026853965,0.10991886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00015836666,0.000016476255,0.00006601799,0.00012892454,0.00011316098],"domain_scores_gemma":[0.9991978,0.000335306,0.00010939858,0.00012453337,0.00015642434,0.000076685326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027938563,0.000465825,0.00036080615,0.0012656557,0.00088083826,0.0016166184,0.00048630728,0.0007972843,0.018852286],"category_scores_gemma":[0.002123718,0.0003822012,0.00033014044,0.0010231258,0.0012864511,0.0024857079,0.001304803,0.001165198,0.003376861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002113835,0.0000077741915,0.00007622092,0.00002361876,0.0000032249154,0.00006791595,0.000060017464,0.0013405745,0.0013532485,0.9873246,0.0029405295,0.006781085],"study_design_scores_gemma":[0.000010777457,0.000017899985,0.00017153425,0.000029546838,0.0000052415394,0.00024449202,0.00010135164,0.0120034795,0.0010866845,0.97326636,0.013047958,0.000014733749],"about_ca_topic_score_codex":0.0005327048,"about_ca_topic_score_gemma":0.0009110565,"teacher_disagreement_score":0.018852286,"about_ca_system_score_codex":0.00057097845,"about_ca_system_score_gemma":0.00029120842,"threshold_uncertainty_score":0.0630672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5777359,0.0016406345,0.1290754,0.0019067072,0.00043375228,0.00014355445,0.0012667121,0.0007495562,0.2870478],"genre_scores_gemma":[0.9355067,0.0006649294,0.017167544,0.0003293355,0.00008058558,0.0000769041,0.0006911765,0.00010017624,0.04538262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981946,0.000025701394,0.000005984236,0.000048699705,0.000051399773,0.000048791422],"domain_scores_gemma":[0.9995504,0.00012834393,0.00007698033,0.000074744,0.000078158366,0.000091370464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017738045,0.00027565152,0.00023729294,0.0014403838,0.0012996602,0.0009933331,0.00049199566,0.00064252625,0.012194386],"category_scores_gemma":[0.0010151525,0.00024296282,0.00030782993,0.00069831853,0.0007934545,0.0011626104,0.00086473714,0.00084727997,0.0012258593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006382922,0.00002760614,0.0009408201,0.000056596928,0.000016128923,0.00043911563,0.00036734738,0.0018510349,0.0034613577,0.96473897,0.0069524255,0.021084795],"study_design_scores_gemma":[0.000042962252,0.00006405027,0.002730502,0.00007923301,0.000023903065,0.0025671164,0.00061662047,0.016533235,0.0035673426,0.90854275,0.065191045,0.00004130304],"about_ca_topic_score_codex":0.0009587965,"about_ca_topic_score_gemma":0.001225254,"teacher_disagreement_score":0.012194386,"about_ca_system_score_codex":0.0006710421,"about_ca_system_score_gemma":0.00033839227,"threshold_uncertainty_score":0.040794313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.513182,0.0015139696,0.3030764,0.0016819783,0.0004362358,0.00021086214,0.002594266,0.0008709038,0.17643334],"genre_scores_gemma":[0.8602544,0.00069244305,0.11076261,0.0003217733,0.00017495076,0.00020540413,0.0021630328,0.00032896502,0.02509643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990363,0.0002485869,0.00007304046,0.00017230447,0.00022456286,0.0002451464],"domain_scores_gemma":[0.99770504,0.0011394001,0.00025174607,0.00044626865,0.0001992315,0.0002582817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064426713,0.0007221599,0.0013213565,0.0019527039,0.002810717,0.0030373689,0.0012980569,0.0016168407,0.012085409],"category_scores_gemma":[0.005374067,0.00087335316,0.0008386328,0.0031796165,0.0012189739,0.003406026,0.0023268978,0.0014968123,0.0014289103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048339716,0.00012951581,0.0012364775,0.000277059,0.000050814113,0.00072541815,0.00052258384,0.027218856,0.0048140725,0.905547,0.013056157,0.04593865],"study_design_scores_gemma":[0.000056583063,0.00007083771,0.0007511467,0.000072807314,0.00003301191,0.0007126134,0.00032169482,0.072443075,0.0040004384,0.91135967,0.0101451045,0.00003314633],"about_ca_topic_score_codex":0.0017924844,"about_ca_topic_score_gemma":0.0019814398,"teacher_disagreement_score":0.012085409,"about_ca_system_score_codex":0.0012953386,"about_ca_system_score_gemma":0.00073825824,"threshold_uncertainty_score":0.04042971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.411404,0.00059983897,0.45806956,0.0007947061,0.00030439947,0.00031890554,0.0017670387,0.0011509592,0.12559055],"genre_scores_gemma":[0.6719779,0.00029732098,0.27069288,0.00044009634,0.00010600447,0.00019188834,0.0032455605,0.0006084724,0.05243992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994655,0.00014700311,0.00003610577,0.00015321503,0.000105369654,0.00009283306],"domain_scores_gemma":[0.99877053,0.00033468992,0.0001621509,0.00038315234,0.00022252268,0.00012689593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036452734,0.00035134933,0.0003974665,0.000967143,0.0011166651,0.0013991612,0.00067882804,0.00048655702,0.01428656],"category_scores_gemma":[0.0013602588,0.0004021255,0.00074906263,0.00083687867,0.0007192907,0.002668727,0.0016174774,0.0012512107,0.0027398341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005203997,0.0003112681,0.0018086978,0.00038937613,0.00010515466,0.0010721751,0.0011146247,0.0056017917,0.0316593,0.8368437,0.013809976,0.10676349],"study_design_scores_gemma":[0.00008275831,0.00025435578,0.0027377263,0.00013351937,0.00011726163,0.0017921533,0.0012476705,0.029320749,0.055271454,0.8432503,0.06573179,0.000060410122],"about_ca_topic_score_codex":0.00051704765,"about_ca_topic_score_gemma":0.0013977182,"teacher_disagreement_score":0.01428656,"about_ca_system_score_codex":0.00040566697,"about_ca_system_score_gemma":0.00049035397,"threshold_uncertainty_score":0.04779327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38067192,0.0017065175,0.4179544,0.0034211872,0.00047048437,0.00017677194,0.0010212341,0.0005415497,0.19403589],"genre_scores_gemma":[0.9313718,0.0008222905,0.043226272,0.00034417497,0.00015755743,0.00010831149,0.0010297647,0.0001963493,0.022743486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987847,0.00032678063,0.00006603779,0.00022252351,0.00030231202,0.00029758541],"domain_scores_gemma":[0.9970407,0.0017838511,0.00025559994,0.00034259167,0.00031365835,0.00026361548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007527174,0.00054485817,0.0012268692,0.0011114924,0.0024512152,0.0049382593,0.0015994674,0.0022724592,0.022297123],"category_scores_gemma":[0.0046336954,0.0006169389,0.0007235038,0.002229294,0.0016619588,0.006062097,0.0027176684,0.0027310604,0.0018086745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020438265,0.000095748655,0.0006846833,0.00017668204,0.00003615756,0.0002973858,0.000395782,0.03162223,0.00156809,0.9226432,0.009957248,0.032318365],"study_design_scores_gemma":[0.00002714636,0.000024399184,0.00014188085,0.00003695843,0.000011272523,0.00016114108,0.0004999381,0.07078926,0.001326579,0.92110384,0.005858569,0.000018943858],"about_ca_topic_score_codex":0.0023271912,"about_ca_topic_score_gemma":0.001631016,"teacher_disagreement_score":0.022297123,"about_ca_system_score_codex":0.0014538656,"about_ca_system_score_gemma":0.0010618217,"threshold_uncertainty_score":0.07459128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58168554,0.0025186453,0.13819037,0.0033589415,0.00048714236,0.00021307252,0.0010201953,0.00044406368,0.27208203],"genre_scores_gemma":[0.93813246,0.0011567789,0.041418556,0.0006828352,0.00016322713,0.00019196354,0.00049320864,0.000108795364,0.017652096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984358,0.0005825859,0.00008934586,0.00024751519,0.00035029187,0.00029440678],"domain_scores_gemma":[0.98844224,0.008133422,0.0013529335,0.00084212905,0.0006610999,0.0005681147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014826943,0.000575101,0.0006380742,0.0016481957,0.0022316235,0.002990427,0.000712664,0.0019345096,0.015821561],"category_scores_gemma":[0.011529802,0.0008329473,0.0007117019,0.0010133041,0.0026329998,0.003833046,0.002347065,0.0017272128,0.0024776326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021391714,0.000042759773,0.0008442613,0.00013221377,0.000025192681,0.0001759304,0.00032578583,0.0023504952,0.002320063,0.97680515,0.0036022451,0.013161997],"study_design_scores_gemma":[0.00008210361,0.00006724654,0.00055566936,0.000102627266,0.000028880702,0.00047418242,0.00019378116,0.0062293177,0.0019492931,0.982678,0.0076069916,0.00003192461],"about_ca_topic_score_codex":0.00057518925,"about_ca_topic_score_gemma":0.0010982681,"teacher_disagreement_score":0.015821561,"about_ca_system_score_codex":0.000874881,"about_ca_system_score_gemma":0.0011015749,"threshold_uncertainty_score":0.05292833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39125985,0.001082767,0.2965513,0.0014449317,0.0005173954,0.0005402308,0.0058717853,0.0016326046,0.3010992],"genre_scores_gemma":[0.7888568,0.0005542485,0.122580655,0.00048509846,0.00006277293,0.00030894385,0.0060066674,0.0004436475,0.08070109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996178,0.00008595147,0.000022751885,0.00008004937,0.00007364548,0.00011977989],"domain_scores_gemma":[0.99930465,0.00013941519,0.00011472563,0.00014724814,0.00015308333,0.0001408592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020400134,0.00056563923,0.00033804323,0.0013142463,0.0009934192,0.0014462803,0.00065028237,0.00062784116,0.022398341],"category_scores_gemma":[0.0011382955,0.0003522169,0.00060106977,0.0008255222,0.00074560044,0.0011620788,0.0011229048,0.00087366765,0.0050837905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006457012,0.00018422552,0.001807718,0.00035765246,0.00008179106,0.00091278,0.0009906167,0.014024558,0.019090587,0.8414504,0.038297597,0.08215635],"study_design_scores_gemma":[0.00015197307,0.00011916428,0.0053468407,0.00021273395,0.00008990823,0.0010720603,0.0017808871,0.034722682,0.01143375,0.85811675,0.0868858,0.000067477915],"about_ca_topic_score_codex":0.0025047935,"about_ca_topic_score_gemma":0.0040876972,"teacher_disagreement_score":0.022398341,"about_ca_system_score_codex":0.0007555222,"about_ca_system_score_gemma":0.0006002099,"threshold_uncertainty_score":0.07492995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5993946,0.0014296406,0.25281233,0.0036933576,0.00014399213,0.0004587277,0.0049357447,0.0045052916,0.13262631],"genre_scores_gemma":[0.7070506,0.00048174665,0.2655059,0.0004876925,0.000071342,0.00024320837,0.0050409236,0.0004961486,0.020622332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.00007315299,0.000016261203,0.0000944821,0.00006717289,0.000073812],"domain_scores_gemma":[0.99833703,0.0012687795,0.000088606634,0.00013304081,0.000087679466,0.000084706015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056683546,0.00045363605,0.000645234,0.0015094358,0.0011799773,0.0020715767,0.0010683922,0.0009110747,0.021295808],"category_scores_gemma":[0.0038393838,0.0004341034,0.0005967111,0.0019078192,0.0006116244,0.0017339637,0.00097243226,0.00078207115,0.002902167],"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.0024770598,0.0011249423,0.007900279,0.0012524334,0.00020610455,0.0005600425,0.0014959055,0.12674688,0.03011795,0.30187303,0.08896028,0.4372851],"study_design_scores_gemma":[0.0008484191,0.0004908749,0.0026888957,0.00017092287,0.00018028983,0.0005508146,0.0012074141,0.46657196,0.013361477,0.47288093,0.040979955,0.000067967674],"about_ca_topic_score_codex":0.0041430043,"about_ca_topic_score_gemma":0.008225899,"teacher_disagreement_score":0.021295808,"about_ca_system_score_codex":0.0012929591,"about_ca_system_score_gemma":0.0019952243,"threshold_uncertainty_score":0.07124162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43482682,0.0019550398,0.2246623,0.0024334763,0.0007867664,0.00013452633,0.0010980363,0.00093535264,0.33316764],"genre_scores_gemma":[0.8481554,0.0005859461,0.062384374,0.00068022136,0.00023859802,0.00013419386,0.0006472828,0.00025140482,0.086922586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914026,0.00028069157,0.00003864144,0.0001541724,0.00019797959,0.00018835846],"domain_scores_gemma":[0.9984102,0.0006564602,0.00027504328,0.00033626164,0.0001818884,0.00014013582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037581372,0.0005867343,0.0005810952,0.0008341836,0.0012342017,0.0014977533,0.0008121515,0.0008235478,0.02191518],"category_scores_gemma":[0.0028589498,0.000363953,0.00039360204,0.0008235117,0.0012589702,0.0012645123,0.0015996973,0.0009764512,0.0030953193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022375736,0.000046614558,0.00089899317,0.00015234092,0.000039212275,0.00072325085,0.00032133478,0.006801075,0.013737122,0.92964077,0.0101838475,0.037231665],"study_design_scores_gemma":[0.00006400712,0.00012811116,0.0008872452,0.000063656174,0.000029193525,0.0014649254,0.0002752412,0.021397451,0.011325487,0.91521317,0.049102217,0.000049281243],"about_ca_topic_score_codex":0.000773787,"about_ca_topic_score_gemma":0.00190097,"teacher_disagreement_score":0.02191518,"about_ca_system_score_codex":0.00075231044,"about_ca_system_score_gemma":0.00071722246,"threshold_uncertainty_score":0.073313534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6131719,0.0009779651,0.29418033,0.0011548102,0.00021960745,0.00015713132,0.0027945207,0.0006171149,0.08672665],"genre_scores_gemma":[0.93875587,0.00035564048,0.044238314,0.00033921312,0.00012442791,0.00023975258,0.0026977542,0.0001596696,0.0130893225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909556,0.00027877244,0.00005408736,0.00017061962,0.00024653957,0.00015442478],"domain_scores_gemma":[0.99565685,0.0022309278,0.0006366113,0.0005105539,0.0004422742,0.00052279496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080861436,0.00051722245,0.00072663673,0.0027979813,0.0015096745,0.0030094362,0.0009772778,0.0010356357,0.008514865],"category_scores_gemma":[0.005683163,0.00074210885,0.00086942955,0.0013528753,0.0015895533,0.0020805944,0.002012897,0.0014044357,0.0009869199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023336199,0.000099879624,0.0027859358,0.00017242023,0.00007679831,0.0003814534,0.00049071154,0.012992443,0.0051608034,0.9508576,0.00815656,0.018592121],"study_design_scores_gemma":[0.000035584093,0.000029480478,0.0018118464,0.00007380041,0.000031420946,0.00034773536,0.0003335543,0.047021892,0.0015176553,0.9427738,0.0060045733,0.00001865696],"about_ca_topic_score_codex":0.00072168827,"about_ca_topic_score_gemma":0.0010780791,"teacher_disagreement_score":0.008514865,"about_ca_system_score_codex":0.0010023677,"about_ca_system_score_gemma":0.0005227004,"threshold_uncertainty_score":0.028485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5892606,0.0012766386,0.31359527,0.0021577936,0.0003567638,0.00020638328,0.004424487,0.00063786807,0.08808423],"genre_scores_gemma":[0.9194505,0.00036035888,0.05047482,0.00055332546,0.00019001681,0.00029528158,0.0036806508,0.00020792581,0.02478696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986279,0.00045785194,0.0000711549,0.0002674302,0.00032652967,0.00024905565],"domain_scores_gemma":[0.99513066,0.002393255,0.0005893816,0.0007307523,0.000557337,0.000598717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010277227,0.0006340061,0.0009775641,0.0022914284,0.0017098123,0.00342928,0.0014580584,0.0015262803,0.011102149],"category_scores_gemma":[0.007864988,0.0008076929,0.0009789435,0.0012334771,0.0015780862,0.0032682787,0.002330913,0.0019608785,0.0012901095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004402067,0.00014958893,0.0024590322,0.00022866041,0.00010270856,0.00034590682,0.00052317284,0.02852046,0.005848163,0.92982936,0.01605681,0.015495846],"study_design_scores_gemma":[0.00006008266,0.000035478093,0.0017350247,0.00007527355,0.000028482826,0.00030922372,0.00034354685,0.097156204,0.001524145,0.89273626,0.0059724604,0.0000238698],"about_ca_topic_score_codex":0.0010880196,"about_ca_topic_score_gemma":0.0017035624,"teacher_disagreement_score":0.011102149,"about_ca_system_score_codex":0.0014082151,"about_ca_system_score_gemma":0.0007788185,"threshold_uncertainty_score":0.03714037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5924497,0.00269439,0.28783444,0.003071944,0.0003506956,0.00011586366,0.0013113543,0.00080573757,0.11136575],"genre_scores_gemma":[0.9582509,0.000501058,0.03323936,0.00034420044,0.00012787567,0.00016107032,0.0004998778,0.00011376416,0.0067620045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979955,0.0006194552,0.00014268463,0.0004096538,0.0005438655,0.00028893046],"domain_scores_gemma":[0.98169553,0.012658145,0.0012949101,0.0021524506,0.0011785643,0.0010203482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018750125,0.00041790077,0.0009902796,0.0026018189,0.0038495355,0.006123849,0.0011899871,0.0014571914,0.008353985],"category_scores_gemma":[0.014942248,0.0012356684,0.0010000275,0.0014374268,0.003915266,0.0092215175,0.0042435797,0.0023986606,0.0010757225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007990566,0.000028371802,0.0011292679,0.00010528021,0.000029344477,0.0001286808,0.00036145598,0.0016487077,0.001543808,0.9869472,0.001802659,0.0061952462],"study_design_scores_gemma":[0.000020930484,0.000015986918,0.00040653453,0.000048846872,0.000028259914,0.0003512279,0.00026814305,0.009058727,0.0015374207,0.9848905,0.0033527876,0.000020553996],"about_ca_topic_score_codex":0.00070900016,"about_ca_topic_score_gemma":0.0011104885,"teacher_disagreement_score":0.008353985,"about_ca_system_score_codex":0.0016107421,"about_ca_system_score_gemma":0.00095688994,"threshold_uncertainty_score":0.02794683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9412989,0.00020923514,0.038198497,0.00034745515,0.000032654305,0.000027280832,0.00019314158,0.00007340202,0.019619552],"genre_scores_gemma":[0.9939466,0.000088270994,0.0040175845,0.000055801993,0.000035224664,0.000022160817,0.00014702258,0.000017214923,0.0016702494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958247,0.00007281561,0.000021871427,0.00015149641,0.000080072576,0.00009120415],"domain_scores_gemma":[0.9988097,0.00050384435,0.00022481703,0.00012561063,0.000089586516,0.00024654192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043130267,0.00026203814,0.00047735262,0.0016623337,0.0015780673,0.0024616974,0.0006152607,0.00072389765,0.0039694486],"category_scores_gemma":[0.0014190456,0.00029859232,0.00049890904,0.0010468912,0.0016704251,0.0034525685,0.0010385029,0.0010190965,0.00014164874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010597274,0.000060340284,0.0045352126,0.000046382855,0.000018181325,0.00038645655,0.000665411,0.002631384,0.004265764,0.9784656,0.00077695,0.008042391],"study_design_scores_gemma":[0.000046086574,0.0000721406,0.0048436048,0.00003581082,0.000043961863,0.0007306313,0.0010187326,0.034850918,0.003241883,0.9500302,0.0050510555,0.000035030673],"about_ca_topic_score_codex":0.0022939665,"about_ca_topic_score_gemma":0.0016615442,"teacher_disagreement_score":0.0039694486,"about_ca_system_score_codex":0.0009962849,"about_ca_system_score_gemma":0.0003561879,"threshold_uncertainty_score":0.01327914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5337721,0.0009492154,0.32105395,0.0031209057,0.00036539993,0.00031257473,0.0016588105,0.0011333653,0.1376337],"genre_scores_gemma":[0.86553353,0.00028123037,0.104455724,0.0009221074,0.00019756275,0.00063797575,0.00058944366,0.000169064,0.027213413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781704,0.0008780541,0.00012347978,0.00028035164,0.00051849725,0.0003825663],"domain_scores_gemma":[0.991602,0.004770409,0.00096358056,0.0014924804,0.00065393315,0.0005175411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019217344,0.0005091058,0.000658218,0.0012490882,0.0020376968,0.0027731748,0.0009569579,0.0015617805,0.012072936],"category_scores_gemma":[0.0072448323,0.000730558,0.0007824946,0.0008772998,0.0020873353,0.002865777,0.002232043,0.0016926707,0.0021671639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031788184,0.00008044589,0.0007713395,0.00010005525,0.000029854678,0.00023789388,0.00027681788,0.0061017396,0.006319735,0.96625173,0.0047851605,0.014727431],"study_design_scores_gemma":[0.00009379326,0.00008152592,0.00051895215,0.00005655958,0.00002049146,0.00029504142,0.000110157074,0.021846607,0.0044501266,0.9631742,0.009320409,0.000032043747],"about_ca_topic_score_codex":0.00074236,"about_ca_topic_score_gemma":0.001887298,"teacher_disagreement_score":0.012072936,"about_ca_system_score_codex":0.001475695,"about_ca_system_score_gemma":0.0013254641,"threshold_uncertainty_score":0.040388048},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021213606,0.0005794045,0.9682621,0.00079156854,0.000031775875,0.00013443395,0.00006684528,0.00073578383,0.008184558],"genre_scores_gemma":[0.22269276,0.0009260157,0.7712955,0.00032011222,0.00011189963,0.00040792613,0.0002333577,0.0003119767,0.0037004384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959947,0.0020822606,0.00015433533,0.0005285532,0.0010222363,0.00021785476],"domain_scores_gemma":[0.98684573,0.010280122,0.0004564076,0.00177948,0.00046996237,0.00016820333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040579727,0.001066668,0.0008504064,0.0018639074,0.00084354775,0.0027988248,0.0017216252,0.0011891016,0.0048113004],"category_scores_gemma":[0.015951464,0.0009858763,0.0012135474,0.001471142,0.0057663913,0.0045269295,0.0030448402,0.0023994776,0.0011284841],"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.0000923541,0.00008161951,0.00044516375,0.0002747965,0.000030096922,0.000073115334,0.0002933734,0.05595236,0.004631625,0.85285974,0.0019142639,0.083351456],"study_design_scores_gemma":[0.000066894245,0.000063707004,0.00008845583,0.000051448278,0.000020885363,0.00006827617,0.000059887378,0.22343843,0.0047836923,0.76342773,0.00790923,0.000021450862],"about_ca_topic_score_codex":0.0007272928,"about_ca_topic_score_gemma":0.0009083599,"teacher_disagreement_score":0.0048113004,"about_ca_system_score_codex":0.0019914042,"about_ca_system_score_gemma":0.0017489751,"threshold_uncertainty_score":0.02146089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11014714,0.009825736,0.57636553,0.004466921,0.0018585238,0.00028382716,0.0022713256,0.0017502309,0.2930309],"genre_scores_gemma":[0.8060227,0.005844387,0.13841838,0.0017424936,0.0012773224,0.00071531336,0.0013771915,0.00050815457,0.04409402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813265,0.00038685082,0.00006478652,0.00041642948,0.0005134323,0.00048597658],"domain_scores_gemma":[0.9922214,0.0050563095,0.00042604044,0.0011041331,0.00056121644,0.0006308807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014372235,0.0016661596,0.001391317,0.003184658,0.002267128,0.0034741622,0.0028338297,0.0015123183,0.022181777],"category_scores_gemma":[0.010353224,0.00066782476,0.0010561519,0.0021047115,0.0022090867,0.0053548804,0.0034301141,0.0031057396,0.004386277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030524927,0.00017426649,0.0011021347,0.0005656717,0.000082639286,0.00031420588,0.00035551566,0.02839652,0.012347455,0.86958146,0.03337424,0.05340061],"study_design_scores_gemma":[0.00006661005,0.00020498292,0.0021850846,0.00030376992,0.00018642898,0.0011964937,0.00031574213,0.13998844,0.009617197,0.7738776,0.0719188,0.00013874838],"about_ca_topic_score_codex":0.0014132626,"about_ca_topic_score_gemma":0.0027133203,"teacher_disagreement_score":0.022181777,"about_ca_system_score_codex":0.0022662492,"about_ca_system_score_gemma":0.0010658457,"threshold_uncertainty_score":0.07420546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6239765,0.00067180395,0.25458217,0.0009977516,0.00022901304,0.00013476591,0.0011494191,0.00083393545,0.117424674],"genre_scores_gemma":[0.9043279,0.0003334569,0.061906707,0.00030574956,0.000087167384,0.0001611725,0.00092690013,0.00023047076,0.031720463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992132,0.00020714701,0.000039764753,0.00015905431,0.00018419627,0.00019661913],"domain_scores_gemma":[0.9974986,0.0010339705,0.0004388344,0.00056831737,0.00020561225,0.00025474493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049348007,0.00054467074,0.00037848036,0.00078625797,0.0009359274,0.001988901,0.00074245234,0.0010526694,0.012999576],"category_scores_gemma":[0.0028759937,0.0005291526,0.0005705584,0.00053270283,0.0012069155,0.00213602,0.001964367,0.001732905,0.0021684016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003767521,0.00008329503,0.00051873847,0.000094548515,0.000018377164,0.00020146069,0.00043507564,0.0046490594,0.00560705,0.9636958,0.0030195236,0.021300247],"study_design_scores_gemma":[0.00010135974,0.000105169136,0.0005578408,0.00005732202,0.000020610536,0.00031420318,0.00029669507,0.015627593,0.0056630326,0.96302056,0.014198985,0.00003665899],"about_ca_topic_score_codex":0.00048296226,"about_ca_topic_score_gemma":0.0006182654,"teacher_disagreement_score":0.012999576,"about_ca_system_score_codex":0.000812758,"about_ca_system_score_gemma":0.00046255396,"threshold_uncertainty_score":0.043487847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19995132,0.0009151319,0.7099171,0.00072528754,0.00010910798,0.00023442088,0.0014396262,0.00058493466,0.08612308],"genre_scores_gemma":[0.6579076,0.0016700026,0.28151855,0.0004579815,0.00019112605,0.00044092152,0.0028490995,0.00052718824,0.05443754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993981,0.00015540257,0.000040373277,0.00015380871,0.00014879755,0.00010353603],"domain_scores_gemma":[0.9980506,0.00079746125,0.00029277988,0.00036933768,0.00027753488,0.00021227468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592414,0.000806879,0.00059206295,0.0023949326,0.0011083542,0.0028644197,0.0008584846,0.00068982947,0.0094295265],"category_scores_gemma":[0.0023870799,0.0007804188,0.0010623159,0.0019504377,0.0013754574,0.003654547,0.0012810963,0.0013760083,0.0009928979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004977616,0.000033237953,0.00035824554,0.000085666106,0.000022030228,0.000104022794,0.00030819615,0.008332717,0.001612035,0.96549505,0.0025564095,0.021042664],"study_design_scores_gemma":[0.000011695665,0.000010804824,0.00029380264,0.000034659824,0.000018966746,0.000102556245,0.0001209779,0.016489387,0.00063596567,0.97537404,0.006897854,0.0000092715],"about_ca_topic_score_codex":0.0015393719,"about_ca_topic_score_gemma":0.002493131,"teacher_disagreement_score":0.0094295265,"about_ca_system_score_codex":0.001005941,"about_ca_system_score_gemma":0.0007189791,"threshold_uncertainty_score":0.031544864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73925716,0.0007826871,0.15403427,0.0017968384,0.00021880871,0.00005034242,0.00068618805,0.0002414554,0.10293226],"genre_scores_gemma":[0.98161924,0.00016794987,0.012246712,0.00019640742,0.000051620456,0.000047137328,0.00021701706,0.00003254702,0.005421284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990638,0.0002544271,0.000043818396,0.0002056907,0.0002327094,0.00019956828],"domain_scores_gemma":[0.99401313,0.0039609545,0.0005295296,0.00065093813,0.0004409373,0.00040447363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086488057,0.00020550049,0.00036599752,0.0011888802,0.0018517361,0.0015744226,0.00077399134,0.000901973,0.0061468715],"category_scores_gemma":[0.007545009,0.00044797512,0.00039433423,0.0005180827,0.0016026687,0.0027978003,0.0023618562,0.0013154573,0.0006824404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014920566,0.000029619383,0.0015401943,0.000045524645,0.000010994419,0.00019597664,0.0003477891,0.001013703,0.004331072,0.98130625,0.0017398719,0.009289792],"study_design_scores_gemma":[0.00005621561,0.00006106944,0.0016463445,0.000055262848,0.00002793596,0.0016234206,0.0004560279,0.014449252,0.008166907,0.96252,0.010904507,0.00003306107],"about_ca_topic_score_codex":0.00026093496,"about_ca_topic_score_gemma":0.00027068943,"teacher_disagreement_score":0.0061468715,"about_ca_system_score_codex":0.00082362856,"about_ca_system_score_gemma":0.00036889652,"threshold_uncertainty_score":0.020563364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28829622,0.0016214666,0.42859054,0.0040029893,0.0018920256,0.00031073843,0.010813665,0.0017093017,0.26276308],"genre_scores_gemma":[0.83356506,0.001232093,0.10138532,0.0005601979,0.0005139687,0.00026579638,0.007529935,0.0006250285,0.054322563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923193,0.00011817609,0.000053261818,0.00022216227,0.00015897235,0.00021544372],"domain_scores_gemma":[0.99927133,0.00020063193,0.000093528266,0.00017586391,0.00014692817,0.00011180404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024589876,0.00060431357,0.00056507555,0.0011166417,0.0011810407,0.0025868188,0.0007383487,0.0010949846,0.019664934],"category_scores_gemma":[0.0018921142,0.00022106875,0.0005231876,0.0008067541,0.0010914822,0.002109963,0.0012106576,0.0015116278,0.0055741603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026894704,0.00008792892,0.0008789593,0.0002828482,0.000039376257,0.00032256581,0.00032978802,0.0018980134,0.02234134,0.91531783,0.014198968,0.044033423],"study_design_scores_gemma":[0.000055824174,0.00013643035,0.0016422127,0.00016490498,0.00004978856,0.0008038716,0.0004892128,0.009497938,0.013946885,0.9024733,0.07067116,0.00006860888],"about_ca_topic_score_codex":0.0008284612,"about_ca_topic_score_gemma":0.0009235347,"teacher_disagreement_score":0.019664934,"about_ca_system_score_codex":0.0005873,"about_ca_system_score_gemma":0.0008630333,"threshold_uncertainty_score":0.065785766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19717865,0.005616085,0.40941054,0.004058482,0.0010110172,0.00012844012,0.0005415148,0.0004480953,0.38160717],"genre_scores_gemma":[0.90378845,0.0014156206,0.04382584,0.00076776335,0.0005567226,0.00013430508,0.00028429076,0.0001410039,0.049086038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933654,0.00021765484,0.00002921185,0.00013268317,0.00017562583,0.00010835969],"domain_scores_gemma":[0.9970066,0.0019820675,0.00021117336,0.00022372375,0.0003469567,0.00022952663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062480784,0.00046665364,0.0005475299,0.002371614,0.0017898286,0.0021692272,0.0005683253,0.0010519816,0.013182255],"category_scores_gemma":[0.0056948373,0.0004245358,0.00045816417,0.0010165825,0.0024967052,0.0029816676,0.0014638075,0.0018548559,0.0014433531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013345048,0.000006271733,0.000118408,0.00002659044,0.0000038452645,0.00004958428,0.00008995232,0.0010700466,0.00033956394,0.99104345,0.0023681838,0.0048706783],"study_design_scores_gemma":[0.0000064801798,0.000007900919,0.0001326973,0.000019562345,0.0000033025062,0.00010216375,0.00007438215,0.005042132,0.0004006676,0.98821753,0.005986926,0.0000062862946],"about_ca_topic_score_codex":0.001388645,"about_ca_topic_score_gemma":0.0019064876,"teacher_disagreement_score":0.013182255,"about_ca_system_score_codex":0.0012737432,"about_ca_system_score_gemma":0.0005764592,"threshold_uncertainty_score":0.044099033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5540524,0.0016559105,0.14315248,0.0014981093,0.00036591644,0.000089160174,0.0010867828,0.00038654028,0.2977127],"genre_scores_gemma":[0.91844136,0.00067985913,0.023292463,0.00027240193,0.000095161566,0.000055374112,0.0006226286,0.00012714269,0.0564136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.000088376684,0.000015390451,0.00005933562,0.00007543077,0.00010560643],"domain_scores_gemma":[0.9990771,0.0004321492,0.00016449904,0.00009552524,0.00010569668,0.00012508212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002343871,0.00038753988,0.0002918438,0.0015842853,0.0014252308,0.0020790088,0.00045117922,0.00081441866,0.0134810535],"category_scores_gemma":[0.0016276328,0.00029075984,0.00028555605,0.00097519526,0.0012281442,0.0025489111,0.0011542069,0.0011963369,0.0014279962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012604066,0.000025258885,0.0007661456,0.000055579963,0.000012172094,0.00023616785,0.00024738334,0.002256095,0.0019107381,0.9751222,0.0035518634,0.015690273],"study_design_scores_gemma":[0.000027277938,0.000024912566,0.00090883946,0.000045725275,0.000012360673,0.00028235707,0.0003757195,0.0072548543,0.0026533292,0.96777904,0.02062032,0.000015314106],"about_ca_topic_score_codex":0.0017118711,"about_ca_topic_score_gemma":0.003119169,"teacher_disagreement_score":0.0134810535,"about_ca_system_score_codex":0.0008282757,"about_ca_system_score_gemma":0.00043738258,"threshold_uncertainty_score":0.045098603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61086255,0.0007918884,0.18413962,0.0013008543,0.0002419125,0.00013737696,0.0016877234,0.00079087785,0.20004715],"genre_scores_gemma":[0.9322684,0.000365114,0.038931925,0.00028561868,0.00011960519,0.00011866015,0.0019427959,0.00022343955,0.025744472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991565,0.00025635716,0.00005468527,0.00017372546,0.00018676899,0.0001719527],"domain_scores_gemma":[0.9977133,0.0012530913,0.00022106731,0.00039510478,0.00022311564,0.00019420299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038558434,0.0004691216,0.00046463826,0.0019287806,0.0012199816,0.0021733441,0.00071680284,0.0009137866,0.016615594],"category_scores_gemma":[0.0035381836,0.00038409905,0.0004217003,0.001538314,0.0011947112,0.0027046453,0.001814038,0.0010048212,0.0019531287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001948832,0.00018528386,0.0032515975,0.00013751202,0.000029911002,0.00029520647,0.00050802605,0.0030348008,0.010198338,0.90732473,0.008912399,0.065927394],"study_design_scores_gemma":[0.000047776168,0.00005922242,0.0020376414,0.00005935042,0.00003008275,0.00093689986,0.0004620799,0.017610665,0.008816237,0.9441001,0.025812712,0.000027173588],"about_ca_topic_score_codex":0.00040380977,"about_ca_topic_score_gemma":0.0006466336,"teacher_disagreement_score":0.016615594,"about_ca_system_score_codex":0.0006702365,"about_ca_system_score_gemma":0.00049008057,"threshold_uncertainty_score":0.05558473},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024836898,0.005368916,0.0034095172,0.14637692,0.82497156,0.00004526233,0.0008555579,0.0004029359,0.018320918],"genre_scores_gemma":[0.022281988,0.01642621,0.01071473,0.22012697,0.40255076,0.0003376506,0.0025260262,0.0023055754,0.32273003],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939758,0.0012857242,0.0007635571,0.0010227262,0.002460599,0.00049156655],"domain_scores_gemma":[0.9794341,0.0053080334,0.0007591238,0.0017007873,0.012259246,0.0005387161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036647862,0.0025610256,0.0028185584,0.0058075846,0.0047864416,0.0046618334,0.005280971,0.006927722,0.06447683],"category_scores_gemma":[0.04630154,0.0012474974,0.0032140634,0.0038869516,0.004123142,0.0066036675,0.00333467,0.009344429,0.033827838],"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.000018116232,0.0000072605935,0.000035612557,0.000073318915,0.00001331187,0.000059186525,0.000023548588,0.00007364905,0.00003897828,0.0048878225,0.99123806,0.0035311352],"study_design_scores_gemma":[0.000034945424,0.000026521313,0.0010015762,0.00026388493,0.000091969065,0.00024701032,0.00008101176,0.000907606,0.00035464962,0.024109688,0.97279435,0.00008664597],"about_ca_topic_score_codex":0.029408373,"about_ca_topic_score_gemma":0.035500597,"teacher_disagreement_score":0.06447683,"about_ca_system_score_codex":0.007180746,"about_ca_system_score_gemma":0.0038205744,"threshold_uncertainty_score":0.21569651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37983966,0.0010656436,0.28798226,0.00089652365,0.00045572798,0.00019281147,0.0006712926,0.00078735594,0.32810867],"genre_scores_gemma":[0.8967327,0.00047307598,0.04848896,0.00030865098,0.00010360341,0.00019343449,0.0003944188,0.00011998176,0.053185184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.00019708235,0.000032310618,0.00009902309,0.00012304456,0.00015565554],"domain_scores_gemma":[0.9991748,0.0002666377,0.00018584492,0.00018224325,0.00009830301,0.00009223967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045619914,0.0004443444,0.00031766653,0.00087032886,0.0011068127,0.0017380212,0.00046431922,0.0006404079,0.014062531],"category_scores_gemma":[0.0013275488,0.0003204406,0.0004088986,0.0007107124,0.0009920072,0.0016947275,0.0010145801,0.0006138836,0.0021665948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059208825,0.000017382663,0.00018126854,0.000028248203,0.000008357411,0.00008566513,0.00011118428,0.0013337756,0.0023120025,0.9858813,0.0017020656,0.008279517],"study_design_scores_gemma":[0.000041485444,0.000079994425,0.00028493107,0.000034242617,0.000020291272,0.00021826307,0.00017229102,0.010765331,0.003683706,0.9667446,0.017929489,0.000025377107],"about_ca_topic_score_codex":0.000785773,"about_ca_topic_score_gemma":0.0020738414,"teacher_disagreement_score":0.014062531,"about_ca_system_score_codex":0.00070338167,"about_ca_system_score_gemma":0.00070122886,"threshold_uncertainty_score":0.0470438},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15081991,0.003950658,0.38651747,0.0038690446,0.0017762606,0.00017718431,0.00095026114,0.0007942407,0.45114493],"genre_scores_gemma":[0.8129871,0.0023987542,0.08331505,0.0018213579,0.0008227298,0.00026341353,0.0009901881,0.0002918546,0.097109556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991161,0.00024689382,0.000035463156,0.00015795536,0.00021563766,0.00022790152],"domain_scores_gemma":[0.99826056,0.00069197314,0.00017466396,0.00028373048,0.00030972346,0.0002792371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056276086,0.00058547634,0.0006938054,0.0022244703,0.0028671778,0.002270325,0.00096913864,0.0012612765,0.022708077],"category_scores_gemma":[0.0032723087,0.0003209977,0.0005504524,0.0015945255,0.0019619379,0.003412936,0.0027547586,0.0024828352,0.0043367594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022733868,0.000014249166,0.00009938954,0.000029402223,0.000004832663,0.00006375317,0.000089309215,0.0012625374,0.0004970188,0.98588645,0.0039078835,0.008122505],"study_design_scores_gemma":[0.00000729739,0.000015327272,0.000101817175,0.000026323432,0.000003062982,0.00012582219,0.00007679614,0.0057634283,0.00032991238,0.98086745,0.012669481,0.000013283105],"about_ca_topic_score_codex":0.0013288207,"about_ca_topic_score_gemma":0.0023331717,"teacher_disagreement_score":0.022708077,"about_ca_system_score_codex":0.0012227974,"about_ca_system_score_gemma":0.0006279695,"threshold_uncertainty_score":0.07596612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7594096,0.0003689648,0.06363093,0.0018597055,0.00020582814,0.000102875754,0.0030983982,0.00055004645,0.17077358],"genre_scores_gemma":[0.96179515,0.000203638,0.014280089,0.0002575105,0.000052221865,0.00007344943,0.0014208073,0.0001637189,0.02175352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999553,0.00011650892,0.000014024009,0.000102863385,0.00007072968,0.00014274944],"domain_scores_gemma":[0.9975968,0.0010560486,0.0003507818,0.00035103582,0.00029442436,0.00035081842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004889094,0.0003195705,0.00025810287,0.0015492565,0.0017301299,0.0018726179,0.0009436265,0.00073200726,0.015512347],"category_scores_gemma":[0.0027142598,0.00032096097,0.00030301444,0.00094236236,0.0014910409,0.0013369279,0.00089374115,0.0009174398,0.0015111609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063082646,0.00007625866,0.0038981666,0.00015786415,0.000037168375,0.00032224733,0.00063058437,0.01822866,0.017023547,0.92330927,0.017915023,0.017770352],"study_design_scores_gemma":[0.00016817676,0.00009419244,0.008211957,0.00010186243,0.00006898953,0.00077216956,0.00083886064,0.10107732,0.0129723465,0.8453252,0.030294,0.000074893505],"about_ca_topic_score_codex":0.006262761,"about_ca_topic_score_gemma":0.008388474,"teacher_disagreement_score":0.015512347,"about_ca_system_score_codex":0.0014401089,"about_ca_system_score_gemma":0.00088131975,"threshold_uncertainty_score":0.05189395},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3057545,0.0071171937,0.1606133,0.017250348,0.001765126,0.00012221279,0.0017717702,0.0005011173,0.5051043],"genre_scores_gemma":[0.9537963,0.0024526662,0.016130054,0.0012455523,0.0015815785,0.00018811125,0.00043203845,0.000118843665,0.024054876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989079,0.0003655393,0.000038263115,0.00021533218,0.0002754117,0.00019759276],"domain_scores_gemma":[0.99187136,0.0060168607,0.00061631575,0.0005317198,0.0004086561,0.00055518583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011200064,0.00057145295,0.00065530493,0.0033950647,0.0016155381,0.0034765005,0.00107727,0.0013065876,0.016910324],"category_scores_gemma":[0.009533299,0.0004740748,0.000406645,0.002192464,0.003237829,0.0061975224,0.0017087513,0.002957948,0.0014368992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004864265,0.00001581016,0.0003011833,0.000048842627,0.000006963436,0.00003185828,0.000075056225,0.0020357026,0.00035039548,0.98693824,0.0040750485,0.0060723233],"study_design_scores_gemma":[0.00001793828,0.000012972835,0.00032909663,0.000035764395,0.000007574779,0.000107465385,0.00004866273,0.007880766,0.00035605129,0.9864703,0.0047222897,0.000011107052],"about_ca_topic_score_codex":0.0009598502,"about_ca_topic_score_gemma":0.0013756446,"teacher_disagreement_score":0.016910324,"about_ca_system_score_codex":0.0022570987,"about_ca_system_score_gemma":0.00084842433,"threshold_uncertainty_score":0.05657065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8878373,0.00088048354,0.042026926,0.0005505335,0.00012365948,0.00006100624,0.0014069839,0.0003717255,0.066741504],"genre_scores_gemma":[0.97050065,0.00028460927,0.019691207,0.00006047119,0.00002559552,0.000036548612,0.0011184787,0.00006744885,0.008214981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996227,0.00009057039,0.000022449538,0.00006386806,0.00008606534,0.0001143384],"domain_scores_gemma":[0.99894005,0.00050944637,0.00015366873,0.00018185828,0.0000799443,0.00013517152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026801712,0.0004127578,0.00037378335,0.0012112637,0.0015234061,0.0011568982,0.0005513826,0.0008092653,0.009089228],"category_scores_gemma":[0.0019894172,0.0003855838,0.0005014347,0.0014942226,0.0009834437,0.0011941736,0.0009513996,0.00045357746,0.00069299166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084768195,0.00017539764,0.006530669,0.00032680336,0.00011452691,0.0019888969,0.0016236892,0.076044045,0.011943059,0.80909425,0.02131605,0.0699949],"study_design_scores_gemma":[0.0000942705,0.00015822533,0.010227201,0.000107688225,0.000111218025,0.0022462204,0.0019836698,0.22118676,0.010180808,0.7208339,0.032803413,0.00006661728],"about_ca_topic_score_codex":0.0026994362,"about_ca_topic_score_gemma":0.0035570373,"teacher_disagreement_score":0.009089228,"about_ca_system_score_codex":0.00079536636,"about_ca_system_score_gemma":0.0002932294,"threshold_uncertainty_score":0.030406535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5096626,0.0015045136,0.47278923,0.0009885118,0.00006741148,0.00018031872,0.00015117414,0.0005491441,0.0141071435],"genre_scores_gemma":[0.9573677,0.00034233354,0.04052099,0.000045926805,0.000011912637,0.000056281377,0.000044563945,0.000036233552,0.0015740001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989544,0.00038126713,0.000024944982,0.00014451299,0.00037177114,0.00012317042],"domain_scores_gemma":[0.98468703,0.012892358,0.00051626284,0.001123066,0.0006664834,0.00011478696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017566645,0.00052782445,0.0003657366,0.0005474874,0.00033526446,0.00076181674,0.00084325444,0.00087233016,0.0020458126],"category_scores_gemma":[0.012584877,0.00027617897,0.00033593283,0.0004631635,0.0009962427,0.0012275103,0.0005011277,0.00072490936,0.00025976184],"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.00048928254,0.0003325061,0.002658208,0.00037140286,0.000048909293,0.00029136206,0.000119822704,0.738243,0.118887834,0.06786447,0.00075578695,0.06993734],"study_design_scores_gemma":[0.000011179418,0.00020634948,0.0005878983,0.000010334855,0.000018187257,0.00012212052,0.000027108132,0.9406536,0.050783012,0.0066090394,0.00095365,0.000017457218],"about_ca_topic_score_codex":0.0020121166,"about_ca_topic_score_gemma":0.001559916,"teacher_disagreement_score":0.0020458126,"about_ca_system_score_codex":0.0013473185,"about_ca_system_score_gemma":0.0006264717,"threshold_uncertainty_score":0.009775519},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28883407,0.0010464821,0.14137316,0.0024815132,0.0006747053,0.00031887242,0.00615638,0.0014232869,0.5576916],"genre_scores_gemma":[0.8810818,0.0005613725,0.03408298,0.0005721681,0.00015243381,0.0001281861,0.0023059982,0.00018488061,0.08093026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995371,0.00007673311,0.000018831963,0.0000797028,0.000143262,0.00014438768],"domain_scores_gemma":[0.9984144,0.0005216373,0.0002580577,0.00033883288,0.00026435862,0.00020268903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021549957,0.0003661959,0.00040064793,0.0010242737,0.001536743,0.0019411839,0.00072114274,0.0006492383,0.02507631],"category_scores_gemma":[0.001957901,0.00025875113,0.00037834203,0.0014374651,0.00096423423,0.0014099623,0.0009690093,0.0012676035,0.0022036845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022751297,0.00008043654,0.0007636018,0.00016375522,0.00002320214,0.0004661261,0.00023013994,0.0052235667,0.004269014,0.93832475,0.021479242,0.028748741],"study_design_scores_gemma":[0.00007537438,0.000050266506,0.0015130356,0.000051159564,0.00002469507,0.0005374677,0.00033859813,0.02152085,0.004343169,0.9161711,0.05532998,0.000044351702],"about_ca_topic_score_codex":0.008465832,"about_ca_topic_score_gemma":0.015144874,"teacher_disagreement_score":0.02507631,"about_ca_system_score_codex":0.00144783,"about_ca_system_score_gemma":0.0017962885,"threshold_uncertainty_score":0.08388859},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13070367,0.011323478,0.2521057,0.017292809,0.0013678801,0.00031009925,0.00656637,0.002482704,0.57784724],"genre_scores_gemma":[0.89100015,0.0032383008,0.042572755,0.002441035,0.0008248293,0.00057112577,0.0023604082,0.00041020213,0.05658112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986332,0.00025861769,0.000045108347,0.00027077994,0.00036438953,0.00042780896],"domain_scores_gemma":[0.9950099,0.0030172593,0.0002508236,0.0008459357,0.00042759647,0.00044844902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015136956,0.000993351,0.0008155649,0.003518525,0.0026212176,0.004361931,0.0029439798,0.0015270356,0.033710774],"category_scores_gemma":[0.008965592,0.0005234523,0.00072038756,0.0020541805,0.0021847123,0.0056338753,0.0035298835,0.0038976914,0.003866323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005028644,0.00027723628,0.0019828796,0.0006044907,0.000056392444,0.0001855502,0.00043382373,0.032014903,0.009866775,0.8483597,0.058084957,0.047630467],"study_design_scores_gemma":[0.00005132588,0.00008756976,0.003369224,0.00023139846,0.000068237525,0.00042671483,0.00022888304,0.15689945,0.0068467087,0.7924062,0.039306637,0.00007759924],"about_ca_topic_score_codex":0.0037019062,"about_ca_topic_score_gemma":0.009967376,"teacher_disagreement_score":0.033710774,"about_ca_system_score_codex":0.0054750512,"about_ca_system_score_gemma":0.0021054037,"threshold_uncertainty_score":0.112773776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49173018,0.001549118,0.3035167,0.0017846213,0.00036185,0.00026479948,0.0010223876,0.0006394815,0.19913091],"genre_scores_gemma":[0.92463565,0.0005503206,0.05519774,0.00042983305,0.00011336457,0.0002561028,0.000406508,0.00009100598,0.018319538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984713,0.0005870115,0.00009209583,0.0002286936,0.0003599633,0.00026091016],"domain_scores_gemma":[0.9946636,0.0026645774,0.00087682315,0.0009285639,0.00051214534,0.00035425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013292491,0.00037431734,0.00047123455,0.0010127067,0.0012552446,0.0024388535,0.0005527383,0.0014534309,0.007662364],"category_scores_gemma":[0.0070558367,0.00078490266,0.00045613697,0.00069418934,0.0013321901,0.0026241827,0.001440569,0.0011285653,0.0019153449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022846462,0.000039762355,0.0006208204,0.00010470441,0.000020291025,0.00014803321,0.00026047003,0.0020102346,0.007896637,0.97208756,0.0028691296,0.013713899],"study_design_scores_gemma":[0.0001379029,0.00014754552,0.0005566414,0.000076534,0.000043862514,0.0005785318,0.00014378839,0.01306898,0.006564593,0.9649871,0.0136569,0.0000375946],"about_ca_topic_score_codex":0.00040586793,"about_ca_topic_score_gemma":0.0006585091,"teacher_disagreement_score":0.007662364,"about_ca_system_score_codex":0.00063281803,"about_ca_system_score_gemma":0.000854892,"threshold_uncertainty_score":0.025633156},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34483102,0.0007419053,0.19804054,0.0010068269,0.0018347934,0.00022831804,0.0023444726,0.0015044601,0.4494677],"genre_scores_gemma":[0.89805984,0.00025077557,0.04490866,0.00047104643,0.00012603127,0.00010769616,0.0009369542,0.00029886488,0.05484023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999706,0.000040721607,0.000015376729,0.000070306836,0.000062443876,0.000105152634],"domain_scores_gemma":[0.99968493,0.000063174455,0.000035238787,0.0000930513,0.000046618763,0.00007699832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011797925,0.0004183675,0.00038466338,0.0005837796,0.00090815825,0.00113493,0.0004616483,0.0007804322,0.044082522],"category_scores_gemma":[0.0008135069,0.00021511222,0.0002725745,0.0003908741,0.0010672855,0.00073536753,0.0008133514,0.00081794796,0.0042913305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005683737,0.00007089115,0.0007392144,0.00012249195,0.00002385874,0.0007976164,0.00041353027,0.010389499,0.02681967,0.8764048,0.02132846,0.06232162],"study_design_scores_gemma":[0.00018740403,0.00024702726,0.002210343,0.000097272634,0.000026377153,0.0012168626,0.0011144159,0.04664043,0.029791048,0.78814894,0.1302053,0.00011460533],"about_ca_topic_score_codex":0.0031684448,"about_ca_topic_score_gemma":0.003585779,"teacher_disagreement_score":0.044082522,"about_ca_system_score_codex":0.00049316196,"about_ca_system_score_gemma":0.0004128894,"threshold_uncertainty_score":0.14747071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961704,0.00059357926,0.04422377,0.000411555,0.000117681346,0.00004266906,0.00087791827,0.00033701287,0.057225298],"genre_scores_gemma":[0.9740753,0.00028534693,0.015767207,0.000077715384,0.000031935873,0.0000516853,0.00073070824,0.00008109361,0.008899022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958795,0.00008967974,0.00002139515,0.00007776042,0.00009207729,0.00013107093],"domain_scores_gemma":[0.9992698,0.00025600847,0.0001487203,0.00014939596,0.000053544,0.00012265782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018310575,0.00038739876,0.00035156208,0.0010431171,0.0013614492,0.0011672992,0.00047291757,0.0006684083,0.0076042176],"category_scores_gemma":[0.0016780075,0.00051234214,0.00048636782,0.0012488533,0.0010397651,0.0008586117,0.0011348746,0.00049446814,0.0009942373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001054238,0.00015767677,0.008500181,0.0002909623,0.00015115822,0.0030304024,0.002267513,0.06807427,0.026955198,0.80272955,0.022111174,0.06467768],"study_design_scores_gemma":[0.00014014982,0.00020888857,0.022384055,0.00016310434,0.00013082387,0.0033298917,0.002626563,0.21004753,0.022341488,0.6952705,0.043224525,0.00013249241],"about_ca_topic_score_codex":0.0030651297,"about_ca_topic_score_gemma":0.0026735908,"teacher_disagreement_score":0.0076042176,"about_ca_system_score_codex":0.0006142307,"about_ca_system_score_gemma":0.00032202055,"threshold_uncertainty_score":0.025438607},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40240383,0.0027105748,0.14845717,0.005330876,0.00089308963,0.00013607988,0.0019112854,0.0005188195,0.43763825],"genre_scores_gemma":[0.9019778,0.00081490964,0.046278644,0.00055506546,0.00044968707,0.00016961005,0.0005826263,0.00015277058,0.049018912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00022728708,0.00004135327,0.00019351624,0.00021937468,0.00013168174],"domain_scores_gemma":[0.99445266,0.0034461007,0.0005935924,0.00040563193,0.000576207,0.00052571675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075253705,0.00042513193,0.00038337274,0.0039062314,0.0020099776,0.0027828682,0.00084437354,0.0008450638,0.019103274],"category_scores_gemma":[0.0046328832,0.0004361009,0.00041430347,0.0020620879,0.0015288441,0.003803616,0.0013117009,0.0021254283,0.0017786328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004887794,0.000021736232,0.00047269944,0.00006890811,0.000012318237,0.00010696581,0.00018132546,0.00083107356,0.0012506674,0.9810384,0.004640478,0.011326571],"study_design_scores_gemma":[0.00001937595,0.000031255026,0.0013146088,0.000051577335,0.00002680325,0.00059202965,0.00015039055,0.008589495,0.0020349908,0.96444297,0.022725519,0.000021079824],"about_ca_topic_score_codex":0.00052254274,"about_ca_topic_score_gemma":0.0011177735,"teacher_disagreement_score":0.019103274,"about_ca_system_score_codex":0.0016060859,"about_ca_system_score_gemma":0.00052152044,"threshold_uncertainty_score":0.06390679},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32719225,0.0013788142,0.34224185,0.0009685178,0.0006713296,0.00019620566,0.0018247499,0.0007764615,0.32474983],"genre_scores_gemma":[0.91244346,0.00052574574,0.040398862,0.00024736213,0.00019565565,0.0001121386,0.0011430385,0.00011377501,0.04481999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995421,0.00009668575,0.000031069314,0.00008875336,0.00013709914,0.0001042845],"domain_scores_gemma":[0.9988625,0.00038064318,0.00016693372,0.00017761734,0.00021014559,0.00020210736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038905343,0.00047742474,0.00045909997,0.0014969633,0.0011369236,0.0023553756,0.00093166257,0.0005920189,0.014264839],"category_scores_gemma":[0.0015885109,0.00033242835,0.00045601127,0.0009821291,0.0011245678,0.002344495,0.0015143631,0.0013739092,0.0024926127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056054283,0.000034828965,0.000095987736,0.00006135025,0.0000074204104,0.00012706683,0.00012244828,0.0011076696,0.0019297579,0.98390824,0.0014262822,0.011122919],"study_design_scores_gemma":[0.000030954594,0.000035708454,0.00015162486,0.000032527834,0.00001219367,0.00015156675,0.0001038613,0.0059001725,0.0020808247,0.9809171,0.01056858,0.000014990061],"about_ca_topic_score_codex":0.00062444917,"about_ca_topic_score_gemma":0.0015751453,"teacher_disagreement_score":0.014264839,"about_ca_system_score_codex":0.0008650433,"about_ca_system_score_gemma":0.00063347217,"threshold_uncertainty_score":0.04772067},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20923953,0.0027136544,0.49583045,0.008074926,0.0035450642,0.0006823548,0.0076464037,0.0037405454,0.26852718],"genre_scores_gemma":[0.85943985,0.0010559898,0.10933151,0.0025643709,0.0016381965,0.0005598369,0.004641935,0.0006220935,0.020146213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741423,0.00052327284,0.00027377074,0.00082754524,0.00046852115,0.00049258396],"domain_scores_gemma":[0.983836,0.008401987,0.0012321433,0.0019324347,0.0022290412,0.002368364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017573067,0.000867647,0.0014177752,0.002504017,0.0028228408,0.0033298275,0.0012728634,0.0033161195,0.020972835],"category_scores_gemma":[0.018090762,0.0009891264,0.0013398661,0.0013265775,0.003204743,0.0077846525,0.0030102246,0.0040004794,0.0044097803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089686154,0.00031788388,0.0040138327,0.0005463158,0.000094501636,0.001984149,0.0008074498,0.0032507225,0.02495639,0.89572436,0.042096104,0.025311457],"study_design_scores_gemma":[0.00031711257,0.0002539781,0.0030358438,0.00022744619,0.00011669757,0.0032596574,0.0011366179,0.015207677,0.013595616,0.9095685,0.05310763,0.00017318927],"about_ca_topic_score_codex":0.0015086484,"about_ca_topic_score_gemma":0.0020645906,"teacher_disagreement_score":0.020972835,"about_ca_system_score_codex":0.0011582705,"about_ca_system_score_gemma":0.0016338589,"threshold_uncertainty_score":0.070161164},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1998606,0.0060026245,0.26511538,0.0034827003,0.00077484956,0.0001134315,0.0006511076,0.0003106964,0.5236886],"genre_scores_gemma":[0.90536785,0.0019554691,0.038959403,0.0005155794,0.0004898616,0.00015059292,0.00040528234,0.00011059006,0.05204538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991091,0.0003316566,0.00004399151,0.00012584568,0.00027997675,0.00010943426],"domain_scores_gemma":[0.99843687,0.0007699903,0.00021182752,0.00023259311,0.0002093325,0.00013935298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042964914,0.00040635417,0.00037421295,0.0020794591,0.0013597789,0.0031924467,0.0008085569,0.00083795306,0.015969273],"category_scores_gemma":[0.0032207663,0.00044485487,0.00036461107,0.0016108518,0.001919866,0.0040898095,0.0013713248,0.0013041128,0.001686232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012585806,0.000009352897,0.00014943813,0.00002303929,0.0000044858916,0.0000624083,0.00006506453,0.0007828844,0.00045622827,0.9920534,0.0012737116,0.005107461],"study_design_scores_gemma":[0.000008119871,0.000012015187,0.00025087013,0.000021817903,0.000009196431,0.00036320495,0.0001545538,0.0074345255,0.0005137947,0.98041415,0.0108100185,0.0000076662145],"about_ca_topic_score_codex":0.0006686606,"about_ca_topic_score_gemma":0.001286646,"teacher_disagreement_score":0.015969273,"about_ca_system_score_codex":0.000835208,"about_ca_system_score_gemma":0.00033896603,"threshold_uncertainty_score":0.05342257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2576423,0.00077334774,0.7171796,0.00018302507,0.000086015505,0.00015822347,0.00047719516,0.00088216015,0.022618156],"genre_scores_gemma":[0.74930245,0.00028014136,0.2431495,0.00008277923,0.000040043127,0.00019644201,0.0005944954,0.00008757508,0.006266584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990876,0.00034466395,0.00006198566,0.0001848823,0.00019566367,0.00012532223],"domain_scores_gemma":[0.9976956,0.0011574507,0.0002815532,0.00063712086,0.00011713535,0.00011109693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081399694,0.00052718236,0.0004853214,0.0009297981,0.0006277852,0.0015661735,0.00063901965,0.00076942047,0.007203121],"category_scores_gemma":[0.0042469944,0.0004217942,0.0006847101,0.00075316906,0.0008724208,0.001784068,0.001567217,0.0010840456,0.0013397557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006695586,0.00016215508,0.0021500948,0.00034479157,0.00008475047,0.000315983,0.0004703499,0.032604154,0.037802693,0.7667237,0.0023627484,0.15630908],"study_design_scores_gemma":[0.00023026309,0.00063512195,0.0011676601,0.00017393571,0.00010382126,0.0012239104,0.00033155986,0.1908716,0.059089888,0.7189954,0.027041921,0.0001348565],"about_ca_topic_score_codex":0.00016643475,"about_ca_topic_score_gemma":0.0002688445,"teacher_disagreement_score":0.007203121,"about_ca_system_score_codex":0.0004079908,"about_ca_system_score_gemma":0.00044070728,"threshold_uncertainty_score":0.024096906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18662515,0.0018356014,0.66617006,0.0027617824,0.0006792827,0.00016244415,0.0013538897,0.00061755214,0.1397942],"genre_scores_gemma":[0.82635635,0.0011754454,0.12426765,0.0007959418,0.000418536,0.00014399791,0.0008319463,0.00014114204,0.045868922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991761,0.00023453635,0.000034700868,0.00018947017,0.00016922431,0.0001959774],"domain_scores_gemma":[0.9982855,0.0005379454,0.00027985775,0.00033695198,0.00031389933,0.0002457664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067803403,0.00048859965,0.0004645191,0.0014674768,0.0013088894,0.0018170452,0.00044437803,0.0007732486,0.00935608],"category_scores_gemma":[0.003073483,0.00029796557,0.0004858317,0.0010401778,0.0014659844,0.0027302785,0.001442403,0.0011688047,0.0018067299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006127256,0.00003546996,0.0003392648,0.00004742197,0.00001120899,0.00010036962,0.00014487021,0.0020009717,0.0017484118,0.9743303,0.0051599583,0.016020486],"study_design_scores_gemma":[0.000012939624,0.000022752713,0.00030029015,0.000026878677,0.00000963213,0.00021128374,0.00013318409,0.011442551,0.00081034517,0.9773926,0.009622862,0.000014662906],"about_ca_topic_score_codex":0.0016352517,"about_ca_topic_score_gemma":0.0027809672,"teacher_disagreement_score":0.00935608,"about_ca_system_score_codex":0.0009506815,"about_ca_system_score_gemma":0.00089464127,"threshold_uncertainty_score":0.031299233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6660599,0.0019028089,0.23488913,0.006548942,0.00024647047,0.00010469491,0.0032516203,0.0011439974,0.08585241],"genre_scores_gemma":[0.96796316,0.0005162762,0.017847177,0.00046734858,0.00013393312,0.0000951318,0.00085922994,0.00015063418,0.011967073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991812,0.0002155931,0.000035831,0.00022193309,0.00015584745,0.00018959207],"domain_scores_gemma":[0.9875607,0.0077817966,0.0015073579,0.0016822594,0.00087880355,0.0005890773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011472922,0.00038748427,0.00051532633,0.0013146613,0.0013768341,0.0017934385,0.0009879369,0.0008507914,0.0065952246],"category_scores_gemma":[0.01204901,0.00040807,0.00026308402,0.0008958892,0.0012404101,0.003130934,0.0012903449,0.0013114249,0.00083831005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000909224,0.00011321336,0.00843505,0.00038585011,0.00007405846,0.0005112915,0.0009707392,0.0399178,0.010717088,0.842236,0.033250563,0.06247915],"study_design_scores_gemma":[0.00010562849,0.00011224413,0.0071025235,0.00017722101,0.00007734072,0.0011025674,0.00096992846,0.12914325,0.010279092,0.8221291,0.028744861,0.000056276556],"about_ca_topic_score_codex":0.0012765944,"about_ca_topic_score_gemma":0.0021819305,"teacher_disagreement_score":0.0065952246,"about_ca_system_score_codex":0.0011199105,"about_ca_system_score_gemma":0.0006790474,"threshold_uncertainty_score":0.022063196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5228035,0.0012010123,0.28077918,0.00083583477,0.0005234375,0.00017235533,0.00072527875,0.00055725715,0.19240214],"genre_scores_gemma":[0.96300393,0.00042249018,0.019622076,0.00015721782,0.00013665495,0.00010682968,0.00048530914,0.00013351151,0.015931996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929714,0.00015146763,0.000034692435,0.0001673517,0.00019949063,0.00014978564],"domain_scores_gemma":[0.9976794,0.0010684031,0.00034421656,0.00040233054,0.00024897838,0.00025681933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005220148,0.00052534166,0.0005359006,0.0021245547,0.0022009967,0.0035984959,0.00097389496,0.0017432269,0.009570466],"category_scores_gemma":[0.004199232,0.00050824904,0.0006194445,0.001398561,0.0021157407,0.0022631213,0.0016929433,0.0017255405,0.0015466175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049048613,0.000030744606,0.0004569689,0.000039280447,0.000011697303,0.0003216446,0.00016748816,0.0016205604,0.0035161274,0.98699087,0.0013033241,0.0054923226],"study_design_scores_gemma":[0.0000347031,0.000039596744,0.0009503857,0.000052015443,0.000021358192,0.00108362,0.0003300799,0.013064254,0.003693312,0.9729812,0.007723064,0.000026520689],"about_ca_topic_score_codex":0.0005489322,"about_ca_topic_score_gemma":0.00093792885,"teacher_disagreement_score":0.009570466,"about_ca_system_score_codex":0.0008636555,"about_ca_system_score_gemma":0.00046447662,"threshold_uncertainty_score":0.032016456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05378827,0.058071177,0.46409407,0.01911977,0.0055102804,0.0003569007,0.0048852423,0.0022537927,0.3919205],"genre_scores_gemma":[0.6363166,0.04771998,0.18923719,0.009428511,0.0092471745,0.0019849478,0.006055161,0.0025254898,0.09748501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950199,0.0008917815,0.00017323821,0.0006286155,0.0020983706,0.0011880111],"domain_scores_gemma":[0.97140044,0.021685425,0.00088449655,0.002378608,0.0025355017,0.0011155426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043376284,0.004153387,0.0021310984,0.008722027,0.0036979215,0.009091354,0.0051219356,0.0034410132,0.030089883],"category_scores_gemma":[0.0385695,0.0013968094,0.0022116222,0.009516402,0.0043166755,0.010252695,0.00669981,0.010929743,0.009777998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004332162,0.0002372566,0.0008113292,0.00088330935,0.00012524071,0.00022462166,0.00047004363,0.018416772,0.0033114068,0.8260172,0.06345112,0.0856185],"study_design_scores_gemma":[0.000047278234,0.00007449964,0.00045836644,0.00038014914,0.00011916824,0.00031281283,0.00013677932,0.034972746,0.0025892432,0.9354266,0.025414133,0.00006831205],"about_ca_topic_score_codex":0.0037698469,"about_ca_topic_score_gemma":0.005725616,"teacher_disagreement_score":0.030089883,"about_ca_system_score_codex":0.007032463,"about_ca_system_score_gemma":0.0025990547,"threshold_uncertainty_score":0.10066068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37072852,0.0015447545,0.40075666,0.0036103867,0.00076809915,0.00029912795,0.0017421116,0.000569675,0.2199807],"genre_scores_gemma":[0.8436399,0.001241737,0.09874311,0.001141758,0.00041895054,0.00027317693,0.0017305388,0.00027042156,0.05254032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972861,0.0010148634,0.00012490529,0.00059281854,0.00042010113,0.00056114566],"domain_scores_gemma":[0.9934075,0.0033477927,0.0011243214,0.0009934925,0.0005087091,0.0006181376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011190787,0.00089230685,0.00091720687,0.0036917373,0.003425822,0.0039779316,0.0014287226,0.0022351013,0.0146243945],"category_scores_gemma":[0.0071313516,0.0008389042,0.0010856558,0.0027526019,0.0026751996,0.008743686,0.0044149226,0.0018893749,0.0024505253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015943008,0.00007584858,0.000970954,0.00013309963,0.000043636002,0.0005498251,0.0004321992,0.0047927154,0.0016412999,0.97130144,0.0053462293,0.014553251],"study_design_scores_gemma":[0.0000249848,0.000027380365,0.0005349419,0.00008347152,0.000028186323,0.0004906812,0.0003978859,0.015340088,0.0012493151,0.97208947,0.009706007,0.000027711465],"about_ca_topic_score_codex":0.0017801515,"about_ca_topic_score_gemma":0.0027661,"teacher_disagreement_score":0.0146243945,"about_ca_system_score_codex":0.0017309124,"about_ca_system_score_gemma":0.0008296639,"threshold_uncertainty_score":0.048923433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37930277,0.00065955496,0.34654033,0.0008865313,0.0007711571,0.00026088627,0.0017271305,0.0013750403,0.26847658],"genre_scores_gemma":[0.92215115,0.00019532997,0.041175906,0.000295936,0.00006138563,0.000110037436,0.00052057125,0.00011211638,0.035377536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891114,0.00034437902,0.000074112504,0.00015110834,0.00022782628,0.00029149157],"domain_scores_gemma":[0.99844223,0.00036476433,0.00028275014,0.00043754294,0.0003069976,0.00016574173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077796326,0.0004349279,0.000372767,0.0009984951,0.0011600284,0.0021193074,0.00074757193,0.0008563408,0.014842013],"category_scores_gemma":[0.0024982626,0.00031930435,0.00044425775,0.00073518255,0.0008678991,0.0017484657,0.0011193975,0.0005484134,0.003335691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029513222,0.00006973438,0.00081692555,0.00011175662,0.000027165694,0.0003365681,0.00024631084,0.0030902775,0.008080128,0.9454861,0.0070632636,0.034376647],"study_design_scores_gemma":[0.00011688443,0.00024545807,0.0008388187,0.000095818075,0.000047251033,0.00075937656,0.00032635144,0.021733288,0.011361915,0.92568207,0.038728204,0.000064557775],"about_ca_topic_score_codex":0.0008481175,"about_ca_topic_score_gemma":0.0022500171,"teacher_disagreement_score":0.014842013,"about_ca_system_score_codex":0.00091113104,"about_ca_system_score_gemma":0.0008864876,"threshold_uncertainty_score":0.049651444},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0764422,0.010187102,0.30359125,0.0020881079,0.0024834203,0.00010553474,0.0003418422,0.0006808927,0.6040796],"genre_scores_gemma":[0.5468569,0.0125273,0.10829414,0.000839415,0.0022399607,0.00022579044,0.0005652233,0.00079241564,0.32765895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.000075959586,0.000019470956,0.00008613704,0.00015866011,0.000052148935],"domain_scores_gemma":[0.9993476,0.00023804374,0.00007145597,0.00015119673,0.00013948728,0.00005212721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032421292,0.00056892476,0.00041491768,0.0016965896,0.0012651272,0.0019650094,0.0004997515,0.00096000254,0.010078263],"category_scores_gemma":[0.0016678046,0.00046247087,0.00045797596,0.0021330928,0.002478236,0.0029618598,0.0016841392,0.002141495,0.002452722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009606383,0.0000052898163,0.00002474788,0.000026567925,0.0000014756615,0.000032514876,0.00008756816,0.0004132366,0.00036746365,0.9821472,0.0018284343,0.015055839],"study_design_scores_gemma":[0.000004407672,0.000009541196,0.000064850305,0.000022630415,0.0000034365964,0.00016426314,0.000043441923,0.0012020259,0.00068203884,0.96186393,0.035930023,0.000009397394],"about_ca_topic_score_codex":0.0006484409,"about_ca_topic_score_gemma":0.0004322619,"teacher_disagreement_score":0.010078263,"about_ca_system_score_codex":0.000929006,"about_ca_system_score_gemma":0.0005957099,"threshold_uncertainty_score":0.03371513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7014199,0.00043891737,0.24892363,0.0014908817,0.00025086247,0.00032800724,0.0029780546,0.0007496774,0.04342007],"genre_scores_gemma":[0.9363454,0.00014537542,0.04818006,0.00038551213,0.00009036694,0.00016136588,0.0013274464,0.00013896912,0.013225473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.0007757136,0.00007606502,0.00030144778,0.00032180216,0.0004486888],"domain_scores_gemma":[0.99580574,0.0017174885,0.00056857074,0.0009552046,0.00046352492,0.00048934325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010802236,0.00055521843,0.000451483,0.0010069823,0.0011185565,0.0010129112,0.00066605833,0.00094647496,0.011021172],"category_scores_gemma":[0.008003036,0.00039169026,0.00054681563,0.0006338113,0.0012656153,0.0017407833,0.0016434642,0.00082481105,0.0017835159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038219101,0.00053482444,0.0073868833,0.00041198445,0.00017210547,0.0008322973,0.0007431643,0.048705403,0.06391135,0.76486814,0.037976388,0.07063556],"study_design_scores_gemma":[0.00045797654,0.00051480345,0.0056923092,0.00013821742,0.00009606216,0.0013507584,0.00084402843,0.23794416,0.020893127,0.71809745,0.013822178,0.00014896913],"about_ca_topic_score_codex":0.0012036958,"about_ca_topic_score_gemma":0.003019993,"teacher_disagreement_score":0.011021172,"about_ca_system_score_codex":0.0008103835,"about_ca_system_score_gemma":0.0008548199,"threshold_uncertainty_score":0.036869466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4173289,0.0044333492,0.19294576,0.0046329424,0.00084679027,0.0002979872,0.0024214617,0.00097153574,0.37612125],"genre_scores_gemma":[0.8513443,0.004091209,0.08464134,0.0019888585,0.0008261112,0.0003316415,0.004507695,0.0006412028,0.051627673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834204,0.0004538718,0.0000560269,0.00026487772,0.000413787,0.0004693532],"domain_scores_gemma":[0.9944674,0.0033557157,0.0007138281,0.0008027351,0.0002634685,0.00039697322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630653,0.0010786677,0.0012274536,0.002150944,0.002831913,0.0033663327,0.002005029,0.00207783,0.01767045],"category_scores_gemma":[0.006436587,0.00080934085,0.0010491667,0.003670491,0.00246896,0.0052825715,0.00409902,0.0035629324,0.0029672538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025062653,0.00014237339,0.00070543226,0.00020685596,0.000037679965,0.0003997148,0.00053604436,0.01602095,0.0016093819,0.92881423,0.024904236,0.026372412],"study_design_scores_gemma":[0.000043367058,0.000046234753,0.0006020788,0.00008611066,0.00002212222,0.000446304,0.00029142614,0.030098202,0.001012856,0.95588654,0.01143051,0.000034071283],"about_ca_topic_score_codex":0.0030863099,"about_ca_topic_score_gemma":0.0045844056,"teacher_disagreement_score":0.01767045,"about_ca_system_score_codex":0.0019932059,"about_ca_system_score_gemma":0.0010397543,"threshold_uncertainty_score":0.059113562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71534705,0.00076194375,0.090469874,0.00112617,0.0002627791,0.00015871103,0.0065592984,0.0013058527,0.18400829],"genre_scores_gemma":[0.9381436,0.00023351269,0.03850561,0.00017560372,0.000028010658,0.000058660164,0.0036288006,0.00018906574,0.019037161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997179,0.00006071047,0.000012565143,0.00006189606,0.000049410526,0.0000974611],"domain_scores_gemma":[0.99961543,0.00010996229,0.00006251722,0.00008455668,0.000046482168,0.00008092954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086789405,0.00039521654,0.0005354796,0.00048523952,0.0008605956,0.0010634931,0.00064077176,0.00071690266,0.02273678],"category_scores_gemma":[0.0007990165,0.00031733114,0.00030245908,0.00090110156,0.00043278246,0.0009952717,0.0009257107,0.00047815297,0.00362513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041049267,0.00083319255,0.01285502,0.001743187,0.00025605634,0.006179324,0.0015215515,0.153765,0.10186064,0.34537727,0.14135198,0.2301519],"study_design_scores_gemma":[0.00027786265,0.0004996956,0.014799399,0.0002551859,0.00011614297,0.003835307,0.0031277232,0.4534868,0.07049189,0.3888997,0.064105116,0.00010516587],"about_ca_topic_score_codex":0.0017765514,"about_ca_topic_score_gemma":0.0025892523,"teacher_disagreement_score":0.02273678,"about_ca_system_score_codex":0.00045252524,"about_ca_system_score_gemma":0.0003922599,"threshold_uncertainty_score":0.07606214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6713159,0.0034073198,0.17577162,0.0023859174,0.00049166277,0.000051689676,0.0013380427,0.00039665596,0.14484121],"genre_scores_gemma":[0.98089683,0.0010077792,0.0086362045,0.00015479601,0.00029337275,0.000035156932,0.00029845454,0.000073813106,0.008603673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914634,0.0002022751,0.00004352916,0.00022484391,0.00021880647,0.00016427983],"domain_scores_gemma":[0.9956636,0.002506033,0.00060418353,0.00063283474,0.00018029238,0.0004131746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006787381,0.00055084337,0.0006423524,0.0026116662,0.0010400916,0.002925711,0.0011362133,0.0007108431,0.008081378],"category_scores_gemma":[0.006246839,0.00047280872,0.00039899393,0.0016752963,0.0026664357,0.0043134177,0.0021857552,0.0017792247,0.00094621617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016471268,0.000063106956,0.0025028612,0.00011181021,0.000032622953,0.00024200739,0.00035243173,0.011143417,0.0039427103,0.9486533,0.00393578,0.02885525],"study_design_scores_gemma":[0.00001517026,0.000041144645,0.0021665748,0.000048115857,0.000032705007,0.00068353565,0.00019651603,0.020073589,0.002159622,0.9688993,0.005658863,0.000024880634],"about_ca_topic_score_codex":0.0006113007,"about_ca_topic_score_gemma":0.0007875087,"teacher_disagreement_score":0.008081378,"about_ca_system_score_codex":0.00071135745,"about_ca_system_score_gemma":0.00034532644,"threshold_uncertainty_score":0.027034879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7918478,0.00051896874,0.11658797,0.0008897894,0.0001923103,0.00018993173,0.0010769574,0.00047723,0.08821903],"genre_scores_gemma":[0.9727303,0.00016120134,0.013430706,0.00018982608,0.000059057944,0.00009557679,0.0006359993,0.000052624044,0.012644782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965334,0.00008405337,0.000015006621,0.0000767593,0.00007174616,0.00009912109],"domain_scores_gemma":[0.9986106,0.00059787,0.00018499118,0.00013721352,0.00021244648,0.00025681005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029857323,0.00031637747,0.0003460063,0.0011102717,0.0010150882,0.001087933,0.0006331028,0.0008211233,0.008556397],"category_scores_gemma":[0.0025241624,0.00033717358,0.00029563843,0.0007691493,0.000853608,0.0012878776,0.00074381806,0.00069924584,0.00056331255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027479147,0.00010690573,0.0028662658,0.00016210749,0.000036240886,0.0008584561,0.00039639656,0.007966107,0.013288264,0.9446905,0.007707045,0.021647004],"study_design_scores_gemma":[0.00008419794,0.00006835459,0.0025337818,0.00006554954,0.00003771063,0.0006431129,0.0004853966,0.064319715,0.0059744613,0.91678864,0.008961099,0.000038046586],"about_ca_topic_score_codex":0.0024857917,"about_ca_topic_score_gemma":0.004337241,"teacher_disagreement_score":0.008556397,"about_ca_system_score_codex":0.0007014771,"about_ca_system_score_gemma":0.0007694935,"threshold_uncertainty_score":0.028623998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5136579,0.0009183251,0.24434921,0.0009569016,0.00027668383,0.00014626807,0.0013036196,0.0005415905,0.2378495],"genre_scores_gemma":[0.94445574,0.00025846844,0.017130667,0.00016114434,0.00010276988,0.000096563905,0.0005404781,0.0000825932,0.037171625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996258,0.00008526026,0.000023005667,0.00007416397,0.00009819303,0.00009353976],"domain_scores_gemma":[0.9989786,0.00029213293,0.00017986413,0.00017130443,0.00018339328,0.00019475436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038797013,0.00031350044,0.00039727977,0.0014434789,0.0010492846,0.0022977588,0.00077655935,0.0005231034,0.013502353],"category_scores_gemma":[0.0018211216,0.00028465874,0.00032567853,0.00072903844,0.0013983259,0.0024536569,0.0015465866,0.0011201601,0.0025537203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004289548,0.000030110366,0.00013790888,0.00005053499,0.0000053932627,0.00008812584,0.00018680507,0.0009405843,0.0021823924,0.98502016,0.0010836724,0.010231576],"study_design_scores_gemma":[0.00003322552,0.000041063504,0.00034905443,0.00003730042,0.000011070341,0.00017029734,0.00019587573,0.008035429,0.0028050616,0.97906655,0.009233952,0.000021174159],"about_ca_topic_score_codex":0.0005448574,"about_ca_topic_score_gemma":0.001127676,"teacher_disagreement_score":0.013502353,"about_ca_system_score_codex":0.0008518554,"about_ca_system_score_gemma":0.00054003805,"threshold_uncertainty_score":0.04516989},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12981592,0.00086542714,0.7016285,0.0014611002,0.0007693357,0.00056483527,0.0012393668,0.0018552841,0.16180022],"genre_scores_gemma":[0.7192538,0.0005614263,0.23546457,0.00090057356,0.00023689611,0.0009082178,0.00046696016,0.00023036252,0.041977238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795663,0.00073984195,0.0001235503,0.00032736306,0.00045738625,0.00039511145],"domain_scores_gemma":[0.9959883,0.0016232736,0.0003316666,0.0011422082,0.0006053635,0.00030921833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016190582,0.0006448458,0.00047122268,0.000770288,0.0010831687,0.001997341,0.000776583,0.0011834449,0.014068903],"category_scores_gemma":[0.005128376,0.0005284993,0.00051617954,0.00056848326,0.0012838953,0.001924656,0.0014041248,0.0011933686,0.003905621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080901873,0.00016579253,0.0006446216,0.00027474598,0.0000538209,0.00016053462,0.00018148121,0.007277285,0.023312327,0.8997384,0.00880665,0.058575347],"study_design_scores_gemma":[0.00032410613,0.00054969924,0.0007236653,0.0001728289,0.00008077709,0.00056526344,0.00016249945,0.04397199,0.032899145,0.8708936,0.049563795,0.000092590024],"about_ca_topic_score_codex":0.0005831223,"about_ca_topic_score_gemma":0.0008169323,"teacher_disagreement_score":0.014068903,"about_ca_system_score_codex":0.000983896,"about_ca_system_score_gemma":0.0014144004,"threshold_uncertainty_score":0.04706514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49499518,0.0023788197,0.15995346,0.0024602578,0.0005132002,0.0001517121,0.0023519523,0.0009478032,0.3362476],"genre_scores_gemma":[0.9114039,0.00093007064,0.035601072,0.0005832881,0.000095292286,0.0001126966,0.0018544494,0.00016336961,0.049255807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970275,0.000050485454,0.000009755629,0.00009191528,0.00007319325,0.00007184715],"domain_scores_gemma":[0.9991897,0.00029642836,0.00011829659,0.00011527063,0.00012436845,0.00015598183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026711175,0.00037338608,0.00025791297,0.0013287149,0.0016240707,0.0012615564,0.0007417967,0.00089226605,0.014328421],"category_scores_gemma":[0.0013719413,0.0003246865,0.0003607697,0.0008496807,0.0007361654,0.0015322056,0.0011604279,0.0011733896,0.0018344495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010687976,0.000053563734,0.0012549238,0.00010345743,0.00002476371,0.0006961248,0.0004745597,0.0019012328,0.006323943,0.9465421,0.01324475,0.02927369],"study_design_scores_gemma":[0.000059435457,0.00006787865,0.0031086658,0.000101889855,0.000037533224,0.00306709,0.0006489999,0.013065959,0.00455292,0.8684662,0.10677877,0.00004467492],"about_ca_topic_score_codex":0.0007353857,"about_ca_topic_score_gemma":0.0012867117,"teacher_disagreement_score":0.014328421,"about_ca_system_score_codex":0.00068750384,"about_ca_system_score_gemma":0.0004048395,"threshold_uncertainty_score":0.04793334},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3005191,0.0013418685,0.6410403,0.0013426263,0.00014985901,0.00021956328,0.0014638634,0.0009893874,0.05293348],"genre_scores_gemma":[0.667218,0.0008893269,0.29980424,0.00048824362,0.00010593545,0.0001566277,0.0027941251,0.00036201134,0.02818145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959105,0.00014816732,0.000020933969,0.00008598607,0.00006580796,0.00008800754],"domain_scores_gemma":[0.9983286,0.0010373337,0.0002227573,0.00015529786,0.00012491083,0.00013102121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006237449,0.00062464585,0.00067599583,0.0018404357,0.0010671858,0.0017789114,0.000855815,0.0009054129,0.009951347],"category_scores_gemma":[0.0042625493,0.0005108468,0.0006260509,0.0013412673,0.0011850162,0.0029016908,0.0018484718,0.0011260788,0.0018665858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038666924,0.00027833774,0.0061900453,0.00088049663,0.00011432749,0.0005976364,0.0013153431,0.095862046,0.010182731,0.629622,0.026889935,0.2276805],"study_design_scores_gemma":[0.000063330175,0.00012403929,0.001641799,0.00016760489,0.00003622115,0.00034413388,0.00088266126,0.23224625,0.0038255956,0.74668604,0.013944066,0.00003817927],"about_ca_topic_score_codex":0.001924994,"about_ca_topic_score_gemma":0.0039563337,"teacher_disagreement_score":0.009951347,"about_ca_system_score_codex":0.00081038,"about_ca_system_score_gemma":0.0007665853,"threshold_uncertainty_score":0.033290565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8457362,0.00041422716,0.06132048,0.00095402263,0.00045513478,0.000075414544,0.00077394024,0.0003136617,0.089957],"genre_scores_gemma":[0.9795303,0.00013906721,0.008664891,0.00016931769,0.00011221556,0.000057071113,0.00044820626,0.00006256796,0.010816276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908376,0.00022642383,0.00006539864,0.00012903407,0.00021568661,0.00027974788],"domain_scores_gemma":[0.9967463,0.0012579951,0.00070069585,0.00046089117,0.00035874682,0.00047534413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006813097,0.0003604376,0.0004300671,0.001708963,0.001277486,0.0023875989,0.0007196633,0.000986013,0.0111260675],"category_scores_gemma":[0.0049573975,0.000253731,0.0003181815,0.0010445426,0.0013534648,0.0025491405,0.0013035496,0.0010119283,0.0012651797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010896511,0.00017692875,0.0039570415,0.00011066725,0.0000320802,0.0008846796,0.0003065293,0.0066163307,0.02258639,0.92096514,0.007159829,0.036114786],"study_design_scores_gemma":[0.00010522203,0.0001616544,0.0025280623,0.000051615938,0.00003471688,0.0013947486,0.00037483504,0.04512612,0.010714249,0.9299922,0.009471817,0.00004469032],"about_ca_topic_score_codex":0.00051254313,"about_ca_topic_score_gemma":0.00065713545,"teacher_disagreement_score":0.0111260675,"about_ca_system_score_codex":0.0007242554,"about_ca_system_score_gemma":0.0006266622,"threshold_uncertainty_score":0.03722042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610022,0.0005313776,0.12688933,0.0033028412,0.00048799117,0.00011041139,0.0016225642,0.00054326496,0.20550996],"genre_scores_gemma":[0.94272345,0.00012950176,0.03331704,0.00047480178,0.000076143806,0.000113509566,0.00094541657,0.0001266925,0.02209332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832374,0.00028575907,0.000089348694,0.000463775,0.00048738765,0.00035004754],"domain_scores_gemma":[0.99397415,0.0037652343,0.0003828376,0.0008751089,0.000534827,0.00046774955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012000175,0.00040478216,0.0007222033,0.0013810325,0.0036299522,0.0033311667,0.0016803177,0.0014275203,0.012198935],"category_scores_gemma":[0.007941916,0.0007869262,0.0009303582,0.0008033763,0.0027038623,0.003594494,0.0034087496,0.0030494859,0.0017091134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819263,0.000048121474,0.0008138812,0.00006443161,0.000021427784,0.00023205281,0.00022571113,0.0007419825,0.005006928,0.98477256,0.002855315,0.005069249],"study_design_scores_gemma":[0.0000740563,0.00004007974,0.0008992677,0.000034781526,0.000032856202,0.00084924145,0.00036831028,0.0056814463,0.011376317,0.96869546,0.01191702,0.00003115299],"about_ca_topic_score_codex":0.00051553245,"about_ca_topic_score_gemma":0.0007196046,"teacher_disagreement_score":0.012198935,"about_ca_system_score_codex":0.0013236753,"about_ca_system_score_gemma":0.00074603787,"threshold_uncertainty_score":0.040809453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88467884,0.0007833003,0.0353953,0.0006928906,0.00018989993,0.000060388556,0.0019016389,0.0006134185,0.07568438],"genre_scores_gemma":[0.9692749,0.0003135479,0.022430262,0.00008315961,0.000025303132,0.000041648564,0.0015048556,0.00008596934,0.0062402827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996543,0.00006892402,0.0000187454,0.00006925682,0.00006809446,0.00012082199],"domain_scores_gemma":[0.9991185,0.00040090436,0.00012531367,0.00017060092,0.000068223024,0.00011639188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018718817,0.00046347486,0.00041039506,0.0010951,0.0017538845,0.0009581772,0.00054089894,0.0010719462,0.010500922],"category_scores_gemma":[0.0014749735,0.0004066861,0.0005729768,0.0016332484,0.0009726199,0.0009680912,0.0008388442,0.00044748987,0.0007461971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016427976,0.00030215055,0.013348957,0.00071707286,0.000264624,0.005458026,0.0020653245,0.17101493,0.039622184,0.6362,0.042180993,0.08718291],"study_design_scores_gemma":[0.00015459945,0.0002661639,0.023077033,0.00015027681,0.00023855436,0.004995676,0.0033023749,0.33968365,0.029271591,0.54627705,0.052442763,0.00014022362],"about_ca_topic_score_codex":0.0028459611,"about_ca_topic_score_gemma":0.0038255355,"teacher_disagreement_score":0.010500922,"about_ca_system_score_codex":0.00061823067,"about_ca_system_score_gemma":0.00028161035,"threshold_uncertainty_score":0.03512901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4644407,0.000781012,0.45351636,0.000407,0.00019534474,0.00013342478,0.00062877,0.00094248104,0.078954905],"genre_scores_gemma":[0.7747422,0.00034766557,0.20358525,0.0001516099,0.000043935157,0.0001228975,0.0005666369,0.00018424785,0.020255454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959475,0.00012316747,0.000020575222,0.000080578306,0.0000890142,0.000091924194],"domain_scores_gemma":[0.9993074,0.00023029691,0.00009251411,0.00023878743,0.00006802398,0.00006298142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023639532,0.00045605737,0.00040513714,0.0005300766,0.0006705722,0.0009677269,0.000592013,0.0008065135,0.007842428],"category_scores_gemma":[0.0015583757,0.00053593656,0.00036464413,0.00064606563,0.0006510411,0.0014127137,0.0012795202,0.0006684592,0.0012433585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013942899,0.00034931122,0.0025814003,0.00047204286,0.000117984484,0.0010818846,0.0010185766,0.13135327,0.06918774,0.51948375,0.017629137,0.2553307],"study_design_scores_gemma":[0.00014182855,0.0005723229,0.002408398,0.0002247845,0.00008588369,0.0011171484,0.0007718983,0.35444883,0.04610593,0.5397641,0.054277357,0.000081556514],"about_ca_topic_score_codex":0.0011886106,"about_ca_topic_score_gemma":0.002254952,"teacher_disagreement_score":0.007842428,"about_ca_system_score_codex":0.0004937657,"about_ca_system_score_gemma":0.00039148438,"threshold_uncertainty_score":0.02623552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6180879,0.0028279559,0.055808127,0.0013358605,0.0005452543,0.00026869358,0.003367463,0.00070237543,0.3170564],"genre_scores_gemma":[0.9257783,0.0005013103,0.014058111,0.00023056389,0.00006486734,0.00010694061,0.001253122,0.00007848581,0.057928223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971527,0.000050406463,0.000015365906,0.000054335324,0.00006300664,0.00010156645],"domain_scores_gemma":[0.99949634,0.00010648554,0.00011030018,0.000089729525,0.00010297985,0.00009418904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017177682,0.00030618382,0.00019127184,0.0009581142,0.0011634944,0.0008541047,0.00063504296,0.0005154,0.02186879],"category_scores_gemma":[0.0010367635,0.00016447503,0.00022649895,0.00075389503,0.0005459506,0.00074055884,0.0010062404,0.00043985195,0.002543157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057624467,0.000117607335,0.0025338125,0.0003273206,0.000035662604,0.00061617995,0.0006109852,0.007283777,0.018900275,0.88170666,0.026195833,0.061095666],"study_design_scores_gemma":[0.000087046545,0.00022713872,0.005023571,0.00011482499,0.000030654515,0.00089810224,0.0006698395,0.02302937,0.022403266,0.822366,0.12505727,0.000092886454],"about_ca_topic_score_codex":0.0019399299,"about_ca_topic_score_gemma":0.005145815,"teacher_disagreement_score":0.02186879,"about_ca_system_score_codex":0.0007915617,"about_ca_system_score_gemma":0.00078210654,"threshold_uncertainty_score":0.07315838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49789968,0.00116723,0.3054812,0.0009967783,0.00042067893,0.00021414425,0.0010169165,0.00079920946,0.19200411],"genre_scores_gemma":[0.91167855,0.0005420077,0.058256343,0.00039081965,0.00010230861,0.00020055365,0.000520365,0.00013568625,0.028173318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801135,0.00073606585,0.00012143368,0.00024047491,0.00043703118,0.00045364402],"domain_scores_gemma":[0.99702126,0.0012194352,0.0006223653,0.00049945846,0.0003699934,0.0002675625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252133,0.0005890117,0.00043708668,0.0013356858,0.0015609916,0.0021404924,0.000620451,0.0011531597,0.009366246],"category_scores_gemma":[0.003580959,0.0005011179,0.0005468034,0.0011661819,0.001468161,0.002274747,0.0016853453,0.00094260654,0.0019909819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025537866,0.000048564343,0.00064892235,0.00011340132,0.000021027028,0.0002036297,0.00035671334,0.0047777104,0.0050261556,0.96609205,0.0034023223,0.019054104],"study_design_scores_gemma":[0.0000818173,0.00014998572,0.0004963779,0.00014655282,0.000033284752,0.00036636755,0.00027579154,0.0162716,0.0050567524,0.9587423,0.018330552,0.000048523707],"about_ca_topic_score_codex":0.0010121255,"about_ca_topic_score_gemma":0.0022687786,"teacher_disagreement_score":0.009366246,"about_ca_system_score_codex":0.0013423414,"about_ca_system_score_gemma":0.0008186856,"threshold_uncertainty_score":0.031333208},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29868224,0.0005298848,0.39499018,0.0030889974,0.00055555184,0.000354117,0.0046445015,0.0020227667,0.29513168],"genre_scores_gemma":[0.8302307,0.0004016201,0.063688196,0.0006481187,0.000113220805,0.0002340941,0.0023088004,0.0003494331,0.10202588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994754,0.00010286933,0.000026551637,0.00014355623,0.000109466455,0.00014212656],"domain_scores_gemma":[0.998323,0.00066227897,0.0002328269,0.00037327802,0.0001726336,0.00023590209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035328753,0.0005852219,0.00037601293,0.0008745793,0.0012519708,0.002366257,0.0008304023,0.0011972317,0.037984718],"category_scores_gemma":[0.0023294794,0.00039733315,0.00055565865,0.00097375474,0.0008845166,0.0024880392,0.0013071016,0.0015029587,0.0045973994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000440524,0.0001604034,0.0018365864,0.00023638764,0.000060072394,0.0009149906,0.0003786358,0.008171248,0.017438238,0.8997457,0.023501638,0.04711552],"study_design_scores_gemma":[0.00010384341,0.00007995698,0.0019587753,0.00007858947,0.00005778638,0.0014991763,0.00043981458,0.031967595,0.012816558,0.91426426,0.03668193,0.000051682677],"about_ca_topic_score_codex":0.0013397187,"about_ca_topic_score_gemma":0.002916941,"teacher_disagreement_score":0.037984718,"about_ca_system_score_codex":0.00088544626,"about_ca_system_score_gemma":0.000960918,"threshold_uncertainty_score":0.12707156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.453992,0.0006736226,0.47133553,0.0005982103,0.0002687478,0.00024004695,0.00037000288,0.00093803904,0.071583875],"genre_scores_gemma":[0.88669837,0.00024254009,0.10229294,0.00014794499,0.000053001626,0.00010417969,0.0002943652,0.00015594542,0.010010803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993531,0.00023285141,0.00003852514,0.0001326058,0.00010427086,0.00013870433],"domain_scores_gemma":[0.9979232,0.0010913939,0.00017521494,0.0004297225,0.00014836769,0.00023209797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069268857,0.00038931798,0.00052155746,0.0007328382,0.0010121829,0.0014750992,0.00094790163,0.0007165065,0.0068918173],"category_scores_gemma":[0.0045881676,0.00027214733,0.00064093305,0.00079761486,0.000639323,0.0012085773,0.0008524915,0.001088004,0.0007274848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053473737,0.0005597177,0.003378544,0.00035015863,0.0001367221,0.0006111219,0.0005174318,0.106137395,0.027379286,0.6734312,0.012089372,0.1748744],"study_design_scores_gemma":[0.00015339087,0.0002750974,0.0013054645,0.00005986473,0.000111882786,0.00061244797,0.00023883823,0.34318373,0.0123500405,0.6288015,0.012868625,0.00003908105],"about_ca_topic_score_codex":0.0009186863,"about_ca_topic_score_gemma":0.0021545414,"teacher_disagreement_score":0.0068918173,"about_ca_system_score_codex":0.0005663009,"about_ca_system_score_gemma":0.0005607361,"threshold_uncertainty_score":0.023055434},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3297307,0.0013167666,0.22605017,0.0020456775,0.00073458796,0.00013203561,0.00083987357,0.0009338805,0.4382163],"genre_scores_gemma":[0.9324483,0.0004999842,0.019323895,0.0005044328,0.0003744219,0.000072935276,0.0005266411,0.00014046044,0.04610899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992507,0.00016805064,0.0000481201,0.00018608484,0.00017842231,0.00016851173],"domain_scores_gemma":[0.99779236,0.00083212374,0.00029229574,0.00059177895,0.00027694862,0.00021458931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004980203,0.0005051206,0.0005277804,0.0012517703,0.0014610091,0.00256523,0.00056212564,0.0007490256,0.017171558],"category_scores_gemma":[0.0027003968,0.00029786414,0.000596181,0.0009569483,0.0019922925,0.003475407,0.002223716,0.0014027862,0.0031496151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005507435,0.000023221257,0.0002616715,0.000044268723,0.000011562931,0.00015554471,0.000184728,0.00055241707,0.0024929778,0.98439527,0.0020622925,0.009761041],"study_design_scores_gemma":[0.000017985358,0.000035690537,0.00026810213,0.000022583556,0.000016544842,0.0004338864,0.00014920664,0.0026986455,0.0025833324,0.9798884,0.013867445,0.000018100578],"about_ca_topic_score_codex":0.00044836925,"about_ca_topic_score_gemma":0.00067303755,"teacher_disagreement_score":0.017171558,"about_ca_system_score_codex":0.0004841794,"about_ca_system_score_gemma":0.00044991286,"threshold_uncertainty_score":0.057444572},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06020256,0.0029070356,0.80639416,0.002238923,0.0004600945,0.00018174067,0.0014010796,0.00047439357,0.12574005],"genre_scores_gemma":[0.70166075,0.004081287,0.2194206,0.0015473721,0.0012917944,0.00039458906,0.0034681726,0.0004683031,0.06766715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984591,0.00059812603,0.00005400931,0.0003049599,0.000322562,0.000261194],"domain_scores_gemma":[0.99538463,0.0026521925,0.00041228588,0.00065814523,0.00054026424,0.00035240507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014234938,0.00091803004,0.0009567924,0.002104292,0.0016000743,0.0022286875,0.0010068249,0.0011943927,0.017019052],"category_scores_gemma":[0.006792344,0.0005841183,0.0010051543,0.0018461188,0.002205414,0.0058954656,0.0020951738,0.0022575464,0.0029451766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004854662,0.00003937034,0.00026593753,0.00012835089,0.000018043354,0.00009545289,0.00017763204,0.0057440703,0.0007592943,0.96925753,0.0097923735,0.013673355],"study_design_scores_gemma":[0.000008784357,0.000012423883,0.0001758826,0.000056292174,0.000007877693,0.000109747874,0.00006552426,0.020176934,0.0002241683,0.97282356,0.006328146,0.000010676129],"about_ca_topic_score_codex":0.0023265667,"about_ca_topic_score_gemma":0.0036559103,"teacher_disagreement_score":0.017019052,"about_ca_system_score_codex":0.0017199748,"about_ca_system_score_gemma":0.0008215444,"threshold_uncertainty_score":0.056934416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35755384,0.0011861807,0.420514,0.0013616331,0.0007507428,0.00071563723,0.0019094727,0.002014784,0.21399374],"genre_scores_gemma":[0.8348203,0.00038094685,0.1275356,0.0005702855,0.00012425681,0.00041317742,0.0006030879,0.00017797186,0.03537435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990747,0.00035171647,0.000054297452,0.0001201538,0.0002249155,0.00017422225],"domain_scores_gemma":[0.9987016,0.00035393465,0.00020364784,0.00033277538,0.00027359082,0.00013441058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071727135,0.00070554676,0.00044304525,0.000658298,0.00088716444,0.0013048515,0.00066600187,0.0010232847,0.017309071],"category_scores_gemma":[0.0019216632,0.0003850174,0.00046814865,0.0006114685,0.0008823348,0.0009370043,0.0009109714,0.00066956325,0.004402102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020006376,0.0003338268,0.0016684306,0.00064189127,0.00014468486,0.0008976737,0.00055678084,0.018607734,0.06977704,0.76570755,0.022031995,0.1176319],"study_design_scores_gemma":[0.00073428644,0.0013516211,0.0021322796,0.0003123988,0.00016443801,0.0011771366,0.00030847598,0.07217831,0.061146863,0.7572143,0.103088476,0.00019128992],"about_ca_topic_score_codex":0.00060869375,"about_ca_topic_score_gemma":0.002076545,"teacher_disagreement_score":0.017309071,"about_ca_system_score_codex":0.00075227604,"about_ca_system_score_gemma":0.00092088897,"threshold_uncertainty_score":0.0579046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33966908,0.0017133364,0.40932766,0.0017125998,0.00142628,0.00021799463,0.0013971501,0.0007144252,0.24382147],"genre_scores_gemma":[0.88938725,0.00037640473,0.06648152,0.00068734435,0.00039546998,0.00017859208,0.0008803598,0.00013198139,0.04148114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999263,0.00012917197,0.000047330297,0.00018679621,0.00023391763,0.00013973337],"domain_scores_gemma":[0.9985586,0.00049814483,0.00016164871,0.00027941796,0.00025778826,0.00024433565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004267415,0.00029648043,0.0004764557,0.0016251821,0.0014051669,0.0023408895,0.0010268526,0.0010347521,0.013093244],"category_scores_gemma":[0.0021041788,0.00035796865,0.00057015073,0.00080088753,0.0016839107,0.0028212068,0.0018682514,0.0019580082,0.001486667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027829345,0.000017364693,0.00021157291,0.000022775925,0.000004819758,0.000064780674,0.00007616196,0.0003856593,0.0013401405,0.99195826,0.0014721274,0.0044184597],"study_design_scores_gemma":[0.000045402678,0.00004469059,0.0004719871,0.000022682609,0.000010463061,0.00051272113,0.00010739453,0.010239457,0.0017516033,0.9638976,0.022870557,0.000025416815],"about_ca_topic_score_codex":0.00057283946,"about_ca_topic_score_gemma":0.00078494824,"teacher_disagreement_score":0.013093244,"about_ca_system_score_codex":0.0010975929,"about_ca_system_score_gemma":0.00063202844,"threshold_uncertainty_score":0.043801248},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3438178,0.003223736,0.15897633,0.007967771,0.0009565141,0.00011131725,0.0010641443,0.0004908508,0.4833915],"genre_scores_gemma":[0.9402183,0.0016962133,0.021762464,0.0014876298,0.00058590167,0.000091443166,0.00050379435,0.00019307244,0.03346119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917054,0.00026766254,0.00003577687,0.0001800894,0.00015662024,0.00018932787],"domain_scores_gemma":[0.99478036,0.0030443277,0.0006235642,0.0005666641,0.0004700445,0.0005150625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088687794,0.00045406222,0.0005343813,0.0024357163,0.0024474987,0.0030121556,0.00092297216,0.0012666392,0.01595844],"category_scores_gemma":[0.0080944,0.00042856476,0.0005260695,0.0015379955,0.0034152707,0.005267404,0.0024116384,0.0025477805,0.0018304478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028909442,0.000009918449,0.00021919743,0.000026784715,0.0000032899404,0.00005435362,0.00013500382,0.0007210346,0.00029184337,0.9909644,0.0024781774,0.005067158],"study_design_scores_gemma":[0.000009061236,0.000008298612,0.0002065016,0.000025644833,0.0000048171337,0.00013485664,0.000075038195,0.0034490833,0.00024317548,0.99062437,0.005211093,0.000008093381],"about_ca_topic_score_codex":0.0021343578,"about_ca_topic_score_gemma":0.0026005248,"teacher_disagreement_score":0.01595844,"about_ca_system_score_codex":0.0014689406,"about_ca_system_score_gemma":0.00067616015,"threshold_uncertainty_score":0.05338627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7530317,0.0012631457,0.046358254,0.0016255588,0.00031227205,0.00008250785,0.00038738738,0.00030838288,0.19663084],"genre_scores_gemma":[0.9694017,0.0003298509,0.01191192,0.00023045264,0.0001022961,0.000033686607,0.00019227073,0.00007495756,0.017722882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968696,0.000095842974,0.000013943826,0.000043743024,0.00007822692,0.000081338934],"domain_scores_gemma":[0.99960285,0.000118724995,0.000107954154,0.00006477036,0.00003664376,0.000068979585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024990807,0.0005941641,0.00032363605,0.0021751598,0.0017246207,0.0031056139,0.000626719,0.0008535034,0.009571868],"category_scores_gemma":[0.0010207881,0.00032243345,0.00041743254,0.0016567553,0.0023043589,0.001984721,0.0010358361,0.0013957728,0.00072420813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000313935,0.000017030483,0.00023093136,0.00002077627,0.000005178325,0.00015327448,0.00014086119,0.000885594,0.001110824,0.9908953,0.00082247483,0.0056863315],"study_design_scores_gemma":[0.000033612767,0.000046001514,0.0007831063,0.000029931325,0.000012687036,0.00058181287,0.00042740052,0.005797157,0.00434662,0.97679704,0.01111275,0.000031827596],"about_ca_topic_score_codex":0.0007683892,"about_ca_topic_score_gemma":0.0009954543,"teacher_disagreement_score":0.009571868,"about_ca_system_score_codex":0.00075250474,"about_ca_system_score_gemma":0.00041117592,"threshold_uncertainty_score":0.032021105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41851532,0.0009710788,0.23908147,0.0013723103,0.000327111,0.00020179208,0.00079993345,0.0008528417,0.33787817],"genre_scores_gemma":[0.8454494,0.00083014905,0.09257503,0.00064805994,0.00014072898,0.00025828392,0.0009164212,0.00020639219,0.05897561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920124,0.00025751247,0.000036531255,0.0000837989,0.00022886753,0.00019204382],"domain_scores_gemma":[0.9989592,0.0004824704,0.00013113373,0.00019395656,0.00012931682,0.0001038964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045868332,0.0006505021,0.00044881587,0.0010475348,0.0013021574,0.001525145,0.0006037307,0.00083649467,0.01665073],"category_scores_gemma":[0.0020752382,0.00045125812,0.0003662928,0.0013992605,0.0010074405,0.0018802627,0.0016606277,0.0010296764,0.0029649553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024087129,0.00007409242,0.00048614986,0.00008800439,0.0000150598535,0.00014511518,0.00028013863,0.012174988,0.0038539974,0.9188018,0.01214097,0.051698815],"study_design_scores_gemma":[0.000050935374,0.0001201354,0.00045459293,0.00006860624,0.000014043222,0.00025286275,0.0002313119,0.042365126,0.0029589888,0.93722403,0.016231835,0.00002759196],"about_ca_topic_score_codex":0.001132869,"about_ca_topic_score_gemma":0.0022773186,"teacher_disagreement_score":0.01665073,"about_ca_system_score_codex":0.0009675057,"about_ca_system_score_gemma":0.0007557728,"threshold_uncertainty_score":0.05570227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115789354,0.0006320188,0.8050383,0.0013904686,0.00041494757,0.00018332117,0.001018803,0.0017664451,0.07376641],"genre_scores_gemma":[0.37608606,0.00035832322,0.597671,0.00026204227,0.000043500517,0.00018805194,0.0010098373,0.0005993884,0.023781806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999708,0.00009873421,0.00001361852,0.00005808704,0.00007109667,0.000050402057],"domain_scores_gemma":[0.99956733,0.00022309239,0.000020435582,0.000095585245,0.00005622185,0.00003729873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030335377,0.00042138124,0.00058475777,0.00055456185,0.0007392217,0.0011007368,0.00090014044,0.0008246023,0.01877761],"category_scores_gemma":[0.0021519403,0.0004036031,0.00047670188,0.0006591025,0.0006682223,0.0012802692,0.0016774933,0.0010156691,0.0021773672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011701896,0.00018013088,0.0020801732,0.00043552386,0.000066093824,0.000689186,0.0009624666,0.2545494,0.016410591,0.4167942,0.044111397,0.26255062],"study_design_scores_gemma":[0.00014717867,0.00012539193,0.0006204194,0.00008053481,0.000021132946,0.00019892392,0.00053055596,0.6923085,0.0051553957,0.25766626,0.043109775,0.00003599257],"about_ca_topic_score_codex":0.0028886895,"about_ca_topic_score_gemma":0.006558863,"teacher_disagreement_score":0.01877761,"about_ca_system_score_codex":0.00054014206,"about_ca_system_score_gemma":0.00044576856,"threshold_uncertainty_score":0.062817335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61739093,0.0006595813,0.30395594,0.0005863585,0.00030257346,0.00012160063,0.00056430564,0.00040322874,0.07601538],"genre_scores_gemma":[0.85715884,0.00053063233,0.12081418,0.00017295871,0.00006516692,0.00011619641,0.0007567195,0.00013945872,0.020245748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992644,0.00027404254,0.000042847183,0.0001631913,0.00015489914,0.00010056964],"domain_scores_gemma":[0.9987684,0.00048102078,0.00016684637,0.00028354579,0.000139963,0.00016014029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040679835,0.00058514747,0.0008660495,0.0007659518,0.00096395874,0.0022318985,0.00080362975,0.00081858115,0.008841996],"category_scores_gemma":[0.0018297005,0.00077441,0.00049440714,0.0013234692,0.0014994714,0.0021509512,0.0020517674,0.0010526679,0.0011890183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089393125,0.00016534221,0.0021931804,0.0003204252,0.00011099714,0.001348256,0.0013111811,0.054679953,0.007974144,0.8693593,0.006396217,0.055247042],"study_design_scores_gemma":[0.00013196676,0.00027893702,0.0016105677,0.000103634564,0.0000671363,0.001174604,0.0013387611,0.1118775,0.0073892456,0.8512489,0.02472154,0.00005718972],"about_ca_topic_score_codex":0.0008427627,"about_ca_topic_score_gemma":0.0007520273,"teacher_disagreement_score":0.008841996,"about_ca_system_score_codex":0.00038882595,"about_ca_system_score_gemma":0.000429269,"threshold_uncertainty_score":0.029579401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75084335,0.0003648877,0.19537592,0.00054218806,0.00024817212,0.00008330248,0.00040705333,0.0002699363,0.051865157],"genre_scores_gemma":[0.97543913,0.00026295992,0.012281072,0.00013385106,0.0002573007,0.000055753913,0.00027017572,0.00012941434,0.011170187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993981,0.000114792296,0.000028992252,0.0001484551,0.00015809944,0.0001516396],"domain_scores_gemma":[0.99830425,0.0005370575,0.0003742125,0.00017361503,0.00020726671,0.0004036268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055730797,0.0006477587,0.0007069909,0.0030097624,0.0012940081,0.0025533293,0.00080442696,0.0008691243,0.008123741],"category_scores_gemma":[0.0023222144,0.00059390423,0.0008053554,0.0010425698,0.00287242,0.0028060672,0.0017241169,0.0019928368,0.0008268519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053555985,0.000022841119,0.0003166475,0.000018704564,0.0000068748727,0.00007009756,0.00028925049,0.002073924,0.0016233012,0.9914449,0.0005110672,0.003568859],"study_design_scores_gemma":[0.000019573929,0.000033435874,0.00072857173,0.000012374059,0.000009919962,0.00006972444,0.00018236428,0.016467357,0.0009366688,0.9795165,0.0019961696,0.000027325765],"about_ca_topic_score_codex":0.0017846267,"about_ca_topic_score_gemma":0.0014813027,"teacher_disagreement_score":0.008123741,"about_ca_system_score_codex":0.0008546937,"about_ca_system_score_gemma":0.0005689407,"threshold_uncertainty_score":0.027176559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113540165,0.0020047824,0.8146012,0.0018063607,0.00012264932,0.00010060064,0.00024914264,0.0005586135,0.067016475],"genre_scores_gemma":[0.8824825,0.0011213386,0.099255726,0.0005053324,0.00017782672,0.0005049692,0.00027370595,0.00011240361,0.015566218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707353,0.0013136822,0.000108968896,0.00049749675,0.00065563415,0.00035060217],"domain_scores_gemma":[0.98532087,0.0110361,0.00080876576,0.0015327289,0.00083174463,0.00046989223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002338074,0.0008753325,0.00080688513,0.0020219444,0.0016227361,0.002059744,0.0015668805,0.0019102058,0.0073740967],"category_scores_gemma":[0.011021754,0.0009102464,0.00083101174,0.0012942837,0.004168035,0.0034958906,0.0022494777,0.0031207069,0.0009351261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000425718,0.000035796846,0.00043135055,0.00010286388,0.000015301488,0.000114900344,0.00014452527,0.027460698,0.001181558,0.9582147,0.0013974053,0.010858381],"study_design_scores_gemma":[0.000019548837,0.00003238612,0.00013927087,0.00002960659,0.00000735832,0.00014932679,0.000038780192,0.038894825,0.00063608185,0.95706975,0.0029668233,0.00001623934],"about_ca_topic_score_codex":0.00074056315,"about_ca_topic_score_gemma":0.0006290825,"teacher_disagreement_score":0.0073740967,"about_ca_system_score_codex":0.0020838215,"about_ca_system_score_gemma":0.0007759886,"threshold_uncertainty_score":0.024668872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14798675,0.0036395467,0.73132837,0.013881001,0.0017669736,0.00016868491,0.000119573546,0.0024232,0.09868585],"genre_scores_gemma":[0.5529968,0.0017162116,0.41628936,0.0014115766,0.00032232594,0.00018428231,0.000076053664,0.00083061634,0.026172685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998637,0.00060195307,0.00005251011,0.00019577699,0.00036695096,0.00014587617],"domain_scores_gemma":[0.9979948,0.0014353556,0.000075643584,0.00028534036,0.00013282093,0.00007614546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014736545,0.0006018038,0.00075643254,0.00065891625,0.0024797334,0.00219876,0.0011315229,0.0012868838,0.005697273],"category_scores_gemma":[0.008361043,0.0004641659,0.00070552155,0.0005941664,0.004293295,0.005710622,0.003219733,0.0028042053,0.0010511782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001013467,0.000058276488,0.0005719291,0.00013033219,0.000019766709,0.00027460494,0.001337506,0.006299815,0.0029574914,0.93401486,0.009587674,0.044646442],"study_design_scores_gemma":[0.00007008692,0.0000837868,0.000120697514,0.000085284184,0.00002014309,0.00033756517,0.00045587623,0.045997355,0.00714862,0.85776544,0.08787741,0.0000378421],"about_ca_topic_score_codex":0.00089503,"about_ca_topic_score_gemma":0.0012559156,"teacher_disagreement_score":0.005697273,"about_ca_system_score_codex":0.00094246824,"about_ca_system_score_gemma":0.0011983938,"threshold_uncertainty_score":0.0190593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014187368,0.00056884665,0.9738124,0.00030066783,0.00014436852,0.000106975196,0.000053947402,0.0003069057,0.010518567],"genre_scores_gemma":[0.16174155,0.00079503347,0.8255567,0.00029051455,0.00020405283,0.00035877046,0.0002109182,0.00031703227,0.010525519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.0004187932,0.000044411983,0.00014043182,0.00027767898,0.00014594928],"domain_scores_gemma":[0.9969771,0.0023155427,0.00010696265,0.00022370624,0.0002791532,0.00009759069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014705447,0.00182323,0.0017347323,0.0007368055,0.0007351047,0.0016357983,0.001785552,0.001912187,0.008510482],"category_scores_gemma":[0.008753598,0.00084413996,0.0008971457,0.0016534769,0.00089020893,0.0024459846,0.0024650407,0.0022745046,0.0013452646],"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.00021511747,0.00019854553,0.00034457076,0.0002754926,0.000069954476,0.000094752264,0.00009407238,0.73457944,0.0027385126,0.059763424,0.008447686,0.19317837],"study_design_scores_gemma":[0.0000310449,0.000056032113,0.00005215784,0.00001622199,0.000007829964,0.000026152678,0.000022231417,0.9631799,0.00052732916,0.034931876,0.0011420597,0.0000071654167],"about_ca_topic_score_codex":0.0023161012,"about_ca_topic_score_gemma":0.004070445,"teacher_disagreement_score":0.008510482,"about_ca_system_score_codex":0.00070446276,"about_ca_system_score_gemma":0.0016961746,"threshold_uncertainty_score":0.028470337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7424313,0.001999643,0.15399048,0.0052006138,0.00036649895,0.00010039078,0.0008046746,0.0004847706,0.09462165],"genre_scores_gemma":[0.97352207,0.00060746266,0.017772224,0.00019633058,0.0001984345,0.000071369956,0.00033308342,0.00011458558,0.0071844645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834895,0.0004290965,0.000082368206,0.00016171423,0.0006892043,0.0002887333],"domain_scores_gemma":[0.9890732,0.008558628,0.0004870784,0.0009316961,0.0007184836,0.00023082504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014879205,0.00062417693,0.00086743035,0.0015455597,0.0013101602,0.003035944,0.0016641081,0.0010495826,0.011595143],"category_scores_gemma":[0.014497357,0.00039241178,0.00062135846,0.002112018,0.0022500663,0.006677953,0.0019458493,0.0022166735,0.0009788176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041582147,0.00013710454,0.0015969813,0.00017078531,0.00003655373,0.00017617519,0.00030221636,0.07795824,0.0030894496,0.87705755,0.0060574096,0.033001777],"study_design_scores_gemma":[0.000031722877,0.000047417205,0.0004589489,0.000028842334,0.000017590422,0.00008565904,0.00009843991,0.21510155,0.001503444,0.78102803,0.0015730293,0.000025335356],"about_ca_topic_score_codex":0.0021890325,"about_ca_topic_score_gemma":0.003681334,"teacher_disagreement_score":0.011595143,"about_ca_system_score_codex":0.0018280587,"about_ca_system_score_gemma":0.0015884821,"threshold_uncertainty_score":0.03878957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086229116,0.011872121,0.23231754,0.0022901043,0.0016992395,0.00007613585,0.00038588903,0.0002226424,0.6649072],"genre_scores_gemma":[0.7990104,0.010734482,0.09117091,0.001162077,0.0008051621,0.00015154367,0.00042233587,0.00012572233,0.09641742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996822,0.00006286986,0.000012130758,0.000049139737,0.00014997562,0.00004372872],"domain_scores_gemma":[0.9993463,0.00039594548,0.000036948808,0.000066413406,0.00011461844,0.00003977301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028403278,0.00027725854,0.0003423207,0.00065807375,0.0006224764,0.0016731556,0.00048307463,0.0007999456,0.004931511],"category_scores_gemma":[0.0017721715,0.0003661533,0.00021068672,0.00063936325,0.0013830957,0.0015408238,0.0011258379,0.0014393897,0.00076596026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026065982,0.0000075600597,0.00005030376,0.000055950368,0.0000035271523,0.000048623275,0.000071865616,0.0024094544,0.002199563,0.97847205,0.0023170626,0.014337973],"study_design_scores_gemma":[0.000019476323,0.000025473093,0.00012183248,0.000063443375,0.0000051905195,0.0002484733,0.00012020278,0.01570733,0.0032442748,0.9482292,0.032199983,0.000015176655],"about_ca_topic_score_codex":0.0004060918,"about_ca_topic_score_gemma":0.0004949541,"teacher_disagreement_score":0.004931511,"about_ca_system_score_codex":0.00048751498,"about_ca_system_score_gemma":0.0003914456,"threshold_uncertainty_score":0.016497552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41546497,0.00095239864,0.38253844,0.0016111389,0.001063482,0.0002255022,0.00071669236,0.0007506868,0.1966767],"genre_scores_gemma":[0.9242281,0.00031870737,0.032857895,0.00052737386,0.00016251704,0.00017614682,0.00028868864,0.000117294876,0.041323222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992053,0.00016313263,0.0000514486,0.00013198491,0.00023587696,0.00021235253],"domain_scores_gemma":[0.9990735,0.00020218591,0.00013103073,0.00024863836,0.00019917835,0.00014555755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045389432,0.00060385984,0.00066100346,0.0020341587,0.0015619292,0.0026401356,0.0005153624,0.0020991126,0.016282303],"category_scores_gemma":[0.0018666507,0.00039680113,0.0005292784,0.0009653866,0.0014938448,0.002574185,0.0023031125,0.0017809971,0.0030030108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009793228,0.000023425246,0.00022748667,0.00002984986,0.000007627588,0.00013530001,0.000107625696,0.002086714,0.004972378,0.98254484,0.0014011458,0.008365782],"study_design_scores_gemma":[0.00004118795,0.00012157156,0.000354334,0.000046321664,0.000014714895,0.00046747003,0.00023184324,0.03358288,0.011435196,0.944191,0.009454064,0.00005942059],"about_ca_topic_score_codex":0.0003970032,"about_ca_topic_score_gemma":0.00039082288,"teacher_disagreement_score":0.016282303,"about_ca_system_score_codex":0.0006865191,"about_ca_system_score_gemma":0.00066800584,"threshold_uncertainty_score":0.054469705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09300414,0.00031818534,0.869261,0.00025803066,0.000096051815,0.00017367028,0.00022936267,0.00047770428,0.036181793],"genre_scores_gemma":[0.48760074,0.00051014754,0.47582918,0.00027642061,0.0001813959,0.0004345119,0.0004495234,0.00031461185,0.034403462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738735,0.0008657293,0.00014987712,0.00063539244,0.0006743175,0.00028733886],"domain_scores_gemma":[0.9957461,0.0014555774,0.0004893389,0.0012020768,0.00076505996,0.00034197854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550604,0.0004873684,0.0005335161,0.0012159003,0.002098782,0.0017689451,0.00081468525,0.0009148791,0.010451209],"category_scores_gemma":[0.004636011,0.00081369106,0.0009311793,0.0011403918,0.0014921856,0.004871535,0.002394781,0.0014526693,0.0018662801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010104806,0.00007330631,0.001656665,0.00009724168,0.000024767356,0.00031824928,0.0010342693,0.0030785282,0.008811791,0.91592807,0.002087726,0.066788234],"study_design_scores_gemma":[0.0000700703,0.00081235514,0.0019331661,0.00009382678,0.0001182992,0.002219405,0.0006248402,0.037702147,0.02187739,0.75497717,0.17947918,0.00009213151],"about_ca_topic_score_codex":0.00077702606,"about_ca_topic_score_gemma":0.0010944512,"teacher_disagreement_score":0.010451209,"about_ca_system_score_codex":0.0008718216,"about_ca_system_score_gemma":0.00079757994,"threshold_uncertainty_score":0.034962714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2513893,0.002919072,0.18949912,0.0039785244,0.0027997138,0.00014501055,0.000341203,0.00095268956,0.5479753],"genre_scores_gemma":[0.6885867,0.003046736,0.029705517,0.0016045618,0.0021926824,0.00017872025,0.00044253393,0.0009054464,0.2733371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924314,0.00015714033,0.000025763908,0.00014597933,0.00027314172,0.00015486115],"domain_scores_gemma":[0.99921095,0.00026526835,0.00007848641,0.00015595257,0.000114886,0.00017451541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067469,0.0018364018,0.0016509742,0.0028688796,0.002191716,0.00339251,0.0009873845,0.0014263014,0.017258687],"category_scores_gemma":[0.0024622504,0.0005801597,0.0012419546,0.00164758,0.003281211,0.00510418,0.0032803894,0.004824719,0.0045955405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042529322,0.00003786173,0.000087460205,0.00004143832,0.000013200588,0.00004687854,0.00015078168,0.00095116824,0.0008546769,0.9775922,0.004718874,0.015462892],"study_design_scores_gemma":[0.000015324753,0.000021416963,0.00010960805,0.000019543837,0.0000074806135,0.000112092996,0.00003140437,0.003657475,0.0006072229,0.988777,0.006627491,0.000013914252],"about_ca_topic_score_codex":0.0003199775,"about_ca_topic_score_gemma":0.00037955277,"teacher_disagreement_score":0.017258687,"about_ca_system_score_codex":0.001231268,"about_ca_system_score_gemma":0.00050001714,"threshold_uncertainty_score":0.05773604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01207881,0.0035709117,0.10854762,0.0013637923,0.0051753945,0.00010461136,0.00051493314,0.00094332406,0.86770064],"genre_scores_gemma":[0.11765419,0.0029175165,0.08292752,0.0011430886,0.0010686812,0.00014230683,0.0007431675,0.00094086834,0.79246265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994293,0.00009981403,0.000034276836,0.00012730603,0.00021928754,0.00008995827],"domain_scores_gemma":[0.9994815,0.00014245242,0.000023429442,0.00012163193,0.00014833914,0.00008268561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003601381,0.00087324914,0.0008377778,0.0010667625,0.0016900798,0.0020213693,0.0009860336,0.0007244574,0.11504007],"category_scores_gemma":[0.0018220881,0.00040599663,0.00085027114,0.0014443892,0.0018453801,0.0023611935,0.0022137403,0.0021123958,0.037218235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020233176,0.00006032529,0.0002524175,0.0005413052,0.00003533242,0.00026090076,0.00032184672,0.0029127412,0.006321602,0.6454399,0.12103726,0.222614],"study_design_scores_gemma":[0.00002813566,0.00008338252,0.0003166542,0.00014587438,0.000025897054,0.000808719,0.00025560206,0.0035279004,0.004223496,0.41001108,0.58053285,0.000040396324],"about_ca_topic_score_codex":0.00052506756,"about_ca_topic_score_gemma":0.0013425951,"teacher_disagreement_score":0.11504007,"about_ca_system_score_codex":0.0005344761,"about_ca_system_score_gemma":0.00069078535,"threshold_uncertainty_score":0.38484734},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2469709,0.0018829796,0.25537437,0.0020693527,0.0016391501,0.00008544783,0.00018522174,0.00045228802,0.4913403],"genre_scores_gemma":[0.9145734,0.0009332971,0.032161575,0.0005807765,0.00061892415,0.000059553062,0.00008208759,0.00015012486,0.050840188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951684,0.00009957633,0.000024152943,0.000073882286,0.00018702605,0.000098388824],"domain_scores_gemma":[0.9987728,0.0003934968,0.0001738039,0.00019340581,0.0002842396,0.0001822636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124415,0.00038420013,0.00039718015,0.0009098697,0.0009715756,0.0021639718,0.0004406957,0.0005815271,0.015001072],"category_scores_gemma":[0.003064792,0.00022311514,0.00037020145,0.0009178739,0.0025321962,0.001981863,0.0009774175,0.0012922512,0.0023801157],"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.000052400123,0.000017900462,0.00017150448,0.000024034285,0.0000035034454,0.00028313493,0.0002978842,0.00091014913,0.0034478358,0.9852132,0.0015770679,0.008001393],"study_design_scores_gemma":[0.000024444218,0.00004922094,0.0002440454,0.00003811571,0.0000060060265,0.0005434947,0.00019419436,0.009852166,0.003552611,0.961708,0.023768386,0.000019270583],"about_ca_topic_score_codex":0.00060447917,"about_ca_topic_score_gemma":0.00065631093,"teacher_disagreement_score":0.015001072,"about_ca_system_score_codex":0.0006798358,"about_ca_system_score_gemma":0.0004996191,"threshold_uncertainty_score":0.050183535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56473225,0.0011481572,0.3588825,0.0010942238,0.00015650588,0.00010340383,0.0002458218,0.00037916366,0.073258005],"genre_scores_gemma":[0.95083416,0.0005737769,0.040833756,0.00022995978,0.00012560707,0.0001164593,0.00018282869,0.000083546525,0.0070200157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00018519541,0.00003935607,0.00008770884,0.00030545297,0.00023340313],"domain_scores_gemma":[0.99836034,0.0006449741,0.00026273102,0.0003122431,0.00028483468,0.00013490226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000748146,0.00040351387,0.00043995053,0.0011025686,0.00080325425,0.0011531047,0.00049466145,0.0007188812,0.0021019122],"category_scores_gemma":[0.0038220244,0.00024973584,0.0004065512,0.00067648117,0.0018266027,0.0021068607,0.0017626866,0.0010352555,0.00029702164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009333179,0.000026286929,0.00062190497,0.00005373571,0.0000080155705,0.00008165946,0.00016327602,0.015359398,0.007099056,0.94922256,0.0010562345,0.026214471],"study_design_scores_gemma":[0.000057628942,0.000116886455,0.0004285281,0.000052567215,0.000020049885,0.00034353102,0.00015118746,0.12417263,0.016332261,0.8457806,0.012487488,0.000056567467],"about_ca_topic_score_codex":0.0005381174,"about_ca_topic_score_gemma":0.0005145864,"teacher_disagreement_score":0.0021019122,"about_ca_system_score_codex":0.0009931528,"about_ca_system_score_gemma":0.000767496,"threshold_uncertainty_score":0.007205844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49972126,0.00084401894,0.44741705,0.0010678845,0.000078366706,0.000038337137,0.0008942929,0.00078044174,0.049158398],"genre_scores_gemma":[0.9070299,0.00059124106,0.08228855,0.00022354601,0.00007182234,0.00006363355,0.00072631025,0.00017611407,0.008828891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00017501756,0.00003437536,0.00019046251,0.00033565113,0.00013272747],"domain_scores_gemma":[0.9975775,0.0012465044,0.00019217438,0.0005393489,0.00030325653,0.00014120678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004912239,0.00038698092,0.0004289784,0.0012071416,0.00064275897,0.0016355858,0.00096807093,0.00055424345,0.004773258],"category_scores_gemma":[0.004532593,0.00030590224,0.000314945,0.0013293966,0.0012570848,0.0034316957,0.0012710213,0.0012941733,0.0006373033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081906204,0.000048552818,0.0022391826,0.00015303027,0.00001703087,0.00016690105,0.0003792627,0.017848548,0.008995062,0.9198028,0.0032556963,0.04701199],"study_design_scores_gemma":[0.0000102518325,0.00002019708,0.0008926986,0.00003495561,0.000014335867,0.00029332805,0.00018357801,0.09154702,0.0064597195,0.89245534,0.00807199,0.000016596672],"about_ca_topic_score_codex":0.0006883804,"about_ca_topic_score_gemma":0.0010140651,"teacher_disagreement_score":0.004773258,"about_ca_system_score_codex":0.0012042027,"about_ca_system_score_gemma":0.0005860891,"threshold_uncertainty_score":0.015968144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17969666,0.0005824448,0.70506257,0.0008154322,0.00028723245,0.0002612609,0.0008665133,0.0004916319,0.1119363],"genre_scores_gemma":[0.8430695,0.00041775996,0.13822316,0.0005617662,0.00013851642,0.0004242958,0.00044581652,0.00013818144,0.0165811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763215,0.0006790882,0.00019576658,0.00048517477,0.0006197886,0.0003879799],"domain_scores_gemma":[0.9973922,0.0006246364,0.00038132054,0.00073126494,0.0005540292,0.0003164673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016610974,0.0004677677,0.00059268175,0.0012766795,0.0016996356,0.0028497472,0.00071584235,0.0011574605,0.008627954],"category_scores_gemma":[0.0035373769,0.00045271488,0.0009290663,0.0010635924,0.0032688316,0.0025125674,0.0025966712,0.001334317,0.0011476716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029764178,0.0000071129816,0.00011265035,0.000020962656,0.000005030927,0.000030664833,0.00004407952,0.0011536556,0.0010733315,0.99215275,0.00039397733,0.0049761054],"study_design_scores_gemma":[0.00004241264,0.000132286,0.00030795278,0.000029925004,0.000015047526,0.00022790651,0.00012171532,0.017734319,0.004183456,0.9663294,0.010837882,0.000037829148],"about_ca_topic_score_codex":0.00029495626,"about_ca_topic_score_gemma":0.000327051,"teacher_disagreement_score":0.008627954,"about_ca_system_score_codex":0.0011233707,"about_ca_system_score_gemma":0.0008351623,"threshold_uncertainty_score":0.02886337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93648934,0.00019334072,0.051919274,0.0001737976,0.000027136914,0.000016752067,0.00015063307,0.00011058527,0.010919257],"genre_scores_gemma":[0.98723304,0.00013193348,0.009692888,0.000035943685,0.000009918622,0.000017969727,0.00016898706,0.000021907741,0.0026875262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998141,0.000032509946,0.000010713858,0.000042356023,0.000044310615,0.000055951026],"domain_scores_gemma":[0.9994105,0.000174497,0.00011573081,0.00016136703,0.000056972494,0.00008094814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021214329,0.0002677122,0.00040645798,0.00078941265,0.0006767465,0.0011233767,0.00059498724,0.00065131544,0.0032583987],"category_scores_gemma":[0.0010459522,0.00020632488,0.0006311905,0.0006350829,0.00083523075,0.0013187804,0.00053369283,0.00058549974,0.00038756293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042482762,0.00012690929,0.011514368,0.00010730033,0.000041364845,0.0006751318,0.00052820356,0.1178171,0.020239383,0.8198931,0.0017779518,0.026854351],"study_design_scores_gemma":[0.000043347365,0.000106230276,0.003372849,0.00002976872,0.000014969981,0.0005694191,0.00029272132,0.47310007,0.0048459163,0.5125428,0.0050431555,0.000038701517],"about_ca_topic_score_codex":0.0018344903,"about_ca_topic_score_gemma":0.0013874375,"teacher_disagreement_score":0.0032583987,"about_ca_system_score_codex":0.00050817686,"about_ca_system_score_gemma":0.00028699578,"threshold_uncertainty_score":0.010900438},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15156119,0.0002423128,0.81764406,0.00013589794,0.00007877886,0.0001856164,0.00029910708,0.0003217031,0.0295313],"genre_scores_gemma":[0.6928725,0.0002787952,0.28702822,0.00014848288,0.00003913856,0.00035257905,0.00047157911,0.00013767078,0.018670965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988362,0.00034503298,0.0000755729,0.00023498014,0.0002882009,0.00021998683],"domain_scores_gemma":[0.9982135,0.0005799901,0.0002681158,0.00044968358,0.00035458655,0.00013408749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010926827,0.00054902193,0.0005248977,0.00045240557,0.0005732794,0.0011313813,0.0007255562,0.0004598588,0.00748251],"category_scores_gemma":[0.002783359,0.00041156373,0.0003677711,0.00040183443,0.0008333586,0.0015448307,0.000985896,0.0007704224,0.0011153435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009789384,0.00013126036,0.0018840572,0.00042264533,0.00006833677,0.00023328442,0.00044175703,0.09016155,0.101054825,0.68323624,0.0026872342,0.11869983],"study_design_scores_gemma":[0.0004167165,0.0012746551,0.0017824485,0.00018320695,0.00013428977,0.00066365476,0.0003116277,0.34235695,0.13644275,0.44914705,0.06718276,0.00010391409],"about_ca_topic_score_codex":0.0007355606,"about_ca_topic_score_gemma":0.0016794308,"teacher_disagreement_score":0.00748251,"about_ca_system_score_codex":0.0009350075,"about_ca_system_score_gemma":0.0007187291,"threshold_uncertainty_score":0.025031447},"labels":[],"label_agreement":null},{"id":"W2529460726","doi":"10.1002/jcd.21536","title":"Triple Systems are Eulerian","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eulerian path; Mathematics; Combinatorics; Steiner system; Euler's formula; Triple system; Order (exchange); Graph; Context (archaeology); Rank (graph theory); Discrete mathematics; Pure mathematics; Lagrangian; Mathematical analysis","score_opus":0.01717736666673144,"score_gpt":0.20617833937170646,"score_spread":0.189000972704975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529460726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267389,0.00051246997,0.2652136,0.00040772426,0.00018870074,0.000099905876,0.00041378808,0.00043302792,0.1059919],"genre_scores_gemma":[0.9676875,0.00018601127,0.02240056,0.0000870049,0.00002478027,0.000046843812,0.0001897276,0.000042139876,0.00933542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958545,0.00006985021,0.00002922077,0.00008641866,0.000114537885,0.00011455591],"domain_scores_gemma":[0.9992607,0.00016059632,0.00014922301,0.00012848416,0.00020134092,0.00009959326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027613816,0.00027149168,0.0002683132,0.0006606461,0.0009592354,0.0010482192,0.00022690422,0.00036218308,0.00849875],"category_scores_gemma":[0.0009918857,0.0003177665,0.00032518772,0.000368854,0.001208716,0.0014779895,0.0011683996,0.00064233184,0.0007086364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013557487,0.00003354344,0.0016622287,0.000102898724,0.00001838751,0.00035861123,0.0004988587,0.016119735,0.016262786,0.9392844,0.0022046568,0.023318328],"study_design_scores_gemma":[0.000034704186,0.00022017657,0.0015104334,0.00010326379,0.00002673318,0.0008452966,0.0007464132,0.05229587,0.024700096,0.8711713,0.048290156,0.000055647117],"about_ca_topic_score_codex":0.00084905955,"about_ca_topic_score_gemma":0.0010837369,"teacher_disagreement_score":0.00849875,"about_ca_system_score_codex":0.0005065678,"about_ca_system_score_gemma":0.0006258189,"threshold_uncertainty_score":0.028431177},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609241,0.0001613197,0.025946,0.0001335413,0.000024129384,0.00002192618,0.000107733584,0.00009522791,0.012585998],"genre_scores_gemma":[0.98617655,0.00007210274,0.010823032,0.0000433281,0.000015081577,0.000023762497,0.00014576798,0.000013393789,0.00268693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997706,0.00004329879,0.00001151087,0.00005358581,0.00006677402,0.00005418464],"domain_scores_gemma":[0.99945575,0.00021219459,0.00008724759,0.00010995133,0.00006683618,0.000068105284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021895864,0.00016355295,0.00021335107,0.0005589752,0.0010596077,0.00047237417,0.00037547402,0.00034348117,0.0025421195],"category_scores_gemma":[0.0007571952,0.00019108664,0.00021179204,0.00036061739,0.0007446429,0.000589753,0.00055224757,0.00039488776,0.00019687448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031099253,0.000098205135,0.0071013123,0.00013106593,0.00003092789,0.001078789,0.0013196905,0.009094639,0.062543504,0.8552277,0.0022157289,0.060847506],"study_design_scores_gemma":[0.00015949797,0.00061329454,0.011215526,0.00010743005,0.000045579378,0.0053764004,0.0010222341,0.10340411,0.06774148,0.7621,0.04808597,0.00012849309],"about_ca_topic_score_codex":0.00043771186,"about_ca_topic_score_gemma":0.00046495683,"teacher_disagreement_score":0.0025421195,"about_ca_system_score_codex":0.00053043896,"about_ca_system_score_gemma":0.0002933161,"threshold_uncertainty_score":0.008504212},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19452153,0.00014421105,0.77810436,0.0002757634,0.000046003912,0.00011192664,0.0003628902,0.00027226578,0.026161034],"genre_scores_gemma":[0.76364714,0.00017197369,0.2164841,0.00020284276,0.0000367878,0.00034703978,0.0006080883,0.00009867183,0.018403439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989813,0.00028536702,0.00005227779,0.00017439878,0.00030669532,0.00019995261],"domain_scores_gemma":[0.9959734,0.00123815,0.0005478263,0.0014228715,0.000520534,0.00029718844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010679266,0.0005679814,0.0005823764,0.0005452387,0.00070738816,0.0011595698,0.00086634536,0.00083961233,0.010547851],"category_scores_gemma":[0.0045382245,0.00048259483,0.00043895998,0.0003571175,0.0011435237,0.0019888869,0.0019035103,0.0015481624,0.0019356894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038819097,0.00014399206,0.0011588424,0.00018378002,0.000037156693,0.00024133871,0.00026415277,0.06743721,0.044503663,0.83750767,0.0018100439,0.046324044],"study_design_scores_gemma":[0.00013109607,0.0005381139,0.0007665067,0.000090530375,0.000027783239,0.00033273516,0.0001342437,0.2773799,0.03482067,0.6738634,0.011867111,0.000047855658],"about_ca_topic_score_codex":0.00030286424,"about_ca_topic_score_gemma":0.0006801951,"teacher_disagreement_score":0.010547851,"about_ca_system_score_codex":0.0004565609,"about_ca_system_score_gemma":0.0006938606,"threshold_uncertainty_score":0.03528607},"labels":[],"label_agreement":null},{"id":"W2550630193","doi":"10.1002/jcd.21525","title":"Constructions for Circulant and Group‐Developed Generalized Weighing Matrices","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Class (philosophy); Combinatorics; Order (exchange); Group (periodic table); Type (biology); Algebra over a field; Pure mathematics; Discrete mathematics; Computer science","score_opus":0.020222413859070133,"score_gpt":0.22747447726784684,"score_spread":0.2072520634087767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550630193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.269698,0.0005391151,0.66216564,0.00046897263,0.0006298862,0.0001907565,0.00018231872,0.0005992882,0.065525934],"genre_scores_gemma":[0.81497604,0.00029938473,0.16546555,0.00034688404,0.00022854951,0.00017340829,0.00018662048,0.00015067351,0.01817286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.00015613566,0.000024897723,0.0000979622,0.00017089001,0.00010157375],"domain_scores_gemma":[0.99935406,0.00014294402,0.00009811178,0.00014843866,0.0001511775,0.00010525657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005499452,0.00056874036,0.0003953141,0.0009393995,0.0007743196,0.0012341583,0.00062451314,0.0007983769,0.003999729],"category_scores_gemma":[0.0013289313,0.0003028556,0.000528222,0.00072644773,0.0010427133,0.0010441025,0.0008939672,0.0010613479,0.0006726041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004546889,0.000025537425,0.00015047488,0.000035509587,0.0000089393125,0.00015916582,0.00011577087,0.0026687488,0.015396473,0.9676204,0.0011107486,0.012662861],"study_design_scores_gemma":[0.000076575736,0.00020530797,0.000492418,0.000044630382,0.000030856358,0.0007111332,0.00011863268,0.055198587,0.027540859,0.8834399,0.03205095,0.00009021106],"about_ca_topic_score_codex":0.0003338614,"about_ca_topic_score_gemma":0.00053154386,"teacher_disagreement_score":0.003999729,"about_ca_system_score_codex":0.0005594179,"about_ca_system_score_gemma":0.0004469891,"threshold_uncertainty_score":0.013380468},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2663817,0.0009999882,0.6269126,0.0018375575,0.00072640734,0.00010173368,0.00030454848,0.00033645946,0.102399126],"genre_scores_gemma":[0.9230298,0.0008155848,0.04194152,0.000537927,0.00038789018,0.00013861866,0.00021790563,0.00016678128,0.03276409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994886,0.00011778615,0.00002811191,0.00008197875,0.00015346541,0.0001300432],"domain_scores_gemma":[0.99834347,0.00078210834,0.00015905612,0.00014587419,0.00029514756,0.00027434275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527974,0.00062963343,0.0007294293,0.0020280965,0.0021390456,0.0029767544,0.00073618675,0.0011916682,0.010834141],"category_scores_gemma":[0.003081296,0.00036222505,0.000785651,0.000990239,0.0020149567,0.0037848568,0.0020141494,0.0023083733,0.0009375303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018888091,0.000015461108,0.00006013647,0.000018513474,0.000004448202,0.00003069959,0.00007109221,0.0017779216,0.00055837247,0.9933134,0.00072409015,0.0034069323],"study_design_scores_gemma":[0.0000047835833,0.00000703992,0.00003376031,0.000008150873,0.0000034816578,0.00002856799,0.00003739271,0.011448347,0.00028387565,0.98730856,0.00082880794,0.0000070980045],"about_ca_topic_score_codex":0.0009827061,"about_ca_topic_score_gemma":0.000991248,"teacher_disagreement_score":0.010834141,"about_ca_system_score_codex":0.0012363049,"about_ca_system_score_gemma":0.0009119453,"threshold_uncertainty_score":0.036243796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27285793,0.005306697,0.52535504,0.009344904,0.0012137005,0.00008683258,0.0004979421,0.00048017324,0.18485676],"genre_scores_gemma":[0.9294702,0.0038451445,0.032779433,0.0020462251,0.0021038651,0.00019151937,0.0004067757,0.00044798426,0.028708778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995546,0.0015575733,0.0003049076,0.0008605002,0.0012064943,0.0005245325],"domain_scores_gemma":[0.98135424,0.013176038,0.0009677981,0.0013767567,0.0020287477,0.0010963929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059770173,0.0019513124,0.0026148988,0.0040694363,0.004821826,0.0076796925,0.0026633423,0.002437245,0.009075431],"category_scores_gemma":[0.016447335,0.0013668935,0.004225532,0.0052633155,0.014795622,0.016594104,0.0073147207,0.009054263,0.0010483839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056275603,0.000022965722,0.00012275229,0.00007993565,0.000021846541,0.00010567155,0.00025736055,0.0006204898,0.00043165765,0.9948704,0.0010954909,0.0023151874],"study_design_scores_gemma":[0.000011652156,0.000010385152,0.000050025694,0.000013305302,0.000018590727,0.00010983473,0.000062782674,0.0033599283,0.00034987807,0.9950375,0.0009625006,0.000013559641],"about_ca_topic_score_codex":0.000985372,"about_ca_topic_score_gemma":0.00065851666,"teacher_disagreement_score":0.009075431,"about_ca_system_score_codex":0.0017311282,"about_ca_system_score_gemma":0.0010662803,"threshold_uncertainty_score":0.031609893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3007995,0.0025964659,0.514117,0.00995926,0.0012109623,0.0003843607,0.0025661476,0.0015742641,0.16679196],"genre_scores_gemma":[0.77843755,0.0008950353,0.1685873,0.0013695875,0.0005624601,0.0002709685,0.0019353414,0.00037675851,0.04756503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979572,0.00065516593,0.00010500094,0.0004977167,0.00042297467,0.00036186376],"domain_scores_gemma":[0.99535215,0.0029933979,0.00030831317,0.0006904712,0.00024696946,0.0004088379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010988519,0.0007237183,0.0009907777,0.0005869147,0.0016560135,0.003033441,0.0021678198,0.0017618831,0.019128125],"category_scores_gemma":[0.008395795,0.00076993246,0.0011209004,0.0011668752,0.002203287,0.0064504305,0.0034560205,0.0032158254,0.001853608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047953706,0.0002392919,0.0010802671,0.0005520688,0.00007181764,0.000343144,0.00038341532,0.07296199,0.003708386,0.82333606,0.03854615,0.058297865],"study_design_scores_gemma":[0.0001133164,0.000056756387,0.00028524033,0.000053195843,0.000018460558,0.00017760787,0.00016073868,0.08259741,0.001350398,0.9014106,0.013753338,0.000022961654],"about_ca_topic_score_codex":0.0019350299,"about_ca_topic_score_gemma":0.002319656,"teacher_disagreement_score":0.019128125,"about_ca_system_score_codex":0.0012278459,"about_ca_system_score_gemma":0.0011665334,"threshold_uncertainty_score":0.06398994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13354911,0.0019493669,0.7947303,0.0024551924,0.00045241546,0.00010748823,0.0002609933,0.0002039881,0.06629117],"genre_scores_gemma":[0.867449,0.0020032886,0.09008647,0.0011107337,0.0006941765,0.00029740512,0.00034112594,0.0002004201,0.037817396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878997,0.00035444248,0.0000767836,0.00031183276,0.0003102831,0.00015664677],"domain_scores_gemma":[0.99168956,0.0057763527,0.00046649735,0.00046672206,0.0009615661,0.0006392486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003078187,0.0012126333,0.00113882,0.0024903042,0.0019249199,0.0023904683,0.0018671172,0.0016604506,0.0072410814],"category_scores_gemma":[0.01006517,0.00078758865,0.0017736196,0.0011629919,0.0037924228,0.0069460482,0.005144539,0.0053300946,0.0006078899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085119944,0.00006291213,0.0006018242,0.00013975087,0.00004281014,0.00018598007,0.00038570634,0.004992294,0.00428801,0.9799397,0.001341082,0.007934717],"study_design_scores_gemma":[0.000036713172,0.000077271696,0.00050207024,0.000056374683,0.000048556412,0.0003528051,0.0002497089,0.05402055,0.0024195747,0.9365085,0.005685901,0.000042075804],"about_ca_topic_score_codex":0.00032232862,"about_ca_topic_score_gemma":0.00034689758,"teacher_disagreement_score":0.0072410814,"about_ca_system_score_codex":0.0014537015,"about_ca_system_score_gemma":0.0007428203,"threshold_uncertainty_score":0.024223804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3996887,0.00023022038,0.57805836,0.00027775255,0.000059330014,0.00012129507,0.0001639381,0.0003867726,0.021013616],"genre_scores_gemma":[0.8428124,0.00017648363,0.15069547,0.00010698782,0.000057302674,0.0002106246,0.00018555217,0.000075311735,0.0056799194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998372,0.00052714883,0.000112808644,0.00036323062,0.00039500344,0.00022973798],"domain_scores_gemma":[0.99162745,0.003874274,0.0009804581,0.0026529555,0.0005400464,0.0003248247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567408,0.0004975634,0.0006442119,0.00063602027,0.00079721713,0.0013151541,0.0007610545,0.00091392634,0.0051512932],"category_scores_gemma":[0.006145599,0.00049215066,0.000811316,0.00045471475,0.0016229616,0.0024711862,0.0018366947,0.0019594885,0.00086810754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030853986,0.00009224657,0.0010794208,0.00015606274,0.00003491518,0.00027355566,0.0004548319,0.0140990075,0.042703677,0.9112668,0.0005193244,0.029011598],"study_design_scores_gemma":[0.00022671963,0.0006524228,0.0005140205,0.00007544376,0.0000652968,0.00067490153,0.00020570892,0.06839955,0.05999236,0.8545835,0.014549761,0.000060298855],"about_ca_topic_score_codex":0.00012948159,"about_ca_topic_score_gemma":0.0002456656,"teacher_disagreement_score":0.0051512932,"about_ca_system_score_codex":0.00049611257,"about_ca_system_score_gemma":0.0005652318,"threshold_uncertainty_score":0.017232835},"labels":[],"label_agreement":null},{"id":"W2570717844","doi":"10.1002/jcd.21566","title":"Transversals in Latin Arrays with Many Distinct Symbols","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Transversal (combinatorics); Latin square; Row; Transpose; Mathematics; Row and column spaces; Combinatorics; Diagonal; Order (exchange); Computation; Algorithm; Computer science; Geometry; Physics; Mathematical analysis","score_opus":0.019967279226445162,"score_gpt":0.22742522466215115,"score_spread":0.20745794543570598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570717844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7268314,0.00063132506,0.21092004,0.00069086935,0.0003832413,0.00014683626,0.000491899,0.00107156,0.058832813],"genre_scores_gemma":[0.89646316,0.00045795605,0.083040476,0.000569257,0.00010037688,0.0001949566,0.0005495659,0.000354392,0.018269854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861515,0.00029735957,0.00016286067,0.00028925962,0.00028328985,0.00035208414],"domain_scores_gemma":[0.9952909,0.0014438872,0.0011416359,0.0007698506,0.0010576879,0.00029599064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767984,0.0005845254,0.00057289156,0.0008147319,0.001444394,0.0018531943,0.00054336764,0.0007633883,0.011601796],"category_scores_gemma":[0.0038930578,0.00063998817,0.0005966697,0.00075192057,0.0013560742,0.0023302343,0.0017925578,0.0010564236,0.0023623866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017683473,0.00027357088,0.007911304,0.0005945628,0.000110055145,0.0031029398,0.0017440916,0.024795013,0.30711102,0.57475996,0.0068522547,0.07097686],"study_design_scores_gemma":[0.00036403793,0.0025115286,0.0038735399,0.00047536084,0.00022188366,0.008877272,0.004148107,0.13983618,0.31337994,0.44420356,0.081799336,0.00030931848],"about_ca_topic_score_codex":0.00080451975,"about_ca_topic_score_gemma":0.0011279468,"teacher_disagreement_score":0.011601796,"about_ca_system_score_codex":0.00062455866,"about_ca_system_score_gemma":0.0007190258,"threshold_uncertainty_score":0.038811922},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19090515,0.0045664315,0.3654674,0.007970245,0.0017497317,0.00029268514,0.0046290956,0.0013027292,0.42311648],"genre_scores_gemma":[0.87286407,0.0022979856,0.061938696,0.0029195263,0.00055762526,0.00033401564,0.0016740176,0.000248342,0.057165787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00011743903,0.000022035665,0.00011511429,0.00007537883,0.0000867476],"domain_scores_gemma":[0.99830925,0.00078313315,0.00029117812,0.00024401413,0.00017620606,0.00019607609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003449377,0.00051033794,0.00029636003,0.0031695839,0.0013001536,0.0021869391,0.000811168,0.0011863868,0.01894113],"category_scores_gemma":[0.0019940578,0.000248981,0.000458508,0.0016122374,0.0014581416,0.0021107441,0.0012877268,0.0015841095,0.0023376378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027472413,0.000016309701,0.0002203818,0.00006231426,0.0000064050073,0.00008466063,0.00007091268,0.00070769765,0.0009143579,0.98418933,0.0057046553,0.007995443],"study_design_scores_gemma":[0.0000101435035,0.0000108811855,0.00035314285,0.000043300184,0.000008466522,0.00027459365,0.00010242592,0.005062324,0.001063671,0.96697235,0.02608493,0.000013854109],"about_ca_topic_score_codex":0.00084868097,"about_ca_topic_score_gemma":0.0014495648,"teacher_disagreement_score":0.01894113,"about_ca_system_score_codex":0.0013402323,"about_ca_system_score_gemma":0.00047022023,"threshold_uncertainty_score":0.06336439},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23403732,0.008520205,0.40717947,0.009561123,0.0016808136,0.00018269462,0.00091181946,0.0004227853,0.3375038],"genre_scores_gemma":[0.8944763,0.005565875,0.042630553,0.0018560091,0.0017870868,0.00023062453,0.0009067167,0.00024810943,0.05229866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991854,0.00024112638,0.000039369483,0.0001779035,0.00019218148,0.00016406612],"domain_scores_gemma":[0.9965508,0.0023760335,0.00021741955,0.00047467314,0.00017980541,0.00020124674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081750855,0.0005195024,0.00071989786,0.0012889643,0.0011243921,0.001967871,0.0010930841,0.0013996296,0.012547148],"category_scores_gemma":[0.0050901184,0.00039651716,0.00092472875,0.0015447248,0.0035663059,0.005309188,0.001983035,0.0025856749,0.0013364225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004406327,0.000032749664,0.00039680343,0.000110035704,0.0000137942725,0.00008204115,0.00018925052,0.0038022902,0.00093283865,0.97812,0.0057084253,0.0105674835],"study_design_scores_gemma":[0.000011884447,0.000022261422,0.00041751773,0.000030293755,0.000009823104,0.000090311165,0.00012313937,0.009195707,0.00043427685,0.9837482,0.005906793,0.0000096996555],"about_ca_topic_score_codex":0.0014111593,"about_ca_topic_score_gemma":0.0013832394,"teacher_disagreement_score":0.012547148,"about_ca_system_score_codex":0.0015772178,"about_ca_system_score_gemma":0.0006138181,"threshold_uncertainty_score":0.041974366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7345308,0.00029294044,0.13840453,0.00039087507,0.00025154665,0.00012966157,0.0007819377,0.00095092185,0.124266714],"genre_scores_gemma":[0.97603625,0.00006931912,0.012296909,0.00008986985,0.000027129117,0.00003889222,0.000246533,0.0000659373,0.011129246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928194,0.00014926048,0.00004905724,0.000107151165,0.00018023353,0.00023235324],"domain_scores_gemma":[0.9988581,0.0002531765,0.0002667457,0.0002469094,0.00017781131,0.00019732604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052165246,0.00040654966,0.00032089307,0.00081198115,0.0010589684,0.0021903329,0.00054493634,0.00077066803,0.009093838],"category_scores_gemma":[0.0016770255,0.0003608003,0.00040409665,0.00049806497,0.00110263,0.0015267375,0.0012693022,0.0005889761,0.0015755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033745792,0.000060803544,0.0011067258,0.000074721116,0.000019820134,0.0003899224,0.00031900458,0.0027118868,0.010301656,0.9671829,0.0029763153,0.014518897],"study_design_scores_gemma":[0.00014727647,0.000254224,0.0010084797,0.000070314796,0.000040483694,0.00072462915,0.00036995707,0.02136757,0.015298805,0.9429688,0.017684925,0.00006444066],"about_ca_topic_score_codex":0.00091029244,"about_ca_topic_score_gemma":0.0019724325,"teacher_disagreement_score":0.009093838,"about_ca_system_score_codex":0.0008686512,"about_ca_system_score_gemma":0.00083945674,"threshold_uncertainty_score":0.030421972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5716364,0.0016962127,0.2294112,0.0012409491,0.00027259928,0.00010831221,0.001389972,0.00057084794,0.19367349],"genre_scores_gemma":[0.93004954,0.0007897401,0.033436548,0.00031137172,0.00011830663,0.00008967899,0.0011639784,0.00011906341,0.0339218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995048,0.00011953779,0.000027756669,0.00010204698,0.000108025844,0.00013771949],"domain_scores_gemma":[0.99893576,0.0005022202,0.0001493329,0.00020714954,0.00007626174,0.00012935301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024876412,0.00045417587,0.0004584929,0.0008728178,0.0010381532,0.0017705584,0.0006989311,0.00082921574,0.010437686],"category_scores_gemma":[0.0018779929,0.00041866754,0.0005687591,0.0011148067,0.00079525687,0.0023714697,0.0012954454,0.0009457489,0.001418726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012521482,0.000070201786,0.00096451584,0.00014369881,0.00003323522,0.00041404582,0.00035478955,0.014594505,0.0037169699,0.9407837,0.00767657,0.031122621],"study_design_scores_gemma":[0.000029412093,0.00003855884,0.0012016263,0.00005379538,0.000026128215,0.0006067917,0.00027870943,0.044449747,0.003480901,0.934883,0.014932007,0.000019337176],"about_ca_topic_score_codex":0.0013377985,"about_ca_topic_score_gemma":0.0015473062,"teacher_disagreement_score":0.010437686,"about_ca_system_score_codex":0.0009422662,"about_ca_system_score_gemma":0.00042520592,"threshold_uncertainty_score":0.034917593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18926603,0.00092709175,0.6979651,0.0012469542,0.00056300283,0.00067603675,0.0019566568,0.0019090265,0.10549018],"genre_scores_gemma":[0.7235807,0.00063791,0.24999835,0.00077664293,0.0001704042,0.0008462415,0.00089598715,0.00031524597,0.02277848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742573,0.0010552122,0.00016013501,0.00050675456,0.00036686045,0.000485253],"domain_scores_gemma":[0.99537814,0.0015924482,0.00047713687,0.0016317954,0.0006133325,0.0003071303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014541453,0.0009870036,0.0008836515,0.001046275,0.0016666616,0.002409549,0.0011675617,0.0016733682,0.011062088],"category_scores_gemma":[0.0061872173,0.00055296015,0.0006311114,0.0011417223,0.0016336878,0.0019325294,0.0015555989,0.0010577147,0.0043890304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010167769,0.000211088,0.001716478,0.0004046793,0.000120465,0.0004325408,0.00026505475,0.0154770445,0.037899267,0.8679874,0.010084002,0.06438523],"study_design_scores_gemma":[0.0004183015,0.0007777098,0.0012089333,0.00030158993,0.00018967675,0.0013638667,0.00040590914,0.0576528,0.042436946,0.81994385,0.075195566,0.00010477903],"about_ca_topic_score_codex":0.00056691514,"about_ca_topic_score_gemma":0.0011856304,"teacher_disagreement_score":0.011062088,"about_ca_system_score_codex":0.0008330636,"about_ca_system_score_gemma":0.0015680597,"threshold_uncertainty_score":0.03700638},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15388985,0.00028816605,0.7768851,0.00045507087,0.00012581714,0.00012686779,0.00047492085,0.00064708904,0.06710715],"genre_scores_gemma":[0.7056575,0.0003401703,0.276899,0.00024789842,0.00003823377,0.00016528265,0.0005883432,0.00018142571,0.015882134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972063,0.000092528004,0.000013344308,0.000055717213,0.00007145443,0.000046217145],"domain_scores_gemma":[0.99914324,0.00029994466,0.00008658175,0.00022593967,0.00010701161,0.00013732545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030928725,0.00036674825,0.00021982634,0.0010199056,0.0007344987,0.00064742105,0.00062362547,0.00043500913,0.0058562816],"category_scores_gemma":[0.0011646271,0.00037302778,0.00034198226,0.0007475619,0.00056658994,0.0011737635,0.0018331916,0.0009274866,0.00093114306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010151985,0.00006291223,0.0005409909,0.00015288265,0.000016395914,0.00033550776,0.00029984824,0.0082412,0.02572927,0.9290754,0.0037142655,0.03172977],"study_design_scores_gemma":[0.000046698875,0.00007730229,0.0011396707,0.00010530231,0.0000413808,0.00057948864,0.00030925917,0.0965899,0.02656043,0.83821607,0.036304377,0.00003016999],"about_ca_topic_score_codex":0.0003292971,"about_ca_topic_score_gemma":0.0009760267,"teacher_disagreement_score":0.0058562816,"about_ca_system_score_codex":0.00040827444,"about_ca_system_score_gemma":0.00038836736,"threshold_uncertainty_score":0.019591212},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061511718,0.014562467,0.4625918,0.009308596,0.005562961,0.0001003973,0.0012080997,0.00068288884,0.444471],"genre_scores_gemma":[0.7019011,0.015705261,0.20023617,0.004867082,0.0049832407,0.00022421534,0.0015225749,0.0008276991,0.069732696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890924,0.00040831248,0.000048662794,0.00022962739,0.00028079882,0.00012330645],"domain_scores_gemma":[0.99661773,0.0020774372,0.00020451253,0.00050706335,0.0003264802,0.00026681044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010371899,0.00071390823,0.0008921769,0.0035490335,0.0025520897,0.0034272124,0.001544852,0.0013555669,0.010780957],"category_scores_gemma":[0.0047280574,0.0005572713,0.00096877076,0.0046669072,0.004397185,0.007887916,0.0032493607,0.0043860413,0.0018068607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014624716,0.000010619098,0.00014641625,0.00003647064,0.000008776919,0.00012274542,0.000102256054,0.000618558,0.0003184761,0.98435163,0.0063880607,0.007881513],"study_design_scores_gemma":[0.0000024292867,0.000012431053,0.00022847278,0.000021165823,0.0000075996527,0.00016480763,0.00008409253,0.0028227654,0.00020643002,0.97744626,0.01899145,0.000012095583],"about_ca_topic_score_codex":0.0024769292,"about_ca_topic_score_gemma":0.003259302,"teacher_disagreement_score":0.010780957,"about_ca_system_score_codex":0.0010719642,"about_ca_system_score_gemma":0.00054592587,"threshold_uncertainty_score":0.036065876},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12721984,0.003221746,0.36696836,0.0044504083,0.00053517707,0.00018098083,0.0018634517,0.0008538951,0.49470618],"genre_scores_gemma":[0.82560605,0.0030603143,0.0812812,0.0017576194,0.00074674643,0.00037458423,0.0019167638,0.00036249452,0.08489426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877375,0.00040830852,0.000048653128,0.00028962165,0.00031980267,0.0001597546],"domain_scores_gemma":[0.9963282,0.002022332,0.0003911061,0.0005217842,0.00044308594,0.00029349493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009175508,0.0006699836,0.0004761542,0.002672134,0.0024931321,0.002623822,0.0009849247,0.0011964838,0.018428983],"category_scores_gemma":[0.004568945,0.0005873283,0.0010573318,0.0024165865,0.0019572563,0.0043397113,0.0016413783,0.0022072196,0.0021979492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002400919,0.000016029178,0.00027276578,0.00004602093,0.000013338299,0.00021038605,0.00015342621,0.000952497,0.00039740928,0.9813672,0.005949429,0.010597596],"study_design_scores_gemma":[0.000011208382,0.000012604627,0.00025877808,0.00002454827,0.0000149772595,0.0006016492,0.00011246098,0.0070134415,0.0003559332,0.9705494,0.021033539,0.0000115037865],"about_ca_topic_score_codex":0.00091467996,"about_ca_topic_score_gemma":0.0010012554,"teacher_disagreement_score":0.018428983,"about_ca_system_score_codex":0.0012652713,"about_ca_system_score_gemma":0.00062113174,"threshold_uncertainty_score":0.06165111},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08846225,0.0037202975,0.16882235,0.005114185,0.001632463,0.00011258844,0.0008249698,0.000623641,0.7306873],"genre_scores_gemma":[0.7625451,0.0023366176,0.035426762,0.002268427,0.0017467159,0.00017489801,0.0007903608,0.00027294323,0.19443817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994553,0.00013193964,0.000019909272,0.00011802318,0.00017668663,0.00009820072],"domain_scores_gemma":[0.99913776,0.0002500648,0.00011557703,0.00016767868,0.00019563842,0.00013324013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047089622,0.0007672814,0.0005110942,0.0020687445,0.0013791347,0.0020241654,0.00070110423,0.00080507493,0.022336528],"category_scores_gemma":[0.0019083105,0.00034546424,0.00064215163,0.00092378596,0.0015422866,0.0033099377,0.002091564,0.0018434356,0.0045984336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009690032,0.000010208229,0.00007866743,0.000018097046,0.0000045887728,0.000030818686,0.000057797715,0.00015938217,0.00047754202,0.98937184,0.0037265162,0.0060548387],"study_design_scores_gemma":[0.000008812463,0.0000125971865,0.00021985153,0.000015694011,0.000010342221,0.00019742445,0.00005546125,0.0018930711,0.0008277407,0.9684948,0.028256075,0.000008109484],"about_ca_topic_score_codex":0.0004455965,"about_ca_topic_score_gemma":0.0008188347,"teacher_disagreement_score":0.022336528,"about_ca_system_score_codex":0.000907232,"about_ca_system_score_gemma":0.0004171865,"threshold_uncertainty_score":0.074723065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23278038,0.00066683267,0.64602536,0.0006104443,0.000376439,0.00014019117,0.0005226782,0.0010242589,0.11785344],"genre_scores_gemma":[0.75506014,0.00045153085,0.19145314,0.00034721068,0.00013889016,0.00015330884,0.00074905436,0.0006676733,0.050979074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996209,0.000097928554,0.00002539687,0.00007391633,0.00010402721,0.00007774956],"domain_scores_gemma":[0.99921453,0.0002591646,0.00010227305,0.00016970224,0.0001543978,0.000099847326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003459217,0.00035086315,0.0002883402,0.0014987899,0.00077961973,0.0012014827,0.0007154636,0.00057356467,0.011484041],"category_scores_gemma":[0.0019422588,0.0003127756,0.0005261999,0.0007765272,0.0007304452,0.0021988333,0.0011451151,0.0012109322,0.0026611444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011310569,0.00004723025,0.00030202421,0.00007419328,0.000012480587,0.00018856731,0.00048834755,0.003747147,0.0080469195,0.9479591,0.0047497107,0.034271095],"study_design_scores_gemma":[0.000028122815,0.00003880786,0.00046654622,0.000048699454,0.000015094042,0.0003113053,0.00022094038,0.026301157,0.005333232,0.944832,0.022377398,0.00002654613],"about_ca_topic_score_codex":0.00089240936,"about_ca_topic_score_gemma":0.0019366256,"teacher_disagreement_score":0.011484041,"about_ca_system_score_codex":0.00065848435,"about_ca_system_score_gemma":0.0003107595,"threshold_uncertainty_score":0.038417876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58333987,0.001355449,0.058281142,0.004233906,0.0036795759,0.00016372421,0.00473747,0.0007897643,0.34341913],"genre_scores_gemma":[0.8705514,0.00051545847,0.01960181,0.0006329911,0.00034646882,0.00013106613,0.0016631717,0.00023210116,0.1063255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995547,0.000071539114,0.000019836634,0.00011530307,0.00008800367,0.00015064335],"domain_scores_gemma":[0.99941623,0.00017113319,0.00010411587,0.000087473905,0.00008188546,0.00013920382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035045212,0.00063204806,0.0004236777,0.0013406958,0.0015173134,0.0015172911,0.0005902745,0.0008713607,0.027041828],"category_scores_gemma":[0.0014163185,0.00017767175,0.0003244974,0.000722077,0.0012370145,0.0019136921,0.0010469776,0.00087927026,0.004496191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015830252,0.00035526656,0.0125101255,0.0005695579,0.00010343462,0.0015737715,0.0008213323,0.0042203916,0.05802328,0.75555557,0.055101734,0.109582484],"study_design_scores_gemma":[0.00017201054,0.0003426784,0.025634676,0.00028989284,0.0001499433,0.0039852588,0.0010401182,0.01644983,0.03845049,0.7120715,0.2011535,0.00026011385],"about_ca_topic_score_codex":0.0006585571,"about_ca_topic_score_gemma":0.001405468,"teacher_disagreement_score":0.027041828,"about_ca_system_score_codex":0.00063237763,"about_ca_system_score_gemma":0.0006829616,"threshold_uncertainty_score":0.09046394},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059046643,0.035132136,0.19254404,0.01221133,0.010092099,0.00012898301,0.0013557215,0.0007320104,0.74189895],"genre_scores_gemma":[0.26672503,0.07442128,0.25194624,0.023518974,0.021679876,0.0008794238,0.003946415,0.0017319482,0.35515085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926025,0.00023452657,0.00004151425,0.0001382575,0.0002597166,0.000065726475],"domain_scores_gemma":[0.9988078,0.0007549896,0.000053030188,0.00017120181,0.00013829075,0.0000747526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280513,0.0013312934,0.0011088236,0.0036708412,0.0016505168,0.0026753296,0.0017683619,0.0014499733,0.032819122],"category_scores_gemma":[0.0024181423,0.0008039668,0.0012363484,0.004763143,0.0032470669,0.0058595915,0.0021059667,0.005381014,0.007810621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017805554,0.000035756028,0.00007532451,0.00021053318,0.000017545008,0.0002601568,0.00015544395,0.00097356987,0.00044418138,0.92376006,0.046454553,0.0275951],"study_design_scores_gemma":[0.0000045027728,0.0000146666025,0.00016726331,0.000050442835,0.000008094888,0.0002535652,0.000059391536,0.00090027956,0.00019632083,0.88004005,0.11829104,0.000014295216],"about_ca_topic_score_codex":0.0019122371,"about_ca_topic_score_gemma":0.0032412969,"teacher_disagreement_score":0.032819122,"about_ca_system_score_codex":0.0017327962,"about_ca_system_score_gemma":0.0005217462,"threshold_uncertainty_score":0.10979092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4307948,0.0011362357,0.24042581,0.0018280928,0.0009626292,0.00019885362,0.0007851167,0.0005781617,0.3232903],"genre_scores_gemma":[0.91681963,0.00059167814,0.038818248,0.0006979542,0.00023783822,0.00015613838,0.00031896733,0.00014780405,0.0422117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912006,0.00033507025,0.00003379242,0.00010199339,0.00021987356,0.0001891716],"domain_scores_gemma":[0.9985744,0.00066346163,0.00020963945,0.00024423632,0.00018177298,0.0001264808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007733484,0.0005572697,0.00044239368,0.0012066443,0.0014440832,0.0014403565,0.000559089,0.00127736,0.013400974],"category_scores_gemma":[0.002872715,0.00039359773,0.00048756588,0.0006842173,0.0014772515,0.0020168014,0.0014765798,0.0011022823,0.0017190728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075569944,0.000018845287,0.00023894793,0.000040005656,0.000006072717,0.00009874036,0.00014397896,0.0016778675,0.0014954142,0.9869632,0.002464286,0.0067770677],"study_design_scores_gemma":[0.000029236759,0.000045922112,0.00022765671,0.00004292074,0.000007340702,0.00017199105,0.00009847693,0.011419462,0.0015494082,0.9805861,0.0057983133,0.000023211795],"about_ca_topic_score_codex":0.00073395914,"about_ca_topic_score_gemma":0.0016878898,"teacher_disagreement_score":0.013400974,"about_ca_system_score_codex":0.00089108216,"about_ca_system_score_gemma":0.000611983,"threshold_uncertainty_score":0.04483074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34189174,0.0018924294,0.44340608,0.0010057677,0.0003467018,0.00020486565,0.0039039196,0.0018686133,0.2054799],"genre_scores_gemma":[0.87361056,0.00055384956,0.0917624,0.0001814489,0.00015842955,0.00018061603,0.002824281,0.00031919582,0.03040919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725974,0.00050649606,0.0002792475,0.0006200233,0.0008270289,0.00050742505],"domain_scores_gemma":[0.9960461,0.0019142868,0.00056075613,0.0005887894,0.0006130416,0.0002769392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068863004,0.0004731933,0.0006494608,0.0026353449,0.0027874878,0.0056040413,0.0017653133,0.0011437061,0.016341446],"category_scores_gemma":[0.0054191044,0.0007997783,0.0011259275,0.0033143817,0.0018278288,0.006780664,0.0036892632,0.0017981149,0.0035427255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041944755,0.00008317128,0.0020327892,0.0001721547,0.000061636005,0.0006780269,0.00079587783,0.0062621953,0.005453838,0.95532775,0.004133091,0.02458001],"study_design_scores_gemma":[0.000041385636,0.00005781037,0.001643882,0.00014774929,0.00007521386,0.001698711,0.0013100347,0.031148614,0.014108088,0.91062707,0.039067857,0.000073547664],"about_ca_topic_score_codex":0.0011329203,"about_ca_topic_score_gemma":0.0015129513,"teacher_disagreement_score":0.016341446,"about_ca_system_score_codex":0.0014812237,"about_ca_system_score_gemma":0.0007476427,"threshold_uncertainty_score":0.054667592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6780896,0.00079070975,0.11998535,0.0019482797,0.00018082315,0.00010613605,0.0008262491,0.00042660595,0.19764629],"genre_scores_gemma":[0.971545,0.00019304623,0.0068316604,0.00027542844,0.000051907416,0.00006104324,0.00024586075,0.000045606055,0.020750457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996878,0.00009853928,0.000012885713,0.000049205948,0.00006232774,0.00008924383],"domain_scores_gemma":[0.9983102,0.00090174144,0.000312351,0.00012674241,0.00016545973,0.00018351647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027028171,0.0002997872,0.00024599396,0.0014012975,0.0009033228,0.0015135169,0.00061343913,0.00071186846,0.010156736],"category_scores_gemma":[0.0022340075,0.00027125934,0.00023307718,0.00063895754,0.0011516107,0.0014332347,0.001008406,0.0007657533,0.0010643501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059701946,0.000022200215,0.00050123775,0.00004142123,0.000006521463,0.0001538865,0.00019447382,0.0023376988,0.0028739655,0.98440427,0.0027216063,0.0066829603],"study_design_scores_gemma":[0.000028758144,0.000023689101,0.0006377277,0.000022946013,0.0000075029043,0.00014042605,0.00018450826,0.014529427,0.0016580179,0.978381,0.004370879,0.000015245859],"about_ca_topic_score_codex":0.001697038,"about_ca_topic_score_gemma":0.0028357059,"teacher_disagreement_score":0.010156736,"about_ca_system_score_codex":0.0010643034,"about_ca_system_score_gemma":0.0004650736,"threshold_uncertainty_score":0.033977628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34999672,0.0013605093,0.35714275,0.001246059,0.0013073689,0.00018424833,0.0018422874,0.00092220807,0.2859978],"genre_scores_gemma":[0.9148305,0.00058649876,0.037266336,0.00036489207,0.00032058347,0.0001274415,0.0010325311,0.00018204906,0.045289073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.000107986605,0.0000268963,0.00008511866,0.00015722345,0.00014355416],"domain_scores_gemma":[0.9991085,0.0002030072,0.00014464173,0.00020062411,0.00020175113,0.00014148986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004376132,0.00063752197,0.00042742482,0.0013888249,0.0008334439,0.001981553,0.0010053163,0.00061955577,0.019414287],"category_scores_gemma":[0.0016934122,0.00030417248,0.00032142765,0.0009243023,0.0013324656,0.0017383388,0.0012259498,0.0013558568,0.0045594345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009374893,0.000043429733,0.00011506258,0.000049458595,0.000006067794,0.00012767801,0.00011086247,0.0009154934,0.0047325757,0.97836655,0.002800722,0.0126383705],"study_design_scores_gemma":[0.000037687903,0.000050181163,0.00020098555,0.0000359105,0.0000062398813,0.00020246844,0.000117108684,0.0069391783,0.003969343,0.9790278,0.009391694,0.00002138967],"about_ca_topic_score_codex":0.00038934618,"about_ca_topic_score_gemma":0.00063425844,"teacher_disagreement_score":0.019414287,"about_ca_system_score_codex":0.00041689433,"about_ca_system_score_gemma":0.0005981056,"threshold_uncertainty_score":0.06494725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.658342,0.0015755501,0.18262331,0.009724932,0.00069193955,0.00064023613,0.0048304703,0.0010363327,0.14053519],"genre_scores_gemma":[0.90018,0.0005676218,0.05275596,0.00097294035,0.00020094129,0.00028096585,0.002591157,0.00018919435,0.042261194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937963,0.00023588662,0.000030366487,0.00013006302,0.00006252036,0.00016142637],"domain_scores_gemma":[0.9972963,0.0017767233,0.00022483246,0.00022061316,0.00016414931,0.00031735378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066153443,0.00066505646,0.0009671744,0.00092892995,0.0016849827,0.002121182,0.00179592,0.0025805542,0.021105058],"category_scores_gemma":[0.0045568924,0.0004285476,0.00076719915,0.00098232,0.0009761085,0.0033301422,0.0014963634,0.0018586188,0.0012842414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079329265,0.00055540324,0.0028915214,0.0010320924,0.00020812494,0.0007432801,0.0006985211,0.1083053,0.004447627,0.73954624,0.07426874,0.06650981],"study_design_scores_gemma":[0.0001825949,0.00017265363,0.0015909199,0.00012635272,0.000096032265,0.00049330253,0.0007543078,0.26708132,0.0038305265,0.70917356,0.016437616,0.000060771028],"about_ca_topic_score_codex":0.0036087688,"about_ca_topic_score_gemma":0.005526219,"teacher_disagreement_score":0.021105058,"about_ca_system_score_codex":0.0017015825,"about_ca_system_score_gemma":0.0016761706,"threshold_uncertainty_score":0.07060343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93183255,0.00045342866,0.030140163,0.00097086385,0.00012430469,0.0000277921,0.00078140065,0.00023001086,0.03543951],"genre_scores_gemma":[0.9941399,0.0001344985,0.003100813,0.000059368907,0.000065519765,0.000017382863,0.00029915504,0.00005088917,0.002132428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981744,0.00066146086,0.00011012656,0.00032944666,0.00045162826,0.00027305292],"domain_scores_gemma":[0.97849727,0.0124152,0.0030923185,0.0023187168,0.0013031116,0.0023733429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021300612,0.0005545938,0.00092481193,0.0034655835,0.0013269394,0.003726002,0.0012542731,0.0014987927,0.006923321],"category_scores_gemma":[0.018132387,0.0004412342,0.0006780283,0.0019506225,0.0043293084,0.0042658173,0.0020458146,0.00168141,0.00058209494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090205,0.00007195868,0.016925162,0.00019915136,0.00015259696,0.00058741245,0.00078679394,0.045078475,0.0052592633,0.90330315,0.0041357684,0.0225982],"study_design_scores_gemma":[0.000065685526,0.0002718021,0.013207636,0.00009267376,0.00011436187,0.0012403858,0.0009226507,0.08028762,0.0038181,0.89533186,0.004547392,0.00009969019],"about_ca_topic_score_codex":0.0020324849,"about_ca_topic_score_gemma":0.0020663037,"teacher_disagreement_score":0.006923321,"about_ca_system_score_codex":0.0016321043,"about_ca_system_score_gemma":0.00084665883,"threshold_uncertainty_score":0.023160815},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12299412,0.003663916,0.20472008,0.031365205,0.004216667,0.000115733346,0.0010807733,0.0005816639,0.63126177],"genre_scores_gemma":[0.8935182,0.002058306,0.02601732,0.005868668,0.00271402,0.00015574034,0.000989826,0.000239647,0.06843821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859625,0.0003649342,0.000061627885,0.00036825726,0.00039587138,0.0002131222],"domain_scores_gemma":[0.9942432,0.0032578825,0.0004143023,0.0010174636,0.0006506928,0.00041633658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012303776,0.00042987117,0.00073272607,0.0013122226,0.0026876556,0.003450564,0.0015345,0.0025201112,0.02340601],"category_scores_gemma":[0.009626989,0.00038723793,0.00080775254,0.0016897115,0.004558976,0.009006735,0.0034228424,0.0037627658,0.003484873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017448972,0.000022921153,0.00018438534,0.00003055925,0.0000027781307,0.000054452717,0.00011211856,0.00026775486,0.000120642275,0.9881314,0.0073032267,0.003752253],"study_design_scores_gemma":[0.00000805555,0.000009145194,0.00013387777,0.000016235857,0.0000039404704,0.0001300081,0.00009096315,0.0015874857,0.00012742291,0.9902362,0.0076510357,0.000005737431],"about_ca_topic_score_codex":0.0012353596,"about_ca_topic_score_gemma":0.00083679246,"teacher_disagreement_score":0.02340601,"about_ca_system_score_codex":0.0012420198,"about_ca_system_score_gemma":0.00084316236,"threshold_uncertainty_score":0.07830089},"labels":[],"label_agreement":null},{"id":"W2583437275","doi":"10.1002/jcd.21584","title":"Twofold triple systems with cyclic 2‐intersecting Gray codes","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Vertex (graph theory); Gray code; Hamiltonian (control theory); Graph; Hamiltonian path; Complete graph","score_opus":0.01931081608931478,"score_gpt":0.2339449387799443,"score_spread":0.2146341226906295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583437275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73002744,0.00016086729,0.22692007,0.00021717904,0.000093030605,0.00009672065,0.00022560378,0.00029399036,0.041965127],"genre_scores_gemma":[0.97367406,0.00005090787,0.022833709,0.00006473423,0.000013934623,0.000077203535,0.00011651884,0.000024160503,0.0031447217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995258,0.00011040014,0.000032862234,0.00007774786,0.00013604506,0.00011717711],"domain_scores_gemma":[0.99916244,0.00022767897,0.00014873892,0.0001754327,0.00014716723,0.00013845335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875696,0.00031235605,0.00034363466,0.0007216666,0.00080718315,0.0009165791,0.0003777544,0.0005163446,0.008126058],"category_scores_gemma":[0.0010438696,0.0002376695,0.0003485928,0.00048095032,0.0007874716,0.0009411142,0.0009913004,0.00061442395,0.00047243253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029041627,0.00010843931,0.002011505,0.000103922095,0.00003655329,0.00043368049,0.00020271653,0.05744219,0.040459905,0.8716204,0.001929538,0.02536073],"study_design_scores_gemma":[0.000089559675,0.00042830483,0.0017457772,0.000054630324,0.000042357722,0.0006500843,0.00033874012,0.3890892,0.041134227,0.555098,0.011258999,0.00007008193],"about_ca_topic_score_codex":0.0006659717,"about_ca_topic_score_gemma":0.00085300865,"teacher_disagreement_score":0.008126058,"about_ca_system_score_codex":0.0006477195,"about_ca_system_score_gemma":0.00051794446,"threshold_uncertainty_score":0.027184367},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9111146,0.0005692304,0.0833262,0.0001469594,0.0000294348,0.000038776016,0.00005439433,0.00022129936,0.004499163],"genre_scores_gemma":[0.9952964,0.00008627259,0.004141592,0.000012626214,0.0000069884427,0.000010258826,0.000027431402,0.00000900967,0.0004093206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990181,0.00025757676,0.000031744286,0.00012915264,0.00040396742,0.00015946609],"domain_scores_gemma":[0.99715084,0.0014616406,0.0003006053,0.00016730517,0.00084585726,0.00007372841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000875932,0.00058768666,0.000336811,0.0006568528,0.0004895467,0.00063533324,0.00035807103,0.0005669416,0.0008553144],"category_scores_gemma":[0.0028434154,0.00015548518,0.00023102884,0.00042120353,0.0004795495,0.00058323983,0.00030284864,0.0003235987,0.00014573982],"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.0017235535,0.00019130041,0.026348924,0.00033026648,0.00029761807,0.0006834567,0.00056562317,0.72757727,0.13754068,0.022564733,0.000909432,0.081267074],"study_design_scores_gemma":[0.000014888568,0.00021993504,0.0039926493,0.0000067656692,0.000037848105,0.00012835047,0.000034194738,0.98267764,0.011848363,0.0007250378,0.0002931923,0.000021254931],"about_ca_topic_score_codex":0.003358806,"about_ca_topic_score_gemma":0.0033234183,"teacher_disagreement_score":0.003358806,"about_ca_system_score_codex":0.0010395626,"about_ca_system_score_gemma":0.00078698696,"threshold_uncertainty_score":0.00754261},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6076757,0.0023891868,0.3134927,0.004334731,0.0010925034,0.00034063414,0.0029397437,0.0033536223,0.0643813],"genre_scores_gemma":[0.9324004,0.0005226235,0.026162097,0.00021990505,0.00013203235,0.00013206823,0.00038311473,0.0001532692,0.039894413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896705,0.00016788555,0.000042169944,0.00019852964,0.00035377598,0.00027055753],"domain_scores_gemma":[0.9973922,0.0014068715,0.00019345073,0.0004772129,0.00040820087,0.00012211749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011524458,0.0005585278,0.00079932454,0.0013469338,0.0017629964,0.002184887,0.0006697295,0.0007626056,0.015925137],"category_scores_gemma":[0.003475034,0.0003272918,0.00050588604,0.0012670459,0.0016860507,0.0032439325,0.0011497856,0.001611876,0.001020492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034277563,0.00019678805,0.0060893856,0.0002956454,0.00016169956,0.0017663165,0.0018576705,0.0320349,0.068975724,0.7602212,0.023323331,0.10164976],"study_design_scores_gemma":[0.0010113618,0.00076865655,0.010793607,0.00020503029,0.00024895128,0.0019671686,0.001066947,0.3746272,0.15181226,0.37694275,0.08020287,0.0003532478],"about_ca_topic_score_codex":0.016083214,"about_ca_topic_score_gemma":0.018736253,"teacher_disagreement_score":0.016083214,"about_ca_system_score_codex":0.0027098544,"about_ca_system_score_gemma":0.0017449587,"threshold_uncertainty_score":0.05327487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70822644,0.00054574385,0.23893957,0.0011729833,0.00017451307,0.0007183396,0.0035315438,0.00096486695,0.045725983],"genre_scores_gemma":[0.82462895,0.00046865435,0.14692122,0.00052938226,0.000054108594,0.00091556023,0.0031041342,0.000284897,0.023093147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990619,0.00023759968,0.00008650926,0.00022758984,0.0001868575,0.00019957419],"domain_scores_gemma":[0.995886,0.0018874177,0.00062491006,0.00040327533,0.0005785617,0.0006197667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054664,0.00073474477,0.0007301853,0.0020687643,0.0025625804,0.002443997,0.0017196105,0.0021098605,0.007063494],"category_scores_gemma":[0.004417011,0.00083189236,0.00062082126,0.002899902,0.0011897808,0.002185982,0.0017156001,0.00088204595,0.0013719839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018900965,0.0005690205,0.008452346,0.0009936533,0.00022773695,0.003801079,0.0024061045,0.039138883,0.04778668,0.8045013,0.013616996,0.07661618],"study_design_scores_gemma":[0.0003096386,0.00023754133,0.0030057547,0.0003134505,0.00027890434,0.0014189369,0.0012862383,0.14807157,0.027354714,0.7897582,0.027853211,0.00011185198],"about_ca_topic_score_codex":0.0032783397,"about_ca_topic_score_gemma":0.004765198,"teacher_disagreement_score":0.007063494,"about_ca_system_score_codex":0.0009371301,"about_ca_system_score_gemma":0.0014481471,"threshold_uncertainty_score":0.023629785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7491233,0.0011512727,0.1409759,0.0023590513,0.00044265168,0.00012520423,0.0034837958,0.000535341,0.10180353],"genre_scores_gemma":[0.9748693,0.0005658893,0.0129622575,0.00033131187,0.00020124365,0.00008127334,0.0011611244,0.00011289219,0.009714621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964166,0.000059795755,0.000016270771,0.0001180471,0.00008379148,0.00008043597],"domain_scores_gemma":[0.99748504,0.001146505,0.00045807697,0.00023636925,0.00029895807,0.00037504948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028740676,0.000380634,0.00025918693,0.0022796083,0.00078860245,0.0015249809,0.0005886116,0.0006497038,0.0059864786],"category_scores_gemma":[0.0036139542,0.00022975521,0.00025194735,0.0012170307,0.0012837816,0.0016048003,0.00067425636,0.0012273255,0.0012180847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031485784,0.000097391916,0.0037340848,0.00019139887,0.000013608909,0.00043019815,0.0005879394,0.0076548187,0.027811619,0.92081237,0.009379967,0.028971754],"study_design_scores_gemma":[0.000053916232,0.00015859577,0.0077169603,0.00015919964,0.000027336893,0.0016917358,0.0005506585,0.06778592,0.013555645,0.8802034,0.02801538,0.00008128028],"about_ca_topic_score_codex":0.0010250546,"about_ca_topic_score_gemma":0.0010525285,"teacher_disagreement_score":0.0059864786,"about_ca_system_score_codex":0.000977308,"about_ca_system_score_gemma":0.0005603312,"threshold_uncertainty_score":0.020026803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092371255,0.0020128468,0.10131382,0.0013889642,0.0007630861,0.000053629203,0.00023024257,0.00015291384,0.8848474],"genre_scores_gemma":[0.31584743,0.006065252,0.037233584,0.0011198058,0.0006676713,0.00025736727,0.00061959145,0.000248575,0.6379407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997392,0.00006630856,0.0000088233355,0.000037725273,0.00011122782,0.00003671397],"domain_scores_gemma":[0.99982196,0.00008165468,0.000010637156,0.000022768036,0.00003868123,0.000024303316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027429484,0.0010709475,0.00047823484,0.0004858808,0.00072201644,0.002596964,0.0007991654,0.00066836976,0.01750762],"category_scores_gemma":[0.00094769435,0.00028278906,0.00033098346,0.0007097837,0.0011047671,0.001818112,0.0010270062,0.0016676934,0.003928012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010282518,0.000015521384,0.00001925789,0.00004194401,0.0000066262223,0.000021369788,0.00005840217,0.002226417,0.00051649293,0.96498704,0.016725523,0.015371171],"study_design_scores_gemma":[0.000008345459,0.000009859421,0.000043375247,0.000031293275,0.000004676911,0.000044770823,0.00003575543,0.0064200396,0.00033707515,0.95324016,0.039817575,0.0000070169126],"about_ca_topic_score_codex":0.0009902238,"about_ca_topic_score_gemma":0.0015627912,"teacher_disagreement_score":0.01750762,"about_ca_system_score_codex":0.0010738167,"about_ca_system_score_gemma":0.00081718416,"threshold_uncertainty_score":0.058568776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875197,0.00025146807,0.051320527,0.0009947154,0.00016876555,0.00007646849,0.0015890105,0.0004071095,0.06999488],"genre_scores_gemma":[0.9724531,0.00011109892,0.014493584,0.0002077118,0.000030498932,0.000055659522,0.0009692425,0.00013864775,0.011540474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.00013994843,0.000043179833,0.000119368735,0.000103326805,0.00023155664],"domain_scores_gemma":[0.9964353,0.0015688725,0.00053163356,0.0005647914,0.00044623617,0.00045312423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998688,0.00038822612,0.00043322804,0.0010484384,0.0022160332,0.0024233332,0.0007427563,0.0010018393,0.013436521],"category_scores_gemma":[0.003579884,0.0006227048,0.0005917109,0.0009708252,0.0011989361,0.0016810234,0.0013670393,0.0012902976,0.001512653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001650879,0.0003868344,0.015038193,0.00046368624,0.000100380894,0.0015522712,0.0028700263,0.010181009,0.05087288,0.85241914,0.022897918,0.04156679],"study_design_scores_gemma":[0.00018852233,0.00018298438,0.012272087,0.0001355023,0.000099444864,0.0020309063,0.0026061141,0.03734294,0.02682064,0.89842165,0.019805526,0.00009359021],"about_ca_topic_score_codex":0.0013382323,"about_ca_topic_score_gemma":0.0020965592,"teacher_disagreement_score":0.013436521,"about_ca_system_score_codex":0.0009268602,"about_ca_system_score_gemma":0.00071893114,"threshold_uncertainty_score":0.04494965},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10468947,0.0012910883,0.82590115,0.0015812764,0.00055907277,0.000059798836,0.00016693112,0.0002666115,0.0654845],"genre_scores_gemma":[0.81441486,0.0025802478,0.11128019,0.0015182554,0.0012204972,0.00020073702,0.0003112695,0.00046009102,0.068013914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.00036981597,0.000025404877,0.00013634827,0.00022069394,0.00009143868],"domain_scores_gemma":[0.9941204,0.00412217,0.00045698576,0.000500887,0.0004927728,0.0003067364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000888799,0.0015422645,0.0008456003,0.0015699592,0.0008599292,0.0015417213,0.0012586172,0.0016772754,0.0082952175],"category_scores_gemma":[0.010148483,0.0006153836,0.00042158112,0.0018232466,0.0024305624,0.0033716867,0.0019317855,0.0020206883,0.0014479065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053451815,0.000026691814,0.00011027834,0.000058743022,0.000010698277,0.00009284445,0.00009862546,0.015233608,0.003165226,0.96539295,0.0024514676,0.013305394],"study_design_scores_gemma":[0.000010675751,0.000022633782,0.00011281202,0.000020038311,0.000007034189,0.000086737185,0.000036349596,0.08008941,0.000900265,0.9163581,0.002337777,0.000018080711],"about_ca_topic_score_codex":0.00088645506,"about_ca_topic_score_gemma":0.00087839767,"teacher_disagreement_score":0.0082952175,"about_ca_system_score_codex":0.00071747846,"about_ca_system_score_gemma":0.00041685317,"threshold_uncertainty_score":0.027750254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24977726,0.00047705317,0.6907041,0.00075993204,0.00007790093,0.00023518439,0.0014779922,0.00057380245,0.055916835],"genre_scores_gemma":[0.8380931,0.00068645895,0.14561114,0.00029144972,0.00010634765,0.00035874132,0.0021539903,0.00020031675,0.012498462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993316,0.00016974154,0.00005564706,0.00019178737,0.00015139485,0.000099824836],"domain_scores_gemma":[0.9966516,0.0018604979,0.00051213056,0.00026630142,0.0003933706,0.00031618768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469462,0.00048541508,0.000510902,0.0019849138,0.0010737287,0.0022685966,0.0007244118,0.00075911515,0.008254979],"category_scores_gemma":[0.004617322,0.00065832125,0.0007385665,0.0018044412,0.0013956106,0.0028850755,0.0009990142,0.0013151905,0.00066023535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007191963,0.000105283085,0.002084669,0.0001720727,0.000035068013,0.00053118914,0.00036798048,0.03998113,0.0033416785,0.9182623,0.0025487586,0.032497864],"study_design_scores_gemma":[0.00004089292,0.00006854038,0.0013935039,0.00007590188,0.00003904572,0.0005213723,0.00021662988,0.15657173,0.0023826335,0.8253543,0.013304194,0.00003117173],"about_ca_topic_score_codex":0.0020706316,"about_ca_topic_score_gemma":0.0029752275,"teacher_disagreement_score":0.008254979,"about_ca_system_score_codex":0.0014093743,"about_ca_system_score_gemma":0.0006360666,"threshold_uncertainty_score":0.027615666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8110761,0.0006808746,0.12135176,0.0004685379,0.00016971762,0.0000691131,0.00013008235,0.0002925974,0.0657612],"genre_scores_gemma":[0.9857432,0.00011190211,0.008772286,0.00006491807,0.00010393347,0.00002773673,0.00006368272,0.000042358854,0.005070095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910897,0.00016419428,0.00005047308,0.00017436336,0.00023329435,0.00026863208],"domain_scores_gemma":[0.9990231,0.00019382952,0.00019765775,0.00012627244,0.00015522829,0.00030395878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006225191,0.00041151352,0.0004987481,0.0013474206,0.0013309086,0.0022142658,0.00076716376,0.00047820792,0.0057953186],"category_scores_gemma":[0.0017950782,0.00030537162,0.0005011043,0.0006087924,0.0033845408,0.003825014,0.0026311157,0.0014757408,0.00078505673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032256095,0.000020464639,0.00022755758,0.000022330278,0.0000048471825,0.00015706976,0.00046284904,0.0004830791,0.0026257832,0.99250484,0.00018807901,0.0032707846],"study_design_scores_gemma":[0.000031043954,0.00008130635,0.0005696105,0.00002126601,0.0000152200055,0.0004982461,0.0004903412,0.0058253678,0.005031411,0.9828262,0.004576336,0.00003359941],"about_ca_topic_score_codex":0.00040121246,"about_ca_topic_score_gemma":0.00035838777,"teacher_disagreement_score":0.0057953186,"about_ca_system_score_codex":0.0007827063,"about_ca_system_score_gemma":0.0004172507,"threshold_uncertainty_score":0.019387305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8646707,0.0022171142,0.10259117,0.00051531853,0.00023361806,0.000058376838,0.00022624625,0.0002474882,0.029240035],"genre_scores_gemma":[0.9754961,0.00064646377,0.01748445,0.000116195966,0.00026499334,0.000051090567,0.00026892906,0.00005306502,0.005618661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994704,0.00009771101,0.0000432294,0.00012697396,0.00014295576,0.00011872874],"domain_scores_gemma":[0.9972397,0.0008939661,0.00092754944,0.0002937489,0.00024740642,0.00039762267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074865983,0.00055225805,0.0005191428,0.0029311976,0.0013149199,0.0012436812,0.0005725954,0.0007496968,0.0036703774],"category_scores_gemma":[0.004302792,0.00028908122,0.00045567632,0.001397772,0.0023443766,0.003845133,0.0013979565,0.00080591696,0.0006436608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030411384,0.00006953389,0.0054604304,0.00020967421,0.000030295927,0.00076387665,0.001175414,0.0043468503,0.022843707,0.929287,0.0008922919,0.034616802],"study_design_scores_gemma":[0.000029515679,0.0002520947,0.0044023576,0.00010550091,0.00003780034,0.0011753658,0.0007266253,0.021651385,0.01732898,0.94398504,0.01025275,0.000052608502],"about_ca_topic_score_codex":0.00029744473,"about_ca_topic_score_gemma":0.00033632666,"teacher_disagreement_score":0.0036703774,"about_ca_system_score_codex":0.00079779926,"about_ca_system_score_gemma":0.0003457514,"threshold_uncertainty_score":0.012278616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68555886,0.0009958145,0.124181144,0.001633539,0.0003074463,0.000095778996,0.0009394027,0.000285061,0.186003],"genre_scores_gemma":[0.9574286,0.0009642165,0.017386867,0.00029621177,0.00022170579,0.000069470436,0.00075720943,0.00016587872,0.02270998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992506,0.00021945019,0.000030265199,0.000120202,0.00019656087,0.00018298576],"domain_scores_gemma":[0.99876344,0.0005357496,0.0002040127,0.00014720894,0.00014347202,0.00020606116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039708742,0.0008188336,0.00069482805,0.0017590574,0.0012901772,0.0034055598,0.0008640473,0.00083979557,0.009024466],"category_scores_gemma":[0.0020940157,0.000604929,0.00061638973,0.0009848455,0.0019240882,0.0025996964,0.0020964574,0.002279914,0.0012242671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104425264,0.000019180414,0.00026434928,0.000035538396,0.000010991457,0.000102964375,0.00017148696,0.005554983,0.0014131507,0.98671573,0.001978988,0.0036282227],"study_design_scores_gemma":[0.000027955237,0.000031780073,0.0005270296,0.000024596644,0.000012119201,0.00020452442,0.00043019786,0.03075869,0.0009091287,0.9627875,0.0042668465,0.000019571182],"about_ca_topic_score_codex":0.0014538856,"about_ca_topic_score_gemma":0.0011562487,"teacher_disagreement_score":0.009024466,"about_ca_system_score_codex":0.00078634446,"about_ca_system_score_gemma":0.0003373885,"threshold_uncertainty_score":0.030189872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.357707,0.0011429414,0.0856532,0.0044210847,0.001581129,0.00046563707,0.0012463583,0.0013376352,0.546445],"genre_scores_gemma":[0.8405524,0.00051602,0.01816598,0.0010231861,0.0013141867,0.00046007163,0.0015422519,0.00038816547,0.13603774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988913,0.00023438342,0.000071335664,0.00021721103,0.0002772338,0.0003086326],"domain_scores_gemma":[0.99922264,0.00026222566,0.00010495186,0.00011088985,0.0001231417,0.0001761464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083758746,0.0012406335,0.0010922998,0.002001481,0.0037629213,0.0054898215,0.0008918219,0.0010761592,0.016412875],"category_scores_gemma":[0.0014745229,0.0006284943,0.0010403036,0.0018495955,0.0032233207,0.0044382317,0.002384043,0.0028561347,0.0035934506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113780734,0.000041383668,0.00012785417,0.000027303702,0.000006520982,0.00011185735,0.00068787247,0.00013611773,0.0019080663,0.9871717,0.0036159875,0.006051451],"study_design_scores_gemma":[0.000091774506,0.00004212303,0.00035091513,0.000013238354,0.000010097511,0.00016254385,0.00024326648,0.00072127744,0.0018503112,0.97954595,0.016949464,0.000018988438],"about_ca_topic_score_codex":0.001758622,"about_ca_topic_score_gemma":0.0013277283,"teacher_disagreement_score":0.016412875,"about_ca_system_score_codex":0.0018071997,"about_ca_system_score_gemma":0.0011887153,"threshold_uncertainty_score":0.054906547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82907736,0.0007589988,0.111905955,0.0004136321,0.00009088245,0.00038260352,0.0016546184,0.00076807855,0.054947924],"genre_scores_gemma":[0.85813606,0.00057932595,0.11486468,0.0003110984,0.00008860653,0.00038732574,0.0032547908,0.00020014594,0.022178004],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983333,0.0002802849,0.00019146097,0.00029388233,0.00056632445,0.00033467487],"domain_scores_gemma":[0.99474937,0.0017995471,0.0008770601,0.0014103486,0.0008308132,0.00033293068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009764052,0.0005372572,0.00061010366,0.002612071,0.0010732863,0.0017707481,0.0009968099,0.0012532007,0.008276188],"category_scores_gemma":[0.0036354526,0.00045813704,0.000798698,0.0012954286,0.0012380842,0.000863542,0.00087130757,0.0010444939,0.002081034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025468238,0.0007562531,0.023293914,0.00066809537,0.00015776353,0.0011899063,0.0011617957,0.032813232,0.09232507,0.4086513,0.0065547475,0.42988116],"study_design_scores_gemma":[0.0009970046,0.003974407,0.025504619,0.00046505666,0.00030384152,0.008529808,0.0010078574,0.12291381,0.10620027,0.62936187,0.10036709,0.0003743186],"about_ca_topic_score_codex":0.0005814479,"about_ca_topic_score_gemma":0.0011241774,"teacher_disagreement_score":0.008276188,"about_ca_system_score_codex":0.00073164486,"about_ca_system_score_gemma":0.0016737818,"threshold_uncertainty_score":0.027686656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40058455,0.0015942777,0.32579753,0.0028311808,0.0006030792,0.00012385438,0.0009230416,0.0008536479,0.26668885],"genre_scores_gemma":[0.9515829,0.00041036887,0.022562765,0.00039960406,0.0002480498,0.00010626044,0.00037470457,0.00016394275,0.024151301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852544,0.0003612994,0.000076583536,0.0003753975,0.00033441288,0.00032693206],"domain_scores_gemma":[0.99469614,0.0026131067,0.00066320994,0.00065110164,0.0005938528,0.00078258966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009171291,0.0005706898,0.0006013239,0.0019867981,0.0024617831,0.0027365412,0.0007264342,0.0010689909,0.014059343],"category_scores_gemma":[0.00713046,0.0004939307,0.0007058504,0.0012835682,0.0035712726,0.004506217,0.0020045855,0.0018569502,0.0015290631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004198283,0.000014826282,0.00027074388,0.00002461924,0.000006892087,0.00006767357,0.00016304564,0.00057474576,0.0007429381,0.993664,0.001373007,0.0030555497],"study_design_scores_gemma":[0.000015068369,0.000013714713,0.0002741742,0.000019900644,0.00000786524,0.00013813996,0.0001243782,0.0033820404,0.00051364786,0.99051255,0.004985561,0.000013003107],"about_ca_topic_score_codex":0.0020042763,"about_ca_topic_score_gemma":0.0019240426,"teacher_disagreement_score":0.014059343,"about_ca_system_score_codex":0.0010568757,"about_ca_system_score_gemma":0.000711109,"threshold_uncertainty_score":0.04703319},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22204484,0.0045078048,0.37296855,0.06024303,0.006377475,0.0003148627,0.0029363816,0.0021911284,0.3284159],"genre_scores_gemma":[0.90513027,0.0021425346,0.05560174,0.005639963,0.0024131958,0.0002650808,0.0019614028,0.00038707984,0.026458744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868697,0.0003404554,0.000057837384,0.0002791625,0.00041204575,0.00022346375],"domain_scores_gemma":[0.98965454,0.0067813084,0.0005801998,0.0012245642,0.0010193525,0.00074001576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021016912,0.0011327567,0.0011687067,0.0021216979,0.0018383451,0.002654613,0.0020324509,0.0019389404,0.02334041],"category_scores_gemma":[0.011329692,0.00067319244,0.001664475,0.0018818572,0.00460983,0.0077310633,0.005841755,0.0052387747,0.0022351714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012460312,0.00013529552,0.00080305216,0.00029213107,0.00005506849,0.00034673858,0.00058303116,0.001963505,0.0016794468,0.9586392,0.025731426,0.009646547],"study_design_scores_gemma":[0.00004651944,0.000041146744,0.00070175336,0.00005399495,0.000029388058,0.0003128711,0.00019229161,0.0052936836,0.0007450589,0.9819255,0.010636851,0.00002088085],"about_ca_topic_score_codex":0.001895698,"about_ca_topic_score_gemma":0.0018374028,"teacher_disagreement_score":0.02334041,"about_ca_system_score_codex":0.0017026714,"about_ca_system_score_gemma":0.0009439407,"threshold_uncertainty_score":0.07808143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9104568,0.00017479957,0.053875413,0.0002562118,0.00004102313,0.00006193659,0.0007924768,0.00034461575,0.03399684],"genre_scores_gemma":[0.97656983,0.00008270612,0.017709037,0.00006707776,0.00002482244,0.000045314766,0.0006897014,0.00007462434,0.004736859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994905,0.00010536736,0.000029182156,0.0001366892,0.000080699625,0.0001575505],"domain_scores_gemma":[0.9983596,0.00055354426,0.00030742076,0.00020805812,0.0002661647,0.0003051925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024376893,0.00040249847,0.00057033065,0.0011961386,0.0012410879,0.0014971708,0.00092406856,0.00069658103,0.0094908215],"category_scores_gemma":[0.001966842,0.0004409567,0.00030092947,0.0011027593,0.0009467076,0.0019527021,0.0009150848,0.00069160905,0.0009143528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037209117,0.00040710354,0.023304533,0.001205615,0.00022564273,0.0040099826,0.0009854259,0.19417578,0.11273453,0.59425145,0.009133857,0.055845197],"study_design_scores_gemma":[0.0002655233,0.00080337963,0.014034392,0.00017993512,0.0001711931,0.0031981342,0.0025543578,0.46679974,0.0916812,0.40389675,0.016209299,0.00020605115],"about_ca_topic_score_codex":0.0015486091,"about_ca_topic_score_gemma":0.0015751483,"teacher_disagreement_score":0.0094908215,"about_ca_system_score_codex":0.00076543307,"about_ca_system_score_gemma":0.00039373338,"threshold_uncertainty_score":0.031749964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7667579,0.00067782163,0.07453041,0.0012564828,0.0002804864,0.000106979634,0.00023362043,0.00030429484,0.15585212],"genre_scores_gemma":[0.9287826,0.00036612208,0.0371942,0.0001997535,0.000074925854,0.00007687844,0.0003038398,0.000041744777,0.032960016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997253,0.000036912057,0.000020613697,0.00007093007,0.00008517967,0.00006105523],"domain_scores_gemma":[0.99926955,0.00022829066,0.00009888263,0.00014400708,0.000121611,0.00013768747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026027154,0.0004376545,0.00040206395,0.00073093065,0.0018369657,0.0013672411,0.00035101973,0.00053742283,0.0070169307],"category_scores_gemma":[0.0006549709,0.00022860168,0.0005191915,0.00050285243,0.002687837,0.0018326036,0.0013258095,0.0011851111,0.0012401338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012248989,0.000031988428,0.0013672289,0.00008847936,0.00002407933,0.0008921329,0.0008484769,0.0006253649,0.016446147,0.96106404,0.0011538481,0.017335739],"study_design_scores_gemma":[0.00005450435,0.00024491537,0.0021305785,0.000034304037,0.000028055792,0.0020056376,0.0012694318,0.0029164467,0.014790106,0.9322246,0.044255853,0.00004557289],"about_ca_topic_score_codex":0.0006502573,"about_ca_topic_score_gemma":0.0011358081,"teacher_disagreement_score":0.0070169307,"about_ca_system_score_codex":0.0003651269,"about_ca_system_score_gemma":0.0003776829,"threshold_uncertainty_score":0.023473978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6262039,0.0008638501,0.22708519,0.003596281,0.00035964453,0.0001948543,0.0011537663,0.00039044683,0.1401521],"genre_scores_gemma":[0.8727118,0.0007902777,0.08117522,0.0007778382,0.0002975447,0.00015678366,0.0010389688,0.00019924073,0.04285233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995172,0.00011925211,0.00002039885,0.000105910374,0.00010297915,0.00013434487],"domain_scores_gemma":[0.99876773,0.00050944573,0.00017929582,0.0002143168,0.00014209084,0.00018722856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060949544,0.0007368178,0.0007169382,0.0011517144,0.0017589796,0.002304442,0.00087904313,0.0016499048,0.013051872],"category_scores_gemma":[0.0032484327,0.00060070615,0.0006613021,0.0011111886,0.0013797719,0.0033030424,0.0014239142,0.002054463,0.001564604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022958765,0.000067649504,0.00032573153,0.00012602242,0.000017969613,0.00016854887,0.00048693575,0.0072033103,0.0038920026,0.9547265,0.012032286,0.020723443],"study_design_scores_gemma":[0.0000506063,0.000024028808,0.00018011454,0.00002019671,0.000008500047,0.00012879106,0.00015755376,0.015663091,0.0008489691,0.97912496,0.0037786064,0.000014557582],"about_ca_topic_score_codex":0.0014545199,"about_ca_topic_score_gemma":0.002550102,"teacher_disagreement_score":0.013051872,"about_ca_system_score_codex":0.000672497,"about_ca_system_score_gemma":0.0007730143,"threshold_uncertainty_score":0.043662846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6477382,0.00066529773,0.23559946,0.0026594782,0.0008369601,0.0015184557,0.0039133816,0.0012806032,0.10578827],"genre_scores_gemma":[0.8280583,0.00039743568,0.11446541,0.0005570297,0.00012114747,0.0011614191,0.0026793557,0.00036058776,0.05219936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982456,0.000597039,0.0001372539,0.0004056618,0.00016933391,0.0004451777],"domain_scores_gemma":[0.99442554,0.002493354,0.0007374492,0.00095175346,0.00047872507,0.00091313623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016904563,0.0007719377,0.0010533831,0.001195208,0.0033804304,0.0024263277,0.0017391011,0.0013344898,0.039700385],"category_scores_gemma":[0.008032173,0.00048403585,0.0014772866,0.0016527033,0.001281792,0.0021690435,0.001777228,0.0013662032,0.003925295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035122696,0.0018611125,0.02410672,0.0013748829,0.0008919978,0.002144475,0.0022933003,0.11774165,0.019589625,0.48694542,0.064904846,0.2746337],"study_design_scores_gemma":[0.0007065407,0.0017169709,0.009640193,0.00023133704,0.00030350618,0.0017685303,0.001657934,0.2264829,0.0059576356,0.6382742,0.113091774,0.00016839536],"about_ca_topic_score_codex":0.0020443986,"about_ca_topic_score_gemma":0.005095661,"teacher_disagreement_score":0.039700385,"about_ca_system_score_codex":0.0011166992,"about_ca_system_score_gemma":0.0011384576,"threshold_uncertainty_score":0.13281101},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125512015,0.0038035575,0.9151634,0.0040877825,0.00033031526,0.00008483408,0.00029974783,0.00023220021,0.06344692],"genre_scores_gemma":[0.3303583,0.008971598,0.62852293,0.0016602847,0.0020867023,0.00071463006,0.0010239991,0.00040450075,0.026257131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977175,0.00085898075,0.0001485455,0.0003739264,0.0007025769,0.00019850722],"domain_scores_gemma":[0.9951723,0.0032040426,0.00019572876,0.0008076943,0.00043400022,0.00018623956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547039,0.0012258482,0.0009606882,0.0035765483,0.0023221504,0.007634768,0.0030031663,0.0021423216,0.011325206],"category_scores_gemma":[0.010204796,0.00080825685,0.0020733697,0.004025874,0.0072405166,0.014572058,0.004173963,0.0064063976,0.0015750403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016423716,0.0000057833313,0.00003779087,0.000020727957,0.0000029807936,0.00000873023,0.00004765469,0.0011707863,0.000037370864,0.995637,0.00043066428,0.0025987753],"study_design_scores_gemma":[0.0000024656417,0.000001872512,0.0000167612,0.000012556312,0.0000015215156,0.000014504212,0.000029108172,0.0063675977,0.000039832245,0.99016947,0.0033413388,0.0000030071244],"about_ca_topic_score_codex":0.0014689295,"about_ca_topic_score_gemma":0.00195303,"teacher_disagreement_score":0.011325206,"about_ca_system_score_codex":0.0032253342,"about_ca_system_score_gemma":0.0014374076,"threshold_uncertainty_score":0.03788662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051832445,0.00057459646,0.9116956,0.0010174593,0.00026569792,0.00009691397,0.00035645283,0.00036160945,0.03379911],"genre_scores_gemma":[0.65362394,0.0011416009,0.30946383,0.0014803961,0.00049217266,0.00036767445,0.0006552003,0.0001996767,0.032575488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974375,0.0011098173,0.000098056786,0.0005028066,0.0005976308,0.00025415007],"domain_scores_gemma":[0.99599564,0.0017695966,0.00053673005,0.0010146789,0.0005249987,0.00015820531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215947,0.000993849,0.00086688215,0.0012891932,0.0007592827,0.0023597898,0.0013270285,0.0021277484,0.0077891992],"category_scores_gemma":[0.007233955,0.0006287591,0.00065617706,0.0015630226,0.001231763,0.0022874018,0.0021090605,0.0018624442,0.0022281003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018846542,0.0001089032,0.00026154733,0.00009986088,0.00003844396,0.000076713484,0.00008867033,0.0153052565,0.0067861634,0.9183944,0.0031863716,0.055465113],"study_design_scores_gemma":[0.000079893325,0.0000809993,0.00011470819,0.000037814523,0.00002930681,0.00015409465,0.000035619527,0.092678465,0.00419332,0.8952137,0.0073551936,0.0000269445],"about_ca_topic_score_codex":0.00030925366,"about_ca_topic_score_gemma":0.00045423213,"teacher_disagreement_score":0.0077891992,"about_ca_system_score_codex":0.00084478693,"about_ca_system_score_gemma":0.001303877,"threshold_uncertainty_score":0.026057422},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2057232,0.0012629017,0.7358595,0.001146038,0.00027777292,0.00016202815,0.00045308808,0.00029745177,0.054817967],"genre_scores_gemma":[0.7920558,0.00085366133,0.18701185,0.00028108247,0.00022156074,0.00015539986,0.0008188805,0.00018508332,0.018416675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661475,0.0012199411,0.00022280919,0.0008048057,0.00069652824,0.00044119084],"domain_scores_gemma":[0.9918251,0.0041970825,0.001355644,0.0013430453,0.00083239214,0.0004467198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017321259,0.0007716718,0.0007378897,0.0010459557,0.0019411922,0.0033430608,0.0014411941,0.0019543401,0.010977031],"category_scores_gemma":[0.009326864,0.0010614474,0.0011673811,0.0012780481,0.0037129638,0.0129959285,0.003248104,0.0025913813,0.0015117279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009222292,0.000044572917,0.00065345166,0.00010352086,0.000018579376,0.0002061369,0.000301652,0.008057686,0.0021692975,0.972178,0.0014012376,0.014773628],"study_design_scores_gemma":[0.000026483543,0.00012837572,0.0005925787,0.0000637142,0.000021935348,0.0009607706,0.0010095232,0.05176783,0.007638194,0.9236476,0.014087481,0.000055404333],"about_ca_topic_score_codex":0.0007395222,"about_ca_topic_score_gemma":0.00079991174,"teacher_disagreement_score":0.010977031,"about_ca_system_score_codex":0.0011605213,"about_ca_system_score_gemma":0.00076392427,"threshold_uncertainty_score":0.036721826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012045037,0.15285844,0.6652578,0.022626992,0.008575487,0.00015792977,0.00033617188,0.0008383552,0.13730375],"genre_scores_gemma":[0.20604613,0.17963937,0.3966454,0.0039938283,0.018660458,0.00042001926,0.0013774569,0.00046561024,0.19275174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986071,0.00067929877,0.00007378878,0.00016598201,0.00039737427,0.000076530225],"domain_scores_gemma":[0.99784887,0.0011272304,0.0000915715,0.00019904066,0.0005759232,0.00015728259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032738568,0.0009407166,0.0007744528,0.0020950204,0.00078573404,0.0033130494,0.00084015453,0.0014924954,0.019267438],"category_scores_gemma":[0.0029708885,0.00048697647,0.000574443,0.0030626,0.0020302315,0.0038646245,0.0014304202,0.0027990353,0.006161343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121631405,0.00013230872,0.0007388954,0.0008793914,0.000067606525,0.00016972677,0.00045055395,0.00952395,0.002627211,0.41736767,0.10485803,0.46306306],"study_design_scores_gemma":[0.000038610822,0.00025710117,0.00089395035,0.0006802671,0.000026148973,0.0006302017,0.00035877258,0.02571913,0.0017776825,0.4843976,0.48515743,0.0000630666],"about_ca_topic_score_codex":0.00090028974,"about_ca_topic_score_gemma":0.0009450103,"teacher_disagreement_score":0.019267438,"about_ca_system_score_codex":0.001633655,"about_ca_system_score_gemma":0.0009247445,"threshold_uncertainty_score":0.064455986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012812894,0.00027820584,0.9823533,0.00012364211,0.00005872033,0.0001453977,0.00015628737,0.00024980938,0.003821697],"genre_scores_gemma":[0.21698721,0.0006166393,0.77728385,0.00039555534,0.00016476074,0.0007615206,0.00035705775,0.0001495276,0.0032839274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98756856,0.008016129,0.00054186705,0.0014329657,0.0020028476,0.000437567],"domain_scores_gemma":[0.97295547,0.016366923,0.0025128527,0.0044716117,0.0031348907,0.00055828603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010151444,0.0011974946,0.0009900985,0.001974182,0.0008636662,0.0015843583,0.00090520456,0.001041143,0.005025073],"category_scores_gemma":[0.030741325,0.0008551585,0.001018401,0.0018378979,0.0022703963,0.002077636,0.0014492493,0.0015225026,0.0014726305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044749398,0.000067058034,0.0014168493,0.0004301189,0.00010398054,0.00018542282,0.00039552868,0.039074574,0.015194588,0.8360565,0.0021119772,0.10451597],"study_design_scores_gemma":[0.0001977253,0.00086992,0.0010614186,0.00016415937,0.00008215797,0.00046050266,0.00013159995,0.11040484,0.021412274,0.8444064,0.020698417,0.00011047384],"about_ca_topic_score_codex":0.00047229874,"about_ca_topic_score_gemma":0.00061008945,"teacher_disagreement_score":0.010151444,"about_ca_system_score_codex":0.0010523058,"about_ca_system_score_gemma":0.0013565588,"threshold_uncertainty_score":0.05368662},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18330002,0.016401047,0.61897093,0.0076686745,0.0005535773,0.00009814695,0.000729185,0.0004999614,0.17177853],"genre_scores_gemma":[0.94367975,0.0066518853,0.03422867,0.00017932671,0.00028541448,0.00004237209,0.0001499862,0.000059078855,0.014723523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897635,0.00025282617,0.000017256209,0.0001231387,0.00044711865,0.0001833273],"domain_scores_gemma":[0.99792445,0.0011740993,0.00021765345,0.00017277415,0.00039485347,0.00011609223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013675635,0.00076834054,0.00042751164,0.0010373396,0.000622442,0.0026897374,0.00075145887,0.0007822377,0.0022697127],"category_scores_gemma":[0.0053529534,0.00024066305,0.00011311179,0.0012597932,0.002420817,0.0022993542,0.0010850158,0.0009206938,0.00032939095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053514257,0.000037685066,0.00086276827,0.00015887491,0.000016749684,0.000025803847,0.000098105214,0.12110958,0.0055260444,0.82146853,0.005359582,0.045282662],"study_design_scores_gemma":[0.000008182333,0.000042954576,0.0010195624,0.00007707573,0.0000150362,0.000027694707,0.000094583156,0.42323697,0.008520054,0.5575689,0.00936135,0.000027555052],"about_ca_topic_score_codex":0.010010919,"about_ca_topic_score_gemma":0.016126009,"teacher_disagreement_score":0.010010919,"about_ca_system_score_codex":0.0039581056,"about_ca_system_score_gemma":0.0023205457,"threshold_uncertainty_score":0.028718233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36358482,0.0015160698,0.57122326,0.00044820685,0.00025875476,0.00029367825,0.0009285614,0.0007000465,0.061046664],"genre_scores_gemma":[0.7205595,0.0009291589,0.25571063,0.00016699941,0.000108549044,0.00047959562,0.00070752,0.00020970001,0.021128353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982552,0.0005787838,0.00013502152,0.0003535906,0.00042631812,0.0002510556],"domain_scores_gemma":[0.99476385,0.003112052,0.00050638616,0.0010107185,0.00032007624,0.0002869542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014338476,0.0007782799,0.00079534174,0.0011402555,0.0012964933,0.0019354278,0.0008320069,0.0011527231,0.011543347],"category_scores_gemma":[0.0067138188,0.00088534836,0.0010637423,0.0010625856,0.0019351642,0.0036048945,0.0016936507,0.0016685472,0.0015898728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011255067,0.00010564393,0.0022815706,0.0005169777,0.00007600515,0.00045102023,0.0008163036,0.037969947,0.039471354,0.822519,0.0039400244,0.09072662],"study_design_scores_gemma":[0.000102233476,0.0004774338,0.0012911105,0.00015928708,0.000052658517,0.0006502233,0.00020350449,0.07084037,0.016815843,0.8887369,0.020610781,0.00005968984],"about_ca_topic_score_codex":0.00051779585,"about_ca_topic_score_gemma":0.0012784335,"teacher_disagreement_score":0.011543347,"about_ca_system_score_codex":0.00084966986,"about_ca_system_score_gemma":0.00042473924,"threshold_uncertainty_score":0.0386163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.365726,0.006816492,0.49389935,0.010120847,0.0006722493,0.00054617214,0.0063976482,0.0015170797,0.114304096],"genre_scores_gemma":[0.78477865,0.003206018,0.18581225,0.0013077273,0.00067754445,0.0007064017,0.003206134,0.00043185506,0.01987341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535996,0.0010591251,0.00030749425,0.0012180624,0.0009826819,0.0010727027],"domain_scores_gemma":[0.96369904,0.028081508,0.0016809427,0.0029789666,0.0011541276,0.0024053948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030482782,0.0014275326,0.0021801393,0.0021736482,0.0030168032,0.004643787,0.0040047946,0.0023065151,0.018646846],"category_scores_gemma":[0.022867987,0.00125473,0.0019799627,0.0022717123,0.0027956087,0.012046763,0.0045175403,0.0045716376,0.0027307605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027261102,0.0007882188,0.021694737,0.0021819323,0.0005619169,0.002137201,0.0021201323,0.056120664,0.041127317,0.6888491,0.040148817,0.14154384],"study_design_scores_gemma":[0.00036571213,0.0006188915,0.010386582,0.0004079016,0.00052135653,0.0063798698,0.001092994,0.22974081,0.02176267,0.6758837,0.052610945,0.00022858458],"about_ca_topic_score_codex":0.0014552029,"about_ca_topic_score_gemma":0.002693321,"teacher_disagreement_score":0.018646846,"about_ca_system_score_codex":0.0026615795,"about_ca_system_score_gemma":0.001194396,"threshold_uncertainty_score":0.062379897},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7653555,0.00040472086,0.22155868,0.00019127634,0.00008725009,0.00009760426,0.0012188246,0.00041343915,0.01067265],"genre_scores_gemma":[0.87416995,0.00024023549,0.11756563,0.00006454766,0.000032086245,0.00008652931,0.0023417291,0.00008902252,0.0054103755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936897,0.000116148796,0.00006168628,0.00014598337,0.00019022833,0.00011693681],"domain_scores_gemma":[0.996714,0.0015065345,0.00041899557,0.00045692784,0.00053719373,0.0003664733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003849477,0.00046855622,0.00047385728,0.0015965649,0.0007132643,0.001752526,0.0009931372,0.00069260213,0.003424884],"category_scores_gemma":[0.0039820224,0.00031157324,0.00031264592,0.0009549514,0.00064749917,0.0023724786,0.0011182933,0.00075969374,0.0004605001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009778131,0.00050971645,0.048855193,0.0012791487,0.0001555699,0.0013921822,0.0018964997,0.14816661,0.07175541,0.44543147,0.007364844,0.27221552],"study_design_scores_gemma":[0.000056242443,0.00028698053,0.00834637,0.00020326942,0.0000904895,0.0009419731,0.000744532,0.45850712,0.03884104,0.47593442,0.015977304,0.000070229136],"about_ca_topic_score_codex":0.00076257903,"about_ca_topic_score_gemma":0.0023346527,"teacher_disagreement_score":0.003424884,"about_ca_system_score_codex":0.00086569804,"about_ca_system_score_gemma":0.00043326232,"threshold_uncertainty_score":0.011457384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73852617,0.0007326876,0.060563374,0.0008651682,0.00056347705,0.00006435238,0.0010838417,0.0005878824,0.19701302],"genre_scores_gemma":[0.9539616,0.0003279041,0.019851973,0.00016212054,0.00015319373,0.000051900715,0.0006858099,0.00014101595,0.024664517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995641,0.000040327996,0.000023487333,0.00007459776,0.00015965203,0.00013783487],"domain_scores_gemma":[0.99909496,0.00027778052,0.00012849666,0.00015241685,0.00024911936,0.000097222284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020017124,0.00038912354,0.00030793267,0.0018205304,0.0009460075,0.0010845069,0.0004058066,0.00059537607,0.015428912],"category_scores_gemma":[0.0011881613,0.00016627865,0.00031771953,0.0008437086,0.00092566834,0.0013513886,0.00068042136,0.0009837792,0.0026616668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032561278,0.00008397757,0.008856106,0.00022636587,0.000023696473,0.0006679755,0.0009307405,0.0031050288,0.032497022,0.8246011,0.011712139,0.116970204],"study_design_scores_gemma":[0.000026647822,0.0002089017,0.011224514,0.00010152211,0.000042578224,0.0020451732,0.0009841217,0.0134346755,0.034570146,0.83760357,0.09964375,0.000114447736],"about_ca_topic_score_codex":0.0007459789,"about_ca_topic_score_gemma":0.0010480552,"teacher_disagreement_score":0.015428912,"about_ca_system_score_codex":0.0003856435,"about_ca_system_score_gemma":0.00034266827,"threshold_uncertainty_score":0.05161482},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076149076,0.00079822855,0.79895866,0.00082527625,0.0006494623,0.00019947454,0.00025129045,0.0006841859,0.121484414],"genre_scores_gemma":[0.5318733,0.00087788625,0.43456656,0.00054150086,0.00019889657,0.00032673535,0.0004059603,0.0003577302,0.030851437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999273,0.000216546,0.000027697672,0.00010633126,0.0002822515,0.000094219016],"domain_scores_gemma":[0.99941516,0.00015274934,0.00005462103,0.00018654282,0.0001278726,0.00006319338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063338614,0.00060045026,0.0005066509,0.0013611614,0.0012106149,0.001457077,0.0009772517,0.0008100317,0.006232514],"category_scores_gemma":[0.0016438358,0.00053916755,0.0007077557,0.000590885,0.0016041716,0.0016538595,0.0015760252,0.0018433636,0.0019108607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001585228,0.00001388146,0.000082958286,0.00004868501,0.0000055493524,0.000081945196,0.000115765535,0.0016836728,0.006319861,0.9810364,0.0011283859,0.009466989],"study_design_scores_gemma":[0.00003308829,0.00009127061,0.00014007319,0.000051385563,0.000009687397,0.00043970434,0.0001167312,0.03530494,0.028569384,0.9029293,0.032259453,0.000054968754],"about_ca_topic_score_codex":0.00026331865,"about_ca_topic_score_gemma":0.000376959,"teacher_disagreement_score":0.006232514,"about_ca_system_score_codex":0.0005886876,"about_ca_system_score_gemma":0.0006805767,"threshold_uncertainty_score":0.020849764},"labels":[],"label_agreement":null},{"id":"W2749856437","doi":"10.1002/jcd.21636","title":"Linking systems of difference sets","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Abelian group; Constructive; Group (periodic table); Connection (principal bundle); Argument (complex analysis); Difference set; Set (abstract data type); Projection (relational algebra); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.028635667905442762,"score_gpt":0.24508546527669758,"score_spread":0.21644979737125483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749856437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47803646,0.00040196217,0.4398403,0.0005677564,0.0003679139,0.00015344152,0.00036008348,0.0005484502,0.0797236],"genre_scores_gemma":[0.90646356,0.00018106883,0.077919304,0.00032768823,0.00014851763,0.00016694766,0.00042077727,0.00011402302,0.01425817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986632,0.00035791783,0.00009012416,0.0003515173,0.00033836925,0.00019888762],"domain_scores_gemma":[0.99794346,0.0008411402,0.00025741357,0.0003932818,0.00032314617,0.00024150839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061791,0.00034763452,0.00034138243,0.001839734,0.0013952147,0.0019801974,0.00064531335,0.00068016595,0.010091916],"category_scores_gemma":[0.00260961,0.00042098152,0.0006057742,0.0009426573,0.0019796358,0.0030519613,0.0029505584,0.0012496642,0.0012665343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023304556,0.000020810056,0.0005051407,0.000033191132,0.0000075535177,0.00007484332,0.00023547163,0.0016301929,0.004133125,0.98322314,0.0006181984,0.009494926],"study_design_scores_gemma":[0.0000222053,0.000079114645,0.0005984749,0.000029453879,0.000014697818,0.00028564004,0.00020154138,0.011172643,0.009003184,0.95881695,0.019741567,0.00003449736],"about_ca_topic_score_codex":0.000197682,"about_ca_topic_score_gemma":0.00020915613,"teacher_disagreement_score":0.010091916,"about_ca_system_score_codex":0.0008366418,"about_ca_system_score_gemma":0.00036421887,"threshold_uncertainty_score":0.033760846},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21238601,0.0016926373,0.64304644,0.0018411117,0.0007996581,0.00018293127,0.0010435208,0.00086172414,0.13814588],"genre_scores_gemma":[0.7696957,0.0016374688,0.18005869,0.0012841895,0.00066872407,0.00038895596,0.00088709395,0.00041272154,0.04496649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850595,0.0004401148,0.00012131428,0.0003585522,0.00037346515,0.00020054959],"domain_scores_gemma":[0.99603564,0.0016192186,0.0006158596,0.0011264065,0.0003550341,0.00024790197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608114,0.000677079,0.0007179459,0.0019973,0.0014771087,0.0028756533,0.0008113246,0.0014392307,0.010029333],"category_scores_gemma":[0.0048668166,0.0006155672,0.0007038842,0.0023956422,0.0030968012,0.005500993,0.0016307381,0.0016297782,0.0019149164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043255783,0.000025707071,0.00042217932,0.000051834417,0.000012125537,0.00016458308,0.00015216846,0.0008669066,0.0022116753,0.97308177,0.0014769604,0.021490842],"study_design_scores_gemma":[0.0000062925837,0.000012921619,0.00022315435,0.000017084996,0.000009355628,0.00019782505,0.000065653316,0.0027305274,0.0006990157,0.98930806,0.006719141,0.000011046082],"about_ca_topic_score_codex":0.00061522145,"about_ca_topic_score_gemma":0.0010174419,"teacher_disagreement_score":0.010029333,"about_ca_system_score_codex":0.0005083111,"about_ca_system_score_gemma":0.0007779333,"threshold_uncertainty_score":0.033551514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26306906,0.008389474,0.35836303,0.024597451,0.0018104077,0.00034488106,0.0058233603,0.0041198027,0.33348253],"genre_scores_gemma":[0.8608886,0.0031622315,0.09575153,0.0045198747,0.0021388843,0.000774352,0.005513549,0.0013028224,0.025947997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913481,0.0022585094,0.00029254277,0.002041566,0.0022819287,0.0017774736],"domain_scores_gemma":[0.9570451,0.028721536,0.00188911,0.0073509254,0.0025186716,0.0024747897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060646404,0.002717229,0.0036355879,0.0034392574,0.0045020026,0.0072082044,0.0064213574,0.0033187477,0.037271008],"category_scores_gemma":[0.036133025,0.0016693074,0.002623782,0.0043355655,0.005950251,0.01779121,0.01045519,0.011477688,0.008394426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022766301,0.0005548078,0.0049453466,0.0007076471,0.00020861044,0.00035771547,0.000998386,0.026795013,0.008171227,0.83792627,0.0596915,0.057366855],"study_design_scores_gemma":[0.00019732217,0.00018078623,0.0011789053,0.00016462563,0.00018036191,0.00033938012,0.00036463756,0.0858052,0.0035965997,0.8905467,0.017351631,0.000093904775],"about_ca_topic_score_codex":0.002578962,"about_ca_topic_score_gemma":0.0028344765,"teacher_disagreement_score":0.037271008,"about_ca_system_score_codex":0.0037847888,"about_ca_system_score_gemma":0.0017758327,"threshold_uncertainty_score":0.12468392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527335,0.00056978775,0.27428502,0.00035627445,0.00014461897,0.00010180923,0.0004447279,0.0008454207,0.07051873],"genre_scores_gemma":[0.94396293,0.00018151145,0.043465275,0.00018142925,0.000076884346,0.000062665,0.00066526973,0.00015627328,0.011247761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986706,0.00015392338,0.0000803183,0.00031557825,0.00033054914,0.00044893284],"domain_scores_gemma":[0.99703324,0.00066974416,0.0005380101,0.0007628492,0.0004874948,0.0005085855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057487574,0.0005067598,0.0006102502,0.0012961581,0.0017721605,0.002601793,0.0006215898,0.00051248743,0.0060563595],"category_scores_gemma":[0.0030212037,0.0005285048,0.0006662012,0.0011645677,0.0024398502,0.0030748667,0.0024240573,0.0008655261,0.0009545183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005488738,0.000090471935,0.012555576,0.00020697447,0.000058968595,0.001393988,0.0015012769,0.009920374,0.020013418,0.9087631,0.004655462,0.0402915],"study_design_scores_gemma":[0.000044714136,0.00029606643,0.012959731,0.00011164402,0.00007947649,0.0056935633,0.0024455318,0.0512206,0.021743903,0.8459391,0.05935194,0.000113730006],"about_ca_topic_score_codex":0.0013735325,"about_ca_topic_score_gemma":0.0010256403,"teacher_disagreement_score":0.0060563595,"about_ca_system_score_codex":0.0008403872,"about_ca_system_score_gemma":0.0005134984,"threshold_uncertainty_score":0.020260572},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36096972,0.0008337477,0.49246347,0.0012324037,0.00067906006,0.000373365,0.0009928672,0.0026212865,0.13983402],"genre_scores_gemma":[0.8057618,0.0004043616,0.1602629,0.0005625716,0.00009928264,0.0001928922,0.00082270417,0.00047428266,0.031419173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983577,0.00042430134,0.00011090973,0.00030692332,0.00033265224,0.0004674772],"domain_scores_gemma":[0.99741864,0.00097403873,0.00028534018,0.00078210025,0.0003036831,0.00023622306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009452565,0.0005835963,0.00045194323,0.0006929186,0.0016394781,0.0029202213,0.0009909893,0.0014680912,0.016229382],"category_scores_gemma":[0.005680507,0.00057619583,0.0006640415,0.00097494584,0.0012359157,0.0032596146,0.0035515085,0.0015468068,0.004071037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012153389,0.00030422516,0.002804691,0.00040143097,0.000105154,0.0024319403,0.0017708662,0.0124947205,0.03884155,0.75886804,0.019510467,0.16125156],"study_design_scores_gemma":[0.00011107724,0.00018715377,0.00048477878,0.00010642091,0.000068420435,0.0014749871,0.001073551,0.01832286,0.037609376,0.90054566,0.039960496,0.000055284836],"about_ca_topic_score_codex":0.00059631455,"about_ca_topic_score_gemma":0.0009917746,"teacher_disagreement_score":0.016229382,"about_ca_system_score_codex":0.0005666145,"about_ca_system_score_gemma":0.0008558558,"threshold_uncertainty_score":0.05429274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026443198,0.00016237622,0.9548476,0.00027540824,0.00030117083,0.0001125362,0.00008052661,0.0002045624,0.017572686],"genre_scores_gemma":[0.37819725,0.00065737526,0.6007127,0.00076586986,0.0003578373,0.00052484276,0.00028761837,0.00032018256,0.018176274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976114,0.0009977772,0.00015079419,0.00026074288,0.00069714594,0.0002821436],"domain_scores_gemma":[0.9969522,0.0011980424,0.000389341,0.00070315023,0.0005238277,0.00023339938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022978168,0.0013042222,0.000749664,0.0020143527,0.0011805091,0.0022758867,0.0008657257,0.0013856357,0.0056278207],"category_scores_gemma":[0.0055900444,0.00076654984,0.001483382,0.0015788091,0.0022884237,0.0021834653,0.0031287814,0.0024851924,0.0016253586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060259536,0.000029587201,0.00012443487,0.000044635777,0.000013589834,0.00007028431,0.00010506955,0.0023679223,0.004943988,0.9741416,0.0007851426,0.017313596],"study_design_scores_gemma":[0.000068799025,0.00017861642,0.00012930635,0.00006534224,0.000038458318,0.00031099873,0.000096475305,0.030060865,0.009838558,0.94755065,0.0116031505,0.000058802045],"about_ca_topic_score_codex":0.00020428414,"about_ca_topic_score_gemma":0.0004167437,"teacher_disagreement_score":0.0056278207,"about_ca_system_score_codex":0.0008033962,"about_ca_system_score_gemma":0.00095621776,"threshold_uncertainty_score":0.018826902},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25866914,0.0007482055,0.3992651,0.0016887914,0.00034248547,0.00029651469,0.0020422894,0.001111789,0.33583567],"genre_scores_gemma":[0.74700737,0.00071783614,0.110141404,0.00084393146,0.00012208038,0.00028644837,0.0024065846,0.0005650789,0.13790934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.00006710412,0.000015218522,0.000077579934,0.000068156565,0.000108201086],"domain_scores_gemma":[0.99914145,0.00022800511,0.000118254444,0.00017060322,0.0001599008,0.00018178101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770667,0.000388124,0.0002825368,0.0017084081,0.0013063854,0.0017329578,0.000602295,0.00056530803,0.018778205],"category_scores_gemma":[0.0011924634,0.00028225142,0.00051366875,0.00068160193,0.0010318102,0.0020687743,0.0014257188,0.001099928,0.0028203789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012299816,0.00008384826,0.00077705947,0.00009564409,0.000018136674,0.00024743826,0.00045344653,0.0028411432,0.004553081,0.95681244,0.0079796845,0.026015144],"study_design_scores_gemma":[0.000020134534,0.000016604568,0.0010765063,0.000062322186,0.000016122167,0.00026919137,0.0004171712,0.01294464,0.0019477317,0.9592451,0.023968732,0.000015801563],"about_ca_topic_score_codex":0.001712749,"about_ca_topic_score_gemma":0.0036116724,"teacher_disagreement_score":0.018778205,"about_ca_system_score_codex":0.0009743473,"about_ca_system_score_gemma":0.0005255109,"threshold_uncertainty_score":0.06281936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25105274,0.0003703394,0.72152495,0.0005476358,0.00009910025,0.00014393819,0.00048033235,0.00026531456,0.025515655],"genre_scores_gemma":[0.8988475,0.00025128675,0.091481246,0.00020571287,0.00013529866,0.00016323557,0.00035448774,0.00011406097,0.008447055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983209,0.00032379726,0.00009059272,0.0004986767,0.00035473309,0.00041130002],"domain_scores_gemma":[0.99561846,0.0016632391,0.00063180027,0.0011115428,0.00051643647,0.00045857308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935182,0.000511303,0.00063549826,0.0007968427,0.0016532888,0.0015745964,0.0006347516,0.0007746085,0.0064835134],"category_scores_gemma":[0.00659147,0.0004065049,0.00101714,0.0006892591,0.003243109,0.0038020352,0.0018820703,0.0013862678,0.0005784801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012123717,0.00004104795,0.0012411288,0.000054097844,0.000021897105,0.0001682876,0.0005006825,0.015248212,0.003407223,0.9669274,0.0014808355,0.01078799],"study_design_scores_gemma":[0.000028399072,0.0000715607,0.0006573214,0.000030475807,0.000020147736,0.00022340243,0.00029357767,0.05517584,0.0020805462,0.9358367,0.005551791,0.000030219298],"about_ca_topic_score_codex":0.0015926955,"about_ca_topic_score_gemma":0.001698639,"teacher_disagreement_score":0.0064835134,"about_ca_system_score_codex":0.0008930988,"about_ca_system_score_gemma":0.0007464083,"threshold_uncertainty_score":0.021689534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7396027,0.0004383281,0.18322067,0.0004278991,0.00015723586,0.000051092007,0.00016971766,0.00017104174,0.07576135],"genre_scores_gemma":[0.96295047,0.00016341142,0.02925302,0.00008121299,0.00006098277,0.000051478164,0.00012470252,0.000042486772,0.00727227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995522,0.00008199265,0.00002439718,0.000107694286,0.00014258496,0.0000909882],"domain_scores_gemma":[0.9994185,0.00022285931,0.000092598806,0.00012385489,0.00007642684,0.00006585811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032153432,0.00026365728,0.0003237024,0.00085658603,0.0008220217,0.0012792764,0.0007150941,0.0004201913,0.0066506322],"category_scores_gemma":[0.0014888537,0.00020181842,0.00029839482,0.0007814107,0.0015764371,0.002218881,0.0013980696,0.0007645167,0.0005121263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067483794,0.000018521956,0.00044623206,0.000027029411,0.000004896469,0.00009880265,0.0001574069,0.003608931,0.0075874464,0.97943044,0.00030263583,0.008250103],"study_design_scores_gemma":[0.00004567682,0.00014995491,0.00063532306,0.000024368826,0.000016195314,0.00044925822,0.0004329297,0.066924624,0.02157867,0.89704406,0.012667925,0.000031160474],"about_ca_topic_score_codex":0.00031754302,"about_ca_topic_score_gemma":0.00027000895,"teacher_disagreement_score":0.0066506322,"about_ca_system_score_codex":0.00060380343,"about_ca_system_score_gemma":0.00021455424,"threshold_uncertainty_score":0.022248566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28169513,0.0026826903,0.39218852,0.0021418482,0.001340707,0.00008882693,0.00060037285,0.00062737527,0.31863454],"genre_scores_gemma":[0.9296887,0.00096394605,0.02643278,0.0005831193,0.0004201535,0.000070571805,0.0002733174,0.0002041319,0.04136326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940574,0.00018951914,0.000021746479,0.00008906716,0.00018522817,0.000108625034],"domain_scores_gemma":[0.99852556,0.00062051817,0.00018042822,0.00023983618,0.00025467324,0.00017894593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004170644,0.000534778,0.0005083518,0.0015540835,0.0005606445,0.0017523133,0.0007296945,0.0008502594,0.013789359],"category_scores_gemma":[0.0043096226,0.0003506904,0.00033749564,0.00091748656,0.0016872574,0.0022685532,0.001109355,0.0013304726,0.0024767395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023712922,0.000015974885,0.00018430247,0.000029598134,0.0000043292894,0.00007040489,0.00006038998,0.0030191045,0.0014116946,0.98409283,0.0028619017,0.008225771],"study_design_scores_gemma":[0.000012818437,0.000028157336,0.0003473336,0.000031852323,0.0000065884437,0.0003064478,0.000092390146,0.03801325,0.0013064306,0.95170796,0.008124048,0.000022675495],"about_ca_topic_score_codex":0.0006202979,"about_ca_topic_score_gemma":0.0009156971,"teacher_disagreement_score":0.013789359,"about_ca_system_score_codex":0.00065947225,"about_ca_system_score_gemma":0.00053855946,"threshold_uncertainty_score":0.04613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04618759,0.0003519231,0.6873844,0.0015574492,0.0008173983,0.00027345246,0.0035412442,0.0018044729,0.25808206],"genre_scores_gemma":[0.6058597,0.0004143117,0.15040657,0.0011267859,0.00039009997,0.0006053542,0.0044674864,0.0027086341,0.23402105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994223,0.00010384094,0.000023448732,0.00010312592,0.00014489966,0.00020240141],"domain_scores_gemma":[0.99923515,0.00012061031,0.000056360856,0.00022852024,0.00021818181,0.00014121902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000624226,0.00072714937,0.00049536827,0.0010161003,0.0015109206,0.0025226597,0.0010029748,0.0008529985,0.09561567],"category_scores_gemma":[0.0022899082,0.00033264648,0.0008632512,0.0006026806,0.0016153313,0.0030853285,0.0018634036,0.0013837242,0.012875123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007774983,0.000048231235,0.00025606487,0.000052969273,0.000011926744,0.00011155027,0.00019721186,0.0056581954,0.0010901787,0.9571131,0.021319142,0.014063659],"study_design_scores_gemma":[0.000032956446,0.000028536882,0.00032219812,0.000027477774,0.000009289172,0.000056435012,0.00019097164,0.026285555,0.0010524126,0.9493681,0.022603203,0.000022891334],"about_ca_topic_score_codex":0.0027927388,"about_ca_topic_score_gemma":0.004769307,"teacher_disagreement_score":0.09561567,"about_ca_system_score_codex":0.0011219339,"about_ca_system_score_gemma":0.00112642,"threshold_uncertainty_score":0.3198663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5788799,0.0011272897,0.15099658,0.0028497782,0.00042978383,0.000092740396,0.0005410454,0.00033831754,0.26474458],"genre_scores_gemma":[0.9738748,0.00045747758,0.010530005,0.00034415047,0.00021671604,0.000030862117,0.00019922442,0.000068848145,0.014277809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945694,0.00017252141,0.000019203611,0.000078496596,0.00013615705,0.0001366988],"domain_scores_gemma":[0.9978963,0.0009984245,0.00033037193,0.0003045172,0.0002055893,0.00026481095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065268995,0.0005272884,0.00046883887,0.0017397245,0.0014050143,0.0019959707,0.0007287359,0.0011073785,0.009415168],"category_scores_gemma":[0.0025939508,0.00034632112,0.00053459476,0.00089260197,0.0028205402,0.0034872552,0.0012222781,0.0016658248,0.00082075835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017239512,0.0000100239695,0.00010055762,0.000014366973,0.000001924009,0.000093859795,0.000090836365,0.00083331775,0.0004608773,0.99557436,0.00085343205,0.0019493438],"study_design_scores_gemma":[0.000008038387,0.000006840971,0.00015537937,0.000009854738,0.0000024282497,0.00012752072,0.000067262496,0.0053539057,0.00023866988,0.9927055,0.0013183858,0.000006174287],"about_ca_topic_score_codex":0.0015924954,"about_ca_topic_score_gemma":0.0024197558,"teacher_disagreement_score":0.009415168,"about_ca_system_score_codex":0.0010551709,"about_ca_system_score_gemma":0.000605666,"threshold_uncertainty_score":0.031496942},"labels":[],"label_agreement":null},{"id":"W2761333931","doi":"10.1002/jcd.21586","title":"On the Hamilton–Waterloo problem with odd cycle lengths","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Lexicographical order; Graph; Graph factorization; Complete graph; Factorization; Hamiltonian path; Discrete mathematics; Line graph; Graph power; Algorithm","score_opus":0.01419316015051537,"score_gpt":0.21104339872923655,"score_spread":0.1968502385787212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761333931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56770915,0.001885866,0.33403882,0.0048844926,0.00029572807,0.00048685804,0.0019855748,0.00044583564,0.08826768],"genre_scores_gemma":[0.8574541,0.0015770172,0.117927045,0.0007847427,0.00029497434,0.00030514665,0.0015619665,0.00016466531,0.019930262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990963,0.00029271346,0.00003999276,0.00016946222,0.00013012561,0.00027132384],"domain_scores_gemma":[0.99675316,0.0022404613,0.00029094727,0.00024405096,0.00021040655,0.0002608925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009345285,0.0007295499,0.00086571,0.0007365065,0.0013137946,0.0018180297,0.001148284,0.0014759108,0.0113195265],"category_scores_gemma":[0.0058303815,0.00053316,0.00059444766,0.0010074438,0.0013180018,0.004267904,0.0014403057,0.001327796,0.0009385782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081650005,0.00027048477,0.0016075103,0.0005029711,0.00007481476,0.00065067824,0.00063011254,0.11339103,0.0056566396,0.77701926,0.027879925,0.07150008],"study_design_scores_gemma":[0.000150731,0.00010680154,0.00041756115,0.00008776747,0.000029314791,0.00021588293,0.00035563728,0.16082509,0.0019678397,0.8263129,0.0094818,0.00004867951],"about_ca_topic_score_codex":0.0065449644,"about_ca_topic_score_gemma":0.0068383254,"teacher_disagreement_score":0.0113195265,"about_ca_system_score_codex":0.0014459712,"about_ca_system_score_gemma":0.0013950432,"threshold_uncertainty_score":0.037867546},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75198174,0.0005384818,0.187416,0.0004928858,0.00029698905,0.00010923782,0.00021046225,0.00040414126,0.058550082],"genre_scores_gemma":[0.9480606,0.00017417438,0.046442088,0.00007746704,0.000031757074,0.00003929494,0.00011570394,0.00005077225,0.0050082034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996679,0.00009768541,0.000016621974,0.000036969333,0.000108691245,0.00007226339],"domain_scores_gemma":[0.99946743,0.00019787622,0.00008675534,0.00011408299,0.00007363104,0.00006020478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035714576,0.00033840406,0.00038434155,0.0011904219,0.00076855836,0.00093239034,0.00043129854,0.00047200447,0.003691283],"category_scores_gemma":[0.0012149891,0.0002996869,0.00046529248,0.0005413701,0.00096719,0.0006622485,0.0006127832,0.000913811,0.00052820495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001539988,0.00006322365,0.0011901332,0.00014967084,0.000024581086,0.00090932683,0.0005752987,0.0087974,0.054357193,0.89861,0.002261751,0.03290737],"study_design_scores_gemma":[0.000098719276,0.00047229958,0.002081523,0.00011548983,0.000041664374,0.0019695382,0.0007796795,0.10628185,0.19002071,0.6616143,0.036358412,0.00016585033],"about_ca_topic_score_codex":0.00032195242,"about_ca_topic_score_gemma":0.0004150775,"teacher_disagreement_score":0.003691283,"about_ca_system_score_codex":0.000445793,"about_ca_system_score_gemma":0.0005347976,"threshold_uncertainty_score":0.012348592},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.226473,0.0010679351,0.30956963,0.0010158729,0.00060472556,0.00023429998,0.0031871316,0.0016334803,0.45621392],"genre_scores_gemma":[0.84451026,0.0008108402,0.05509217,0.0006272557,0.00032077337,0.00026912751,0.0023613523,0.0005326898,0.09547562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987445,0.00018874284,0.00010185068,0.00023680767,0.0004449915,0.00028314098],"domain_scores_gemma":[0.99735606,0.0007577844,0.00026238238,0.000657077,0.0005219368,0.00044472184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062033953,0.00065407826,0.0008459335,0.0029198464,0.0027371112,0.004993158,0.0010468333,0.00118687,0.028675478],"category_scores_gemma":[0.0039349007,0.00055963255,0.00081248616,0.0018904436,0.0012788263,0.0050803,0.003085255,0.0014034222,0.007044024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009552596,0.000051958614,0.00055904256,0.00009472943,0.000020741438,0.00021492134,0.00033353048,0.000953689,0.0034533788,0.9643574,0.008169561,0.021695523],"study_design_scores_gemma":[0.00002135927,0.000031209987,0.0006236078,0.000046603705,0.000025217125,0.0005907655,0.00022153085,0.0061220876,0.0032940612,0.95363975,0.035356354,0.000027392021],"about_ca_topic_score_codex":0.00069215836,"about_ca_topic_score_gemma":0.0008796728,"teacher_disagreement_score":0.028675478,"about_ca_system_score_codex":0.0010151515,"about_ca_system_score_gemma":0.00055080507,"threshold_uncertainty_score":0.09592897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0806046,0.0025250183,0.41501996,0.008898988,0.0016074348,0.00012528633,0.0013537277,0.00053472765,0.48933035],"genre_scores_gemma":[0.77413034,0.004563248,0.07047098,0.006008275,0.0029340596,0.00051519944,0.0020089762,0.0010047606,0.13836424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990785,0.00016275719,0.000039195314,0.00032399414,0.00023683629,0.00015866096],"domain_scores_gemma":[0.9980556,0.0009204155,0.00017935518,0.00039943273,0.00027294699,0.00017230975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053133036,0.00088477193,0.0014691848,0.0013401436,0.0019694187,0.0035925491,0.0010652661,0.0019474224,0.020338576],"category_scores_gemma":[0.004860973,0.00079239975,0.0010722725,0.0019508231,0.002570989,0.0074508227,0.0029888449,0.005510235,0.004162386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014637221,0.000013726892,0.00009407119,0.000038600298,0.0000080691225,0.000043411397,0.000064570995,0.00053649937,0.00048473073,0.9816782,0.0062483633,0.01077518],"study_design_scores_gemma":[0.0000049900877,0.000008363586,0.00013040956,0.000014984011,0.0000055637297,0.00016198744,0.00003161153,0.002906062,0.00042363556,0.9888205,0.0074854074,0.000006502029],"about_ca_topic_score_codex":0.00065969443,"about_ca_topic_score_gemma":0.0004274888,"teacher_disagreement_score":0.020338576,"about_ca_system_score_codex":0.0006325051,"about_ca_system_score_gemma":0.0006217613,"threshold_uncertainty_score":0.0680393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5510592,0.0018041662,0.24300765,0.0055081975,0.0008772902,0.00015599847,0.0012419836,0.00054903084,0.19579642],"genre_scores_gemma":[0.9748496,0.00037039554,0.0120027345,0.0004700522,0.0002992188,0.00011021509,0.00029638727,0.00009791615,0.011503553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986891,0.00028582275,0.00007731531,0.0003399451,0.00027308846,0.00033475648],"domain_scores_gemma":[0.99048257,0.005447869,0.0011064355,0.00082410616,0.0007651534,0.0013738429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951145,0.00048114336,0.00060194754,0.0021548644,0.0028611843,0.002856185,0.0009998935,0.0016017259,0.020745937],"category_scores_gemma":[0.010538634,0.00066061434,0.00080430775,0.0009709053,0.0039225235,0.005447166,0.0028803868,0.0027545122,0.0015852895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086713466,0.000026706432,0.00068610825,0.000063520965,0.000014810301,0.00011444563,0.00029944847,0.00091248757,0.0013901313,0.9902604,0.0028385003,0.003306753],"study_design_scores_gemma":[0.000021425958,0.000019293379,0.0006210769,0.000029737408,0.000010693701,0.00023217799,0.00017699442,0.005610219,0.0005364953,0.9900653,0.0026555937,0.000021125848],"about_ca_topic_score_codex":0.0013701381,"about_ca_topic_score_gemma":0.0011831175,"teacher_disagreement_score":0.020745937,"about_ca_system_score_codex":0.000929842,"about_ca_system_score_gemma":0.00068612664,"threshold_uncertainty_score":0.06940204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18962869,0.0008815377,0.5542721,0.0012221436,0.001413258,0.00022520407,0.001260197,0.001282505,0.24981442],"genre_scores_gemma":[0.80450636,0.0006996257,0.111029066,0.00037501854,0.00023936712,0.00017030488,0.00091494387,0.0003596856,0.08170557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.00017715574,0.00004468132,0.00030896158,0.00018550896,0.00022163654],"domain_scores_gemma":[0.99813014,0.0006328839,0.00027134366,0.00038520238,0.0002908753,0.00028957883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448457,0.000456307,0.00046681068,0.0018519008,0.0025497454,0.002083757,0.00088915654,0.0014171773,0.030267335],"category_scores_gemma":[0.0040643103,0.00051569537,0.0006237568,0.001461927,0.0015576518,0.004496326,0.0038241092,0.0021026353,0.004557011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016185222,0.000036366648,0.0006383361,0.000099058925,0.00002722827,0.00066307746,0.00038599363,0.0012861321,0.005137468,0.9668114,0.004656625,0.020096505],"study_design_scores_gemma":[0.00003660744,0.00009326193,0.0008707559,0.000098128905,0.00004837512,0.0011768513,0.00055477343,0.010184391,0.0065817335,0.9328126,0.047494974,0.000047603018],"about_ca_topic_score_codex":0.0009898692,"about_ca_topic_score_gemma":0.0015918964,"teacher_disagreement_score":0.030267335,"about_ca_system_score_codex":0.00085411075,"about_ca_system_score_gemma":0.00086094043,"threshold_uncertainty_score":0.101254284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1216164,0.00035949063,0.60360336,0.00087998935,0.00067250844,0.00032565446,0.0011822053,0.001352325,0.2700081],"genre_scores_gemma":[0.78395694,0.00033209653,0.16777265,0.00052120606,0.00009072004,0.00036681854,0.0018137917,0.00056261546,0.04458312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852234,0.00054743805,0.00007532929,0.00025640076,0.0003047995,0.00029361606],"domain_scores_gemma":[0.9981675,0.0006495623,0.00015526362,0.00044595383,0.00035991403,0.00022173628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000658399,0.0005955583,0.0004054721,0.0015456157,0.002161715,0.0030292904,0.0011509949,0.0011823869,0.020858977],"category_scores_gemma":[0.004825562,0.00068412506,0.00088624936,0.0012523434,0.0013321273,0.0032083292,0.003765603,0.0021282113,0.0034328832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051738476,0.000038517952,0.00020386823,0.000046134963,0.000010250566,0.00021750393,0.00031877265,0.00074063306,0.0019093318,0.9857034,0.002790209,0.007969629],"study_design_scores_gemma":[0.000022523624,0.000043625594,0.00035522485,0.00007690413,0.00003695743,0.00059778185,0.00049612403,0.0077786255,0.006045169,0.95303625,0.031483468,0.000027376593],"about_ca_topic_score_codex":0.0007401659,"about_ca_topic_score_gemma":0.001408448,"teacher_disagreement_score":0.020858977,"about_ca_system_score_codex":0.000845442,"about_ca_system_score_gemma":0.0006740768,"threshold_uncertainty_score":0.06978023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2631846,0.00143705,0.6620816,0.00064716366,0.0003568519,0.00022795014,0.0010197083,0.00043583222,0.07060921],"genre_scores_gemma":[0.7233858,0.0009617009,0.25164977,0.00039213526,0.00027596162,0.00017012903,0.0012320018,0.00014908111,0.02178345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983878,0.0002417459,0.00010704886,0.0006438423,0.00030907243,0.00031058292],"domain_scores_gemma":[0.99677926,0.0008360347,0.0004749842,0.00095711095,0.0005529002,0.00039973002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011490105,0.0007671144,0.0006262252,0.0007692406,0.001968419,0.001215521,0.0007109159,0.00049365155,0.0072910446],"category_scores_gemma":[0.0032311496,0.00051657745,0.0011164226,0.0006098502,0.0024601887,0.0045117647,0.0015608185,0.0017554021,0.0009476854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017758584,0.00004328051,0.00067023846,0.00011780928,0.000014126232,0.00022531746,0.0005228755,0.0051214057,0.0046024835,0.9627639,0.0020100682,0.023730906],"study_design_scores_gemma":[0.00003675742,0.00021232429,0.0008618526,0.00007023695,0.000028070392,0.0006802455,0.00031828388,0.01690061,0.0058085523,0.94886523,0.026162777,0.000055110842],"about_ca_topic_score_codex":0.0024466387,"about_ca_topic_score_gemma":0.003470529,"teacher_disagreement_score":0.0072910446,"about_ca_system_score_codex":0.0009611841,"about_ca_system_score_gemma":0.0008429262,"threshold_uncertainty_score":0.024390996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64117014,0.00030310234,0.029249223,0.0017052784,0.00032997696,0.00008326105,0.0014467417,0.00034416196,0.32536814],"genre_scores_gemma":[0.9700824,0.00017598682,0.004147586,0.00030686706,0.000085641295,0.00004252153,0.00094864244,0.00015614559,0.024054188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963415,0.000058046808,0.000009281406,0.000095680196,0.000070170296,0.00013265561],"domain_scores_gemma":[0.99911565,0.00031850752,0.0001464117,0.00011436293,0.0001172807,0.00018780782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035160378,0.0003261437,0.0002577979,0.0019180138,0.002287369,0.002800678,0.00070782716,0.00086289755,0.021670986],"category_scores_gemma":[0.0012633867,0.00017065801,0.0002895871,0.0008542357,0.0016522652,0.0016693933,0.0010276306,0.0013357832,0.0015797083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022572168,0.000071001356,0.0018809361,0.000047179743,0.0000102864005,0.00018421338,0.00041287858,0.001241351,0.0051722312,0.96409565,0.010241791,0.016416622],"study_design_scores_gemma":[0.00004564066,0.000050520855,0.00650797,0.000073673174,0.000018795556,0.00040873492,0.00071301195,0.01397241,0.0057921982,0.9357019,0.03667945,0.000035764642],"about_ca_topic_score_codex":0.0048012715,"about_ca_topic_score_gemma":0.0041384837,"teacher_disagreement_score":0.021670986,"about_ca_system_score_codex":0.0018245991,"about_ca_system_score_gemma":0.00075792,"threshold_uncertainty_score":0.07249671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61741143,0.00031202094,0.36646715,0.00020486325,0.000027307206,0.000051965668,0.0001681818,0.00013573239,0.0152213685],"genre_scores_gemma":[0.98930335,0.00010796247,0.0097106155,0.00003429181,0.000015296862,0.000020612626,0.000047075395,0.000009707935,0.000751125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972504,0.000042388256,0.00000696106,0.000033987595,0.00014754065,0.00004412783],"domain_scores_gemma":[0.99858654,0.00064334983,0.0003344375,0.00009357084,0.00026211527,0.00008006622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031157114,0.00041501856,0.0001872351,0.000795855,0.00038109097,0.00048237888,0.00041889033,0.00037181465,0.0006743409],"category_scores_gemma":[0.0016949631,0.00011875898,0.0000976637,0.00051625754,0.00083847065,0.00050897215,0.00036927266,0.0004941332,0.000118610275],"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.00018672184,0.00019701802,0.009023248,0.00012716008,0.000025938609,0.0005551152,0.00028241493,0.26854646,0.25741062,0.43722206,0.0007276713,0.02569556],"study_design_scores_gemma":[0.0000108069735,0.000105381674,0.0034247416,0.000017596101,0.000008062692,0.00052861817,0.0000669429,0.91222,0.039571665,0.042171266,0.0018398277,0.000035194873],"about_ca_topic_score_codex":0.0009858616,"about_ca_topic_score_gemma":0.0008147458,"teacher_disagreement_score":0.0009858616,"about_ca_system_score_codex":0.0006301822,"about_ca_system_score_gemma":0.00043507508,"threshold_uncertainty_score":0.004572332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.436975,0.00064423314,0.4817155,0.0015183022,0.00036616705,0.000111530215,0.0007395487,0.0006174878,0.07731225],"genre_scores_gemma":[0.9373558,0.00041412632,0.04410408,0.0002928048,0.00025589796,0.00007382311,0.00043887645,0.00013047185,0.016934143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999527,0.00009066715,0.000018732308,0.000090756424,0.00016706278,0.00010580177],"domain_scores_gemma":[0.9986999,0.00055438594,0.00018905506,0.00012250172,0.00018659714,0.0002475332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033475854,0.00053145597,0.00040781524,0.0008979107,0.00086094625,0.0016083346,0.00062730676,0.00062447827,0.009125547],"category_scores_gemma":[0.0030046972,0.00028871238,0.00027109543,0.00096258527,0.0010724514,0.001603138,0.001427814,0.001728092,0.0013482351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013763463,0.000043869884,0.0002959844,0.00006925741,0.000007619293,0.00013882568,0.00038333153,0.0041373526,0.0067436537,0.9604023,0.0036508557,0.023989266],"study_design_scores_gemma":[0.00003620732,0.000066505396,0.0004686362,0.000018411274,0.0000075784083,0.00018934243,0.00015056171,0.017873172,0.0032929797,0.97124535,0.006623389,0.000028016872],"about_ca_topic_score_codex":0.00058517617,"about_ca_topic_score_gemma":0.0008485197,"teacher_disagreement_score":0.009125547,"about_ca_system_score_codex":0.0006978432,"about_ca_system_score_gemma":0.0005729557,"threshold_uncertainty_score":0.030528069},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15554668,0.0011666334,0.77264065,0.0005528054,0.00022539234,0.00011252579,0.0006102261,0.0005634338,0.0685817],"genre_scores_gemma":[0.78806466,0.0013025698,0.1773912,0.0003640135,0.0003481427,0.00012777284,0.0009315032,0.0003324029,0.03113777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987723,0.00037028993,0.000066005734,0.00034814738,0.00020339867,0.00023985635],"domain_scores_gemma":[0.99672925,0.0014592742,0.00029640654,0.0007590141,0.00043782615,0.0003181701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013137726,0.0007693824,0.0008591286,0.0018905352,0.001652373,0.002708047,0.0008658152,0.00062237674,0.010198373],"category_scores_gemma":[0.0045475666,0.00069619284,0.0011917226,0.0018662197,0.002137533,0.0058616246,0.002387198,0.0017458335,0.0011697421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065309185,0.00003271798,0.0002638343,0.00006222308,0.000013260358,0.00010314209,0.0004559431,0.0043307263,0.0015868663,0.9735339,0.0016239069,0.017928064],"study_design_scores_gemma":[0.00001216323,0.000016280657,0.0001594325,0.000028739463,0.000013761836,0.000077441306,0.0001091632,0.009909109,0.00067804864,0.9814834,0.007500589,0.000011890538],"about_ca_topic_score_codex":0.0025021918,"about_ca_topic_score_gemma":0.0030041216,"teacher_disagreement_score":0.010198373,"about_ca_system_score_codex":0.0012970793,"about_ca_system_score_gemma":0.00057589414,"threshold_uncertainty_score":0.034116983},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8220072,0.0014712315,0.13348962,0.0005285075,0.000085280524,0.000076036195,0.0008744134,0.0008558736,0.040611856],"genre_scores_gemma":[0.9426722,0.0007796218,0.041181616,0.0001977587,0.00016002714,0.00017498425,0.001411605,0.0002845353,0.013137551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989122,0.00017135727,0.000055004934,0.00025153413,0.00031245087,0.00029741402],"domain_scores_gemma":[0.9954218,0.0022602193,0.00072649546,0.00083173567,0.00041912094,0.0003405754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042144852,0.00056775654,0.00057840836,0.0010957385,0.0010646929,0.001442348,0.0006035569,0.0005533598,0.007960609],"category_scores_gemma":[0.0046278834,0.00080333534,0.00088589016,0.0008626484,0.0015696767,0.0025182385,0.001989488,0.00085911836,0.0011951665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016392185,0.00015815084,0.015675513,0.0008126151,0.00019692931,0.0017238568,0.0020712921,0.09360306,0.11564331,0.6151155,0.010227984,0.14313252],"study_design_scores_gemma":[0.00019113751,0.0011185561,0.01307651,0.00020620292,0.00014591735,0.0043119635,0.0012297934,0.23780084,0.055465046,0.63168335,0.054637324,0.00013341894],"about_ca_topic_score_codex":0.0014069518,"about_ca_topic_score_gemma":0.0017740383,"teacher_disagreement_score":0.007960609,"about_ca_system_score_codex":0.0008758611,"about_ca_system_score_gemma":0.00043790884,"threshold_uncertainty_score":0.026630938},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08788699,0.0029897392,0.87119764,0.0015917942,0.0014966648,0.00007187177,0.0007284638,0.0009503859,0.033086445],"genre_scores_gemma":[0.78179646,0.003472552,0.15237273,0.0012594783,0.0017888542,0.00013314578,0.0011856813,0.00071595295,0.05727516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983436,0.00036940418,0.00010356427,0.00059742405,0.00047265968,0.00011332625],"domain_scores_gemma":[0.99692804,0.0012911574,0.00043676357,0.0005421276,0.0006529915,0.0001488941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953484,0.0013604998,0.0011261775,0.0019314812,0.001330154,0.002367751,0.0008836536,0.001293806,0.0068671103],"category_scores_gemma":[0.0036160152,0.0005391013,0.0005142427,0.0021344998,0.0024104053,0.0034919127,0.0014664612,0.002551836,0.002558116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001432401,0.00012378536,0.0010522061,0.0005524948,0.00013989046,0.0011270517,0.0005740299,0.009303965,0.026016152,0.8544014,0.010877566,0.095688224],"study_design_scores_gemma":[0.00000954206,0.000065553635,0.0006693483,0.000033972603,0.000037020538,0.00090698426,0.00018770482,0.032390505,0.0130451815,0.9241479,0.028448692,0.000057623856],"about_ca_topic_score_codex":0.00038156845,"about_ca_topic_score_gemma":0.00042883528,"teacher_disagreement_score":0.0068671103,"about_ca_system_score_codex":0.0003674088,"about_ca_system_score_gemma":0.00036667957,"threshold_uncertainty_score":0.022972763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40906018,0.0031434577,0.404701,0.01749382,0.00087926607,0.0003298737,0.001945532,0.00041558925,0.16203126],"genre_scores_gemma":[0.8379873,0.0025260116,0.09898106,0.0020936995,0.0011787696,0.0004024863,0.0016018574,0.00041646266,0.054812364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987563,0.00044414058,0.000043452328,0.00027917387,0.00021846838,0.00025848852],"domain_scores_gemma":[0.9928999,0.005379526,0.0005329927,0.000440751,0.00033913652,0.00040770386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014443053,0.0012989653,0.0017018798,0.0014071722,0.0021612048,0.0033925213,0.002900972,0.0040534004,0.017449204],"category_scores_gemma":[0.013030311,0.0009376625,0.0008608707,0.0026381176,0.0032535673,0.0066826167,0.0027375487,0.0038573823,0.0011408493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017632903,0.00009274923,0.00034978386,0.000186657,0.000035196288,0.00016075147,0.00023180022,0.03543029,0.00076641294,0.93452096,0.01137865,0.01667029],"study_design_scores_gemma":[0.000047582642,0.000013923666,0.00008757866,0.00002129599,0.000009041228,0.000030393583,0.00007608066,0.051503047,0.00018197548,0.9462128,0.001800867,0.000015523228],"about_ca_topic_score_codex":0.0072007556,"about_ca_topic_score_gemma":0.0065756245,"teacher_disagreement_score":0.017449204,"about_ca_system_score_codex":0.0027975354,"about_ca_system_score_gemma":0.0024201665,"threshold_uncertainty_score":0.05837339},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30868587,0.0012725516,0.3635388,0.0024106458,0.00058313884,0.0001712273,0.0018406704,0.0008273235,0.32066974],"genre_scores_gemma":[0.8220384,0.0007643282,0.08070914,0.0008076673,0.00017244807,0.00016229732,0.0011245402,0.00023794633,0.09398319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973446,0.00007033452,0.0000111686095,0.00005498992,0.00006631463,0.000062715895],"domain_scores_gemma":[0.9996117,0.000113731396,0.000048545386,0.000064190746,0.00008551777,0.000076319455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016604512,0.0003225684,0.00035894854,0.00094958977,0.00099618,0.0017760188,0.00083810074,0.0006532522,0.017085085],"category_scores_gemma":[0.000714256,0.00026838688,0.00034364613,0.0008569664,0.0009609497,0.0016759479,0.0012655647,0.0009485508,0.0027863295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006581455,0.00002320293,0.000260724,0.000057603822,0.000013673406,0.00023140581,0.00013063746,0.0054504434,0.0037870014,0.9722812,0.0063900747,0.011308093],"study_design_scores_gemma":[0.000028754721,0.00003068687,0.000527762,0.000035471905,0.000018960232,0.00039536296,0.00032825788,0.046310946,0.0030701305,0.9211961,0.028033534,0.0000241155],"about_ca_topic_score_codex":0.0028496722,"about_ca_topic_score_gemma":0.003539433,"teacher_disagreement_score":0.017085085,"about_ca_system_score_codex":0.0008504409,"about_ca_system_score_gemma":0.0005023111,"threshold_uncertainty_score":0.05715525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7257142,0.00057747506,0.16824228,0.0007267634,0.00042641987,0.00022561224,0.00055863324,0.00083140115,0.10269723],"genre_scores_gemma":[0.94460404,0.00014091478,0.041983265,0.0002090619,0.00005349736,0.00007786612,0.0002128797,0.000060999602,0.012657489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993197,0.00019957028,0.000056182726,0.00011831074,0.00017461865,0.00013156995],"domain_scores_gemma":[0.999102,0.00021721004,0.00020749486,0.00018560418,0.00016115377,0.0001265777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051002693,0.0004781263,0.0003570193,0.0007031163,0.0011135462,0.0017798819,0.0005077631,0.0011551473,0.009775786],"category_scores_gemma":[0.0014062171,0.0003792336,0.0005639876,0.0005695234,0.0011118498,0.0011710866,0.0009380401,0.0005384512,0.0021309573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084223493,0.00013405862,0.0028955697,0.0002627618,0.000084177525,0.0013892002,0.0005224611,0.005401715,0.047200046,0.9013122,0.0039060283,0.036049526],"study_design_scores_gemma":[0.00044577863,0.0007539601,0.0026787189,0.00016539112,0.0001471402,0.0024389375,0.0004984301,0.029730976,0.03872436,0.870848,0.05342861,0.0001395441],"about_ca_topic_score_codex":0.0004849348,"about_ca_topic_score_gemma":0.0011638929,"teacher_disagreement_score":0.009775786,"about_ca_system_score_codex":0.0005996476,"about_ca_system_score_gemma":0.00065263733,"threshold_uncertainty_score":0.03270328},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38766566,0.005613867,0.3750908,0.0064738085,0.0032911783,0.0001840488,0.0009593594,0.0012037515,0.21951756],"genre_scores_gemma":[0.83956057,0.0026837215,0.09002688,0.0015378575,0.0022727908,0.00033197214,0.00066511007,0.0006328773,0.062288262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986364,0.00029359446,0.00006626915,0.0002697493,0.0005372588,0.0001966406],"domain_scores_gemma":[0.9945972,0.0029708135,0.00065896806,0.0007577493,0.00054538494,0.00046981705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941008,0.0012024792,0.0009027025,0.0042146854,0.0019970739,0.004034932,0.0019801124,0.002837188,0.01034398],"category_scores_gemma":[0.011318054,0.0009428199,0.00066165585,0.0048946105,0.0036775426,0.005485296,0.0030576931,0.0044239485,0.0019647037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084012274,0.000025843603,0.00020422548,0.00005977343,0.0000063504062,0.00007903543,0.00015463882,0.0024581738,0.001357574,0.9763299,0.0032686784,0.015971802],"study_design_scores_gemma":[0.000018604705,0.000018371267,0.0001985526,0.000026675489,0.0000087739045,0.0001927439,0.00003949215,0.010526568,0.0010947934,0.9827063,0.005141063,0.0000280785],"about_ca_topic_score_codex":0.000636469,"about_ca_topic_score_gemma":0.00073891814,"teacher_disagreement_score":0.01034398,"about_ca_system_score_codex":0.0016491329,"about_ca_system_score_gemma":0.0006934574,"threshold_uncertainty_score":0.034604013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14201303,0.0009097466,0.62704825,0.0009023308,0.00049659866,0.00028862953,0.0037644906,0.0018845327,0.22269246],"genre_scores_gemma":[0.58337015,0.0010567366,0.351738,0.0008464057,0.0002469241,0.0005042209,0.0048381016,0.0005203045,0.056879137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.000108183005,0.000058755068,0.00018687162,0.00025582177,0.0001519396],"domain_scores_gemma":[0.9988925,0.00025229124,0.00012320989,0.0003715482,0.0002704917,0.00008994606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042412,0.00055057934,0.0005115009,0.0010310669,0.0015658514,0.0018869783,0.0008708482,0.0005584682,0.012900942],"category_scores_gemma":[0.0017850703,0.00040680415,0.00096280634,0.001853609,0.0015734499,0.0021459544,0.0020153231,0.0011104192,0.0028324677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014102078,0.000033544216,0.0013388831,0.00013281351,0.000018780636,0.0003343196,0.00021388264,0.011936112,0.009920173,0.881083,0.015038015,0.07980948],"study_design_scores_gemma":[0.000038161717,0.00016745405,0.001574641,0.000074972406,0.000031827465,0.0018384067,0.00038589854,0.057699576,0.02462175,0.6933617,0.22010723,0.000098386445],"about_ca_topic_score_codex":0.001930622,"about_ca_topic_score_gemma":0.0024509355,"teacher_disagreement_score":0.012900942,"about_ca_system_score_codex":0.0009064444,"about_ca_system_score_gemma":0.0010258699,"threshold_uncertainty_score":0.043157995},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19358586,0.002101262,0.38746586,0.0024073827,0.0005684792,0.00030142433,0.0028109092,0.0010617952,0.409697],"genre_scores_gemma":[0.7878567,0.001276979,0.09179065,0.0007831641,0.00019649688,0.00027876004,0.0023242799,0.00026546651,0.11522753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999226,0.00013440104,0.00005095541,0.000244641,0.00014913872,0.00019483696],"domain_scores_gemma":[0.9984016,0.00055545534,0.00026088025,0.00028652418,0.00029342968,0.00020216135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003299806,0.0006516373,0.00044177735,0.0016191115,0.0017986319,0.0029279846,0.0011015439,0.0011483671,0.026194016],"category_scores_gemma":[0.00277858,0.00037496662,0.0004974519,0.00157461,0.0012153966,0.0035673091,0.0024685466,0.0015060173,0.0031506708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012798267,0.000063419306,0.00087266567,0.0001655101,0.00002615787,0.0004733454,0.00021300999,0.0021297191,0.0025493668,0.9439129,0.008291055,0.04117478],"study_design_scores_gemma":[0.000018150049,0.00003336962,0.0008722341,0.000073870826,0.000021699183,0.00085019483,0.000292813,0.0058303312,0.0033014242,0.9422156,0.046469536,0.000020872916],"about_ca_topic_score_codex":0.0016785733,"about_ca_topic_score_gemma":0.0026393146,"teacher_disagreement_score":0.026194016,"about_ca_system_score_codex":0.0010801696,"about_ca_system_score_gemma":0.0008567387,"threshold_uncertainty_score":0.08762771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63942313,0.00080251385,0.1483655,0.0016199,0.0004286082,0.00011125529,0.0006538225,0.0005511642,0.20804416],"genre_scores_gemma":[0.96339095,0.00016974437,0.014633388,0.00015961054,0.000060499056,0.000047942565,0.00020678811,0.000037010916,0.021293994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993893,0.00020629373,0.000031793537,0.00007557134,0.0001278327,0.00016918487],"domain_scores_gemma":[0.9991211,0.00024756277,0.00022359566,0.00016421726,0.000117016454,0.00012653098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542373,0.00041283885,0.0002652189,0.00097255455,0.00097286695,0.0016391963,0.00052275445,0.0007197669,0.008475352],"category_scores_gemma":[0.0015047358,0.00026524597,0.00034384767,0.0006499463,0.0012251011,0.0015598848,0.0012154527,0.0006850359,0.0013246218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009131215,0.000026965703,0.00038651205,0.000036072328,0.000010282398,0.0002149343,0.00018366975,0.0021757658,0.0020588464,0.98492277,0.0020780684,0.007814641],"study_design_scores_gemma":[0.000051696006,0.00009333454,0.00059179653,0.00003700386,0.000016987842,0.000450593,0.00021960653,0.013997393,0.0030704048,0.9670456,0.014388968,0.00003655016],"about_ca_topic_score_codex":0.001086762,"about_ca_topic_score_gemma":0.0017405107,"teacher_disagreement_score":0.008475352,"about_ca_system_score_codex":0.00075865415,"about_ca_system_score_gemma":0.0006463052,"threshold_uncertainty_score":0.028352916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47368255,0.00031677764,0.34163606,0.0023281795,0.0022193643,0.00021568187,0.00041697395,0.0010490254,0.17813544],"genre_scores_gemma":[0.9258799,0.00020620068,0.041618664,0.00077952095,0.0004378811,0.0001342256,0.00027406105,0.0004603628,0.03020925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989856,0.0001679894,0.000081150814,0.00022578362,0.0003021941,0.0002373243],"domain_scores_gemma":[0.99765354,0.00049900345,0.000299295,0.0006040018,0.00047634292,0.0004678115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074503117,0.00059989135,0.0010004258,0.001665166,0.0015856994,0.0033484066,0.0007868284,0.0021161917,0.015128148],"category_scores_gemma":[0.0043109036,0.000509164,0.0007132697,0.0010898842,0.002512779,0.0036692165,0.002161888,0.0021879193,0.0023080024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008267056,0.000053129614,0.00036462295,0.000040112445,0.0000073133697,0.00032538353,0.00011855356,0.000712086,0.009976796,0.971246,0.0029883771,0.014084924],"study_design_scores_gemma":[0.0000548524,0.00008189103,0.0006298498,0.000028705852,0.0000116245465,0.000907537,0.00024454115,0.012417101,0.0055409954,0.9734508,0.0065763397,0.000055664525],"about_ca_topic_score_codex":0.00022159063,"about_ca_topic_score_gemma":0.00033283234,"teacher_disagreement_score":0.015128148,"about_ca_system_score_codex":0.00042463053,"about_ca_system_score_gemma":0.00074918335,"threshold_uncertainty_score":0.050608635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56443655,0.0011992609,0.1349527,0.0022024205,0.0008663487,0.00017419475,0.0015087933,0.0005572494,0.2941025],"genre_scores_gemma":[0.9042345,0.0005648587,0.027586501,0.00048540026,0.00023760417,0.00008181598,0.00096065784,0.000081544276,0.06576704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974066,0.00006165323,0.000011352634,0.00005642724,0.00007245007,0.00005743277],"domain_scores_gemma":[0.9991744,0.00024325094,0.00017194498,0.00010496902,0.00014913258,0.00015619036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019386053,0.00035274634,0.0002568029,0.001087978,0.000961681,0.0012481182,0.0005282754,0.00051671534,0.014151408],"category_scores_gemma":[0.0012271187,0.00020247452,0.0003008899,0.00059143576,0.0007996514,0.0012449536,0.0007899578,0.0007851237,0.0014034162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007148138,0.000033776167,0.00050376594,0.000051620224,0.000013303652,0.00034029732,0.00022002595,0.0023369722,0.0038921202,0.9751209,0.00422839,0.013187339],"study_design_scores_gemma":[0.000024374993,0.00004369456,0.0009482064,0.000028412314,0.000011914935,0.00037315048,0.00020228219,0.011456467,0.0026400534,0.9628756,0.021373942,0.000021852999],"about_ca_topic_score_codex":0.0018660714,"about_ca_topic_score_gemma":0.003631367,"teacher_disagreement_score":0.014151408,"about_ca_system_score_codex":0.0007749972,"about_ca_system_score_gemma":0.00070823095,"threshold_uncertainty_score":0.04734111},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3196812,0.00203428,0.38837957,0.0017654126,0.0007361567,0.00015279022,0.0005158426,0.00043637186,0.2862984],"genre_scores_gemma":[0.9255323,0.0006378466,0.024965845,0.00027281986,0.0002715381,0.00010148012,0.0002352231,0.000046095465,0.047937006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947697,0.0001616097,0.00003225727,0.000094187926,0.00014414443,0.00009074912],"domain_scores_gemma":[0.9989648,0.00033344037,0.00025473424,0.00017776927,0.00015120396,0.00011804719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042180845,0.00037046958,0.00031625322,0.0010437344,0.0009101393,0.0014557615,0.00036406264,0.00053748896,0.0094456],"category_scores_gemma":[0.001741181,0.00022395104,0.00036905814,0.000649432,0.0014642355,0.001756538,0.0009566512,0.0006488007,0.0012384652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018235836,0.000011595848,0.00014338754,0.000021797858,0.0000052513196,0.000058515452,0.00008034864,0.0008226551,0.00080928986,0.99290234,0.00090848666,0.004218134],"study_design_scores_gemma":[0.000014873298,0.000035083314,0.00018269251,0.000017310485,0.000008106162,0.00018276308,0.000095330055,0.006308087,0.00089163653,0.98058254,0.011672322,0.0000093915],"about_ca_topic_score_codex":0.00070024515,"about_ca_topic_score_gemma":0.0012612519,"teacher_disagreement_score":0.0094456,"about_ca_system_score_codex":0.00076005363,"about_ca_system_score_gemma":0.00066135573,"threshold_uncertainty_score":0.031598687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30410108,0.0010874483,0.4144507,0.0016579108,0.0006082901,0.000585089,0.0063515925,0.0021682375,0.26898968],"genre_scores_gemma":[0.7138084,0.0006633704,0.19290106,0.00061461277,0.00007878053,0.00038725935,0.0054258117,0.00052444125,0.085596226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996426,0.0000640428,0.000021937878,0.000091031325,0.00006657721,0.000113784605],"domain_scores_gemma":[0.99919134,0.00019702232,0.00012765986,0.00016063203,0.00014375802,0.00017952418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025712702,0.0005951322,0.0003033503,0.0016423388,0.0010868934,0.0014404155,0.0008454553,0.0006230512,0.024344502],"category_scores_gemma":[0.0011719447,0.00046397196,0.0006571728,0.0009062639,0.00057507795,0.0012512078,0.0012178852,0.0010942406,0.004555145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007044104,0.00033814294,0.0028742452,0.00062350376,0.00015529207,0.0016429416,0.0010350579,0.021590108,0.041864235,0.7782275,0.043017454,0.10792707],"study_design_scores_gemma":[0.00013460456,0.00012602082,0.0057341415,0.00035031885,0.000121952566,0.0015069266,0.001654158,0.053695824,0.015917253,0.8329215,0.087768406,0.000068879286],"about_ca_topic_score_codex":0.0020220561,"about_ca_topic_score_gemma":0.0035582243,"teacher_disagreement_score":0.024344502,"about_ca_system_score_codex":0.00090244494,"about_ca_system_score_gemma":0.00062077865,"threshold_uncertainty_score":0.08144051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15782088,0.0006270355,0.51726943,0.0022018075,0.0013782165,0.00025148882,0.0036071655,0.0035423236,0.31330162],"genre_scores_gemma":[0.6643408,0.0004840647,0.2520602,0.0011425562,0.00021573734,0.00032063757,0.0030469794,0.00083227275,0.07755674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00018944497,0.000043508557,0.0002163975,0.00020151527,0.00018414068],"domain_scores_gemma":[0.9985487,0.0004707976,0.00015721198,0.00041290597,0.00022248068,0.0001878232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000591177,0.00046064783,0.0004300593,0.0011026033,0.0021733276,0.002330415,0.0012261752,0.0012413007,0.026427323],"category_scores_gemma":[0.0025397385,0.00046112033,0.0007265516,0.0012736256,0.0012740793,0.0031519155,0.0018328242,0.0021954295,0.0039469213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095171476,0.000044887616,0.00036447728,0.00010184627,0.000015051854,0.000257075,0.00020680821,0.002619177,0.0029932216,0.9563788,0.016522875,0.020400552],"study_design_scores_gemma":[0.00002622153,0.0000342924,0.00044126713,0.000057573074,0.000022366774,0.00043469277,0.00032636942,0.014216199,0.0032904588,0.938331,0.042788506,0.000030993135],"about_ca_topic_score_codex":0.0019568102,"about_ca_topic_score_gemma":0.0032294497,"teacher_disagreement_score":0.026427323,"about_ca_system_score_codex":0.0012410969,"about_ca_system_score_gemma":0.0010415,"threshold_uncertainty_score":0.08840823},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32983539,0.00033973352,0.55467176,0.0010225492,0.00024158838,0.00023638684,0.00073638535,0.001069043,0.111847125],"genre_scores_gemma":[0.8514214,0.00022237028,0.11397058,0.0002191145,0.0000873138,0.0002498205,0.00042708326,0.00022265885,0.033179667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916303,0.00015539567,0.000049237184,0.00017916744,0.00016638324,0.00028687617],"domain_scores_gemma":[0.99943167,0.000117418196,0.00011020704,0.00012770665,0.00008875625,0.00012425262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007049731,0.0003874652,0.00041050697,0.00047592146,0.0011628384,0.002293577,0.0008147369,0.00052099355,0.011980227],"category_scores_gemma":[0.0011253061,0.00030527878,0.0007150999,0.0005597998,0.0021234541,0.00213483,0.0017094795,0.00097582315,0.002560257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002786809,0.000056406952,0.0006340589,0.00007749538,0.000011335636,0.0001922824,0.00030353808,0.005154322,0.008651099,0.9713281,0.0021197035,0.01119291],"study_design_scores_gemma":[0.00018155425,0.00062773307,0.00069821684,0.00007441122,0.000058589856,0.0008275423,0.0006976571,0.060664583,0.031419754,0.84914434,0.05551131,0.000094360286],"about_ca_topic_score_codex":0.000774699,"about_ca_topic_score_gemma":0.00078721874,"teacher_disagreement_score":0.011980227,"about_ca_system_score_codex":0.0013806557,"about_ca_system_score_gemma":0.00092574116,"threshold_uncertainty_score":0.040077865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007641029,0.005541281,0.017253328,0.0016811923,0.0025665003,0.000030800467,0.0001591226,0.00016668403,0.96496016],"genre_scores_gemma":[0.09334843,0.006490776,0.007962538,0.00093790446,0.002124886,0.00007414918,0.00031112667,0.00028758383,0.8884625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977356,0.000049740123,0.000008370257,0.00004216288,0.00009332074,0.000032840053],"domain_scores_gemma":[0.99986947,0.000032399763,0.00001107794,0.000030749645,0.000033734887,0.000022596216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018581851,0.00078772526,0.00039666615,0.0009855297,0.00081198855,0.001951369,0.0004700932,0.0005400481,0.033684645],"category_scores_gemma":[0.0006162026,0.00024571805,0.00022921104,0.0011009927,0.0011304079,0.002511492,0.000990774,0.0015665174,0.012400796],"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.000007976534,0.000013084203,0.000022679124,0.000041095187,0.0000023832988,0.000019821573,0.00016830863,0.00020700617,0.0005065385,0.9246914,0.033346605,0.04097309],"study_design_scores_gemma":[0.0000044970866,0.000011373501,0.00007774676,0.000033322558,0.0000034116176,0.00009191024,0.000082574305,0.00040034804,0.000338574,0.6477811,0.3511695,0.00000564329],"about_ca_topic_score_codex":0.00038435933,"about_ca_topic_score_gemma":0.0006806491,"teacher_disagreement_score":0.033684645,"about_ca_system_score_codex":0.0007689309,"about_ca_system_score_gemma":0.00053936755,"threshold_uncertainty_score":0.112686336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7676064,0.00039725765,0.10197258,0.0009938306,0.00012173293,0.0001531566,0.0010737219,0.0008153619,0.12686604],"genre_scores_gemma":[0.9802097,0.00023697341,0.012557622,0.0001483615,0.00003651343,0.00003619619,0.0002877012,0.000055816094,0.0064312345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997453,0.000032263968,0.0000117421605,0.00006391861,0.00008598851,0.000060646973],"domain_scores_gemma":[0.99851364,0.00068886054,0.00026867873,0.00019949434,0.00020563058,0.00012367232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017397475,0.00033566533,0.00021147604,0.00041899135,0.00062612345,0.0011726186,0.00027670898,0.00029521566,0.009987181],"category_scores_gemma":[0.00152844,0.00026484623,0.00028907432,0.00036911777,0.0011603915,0.001294209,0.00073970336,0.0007982361,0.0011474015],"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.0004523881,0.00012685148,0.0051442287,0.00048418026,0.0000574138,0.001312123,0.0019311832,0.008916907,0.061020203,0.8451776,0.009859486,0.06551748],"study_design_scores_gemma":[0.0001139248,0.00013981981,0.0028577559,0.000042960728,0.00004419348,0.0008877679,0.000570622,0.010407673,0.035260167,0.92282456,0.026809072,0.000041472795],"about_ca_topic_score_codex":0.0008142398,"about_ca_topic_score_gemma":0.0013770051,"teacher_disagreement_score":0.009987181,"about_ca_system_score_codex":0.0003766589,"about_ca_system_score_gemma":0.0005726811,"threshold_uncertainty_score":0.03341043},"labels":[],"label_agreement":null},{"id":"W2800602737","doi":"10.1002/jcd.21633","title":"Strong Skolem starters","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Interpretation (philosophy); Construct (python library); Class (philosophy); Mathematics; Combinatorics; Computer science; Artificial intelligence; Programming language","score_opus":0.023758266210428234,"score_gpt":0.23985008275366695,"score_spread":0.21609181654323872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800602737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6155508,0.0006062795,0.29725856,0.0004496723,0.00019726009,0.00011499694,0.00042345535,0.000836933,0.08456209],"genre_scores_gemma":[0.92846334,0.00021406922,0.0401499,0.00020080621,0.00011938188,0.00010222469,0.0004991031,0.00015012293,0.030101005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993192,0.00014397097,0.000041501262,0.00018025917,0.00018430947,0.00013082703],"domain_scores_gemma":[0.9980817,0.00071072247,0.00031093127,0.00032571334,0.00034279897,0.00022823097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053573895,0.00047989175,0.0005040214,0.001561979,0.0011638092,0.0016525066,0.0005761629,0.0007695818,0.01040689],"category_scores_gemma":[0.0018864953,0.00032220542,0.0005917061,0.0006570948,0.0020136626,0.0024065548,0.0016195371,0.0012814538,0.0025959897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012451988,0.000035682446,0.0010261635,0.00007353577,0.0000133277335,0.00035629777,0.00033511914,0.002189492,0.0078450795,0.9776522,0.0011976403,0.009150894],"study_design_scores_gemma":[0.000039881153,0.00020979755,0.00085651584,0.000071684415,0.00002707178,0.0008897025,0.00039089817,0.013532877,0.015518338,0.94169015,0.026721992,0.000051032563],"about_ca_topic_score_codex":0.00011951604,"about_ca_topic_score_gemma":0.00018532203,"teacher_disagreement_score":0.01040689,"about_ca_system_score_codex":0.0004473003,"about_ca_system_score_gemma":0.00028442437,"threshold_uncertainty_score":0.034814477},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9419614,0.00094992464,0.036796276,0.00052441115,0.00003907157,0.000018175879,0.00021511223,0.00011457803,0.019380966],"genre_scores_gemma":[0.9899093,0.00050975085,0.007060404,0.000059249967,0.000030518855,0.000024431221,0.00016382549,0.000037410744,0.0022050722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997036,0.00006428118,0.000012957861,0.00007824285,0.00006235155,0.00007857403],"domain_scores_gemma":[0.99916756,0.00038063616,0.00017189216,0.000110057146,0.00006263198,0.0001071944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024604768,0.00038269482,0.00032792427,0.0010441119,0.00082425866,0.0011590911,0.00052574766,0.0005546871,0.0025824304],"category_scores_gemma":[0.0019229605,0.00036392457,0.00039907705,0.0005954096,0.0015363065,0.0021866218,0.001198472,0.00079356274,0.00029022034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005887355,0.000071300994,0.020308461,0.0004472065,0.00008872155,0.00078911835,0.002159987,0.055341024,0.046613608,0.78449214,0.005033434,0.08406631],"study_design_scores_gemma":[0.00004178486,0.00014628451,0.02014076,0.00016940356,0.00008946637,0.0010896735,0.0013792122,0.098105595,0.023004685,0.8364218,0.01934372,0.000067515175],"about_ca_topic_score_codex":0.000722013,"about_ca_topic_score_gemma":0.00088711706,"teacher_disagreement_score":0.0025824304,"about_ca_system_score_codex":0.0008905373,"about_ca_system_score_gemma":0.00019488132,"threshold_uncertainty_score":0.008639097},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07615006,0.0031344779,0.595952,0.0025671595,0.0016880046,0.00016566174,0.00030727644,0.00047924888,0.31955612],"genre_scores_gemma":[0.47589123,0.0029675583,0.38783863,0.0017823578,0.0016305771,0.0003440647,0.00045653776,0.00035773075,0.12873125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.00013094503,0.000035928555,0.00014547292,0.00021798245,0.000059547412],"domain_scores_gemma":[0.9990435,0.00040447924,0.00008798484,0.00019858139,0.00018129853,0.00008412548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065128563,0.00047401784,0.000296699,0.0010624212,0.0014514275,0.0023014643,0.0006032159,0.0009116464,0.009017565],"category_scores_gemma":[0.0014656668,0.00045753003,0.0006350877,0.00082956115,0.0030047486,0.0044220677,0.0013817535,0.0028630432,0.0022793715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069799157,0.000007936543,0.00003742565,0.000032221844,0.0000014277721,0.000033974713,0.00014112658,0.00027354635,0.0016101655,0.98910695,0.0010603515,0.0076880385],"study_design_scores_gemma":[0.000009658258,0.00005226356,0.00011355952,0.000028916902,0.000005375712,0.00042375637,0.00010259013,0.0029024724,0.004050173,0.9256464,0.06664792,0.000016818989],"about_ca_topic_score_codex":0.00018233655,"about_ca_topic_score_gemma":0.00023314563,"teacher_disagreement_score":0.009017565,"about_ca_system_score_codex":0.0007427955,"about_ca_system_score_gemma":0.00045236715,"threshold_uncertainty_score":0.030166745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8149394,0.00044261065,0.10460383,0.0004603992,0.00017439204,0.000092655406,0.00043418803,0.00041494492,0.07843759],"genre_scores_gemma":[0.9655168,0.0002180341,0.022902716,0.0001597804,0.00006574945,0.00013619057,0.0009886164,0.00014108104,0.009870986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995448,0.000105003026,0.000021778835,0.00008437487,0.0001119629,0.00013194203],"domain_scores_gemma":[0.9995202,0.00015360395,0.0000859444,0.00007793361,0.00004879808,0.00011351576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022478214,0.00041970852,0.0004850985,0.0007313068,0.0012028591,0.0013291985,0.0006605451,0.00082324096,0.009990765],"category_scores_gemma":[0.00096460275,0.0005104615,0.0005597304,0.00050052453,0.0012240851,0.0016849674,0.0018282084,0.0013080275,0.0009947182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018862868,0.00009438258,0.00086343003,0.00012573434,0.00002289122,0.0005914752,0.00040713223,0.018932149,0.010938875,0.9494811,0.0038243344,0.014529823],"study_design_scores_gemma":[0.00007142209,0.00012128642,0.0009262538,0.0000454443,0.000023511326,0.0003394664,0.0003597174,0.081924535,0.006112748,0.9006997,0.009337535,0.000038275968],"about_ca_topic_score_codex":0.00097353116,"about_ca_topic_score_gemma":0.001453633,"teacher_disagreement_score":0.009990765,"about_ca_system_score_codex":0.00059754605,"about_ca_system_score_gemma":0.0004245864,"threshold_uncertainty_score":0.03342241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48005792,0.0015889768,0.45466283,0.0018698295,0.00072136556,0.00008692202,0.0006030069,0.00025027082,0.06015888],"genre_scores_gemma":[0.93384725,0.0012677066,0.033683196,0.00045167303,0.0011176808,0.000071531875,0.0004096188,0.00019445586,0.028956894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943703,0.00021666003,0.000021805477,0.00012555056,0.00012764914,0.000071325914],"domain_scores_gemma":[0.9978028,0.0010695803,0.0003287068,0.00018429816,0.00029793486,0.00031665736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007378128,0.0010499121,0.00056701514,0.001597564,0.00075473316,0.0017213468,0.00067099096,0.0007409006,0.0065535023],"category_scores_gemma":[0.0032585394,0.00037558645,0.00065662095,0.00088280364,0.0023585204,0.0022982159,0.00108985,0.0015163363,0.0008737827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008457975,0.000040036437,0.00024742127,0.000038875358,0.00001038229,0.00011038276,0.00026334013,0.0029628652,0.003994748,0.98266876,0.0017708872,0.0078077144],"study_design_scores_gemma":[0.000012453366,0.00004991485,0.00033451678,0.000013031165,0.000005763259,0.00016366746,0.00007485843,0.021736266,0.00084054295,0.9739314,0.00281646,0.000021161435],"about_ca_topic_score_codex":0.0007963326,"about_ca_topic_score_gemma":0.00066439825,"teacher_disagreement_score":0.0065535023,"about_ca_system_score_codex":0.000530527,"about_ca_system_score_gemma":0.00041929644,"threshold_uncertainty_score":0.021923661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43090147,0.0004729416,0.5301982,0.00038957375,0.00014990573,0.00017331635,0.002653023,0.00067990803,0.034381673],"genre_scores_gemma":[0.8830412,0.00044915467,0.09970574,0.00022759347,0.00014643268,0.00034627097,0.0028877677,0.0001869257,0.013008974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824536,0.00039071066,0.00022022163,0.00046314218,0.00050513225,0.000175327],"domain_scores_gemma":[0.99427783,0.0016192942,0.0013691247,0.00095818704,0.0013824144,0.0003931413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008400889,0.000686091,0.0005441539,0.0023656308,0.0007720679,0.0018560383,0.000772405,0.00073599286,0.0056890785],"category_scores_gemma":[0.0058884416,0.00037757203,0.0005785432,0.0012194912,0.001750566,0.0024754684,0.0011385736,0.0010397349,0.0020406342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044694086,0.00012073661,0.0041304403,0.00030608763,0.000057297424,0.00097374467,0.0007380765,0.013505517,0.035567746,0.8405544,0.00297016,0.10062874],"study_design_scores_gemma":[0.000041750773,0.00030525075,0.0026910184,0.00014094474,0.000026512982,0.0015920167,0.00034203485,0.07488894,0.02599258,0.8819022,0.011963017,0.00011370031],"about_ca_topic_score_codex":0.00024767336,"about_ca_topic_score_gemma":0.00020673763,"teacher_disagreement_score":0.0056890785,"about_ca_system_score_codex":0.000446519,"about_ca_system_score_gemma":0.0006121831,"threshold_uncertainty_score":0.019031882},"labels":[],"label_agreement":null},{"id":"W2892600074","doi":"10.1002/jcd.21792","title":"Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Security Agency","keywords":"Combinatorics; Matching (statistics); Mathematics; Multigraph; Variable (mathematics); Vertex (graph theory); Graph; Mathematical analysis","score_opus":0.02493946873722629,"score_gpt":0.24319524863859657,"score_spread":0.21825577990137027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892600074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22812212,0.0003618105,0.7501917,0.00018804104,0.000053124346,0.00014719069,0.00030910288,0.00029313262,0.020333873],"genre_scores_gemma":[0.63641065,0.00042964777,0.35048366,0.00020422746,0.00003754804,0.0002165823,0.000754574,0.0001271007,0.0113361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996381,0.00006837356,0.000022061564,0.0000917566,0.00008728789,0.000092470174],"domain_scores_gemma":[0.99931514,0.00015416776,0.00013317917,0.00021610229,0.000085312975,0.00009617221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003381762,0.0005690367,0.000309484,0.000977464,0.0006261121,0.00086405233,0.000460266,0.0004118071,0.003833294],"category_scores_gemma":[0.00092301355,0.00049146014,0.0008628277,0.0005229277,0.0006812019,0.0015496492,0.0012452885,0.0013177991,0.0004989878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027424528,0.00017370746,0.0016739421,0.00030889895,0.000080717706,0.00075258606,0.000989544,0.08123611,0.1081973,0.689193,0.00497911,0.1121408],"study_design_scores_gemma":[0.00007596338,0.00020421133,0.0022473007,0.00014192477,0.00006782152,0.00081242825,0.00055273785,0.2579686,0.051222187,0.6546737,0.031940553,0.00009258661],"about_ca_topic_score_codex":0.0010914017,"about_ca_topic_score_gemma":0.0018991802,"teacher_disagreement_score":0.003833294,"about_ca_system_score_codex":0.0004700838,"about_ca_system_score_gemma":0.00035296296,"threshold_uncertainty_score":0.012823641},"labels":[],"label_agreement":null},{"id":"W2896470915","doi":"10.1002/jcd.21653","title":"A perfect one‐factorisation of","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Perfect graph theorem; Trivially perfect graph; Perfect power; Perfect graph; Strong perfect graph theorem; Graph; Decomposition","score_opus":0.014672431757413994,"score_gpt":0.20391971557685762,"score_spread":0.1892472838194436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896470915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54404145,0.0012159122,0.310664,0.0021115323,0.00060544343,0.00018062461,0.0011716732,0.001237314,0.13877207],"genre_scores_gemma":[0.97245413,0.00021829817,0.016821144,0.00027045605,0.00008971165,0.0000345303,0.00039643722,0.00008058943,0.009634642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986828,0.00016788514,0.00005955864,0.00050119456,0.00023236724,0.00035625786],"domain_scores_gemma":[0.9981014,0.00039799546,0.00023872,0.0007016434,0.00036205465,0.00019827667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006878741,0.00045669754,0.0006250413,0.0006797483,0.0012255581,0.0019607104,0.0006486455,0.0006440406,0.009787059],"category_scores_gemma":[0.0033065244,0.00043018252,0.00079943275,0.00060248334,0.0027147855,0.0027134859,0.0015201147,0.0014141026,0.0015383096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042464727,0.00006339544,0.0013465532,0.0001257131,0.000042763204,0.00025684264,0.00040561243,0.0048024883,0.011476536,0.9425936,0.0063780523,0.032083787],"study_design_scores_gemma":[0.00006596815,0.00017263599,0.0008866819,0.000082733604,0.000049236645,0.0005089135,0.00023149415,0.010702777,0.015661811,0.93757695,0.034014773,0.000045972098],"about_ca_topic_score_codex":0.0017302223,"about_ca_topic_score_gemma":0.0011569919,"teacher_disagreement_score":0.009787059,"about_ca_system_score_codex":0.0009567829,"about_ca_system_score_gemma":0.00082599977,"threshold_uncertainty_score":0.03274095},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5307904,0.001409628,0.42426705,0.0006750044,0.0003394161,0.00011065574,0.00024584794,0.0019635572,0.04019846],"genre_scores_gemma":[0.89506173,0.00083031645,0.06886123,0.00022560549,0.0000677176,0.00009728058,0.0001428438,0.00013819688,0.034575082],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985945,0.000029237339,0.0000068248714,0.000038050184,0.000044525746,0.000021921052],"domain_scores_gemma":[0.9997869,0.000097199845,0.000027852338,0.00004154148,0.000030344638,0.00001607021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002016082,0.00031354648,0.00014362083,0.00017258176,0.00023561674,0.0005783935,0.00036407379,0.00040912785,0.0058115176],"category_scores_gemma":[0.00039193284,0.00013396333,0.00020114527,0.00015966585,0.00027800605,0.00091944943,0.00049504824,0.0002237116,0.0009889497],"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.0002847184,0.000073278665,0.0008577179,0.00033183087,0.000022309441,0.00043281546,0.0007741822,0.0051007667,0.88001615,0.0087761525,0.0019438027,0.101386234],"study_design_scores_gemma":[0.00006767367,0.00082753453,0.007455458,0.0001388694,0.00008981504,0.0014224172,0.00079633744,0.10149871,0.723098,0.007801749,0.15668315,0.000120314486],"about_ca_topic_score_codex":0.0002065532,"about_ca_topic_score_gemma":0.00043696605,"teacher_disagreement_score":0.0058115176,"about_ca_system_score_codex":0.00016753688,"about_ca_system_score_gemma":0.000088578694,"threshold_uncertainty_score":0.019441426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58963776,0.00072613044,0.35979223,0.00070377596,0.00010048284,0.00017161407,0.0013364659,0.00029329187,0.04723818],"genre_scores_gemma":[0.9360191,0.00046682107,0.04792015,0.0002035605,0.00008207037,0.00016655149,0.0011450099,0.00016354426,0.0138331605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961406,0.00009201447,0.000022141168,0.00009676502,0.00007917904,0.00009595505],"domain_scores_gemma":[0.9989761,0.00040654777,0.00019264783,0.000111515365,0.00014862741,0.00016457766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004013196,0.0005171534,0.00042891706,0.0015179768,0.0008768038,0.0013608244,0.0006025138,0.00077927916,0.0072395327],"category_scores_gemma":[0.0018940701,0.0004787324,0.0008057518,0.00082449394,0.00095217995,0.0013232297,0.0009107964,0.0009713082,0.0006030526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014132068,0.000055008888,0.0015592022,0.00016507602,0.00004630645,0.00026918162,0.0004757743,0.060100287,0.008274222,0.898068,0.0049312282,0.025914408],"study_design_scores_gemma":[0.00002867502,0.00003550252,0.0014929312,0.000033839675,0.00001500899,0.00019316058,0.00011803268,0.21820056,0.001140817,0.7739127,0.0047996813,0.000029100655],"about_ca_topic_score_codex":0.0021514476,"about_ca_topic_score_gemma":0.0027954413,"teacher_disagreement_score":0.0072395327,"about_ca_system_score_codex":0.0010563104,"about_ca_system_score_gemma":0.0004355573,"threshold_uncertainty_score":0.024218619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5305322,0.00040281826,0.3435481,0.0012360134,0.00030705513,0.0004970616,0.0039393515,0.0013869789,0.118150406],"genre_scores_gemma":[0.85372794,0.0005235151,0.08369718,0.0006222373,0.00016596666,0.00034738492,0.004778443,0.00046377323,0.05567354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919623,0.00012050375,0.00007024861,0.00020058242,0.00017842348,0.00023394104],"domain_scores_gemma":[0.99632096,0.0014483192,0.0005085757,0.0005814778,0.00045810436,0.0006825272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444138,0.00073352957,0.0009201312,0.0018299181,0.0020071198,0.004052057,0.0013071588,0.0010948386,0.016731644],"category_scores_gemma":[0.0034875518,0.0008619874,0.0008326295,0.0024514112,0.0014609416,0.0050543435,0.0017782858,0.002563891,0.002042101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063374854,0.0004893274,0.001545051,0.0002790229,0.000067964545,0.00076861854,0.0005017541,0.016826918,0.010065918,0.9166282,0.012606666,0.03958676],"study_design_scores_gemma":[0.000099256235,0.00006750766,0.0005719627,0.000067185116,0.00003555091,0.00031219423,0.00026097323,0.03950641,0.0020078507,0.9496224,0.0074288426,0.000019830906],"about_ca_topic_score_codex":0.001093082,"about_ca_topic_score_gemma":0.0018656994,"teacher_disagreement_score":0.016731644,"about_ca_system_score_codex":0.00092241657,"about_ca_system_score_gemma":0.0012002769,"threshold_uncertainty_score":0.055972934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6926574,0.0024649736,0.16078979,0.0020355387,0.001109325,0.00009917354,0.00025831556,0.00040434854,0.14018106],"genre_scores_gemma":[0.9588645,0.0007060866,0.01068114,0.00041407318,0.00027779018,0.00006630075,0.00008507755,0.00009696916,0.028808044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997217,0.000076491815,0.000013766066,0.000043528562,0.00004970762,0.00009478669],"domain_scores_gemma":[0.99890435,0.0005512839,0.00011806774,0.00010324346,0.00009974153,0.00022320291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063349213,0.000481253,0.0005652412,0.0013149049,0.0011494599,0.0020460365,0.0006179249,0.0008451939,0.005037055],"category_scores_gemma":[0.002678474,0.0003252054,0.0003416709,0.0005113347,0.0022133188,0.0025307885,0.0015701589,0.0012638813,0.00047861013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060201797,0.000014517089,0.00020737882,0.000016515834,0.0000027258548,0.00008204366,0.000108238055,0.00045658925,0.0010561205,0.99425584,0.00079555355,0.002944371],"study_design_scores_gemma":[0.000025012696,0.000030287772,0.00016817468,0.000022067588,0.000007743844,0.00018033272,0.00015142486,0.0059709996,0.0007620291,0.98837006,0.004300013,0.000011760639],"about_ca_topic_score_codex":0.00043531132,"about_ca_topic_score_gemma":0.0004913276,"teacher_disagreement_score":0.005037055,"about_ca_system_score_codex":0.00047234178,"about_ca_system_score_gemma":0.0004993513,"threshold_uncertainty_score":0.01685065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51442087,0.0029952663,0.18655226,0.006723939,0.0013354734,0.00021744244,0.0034836344,0.00069745217,0.2835736],"genre_scores_gemma":[0.94006824,0.0015502383,0.03287671,0.00064452476,0.00048162584,0.00018465996,0.001260915,0.00014339152,0.022789579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939406,0.00019482423,0.000027769003,0.00012024346,0.00016913438,0.0000939123],"domain_scores_gemma":[0.9970607,0.0017317889,0.0003651439,0.00025035016,0.0002462365,0.0003457222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005829958,0.00044142627,0.00044605718,0.0025283836,0.0015129765,0.0016036723,0.0007808488,0.00091752235,0.012438847],"category_scores_gemma":[0.0042534983,0.0002320813,0.00035790142,0.0015565028,0.001253428,0.0023901444,0.0009534559,0.0009934756,0.0016523713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009220897,0.000042547694,0.0025667327,0.00019281592,0.000030808358,0.00015514396,0.00028979182,0.004293812,0.0027525628,0.95364386,0.0117016155,0.024238093],"study_design_scores_gemma":[0.000021535488,0.000038099737,0.0018761934,0.000039711424,0.000021847856,0.000531594,0.00017349802,0.02195266,0.0014607352,0.9587286,0.01513587,0.00001981042],"about_ca_topic_score_codex":0.0006204634,"about_ca_topic_score_gemma":0.0011275874,"teacher_disagreement_score":0.012438847,"about_ca_system_score_codex":0.000788858,"about_ca_system_score_gemma":0.00039283826,"threshold_uncertainty_score":0.04161203},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04522346,0.00032363183,0.9184895,0.00047736018,0.00020066818,0.0000969441,0.00026687753,0.00047556963,0.034446083],"genre_scores_gemma":[0.36541575,0.00076994987,0.6206806,0.00046403523,0.000176393,0.00036289595,0.00047925452,0.0003591197,0.011292119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981462,0.00064728456,0.000115520925,0.00021933479,0.0005741674,0.00029760282],"domain_scores_gemma":[0.99795294,0.00092896156,0.00026797756,0.00038876128,0.00033550363,0.00012582119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009858941,0.0010084102,0.0009022128,0.0010040987,0.0006432373,0.0018308496,0.00093945814,0.0008371933,0.005207883],"category_scores_gemma":[0.004647659,0.0010305198,0.00080941844,0.0013926266,0.0010452564,0.0015160504,0.0024703508,0.0014143552,0.0016466123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027572754,0.00013227231,0.0005192775,0.0001937098,0.00006167316,0.00019190251,0.00020730065,0.0446849,0.026261939,0.84113026,0.0059805396,0.080360524],"study_design_scores_gemma":[0.00019307177,0.00028983975,0.00039220796,0.000115708084,0.00008190719,0.00045903874,0.00022212954,0.2619198,0.03413764,0.68168116,0.020422757,0.00008475304],"about_ca_topic_score_codex":0.00020721264,"about_ca_topic_score_gemma":0.00046884175,"teacher_disagreement_score":0.005207883,"about_ca_system_score_codex":0.0006325018,"about_ca_system_score_gemma":0.0009845218,"threshold_uncertainty_score":0.01742214},"labels":[],"label_agreement":null},{"id":"W2910395593","doi":"10.1002/jcd.21645","title":"On the spouse‐loving variant of the Oberwolfach problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Disjoint union (topology); Spouse; Decomposition; Order (exchange); Graph; Discrete mathematics; Law; Chemistry","score_opus":0.010110573656766993,"score_gpt":0.18287924003979242,"score_spread":0.17276866638302543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910395593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71655595,0.0004799801,0.1678727,0.0040717693,0.00018544967,0.00034458208,0.0016568705,0.0002983557,0.108534366],"genre_scores_gemma":[0.9378961,0.00057308126,0.038690012,0.00046566862,0.00019496583,0.00014047296,0.001769867,0.0000758787,0.020193908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895906,0.00034063618,0.00004567735,0.00021844127,0.0001671329,0.0002690476],"domain_scores_gemma":[0.99737954,0.0014904361,0.00028627564,0.00039572138,0.00016938784,0.000278557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583732,0.00058827957,0.00084239466,0.00076816516,0.0017224378,0.0024038453,0.0012720725,0.0015737743,0.01772434],"category_scores_gemma":[0.004826333,0.00040940996,0.0005093684,0.0013531697,0.0015972576,0.004787391,0.0022767934,0.0013669007,0.0011998169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003898366,0.0002981687,0.002262766,0.00019067769,0.00005597137,0.0005655987,0.0007611663,0.028934699,0.001769276,0.89501226,0.024322601,0.04543692],"study_design_scores_gemma":[0.00016050221,0.000083490486,0.00088872376,0.000044945944,0.00003648953,0.00040800314,0.0008828935,0.0781471,0.0018322908,0.90202475,0.01545905,0.00003187421],"about_ca_topic_score_codex":0.0035163858,"about_ca_topic_score_gemma":0.00318469,"teacher_disagreement_score":0.01772434,"about_ca_system_score_codex":0.00091527094,"about_ca_system_score_gemma":0.0009217625,"threshold_uncertainty_score":0.059293807},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039231874,0.00076421845,0.2439289,0.0015920254,0.001810536,0.00024196845,0.0013433477,0.0029588905,0.7081283],"genre_scores_gemma":[0.35030478,0.00096795434,0.16498464,0.0021966621,0.0004323709,0.0005243556,0.0035692395,0.0018027666,0.47521725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994198,0.00006705986,0.000025480107,0.00017078148,0.00019666055,0.00012013078],"domain_scores_gemma":[0.99940443,0.00007766373,0.000042710228,0.00017593229,0.00019808463,0.0001012086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020042334,0.0008879649,0.0008012769,0.0014639386,0.0018337284,0.0028943757,0.001380974,0.0012540036,0.07871469],"category_scores_gemma":[0.0013760843,0.00047244556,0.00075073773,0.0010454182,0.001131786,0.0031410246,0.003169531,0.0020937526,0.025797319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032963158,0.000084899555,0.00040129363,0.0001814041,0.00003179088,0.00036687925,0.00022833208,0.002894808,0.011879617,0.8013973,0.06402173,0.11818234],"study_design_scores_gemma":[0.000059549886,0.00008599851,0.00034911235,0.00007578969,0.000029266579,0.0007335775,0.00042097174,0.016292384,0.012378247,0.66988236,0.29965746,0.000035209032],"about_ca_topic_score_codex":0.0011534612,"about_ca_topic_score_gemma":0.0015606477,"teacher_disagreement_score":0.07871469,"about_ca_system_score_codex":0.00058185396,"about_ca_system_score_gemma":0.0006302591,"threshold_uncertainty_score":0.26332688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2619148,0.00067958527,0.5125948,0.001308951,0.0006942742,0.00039018228,0.0033494907,0.0018245633,0.21724325],"genre_scores_gemma":[0.6138742,0.00095046265,0.26800695,0.0008178558,0.0002152316,0.0003073805,0.0046746843,0.0010498282,0.11010345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955314,0.00010043008,0.000017073382,0.0000979589,0.00011181775,0.00011962797],"domain_scores_gemma":[0.9987174,0.00040433204,0.00009734945,0.0004012333,0.000214683,0.00016497499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028989956,0.00058585784,0.00046901518,0.001310144,0.0012878488,0.0019329682,0.00077739195,0.0005638661,0.022501878],"category_scores_gemma":[0.0014803305,0.00041423066,0.00056393596,0.0016511745,0.00058528665,0.0018561205,0.001096739,0.0016906502,0.0026944715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048452814,0.00024950766,0.0012883098,0.00020581998,0.00004684955,0.00024549468,0.00028323833,0.015735187,0.01193658,0.77704525,0.036631316,0.15584794],"study_design_scores_gemma":[0.00008520973,0.00011892505,0.0012093611,0.00006600612,0.000052667987,0.0004786497,0.00029329924,0.057339206,0.012226264,0.85475236,0.07334604,0.000031987125],"about_ca_topic_score_codex":0.0015589226,"about_ca_topic_score_gemma":0.003546655,"teacher_disagreement_score":0.022501878,"about_ca_system_score_codex":0.00096825825,"about_ca_system_score_gemma":0.000645528,"threshold_uncertainty_score":0.075276315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0756596,0.0018055161,0.5212143,0.0012551778,0.0015513308,0.00019612284,0.00148073,0.004543788,0.39229333],"genre_scores_gemma":[0.6026168,0.0018798774,0.19648638,0.0015767686,0.0009865585,0.0004485144,0.0038004369,0.001488273,0.19071639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.0001364763,0.000039117374,0.00017387698,0.0002688779,0.00013947404],"domain_scores_gemma":[0.99887925,0.00027229363,0.000098868426,0.0004085363,0.00022563174,0.00011541607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023443202,0.0008524022,0.0009896858,0.0015979671,0.0013387653,0.0024160396,0.0008785932,0.001262414,0.047024433],"category_scores_gemma":[0.0021117267,0.000669764,0.00054296275,0.0024514345,0.0006175596,0.002599407,0.0020867148,0.0015772338,0.016578121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005028359,0.000214756,0.00067792437,0.00027256008,0.00004923632,0.00034107087,0.00024629507,0.017883811,0.04054887,0.6137228,0.054748956,0.27079096],"study_design_scores_gemma":[0.00010797036,0.00035504324,0.0010507362,0.0001020615,0.00006171074,0.0012428489,0.00033415022,0.138679,0.0666508,0.6162025,0.17512347,0.000089796384],"about_ca_topic_score_codex":0.00023565607,"about_ca_topic_score_gemma":0.00029146424,"teacher_disagreement_score":0.047024433,"about_ca_system_score_codex":0.00048575507,"about_ca_system_score_gemma":0.00035501225,"threshold_uncertainty_score":0.1573124},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07952845,0.0022241382,0.22339267,0.004384783,0.0017200212,0.00015991552,0.0012683258,0.0008787963,0.6864429],"genre_scores_gemma":[0.5777266,0.001917886,0.041556746,0.0024222026,0.0014781146,0.00026677983,0.0014702656,0.00044134518,0.37272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960643,0.00008668643,0.00001774731,0.000089503,0.000118994525,0.00008063114],"domain_scores_gemma":[0.99928904,0.00016246873,0.000089397305,0.00011161914,0.0002362173,0.000111237016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032720694,0.000762659,0.0005447517,0.0022756096,0.0016307615,0.0025703583,0.00070773746,0.0010362417,0.03376908],"category_scores_gemma":[0.0018050314,0.00032806216,0.00042478135,0.0012228894,0.0010922019,0.0024111324,0.0011306222,0.002166431,0.009261662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099940935,0.000010638292,0.000054422857,0.00001249866,0.0000029228086,0.000027741178,0.00005412121,0.00028270565,0.0005362141,0.9863659,0.004805103,0.007837736],"study_design_scores_gemma":[0.0000059334143,0.000010081091,0.00012572286,0.000012365991,0.0000041804788,0.00012775692,0.00005642969,0.0027668742,0.0007591776,0.9720839,0.02403441,0.000013177621],"about_ca_topic_score_codex":0.00065206096,"about_ca_topic_score_gemma":0.0009236359,"teacher_disagreement_score":0.03376908,"about_ca_system_score_codex":0.0008062392,"about_ca_system_score_gemma":0.0006868388,"threshold_uncertainty_score":0.1129688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15875493,0.0021815354,0.6139933,0.0153545225,0.0008441018,0.00014766608,0.0010114145,0.0007222953,0.20699035],"genre_scores_gemma":[0.8163086,0.0014280506,0.150697,0.0027075328,0.0009786966,0.0002832039,0.00085230556,0.00018270366,0.02656201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829453,0.0005399971,0.00006900871,0.00043122715,0.00042024432,0.00024499616],"domain_scores_gemma":[0.9958301,0.0026565206,0.00029040768,0.00076645444,0.00028801226,0.0001685261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875448,0.000635026,0.00070607645,0.0013361641,0.0019506104,0.003129311,0.0015461472,0.0015380811,0.009659884],"category_scores_gemma":[0.0050078365,0.00044240063,0.0009334036,0.0016194067,0.004674462,0.008679124,0.0022529606,0.003828057,0.0013529346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002707492,0.000012070423,0.0001521158,0.000024455185,0.0000031987947,0.000025986545,0.000053038082,0.0014304669,0.00021706992,0.99145585,0.0014983374,0.005100273],"study_design_scores_gemma":[0.000007847335,0.000011123727,0.000064009575,0.000011219913,0.0000031959403,0.000039343577,0.000038643397,0.010606721,0.00034238878,0.984721,0.004148655,0.0000057710945],"about_ca_topic_score_codex":0.0020792058,"about_ca_topic_score_gemma":0.0030944645,"teacher_disagreement_score":0.009659884,"about_ca_system_score_codex":0.0016965647,"about_ca_system_score_gemma":0.001516062,"threshold_uncertainty_score":0.032315552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5319395,0.0027859835,0.25033307,0.0016325453,0.0003272616,0.00016437631,0.0020364893,0.0007518924,0.21002883],"genre_scores_gemma":[0.91030806,0.0009933988,0.045779508,0.00046889193,0.00019271989,0.00012334013,0.0017697853,0.00015002658,0.040214345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938893,0.00017627788,0.00003281731,0.00011609033,0.00013070747,0.00015528202],"domain_scores_gemma":[0.99852645,0.0007051241,0.00023410618,0.0002840657,0.000090536836,0.00015965993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028665067,0.00045932515,0.00053036696,0.0009281832,0.0010688814,0.0018919278,0.00081295666,0.0011837471,0.013698249],"category_scores_gemma":[0.0021715043,0.0005080131,0.0005859857,0.0014529777,0.000843266,0.0026525133,0.0014589556,0.0009867384,0.0016652707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022270693,0.00011600675,0.0011475587,0.00024290875,0.000052365383,0.0005918463,0.00038792967,0.020853668,0.004036022,0.9170382,0.01337389,0.04193694],"study_design_scores_gemma":[0.00004761248,0.000050730898,0.0015030634,0.00008007004,0.000035006477,0.0007625578,0.00026503127,0.06445685,0.0034391256,0.91044945,0.018885856,0.0000247113],"about_ca_topic_score_codex":0.001177837,"about_ca_topic_score_gemma":0.00160349,"teacher_disagreement_score":0.013698249,"about_ca_system_score_codex":0.00083622016,"about_ca_system_score_gemma":0.000401152,"threshold_uncertainty_score":0.045825183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78828645,0.0006899829,0.06620731,0.0013810139,0.0003052051,0.000091514696,0.0016927685,0.00056927965,0.14077641],"genre_scores_gemma":[0.96833,0.00023012148,0.0145081,0.00025731686,0.000052170366,0.000042526884,0.00066248415,0.00008396164,0.015833344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950266,0.00012928652,0.000022288094,0.00007786212,0.00009974047,0.00016812973],"domain_scores_gemma":[0.9982114,0.00067218905,0.00034987865,0.0002685336,0.00021284958,0.00028521888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033046544,0.00036025676,0.00027108716,0.0011759726,0.0018832424,0.0017824006,0.0005552124,0.0006913896,0.010411704],"category_scores_gemma":[0.0020895356,0.0005361941,0.00049503765,0.00075202656,0.0012188031,0.0016189042,0.00092967675,0.0008520416,0.00086088135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033650507,0.000092449096,0.0025930575,0.000095395204,0.000036099776,0.00045709373,0.00051694736,0.01374883,0.006651252,0.9461793,0.012802908,0.01649022],"study_design_scores_gemma":[0.00005585501,0.000059286125,0.0050307373,0.000050127062,0.000041261013,0.0006034698,0.0007976926,0.036308847,0.005607852,0.9353938,0.01600138,0.00004961077],"about_ca_topic_score_codex":0.0038373617,"about_ca_topic_score_gemma":0.007685971,"teacher_disagreement_score":0.010411704,"about_ca_system_score_codex":0.0009858082,"about_ca_system_score_gemma":0.000870998,"threshold_uncertainty_score":0.03483063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.421196,0.0018379221,0.43690744,0.0017470687,0.00084481353,0.00041953925,0.0011819855,0.001453537,0.13441171],"genre_scores_gemma":[0.88926554,0.00044069588,0.09158199,0.00039821095,0.00017791489,0.00023800242,0.0003159749,0.00008581802,0.017495869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987078,0.0005195742,0.00006956814,0.00021387904,0.0002400168,0.00024920623],"domain_scores_gemma":[0.9959565,0.0017815112,0.0005407296,0.0010932095,0.00033989,0.00028817853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012398727,0.000602533,0.0005461484,0.00090345804,0.0010195436,0.0013800077,0.0008490996,0.0009676024,0.010628857],"category_scores_gemma":[0.0044229683,0.00036061034,0.00042960286,0.0007451746,0.001186627,0.0013932986,0.0011863773,0.00093161874,0.0016097127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016002872,0.00017152364,0.0014046485,0.0002531317,0.00008494235,0.00046875188,0.00024984477,0.01638354,0.029506247,0.88156354,0.008197366,0.060116198],"study_design_scores_gemma":[0.0005571489,0.00081745535,0.0009962354,0.00018644753,0.00011200885,0.0011363127,0.00018925419,0.07740298,0.03403058,0.83846295,0.04600451,0.00010411398],"about_ca_topic_score_codex":0.000448983,"about_ca_topic_score_gemma":0.0008826576,"teacher_disagreement_score":0.010628857,"about_ca_system_score_codex":0.0009220427,"about_ca_system_score_gemma":0.0010185213,"threshold_uncertainty_score":0.03555703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63347554,0.0031046101,0.06878364,0.0044140453,0.0005408508,0.00006841328,0.00047951285,0.00042497923,0.28870845],"genre_scores_gemma":[0.982381,0.00072877464,0.0058252146,0.00043392857,0.00025546958,0.000045489487,0.00021274072,0.00010344984,0.010014136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993062,0.00020694947,0.00002806342,0.00011947382,0.0001741754,0.00016505903],"domain_scores_gemma":[0.9963994,0.0019959956,0.0004838032,0.00037116272,0.00028389672,0.00046569115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125822,0.00071953813,0.0005468237,0.0040373835,0.002154072,0.0043081255,0.0011016784,0.0016475439,0.008213375],"category_scores_gemma":[0.005844575,0.00040481612,0.00054153573,0.0021561855,0.005163112,0.0059904465,0.002544179,0.002837431,0.000792521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035279372,0.000017141254,0.0005438219,0.000027068832,0.0000038699336,0.000080163525,0.00035004725,0.0006125198,0.0005589556,0.99123573,0.0016763639,0.004859091],"study_design_scores_gemma":[0.00000897812,0.000014483283,0.00088241743,0.000039347422,0.000011369251,0.0002453571,0.0004986187,0.0059483144,0.00056230807,0.9872153,0.0045581656,0.000015317104],"about_ca_topic_score_codex":0.0014415941,"about_ca_topic_score_gemma":0.0016574662,"teacher_disagreement_score":0.008213375,"about_ca_system_score_codex":0.0015074393,"about_ca_system_score_gemma":0.0005391388,"threshold_uncertainty_score":0.02747649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5393793,0.0014891834,0.10222404,0.0032213917,0.00069768407,0.00007768735,0.000423099,0.000430677,0.3520568],"genre_scores_gemma":[0.9647332,0.00039736362,0.012980986,0.00045868798,0.00018350223,0.000050636274,0.0001765099,0.000098538316,0.020920472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992778,0.0002175468,0.00002431484,0.000087308115,0.00016065713,0.00023238065],"domain_scores_gemma":[0.99904484,0.00043620454,0.00014160638,0.000105934756,0.000104118175,0.0001673131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041179883,0.00041280224,0.0004482596,0.0015054955,0.0017572105,0.0021596937,0.0006801355,0.0011786378,0.01342698],"category_scores_gemma":[0.0018939666,0.00030051006,0.0004046487,0.000596656,0.001957587,0.0022629693,0.0015532181,0.0013522318,0.0022119484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096075055,0.000020209765,0.00017096713,0.00003998173,0.000006495443,0.00014882296,0.00021767718,0.0023363968,0.0019155091,0.9883428,0.0027459462,0.003959028],"study_design_scores_gemma":[0.00002702459,0.000023479324,0.0002139421,0.00003712286,0.000004997888,0.00020146437,0.00031106136,0.016153803,0.0012091488,0.9764282,0.00536943,0.000020276782],"about_ca_topic_score_codex":0.001230275,"about_ca_topic_score_gemma":0.001592396,"teacher_disagreement_score":0.01342698,"about_ca_system_score_codex":0.0009856517,"about_ca_system_score_gemma":0.00052001467,"threshold_uncertainty_score":0.044917762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7915454,0.0008005248,0.052760214,0.0029218327,0.0008898331,0.0001488296,0.0073495153,0.00060067687,0.1429832],"genre_scores_gemma":[0.9517113,0.000639536,0.017856192,0.00044463907,0.00011152903,0.00012240169,0.003089742,0.00013171192,0.025893006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999801,0.000035495148,0.00000831064,0.000050353607,0.00003673627,0.000068142916],"domain_scores_gemma":[0.9990551,0.00032363637,0.00014831545,0.00009386935,0.00019678383,0.00018235754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017896344,0.0003308901,0.00018889019,0.0018852664,0.0009013785,0.00087246485,0.0004147253,0.00061265036,0.006930134],"category_scores_gemma":[0.0013942457,0.00014238921,0.00019230395,0.00086153706,0.00077595725,0.0008336381,0.00049619836,0.0008620951,0.0012682484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060377736,0.0001337322,0.006253919,0.00036465464,0.000031094663,0.0013519354,0.0008742334,0.00843494,0.04769014,0.8581396,0.027388923,0.048733033],"study_design_scores_gemma":[0.00009195078,0.00026505964,0.016896434,0.0002928316,0.000057079433,0.0029148906,0.0012499028,0.057179898,0.029736534,0.7763041,0.11488468,0.00012662636],"about_ca_topic_score_codex":0.001867613,"about_ca_topic_score_gemma":0.0021139132,"teacher_disagreement_score":0.006930134,"about_ca_system_score_codex":0.00070252613,"about_ca_system_score_gemma":0.0006437638,"threshold_uncertainty_score":0.023183644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52895325,0.0029693719,0.06770912,0.0033763112,0.00048729798,0.00010390669,0.0025469915,0.00025524164,0.39359862],"genre_scores_gemma":[0.97662354,0.0012318703,0.007853157,0.0004385594,0.00017560604,0.00006485297,0.00052502484,0.0000415327,0.013045828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961334,0.0000805702,0.00001788738,0.00007056295,0.00011910661,0.00009851484],"domain_scores_gemma":[0.9982936,0.00074795214,0.00027327778,0.0003164722,0.00019633927,0.00017234494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024155986,0.00024764266,0.0003479835,0.00073960715,0.0010069074,0.0018017243,0.0004910352,0.000534567,0.009080595],"category_scores_gemma":[0.002783326,0.00021674401,0.0002510204,0.0010898287,0.0011375297,0.0020901095,0.0013518834,0.0010660235,0.0010548553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017132069,0.00002380076,0.0005811828,0.00011631306,0.00001165315,0.0002786916,0.00024240337,0.0050343582,0.004398208,0.9598297,0.0106804315,0.01863189],"study_design_scores_gemma":[0.000038456532,0.00006151469,0.0011193032,0.00004559202,0.000018331746,0.0007623524,0.00022153962,0.019790482,0.0027914734,0.9552714,0.019850472,0.000029019657],"about_ca_topic_score_codex":0.0013940339,"about_ca_topic_score_gemma":0.001354959,"teacher_disagreement_score":0.009080595,"about_ca_system_score_codex":0.00057550374,"about_ca_system_score_gemma":0.00051973,"threshold_uncertainty_score":0.030377567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49168238,0.0017211905,0.3149108,0.0017545111,0.0003136967,0.00019753241,0.0010341912,0.00044880094,0.18793695],"genre_scores_gemma":[0.9349327,0.0007110991,0.02589289,0.0003339149,0.00011156155,0.00013098774,0.00034504288,0.00004811459,0.03749373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960834,0.00013656315,0.00002015319,0.00007790422,0.000083610284,0.0000734842],"domain_scores_gemma":[0.99869174,0.0006682351,0.00020838054,0.0001400453,0.00012444667,0.0001672779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031576966,0.00033107185,0.00027100524,0.0011261555,0.0007662869,0.001021424,0.0005686927,0.00065602857,0.0073597715],"category_scores_gemma":[0.0022377733,0.00029224696,0.00031967717,0.0007461598,0.00091843726,0.001544077,0.001010117,0.00070783054,0.00059645413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059479622,0.000040120536,0.00061470503,0.00008288888,0.000018251996,0.00024861388,0.00019223451,0.0073184283,0.0024914914,0.9671491,0.003401909,0.018382866],"study_design_scores_gemma":[0.000023019225,0.000024126288,0.00066935166,0.000035167275,0.000014376394,0.00022389535,0.00011687596,0.031205447,0.0009917626,0.95689625,0.009786002,0.000013664986],"about_ca_topic_score_codex":0.0019399344,"about_ca_topic_score_gemma":0.004177748,"teacher_disagreement_score":0.0073597715,"about_ca_system_score_codex":0.00090716366,"about_ca_system_score_gemma":0.00053258403,"threshold_uncertainty_score":0.02462089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002674197,0.0005395326,0.9820823,0.0003580934,0.00019886887,0.00009711257,0.00029956453,0.001346606,0.012403716],"genre_scores_gemma":[0.08579866,0.00042673404,0.90155774,0.00028490354,0.0003281466,0.00032098952,0.00060327316,0.00078064646,0.009898869],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877304,0.0005245562,0.000049743452,0.00018619395,0.00037044135,0.00009600837],"domain_scores_gemma":[0.996845,0.0021702761,0.00009297359,0.00040649413,0.00039524346,0.00009014069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014155061,0.0013091499,0.0015562108,0.002666815,0.001048655,0.0022990347,0.0032926118,0.0015233206,0.019668069],"category_scores_gemma":[0.007566427,0.00076997315,0.0015505716,0.003583201,0.0014648834,0.0026097526,0.0019178533,0.0031188105,0.0037806018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025866315,0.00019394123,0.00064858206,0.00044297797,0.00012936519,0.0000991603,0.000075420416,0.2564679,0.0018327303,0.32911855,0.03626119,0.37447152],"study_design_scores_gemma":[0.000056460893,0.000034461395,0.00010240405,0.000028227498,0.000021403279,0.000058436213,0.000015625976,0.85643107,0.00087856187,0.13400258,0.00835364,0.000017123128],"about_ca_topic_score_codex":0.007849046,"about_ca_topic_score_gemma":0.01585102,"teacher_disagreement_score":0.019668069,"about_ca_system_score_codex":0.001261303,"about_ca_system_score_gemma":0.0029636642,"threshold_uncertainty_score":0.065796256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42484948,0.0033465405,0.3944448,0.0010334031,0.0034612888,0.0012174188,0.014705617,0.018752856,0.13818865],"genre_scores_gemma":[0.6735576,0.00096430356,0.22225872,0.00066973,0.0002701243,0.0015373447,0.014698125,0.0041651,0.081879005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940014,0.00010467171,0.00006490208,0.00022361141,0.00009572862,0.00011091125],"domain_scores_gemma":[0.9989317,0.00023314489,0.000079981306,0.00040380753,0.00021813635,0.00013316097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703163,0.0010023558,0.0010150592,0.00082667894,0.0007994347,0.0011652191,0.001701482,0.0011058404,0.07179894],"category_scores_gemma":[0.0032768692,0.00042127137,0.0010509809,0.0009963139,0.00042736696,0.0015115385,0.0010415408,0.0014411377,0.026596405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005673252,0.0016832054,0.023121404,0.003547249,0.0005822258,0.0014245181,0.00090603856,0.051535282,0.14679983,0.08286987,0.093642466,0.58821464],"study_design_scores_gemma":[0.0010414367,0.001893513,0.0284235,0.00037986855,0.000434749,0.0022527254,0.00074585323,0.28541988,0.13154483,0.058194492,0.4891958,0.00047339135],"about_ca_topic_score_codex":0.0014073021,"about_ca_topic_score_gemma":0.0017904924,"teacher_disagreement_score":0.07179894,"about_ca_system_score_codex":0.00059483957,"about_ca_system_score_gemma":0.00060408295,"threshold_uncertainty_score":0.2401914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06916714,0.017344251,0.6952455,0.0056826286,0.0012694063,0.00017342118,0.0010774216,0.0018149745,0.20822524],"genre_scores_gemma":[0.8029489,0.011127961,0.14311284,0.0021073862,0.0022241834,0.00048742216,0.00088397297,0.0009186055,0.03618862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953252,0.00092726154,0.0001643637,0.000792973,0.0018396585,0.0009505427],"domain_scores_gemma":[0.9873,0.0082487585,0.0005857468,0.0018346865,0.0015522789,0.00047850865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036492015,0.002225438,0.0014364539,0.005068494,0.001846031,0.0046864487,0.0027750547,0.0018962746,0.013915452],"category_scores_gemma":[0.021292822,0.00095985574,0.0015594949,0.0033325234,0.005183744,0.009955144,0.005738593,0.010584217,0.0050957627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001618785,0.000109539375,0.0005748189,0.00028661147,0.000032445863,0.0001806109,0.00036420097,0.020146232,0.006067875,0.92641306,0.009578165,0.03608467],"study_design_scores_gemma":[0.000030239895,0.000089504334,0.00062786374,0.00016350306,0.00006463315,0.00033571056,0.00016619133,0.13350758,0.012567884,0.8260434,0.026255624,0.00014790586],"about_ca_topic_score_codex":0.001687893,"about_ca_topic_score_gemma":0.002110222,"teacher_disagreement_score":0.013915452,"about_ca_system_score_codex":0.0039101257,"about_ca_system_score_gemma":0.0016674061,"threshold_uncertainty_score":0.046551824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7784828,0.0010044842,0.18037835,0.00058303267,0.00008289742,0.00005169276,0.0010069688,0.00029681498,0.038113058],"genre_scores_gemma":[0.96549594,0.00042022337,0.025449779,0.000115025854,0.000051203595,0.000039371866,0.0004779193,0.00006412662,0.007886436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952483,0.00005375903,0.000026196038,0.00014530604,0.000079763864,0.00017015934],"domain_scores_gemma":[0.9986755,0.00044810204,0.00022687743,0.00019659035,0.00016905194,0.00028380373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005995987,0.00046705862,0.0005488249,0.0011504693,0.0012870842,0.0016956853,0.0005374628,0.0005419147,0.006104516],"category_scores_gemma":[0.0023606778,0.00032438702,0.0006909743,0.0008135305,0.0021411586,0.0037996033,0.001046436,0.0010382532,0.0007728383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018878242,0.00003331947,0.001537928,0.000054284883,0.000011448044,0.0001416609,0.00058940554,0.00679433,0.0037997074,0.9655978,0.0016272332,0.0196241],"study_design_scores_gemma":[0.00001871369,0.00005928166,0.0015462541,0.000028831573,0.000013453178,0.00036155464,0.00024953636,0.017419988,0.0018166773,0.972154,0.006296683,0.000034838395],"about_ca_topic_score_codex":0.0034041118,"about_ca_topic_score_gemma":0.0027351375,"teacher_disagreement_score":0.006104516,"about_ca_system_score_codex":0.0011144854,"about_ca_system_score_gemma":0.0006387517,"threshold_uncertainty_score":0.020421684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6751583,0.0013143915,0.15046275,0.0025666093,0.00083569123,0.0001133854,0.00029348576,0.000411859,0.16884352],"genre_scores_gemma":[0.9547265,0.0006825058,0.009957148,0.00026340233,0.00058749446,0.000043444994,0.00010366442,0.00012114351,0.033514705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00014141304,0.000022489974,0.00010166374,0.00016827008,0.00016171744],"domain_scores_gemma":[0.99866366,0.00051941123,0.00023325265,0.00012398676,0.00017705777,0.0002826791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006830234,0.0009969567,0.0007976339,0.0037849722,0.0018590974,0.0036137393,0.00082583894,0.0012149215,0.0068169134],"category_scores_gemma":[0.0032039555,0.00053580373,0.0008745069,0.0016696046,0.0037814046,0.003772812,0.0024780747,0.002657909,0.0009172405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023965405,0.000014114249,0.000071132476,0.000008873724,0.0000027966917,0.00005851142,0.0001770537,0.00032681553,0.00052454206,0.99667513,0.00025507578,0.0018619674],"study_design_scores_gemma":[0.000015453945,0.000020019193,0.00019377592,0.000008126015,0.0000057492202,0.00016262729,0.0001203966,0.0032051017,0.0005772669,0.9939493,0.001727657,0.000014522498],"about_ca_topic_score_codex":0.0009976774,"about_ca_topic_score_gemma":0.00078644574,"teacher_disagreement_score":0.0068169134,"about_ca_system_score_codex":0.0013606197,"about_ca_system_score_gemma":0.0008564375,"threshold_uncertainty_score":0.022804856},"labels":[],"label_agreement":null},{"id":"W2945057858","doi":"10.1002/jcd.21688","title":"Cyclic cycle systems of the complete multipartite graph","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Multipartite; Graph; Mathematics; Combinatorics; Complete graph; Discrete mathematics; Physics; Quantum; Quantum mechanics","score_opus":0.024455040743029136,"score_gpt":0.22575083174653895,"score_spread":0.2012957910035098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945057858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75690985,0.0007625076,0.21247639,0.0005910809,0.00008447997,0.00011365616,0.0005055848,0.00016988859,0.028386539],"genre_scores_gemma":[0.9694885,0.00018242092,0.025160408,0.00008430687,0.000028347113,0.000089434645,0.00031037323,0.000027114605,0.004629133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964046,0.00009516318,0.000014730078,0.00008110147,0.000086822176,0.000081632235],"domain_scores_gemma":[0.998678,0.0005352263,0.00020476768,0.00016909947,0.00022360204,0.00018927768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038191362,0.00029668232,0.00032467008,0.0010774487,0.00073343585,0.0009972625,0.00044275858,0.0006654381,0.005493548],"category_scores_gemma":[0.0019211109,0.00041755493,0.0003001647,0.00059474685,0.00093476754,0.0011682003,0.0008032745,0.0006909404,0.00030394984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016948639,0.00006708711,0.0020192566,0.00017237588,0.000037955113,0.00035845707,0.00037924014,0.057030708,0.02035494,0.898213,0.0029980673,0.018199375],"study_design_scores_gemma":[0.000056341385,0.00012912806,0.0017093675,0.00008141163,0.00002898185,0.00056035875,0.0003923883,0.3465176,0.011747586,0.62764424,0.011087959,0.000044581568],"about_ca_topic_score_codex":0.0011064586,"about_ca_topic_score_gemma":0.0011018079,"teacher_disagreement_score":0.005493548,"about_ca_system_score_codex":0.00054675544,"about_ca_system_score_gemma":0.0004407867,"threshold_uncertainty_score":0.01837778},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39126566,0.005873514,0.3761766,0.0023571402,0.0015286342,0.00031005705,0.003767064,0.0012565331,0.21746476],"genre_scores_gemma":[0.9108434,0.0016473496,0.05721657,0.00062783685,0.0005227653,0.000120932666,0.0016794273,0.00018106542,0.027160708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983006,0.00022846399,0.00008965261,0.00057626056,0.00036517563,0.00043981054],"domain_scores_gemma":[0.997511,0.0007326676,0.000337782,0.00053609425,0.0005693576,0.00031301545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009606622,0.0007172381,0.00096319994,0.0013682559,0.0021564355,0.002145987,0.00060606963,0.0008488598,0.015283798],"category_scores_gemma":[0.0041912557,0.00052216585,0.0010091437,0.00090796745,0.0024886783,0.0033657248,0.0015987502,0.0014413368,0.0023442595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011814316,0.000040796374,0.0010312076,0.00020846835,0.000021251728,0.0003021432,0.0004544572,0.0033974922,0.0021331115,0.9591691,0.008491949,0.024631908],"study_design_scores_gemma":[0.000014374137,0.000045227534,0.0004446696,0.000058305603,0.000011532664,0.00043014248,0.00017625937,0.004590405,0.0009195615,0.972049,0.021236977,0.000023564446],"about_ca_topic_score_codex":0.0015227173,"about_ca_topic_score_gemma":0.0015066061,"teacher_disagreement_score":0.015283798,"about_ca_system_score_codex":0.0013084598,"about_ca_system_score_gemma":0.0007786449,"threshold_uncertainty_score":0.0511294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.462333,0.0012021391,0.38119364,0.008791239,0.00031260107,0.00038224034,0.0019214517,0.0008619014,0.14300175],"genre_scores_gemma":[0.8551502,0.0011313998,0.10026214,0.0012004981,0.0004945725,0.00039651513,0.002414027,0.00020779324,0.038742796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990439,0.0002593404,0.00003825942,0.00021560726,0.00015373706,0.00028911707],"domain_scores_gemma":[0.9980945,0.0012020794,0.00016146715,0.00022334354,0.00015374908,0.0001648394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019257,0.0006935645,0.0006415772,0.0007140502,0.0013995717,0.0012869408,0.0009949727,0.0014089717,0.013303781],"category_scores_gemma":[0.0048859897,0.00033717888,0.0007155157,0.0010015812,0.0015966569,0.003632687,0.0019307524,0.0019245698,0.0010876909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023142088,0.00011921072,0.001062225,0.00024361536,0.000044475455,0.00037347357,0.00033034603,0.046462663,0.0019599001,0.86606914,0.030067317,0.053036224],"study_design_scores_gemma":[0.00009495316,0.0000662775,0.00051259866,0.00004114357,0.000017323056,0.00025227875,0.0002701592,0.11642194,0.0012959604,0.8681228,0.012870463,0.000034108307],"about_ca_topic_score_codex":0.0049261088,"about_ca_topic_score_gemma":0.005531559,"teacher_disagreement_score":0.013303781,"about_ca_system_score_codex":0.0011116676,"about_ca_system_score_gemma":0.0012803016,"threshold_uncertainty_score":0.044505596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30917582,0.0017976478,0.6070833,0.00051164086,0.00023089652,0.00024804226,0.00059766474,0.0005055615,0.079849474],"genre_scores_gemma":[0.70285374,0.0013883978,0.27410597,0.00060150225,0.00022033902,0.00048902206,0.0007172176,0.00017164013,0.019452104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989497,0.00032465384,0.00005466754,0.00020032382,0.00026215654,0.00020858689],"domain_scores_gemma":[0.9983901,0.0006959536,0.00025747032,0.00034979347,0.0002169255,0.0000898493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008535856,0.00070128695,0.00058153074,0.0007475954,0.00077981997,0.0010323535,0.0005074844,0.0006837353,0.0056728525],"category_scores_gemma":[0.0026579064,0.00034284228,0.0005221442,0.00096138916,0.0013022294,0.001332815,0.0011872081,0.0010302038,0.00095261773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022059807,0.000054604407,0.0009183977,0.00016334232,0.000033954544,0.0002119754,0.00029678643,0.05606378,0.01069467,0.8389802,0.0026087933,0.08975296],"study_design_scores_gemma":[0.0001598045,0.0004312825,0.00055849215,0.0001386766,0.000042764616,0.0005872012,0.0001902912,0.15601644,0.011384426,0.7767704,0.05361103,0.000109121545],"about_ca_topic_score_codex":0.0010862045,"about_ca_topic_score_gemma":0.0014850406,"teacher_disagreement_score":0.0056728525,"about_ca_system_score_codex":0.00077486545,"about_ca_system_score_gemma":0.0007464724,"threshold_uncertainty_score":0.018977523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7783469,0.00051227614,0.18928887,0.0006451451,0.000102425285,0.00008910464,0.00015690172,0.00025272605,0.030605676],"genre_scores_gemma":[0.9445651,0.00024299244,0.045866366,0.0001945653,0.00012616672,0.00009662493,0.00025619363,0.000084889194,0.008567171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988188,0.0003985167,0.00004859365,0.00018727135,0.00027227352,0.0002745066],"domain_scores_gemma":[0.99505264,0.0027494659,0.0007494189,0.00067261193,0.000349993,0.000425819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007251909,0.0007058306,0.0005975164,0.0014537042,0.0014605027,0.0017490967,0.0009536581,0.0012460812,0.0075406865],"category_scores_gemma":[0.006875564,0.0004985822,0.00045816787,0.0015586325,0.0017204906,0.0031934043,0.001429546,0.0016159343,0.0009878846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024144654,0.0001083735,0.0010680445,0.00011023309,0.000019978488,0.00050598336,0.00043141886,0.0176502,0.012225022,0.94336486,0.002255185,0.022019304],"study_design_scores_gemma":[0.0000388354,0.00007490718,0.00040119726,0.000018296372,0.000010467578,0.00029599137,0.00011814486,0.086180314,0.0043978393,0.9058482,0.0025897513,0.000025985968],"about_ca_topic_score_codex":0.0006717396,"about_ca_topic_score_gemma":0.00078982307,"teacher_disagreement_score":0.0075406865,"about_ca_system_score_codex":0.00067063235,"about_ca_system_score_gemma":0.0003920616,"threshold_uncertainty_score":0.025226057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48170498,0.0005020878,0.44909272,0.0007323467,0.00012214518,0.00016626205,0.0014759194,0.0012008934,0.06500265],"genre_scores_gemma":[0.76324755,0.00048794685,0.21986838,0.00017974286,0.00003906008,0.00025860028,0.0019405695,0.00048304137,0.013495072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.00008442652,0.00002887117,0.00012737342,0.00019609847,0.00016742012],"domain_scores_gemma":[0.99931383,0.00019078866,0.00007368279,0.0001219231,0.00014703281,0.00015269163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040983048,0.000634666,0.0006549188,0.00061712274,0.00095846667,0.0014118307,0.0009518036,0.00046117662,0.0103383735],"category_scores_gemma":[0.0017146122,0.00037583304,0.0007314751,0.00064285425,0.0008466565,0.0015870209,0.0012957391,0.0015523689,0.0020205854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015121761,0.00038999255,0.0085482085,0.00066527404,0.00010139735,0.00040373986,0.0007771832,0.12996127,0.10736104,0.5544927,0.024028854,0.17175815],"study_design_scores_gemma":[0.00020646691,0.0005709518,0.005161579,0.00013532388,0.00010920083,0.00065296685,0.00094059965,0.5265251,0.08423345,0.33978954,0.04154162,0.00013326845],"about_ca_topic_score_codex":0.0036832972,"about_ca_topic_score_gemma":0.0026558305,"teacher_disagreement_score":0.0103383735,"about_ca_system_score_codex":0.00092029123,"about_ca_system_score_gemma":0.001337387,"threshold_uncertainty_score":0.034585297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15342844,0.0009381941,0.7895278,0.0035391718,0.0002735114,0.00033619034,0.0009823507,0.00057752774,0.05039693],"genre_scores_gemma":[0.7242839,0.0010455484,0.2545388,0.0010539412,0.00042198715,0.0006132966,0.0011353802,0.00024180813,0.016665371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480563,0.0022187175,0.00028199234,0.001070754,0.00089118484,0.000731671],"domain_scores_gemma":[0.99042666,0.005610626,0.001078626,0.0019279404,0.00046217092,0.0004939129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038130155,0.0017069328,0.0017488834,0.0012351796,0.0014159502,0.0044126934,0.0028920234,0.002456358,0.008321451],"category_scores_gemma":[0.013539795,0.0009269106,0.0023088558,0.0016451424,0.003873549,0.008285515,0.0049859895,0.0051770597,0.0013834046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002400445,0.00008793615,0.00045086793,0.00021108853,0.00006761377,0.00014227538,0.00024076004,0.049278967,0.0022310494,0.92467517,0.004698862,0.017675297],"study_design_scores_gemma":[0.00015583228,0.00009790285,0.00028708176,0.000048990823,0.000048689653,0.00017832861,0.00009329901,0.13201188,0.0013296497,0.8592224,0.006473947,0.00005197559],"about_ca_topic_score_codex":0.0009802898,"about_ca_topic_score_gemma":0.0010061149,"teacher_disagreement_score":0.008321451,"about_ca_system_score_codex":0.0021562334,"about_ca_system_score_gemma":0.0019839287,"threshold_uncertainty_score":0.027838051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75019175,0.0005640693,0.09328394,0.0010915791,0.0001928156,0.00023296515,0.0009602379,0.000542469,0.15294023],"genre_scores_gemma":[0.95955485,0.00049799535,0.0181544,0.00041796986,0.00006409983,0.00010205234,0.00063736265,0.00006260649,0.020508759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971193,0.0000459768,0.000010397364,0.00006482965,0.00008018061,0.000086612206],"domain_scores_gemma":[0.99935466,0.00021137396,0.00014815394,0.0000855227,0.000098221746,0.00010207496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018408748,0.00032754743,0.00026284784,0.00057431415,0.0008106418,0.0012642918,0.00032703043,0.0005011901,0.007955734],"category_scores_gemma":[0.0009354116,0.0003734795,0.00031127693,0.00048986764,0.0009827431,0.0009639886,0.00062337465,0.0006186665,0.0008173703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073182346,0.000054813496,0.001294539,0.00009227624,0.000023316294,0.00078464387,0.00047853973,0.0036949979,0.013362985,0.96042484,0.0050093154,0.014706526],"study_design_scores_gemma":[0.0000799879,0.000086218904,0.0015522607,0.00002248348,0.000019687757,0.00081340445,0.00048249966,0.014326907,0.010276617,0.9510457,0.021263855,0.000030497564],"about_ca_topic_score_codex":0.0010966266,"about_ca_topic_score_gemma":0.0016461319,"teacher_disagreement_score":0.007955734,"about_ca_system_score_codex":0.0005831692,"about_ca_system_score_gemma":0.000739721,"threshold_uncertainty_score":0.026614547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17945139,0.017835947,0.6546608,0.009361413,0.001078589,0.00034074613,0.00201118,0.0022529732,0.13300698],"genre_scores_gemma":[0.87243634,0.008557181,0.09323566,0.0026758881,0.0014829866,0.0007046702,0.0017924742,0.001204361,0.017910467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99183875,0.0019610652,0.0002335196,0.0010812397,0.0027043512,0.0021811689],"domain_scores_gemma":[0.95587677,0.034048293,0.0021022647,0.003947461,0.0024143283,0.001610948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056726774,0.0028481348,0.0027705992,0.0036944023,0.003752364,0.0076919077,0.0041528703,0.0031880112,0.014843561],"category_scores_gemma":[0.05202881,0.0014914186,0.0012024101,0.004447286,0.0059776804,0.01741699,0.0082263,0.007730456,0.0029359746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061156333,0.00014295094,0.00080926775,0.00040463754,0.00006251416,0.0002060715,0.0005872162,0.037106063,0.0037854237,0.9070725,0.012641373,0.036570378],"study_design_scores_gemma":[0.000071315175,0.00013061769,0.00035452552,0.00022901435,0.00006657862,0.00022655533,0.00018656206,0.11520405,0.0031267393,0.8696105,0.010717491,0.00007613407],"about_ca_topic_score_codex":0.00342347,"about_ca_topic_score_gemma":0.0031421564,"teacher_disagreement_score":0.014843561,"about_ca_system_score_codex":0.006391439,"about_ca_system_score_gemma":0.003007628,"threshold_uncertainty_score":0.04965663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19119947,0.0004226223,0.74608594,0.00050030847,0.00015622418,0.00018183971,0.00027834732,0.0005154978,0.060659822],"genre_scores_gemma":[0.709296,0.0003461924,0.26554197,0.00019586229,0.000038490187,0.0001937289,0.00028773272,0.00021476294,0.023885248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997718,0.000052751777,0.000014052357,0.00005811285,0.000049627743,0.000053737454],"domain_scores_gemma":[0.9996946,0.00011228734,0.00004019678,0.000072194096,0.00004740686,0.000033367363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023823147,0.00037432445,0.00023622431,0.00063494314,0.0013683334,0.0008288409,0.0006538049,0.000642409,0.0060104635],"category_scores_gemma":[0.0013295639,0.00026083595,0.0005425944,0.0005734562,0.0013241015,0.001374606,0.0010136241,0.0007510794,0.0009433989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022077518,0.000016459857,0.00036135412,0.00005062692,0.00000442905,0.00015885643,0.00031513599,0.0038583972,0.0033400785,0.97108036,0.00093934254,0.019852968],"study_design_scores_gemma":[0.00001412491,0.00004030322,0.00025713563,0.000052367017,0.00001501481,0.00037667056,0.00012042156,0.041373342,0.009533829,0.9236232,0.024563951,0.000029677542],"about_ca_topic_score_codex":0.0018003663,"about_ca_topic_score_gemma":0.003334437,"teacher_disagreement_score":0.0060104635,"about_ca_system_score_codex":0.000838201,"about_ca_system_score_gemma":0.00073196326,"threshold_uncertainty_score":0.02010703},"labels":[],"label_agreement":null},{"id":"W2949680615","doi":"10.1002/jcd.21358","title":"Some New Orders of Hadamard and Skew‐Hadamard Matrices","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Google (Canada); University of Waterloo","funders":"","keywords":"Hadamard transform; Hadamard matrix; Complex Hadamard matrix; Hadamard's inequality; Matching (statistics); Order (exchange); Hadamard's maximal determinant problem","score_opus":0.010052348245165835,"score_gpt":0.19875470144772636,"score_spread":0.1887023532025605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949680615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40190297,0.0011240091,0.5385673,0.00092734303,0.0008377658,0.00016119856,0.0002711014,0.00046106573,0.055747144],"genre_scores_gemma":[0.8475327,0.00035942768,0.1376995,0.00031076343,0.0002060161,0.00008567611,0.00018302322,0.00007963776,0.013543305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991435,0.0002051429,0.000069422145,0.00010071016,0.00037335668,0.00010778965],"domain_scores_gemma":[0.9987111,0.00030811256,0.00018259106,0.00027580894,0.00032888996,0.00019355347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007880665,0.00047109867,0.00036240017,0.0009019408,0.0006883712,0.0014431565,0.00045970973,0.0004985777,0.0042419597],"category_scores_gemma":[0.0018484321,0.00039923954,0.00048507098,0.0005484753,0.0009580723,0.0013440959,0.0009473658,0.0010074083,0.0006223554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377292,0.000058823454,0.00071098265,0.00007806543,0.000021368744,0.0003856105,0.00030616162,0.008338263,0.026020138,0.9316749,0.0019462924,0.030275622],"study_design_scores_gemma":[0.00013133769,0.0005018956,0.00130088,0.000060773582,0.000042712112,0.0019846335,0.00032383826,0.12819862,0.077329986,0.74526083,0.044711627,0.00015290122],"about_ca_topic_score_codex":0.0002479602,"about_ca_topic_score_gemma":0.0002686124,"teacher_disagreement_score":0.0042419597,"about_ca_system_score_codex":0.00052797864,"about_ca_system_score_gemma":0.00049236935,"threshold_uncertainty_score":0.014190793},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3396608,0.0008771625,0.5928261,0.001202197,0.0002669403,0.00017195904,0.0004199124,0.0004997834,0.064075015],"genre_scores_gemma":[0.87609017,0.0005232485,0.111994416,0.00058655627,0.00017368549,0.00029928048,0.0002948573,0.00013373703,0.009903982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972326,0.00075992924,0.00016768166,0.0006590207,0.00069455605,0.00048606118],"domain_scores_gemma":[0.9933074,0.0029305876,0.0011031927,0.0016883002,0.00064748974,0.0003230024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010915665,0.00071625726,0.00071728666,0.0006702087,0.0014192646,0.0019070302,0.0008716194,0.0009970863,0.0037183757],"category_scores_gemma":[0.008854504,0.00068742357,0.00059764745,0.0008211851,0.0032482368,0.0036086917,0.004767503,0.0015448801,0.0006414641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015750955,0.000040955063,0.0013546987,0.00011160975,0.000028751474,0.00063316646,0.00053071714,0.008540271,0.0130218435,0.9545707,0.0028313377,0.018178416],"study_design_scores_gemma":[0.00007273722,0.00012653541,0.0011780597,0.00008208679,0.000037269197,0.0014572951,0.0005486264,0.058369648,0.0145077715,0.9042752,0.019289866,0.00005482801],"about_ca_topic_score_codex":0.0007372076,"about_ca_topic_score_gemma":0.0008458888,"teacher_disagreement_score":0.0037183757,"about_ca_system_score_codex":0.0004996591,"about_ca_system_score_gemma":0.0007175732,"threshold_uncertainty_score":0.012439191},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025988797,0.003246095,0.94170964,0.0011384579,0.00054792844,0.00008333119,0.00016815602,0.00055831624,0.026559288],"genre_scores_gemma":[0.21921468,0.003120712,0.7550357,0.0013279979,0.00053745613,0.00019681398,0.00022614124,0.00052018015,0.019820368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987336,0.00054527353,0.00006749446,0.00020566842,0.00036197744,0.00008604104],"domain_scores_gemma":[0.9968802,0.0014974672,0.00018935508,0.0009819219,0.00034643512,0.00010478304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002062922,0.00078387343,0.00072218606,0.0014662588,0.0012801521,0.0013997375,0.0009861425,0.0013446733,0.00600675],"category_scores_gemma":[0.0040992443,0.0007686225,0.001198041,0.0012286514,0.00339061,0.00334548,0.0015974646,0.0035178044,0.0026285858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104515384,0.000046823818,0.00040370142,0.00031677942,0.000042725154,0.00014967399,0.00060666975,0.0047906497,0.009589976,0.89343923,0.0035467073,0.08696256],"study_design_scores_gemma":[0.000075319134,0.0003412348,0.00040399507,0.0001900468,0.00004899862,0.0009890015,0.00016829427,0.013704075,0.014134215,0.8500174,0.119802885,0.00012448225],"about_ca_topic_score_codex":0.00038938926,"about_ca_topic_score_gemma":0.0007539956,"teacher_disagreement_score":0.00600675,"about_ca_system_score_codex":0.0009876442,"about_ca_system_score_gemma":0.0006621024,"threshold_uncertainty_score":0.020094573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031577736,0.0004585621,0.9501371,0.00038899458,0.00019771341,0.000059118458,0.00012571612,0.00017967296,0.016875423],"genre_scores_gemma":[0.7134629,0.0011953205,0.26088548,0.0007571727,0.0006410867,0.00023157963,0.0003419204,0.00018279301,0.022301706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997767,0.0007291006,0.00009245363,0.00040514494,0.0007549909,0.00025139964],"domain_scores_gemma":[0.9926561,0.0038353675,0.0007929922,0.0011903218,0.0012099531,0.00031525578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016958024,0.0011010618,0.00071369123,0.001360805,0.0010082038,0.0016066282,0.00092084735,0.0013641014,0.007194442],"category_scores_gemma":[0.014741697,0.00044457527,0.0005093514,0.0011342609,0.0015741108,0.0028348987,0.0016670823,0.0017108319,0.0017561478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092550516,0.000036671507,0.0007146231,0.00012978383,0.000047329493,0.00017037978,0.00013472057,0.030549904,0.014607738,0.9061601,0.0031182196,0.04423802],"study_design_scores_gemma":[0.000019671785,0.00008748808,0.00047215345,0.000055832614,0.00002747681,0.00044237572,0.00007871723,0.22729634,0.009982776,0.75222635,0.009261704,0.000049059658],"about_ca_topic_score_codex":0.00039037623,"about_ca_topic_score_gemma":0.00045528507,"teacher_disagreement_score":0.007194442,"about_ca_system_score_codex":0.0005018208,"about_ca_system_score_gemma":0.0005620567,"threshold_uncertainty_score":0.02406776},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1982559,0.0021342498,0.7174034,0.0016776827,0.0001877009,0.00026696766,0.00075628894,0.00067963457,0.07863818],"genre_scores_gemma":[0.85086435,0.0018577077,0.12707461,0.00073287473,0.00035434455,0.000926836,0.000637993,0.000282378,0.017268918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559754,0.001245567,0.00027168207,0.0010214152,0.0012967236,0.0005670853],"domain_scores_gemma":[0.9722945,0.02103577,0.0015604271,0.0023540566,0.0017197151,0.0010354634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051275245,0.0014019228,0.0015326638,0.0021796199,0.0016763358,0.0023996204,0.0017589369,0.0016307412,0.015342402],"category_scores_gemma":[0.031375155,0.0013863095,0.0015127972,0.0015111581,0.0033078778,0.005637614,0.0038004715,0.004850542,0.0018870052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003824142,0.00014382828,0.002333287,0.0006570495,0.000093616734,0.0003377123,0.00061425427,0.02705864,0.016455699,0.9168722,0.0034902475,0.03156098],"study_design_scores_gemma":[0.00010070802,0.00049451477,0.0014299703,0.00020732777,0.0000965729,0.00085214514,0.000297412,0.10637399,0.014960458,0.85945684,0.01564053,0.0000895176],"about_ca_topic_score_codex":0.00029821962,"about_ca_topic_score_gemma":0.00030550064,"teacher_disagreement_score":0.015342402,"about_ca_system_score_codex":0.0012985237,"about_ca_system_score_gemma":0.0008372985,"threshold_uncertainty_score":0.0513255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7940955,0.0011758695,0.15532227,0.0007265084,0.00015836074,0.00009623062,0.0003053633,0.0002421077,0.047877785],"genre_scores_gemma":[0.9722477,0.0005988652,0.018223729,0.00017205163,0.00009909999,0.000058327812,0.00021456959,0.00004527135,0.008340302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997185,0.000059092494,0.00001327628,0.00007928872,0.000057951584,0.0000719748],"domain_scores_gemma":[0.99831665,0.0009019076,0.0002760552,0.00017638221,0.0001448073,0.00018413668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025441483,0.00045182309,0.00029977836,0.0008604853,0.0009740587,0.0012648249,0.00040032362,0.00043355027,0.004784432],"category_scores_gemma":[0.0024191975,0.0003199894,0.0003459177,0.00065504113,0.0010393541,0.0017226419,0.0007647225,0.0007542173,0.00047952277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002565302,0.0001326348,0.004598645,0.00022779287,0.00005180237,0.00097622845,0.0010568938,0.019423507,0.017350096,0.9051321,0.00572736,0.045066364],"study_design_scores_gemma":[0.00005895425,0.00013774367,0.001330624,0.000048220834,0.00005098223,0.00049859873,0.00036474486,0.06864217,0.0093110185,0.90541357,0.014112306,0.000031108542],"about_ca_topic_score_codex":0.0014716919,"about_ca_topic_score_gemma":0.0025407376,"teacher_disagreement_score":0.004784432,"about_ca_system_score_codex":0.0006933216,"about_ca_system_score_gemma":0.00050561654,"threshold_uncertainty_score":0.016005516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21682693,0.008959358,0.67166334,0.0032583352,0.0011646589,0.00038230146,0.0010260006,0.0018556282,0.09486348],"genre_scores_gemma":[0.56389844,0.004416008,0.41016003,0.00090476667,0.00063158345,0.0005068966,0.00214953,0.0006074406,0.016725373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967024,0.00048245722,0.00022808039,0.0004791451,0.0015446886,0.0005631515],"domain_scores_gemma":[0.9947766,0.0030761007,0.00037198587,0.0008540134,0.0007704214,0.00015086067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014422862,0.0016013623,0.00082221796,0.0015623479,0.0014186605,0.0024532543,0.0022457072,0.0009368075,0.0077008195],"category_scores_gemma":[0.010691534,0.0005970627,0.0013958465,0.0022864214,0.0022825652,0.00858827,0.0025158764,0.0031589034,0.0030892175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013963042,0.00032556462,0.0043329555,0.00097453943,0.00022456898,0.0004731774,0.0007043632,0.14408961,0.04231817,0.43168107,0.03450825,0.33897135],"study_design_scores_gemma":[0.00015797063,0.00050225493,0.0020203989,0.00018716928,0.00013713355,0.00082615763,0.00025788724,0.5014089,0.029544493,0.43007326,0.034721117,0.00016318035],"about_ca_topic_score_codex":0.003130611,"about_ca_topic_score_gemma":0.0060098735,"teacher_disagreement_score":0.0077008195,"about_ca_system_score_codex":0.0023963547,"about_ca_system_score_gemma":0.0028467975,"threshold_uncertainty_score":0.025761843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6493546,0.0008558137,0.20058092,0.0011020832,0.0005388883,0.00019270422,0.0005021556,0.0008459698,0.14602682],"genre_scores_gemma":[0.9523113,0.00045425288,0.02956186,0.00037331952,0.00024422703,0.000112289206,0.00034588613,0.00010167429,0.016495233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992843,0.0001493054,0.000038398663,0.00021679392,0.0001805803,0.00013069529],"domain_scores_gemma":[0.998618,0.00046773686,0.00015248494,0.00025261936,0.00020141338,0.00030773296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048039499,0.0002904149,0.00020235215,0.0012711969,0.0010070081,0.0015401989,0.00051522464,0.00048631313,0.0066162264],"category_scores_gemma":[0.0025682698,0.0003448662,0.00040536103,0.0005634782,0.0014694519,0.002693576,0.0017056665,0.0012636273,0.0006905859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039929393,0.000061058854,0.00070861,0.000054930202,0.0000086710115,0.00021985685,0.0006198911,0.0009487274,0.0043203505,0.97319114,0.0014054604,0.018421385],"study_design_scores_gemma":[0.000031451495,0.000050652183,0.0010743873,0.000022546674,0.000013109547,0.0005246367,0.00042542693,0.007374574,0.0042119883,0.97118145,0.015069,0.00002068139],"about_ca_topic_score_codex":0.0009438885,"about_ca_topic_score_gemma":0.0006683433,"teacher_disagreement_score":0.0066162264,"about_ca_system_score_codex":0.0007562022,"about_ca_system_score_gemma":0.00038952456,"threshold_uncertainty_score":0.02213353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06314203,0.0009951703,0.89274806,0.0025180127,0.00016983566,0.00033541338,0.00071706437,0.0036532006,0.03572121],"genre_scores_gemma":[0.22415091,0.00072421774,0.76272774,0.00041345,0.00009202839,0.00039255247,0.0015740254,0.00049372594,0.009431354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910104,0.00019546713,0.00006675419,0.00024908048,0.00019013343,0.00019769353],"domain_scores_gemma":[0.99853075,0.000803884,0.00011744948,0.00032857383,0.00014588346,0.00007331732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007799843,0.0010290953,0.0008396187,0.00097217056,0.0016691213,0.001959828,0.0026557178,0.001616072,0.010506878],"category_scores_gemma":[0.004539138,0.0006736298,0.0013240202,0.0020810706,0.0010538157,0.004070053,0.0030794835,0.0024342153,0.002135014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035289652,0.0002557277,0.0013282824,0.0007126911,0.000098318116,0.00018251319,0.0007542062,0.154272,0.0063829706,0.45744076,0.04432199,0.3338977],"study_design_scores_gemma":[0.00017282557,0.00007214301,0.00029809854,0.00006703211,0.00004232923,0.00018207468,0.00036294403,0.43790585,0.0058457917,0.535252,0.019761467,0.00003736361],"about_ca_topic_score_codex":0.004432999,"about_ca_topic_score_gemma":0.0066889278,"teacher_disagreement_score":0.010506878,"about_ca_system_score_codex":0.0015430966,"about_ca_system_score_gemma":0.0022343867,"threshold_uncertainty_score":0.03514898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76753783,0.0007497348,0.123115435,0.0016736713,0.0002018418,0.00012195433,0.0017477759,0.001127913,0.10372384],"genre_scores_gemma":[0.9747233,0.00024001898,0.013010005,0.00032135402,0.000104615814,0.00024335505,0.0011276817,0.00025823884,0.009971484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982798,0.00046077865,0.000068460686,0.00038750254,0.00038447103,0.000418952],"domain_scores_gemma":[0.9913254,0.0050295056,0.0006789366,0.0012207394,0.00080634875,0.0009391601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010054623,0.00079414935,0.0007586458,0.0033858586,0.0035421113,0.0026358815,0.0016001399,0.0018231041,0.014184122],"category_scores_gemma":[0.011568434,0.00090431626,0.0009624926,0.0014240694,0.0022228274,0.0026717961,0.002007862,0.0021918162,0.0011646992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024177408,0.000091602706,0.0036435272,0.00011756862,0.000049636812,0.00073571905,0.00044242432,0.0152300075,0.0048334342,0.95134294,0.010353571,0.012917739],"study_design_scores_gemma":[0.000078262376,0.00007499514,0.0023555753,0.00007690683,0.000034726832,0.0021383872,0.00035654186,0.10176421,0.0035028635,0.8810773,0.00847236,0.00006788377],"about_ca_topic_score_codex":0.00087531505,"about_ca_topic_score_gemma":0.0010595561,"teacher_disagreement_score":0.014184122,"about_ca_system_score_codex":0.0014680163,"about_ca_system_score_gemma":0.000731625,"threshold_uncertainty_score":0.047450602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6555965,0.0044030505,0.1846679,0.0035542902,0.0003329628,0.00008928448,0.0014281975,0.0006326694,0.1492952],"genre_scores_gemma":[0.94653255,0.0022200735,0.036006894,0.00044025297,0.00025324046,0.00009978067,0.00075313915,0.00023016326,0.013463925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994497,0.000116334006,0.00001600457,0.00016243845,0.00012358821,0.00013198661],"domain_scores_gemma":[0.9957457,0.002922744,0.00034990945,0.0003016841,0.00036825746,0.0003117439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513655,0.00060271734,0.00041335158,0.0021471586,0.0011892681,0.00187036,0.000835304,0.00057805894,0.007391579],"category_scores_gemma":[0.004724554,0.00033252183,0.00030969593,0.002061779,0.002761504,0.002779722,0.0011475005,0.0017389859,0.0008193116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006034376,0.00010254081,0.006619094,0.00028419023,0.000055294626,0.00019273344,0.0006914027,0.08340951,0.018216131,0.8183638,0.015634863,0.055826902],"study_design_scores_gemma":[0.000051070572,0.00007984291,0.0035279435,0.00011204767,0.000031826265,0.00025362583,0.00038790412,0.14649712,0.0067928634,0.82476306,0.017428184,0.00007443356],"about_ca_topic_score_codex":0.004918168,"about_ca_topic_score_gemma":0.0049574,"teacher_disagreement_score":0.007391579,"about_ca_system_score_codex":0.0020651587,"about_ca_system_score_gemma":0.0007640061,"threshold_uncertainty_score":0.024727285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32008487,0.0027196875,0.54453754,0.0014061079,0.00037819915,0.00020480389,0.0023738225,0.0006141202,0.12768087],"genre_scores_gemma":[0.81682897,0.0011245759,0.16226193,0.00045595606,0.00025548902,0.00030755147,0.0022764443,0.00015563908,0.01633348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871016,0.00022379952,0.00009244091,0.00041186594,0.0003766178,0.00018519672],"domain_scores_gemma":[0.99644417,0.0015583201,0.0004938948,0.000607136,0.0006728104,0.0002236434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063902023,0.00055484154,0.00063597935,0.0023711154,0.0021055278,0.0028642223,0.0009909449,0.0008657603,0.005920895],"category_scores_gemma":[0.0039011696,0.0005236302,0.0006214168,0.001851008,0.0032528376,0.0033654144,0.0030125312,0.0012104887,0.001313929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013527194,0.000023872544,0.001561979,0.00016652927,0.000032814358,0.00029054022,0.0013105499,0.0023045728,0.007606777,0.9545378,0.0032643287,0.028765034],"study_design_scores_gemma":[0.00005698988,0.00008152478,0.0036163642,0.0001428954,0.0000732569,0.0014709888,0.0013284951,0.01176565,0.019496066,0.8133081,0.14858492,0.00007473818],"about_ca_topic_score_codex":0.0011531239,"about_ca_topic_score_gemma":0.00074880145,"teacher_disagreement_score":0.005920895,"about_ca_system_score_codex":0.0008651744,"about_ca_system_score_gemma":0.00041363973,"threshold_uncertainty_score":0.019807339},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03389578,0.00046518774,0.9131757,0.00069473946,0.00018373299,0.00013549003,0.00037190146,0.00037947696,0.05069807],"genre_scores_gemma":[0.4563775,0.0009827183,0.51866364,0.0006117686,0.00023065039,0.00047586687,0.0014120651,0.00062198535,0.020623729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979988,0.0005213752,0.00012461605,0.00038524868,0.00074459595,0.00022537351],"domain_scores_gemma":[0.99431384,0.003597472,0.00026785987,0.0010465438,0.00051050214,0.0002637627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015461176,0.000649515,0.000758451,0.0021706212,0.0020105478,0.0027119543,0.0019746132,0.001151733,0.016088156],"category_scores_gemma":[0.009628999,0.00074984046,0.0016053512,0.002665921,0.0025727602,0.006774668,0.0054904986,0.004322631,0.0023565288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029874749,0.000020293788,0.00014599353,0.00006686289,0.000005296339,0.00004147737,0.00019541608,0.0031546033,0.0017492371,0.9771221,0.001575859,0.015893014],"study_design_scores_gemma":[0.000016587754,0.000034498335,0.00008835532,0.000027986644,0.00000954454,0.00016614105,0.00011128056,0.015873171,0.0026352534,0.96589535,0.015127214,0.00001456217],"about_ca_topic_score_codex":0.00034745477,"about_ca_topic_score_gemma":0.0004588827,"teacher_disagreement_score":0.016088156,"about_ca_system_score_codex":0.0013961982,"about_ca_system_score_gemma":0.00058475276,"threshold_uncertainty_score":0.053820252},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10319298,0.0010351065,0.8483156,0.0004871751,0.000279264,0.000090465364,0.00023278462,0.00019768442,0.04616885],"genre_scores_gemma":[0.7153949,0.000926943,0.2681344,0.00043839795,0.00026321656,0.0001629159,0.00024284585,0.00008961113,0.014346779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900997,0.0002940821,0.000044758912,0.00015375954,0.0003467765,0.00015064297],"domain_scores_gemma":[0.9987311,0.0003919702,0.0001965175,0.0003057355,0.00026302066,0.00011166827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069787446,0.000671289,0.00038010316,0.0011540866,0.0006641048,0.0013060806,0.00049979106,0.0007732213,0.003795308],"category_scores_gemma":[0.0025835128,0.00034338984,0.00035625312,0.00073480495,0.0011405786,0.0013761354,0.001172393,0.0013309632,0.00088582473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003518617,0.000016128648,0.00024603872,0.000030908246,0.0000062017675,0.0000910253,0.00009737987,0.0059142793,0.009492842,0.9735194,0.00068459194,0.009866029],"study_design_scores_gemma":[0.000022789067,0.00010461179,0.00041847388,0.00004815041,0.000013352855,0.00045055512,0.00011327272,0.073565155,0.025092024,0.88156015,0.018561328,0.000050315877],"about_ca_topic_score_codex":0.00027711847,"about_ca_topic_score_gemma":0.00030646884,"teacher_disagreement_score":0.003795308,"about_ca_system_score_codex":0.00038246252,"about_ca_system_score_gemma":0.00032196805,"threshold_uncertainty_score":0.012696505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04312694,0.0032433765,0.12453296,0.0054432466,0.007518145,0.00025627288,0.015067927,0.024445478,0.77636576],"genre_scores_gemma":[0.36640495,0.005012873,0.0972389,0.0032686682,0.002692668,0.0006192823,0.01941828,0.008530539,0.4968139],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999548,0.000038464954,0.000028235894,0.00009095441,0.00022056221,0.000073711235],"domain_scores_gemma":[0.99823076,0.0003843143,0.00019826453,0.00044682543,0.00054564595,0.00019424682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019881768,0.0011001445,0.000704557,0.0015601306,0.00074463116,0.0024764403,0.0004433752,0.0008432416,0.32044435],"category_scores_gemma":[0.0036570411,0.0004721885,0.0004465073,0.0014029973,0.00048292428,0.0034349372,0.0011933118,0.000872762,0.14555953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006478177,0.000090815316,0.0010993021,0.0006645005,0.000029063105,0.0005633485,0.00020652014,0.00080311875,0.02432838,0.085196525,0.5422894,0.3440812],"study_design_scores_gemma":[0.00012300139,0.000117338976,0.0025725744,0.00021738208,0.000021199405,0.0019395149,0.00022766764,0.0036451705,0.019684587,0.14008135,0.8313094,0.00006088796],"about_ca_topic_score_codex":0.00031912263,"about_ca_topic_score_gemma":0.00048278391,"teacher_disagreement_score":0.32044435,"about_ca_system_score_codex":0.00030378267,"about_ca_system_score_gemma":0.0002978443,"threshold_uncertainty_score":0.96930367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4505635,0.0007121034,0.51412225,0.00043491917,0.0000947118,0.0001290541,0.00065401394,0.00074010546,0.03254932],"genre_scores_gemma":[0.9088935,0.00038872997,0.08127762,0.00020119923,0.00005676233,0.00026585514,0.00054645375,0.00012002244,0.008249915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998271,0.00049639563,0.00007678617,0.00038512674,0.00043777237,0.0003328728],"domain_scores_gemma":[0.9965233,0.0015110351,0.00051254925,0.0008234138,0.00030624343,0.00032333413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090372015,0.0011758315,0.0007360184,0.0007767636,0.0009929267,0.0013017321,0.0008948608,0.0007881382,0.008558367],"category_scores_gemma":[0.00555463,0.00063900626,0.0004851817,0.0009419041,0.0010380237,0.0016207373,0.0023888724,0.0010717119,0.0016626146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013993602,0.00020156389,0.0072200024,0.00046231615,0.00012517655,0.00093400764,0.00060203014,0.12734318,0.10875175,0.60541135,0.0062962384,0.14125304],"study_design_scores_gemma":[0.00026764252,0.0013146448,0.0033406091,0.00018428557,0.000117055955,0.0015674764,0.0004785133,0.39183274,0.08305454,0.4870781,0.03065028,0.0001141021],"about_ca_topic_score_codex":0.0005097152,"about_ca_topic_score_gemma":0.00065071794,"teacher_disagreement_score":0.008558367,"about_ca_system_score_codex":0.0007601608,"about_ca_system_score_gemma":0.00043670827,"threshold_uncertainty_score":0.028630555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16701593,0.004254272,0.7600969,0.0041685733,0.000629515,0.00041218547,0.0033375074,0.0014962576,0.058588777],"genre_scores_gemma":[0.8407214,0.0024497705,0.13922036,0.0009822398,0.000729118,0.0005975914,0.001975535,0.0007420786,0.012581942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99395895,0.0012979445,0.0003331087,0.001358922,0.0021319564,0.00091909897],"domain_scores_gemma":[0.9294212,0.05059061,0.0031339766,0.011998377,0.0024687897,0.0023871122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004383829,0.0012556226,0.0017784392,0.0021439488,0.0025191202,0.0040778555,0.002981937,0.0030078844,0.012575591],"category_scores_gemma":[0.043985724,0.001301116,0.0020500498,0.0023872468,0.0049760565,0.01564434,0.006662153,0.0064271735,0.0025737602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016354172,0.00019764651,0.004833219,0.000936562,0.00021380304,0.00065748673,0.0012444179,0.037034187,0.03225902,0.8308809,0.013258722,0.07684871],"study_design_scores_gemma":[0.00008510936,0.00032378125,0.0016260664,0.00017973271,0.00019658075,0.0014365206,0.0002011652,0.06500982,0.021283638,0.88545674,0.024073942,0.00012698467],"about_ca_topic_score_codex":0.0006400091,"about_ca_topic_score_gemma":0.00043686337,"teacher_disagreement_score":0.012575591,"about_ca_system_score_codex":0.002445132,"about_ca_system_score_gemma":0.001424403,"threshold_uncertainty_score":0.042069554},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063844256,0.0020968358,0.83433634,0.0022096327,0.0009952076,0.0013235051,0.0030626,0.023383014,0.068748586],"genre_scores_gemma":[0.16959198,0.00047943107,0.8006286,0.00093307806,0.00016205624,0.00070848933,0.0032006195,0.0011434389,0.023152243],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538594,0.0011746746,0.00049433595,0.0007116975,0.0017928772,0.00044050528],"domain_scores_gemma":[0.98603433,0.003980021,0.00070489215,0.005351568,0.003599916,0.00032928045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028598867,0.0010865922,0.0010926276,0.0021497367,0.0010116758,0.0025986307,0.0025392263,0.001104211,0.029748062],"category_scores_gemma":[0.015011377,0.0010795796,0.001672622,0.0024668118,0.00073327794,0.0038933612,0.001848594,0.0017460694,0.009154831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013418568,0.0007062596,0.0053027957,0.0008352388,0.00011754656,0.00031323425,0.00035835608,0.0530188,0.024437303,0.08732039,0.069316335,0.7569319],"study_design_scores_gemma":[0.0007696959,0.0018177275,0.0026631376,0.00039181297,0.0002092855,0.0015247482,0.00032235341,0.33957025,0.046309944,0.10891307,0.4973113,0.00019669217],"about_ca_topic_score_codex":0.0026732094,"about_ca_topic_score_gemma":0.005941644,"teacher_disagreement_score":0.029748062,"about_ca_system_score_codex":0.0018000073,"about_ca_system_score_gemma":0.0036412664,"threshold_uncertainty_score":0.09951717},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10794732,0.011084294,0.32518017,0.043561272,0.004218134,0.0002927129,0.0038804833,0.003594111,0.5002416],"genre_scores_gemma":[0.8149323,0.006529024,0.10180107,0.008985009,0.007291662,0.0011729456,0.004093592,0.0024915326,0.052702945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899713,0.0028472338,0.00033551155,0.0018286516,0.003181283,0.0018360503],"domain_scores_gemma":[0.9436323,0.043023787,0.001305251,0.0067950487,0.0030440884,0.0021995907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008853876,0.0039803735,0.00553705,0.007124046,0.0057557235,0.011584955,0.008505442,0.005776641,0.047084365],"category_scores_gemma":[0.046294514,0.0018669697,0.0036475619,0.0078626815,0.009396739,0.025816374,0.0129423775,0.01978611,0.012227047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069164886,0.00028881477,0.0010835126,0.00049120054,0.0000883134,0.0001892463,0.0005063315,0.009802677,0.0016697719,0.9200491,0.038853433,0.026286038],"study_design_scores_gemma":[0.000058403053,0.00003168821,0.00023204062,0.0000836089,0.00005606324,0.0000723094,0.00007642757,0.02008775,0.00058528234,0.9730907,0.0055890544,0.00003684155],"about_ca_topic_score_codex":0.0034977996,"about_ca_topic_score_gemma":0.0037286158,"teacher_disagreement_score":0.047084365,"about_ca_system_score_codex":0.006723432,"about_ca_system_score_gemma":0.0029910398,"threshold_uncertainty_score":0.1575129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46389112,0.0025524292,0.41099375,0.0020783823,0.0006743401,0.00008114411,0.0005032626,0.00025176318,0.11897378],"genre_scores_gemma":[0.95120174,0.0014764784,0.022120398,0.00047185147,0.00057809916,0.000056553177,0.0002573069,0.000080760685,0.023756852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953616,0.000102032565,0.00001585502,0.00009148539,0.00015464824,0.00009978464],"domain_scores_gemma":[0.9985398,0.0006223821,0.00025581804,0.00013464039,0.00028128826,0.00016604127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047787937,0.00086415524,0.00077333476,0.00201945,0.0014315513,0.002423548,0.0006883236,0.0012213947,0.004936128],"category_scores_gemma":[0.002199239,0.000312359,0.00052171934,0.0017064763,0.0017048409,0.0018161114,0.000795036,0.0013417917,0.0007050006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026801297,0.00001812652,0.00016236759,0.000026944146,0.0000061406463,0.00011839121,0.00009814405,0.0039842026,0.0016295024,0.98987716,0.001062744,0.0029895203],"study_design_scores_gemma":[0.000018127117,0.000030457019,0.00037166986,0.000021512857,0.0000054351017,0.00028643516,0.000064495594,0.05217764,0.0007080227,0.9422347,0.0040579415,0.000023610695],"about_ca_topic_score_codex":0.0013996463,"about_ca_topic_score_gemma":0.0009431235,"teacher_disagreement_score":0.004936128,"about_ca_system_score_codex":0.0009965252,"about_ca_system_score_gemma":0.0006134728,"threshold_uncertainty_score":0.01651299},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036527,0.00069693686,0.9401322,0.00094235584,0.00032437814,0.0001524603,0.001594334,0.00041923442,0.019211117],"genre_scores_gemma":[0.74602485,0.0016013765,0.23011586,0.0010088156,0.0009412266,0.00082813017,0.0028456282,0.00033621496,0.016297841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99026275,0.0045338627,0.0005340232,0.0019251319,0.0022928056,0.00045131924],"domain_scores_gemma":[0.96590036,0.01826441,0.004087531,0.0051746834,0.00564579,0.00092728407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004967765,0.0013092932,0.0010930304,0.0054558143,0.0011509269,0.0052042753,0.0013383942,0.0018333853,0.009215302],"category_scores_gemma":[0.040323097,0.00075244094,0.0009291977,0.0043770615,0.0029484425,0.004570392,0.0017835016,0.0014943961,0.0029510383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055556593,0.000035864425,0.0015631912,0.000068170324,0.00007033053,0.00019456733,0.00021591858,0.008721545,0.0012129724,0.95648336,0.0046890597,0.026689352],"study_design_scores_gemma":[0.000014992317,0.000048474973,0.0012442102,0.00003949897,0.000026531356,0.00039739977,0.00008410133,0.044933807,0.0011756076,0.9435816,0.008383105,0.00007071541],"about_ca_topic_score_codex":0.001028936,"about_ca_topic_score_gemma":0.00075570116,"teacher_disagreement_score":0.009215302,"about_ca_system_score_codex":0.0008209313,"about_ca_system_score_gemma":0.0016067758,"threshold_uncertainty_score":0.030828238},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016703555,0.00020790785,0.9792676,0.00017386368,0.000037818194,0.000033206423,0.000093704264,0.00034670433,0.0031356001],"genre_scores_gemma":[0.3645368,0.00043447537,0.623026,0.00035797778,0.000085459294,0.00016785035,0.0004029555,0.00023005094,0.010758416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878234,0.00028058005,0.00006931252,0.00021419876,0.0005122499,0.00014137369],"domain_scores_gemma":[0.9964379,0.00173873,0.0003145543,0.0007537901,0.0006606858,0.00009435459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091305556,0.0007312361,0.00069173926,0.0007762393,0.00062934164,0.0011132977,0.0012118326,0.0011148215,0.002576261],"category_scores_gemma":[0.0051718364,0.00032564782,0.00045771434,0.0009480362,0.0011164092,0.002002627,0.0012114501,0.00207047,0.0012294485],"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.0003465125,0.00011827039,0.0009652576,0.0002614272,0.00006118613,0.0003900622,0.00027186694,0.36053938,0.038077723,0.37373534,0.0039263214,0.22130659],"study_design_scores_gemma":[0.00003469454,0.00008284279,0.00015812535,0.00003405602,0.000011241605,0.00029359004,0.000030508962,0.8809039,0.033392232,0.080320254,0.004698976,0.00003955834],"about_ca_topic_score_codex":0.0013367612,"about_ca_topic_score_gemma":0.0016022278,"teacher_disagreement_score":0.002576261,"about_ca_system_score_codex":0.0010515527,"about_ca_system_score_gemma":0.0016631434,"threshold_uncertainty_score":0.008618474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5967661,0.0008703309,0.36184683,0.00045496412,0.00017404676,0.00016394789,0.00079317874,0.00032579148,0.038604658],"genre_scores_gemma":[0.85558736,0.00027167282,0.13478415,0.00008279976,0.000041188738,0.000074229574,0.0005975836,0.00005269652,0.008508337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996111,0.00008663559,0.000020309895,0.00006646288,0.00015179304,0.00006374908],"domain_scores_gemma":[0.99885845,0.00047049808,0.0001732087,0.00020383975,0.00021648836,0.00007751655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547403,0.00048802016,0.00033929356,0.00073820027,0.00057426596,0.00046633772,0.00036723193,0.00033343353,0.006000697],"category_scores_gemma":[0.0021053797,0.0002057791,0.00045143452,0.00050833117,0.0008964741,0.0008257893,0.0002979664,0.0006516864,0.0010943058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007382175,0.00014432709,0.004398052,0.00037782604,0.000039351493,0.0010503414,0.0004620753,0.04210987,0.091657504,0.75620013,0.004204045,0.0986183],"study_design_scores_gemma":[0.0001922998,0.0011329429,0.003886084,0.00011476205,0.00006942697,0.0032084468,0.0004285767,0.18419844,0.22138031,0.5321005,0.05307435,0.0002138941],"about_ca_topic_score_codex":0.000549465,"about_ca_topic_score_gemma":0.0007217327,"teacher_disagreement_score":0.006000697,"about_ca_system_score_codex":0.000469165,"about_ca_system_score_gemma":0.0005664091,"threshold_uncertainty_score":0.020074308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6022239,0.0011103873,0.31796438,0.0076969126,0.00046675786,0.00020022997,0.001190114,0.0012768151,0.06787051],"genre_scores_gemma":[0.9418034,0.00050116936,0.04535357,0.0012084029,0.00040797231,0.00018497663,0.00064383005,0.00033373077,0.009562983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973598,0.0006689672,0.00014542528,0.0006260671,0.0006990207,0.00050074473],"domain_scores_gemma":[0.9664178,0.020801129,0.0030614329,0.005646695,0.0021182562,0.001954641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025535163,0.0007684335,0.0011529762,0.0016747501,0.0015948601,0.0023384353,0.002537903,0.0020153997,0.011606111],"category_scores_gemma":[0.02565652,0.0007134376,0.0012519647,0.001997879,0.0030909919,0.008261106,0.0035937303,0.0045326445,0.0014849105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095899607,0.00019889222,0.0077742385,0.00033801893,0.000078036464,0.0006364029,0.00070349325,0.04044581,0.011844382,0.8921076,0.0098994095,0.03501481],"study_design_scores_gemma":[0.000087630986,0.00018881328,0.0020741385,0.000043557833,0.00004671959,0.0005870709,0.00016409263,0.08165761,0.003967448,0.90347207,0.0076391357,0.00007168075],"about_ca_topic_score_codex":0.0009895514,"about_ca_topic_score_gemma":0.00087091245,"teacher_disagreement_score":0.011606111,"about_ca_system_score_codex":0.0016333566,"about_ca_system_score_gemma":0.0006687298,"threshold_uncertainty_score":0.038826287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54441833,0.00034140848,0.23650375,0.0006155465,0.0005245322,0.00027392394,0.00338344,0.0013135817,0.21262547],"genre_scores_gemma":[0.88672996,0.00039602528,0.054690387,0.00015662095,0.00023393988,0.00023240774,0.0034135105,0.0007317747,0.053415515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994444,0.000045685683,0.000030035357,0.00011429675,0.00021575234,0.00014976501],"domain_scores_gemma":[0.9989735,0.0002927467,0.00016990856,0.0001182772,0.00027350042,0.00017204537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002735062,0.0006839934,0.00044060522,0.0023127021,0.00094934733,0.002688039,0.0006513067,0.0004662475,0.032987665],"category_scores_gemma":[0.0022538216,0.00031734808,0.00052157015,0.0018147789,0.0014285212,0.0020556883,0.00095486594,0.0012741084,0.0058617224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029783743,0.00014887392,0.0035792375,0.00015319255,0.000023317152,0.0009965753,0.00074950047,0.0052760234,0.014186297,0.877053,0.023876322,0.07365982],"study_design_scores_gemma":[0.00007600045,0.00012662784,0.009051693,0.000081579514,0.00002862749,0.0008720465,0.00076530554,0.021103486,0.019076552,0.8911288,0.05758691,0.00010235428],"about_ca_topic_score_codex":0.0019061799,"about_ca_topic_score_gemma":0.0023685023,"teacher_disagreement_score":0.032987665,"about_ca_system_score_codex":0.0010210576,"about_ca_system_score_gemma":0.00062128354,"threshold_uncertainty_score":0.11035472},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2566459,0.0029592412,0.10166475,0.00666226,0.0014082029,0.000117734344,0.0007565986,0.0004191123,0.6293662],"genre_scores_gemma":[0.91712683,0.0011061161,0.019757537,0.0010354511,0.00035919787,0.000091660375,0.00047765515,0.00010094842,0.05994459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939966,0.00013859298,0.000025331121,0.00013050411,0.00015134814,0.00015457581],"domain_scores_gemma":[0.9993006,0.0003296907,0.00006558461,0.00011548854,0.00010475444,0.00008382913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068298366,0.0006073461,0.0006900221,0.0016856936,0.0024005612,0.002833358,0.00094725343,0.0012093161,0.016039725],"category_scores_gemma":[0.0018687235,0.00031592927,0.00085461425,0.0011578602,0.0034542144,0.0043659685,0.0020139252,0.0030253688,0.0015268632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022772334,0.000010012715,0.00012233669,0.000025039059,0.0000068178438,0.00009387441,0.00011606223,0.00029405765,0.00018889565,0.9935703,0.001892431,0.0036572397],"study_design_scores_gemma":[0.000019006526,0.000009227781,0.00029345564,0.000012992475,0.000008516676,0.0001634843,0.00010090763,0.0007955391,0.00040805512,0.98822,0.009960189,0.000008739463],"about_ca_topic_score_codex":0.0027972015,"about_ca_topic_score_gemma":0.0023396784,"teacher_disagreement_score":0.016039725,"about_ca_system_score_codex":0.0014484423,"about_ca_system_score_gemma":0.0007544632,"threshold_uncertainty_score":0.053658247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5341334,0.0044937846,0.3447517,0.011920475,0.00047237516,0.0005569439,0.0023048134,0.00050623756,0.10086026],"genre_scores_gemma":[0.8104655,0.004857865,0.14843567,0.001473834,0.0010188579,0.00052337535,0.0029422506,0.00032868955,0.029953826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984415,0.0005728896,0.00007114528,0.00033742658,0.00018649818,0.00039049942],"domain_scores_gemma":[0.9901849,0.0076987953,0.000785194,0.00053098233,0.00034838682,0.0004517339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016531675,0.0011648922,0.0013970395,0.0012202604,0.002324843,0.0026337649,0.0019068932,0.0024623289,0.010751258],"category_scores_gemma":[0.010867566,0.0009111289,0.00088521215,0.0021949157,0.0028993436,0.007567995,0.0022035409,0.0028434517,0.0010461864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007304647,0.00030074109,0.0018159717,0.0005364798,0.00009918901,0.0006050136,0.0008698896,0.1049556,0.002449886,0.80584306,0.026063643,0.05573001],"study_design_scores_gemma":[0.00014569894,0.00006707756,0.00042179658,0.00006261195,0.000028720702,0.00013597924,0.00030029225,0.099202454,0.0006363064,0.89359224,0.005361118,0.000045549597],"about_ca_topic_score_codex":0.010469595,"about_ca_topic_score_gemma":0.009837182,"teacher_disagreement_score":0.010751258,"about_ca_system_score_codex":0.0024779306,"about_ca_system_score_gemma":0.0021814902,"threshold_uncertainty_score":0.035966516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6358085,0.0020471103,0.28782022,0.012465495,0.00030025202,0.00024722706,0.0011195763,0.00048504106,0.05970659],"genre_scores_gemma":[0.95992184,0.0011157402,0.029633196,0.0005811363,0.00035421003,0.00039210974,0.0005227589,0.00018304403,0.007296065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954462,0.0018133037,0.00017589066,0.00063605065,0.0009483501,0.0009802019],"domain_scores_gemma":[0.9494392,0.043622468,0.0024400314,0.0028299543,0.0006709619,0.0009974695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035047606,0.0012640818,0.0016258477,0.0017322709,0.002533783,0.004278672,0.0027497578,0.0026466036,0.0058258614],"category_scores_gemma":[0.02134632,0.0006737014,0.0015891151,0.0021945678,0.004913948,0.011499067,0.0049212542,0.0072784377,0.0007587333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003891026,0.0002053463,0.0016366069,0.00021781755,0.000076823315,0.00026571655,0.00047099433,0.09731656,0.0030906417,0.87999547,0.0043906416,0.011944282],"study_design_scores_gemma":[0.000051139596,0.00004907969,0.0003680015,0.000027498489,0.000022515109,0.00010964698,0.00009631035,0.24047826,0.00098411,0.75647086,0.0013068817,0.000035672027],"about_ca_topic_score_codex":0.0012082309,"about_ca_topic_score_gemma":0.00084886583,"teacher_disagreement_score":0.0058258614,"about_ca_system_score_codex":0.0037628673,"about_ca_system_score_gemma":0.0016549408,"threshold_uncertainty_score":0.02730167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8901707,0.0002414124,0.07481624,0.00024564384,0.000057113273,0.000046538407,0.0002735175,0.00021968318,0.033929124],"genre_scores_gemma":[0.97911364,0.00024569948,0.009367086,0.000043164,0.000020225487,0.00002136549,0.00029348242,0.000036476285,0.010859023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981123,0.00002055238,0.00001546695,0.000035164107,0.0000467298,0.00007081869],"domain_scores_gemma":[0.99955183,0.00014514764,0.000091759706,0.000050365597,0.000048135695,0.00011270439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016132428,0.00024904773,0.00028794984,0.00096342526,0.00070764235,0.0015400295,0.00024229474,0.0003817835,0.0037815897],"category_scores_gemma":[0.0007126253,0.00024327623,0.00032131554,0.0005495593,0.0008618322,0.0012049106,0.0011104303,0.0007582942,0.00035427857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015968118,0.00005619102,0.0018595856,0.0000871153,0.000011623807,0.00055463146,0.0006134936,0.010339764,0.010774009,0.95905757,0.0009792298,0.01550722],"study_design_scores_gemma":[0.00003928059,0.0001101434,0.0033945343,0.000050368108,0.00002436437,0.00051902205,0.0008156479,0.039088275,0.0075760754,0.9309567,0.017384484,0.000041193274],"about_ca_topic_score_codex":0.0012321385,"about_ca_topic_score_gemma":0.0021500222,"teacher_disagreement_score":0.0037815897,"about_ca_system_score_codex":0.0007802333,"about_ca_system_score_gemma":0.00029036563,"threshold_uncertainty_score":0.012650669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41146335,0.0031386218,0.36967763,0.012658766,0.00062656915,0.00026815338,0.001776552,0.00039229126,0.19999811],"genre_scores_gemma":[0.8620449,0.0023597488,0.068560384,0.0015026901,0.0005171701,0.00024651835,0.0008606889,0.00022791744,0.06368002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994318,0.00016083993,0.00002288423,0.00012205603,0.00011674659,0.0001456221],"domain_scores_gemma":[0.99740654,0.0017212374,0.00024974535,0.00022222154,0.00016882362,0.00023142119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005828625,0.0005539757,0.0007600493,0.0009584137,0.0013577318,0.0020260795,0.0015559033,0.002038624,0.013149779],"category_scores_gemma":[0.0048733847,0.00052017206,0.00049997045,0.0014506667,0.0014610398,0.003834186,0.0015639106,0.002201949,0.0009226464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011050723,0.0000501827,0.00031568398,0.00016541187,0.000026372345,0.00016322613,0.00014952468,0.016555864,0.0014070302,0.94766015,0.009948924,0.02344705],"study_design_scores_gemma":[0.00003309969,0.000009768651,0.00011996223,0.000015235583,0.00000662482,0.00003405227,0.00006884746,0.024028841,0.0004745048,0.97195375,0.0032446953,0.000010606542],"about_ca_topic_score_codex":0.0054753497,"about_ca_topic_score_gemma":0.0059199883,"teacher_disagreement_score":0.013149779,"about_ca_system_score_codex":0.0013972983,"about_ca_system_score_gemma":0.0017252022,"threshold_uncertainty_score":0.043990374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2036404,0.0007569078,0.70830923,0.0014905885,0.00053643226,0.00012336306,0.0007726489,0.000396744,0.08397375],"genre_scores_gemma":[0.86085725,0.00060558494,0.0994993,0.00070865,0.0002926216,0.00015876103,0.0005117225,0.00009982555,0.037266318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945587,0.00013640018,0.000023203924,0.000120127326,0.00017516286,0.00008921054],"domain_scores_gemma":[0.99881124,0.00035874054,0.00015752573,0.00022408298,0.00033485584,0.00011357997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043955038,0.00067678484,0.0004337152,0.0011373038,0.00071988313,0.0016707168,0.00060950476,0.00089079654,0.011922355],"category_scores_gemma":[0.0022923367,0.00031508194,0.0002372891,0.0010933804,0.0008395731,0.0019069831,0.0007698818,0.001029137,0.0017080609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001982603,0.000045226367,0.00021395138,0.000045296252,0.000017765253,0.00012916677,0.00010314921,0.009695264,0.014274586,0.9523355,0.0031244012,0.019817524],"study_design_scores_gemma":[0.00004924893,0.00008969697,0.00029659495,0.000023951276,0.000012387469,0.00024337349,0.00009725804,0.07248355,0.007831078,0.9102544,0.0085852975,0.00003301089],"about_ca_topic_score_codex":0.0005497437,"about_ca_topic_score_gemma":0.00075979985,"teacher_disagreement_score":0.011922355,"about_ca_system_score_codex":0.00060309115,"about_ca_system_score_gemma":0.00056323124,"threshold_uncertainty_score":0.03988427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4942149,0.00076779915,0.4280923,0.000943625,0.0006379152,0.0002600156,0.0005111744,0.00051847356,0.07405373],"genre_scores_gemma":[0.92166024,0.00032164247,0.044396847,0.00045668296,0.00023031386,0.00023560501,0.00034296492,0.00008193725,0.03227379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918014,0.00028362212,0.000048209524,0.00014937941,0.00019320037,0.00014540451],"domain_scores_gemma":[0.9979691,0.00069423794,0.0004239853,0.00033258303,0.00036967715,0.00021046361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066598377,0.0005468175,0.0005431157,0.0016635171,0.0013349698,0.0031669165,0.0007558373,0.00169888,0.011281797],"category_scores_gemma":[0.0032636577,0.00044568744,0.0004955402,0.0010147546,0.0014442647,0.0020111392,0.0016641589,0.0011617126,0.0013693821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010875443,0.0000371732,0.00027922657,0.000041645428,0.000014514745,0.00009259642,0.00013064106,0.0034202116,0.0031711177,0.98517275,0.0008423406,0.006688988],"study_design_scores_gemma":[0.0000817611,0.00014084057,0.00025879606,0.000042301763,0.00001956227,0.00017221607,0.00011081366,0.036326982,0.004228404,0.95298064,0.005593624,0.000044025695],"about_ca_topic_score_codex":0.00025832295,"about_ca_topic_score_gemma":0.00038748834,"teacher_disagreement_score":0.011281797,"about_ca_system_score_codex":0.0010105477,"about_ca_system_score_gemma":0.00067997025,"threshold_uncertainty_score":0.037741363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17486276,0.0027850932,0.752207,0.001741267,0.0005210479,0.00013750292,0.00038522482,0.00025757914,0.06710252],"genre_scores_gemma":[0.84984356,0.0025025448,0.110070065,0.00059419597,0.00086522027,0.0002365553,0.00034430315,0.00011394525,0.03542967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690336,0.0009285387,0.00023046618,0.00062278705,0.0009242336,0.00039067038],"domain_scores_gemma":[0.9907548,0.004413248,0.0011762944,0.0017762802,0.0012314493,0.00064778305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004433191,0.00064134615,0.0010510705,0.0027957244,0.0029762054,0.0045181965,0.0015583794,0.0018968685,0.007156173],"category_scores_gemma":[0.008355522,0.00063589937,0.00096911,0.0038273348,0.005144287,0.00918232,0.0032980838,0.0036668396,0.0011589763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010992124,0.0000067679707,0.000037570753,0.0000075928056,0.0000026554662,0.000011136045,0.00007119864,0.00031731403,0.0001618022,0.99750996,0.00013459199,0.001728394],"study_design_scores_gemma":[0.000008245705,0.000014531644,0.00009480062,0.0000105947865,0.000007835093,0.000078591496,0.000036422134,0.005526669,0.00041729663,0.9905381,0.0032522036,0.000014519869],"about_ca_topic_score_codex":0.0006313445,"about_ca_topic_score_gemma":0.00030553734,"teacher_disagreement_score":0.007156173,"about_ca_system_score_codex":0.0014638801,"about_ca_system_score_gemma":0.0013162099,"threshold_uncertainty_score":0.023939729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7202008,0.0010163161,0.13571315,0.0022870451,0.00034789697,0.00013146654,0.00095124124,0.0004808291,0.1388713],"genre_scores_gemma":[0.95886344,0.0004223491,0.02000897,0.00024001492,0.00022234277,0.00008626153,0.00068244705,0.00012424751,0.019349918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990182,0.00031775777,0.000053758846,0.00016110706,0.00022174245,0.0002274163],"domain_scores_gemma":[0.9987484,0.00032516159,0.00020668685,0.00017599514,0.00024369392,0.00029997056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746683,0.00042114814,0.0006233859,0.0022074215,0.0029280637,0.004397799,0.0010905063,0.00095233467,0.01329487],"category_scores_gemma":[0.0026627218,0.000526721,0.00039455475,0.0019704772,0.0038709904,0.0034827606,0.002277414,0.0017662755,0.0014247254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039351235,0.000016733353,0.00040722082,0.000017382436,0.0000040985924,0.000061498686,0.00024492425,0.0008786337,0.0005104867,0.9919023,0.0011318004,0.0047854953],"study_design_scores_gemma":[0.000017353199,0.000025028294,0.0005500032,0.000013126919,0.0000041458416,0.00013596019,0.0005841597,0.0037160339,0.000403089,0.9906647,0.0038692264,0.000017184855],"about_ca_topic_score_codex":0.0016781786,"about_ca_topic_score_gemma":0.0016890744,"teacher_disagreement_score":0.01329487,"about_ca_system_score_codex":0.0007930158,"about_ca_system_score_gemma":0.00065083604,"threshold_uncertainty_score":0.044475794},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069034174,0.0012300629,0.89741373,0.00039652124,0.00022656965,0.00014602678,0.0004254713,0.00031614874,0.030811341],"genre_scores_gemma":[0.4581096,0.0015338353,0.52094513,0.0007000625,0.0003577234,0.0007049068,0.000831698,0.00015907567,0.016657995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743277,0.00079771434,0.00022765232,0.0004966612,0.0007475631,0.0002975887],"domain_scores_gemma":[0.9967361,0.001315406,0.0005921585,0.00064200093,0.0005196997,0.00019450184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016245447,0.0010380558,0.000648584,0.0014184396,0.0010598172,0.0011348315,0.0007304968,0.0010717553,0.0054354947],"category_scores_gemma":[0.0048981374,0.0006968862,0.0015369493,0.0013109816,0.0014500762,0.0015789677,0.0018679367,0.0023839525,0.0011450219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017070545,0.000054576667,0.00050966436,0.0001805299,0.000040919716,0.00018034491,0.00027769073,0.008555928,0.016336214,0.90781087,0.002103118,0.06377959],"study_design_scores_gemma":[0.00011704475,0.0006593215,0.0007544336,0.00017150356,0.00008060564,0.0014383205,0.0001467958,0.054571103,0.027357595,0.86756283,0.046980027,0.00016047047],"about_ca_topic_score_codex":0.00026165068,"about_ca_topic_score_gemma":0.0002761969,"teacher_disagreement_score":0.0054354947,"about_ca_system_score_codex":0.00083527813,"about_ca_system_score_gemma":0.0007978354,"threshold_uncertainty_score":0.01818353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21258731,0.00033641915,0.7145302,0.0004987839,0.00030766585,0.00016983598,0.00035088725,0.0005710173,0.07064784],"genre_scores_gemma":[0.75526303,0.0003305491,0.21876185,0.00052670843,0.00027467115,0.00036824742,0.00069898146,0.00020340491,0.023572505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983328,0.00044627272,0.0001207333,0.00047132623,0.00038772775,0.00024120501],"domain_scores_gemma":[0.9975756,0.0010567415,0.0002779979,0.000485788,0.00036638477,0.000237459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013289466,0.0003837583,0.0003689324,0.0017991216,0.0015629572,0.002082286,0.00073367736,0.0008093952,0.010743789],"category_scores_gemma":[0.00343905,0.0004532883,0.0007821162,0.0009946565,0.0024748154,0.0036689774,0.0033762339,0.0014256381,0.0016801234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015147374,0.00001403931,0.00025662142,0.000027230737,0.00000569861,0.000053269912,0.00021497297,0.0012050885,0.002793041,0.9850295,0.0006045666,0.00978065],"study_design_scores_gemma":[0.000021412114,0.00007884708,0.00034757232,0.000025990274,0.00001409574,0.00022947944,0.00014224778,0.0116742235,0.0066605923,0.96075815,0.02001399,0.000033394488],"about_ca_topic_score_codex":0.00022383087,"about_ca_topic_score_gemma":0.00024141757,"teacher_disagreement_score":0.010743789,"about_ca_system_score_codex":0.00086366956,"about_ca_system_score_gemma":0.0004806776,"threshold_uncertainty_score":0.0359416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066408874,0.0032370812,0.9386748,0.0010783636,0.00041253658,0.00003959299,0.00009442331,0.00010802162,0.049714312],"genre_scores_gemma":[0.30742407,0.007590053,0.6152117,0.0022676552,0.0029962254,0.00029780134,0.0003233041,0.0002519766,0.06363728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987639,0.0005432652,0.00006084047,0.00020378821,0.00032441274,0.000103714054],"domain_scores_gemma":[0.99895465,0.0004906545,0.00011307251,0.00014582879,0.000246364,0.00004933209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007741226,0.0007573446,0.0005675423,0.0017948938,0.0010002995,0.002047891,0.0009973134,0.0007887453,0.0075676665],"category_scores_gemma":[0.002718277,0.0003610861,0.0008138709,0.0020839989,0.0028966668,0.00312373,0.001977581,0.0029750369,0.002232507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066318908,0.000015745685,0.000051128485,0.000038676964,0.000005821117,0.000035033456,0.00008613927,0.0028731662,0.00073585537,0.9815506,0.0011902114,0.013411073],"study_design_scores_gemma":[0.0000073575693,0.00004483488,0.00008011899,0.000025085987,0.000005300086,0.00016296815,0.00006305606,0.018949555,0.0010693748,0.95029044,0.029281989,0.000019813977],"about_ca_topic_score_codex":0.00072244316,"about_ca_topic_score_gemma":0.0008159077,"teacher_disagreement_score":0.0075676665,"about_ca_system_score_codex":0.000871494,"about_ca_system_score_gemma":0.00055853266,"threshold_uncertainty_score":0.025316417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7724221,0.0017122423,0.12070574,0.0015627708,0.0001605179,0.00010003549,0.0003835718,0.00015216063,0.10280094],"genre_scores_gemma":[0.9789996,0.0006006027,0.014216016,0.00016029373,0.00012389696,0.00006596415,0.0002062659,0.000028373723,0.005598986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993235,0.00015638152,0.000034253044,0.000159861,0.00015164868,0.00017435872],"domain_scores_gemma":[0.99638414,0.0018270847,0.0004914524,0.00041169336,0.00043125736,0.0004542228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062522216,0.00027821073,0.00035350665,0.0014582763,0.0012885929,0.0017978743,0.0005968906,0.00079788396,0.005980157],"category_scores_gemma":[0.0047280393,0.0005059193,0.000256087,0.00084486743,0.002054775,0.0033039292,0.0023516293,0.0012011027,0.0004141102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090525726,0.000043885982,0.0015176602,0.000084092855,0.000012202687,0.00023715307,0.00038213911,0.005239067,0.0025750606,0.97635627,0.0019351919,0.011526685],"study_design_scores_gemma":[0.000039968087,0.000060922084,0.00085572153,0.000040207717,0.000012632484,0.0002958846,0.00024888339,0.038478803,0.0016981811,0.95141596,0.006832447,0.000020422189],"about_ca_topic_score_codex":0.00078994466,"about_ca_topic_score_gemma":0.00084319286,"teacher_disagreement_score":0.005980157,"about_ca_system_score_codex":0.000784725,"about_ca_system_score_gemma":0.00066512014,"threshold_uncertainty_score":0.020005643},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80263644,0.0017505653,0.1451687,0.0028233514,0.0001258946,0.000084032654,0.00061939436,0.000523065,0.04626855],"genre_scores_gemma":[0.976934,0.00044090353,0.019077886,0.00022389124,0.00013887652,0.000103633094,0.00024369355,0.00006630436,0.0027708157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989022,0.0002607722,0.00004462631,0.00025879443,0.00022449097,0.00030905302],"domain_scores_gemma":[0.980135,0.015202829,0.0014060921,0.0015890516,0.00063373125,0.0010333422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008536311,0.0005808934,0.0007334058,0.0016896961,0.0016829082,0.0027840543,0.001078377,0.0009812771,0.004955718],"category_scores_gemma":[0.012173312,0.0004991809,0.00064743275,0.0011720022,0.0049197273,0.004011371,0.0021146457,0.0022805769,0.00049782806],"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.00031936858,0.00011951347,0.008205936,0.0002655465,0.000043588716,0.00020013115,0.00077746616,0.025379505,0.010583733,0.92031777,0.0051273145,0.028660147],"study_design_scores_gemma":[0.000054078664,0.000091017646,0.0032791176,0.000093585724,0.000037019676,0.0003563526,0.00024911464,0.08373786,0.009397791,0.897185,0.005458875,0.000060193655],"about_ca_topic_score_codex":0.0011706494,"about_ca_topic_score_gemma":0.0017354443,"teacher_disagreement_score":0.004955718,"about_ca_system_score_codex":0.0020417832,"about_ca_system_score_gemma":0.0008066288,"threshold_uncertainty_score":0.016578496},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2792163,0.003973328,0.3020059,0.00461075,0.0025317045,0.00019224964,0.00068289007,0.0007255066,0.40606135],"genre_scores_gemma":[0.8862755,0.0033071642,0.08773547,0.0015831497,0.0008485084,0.00011810182,0.00041923355,0.00011017962,0.019602757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997749,0.000067705194,0.000011189275,0.0000529772,0.000053455424,0.000039791124],"domain_scores_gemma":[0.99961215,0.00018801104,0.00003521714,0.000059277656,0.00004757845,0.00005772034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030359565,0.00026765297,0.00023771414,0.00051839586,0.0008421824,0.0006881216,0.0004312885,0.00041298883,0.005924938],"category_scores_gemma":[0.0010247866,0.00017124761,0.00031364395,0.0006795326,0.0008309049,0.0012660355,0.001057821,0.0010330091,0.00072958606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011395903,0.000048279253,0.001160818,0.00024848085,0.000020964402,0.001307274,0.00051191583,0.003058247,0.01413059,0.92839104,0.012699527,0.038308892],"study_design_scores_gemma":[0.000026868049,0.00014795394,0.002460861,0.000083298975,0.000050384133,0.0026572016,0.00045745503,0.016279845,0.0115247695,0.85906637,0.107198164,0.0000467841],"about_ca_topic_score_codex":0.00063652144,"about_ca_topic_score_gemma":0.0011480876,"teacher_disagreement_score":0.005924938,"about_ca_system_score_codex":0.00039398402,"about_ca_system_score_gemma":0.00022954718,"threshold_uncertainty_score":0.019820929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25007567,0.00078364776,0.58100605,0.0014474511,0.00019403562,0.00006752358,0.00036865447,0.0006891741,0.16536784],"genre_scores_gemma":[0.92188585,0.0005316836,0.05980751,0.00028935852,0.00011816154,0.00008332308,0.00026294007,0.00014867607,0.016872548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940896,0.0001683556,0.00003143412,0.00009797887,0.00019049118,0.00010279826],"domain_scores_gemma":[0.99791175,0.0010509217,0.000259003,0.00029568918,0.00033919237,0.00014351588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003277061,0.00027498454,0.00024107643,0.00060993276,0.00054096954,0.0014119612,0.00066420797,0.00035826155,0.01400148],"category_scores_gemma":[0.002660823,0.00026773644,0.0002981747,0.00068124576,0.0013167163,0.0032777102,0.0012303324,0.0013421298,0.0011100459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006225476,0.000013113031,0.00037628022,0.00004670348,0.0000039560955,0.0002243174,0.00019510103,0.003165053,0.003988618,0.96791536,0.0027610902,0.02124812],"study_design_scores_gemma":[0.000042856627,0.00008965098,0.0013649572,0.00003771297,0.00001136837,0.0011020836,0.0005512528,0.03412656,0.013080902,0.914588,0.03496484,0.000039932143],"about_ca_topic_score_codex":0.00059852813,"about_ca_topic_score_gemma":0.0005602433,"teacher_disagreement_score":0.01400148,"about_ca_system_score_codex":0.00045559008,"about_ca_system_score_gemma":0.00020038358,"threshold_uncertainty_score":0.046839654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100070186,0.00050904934,0.81910914,0.00040438777,0.0003276917,0.000095922944,0.0002207279,0.0010023875,0.078260474],"genre_scores_gemma":[0.63856256,0.00054857234,0.32803804,0.00046220908,0.00018222394,0.00019537717,0.00032246613,0.0005613835,0.031127164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.00021040667,0.00004394166,0.00017770054,0.00020597018,0.00015270653],"domain_scores_gemma":[0.9992269,0.00019745709,0.00007046527,0.00026595016,0.00015015026,0.00008889985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006206293,0.0004485477,0.00037807613,0.0006673787,0.00085163297,0.0012472817,0.0004901771,0.0006138064,0.010457878],"category_scores_gemma":[0.0014802768,0.00043104845,0.00059693126,0.00065733975,0.0014997285,0.001514175,0.0019574687,0.0014028704,0.0027441762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090325346,0.000028061871,0.0003242177,0.00006633246,0.000009124276,0.00019428466,0.00033850837,0.0018475524,0.017105993,0.92128575,0.0030899637,0.05561984],"study_design_scores_gemma":[0.00006374697,0.00033630323,0.00051662314,0.00008109222,0.000040675448,0.0011202457,0.0003649016,0.024584454,0.051091496,0.8303619,0.09134618,0.00009248207],"about_ca_topic_score_codex":0.00030469985,"about_ca_topic_score_gemma":0.00039344857,"teacher_disagreement_score":0.010457878,"about_ca_system_score_codex":0.00035640007,"about_ca_system_score_gemma":0.0003279502,"threshold_uncertainty_score":0.034985065},"labels":[],"label_agreement":null},{"id":"W2964093181","doi":"10.1002/jcd.21552","title":"On the Hamilton–Waterloo Problem with Odd Orders","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Mathematics; Combinatorics; Factorization; Graph; Generality; Order (exchange); Product (mathematics); Discrete mathematics; Algorithm","score_opus":0.01069518822555812,"score_gpt":0.18305549727227075,"score_spread":0.17236030904671262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964093181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46284488,0.0018008007,0.40545988,0.0055028745,0.00036405944,0.00037808836,0.0014340711,0.00038548687,0.12182988],"genre_scores_gemma":[0.87197816,0.0013478625,0.097484976,0.00068060163,0.0002542306,0.00018015497,0.0011227363,0.00011613357,0.026835125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906784,0.0002667356,0.000036099318,0.00016257037,0.0001492359,0.0003176142],"domain_scores_gemma":[0.99770856,0.0015168217,0.00020982875,0.00021893733,0.00015656359,0.00018938757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529726,0.00053366815,0.00069940276,0.00065566506,0.0013220363,0.0017518798,0.00088061846,0.0012048435,0.010597273],"category_scores_gemma":[0.0043034866,0.00038429484,0.0005332921,0.0009838782,0.001456298,0.0040876,0.001197177,0.00148263,0.00076691044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042752904,0.00015203367,0.001065028,0.00024112791,0.000038641952,0.0004707504,0.00044701443,0.04558597,0.002942067,0.88537997,0.01965402,0.04359596],"study_design_scores_gemma":[0.00010112062,0.00005723186,0.00030930783,0.00006208385,0.000017642502,0.00014292369,0.00030850357,0.10131091,0.0014060573,0.88628167,0.009972559,0.000029949952],"about_ca_topic_score_codex":0.011340176,"about_ca_topic_score_gemma":0.011167516,"teacher_disagreement_score":0.011340176,"about_ca_system_score_codex":0.0014380764,"about_ca_system_score_gemma":0.0015904208,"threshold_uncertainty_score":0.035451353},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040728446,0.005352244,0.6179702,0.010522512,0.0012504722,0.00013446495,0.000870585,0.00077112636,0.3223999],"genre_scores_gemma":[0.6615292,0.006297167,0.17444153,0.0039709974,0.0025787707,0.00041105034,0.00091591995,0.0009267236,0.14892869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819934,0.00040533306,0.000092969836,0.00050073635,0.0005462226,0.00025543102],"domain_scores_gemma":[0.9935088,0.0039718864,0.00025207148,0.0010904645,0.0007991777,0.0003775761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002476823,0.0011261469,0.001275537,0.00288659,0.003618892,0.0052245376,0.002744594,0.0030441235,0.019283054],"category_scores_gemma":[0.015392742,0.0008720942,0.001306139,0.004772769,0.0049531227,0.016526688,0.004439393,0.007845512,0.0030073079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001557142,0.000008687588,0.000047428355,0.00002805715,0.0000030837136,0.000013588114,0.00006414242,0.00074408384,0.00013362998,0.9897692,0.0035897556,0.0055826204],"study_design_scores_gemma":[0.000004748505,0.0000049863283,0.00004851611,0.00001426167,0.0000063641237,0.000028120885,0.00002617867,0.0045377645,0.00017399342,0.98921365,0.0059322845,0.000009215169],"about_ca_topic_score_codex":0.004615597,"about_ca_topic_score_gemma":0.0039213407,"teacher_disagreement_score":0.019283054,"about_ca_system_score_codex":0.0045330105,"about_ca_system_score_gemma":0.0022055777,"threshold_uncertainty_score":0.06450826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7239385,0.0013859022,0.1479485,0.002904035,0.0005643409,0.00019953288,0.0014905743,0.0012759805,0.12029261],"genre_scores_gemma":[0.9079668,0.0005368564,0.07534909,0.00091661466,0.000114750146,0.0002076785,0.00060500315,0.00038557517,0.013917662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990988,0.00025153987,0.00006450314,0.00019449455,0.00012662655,0.0002640244],"domain_scores_gemma":[0.99135673,0.004823625,0.0007721712,0.0012761828,0.0007255822,0.0010456278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632928,0.0007415031,0.00077128253,0.0015683195,0.003238836,0.002809883,0.0015382292,0.0013300938,0.0067039174],"category_scores_gemma":[0.010036054,0.0009467401,0.00075033936,0.0016932655,0.0019686448,0.002342973,0.0019181424,0.002230891,0.0007624577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008559771,0.00020246356,0.002912753,0.00043359207,0.00005833331,0.0003015312,0.00076088705,0.019694295,0.012106659,0.92613477,0.013632441,0.022906296],"study_design_scores_gemma":[0.00019123833,0.000082743165,0.0013128717,0.00009920207,0.00006392566,0.0004217618,0.00041822428,0.053014446,0.006137078,0.92922837,0.008978316,0.000051886367],"about_ca_topic_score_codex":0.0024935438,"about_ca_topic_score_gemma":0.0077250116,"teacher_disagreement_score":0.0067039174,"about_ca_system_score_codex":0.0016407399,"about_ca_system_score_gemma":0.0019161052,"threshold_uncertainty_score":0.022426844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29174322,0.0004412021,0.63309234,0.0006531006,0.00025422534,0.00028992828,0.0006107093,0.0012547025,0.07166059],"genre_scores_gemma":[0.74886376,0.00029940633,0.21937546,0.0003245305,0.00004183246,0.00034721312,0.0012400264,0.00044563753,0.029061943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995159,0.00014061101,0.000015617366,0.000101602775,0.00013714838,0.00008919157],"domain_scores_gemma":[0.99935323,0.00021419083,0.00006449085,0.00018220645,0.00011196707,0.00007398228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003722129,0.00039194405,0.00036310358,0.00069680315,0.00071728666,0.0005454417,0.00085822324,0.00072049914,0.0104410555],"category_scores_gemma":[0.0018741792,0.00055640645,0.00060999376,0.00047570214,0.00077788474,0.0010219271,0.0025630314,0.0007218251,0.0017614856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023806607,0.00013647771,0.00186543,0.00033796104,0.000050940882,0.00056533626,0.0008595176,0.047321912,0.04319804,0.81188786,0.011808436,0.081730075],"study_design_scores_gemma":[0.00013010493,0.00024299558,0.0013592076,0.00012747316,0.000054857486,0.0006799039,0.0005692185,0.25975195,0.029405117,0.6535484,0.05406514,0.00006555239],"about_ca_topic_score_codex":0.0005620704,"about_ca_topic_score_gemma":0.001465964,"teacher_disagreement_score":0.0104410555,"about_ca_system_score_codex":0.00048653356,"about_ca_system_score_gemma":0.00030766623,"threshold_uncertainty_score":0.03492886},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25783035,0.0013070242,0.5266246,0.0024554932,0.0005602412,0.00046979223,0.0069169444,0.0010083447,0.20282722],"genre_scores_gemma":[0.83046824,0.0007763855,0.09840187,0.00061097933,0.00024527914,0.00024543848,0.0045327665,0.00021578267,0.064503096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991584,0.00015252671,0.000047904483,0.00025664334,0.0001624952,0.000222083],"domain_scores_gemma":[0.9987387,0.00035296186,0.00019771176,0.00021279717,0.00024038892,0.00025744655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044267313,0.0007211596,0.00066782185,0.0011351921,0.001476045,0.0024562364,0.0008454827,0.0008939723,0.024127496],"category_scores_gemma":[0.0020895824,0.0004653694,0.0006680548,0.0008754448,0.00097341725,0.002545691,0.0014910003,0.0014514731,0.004321078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022637937,0.00019577774,0.0010730636,0.00039452093,0.000046278492,0.0005804211,0.0003730438,0.011258107,0.006998058,0.9150909,0.022803329,0.040960126],"study_design_scores_gemma":[0.000041011786,0.000059189028,0.0009840957,0.000087843204,0.000022578986,0.0007463761,0.00027771102,0.035921145,0.0020002567,0.94053835,0.019283924,0.00003743722],"about_ca_topic_score_codex":0.0015296742,"about_ca_topic_score_gemma":0.0031773597,"teacher_disagreement_score":0.024127496,"about_ca_system_score_codex":0.0012430553,"about_ca_system_score_gemma":0.000999257,"threshold_uncertainty_score":0.080714464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85593116,0.0009160743,0.04618363,0.0002761317,0.000114199414,0.000079467776,0.00033339285,0.0001662687,0.09599966],"genre_scores_gemma":[0.9577416,0.00060332177,0.016060067,0.000124094,0.0001261278,0.000099970544,0.00040565198,0.00008924007,0.024749877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995709,0.000076681856,0.00002236495,0.00010539021,0.00010378657,0.00012080834],"domain_scores_gemma":[0.9993636,0.00018387925,0.00013845747,0.00009252284,0.00012281563,0.00009870943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020711705,0.00036825985,0.00028130203,0.0019407996,0.001163643,0.0016135888,0.0004572882,0.00049983035,0.005811576],"category_scores_gemma":[0.0006631782,0.00034124608,0.0005223358,0.0008763849,0.0014384402,0.0011589277,0.0007769494,0.0007800418,0.00065119716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057275214,0.000025958732,0.0010203028,0.000046280373,0.000009279805,0.0002748796,0.0005468031,0.0014848709,0.0055106757,0.97301877,0.0009791711,0.017025573],"study_design_scores_gemma":[0.000033663553,0.00010448585,0.003553993,0.00006724525,0.000029542418,0.0011925555,0.0008009154,0.012416484,0.009370689,0.9391984,0.03318102,0.000051039024],"about_ca_topic_score_codex":0.001051955,"about_ca_topic_score_gemma":0.0012284794,"teacher_disagreement_score":0.005811576,"about_ca_system_score_codex":0.0008350903,"about_ca_system_score_gemma":0.00046995297,"threshold_uncertainty_score":0.019441664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5548507,0.0010651175,0.3211194,0.0075870557,0.0002954777,0.00030182645,0.0015358323,0.001592054,0.11165259],"genre_scores_gemma":[0.87029505,0.0002746716,0.1173875,0.0005189223,0.00013314425,0.00011731308,0.0009746548,0.00032289865,0.00997596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993548,0.0002095883,0.000030295327,0.00013354719,0.000154573,0.00011726727],"domain_scores_gemma":[0.9973265,0.001955733,0.00016726014,0.00025207954,0.00021794288,0.00008047869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073234004,0.0006121446,0.0009819897,0.0023006967,0.002005886,0.002366062,0.0012313876,0.0012517412,0.021917803],"category_scores_gemma":[0.007880579,0.0005412785,0.0011232632,0.001976853,0.0019085628,0.0051870006,0.0019184147,0.0022782506,0.0021330726],"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.00066814775,0.00030230478,0.002870492,0.00041301845,0.000074607,0.0005155661,0.0005417367,0.028425744,0.0030743137,0.84480214,0.017979031,0.10033298],"study_design_scores_gemma":[0.00010554822,0.00008252426,0.00030694148,0.00005075675,0.000036722948,0.00017491893,0.00028867155,0.08871409,0.0027539337,0.90163267,0.0058266562,0.000026588687],"about_ca_topic_score_codex":0.0015240127,"about_ca_topic_score_gemma":0.0025713511,"teacher_disagreement_score":0.021917803,"about_ca_system_score_codex":0.0009593707,"about_ca_system_score_gemma":0.0014249342,"threshold_uncertainty_score":0.073322296},"labels":[],"label_agreement":null},{"id":"W2967987125","doi":"10.1002/jcd.21701","title":"All group‐based latin squares possess near transversals","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Transversal (combinatorics); Conjecture; Combinatorics; Square (algebra); Mathematics; Class (philosophy); Group (periodic table); Order (exchange); Column (typography); Discrete mathematics; Physics; Computer science; Geometry; Mathematical analysis; Connection (principal bundle); Artificial intelligence; Biology","score_opus":0.042583768513273515,"score_gpt":0.2535990957581289,"score_spread":0.2110153272448554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967987125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9091757,0.0002635231,0.044018004,0.00025596158,0.00016005541,0.000051388604,0.00035506207,0.00040485468,0.04531532],"genre_scores_gemma":[0.9811229,0.00011022183,0.010014664,0.00014747048,0.000069377755,0.00003647683,0.00041771765,0.00006593935,0.008015209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918693,0.00013182235,0.000064709646,0.00029750087,0.00015846481,0.00016063591],"domain_scores_gemma":[0.9969168,0.0005594222,0.00076691044,0.0009052248,0.00043805805,0.000413697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004437729,0.00038130555,0.0005528448,0.0007309027,0.0012688761,0.0018759553,0.00050178013,0.0007773371,0.008347974],"category_scores_gemma":[0.0020000383,0.0004152524,0.0005288898,0.00044136398,0.0015941792,0.0020991936,0.0016558833,0.0011575216,0.0013698322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001249846,0.00014680908,0.011108639,0.00018838797,0.000060426297,0.001280458,0.0011679156,0.0078018773,0.074165806,0.8666588,0.0034537336,0.03271738],"study_design_scores_gemma":[0.00016024157,0.0013718121,0.008433772,0.00011346174,0.00006667763,0.004124086,0.0015918702,0.024055088,0.06585194,0.8494394,0.04468139,0.00011029523],"about_ca_topic_score_codex":0.0004434682,"about_ca_topic_score_gemma":0.0004858692,"teacher_disagreement_score":0.008347974,"about_ca_system_score_codex":0.0004845492,"about_ca_system_score_gemma":0.0004175167,"threshold_uncertainty_score":0.027926803},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8765581,0.0008158323,0.018760743,0.0014860138,0.00014541487,0.000031678806,0.00037249448,0.00023001997,0.10159956],"genre_scores_gemma":[0.988231,0.0005590433,0.0034452141,0.00017704564,0.00013738072,0.00003345054,0.00018607243,0.00008663824,0.007144125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.00014003253,0.000019905396,0.00009027514,0.00013259175,0.0001239471],"domain_scores_gemma":[0.99784124,0.0010767283,0.00040715307,0.00017785879,0.00014751396,0.00034946122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063519186,0.0005758069,0.00066588796,0.0034887083,0.0019045669,0.0035901722,0.000995085,0.0011914383,0.007523459],"category_scores_gemma":[0.003404152,0.0005682018,0.0004657166,0.0018005043,0.0027972853,0.0033440972,0.002144803,0.0013592144,0.000619425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015160599,0.00003065133,0.0028987527,0.000064873515,0.000019859257,0.0002662098,0.0007282912,0.0071785776,0.0032909426,0.96989083,0.0026656953,0.012813825],"study_design_scores_gemma":[0.00002528616,0.00002646744,0.003757422,0.00007978652,0.000034761113,0.00034903403,0.0004469255,0.021909093,0.0011943649,0.966225,0.005922998,0.000028834358],"about_ca_topic_score_codex":0.0010815627,"about_ca_topic_score_gemma":0.0011241131,"teacher_disagreement_score":0.007523459,"about_ca_system_score_codex":0.0015960193,"about_ca_system_score_gemma":0.00036714826,"threshold_uncertainty_score":0.025168419},"labels":[],"label_agreement":null},{"id":"W2973469729","doi":"10.1002/jcd.21523","title":"A Complete Solution to the Existence of ‐Cycle Frames of Type","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Consiglio Nazionale delle Ricerche; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Mathematics; Type (biology); Combinatorics; Frame (networking); Computer science","score_opus":0.028004945576191598,"score_gpt":0.23563613328123525,"score_spread":0.20763118770504366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973469729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18638015,0.00064041925,0.71485895,0.0019711915,0.000491773,0.00018899531,0.000671985,0.0002532592,0.09454332],"genre_scores_gemma":[0.6781949,0.00079188077,0.2814375,0.00048509848,0.00039749953,0.00041057635,0.0008241104,0.00016163728,0.037296813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955195,0.00007859575,0.00002389836,0.00011808154,0.00008737164,0.00014005945],"domain_scores_gemma":[0.9992525,0.0003263748,0.00007173723,0.00008128234,0.00016862823,0.000099479854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070846354,0.0006545597,0.00093037327,0.00085449993,0.0013612218,0.001990242,0.0011474442,0.002115525,0.010903269],"category_scores_gemma":[0.0031048066,0.0005461336,0.00085502886,0.0007388263,0.0010348812,0.0022332976,0.0020390325,0.0023138644,0.000913824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060007646,0.000036853544,0.0001562992,0.00012306511,0.00001335837,0.00009756704,0.00016800167,0.0066271536,0.0023752355,0.9660443,0.004819911,0.019478269],"study_design_scores_gemma":[0.00004398125,0.00007015207,0.00015219815,0.000070459144,0.000016888018,0.00015723893,0.000306018,0.03867525,0.0021980375,0.9442983,0.013987522,0.000023845263],"about_ca_topic_score_codex":0.0008789954,"about_ca_topic_score_gemma":0.0006785092,"teacher_disagreement_score":0.010903269,"about_ca_system_score_codex":0.0008126512,"about_ca_system_score_gemma":0.0009820281,"threshold_uncertainty_score":0.036475062},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19743165,0.0005819231,0.64672226,0.0018158115,0.00030947954,0.00014475372,0.00047221145,0.0005562329,0.1519657],"genre_scores_gemma":[0.8561978,0.000304683,0.10428972,0.00048975163,0.00013519246,0.00035907174,0.00038242206,0.000098452394,0.037742913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831676,0.0005029876,0.00010512816,0.00034272997,0.00047591468,0.00025658618],"domain_scores_gemma":[0.9974528,0.0012389519,0.00030184412,0.00043721442,0.00039815964,0.00017095357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011055276,0.0006799858,0.00053773465,0.0009979516,0.0016128984,0.0019065792,0.001090297,0.0013303149,0.011511263],"category_scores_gemma":[0.0037394431,0.00055271306,0.00088027364,0.00090373354,0.002588036,0.0021692612,0.0014270167,0.0015661505,0.0016460482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035419598,0.00002377261,0.0001871525,0.000050841194,0.000009010055,0.00012952578,0.00011269289,0.0070090825,0.0007404044,0.9821202,0.0012357279,0.008346213],"study_design_scores_gemma":[0.000026416477,0.00004704165,0.000093321454,0.000022916345,0.000008520755,0.00017538606,0.000056744688,0.028451324,0.00075412245,0.96503896,0.005310253,0.00001492225],"about_ca_topic_score_codex":0.00077341736,"about_ca_topic_score_gemma":0.0009237794,"teacher_disagreement_score":0.011511263,"about_ca_system_score_codex":0.0012642376,"about_ca_system_score_gemma":0.00089658936,"threshold_uncertainty_score":0.03850901},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042458363,0.00020527458,0.949178,0.0005531681,0.000045831963,0.000087764165,0.00010875654,0.00013021816,0.0072327773],"genre_scores_gemma":[0.5082088,0.000271052,0.48515943,0.0001840402,0.00015325776,0.00037500146,0.00029042774,0.00010112162,0.005256801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985875,0.0007523043,0.00005491065,0.00012283314,0.00037553563,0.000106968815],"domain_scores_gemma":[0.9853322,0.012986676,0.000320212,0.00057019433,0.00061964296,0.00017108343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002976729,0.0004277994,0.00079356425,0.0017439887,0.0006877705,0.0012203424,0.0014235827,0.0007944926,0.0061151106],"category_scores_gemma":[0.014004246,0.00028470572,0.0007253292,0.00091359724,0.0024007484,0.002529637,0.0019771312,0.0013249833,0.00047338547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008432266,0.00006745046,0.0009144906,0.00012794895,0.000025403486,0.00007724249,0.00013917034,0.14712618,0.0006017078,0.81730366,0.0010828627,0.03244956],"study_design_scores_gemma":[0.000016975297,0.000017485843,0.00007129894,0.00001417606,0.0000029002863,0.000020915046,0.00003731633,0.640078,0.0003147623,0.35854787,0.0008724174,0.000005904988],"about_ca_topic_score_codex":0.0009779363,"about_ca_topic_score_gemma":0.0012022698,"teacher_disagreement_score":0.0061151106,"about_ca_system_score_codex":0.0011129461,"about_ca_system_score_gemma":0.0010069894,"threshold_uncertainty_score":0.020457089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06211883,0.018121116,0.7339879,0.004405523,0.0011908442,0.00015869823,0.0009029736,0.001780859,0.1773332],"genre_scores_gemma":[0.7792242,0.0124727525,0.16651067,0.0019861755,0.0022272842,0.00047856278,0.0008599644,0.0008668124,0.035373613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546236,0.0008396381,0.00017228708,0.0007424911,0.0018203417,0.000962851],"domain_scores_gemma":[0.9885737,0.0071464255,0.0005765905,0.0016606463,0.0016030049,0.0004396464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003792778,0.0023039805,0.0014549382,0.0052603157,0.0017923982,0.0043735057,0.0027339086,0.0017525929,0.012819801],"category_scores_gemma":[0.020094978,0.0009923782,0.0016255506,0.003325251,0.005137205,0.00966561,0.005470896,0.010053527,0.004985914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019730063,0.00012327908,0.00063550484,0.0003306859,0.00003833297,0.00021689269,0.00040761384,0.024386546,0.008066226,0.9117328,0.010086707,0.043778047],"study_design_scores_gemma":[0.000035237717,0.00011668334,0.0007502086,0.00019954865,0.00008079151,0.00041165392,0.00018700259,0.17166278,0.017617365,0.77699417,0.031753317,0.00019122721],"about_ca_topic_score_codex":0.0018516259,"about_ca_topic_score_gemma":0.0022128979,"teacher_disagreement_score":0.012819801,"about_ca_system_score_codex":0.0038446907,"about_ca_system_score_gemma":0.0017243475,"threshold_uncertainty_score":0.042886496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6299839,0.0003860315,0.2318526,0.0008614599,0.00024709958,0.00013455005,0.00086076517,0.00046251027,0.13521114],"genre_scores_gemma":[0.8720506,0.000412983,0.078870356,0.0003589246,0.00009210003,0.00016633971,0.0010382461,0.00025315423,0.04675725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959224,0.000119684795,0.000019562169,0.000086547996,0.00008810741,0.00009399069],"domain_scores_gemma":[0.9989937,0.00039095987,0.00015949519,0.00015113798,0.0001258831,0.00017891974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029172195,0.00060065003,0.000505806,0.0008010319,0.0010465841,0.0022709104,0.0011601279,0.0011259479,0.014553922],"category_scores_gemma":[0.0016840397,0.00057471247,0.00042323567,0.00077468826,0.0010243069,0.0022227333,0.0014427752,0.0018215246,0.0015281243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032383623,0.00015013086,0.0008091684,0.00014769395,0.000023198685,0.000267725,0.00056990446,0.020449024,0.007955241,0.92725235,0.005323637,0.03672811],"study_design_scores_gemma":[0.0000680549,0.000076749166,0.00084698555,0.00004025952,0.000021634329,0.00029614664,0.00051130156,0.081549205,0.0036266795,0.8995739,0.013361965,0.000027000626],"about_ca_topic_score_codex":0.0013367255,"about_ca_topic_score_gemma":0.001960774,"teacher_disagreement_score":0.014553922,"about_ca_system_score_codex":0.00081054645,"about_ca_system_score_gemma":0.00032414988,"threshold_uncertainty_score":0.048687756},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29841182,0.030479614,0.23309267,0.00408065,0.016954849,0.002627209,0.038285393,0.06256566,0.31350216],"genre_scores_gemma":[0.5329642,0.01347026,0.1897362,0.0025421,0.0010031261,0.004398464,0.04601195,0.011013861,0.1988597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994844,0.000070651746,0.000051130315,0.00013504023,0.00011648037,0.00014226875],"domain_scores_gemma":[0.9996166,0.00006314864,0.000048668513,0.00010366904,0.000060551272,0.000107339365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038133588,0.0014160144,0.0017486796,0.0009908009,0.0013769876,0.0013246894,0.0020557255,0.0010041522,0.13000043],"category_scores_gemma":[0.001345308,0.00093224156,0.0007519098,0.0014235196,0.00043901041,0.0017535108,0.0016349738,0.001621563,0.061882548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005603458,0.0009232286,0.002665736,0.003714602,0.00042136936,0.0011607528,0.00045843955,0.018709034,0.21029665,0.06645033,0.34035897,0.34923744],"study_design_scores_gemma":[0.00077567564,0.0012542247,0.001370305,0.0002549989,0.00021470641,0.0005871513,0.0002485221,0.041956715,0.12160589,0.020154314,0.81138206,0.00019543798],"about_ca_topic_score_codex":0.0014670878,"about_ca_topic_score_gemma":0.0019675517,"teacher_disagreement_score":0.13000043,"about_ca_system_score_codex":0.00063359895,"about_ca_system_score_gemma":0.0007838207,"threshold_uncertainty_score":0.43489474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4351871,0.0026450562,0.34996805,0.0059118047,0.0006437507,0.00010129494,0.00042320616,0.0005026985,0.20461707],"genre_scores_gemma":[0.95507324,0.0007960039,0.018858476,0.00059148064,0.00052144995,0.00008156391,0.000120661985,0.00007171753,0.023885379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984981,0.00061111536,0.00006534622,0.00033902773,0.00032362936,0.0001627888],"domain_scores_gemma":[0.9959974,0.002631224,0.00031987502,0.00049084955,0.00028352602,0.00027713145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015570357,0.0006669724,0.00067764777,0.0014656899,0.001784913,0.003420881,0.0006122695,0.0010396086,0.0066706594],"category_scores_gemma":[0.0035781343,0.000561142,0.00052046543,0.0011566161,0.00393841,0.0061115474,0.0024541367,0.0022452746,0.000910977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027583155,0.000014915843,0.00007218056,0.000018089871,0.000003407961,0.000013912935,0.0001039647,0.00047879643,0.00038912767,0.99543107,0.0004584455,0.0029885634],"study_design_scores_gemma":[0.000009803558,0.000009481296,0.00005279988,0.000007870758,0.0000037624145,0.000040187075,0.000022513063,0.0017705582,0.0005463883,0.9954379,0.0020923214,0.000006243108],"about_ca_topic_score_codex":0.00029842442,"about_ca_topic_score_gemma":0.00026943572,"teacher_disagreement_score":0.0066706594,"about_ca_system_score_codex":0.0013025197,"about_ca_system_score_gemma":0.00072344014,"threshold_uncertainty_score":0.022315562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7911472,0.00032808553,0.17573993,0.0002584229,0.00010090092,0.00008985447,0.00017978359,0.0002243678,0.0319314],"genre_scores_gemma":[0.94018805,0.00014720489,0.05220313,0.00007810101,0.00003664737,0.000089784226,0.0002985877,0.00005530823,0.0069032055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.0001099551,0.000024390312,0.000060663937,0.00019968009,0.00008001563],"domain_scores_gemma":[0.9995091,0.00015361777,0.00009380056,0.00010159627,0.00008284055,0.000059066995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004355135,0.0004352157,0.00032531176,0.000946847,0.00086746505,0.000597803,0.00050785556,0.0005488591,0.00300778],"category_scores_gemma":[0.0012647894,0.00027968784,0.0007246314,0.00040172492,0.0010608217,0.00083384785,0.0006788724,0.0008163319,0.000526155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022603583,0.000057939462,0.0016484496,0.00012326024,0.000023661403,0.0008255378,0.0005463295,0.01117222,0.030251078,0.92887634,0.0011805051,0.025068741],"study_design_scores_gemma":[0.00014165754,0.00044847222,0.0030368252,0.00006819833,0.0000321436,0.0019914617,0.0003979004,0.09683112,0.07779728,0.79670376,0.022454679,0.00009652736],"about_ca_topic_score_codex":0.0006344577,"about_ca_topic_score_gemma":0.0005720112,"teacher_disagreement_score":0.00300778,"about_ca_system_score_codex":0.00077797665,"about_ca_system_score_gemma":0.0004176893,"threshold_uncertainty_score":0.010061979},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19526917,0.00081657263,0.6688158,0.0011208574,0.00031094794,0.00015126338,0.0006749229,0.00046209406,0.13237837],"genre_scores_gemma":[0.85870785,0.00078679784,0.08324683,0.00068160094,0.00015947981,0.00016176955,0.00047618186,0.00007654421,0.0557029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963856,0.00012111,0.000014175574,0.00009825967,0.000083833496,0.000043985197],"domain_scores_gemma":[0.99897325,0.0004272508,0.00010308411,0.00018271878,0.00020406861,0.00010949475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002983456,0.0004813369,0.0003217916,0.0007167807,0.00055620127,0.0011222173,0.00056763913,0.0006528321,0.012588872],"category_scores_gemma":[0.0014934451,0.00028026843,0.00021905972,0.00065582665,0.00048393,0.0010704023,0.00062120927,0.0009948924,0.0011843989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053678406,0.00004561157,0.00033901638,0.00006549889,0.000014340291,0.000079801546,0.00006457739,0.00792608,0.003427489,0.958516,0.0028614986,0.026606519],"study_design_scores_gemma":[0.00005036093,0.000080852566,0.0003573138,0.000030806284,0.000017716156,0.00019526105,0.000056471,0.040856123,0.0028250976,0.93256915,0.022943772,0.000017016577],"about_ca_topic_score_codex":0.0004148787,"about_ca_topic_score_gemma":0.0008451826,"teacher_disagreement_score":0.012588872,"about_ca_system_score_codex":0.00079441204,"about_ca_system_score_gemma":0.00045033876,"threshold_uncertainty_score":0.0421139},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3741789,0.0009617164,0.4679022,0.0020068202,0.001216091,0.00027297862,0.0008710069,0.0005095765,0.15208074],"genre_scores_gemma":[0.92033696,0.0007166862,0.045754373,0.00055189227,0.0007895949,0.00025510794,0.00062435237,0.00020189535,0.030769106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878114,0.00033237593,0.00007850579,0.00024811729,0.0003646608,0.0001951684],"domain_scores_gemma":[0.9972952,0.0008770461,0.0005131251,0.00030504508,0.0006348719,0.00037471016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012024203,0.00082306727,0.0006435301,0.0034279714,0.0014479547,0.0035355503,0.0008640309,0.0013516962,0.010437583],"category_scores_gemma":[0.004455062,0.00036008336,0.00061664765,0.0020230524,0.0028550702,0.0041369568,0.0015284517,0.002008165,0.0013510726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013837289,0.0000279861,0.00011110821,0.00001252865,0.0000025117351,0.00003261221,0.00015629502,0.00047018792,0.00066899776,0.99220496,0.0014609064,0.004837936],"study_design_scores_gemma":[0.000005220215,0.000012453403,0.00010057474,0.0000056402223,0.0000011328311,0.00008689645,0.000058276346,0.0062077995,0.00023319077,0.99165183,0.0016252866,0.000011751994],"about_ca_topic_score_codex":0.00064292655,"about_ca_topic_score_gemma":0.0007543866,"teacher_disagreement_score":0.010437583,"about_ca_system_score_codex":0.000977777,"about_ca_system_score_gemma":0.00069784716,"threshold_uncertainty_score":0.034917176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4888409,0.0021718864,0.27146146,0.0057901563,0.00036622892,0.00010528945,0.0010969352,0.001983747,0.2281834],"genre_scores_gemma":[0.91474396,0.00084561453,0.027860098,0.0010231298,0.00026100883,0.00015943711,0.00046503328,0.00045155518,0.05419022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828184,0.0006826293,0.000042029365,0.0002770396,0.00036274223,0.0003538124],"domain_scores_gemma":[0.9899783,0.006792056,0.0004943416,0.0013949476,0.0006811772,0.00065913156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013936509,0.0008123515,0.0011410655,0.0021381942,0.0023333991,0.0045983596,0.0014502683,0.0021682964,0.021331],"category_scores_gemma":[0.010570838,0.0007081989,0.00069475156,0.0020135525,0.0026638298,0.00443502,0.0027669787,0.0030897742,0.0029091462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024723174,0.00005597546,0.0006082419,0.00016690162,0.000026527214,0.00016386838,0.0003553339,0.010761874,0.0026014107,0.9655235,0.008243793,0.011245309],"study_design_scores_gemma":[0.000076707394,0.000033972185,0.00045904634,0.000040876446,0.000035370085,0.00027013908,0.00017081205,0.028144687,0.0018694168,0.9629361,0.005932052,0.00003090334],"about_ca_topic_score_codex":0.0011156114,"about_ca_topic_score_gemma":0.0021391443,"teacher_disagreement_score":0.021331,"about_ca_system_score_codex":0.0020475257,"about_ca_system_score_gemma":0.0008715292,"threshold_uncertainty_score":0.07135934},"labels":[],"label_agreement":null},{"id":"W2986160520","doi":"10.1002/jcd.21778","title":"Small Latin arrays have a near transversal","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Diagonal; Transversal (combinatorics); Row; Latin square; Row and column spaces; Mathematics; Combinatorics; Corollary; Matrix (chemical analysis); Diagonal matrix; Order (exchange); Computation; Table (database); Column (typography); Algorithm; Connection (principal bundle); Computer science; Geometry; Mathematical analysis; Materials science","score_opus":0.03635854040924036,"score_gpt":0.22252333559703177,"score_spread":0.18616479518779142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986160520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.800084,0.00040359152,0.15298074,0.000543878,0.00014966862,0.00003885688,0.0002643059,0.00056786597,0.044967085],"genre_scores_gemma":[0.9405583,0.00020643999,0.045243423,0.00028625157,0.00006141377,0.000042090043,0.00025519566,0.00015205883,0.013194795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948454,0.00012059141,0.000034138444,0.00012153478,0.00013747001,0.0001015589],"domain_scores_gemma":[0.99684685,0.0012134151,0.00059509365,0.00057818886,0.00047190514,0.00029454497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035826873,0.00038694218,0.0004124294,0.0006605894,0.0006480752,0.0016238025,0.0003548331,0.00063645863,0.009438991],"category_scores_gemma":[0.0031874932,0.0005291167,0.00035381786,0.00045870384,0.0010092388,0.0016123427,0.0011101373,0.0008589804,0.0016594937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010400782,0.00016138241,0.008579653,0.00027043573,0.000050868184,0.0007082659,0.0004801283,0.040712364,0.18375915,0.7186849,0.004961236,0.040591564],"study_design_scores_gemma":[0.0001270627,0.0009209238,0.0042409366,0.00014721634,0.000057128073,0.0022470301,0.0007479464,0.17894964,0.09382444,0.6923609,0.026285637,0.00009110427],"about_ca_topic_score_codex":0.00035085576,"about_ca_topic_score_gemma":0.0006915409,"teacher_disagreement_score":0.009438991,"about_ca_system_score_codex":0.00039067407,"about_ca_system_score_gemma":0.00030481725,"threshold_uncertainty_score":0.031576574},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13860692,0.0015329997,0.7816738,0.007835541,0.0010063505,0.00028558625,0.00086503336,0.0016762642,0.06651763],"genre_scores_gemma":[0.60852003,0.000944058,0.35586262,0.0019875106,0.00063670037,0.00033279377,0.001318712,0.00047655418,0.029921025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998792,0.00037157777,0.000084124906,0.00031130333,0.00020509322,0.00023585878],"domain_scores_gemma":[0.9964977,0.0022989505,0.00019962658,0.00047147836,0.00035916237,0.00017326053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012631972,0.00064357975,0.0011441316,0.000798999,0.0016583849,0.0019269758,0.001371699,0.0015729662,0.011649162],"category_scores_gemma":[0.00818381,0.00058178266,0.0011279124,0.001094582,0.001573907,0.005528253,0.0021495884,0.0027411154,0.0015186758],"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.0006802367,0.0003521667,0.0021010505,0.00073080254,0.0001613892,0.00069196144,0.00072267256,0.077272765,0.0042106416,0.6254253,0.04785826,0.2397928],"study_design_scores_gemma":[0.00013227436,0.00014830027,0.00018895675,0.00006036973,0.00003918321,0.00027480017,0.00030414198,0.14882156,0.0021812932,0.83652186,0.011298753,0.000028434359],"about_ca_topic_score_codex":0.0019922832,"about_ca_topic_score_gemma":0.0019425055,"teacher_disagreement_score":0.011649162,"about_ca_system_score_codex":0.0007462988,"about_ca_system_score_gemma":0.0015914692,"threshold_uncertainty_score":0.03897035},"labels":[],"label_agreement":null},{"id":"W2989059133","doi":"10.1002/jcd.21712","title":"Colourings of star systems","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Star (game theory); Partition (number theory); Order (exchange); Bipartite graph; Chromatic scale; Mathematics; Monochromatic color; Vertex (graph theory); Graph; Complete graph; Integer (computer science); Physics; Discrete mathematics; Astrophysics; Computer science","score_opus":0.028141003823335436,"score_gpt":0.22874985212866059,"score_spread":0.20060884830532516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989059133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74208516,0.0006262173,0.18064061,0.0005418004,0.00030868914,0.00016656565,0.00046096955,0.00053600833,0.07463401],"genre_scores_gemma":[0.96347445,0.00015161105,0.02727692,0.00012857214,0.000035899546,0.000049378214,0.00023453936,0.00007636201,0.008572175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998966,0.00024578508,0.00007597303,0.00021945675,0.00020238619,0.00029051956],"domain_scores_gemma":[0.9973236,0.0007718799,0.00031700917,0.00059882965,0.00046287823,0.0005259027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309184,0.00027703185,0.00043792615,0.0008101866,0.0015372735,0.0020286746,0.00037644673,0.0005963512,0.010426512],"category_scores_gemma":[0.0023413873,0.000414232,0.0005892765,0.0005669905,0.0014954801,0.0020184894,0.0020235549,0.0008318535,0.0007967664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042179687,0.00009533496,0.004016197,0.00021643771,0.000050238472,0.00029346533,0.00069429795,0.02488962,0.04052701,0.8962933,0.00468417,0.027818147],"study_design_scores_gemma":[0.00013621926,0.0004367759,0.003771267,0.00007503232,0.00006480941,0.0007622165,0.00062044844,0.10590847,0.037138313,0.8052743,0.045720022,0.00009205083],"about_ca_topic_score_codex":0.0012170636,"about_ca_topic_score_gemma":0.0021063888,"teacher_disagreement_score":0.010426512,"about_ca_system_score_codex":0.0011415499,"about_ca_system_score_gemma":0.0007698628,"threshold_uncertainty_score":0.03488016},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74545753,0.0015325543,0.21980157,0.00090516306,0.000093170536,0.00014270727,0.00077695627,0.00020586529,0.031084625],"genre_scores_gemma":[0.9547191,0.00044540138,0.03782947,0.0001334359,0.000051082345,0.00012100229,0.0006087387,0.000040972838,0.0060507786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960524,0.00009677202,0.000016963353,0.00010326261,0.000077195546,0.00010056308],"domain_scores_gemma":[0.99833775,0.0007381814,0.0002982422,0.00015779228,0.00022678402,0.0002411701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033826486,0.0003041316,0.0003338744,0.0011319084,0.0010548909,0.0009823845,0.00058293116,0.0007340243,0.0055486774],"category_scores_gemma":[0.0023199904,0.00043180023,0.00041312134,0.0007337417,0.0011223155,0.0015323733,0.00086411077,0.00083762256,0.00042327968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015406814,0.00006254574,0.0031067552,0.00027384615,0.00004035438,0.00043928035,0.0006935947,0.037358116,0.013874163,0.9165625,0.0037459275,0.023688972],"study_design_scores_gemma":[0.00006531297,0.00013680181,0.002637705,0.000114577226,0.00003787263,0.00087237277,0.000619861,0.25099054,0.0096685095,0.71979797,0.014987043,0.00007153961],"about_ca_topic_score_codex":0.0018889802,"about_ca_topic_score_gemma":0.002058335,"teacher_disagreement_score":0.0055486774,"about_ca_system_score_codex":0.0008045615,"about_ca_system_score_gemma":0.00062945916,"threshold_uncertainty_score":0.018562198},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15561001,0.00039093412,0.8349085,0.0005539527,0.00011532573,0.00010005331,0.00010056472,0.0016399755,0.006580733],"genre_scores_gemma":[0.70609945,0.00021091291,0.28803352,0.00026050824,0.000022262899,0.000144653,0.00019580509,0.00017096887,0.00486202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998355,0.000037257963,0.0000066638045,0.00004887296,0.000045095167,0.000026674214],"domain_scores_gemma":[0.9997459,0.0001147694,0.00003864614,0.000030413386,0.000046909896,0.000023297593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033357283,0.0005442545,0.0004000474,0.0004420398,0.0002737334,0.00041753263,0.0006044665,0.00073707657,0.0020007684],"category_scores_gemma":[0.00080364384,0.0003255528,0.0003823382,0.00036402832,0.0005244506,0.0005939917,0.00048675854,0.00064119545,0.00034557775],"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.00007053833,0.00006465286,0.0005008463,0.00006654174,0.000022727061,0.000056587854,0.000030750034,0.8992613,0.022954544,0.011233338,0.0017628386,0.063975394],"study_design_scores_gemma":[0.000005371042,0.0000128902475,0.00003462044,0.0000018969865,0.0000021424717,0.000004661647,0.0000028782224,0.99574184,0.0017707079,0.0019461096,0.00047492216,0.0000019718618],"about_ca_topic_score_codex":0.0031601274,"about_ca_topic_score_gemma":0.004986141,"teacher_disagreement_score":0.0031601274,"about_ca_system_score_codex":0.0010570966,"about_ca_system_score_gemma":0.00068804587,"threshold_uncertainty_score":0.007669866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62387973,0.0011621104,0.22348619,0.0015801459,0.00017774235,0.000104062514,0.0010944412,0.0017268832,0.14678863],"genre_scores_gemma":[0.9607777,0.0004864776,0.022649832,0.0003256803,0.00014670227,0.00009644845,0.0005626639,0.00016268641,0.014791662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947363,0.00006265841,0.000024995868,0.00022193708,0.0000885714,0.00012826642],"domain_scores_gemma":[0.99855965,0.0005717783,0.00022883294,0.00029713442,0.00016189017,0.00018078886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754955,0.00035312926,0.000587424,0.00076494814,0.0012604168,0.0014439938,0.0004493919,0.0005875766,0.012132873],"category_scores_gemma":[0.0021680994,0.00033404128,0.0006385908,0.0007457205,0.0012258646,0.003133842,0.0011886633,0.0010269035,0.0012840275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002541668,0.00007730964,0.0039012216,0.0002086946,0.00003515899,0.00085171155,0.0006172315,0.0034478498,0.025512323,0.9238831,0.0053759003,0.035835344],"study_design_scores_gemma":[0.000076809876,0.00019146486,0.005313657,0.000060743943,0.00010858582,0.0028963482,0.00043954115,0.029139942,0.015155893,0.9111967,0.03535531,0.00006494377],"about_ca_topic_score_codex":0.0013874341,"about_ca_topic_score_gemma":0.001866943,"teacher_disagreement_score":0.012132873,"about_ca_system_score_codex":0.0006289791,"about_ca_system_score_gemma":0.00043006038,"threshold_uncertainty_score":0.040588558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07180811,0.002552043,0.6851013,0.004802339,0.0014153747,0.0004885304,0.0011248213,0.00178341,0.2309241],"genre_scores_gemma":[0.72804713,0.0046511698,0.22615182,0.0032564253,0.0011441129,0.00060860865,0.0011114203,0.0006415945,0.034387704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899477,0.0001709943,0.00005697764,0.0002699591,0.00030460654,0.00020268215],"domain_scores_gemma":[0.9975237,0.0016251637,0.000115708135,0.00036734392,0.00024827613,0.00011973274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010963331,0.0015835192,0.00053778157,0.00094422896,0.0015133367,0.0020144207,0.0014197356,0.0012949951,0.018530618],"category_scores_gemma":[0.0041073714,0.0008295461,0.0018145406,0.00086487073,0.00379683,0.0059687705,0.005984195,0.0043890327,0.0015451271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000756047,0.0000927189,0.0005310243,0.0005147048,0.00003406536,0.0013092811,0.00062005245,0.002193448,0.007331798,0.9431655,0.0075167846,0.03661502],"study_design_scores_gemma":[0.00006162096,0.00010114529,0.0010411477,0.0001581701,0.000070543145,0.0012184747,0.00044833415,0.0039667133,0.012243853,0.9215254,0.05911516,0.00004931995],"about_ca_topic_score_codex":0.00082481565,"about_ca_topic_score_gemma":0.0010071934,"teacher_disagreement_score":0.018530618,"about_ca_system_score_codex":0.00088221073,"about_ca_system_score_gemma":0.00062703656,"threshold_uncertainty_score":0.061991036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.842145,0.0012120099,0.07952187,0.0013479413,0.00021297742,0.00007387526,0.0012634703,0.0005609405,0.07366198],"genre_scores_gemma":[0.9735826,0.0005296147,0.014840725,0.0001826444,0.00010605635,0.00007678262,0.0007850828,0.000100170735,0.009796312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.000059257185,0.00002651058,0.00014324623,0.000112225185,0.0001668329],"domain_scores_gemma":[0.99737847,0.0013147533,0.00027112899,0.00048616147,0.00023348404,0.00031607805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004423485,0.00040315377,0.0003668708,0.0012040656,0.0012851678,0.002289493,0.0009089741,0.00060043705,0.0082140975],"category_scores_gemma":[0.002865214,0.0002918591,0.00036552746,0.0010856745,0.0020041943,0.0026045488,0.0013545384,0.0010859469,0.0009260675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058305735,0.000104045605,0.009106693,0.00028627974,0.000057736666,0.00035234814,0.00087131636,0.04452435,0.04844002,0.8344401,0.012762799,0.04847128],"study_design_scores_gemma":[0.000095492534,0.00017327849,0.0059768655,0.000108345805,0.00007248129,0.00066962454,0.00052743836,0.13399369,0.03391106,0.7902988,0.03405468,0.00011821785],"about_ca_topic_score_codex":0.0035074311,"about_ca_topic_score_gemma":0.004981459,"teacher_disagreement_score":0.0082140975,"about_ca_system_score_codex":0.0019307863,"about_ca_system_score_gemma":0.00082832575,"threshold_uncertainty_score":0.027478874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82838756,0.0009094209,0.1452254,0.0011069683,0.00011338489,0.00014246411,0.0013645027,0.00018310628,0.022567216],"genre_scores_gemma":[0.9307084,0.00071361096,0.06022308,0.00013812247,0.00006997805,0.00013212724,0.0006418097,0.00006562179,0.0073072542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995017,0.000091979746,0.000033657805,0.00016135452,0.000113063135,0.00009833658],"domain_scores_gemma":[0.9976453,0.0012063065,0.00038480494,0.00018870906,0.00027681276,0.00029796426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003206903,0.0005479559,0.00076896383,0.0016270129,0.0012935571,0.0022566358,0.0011657114,0.0011356403,0.0036623667],"category_scores_gemma":[0.003583294,0.0004425417,0.0004983271,0.0022396648,0.0010441467,0.0025738727,0.0011149268,0.0008302887,0.0002785632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008343739,0.00013521279,0.0045981905,0.00055415137,0.000108878965,0.00070846,0.0012166053,0.05659667,0.018212825,0.8676452,0.0033190697,0.046070408],"study_design_scores_gemma":[0.0001466553,0.00014967594,0.0023486898,0.000108033346,0.00008326058,0.00094239815,0.0008478818,0.124221355,0.007853984,0.8528914,0.010359547,0.00004719348],"about_ca_topic_score_codex":0.002040773,"about_ca_topic_score_gemma":0.0026916375,"teacher_disagreement_score":0.0036623667,"about_ca_system_score_codex":0.00127628,"about_ca_system_score_gemma":0.00085632724,"threshold_uncertainty_score":0.012251854},"labels":[],"label_agreement":null},{"id":"W3006556965","doi":"10.1002/jcd.21706","title":"Classification of skew‐Hadamard matrices of order 32 and association schemes of order 31","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Hadamard transform; Skew; Combinatorics; Hadamard's maximal determinant problem; Order (exchange); Complex Hadamard matrix; Permutation (music); Association scheme; Equivalence (formal languages); Hadamard matrix; Hadamard's inequality; Backtracking; Matrix (chemical analysis); Hadamard product; Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.019222495699942627,"score_gpt":0.22581786203395077,"score_spread":0.20659536633400813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006556965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9006233,0.00030608763,0.080308504,0.00027362627,0.00008564826,0.00011842239,0.00033843753,0.00015057261,0.017795386],"genre_scores_gemma":[0.9564072,0.0000988166,0.039244972,0.000046459154,0.000034367764,0.00005561133,0.0004179524,0.00002216496,0.0036726291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987413,0.00022960454,0.00013887361,0.00022774086,0.00041962403,0.00024298485],"domain_scores_gemma":[0.9967173,0.0010184413,0.00058348535,0.0009143709,0.00046439675,0.0003020519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081714406,0.00034584303,0.00041024332,0.0018512417,0.0011783055,0.0016507431,0.0005726743,0.0008215647,0.005890521],"category_scores_gemma":[0.0037297443,0.00028032373,0.0005005567,0.0012142418,0.0014811928,0.0017704725,0.0010159333,0.0009473667,0.0005902017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040950737,0.00023254831,0.010829073,0.0001349274,0.000023539576,0.0004335051,0.0010251891,0.010839241,0.023292491,0.85021895,0.002277772,0.10028333],"study_design_scores_gemma":[0.00010686387,0.00046172875,0.007731076,0.00008093756,0.000025788799,0.0017302608,0.0007127605,0.077879764,0.022919152,0.8628966,0.025353268,0.000101670754],"about_ca_topic_score_codex":0.00036239016,"about_ca_topic_score_gemma":0.00031758903,"teacher_disagreement_score":0.005890521,"about_ca_system_score_codex":0.00058520935,"about_ca_system_score_gemma":0.00058894884,"threshold_uncertainty_score":0.019705772},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43622822,0.0016477498,0.4510435,0.0018148806,0.00018467136,0.0001221862,0.000582885,0.00064460875,0.10773133],"genre_scores_gemma":[0.9315123,0.0006088062,0.02936951,0.000331321,0.00020307886,0.00018216566,0.0004786285,0.00035652157,0.036957726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941766,0.0001859098,0.000020983078,0.00014486074,0.00012729641,0.00010332292],"domain_scores_gemma":[0.99784553,0.0011199561,0.00023591207,0.00023189715,0.00025086018,0.00031580476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009067554,0.00064495334,0.00094138284,0.0028475812,0.0013779497,0.0034027821,0.0008658242,0.0011069746,0.012810959],"category_scores_gemma":[0.0043107527,0.0007025938,0.00058239774,0.0016387079,0.0016074383,0.004844559,0.0018379365,0.0016608197,0.0011459684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060357623,0.000042126776,0.00034178773,0.000056528243,0.00001268042,0.000051090883,0.00022902936,0.00595625,0.0016815834,0.97982085,0.00190937,0.009838283],"study_design_scores_gemma":[0.000015971384,0.000008425113,0.00019631327,0.000016472777,0.000009866992,0.00004207241,0.00011001742,0.024519188,0.00062499824,0.97262055,0.0018307572,0.0000053682647],"about_ca_topic_score_codex":0.0011012953,"about_ca_topic_score_gemma":0.0012274395,"teacher_disagreement_score":0.012810959,"about_ca_system_score_codex":0.0012640246,"about_ca_system_score_gemma":0.00041341424,"threshold_uncertainty_score":0.042856872},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07129878,0.00055985316,0.8573363,0.00080111553,0.00040184258,0.00010480156,0.00045157722,0.0005153518,0.06853051],"genre_scores_gemma":[0.6002208,0.0005131167,0.3701989,0.0009249702,0.00064495654,0.00042650415,0.00054755446,0.00032530908,0.026197854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841356,0.00033527907,0.00008830735,0.00033768514,0.00051170244,0.00031344988],"domain_scores_gemma":[0.99819654,0.00059758336,0.00019676404,0.00047225872,0.00041055208,0.00012626858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079530914,0.00064681296,0.0005843076,0.001568244,0.0011149681,0.0018874758,0.0011014674,0.001256749,0.007117212],"category_scores_gemma":[0.003933832,0.00042055396,0.0007012716,0.0012055311,0.0016818133,0.002654848,0.0016559283,0.0020310837,0.0013430952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055694767,0.000025126496,0.00019342649,0.000043121556,0.0000058521027,0.00007527558,0.00014563718,0.003640695,0.007547639,0.96017253,0.002023186,0.026071688],"study_design_scores_gemma":[0.00003168955,0.00012279558,0.0003365705,0.000047434656,0.00001951069,0.0005928843,0.0001409015,0.06326344,0.009747627,0.87993145,0.04570966,0.000056043424],"about_ca_topic_score_codex":0.0005598785,"about_ca_topic_score_gemma":0.00068792095,"teacher_disagreement_score":0.007117212,"about_ca_system_score_codex":0.00085066864,"about_ca_system_score_gemma":0.00072208006,"threshold_uncertainty_score":0.023809433},"labels":[],"label_agreement":null},{"id":"W3010175047","doi":"10.1002/jcd.21709","title":"Design theory and some forbidden configurations","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pigeonhole principle; Divisibility rule; Combinatorics; Row; Extension (predicate logic); Matrix (chemical analysis); Upper and lower bounds; Row and column spaces; Column (typography); Block (permutation group theory); Value (mathematics); Set (abstract data type); Discrete mathematics; Geometry; Statistics; Connection (principal bundle); Computer science","score_opus":0.029087719874567212,"score_gpt":0.22395697859690114,"score_spread":0.19486925872233393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010175047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15860486,0.0006907631,0.7628266,0.003000926,0.00017474499,0.00016780222,0.00024225979,0.0002880393,0.07400408],"genre_scores_gemma":[0.88992286,0.00030934857,0.09897925,0.0006263762,0.000110396446,0.00036336813,0.00019556737,0.00006006308,0.009432602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555075,0.0023524165,0.00020579163,0.0005212799,0.0008731622,0.0004966174],"domain_scores_gemma":[0.99131525,0.0057774335,0.0006275308,0.0012880148,0.00065402343,0.00033779832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027221837,0.00056412845,0.0006618671,0.0010859878,0.0018843677,0.002099848,0.0013491452,0.0017147934,0.009375538],"category_scores_gemma":[0.008207729,0.00079293037,0.00087836874,0.0009680353,0.0040033855,0.0029351136,0.0021111388,0.0028027708,0.00068272796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037652342,0.00003372779,0.00021453811,0.000057745456,0.000013199932,0.00008644455,0.00011702564,0.00894415,0.00082493376,0.98072124,0.0010214915,0.007928046],"study_design_scores_gemma":[0.000039353814,0.00007580736,0.00012087993,0.000043428136,0.000011940425,0.00018432779,0.000084310974,0.031298347,0.0014631258,0.96110576,0.0055554467,0.000017267108],"about_ca_topic_score_codex":0.0004031255,"about_ca_topic_score_gemma":0.00038953978,"teacher_disagreement_score":0.009375538,"about_ca_system_score_codex":0.0015434141,"about_ca_system_score_gemma":0.00085293193,"threshold_uncertainty_score":0.03136432},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9276103,0.00046323703,0.05627646,0.00015339511,0.000031483447,0.00002399302,0.00020064315,0.000072700226,0.01516778],"genre_scores_gemma":[0.9782804,0.00026570002,0.01774179,0.000034294913,0.000027409282,0.00002394404,0.00023140978,0.00001825065,0.003376828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950504,0.000089350484,0.00003086495,0.00010557861,0.00015678463,0.00011231285],"domain_scores_gemma":[0.99889886,0.0003518411,0.00041634234,0.00012214485,0.00009255384,0.00011835716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002456534,0.00030330982,0.00023438866,0.001073918,0.000742458,0.0013697605,0.00032511642,0.0003570486,0.002899829],"category_scores_gemma":[0.0015466087,0.00021164831,0.00021684261,0.00088229607,0.0012044854,0.0016260721,0.0010000117,0.0007395941,0.00023535249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027044493,0.000066160705,0.008736416,0.00017665818,0.000033328502,0.0007469254,0.00097025523,0.025346987,0.014207068,0.8947277,0.0008676654,0.05385041],"study_design_scores_gemma":[0.0000559259,0.00042185903,0.008389253,0.000113109025,0.000051779607,0.0020193704,0.0013017417,0.06902016,0.026982434,0.8635465,0.028006045,0.00009196638],"about_ca_topic_score_codex":0.00058011716,"about_ca_topic_score_gemma":0.00076372264,"teacher_disagreement_score":0.002899829,"about_ca_system_score_codex":0.0005290252,"about_ca_system_score_gemma":0.00033231743,"threshold_uncertainty_score":0.009700894},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32735652,0.0006594307,0.3921108,0.0042719804,0.0008927621,0.00032159747,0.0026640475,0.0005300648,0.27119276],"genre_scores_gemma":[0.87237316,0.0007445502,0.07672884,0.0016348199,0.00019729491,0.000277847,0.0038115482,0.00033533355,0.04389659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.000106875304,0.000034814762,0.0002481141,0.0001848636,0.00012623626],"domain_scores_gemma":[0.9980439,0.00060214225,0.00029336652,0.00037384508,0.00049571885,0.00019089524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031012463,0.0004365316,0.0005965553,0.00044792602,0.0014341596,0.001151879,0.0006448554,0.0007177312,0.015412203],"category_scores_gemma":[0.002452448,0.00028952115,0.0005240898,0.0006642738,0.0015476944,0.0027186817,0.0010169549,0.0016828441,0.0016785805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012360899,0.000034465465,0.00081456424,0.00017074822,0.00002332435,0.0005073208,0.00023441525,0.005021025,0.004478905,0.9537255,0.013537485,0.021328658],"study_design_scores_gemma":[0.00002910073,0.000079116806,0.0007561718,0.000035437766,0.00002055841,0.0012110402,0.00029669725,0.037255738,0.0026580305,0.9237124,0.033917323,0.000028484521],"about_ca_topic_score_codex":0.0038257607,"about_ca_topic_score_gemma":0.004194951,"teacher_disagreement_score":0.015412203,"about_ca_system_score_codex":0.00071047025,"about_ca_system_score_gemma":0.0007948531,"threshold_uncertainty_score":0.05155897},"labels":[],"label_agreement":null},{"id":"W3012119802","doi":"10.1002/jcd.21710","title":"The existence of disjoint (hooked) near‐Rosa sequences and applications","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Simple (philosophy); Discrete mathematics; Epistemology","score_opus":0.021723266705923006,"score_gpt":0.2215002456100916,"score_spread":0.1997769789041686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012119802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72830105,0.0007466932,0.22007614,0.0005080659,0.00019626766,0.00008918412,0.00033766965,0.00024057792,0.04950432],"genre_scores_gemma":[0.94817215,0.0001972861,0.04758909,0.000089067245,0.000040433235,0.00005851788,0.00020111277,0.000018644314,0.0036336682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994141,0.000106947155,0.00007740494,0.00013704956,0.00017143437,0.00009300311],"domain_scores_gemma":[0.99733186,0.0010769559,0.0004697855,0.00031497376,0.00040321174,0.00040329926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044877204,0.00038613298,0.0004747787,0.0012155379,0.00091296027,0.00092935265,0.0004531546,0.0007643736,0.0048002554],"category_scores_gemma":[0.003998567,0.00035943015,0.00040880116,0.00045518097,0.0014238667,0.0012571855,0.0017871038,0.0010585862,0.0005541489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002862519,0.000095614094,0.0034255912,0.00024684577,0.00003071712,0.0009328859,0.00042122792,0.013390887,0.059778832,0.88642216,0.0007836591,0.03418535],"study_design_scores_gemma":[0.00008771773,0.00043341378,0.0026016016,0.00016497436,0.00004649878,0.0031091562,0.00093719165,0.073501706,0.06327752,0.8366063,0.019108644,0.00012531238],"about_ca_topic_score_codex":0.00036635512,"about_ca_topic_score_gemma":0.00053633825,"teacher_disagreement_score":0.0048002554,"about_ca_system_score_codex":0.00049557514,"about_ca_system_score_gemma":0.00060839124,"threshold_uncertainty_score":0.016058445},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54962194,0.0005206706,0.43826562,0.000725688,0.000049453818,0.00025724768,0.00058866566,0.0006226481,0.00934817],"genre_scores_gemma":[0.73132473,0.00025093608,0.2636728,0.00009811342,0.00001409788,0.00009989789,0.0006413067,0.00009725876,0.003800856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993772,0.00018213179,0.00003772737,0.00016049285,0.00013495598,0.00010746072],"domain_scores_gemma":[0.99761945,0.001592922,0.00022018809,0.00028336712,0.00011811891,0.00016597797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194083,0.00037480475,0.0007125811,0.00038563434,0.0005338661,0.00090987183,0.00088428194,0.00069148256,0.0037923008],"category_scores_gemma":[0.00355805,0.00033214863,0.00049654517,0.0007005155,0.00049645384,0.0015405319,0.00070870295,0.0008911186,0.00046667122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008208635,0.00044586693,0.005082626,0.0005122279,0.00007113741,0.0005239484,0.00027648557,0.74597603,0.023087373,0.07997994,0.004163599,0.13905983],"study_design_scores_gemma":[0.000096600925,0.00037620243,0.0006765921,0.000031124942,0.000036947687,0.00024928834,0.0001942982,0.91084516,0.010717771,0.073847555,0.0029059653,0.000022503815],"about_ca_topic_score_codex":0.0016932463,"about_ca_topic_score_gemma":0.0031056274,"teacher_disagreement_score":0.0037923008,"about_ca_system_score_codex":0.00065852323,"about_ca_system_score_gemma":0.0011880674,"threshold_uncertainty_score":0.012686551},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059517387,0.0003181844,0.92045015,0.00031216707,0.000079751655,0.00024161172,0.0004442437,0.0002601658,0.018376231],"genre_scores_gemma":[0.54962504,0.00055972044,0.42543584,0.00027765785,0.00010054614,0.000930579,0.0009974157,0.00016580988,0.021907372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823534,0.00081503537,0.000110623296,0.0002678799,0.00035424918,0.0002167856],"domain_scores_gemma":[0.9958586,0.0023805106,0.00054224103,0.0006332875,0.0004068771,0.00017840741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019865003,0.00058643555,0.00049342436,0.000871415,0.000884963,0.0011719464,0.0007358824,0.00065650797,0.009234274],"category_scores_gemma":[0.0053828494,0.00050695473,0.00089645106,0.0006920281,0.0011688583,0.0015768928,0.0013500012,0.0012215758,0.0016970476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012913738,0.00004488371,0.0004828768,0.00015076263,0.000035611778,0.000144663,0.00022145886,0.023166519,0.0062242644,0.9287785,0.0015716752,0.039049692],"study_design_scores_gemma":[0.00011803398,0.00021495782,0.0005234164,0.000090770176,0.000052028525,0.0002224174,0.000097196615,0.08517855,0.0063289045,0.88111496,0.026022894,0.000035956335],"about_ca_topic_score_codex":0.00078585045,"about_ca_topic_score_gemma":0.0016749167,"teacher_disagreement_score":0.009234274,"about_ca_system_score_codex":0.0010820997,"about_ca_system_score_gemma":0.0008091261,"threshold_uncertainty_score":0.030891716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6273712,0.0007052102,0.317793,0.00086234784,0.00022879467,0.00006461068,0.00019042125,0.00021348512,0.05257093],"genre_scores_gemma":[0.9142113,0.00020674968,0.077816494,0.0001491732,0.0000696811,0.000084150015,0.00020985855,0.000046042955,0.0072066993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998825,0.00030559578,0.00007644727,0.0002376426,0.00037133397,0.0001838722],"domain_scores_gemma":[0.9982399,0.0008276988,0.00020807044,0.00042059814,0.00017227387,0.00013153876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001187229,0.0002929011,0.00040967853,0.0013204946,0.0017055334,0.0019501045,0.0008352789,0.0005320535,0.0029878034],"category_scores_gemma":[0.0019060167,0.0003351475,0.0007557451,0.00095131533,0.0030612445,0.003820928,0.0025938165,0.0015031241,0.00040058605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025407715,0.000010715083,0.000500446,0.00002137941,0.0000035069618,0.000050803632,0.00049554335,0.0005368584,0.0016853986,0.99058235,0.00018592963,0.0059016934],"study_design_scores_gemma":[0.000018349332,0.000050439085,0.00069815887,0.000017217722,0.000008131819,0.00026052006,0.00032233994,0.004030493,0.006152755,0.9750172,0.013403378,0.000021027103],"about_ca_topic_score_codex":0.00017994357,"about_ca_topic_score_gemma":0.000258912,"teacher_disagreement_score":0.0029878034,"about_ca_system_score_codex":0.0009973504,"about_ca_system_score_gemma":0.00040074342,"threshold_uncertainty_score":0.009995222},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04050074,0.00016087719,0.9014537,0.00051322655,0.00025335955,0.0006978523,0.0013312631,0.023593528,0.031495508],"genre_scores_gemma":[0.22643137,0.000084747306,0.75179124,0.00016476942,0.0000481921,0.0008026833,0.002237646,0.003848579,0.01459072],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990101,0.000252672,0.00006514695,0.00016673245,0.00028049925,0.0002249269],"domain_scores_gemma":[0.998454,0.00092792016,0.00007018357,0.00021922235,0.00019878072,0.00012983577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279628,0.0011481526,0.00086046726,0.0012163706,0.0009476818,0.0014978116,0.001938419,0.001117437,0.035884522],"category_scores_gemma":[0.0051795235,0.0005965104,0.0011697554,0.00081211707,0.0007185052,0.0017512869,0.002660485,0.0017370104,0.0053014397],"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.0013292902,0.0011610131,0.0043224627,0.00083120546,0.00018236817,0.0010195212,0.0006174209,0.21563764,0.012567807,0.24869265,0.09939029,0.41424832],"study_design_scores_gemma":[0.00044384986,0.0000973293,0.00032396844,0.000030884683,0.000022813392,0.00016313647,0.00011899394,0.856873,0.00637835,0.11393002,0.021585604,0.000032121578],"about_ca_topic_score_codex":0.0023767937,"about_ca_topic_score_gemma":0.006475548,"teacher_disagreement_score":0.035884522,"about_ca_system_score_codex":0.00092878914,"about_ca_system_score_gemma":0.0017202229,"threshold_uncertainty_score":0.12004572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49000958,0.00095447985,0.23679931,0.0027814591,0.0005105507,0.00019839205,0.0007173802,0.00049948326,0.26752934],"genre_scores_gemma":[0.9378646,0.0006871297,0.029092059,0.00056557875,0.00023133426,0.00013499659,0.0005607007,0.00020392334,0.030659758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784267,0.0006716415,0.0001120414,0.00031081648,0.00048792092,0.0005748564],"domain_scores_gemma":[0.99488246,0.0032550253,0.00034952824,0.00079818803,0.0003432406,0.00037158083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018207983,0.0008708087,0.0016442062,0.002162207,0.0043359506,0.006091849,0.0023249204,0.0027852592,0.016642902],"category_scores_gemma":[0.0073044966,0.00092703995,0.0015110407,0.003037149,0.0053881286,0.0087341685,0.0043707658,0.0055708336,0.0019263348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034108973,0.000021119324,0.00006700017,0.000014777307,0.0000030737622,0.00006250059,0.00012398236,0.0008968016,0.00023754437,0.99517244,0.0004887243,0.0028779584],"study_design_scores_gemma":[0.000008965886,0.0000052605283,0.00002708987,0.0000076203605,0.000002607147,0.000026121184,0.00005084639,0.0016582733,0.00018332398,0.99741334,0.0006097262,0.000006759917],"about_ca_topic_score_codex":0.0014660312,"about_ca_topic_score_gemma":0.0018394513,"teacher_disagreement_score":0.016642902,"about_ca_system_score_codex":0.0015283078,"about_ca_system_score_gemma":0.001186736,"threshold_uncertainty_score":0.055676043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33309662,0.000635258,0.6356332,0.00053225824,0.000119457145,0.00015538943,0.00028777382,0.0004928521,0.029047243],"genre_scores_gemma":[0.838229,0.00018699444,0.15780815,0.00011850721,0.000016649445,0.00009802131,0.00018596565,0.000048557213,0.0033081137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989202,0.00039347608,0.00007040154,0.0002451911,0.00022474972,0.00014610677],"domain_scores_gemma":[0.9980921,0.0010530794,0.00023212885,0.00035977617,0.00019223704,0.00007066336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720659,0.0005785592,0.0003795559,0.00067233137,0.00063906255,0.0009546002,0.0005613931,0.0009408896,0.0039271447],"category_scores_gemma":[0.0033187352,0.0003035065,0.0006192803,0.00041489673,0.0007022912,0.0010754752,0.0006123591,0.0006392871,0.00056959834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090564974,0.000247292,0.0053439583,0.000702435,0.00013203385,0.0005550992,0.00044719264,0.26835987,0.07417136,0.408623,0.004435264,0.23607674],"study_design_scores_gemma":[0.00031319063,0.00087386306,0.0022579615,0.00020968713,0.00011147131,0.00079955143,0.0004846149,0.41357437,0.06866713,0.4880306,0.02458373,0.00009385125],"about_ca_topic_score_codex":0.0007740094,"about_ca_topic_score_gemma":0.0013475298,"teacher_disagreement_score":0.0039271447,"about_ca_system_score_codex":0.00079438515,"about_ca_system_score_gemma":0.00075670355,"threshold_uncertainty_score":0.013137579},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14484018,0.0010494803,0.7294734,0.0011572646,0.00055455114,0.00016150506,0.00199942,0.0017886675,0.11897553],"genre_scores_gemma":[0.746033,0.00095820794,0.21105672,0.00051587133,0.0001060718,0.00017572776,0.0016356512,0.0003527256,0.039165955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962294,0.00012579242,0.000017750312,0.000068384725,0.00007510127,0.00008998977],"domain_scores_gemma":[0.99905175,0.00029485996,0.000068999834,0.00022739815,0.00017407225,0.00018290801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031499274,0.00049214717,0.00045648494,0.0008137077,0.0012966965,0.0017400368,0.0010433397,0.0006763097,0.013923753],"category_scores_gemma":[0.0017688214,0.0003941709,0.00047934474,0.0010332857,0.0009808489,0.0015177911,0.001752984,0.0010424803,0.0020665515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043230216,0.00009620682,0.0015031149,0.00024296946,0.000058991096,0.0003877294,0.00043060898,0.040660992,0.012062662,0.8269949,0.02371421,0.09341529],"study_design_scores_gemma":[0.00009814374,0.00007735871,0.0015397364,0.00008182545,0.0000469084,0.0006260868,0.00063245767,0.2208797,0.012128094,0.7159509,0.04787388,0.00006492914],"about_ca_topic_score_codex":0.004224902,"about_ca_topic_score_gemma":0.00545708,"teacher_disagreement_score":0.013923753,"about_ca_system_score_codex":0.0008609745,"about_ca_system_score_gemma":0.00060244225,"threshold_uncertainty_score":0.04657966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5261377,0.0058319885,0.20579526,0.004250472,0.0002006304,0.00009016063,0.0006205,0.00042691082,0.2566464],"genre_scores_gemma":[0.9858577,0.0005461201,0.0078902,0.00030568082,0.00010045734,0.000050103015,0.00008321378,0.000040731364,0.0051258192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.000110279805,0.000013763347,0.00010159326,0.00010807752,0.00017425278],"domain_scores_gemma":[0.99907047,0.00049304345,0.00016743377,0.00006984692,0.000078655954,0.00012064887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063372124,0.00035866105,0.0004931321,0.0011285449,0.0012528569,0.0017776086,0.0010295998,0.00085434964,0.005431596],"category_scores_gemma":[0.0030895642,0.00028162618,0.0005066811,0.0005346314,0.002317426,0.0018218993,0.00164868,0.0019451446,0.0007571757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007400772,0.000017439615,0.00058843865,0.000051475825,0.000009994511,0.00014826516,0.0002345675,0.0067155296,0.0029241676,0.9841501,0.0012024782,0.0038835509],"study_design_scores_gemma":[0.000058342404,0.000062556275,0.0015054082,0.00008501481,0.00001579619,0.00043644613,0.00037567414,0.12198125,0.00572365,0.86054456,0.00916057,0.00005083622],"about_ca_topic_score_codex":0.001823355,"about_ca_topic_score_gemma":0.0008076263,"teacher_disagreement_score":0.005431596,"about_ca_system_score_codex":0.0010067957,"about_ca_system_score_gemma":0.0006756239,"threshold_uncertainty_score":0.018170476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17579864,0.0012563686,0.7233517,0.0020439273,0.00023381448,0.00011860267,0.00066735037,0.0008789581,0.095650606],"genre_scores_gemma":[0.837162,0.00079912296,0.13859653,0.0006225318,0.00032400488,0.00032140577,0.00063619384,0.000491657,0.021046381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970386,0.00065541425,0.00016438917,0.00054457405,0.00082853506,0.0007684765],"domain_scores_gemma":[0.99257517,0.0041955905,0.000890502,0.0009001702,0.0006973561,0.0007411253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039105066,0.0010862547,0.0010444144,0.0014486016,0.0015251553,0.0043878597,0.0016531219,0.0012452572,0.013179291],"category_scores_gemma":[0.011764564,0.0007415932,0.0014795638,0.0015552901,0.0033528318,0.0065303277,0.002993495,0.0030629113,0.0016541871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024892227,0.00005611644,0.0005221012,0.00014127868,0.000017042736,0.00013108815,0.00028614295,0.020166108,0.0028228331,0.9636374,0.0021226301,0.009848329],"study_design_scores_gemma":[0.0000577641,0.00022206218,0.00039301976,0.00010551771,0.00004825285,0.00020215118,0.00018133732,0.1322983,0.006280117,0.8512739,0.008878292,0.000059311962],"about_ca_topic_score_codex":0.001504223,"about_ca_topic_score_gemma":0.0012903466,"teacher_disagreement_score":0.013179291,"about_ca_system_score_codex":0.003533861,"about_ca_system_score_gemma":0.0016455294,"threshold_uncertainty_score":0.04408914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5765582,0.00033763103,0.1967541,0.0015849089,0.0002120361,0.00024084594,0.0013761381,0.0013866787,0.22154951],"genre_scores_gemma":[0.96437716,0.00026521718,0.022175675,0.00026617222,0.000061704406,0.00005681089,0.00039418653,0.00009084469,0.0123121105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997693,0.000029733026,0.0000111251575,0.000055334047,0.00008476955,0.000049801616],"domain_scores_gemma":[0.99838483,0.0008134695,0.0002543774,0.00018195475,0.00023088175,0.0001345425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021532604,0.00034263657,0.00019648479,0.0004679191,0.0006604616,0.0010840389,0.00031746854,0.00024599233,0.014275733],"category_scores_gemma":[0.001401152,0.00028054832,0.0003842241,0.00035652035,0.0013264675,0.0013368158,0.0006436709,0.0009085248,0.0014065632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027655764,0.00010426536,0.0022906202,0.00035412158,0.000042664058,0.0010077435,0.0013608543,0.007906658,0.0337117,0.89424866,0.0113200145,0.047376152],"study_design_scores_gemma":[0.00009349801,0.00011516883,0.0018198867,0.000035478333,0.000033230677,0.00063829497,0.00041013205,0.012952825,0.021272138,0.93914926,0.02344208,0.000038018403],"about_ca_topic_score_codex":0.0014120351,"about_ca_topic_score_gemma":0.002867197,"teacher_disagreement_score":0.014275733,"about_ca_system_score_codex":0.0004997691,"about_ca_system_score_gemma":0.00081518263,"threshold_uncertainty_score":0.04775709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10002733,0.0026078084,0.7417661,0.00073273585,0.0005027416,0.0000984116,0.00029643317,0.0009337719,0.15303472],"genre_scores_gemma":[0.7814264,0.0015249496,0.15883595,0.00050522224,0.00042803213,0.00014363954,0.00037750188,0.00053880527,0.05621949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991823,0.00011426623,0.000058721183,0.00026797294,0.00027846076,0.000098239645],"domain_scores_gemma":[0.9986533,0.0004874351,0.000100845136,0.00048227393,0.00020507727,0.00007100798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010035378,0.00044728795,0.00045458798,0.00083553436,0.00075067056,0.0016494556,0.00067144993,0.00057267403,0.0038776908],"category_scores_gemma":[0.0024547763,0.00040467607,0.00079905347,0.0006277418,0.0031512622,0.0050004576,0.0018363197,0.0018444695,0.0010908772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034943856,0.000014533049,0.00017450728,0.00006681377,0.000007041207,0.00009238811,0.0004915246,0.001944607,0.0048190155,0.96156085,0.0016761849,0.029117467],"study_design_scores_gemma":[0.000010823949,0.000060471637,0.00036793423,0.000031465308,0.00001373624,0.00034140793,0.000117249794,0.008318309,0.010586629,0.9379708,0.042152695,0.000028505616],"about_ca_topic_score_codex":0.0008511847,"about_ca_topic_score_gemma":0.00046508512,"teacher_disagreement_score":0.0038776908,"about_ca_system_score_codex":0.0010813052,"about_ca_system_score_gemma":0.00046707928,"threshold_uncertainty_score":0.012972176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022684561,0.00028412702,0.97447723,0.000096224074,0.000042858857,0.000057829755,0.000046759487,0.00025287224,0.0020574129],"genre_scores_gemma":[0.28794545,0.0003528421,0.70804,0.000080682745,0.000041501313,0.00017012551,0.00021606758,0.000046664787,0.003106619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996977,0.00008289618,0.000016418333,0.000039270653,0.0001431397,0.000020615764],"domain_scores_gemma":[0.99965394,0.00013622713,0.000053422966,0.000050300652,0.00009167234,0.0000144537025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022138451,0.00036021433,0.00018257974,0.00053421373,0.00035967733,0.00037414412,0.0003783669,0.00026916614,0.0010709449],"category_scores_gemma":[0.0009193517,0.0001265869,0.00018971904,0.00046583923,0.00031897725,0.0004932971,0.00037708535,0.0003661809,0.00033355437],"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.00019601821,0.00007744404,0.0016719087,0.00025293327,0.000043681634,0.0001794313,0.00018386885,0.107906476,0.10201221,0.114163555,0.0022091633,0.67110324],"study_design_scores_gemma":[0.00003648602,0.00025851539,0.00066698284,0.00003170411,0.00002166716,0.00048757042,0.000036858553,0.89680547,0.06033066,0.027270263,0.014011975,0.000041910014],"about_ca_topic_score_codex":0.0007818767,"about_ca_topic_score_gemma":0.001169097,"teacher_disagreement_score":0.0010709449,"about_ca_system_score_codex":0.00032356233,"about_ca_system_score_gemma":0.0006970984,"threshold_uncertainty_score":0.0035826564},"labels":[],"label_agreement":null},{"id":"W3028993401","doi":"10.1002/jcd.21762","title":"The localization number of designs","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Combinatorics; Mathematics; Graph; Block design; Discrete mathematics; Projective plane; Incidence (geometry); Computer science; Pure mathematics; Geometry; Correlation","score_opus":0.030535407494273213,"score_gpt":0.2584612004419536,"score_spread":0.22792579294768037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028993401","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6184786,0.00067483506,0.34469673,0.0011189894,0.00005487877,0.00014144994,0.00055053516,0.0008432555,0.033440873],"genre_scores_gemma":[0.97302973,0.00031498086,0.020140752,0.00012954877,0.000025881454,0.0001587395,0.00031803732,0.00013665135,0.0057456563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981067,0.00067115965,0.000086842956,0.00037152597,0.0003850861,0.00037866912],"domain_scores_gemma":[0.9863187,0.008461339,0.0019337515,0.0013383084,0.0011336396,0.0008142729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015500467,0.0008419689,0.000790416,0.0014841626,0.001023277,0.0018749312,0.0011494029,0.0011256498,0.011952395],"category_scores_gemma":[0.012423,0.00078383455,0.0006033087,0.000896159,0.00224475,0.0040452946,0.001753469,0.0013765896,0.0012062897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014303176,0.00038279715,0.012478765,0.0007855622,0.00013009338,0.0007996474,0.0012074136,0.29666862,0.05934074,0.5473907,0.00670979,0.07267563],"study_design_scores_gemma":[0.00029145618,0.0012192811,0.0055317814,0.00024364876,0.00016952114,0.0013379969,0.00083029165,0.49328908,0.06511552,0.41839564,0.013449109,0.0001266665],"about_ca_topic_score_codex":0.00073526206,"about_ca_topic_score_gemma":0.0006974815,"teacher_disagreement_score":0.011952395,"about_ca_system_score_codex":0.0018181802,"about_ca_system_score_gemma":0.00074960815,"threshold_uncertainty_score":0.039984763},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038280122,0.068153135,0.6427799,0.07410369,0.018012373,0.0001801727,0.00044290177,0.0023987815,0.15564893],"genre_scores_gemma":[0.41841477,0.06512634,0.3565613,0.029862925,0.01619672,0.00046105133,0.000827506,0.0017235082,0.11082576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993843,0.00021319157,0.00004398064,0.00014152918,0.00013786016,0.00007917843],"domain_scores_gemma":[0.99770665,0.0011627437,0.00018755622,0.0002790127,0.00041842443,0.0002456244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016627247,0.0012408178,0.0010762413,0.0016462369,0.001429968,0.0027293193,0.0014032759,0.0031067124,0.0113151735],"category_scores_gemma":[0.006057284,0.00053793227,0.0007392516,0.001309219,0.0058868504,0.020255448,0.0031801458,0.00594634,0.0044653374],"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.00005918662,0.0000297079,0.00024003065,0.00021825192,0.0000071913696,0.00020293245,0.0005107266,0.00045857052,0.0010147108,0.94548494,0.013475805,0.038297947],"study_design_scores_gemma":[0.000008734557,0.000058542006,0.00017957315,0.00018597125,0.0000053931035,0.00037256395,0.00031939938,0.0013809452,0.0013433096,0.91416794,0.08193849,0.000039033253],"about_ca_topic_score_codex":0.0006820201,"about_ca_topic_score_gemma":0.00076940807,"teacher_disagreement_score":0.0113151735,"about_ca_system_score_codex":0.00095724745,"about_ca_system_score_gemma":0.0007339015,"threshold_uncertainty_score":0.037853003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07832659,0.0072315326,0.8150028,0.001759771,0.00058860576,0.00016550971,0.0010647546,0.0006541421,0.09520628],"genre_scores_gemma":[0.8271377,0.0042428835,0.1476975,0.00089641707,0.0006093439,0.00041172074,0.0009878213,0.00025031285,0.017766334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794,0.0004298515,0.00009432782,0.0002662173,0.0008255683,0.00044398647],"domain_scores_gemma":[0.98389405,0.011213096,0.0010826802,0.0013027957,0.0018944379,0.0006129097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002924982,0.0016816701,0.00072590995,0.0020794354,0.00088826055,0.002039374,0.0017624662,0.0012224632,0.016524287],"category_scores_gemma":[0.025249783,0.0005924682,0.00054819335,0.0021096156,0.0019368292,0.0056634815,0.002727132,0.0023822633,0.0029793705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073614705,0.0002540286,0.0027579134,0.0009946362,0.00010224371,0.0003650279,0.0008015682,0.07229849,0.0245006,0.734873,0.017681714,0.1446347],"study_design_scores_gemma":[0.0000418546,0.00029628736,0.0016671743,0.00023953142,0.000049352384,0.00040849825,0.00019912964,0.17438827,0.008779504,0.80435103,0.009499836,0.00007952286],"about_ca_topic_score_codex":0.0013028204,"about_ca_topic_score_gemma":0.0029910794,"teacher_disagreement_score":0.016524287,"about_ca_system_score_codex":0.0015235556,"about_ca_system_score_gemma":0.0012043507,"threshold_uncertainty_score":0.055279255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8073187,0.0007975482,0.1068192,0.000860451,0.00015733858,0.00007848835,0.00067684904,0.00032460495,0.08296676],"genre_scores_gemma":[0.97622925,0.00041683932,0.016262045,0.00012489708,0.000112364774,0.000056306213,0.00043695632,0.00012554003,0.006235776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995908,0.00011281374,0.000013338796,0.00007900093,0.0000945972,0.000109441615],"domain_scores_gemma":[0.9988475,0.0004289993,0.00017508329,0.000090223875,0.00017110858,0.00028714217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037409223,0.000501646,0.00037032127,0.0014646859,0.0010455966,0.0024207905,0.0005167309,0.0006266521,0.0049221977],"category_scores_gemma":[0.0026608482,0.0004201256,0.00030721657,0.0008392948,0.0014866841,0.0015843033,0.0009028432,0.00081816665,0.00065655273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013047163,0.00003649004,0.0017261169,0.00006134954,0.000011132112,0.00008342845,0.00026021578,0.0064932615,0.0076159528,0.9663853,0.0031234485,0.014072827],"study_design_scores_gemma":[0.000021436372,0.000026962702,0.001131705,0.000027199347,0.000009834899,0.00012948566,0.00036259746,0.01709743,0.0029448855,0.97325146,0.0049808347,0.00001629534],"about_ca_topic_score_codex":0.0007123228,"about_ca_topic_score_gemma":0.0011345504,"teacher_disagreement_score":0.0049221977,"about_ca_system_score_codex":0.00080929307,"about_ca_system_score_gemma":0.00039718318,"threshold_uncertainty_score":0.016466439},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17550021,0.0009790424,0.5911867,0.0014300095,0.00043608373,0.0002822484,0.003746337,0.0014183472,0.225021],"genre_scores_gemma":[0.67816776,0.001114205,0.26249588,0.00091642607,0.0002569096,0.0004155489,0.0038887816,0.00043409746,0.052310277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991714,0.00013477655,0.000055365228,0.00022238302,0.0002451225,0.00017097789],"domain_scores_gemma":[0.9985355,0.0003912342,0.00015945901,0.00051057496,0.00029115973,0.00011195379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034240948,0.000535202,0.00044457233,0.0010146468,0.0017605376,0.0020731192,0.00079061755,0.00063426147,0.012511036],"category_scores_gemma":[0.002398711,0.00040177352,0.00085514534,0.0018404471,0.0018245495,0.002648185,0.0021286053,0.0013766866,0.0024263116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007746909,0.000022296228,0.0010083747,0.00008671627,0.000013045498,0.00019763438,0.00020197777,0.0073084985,0.004592336,0.93532604,0.009942307,0.041223243],"study_design_scores_gemma":[0.000022884296,0.00007781407,0.001096429,0.00005162587,0.00002030089,0.0010503588,0.00034775006,0.03536647,0.009823256,0.8252861,0.12680456,0.000052430456],"about_ca_topic_score_codex":0.0018913724,"about_ca_topic_score_gemma":0.0023252158,"teacher_disagreement_score":0.012511036,"about_ca_system_score_codex":0.0010211174,"about_ca_system_score_gemma":0.0010578643,"threshold_uncertainty_score":0.041853607},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21368755,0.001997104,0.57484794,0.0010332031,0.0008484357,0.00033219214,0.0009233141,0.00060522906,0.20572506],"genre_scores_gemma":[0.7826765,0.00082173786,0.1814912,0.00051223964,0.0003211367,0.00039122585,0.00049035816,0.0000980449,0.033197533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989392,0.0002549377,0.00009478153,0.00029007546,0.00025745475,0.00016347038],"domain_scores_gemma":[0.9989225,0.00037997038,0.00014563787,0.00025681214,0.00023495695,0.00006007666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010701178,0.00048016538,0.0005181555,0.0009739603,0.00096948503,0.0017084447,0.00044906474,0.0009823396,0.0066916277],"category_scores_gemma":[0.0027570457,0.00027013384,0.00044801613,0.00063417864,0.0016178172,0.0013830833,0.0005539989,0.0007859239,0.0015756742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006804818,0.000008898815,0.00019230966,0.00005523917,0.000005709043,0.000058582205,0.00006898999,0.0010803841,0.0077797296,0.96880496,0.0010873914,0.020789796],"study_design_scores_gemma":[0.00005991941,0.00039067262,0.0007793151,0.00008097282,0.000030308078,0.0007662483,0.00015163017,0.016539173,0.021079328,0.88329124,0.07676895,0.000062341984],"about_ca_topic_score_codex":0.0002462568,"about_ca_topic_score_gemma":0.00040182276,"teacher_disagreement_score":0.0066916277,"about_ca_system_score_codex":0.0008014666,"about_ca_system_score_gemma":0.00048736046,"threshold_uncertainty_score":0.022385776},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36113158,0.0061927703,0.47887376,0.0022071032,0.00056691584,0.0001093437,0.00043084368,0.00031970447,0.15016797],"genre_scores_gemma":[0.87849313,0.0030762192,0.099962145,0.0005138599,0.0006240814,0.00013489038,0.00036642398,0.00010640354,0.016722813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896204,0.00016893765,0.0000750237,0.00022907913,0.00042988773,0.00013506573],"domain_scores_gemma":[0.99578685,0.0025002318,0.00050097494,0.00045377022,0.00056001655,0.00019811817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012901175,0.0006616079,0.0005754673,0.0022851632,0.0013206167,0.0018670654,0.000983298,0.0011030681,0.0045901453],"category_scores_gemma":[0.006138834,0.00044328754,0.0007139028,0.0011304305,0.0028587938,0.0054107686,0.0018582286,0.0022109277,0.0006672442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003486861,0.000032762495,0.001043038,0.00019616802,0.000012544383,0.00032064703,0.0002814526,0.0035632188,0.0050163562,0.97058207,0.0012535413,0.017663319],"study_design_scores_gemma":[0.00001540313,0.00007851219,0.00081501366,0.00007051183,0.000021597647,0.001234616,0.00028221897,0.018063297,0.0066123693,0.96083486,0.011937955,0.000033672004],"about_ca_topic_score_codex":0.00024972108,"about_ca_topic_score_gemma":0.00030054615,"teacher_disagreement_score":0.0045901453,"about_ca_system_score_codex":0.0007407816,"about_ca_system_score_gemma":0.00041597034,"threshold_uncertainty_score":0.015355587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.767368,0.00061475876,0.21732865,0.00024938327,0.000051128496,0.00015186467,0.00012798158,0.00056047813,0.013547658],"genre_scores_gemma":[0.97032756,0.000098971075,0.02808334,0.000027808775,0.0000067079764,0.000035834964,0.000048514958,0.000018440103,0.0013527464],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996557,0.00007458894,0.000009666322,0.000049962448,0.00016890606,0.000041255615],"domain_scores_gemma":[0.99917513,0.00017758281,0.00017327847,0.000056665092,0.00037598747,0.000041253643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029387,0.00035161,0.0001956512,0.00037877003,0.00022502337,0.0005458926,0.0004429828,0.00033193556,0.0006943383],"category_scores_gemma":[0.0007108512,0.00012984102,0.00014393312,0.00029710293,0.0002371699,0.00022562643,0.00022958749,0.00015482018,0.00015113558],"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.00066718867,0.00027895253,0.007277876,0.00041017114,0.00014095177,0.00043456297,0.0003254908,0.3805024,0.5000133,0.018481044,0.0015251853,0.08994289],"study_design_scores_gemma":[0.00003780131,0.00076582964,0.0017909174,0.000014322167,0.000038071386,0.00015554641,0.00002741005,0.91299874,0.08171016,0.0006401105,0.0017968058,0.000024242585],"about_ca_topic_score_codex":0.0030895772,"about_ca_topic_score_gemma":0.0033099833,"teacher_disagreement_score":0.0030895772,"about_ca_system_score_codex":0.0008669734,"about_ca_system_score_gemma":0.0007973212,"threshold_uncertainty_score":0.006290376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7818936,0.0002540041,0.17569849,0.00058952824,0.00010465904,0.00012341107,0.00083281635,0.0007884202,0.039715003],"genre_scores_gemma":[0.9278327,0.00014080213,0.06363065,0.00015917388,0.00004645779,0.00005705329,0.0005332931,0.000090741516,0.0075091785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935013,0.000109030385,0.000028951572,0.00013739424,0.00016341227,0.00021104972],"domain_scores_gemma":[0.99783784,0.00076943956,0.00031884582,0.00052695174,0.00033865156,0.00020830962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031515793,0.00049047737,0.00044287933,0.00097074197,0.0011940122,0.00087763177,0.0005080841,0.00046508582,0.0058171377],"category_scores_gemma":[0.0022906077,0.00039688495,0.0006879295,0.00063836586,0.0015011381,0.0011669969,0.00054274546,0.00095099135,0.00066785625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038796922,0.00022488889,0.0054151732,0.00025838875,0.00006962323,0.0016622351,0.0010056355,0.042612042,0.08486695,0.8126015,0.0070893015,0.043806195],"study_design_scores_gemma":[0.00006372307,0.00020212271,0.0039140107,0.000046555753,0.000043248725,0.0010888159,0.0004327511,0.078564055,0.040562835,0.8605222,0.014471541,0.00008817592],"about_ca_topic_score_codex":0.0016178087,"about_ca_topic_score_gemma":0.0031915968,"teacher_disagreement_score":0.0058171377,"about_ca_system_score_codex":0.00055538036,"about_ca_system_score_gemma":0.0007731226,"threshold_uncertainty_score":0.01946026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9051589,0.00008246296,0.04819236,0.00035529188,0.0000945265,0.000026093889,0.00024041445,0.00022338674,0.045626648],"genre_scores_gemma":[0.9853661,0.000045616485,0.007816195,0.000067205285,0.000037475962,0.000025956462,0.00018195559,0.00004219873,0.0064172605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996562,0.00006225507,0.000016295297,0.00008733452,0.000056228237,0.00012165552],"domain_scores_gemma":[0.99887246,0.00033657716,0.00027196892,0.00016937967,0.00010763122,0.00024200101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026449698,0.00024099255,0.00028774867,0.0010615684,0.0014708472,0.0019983866,0.0005831398,0.00088477455,0.007674302],"category_scores_gemma":[0.001539509,0.00035483867,0.0003856088,0.00067034573,0.0016109516,0.0017253984,0.0014260414,0.0013605154,0.0008259746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021204917,0.00006586787,0.0039456193,0.00004088144,0.000014717697,0.0008696412,0.00054460234,0.0067656133,0.008355241,0.96372265,0.0024535512,0.013009609],"study_design_scores_gemma":[0.00006224655,0.000083591825,0.0036371166,0.000028389066,0.000017384202,0.00097488816,0.0008940939,0.03674417,0.007420312,0.9441678,0.0059260596,0.000043782304],"about_ca_topic_score_codex":0.0010592308,"about_ca_topic_score_gemma":0.0013911341,"teacher_disagreement_score":0.007674302,"about_ca_system_score_codex":0.00084332586,"about_ca_system_score_gemma":0.00030113498,"threshold_uncertainty_score":0.025673091},"labels":[],"label_agreement":null},{"id":"W3047392627","doi":"10.1002/jcd.21747","title":"An extension of a construction of covering arrays","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Alphabet; Extension (predicate logic); Combinatorics; Row; Matching (statistics); Discrete mathematics; Computer science; Statistics","score_opus":0.02059721547403701,"score_gpt":0.2198631619983976,"score_spread":0.19926594652436058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047392627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19707724,0.000601615,0.74550265,0.0008457852,0.00043853238,0.0002634095,0.00045908688,0.0015748024,0.05323684],"genre_scores_gemma":[0.7702928,0.0004162515,0.21935558,0.0004812245,0.00014738768,0.00023294211,0.00030991886,0.00017286472,0.008591064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993949,0.00014602697,0.00003966123,0.00013333709,0.00016718174,0.00011891773],"domain_scores_gemma":[0.9985814,0.0005545582,0.000114704286,0.0004540601,0.00022996285,0.00006521352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034018295,0.00039319627,0.00031218512,0.00078221946,0.00075078965,0.0008290732,0.00046344326,0.00062910974,0.0032215654],"category_scores_gemma":[0.0022087386,0.00038855788,0.00048171193,0.00097126747,0.0007456647,0.0011020356,0.0010678916,0.00077597867,0.0006594672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039610523,0.00013754435,0.0022445214,0.00031389642,0.000073386094,0.00086064235,0.0010372457,0.024988458,0.17943166,0.6169084,0.006669459,0.16693869],"study_design_scores_gemma":[0.00014503166,0.00078228273,0.0023799224,0.00009937772,0.00012254753,0.0031688933,0.00029229565,0.17117439,0.4172557,0.23423299,0.17015359,0.00019296593],"about_ca_topic_score_codex":0.0003088117,"about_ca_topic_score_gemma":0.00027999814,"teacher_disagreement_score":0.0032215654,"about_ca_system_score_codex":0.00043408395,"about_ca_system_score_gemma":0.00037730703,"threshold_uncertainty_score":0.010777235},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7893985,0.0007125756,0.0906222,0.0021993213,0.00021896887,0.0001675751,0.004772812,0.00092563755,0.11098236],"genre_scores_gemma":[0.9389652,0.0009355314,0.032326784,0.00056162593,0.000074741474,0.00010913729,0.004222968,0.00021791049,0.022586098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967706,0.000037492748,0.00001535656,0.0000870933,0.00007487498,0.00010819913],"domain_scores_gemma":[0.9987161,0.0006013122,0.0002628878,0.00020816733,0.00008454622,0.00012695778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019540454,0.00058812,0.0006803601,0.0005159533,0.00095942145,0.0020742558,0.00069170527,0.00094210776,0.01643381],"category_scores_gemma":[0.00096453563,0.00065100635,0.0010167486,0.0008737793,0.0010599853,0.0020567207,0.0007964748,0.0014109979,0.0020264534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036212672,0.00057529437,0.012399751,0.0014993696,0.0006763617,0.003257708,0.0011604382,0.03107652,0.16968542,0.5689433,0.03729523,0.1698094],"study_design_scores_gemma":[0.0008430444,0.00067584624,0.02030988,0.00018190952,0.0006000219,0.0050273747,0.0010584871,0.033578042,0.102513626,0.75513226,0.07987309,0.00020637656],"about_ca_topic_score_codex":0.0019704856,"about_ca_topic_score_gemma":0.0026884482,"teacher_disagreement_score":0.01643381,"about_ca_system_score_codex":0.000657445,"about_ca_system_score_gemma":0.00066481344,"threshold_uncertainty_score":0.054976583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22083981,0.013724124,0.52879417,0.015342702,0.00198047,0.00037862366,0.003511587,0.0024599044,0.21296859],"genre_scores_gemma":[0.8613647,0.0047375527,0.07689197,0.0032049697,0.0027139036,0.00051269145,0.0013043418,0.0013468176,0.047923066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99491936,0.001234614,0.00013930372,0.00085416524,0.0012465849,0.001605839],"domain_scores_gemma":[0.94690514,0.042313423,0.0016011818,0.004730186,0.001559895,0.0028902006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004329485,0.00342113,0.0041880924,0.0048386245,0.0034127792,0.007742964,0.0063118218,0.0047288514,0.030983044],"category_scores_gemma":[0.03290311,0.0018108444,0.0020460405,0.00425743,0.0068181115,0.015446046,0.009605845,0.00816433,0.0032730603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014896778,0.0002954817,0.001358156,0.0008553354,0.00012045471,0.00037145024,0.0005687634,0.0283649,0.0072997953,0.90441436,0.021223258,0.033638358],"study_design_scores_gemma":[0.00013923744,0.00014027569,0.0007058609,0.00022626389,0.00014765089,0.0003900637,0.00021069466,0.109789334,0.003673526,0.87502307,0.009473786,0.00008027938],"about_ca_topic_score_codex":0.0015566347,"about_ca_topic_score_gemma":0.001808486,"teacher_disagreement_score":0.030983044,"about_ca_system_score_codex":0.0039345045,"about_ca_system_score_gemma":0.0018793939,"threshold_uncertainty_score":0.10364854},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32357532,0.0025411276,0.32723287,0.0015336914,0.0019106037,0.0003245852,0.0008743436,0.00082773174,0.3411797],"genre_scores_gemma":[0.8918874,0.0009232882,0.056946978,0.00074189674,0.0007901495,0.00022527452,0.00071461196,0.0002571004,0.04751313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931157,0.00014493694,0.000039029906,0.0001336515,0.00024573365,0.00012503298],"domain_scores_gemma":[0.99929106,0.00015296464,0.0001193662,0.00010434525,0.00020015142,0.00013209182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039283675,0.00057276955,0.0003395571,0.0012857278,0.0010238864,0.0020051836,0.00052771,0.0007552944,0.013961906],"category_scores_gemma":[0.0015726269,0.00020892192,0.0004997198,0.00074645464,0.0012255266,0.0017000791,0.0012266921,0.0013845079,0.0022047174],"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.00003307046,0.000011168505,0.0001243912,0.00004800572,0.000003563818,0.00009347494,0.00013306149,0.00076203386,0.0024160375,0.98494315,0.002309048,0.0091229435],"study_design_scores_gemma":[0.000021740898,0.000096928525,0.0004394093,0.00004500611,0.000006614961,0.00076867687,0.00015930856,0.009882486,0.0073586646,0.9387544,0.042422194,0.000044561297],"about_ca_topic_score_codex":0.00037490836,"about_ca_topic_score_gemma":0.00033218818,"teacher_disagreement_score":0.013961906,"about_ca_system_score_codex":0.0008640795,"about_ca_system_score_gemma":0.0004761016,"threshold_uncertainty_score":0.046707273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09800988,0.0005181507,0.87854916,0.00088681164,0.000099477475,0.00008081063,0.000046278354,0.00017245601,0.021636998],"genre_scores_gemma":[0.7420588,0.0003843306,0.23996007,0.0003688149,0.00006471326,0.00029576244,0.00013552269,0.00019005053,0.016541876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989943,0.00042093493,0.000037856833,0.000121579826,0.0002758732,0.00014937969],"domain_scores_gemma":[0.9956269,0.0026412194,0.00026444014,0.0004775976,0.0007369508,0.0002528926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031353931,0.00056897814,0.0008594745,0.0009655508,0.0012177449,0.0012143211,0.0010275068,0.001445457,0.0041344077],"category_scores_gemma":[0.016874459,0.00034914757,0.0010569325,0.00051966537,0.0034743985,0.0024519232,0.0020625375,0.0023119806,0.0005407721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013598047,0.0000458419,0.0012162887,0.000116518655,0.000020250784,0.000367359,0.00042188587,0.17558685,0.003386189,0.78646207,0.0020122752,0.03022857],"study_design_scores_gemma":[0.00002667367,0.000065081964,0.00023095135,0.000042286123,0.0000063289094,0.00011295867,0.00008460512,0.7227205,0.0020993066,0.2720268,0.00256629,0.000018276874],"about_ca_topic_score_codex":0.0024591577,"about_ca_topic_score_gemma":0.0017870417,"teacher_disagreement_score":0.0041344077,"about_ca_system_score_codex":0.0009697926,"about_ca_system_score_gemma":0.0011658086,"threshold_uncertainty_score":0.016581774},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27276576,0.00069351797,0.69364214,0.0007365639,0.0001015942,0.0002793709,0.0012395537,0.0006819916,0.029859459],"genre_scores_gemma":[0.7621122,0.00055415364,0.2270905,0.0002582673,0.00009529072,0.00026154105,0.0012448283,0.00021461281,0.008168538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857306,0.00027203368,0.00012363959,0.00033043238,0.00035471865,0.0003460919],"domain_scores_gemma":[0.9945358,0.0027521213,0.0006456023,0.00090857514,0.00081410527,0.0003438656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017426295,0.0008353095,0.000712093,0.0013190077,0.0009232312,0.0026783173,0.0013737967,0.0006759292,0.0016293399],"category_scores_gemma":[0.004999333,0.0004562635,0.0010649408,0.0013033523,0.0015260231,0.0035087983,0.0012205464,0.0013289985,0.0004747633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000491697,0.00028755594,0.006192212,0.0005879788,0.00008763377,0.0005097474,0.00077037053,0.10453909,0.056685384,0.72770375,0.0055650803,0.09657945],"study_design_scores_gemma":[0.00007582256,0.00038001902,0.0043199654,0.00010304611,0.00014501097,0.0019223746,0.00047831636,0.2996682,0.07568808,0.5865773,0.030532043,0.00010976549],"about_ca_topic_score_codex":0.0005797816,"about_ca_topic_score_gemma":0.00072218466,"teacher_disagreement_score":0.0026783173,"about_ca_system_score_codex":0.0018186184,"about_ca_system_score_gemma":0.0010941233,"threshold_uncertainty_score":0.013195038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6594652,0.00042842366,0.2909748,0.0004828158,0.00018603593,0.00009304179,0.0005929765,0.00047274772,0.047304098],"genre_scores_gemma":[0.9446968,0.00031644444,0.045771725,0.0001332096,0.00007399312,0.000048493584,0.00050424534,0.000150152,0.008304879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984884,0.00035448294,0.000092471884,0.00037733722,0.00027377356,0.00041346657],"domain_scores_gemma":[0.995522,0.0014959725,0.0008178984,0.00095976127,0.0007074899,0.0004967712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092027243,0.0005726609,0.0005304837,0.0012458338,0.00132687,0.0019422726,0.00067425054,0.00064435677,0.0065776524],"category_scores_gemma":[0.0035599335,0.00046494664,0.0007304512,0.0011750573,0.0025699819,0.0039370353,0.0017466705,0.0009315774,0.00068339653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028678542,0.000042219435,0.0021288255,0.0001199564,0.000022608912,0.0002451628,0.00039149544,0.018768804,0.012362155,0.93967485,0.0024150833,0.023541987],"study_design_scores_gemma":[0.00002161605,0.0000986382,0.0012594031,0.000034319262,0.000028680643,0.00037151825,0.00036716735,0.06755187,0.008660867,0.91237706,0.009178978,0.000049909904],"about_ca_topic_score_codex":0.0021502317,"about_ca_topic_score_gemma":0.0026349102,"teacher_disagreement_score":0.0065776524,"about_ca_system_score_codex":0.001116746,"about_ca_system_score_gemma":0.00064926554,"threshold_uncertainty_score":0.022004426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41069657,0.00055332907,0.47221157,0.0019244484,0.0003867537,0.00008903491,0.00042161028,0.0006368469,0.11307971],"genre_scores_gemma":[0.9417184,0.0002892539,0.023656439,0.00043797807,0.0003007205,0.000081533515,0.00021222596,0.0000940982,0.033209376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994766,0.00016820795,0.000018607854,0.00012019068,0.00012313353,0.000093317496],"domain_scores_gemma":[0.9982468,0.0007411158,0.00022672227,0.00023949133,0.0003333587,0.00021258388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047160438,0.00055750296,0.0006665082,0.0015462678,0.0013636006,0.0019957076,0.00073705515,0.00081056304,0.008077183],"category_scores_gemma":[0.0018554882,0.00036080874,0.00041640695,0.0009730092,0.0021596125,0.0020551514,0.001079631,0.0016363022,0.00075198757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029787585,0.00002480162,0.000091455724,0.000013804115,0.0000039776824,0.00003809839,0.00009375596,0.0016199873,0.0019845497,0.99338573,0.0005546179,0.0021594546],"study_design_scores_gemma":[0.000012267268,0.000017980443,0.00013273627,0.0000068746763,0.0000032855833,0.000040440835,0.00006272901,0.018692696,0.0013398029,0.9782547,0.001424924,0.000011578485],"about_ca_topic_score_codex":0.0011901447,"about_ca_topic_score_gemma":0.001129642,"teacher_disagreement_score":0.008077183,"about_ca_system_score_codex":0.0008285212,"about_ca_system_score_gemma":0.00068253244,"threshold_uncertainty_score":0.027020812},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13117874,0.0109480955,0.41443864,0.012797588,0.00087348523,0.00008493954,0.00020699661,0.00017701897,0.42929456],"genre_scores_gemma":[0.89758223,0.0067598573,0.03721306,0.0006678459,0.00051663857,0.000068961315,0.00012294821,0.000044644723,0.05702387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923646,0.0002646941,0.000027309994,0.00009898842,0.0002704791,0.000102052276],"domain_scores_gemma":[0.9990792,0.0004051788,0.00008945767,0.00025448564,0.000120419565,0.000051270934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012684405,0.00027314996,0.0002464903,0.00056759967,0.0010515742,0.0019918906,0.00037979582,0.00063877396,0.005312729],"category_scores_gemma":[0.0018668453,0.00013659318,0.00034385224,0.0011224984,0.0042462745,0.004355294,0.0015509563,0.0023012366,0.00061252574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022278343,0.0000026961786,0.000012996833,0.000005268521,4.797127e-7,0.000004325946,0.000066700304,0.00021524941,0.000097762524,0.99771583,0.00015177684,0.0017246552],"study_design_scores_gemma":[0.0000039499664,0.000012173195,0.00006387959,0.0000142145855,0.0000014265231,0.00003494876,0.00007529281,0.001505165,0.00059482566,0.9767173,0.02097116,0.000005525622],"about_ca_topic_score_codex":0.0005637578,"about_ca_topic_score_gemma":0.0004724181,"teacher_disagreement_score":0.005312729,"about_ca_system_score_codex":0.0018072228,"about_ca_system_score_gemma":0.0012865658,"threshold_uncertainty_score":0.017772913},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026729641,0.007578228,0.10262587,0.0047247824,0.002843275,0.00008243664,0.0022982094,0.0010376961,0.8520798],"genre_scores_gemma":[0.5670789,0.0055284123,0.06751919,0.0034082648,0.0016519539,0.00018314415,0.0022278463,0.00078575034,0.35161656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993451,0.00019119718,0.000022632037,0.00016281754,0.0001710644,0.00010714169],"domain_scores_gemma":[0.9993668,0.0001852413,0.000091179434,0.00018135582,0.000107767184,0.000067650966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034525798,0.0006975317,0.00062545843,0.0010968184,0.0011950681,0.0020716516,0.0006281081,0.00088011805,0.05436987],"category_scores_gemma":[0.0021699364,0.00032767394,0.00035458946,0.0014014555,0.0011109393,0.0025875363,0.0016541721,0.0016762113,0.016354205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000589865,0.000020663678,0.00019950462,0.00009370429,0.000013982171,0.000084282605,0.00007790274,0.00070639123,0.0010131439,0.9131446,0.042499498,0.042087425],"study_design_scores_gemma":[0.000017566641,0.000015383743,0.00021292167,0.00003837189,0.000009967468,0.00030871123,0.000062899395,0.0023058415,0.0015501872,0.89112663,0.10433978,0.000011763379],"about_ca_topic_score_codex":0.00067912025,"about_ca_topic_score_gemma":0.0017121092,"teacher_disagreement_score":0.05436987,"about_ca_system_score_codex":0.0008170144,"about_ca_system_score_gemma":0.00052868546,"threshold_uncertainty_score":0.1818853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43809423,0.0013879703,0.4005058,0.0071403272,0.0005174256,0.00043982416,0.0012044465,0.001600549,0.14910945],"genre_scores_gemma":[0.84883386,0.001548951,0.09292555,0.0014727185,0.0005685221,0.00035898836,0.0013546342,0.0009502657,0.051986635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979697,0.0006007722,0.000086055785,0.00047981404,0.00034123118,0.00052253966],"domain_scores_gemma":[0.9935481,0.004385974,0.0004755296,0.00082919956,0.00028477478,0.00047643067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019039996,0.0016366839,0.0020630949,0.0015260807,0.00280468,0.004608428,0.0023022243,0.0038733594,0.022911847],"category_scores_gemma":[0.008850767,0.0010882143,0.0014590473,0.0019061336,0.0042728474,0.009064258,0.003916038,0.0047235964,0.003129589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030791573,0.00015889751,0.000472906,0.00018295847,0.000028790286,0.00019001625,0.0005685142,0.018062813,0.0016166414,0.93803126,0.012621674,0.027757695],"study_design_scores_gemma":[0.00004169371,0.00002477242,0.00008785367,0.000030417696,0.000013385887,0.000052650677,0.00013191882,0.024370324,0.00063471275,0.97207797,0.0025107767,0.000023590826],"about_ca_topic_score_codex":0.0033670303,"about_ca_topic_score_gemma":0.0037161487,"teacher_disagreement_score":0.022911847,"about_ca_system_score_codex":0.0020776717,"about_ca_system_score_gemma":0.0015299094,"threshold_uncertainty_score":0.07664776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4957642,0.0013467355,0.24024929,0.0127532445,0.0010807319,0.00037076327,0.0064489096,0.0010241263,0.24096197],"genre_scores_gemma":[0.8546764,0.0012255661,0.085765675,0.006278,0.00038008095,0.00048237265,0.00937458,0.00038837027,0.04142901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847716,0.00039551398,0.000074614065,0.0005327732,0.0002776702,0.00024217876],"domain_scores_gemma":[0.9945984,0.002144072,0.00069473917,0.00097377354,0.0008483082,0.000740593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001847,0.0005799751,0.00076202146,0.0010243474,0.0023199464,0.0024978244,0.0007936285,0.0013274229,0.009683825],"category_scores_gemma":[0.0057712733,0.000534819,0.0006773456,0.001407004,0.0024025787,0.0040930095,0.0015985759,0.002154969,0.001453534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043683534,0.000109984525,0.00350509,0.0004217823,0.000108400774,0.0007470376,0.0006379683,0.0051346617,0.008348089,0.9215592,0.0296815,0.029309465],"study_design_scores_gemma":[0.00005754035,0.000072362745,0.002853363,0.00009628379,0.000060013135,0.0016824161,0.0006303912,0.016127683,0.0026260652,0.92583925,0.049911454,0.0000431415],"about_ca_topic_score_codex":0.003566567,"about_ca_topic_score_gemma":0.004165378,"teacher_disagreement_score":0.009683825,"about_ca_system_score_codex":0.001298413,"about_ca_system_score_gemma":0.0018614082,"threshold_uncertainty_score":0.0323956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017134687,0.00050120614,0.9847402,0.00040213365,0.00014950792,0.00011930966,0.00029183057,0.0019400483,0.01014226],"genre_scores_gemma":[0.05231885,0.000520723,0.938941,0.0003691873,0.00021949521,0.00029968552,0.0008780235,0.00070078886,0.005752242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971541,0.0010523802,0.00014501464,0.0005769392,0.0008851393,0.00018641817],"domain_scores_gemma":[0.99509794,0.0032012684,0.00020654152,0.0008089736,0.0005591442,0.00012608399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002096602,0.0015937816,0.0012314235,0.0029039793,0.0015335256,0.0028283778,0.0026763638,0.0012171941,0.01989082],"category_scores_gemma":[0.00892027,0.0010258494,0.0022408105,0.003590592,0.0022178106,0.004094874,0.0025706051,0.0034884585,0.0053649014],"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.0001632597,0.00014265522,0.00085587794,0.0007639124,0.00014406683,0.00022221707,0.00016692582,0.07419502,0.003423484,0.5867528,0.02954542,0.3036244],"study_design_scores_gemma":[0.00009665476,0.000059460788,0.00017387608,0.00011498656,0.000055071123,0.00025952142,0.000059374313,0.3693396,0.004943874,0.5763963,0.04845345,0.000047923153],"about_ca_topic_score_codex":0.0044232155,"about_ca_topic_score_gemma":0.009149282,"teacher_disagreement_score":0.01989082,"about_ca_system_score_codex":0.0017249665,"about_ca_system_score_gemma":0.0028171528,"threshold_uncertainty_score":0.06654143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12684718,0.00035646046,0.8640869,0.00020116771,0.00005839615,0.00010151819,0.00019826413,0.00021169776,0.007938382],"genre_scores_gemma":[0.6128196,0.00041264392,0.38031068,0.00022041512,0.000085686486,0.00050489866,0.00035702158,0.0001457704,0.005143284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710494,0.0014362136,0.00016139109,0.00049734354,0.0005223703,0.00027761696],"domain_scores_gemma":[0.9976572,0.0009820048,0.0004057563,0.0006042212,0.00022572176,0.00012506229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024977648,0.0007855596,0.00084755645,0.00090409606,0.0008206731,0.0014234409,0.00072056503,0.0009979431,0.00306082],"category_scores_gemma":[0.006095788,0.0007042798,0.00067486195,0.0009802114,0.0018824115,0.0023860445,0.0024107494,0.0009759895,0.00079289114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039279996,0.000068158486,0.0009889698,0.00015535265,0.00005820904,0.00017362589,0.00028892356,0.044616874,0.01651758,0.86495334,0.0011757901,0.07061035],"study_design_scores_gemma":[0.00014008046,0.0004980142,0.00071052817,0.00009715424,0.000052094838,0.000355589,0.00016944935,0.17862155,0.029390905,0.7783192,0.011530872,0.00011464478],"about_ca_topic_score_codex":0.00021263033,"about_ca_topic_score_gemma":0.00023739725,"teacher_disagreement_score":0.00306082,"about_ca_system_score_codex":0.00059549103,"about_ca_system_score_gemma":0.0005666842,"threshold_uncertainty_score":0.013209581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83462507,0.00019893576,0.12591486,0.00039936742,0.00011858497,0.000089226094,0.00044779337,0.00031559545,0.03789057],"genre_scores_gemma":[0.9590602,0.00010606739,0.034456395,0.00013103485,0.000023347382,0.000088279805,0.00037329667,0.00005915425,0.00570229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996649,0.00008120143,0.000012324467,0.000053614647,0.00009049927,0.000097557844],"domain_scores_gemma":[0.9991973,0.00034820952,0.00008638898,0.00014804755,0.00011993945,0.000100191945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004269679,0.00028696927,0.00025277917,0.0006195593,0.00094014226,0.00042640007,0.00048371596,0.00043090878,0.004593131],"category_scores_gemma":[0.0015236964,0.0002190384,0.00038362187,0.0004338647,0.0006055027,0.000737965,0.0006661323,0.0007022654,0.0004523542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008817721,0.00026452824,0.006589447,0.00017979695,0.0000516423,0.0007881869,0.00065395737,0.013245385,0.06623782,0.80865675,0.0055462806,0.09690447],"study_design_scores_gemma":[0.00047837556,0.0012629465,0.009008646,0.00014078412,0.00013029508,0.0026216079,0.00085292186,0.10328629,0.1560932,0.6304158,0.09550136,0.00020789508],"about_ca_topic_score_codex":0.00047235485,"about_ca_topic_score_gemma":0.0006958224,"teacher_disagreement_score":0.004593131,"about_ca_system_score_codex":0.00073439506,"about_ca_system_score_gemma":0.00039021735,"threshold_uncertainty_score":0.015365541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023045719,0.0005748446,0.96803576,0.00020057702,0.00014935002,0.000060429134,0.000111709174,0.0004648157,0.0073568136],"genre_scores_gemma":[0.26482195,0.00086512434,0.7225653,0.00029077916,0.00017996904,0.00013963504,0.00032853457,0.00010434162,0.010704399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997267,0.000058218007,0.000013742013,0.00004253873,0.00013185231,0.000026953503],"domain_scores_gemma":[0.99986625,0.000041545685,0.000016960892,0.000032176908,0.00003352698,0.000009632657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014184324,0.0006407089,0.00040394068,0.0006669924,0.0005128532,0.0005767599,0.00044331356,0.0005057807,0.0025042552],"category_scores_gemma":[0.00025515794,0.00029953208,0.00041391543,0.000900641,0.00032021065,0.000903007,0.00052616704,0.00065609044,0.0008975159],"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.00024327541,0.0001715603,0.00065869227,0.0003295634,0.000099231656,0.00030599654,0.00020667752,0.047215432,0.34688824,0.1571956,0.005516904,0.4411689],"study_design_scores_gemma":[0.00007643664,0.00032618313,0.0008286985,0.000053256794,0.00007188416,0.0012525313,0.000049713228,0.77532846,0.14955515,0.047675073,0.024650147,0.0001324267],"about_ca_topic_score_codex":0.00076539215,"about_ca_topic_score_gemma":0.0014194179,"teacher_disagreement_score":0.0025042552,"about_ca_system_score_codex":0.00035398098,"about_ca_system_score_gemma":0.0006905938,"threshold_uncertainty_score":0.008377612},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19219951,0.004859093,0.54697603,0.010347559,0.0008725397,0.00026262508,0.0038178302,0.0012545211,0.23941025],"genre_scores_gemma":[0.8073248,0.004471168,0.12428659,0.0018144143,0.0017178037,0.0007619873,0.0056673605,0.00094723655,0.053008527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975406,0.00041065295,0.00008139249,0.00057977333,0.00090175675,0.00048589145],"domain_scores_gemma":[0.98479617,0.010934348,0.0006914808,0.0015279031,0.0008535453,0.0011965533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101617,0.001950023,0.0019389783,0.0028490087,0.0016454259,0.005665141,0.0033409914,0.001992064,0.029412497],"category_scores_gemma":[0.012440429,0.0007986782,0.0019759077,0.003020536,0.0033817915,0.010340189,0.004872855,0.008315543,0.0047378438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049298105,0.0002964844,0.0024331976,0.0006153378,0.00011731704,0.0002694834,0.0004052099,0.09412631,0.004956358,0.7951101,0.040045533,0.061131656],"study_design_scores_gemma":[0.00005257093,0.00017847755,0.0019365124,0.00013594935,0.000060723407,0.00038903143,0.00015062635,0.1818386,0.0020993818,0.7962548,0.016831014,0.00007239162],"about_ca_topic_score_codex":0.0017592357,"about_ca_topic_score_gemma":0.0027147182,"teacher_disagreement_score":0.029412497,"about_ca_system_score_codex":0.0032451565,"about_ca_system_score_gemma":0.0015001628,"threshold_uncertainty_score":0.09839463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41109604,0.006214928,0.35648954,0.017300842,0.0005583037,0.00021680203,0.0010200894,0.00020434624,0.20689915],"genre_scores_gemma":[0.9742732,0.0014514611,0.004515038,0.00035617614,0.0002308684,0.00007622488,0.00011055342,0.000044446064,0.01894197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990575,0.00043202596,0.000021859065,0.000048293285,0.000248477,0.0001918273],"domain_scores_gemma":[0.99443203,0.0042612622,0.00039643285,0.00017193814,0.00044753723,0.00029083726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018299897,0.0007247867,0.0010340159,0.0018813385,0.0011302906,0.0027095736,0.0013727478,0.0018232013,0.00923252],"category_scores_gemma":[0.006484416,0.00054810115,0.00084256893,0.0018700679,0.0023793164,0.0031518165,0.0013361978,0.0017923674,0.00042636492],"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.00004671986,0.00006868449,0.0004991804,0.000051974235,0.000033516375,0.00013579195,0.000048083577,0.22082998,0.00048315225,0.77263916,0.0020204068,0.0031433413],"study_design_scores_gemma":[0.000014485221,0.000016180806,0.000580118,0.00001694177,0.000009950582,0.000055518474,0.000054464643,0.7744355,0.00008189026,0.22386456,0.0008508912,0.000019534684],"about_ca_topic_score_codex":0.0064788423,"about_ca_topic_score_gemma":0.0048733684,"teacher_disagreement_score":0.00923252,"about_ca_system_score_codex":0.00410004,"about_ca_system_score_gemma":0.0019339268,"threshold_uncertainty_score":0.030885875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7889906,0.00025912767,0.15779436,0.0003219279,0.00009610822,0.00009771401,0.00037869156,0.0003307719,0.051730633],"genre_scores_gemma":[0.96152306,0.00011947075,0.029633503,0.000107459135,0.000042699477,0.00012440016,0.00071136956,0.00009372574,0.0076441877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950075,0.00011241867,0.000025740437,0.000085374326,0.00012570953,0.00014999472],"domain_scores_gemma":[0.9993892,0.00017962276,0.00010690706,0.000100844605,0.00008002999,0.00014338049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024246852,0.00037948837,0.00043619509,0.0008340946,0.0011037897,0.0012631225,0.0005913366,0.000731934,0.00786093],"category_scores_gemma":[0.0010393774,0.00045065096,0.00048683005,0.00054140494,0.000997253,0.0016102178,0.0016936396,0.001086173,0.00076949684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022760275,0.00012420032,0.0013523184,0.000108635046,0.000026581698,0.00075426296,0.0005330573,0.02581417,0.018373046,0.9316629,0.0032392251,0.017784148],"study_design_scores_gemma":[0.00008311797,0.00017361644,0.0014879534,0.0000492609,0.000031269097,0.00054539245,0.00056234514,0.1460748,0.010989444,0.8299649,0.009989503,0.000048360285],"about_ca_topic_score_codex":0.0009310406,"about_ca_topic_score_gemma":0.0013074633,"teacher_disagreement_score":0.00786093,"about_ca_system_score_codex":0.0005639986,"about_ca_system_score_gemma":0.00043089583,"threshold_uncertainty_score":0.02629745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05591194,0.00045420628,0.88849217,0.0021269375,0.00028735847,0.00023249749,0.00077271415,0.00045504846,0.051267073],"genre_scores_gemma":[0.23958687,0.0008658928,0.7269945,0.00079775025,0.0002528054,0.0004116532,0.0016713942,0.0003802237,0.029038796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887437,0.0003032601,0.000060827584,0.00026849835,0.0003434031,0.0001495546],"domain_scores_gemma":[0.99849343,0.00081527955,0.00010399315,0.00027810244,0.00020318525,0.00010590699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008320608,0.001090176,0.0008579137,0.00075411453,0.0013623727,0.0012844433,0.0010752232,0.0019123927,0.016962323],"category_scores_gemma":[0.0039065024,0.0005946128,0.0014454989,0.00082896376,0.0013079634,0.0026397489,0.0018691177,0.002445603,0.0031506738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019842605,0.0002407948,0.0007503913,0.00079545315,0.00007775843,0.00040940483,0.00052731053,0.05913064,0.011289482,0.71403766,0.032859482,0.17968318],"study_design_scores_gemma":[0.00009721828,0.00012526006,0.00024851403,0.00009946142,0.000032991953,0.0003988356,0.00030253772,0.06012053,0.003698897,0.9022378,0.032605372,0.000032553708],"about_ca_topic_score_codex":0.000965922,"about_ca_topic_score_gemma":0.0013260323,"teacher_disagreement_score":0.016962323,"about_ca_system_score_codex":0.0007832182,"about_ca_system_score_gemma":0.001698585,"threshold_uncertainty_score":0.056744635},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2060324,0.00044746656,0.7852599,0.00022206469,0.00009788497,0.00010711366,0.00013929041,0.00033325053,0.0073605753],"genre_scores_gemma":[0.6241437,0.0002136892,0.373377,0.00007098326,0.000025436366,0.000117701406,0.00016691786,0.000027311264,0.0018571729],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994572,0.0001549113,0.000030390225,0.000061384504,0.0002439969,0.000052089643],"domain_scores_gemma":[0.9990439,0.00026672787,0.0001940644,0.0001339828,0.00030943545,0.000051969284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000454976,0.00033875668,0.00025478503,0.00064846745,0.00041517563,0.0004473182,0.00041838188,0.00037380008,0.0008935759],"category_scores_gemma":[0.0010900487,0.00019693944,0.00021341047,0.00053166726,0.00044884838,0.00048036408,0.0005306008,0.00040723308,0.00025825427],"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.00046627264,0.0002095933,0.0038662348,0.00046202634,0.000062955754,0.00028471812,0.00045495183,0.17733227,0.3935424,0.18589438,0.0017169671,0.23570728],"study_design_scores_gemma":[0.00005183173,0.00048997236,0.0010220738,0.000043047658,0.000020094574,0.0004302974,0.00005695507,0.82960564,0.14690726,0.012470017,0.00884024,0.0000625362],"about_ca_topic_score_codex":0.00073691644,"about_ca_topic_score_gemma":0.0011765996,"teacher_disagreement_score":0.0008935759,"about_ca_system_score_codex":0.0005932692,"about_ca_system_score_gemma":0.0007945532,"threshold_uncertainty_score":0.0043045282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5885864,0.0009822166,0.27075234,0.0015751935,0.0005742018,0.00020278755,0.0006470082,0.00046380432,0.13621603],"genre_scores_gemma":[0.78124654,0.0008030964,0.15992332,0.0008117261,0.00021676056,0.00031199708,0.0006238201,0.000231171,0.05583173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934846,0.00026477783,0.00004172249,0.00009809747,0.00015362956,0.000093289615],"domain_scores_gemma":[0.9990735,0.00037107087,0.00016208614,0.00011834004,0.00015103753,0.00012390084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007648585,0.0008271923,0.000548979,0.0013873932,0.0014641546,0.0015917463,0.00056495355,0.00149398,0.009345974],"category_scores_gemma":[0.0019268355,0.0005347145,0.0008473618,0.0013105839,0.0011228818,0.0012776795,0.001032264,0.0012694612,0.0011805986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021835572,0.00003941211,0.00057849707,0.00012147254,0.000028466748,0.00030946382,0.0003134825,0.0047371024,0.006759621,0.9645455,0.0034903048,0.018858401],"study_design_scores_gemma":[0.00014043652,0.00021271777,0.000860479,0.00006827959,0.000048993486,0.0007874962,0.00027332967,0.031172017,0.0048751733,0.9432367,0.01827236,0.000051883973],"about_ca_topic_score_codex":0.00031243585,"about_ca_topic_score_gemma":0.0006769932,"teacher_disagreement_score":0.009345974,"about_ca_system_score_codex":0.00082990865,"about_ca_system_score_gemma":0.00068243325,"threshold_uncertainty_score":0.031265438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27737218,0.00041758196,0.67859524,0.0002308284,0.000063338215,0.0001847581,0.00019890162,0.00030084804,0.04263626],"genre_scores_gemma":[0.7564733,0.0006320769,0.23117773,0.0001777918,0.00009167862,0.00030734407,0.000366095,0.000113562885,0.010660369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997556,0.00076300104,0.00016816819,0.00036534635,0.0007462891,0.00040120227],"domain_scores_gemma":[0.9943197,0.003280161,0.00063447404,0.0010662522,0.00049567915,0.00020369489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015958338,0.0005096967,0.00062008563,0.0014404998,0.0011765475,0.0017334422,0.0009723948,0.0010471646,0.004672836],"category_scores_gemma":[0.006650821,0.0005396992,0.00072574645,0.0012566982,0.0031665193,0.0026901055,0.0014100181,0.001760992,0.0013262117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001064979,0.00006090179,0.00075024774,0.000094450224,0.000011334205,0.00036499443,0.00025332952,0.009774061,0.012547863,0.94241863,0.0006193128,0.032998376],"study_design_scores_gemma":[0.00008514962,0.00044007396,0.00087296375,0.00010945478,0.000026489419,0.0012567939,0.0002792649,0.04982552,0.039266124,0.8936678,0.014067916,0.000102450904],"about_ca_topic_score_codex":0.00033674453,"about_ca_topic_score_gemma":0.00038509633,"teacher_disagreement_score":0.004672836,"about_ca_system_score_codex":0.00062132475,"about_ca_system_score_gemma":0.00059970503,"threshold_uncertainty_score":0.015632153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68227786,0.00066353043,0.26762578,0.0004892301,0.00007211851,0.00007833132,0.0006793867,0.0004213925,0.047692455],"genre_scores_gemma":[0.96095216,0.00036271705,0.030286983,0.00017659111,0.000040546176,0.000072751915,0.00039069427,0.000053817246,0.007663698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995596,0.000107868495,0.000023889608,0.00011081368,0.000087153356,0.00011076434],"domain_scores_gemma":[0.998448,0.0007149668,0.0002423778,0.00018334831,0.00021697224,0.00019428892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026857655,0.00027610734,0.00028956807,0.000852066,0.0006158101,0.0010860282,0.00025202087,0.000495888,0.005663833],"category_scores_gemma":[0.0020318253,0.00036470042,0.00025171542,0.0007515853,0.0010238102,0.0020959359,0.0009833233,0.0004981532,0.0004323128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018281516,0.000036766287,0.0034981994,0.0001338617,0.00002634586,0.00050668884,0.00067293044,0.025504384,0.011690723,0.91350734,0.0029018146,0.041338086],"study_design_scores_gemma":[0.000030674964,0.000094754265,0.0029491077,0.000102677004,0.000026200782,0.00088154443,0.00056722015,0.08182913,0.008466206,0.8725029,0.03251094,0.0000385135],"about_ca_topic_score_codex":0.0010284607,"about_ca_topic_score_gemma":0.0013425141,"teacher_disagreement_score":0.005663833,"about_ca_system_score_codex":0.0006947205,"about_ca_system_score_gemma":0.00037732537,"threshold_uncertainty_score":0.018947423},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21259226,0.0007595981,0.7450842,0.000874237,0.00012852822,0.00010813164,0.00039450297,0.00030516734,0.039753344],"genre_scores_gemma":[0.9310396,0.00080211984,0.055507597,0.0003277518,0.00022093602,0.00015074837,0.0003177261,0.00011271466,0.011520707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835795,0.0004443364,0.000074071184,0.0003230089,0.00043569558,0.00036492647],"domain_scores_gemma":[0.9946344,0.0026931937,0.0009514487,0.0004128475,0.00086426653,0.00044388525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015778817,0.0008171316,0.00080961664,0.0013372641,0.00088861445,0.0016579484,0.0004915201,0.0010765202,0.0058283363],"category_scores_gemma":[0.009840416,0.000545568,0.0005286721,0.0010357483,0.0022950112,0.0028546657,0.0010756232,0.0012099681,0.001584105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013258212,0.000035458368,0.0008842555,0.00012786902,0.000027865748,0.00049915386,0.00019291375,0.018809257,0.012802045,0.9494042,0.0023451822,0.014739252],"study_design_scores_gemma":[0.00007017371,0.00017775032,0.001488249,0.00006500228,0.000022644132,0.001148002,0.0001572912,0.15674041,0.009593906,0.8243306,0.0060949815,0.00011093616],"about_ca_topic_score_codex":0.0011813118,"about_ca_topic_score_gemma":0.0010790542,"teacher_disagreement_score":0.0058283363,"about_ca_system_score_codex":0.00056475867,"about_ca_system_score_gemma":0.0013293169,"threshold_uncertainty_score":0.019497752},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4362875,0.0018153593,0.47246528,0.0009794927,0.00018096698,0.00043831283,0.0024710908,0.00050458254,0.08485735],"genre_scores_gemma":[0.8344551,0.0013139906,0.1323953,0.00041556003,0.000114837276,0.00037752395,0.0039536147,0.00015007073,0.02682411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995365,0.00007406038,0.00003224197,0.00011350191,0.00010850133,0.00013512433],"domain_scores_gemma":[0.99915135,0.0002801836,0.00010095992,0.00010602044,0.0001446311,0.00021682192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036481066,0.00050952815,0.00046812434,0.0016935421,0.00086137245,0.0013071601,0.00053965655,0.0005161768,0.007176793],"category_scores_gemma":[0.0017330296,0.00048585373,0.00065945025,0.0012100011,0.00077648344,0.001699397,0.0011516634,0.0010057421,0.0007267773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012972622,0.000077643526,0.0011549009,0.00033717515,0.000054370572,0.00042428065,0.00053003454,0.026249995,0.0071471394,0.9037198,0.005275919,0.05489897],"study_design_scores_gemma":[0.00005464208,0.00004788884,0.00068994705,0.00010047035,0.000035274632,0.00026601195,0.0003119804,0.05368941,0.0033134324,0.91719896,0.024268396,0.000023661567],"about_ca_topic_score_codex":0.0016206121,"about_ca_topic_score_gemma":0.0030054387,"teacher_disagreement_score":0.007176793,"about_ca_system_score_codex":0.0011051976,"about_ca_system_score_gemma":0.0006982334,"threshold_uncertainty_score":0.02400875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8231417,0.00019517653,0.15324865,0.00017437093,0.000029040848,0.0000963586,0.0002955403,0.00021967044,0.022599572],"genre_scores_gemma":[0.96641827,0.00010804166,0.026886545,0.000059649316,0.000013659745,0.000101397265,0.0003218633,0.000049771996,0.006040704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990821,0.0001546852,0.000061363855,0.00022306236,0.00018821948,0.0002906162],"domain_scores_gemma":[0.99826115,0.0005455164,0.0003236899,0.0003440824,0.00025324512,0.00027229413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004858169,0.0003262659,0.00040555195,0.0009555334,0.0011169566,0.0012796565,0.000680401,0.00047643684,0.004690269],"category_scores_gemma":[0.002362264,0.00043994046,0.00039992522,0.00058282254,0.001115732,0.0015875879,0.0018596682,0.00083016726,0.0004358601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066453975,0.00015975091,0.0060614776,0.00024341895,0.00005143083,0.00043824402,0.0016073516,0.042374633,0.078448296,0.8151479,0.0018432118,0.052959714],"study_design_scores_gemma":[0.0001550301,0.00034221468,0.0042838445,0.00008081606,0.000058967496,0.0007646281,0.00086972996,0.14287743,0.06368797,0.7680625,0.018732663,0.00008420395],"about_ca_topic_score_codex":0.0008642178,"about_ca_topic_score_gemma":0.001461929,"teacher_disagreement_score":0.004690269,"about_ca_system_score_codex":0.0008065911,"about_ca_system_score_gemma":0.000587557,"threshold_uncertainty_score":0.015690506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21110962,0.0014395221,0.7118264,0.0008255561,0.00029464057,0.0001602075,0.0005307406,0.00075976405,0.07305349],"genre_scores_gemma":[0.7951029,0.0016777843,0.14569958,0.0006776751,0.00029619594,0.00033805807,0.00075156405,0.00028853494,0.055167735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999438,0.00013228788,0.000022912764,0.00014150603,0.00016465045,0.00010062078],"domain_scores_gemma":[0.9988393,0.0003961838,0.0001820103,0.00017413503,0.00025015874,0.00015821491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004978044,0.00088274054,0.00057702325,0.0015273278,0.0010572225,0.0015852246,0.0009266104,0.00092677464,0.0075798663],"category_scores_gemma":[0.0028236853,0.0004312881,0.00047517396,0.0016192355,0.00076313113,0.0015268553,0.00095621054,0.0010031406,0.0013354938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008183638,0.000040333343,0.000519318,0.000074966476,0.00003176694,0.00020048414,0.00012668638,0.0065210974,0.011737611,0.9311172,0.004131168,0.045417633],"study_design_scores_gemma":[0.000051985597,0.00007346794,0.00065802684,0.000046961042,0.000026336627,0.00064702024,0.00007919527,0.070882946,0.0041215,0.9011394,0.02223026,0.000042957563],"about_ca_topic_score_codex":0.0008700329,"about_ca_topic_score_gemma":0.0010005002,"teacher_disagreement_score":0.0075798663,"about_ca_system_score_codex":0.0006987373,"about_ca_system_score_gemma":0.00056341157,"threshold_uncertainty_score":0.025357187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66509223,0.00090862805,0.24040698,0.0005932567,0.00046630402,0.00027808963,0.00049661164,0.0008416726,0.09091628],"genre_scores_gemma":[0.8576235,0.0003246975,0.12718914,0.00026266085,0.000104386636,0.0002162304,0.0006389696,0.00023312663,0.013407217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.00012317128,0.000044796965,0.000118872056,0.00021523758,0.00012860676],"domain_scores_gemma":[0.998629,0.0004283121,0.00025977567,0.0002941651,0.00020114992,0.00018763723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047127993,0.0005796214,0.00036521084,0.00072461826,0.001008284,0.0010417342,0.0004993934,0.0008474761,0.008536675],"category_scores_gemma":[0.0022145188,0.0003408283,0.00077719084,0.0004527399,0.0014155364,0.0013769809,0.0013510153,0.0014875642,0.0013036043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000413284,0.00014504409,0.0034242654,0.00026700803,0.000021829283,0.00068798405,0.0005869638,0.0060715773,0.03974345,0.8853256,0.0036409767,0.059672054],"study_design_scores_gemma":[0.00012556794,0.0012914964,0.0039178776,0.0002267371,0.00006983478,0.0032332137,0.0005605427,0.033353515,0.1338749,0.7364729,0.08665719,0.0002162538],"about_ca_topic_score_codex":0.00018397937,"about_ca_topic_score_gemma":0.0002856339,"teacher_disagreement_score":0.008536675,"about_ca_system_score_codex":0.0007298632,"about_ca_system_score_gemma":0.0006132904,"threshold_uncertainty_score":0.028558016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20473197,0.0008413485,0.64287436,0.0016446855,0.0007299507,0.00059851905,0.001959792,0.001125694,0.1454936],"genre_scores_gemma":[0.7030109,0.0004396083,0.26498467,0.00037358204,0.000066417946,0.00036104623,0.0008617605,0.00008857901,0.029813448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934834,0.0002649311,0.00003301874,0.00012317773,0.00013274624,0.0000978731],"domain_scores_gemma":[0.9988727,0.00040712333,0.00012672509,0.0002403256,0.0002430034,0.00011006244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006025436,0.00047003783,0.00026532414,0.0006609654,0.0009986131,0.0009557965,0.0006935998,0.0008668639,0.018040052],"category_scores_gemma":[0.0021436887,0.00023411035,0.00039247217,0.0006101595,0.0006299681,0.00091744587,0.00068734883,0.0006008135,0.0023429953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009042842,0.00025096364,0.0012339771,0.0005457806,0.00010557035,0.0005627064,0.0003013763,0.03514542,0.031948607,0.793246,0.017376628,0.1183787],"study_design_scores_gemma":[0.00047164524,0.0007820484,0.0018798307,0.00023542959,0.00017029636,0.0010646594,0.00051146414,0.10998521,0.035661943,0.7265418,0.1225697,0.00012611964],"about_ca_topic_score_codex":0.00075385266,"about_ca_topic_score_gemma":0.0020355987,"teacher_disagreement_score":0.018040052,"about_ca_system_score_codex":0.0008417082,"about_ca_system_score_gemma":0.00071205606,"threshold_uncertainty_score":0.06035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20001382,0.0015098585,0.69524413,0.006011757,0.0007747709,0.0001342519,0.00084101787,0.00050618756,0.094964236],"genre_scores_gemma":[0.8365103,0.002703585,0.09172624,0.0023516116,0.0013054832,0.00040847855,0.0010941778,0.00049098406,0.063409105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988514,0.00028897534,0.00006611416,0.00032102416,0.0002582879,0.00021420867],"domain_scores_gemma":[0.9946302,0.003027784,0.0005175733,0.0005031431,0.0006666628,0.00065457914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017510919,0.0010301763,0.0013478923,0.003222371,0.0031665494,0.004181136,0.0021144073,0.0019837494,0.012564559],"category_scores_gemma":[0.0077822516,0.0011815414,0.002058909,0.0027055137,0.0048382757,0.014021269,0.0064665982,0.0073601585,0.0012337515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041217314,0.00001309121,0.00017020825,0.000042608874,0.000011807247,0.000038181457,0.00026129442,0.00060803257,0.00040974113,0.99386674,0.0015491839,0.002987939],"study_design_scores_gemma":[0.000023101324,0.000022154842,0.00018599852,0.000014110355,0.000017117518,0.00007851143,0.00013998018,0.0028949343,0.00035226037,0.9927901,0.0034676949,0.000014053361],"about_ca_topic_score_codex":0.0014002476,"about_ca_topic_score_gemma":0.0009678823,"teacher_disagreement_score":0.012564559,"about_ca_system_score_codex":0.0018767723,"about_ca_system_score_gemma":0.0006676074,"threshold_uncertainty_score":0.04203266},"labels":[],"label_agreement":null},{"id":"W3152641317","doi":"10.1002/jcd.21777","title":"Maximal partial Room squares","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Square (algebra); Order (exchange); Partial least squares regression; Combinatorics; Spectrum (functional analysis); Statistics; Geometry; Physics; Quantum mechanics","score_opus":0.01700286428564882,"score_gpt":0.22267349823552923,"score_spread":0.20567063394988042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152641317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83864844,0.00035451405,0.12800097,0.00009705657,0.00003309393,0.00003513661,0.0005673588,0.00039893884,0.031864464],"genre_scores_gemma":[0.9832919,0.000059921633,0.014395422,0.00002313558,0.000014809299,0.000025020394,0.00027929214,0.00005866544,0.0018518432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911195,0.0001900842,0.000048641392,0.00018811438,0.00026217813,0.00019909733],"domain_scores_gemma":[0.9981134,0.00086080574,0.0002216304,0.00028404384,0.0002743682,0.0002457709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040945603,0.00039550412,0.0005282497,0.00079013885,0.00052384136,0.0012589499,0.00061915285,0.00031398443,0.0060000056],"category_scores_gemma":[0.0024023468,0.00037030398,0.00036940732,0.0005114205,0.0013869143,0.0013187602,0.001269188,0.00043077365,0.0005585185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013636918,0.000095838004,0.007321657,0.00040792357,0.00010612347,0.00064780883,0.000527733,0.096062526,0.13519512,0.68123114,0.0037425493,0.07329785],"study_design_scores_gemma":[0.00011639352,0.00069197157,0.00790418,0.00009884343,0.00006256395,0.0021852746,0.001003968,0.18534535,0.109737605,0.6739304,0.018815365,0.0001080601],"about_ca_topic_score_codex":0.00029629222,"about_ca_topic_score_gemma":0.00040616092,"teacher_disagreement_score":0.0060000056,"about_ca_system_score_codex":0.00029096255,"about_ca_system_score_gemma":0.00025115375,"threshold_uncertainty_score":0.020072043},"labels":[],"label_agreement":null},{"id":"W3157423422","doi":"10.1002/jcd.21943","title":"On products of strong Skolem starters","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Skew; Combinatorics; Computer science","score_opus":0.015417561569669551,"score_gpt":0.22459304399427418,"score_spread":0.20917548242460463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157423422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6648444,0.0002890415,0.28102073,0.00018219854,0.000106877866,0.00008443349,0.00017407518,0.0003459633,0.052952338],"genre_scores_gemma":[0.9396952,0.00012181868,0.04422445,0.00009180994,0.000057111276,0.00006859944,0.00023122612,0.00009789003,0.01541199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999493,0.00012489823,0.000027187678,0.00009695845,0.00016826334,0.000089684574],"domain_scores_gemma":[0.9985531,0.0005659276,0.00020032203,0.00023147785,0.0002656112,0.00018353557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756445,0.00033305548,0.00029538854,0.0008803257,0.0007866881,0.000941172,0.00029522832,0.00039882396,0.0061415895],"category_scores_gemma":[0.0016140867,0.00029296614,0.00049258105,0.00036713708,0.0011908993,0.0012017585,0.001130395,0.00080611283,0.0010221049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015681401,0.000047215766,0.001310149,0.000060819082,0.000012321879,0.00041559525,0.0003412325,0.0038515518,0.013431152,0.96818966,0.00093791605,0.011245632],"study_design_scores_gemma":[0.000058093672,0.00042720692,0.0011655737,0.00008057359,0.000035094312,0.0009643502,0.00035103128,0.03221064,0.027831912,0.9124432,0.024382459,0.000049778042],"about_ca_topic_score_codex":0.00013463154,"about_ca_topic_score_gemma":0.0003223145,"teacher_disagreement_score":0.0061415895,"about_ca_system_score_codex":0.00036688324,"about_ca_system_score_gemma":0.00027464028,"threshold_uncertainty_score":0.020545721},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5116599,0.0012784484,0.33193994,0.0012518362,0.0003422495,0.00008283448,0.0005952673,0.001483766,0.15136579],"genre_scores_gemma":[0.94716024,0.0003522061,0.036169626,0.0003584776,0.00028273903,0.0000543052,0.0005002684,0.00020607792,0.014916091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884254,0.00019741333,0.000058000067,0.0002661741,0.00034095036,0.0002950125],"domain_scores_gemma":[0.9965012,0.0013218634,0.00045524872,0.00051252206,0.00041755458,0.0007916893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007765316,0.00078806235,0.0012351813,0.002543411,0.003064394,0.0051679984,0.0015497553,0.0014347975,0.0069965166],"category_scores_gemma":[0.003897671,0.00083109766,0.00083149574,0.0022781335,0.0035070344,0.0039822967,0.0028165383,0.0024646877,0.00083796703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086508284,0.000037526726,0.0009282769,0.00004927181,0.000013081067,0.0002616785,0.00025920392,0.0020509171,0.0018848175,0.9871243,0.0022017767,0.0051025026],"study_design_scores_gemma":[0.00003442513,0.000059860744,0.0011207161,0.000036620484,0.000022410519,0.0014226115,0.00023135725,0.022905516,0.0020689617,0.96260655,0.009445462,0.00004545253],"about_ca_topic_score_codex":0.00055198936,"about_ca_topic_score_gemma":0.00048337656,"teacher_disagreement_score":0.0069965166,"about_ca_system_score_codex":0.00097408105,"about_ca_system_score_gemma":0.0006108616,"threshold_uncertainty_score":0.023405671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87740034,0.00027841126,0.0609669,0.00064358546,0.00022321913,0.00017925474,0.0007409347,0.00057464093,0.058992777],"genre_scores_gemma":[0.936621,0.00019449682,0.04473037,0.00025523492,0.00006324217,0.00017426969,0.0007367574,0.000121548284,0.01710319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998781,0.0005116472,0.000115510644,0.00014362253,0.00021174499,0.00023655992],"domain_scores_gemma":[0.9987066,0.0004093786,0.0002647279,0.00030496885,0.00015882243,0.00015543269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009023435,0.00089986983,0.00075519434,0.0011681308,0.0017185254,0.0022730173,0.0004676168,0.0015024508,0.010321769],"category_scores_gemma":[0.0017114931,0.0007184476,0.000935445,0.0012171413,0.0011329494,0.0013646908,0.001191294,0.00079708797,0.0018458809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021313224,0.00023407125,0.004517415,0.00034909177,0.00014137395,0.0016475011,0.0011534046,0.016144257,0.04268546,0.87164456,0.008803329,0.05054821],"study_design_scores_gemma":[0.00075872155,0.0011902179,0.004075517,0.0001379445,0.00018198988,0.0020238548,0.0009649868,0.033733744,0.033592425,0.8828281,0.04038164,0.00013083784],"about_ca_topic_score_codex":0.00032319792,"about_ca_topic_score_gemma":0.00081913866,"teacher_disagreement_score":0.010321769,"about_ca_system_score_codex":0.0006754037,"about_ca_system_score_gemma":0.0008733282,"threshold_uncertainty_score":0.034529746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38751665,0.004183306,0.3755019,0.004927087,0.000654239,0.00024305978,0.0012853375,0.0013916539,0.22429675],"genre_scores_gemma":[0.87760884,0.0013300735,0.08441731,0.0010266961,0.00048815197,0.00032874924,0.00086479436,0.00045782907,0.033477586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972824,0.0005765648,0.00011602485,0.00064477953,0.00060602924,0.00077411666],"domain_scores_gemma":[0.98614746,0.008630462,0.00069460395,0.0028750983,0.00064309785,0.0010093179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002575025,0.0010091494,0.0012375725,0.0013934007,0.0021160587,0.0027826247,0.0025175307,0.0016973233,0.01758708],"category_scores_gemma":[0.012557201,0.00079475803,0.0009858852,0.0010098323,0.0040847748,0.008785057,0.004892593,0.0034913055,0.0021328218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005714468,0.00011486881,0.0024745772,0.0005111081,0.00004126776,0.00024923435,0.0004797287,0.014388975,0.014404282,0.91977227,0.011248438,0.03574377],"study_design_scores_gemma":[0.00010484973,0.00029945702,0.0021299087,0.00019100955,0.00007893329,0.0010334025,0.00033232474,0.089758255,0.027694391,0.8439179,0.034364447,0.000095092204],"about_ca_topic_score_codex":0.00086053694,"about_ca_topic_score_gemma":0.0013802417,"teacher_disagreement_score":0.01758708,"about_ca_system_score_codex":0.0017700496,"about_ca_system_score_gemma":0.00087989,"threshold_uncertainty_score":0.058834672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3764983,0.0049988343,0.24712354,0.0026515059,0.0009097292,0.00027723657,0.0014950986,0.00069481775,0.36535105],"genre_scores_gemma":[0.91321546,0.0018809228,0.031786326,0.0004744881,0.00017195067,0.00014422766,0.00093414116,0.0000878192,0.051304698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960977,0.00007824654,0.000024553787,0.00007628904,0.0001082096,0.00010294381],"domain_scores_gemma":[0.999393,0.0001486208,0.000068130896,0.00009340059,0.00017632249,0.00012056852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023717374,0.00027274477,0.0003241953,0.0011698401,0.0009313298,0.0013403817,0.00070439995,0.00077711866,0.02274373],"category_scores_gemma":[0.0010662758,0.00016165983,0.0003621558,0.0010051328,0.0008318567,0.0015798105,0.0012655178,0.00090855465,0.002174032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003669941,0.000021695936,0.0004036156,0.00011464876,0.000012372492,0.00012714569,0.00014855595,0.0059078718,0.002169338,0.9700504,0.0034771583,0.017530415],"study_design_scores_gemma":[0.0000183331,0.000032017462,0.0003647363,0.00004851197,0.000008948883,0.0001840028,0.00014668053,0.020463543,0.001771433,0.9346917,0.04224859,0.000021533895],"about_ca_topic_score_codex":0.0013209211,"about_ca_topic_score_gemma":0.0012848679,"teacher_disagreement_score":0.02274373,"about_ca_system_score_codex":0.0007789659,"about_ca_system_score_gemma":0.00051017693,"threshold_uncertainty_score":0.07608539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6363971,0.0006499085,0.3398155,0.00035857724,0.00006792861,0.000048957296,0.0003106049,0.0006331477,0.021718306],"genre_scores_gemma":[0.9386462,0.00029203275,0.054979526,0.00012427427,0.000042931988,0.000069833455,0.00027971718,0.00015705322,0.0054083876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999759,0.000053521453,0.000016683476,0.000057317546,0.00005823894,0.00005523262],"domain_scores_gemma":[0.9986625,0.0007786618,0.00013556921,0.00015768337,0.00012538939,0.00014023687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039464032,0.00035236304,0.00045377103,0.001267227,0.0005934929,0.0011865976,0.0005781146,0.0007179713,0.0032465467],"category_scores_gemma":[0.0032444056,0.00022912516,0.0002907091,0.00059243775,0.0011450081,0.0017511601,0.000811141,0.0006483952,0.00058355735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003382601,0.00007191874,0.004063254,0.00027669364,0.000020399259,0.0007423347,0.0006839044,0.06767161,0.04110582,0.8250899,0.00290587,0.057030093],"study_design_scores_gemma":[0.000023734614,0.00012227971,0.0017685888,0.000040839263,0.000012150175,0.0005472329,0.00033759954,0.2724866,0.0210358,0.6981803,0.0054088044,0.00003603822],"about_ca_topic_score_codex":0.00038546012,"about_ca_topic_score_gemma":0.00037940516,"teacher_disagreement_score":0.0032465467,"about_ca_system_score_codex":0.0005571122,"about_ca_system_score_gemma":0.0001785445,"threshold_uncertainty_score":0.010860801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33391705,0.0008639868,0.47677797,0.0026186376,0.0008308416,0.000110257206,0.0003549848,0.00049915386,0.18402715],"genre_scores_gemma":[0.78669864,0.0006087016,0.18576884,0.000915902,0.00026363652,0.00024211737,0.00043047563,0.00024459622,0.024827002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.0002699956,0.000042703898,0.00014740624,0.0002442065,0.00010693793],"domain_scores_gemma":[0.99815387,0.000865975,0.00021781294,0.00030616176,0.000294831,0.00016123238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072473875,0.0005133577,0.000494262,0.00078425335,0.0014118878,0.0019442497,0.0008733344,0.0010538353,0.009250987],"category_scores_gemma":[0.004481076,0.00046210227,0.00058817555,0.0008084791,0.0019602224,0.0036598588,0.0019382288,0.0022287883,0.0011949776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004643464,0.000008983232,0.00012136539,0.00002803778,0.0000046142163,0.000061973784,0.000047461377,0.0015553685,0.0012812814,0.990551,0.0014534551,0.0048399116],"study_design_scores_gemma":[0.00003413824,0.000040894694,0.00010487047,0.000032323933,0.000012857622,0.0002637947,0.00008888129,0.023311447,0.0047132145,0.9605193,0.010860913,0.000017354936],"about_ca_topic_score_codex":0.00041344124,"about_ca_topic_score_gemma":0.0007360679,"teacher_disagreement_score":0.009250987,"about_ca_system_score_codex":0.00061346666,"about_ca_system_score_gemma":0.00047643163,"threshold_uncertainty_score":0.030947685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12242404,0.0018307574,0.76536655,0.0029934843,0.00023078849,0.0002029684,0.0003890734,0.00038487552,0.10617748],"genre_scores_gemma":[0.72190285,0.003794609,0.25330195,0.0006051858,0.00041780825,0.00025155273,0.00053873844,0.00020615383,0.018981138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996044,0.00013356004,0.000015471773,0.000061435116,0.00012780122,0.00005739149],"domain_scores_gemma":[0.99892706,0.0006651128,0.000112146365,0.00011547499,0.00011695267,0.00006325492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039880114,0.000344952,0.0003030612,0.00077652757,0.00065770757,0.0011841987,0.00068427145,0.0006277981,0.0051632025],"category_scores_gemma":[0.003184328,0.0002781927,0.0004980089,0.0011076127,0.0009839002,0.0017961868,0.00081551366,0.001004939,0.0005673541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031542244,0.00004924436,0.00054606906,0.00008872586,0.000008693697,0.0002231223,0.00026906093,0.042350993,0.0014778536,0.90843815,0.003483131,0.043033395],"study_design_scores_gemma":[0.000021974281,0.000039604245,0.00027745886,0.000028534112,0.000009686417,0.00029493484,0.00015847803,0.16426127,0.000941968,0.81778795,0.016162384,0.00001582271],"about_ca_topic_score_codex":0.0026901017,"about_ca_topic_score_gemma":0.0017229067,"teacher_disagreement_score":0.0051632025,"about_ca_system_score_codex":0.00091448514,"about_ca_system_score_gemma":0.0009625945,"threshold_uncertainty_score":0.017272592},"labels":[],"label_agreement":null},{"id":"W3186141999","doi":"10.1002/jcd.21798","title":"On strongly regular designs admitting fusion to strongly regular decomposition","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Strongly regular graph; Combinatorics; Regular graph; Vertex (graph theory); Graph; Two-graph; Homogeneous; Partition (number theory); Equivalence (formal languages); Discrete mathematics; Line graph; Graph power","score_opus":0.016395991287428757,"score_gpt":0.24739433640207986,"score_spread":0.23099834511465112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186141999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6135472,0.00031820964,0.3547459,0.00021243241,0.00004515392,0.00015820545,0.00031390114,0.0004032639,0.030255742],"genre_scores_gemma":[0.9494036,0.0001270155,0.048180237,0.00005448748,0.000019042052,0.000121848614,0.00019172825,0.000060069957,0.0018420478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647695,0.0011561102,0.0003047111,0.00072827114,0.0008626777,0.00047132422],"domain_scores_gemma":[0.9947778,0.002164646,0.00081547804,0.0011878434,0.00058632996,0.00046784544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032219759,0.0005602756,0.00078315474,0.0011803551,0.0009510852,0.0017263243,0.0006366628,0.001234859,0.0054247463],"category_scores_gemma":[0.007750723,0.0007020821,0.0011183774,0.00083397503,0.0029215005,0.0026319143,0.0023760465,0.0012848919,0.0007444495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003286353,0.000082368766,0.0018681241,0.00011538528,0.00003006668,0.0003581003,0.00043883297,0.0174401,0.024532657,0.9384409,0.00058405387,0.015780777],"study_design_scores_gemma":[0.000109571214,0.00066108326,0.0016594401,0.000115727504,0.000051257623,0.0011283058,0.0006657575,0.06618396,0.03428378,0.8850176,0.010035115,0.000088378845],"about_ca_topic_score_codex":0.00021985966,"about_ca_topic_score_gemma":0.00025735906,"teacher_disagreement_score":0.0054247463,"about_ca_system_score_codex":0.00088666915,"about_ca_system_score_gemma":0.00044250014,"threshold_uncertainty_score":0.018147528},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97906864,0.00016581155,0.008558726,0.00011270352,0.000018848878,0.000020461475,0.000116375304,0.000051943414,0.011886525],"genre_scores_gemma":[0.99085605,0.00024523097,0.0032093949,0.000052183714,0.000026419182,0.000038513066,0.00026545924,0.00004260809,0.00526413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938107,0.00010385616,0.000029507346,0.00009018344,0.00012733486,0.00026801578],"domain_scores_gemma":[0.9982102,0.0007706139,0.0003195573,0.00014156204,0.00010275596,0.00045535824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039989472,0.0005774609,0.0008657013,0.0015457482,0.0016833537,0.0034138788,0.0006167261,0.0009006024,0.0047224285],"category_scores_gemma":[0.002014045,0.000806003,0.000586341,0.0010581737,0.0014047775,0.0024125653,0.0029062638,0.0008011574,0.00051783957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002074234,0.0002756261,0.019661311,0.00024880472,0.00013973234,0.0023652986,0.0030365924,0.023820372,0.03347332,0.87849176,0.005533939,0.03087899],"study_design_scores_gemma":[0.00043192433,0.0004730646,0.021977162,0.0002307749,0.000325437,0.0033417102,0.0054011457,0.13770004,0.033870798,0.77035284,0.025758505,0.00013658442],"about_ca_topic_score_codex":0.0011723097,"about_ca_topic_score_gemma":0.0015345023,"teacher_disagreement_score":0.0047224285,"about_ca_system_score_codex":0.00083620584,"about_ca_system_score_gemma":0.00041623253,"threshold_uncertainty_score":0.015798032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38869652,0.001294407,0.43211514,0.0034207264,0.00033064335,0.000086220374,0.0006833817,0.00035580678,0.1730172],"genre_scores_gemma":[0.9375671,0.00093403104,0.030695558,0.0004680415,0.00050845655,0.00009659466,0.00053183694,0.00021712047,0.028981205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989766,0.00035284602,0.000033999222,0.00017277974,0.00023399359,0.00022989027],"domain_scores_gemma":[0.99656856,0.0018234025,0.00041323708,0.00038657148,0.0005383173,0.0002700207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689997,0.00070273713,0.00080269756,0.0032582018,0.0020599412,0.0029492527,0.0013106407,0.0014056902,0.013022538],"category_scores_gemma":[0.005677128,0.00055481057,0.0006176894,0.003137552,0.0021913375,0.005188221,0.0022122525,0.0021768368,0.0012975902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036277583,0.00001809321,0.00019380519,0.00002316276,0.0000065325466,0.000041866813,0.00013325995,0.004761044,0.00061770866,0.9871603,0.0017424703,0.005265384],"study_design_scores_gemma":[0.000009155825,0.000011215192,0.0001761073,0.000013035782,0.0000056607437,0.000059788777,0.00007152771,0.035613786,0.00024966884,0.96202433,0.0017522194,0.000013547276],"about_ca_topic_score_codex":0.0025347448,"about_ca_topic_score_gemma":0.002045789,"teacher_disagreement_score":0.013022538,"about_ca_system_score_codex":0.0013667237,"about_ca_system_score_gemma":0.0006968829,"threshold_uncertainty_score":0.043564737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015338717,0.0003092622,0.9519796,0.00030508055,0.00021402915,0.00008387051,0.0001320201,0.00023110132,0.03140637],"genre_scores_gemma":[0.4290367,0.0011497897,0.52857,0.00061487197,0.0005219273,0.00038981848,0.00036438313,0.00022341404,0.03912911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832565,0.00052043644,0.00008647618,0.00034879125,0.0005247645,0.00019383982],"domain_scores_gemma":[0.9984275,0.00044371668,0.00021755164,0.0004558137,0.00032077168,0.00013466633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012207981,0.0008973808,0.00048573493,0.0012104968,0.0012848972,0.0020994872,0.0011251668,0.0011873523,0.010922363],"category_scores_gemma":[0.0037191988,0.0005051002,0.0006161242,0.0013986196,0.0018294357,0.0028822045,0.0018386206,0.00205473,0.0029928687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001911269,0.000011340017,0.00006010534,0.000022741817,0.000004492227,0.00003775416,0.000052093437,0.0017417461,0.0026118758,0.9808173,0.0007968167,0.013824551],"study_design_scores_gemma":[0.000019501958,0.0000712159,0.00009566182,0.00003379964,0.000013113827,0.00022872785,0.000044371285,0.026243238,0.0048470404,0.94298446,0.025392735,0.000026040241],"about_ca_topic_score_codex":0.00040924273,"about_ca_topic_score_gemma":0.0005764703,"teacher_disagreement_score":0.010922363,"about_ca_system_score_codex":0.0010336206,"about_ca_system_score_gemma":0.0008005515,"threshold_uncertainty_score":0.03653896},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062176004,0.002555463,0.71509093,0.0010354664,0.000963771,0.00014739497,0.00061358954,0.00092437526,0.21649309],"genre_scores_gemma":[0.6293992,0.0033247932,0.20961237,0.00111675,0.0015686875,0.00038843864,0.001960301,0.0012701238,0.15135942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992077,0.00022762414,0.000055807235,0.00020112775,0.00022115765,0.0000865534],"domain_scores_gemma":[0.99888176,0.0004401167,0.00014310857,0.00021403139,0.00020170823,0.00011920983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054524234,0.0008963545,0.0006718443,0.0014495399,0.00082445424,0.002140411,0.0011091622,0.00093848124,0.016666798],"category_scores_gemma":[0.0037934952,0.0005253114,0.00061517395,0.0015369267,0.0012832321,0.004925279,0.002088961,0.0022925898,0.005541867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002514802,0.000018207655,0.000045413406,0.00005332713,0.0000042702222,0.00003743151,0.0001055399,0.0010171296,0.0010679635,0.9700519,0.003807918,0.023765787],"study_design_scores_gemma":[0.0000066249877,0.000025473333,0.00006866148,0.000015988673,0.00000406652,0.00012091425,0.000065518056,0.006304684,0.0007271087,0.97993064,0.012717819,0.000012494767],"about_ca_topic_score_codex":0.000339891,"about_ca_topic_score_gemma":0.00038917956,"teacher_disagreement_score":0.016666798,"about_ca_system_score_codex":0.0005589712,"about_ca_system_score_gemma":0.000229603,"threshold_uncertainty_score":0.055755973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5694536,0.00093625655,0.30004776,0.0008002054,0.00024330847,0.00070412573,0.0040145633,0.0007414728,0.12305881],"genre_scores_gemma":[0.7911818,0.0006292223,0.16662408,0.0003480748,0.00007625041,0.00034437215,0.004564398,0.00021252703,0.036019232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996997,0.000058448026,0.000018579873,0.000077885044,0.000058655412,0.00008678121],"domain_scores_gemma":[0.9991762,0.0001471454,0.00011659246,0.00016999734,0.0002478093,0.00014232582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020257552,0.00053242594,0.00039591792,0.0013504153,0.00096202415,0.0013007815,0.0007713417,0.0004716365,0.0099109225],"category_scores_gemma":[0.0008287833,0.00035917907,0.00050652825,0.0010202131,0.0006533767,0.0011535408,0.0009065946,0.00079887453,0.0011627271],"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.001068799,0.000485515,0.003319979,0.0008426046,0.000106192005,0.0010261537,0.0012226711,0.045604065,0.041741036,0.70946354,0.02157553,0.17354394],"study_design_scores_gemma":[0.00019002486,0.0003447034,0.005712019,0.00027725607,0.00018536342,0.0012485647,0.0014984692,0.118319586,0.015283822,0.79819685,0.05867071,0.000072584924],"about_ca_topic_score_codex":0.0016671688,"about_ca_topic_score_gemma":0.0030474553,"teacher_disagreement_score":0.0099109225,"about_ca_system_score_codex":0.0005249525,"about_ca_system_score_gemma":0.0006698004,"threshold_uncertainty_score":0.033155322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.376887,0.0007321041,0.478156,0.00081503816,0.00029594207,0.0008418458,0.004204623,0.0010298985,0.1370376],"genre_scores_gemma":[0.6869431,0.00069052103,0.2587205,0.00054894964,0.00010950038,0.00049126457,0.0070163603,0.0003390752,0.04514077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997304,0.000051003597,0.0000156456,0.000070876886,0.00005652819,0.00007558517],"domain_scores_gemma":[0.9992841,0.000105817635,0.000095347874,0.0001471265,0.0002438044,0.00012387792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002214831,0.0004935765,0.0003437282,0.0013920174,0.0008844268,0.0012241715,0.00074857776,0.00047589128,0.013463652],"category_scores_gemma":[0.0006276261,0.00034699778,0.0006176299,0.0009045057,0.00061845814,0.001086705,0.0007134193,0.00086317596,0.0018953723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008545192,0.0006415492,0.0024849104,0.00072333636,0.00012398204,0.00084144407,0.0010258049,0.040449526,0.052569773,0.7140886,0.02695449,0.15924212],"study_design_scores_gemma":[0.00016093906,0.0003430113,0.004223123,0.00021084404,0.00016763159,0.0009724963,0.0013412299,0.11688947,0.0154990265,0.79697984,0.063135035,0.00007733673],"about_ca_topic_score_codex":0.0016278792,"about_ca_topic_score_gemma":0.0029187473,"teacher_disagreement_score":0.013463652,"about_ca_system_score_codex":0.0004400111,"about_ca_system_score_gemma":0.0007988818,"threshold_uncertainty_score":0.04504037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50971055,0.0041084858,0.34940413,0.0025385984,0.00043559258,0.00018311877,0.00091101683,0.00043731934,0.13227126],"genre_scores_gemma":[0.93980074,0.0024419082,0.035465322,0.0005205694,0.00039351228,0.00015411736,0.00048362874,0.00016593172,0.020574281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00018759334,0.00004304832,0.0001682909,0.00037130734,0.00023926033],"domain_scores_gemma":[0.9971769,0.0016773499,0.00035704992,0.0002702997,0.00033956053,0.00017869777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092152617,0.0010443695,0.0011701259,0.002206045,0.0012802412,0.0032684961,0.0009705506,0.0015986444,0.0066621276],"category_scores_gemma":[0.007853722,0.00043777216,0.0005649819,0.0024199593,0.001923201,0.0024616146,0.0016386027,0.001619611,0.00068111427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017316955,0.00004693544,0.0003688693,0.00007950237,0.000015013519,0.00006736034,0.000097403135,0.023460444,0.0021238162,0.9507716,0.0029478548,0.01984817],"study_design_scores_gemma":[0.000059896873,0.000052792555,0.000319565,0.00005250045,0.00001712688,0.00016981036,0.00006867931,0.11615648,0.001742608,0.8766168,0.0047175125,0.0000262907],"about_ca_topic_score_codex":0.0014679332,"about_ca_topic_score_gemma":0.0012803577,"teacher_disagreement_score":0.0066621276,"about_ca_system_score_codex":0.002060441,"about_ca_system_score_gemma":0.0016838809,"threshold_uncertainty_score":0.02228707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97361416,0.0009486693,0.016878368,0.0001276572,0.00005688715,0.00012168341,0.004010717,0.00044022652,0.0038016823],"genre_scores_gemma":[0.96955556,0.00061237294,0.011968723,0.000099077355,0.000011829424,0.00018224296,0.008381021,0.00020597923,0.008983343],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99973756,0.000022693865,0.000020264248,0.00008350211,0.00010253505,0.000033512377],"domain_scores_gemma":[0.99944013,0.000072229566,0.00012505242,0.00004695489,0.00024609218,0.000069386355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025393502,0.0003438675,0.00023933974,0.00074881606,0.00032981642,0.00037563016,0.00031077844,0.00025865025,0.0019086328],"category_scores_gemma":[0.00039855772,0.00012309983,0.00030637597,0.00065696647,0.0001714095,0.00017332552,0.00026441552,0.0006434924,0.000606427],"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.00007719152,0.000027479478,0.0012357084,0.000024600258,0.000008616969,0.00004604655,0.000057559893,0.00022602503,0.9948296,0.00008944592,0.000114765004,0.0032629375],"study_design_scores_gemma":[0.000015987987,0.00077497325,0.06775968,0.000021091546,0.000068011985,0.0003855365,0.00018926265,0.005889729,0.91548866,0.0001867438,0.009176043,0.00004433105],"about_ca_topic_score_codex":0.002995243,"about_ca_topic_score_gemma":0.0027506524,"teacher_disagreement_score":0.002995243,"about_ca_system_score_codex":0.000622189,"about_ca_system_score_gemma":0.00014705001,"threshold_uncertainty_score":0.0063850284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40664348,0.00059811556,0.57397234,0.00035671168,0.000162147,0.0001449516,0.000120697434,0.0013137786,0.01668779],"genre_scores_gemma":[0.914155,0.00019043157,0.08179462,0.00009521729,0.000021656602,0.00005403641,0.00005873355,0.000013618938,0.0036167304],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999192,0.000010977118,0.0000044405315,0.000019245022,0.00003234713,0.000013848364],"domain_scores_gemma":[0.9999361,0.000012273309,0.000011628716,0.0000072712096,0.00002593217,0.0000067082055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008395688,0.00016541491,0.000099795005,0.00020424889,0.00022232943,0.00035094746,0.0005245031,0.00022635859,0.0007469164],"category_scores_gemma":[0.00012486262,0.0000800338,0.00012561366,0.000167416,0.00016514635,0.00029046697,0.00016627835,0.00023919943,0.00013252863],"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.00024141934,0.0001745581,0.0014595569,0.00016772718,0.000056750327,0.00048886583,0.00017317572,0.0547836,0.77628607,0.059633914,0.0022015395,0.1043329],"study_design_scores_gemma":[0.00008311197,0.0010694115,0.0015046183,0.00003099164,0.000096707525,0.0007439931,0.00007183131,0.7438978,0.22643529,0.009856086,0.016156591,0.0000534872],"about_ca_topic_score_codex":0.0009373338,"about_ca_topic_score_gemma":0.0015847627,"teacher_disagreement_score":0.0009373338,"about_ca_system_score_codex":0.00043626304,"about_ca_system_score_gemma":0.00035029696,"threshold_uncertainty_score":0.0031653047},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17554437,0.0045860745,0.16399013,0.0027183257,0.005815357,0.00030370968,0.023062395,0.004134028,0.6198456],"genre_scores_gemma":[0.63106775,0.004033998,0.1707661,0.0014730013,0.0005981111,0.00060777564,0.039930183,0.0037833883,0.14773966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980634,0.00003409334,0.00001720643,0.000040548857,0.00007156831,0.000030375022],"domain_scores_gemma":[0.99973613,0.000059213755,0.000030382795,0.0000693309,0.00006911332,0.000035847475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012517304,0.0006344646,0.0005477371,0.0011857575,0.0012485518,0.0017632826,0.00064964895,0.00042870248,0.060179222],"category_scores_gemma":[0.0011213596,0.00027726436,0.0005246586,0.001718199,0.00051515346,0.0015712656,0.0011040816,0.0009812528,0.0077643814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002445124,0.000046333553,0.0012492521,0.0005132549,0.000033060434,0.0007445095,0.00048457482,0.0051761772,0.01041341,0.690189,0.16471757,0.12618843],"study_design_scores_gemma":[0.000041914867,0.000069037946,0.0014257327,0.00012205189,0.00002421293,0.0009810367,0.00050590746,0.012404163,0.010852436,0.47138003,0.5021096,0.00008393464],"about_ca_topic_score_codex":0.00087445433,"about_ca_topic_score_gemma":0.0016413922,"teacher_disagreement_score":0.060179222,"about_ca_system_score_codex":0.00060242304,"about_ca_system_score_gemma":0.0006056386,"threshold_uncertainty_score":0.20131952},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21517639,0.0013906123,0.5492573,0.0040852847,0.0009457484,0.00050683494,0.0048680613,0.0013219123,0.22244789],"genre_scores_gemma":[0.71986496,0.0010929023,0.17752194,0.0008101106,0.00056050805,0.0007925529,0.0033371572,0.00036714348,0.09565268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985355,0.00035698613,0.00012234344,0.00038669223,0.00034020416,0.00025824833],"domain_scores_gemma":[0.99580634,0.0019823823,0.00048344885,0.0006442739,0.00070109,0.0003823695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013166757,0.00070808554,0.00081446866,0.0021718226,0.0025001003,0.002801765,0.0009918535,0.0010551553,0.027538342],"category_scores_gemma":[0.006094713,0.00047783725,0.0010099525,0.0018602401,0.0019512074,0.0029058687,0.002579747,0.0020373557,0.005197367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023605545,0.0000785904,0.0010989408,0.0001873308,0.00006880044,0.00027374923,0.00029754132,0.0046127695,0.0025617129,0.93698347,0.009555908,0.044045024],"study_design_scores_gemma":[0.000053971704,0.00011682228,0.0008803626,0.0000389162,0.000030900137,0.00055373966,0.0001696923,0.017688846,0.0020939051,0.9504436,0.02789868,0.000030605042],"about_ca_topic_score_codex":0.001210171,"about_ca_topic_score_gemma":0.0015108285,"teacher_disagreement_score":0.027538342,"about_ca_system_score_codex":0.0015139788,"about_ca_system_score_gemma":0.0012393496,"threshold_uncertainty_score":0.09212488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1994796,0.0014040158,0.72133636,0.0013554548,0.00041192575,0.00028672765,0.0020062558,0.00094979635,0.072770014],"genre_scores_gemma":[0.7262332,0.0017150636,0.22332692,0.00045771003,0.00023879624,0.00030629165,0.003273751,0.00034389543,0.044104297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995654,0.00009667776,0.00003177016,0.00012538122,0.00008300687,0.00009762613],"domain_scores_gemma":[0.9990144,0.00040670994,0.00017912184,0.00015254562,0.00012921449,0.00011799846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039859535,0.0005070831,0.0003697782,0.0008663458,0.0007357422,0.0010475751,0.0004376935,0.00041414713,0.012516628],"category_scores_gemma":[0.0022061057,0.00021988167,0.0004532702,0.0007987619,0.00068687374,0.0012838555,0.00078257325,0.00080271286,0.0027920003],"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.00024364096,0.00012585257,0.0009977835,0.0004133534,0.000051836967,0.00026961396,0.0003919259,0.021831032,0.015942698,0.76988006,0.015117977,0.17473422],"study_design_scores_gemma":[0.00004792106,0.0001145985,0.0008896714,0.00005759034,0.00002232542,0.00043892616,0.00015323833,0.052847117,0.0033943325,0.9071076,0.03490063,0.00002602798],"about_ca_topic_score_codex":0.00089745864,"about_ca_topic_score_gemma":0.0018676007,"teacher_disagreement_score":0.012516628,"about_ca_system_score_codex":0.00073150825,"about_ca_system_score_gemma":0.00053059525,"threshold_uncertainty_score":0.041872263},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015663198,0.019132724,0.924922,0.0008231608,0.00067945395,0.00007619316,0.00025332408,0.0006836163,0.051863134],"genre_scores_gemma":[0.030948238,0.017794805,0.9048444,0.00052591757,0.0008474272,0.0003748875,0.000737341,0.0006763953,0.0432506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00012550404,0.000019650282,0.000067953,0.00016760503,0.000036004276],"domain_scores_gemma":[0.9994586,0.00036216716,0.000022813634,0.00007272857,0.00006975974,0.000013918192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246291,0.0022356256,0.0012491577,0.0010432295,0.0005596712,0.0019700693,0.0022162367,0.0017595917,0.011855741],"category_scores_gemma":[0.0020247397,0.0008831191,0.001140758,0.0033214886,0.0008918143,0.0018869074,0.0011170272,0.0036113278,0.0046532303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036403417,0.00011792188,0.00014775491,0.0006825814,0.00009989145,0.00005378568,0.000079249374,0.29970613,0.0015305203,0.19226483,0.05953745,0.44574344],"study_design_scores_gemma":[0.000038771515,0.00003721536,0.00015346002,0.00020043326,0.000027673206,0.00012320539,0.00004917373,0.516113,0.001188283,0.3812213,0.10081594,0.000031612835],"about_ca_topic_score_codex":0.0031415247,"about_ca_topic_score_gemma":0.0051827384,"teacher_disagreement_score":0.011855741,"about_ca_system_score_codex":0.0010806554,"about_ca_system_score_gemma":0.001025589,"threshold_uncertainty_score":0.039661467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39298373,0.0011753856,0.3724529,0.0013281432,0.00069977954,0.0006810873,0.0028672274,0.0015699458,0.22624178],"genre_scores_gemma":[0.78428787,0.00042248573,0.1802923,0.00024074758,0.000050016657,0.00037167218,0.0008873035,0.000074908516,0.033372723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964285,0.00012090349,0.000018730532,0.00006781126,0.000076147284,0.00007359888],"domain_scores_gemma":[0.99936444,0.0001916052,0.0000803089,0.00016495865,0.00013596888,0.00006279069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046254447,0.00046275175,0.00025356267,0.0006351413,0.0007901058,0.0007887227,0.00065082335,0.0007510397,0.022403808],"category_scores_gemma":[0.001408509,0.00020987629,0.00031188765,0.0005266394,0.00050331256,0.0007823559,0.0005129681,0.00045739417,0.0028700433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001521518,0.00034324417,0.0019173813,0.00084323547,0.0001228669,0.0008588588,0.00040164115,0.0455565,0.06765571,0.6587025,0.029918384,0.19215816],"study_design_scores_gemma":[0.00062044366,0.0012249782,0.002599159,0.00028523742,0.00019109451,0.001374413,0.0005481914,0.11126916,0.05714794,0.6513003,0.1732815,0.00015762827],"about_ca_topic_score_codex":0.00062529003,"about_ca_topic_score_gemma":0.0018245999,"teacher_disagreement_score":0.022403808,"about_ca_system_score_codex":0.000681375,"about_ca_system_score_gemma":0.000541271,"threshold_uncertainty_score":0.07494819},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28439713,0.00631553,0.5534664,0.00073052605,0.0010058006,0.0003868961,0.0009277487,0.0012321727,0.15153782],"genre_scores_gemma":[0.84658843,0.0023419715,0.107537925,0.0005209189,0.0001774966,0.000659174,0.0009954934,0.0002382797,0.04094028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994679,0.00013154317,0.00003060126,0.00015399177,0.00011538171,0.00010062064],"domain_scores_gemma":[0.99942005,0.0001794783,0.000085874664,0.00017397758,0.00007559046,0.00006505073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048544403,0.00046589493,0.0003543053,0.00086763164,0.0007893389,0.0012191818,0.0008416264,0.00073586137,0.013168554],"category_scores_gemma":[0.0013523845,0.00028518683,0.00035863987,0.00055686885,0.0013646628,0.0018684595,0.0014043669,0.00063823967,0.0028205467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016571312,0.00005402365,0.00060470303,0.00017239411,0.000027136779,0.00018102395,0.00014707533,0.0044286023,0.023605507,0.93285424,0.0016939531,0.036065504],"study_design_scores_gemma":[0.00010316999,0.00042165013,0.0009356759,0.00009871315,0.000039364884,0.0005294422,0.00011051943,0.019418968,0.032831766,0.78987104,0.1555703,0.00006939247],"about_ca_topic_score_codex":0.00031553075,"about_ca_topic_score_gemma":0.00043632672,"teacher_disagreement_score":0.013168554,"about_ca_system_score_codex":0.00074477564,"about_ca_system_score_gemma":0.00045493717,"threshold_uncertainty_score":0.044053137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5674645,0.007146014,0.27844957,0.0036911934,0.001212526,0.0004282627,0.010979225,0.00198733,0.12864135],"genre_scores_gemma":[0.9009686,0.0020893048,0.066424824,0.00076429825,0.00032413204,0.0002413242,0.004066886,0.00018194214,0.024938654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990324,0.00021466511,0.0000858728,0.00039197822,0.00015253745,0.00012258868],"domain_scores_gemma":[0.99623185,0.0019737496,0.0006915278,0.0005588039,0.00028034573,0.0002636829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087376055,0.000576409,0.0005362488,0.0027468905,0.0011981837,0.0020265172,0.00074854644,0.00066097453,0.009007825],"category_scores_gemma":[0.004189793,0.00038915864,0.0006215314,0.0016466076,0.0018478674,0.0021311296,0.0011337078,0.00063958595,0.0017914496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008682089,0.00028806966,0.031604286,0.0016420557,0.00060013286,0.0031732467,0.0021860881,0.008667847,0.019063113,0.7134239,0.024183122,0.1942999],"study_design_scores_gemma":[0.00011065272,0.00018680014,0.023312394,0.00028418176,0.0002991895,0.007463153,0.0011096378,0.0197556,0.00546173,0.8034206,0.13848306,0.000112958114],"about_ca_topic_score_codex":0.0012914214,"about_ca_topic_score_gemma":0.0019141374,"teacher_disagreement_score":0.009007825,"about_ca_system_score_codex":0.0009975557,"about_ca_system_score_gemma":0.0004419732,"threshold_uncertainty_score":0.030134141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72280794,0.00041389308,0.2363745,0.00032378585,0.00007258499,0.00013224238,0.00078937714,0.00023713203,0.038848665],"genre_scores_gemma":[0.8805949,0.0002661152,0.107729815,0.00017520368,0.00012611243,0.00024923487,0.001308881,0.00010547725,0.009444304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990157,0.00024423082,0.00007068707,0.00025491006,0.0002508439,0.0001635732],"domain_scores_gemma":[0.9979468,0.00094049383,0.000314517,0.00026830324,0.0002597505,0.00027018253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008683661,0.00045592524,0.0005798529,0.0011541365,0.0014745158,0.0016702797,0.0007986291,0.00043218426,0.0027062767],"category_scores_gemma":[0.0023776158,0.00054516335,0.0008097447,0.00050409924,0.0020357808,0.0022715642,0.0016038227,0.0013888486,0.0004050844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058143843,0.000043207845,0.00080678053,0.000057594007,0.000008988862,0.00008326489,0.00040085788,0.0021411385,0.0053421706,0.9804223,0.00088430993,0.00975116],"study_design_scores_gemma":[0.000041716157,0.00008049808,0.0010835455,0.000028742248,0.000021045209,0.0003899085,0.0002542308,0.0098525565,0.009288447,0.96806693,0.010849721,0.000042559426],"about_ca_topic_score_codex":0.00038365865,"about_ca_topic_score_gemma":0.000658405,"teacher_disagreement_score":0.0027062767,"about_ca_system_score_codex":0.00080188335,"about_ca_system_score_gemma":0.0004445634,"threshold_uncertainty_score":0.009053469},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4445352,0.0012110646,0.057595633,0.0068432107,0.0017587024,0.00014112346,0.0017154295,0.001838853,0.4843608],"genre_scores_gemma":[0.94381684,0.0007850013,0.015244076,0.0008148885,0.00017332679,0.00007472587,0.0008598389,0.00027133137,0.037959952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938035,0.000099161705,0.000018917368,0.00012672083,0.00015594228,0.00021882453],"domain_scores_gemma":[0.99915195,0.000292799,0.00013520327,0.000110285735,0.00008209758,0.00022775737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040217183,0.00064557814,0.0004895843,0.0020028718,0.0021816615,0.0025693853,0.0008235858,0.0015569682,0.035908543],"category_scores_gemma":[0.0018881003,0.0003379274,0.0005319235,0.0013704768,0.0017137685,0.0018438428,0.0011693119,0.0021731176,0.006338384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066023186,0.0002550815,0.0027188996,0.00041068584,0.000088236324,0.0021746333,0.0006426824,0.002222776,0.027855447,0.82065666,0.034097657,0.10821696],"study_design_scores_gemma":[0.00007363277,0.00013968382,0.004056786,0.00011113669,0.000057176574,0.0027049265,0.0006543585,0.0037971905,0.016005902,0.87310445,0.09920264,0.00009205923],"about_ca_topic_score_codex":0.00089807843,"about_ca_topic_score_gemma":0.0009926888,"teacher_disagreement_score":0.035908543,"about_ca_system_score_codex":0.0007939019,"about_ca_system_score_gemma":0.00087108504,"threshold_uncertainty_score":0.12012607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45289788,0.004984069,0.12224699,0.005533404,0.00071445527,0.00016116069,0.0052781105,0.00055756007,0.40762636],"genre_scores_gemma":[0.92669445,0.0041800668,0.03429209,0.0009188844,0.00045109083,0.00027599622,0.0036020942,0.00024827904,0.029337114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996587,0.00009546789,0.000015733609,0.00008658446,0.00006783472,0.00007567763],"domain_scores_gemma":[0.99838257,0.000871665,0.0002729773,0.00014293136,0.000114774986,0.00021513193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002539413,0.0003556542,0.0004373407,0.0016728777,0.0014246581,0.0013879185,0.0007649522,0.0009860594,0.020316105],"category_scores_gemma":[0.0021727858,0.00028823878,0.00034480207,0.0011606744,0.0013994097,0.0026211652,0.0015344766,0.0012414916,0.0021710237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016566341,0.000033678753,0.0016570466,0.0002495898,0.000031334144,0.00040573298,0.00038625824,0.0071030967,0.0037959793,0.9260551,0.030951317,0.0291652],"study_design_scores_gemma":[0.000040259965,0.00005431103,0.003126405,0.0000975999,0.000028854605,0.00086685095,0.00036541285,0.014603238,0.00161988,0.9507209,0.028445374,0.00003090417],"about_ca_topic_score_codex":0.0011098419,"about_ca_topic_score_gemma":0.0019510271,"teacher_disagreement_score":0.020316105,"about_ca_system_score_codex":0.0005907952,"about_ca_system_score_gemma":0.0002845687,"threshold_uncertainty_score":0.06796408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85090363,0.0020140435,0.062334616,0.0016552848,0.0015694228,0.00019365577,0.00095460535,0.0013932954,0.0789814],"genre_scores_gemma":[0.9412929,0.0006710747,0.018002275,0.00093617506,0.00016549737,0.00017349831,0.001188697,0.00031876334,0.037251204],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968207,0.000054803284,0.000012966333,0.00008843322,0.000068545145,0.000093170376],"domain_scores_gemma":[0.9997023,0.00004255234,0.00008398673,0.000039399394,0.000039283797,0.00009240488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025039984,0.00057093,0.00035323884,0.0005844627,0.00081905595,0.0006572307,0.0011226358,0.0005506166,0.038783275],"category_scores_gemma":[0.0006543417,0.0003230901,0.0004537857,0.0003675815,0.00067622267,0.0007104841,0.001337554,0.0009847123,0.0067120604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002156356,0.0002987493,0.00816928,0.00086892804,0.00018394146,0.0092311725,0.0014733656,0.0049867895,0.66524726,0.16728002,0.024574386,0.11552979],"study_design_scores_gemma":[0.0006103613,0.0037561355,0.025667846,0.0002724968,0.0002266121,0.018288527,0.003417545,0.037015077,0.3551286,0.18090457,0.37434337,0.00036888686],"about_ca_topic_score_codex":0.000967538,"about_ca_topic_score_gemma":0.0010687012,"teacher_disagreement_score":0.038783275,"about_ca_system_score_codex":0.00029009004,"about_ca_system_score_gemma":0.00037043868,"threshold_uncertainty_score":0.12974298},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012170728,0.0076925657,0.23792183,0.0042146314,0.0014646676,0.000055686054,0.00020379334,0.0005614037,0.7357147],"genre_scores_gemma":[0.38827336,0.012359001,0.121863134,0.0038958192,0.001051092,0.00021738086,0.0004896484,0.0013186369,0.47053185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992699,0.0002152369,0.00002008316,0.00020357281,0.00020717634,0.00008396489],"domain_scores_gemma":[0.9989704,0.00045863094,0.00002522523,0.00033535057,0.00016245471,0.00004791612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072073465,0.0007155239,0.00075591507,0.0011288665,0.0016801466,0.0031029328,0.0012318945,0.0010291974,0.017867655],"category_scores_gemma":[0.0022930664,0.00048004548,0.0008086389,0.0025119784,0.0049051708,0.006596546,0.0019687375,0.0032947704,0.0028492159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052017267,0.0000047470294,0.000019054782,0.000040384166,0.0000024938436,0.0000067679875,0.00011713774,0.00054522237,0.00013425054,0.97357464,0.005921469,0.019628638],"study_design_scores_gemma":[0.0000032372077,0.000004277636,0.000037937876,0.000022155278,0.0000053889153,0.000033011107,0.000048312264,0.0010156058,0.00029111386,0.9401849,0.05835049,0.0000035336216],"about_ca_topic_score_codex":0.0024008844,"about_ca_topic_score_gemma":0.0031148545,"teacher_disagreement_score":0.017867655,"about_ca_system_score_codex":0.0021824257,"about_ca_system_score_gemma":0.0011869706,"threshold_uncertainty_score":0.059773266},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08811896,0.008739059,0.41273174,0.0076122885,0.0015441237,0.00018488242,0.0027252818,0.0009563582,0.4773873],"genre_scores_gemma":[0.8049201,0.003897537,0.09513976,0.0017588867,0.0008543421,0.00023093089,0.0017152238,0.00026933185,0.09121388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863774,0.00034119398,0.00006114663,0.00019401214,0.00045059557,0.00031531398],"domain_scores_gemma":[0.99807113,0.00089652993,0.00018466408,0.00040105835,0.00028761645,0.00015903017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705862,0.00060799945,0.000610106,0.001263232,0.00083428697,0.0018037235,0.0007593503,0.0012066168,0.014071803],"category_scores_gemma":[0.0048634694,0.0003689004,0.00035396326,0.0014064172,0.0010635467,0.00242253,0.0021732997,0.0016312134,0.003466468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019480266,0.00008234294,0.00034805448,0.00018490799,0.000029413188,0.00006566448,0.00011342827,0.014153989,0.0034111976,0.8708735,0.030154226,0.08038844],"study_design_scores_gemma":[0.000056697954,0.000042684216,0.0003695338,0.00008130758,0.000024845966,0.00018710512,0.00007648806,0.05379188,0.0034506295,0.91775006,0.024145756,0.00002315194],"about_ca_topic_score_codex":0.0009502653,"about_ca_topic_score_gemma":0.0021214788,"teacher_disagreement_score":0.014071803,"about_ca_system_score_codex":0.0017483833,"about_ca_system_score_gemma":0.0013524655,"threshold_uncertainty_score":0.047074854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3483525,0.0012672474,0.4871031,0.0011174111,0.0005959156,0.00014064393,0.0009299206,0.0010266446,0.15946661],"genre_scores_gemma":[0.8562627,0.0007368408,0.105407536,0.00034658564,0.00022731157,0.00013360614,0.00084659475,0.0003595671,0.035679206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993961,0.00019037921,0.00003875132,0.00013287152,0.00012882573,0.00011317934],"domain_scores_gemma":[0.99903935,0.0003256946,0.00014853124,0.00019713893,0.00012371561,0.00016554646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032074592,0.0005327468,0.00041733662,0.0013944043,0.0011171736,0.0026146215,0.00079167413,0.0007895424,0.011155537],"category_scores_gemma":[0.0017810839,0.00042505682,0.0006374412,0.0011674656,0.0012861902,0.0046622828,0.002959191,0.0018538781,0.0022113717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005151592,0.00003923193,0.00019353056,0.000046248035,0.000009665285,0.00012987985,0.0002881791,0.0023384427,0.001853477,0.9760803,0.0024674663,0.0165021],"study_design_scores_gemma":[0.000017210474,0.000044645938,0.00020684117,0.00003656096,0.000011653833,0.00026727622,0.00034066036,0.011036143,0.0016003496,0.9687299,0.017687516,0.000021292552],"about_ca_topic_score_codex":0.00045906735,"about_ca_topic_score_gemma":0.00073446054,"teacher_disagreement_score":0.011155537,"about_ca_system_score_codex":0.00075558777,"about_ca_system_score_gemma":0.00029552513,"threshold_uncertainty_score":0.037319005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24257399,0.0009950745,0.6010439,0.0020081266,0.0005453432,0.00020017546,0.00024481225,0.0007152061,0.15167333],"genre_scores_gemma":[0.82894367,0.00072341086,0.13017826,0.00073559803,0.00030298252,0.0002970611,0.0003560972,0.00075250026,0.037710447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989574,0.00037020986,0.000065760716,0.00017142059,0.00026081072,0.00017436901],"domain_scores_gemma":[0.9971511,0.0017030014,0.00020421298,0.00036007888,0.00028906038,0.0002925157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380339,0.0009918209,0.0009404151,0.0026714632,0.0027925463,0.0036651168,0.0013230036,0.0012836417,0.011187443],"category_scores_gemma":[0.004320202,0.0012664631,0.0012959723,0.0017320672,0.0037822458,0.0056135594,0.0039196406,0.0031907354,0.0013703854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017482062,0.000007850379,0.000066739995,0.00001813969,0.0000026661114,0.00004405035,0.000181483,0.00041208492,0.0005118559,0.9960453,0.0006396624,0.0020527246],"study_design_scores_gemma":[0.000012247918,0.000012418676,0.000043383483,0.000015969894,0.000008432422,0.000103694016,0.000096182564,0.0029215426,0.0010581905,0.9913737,0.004344402,0.0000097836],"about_ca_topic_score_codex":0.00051540835,"about_ca_topic_score_gemma":0.0008694259,"teacher_disagreement_score":0.011187443,"about_ca_system_score_codex":0.0013667016,"about_ca_system_score_gemma":0.0005321301,"threshold_uncertainty_score":0.037425697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3176152,0.0033535496,0.40322858,0.0032302658,0.00066675694,0.00016674702,0.001456056,0.00062219944,0.26966056],"genre_scores_gemma":[0.83852714,0.0030933234,0.080390766,0.0015048786,0.0005745899,0.00023937375,0.0012571616,0.0002780409,0.0741347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999033,0.00036240465,0.000048726874,0.0001622506,0.00019384883,0.0001998093],"domain_scores_gemma":[0.996476,0.0020227816,0.0005090047,0.00031201064,0.0003369824,0.00034317782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006227927,0.00059483445,0.00049885886,0.002961519,0.0017764152,0.0025325322,0.0007497936,0.0011668524,0.013152404],"category_scores_gemma":[0.0035123178,0.0004977588,0.0005738323,0.002151244,0.0016794244,0.0044799,0.0018800452,0.001597701,0.002422136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060859395,0.00003200413,0.00037172827,0.00007535736,0.000016065424,0.00024329183,0.0003261926,0.0038943884,0.0018938347,0.97413176,0.0039067795,0.015047676],"study_design_scores_gemma":[0.000012536546,0.000014866462,0.00039427835,0.000053581185,0.000010770097,0.00028221746,0.00018963362,0.010628453,0.0009172397,0.9765118,0.010967358,0.000017420316],"about_ca_topic_score_codex":0.0017323418,"about_ca_topic_score_gemma":0.0030260736,"teacher_disagreement_score":0.013152404,"about_ca_system_score_codex":0.0015048819,"about_ca_system_score_gemma":0.0006253461,"threshold_uncertainty_score":0.043999135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0756596,0.0018055161,0.5212143,0.0012551778,0.0015513308,0.00019612284,0.00148073,0.004543788,0.39229333],"genre_scores_gemma":[0.6026168,0.0018798774,0.19648638,0.0015767686,0.0009865585,0.0004485144,0.0038004369,0.001488273,0.19071639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.0001364763,0.000039117374,0.00017387698,0.0002688779,0.00013947404],"domain_scores_gemma":[0.99887925,0.00027229363,0.000098868426,0.0004085363,0.00022563174,0.00011541607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023443202,0.0008524022,0.0009896858,0.0015979671,0.0013387653,0.0024160396,0.0008785932,0.001262414,0.047024433],"category_scores_gemma":[0.0021117267,0.000669764,0.00054296275,0.0024514345,0.0006175596,0.002599407,0.0020867148,0.0015772338,0.016578121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005028359,0.000214756,0.00067792437,0.00027256008,0.00004923632,0.00034107087,0.00024629507,0.017883811,0.04054887,0.6137228,0.054748956,0.27079096],"study_design_scores_gemma":[0.00010797036,0.00035504324,0.0010507362,0.0001020615,0.00006171074,0.0012428489,0.00033415022,0.138679,0.0666508,0.6162025,0.17512347,0.000089796384],"about_ca_topic_score_codex":0.00023565607,"about_ca_topic_score_gemma":0.00029146424,"teacher_disagreement_score":0.047024433,"about_ca_system_score_codex":0.00048575507,"about_ca_system_score_gemma":0.00035501225,"threshold_uncertainty_score":0.1573124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72129047,0.00035746975,0.1786234,0.0015386366,0.00013149617,0.00015401606,0.0022307592,0.00035978307,0.09531405],"genre_scores_gemma":[0.96081704,0.00023128463,0.021301515,0.00021668391,0.00007579145,0.00014117287,0.0015750484,0.00006331297,0.015578236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998454,0.00044496224,0.000074295225,0.00035917127,0.00023783768,0.0004297449],"domain_scores_gemma":[0.98915267,0.0059642014,0.0012442732,0.0006991348,0.0008085876,0.0021312244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013867577,0.00055312994,0.0012448693,0.0009949844,0.00323768,0.004701727,0.001138494,0.0013265294,0.018812135],"category_scores_gemma":[0.00908757,0.0008026608,0.0011182368,0.0015241934,0.0013535313,0.0023655468,0.0019570598,0.001419733,0.0015170404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083041494,0.0002540018,0.008100506,0.00025542086,0.00019171672,0.0009265472,0.0008317889,0.010559576,0.0032302747,0.938604,0.013099949,0.023115858],"study_design_scores_gemma":[0.00044149003,0.00022947919,0.0062313513,0.00007197788,0.00010532385,0.0012995012,0.0008026361,0.07184283,0.0021707423,0.9022405,0.014484732,0.00007945312],"about_ca_topic_score_codex":0.002158992,"about_ca_topic_score_gemma":0.00361735,"teacher_disagreement_score":0.018812135,"about_ca_system_score_codex":0.0010813371,"about_ca_system_score_gemma":0.0008990154,"threshold_uncertainty_score":0.06293291},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1212936,0.00062286586,0.8527199,0.00047005847,0.00010391081,0.0001167038,0.000417859,0.0007709792,0.023484161],"genre_scores_gemma":[0.8317486,0.00068409316,0.14329427,0.00037740823,0.00019248865,0.00046691822,0.0009826756,0.0007451583,0.021508448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985281,0.00035234334,0.00008315989,0.00043194057,0.00031402713,0.0002903673],"domain_scores_gemma":[0.99634886,0.0014357953,0.0005039467,0.00059563987,0.00065241853,0.00046324948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018019421,0.0007158342,0.00073048903,0.0020824475,0.0013165585,0.002423391,0.00088461814,0.00112195,0.013010015],"category_scores_gemma":[0.0076961317,0.00067958474,0.00065392244,0.0012561555,0.0017825459,0.0062162653,0.0022931558,0.0014257391,0.0020519753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022598414,0.000059826925,0.0010430424,0.000190141,0.00003187916,0.00026179993,0.00051310734,0.01884481,0.013561545,0.92081684,0.0040966594,0.04035442],"study_design_scores_gemma":[0.000053358763,0.00008727713,0.00063548196,0.000058886275,0.000027558202,0.00025745475,0.00033889606,0.07649913,0.0063567534,0.9054311,0.01022842,0.000025653384],"about_ca_topic_score_codex":0.0007965037,"about_ca_topic_score_gemma":0.0011000506,"teacher_disagreement_score":0.013010015,"about_ca_system_score_codex":0.0011592475,"about_ca_system_score_gemma":0.0004770872,"threshold_uncertainty_score":0.043522894},"labels":[],"label_agreement":null},{"id":"W4210712480","doi":"10.1002/jcd.21801","title":"Extended near Skolem sequences Part I","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Memorial University of Newfoundland; Mount Allison University","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Order (exchange); Integer (computer science); Construct (python library); Discrete mathematics; Computer science","score_opus":0.01908965891260589,"score_gpt":0.22893250119867262,"score_spread":0.20984284228606673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210712480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44340044,0.00079276273,0.3885797,0.00032378448,0.0006255262,0.0002002773,0.0006848608,0.0005846383,0.16480798],"genre_scores_gemma":[0.88738364,0.00038825316,0.07450028,0.0002596939,0.0001628328,0.000127956,0.00086759427,0.00011724918,0.036192566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952793,0.0000942142,0.000049051254,0.00010392958,0.00014841097,0.00007638981],"domain_scores_gemma":[0.9992605,0.0001271358,0.00011245383,0.00014849825,0.0002518499,0.00009960235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042069127,0.00050924654,0.0003595515,0.0008504438,0.0007819333,0.0009985594,0.00039119206,0.0004759364,0.0075414004],"category_scores_gemma":[0.001042093,0.00019125524,0.00042135536,0.00050307607,0.0010109844,0.0011574776,0.0007850429,0.00081799045,0.0019044942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024676428,0.000091288864,0.0008828301,0.00013434868,0.000014302699,0.00027448774,0.00035618097,0.008636662,0.037299834,0.91112494,0.0025658938,0.038372464],"study_design_scores_gemma":[0.000036854795,0.00067007187,0.0016978454,0.00018561212,0.000028315197,0.0012188393,0.00040840553,0.061363287,0.047702316,0.80515563,0.08144905,0.00008376893],"about_ca_topic_score_codex":0.0002602785,"about_ca_topic_score_gemma":0.000338099,"teacher_disagreement_score":0.0075414004,"about_ca_system_score_codex":0.00053537625,"about_ca_system_score_gemma":0.00039849925,"threshold_uncertainty_score":0.02522844},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45684117,0.00080264866,0.2607268,0.0021800045,0.00021246876,0.00033408168,0.0041882773,0.000935453,0.27377906],"genre_scores_gemma":[0.9057393,0.00072359585,0.04913786,0.00061409606,0.00009035659,0.00028971216,0.0023154514,0.00018352635,0.040906034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923134,0.00016929096,0.000034324734,0.00012965093,0.00024271465,0.0001926017],"domain_scores_gemma":[0.99760485,0.0006901091,0.00034845035,0.0005408072,0.0005096031,0.00030614308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004055705,0.00046781564,0.0007853276,0.0015192999,0.0018374649,0.0019921134,0.0013467311,0.00087476097,0.017698077],"category_scores_gemma":[0.0022626282,0.00056176964,0.00040395395,0.002393994,0.0009057745,0.002415489,0.0017775004,0.001947911,0.0023223902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002728256,0.000057760513,0.00054663484,0.00009720413,0.000023883043,0.00017438822,0.00015608047,0.006699104,0.0041665877,0.9639419,0.00832736,0.015536134],"study_design_scores_gemma":[0.00009171496,0.00007369968,0.00089362595,0.000045474477,0.000041540643,0.0006212149,0.00020202063,0.055172663,0.005059179,0.9150321,0.022736982,0.000029742625],"about_ca_topic_score_codex":0.001585192,"about_ca_topic_score_gemma":0.0021214273,"teacher_disagreement_score":0.017698077,"about_ca_system_score_codex":0.00093676377,"about_ca_system_score_gemma":0.000941935,"threshold_uncertainty_score":0.05920595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6856634,0.0022629695,0.23332408,0.0043913075,0.0010878098,0.000072046205,0.0004083843,0.00059305574,0.07219685],"genre_scores_gemma":[0.9589988,0.0008814583,0.019294571,0.0003990717,0.0006807154,0.000042208434,0.00019118655,0.00014421449,0.019367825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991296,0.00028245035,0.000039516537,0.00017392403,0.00025284762,0.00012164698],"domain_scores_gemma":[0.9972223,0.0009849872,0.0005503868,0.00047280177,0.00036678315,0.00040278488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010536034,0.0005800494,0.0007156418,0.0037087465,0.001686294,0.002582375,0.0007752454,0.001468656,0.0066329264],"category_scores_gemma":[0.006810112,0.00035080712,0.000538732,0.002403985,0.0058068857,0.0044882633,0.0017933206,0.0023954269,0.0006589549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050433286,0.00005604502,0.0004673246,0.0000198203,0.0000058546025,0.00013011548,0.00028714666,0.0013349034,0.001517159,0.9801031,0.0014660577,0.014562013],"study_design_scores_gemma":[0.0000049053606,0.000018613724,0.00036880578,0.0000064119554,0.0000026916612,0.00011503812,0.000103660816,0.005124328,0.00046148518,0.9928254,0.0009502859,0.000018340023],"about_ca_topic_score_codex":0.00085986283,"about_ca_topic_score_gemma":0.00089938386,"teacher_disagreement_score":0.0066329264,"about_ca_system_score_codex":0.0006468096,"about_ca_system_score_gemma":0.00066657114,"threshold_uncertainty_score":0.02218932},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17493545,0.02569134,0.23360673,0.009514007,0.0011885575,0.00013524154,0.0007857159,0.0003980698,0.553745],"genre_scores_gemma":[0.9054383,0.015995147,0.03156036,0.0019041508,0.0019313296,0.00014486548,0.0005952628,0.00014867881,0.042281922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992467,0.00016299616,0.000044530214,0.00017870667,0.00023206825,0.00013502872],"domain_scores_gemma":[0.99859375,0.00074352586,0.0002035814,0.00017805811,0.0001572831,0.00012382494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011928679,0.0006772991,0.0007287397,0.002403627,0.0014697459,0.0014101872,0.00091429084,0.00085461553,0.011290523],"category_scores_gemma":[0.0039040886,0.00029836583,0.0007852363,0.0020854254,0.0017699642,0.0046165828,0.0018842679,0.0024937463,0.0017607999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026842756,0.000018761115,0.00020432005,0.00012243552,0.0000117493555,0.000071764414,0.00014670422,0.0010157501,0.0005381669,0.9847416,0.0023610354,0.010740923],"study_design_scores_gemma":[0.000020847086,0.0000332365,0.00047649516,0.0000409078,0.00003098851,0.00028383214,0.00015643831,0.0037355102,0.001025698,0.9696984,0.024476225,0.000021398115],"about_ca_topic_score_codex":0.00047985977,"about_ca_topic_score_gemma":0.00038682105,"teacher_disagreement_score":0.011290523,"about_ca_system_score_codex":0.0009828765,"about_ca_system_score_gemma":0.00036571355,"threshold_uncertainty_score":0.03777057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13600358,0.0005912619,0.8532689,0.00022754876,0.000047486123,0.00010448616,0.000064040614,0.000384822,0.0093078315],"genre_scores_gemma":[0.8312142,0.00023566622,0.16681033,0.00004451133,0.000022632361,0.00007212159,0.00006417907,0.000023823175,0.0015125973],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971324,0.00005074437,0.000013855921,0.000044571232,0.00015024726,0.000027364355],"domain_scores_gemma":[0.9994486,0.00018604184,0.00010330897,0.00004639979,0.00019150568,0.000024217257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016761247,0.0003465161,0.00018307623,0.00039892737,0.00027682088,0.00046614726,0.0003976907,0.00023462856,0.00094276096],"category_scores_gemma":[0.00064461754,0.00015696006,0.00016988926,0.00023512193,0.00020746152,0.00035398183,0.00022036882,0.00036193855,0.00020604434],"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.00028663388,0.00013719013,0.0029396615,0.00037407302,0.00009303611,0.000365678,0.00025068288,0.24363601,0.4150719,0.04121548,0.0019788076,0.29365093],"study_design_scores_gemma":[0.000025018033,0.00039099462,0.0010372679,0.000018779843,0.000036023564,0.00043420962,0.00004536484,0.9078124,0.07977119,0.0043852595,0.006021839,0.000021662621],"about_ca_topic_score_codex":0.0011815059,"about_ca_topic_score_gemma":0.0027119066,"teacher_disagreement_score":0.0011815059,"about_ca_system_score_codex":0.000541711,"about_ca_system_score_gemma":0.00077425357,"threshold_uncertainty_score":0.0039304495},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16052529,0.009591654,0.3624282,0.02122867,0.0020267977,0.00021036949,0.0007398155,0.0014772321,0.4417721],"genre_scores_gemma":[0.8718205,0.0034385917,0.0729902,0.0043451893,0.0018077247,0.00042886563,0.0004011173,0.0006538896,0.044113945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935869,0.0021864986,0.00019832591,0.0008448834,0.0020185325,0.0011648815],"domain_scores_gemma":[0.9708473,0.0207267,0.0012949196,0.003739763,0.0015378065,0.0018535446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007834788,0.0032217782,0.0024410796,0.008670992,0.0042889696,0.009604543,0.0050046323,0.0052519287,0.021854285],"category_scores_gemma":[0.035158813,0.0016022284,0.0016316677,0.005011646,0.013609558,0.015451462,0.00856058,0.017305382,0.0043243966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001086569,0.00003127514,0.00009849238,0.00005895468,0.000009291476,0.000025322646,0.00013192664,0.0022296514,0.0004736471,0.990236,0.002165935,0.0044307844],"study_design_scores_gemma":[0.000032132128,0.00002321929,0.00008270732,0.000050239698,0.00001711275,0.00005549557,0.00006405166,0.009002702,0.0008533888,0.986845,0.0029415633,0.000032373213],"about_ca_topic_score_codex":0.001691436,"about_ca_topic_score_gemma":0.0015691589,"teacher_disagreement_score":0.021854285,"about_ca_system_score_codex":0.0077057183,"about_ca_system_score_gemma":0.0020774077,"threshold_uncertainty_score":0.073109865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37292093,0.000800164,0.5872346,0.0007981154,0.00024556843,0.0000978482,0.00076655846,0.00059070316,0.03654553],"genre_scores_gemma":[0.9555956,0.00030960346,0.03537054,0.00026481913,0.00020262199,0.00008169526,0.0004092013,0.00010063669,0.007665303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994301,0.00007497852,0.000026614038,0.0001722002,0.00018280269,0.000113394846],"domain_scores_gemma":[0.9989237,0.00030111158,0.00021697294,0.00024800366,0.0001625708,0.00014762934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006292909,0.00054472446,0.00052781665,0.0010399474,0.00079753774,0.0010570982,0.00071570015,0.00043399705,0.007690587],"category_scores_gemma":[0.0021978272,0.00024136118,0.0006640434,0.00059833395,0.001651677,0.001985098,0.002287516,0.0016618875,0.0011422884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001545599,0.000035725123,0.0011565926,0.000098511155,0.000033745993,0.00021306147,0.00021494296,0.017149305,0.014804478,0.9430055,0.002967155,0.020166544],"study_design_scores_gemma":[0.000039449857,0.0002406037,0.0016302906,0.000024371522,0.000019459267,0.00032878315,0.00009390491,0.08062746,0.011240962,0.89635825,0.00934484,0.000051673742],"about_ca_topic_score_codex":0.00038173195,"about_ca_topic_score_gemma":0.0003580659,"teacher_disagreement_score":0.007690587,"about_ca_system_score_codex":0.000568906,"about_ca_system_score_gemma":0.0002667814,"threshold_uncertainty_score":0.02572757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14744774,0.0007803269,0.82790005,0.0007013371,0.00024693483,0.000072734605,0.000555348,0.0002845606,0.022010945],"genre_scores_gemma":[0.7958483,0.0014836171,0.16515674,0.00044471957,0.0006794081,0.00017850625,0.0011813275,0.00039648937,0.034630902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990727,0.00028635305,0.000039707396,0.00025512863,0.00020692204,0.00013931438],"domain_scores_gemma":[0.99739814,0.0010587494,0.00033899533,0.00047047943,0.00050220836,0.00023138392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008242127,0.0009097661,0.0007483128,0.0018257527,0.00076166616,0.0021682119,0.0008491004,0.0005990886,0.008939167],"category_scores_gemma":[0.004299686,0.00043135078,0.0009410303,0.0014201474,0.0013990366,0.0036050845,0.0010963242,0.0014180865,0.0010240703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008085937,0.00004846653,0.0003810654,0.000081233375,0.000022539887,0.00009035503,0.00026961346,0.008242764,0.0033396173,0.9603104,0.0027796428,0.024353486],"study_design_scores_gemma":[0.000008424316,0.000018565277,0.00022545188,0.0000125778615,0.000007696688,0.000085670115,0.00006708983,0.039739527,0.0007407957,0.9559983,0.0030828244,0.000012984009],"about_ca_topic_score_codex":0.0014680387,"about_ca_topic_score_gemma":0.0013212891,"teacher_disagreement_score":0.008939167,"about_ca_system_score_codex":0.0007312594,"about_ca_system_score_gemma":0.0005012068,"threshold_uncertainty_score":0.029904544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6633529,0.00064229424,0.26279953,0.014339887,0.00032976505,0.000055080218,0.00096553756,0.0010551878,0.05645978],"genre_scores_gemma":[0.94985455,0.00038978562,0.03601019,0.001033372,0.00018423331,0.00011092327,0.00057855,0.0002157022,0.011622775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883205,0.00026853842,0.000038395894,0.0004292247,0.00023596745,0.00019588432],"domain_scores_gemma":[0.9899059,0.005896198,0.0005710313,0.0026369672,0.0006694394,0.0003204769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128373,0.0003654752,0.0005946618,0.00052524125,0.001334202,0.001869099,0.0010666979,0.0015879468,0.0071688304],"category_scores_gemma":[0.014233493,0.00045377036,0.0006759843,0.0006297796,0.0028127185,0.008040673,0.0013979658,0.0026556854,0.0010535441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001680356,0.000045642828,0.001997583,0.00008710493,0.000015608566,0.00010967109,0.00031388545,0.011050032,0.003432202,0.96072185,0.00718653,0.014871791],"study_design_scores_gemma":[0.00004004034,0.000048232047,0.0011628065,0.00002777807,0.00001762865,0.00037313002,0.00017451284,0.058682814,0.0045423456,0.9230396,0.011863268,0.000027900729],"about_ca_topic_score_codex":0.001485769,"about_ca_topic_score_gemma":0.0013309942,"teacher_disagreement_score":0.0071688304,"about_ca_system_score_codex":0.0013876203,"about_ca_system_score_gemma":0.0007696549,"threshold_uncertainty_score":0.023982108},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00163082,0.0004458133,0.99328095,0.00057333184,0.000053322066,0.000025138632,0.000020127309,0.00003565445,0.0039349324],"genre_scores_gemma":[0.39205638,0.0031547258,0.5938484,0.0007446506,0.0007121447,0.00044641277,0.00012234393,0.00014173613,0.008773211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811435,0.0010526851,0.000051829007,0.00018544792,0.0004673436,0.00012830531],"domain_scores_gemma":[0.99778014,0.0017277397,0.00013453,0.00013105616,0.00015856541,0.00006794315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018117883,0.0013157813,0.0011435454,0.0009671597,0.00063967414,0.0020912755,0.002011526,0.001955655,0.0026033933],"category_scores_gemma":[0.0050923745,0.00055218756,0.0008157822,0.0018486802,0.0024235821,0.0031378996,0.0019457808,0.0029543696,0.00045140786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004236323,0.000067741974,0.000118474,0.00013498052,0.00004552789,0.00009900468,0.000085698906,0.47718972,0.0010747211,0.48221326,0.0023298077,0.03659876],"study_design_scores_gemma":[0.000016652551,0.000034120072,0.000047316847,0.000028527505,0.000010149798,0.00004582936,0.000025332849,0.8402681,0.0006212494,0.15553828,0.0033488383,0.000015598724],"about_ca_topic_score_codex":0.0011588146,"about_ca_topic_score_gemma":0.0009885756,"teacher_disagreement_score":0.0026033933,"about_ca_system_score_codex":0.0013203871,"about_ca_system_score_gemma":0.0012856777,"threshold_uncertainty_score":0.009581745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09529332,0.00074465515,0.84439063,0.00034015308,0.00052191084,0.00022357666,0.0008684382,0.0013875116,0.05622983],"genre_scores_gemma":[0.36436617,0.00082567736,0.61270785,0.00022913051,0.000069916314,0.00047472777,0.0017605891,0.0005090881,0.019056875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954,0.00009290765,0.000036965383,0.000068378984,0.00019667667,0.00006511142],"domain_scores_gemma":[0.99964964,0.000063998545,0.000036085497,0.000101348,0.00010605985,0.000042874297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002567919,0.0006257494,0.0006301449,0.0009555762,0.0009298128,0.0012970138,0.0009219426,0.00057518954,0.0078122728],"category_scores_gemma":[0.001188404,0.00035959366,0.00070842134,0.0011074435,0.0010121906,0.0014643547,0.0029733062,0.0009101142,0.0022461454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018030747,0.00005165999,0.0011126195,0.00029632144,0.00003266312,0.00054491963,0.00048591362,0.029174192,0.01883416,0.7873815,0.01074384,0.15116194],"study_design_scores_gemma":[0.00008916642,0.00018660456,0.00091097405,0.0001519327,0.00004383439,0.0017107874,0.00066655723,0.25978953,0.038921304,0.4670537,0.23034093,0.00013459325],"about_ca_topic_score_codex":0.0008579419,"about_ca_topic_score_gemma":0.0011021837,"teacher_disagreement_score":0.0078122728,"about_ca_system_score_codex":0.00043789382,"about_ca_system_score_gemma":0.0006356212,"threshold_uncertainty_score":0.02613461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070669213,0.022266159,0.08115156,0.0028874353,0.0029322375,0.00007893767,0.0005381975,0.00027032584,0.8828082],"genre_scores_gemma":[0.13936348,0.027606193,0.07415873,0.0025317867,0.0023985247,0.00025984825,0.00087142375,0.0003706634,0.7524394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996195,0.00010185167,0.000014010785,0.000059009104,0.00015552434,0.000050046616],"domain_scores_gemma":[0.9997812,0.00007676018,0.00002244434,0.00004108355,0.000052034276,0.000026472466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028155235,0.0007724848,0.000478362,0.001291932,0.0014399443,0.0035225716,0.00055531744,0.0010347274,0.032154627],"category_scores_gemma":[0.0009197057,0.00035361623,0.00028707678,0.002532418,0.0022725759,0.0026085614,0.0010263509,0.00236411,0.009815367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011734269,0.000009542432,0.000028555543,0.000061400555,0.0000020779444,0.000019418667,0.00014623025,0.0005148193,0.00034896564,0.9207969,0.033436414,0.044623967],"study_design_scores_gemma":[0.0000041862236,0.000023166827,0.00007517306,0.00008444159,0.000002345575,0.00012238642,0.00013500563,0.0006547923,0.00028203425,0.5339224,0.46468562,0.00000849851],"about_ca_topic_score_codex":0.0014452512,"about_ca_topic_score_gemma":0.0017828319,"teacher_disagreement_score":0.032154627,"about_ca_system_score_codex":0.0013904991,"about_ca_system_score_gemma":0.0008800569,"threshold_uncertainty_score":0.10756791},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21457344,0.002206189,0.27111506,0.0032275028,0.0030864791,0.00019849217,0.0008009647,0.0017567807,0.5030351],"genre_scores_gemma":[0.86689633,0.00095957523,0.069227,0.001501745,0.0007764951,0.00040779167,0.0009985934,0.0010829183,0.05814959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984811,0.00047164786,0.00006512525,0.00028286528,0.0004136852,0.00028557715],"domain_scores_gemma":[0.9981712,0.0005984918,0.00014660806,0.00058057485,0.00024868047,0.00025439987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006858275,0.00076837564,0.00084340264,0.0015596702,0.0028439604,0.0029029024,0.0017343037,0.0012353619,0.029890314],"category_scores_gemma":[0.0043024225,0.00069170963,0.0009611382,0.0009608599,0.0031472503,0.0038721156,0.0031910113,0.002792554,0.003618232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050244704,0.000025727322,0.0002577697,0.00006246546,0.000008762184,0.00014714853,0.00017438293,0.0014099083,0.0011675516,0.9821801,0.0052492293,0.009266607],"study_design_scores_gemma":[0.000022337485,0.000046372355,0.0001773127,0.000044816024,0.000007843588,0.00033932744,0.00016349461,0.009261404,0.0015619105,0.97001046,0.01833359,0.000031125568],"about_ca_topic_score_codex":0.00088728656,"about_ca_topic_score_gemma":0.0013329681,"teacher_disagreement_score":0.029890314,"about_ca_system_score_codex":0.000875932,"about_ca_system_score_gemma":0.0009549942,"threshold_uncertainty_score":0.09999311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5149484,0.00092952145,0.44478464,0.00019315112,0.00017403165,0.000120003315,0.00045130457,0.00047996815,0.037918966],"genre_scores_gemma":[0.9067005,0.0005642954,0.0821999,0.00012838526,0.00016024822,0.0001274513,0.0005115844,0.00020125543,0.00940626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987657,0.0002084739,0.00012197679,0.0002684517,0.00048077825,0.00015464197],"domain_scores_gemma":[0.9953689,0.0019490148,0.0007549469,0.00092232577,0.0007405214,0.00026435245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988362,0.0002865496,0.00031413624,0.0013918158,0.0006428693,0.0012129257,0.0004928396,0.00044542024,0.0032160534],"category_scores_gemma":[0.004890935,0.0002749966,0.0003615854,0.00089436426,0.0011017265,0.0031422535,0.0009583602,0.0008486782,0.0006712995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006069952,0.00011488954,0.0027769578,0.00019928276,0.00002920206,0.00078401715,0.0010793677,0.0085820705,0.072924174,0.81495476,0.0009040572,0.09704429],"study_design_scores_gemma":[0.00006877458,0.00084650714,0.0037914687,0.00017985712,0.000063020525,0.003279652,0.0007402359,0.044260886,0.18481237,0.71984893,0.042022664,0.0000856909],"about_ca_topic_score_codex":0.00015013058,"about_ca_topic_score_gemma":0.00013821217,"teacher_disagreement_score":0.0032160534,"about_ca_system_score_codex":0.0003802329,"about_ca_system_score_gemma":0.00035503157,"threshold_uncertainty_score":0.010758758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25696257,0.000615854,0.11435523,0.0006623217,0.00068258104,0.00014528334,0.001509781,0.0011429065,0.6239235],"genre_scores_gemma":[0.86591065,0.00026448866,0.031233937,0.00023539817,0.00017468867,0.0000954706,0.0015110866,0.00032968298,0.10024469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995403,0.000053260832,0.000018032613,0.00013136676,0.00014055116,0.00011645389],"domain_scores_gemma":[0.99970585,0.000034810844,0.000034783232,0.00008983731,0.00006113614,0.00007348759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014474157,0.0002075278,0.00032705473,0.00061272574,0.0013313233,0.00095020386,0.000517803,0.00042989108,0.03159047],"category_scores_gemma":[0.0006455723,0.000216637,0.00043011838,0.00046376564,0.0013476991,0.0010231945,0.0016692239,0.00076721306,0.003854618],"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.00007073997,0.000012927245,0.00067208125,0.00007563049,0.00000662713,0.00026676495,0.0004360572,0.0016998224,0.0072422526,0.95937914,0.008487659,0.021650221],"study_design_scores_gemma":[0.000043047276,0.00012865153,0.0022700033,0.000059254733,0.000015392221,0.0014856905,0.00081299647,0.011991323,0.008725088,0.5771394,0.39729127,0.00003786745],"about_ca_topic_score_codex":0.001420142,"about_ca_topic_score_gemma":0.0022373397,"teacher_disagreement_score":0.03159047,"about_ca_system_score_codex":0.0005855927,"about_ca_system_score_gemma":0.000316474,"threshold_uncertainty_score":0.105680645},"labels":[],"label_agreement":null},{"id":"W4237281083","doi":"10.1002/(sici)1520-6610(2000)8:1<58::aid-jcd8>3.3.co;2-u","title":"Steiner triple systems with disjoint or intersecting subsystems","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; McMaster University","funders":"","keywords":"Disjoint sets; Steiner system; Mathematics; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.01622461215861664,"score_gpt":0.20769918507483157,"score_spread":0.19147457291621492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237281083","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80268705,0.0006432365,0.17063154,0.00022109992,0.000046683163,0.00005246937,0.0003940814,0.00017677688,0.025147047],"genre_scores_gemma":[0.9700842,0.00021686566,0.026628016,0.000036732483,0.000020043917,0.000045640605,0.00032524517,0.000014598567,0.0026286796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993211,0.00011635621,0.00007523326,0.0001259579,0.00019274322,0.00016856988],"domain_scores_gemma":[0.99816906,0.00057702925,0.00055171637,0.00023824329,0.00025086783,0.00021299082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054659677,0.00039433307,0.0006301249,0.00091599766,0.00091774797,0.001397186,0.00042157873,0.0008486078,0.0043132314],"category_scores_gemma":[0.002393142,0.0006059449,0.0003968157,0.0009530322,0.001115342,0.0020241647,0.0016236594,0.00051972974,0.00041768828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079269684,0.00006670184,0.006569617,0.00031177103,0.000110801346,0.0028127593,0.0011116676,0.123644166,0.039471824,0.77990997,0.0028991443,0.042298913],"study_design_scores_gemma":[0.00017476751,0.0005216569,0.0052985386,0.00015007165,0.00018264249,0.0034914706,0.0018530784,0.33762062,0.029559439,0.60142213,0.019608922,0.000116612835],"about_ca_topic_score_codex":0.0007157431,"about_ca_topic_score_gemma":0.0010908403,"teacher_disagreement_score":0.0043132314,"about_ca_system_score_codex":0.0006312314,"about_ca_system_score_gemma":0.00046369934,"threshold_uncertainty_score":0.014429212},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002861076,0.0035584888,0.0029242774,0.0021631091,0.004704966,0.00009905641,0.0020120884,0.0008168726,0.9834351],"genre_scores_gemma":[0.000720858,0.0016197772,0.00095951784,0.00080566667,0.0006985096,0.000049094662,0.0011558017,0.00022696423,0.99376386],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994677,0.00004373518,0.000017925515,0.00010467389,0.00030743136,0.00005866188],"domain_scores_gemma":[0.9993148,0.00009033937,0.000024157895,0.0000884552,0.00032579742,0.0001564722],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046782548,0.0008459073,0.0006756001,0.0018810772,0.0012477386,0.004415447,0.0014732259,0.0014380731,0.6390733],"category_scores_gemma":[0.0019232404,0.00032236672,0.0005257399,0.0019067543,0.00047885565,0.0032558027,0.002156487,0.0017268797,0.5831566],"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.000016016425,0.00003084148,0.00006026979,0.00012540871,0.000001471307,0.000031709526,0.00007858953,0.00008360836,0.00029863624,0.01770045,0.8418709,0.13970208],"study_design_scores_gemma":[0.0000014658398,0.000004788232,0.000054227807,0.000052364965,6.6108896e-7,0.000025583027,0.000025536228,0.00001763934,0.00004513238,0.0024634749,0.99730706,0.0000020302823],"about_ca_topic_score_codex":0.0018544163,"about_ca_topic_score_gemma":0.003529214,"teacher_disagreement_score":0.3609267,"about_ca_system_score_codex":0.0011266142,"about_ca_system_score_gemma":0.0015916949,"threshold_uncertainty_score":0.5148181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012048599,0.005882292,0.0041735745,0.004868009,0.0035248024,0.0002174981,0.00679185,0.00061941845,0.9727175],"genre_scores_gemma":[0.005704056,0.005530765,0.0031535777,0.0034956327,0.001043308,0.00024265931,0.005474886,0.00032528312,0.97503],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992674,0.0000818817,0.000030845815,0.00019284151,0.00030171545,0.0001253406],"domain_scores_gemma":[0.9990827,0.00013935337,0.000042411993,0.000101196856,0.0003827501,0.00025160206],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007999456,0.0007987604,0.00062216946,0.001462332,0.00151544,0.0035242105,0.0016388546,0.0014054064,0.53746736],"category_scores_gemma":[0.002927397,0.00024269866,0.0004601006,0.001596277,0.00056571607,0.0022999966,0.0019038799,0.0014905419,0.3785197],"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.000098848686,0.00010898002,0.0003719589,0.0003857139,0.000004084843,0.00013830364,0.0003252379,0.00011507665,0.0004456146,0.0701734,0.7435749,0.18425791],"study_design_scores_gemma":[0.0000034731938,0.000011410266,0.00012802794,0.000104279025,0.0000014535372,0.00007457662,0.000056324374,0.000016154232,0.00006635145,0.0045324466,0.99500257,0.0000029186483],"about_ca_topic_score_codex":0.0035910083,"about_ca_topic_score_gemma":0.0047753286,"teacher_disagreement_score":0.46253264,"about_ca_system_score_codex":0.001370973,"about_ca_system_score_gemma":0.0028205186,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4241648996","doi":"10.1002/jcd.1013","title":"Existence of (3, 1, 2)‐conjugate orthogonal diagonal latin squares","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Latin square; Diagonal; Mathematics; Conjugate; Orthogonal array; Combinatorics; Square (algebra); Main diagonal; Statistics; Mathematical analysis; Geometry; Taguchi methods; Chemistry","score_opus":0.024069946551698303,"score_gpt":0.22918974953155238,"score_spread":0.20511980297985408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241648996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7452699,0.0007068785,0.15634836,0.0005253942,0.00020145514,0.000083200095,0.00021823209,0.00020842685,0.09643813],"genre_scores_gemma":[0.96582085,0.00022715941,0.02724714,0.00019960653,0.00006389154,0.000081416234,0.00014733622,0.000038734957,0.006173847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903405,0.00024655825,0.0000693882,0.00020184983,0.00022994602,0.00021822091],"domain_scores_gemma":[0.9968437,0.001228183,0.0008178315,0.0003494656,0.0004984341,0.00026246623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005251309,0.00044098042,0.00034186218,0.0014850688,0.0009849013,0.0019611013,0.00036560814,0.00079534744,0.0067875884],"category_scores_gemma":[0.003216287,0.00038702632,0.00028035048,0.0009086308,0.0017328358,0.001335411,0.0015060209,0.0006036682,0.0010700567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003928443,0.000080646816,0.0035566858,0.000114630326,0.000023987226,0.0009849711,0.0007639162,0.0033856395,0.05441447,0.8868428,0.0020008562,0.047438484],"study_design_scores_gemma":[0.00014262454,0.0003697576,0.0031812068,0.00016704501,0.000042689222,0.0043863324,0.001053463,0.03767751,0.07139612,0.84739935,0.034063052,0.00012085679],"about_ca_topic_score_codex":0.00018358963,"about_ca_topic_score_gemma":0.0002308188,"teacher_disagreement_score":0.0067875884,"about_ca_system_score_codex":0.00034078638,"about_ca_system_score_gemma":0.00042274318,"threshold_uncertainty_score":0.022706807},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070622563,0.0013182573,0.16889669,0.0007916067,0.0011567301,0.00005656697,0.00032445908,0.00060908415,0.8197844],"genre_scores_gemma":[0.14063844,0.0028929259,0.08511824,0.0011846948,0.00062113506,0.00011284763,0.0012851772,0.0019536961,0.76619285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999833,0.00002471816,0.0000061855185,0.000045645076,0.0000635267,0.000026930775],"domain_scores_gemma":[0.9998543,0.00002123832,0.000007389295,0.000045084533,0.000052596286,0.000019355644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017893275,0.00074504036,0.00048792988,0.00068989943,0.00094849383,0.0016084258,0.0007023166,0.0006897338,0.037678834],"category_scores_gemma":[0.00044783807,0.0003213915,0.0005600295,0.00051115535,0.0010797889,0.0019430537,0.0011260723,0.0019579188,0.020875784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013506541,0.0000166928,0.000027724833,0.00007553566,0.0000062196214,0.0000325519,0.00008895074,0.0010010004,0.0018533041,0.93214977,0.026563413,0.03817138],"study_design_scores_gemma":[0.0000048261027,0.000010470363,0.000093651106,0.00005021381,0.0000065475197,0.00015562361,0.000066144064,0.0035931307,0.0015290895,0.8424435,0.15203543,0.000011250385],"about_ca_topic_score_codex":0.0007260204,"about_ca_topic_score_gemma":0.0010192813,"teacher_disagreement_score":0.037678834,"about_ca_system_score_codex":0.0005456359,"about_ca_system_score_gemma":0.00051419635,"threshold_uncertainty_score":0.12604827},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001894351,0.60306484,0.031125605,0.0074974997,0.008341264,0.00024004471,0.0021692924,0.00057742716,0.34508958],"genre_scores_gemma":[0.03671516,0.7652435,0.01802815,0.005947661,0.007467559,0.00037966832,0.0045446656,0.00050549285,0.16116816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986206,0.0003017693,0.000085681524,0.00020713436,0.0006978422,0.00008689728],"domain_scores_gemma":[0.9971763,0.000991688,0.00019102472,0.00035410494,0.0011144219,0.0001724136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011831576,0.0010865233,0.0011581166,0.00398363,0.0005764359,0.002373936,0.0015095256,0.0011649416,0.08560733],"category_scores_gemma":[0.0059302207,0.0004232121,0.00088562554,0.0054319208,0.0009379033,0.0029356692,0.0009791235,0.0014362794,0.03344306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043607684,0.000034466786,0.0002608444,0.0041442667,0.000104713596,0.00006729824,0.000060746275,0.0008463904,0.0006417606,0.095289804,0.38398215,0.5145239],"study_design_scores_gemma":[0.000007651229,0.000023528904,0.00021398433,0.00080261123,0.000029550105,0.00020012907,0.000028117129,0.00010920519,0.00024548214,0.020929221,0.97740084,0.000009649625],"about_ca_topic_score_codex":0.0013538284,"about_ca_topic_score_gemma":0.002459908,"teacher_disagreement_score":0.08560733,"about_ca_system_score_codex":0.0021818557,"about_ca_system_score_gemma":0.0016281233,"threshold_uncertainty_score":0.286385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045157378,0.0004859312,0.99209905,0.00014282572,0.000055834575,0.000024445111,0.00000836676,0.0000665227,0.0026012298],"genre_scores_gemma":[0.20126005,0.0012169316,0.7906084,0.00016809833,0.000110441935,0.00016757238,0.000046515153,0.00010694052,0.0063150777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993793,0.00028383482,0.0000505632,0.000087644854,0.00016256756,0.000036036912],"domain_scores_gemma":[0.9989009,0.0005694309,0.000076032666,0.00013544969,0.00026659,0.000051537118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014133791,0.0008405357,0.0007980867,0.0012449659,0.0005363267,0.00074336736,0.0010768494,0.0011390162,0.0023350937],"category_scores_gemma":[0.0042924127,0.0003981846,0.0013385898,0.00070881675,0.0018252314,0.0018233671,0.0020333717,0.0018669199,0.00059346796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007605651,0.000050851504,0.000649842,0.00038162112,0.000071869785,0.00025624913,0.00044567123,0.19631664,0.014848135,0.6639591,0.0017399957,0.12120395],"study_design_scores_gemma":[0.000015936008,0.00008997695,0.00015738583,0.00004526103,0.000009835995,0.00018333184,0.00004305341,0.8653429,0.004234375,0.122398324,0.0074484395,0.000031142506],"about_ca_topic_score_codex":0.0012064829,"about_ca_topic_score_gemma":0.00081785093,"teacher_disagreement_score":0.0023350937,"about_ca_system_score_codex":0.00058385363,"about_ca_system_score_gemma":0.00069413247,"threshold_uncertainty_score":0.0078116655},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10985384,0.0027841674,0.81609213,0.0011312031,0.0001468397,0.00023486586,0.0024789032,0.0007295121,0.06654842],"genre_scores_gemma":[0.72512877,0.0038800037,0.22782741,0.00052735297,0.0004686877,0.0006032855,0.004891506,0.0005418197,0.03613118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988739,0.00027013556,0.000055899472,0.00019455985,0.0003792973,0.00022626318],"domain_scores_gemma":[0.99569017,0.002427762,0.00049787917,0.00047582868,0.00074504316,0.00016321988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843598,0.00061445846,0.0007621054,0.0015408281,0.0010623251,0.00198568,0.0010390359,0.0011617773,0.006958601],"category_scores_gemma":[0.00673273,0.00051666907,0.00044031173,0.0020802498,0.0014622938,0.0027740349,0.0009124172,0.0017705061,0.001859292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031783056,0.000057426703,0.00070309994,0.00023031136,0.00002938024,0.00013196815,0.00024223057,0.18374933,0.011489099,0.7457184,0.006596102,0.050734706],"study_design_scores_gemma":[0.000044454027,0.000129929,0.00046446596,0.000073641,0.00001454913,0.00011304071,0.00004187755,0.24616618,0.004520007,0.7416956,0.0067007337,0.00003555793],"about_ca_topic_score_codex":0.0039024819,"about_ca_topic_score_gemma":0.0039375406,"teacher_disagreement_score":0.006958601,"about_ca_system_score_codex":0.001976025,"about_ca_system_score_gemma":0.0015803702,"threshold_uncertainty_score":0.023278832},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004023247,0.020160606,0.0023434963,0.116236165,0.48697692,0.00019896659,0.0015589985,0.00080671394,0.3713158],"genre_scores_gemma":[0.0018735034,0.0053273253,0.00071220624,0.039829344,0.066754095,0.00012940532,0.00095562433,0.00053234684,0.88388616],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988871,0.00014583924,0.00005671698,0.00017360014,0.0006049108,0.00013184917],"domain_scores_gemma":[0.9952501,0.0007165888,0.00022528628,0.00032569253,0.0022541792,0.0012280974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013029092,0.0009864926,0.0009018132,0.0018269462,0.0018566436,0.004633998,0.0013486395,0.0031912813,0.36306444],"category_scores_gemma":[0.010603975,0.000269399,0.0005828381,0.001068407,0.00082936947,0.0029272595,0.0026104853,0.0044272556,0.3933385],"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.000010463598,0.000005946374,0.000017301709,0.000045599718,0.0000011601044,0.000015338219,0.000009119804,0.00000889145,0.000061694234,0.0018251467,0.9774383,0.020561168],"study_design_scores_gemma":[0.0000034334676,0.0000071486083,0.0000521687,0.00007645577,0.00000139816,0.000036661146,0.000015239646,0.000010678245,0.000048017722,0.0013874521,0.998359,0.0000024176704],"about_ca_topic_score_codex":0.0016664584,"about_ca_topic_score_gemma":0.0031468107,"teacher_disagreement_score":0.36306444,"about_ca_system_score_codex":0.0017745711,"about_ca_system_score_gemma":0.0026672906,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5618639,0.0010063715,0.41693237,0.00070490275,0.00012543208,0.0001058196,0.00040234,0.00041784227,0.018440897],"genre_scores_gemma":[0.9140528,0.00027398614,0.082715474,0.00014654544,0.000053263462,0.00008190186,0.00039597147,0.00005412082,0.002225918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936944,0.00012206309,0.00005295637,0.00010508898,0.00024892724,0.00010152542],"domain_scores_gemma":[0.99867404,0.0003439107,0.00037126013,0.00029920854,0.00021554122,0.000096237185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004854468,0.00047747296,0.000777363,0.0011620297,0.00077987905,0.0014917352,0.00087456935,0.0007095213,0.0011908794],"category_scores_gemma":[0.0025786588,0.0004112508,0.000488978,0.00066045125,0.000707342,0.0015967161,0.00084619917,0.0006136403,0.00022645466],"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.0007562519,0.00028701278,0.0026841878,0.00032873213,0.00014361509,0.00042095993,0.0004268317,0.46440223,0.05741818,0.35263804,0.006696795,0.11379716],"study_design_scores_gemma":[0.00009699706,0.00021825336,0.0014648486,0.000089452784,0.00007011125,0.00041278725,0.00010244042,0.60624534,0.032503087,0.34917247,0.009560475,0.0000637189],"about_ca_topic_score_codex":0.0004918456,"about_ca_topic_score_gemma":0.000526834,"teacher_disagreement_score":0.0014917352,"about_ca_system_score_codex":0.0009928145,"about_ca_system_score_gemma":0.00044182685,"threshold_uncertainty_score":0.0072034597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082914986,0.0011978283,0.83643687,0.00037340916,0.0004058006,0.00017379537,0.00026943837,0.0010545077,0.077173285],"genre_scores_gemma":[0.7103198,0.00059137447,0.25361577,0.00035389262,0.00015457344,0.00018854105,0.0002837869,0.00018133235,0.0343109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930894,0.00011402499,0.000029527679,0.00023539602,0.00020413483,0.000107885055],"domain_scores_gemma":[0.9992867,0.00013561966,0.000065798515,0.0002731604,0.00018632205,0.0000524359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003619879,0.0004062612,0.00035102793,0.00045621846,0.0003261157,0.00088993623,0.0004407256,0.00061885547,0.008137307],"category_scores_gemma":[0.0009964491,0.00022070084,0.0004308209,0.00044054684,0.00046381608,0.00071713055,0.0005200454,0.0005039347,0.0015490169],"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.0006022205,0.00013564156,0.0014458562,0.00040093675,0.00008425976,0.00033208437,0.0002833507,0.05936535,0.14158036,0.1953326,0.011279092,0.5891583],"study_design_scores_gemma":[0.00017080981,0.0017594505,0.0026329265,0.0001861978,0.00018694066,0.0025851254,0.00018779164,0.41198063,0.1942271,0.15811464,0.22786663,0.00010178594],"about_ca_topic_score_codex":0.00030027263,"about_ca_topic_score_gemma":0.00040696238,"teacher_disagreement_score":0.008137307,"about_ca_system_score_codex":0.0005144662,"about_ca_system_score_gemma":0.00033954883,"threshold_uncertainty_score":0.027222037},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009883468,0.013502666,0.7088017,0.0019069095,0.0016817676,0.00031060912,0.0007128584,0.0043474776,0.25885245],"genre_scores_gemma":[0.30099064,0.017612468,0.2859362,0.0011257465,0.0013855417,0.0006607507,0.0025323378,0.0007097919,0.38904652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957925,0.000060901286,0.00002487214,0.00007986785,0.00020769655,0.00004734347],"domain_scores_gemma":[0.9996068,0.00011308764,0.000019229637,0.00009154614,0.00013638331,0.000032926735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040374283,0.000604241,0.00062776636,0.0006913896,0.00086040044,0.0025404645,0.001333452,0.00078915956,0.016054753],"category_scores_gemma":[0.0011014154,0.00043869665,0.0003358811,0.0012409325,0.0007174364,0.0019428873,0.0010878625,0.0011958219,0.0059643444],"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.00006526617,0.00011238215,0.00028529286,0.00023525878,0.00002496701,0.00010758223,0.00022680071,0.018443605,0.0063737025,0.6821793,0.056910187,0.23503557],"study_design_scores_gemma":[0.000033607197,0.000065826694,0.00037383343,0.00009697874,0.000030804837,0.0002495618,0.00007630628,0.118195355,0.004279252,0.46273988,0.4138188,0.00003970499],"about_ca_topic_score_codex":0.0015975914,"about_ca_topic_score_gemma":0.0018347525,"teacher_disagreement_score":0.016054753,"about_ca_system_score_codex":0.0011114924,"about_ca_system_score_gemma":0.0012226787,"threshold_uncertainty_score":0.053708494},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014105512,0.002753026,0.11307157,0.0016483732,0.0008069311,0.00011627018,0.0012448485,0.0005100839,0.86574346],"genre_scores_gemma":[0.25171605,0.0052831257,0.12259382,0.0013649876,0.0009912736,0.00038923125,0.0048491415,0.0013100188,0.6115024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965084,0.000057164947,0.00001662112,0.00010278951,0.00010545635,0.00006716408],"domain_scores_gemma":[0.9997441,0.000063519234,0.000016796863,0.000051216135,0.000077237644,0.000047093054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002704967,0.0008818472,0.0007922873,0.0017616911,0.0017926225,0.0031616825,0.0008890002,0.00065596227,0.039971847],"category_scores_gemma":[0.00084096025,0.0006524809,0.00086198706,0.0016895956,0.001549219,0.003486859,0.0020749844,0.0031657955,0.010669183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019287636,0.000016014857,0.000040097766,0.00007746721,0.000006290101,0.000023131704,0.00021929928,0.00023048258,0.0007563008,0.9480247,0.020884918,0.029701954],"study_design_scores_gemma":[0.0000064226733,0.0000070826422,0.00007796604,0.000033811055,0.000007695413,0.00007696876,0.00011440916,0.00045310953,0.00040703878,0.9140278,0.084782936,0.0000048297215],"about_ca_topic_score_codex":0.00071662496,"about_ca_topic_score_gemma":0.001148051,"teacher_disagreement_score":0.039971847,"about_ca_system_score_codex":0.0011805401,"about_ca_system_score_gemma":0.0006062814,"threshold_uncertainty_score":0.1337192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014378736,0.009182074,0.024680406,0.0041105156,0.0022532209,0.000022798788,0.00024169832,0.0001614249,0.95790994],"genre_scores_gemma":[0.04395706,0.010302573,0.017612973,0.0041747354,0.0029737784,0.00013418391,0.0004209284,0.0004739468,0.91994977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996555,0.000119287266,0.000013858068,0.00007750269,0.00009405824,0.000039880586],"domain_scores_gemma":[0.9997532,0.00010767342,0.000017553097,0.000055352688,0.000047641835,0.000018569406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003184926,0.0006858603,0.00038483005,0.0012871283,0.002123256,0.0043023997,0.00076618436,0.0012200954,0.047730062],"category_scores_gemma":[0.00093350274,0.0003265939,0.0004354672,0.0021891075,0.003690403,0.004724186,0.0013811376,0.0030980383,0.019361887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025435754,0.0000039793845,0.000020657862,0.00003431123,0.0000011157623,0.000013077848,0.00011331883,0.00008959659,0.000092932416,0.95257014,0.033641607,0.013416734],"study_design_scores_gemma":[0.0000013750055,0.000002922408,0.000045802477,0.000030333294,0.00000162172,0.00007400302,0.00005443932,0.00013150636,0.00010461988,0.45199692,0.5475528,0.0000035674116],"about_ca_topic_score_codex":0.0024900767,"about_ca_topic_score_gemma":0.0040402818,"teacher_disagreement_score":0.047730062,"about_ca_system_score_codex":0.0023244063,"about_ca_system_score_gemma":0.00081656297,"threshold_uncertainty_score":0.15967298},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031604547,0.0005282755,0.96230453,0.00024702793,0.00017417023,0.00012604553,0.00011341701,0.00079825893,0.004103614],"genre_scores_gemma":[0.6528506,0.0007827914,0.33150914,0.00052632124,0.00021014726,0.00023024694,0.00038338333,0.000085323176,0.013422093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993463,0.000105847335,0.000032049644,0.00011533554,0.00030735033,0.00009303939],"domain_scores_gemma":[0.99904865,0.00026825082,0.0001237387,0.00024252014,0.0002560175,0.00006081836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000471883,0.0006516715,0.0006695425,0.0007916126,0.00051078154,0.0006087355,0.0009767411,0.0009329062,0.0021579044],"category_scores_gemma":[0.0017333745,0.00021351303,0.0003628828,0.0007745011,0.0006388632,0.0009712897,0.0014212838,0.0009832222,0.0008324292],"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.0010325081,0.00015380766,0.0009004201,0.00021316714,0.00010704696,0.00051147136,0.00029893397,0.066616565,0.35713944,0.07941204,0.0061259866,0.4874887],"study_design_scores_gemma":[0.00010465554,0.00041029122,0.0005649985,0.000050058312,0.0000680109,0.0009945704,0.000039854927,0.8744775,0.10073991,0.010695179,0.011770707,0.00008428908],"about_ca_topic_score_codex":0.0014362151,"about_ca_topic_score_gemma":0.0014657254,"teacher_disagreement_score":0.0021579044,"about_ca_system_score_codex":0.0004929625,"about_ca_system_score_gemma":0.000955118,"threshold_uncertainty_score":0.0072188973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14326532,0.0013277782,0.22950427,0.0039264536,0.00029225976,0.00012631378,0.0010607021,0.0004452266,0.6200516],"genre_scores_gemma":[0.7816141,0.0016749728,0.044455715,0.00037811973,0.0002691313,0.00018162308,0.0012605158,0.00036812734,0.16979767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989281,0.00025548763,0.000039074734,0.00027491286,0.00035397176,0.00014835587],"domain_scores_gemma":[0.9958806,0.002162598,0.00032111013,0.0008521089,0.0004959554,0.00028751258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083050784,0.0007928254,0.00087707746,0.0019054327,0.0026022496,0.0052421275,0.0010232243,0.0010290409,0.033907738],"category_scores_gemma":[0.0041477047,0.0005422413,0.0007775405,0.0020710297,0.0031554936,0.0054689324,0.0022483296,0.004062288,0.0028149209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055420336,0.00005357168,0.00023450844,0.000049873288,0.000008611707,0.000047592144,0.00013128275,0.0049092537,0.00046902246,0.96916294,0.004895571,0.0199823],"study_design_scores_gemma":[0.000018667966,0.000013251174,0.00016803623,0.000030166912,0.000007804456,0.00009016256,0.0001061366,0.014836735,0.00091648696,0.9689348,0.0148677975,0.000009889864],"about_ca_topic_score_codex":0.0016560899,"about_ca_topic_score_gemma":0.0018047523,"teacher_disagreement_score":0.033907738,"about_ca_system_score_codex":0.0021991262,"about_ca_system_score_gemma":0.0010558632,"threshold_uncertainty_score":0.113432705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86878586,0.0004955229,0.108838834,0.0003398499,0.000033140237,0.000074813914,0.00078047154,0.00028932662,0.020362215],"genre_scores_gemma":[0.96998703,0.00026588276,0.02669999,0.000079934565,0.000053070307,0.00006982191,0.0006757146,0.00008752076,0.0020810051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999382,0.00015108156,0.000029981567,0.00014017551,0.00015170343,0.00014497965],"domain_scores_gemma":[0.996548,0.0017826551,0.000536239,0.00032181139,0.00037884887,0.0004324424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077761716,0.00047308864,0.00042568834,0.0037075733,0.0011439512,0.0017427083,0.0005588532,0.00043282102,0.0044382215],"category_scores_gemma":[0.0036539189,0.0004485635,0.00036447938,0.0016189644,0.0017820649,0.0020151993,0.0010581007,0.0007595913,0.0003428034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079339585,0.00018374219,0.008017677,0.00014173928,0.000056039644,0.0002845095,0.0009850091,0.06679831,0.027391331,0.8421845,0.0063781734,0.046785545],"study_design_scores_gemma":[0.00007406667,0.00008656688,0.0033081577,0.000067614994,0.000027609522,0.00031526797,0.00036081488,0.19871426,0.004762866,0.787275,0.0049684662,0.00003940019],"about_ca_topic_score_codex":0.0028505616,"about_ca_topic_score_gemma":0.002349138,"teacher_disagreement_score":0.0044382215,"about_ca_system_score_codex":0.0017399348,"about_ca_system_score_gemma":0.00058147364,"threshold_uncertainty_score":0.014847338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11647369,0.008116546,0.47715905,0.20641236,0.0028380705,0.00012844255,0.0006790387,0.00019848716,0.18799429],"genre_scores_gemma":[0.9169845,0.0018897289,0.047010608,0.010677259,0.0026852496,0.0002621744,0.00021833266,0.000117959135,0.020154119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740607,0.0011405869,0.0001387214,0.00070350023,0.00046650562,0.00014450726],"domain_scores_gemma":[0.9705964,0.024957879,0.0006279649,0.0022157922,0.0012818788,0.00032013902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072302613,0.00062665687,0.0012122511,0.0014560194,0.0028676235,0.0042795576,0.0021299375,0.0050651864,0.0058347527],"category_scores_gemma":[0.03850051,0.0005879483,0.0012636501,0.0015576489,0.023512233,0.019713487,0.0035529598,0.0070350603,0.0004861382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001274771,0.0000051329953,0.00006899955,0.000013548957,0.000003644608,0.000009645115,0.00017789373,0.00024226816,0.00004524018,0.9960652,0.0011732994,0.0021823628],"study_design_scores_gemma":[0.00000326227,0.0000020104396,0.000053490203,0.0000052269666,9.385602e-7,0.000007251971,0.000033126056,0.00033200678,0.00002242118,0.9987447,0.0007918348,0.0000036487916],"about_ca_topic_score_codex":0.0035866634,"about_ca_topic_score_gemma":0.0011727448,"teacher_disagreement_score":0.0072302613,"about_ca_system_score_codex":0.0032464077,"about_ca_system_score_gemma":0.0010737727,"threshold_uncertainty_score":0.03823775},"labels":[],"label_agreement":null},{"id":"W4256391099","doi":"10.1002/jcd.20262","title":"Octahedral designs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Winnipeg","funders":"","keywords":"Octahedron; Mathematics; Combinatorics; Order (exchange); Annals; Crystallography; Crystal structure; Chemistry; Classics","score_opus":0.015957315847465344,"score_gpt":0.22547883673295072,"score_spread":0.20952152088548537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256391099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18508852,0.0016048667,0.52719736,0.00060898444,0.001007295,0.0006735805,0.0011560959,0.0008098229,0.2818536],"genre_scores_gemma":[0.67591995,0.0012811661,0.27191672,0.00064437295,0.00022743737,0.00060946925,0.0012768379,0.00019829875,0.047925748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987142,0.00029575994,0.000121741556,0.00021650067,0.0004108353,0.00024088171],"domain_scores_gemma":[0.99883765,0.00015813016,0.00022005534,0.00026174844,0.00036180174,0.00016058834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045666468,0.00054577715,0.00054271624,0.0014021212,0.001042679,0.001960775,0.00065816817,0.00069360476,0.0138579],"category_scores_gemma":[0.0014982134,0.00040789414,0.0005303199,0.0011829422,0.0010758938,0.001183109,0.0014907811,0.0008207717,0.0027667366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000282683,0.00013437888,0.0011260804,0.00023239857,0.000035939076,0.00024763672,0.0002725069,0.009264975,0.011764146,0.865911,0.006901283,0.10382696],"study_design_scores_gemma":[0.00022681402,0.0007429052,0.0007745219,0.00027493812,0.00008028436,0.0013001391,0.00065074157,0.031749938,0.016446093,0.6337512,0.31392613,0.00007635819],"about_ca_topic_score_codex":0.00056328037,"about_ca_topic_score_gemma":0.0009782638,"teacher_disagreement_score":0.0138579,"about_ca_system_score_codex":0.00058416004,"about_ca_system_score_gemma":0.0005999194,"threshold_uncertainty_score":0.0463593},"labels":[],"label_agreement":null},{"id":"W4280564734","doi":"10.1002/jcd.21844","title":"An update on the existence of Kirkman triple systems with steiner triple systems as subdesigns","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner system; Mathematics; Triple system; Order (exchange); Combinatorics; Combinatorial design; Frame (networking); Triple play (telecommunications); Discrete mathematics; Pure mathematics; Computer science; Telecommunications","score_opus":0.019704813476672075,"score_gpt":0.22005683289197553,"score_spread":0.20035201941530345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280564734","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1244937,0.055466224,0.31976226,0.015628042,0.011361556,0.000120559016,0.00094005873,0.0012408284,0.47098678],"genre_scores_gemma":[0.66918284,0.03434389,0.241547,0.003320238,0.0056661367,0.000114944174,0.0010606012,0.0005133961,0.044250965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986511,0.00029489855,0.00018974394,0.00033051777,0.00038770118,0.00014601045],"domain_scores_gemma":[0.9963194,0.0020025054,0.00023129972,0.0006411716,0.0006432037,0.00016237568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019749496,0.000424962,0.00061498047,0.002101212,0.0016635497,0.0033459046,0.0011418201,0.0014942104,0.008653565],"category_scores_gemma":[0.0052914163,0.00072937785,0.00055080216,0.002636705,0.0028653406,0.007916192,0.0017630871,0.0034164512,0.0015949217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090566304,0.000035261393,0.00046293729,0.00047890388,0.000010374921,0.00021531263,0.00046582808,0.001594192,0.0017617006,0.8943372,0.010970162,0.08957752],"study_design_scores_gemma":[0.00001616168,0.00012518787,0.00035690097,0.00044734596,0.000034507397,0.0012129241,0.00036733338,0.0053510615,0.0059401924,0.33957395,0.64649576,0.00007874318],"about_ca_topic_score_codex":0.00072379457,"about_ca_topic_score_gemma":0.0009909454,"teacher_disagreement_score":0.008653565,"about_ca_system_score_codex":0.0021663113,"about_ca_system_score_gemma":0.00095880777,"threshold_uncertainty_score":0.028949022},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80319136,0.0011520142,0.13638864,0.00064802903,0.00026971058,0.00011666263,0.00049708673,0.0004009747,0.057335455],"genre_scores_gemma":[0.92846215,0.00033884987,0.059153505,0.00014704074,0.00007346826,0.00007020427,0.00043291846,0.00004323934,0.011278625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.000094787305,0.000024648816,0.000083560044,0.00018332028,0.000070276496],"domain_scores_gemma":[0.9993637,0.00020219065,0.0001015844,0.00012691003,0.000110810564,0.000094812945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034523002,0.00040119025,0.00032761303,0.0008508632,0.00094466907,0.00089498225,0.00048730752,0.0006827595,0.0048671425],"category_scores_gemma":[0.0011336991,0.00032411743,0.0005190421,0.000475779,0.0009415236,0.0012093494,0.0008551763,0.0008022797,0.0006737499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027706331,0.00008254062,0.0027868939,0.00022347135,0.000030471372,0.0013688157,0.0007270369,0.00850573,0.03899666,0.9042468,0.0027028676,0.04005161],"study_design_scores_gemma":[0.00016110968,0.00068930996,0.0039518583,0.0001220713,0.000064913795,0.0056690793,0.00059426937,0.102720656,0.13803998,0.6713305,0.076472275,0.00018395566],"about_ca_topic_score_codex":0.00029072684,"about_ca_topic_score_gemma":0.00031472827,"teacher_disagreement_score":0.0048671425,"about_ca_system_score_codex":0.00067491084,"about_ca_system_score_gemma":0.0004277289,"threshold_uncertainty_score":0.0162822},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15901169,0.0003509841,0.7529369,0.0008792399,0.00020896946,0.00022386911,0.00030614863,0.00059310836,0.08548909],"genre_scores_gemma":[0.6117988,0.00040211453,0.35087988,0.0005629764,0.000107551314,0.00046642547,0.00040497415,0.00018357665,0.035193663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987978,0.00049215544,0.000061589664,0.0001687706,0.0002913484,0.00018841802],"domain_scores_gemma":[0.99842936,0.0005703363,0.00014405418,0.00045014318,0.00022499198,0.00018112731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011948592,0.00075456314,0.0007086476,0.0015346709,0.0013484458,0.0021139213,0.001053631,0.0012583702,0.00930649],"category_scores_gemma":[0.0027755431,0.00068591215,0.000894282,0.0012792203,0.0014188341,0.001630732,0.0027494426,0.0018685769,0.0020631903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000847387,0.00003110289,0.0001942765,0.000038165523,0.000013147079,0.000076518096,0.00020716294,0.0021996563,0.0042833583,0.97740376,0.0010566816,0.014411301],"study_design_scores_gemma":[0.00011743193,0.00013392781,0.00019078032,0.00006451421,0.00003270893,0.00030922642,0.00014508088,0.021303382,0.010011816,0.94657284,0.021081671,0.000036642257],"about_ca_topic_score_codex":0.00022143603,"about_ca_topic_score_gemma":0.0004907231,"teacher_disagreement_score":0.00930649,"about_ca_system_score_codex":0.0008647532,"about_ca_system_score_gemma":0.000838533,"threshold_uncertainty_score":0.031133294},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2563803,0.00065362867,0.6711605,0.0015701682,0.00042939704,0.00009429794,0.0011585082,0.0009958979,0.06755728],"genre_scores_gemma":[0.6477443,0.00033718118,0.33881575,0.00026996832,0.0001064127,0.00012880444,0.0011301935,0.00017807113,0.01128938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994566,0.00012369269,0.00002923144,0.0000844009,0.00017749297,0.00012866214],"domain_scores_gemma":[0.99949205,0.00018725822,0.00003245314,0.000116626434,0.00009846242,0.0000731677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562604,0.00037313378,0.00054136314,0.0007525274,0.00080573803,0.0020809784,0.00072086893,0.0005901221,0.006538739],"category_scores_gemma":[0.0023337023,0.00029235508,0.000480021,0.0007347637,0.0012070391,0.0019127906,0.0018408097,0.001272052,0.0019348586],"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.00017902456,0.00010418039,0.0007083395,0.00010645789,0.00002071911,0.00017993721,0.00026748097,0.025519522,0.005905321,0.9094459,0.008657013,0.048906084],"study_design_scores_gemma":[0.000050960512,0.000054881606,0.00009601601,0.000037769718,0.0000055676983,0.00009663692,0.00022528124,0.07963671,0.0028385338,0.9068647,0.010070916,0.000021947504],"about_ca_topic_score_codex":0.00094483054,"about_ca_topic_score_gemma":0.0017718821,"teacher_disagreement_score":0.006538739,"about_ca_system_score_codex":0.00054831983,"about_ca_system_score_gemma":0.00058394624,"threshold_uncertainty_score":0.021874309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.636625,0.0015955043,0.2877714,0.0011138172,0.00039146194,0.00008304349,0.000547762,0.00088584796,0.07098611],"genre_scores_gemma":[0.9327906,0.00044977435,0.057140123,0.00022722484,0.000061997365,0.00006668399,0.00030447883,0.000106974934,0.008852133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924695,0.0001620764,0.000039928436,0.00017993373,0.00017734001,0.00019381917],"domain_scores_gemma":[0.9981389,0.0007728514,0.00028308184,0.00045126368,0.00017013599,0.00018371156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034858083,0.0002483487,0.00048210516,0.0005519731,0.00084649754,0.0015279504,0.00066204095,0.0006162311,0.0068285386],"category_scores_gemma":[0.0042499737,0.00049109536,0.0002766254,0.0007943427,0.0014297639,0.0020451264,0.0018100291,0.0012212098,0.001081623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007775887,0.000067435736,0.004252156,0.00019519952,0.000021104017,0.0007113486,0.0008838725,0.09487234,0.016190495,0.8048635,0.0062787463,0.070886165],"study_design_scores_gemma":[0.00015916617,0.00017272662,0.0021651182,0.00009264754,0.000021399375,0.00062971073,0.0008977105,0.23565668,0.012733621,0.7286861,0.018724319,0.00006094109],"about_ca_topic_score_codex":0.00222566,"about_ca_topic_score_gemma":0.0016878215,"teacher_disagreement_score":0.0068285386,"about_ca_system_score_codex":0.00074506877,"about_ca_system_score_gemma":0.00032836036,"threshold_uncertainty_score":0.022843778},"labels":[],"label_agreement":null},{"id":"W4287307773","doi":"10.1002/jcd.21851","title":"Extended near Skolem sequences, Part III","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Memorial University of Newfoundland; Mount Allison University","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Integer (computer science); Order (exchange); Construct (python library); Computer science","score_opus":0.01655865879486378,"score_gpt":0.21834247106184484,"score_spread":0.20178381226698106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287307773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2860245,0.0018262842,0.5059542,0.00052273244,0.0016883459,0.00028718647,0.0008220701,0.0006084071,0.2022662],"genre_scores_gemma":[0.8338072,0.0010249875,0.10041005,0.0005515042,0.0004680484,0.00020492263,0.0012452079,0.00022340534,0.062064633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950576,0.00010214074,0.000049669216,0.0000987746,0.00016546508,0.000078161735],"domain_scores_gemma":[0.99919003,0.00014068921,0.00011325609,0.00018899693,0.0002620184,0.000104989274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052910385,0.00051584456,0.00034160298,0.0007425355,0.0006047241,0.0011179737,0.00036672517,0.00044894166,0.0061132503],"category_scores_gemma":[0.0012610664,0.00019268607,0.00044442213,0.00045318378,0.0009331218,0.0009104845,0.00067695836,0.00084133854,0.0020935147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022785904,0.000076253375,0.0006740631,0.00016196765,0.000017546156,0.00033407297,0.00030520494,0.009939346,0.03527657,0.9045656,0.0047306223,0.04369094],"study_design_scores_gemma":[0.000027571365,0.00049292756,0.0014427245,0.00021931482,0.000029329949,0.0012003847,0.00029478053,0.051723905,0.03951328,0.7982074,0.10676484,0.000083630184],"about_ca_topic_score_codex":0.00029565196,"about_ca_topic_score_gemma":0.00033068034,"teacher_disagreement_score":0.0061132503,"about_ca_system_score_codex":0.00045857945,"about_ca_system_score_gemma":0.0005658684,"threshold_uncertainty_score":0.02045089},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19814451,0.0004315403,0.7646071,0.00031099466,0.00007040558,0.0001445162,0.00053449586,0.00043762353,0.035318874],"genre_scores_gemma":[0.6152725,0.0006537553,0.359818,0.00026386935,0.0000633448,0.00022522928,0.0014040242,0.00020513697,0.022094127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.000048607388,0.00001596992,0.00010142375,0.00007226928,0.00007445115],"domain_scores_gemma":[0.99942684,0.00014315415,0.00010676132,0.00017303361,0.00006616292,0.00008416272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002552774,0.0005748242,0.00026662656,0.00088929164,0.0007332357,0.0009577879,0.00056962954,0.00042690765,0.0048996876],"category_scores_gemma":[0.00083499873,0.00041815662,0.00090285175,0.0006098467,0.0007082694,0.0016612926,0.0011821357,0.001432257,0.0007131847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017099667,0.00011257783,0.0010418925,0.00023792828,0.00004469721,0.00048137648,0.0009059208,0.04888271,0.039075512,0.805973,0.0056188703,0.0974545],"study_design_scores_gemma":[0.000050257844,0.0001206351,0.0015228147,0.00010811548,0.0000500506,0.00061470264,0.00043561583,0.16398932,0.023113627,0.77493507,0.03499302,0.00006678369],"about_ca_topic_score_codex":0.0017644966,"about_ca_topic_score_gemma":0.0037126036,"teacher_disagreement_score":0.0048996876,"about_ca_system_score_codex":0.00071577623,"about_ca_system_score_gemma":0.00045641788,"threshold_uncertainty_score":0.016391039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151984235,0.00020702888,0.9824354,0.00011454655,0.00007686582,0.00011767577,0.000031065127,0.00028387364,0.0015351993],"genre_scores_gemma":[0.1941836,0.0002267933,0.80036056,0.00012844778,0.00007183778,0.00024532215,0.00014129229,0.00006515173,0.0045769596],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913615,0.00018445365,0.000055891283,0.00015805649,0.00036053703,0.00010497571],"domain_scores_gemma":[0.99882585,0.00033930497,0.00012149686,0.00013219538,0.00053278345,0.000048318892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007004871,0.0007322974,0.00047084794,0.00086886226,0.0007067972,0.000789574,0.00081490964,0.00076119887,0.002106879],"category_scores_gemma":[0.0022349663,0.00023837028,0.00044133537,0.0005615224,0.0005845126,0.00089245144,0.0007098081,0.00092989247,0.0006967451],"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.00069207954,0.00017123652,0.0019557374,0.00023973646,0.000108142434,0.0002903788,0.0003933596,0.19872539,0.1388732,0.050843854,0.0043862457,0.6033206],"study_design_scores_gemma":[0.00008373739,0.00025591967,0.0003737805,0.00003114081,0.000031815336,0.0003128314,0.000042418484,0.95381194,0.031131696,0.0063688136,0.0075031696,0.000052735606],"about_ca_topic_score_codex":0.0038983354,"about_ca_topic_score_gemma":0.004638503,"teacher_disagreement_score":0.0038983354,"about_ca_system_score_codex":0.0008015621,"about_ca_system_score_gemma":0.0017541861,"threshold_uncertainty_score":0.007751286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032872856,0.007475973,0.31403753,0.0033328035,0.0023326983,0.000029644716,0.00030918088,0.0002931308,0.63931614],"genre_scores_gemma":[0.40774956,0.006661037,0.044733223,0.0010406749,0.0016364309,0.00008318378,0.00028169592,0.00036923902,0.53744495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984396,0.000032412907,0.000008059305,0.00003671827,0.0000621263,0.000016653163],"domain_scores_gemma":[0.99973065,0.00008097955,0.000019101128,0.00005414662,0.0000883827,0.000026765363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031845583,0.0005978648,0.0004484201,0.0010940222,0.0005305482,0.0018869054,0.0003581422,0.0006059405,0.010501521],"category_scores_gemma":[0.0009673402,0.00020743068,0.00033505994,0.00086475484,0.0014521063,0.0018735495,0.0009925781,0.0021207803,0.002880685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075394055,0.0000050239605,0.000022259244,0.000030328483,0.0000028674108,0.000016690636,0.000043282966,0.00051882036,0.0016073011,0.97603714,0.0033076091,0.018401181],"study_design_scores_gemma":[0.0000034282466,0.000021118609,0.00014578526,0.000016544363,0.0000045789648,0.00012126374,0.000031316587,0.003864773,0.0018973192,0.9368349,0.05704904,0.000009976305],"about_ca_topic_score_codex":0.00027108638,"about_ca_topic_score_gemma":0.0001731519,"teacher_disagreement_score":0.010501521,"about_ca_system_score_codex":0.00064979884,"about_ca_system_score_gemma":0.0003139581,"threshold_uncertainty_score":0.035131156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8443093,0.00030084548,0.1075399,0.0002905942,0.00008265215,0.00010645193,0.00039220235,0.00030352184,0.046674483],"genre_scores_gemma":[0.9598726,0.00020026877,0.026851362,0.000074814925,0.000033021806,0.00007404753,0.00039547696,0.00010287287,0.012395555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994779,0.00010830548,0.000030546078,0.0001065798,0.00011783264,0.0001589357],"domain_scores_gemma":[0.998858,0.00042079657,0.00014604458,0.00023404256,0.00014635747,0.00019474312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027344518,0.00020849866,0.0003226496,0.00056931906,0.00096209336,0.001076817,0.0003426036,0.00038390266,0.008028401],"category_scores_gemma":[0.0014969056,0.0002710618,0.00039885458,0.00046725746,0.0012669904,0.0013457655,0.001100679,0.00063872465,0.0007506082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040301544,0.00008266024,0.0030456313,0.00016233865,0.00002363664,0.00020713866,0.00083370827,0.024400232,0.042679146,0.9001587,0.0033518819,0.024651982],"study_design_scores_gemma":[0.00011350167,0.00022806106,0.0032088407,0.000037440805,0.000032179116,0.00029082323,0.00047801118,0.117844485,0.023754077,0.82595116,0.028018292,0.00004306781],"about_ca_topic_score_codex":0.0027508407,"about_ca_topic_score_gemma":0.0041013197,"teacher_disagreement_score":0.008028401,"about_ca_system_score_codex":0.0009453637,"about_ca_system_score_gemma":0.0007114805,"threshold_uncertainty_score":0.026857615},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30757344,0.0010916499,0.65479016,0.006576582,0.00025442278,0.00028467912,0.001790753,0.0017446844,0.025893597],"genre_scores_gemma":[0.79711163,0.00056264765,0.18967284,0.0005805329,0.00023890038,0.0002118442,0.0024745343,0.0003825591,0.008764595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839634,0.0006152146,0.00006530592,0.00034358725,0.00030335557,0.00027607905],"domain_scores_gemma":[0.9901328,0.008093671,0.0004886677,0.0006251931,0.00035077313,0.00030890477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018709976,0.0011695109,0.0012153625,0.0006290963,0.00063744816,0.0027205248,0.0011785048,0.0010257517,0.009816128],"category_scores_gemma":[0.008856831,0.0005142689,0.0009326409,0.001094654,0.0012000164,0.0033226712,0.0015531479,0.0023585765,0.001142078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009153766,0.00040843646,0.0026677598,0.0006186605,0.00016365832,0.00028837463,0.0002204867,0.8032291,0.0046328334,0.0636901,0.017396428,0.1057687],"study_design_scores_gemma":[0.000079236,0.000055148987,0.00028431386,0.000013203821,0.000017491202,0.00004329837,0.0000665774,0.94181377,0.00088680553,0.05617568,0.00055471907,0.000009815017],"about_ca_topic_score_codex":0.0044134855,"about_ca_topic_score_gemma":0.0072803395,"teacher_disagreement_score":0.009816128,"about_ca_system_score_codex":0.0013939276,"about_ca_system_score_gemma":0.0019134051,"threshold_uncertainty_score":0.032838285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0612216,0.00030821998,0.93015516,0.00021018657,0.000045592093,0.00011023091,0.000068146146,0.00017641025,0.0077044712],"genre_scores_gemma":[0.61808455,0.00047743125,0.37661082,0.00018243422,0.00006184553,0.0003178622,0.00011987239,0.00008771256,0.0040574768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978162,0.0010010113,0.00014372087,0.00032001446,0.0005253116,0.00019379192],"domain_scores_gemma":[0.99614006,0.0018867509,0.00039117452,0.0010823678,0.00034881668,0.00015084876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025794916,0.0005045502,0.0005660278,0.00079843425,0.0006952533,0.001351899,0.00094036805,0.0011717052,0.0039105085],"category_scores_gemma":[0.0068048565,0.00044170322,0.00074401085,0.0010385687,0.0023460623,0.0027540252,0.0018851903,0.0013849773,0.00052829634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008985468,0.00003309389,0.0002253232,0.0000799194,0.000011357813,0.000048247486,0.00010830639,0.038124517,0.004038012,0.926196,0.00034819747,0.03069707],"study_design_scores_gemma":[0.000043449138,0.0002374122,0.00014106225,0.00003126225,0.000010851206,0.00014437208,0.00005572306,0.21925236,0.009418763,0.7668663,0.0037611132,0.000037301576],"about_ca_topic_score_codex":0.0003640984,"about_ca_topic_score_gemma":0.00041543954,"teacher_disagreement_score":0.0039105085,"about_ca_system_score_codex":0.0010622654,"about_ca_system_score_gemma":0.0008131853,"threshold_uncertainty_score":0.013641834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.552089,0.0029300507,0.3621845,0.005455533,0.0003948673,0.0002129217,0.0025241747,0.0012692753,0.07293962],"genre_scores_gemma":[0.9247792,0.0014153585,0.06191852,0.0010480374,0.00022509505,0.00036471608,0.0014207409,0.0004469008,0.008381488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802715,0.00035938306,0.00012589416,0.00053816184,0.00044959874,0.0004998227],"domain_scores_gemma":[0.983648,0.0118349055,0.0011608449,0.0016638966,0.0008390773,0.0008532106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014486043,0.0012063524,0.0009637103,0.0015996599,0.002793779,0.0029793198,0.0019016323,0.0018005086,0.0067300075],"category_scores_gemma":[0.013117178,0.0011186395,0.0008710449,0.0016285736,0.0032294441,0.005674698,0.0025152639,0.0035494873,0.0010411281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021199395,0.00029207632,0.009627863,0.0009483407,0.0001439369,0.0010779374,0.0019201866,0.05941726,0.050756384,0.75674874,0.017719196,0.09922818],"study_design_scores_gemma":[0.00009478336,0.0003122047,0.0031013708,0.0001466616,0.00009727207,0.00083871395,0.00032387956,0.107841976,0.023401452,0.84643495,0.017272988,0.00013377589],"about_ca_topic_score_codex":0.0017679663,"about_ca_topic_score_gemma":0.0024697117,"teacher_disagreement_score":0.0067300075,"about_ca_system_score_codex":0.0015955482,"about_ca_system_score_gemma":0.0011937296,"threshold_uncertainty_score":0.022514164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4434544,0.002784658,0.4201447,0.0035321964,0.00024943924,0.00012468704,0.00067834894,0.0007793885,0.12825224],"genre_scores_gemma":[0.94181144,0.00128185,0.04221752,0.00081735704,0.00024578025,0.00014924168,0.0005035456,0.00016487503,0.012808353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991222,0.00016670267,0.000073961084,0.000242538,0.00017108007,0.00022354111],"domain_scores_gemma":[0.9941917,0.0042465506,0.00046394288,0.00064505346,0.000242389,0.00021032066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009212857,0.0004999156,0.0005357747,0.0008060644,0.0010222889,0.0018957648,0.00073906605,0.0010785747,0.006140498],"category_scores_gemma":[0.0067392737,0.0003808727,0.0009639996,0.0010079752,0.0023154367,0.0045259586,0.0016450344,0.002647296,0.0007769772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002507299,0.00009910882,0.0008941223,0.00024111265,0.000019543064,0.00024303987,0.0005711903,0.014309362,0.011587747,0.9420199,0.002617836,0.027146306],"study_design_scores_gemma":[0.00004078153,0.0002045785,0.00085707544,0.00009301741,0.000057073037,0.0006817417,0.00038179493,0.074627265,0.023414545,0.8894528,0.010134664,0.000054715238],"about_ca_topic_score_codex":0.00038091262,"about_ca_topic_score_gemma":0.00039841773,"teacher_disagreement_score":0.006140498,"about_ca_system_score_codex":0.0010822976,"about_ca_system_score_gemma":0.0007096038,"threshold_uncertainty_score":0.020542026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57287097,0.0021709765,0.090261765,0.003332272,0.0005344752,0.00015280693,0.0020394807,0.00039415402,0.32824308],"genre_scores_gemma":[0.95966125,0.0006964675,0.01708183,0.0006833386,0.00044586227,0.00016808076,0.001075657,0.000094766874,0.020092689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887055,0.00033008857,0.000093291776,0.00021989582,0.00027783203,0.00020842004],"domain_scores_gemma":[0.99595934,0.0024480773,0.0005262224,0.0003797595,0.00028635588,0.000400247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096434867,0.0004957703,0.0005226068,0.002529299,0.0029675667,0.004269029,0.001023982,0.0012342964,0.012108282],"category_scores_gemma":[0.0045784866,0.0005696817,0.00079351437,0.0022003988,0.0031666877,0.004334349,0.002482201,0.0015145333,0.0014447015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005655399,0.000024441553,0.0005641969,0.0000538999,0.000011678803,0.00012966392,0.0003840895,0.0005549548,0.0011660785,0.989316,0.0020921605,0.0056463755],"study_design_scores_gemma":[0.000020590645,0.000028182109,0.0006571044,0.00003026427,0.000011189753,0.00031280593,0.0002117966,0.0017416043,0.0009182416,0.9900748,0.0059757535,0.000017610217],"about_ca_topic_score_codex":0.00085112103,"about_ca_topic_score_gemma":0.0007618415,"teacher_disagreement_score":0.012108282,"about_ca_system_score_codex":0.0012731884,"about_ca_system_score_gemma":0.00057053805,"threshold_uncertainty_score":0.040506303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79242253,0.001686067,0.161549,0.00090350315,0.0000958875,0.00011342701,0.00092143915,0.00044037806,0.041867718],"genre_scores_gemma":[0.9427022,0.0006153366,0.04993467,0.0002178151,0.000037514546,0.000067422974,0.00064350147,0.000094431074,0.0056871837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996191,0.00007446581,0.000021632279,0.00008500209,0.00007534338,0.00012438287],"domain_scores_gemma":[0.9985808,0.0005743988,0.00031836738,0.00015966162,0.00016795016,0.00019885812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025871658,0.0002616382,0.0004148202,0.00079180306,0.0010200639,0.0014756726,0.0005739557,0.00053697,0.004082804],"category_scores_gemma":[0.0018276725,0.00039612257,0.00036722107,0.0008106325,0.000968392,0.0016161313,0.0009932749,0.0007036632,0.00072435173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007137069,0.00009537192,0.007674239,0.0005083212,0.00007684712,0.0010985656,0.0013907044,0.040979944,0.044621162,0.8153356,0.010087804,0.077417634],"study_design_scores_gemma":[0.000056534307,0.00016210385,0.0062004225,0.00015272053,0.00007431988,0.0014701908,0.0010062455,0.09404193,0.023167755,0.8441434,0.029458348,0.0000660481],"about_ca_topic_score_codex":0.0013370343,"about_ca_topic_score_gemma":0.0020838869,"teacher_disagreement_score":0.004082804,"about_ca_system_score_codex":0.0008209453,"about_ca_system_score_gemma":0.00032870992,"threshold_uncertainty_score":0.013658345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8796855,0.00016774036,0.09608232,0.00022481557,0.000026038364,0.000026121785,0.00014908853,0.00010276259,0.023535676],"genre_scores_gemma":[0.98788774,0.00013469653,0.007560497,0.000079345766,0.0000350612,0.00003312166,0.00013098384,0.000031930467,0.004106551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997712,0.00004812753,0.0000073720844,0.000057997433,0.000053002368,0.000062298815],"domain_scores_gemma":[0.9992249,0.00033398555,0.00016154352,0.000104991246,0.000071984774,0.00010269751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022201847,0.00020473596,0.0002783049,0.00075441104,0.00058204896,0.0008068863,0.00034370902,0.0002445961,0.003519545],"category_scores_gemma":[0.0012428825,0.00021030456,0.00030562095,0.0004946188,0.0010478296,0.0014738258,0.00092364213,0.0006401056,0.0002514794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000875999,0.000024065335,0.0023800817,0.000062569605,0.000015708763,0.00024231852,0.0003610675,0.0056972154,0.010152274,0.96833605,0.00089818455,0.011742941],"study_design_scores_gemma":[0.000045156245,0.000120302786,0.005768518,0.000025492727,0.000032088377,0.0010276871,0.0004095482,0.052737195,0.01235188,0.91463095,0.012817553,0.000033639044],"about_ca_topic_score_codex":0.0003003259,"about_ca_topic_score_gemma":0.00031463738,"teacher_disagreement_score":0.003519545,"about_ca_system_score_codex":0.0002800972,"about_ca_system_score_gemma":0.00017395019,"threshold_uncertainty_score":0.0117740035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816279,0.00014610525,0.016128723,0.00013830395,0.000012307268,0.000016229922,0.000039569008,0.00008875154,0.0018021318],"genre_scores_gemma":[0.99867755,0.000024030509,0.0011706247,0.0000066953803,0.0000014036127,0.0000028933232,0.000008905223,0.0000033300355,0.00010452772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873966,0.0005574404,0.00003580485,0.00009902983,0.00025738566,0.00031067725],"domain_scores_gemma":[0.9932562,0.0051068184,0.0005571547,0.0005353298,0.00041935974,0.00012510417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017595566,0.00047145406,0.0003563686,0.00037023655,0.0004341924,0.00072333426,0.00053992483,0.0006660872,0.0012310229],"category_scores_gemma":[0.00632972,0.0001823327,0.00026554684,0.00030310167,0.0013944355,0.0015128022,0.00063951744,0.00048771646,0.00011147596],"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.002550409,0.0002176114,0.0032988775,0.00012956222,0.00011288175,0.0002318442,0.00011788147,0.8824589,0.06376625,0.038133293,0.00037241125,0.008610036],"study_design_scores_gemma":[0.00005483537,0.00029667476,0.0008407083,0.000009144686,0.000021019834,0.000051756022,0.000032997737,0.97133124,0.02295443,0.0043102084,0.0000728885,0.000024109517],"about_ca_topic_score_codex":0.0011836597,"about_ca_topic_score_gemma":0.0008095549,"teacher_disagreement_score":0.0017595566,"about_ca_system_score_codex":0.0010891919,"about_ca_system_score_gemma":0.0008355492,"threshold_uncertainty_score":0.009305537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7663263,0.00060777017,0.11183104,0.0007022731,0.00025112112,0.0000993,0.00026705253,0.00039935668,0.11951579],"genre_scores_gemma":[0.98139465,0.00009828181,0.010749737,0.000096653144,0.00008970338,0.000035290563,0.00012299365,0.000060251863,0.0073524644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986696,0.0003829898,0.000079603255,0.00023419042,0.00025785502,0.00037571538],"domain_scores_gemma":[0.997134,0.00095600175,0.0005961621,0.0003786027,0.00043114956,0.00050417066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010398489,0.00046401774,0.0005199723,0.0014776243,0.0015743647,0.0029024761,0.0007035023,0.0008728565,0.015237527],"category_scores_gemma":[0.0045645274,0.0002950646,0.00051969336,0.00072916865,0.0025272053,0.0058818883,0.0021835172,0.0012608687,0.0017223359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016744026,0.000038232374,0.0007120565,0.00004705695,0.000009407594,0.00035516772,0.00033622468,0.0011161858,0.0029493917,0.9878572,0.0008236657,0.0055879704],"study_design_scores_gemma":[0.000071242335,0.00016137154,0.00060298044,0.00003474618,0.000026937585,0.00049477175,0.0006204272,0.010619427,0.009364214,0.97056705,0.007389728,0.000047033867],"about_ca_topic_score_codex":0.00022369304,"about_ca_topic_score_gemma":0.00025232334,"teacher_disagreement_score":0.015237527,"about_ca_system_score_codex":0.00062522246,"about_ca_system_score_gemma":0.00026724447,"threshold_uncertainty_score":0.050974667},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067454875,0.0016564726,0.8668709,0.010785563,0.0010529814,0.00022771426,0.0028573554,0.0007086585,0.04838555],"genre_scores_gemma":[0.77258927,0.0025242886,0.18660809,0.005652674,0.004088464,0.0010909414,0.0045147534,0.000803963,0.022127515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9810121,0.009940631,0.0009664726,0.0033028403,0.004111218,0.00066678086],"domain_scores_gemma":[0.87292457,0.09496113,0.0048404797,0.017960882,0.007869236,0.0014435838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012854935,0.000719108,0.0017481976,0.005509023,0.0024666884,0.004927142,0.0018539001,0.0021906162,0.013451535],"category_scores_gemma":[0.105503075,0.0005296824,0.0020331705,0.0084005715,0.0055902563,0.0094249,0.0044974852,0.0064420598,0.0020198796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059797454,0.000037596965,0.0011511579,0.0000707551,0.000025995658,0.00019011041,0.00029907483,0.003356828,0.00040130244,0.975327,0.00432489,0.014755541],"study_design_scores_gemma":[0.000015828677,0.0000324911,0.00056672166,0.000036298818,0.000008125085,0.00015678778,0.000083415136,0.025311617,0.00060839223,0.9668597,0.0062904074,0.000030298672],"about_ca_topic_score_codex":0.0014201069,"about_ca_topic_score_gemma":0.0006244498,"teacher_disagreement_score":0.013451535,"about_ca_system_score_codex":0.0023207786,"about_ca_system_score_gemma":0.0013742907,"threshold_uncertainty_score":0.06798422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8227122,0.0001820496,0.16975988,0.00052669685,0.00005637859,0.000093911956,0.000058687,0.00029052934,0.0063196546],"genre_scores_gemma":[0.9563834,0.000074073476,0.042882394,0.000043028995,0.0000087545095,0.000021152413,0.00001141516,0.000012749003,0.0005630975],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999572,0.00012631036,0.000022190588,0.00004575718,0.00015120543,0.00008259174],"domain_scores_gemma":[0.99904436,0.00047481913,0.00020536642,0.00017253608,0.00006609629,0.00003680676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058265147,0.00031651807,0.00019000687,0.0002670127,0.00029710747,0.00053492095,0.00039995875,0.00046464094,0.0011201393],"category_scores_gemma":[0.0011123944,0.00016865757,0.00018513517,0.00023882458,0.0009329599,0.001098774,0.0007412244,0.00050774665,0.00022547114],"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.0004185884,0.00023943934,0.0011985379,0.00012036667,0.000023560478,0.00027989372,0.00014302063,0.01008123,0.9071157,0.05980426,0.0002844812,0.020290913],"study_design_scores_gemma":[0.000114125956,0.00048130366,0.000703742,0.000021960426,0.000022277061,0.00041984936,0.000046444486,0.12542205,0.85833794,0.012252889,0.002132724,0.00004464172],"about_ca_topic_score_codex":0.00013201893,"about_ca_topic_score_gemma":0.0001928618,"teacher_disagreement_score":0.0011201393,"about_ca_system_score_codex":0.0003234519,"about_ca_system_score_gemma":0.0003283372,"threshold_uncertainty_score":0.0037472844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.487609,0.0008139924,0.33007175,0.0021717136,0.0009296657,0.00016482497,0.0005750743,0.00041843456,0.17724554],"genre_scores_gemma":[0.88213277,0.0010421104,0.062957354,0.0005761852,0.0010162696,0.00026426816,0.0004946685,0.00042606794,0.051090296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980659,0.00046307745,0.00013895688,0.00044825234,0.0005326934,0.00035114159],"domain_scores_gemma":[0.99499005,0.002545434,0.00053191854,0.0007390439,0.0005003908,0.0006931111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021794382,0.00074730866,0.0011518416,0.003281626,0.0032155013,0.0055767116,0.001209429,0.0016652555,0.011093022],"category_scores_gemma":[0.00880563,0.0010286616,0.0016468884,0.0022419451,0.0053726244,0.009878017,0.003917835,0.004297396,0.0012438116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030701456,0.000016844537,0.000134325,0.000010476032,0.000003809039,0.000059559876,0.00017677632,0.00020790599,0.0004697327,0.99500257,0.00032775462,0.003559591],"study_design_scores_gemma":[0.000009317992,0.000012076078,0.00014255414,0.000008684893,0.0000061804876,0.00013480791,0.00009754231,0.0020986511,0.00060575246,0.9950186,0.0018571502,0.000008501875],"about_ca_topic_score_codex":0.00045833754,"about_ca_topic_score_gemma":0.0004406489,"teacher_disagreement_score":0.011093022,"about_ca_system_score_codex":0.0011996112,"about_ca_system_score_gemma":0.00095026125,"threshold_uncertainty_score":0.03710985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4529566,0.00035752993,0.48483336,0.00043334707,0.00014171722,0.000110388326,0.00048653246,0.0006615475,0.06001894],"genre_scores_gemma":[0.9157867,0.00030194464,0.0721481,0.00017810319,0.00010649266,0.00020688685,0.000841584,0.0001581405,0.010272098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998599,0.00027048573,0.000116343224,0.00029940697,0.00040875695,0.000306051],"domain_scores_gemma":[0.99726105,0.0009210072,0.0003550738,0.0007466215,0.0003882319,0.0003279311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512792,0.0006535623,0.0005072513,0.0011373569,0.0012735152,0.0019403988,0.0009700911,0.0006996868,0.0073125158],"category_scores_gemma":[0.004146905,0.0006896336,0.0006897598,0.0010462278,0.0015547251,0.0029383977,0.0017990916,0.0016391067,0.0014264086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010284219,0.000030064984,0.00048090026,0.00004262542,0.0000073248575,0.00030716832,0.00039624533,0.0022491869,0.012272943,0.9741735,0.00085987797,0.009077346],"study_design_scores_gemma":[0.00005559451,0.0001724541,0.0007529915,0.000048041242,0.000024278574,0.0010143408,0.00040270228,0.026888961,0.024300814,0.9294433,0.016839145,0.000057286456],"about_ca_topic_score_codex":0.00046538425,"about_ca_topic_score_gemma":0.0005811329,"teacher_disagreement_score":0.0073125158,"about_ca_system_score_codex":0.0007217705,"about_ca_system_score_gemma":0.0003708415,"threshold_uncertainty_score":0.02446276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71632975,0.0012019872,0.19665706,0.0053825187,0.00017311033,0.00047535024,0.0025188401,0.00044501657,0.07681644],"genre_scores_gemma":[0.90508986,0.001587817,0.068480484,0.00085520395,0.00027144782,0.00035250513,0.0039268634,0.00014609002,0.019289706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886274,0.0003401518,0.000059407914,0.0002631211,0.00016942229,0.00030516787],"domain_scores_gemma":[0.9935482,0.0047133127,0.0005390634,0.00041580078,0.00031934385,0.00046431558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011586574,0.0007833843,0.00095484045,0.0014920529,0.0019679656,0.002952304,0.0015335389,0.002089158,0.0111292],"category_scores_gemma":[0.007082311,0.00079932227,0.0009355244,0.0015727092,0.0019107006,0.004923578,0.0020593354,0.0021819647,0.0011200603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003896608,0.00031078974,0.0024721138,0.000509762,0.000080246115,0.0006776829,0.0009048531,0.056766782,0.004145484,0.8835472,0.014490432,0.035704996],"study_design_scores_gemma":[0.00013765297,0.000083191975,0.0009358571,0.000092152244,0.000044190423,0.000372396,0.0006788073,0.10162269,0.0024208087,0.8865679,0.006989264,0.000055078275],"about_ca_topic_score_codex":0.004280311,"about_ca_topic_score_gemma":0.007139202,"teacher_disagreement_score":0.0111292,"about_ca_system_score_codex":0.0022013204,"about_ca_system_score_gemma":0.0015702889,"threshold_uncertainty_score":0.03723091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6109965,0.00066355354,0.29110622,0.0011494206,0.0003367461,0.00014645066,0.00073581474,0.0005753944,0.09428994],"genre_scores_gemma":[0.92250913,0.00060896453,0.041334417,0.0003174777,0.00015190177,0.0001379297,0.0005492425,0.0002709138,0.034120075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994062,0.0001896335,0.000033420467,0.00008660975,0.00013366657,0.00015040107],"domain_scores_gemma":[0.9970368,0.0013577652,0.00033870823,0.00038773747,0.00043955294,0.00043946324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005191975,0.00038721785,0.00070043,0.0011957011,0.0011634867,0.0019806356,0.0006187255,0.0009092362,0.011898708],"category_scores_gemma":[0.0024768054,0.00047784022,0.0005280436,0.0010132486,0.0012899565,0.0021715043,0.001296568,0.0012710389,0.0013039284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008905772,0.000024570647,0.00020715901,0.0000368397,0.000007638908,0.00005139839,0.00019692534,0.0046187583,0.0033206348,0.98394495,0.0017572114,0.005745033],"study_design_scores_gemma":[0.000029754015,0.000035607874,0.00025735507,0.000014282996,0.000007843935,0.00004844721,0.00008977826,0.026703736,0.0012561027,0.9666449,0.004900009,0.000012252692],"about_ca_topic_score_codex":0.0018825971,"about_ca_topic_score_gemma":0.0022974734,"teacher_disagreement_score":0.011898708,"about_ca_system_score_codex":0.0010142308,"about_ca_system_score_gemma":0.0007229463,"threshold_uncertainty_score":0.039805114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32302573,0.0032299203,0.44845748,0.009678323,0.008278329,0.00016063538,0.00064308714,0.0006946728,0.20583181],"genre_scores_gemma":[0.8516875,0.0010466162,0.096175395,0.0014780185,0.0015592059,0.00014258224,0.00052989396,0.00046590547,0.046914987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990163,0.00036039326,0.00005678916,0.00018745259,0.00025579176,0.00012321128],"domain_scores_gemma":[0.998806,0.00070620456,0.00006843977,0.00012933856,0.00011954995,0.00017050495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015184004,0.00082896464,0.0011358,0.0023939484,0.0033339635,0.0034224098,0.0016864071,0.0014039015,0.0114901215],"category_scores_gemma":[0.0019019444,0.0008148956,0.0013098496,0.0019346119,0.004078173,0.005621625,0.003278101,0.0051542753,0.0013400301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011903835,0.000013182301,0.00005248303,0.00002862054,0.0000034342106,0.000029168195,0.00025783334,0.00026584158,0.0006655046,0.9955979,0.00093193335,0.0021422305],"study_design_scores_gemma":[0.000011419383,0.000014359303,0.00009911076,0.000013945668,0.000004094556,0.00007455888,0.00006828297,0.0015088299,0.0008313789,0.9911929,0.0061660525,0.0000150588],"about_ca_topic_score_codex":0.00033279523,"about_ca_topic_score_gemma":0.0004720364,"teacher_disagreement_score":0.0114901215,"about_ca_system_score_codex":0.0021786885,"about_ca_system_score_gemma":0.00054804573,"threshold_uncertainty_score":0.03843832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048192397,0.004057659,0.6295021,0.009040815,0.004124369,0.00013480638,0.0008778651,0.0016381638,0.3024318],"genre_scores_gemma":[0.7185623,0.004137809,0.18221147,0.007134205,0.0015593582,0.00038311092,0.0009828599,0.0013824408,0.0836464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981499,0.00037546645,0.00010240756,0.00041237555,0.0006828483,0.00027697044],"domain_scores_gemma":[0.9975337,0.0012965767,0.00010339503,0.00040407275,0.00056643883,0.00009588804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016953473,0.0006187328,0.0007804456,0.0017601136,0.0022165088,0.0023853783,0.0013249619,0.0011288454,0.018190194],"category_scores_gemma":[0.005642262,0.00057087396,0.00163733,0.0023682783,0.0057314476,0.0075515746,0.004208516,0.004039136,0.0042233695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028830096,0.000013180737,0.00010596542,0.000068974055,0.00000986007,0.0001396459,0.0003404415,0.00046354867,0.001095238,0.9834018,0.006028246,0.008304278],"study_design_scores_gemma":[0.000013041671,0.000023056202,0.000120442935,0.000031135598,0.000015110911,0.00018138689,0.0000889657,0.001269869,0.0026886857,0.9647628,0.030785568,0.00001998498],"about_ca_topic_score_codex":0.00185633,"about_ca_topic_score_gemma":0.0013022269,"teacher_disagreement_score":0.018190194,"about_ca_system_score_codex":0.0015797473,"about_ca_system_score_gemma":0.0008871568,"threshold_uncertainty_score":0.06085229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948184,0.000054674183,0.0029256614,0.00004327147,0.000004165853,0.0000078165485,0.00003584677,0.00001513774,0.0020951205],"genre_scores_gemma":[0.9975339,0.000033645723,0.0018513234,0.000017581106,0.0000020068576,0.0000055037917,0.000046241435,0.000010958016,0.0004988582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999242,0.000012878366,0.00000380841,0.000015513355,0.000020234562,0.000023320154],"domain_scores_gemma":[0.99958104,0.0001591036,0.00009598181,0.00004155008,0.000035907535,0.00008650841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019358954,0.0002970599,0.00029600452,0.00027261063,0.00070485217,0.00090434676,0.00052782847,0.00038628207,0.001179883],"category_scores_gemma":[0.0019115346,0.00036186748,0.00024504287,0.00022991342,0.00059585413,0.00091551524,0.0007913098,0.00074998726,0.00017603707],"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.00045244338,0.00021936877,0.10735534,0.00007911281,0.00009678962,0.0008994744,0.00082463777,0.8043144,0.05543183,0.019030593,0.00031546803,0.010980559],"study_design_scores_gemma":[0.000055979188,0.00013298867,0.025749287,0.000016312108,0.000021094584,0.00016744508,0.00024418594,0.9617151,0.007899192,0.0031462046,0.0008286762,0.000023567141],"about_ca_topic_score_codex":0.0092660785,"about_ca_topic_score_gemma":0.007996062,"teacher_disagreement_score":0.0092660785,"about_ca_system_score_codex":0.0010286395,"about_ca_system_score_gemma":0.00058420066,"threshold_uncertainty_score":0.018424273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009994822,0.00045117547,0.9786702,0.00021020242,0.00012180488,0.000068371184,0.00005091101,0.00053603377,0.009896479],"genre_scores_gemma":[0.19361728,0.0007209478,0.79189897,0.00019096969,0.0001448923,0.0001795069,0.00022224014,0.00024149512,0.012783618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933773,0.00020271826,0.000021561422,0.00006684161,0.0003192861,0.000051820036],"domain_scores_gemma":[0.9993864,0.00019989506,0.000049336755,0.0001815454,0.0001572579,0.000025586152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040300642,0.000462765,0.0003861941,0.00088703464,0.00054609246,0.0008396836,0.00048031917,0.0005026124,0.0045133648],"category_scores_gemma":[0.001619786,0.00026301102,0.0004617568,0.0008791839,0.0008935662,0.0009777369,0.0009022231,0.0011161249,0.0020139732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096434385,0.00007084471,0.00029534416,0.0001916503,0.000029180614,0.00016681192,0.00018892788,0.051596053,0.031997383,0.6157903,0.0073786587,0.29219842],"study_design_scores_gemma":[0.00005134299,0.00014533779,0.00029424168,0.00006663975,0.00002139972,0.0006501051,0.000065725326,0.44049728,0.050047856,0.45461664,0.053474233,0.00006919472],"about_ca_topic_score_codex":0.00057483243,"about_ca_topic_score_gemma":0.0006463422,"teacher_disagreement_score":0.0045133648,"about_ca_system_score_codex":0.0004697604,"about_ca_system_score_gemma":0.00083378353,"threshold_uncertainty_score":0.015098691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009617343,0.0003986821,0.98291636,0.00015264263,0.000092729824,0.000058242687,0.000041421383,0.00045766486,0.006264964],"genre_scores_gemma":[0.16230874,0.0006468615,0.8284757,0.00013236591,0.00010882952,0.00014772835,0.00018801706,0.00019471397,0.007797068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993765,0.00019158685,0.000022034263,0.000061045335,0.00030300394,0.000045932855],"domain_scores_gemma":[0.9993462,0.00023529884,0.00005440417,0.00018701426,0.00014971716,0.000027339573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003950958,0.0004583522,0.00041650282,0.0008696864,0.0005243379,0.00071814505,0.0004578162,0.0004985589,0.003571566],"category_scores_gemma":[0.0016937726,0.0002431225,0.00047119256,0.00082696846,0.00082939595,0.000931691,0.0008565117,0.001043133,0.0016672132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010236389,0.00007800189,0.00037393192,0.00024445195,0.000035729714,0.00018649343,0.00020425301,0.059487488,0.040732108,0.56846225,0.005748165,0.32434472],"study_design_scores_gemma":[0.00006283706,0.00018493012,0.00034650616,0.0000755261,0.000030054414,0.000876891,0.00006784633,0.4790031,0.06348323,0.40276763,0.053019818,0.00008161952],"about_ca_topic_score_codex":0.00046096454,"about_ca_topic_score_gemma":0.0005992168,"teacher_disagreement_score":0.003571566,"about_ca_system_score_codex":0.0003840231,"about_ca_system_score_gemma":0.00083098916,"threshold_uncertainty_score":0.011948109},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013927569,0.00023005815,0.96932364,0.00007663987,0.000104582505,0.00010593383,0.000116631825,0.0004184573,0.01569661],"genre_scores_gemma":[0.13861172,0.00034852122,0.8493324,0.00010136376,0.000028728027,0.00032439,0.00034843344,0.0002684821,0.01063604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933726,0.00017408282,0.000046112007,0.00014357005,0.00020312186,0.000095847376],"domain_scores_gemma":[0.9994531,0.00012536772,0.00004312579,0.00020188522,0.00013866584,0.00003781864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058741675,0.00043073794,0.00047297816,0.0015937566,0.00079145463,0.0011364195,0.0014308445,0.0005128302,0.0076697352],"category_scores_gemma":[0.0017553846,0.00043505433,0.0005370877,0.0010265406,0.0009912807,0.0010625523,0.0020445902,0.0010103495,0.0032936933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053745807,0.000049302056,0.00070097647,0.000198258,0.000018766761,0.00021521996,0.00053342787,0.011586681,0.021121882,0.8334785,0.0022856523,0.12975758],"study_design_scores_gemma":[0.000044875927,0.00013211623,0.0005927994,0.00016749577,0.000026381373,0.00096855586,0.00049221114,0.102592096,0.06208081,0.7259063,0.10690305,0.00009323647],"about_ca_topic_score_codex":0.00044575476,"about_ca_topic_score_gemma":0.00086915493,"teacher_disagreement_score":0.0076697352,"about_ca_system_score_codex":0.0005910928,"about_ca_system_score_gemma":0.0006381995,"threshold_uncertainty_score":0.025657833},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2918798,0.009758457,0.28025252,0.05583317,0.0042923554,0.00010883775,0.0014054863,0.0010335519,0.35543588],"genre_scores_gemma":[0.9270692,0.00246181,0.03243757,0.0051328633,0.0026031742,0.000099598095,0.00064671016,0.00010198206,0.02944696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980477,0.00043807054,0.00009075011,0.00055195263,0.0005588588,0.0003126828],"domain_scores_gemma":[0.9943791,0.0026460527,0.00038410482,0.0012489118,0.0009893198,0.000352509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022143112,0.0004645105,0.0010291389,0.00096613687,0.0022708813,0.0027924306,0.0008550268,0.0024346332,0.010801439],"category_scores_gemma":[0.01067094,0.00040003806,0.00075201836,0.0007752606,0.0045283586,0.00557175,0.002330241,0.0043035033,0.002151508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036994654,0.000013179421,0.00024288855,0.000039821713,0.000007996194,0.000094613875,0.00014730867,0.0007221459,0.0006267085,0.9872067,0.0061454554,0.00471627],"study_design_scores_gemma":[0.00002028818,0.000022761848,0.00016544232,0.000021106189,0.000004550373,0.0001683749,0.000064072185,0.003072614,0.00065032166,0.9861929,0.009602405,0.0000150873075],"about_ca_topic_score_codex":0.0009278083,"about_ca_topic_score_gemma":0.0005501274,"teacher_disagreement_score":0.010801439,"about_ca_system_score_codex":0.0009032841,"about_ca_system_score_gemma":0.000821571,"threshold_uncertainty_score":0.03613442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54719865,0.0004878986,0.38700223,0.0008337935,0.00044217595,0.00010247075,0.00021371919,0.0004758255,0.06324327],"genre_scores_gemma":[0.9035711,0.00023094339,0.07113946,0.0002969351,0.00014734454,0.0000802918,0.00016609262,0.00016057464,0.024207266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940085,0.00018989507,0.00003186998,0.00011838548,0.0001669323,0.000092051974],"domain_scores_gemma":[0.998212,0.00064582354,0.0002542783,0.00049592793,0.00023993631,0.000152109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059471995,0.00039264752,0.00038881,0.0010188804,0.0007282746,0.0016148138,0.0010458147,0.000737456,0.0069116433],"category_scores_gemma":[0.0031160614,0.00039778472,0.00030853567,0.0008167112,0.0009359702,0.0019657332,0.001045602,0.00085281243,0.00072058634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027550053,0.00012891041,0.00063863164,0.00007661559,0.000030944193,0.00031141093,0.0002406045,0.037513997,0.033330206,0.89079314,0.0030471059,0.03361284],"study_design_scores_gemma":[0.00004883095,0.00008709782,0.00052286114,0.00002716061,0.000026518204,0.00033698944,0.00018861078,0.22588491,0.010120424,0.75567997,0.0070427465,0.000033924774],"about_ca_topic_score_codex":0.0005546565,"about_ca_topic_score_gemma":0.0011190248,"teacher_disagreement_score":0.0069116433,"about_ca_system_score_codex":0.00060543686,"about_ca_system_score_gemma":0.00036828758,"threshold_uncertainty_score":0.023121715},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040656846,0.004723129,0.55036396,0.0085731875,0.003986425,0.00015401164,0.0009726866,0.0016938648,0.38887593],"genre_scores_gemma":[0.6617664,0.0059150197,0.21774794,0.0075605786,0.0015738412,0.0004801611,0.0013005686,0.001281215,0.10237426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982552,0.00032303884,0.00010597889,0.00037291978,0.0006536996,0.0002891187],"domain_scores_gemma":[0.99756444,0.0013066753,0.00010384766,0.000347672,0.0005806864,0.00009674774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015900182,0.00065754337,0.0008172503,0.0021005725,0.002290842,0.0023365193,0.0013991478,0.0010529662,0.019385662],"category_scores_gemma":[0.0055716103,0.0005583926,0.0016852546,0.0027068418,0.005597691,0.007886886,0.0047581187,0.0039849966,0.0044031157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002803758,0.000014613391,0.00012940828,0.00008299675,0.000010102629,0.00015071756,0.0003232106,0.0004983444,0.0009225182,0.9786957,0.0076703504,0.011474056],"study_design_scores_gemma":[0.000013918607,0.000022869079,0.00018369312,0.000044323522,0.000019036168,0.00022756786,0.000104696526,0.0013587176,0.0029265275,0.94759166,0.047484808,0.000022202175],"about_ca_topic_score_codex":0.0024163567,"about_ca_topic_score_gemma":0.0019224801,"teacher_disagreement_score":0.019385662,"about_ca_system_score_codex":0.0017595807,"about_ca_system_score_gemma":0.0010067654,"threshold_uncertainty_score":0.06485152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28285244,0.004500502,0.48839682,0.0028238376,0.0017307054,0.00014411677,0.0006358784,0.0005509087,0.21836483],"genre_scores_gemma":[0.7957443,0.004324375,0.088166304,0.0019750984,0.003803819,0.0002317021,0.00081060006,0.00050264143,0.10444129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955446,0.000096589705,0.000026640688,0.00010246808,0.00012461003,0.00009508614],"domain_scores_gemma":[0.99833316,0.0008489954,0.00021761388,0.00014658054,0.0001889141,0.00026473997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000775568,0.001042106,0.00085426663,0.0031158302,0.0018579838,0.0021467162,0.00096080184,0.001084024,0.014137538],"category_scores_gemma":[0.0025899617,0.00048768646,0.0009952342,0.0027186146,0.0023013898,0.00407999,0.002051207,0.0025132657,0.0014550366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006107849,0.000033320637,0.00022352727,0.00006380681,0.0000099791405,0.00014013509,0.00036551003,0.0014724114,0.0018520402,0.9824155,0.0023207366,0.011041812],"study_design_scores_gemma":[0.00001841022,0.00005625779,0.00026933243,0.00002506893,0.000020041052,0.00012812953,0.00015844627,0.005904893,0.001128053,0.9822329,0.0100354655,0.000023033037],"about_ca_topic_score_codex":0.0007097756,"about_ca_topic_score_gemma":0.0011306092,"teacher_disagreement_score":0.014137538,"about_ca_system_score_codex":0.0009325044,"about_ca_system_score_gemma":0.00047634172,"threshold_uncertainty_score":0.047294796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5531122,0.0013984038,0.36829183,0.0046738205,0.0005226809,0.00010457995,0.00042725523,0.00054133777,0.07092783],"genre_scores_gemma":[0.8859561,0.00068328273,0.08734495,0.0011277542,0.00035561403,0.00013158233,0.00038487438,0.0001743015,0.023841595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995177,0.00019737388,0.000017597078,0.00010660335,0.000060545102,0.00010014868],"domain_scores_gemma":[0.9987172,0.00070055906,0.00013483882,0.00018477358,0.00010125288,0.00016141849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041543832,0.00047177591,0.00049764116,0.00047791694,0.001399469,0.0011512395,0.0006790626,0.0008349845,0.0066056265],"category_scores_gemma":[0.0020990167,0.0003726116,0.00057634333,0.0007758811,0.0014928479,0.0031099264,0.0012335419,0.0016420019,0.00078197836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012216417,0.000048552418,0.0004636761,0.00010121587,0.000020380141,0.00022068564,0.00029298954,0.017202046,0.0034626273,0.958886,0.0052802586,0.013899263],"study_design_scores_gemma":[0.000022647908,0.0000316098,0.00026634257,0.000016016915,0.00001030551,0.00010760773,0.00017392192,0.048813894,0.0017067764,0.94031316,0.008520529,0.000017234403],"about_ca_topic_score_codex":0.0013343177,"about_ca_topic_score_gemma":0.0021787062,"teacher_disagreement_score":0.0066056265,"about_ca_system_score_codex":0.0010326387,"about_ca_system_score_gemma":0.00034118688,"threshold_uncertainty_score":0.022098005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45270768,0.0034487671,0.1081754,0.06286757,0.0030420204,0.000118169235,0.0015012382,0.0012400391,0.36689916],"genre_scores_gemma":[0.97453564,0.00070978183,0.007832615,0.003181029,0.0016012801,0.00012793911,0.00062035903,0.00013394585,0.011257295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958801,0.0015594772,0.00017846691,0.0008271171,0.0009955936,0.0005592945],"domain_scores_gemma":[0.9717334,0.023217568,0.001140155,0.0020607377,0.0009037277,0.0009442734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036002828,0.000990213,0.0019045215,0.0022518216,0.003264182,0.006949085,0.0027275055,0.0050660656,0.023238147],"category_scores_gemma":[0.0190464,0.00089438644,0.0012232495,0.0021113157,0.008262379,0.013023849,0.0053927996,0.0063973316,0.0017044968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099734476,0.000045680757,0.0002778957,0.00007150428,0.000014952777,0.00009752499,0.00025673053,0.00095053023,0.00035285356,0.99188995,0.004422185,0.0015204293],"study_design_scores_gemma":[0.000056060657,0.000014140274,0.00015182626,0.000016756238,0.000009722251,0.000095162155,0.00013775863,0.0034556221,0.00023983546,0.99308467,0.002726162,0.000012231881],"about_ca_topic_score_codex":0.0009039979,"about_ca_topic_score_gemma":0.00083406444,"teacher_disagreement_score":0.023238147,"about_ca_system_score_codex":0.0024090619,"about_ca_system_score_gemma":0.0007552462,"threshold_uncertainty_score":0.07773936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043350033,0.0014021154,0.9350054,0.00043010036,0.00025553614,0.00005139619,0.00016764383,0.00014861503,0.019189022],"genre_scores_gemma":[0.58642876,0.0017482108,0.3977173,0.00033529717,0.0005947795,0.00014208346,0.00034396644,0.00020785446,0.012481725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750227,0.0010381291,0.00012186129,0.00038305664,0.0007909995,0.00016362395],"domain_scores_gemma":[0.9909751,0.004719206,0.00077327166,0.00087706005,0.002287382,0.00036788246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002836213,0.0009782936,0.00052671897,0.0021154317,0.00084417616,0.0023487872,0.00095444295,0.0006767826,0.0051328666],"category_scores_gemma":[0.01529529,0.00034951422,0.00055900344,0.001480795,0.0030036103,0.004173941,0.0012250078,0.0018036987,0.00089786144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053067677,0.000022168679,0.00021077755,0.000092550086,0.000011889872,0.0000704954,0.0002062272,0.023767633,0.0038767098,0.95212525,0.0008902836,0.018673092],"study_design_scores_gemma":[0.00000910481,0.00010359867,0.00023994212,0.000040276187,0.000005831998,0.00013885475,0.00013017104,0.2301102,0.005004445,0.757442,0.006722554,0.000053076972],"about_ca_topic_score_codex":0.0014406479,"about_ca_topic_score_gemma":0.001339568,"teacher_disagreement_score":0.0051328666,"about_ca_system_score_codex":0.0008705242,"about_ca_system_score_gemma":0.0005900706,"threshold_uncertainty_score":0.017171085},"labels":[],"label_agreement":null},{"id":"W4378981817","doi":"10.1002/jcd.21885","title":"Linear and circular single‐change covering designs revisited","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Mathematics; Combinatorics; Block (permutation group theory); Element (criminal law); Block design; Discrete mathematics","score_opus":0.0625248715641342,"score_gpt":0.24859973879210645,"score_spread":0.18607486722797226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378981817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44174784,0.00046753665,0.52228993,0.00041433045,0.00006476729,0.00012970301,0.00010777634,0.00028978672,0.034488354],"genre_scores_gemma":[0.8959518,0.00014715335,0.098660626,0.00013496778,0.000031672484,0.00006215784,0.00008896128,0.00003148327,0.0048910794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912745,0.0002126499,0.00005237127,0.00017141724,0.00023740463,0.00019872937],"domain_scores_gemma":[0.9983954,0.00074728974,0.00021864305,0.0003271455,0.00024962248,0.000061929364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007714277,0.000290942,0.00028864222,0.0004479634,0.0005015386,0.00068377244,0.00058645534,0.0006298954,0.0041903425],"category_scores_gemma":[0.0023857767,0.00027160818,0.0004435179,0.00041256324,0.0011053544,0.0009842147,0.00072187063,0.0006110357,0.0004557762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041351654,0.00015625735,0.0034261965,0.0003824815,0.00005071221,0.00060772436,0.0005729679,0.09421738,0.058576856,0.70115334,0.002726254,0.13771634],"study_design_scores_gemma":[0.00016735352,0.0007604592,0.0018915783,0.00011022325,0.000076552395,0.0016504715,0.0003258437,0.5271651,0.09072489,0.34447324,0.03258252,0.000071676186],"about_ca_topic_score_codex":0.0005858871,"about_ca_topic_score_gemma":0.0006372541,"teacher_disagreement_score":0.0041903425,"about_ca_system_score_codex":0.0007586072,"about_ca_system_score_gemma":0.00054571754,"threshold_uncertainty_score":0.014018118},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48937604,0.0009635438,0.44044966,0.0006482544,0.00009964131,0.00008339702,0.00039595625,0.00023828339,0.06774524],"genre_scores_gemma":[0.9600566,0.0005902607,0.027158609,0.000101643825,0.00014367717,0.000068056506,0.00016935736,0.0000795244,0.011632375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.00017320331,0.00003874948,0.00016001496,0.00017986195,0.00012050282],"domain_scores_gemma":[0.9955527,0.0023772276,0.0009156703,0.00034089692,0.00048300152,0.00033036104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005369633,0.00041313845,0.00031816756,0.0015494293,0.0005649574,0.0016423246,0.000471831,0.00054560753,0.0053464095],"category_scores_gemma":[0.006577422,0.00042490245,0.0003807182,0.00069062674,0.0018733542,0.0021257175,0.0009049743,0.001433242,0.00077653787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010970208,0.0000229813,0.0009586771,0.000050468705,0.000014341118,0.00027353177,0.00032599093,0.013642206,0.005934274,0.9673922,0.00083044334,0.010445119],"study_design_scores_gemma":[0.000027346068,0.000047308476,0.0010776573,0.00003672919,0.000012174967,0.00047155842,0.0001654748,0.077876695,0.004186659,0.9097077,0.0063651437,0.000025540972],"about_ca_topic_score_codex":0.00061312376,"about_ca_topic_score_gemma":0.00050593354,"teacher_disagreement_score":0.0053464095,"about_ca_system_score_codex":0.00052519474,"about_ca_system_score_gemma":0.00034494232,"threshold_uncertainty_score":0.017885566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051425357,0.010343032,0.014909761,0.003942274,0.0038216787,0.000050013598,0.00036219336,0.00053047546,0.9655263],"genre_scores_gemma":[0.003838236,0.004794678,0.0053278543,0.0013543189,0.001168966,0.000049190738,0.0003780382,0.00046036346,0.98262835],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991781,0.0001179972,0.000017805774,0.00013464746,0.00050814135,0.000043298107],"domain_scores_gemma":[0.99913895,0.00029798577,0.000033946875,0.00012561432,0.00030412627,0.0000994198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056790595,0.00093934225,0.0008454242,0.0023871867,0.0014912745,0.005425639,0.0011966486,0.0012233212,0.11760227],"category_scores_gemma":[0.0030011584,0.00043957992,0.00034192717,0.0038326182,0.0014723991,0.006913529,0.0018679153,0.0031483907,0.06931137],"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.000011365125,0.000043139848,0.00009006246,0.00012898614,0.0000038802723,0.000020236195,0.00016617996,0.00037231937,0.00019433929,0.18780568,0.5924155,0.21874832],"study_design_scores_gemma":[0.0000011748352,0.0000060743273,0.000120615885,0.00010795577,0.0000018444506,0.000043962813,0.00008620522,0.00042283363,0.000083333005,0.05956206,0.9395583,0.00000560257],"about_ca_topic_score_codex":0.0021246092,"about_ca_topic_score_gemma":0.0060373037,"teacher_disagreement_score":0.11760227,"about_ca_system_score_codex":0.001719509,"about_ca_system_score_gemma":0.001205484,"threshold_uncertainty_score":0.39341873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6290975,0.0049144677,0.13415495,0.0039105997,0.0010297095,0.00026294263,0.0010859467,0.00031578794,0.22522797],"genre_scores_gemma":[0.90261143,0.0030478677,0.03140633,0.0013256258,0.0008783801,0.00030452732,0.0009690298,0.00028702084,0.059169803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907494,0.00029837986,0.00005143095,0.00018687686,0.0001978536,0.00019055213],"domain_scores_gemma":[0.997145,0.0015901743,0.00038058162,0.00018776838,0.00031140563,0.00038498815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062628905,0.0014303984,0.0010945183,0.0049001947,0.0022924696,0.004207311,0.0014760758,0.002011568,0.01167018],"category_scores_gemma":[0.0037957896,0.0010770895,0.0012494737,0.0034550582,0.0026910473,0.0046144403,0.0024694907,0.0021134496,0.0011105563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005641696,0.000034354936,0.0003791749,0.00006248941,0.000012811402,0.0001565053,0.0005189165,0.0024841733,0.0008108674,0.9855278,0.002424956,0.007531597],"study_design_scores_gemma":[0.000011143788,0.000009789555,0.0002011133,0.000028386186,0.0000057522498,0.00006635341,0.00008836096,0.005899833,0.00018650242,0.99043536,0.0030579236,0.000009435079],"about_ca_topic_score_codex":0.0032674414,"about_ca_topic_score_gemma":0.0039840103,"teacher_disagreement_score":0.01167018,"about_ca_system_score_codex":0.001935742,"about_ca_system_score_gemma":0.0007438308,"threshold_uncertainty_score":0.039040625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43653488,0.0026696534,0.40352702,0.0013524443,0.0006751296,0.0001724776,0.0005270586,0.00031537423,0.15422598],"genre_scores_gemma":[0.9202725,0.0012055067,0.06147299,0.0002754848,0.0003582147,0.00009934635,0.00027121717,0.00006138923,0.015983392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951696,0.000096229895,0.000029993022,0.00008612742,0.00015810571,0.00011253612],"domain_scores_gemma":[0.9992605,0.00018028519,0.00019664755,0.000091494614,0.00018350624,0.000087459106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034544236,0.0006544736,0.00034075844,0.0016550575,0.00088903704,0.0019600564,0.00044093063,0.00078899035,0.006236591],"category_scores_gemma":[0.001692268,0.00034343865,0.00038947427,0.0011077415,0.0014144826,0.0018000382,0.0008294647,0.0013151579,0.0009110928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003283494,0.0000106924235,0.0001557087,0.000027864018,0.0000037090638,0.00018320951,0.000097699056,0.002868839,0.0047479435,0.9870697,0.00053207943,0.0042697233],"study_design_scores_gemma":[0.000028335791,0.000076499266,0.00050295773,0.000031529507,0.000007641464,0.0006635877,0.00017276852,0.037388396,0.009675179,0.94227374,0.009134314,0.00004494403],"about_ca_topic_score_codex":0.00067205913,"about_ca_topic_score_gemma":0.00047012838,"teacher_disagreement_score":0.006236591,"about_ca_system_score_codex":0.00074224576,"about_ca_system_score_gemma":0.00044241597,"threshold_uncertainty_score":0.020863473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05748112,0.0034506002,0.6674011,0.014297396,0.0012615926,0.00011375718,0.0012523313,0.0007220851,0.25401995],"genre_scores_gemma":[0.7461826,0.0058602006,0.11301433,0.0053563807,0.0034998595,0.00048736107,0.0027304569,0.0014208205,0.12144795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888283,0.0003229754,0.000054736283,0.00029543266,0.00023235573,0.00021170377],"domain_scores_gemma":[0.9946161,0.0033197368,0.00037699824,0.0003842781,0.00096397894,0.00033891306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019876577,0.0013585732,0.0008728789,0.0036373623,0.0021009943,0.0039109336,0.001480685,0.0013349933,0.024809394],"category_scores_gemma":[0.0072885463,0.00037917844,0.0016627446,0.0027108663,0.0029097658,0.012223575,0.0033089956,0.0046810424,0.004816127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040064107,0.00002854528,0.00020131048,0.00006305777,0.000011338481,0.000066097215,0.000195825,0.00090216065,0.00054404966,0.97845733,0.009390605,0.010099577],"study_design_scores_gemma":[0.000014683587,0.000055696986,0.0003727699,0.00005533596,0.000019950412,0.00020257776,0.00015469438,0.011789726,0.00086147944,0.9678775,0.018573623,0.000021881673],"about_ca_topic_score_codex":0.0023741021,"about_ca_topic_score_gemma":0.001795115,"teacher_disagreement_score":0.024809394,"about_ca_system_score_codex":0.0024907177,"about_ca_system_score_gemma":0.0009337016,"threshold_uncertainty_score":0.08299565},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103627674,0.0024887086,0.6738696,0.015133151,0.0015938948,0.00081014313,0.0047058077,0.0030070273,0.19476394],"genre_scores_gemma":[0.49710146,0.0036799575,0.36691996,0.007277455,0.0023193348,0.0013246458,0.01509839,0.0018756322,0.10440316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963582,0.0010417438,0.0001841616,0.0011236004,0.00065563,0.0006365177],"domain_scores_gemma":[0.9965384,0.0015246088,0.00025137304,0.0008853206,0.00038128564,0.00041897647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020305493,0.0020091257,0.0016981927,0.0009467748,0.0029842148,0.003463794,0.0033491645,0.002505636,0.03465874],"category_scores_gemma":[0.008529252,0.00097495975,0.00196322,0.0019939523,0.002706695,0.011885878,0.0046338974,0.005289888,0.0063524963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037636232,0.00018452232,0.0006989342,0.00041056535,0.00006362512,0.0002332574,0.00032725255,0.017279143,0.0014327555,0.796458,0.088713884,0.09382172],"study_design_scores_gemma":[0.00008836863,0.000063238476,0.00024609923,0.000065119624,0.000027064472,0.00023157937,0.00021275417,0.03564606,0.0011861982,0.91510725,0.04709052,0.00003560392],"about_ca_topic_score_codex":0.0029138015,"about_ca_topic_score_gemma":0.0032322202,"teacher_disagreement_score":0.03465874,"about_ca_system_score_codex":0.0020520878,"about_ca_system_score_gemma":0.0024685888,"threshold_uncertainty_score":0.11594498},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101628825,0.0074299136,0.5015389,0.0029198057,0.003008999,0.00008439791,0.000772647,0.00170245,0.47238007],"genre_scores_gemma":[0.18764047,0.0076403837,0.3693992,0.0019494974,0.0024777765,0.00021439428,0.0016914203,0.00123929,0.4277476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999278,0.00016912362,0.000023360179,0.00012266233,0.00035791693,0.000048953993],"domain_scores_gemma":[0.99900824,0.00042380168,0.000047267808,0.00026260782,0.00019960782,0.00005845006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067583384,0.00088039314,0.00082608283,0.0019777778,0.0010860307,0.0030528596,0.0011677503,0.0011499642,0.02548798],"category_scores_gemma":[0.0032161523,0.00058668817,0.0006395784,0.0020102884,0.0014505674,0.0029108883,0.0016738726,0.0021004286,0.010230137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003551979,0.000020005646,0.00009279675,0.00010457636,0.000017544193,0.00008171279,0.00009419177,0.0023026774,0.001890341,0.88613355,0.032555547,0.076671585],"study_design_scores_gemma":[0.000010253975,0.000018998806,0.00010427026,0.000055926834,0.000009586384,0.00026660087,0.000042077438,0.018262839,0.003330476,0.8837362,0.094134174,0.000028569697],"about_ca_topic_score_codex":0.00056846614,"about_ca_topic_score_gemma":0.00086814514,"teacher_disagreement_score":0.02548798,"about_ca_system_score_codex":0.0008217953,"about_ca_system_score_gemma":0.0007111622,"threshold_uncertainty_score":0.085265815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15725212,0.002793403,0.66896296,0.010678233,0.0011288231,0.00068803877,0.0028921692,0.0020078449,0.1535965],"genre_scores_gemma":[0.57599926,0.0037654797,0.3158226,0.004782511,0.0023158914,0.0012483018,0.010841794,0.0016116487,0.083612606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667346,0.0009862737,0.00016724854,0.0009563146,0.00060543517,0.0006111813],"domain_scores_gemma":[0.99546105,0.0021852467,0.00034155993,0.00097290985,0.0004979816,0.00054129673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021607608,0.0020718253,0.0018497338,0.0011688359,0.0027799362,0.0032315445,0.0031816214,0.0026285008,0.028437823],"category_scores_gemma":[0.010106421,0.0010267905,0.001958762,0.0020855544,0.0026518914,0.01151548,0.0044364077,0.005369988,0.0044721295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042775815,0.00023704991,0.0010282613,0.00041418066,0.000072212824,0.0002769814,0.00038545768,0.024394877,0.0016297913,0.82281977,0.060346182,0.08796742],"study_design_scores_gemma":[0.00009237899,0.00007448907,0.00028366593,0.00006294944,0.000023686656,0.00024433204,0.00020296195,0.04724497,0.0009431058,0.924355,0.026436199,0.000036383517],"about_ca_topic_score_codex":0.0023183753,"about_ca_topic_score_gemma":0.0022657004,"teacher_disagreement_score":0.028437823,"about_ca_system_score_codex":0.0019482186,"about_ca_system_score_gemma":0.002251241,"threshold_uncertainty_score":0.09513402},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04885765,0.0028438766,0.91563,0.0012691935,0.00025841073,0.000088466266,0.00013134905,0.000114778915,0.03080634],"genre_scores_gemma":[0.7630756,0.004363119,0.22128844,0.0005056449,0.00025571688,0.000250447,0.00015100064,0.00012751315,0.009982618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966276,0.00014974874,0.000010995548,0.00003632068,0.0001114613,0.000028755569],"domain_scores_gemma":[0.99937797,0.00040637283,0.000077809804,0.000073043004,0.000053101056,0.00001161633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006510656,0.00041279025,0.00029787098,0.00050811196,0.00054748583,0.0008792823,0.00039612688,0.0008064048,0.002852788],"category_scores_gemma":[0.0023881816,0.00015911295,0.00047595365,0.0004980177,0.0013567628,0.0013498719,0.00052339863,0.0010023568,0.00059583597],"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.000025089672,0.000022783266,0.00020136761,0.00010563095,0.0000086455575,0.00007139044,0.00005488886,0.08863007,0.004773504,0.89903927,0.0006878151,0.006379582],"study_design_scores_gemma":[0.000012904949,0.00005114048,0.00021631642,0.000049120994,0.000006237522,0.00012993945,0.000026940172,0.5987049,0.0018360357,0.39502087,0.003924519,0.000021103677],"about_ca_topic_score_codex":0.0007597969,"about_ca_topic_score_gemma":0.0007055932,"teacher_disagreement_score":0.002852788,"about_ca_system_score_codex":0.0009721071,"about_ca_system_score_gemma":0.0006512115,"threshold_uncertainty_score":0.009543538},"labels":[],"label_agreement":null},{"id":"W4386051996","doi":"10.1002/jcd.21913","title":"On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Prime (order theory); Decomposition; Discrete mathematics","score_opus":0.036563962291686854,"score_gpt":0.23832960328035302,"score_spread":0.20176564098866617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386051996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365195,0.00035651756,0.11814817,0.0017042842,0.000068919486,0.0003467825,0.0014919405,0.00023411281,0.041129783],"genre_scores_gemma":[0.945343,0.00046594325,0.043486517,0.00029543697,0.00008260594,0.00020306847,0.0018622061,0.00005007356,0.008211179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924386,0.00022491947,0.00004550642,0.00015148628,0.000113927126,0.00022043013],"domain_scores_gemma":[0.9950781,0.0035475995,0.00044858968,0.00032259902,0.00024605266,0.00035700962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093164877,0.00047676737,0.0007389917,0.0010528092,0.001107971,0.002059207,0.0008881934,0.0013194694,0.009272016],"category_scores_gemma":[0.005372214,0.0005924953,0.000502839,0.00095009065,0.0011373477,0.0028625885,0.0011539662,0.0009820107,0.0007051404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075654226,0.000504406,0.0055617723,0.00061337755,0.000107785316,0.0012960366,0.0009155603,0.10345244,0.011011721,0.8040893,0.014486476,0.057204507],"study_design_scores_gemma":[0.00027246072,0.00021909115,0.0022595704,0.00012855002,0.00006167421,0.0008260414,0.0012217418,0.21640848,0.007656377,0.7604109,0.010453106,0.0000819912],"about_ca_topic_score_codex":0.0024276727,"about_ca_topic_score_gemma":0.0042006997,"teacher_disagreement_score":0.009272016,"about_ca_system_score_codex":0.0010689603,"about_ca_system_score_gemma":0.0011260723,"threshold_uncertainty_score":0.03101796},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009273747,0.00076003605,0.977007,0.0003940694,0.00016800362,0.000066618515,0.0000427693,0.000332922,0.011954823],"genre_scores_gemma":[0.2854347,0.0016168843,0.6979864,0.00031067873,0.00031231972,0.00023031428,0.00024841915,0.00015621788,0.013704047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941623,0.00019571067,0.00002465245,0.00008454605,0.00022813026,0.000050656443],"domain_scores_gemma":[0.9993445,0.00020408994,0.00006670833,0.0002127107,0.00014048812,0.000031545485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328737,0.00047495798,0.00035630848,0.00070870196,0.00059754006,0.0008411899,0.00043736587,0.0006470935,0.0039031766],"category_scores_gemma":[0.0016839156,0.00025379873,0.00044521777,0.0008680666,0.00090617663,0.0013007555,0.0011014595,0.0015225345,0.0018068409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000907092,0.00006597315,0.0002808474,0.00020594534,0.00001728035,0.00015301902,0.00018217109,0.02036563,0.026186224,0.7849345,0.004499652,0.16301802],"study_design_scores_gemma":[0.000052994623,0.00017854416,0.00033663196,0.000094829134,0.000026800439,0.0009130886,0.000088542,0.20215662,0.041383643,0.6798497,0.07485907,0.000059533813],"about_ca_topic_score_codex":0.00021067704,"about_ca_topic_score_gemma":0.00030274098,"teacher_disagreement_score":0.0039031766,"about_ca_system_score_codex":0.00046063247,"about_ca_system_score_gemma":0.0006908989,"threshold_uncertainty_score":0.013057411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007628218,0.000879521,0.977037,0.0004252926,0.00020338586,0.00007741036,0.000058170528,0.0004252522,0.013265783],"genre_scores_gemma":[0.25674814,0.0018210344,0.7213688,0.00037139907,0.00043284593,0.00029650543,0.00036181882,0.00020666858,0.018392783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993444,0.00020490492,0.000028717557,0.00010571276,0.00025859437,0.000057625635],"domain_scores_gemma":[0.99931216,0.00021033383,0.00006618214,0.0002230767,0.00015444648,0.00003385357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752345,0.0005883303,0.00037988994,0.0007824755,0.00065161905,0.00094568793,0.0004938135,0.0006810546,0.005471215],"category_scores_gemma":[0.0019778719,0.0003073783,0.00055880897,0.001078304,0.000925202,0.0013430914,0.0012667255,0.0017077725,0.0028222841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116249656,0.00006742723,0.00029555647,0.00022162983,0.0000178737,0.00017218082,0.000197198,0.01697449,0.02361681,0.73698413,0.006451903,0.21488452],"study_design_scores_gemma":[0.00006764574,0.00019976727,0.0004143889,0.00011363978,0.000030765295,0.0009825306,0.00009355369,0.16942686,0.040417396,0.6925574,0.09562685,0.00006908382],"about_ca_topic_score_codex":0.00027399894,"about_ca_topic_score_gemma":0.000341448,"teacher_disagreement_score":0.005471215,"about_ca_system_score_codex":0.0005340109,"about_ca_system_score_gemma":0.00072065083,"threshold_uncertainty_score":0.018303096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15477498,0.00055104255,0.79159564,0.0010386122,0.00021144211,0.00023276916,0.00057247747,0.00077457936,0.050248396],"genre_scores_gemma":[0.5436257,0.00070699485,0.42653498,0.00058614166,0.00017320382,0.0002561914,0.0009566707,0.00039863234,0.026761446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944633,0.00015355893,0.000024000023,0.00010947235,0.0001298496,0.0001367889],"domain_scores_gemma":[0.9986266,0.0007672717,0.000115190844,0.00021471303,0.00014645912,0.00012979098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617525,0.0010172189,0.00077635737,0.0008536466,0.0011466383,0.001423109,0.0011342824,0.0011939991,0.010974411],"category_scores_gemma":[0.0048760213,0.00070231827,0.000832288,0.0011444613,0.0010463065,0.002323608,0.0017075683,0.0014608268,0.001929348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003382292,0.00032426804,0.00074237975,0.00033357364,0.000055000826,0.00023385104,0.00076285924,0.08560267,0.0077688782,0.7290583,0.027269624,0.1475103],"study_design_scores_gemma":[0.00006996816,0.00006712294,0.00014581629,0.000040764804,0.000015082044,0.000077959005,0.00015654281,0.21698488,0.0017575657,0.7758247,0.0048339074,0.000025668978],"about_ca_topic_score_codex":0.0028160869,"about_ca_topic_score_gemma":0.005374551,"teacher_disagreement_score":0.010974411,"about_ca_system_score_codex":0.0006199704,"about_ca_system_score_gemma":0.0011043467,"threshold_uncertainty_score":0.036713064},"labels":[],"label_agreement":null},{"id":"W4387057486","doi":"10.1002/jcd.21918","title":"Completing the solution of the directed Oberwolfach problem with cycles of equal length","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Digraph; Combinatorics; Decomposition; Discrete mathematics","score_opus":0.024096584297988225,"score_gpt":0.21763709788451333,"score_spread":0.1935405135865251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387057486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35542506,0.0002925361,0.58428776,0.0013148523,0.00018605226,0.00034780925,0.00085966097,0.0004327202,0.056853607],"genre_scores_gemma":[0.6737521,0.00048218755,0.2947432,0.00037106435,0.0000985065,0.00022466047,0.0011979224,0.0001515173,0.028978916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996203,0.000086546715,0.000020907306,0.00008720588,0.00007663075,0.00010839066],"domain_scores_gemma":[0.9992453,0.00036916952,0.00007573866,0.00015644415,0.00008672026,0.00006666012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042028865,0.00034181343,0.00043603836,0.00036595756,0.00062049745,0.0008990472,0.00069922325,0.00070750277,0.011672528],"category_scores_gemma":[0.0020441338,0.0002509656,0.0004585045,0.0005588138,0.00043116783,0.001423742,0.0010876299,0.0010314175,0.00091372523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003756433,0.00031367023,0.0020001333,0.00063512084,0.000085640146,0.0005230159,0.00066944025,0.10828693,0.018181443,0.57664776,0.023861745,0.26841944],"study_design_scores_gemma":[0.00019152767,0.00030891638,0.0011270401,0.00011061159,0.00004863752,0.0004208135,0.0008293901,0.25663632,0.022844672,0.665908,0.051516972,0.000057168723],"about_ca_topic_score_codex":0.0017577157,"about_ca_topic_score_gemma":0.0024443597,"teacher_disagreement_score":0.011672528,"about_ca_system_score_codex":0.00045168935,"about_ca_system_score_gemma":0.0010548694,"threshold_uncertainty_score":0.039048493},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08062366,0.0004065539,0.9140816,0.00015198388,0.000055799406,0.00020364359,0.00014802223,0.00025491137,0.0040738876],"genre_scores_gemma":[0.48449108,0.0003381273,0.511987,0.00019481019,0.000093466275,0.0005323874,0.00023618096,0.0001014261,0.0020254324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367976,0.0038358201,0.0003622605,0.0008755892,0.00095654186,0.0002900164],"domain_scores_gemma":[0.973078,0.014184838,0.0033169945,0.006841869,0.0018255601,0.000752667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007029916,0.0010655421,0.0008575052,0.0010420781,0.00051419315,0.00095295726,0.0011354787,0.0007088806,0.0041122097],"category_scores_gemma":[0.024343854,0.000508195,0.0010694508,0.0009864296,0.0016649109,0.0017468743,0.0014745881,0.0014392663,0.000673547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013946367,0.0003155598,0.0064975373,0.00069771183,0.00027190815,0.00035427118,0.0004916582,0.087337725,0.033946287,0.5663566,0.0025951918,0.29974094],"study_design_scores_gemma":[0.00077416276,0.0049760668,0.005624969,0.00022734678,0.00021019686,0.001377973,0.0002367296,0.33068004,0.035491176,0.60468906,0.015436422,0.00027579154],"about_ca_topic_score_codex":0.00019795852,"about_ca_topic_score_gemma":0.00025931915,"teacher_disagreement_score":0.007029916,"about_ca_system_score_codex":0.00048037735,"about_ca_system_score_gemma":0.0009860491,"threshold_uncertainty_score":0.03717822},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10862073,0.0012336898,0.83283013,0.0004234642,0.0004607123,0.0001122822,0.00041068377,0.00039530118,0.055512972],"genre_scores_gemma":[0.7929926,0.0011920393,0.17900176,0.00042626285,0.00023658806,0.00015258312,0.00046864548,0.00015812147,0.025371348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992335,0.00017829574,0.00005343045,0.00016061398,0.00024326902,0.00013086485],"domain_scores_gemma":[0.99895215,0.00027513484,0.00016739366,0.0002588666,0.0002655514,0.000080778715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058213994,0.0007072766,0.0005199824,0.0008799805,0.00068645366,0.0016287543,0.0005052574,0.00062581414,0.0052677994],"category_scores_gemma":[0.0020634867,0.0003138788,0.000542971,0.00063113816,0.0012118113,0.00178036,0.00086686766,0.0011612135,0.0014117783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114999784,0.000014411216,0.0005608703,0.00008948832,0.000021521546,0.00034154972,0.00016469533,0.0039595133,0.019513436,0.9537929,0.0013514789,0.020075044],"study_design_scores_gemma":[0.000023047103,0.00013371787,0.0007253781,0.000070446426,0.000030596024,0.0013228592,0.00019109626,0.050362688,0.03324256,0.8874912,0.026328886,0.0000774065],"about_ca_topic_score_codex":0.00030734783,"about_ca_topic_score_gemma":0.00045139904,"teacher_disagreement_score":0.0052677994,"about_ca_system_score_codex":0.00046661627,"about_ca_system_score_gemma":0.00034100233,"threshold_uncertainty_score":0.01762253},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66868925,0.00063527067,0.28927174,0.00026650043,0.000052568415,0.00005543495,0.00024753384,0.0001893865,0.040592313],"genre_scores_gemma":[0.9405623,0.00030430738,0.050781712,0.000114748545,0.000045399884,0.00006542909,0.00023574397,0.00005620468,0.007834173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990558,0.0003194098,0.000033572498,0.0001707486,0.00021736638,0.00020313633],"domain_scores_gemma":[0.9987356,0.0006230422,0.00020717282,0.00021522974,0.00012532553,0.00009363426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068463705,0.00055115955,0.00037910434,0.00097124063,0.00073383015,0.0010378995,0.00047837317,0.00072964345,0.004387166],"category_scores_gemma":[0.0018891826,0.0003753858,0.00046949176,0.00065983157,0.0012557608,0.0012382871,0.00084154913,0.00082994497,0.0007212252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002688859,0.00004403567,0.00081877527,0.0000860477,0.000026424688,0.00026395312,0.0002606656,0.03171588,0.014455537,0.9282963,0.0009747382,0.022788793],"study_design_scores_gemma":[0.000066985274,0.0001395816,0.0007513978,0.000074687865,0.000025188736,0.00041717736,0.0001876328,0.089936145,0.010349521,0.8921663,0.0058476664,0.00003768968],"about_ca_topic_score_codex":0.00055757014,"about_ca_topic_score_gemma":0.00081317325,"teacher_disagreement_score":0.004387166,"about_ca_system_score_codex":0.0005962174,"about_ca_system_score_gemma":0.000403855,"threshold_uncertainty_score":0.014676571},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673513,0.0004805137,0.123632155,0.0017059133,0.00041664625,0.00025911376,0.004160876,0.0009310271,0.20106252],"genre_scores_gemma":[0.8988355,0.0004449233,0.037494645,0.00078435126,0.0002113846,0.00016812308,0.0068940646,0.00028223198,0.054884713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991893,0.00008878535,0.000039686933,0.00024265215,0.00018354885,0.00025607698],"domain_scores_gemma":[0.99872905,0.00037381056,0.00026796738,0.00012413411,0.00022902506,0.00027595097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004211831,0.000997907,0.0006206479,0.0010048595,0.0012994448,0.0018226947,0.00092344667,0.0007992309,0.011793504],"category_scores_gemma":[0.0009783817,0.00054065924,0.000583286,0.00082654785,0.0015192898,0.0021363178,0.0013856131,0.0018724147,0.0021715136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011465356,0.0004556434,0.0019147317,0.0006861219,0.000132529,0.0024416938,0.0009822138,0.01597806,0.033321384,0.8566352,0.027440159,0.058865704],"study_design_scores_gemma":[0.0001845222,0.0001444907,0.0027779797,0.00008017828,0.000053901276,0.0010681063,0.0005439832,0.02775019,0.008273971,0.93436795,0.024684649,0.00007006685],"about_ca_topic_score_codex":0.0023987896,"about_ca_topic_score_gemma":0.0036731353,"teacher_disagreement_score":0.011793504,"about_ca_system_score_codex":0.0010134546,"about_ca_system_score_gemma":0.00072989793,"threshold_uncertainty_score":0.03945315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4076912,0.0017509818,0.4429499,0.0014278237,0.00065335166,0.00012623798,0.0007075473,0.00047105807,0.1442219],"genre_scores_gemma":[0.93169445,0.000993558,0.05147004,0.00042481485,0.0002503646,0.00006180964,0.000358184,0.00008130048,0.014665474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961936,0.000077180375,0.000026216036,0.0001134478,0.00008987598,0.000073908035],"domain_scores_gemma":[0.99930096,0.00021415879,0.00008987383,0.00015142544,0.00013499986,0.0001086122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028811817,0.00028048467,0.000317662,0.00058093824,0.0012561794,0.00075876224,0.0003874872,0.0004395246,0.0047634123],"category_scores_gemma":[0.0008560124,0.00016889576,0.00046572022,0.0006506072,0.0012755024,0.0018333485,0.001046468,0.000836088,0.00054481556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006515561,0.000025262621,0.00094381074,0.00010506937,0.000014035512,0.0005160785,0.00035145247,0.0022863278,0.0073558544,0.96563774,0.0016729692,0.021026364],"study_design_scores_gemma":[0.000018602352,0.00011219028,0.0016796171,0.000036652622,0.000031451447,0.0011773717,0.00031950834,0.012886402,0.00553117,0.93853366,0.03964453,0.000028852584],"about_ca_topic_score_codex":0.000984301,"about_ca_topic_score_gemma":0.0013641774,"teacher_disagreement_score":0.0047634123,"about_ca_system_score_codex":0.00049480953,"about_ca_system_score_gemma":0.00048849743,"threshold_uncertainty_score":0.015935242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1752134,0.0005607577,0.7917804,0.00031975366,0.00020987482,0.000108939275,0.00028854515,0.00047019284,0.031048108],"genre_scores_gemma":[0.6400332,0.00066549255,0.34499913,0.00022737499,0.00011142762,0.00014270279,0.0005368115,0.0001443852,0.013139642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999627,0.00011352854,0.00002616336,0.000049528076,0.00013269996,0.000050965114],"domain_scores_gemma":[0.99930084,0.00022339777,0.00010242313,0.00015199867,0.00017375936,0.000047537564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032061661,0.0004305844,0.0002992244,0.0005697202,0.00032066953,0.0007496,0.00030874077,0.00050287496,0.0033321846],"category_scores_gemma":[0.0013897894,0.0002752589,0.00046098587,0.0005366522,0.00057549746,0.0008066515,0.000504758,0.0008348408,0.0009514857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018630989,0.00005275851,0.0005190464,0.00024269838,0.000024417037,0.0003932689,0.00035481533,0.028228367,0.1292611,0.7862376,0.0014458272,0.053053778],"study_design_scores_gemma":[0.00014551447,0.00071971124,0.0012926047,0.000099291414,0.0000537062,0.0016192114,0.00020421205,0.18821718,0.19371507,0.55582935,0.0579406,0.0001636138],"about_ca_topic_score_codex":0.0003333296,"about_ca_topic_score_gemma":0.0003954187,"teacher_disagreement_score":0.0033321846,"about_ca_system_score_codex":0.00026770862,"about_ca_system_score_gemma":0.00034462856,"threshold_uncertainty_score":0.01114732},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069515705,0.0021889121,0.025798265,0.0031823302,0.0012687979,0.00016292276,0.010274216,0.0062727206,0.94390017],"genre_scores_gemma":[0.10545487,0.007261175,0.029238096,0.0019082744,0.0021994277,0.00026408202,0.022156235,0.0075101685,0.82400763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961156,0.000031568063,0.00002087461,0.00008842175,0.00020419275,0.000043385604],"domain_scores_gemma":[0.9991984,0.00017474536,0.000076480435,0.00020615305,0.00017539384,0.00016897052],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002497999,0.00097283773,0.0006053818,0.002392564,0.00092870207,0.004655214,0.00094855117,0.0011400594,0.5249557],"category_scores_gemma":[0.0013984985,0.0006953673,0.00062494806,0.004734728,0.0012136844,0.002550637,0.0016064063,0.0020747308,0.2861268],"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.00011010821,0.00014569784,0.0017348988,0.00051464513,0.00003185453,0.00074290374,0.00017259098,0.0023107629,0.005707359,0.17407298,0.62871104,0.18574516],"study_design_scores_gemma":[0.000031026608,0.000019471323,0.0019270354,0.00017296869,0.000011170719,0.0010784317,0.00016513163,0.0036759248,0.0037042731,0.09040022,0.89879054,0.00002385526],"about_ca_topic_score_codex":0.0015045152,"about_ca_topic_score_gemma":0.0036805996,"teacher_disagreement_score":0.4750443,"about_ca_system_score_codex":0.0016106066,"about_ca_system_score_gemma":0.0007591904,"threshold_uncertainty_score":0.67759305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25270227,0.0005081703,0.5482428,0.0014442872,0.0013028055,0.00044702354,0.0016441738,0.0027116414,0.19099681],"genre_scores_gemma":[0.7497096,0.00040520367,0.18433475,0.00092106464,0.00021030194,0.0006655646,0.001376015,0.0010868127,0.06129063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900264,0.00016777546,0.00008270655,0.0002391619,0.00030292527,0.00020485165],"domain_scores_gemma":[0.998594,0.00035233886,0.00015207754,0.00034802285,0.00037708285,0.00017637973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062499364,0.0008524144,0.0005084167,0.0010750638,0.001894843,0.0017981551,0.0007253779,0.00094860455,0.025307553],"category_scores_gemma":[0.0032505859,0.00044304316,0.0006215397,0.00066842866,0.0020708297,0.0026454106,0.0015169913,0.0014835733,0.0050774543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030269646,0.000115321585,0.0022065858,0.00021991813,0.000018262923,0.0010547442,0.00048046585,0.003210398,0.028184578,0.89863455,0.010571852,0.055000596],"study_design_scores_gemma":[0.000061508406,0.00025866638,0.0018734396,0.00011790646,0.000030763724,0.0014531797,0.00074278226,0.023966048,0.020754557,0.8601316,0.09047513,0.00013447272],"about_ca_topic_score_codex":0.0010314967,"about_ca_topic_score_gemma":0.002374679,"teacher_disagreement_score":0.025307553,"about_ca_system_score_codex":0.0008184251,"about_ca_system_score_gemma":0.0011608055,"threshold_uncertainty_score":0.08466226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020836445,0.01803706,0.054356936,0.0018829269,0.0018237121,0.000043191867,0.00015017271,0.00032137823,0.921301],"genre_scores_gemma":[0.060222372,0.021661358,0.024715433,0.0012506485,0.0016032998,0.00010951571,0.00025319378,0.00044718196,0.889737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973685,0.000054476895,0.0000074515183,0.000044378958,0.00012941044,0.00002731153],"domain_scores_gemma":[0.9997477,0.00009936906,0.000012407334,0.00006956344,0.00005709219,0.000013861843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022831437,0.0009060157,0.00051107886,0.0012760158,0.0011008821,0.002576681,0.0005432141,0.0008224385,0.028354691],"category_scores_gemma":[0.0012438252,0.00032680543,0.00027587896,0.001993719,0.002781897,0.0028938819,0.00094352616,0.001996213,0.011292158],"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.0000063261477,0.000009818118,0.000016784274,0.000053881336,0.0000023668658,0.000017612765,0.00014713946,0.00064401876,0.00040644567,0.8924104,0.045381356,0.060903806],"study_design_scores_gemma":[0.0000028621357,0.0000129882865,0.000051698808,0.00005712846,0.0000025797883,0.00009473763,0.00006753433,0.00097156834,0.00056551927,0.49458072,0.5035852,0.000007465762],"about_ca_topic_score_codex":0.0023863441,"about_ca_topic_score_gemma":0.0027612704,"teacher_disagreement_score":0.028354691,"about_ca_system_score_codex":0.0015584625,"about_ca_system_score_gemma":0.0009039879,"threshold_uncertainty_score":0.094855964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027980143,0.0003064597,0.95617366,0.0010746612,0.00011047498,0.00014511349,0.00021256467,0.00084218447,0.013154742],"genre_scores_gemma":[0.781063,0.0002712663,0.20910291,0.00093519816,0.0002790353,0.00035553102,0.00033291153,0.00042481345,0.007235386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99358106,0.0014538164,0.00044706577,0.0015341616,0.001957955,0.0010259748],"domain_scores_gemma":[0.9794983,0.0110603785,0.00088891666,0.0063361414,0.0013225116,0.0008937295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037545878,0.0007767258,0.0013311716,0.0008064029,0.0014023827,0.0028256115,0.0027807755,0.0017047169,0.0073431707],"category_scores_gemma":[0.01631713,0.0007574842,0.0019896594,0.0012180012,0.0057859053,0.008749167,0.0074929576,0.00935788,0.0011337855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014514159,0.000052417814,0.0002862919,0.00010031644,0.000020612268,0.00007970931,0.00025576938,0.009871203,0.004259442,0.97111344,0.0010865896,0.012728939],"study_design_scores_gemma":[0.00005974797,0.00007028634,0.00032802674,0.000022826096,0.000027806724,0.00009860822,0.00003598351,0.12504488,0.0079120975,0.8623432,0.0040149493,0.000041586045],"about_ca_topic_score_codex":0.0016069157,"about_ca_topic_score_gemma":0.0010448402,"teacher_disagreement_score":0.0073431707,"about_ca_system_score_codex":0.0020984586,"about_ca_system_score_gemma":0.0020065133,"threshold_uncertainty_score":0.02456534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09710166,0.00031205223,0.8375578,0.0007092546,0.00064336084,0.000114977076,0.00014987944,0.00052353693,0.06288753],"genre_scores_gemma":[0.6692859,0.00054338475,0.26464292,0.0007782688,0.00048055025,0.00021507774,0.00021899313,0.00043273435,0.0634021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962723,0.000109117005,0.000013513407,0.00008494378,0.000114330294,0.000050917373],"domain_scores_gemma":[0.9992324,0.00022976806,0.00009561767,0.00016207124,0.000113478854,0.00016662075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042946322,0.00068327965,0.0005263707,0.0009791254,0.00066655333,0.0012488996,0.0009785505,0.00101994,0.010502626],"category_scores_gemma":[0.0018184789,0.00047076316,0.00047744683,0.0006995328,0.0013383566,0.0020252976,0.0013016175,0.0014128018,0.0018993465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054328848,0.000049122857,0.00008836457,0.000029903771,0.000011034732,0.00007977542,0.00008201041,0.009474451,0.008227837,0.9588118,0.0020693026,0.021022014],"study_design_scores_gemma":[0.000033432985,0.000049464685,0.00013018916,0.000013840134,0.000009856662,0.00013516478,0.00004616274,0.08227693,0.0027526428,0.90755576,0.006971476,0.000025095924],"about_ca_topic_score_codex":0.00029810905,"about_ca_topic_score_gemma":0.0006455985,"teacher_disagreement_score":0.010502626,"about_ca_system_score_codex":0.00042645194,"about_ca_system_score_gemma":0.000360168,"threshold_uncertainty_score":0.035134792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8505272,0.00040229675,0.119025044,0.0002754704,0.000063930915,0.0000923884,0.0001326492,0.00012278464,0.029358111],"genre_scores_gemma":[0.97109175,0.00022731803,0.021560498,0.000059530583,0.0000689149,0.00008474374,0.00018890905,0.000029299168,0.006689125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942636,0.00012622947,0.000036883288,0.00012993309,0.00015117807,0.00012939826],"domain_scores_gemma":[0.99864644,0.00043465805,0.00046352003,0.00015913851,0.00012622193,0.00017006737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003766589,0.0004582231,0.00037085067,0.001235329,0.00084976654,0.0011965431,0.000613769,0.0006361254,0.0031880112],"category_scores_gemma":[0.0019179144,0.0001798031,0.00047877533,0.00077605364,0.0013672971,0.0013899151,0.0011700885,0.0007982715,0.00043129918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002148475,0.00011025176,0.0044208546,0.00016173042,0.000050738185,0.0012721291,0.0010782336,0.018505083,0.038951155,0.9075692,0.0008424673,0.026823299],"study_design_scores_gemma":[0.000057277153,0.0003310946,0.0019788134,0.000051149622,0.000046145757,0.0015421938,0.0006567707,0.057145163,0.025860775,0.89717937,0.015113011,0.000038296253],"about_ca_topic_score_codex":0.00029986296,"about_ca_topic_score_gemma":0.00024554128,"teacher_disagreement_score":0.0031880112,"about_ca_system_score_codex":0.00050178065,"about_ca_system_score_gemma":0.00030844627,"threshold_uncertainty_score":0.01066494},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06744378,0.00033589252,0.9203307,0.00038537785,0.000089323396,0.00013450808,0.00016699954,0.00043010496,0.010683298],"genre_scores_gemma":[0.7523183,0.00045926162,0.23809652,0.00042504986,0.00013073148,0.00054114655,0.0003318798,0.00027812252,0.007418867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675673,0.0012697016,0.00019721236,0.00053518044,0.0008257726,0.00041530808],"domain_scores_gemma":[0.99488395,0.0030086914,0.00044764092,0.000982977,0.0004247111,0.0002520468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023529103,0.0008438114,0.0010292708,0.00074503757,0.0007521459,0.0016940612,0.0014212987,0.0013190466,0.004711075],"category_scores_gemma":[0.011513299,0.00064910995,0.00093059224,0.0007468196,0.002512368,0.003353737,0.0033340994,0.0021599238,0.0010534147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017037835,0.00006160494,0.00039429206,0.0001379162,0.000028528391,0.00009403884,0.00013598433,0.093798585,0.007087798,0.86159724,0.0020314106,0.034462135],"study_design_scores_gemma":[0.000048901125,0.00015138414,0.00012141364,0.000045349887,0.000014110183,0.00010265577,0.000034012042,0.54239464,0.008470899,0.44589344,0.00268256,0.00004072689],"about_ca_topic_score_codex":0.00030953978,"about_ca_topic_score_gemma":0.00051809207,"teacher_disagreement_score":0.004711075,"about_ca_system_score_codex":0.0011207884,"about_ca_system_score_gemma":0.0011242781,"threshold_uncertainty_score":0.015760064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42584714,0.0009080801,0.4342239,0.0010736295,0.00039653547,0.00015371862,0.0011436587,0.0014509301,0.13480231],"genre_scores_gemma":[0.8184939,0.0007572595,0.14372714,0.0005567753,0.00025211816,0.00036777658,0.0010860963,0.0004859992,0.034272905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991843,0.00014676707,0.00006654199,0.00017733366,0.00025147578,0.00017358655],"domain_scores_gemma":[0.9988746,0.00045103097,0.00013659766,0.00024042325,0.00018593128,0.00011151754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076565595,0.00050402264,0.00057085435,0.0013793277,0.0021001478,0.0020776016,0.0008149823,0.0008127375,0.007395652],"category_scores_gemma":[0.0033665502,0.00028436474,0.00092158857,0.0012946264,0.001959024,0.0024851663,0.001732938,0.0017108887,0.0017038893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037570117,0.000023563887,0.00091443956,0.000042866464,0.000005225701,0.00017859919,0.00028378688,0.0013848685,0.0034168288,0.9802964,0.0015519025,0.0118639385],"study_design_scores_gemma":[0.000036881043,0.00014233541,0.0020272613,0.00010806869,0.000020307907,0.0011301985,0.00026647683,0.029511137,0.00887698,0.92064106,0.03716105,0.00007823249],"about_ca_topic_score_codex":0.001066582,"about_ca_topic_score_gemma":0.0013221048,"teacher_disagreement_score":0.007395652,"about_ca_system_score_codex":0.0011424517,"about_ca_system_score_gemma":0.0008544535,"threshold_uncertainty_score":0.024740934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20390587,0.007554556,0.62388015,0.0026139973,0.0013972237,0.0003691465,0.0016740697,0.023830412,0.13477471],"genre_scores_gemma":[0.93581015,0.001074864,0.045438588,0.00038904537,0.00022896526,0.0000678358,0.00049100415,0.00013216508,0.016367491],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992822,0.00012397247,0.00004677965,0.00013356512,0.0002547192,0.0001587799],"domain_scores_gemma":[0.9994185,0.00008498941,0.00007130597,0.0001979575,0.00016241695,0.00006483695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039299464,0.00037966462,0.00045382252,0.0013000842,0.00052562443,0.0016122052,0.00068060233,0.0010852902,0.01235019],"category_scores_gemma":[0.00088281825,0.00019224729,0.0003530444,0.0011889747,0.0002335254,0.0018571862,0.0013078481,0.00059690425,0.006405332],"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.0010101689,0.00036756662,0.0077723376,0.0004432605,0.00011586697,0.0016049047,0.00032719874,0.009567923,0.12996228,0.0464069,0.044457268,0.7579643],"study_design_scores_gemma":[0.0001330157,0.00081879576,0.023153825,0.000368017,0.00019422617,0.008293905,0.00066797633,0.50491935,0.12834917,0.061856292,0.27092475,0.00032074965],"about_ca_topic_score_codex":0.001078397,"about_ca_topic_score_gemma":0.0007881765,"teacher_disagreement_score":0.01235019,"about_ca_system_score_codex":0.0005957045,"about_ca_system_score_gemma":0.00034871828,"threshold_uncertainty_score":0.041315556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7273815,0.0018745258,0.21115947,0.0020778703,0.00047292514,0.00031923453,0.0006064712,0.003583185,0.052524783],"genre_scores_gemma":[0.94960046,0.00017920863,0.043335356,0.00029627857,0.000100901525,0.00006878661,0.0001480244,0.000039417817,0.0062315576],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929583,0.00016946632,0.000030940915,0.00013998243,0.00020676565,0.00015692067],"domain_scores_gemma":[0.9990747,0.00020300846,0.00009267357,0.00017530925,0.000365774,0.00008860431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069214747,0.0005696874,0.0006646376,0.0011503323,0.001861752,0.0012303741,0.00089143706,0.0009789314,0.005280012],"category_scores_gemma":[0.0011080196,0.0002549938,0.00027014953,0.0013170964,0.00073324295,0.0013179053,0.0012551694,0.0005986046,0.0007680993],"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.0024885028,0.0005380062,0.010641104,0.0006468109,0.00030539726,0.002185697,0.0014106014,0.021777377,0.5420839,0.12859239,0.016906442,0.27242377],"study_design_scores_gemma":[0.00063957565,0.0015246005,0.005803936,0.00023554671,0.00046477737,0.002314933,0.00046601656,0.63959557,0.2731064,0.029472208,0.04586687,0.00050950074],"about_ca_topic_score_codex":0.003157767,"about_ca_topic_score_gemma":0.0055029634,"teacher_disagreement_score":0.005280012,"about_ca_system_score_codex":0.0008905067,"about_ca_system_score_gemma":0.0013019857,"threshold_uncertainty_score":0.01766342},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073611796,0.00074626587,0.90241724,0.00064183754,0.00036219406,0.00012538706,0.00024510152,0.00080124784,0.021048935],"genre_scores_gemma":[0.6547364,0.0004290818,0.33651167,0.00024588004,0.00012847851,0.000120979144,0.0002946222,0.000059257884,0.007473556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995459,0.00012227654,0.000028185037,0.00006458391,0.00018549408,0.000053422387],"domain_scores_gemma":[0.9988673,0.00051096844,0.00009788991,0.00033702006,0.00015404563,0.000032824053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052262144,0.0003128308,0.00035608181,0.0006565048,0.0004172169,0.00077519525,0.000575814,0.00058510114,0.002348243],"category_scores_gemma":[0.0020666274,0.00018460845,0.00030636546,0.0013205694,0.0009684907,0.001165107,0.0008393243,0.0007314532,0.00049516413],"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.0003482774,0.000102401704,0.0005928937,0.00016218018,0.000023382036,0.00032872712,0.00017276013,0.03321173,0.05288727,0.70842236,0.0029138154,0.20083414],"study_design_scores_gemma":[0.00011537275,0.00023685009,0.00044138328,0.000055483823,0.000026499567,0.0005222618,0.000042259493,0.61502224,0.10590501,0.25596443,0.02158545,0.000082812774],"about_ca_topic_score_codex":0.00053762214,"about_ca_topic_score_gemma":0.0009322548,"teacher_disagreement_score":0.002348243,"about_ca_system_score_codex":0.00060076395,"about_ca_system_score_gemma":0.0006483038,"threshold_uncertainty_score":0.007855654},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010134006,0.005819556,0.21065794,0.002534438,0.00067952456,0.0000973743,0.0010377532,0.00041974612,0.7686197],"genre_scores_gemma":[0.33116508,0.020745711,0.1728844,0.0017522331,0.0017046023,0.00044691318,0.0028160198,0.00094915583,0.4675359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955755,0.00007046621,0.000016458955,0.0001374715,0.00015043604,0.000067537396],"domain_scores_gemma":[0.999726,0.000113712405,0.000023231543,0.000071779985,0.00003790903,0.000027355962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688389,0.000683013,0.0010916663,0.0010113443,0.0018022141,0.0042843963,0.0009893177,0.0009750549,0.032732807],"category_scores_gemma":[0.0010671249,0.0007164266,0.00075007416,0.0025002349,0.0023703633,0.004949646,0.0015788106,0.0031264652,0.0074136285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011627653,0.000010780189,0.000026256375,0.0000772558,0.000005439853,0.000019221376,0.000035397818,0.003218157,0.00022595881,0.95623547,0.014884305,0.02525006],"study_design_scores_gemma":[0.0000059242825,0.000009244605,0.00007977739,0.00004607607,0.0000053576687,0.00007157326,0.00004883424,0.0043006395,0.0003528013,0.88865066,0.10642198,0.000007136719],"about_ca_topic_score_codex":0.0019036053,"about_ca_topic_score_gemma":0.0011960828,"teacher_disagreement_score":0.032732807,"about_ca_system_score_codex":0.0017797871,"about_ca_system_score_gemma":0.0011339054,"threshold_uncertainty_score":0.1095022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005250819,0.00006959768,0.9931954,0.00013071264,0.000020375164,0.000020215179,0.000033965393,0.0002580465,0.001020823],"genre_scores_gemma":[0.23809205,0.00023990276,0.7581177,0.00022119562,0.00007160757,0.00024460084,0.00028715286,0.0001558413,0.0025699376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990589,0.00037469293,0.000036053236,0.00012464436,0.00030671156,0.00009897121],"domain_scores_gemma":[0.9983115,0.0010138995,0.00012209515,0.0002845449,0.0002039101,0.000064120584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015025337,0.0013197599,0.0011487457,0.00050829287,0.00044601873,0.0013218266,0.0012167472,0.0011326338,0.0021873906],"category_scores_gemma":[0.0056807008,0.0005798709,0.00060516485,0.00082396215,0.0014188044,0.0016924993,0.0017742383,0.0017382147,0.0007990965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013801,0.00004062884,0.00031318312,0.0000775014,0.000025391346,0.00009329118,0.00006008942,0.89503795,0.0030803978,0.047944203,0.0015445343,0.051644895],"study_design_scores_gemma":[0.000011918609,0.000029078972,0.000023612465,0.0000047938156,0.000002316297,0.000015285957,0.000005339999,0.98670006,0.0010163469,0.0118348,0.00035097453,0.0000054743646],"about_ca_topic_score_codex":0.0030291881,"about_ca_topic_score_gemma":0.004176106,"teacher_disagreement_score":0.0030291881,"about_ca_system_score_codex":0.00086230825,"about_ca_system_score_gemma":0.0028679944,"threshold_uncertainty_score":0.007946253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005114311,0.00015951371,0.00014217036,0.000078943776,0.00002572369,0.000018951547,0.99689484,0.001227304,0.00094120816],"genre_scores_gemma":[0.0007347798,0.00008029869,0.0004900782,0.00003957307,0.000005785256,0.00006275643,0.9980621,0.00008384357,0.00044078214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987896,0.00014477562,0.00013160906,0.00036432638,0.00036380003,0.00020594396],"domain_scores_gemma":[0.9978034,0.00064161664,0.0001948357,0.0006841823,0.0005083084,0.00016772356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173222,0.0039047678,0.001772465,0.004865648,0.0011066799,0.0023948972,0.0041048015,0.0033993672,0.051980026],"category_scores_gemma":[0.0058699055,0.00081104744,0.0014870458,0.008766914,0.0005688594,0.0020291535,0.0017785982,0.0024179525,0.06946049],"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.00014140297,0.000061486506,0.0007709341,0.0008839191,0.00003217304,0.00006482265,0.00002367206,0.0007293526,0.00025160107,0.0009000472,0.99033165,0.0058090114],"study_design_scores_gemma":[0.0006045749,0.00005864691,0.0036288004,0.0003690307,0.00003797407,0.00023908356,0.000112177775,0.0025845342,0.0012731395,0.004157289,0.98689073,0.00004399225],"about_ca_topic_score_codex":0.015154067,"about_ca_topic_score_gemma":0.02960246,"teacher_disagreement_score":0.051980026,"about_ca_system_score_codex":0.0020621242,"about_ca_system_score_gemma":0.0020998549,"threshold_uncertainty_score":0.17389047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007673816,0.00015178921,0.00014170645,0.00011318334,0.000032201737,0.000017143268,0.99655426,0.00094547716,0.0012768524],"genre_scores_gemma":[0.00081840274,0.00007626483,0.00038414725,0.000044093507,0.0000069818975,0.000049739523,0.99797815,0.00006301928,0.00057931116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898046,0.00012702189,0.00009792799,0.000314396,0.0003057629,0.0001743524],"domain_scores_gemma":[0.9977976,0.00072150485,0.00020320386,0.00064014463,0.00045754065,0.00017998606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006822031,0.0031212813,0.0016179289,0.0036804667,0.0010840832,0.0022325963,0.0034038515,0.003229473,0.05476726],"category_scores_gemma":[0.005037999,0.0007182289,0.0012236078,0.0066274838,0.00058843713,0.002183592,0.0015594475,0.0024181216,0.06686718],"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.00012135704,0.000057695925,0.0007516157,0.0005892319,0.000019939956,0.00005162206,0.000027086653,0.0005688533,0.00026205598,0.0011013987,0.99226016,0.0041890526],"study_design_scores_gemma":[0.00059209083,0.00006369176,0.0047494303,0.00037225915,0.000033553602,0.00024213488,0.00014817002,0.002979985,0.0013734527,0.005029533,0.9843725,0.00004305427],"about_ca_topic_score_codex":0.013487836,"about_ca_topic_score_gemma":0.028214527,"teacher_disagreement_score":0.05476726,"about_ca_system_score_codex":0.0021552448,"about_ca_system_score_gemma":0.0017990618,"threshold_uncertainty_score":0.18321472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064013334,0.00020504935,0.0001653661,0.00010867461,0.000031652577,0.000023459359,0.99640083,0.0012980206,0.0011267347],"genre_scores_gemma":[0.0009230212,0.00009106282,0.00051412336,0.000046734207,0.0000063801344,0.00007219337,0.9977623,0.00007071941,0.0005134763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988752,0.00013363824,0.00011519699,0.00034225453,0.0003345511,0.00019919104],"domain_scores_gemma":[0.9981159,0.0005398861,0.00016667394,0.0005771125,0.00044120313,0.00015919693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006947546,0.003924201,0.0017244279,0.004327418,0.0010807291,0.002321388,0.004441039,0.0033847562,0.04834095],"category_scores_gemma":[0.00526662,0.0007562551,0.0014840178,0.0076805684,0.0005683402,0.0019065129,0.0017384331,0.0022886186,0.061964504],"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.00014879389,0.00006838721,0.0008192965,0.00078338844,0.00003427286,0.00007457692,0.000022602439,0.00091720506,0.00024295971,0.0009248935,0.99008346,0.005879951],"study_design_scores_gemma":[0.00066462497,0.00007184747,0.003929823,0.00035601147,0.00004240416,0.000280297,0.00012385123,0.0037132432,0.0013920235,0.004660785,0.9847162,0.00004900474],"about_ca_topic_score_codex":0.019105516,"about_ca_topic_score_gemma":0.036487076,"teacher_disagreement_score":0.04834095,"about_ca_system_score_codex":0.0023163292,"about_ca_system_score_gemma":0.0021110906,"threshold_uncertainty_score":0.16171658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007673816,0.00015178921,0.00014170645,0.00011318334,0.000032201737,0.000017143268,0.99655426,0.00094547716,0.0012768524],"genre_scores_gemma":[0.00081840274,0.00007626483,0.00038414725,0.000044093507,0.0000069818975,0.000049739523,0.99797815,0.00006301928,0.00057931116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898046,0.00012702189,0.00009792799,0.000314396,0.0003057629,0.0001743524],"domain_scores_gemma":[0.9977976,0.00072150485,0.00020320386,0.00064014463,0.00045754065,0.00017998606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006822031,0.0031212813,0.0016179289,0.0036804667,0.0010840832,0.0022325963,0.0034038515,0.003229473,0.05476726],"category_scores_gemma":[0.005037999,0.0007182289,0.0012236078,0.0066274838,0.00058843713,0.002183592,0.0015594475,0.0024181216,0.06686718],"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.00012135704,0.000057695925,0.0007516157,0.0005892319,0.000019939956,0.00005162206,0.000027086653,0.0005688533,0.00026205598,0.0011013987,0.99226016,0.0041890526],"study_design_scores_gemma":[0.00059209083,0.00006369176,0.0047494303,0.00037225915,0.000033553602,0.00024213488,0.00014817002,0.002979985,0.0013734527,0.005029533,0.9843725,0.00004305427],"about_ca_topic_score_codex":0.013487836,"about_ca_topic_score_gemma":0.028214527,"teacher_disagreement_score":0.05476726,"about_ca_system_score_codex":0.0021552448,"about_ca_system_score_gemma":0.0017990618,"threshold_uncertainty_score":0.18321472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005114311,0.00015951371,0.00014217036,0.000078943776,0.00002572369,0.000018951547,0.99689484,0.001227304,0.00094120816],"genre_scores_gemma":[0.0007347798,0.00008029869,0.0004900782,0.00003957307,0.000005785256,0.00006275643,0.9980621,0.00008384357,0.00044078214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987896,0.00014477562,0.00013160906,0.00036432638,0.00036380003,0.00020594396],"domain_scores_gemma":[0.9978034,0.00064161664,0.0001948357,0.0006841823,0.0005083084,0.00016772356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173222,0.0039047678,0.001772465,0.004865648,0.0011066799,0.0023948972,0.0041048015,0.0033993672,0.051980026],"category_scores_gemma":[0.0058699055,0.00081104744,0.0014870458,0.008766914,0.0005688594,0.0020291535,0.0017785982,0.0024179525,0.06946049],"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.00014140297,0.000061486506,0.0007709341,0.0008839191,0.00003217304,0.00006482265,0.00002367206,0.0007293526,0.00025160107,0.0009000472,0.99033165,0.0058090114],"study_design_scores_gemma":[0.0006045749,0.00005864691,0.0036288004,0.0003690307,0.00003797407,0.00023908356,0.000112177775,0.0025845342,0.0012731395,0.004157289,0.98689073,0.00004399225],"about_ca_topic_score_codex":0.015154067,"about_ca_topic_score_gemma":0.02960246,"teacher_disagreement_score":0.051980026,"about_ca_system_score_codex":0.0020621242,"about_ca_system_score_gemma":0.0020998549,"threshold_uncertainty_score":0.17389047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46948513,0.0011136008,0.4467855,0.0008829738,0.00027172628,0.00019061132,0.0004743978,0.0006704971,0.08012552],"genre_scores_gemma":[0.78756595,0.00040654876,0.19836952,0.00030298182,0.000098101205,0.00022855029,0.00041893712,0.00011106944,0.012498388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999071,0.00034478973,0.000055205088,0.00020013255,0.0001948939,0.00013395105],"domain_scores_gemma":[0.9989968,0.00032161394,0.00013502211,0.00032949995,0.00010351706,0.00011355071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229418,0.00041981856,0.0003848673,0.0010050242,0.0011378543,0.0009663777,0.0005369687,0.0005278252,0.003837072],"category_scores_gemma":[0.0018641771,0.00034358795,0.0005933297,0.00096039317,0.0016030478,0.0011599665,0.0020719504,0.0010856558,0.00070164964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068840716,0.00001638054,0.0008624915,0.000073160045,0.000010326899,0.0002076846,0.00036801762,0.003036739,0.006601988,0.965652,0.0012106212,0.021891885],"study_design_scores_gemma":[0.00004765595,0.000118081756,0.00078330364,0.00007784581,0.000021820815,0.00096236414,0.00022418665,0.021828337,0.010196699,0.9052055,0.060497433,0.000036858164],"about_ca_topic_score_codex":0.00020970646,"about_ca_topic_score_gemma":0.00034592088,"teacher_disagreement_score":0.003837072,"about_ca_system_score_codex":0.00095436245,"about_ca_system_score_gemma":0.0003455306,"threshold_uncertainty_score":0.012836337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7479505,0.00062485517,0.1525215,0.0005491957,0.000118453536,0.00019682953,0.0010569652,0.0002284369,0.09675321],"genre_scores_gemma":[0.93450993,0.00051756325,0.048310697,0.00023110354,0.000042653548,0.00013278515,0.0013676556,0.00009823774,0.014789266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997688,0.00003069118,0.000009879094,0.00005548642,0.000052681087,0.000082493694],"domain_scores_gemma":[0.99945647,0.00015742393,0.00014359047,0.000076824144,0.00008334992,0.000082331346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020322323,0.00048713383,0.00025011043,0.0010947265,0.0007988711,0.0009633064,0.00040167457,0.00035755304,0.007710671],"category_scores_gemma":[0.00094599207,0.00026871357,0.00047339176,0.00085027766,0.0011539013,0.00088079553,0.0007188908,0.00092183583,0.0007509957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003357615,0.000084203435,0.0017447616,0.00024281656,0.000038644568,0.0006424713,0.001105163,0.02365139,0.019169495,0.9068498,0.0058733434,0.04026213],"study_design_scores_gemma":[0.00008004603,0.00008546215,0.003246544,0.00010256025,0.000052251176,0.000579343,0.0009300285,0.04920525,0.008076095,0.92020744,0.017397903,0.000037234448],"about_ca_topic_score_codex":0.0026225583,"about_ca_topic_score_gemma":0.0045718825,"teacher_disagreement_score":0.007710671,"about_ca_system_score_codex":0.0006406417,"about_ca_system_score_gemma":0.0004075164,"threshold_uncertainty_score":0.025794744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9198149,0.00033361124,0.029055046,0.00010911159,0.00008478483,0.0000737751,0.0010907361,0.00021187509,0.04922612],"genre_scores_gemma":[0.9779198,0.000161998,0.013282469,0.000059806734,0.000017334616,0.00003236347,0.0016128351,0.000041885356,0.0068713734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978787,0.000024400584,0.000010668429,0.0000487769,0.000048925842,0.000079210564],"domain_scores_gemma":[0.9996087,0.00009087731,0.0000921515,0.00007067563,0.000052937135,0.00008470083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012536178,0.00028925986,0.000355017,0.0007450904,0.0007952982,0.00091430574,0.00031159312,0.00040269783,0.0071967924],"category_scores_gemma":[0.00042670526,0.0001935661,0.00038103212,0.0007637889,0.00083811476,0.00075771887,0.0008474975,0.00051824393,0.0011541718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027596008,0.00028914062,0.048430014,0.0007887684,0.0001319892,0.003995283,0.0021556348,0.027821956,0.08160127,0.6860251,0.018194664,0.12780654],"study_design_scores_gemma":[0.00020936737,0.0012235402,0.071805835,0.00052913325,0.00016146158,0.013541716,0.008433834,0.090332985,0.06925661,0.5985206,0.14579323,0.00019174439],"about_ca_topic_score_codex":0.000765351,"about_ca_topic_score_gemma":0.0009636534,"teacher_disagreement_score":0.0071967924,"about_ca_system_score_codex":0.00031133805,"about_ca_system_score_gemma":0.00020926325,"threshold_uncertainty_score":0.024075627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67396975,0.00052365585,0.2053611,0.0005421617,0.00021746235,0.00021935655,0.0007695379,0.00037746358,0.118019596],"genre_scores_gemma":[0.87435645,0.00040459618,0.10339363,0.00012965649,0.00012610582,0.00023442184,0.0007610269,0.00012347414,0.020470593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997044,0.00004067264,0.000011676869,0.000052920448,0.000114743845,0.00007550612],"domain_scores_gemma":[0.9995906,0.00009883113,0.00006906965,0.000058311038,0.00006713921,0.00011608219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015266683,0.0003468756,0.00034017354,0.0012938264,0.0010162939,0.0015565264,0.0006115542,0.0004716282,0.009362388],"category_scores_gemma":[0.00062126224,0.00037409223,0.0003556457,0.0007371827,0.0012582415,0.0009148472,0.0013588797,0.001443323,0.0013325555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014541578,0.000077918354,0.0008620577,0.00012974415,0.000012341837,0.0006379325,0.00033790313,0.012009315,0.029284868,0.91965556,0.0036230786,0.033223867],"study_design_scores_gemma":[0.00013515452,0.00044975054,0.003847311,0.00011770458,0.000032134052,0.0030096115,0.0012166692,0.11996191,0.036366045,0.7454461,0.08925844,0.00015906805],"about_ca_topic_score_codex":0.00048515608,"about_ca_topic_score_gemma":0.0005291112,"teacher_disagreement_score":0.009362388,"about_ca_system_score_codex":0.00046833453,"about_ca_system_score_gemma":0.00032886572,"threshold_uncertainty_score":0.031320333},"labels":[],"label_agreement":null},{"id":"W4394931129","doi":"10.1002/jcd.21937","title":"On equitably 2‐colourable odd cycle decompositions","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics","score_opus":0.012082366208100104,"score_gpt":0.23988717804543583,"score_spread":0.22780481183733572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394931129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8336353,0.00023685941,0.14643368,0.00021120424,0.0000342896,0.00009444594,0.000293345,0.00009732593,0.018963667],"genre_scores_gemma":[0.9725238,0.000117406336,0.02275493,0.00008298286,0.000021392418,0.00008145593,0.00029968182,0.000042520947,0.0040757423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.00019268553,0.000045512767,0.00016721868,0.0001551741,0.00028300151],"domain_scores_gemma":[0.9981205,0.0007858217,0.00031349927,0.00024000496,0.0002726983,0.00026739785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007750346,0.00049779296,0.00044730733,0.0010964767,0.00084385317,0.0013226917,0.0005250876,0.0004918271,0.005057893],"category_scores_gemma":[0.0030851904,0.0003636563,0.00035227084,0.0006831432,0.0009951869,0.0013721093,0.0012718987,0.00072760024,0.00032599602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009480873,0.00019865809,0.005843797,0.00022880107,0.000051135743,0.000676889,0.0013425064,0.06629897,0.032928344,0.8445555,0.0031345377,0.043792937],"study_design_scores_gemma":[0.0001096844,0.00015768816,0.0023792211,0.000076052056,0.00003626409,0.0005793425,0.000732215,0.17841282,0.013850414,0.7925613,0.011062139,0.000042862182],"about_ca_topic_score_codex":0.0009021732,"about_ca_topic_score_gemma":0.0010990965,"teacher_disagreement_score":0.005057893,"about_ca_system_score_codex":0.0008675168,"about_ca_system_score_gemma":0.00045332592,"threshold_uncertainty_score":0.016920388},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012294073,0.0046486505,0.12174047,0.009346087,0.0024788487,0.000023872228,0.00010335955,0.00020950951,0.8491552],"genre_scores_gemma":[0.30228388,0.0076125083,0.042852707,0.0032380149,0.0030707223,0.00008919083,0.00011802408,0.00039636513,0.64033854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996326,0.000101507794,0.000010761839,0.00008114462,0.000107120395,0.00006687033],"domain_scores_gemma":[0.9990396,0.00048003832,0.0000629524,0.00015486033,0.00018443899,0.00007799486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008560903,0.000523059,0.00039442634,0.0008451105,0.0018315675,0.0031564808,0.00077903713,0.0016407735,0.023337083],"category_scores_gemma":[0.0028100463,0.00040767086,0.00026215983,0.0010741825,0.0034439482,0.006651615,0.0015996828,0.0033167184,0.0055602035],"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.000004874608,0.0000031031973,0.0000139876265,0.0000058579926,3.3968757e-7,0.000008754836,0.000088196866,0.000048301677,0.00006931655,0.9867997,0.0042464314,0.00871123],"study_design_scores_gemma":[0.0000060563475,0.0000142114295,0.000092573166,0.000036553374,0.0000041088597,0.000082884304,0.00026149105,0.0012112845,0.00040151924,0.89047146,0.10741084,0.000007011831],"about_ca_topic_score_codex":0.0019094269,"about_ca_topic_score_gemma":0.0040625753,"teacher_disagreement_score":0.023337083,"about_ca_system_score_codex":0.0011646682,"about_ca_system_score_gemma":0.0008289962,"threshold_uncertainty_score":0.07807034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022607008,0.0046546673,0.22529495,0.0016874069,0.0015396974,0.0001163112,0.0004610026,0.0005415469,0.74309736],"genre_scores_gemma":[0.41351426,0.009153508,0.11198598,0.0012127146,0.0012558211,0.0002994404,0.0008269491,0.00075972837,0.4609916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996401,0.00010474018,0.000011294703,0.000068453686,0.00011184764,0.000063467814],"domain_scores_gemma":[0.9993807,0.00030577165,0.000033383112,0.00012235397,0.00010328994,0.000054478634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026566104,0.0006570698,0.0004582773,0.0010122147,0.001097076,0.0024519523,0.00066454423,0.0008149015,0.02472497],"category_scores_gemma":[0.0016529653,0.0004847488,0.00048741346,0.0016648227,0.0019752975,0.0028414084,0.0012083362,0.0024785625,0.0036341196],"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.0000075908347,0.0000042288457,0.000017915087,0.000028729122,0.0000022028569,0.000017834831,0.00012462461,0.0009476295,0.00037762334,0.9801529,0.0054236525,0.012895013],"study_design_scores_gemma":[0.0000033567112,0.0000073032593,0.0000370842,0.000016835305,0.0000027061828,0.000043564756,0.00004503136,0.0015790898,0.00020327531,0.9537597,0.04429827,0.0000038995613],"about_ca_topic_score_codex":0.0015640612,"about_ca_topic_score_gemma":0.0015926234,"teacher_disagreement_score":0.02472497,"about_ca_system_score_codex":0.0012581468,"about_ca_system_score_gemma":0.00051927194,"threshold_uncertainty_score":0.08271325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009151639,0.035841934,0.1007911,0.08497186,0.03433482,0.00011117088,0.00074807735,0.0020194545,0.73203],"genre_scores_gemma":[0.17063327,0.017904788,0.074994765,0.026374264,0.0075345025,0.00021225598,0.00052329374,0.0016390979,0.70018375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992797,0.00016496904,0.00003921132,0.00013362429,0.00026307002,0.000119486474],"domain_scores_gemma":[0.99837327,0.00066154654,0.00009039268,0.00034199446,0.00029418687,0.00023851462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012357404,0.0005010527,0.0005679644,0.00058319006,0.0010119611,0.002685618,0.0009710759,0.0015979861,0.04536083],"category_scores_gemma":[0.0051049013,0.00028001657,0.00035094479,0.0005956156,0.0021422368,0.0046691583,0.0012853012,0.0029822746,0.0149018895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118707954,0.00003491612,0.00013593007,0.0001993775,0.000012063191,0.00004066814,0.0001717298,0.0005569971,0.0015565869,0.60405654,0.19449551,0.19862087],"study_design_scores_gemma":[0.000028657394,0.0000617905,0.00012947676,0.00022964722,0.000012602178,0.00014186687,0.00011222466,0.00108728,0.0014914066,0.226556,0.7701278,0.000021350437],"about_ca_topic_score_codex":0.0022842872,"about_ca_topic_score_gemma":0.0031439418,"teacher_disagreement_score":0.04536083,"about_ca_system_score_codex":0.0016676148,"about_ca_system_score_gemma":0.0016763622,"threshold_uncertainty_score":0.15174711},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11829464,0.0004384731,0.85982233,0.0006667044,0.0001054061,0.0001446877,0.00014354286,0.00064978,0.019734558],"genre_scores_gemma":[0.8250086,0.0003559734,0.1655754,0.0003097314,0.0001087162,0.00036879684,0.00019382291,0.00020027038,0.007878692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981558,0.0006702351,0.00009908318,0.00029762046,0.0004877548,0.0002895598],"domain_scores_gemma":[0.9973641,0.001174677,0.00028898515,0.0008908231,0.0001638583,0.00011757805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009968295,0.000515233,0.0005696695,0.00054831826,0.0007748153,0.001268025,0.00089807494,0.00090410816,0.0044379053],"category_scores_gemma":[0.00443839,0.00047415184,0.00059898215,0.00063964544,0.002446308,0.0027552787,0.002382924,0.001521184,0.0010768115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007281997,0.00003486414,0.00018809561,0.000067546214,0.0000091608645,0.000050979652,0.00010276334,0.012658824,0.0054997597,0.9599504,0.0009862586,0.020378526],"study_design_scores_gemma":[0.000080744634,0.00013244625,0.00019714101,0.000046033285,0.000014799513,0.00017005706,0.000051158557,0.13236062,0.01850623,0.8410444,0.0073492294,0.000047112124],"about_ca_topic_score_codex":0.00028222127,"about_ca_topic_score_gemma":0.0003998314,"teacher_disagreement_score":0.0044379053,"about_ca_system_score_codex":0.00087576476,"about_ca_system_score_gemma":0.000952969,"threshold_uncertainty_score":0.014846206},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069593405,0.0007291751,0.96123123,0.00046489414,0.00040108705,0.0000789553,0.000055123626,0.00030168565,0.02977863],"genre_scores_gemma":[0.1563145,0.004214095,0.80411476,0.001169397,0.00069389155,0.00037513944,0.0001647736,0.000500832,0.032452676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.00018996203,0.000022126585,0.000067405635,0.00015574732,0.000046960507],"domain_scores_gemma":[0.99905986,0.00041912423,0.000054523713,0.00027791067,0.00014286868,0.000045705052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011980565,0.0012077482,0.00057535426,0.0016767045,0.0010464626,0.001524305,0.0012386244,0.000991071,0.0046030963],"category_scores_gemma":[0.0035394093,0.0003993309,0.0010067794,0.0013780332,0.0025139423,0.0024824184,0.0016008111,0.0025812124,0.0024054674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014539923,0.000023155073,0.0001283252,0.000081543345,0.000011225503,0.00016811083,0.0002683525,0.0057887333,0.003224659,0.9592307,0.0021519049,0.02890884],"study_design_scores_gemma":[0.000013237167,0.000045137615,0.00014590737,0.000055631943,0.000012148438,0.0005005705,0.00009635797,0.07043864,0.0036484702,0.8899207,0.035076503,0.000046726498],"about_ca_topic_score_codex":0.0013165615,"about_ca_topic_score_gemma":0.0018572896,"teacher_disagreement_score":0.0046030963,"about_ca_system_score_codex":0.0006660958,"about_ca_system_score_gemma":0.00067670364,"threshold_uncertainty_score":0.01539886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6576094,0.0013821084,0.22631405,0.005994503,0.00012175557,0.00026703754,0.0063056,0.0014813725,0.10052414],"genre_scores_gemma":[0.96359175,0.0005367557,0.026840353,0.00040569727,0.00007424687,0.00017134812,0.0021194022,0.00016117159,0.0060993247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989374,0.00013251587,0.00004288156,0.0003030323,0.00032807566,0.0002560276],"domain_scores_gemma":[0.992392,0.0053911563,0.00065712404,0.00064431824,0.00041912694,0.00049623445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059379416,0.0004780131,0.0004930149,0.0008527137,0.0015793525,0.0025830274,0.0013262571,0.00092669914,0.011717269],"category_scores_gemma":[0.006806387,0.00055369723,0.00062971236,0.0022603902,0.0018953633,0.003452434,0.0012289323,0.0028938847,0.0012753814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015192872,0.0004632162,0.02232618,0.0010427495,0.00014497997,0.0009172954,0.000904532,0.18120079,0.05682162,0.581002,0.048179153,0.10547814],"study_design_scores_gemma":[0.0001277566,0.00014204964,0.009343335,0.00008072068,0.00009760908,0.0014134876,0.0002459203,0.2589445,0.030581959,0.68175286,0.017203735,0.00006608102],"about_ca_topic_score_codex":0.003215217,"about_ca_topic_score_gemma":0.0034274128,"teacher_disagreement_score":0.011717269,"about_ca_system_score_codex":0.002263372,"about_ca_system_score_gemma":0.0012965982,"threshold_uncertainty_score":0.03919816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43990424,0.0012494941,0.39603856,0.004754999,0.00086022995,0.00061260874,0.009048886,0.002926922,0.14460407],"genre_scores_gemma":[0.8958489,0.0012031996,0.06645264,0.0016195956,0.00090094353,0.00059092365,0.012044097,0.0009569033,0.020382812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955149,0.0005612894,0.00052351743,0.001345956,0.0009118145,0.0011425323],"domain_scores_gemma":[0.97892,0.010680408,0.0017528082,0.0030611644,0.0031850692,0.0024005892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034273232,0.0010908007,0.0016415439,0.0021079679,0.0031728954,0.004874076,0.002144551,0.0036396992,0.023415484],"category_scores_gemma":[0.021758582,0.0020369668,0.0028029562,0.0024597733,0.0037050429,0.011287627,0.0052634254,0.006015647,0.0047194175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001006164,0.00018713271,0.0060026012,0.0004992272,0.00011388817,0.0014441609,0.0014880609,0.00732547,0.019754708,0.93448985,0.010154968,0.017533751],"study_design_scores_gemma":[0.00032821103,0.00043952063,0.0037025525,0.00021299576,0.00019616175,0.0032252653,0.0015685214,0.026625799,0.018589865,0.9107802,0.034181267,0.00014962758],"about_ca_topic_score_codex":0.0015312786,"about_ca_topic_score_gemma":0.0016240854,"teacher_disagreement_score":0.023415484,"about_ca_system_score_codex":0.0015139319,"about_ca_system_score_gemma":0.0016718212,"threshold_uncertainty_score":0.07833254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12003638,0.0019480948,0.81301916,0.00097185763,0.00044033412,0.00014313932,0.00037027305,0.000367901,0.06270295],"genre_scores_gemma":[0.72774726,0.0032515842,0.24063061,0.0010672138,0.00043407286,0.00031003065,0.000646565,0.00044497426,0.025467776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992125,0.00022333098,0.000031765303,0.000117896205,0.00029195234,0.0001224307],"domain_scores_gemma":[0.99880755,0.00062975124,0.00013609829,0.00013943145,0.00021923285,0.00006792125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786872,0.0013633975,0.0007063646,0.0013861655,0.00082800735,0.0016672243,0.0009455329,0.0011010509,0.0051764264],"category_scores_gemma":[0.004711513,0.00052709115,0.00054775225,0.00232932,0.0014456786,0.0017207128,0.0016333028,0.0016635339,0.0012232949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001399363,0.00004140266,0.00025981682,0.00012049384,0.000023685408,0.00007399217,0.00013615434,0.070446745,0.009132811,0.8736921,0.0035607095,0.042372115],"study_design_scores_gemma":[0.000047245565,0.000078964935,0.00021851521,0.00011590081,0.00002901029,0.00016724212,0.00008157566,0.27362692,0.006136661,0.712904,0.006535292,0.000058651265],"about_ca_topic_score_codex":0.0020644118,"about_ca_topic_score_gemma":0.0037700026,"teacher_disagreement_score":0.0051764264,"about_ca_system_score_codex":0.0014946053,"about_ca_system_score_gemma":0.0016731215,"threshold_uncertainty_score":0.017316878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042499434,0.0009337925,0.9398098,0.0008138802,0.00013863336,0.00010187138,0.00026699505,0.0005736075,0.014861912],"genre_scores_gemma":[0.71632713,0.0011311695,0.26717466,0.0007814025,0.0002883108,0.00047196835,0.00051034015,0.00031708885,0.012997958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970509,0.000892492,0.00020086655,0.0006753215,0.00077546964,0.00040496385],"domain_scores_gemma":[0.9930207,0.0036396782,0.0005934408,0.0022340629,0.00036046407,0.00015167249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016699623,0.0006679408,0.0008239324,0.0007529477,0.0011590162,0.002487683,0.0011597145,0.001402135,0.0053348285],"category_scores_gemma":[0.011681923,0.0007032382,0.0009524721,0.0014733304,0.0035889323,0.0075853667,0.005281379,0.0032452815,0.0018075067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001095088,0.00003430378,0.00039725643,0.00010046008,0.00001227459,0.000067439076,0.00016116013,0.010583695,0.0028260152,0.96219915,0.001087287,0.022421414],"study_design_scores_gemma":[0.00004488651,0.00009088127,0.00016502771,0.000051024523,0.000018493627,0.00022862066,0.000060312694,0.043394875,0.008902502,0.93676615,0.010235495,0.000041827137],"about_ca_topic_score_codex":0.00029330488,"about_ca_topic_score_gemma":0.00026046493,"teacher_disagreement_score":0.0053348285,"about_ca_system_score_codex":0.0011356625,"about_ca_system_score_gemma":0.0010113602,"threshold_uncertainty_score":0.017846763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9046953,0.00033439885,0.060785785,0.0014915651,0.000048645717,0.000030733416,0.00054593093,0.00034339775,0.031724278],"genre_scores_gemma":[0.98930055,0.00012336418,0.007303947,0.00016334964,0.000027488126,0.000040229756,0.00021287525,0.00004946311,0.0027786088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942017,0.00011111716,0.000019753455,0.00011199187,0.00020962361,0.00012740812],"domain_scores_gemma":[0.99560153,0.0023276145,0.0004623049,0.0005739484,0.00056175113,0.00047294557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005304466,0.00035126862,0.00043965154,0.000985165,0.0012664655,0.0015504815,0.00066172896,0.0005353081,0.0025700172],"category_scores_gemma":[0.0067148805,0.0003450132,0.00042766938,0.0008406234,0.002030589,0.0020897763,0.0012269603,0.00155692,0.00033400336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033679427,0.00008116679,0.020930897,0.00011568639,0.00002692886,0.00092521857,0.00069132756,0.040175077,0.017716074,0.88472176,0.0072153397,0.027063653],"study_design_scores_gemma":[0.000031593,0.00007899015,0.013631702,0.00003362198,0.00001913767,0.001310045,0.0004007348,0.3033303,0.00961405,0.6612362,0.010257499,0.0000560574],"about_ca_topic_score_codex":0.0018288846,"about_ca_topic_score_gemma":0.0020849353,"teacher_disagreement_score":0.0025700172,"about_ca_system_score_codex":0.00138998,"about_ca_system_score_gemma":0.0005070712,"threshold_uncertainty_score":0.010085046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24370776,0.0031300068,0.66608346,0.0036139458,0.00025044804,0.00047649906,0.0017712795,0.0015887968,0.07937783],"genre_scores_gemma":[0.86723596,0.0009222885,0.122527346,0.00082805933,0.00029176212,0.0013902729,0.0007463869,0.0006663658,0.005391619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9747696,0.008685096,0.0018414856,0.0034841534,0.0087039685,0.0025157754],"domain_scores_gemma":[0.7650507,0.1763619,0.010582733,0.032309912,0.01205298,0.0036418308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0205677,0.001695716,0.0033017506,0.0051315594,0.0025187295,0.0071152006,0.006083493,0.0029039145,0.011386222],"category_scores_gemma":[0.14182681,0.001503792,0.0016552844,0.005900473,0.0064518396,0.019186849,0.008248247,0.005943283,0.0018135235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014218624,0.0004678464,0.0053819455,0.0005748926,0.00012091871,0.0003257282,0.0005088372,0.108550034,0.01096579,0.7967522,0.0036408042,0.071289144],"study_design_scores_gemma":[0.000118895114,0.0005255873,0.0010341541,0.00024804077,0.00006813769,0.00066663336,0.00022291177,0.22311537,0.0151997795,0.7514414,0.0072321077,0.00012695426],"about_ca_topic_score_codex":0.0006199373,"about_ca_topic_score_gemma":0.00048117773,"teacher_disagreement_score":0.0205677,"about_ca_system_score_codex":0.005932548,"about_ca_system_score_gemma":0.0023483962,"threshold_uncertainty_score":0.10877371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011390389,0.016014665,0.90783495,0.00210762,0.0014227467,0.00008610886,0.00006607322,0.00036213858,0.06071529],"genre_scores_gemma":[0.38319921,0.03177873,0.55134463,0.0013340566,0.0040393146,0.00029818027,0.00019155176,0.00024123411,0.027573131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991503,0.00028729494,0.000047637084,0.00012938105,0.0003148257,0.00007054197],"domain_scores_gemma":[0.9986972,0.0007185762,0.00011975544,0.00020066359,0.00020905508,0.00005472742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007575831,0.0009637994,0.0005381664,0.0014600147,0.0008591339,0.0014543724,0.0005538165,0.0013874506,0.004030716],"category_scores_gemma":[0.0034646003,0.0003742622,0.0005887864,0.002030333,0.0022108636,0.0026527517,0.001458443,0.0029807081,0.0019379809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003583896,0.000043777593,0.00015609791,0.0001524351,0.000007435007,0.00015730826,0.00016176491,0.011971514,0.0031695997,0.9154489,0.0028080496,0.06588729],"study_design_scores_gemma":[0.000014577543,0.00007450286,0.00008970038,0.000082144936,0.000008580507,0.00046302672,0.000056221303,0.04749881,0.0035918122,0.91568816,0.032397337,0.000035125533],"about_ca_topic_score_codex":0.0003150462,"about_ca_topic_score_gemma":0.00027669474,"teacher_disagreement_score":0.004030716,"about_ca_system_score_codex":0.00056541635,"about_ca_system_score_gemma":0.0005887294,"threshold_uncertainty_score":0.013484061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77266264,0.0037181685,0.13208313,0.0025753954,0.00020310948,0.00022375712,0.0016141717,0.0008104359,0.08610919],"genre_scores_gemma":[0.9477528,0.0013123321,0.033462714,0.00036831107,0.00019622332,0.00028304002,0.0009886429,0.00015897774,0.015476926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991153,0.00012242558,0.00005563385,0.00024398531,0.0002139104,0.00024876927],"domain_scores_gemma":[0.99740297,0.0013291857,0.00039133104,0.00026356167,0.00028131576,0.00033158506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049265946,0.00076317013,0.00083748816,0.0033541163,0.0021065741,0.0039983676,0.0014210065,0.0009627715,0.0063354624],"category_scores_gemma":[0.005292287,0.0007624014,0.0006186341,0.002541175,0.0025109749,0.0039237905,0.0026809464,0.0018012963,0.0012259498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002326183,0.00005645314,0.00128826,0.00025117252,0.000029847408,0.00023656739,0.00044558878,0.007827539,0.0038904606,0.95722,0.0039063636,0.02461511],"study_design_scores_gemma":[0.000058836038,0.000039300674,0.0006429471,0.00005165444,0.000027014717,0.00024997533,0.000115775685,0.019088976,0.0027519953,0.9687113,0.008232639,0.00002957362],"about_ca_topic_score_codex":0.0022827152,"about_ca_topic_score_gemma":0.0020034867,"teacher_disagreement_score":0.0063354624,"about_ca_system_score_codex":0.0021755085,"about_ca_system_score_gemma":0.0009354126,"threshold_uncertainty_score":0.02119422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76250166,0.0019958937,0.16959007,0.0017584577,0.00055916037,0.000106979656,0.001100631,0.0005160505,0.06187101],"genre_scores_gemma":[0.9459998,0.0009902657,0.03223257,0.00049025775,0.0005629636,0.00007550789,0.0019049154,0.00015328782,0.01759045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935585,0.00012926025,0.00004729445,0.00011450196,0.00022167234,0.00013138412],"domain_scores_gemma":[0.9968652,0.0012487044,0.00056824175,0.000407648,0.0005538279,0.00035639442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053515506,0.0005703198,0.000567244,0.002552716,0.0012238707,0.0024943857,0.000642521,0.0009880894,0.005392966],"category_scores_gemma":[0.0033105118,0.00031170395,0.00042582813,0.0016193627,0.0018239425,0.0021324595,0.0009709695,0.001387039,0.00088601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012381903,0.000084713,0.0018743817,0.00005667859,0.000010174062,0.00012686668,0.00033928984,0.004412214,0.0046142233,0.9503419,0.004694321,0.033321388],"study_design_scores_gemma":[0.000027669423,0.000122003614,0.0015243249,0.000050939252,0.000009011254,0.00048080098,0.00018750221,0.038203888,0.002240279,0.94816667,0.008946207,0.00004068147],"about_ca_topic_score_codex":0.00077251205,"about_ca_topic_score_gemma":0.0006978432,"teacher_disagreement_score":0.005392966,"about_ca_system_score_codex":0.000818718,"about_ca_system_score_gemma":0.0008824642,"threshold_uncertainty_score":0.018041253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78510714,0.00080753333,0.15054369,0.001266123,0.00016634574,0.00006271429,0.00010583121,0.00012816282,0.061812457],"genre_scores_gemma":[0.98241144,0.00022783592,0.009849503,0.00014153443,0.00011606164,0.000028089276,0.000054489832,0.000012659597,0.007158337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995989,0.00009781244,0.000020527761,0.000090087044,0.000086704466,0.00010599037],"domain_scores_gemma":[0.99912053,0.00026225188,0.00020225829,0.000085014726,0.00009343838,0.00023647746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006553915,0.00036898445,0.00032793146,0.00093451375,0.0015465548,0.0013044365,0.00062693405,0.0005333646,0.0051132054],"category_scores_gemma":[0.0014559417,0.00022413496,0.00042682304,0.00058815256,0.0023718725,0.0034054646,0.0016595917,0.0011336495,0.0004736538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017786922,0.000013721238,0.00029678762,0.000015591735,0.000003989127,0.00013092029,0.00007736882,0.0016484685,0.0010784961,0.99484825,0.00022891599,0.0016395883],"study_design_scores_gemma":[0.000024364334,0.000074568445,0.00043303944,0.000012637881,0.0000065142517,0.0003672301,0.00020883343,0.013998476,0.0017969856,0.9807711,0.002284756,0.000021430169],"about_ca_topic_score_codex":0.00037003157,"about_ca_topic_score_gemma":0.00048366925,"teacher_disagreement_score":0.0051132054,"about_ca_system_score_codex":0.0007363661,"about_ca_system_score_gemma":0.00041180945,"threshold_uncertainty_score":0.0171054},"labels":[],"label_agreement":null},{"id":"W4399741283","doi":"10.1002/jcd.21949","title":"Mutual incidence matrix of two balanced incomplete block designs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke","keywords":"Mathematics; Incidence matrix; Eigenvalues and eigenvectors; Block (permutation group theory); Matrix (chemical analysis); Incidence (geometry); Combinatorics; Set (abstract data type); Block design; Computer science; Geometry","score_opus":0.02045178124355624,"score_gpt":0.27014474296842816,"score_spread":0.24969296172487193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399741283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35459727,0.000110176064,0.62562126,0.00014372244,0.000063132095,0.000076012824,0.00017047714,0.0001909472,0.019026982],"genre_scores_gemma":[0.94049734,0.000051976942,0.05506684,0.000040009378,0.0000215342,0.00011034751,0.000091886475,0.00001912588,0.0041009868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988379,0.00036481128,0.00004469209,0.00015586002,0.00045748334,0.00013935631],"domain_scores_gemma":[0.9988398,0.0003423351,0.00027238522,0.0001795199,0.00027524534,0.00009065572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923873,0.00038303994,0.0003717712,0.0007468093,0.00033809963,0.00089516095,0.0004641294,0.00048629366,0.0044830954],"category_scores_gemma":[0.0022847892,0.0002301637,0.00027304346,0.00045963787,0.0005769323,0.0008091589,0.0005827484,0.0003689403,0.0003474382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006537562,0.00016240039,0.0040107337,0.00011148766,0.000096347874,0.0004668317,0.00020351088,0.2172089,0.06944977,0.64238733,0.0016821141,0.06356678],"study_design_scores_gemma":[0.00008519815,0.00050210307,0.002408601,0.00003978898,0.00007233239,0.0005148382,0.00012970691,0.8466893,0.028490283,0.11423967,0.006763556,0.00006468455],"about_ca_topic_score_codex":0.00046799786,"about_ca_topic_score_gemma":0.0005803868,"teacher_disagreement_score":0.0044830954,"about_ca_system_score_codex":0.0005904501,"about_ca_system_score_gemma":0.00042918738,"threshold_uncertainty_score":0.014997482},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27022767,0.0038796968,0.5769717,0.0010888733,0.0005909975,0.00016834002,0.001763517,0.000522471,0.14478675],"genre_scores_gemma":[0.869544,0.0019069529,0.11421914,0.00046658964,0.00037555644,0.00030759067,0.0018047523,0.00013612627,0.011239279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666625,0.00078527344,0.00034200968,0.00085299095,0.00089383736,0.00045955155],"domain_scores_gemma":[0.9956151,0.0018788114,0.00075268326,0.0009721996,0.0005424017,0.00023873655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009080855,0.0007149261,0.00077144906,0.0022838155,0.0026158863,0.006130963,0.0014904964,0.0013225821,0.006686679],"category_scores_gemma":[0.004648162,0.00080077123,0.0015316395,0.0028157134,0.0043784394,0.005959094,0.003724068,0.0025555803,0.0009608645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028375924,0.000010956088,0.0005760099,0.00008042939,0.000023019049,0.00015010306,0.00024036091,0.0029012074,0.0009481161,0.98561376,0.0008691003,0.008558481],"study_design_scores_gemma":[0.000029877196,0.000062111365,0.0018557243,0.00018397691,0.00006952197,0.001482323,0.0006852751,0.013191921,0.0059094946,0.9369956,0.03945471,0.00007945393],"about_ca_topic_score_codex":0.0008833677,"about_ca_topic_score_gemma":0.0005271906,"teacher_disagreement_score":0.006686679,"about_ca_system_score_codex":0.0015617313,"about_ca_system_score_gemma":0.0005589443,"threshold_uncertainty_score":0.022369206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3197302,0.0009927223,0.6109655,0.0003806183,0.0002756413,0.000070165464,0.00027346806,0.00031957118,0.06699215],"genre_scores_gemma":[0.92221683,0.00049464655,0.06455183,0.00027411865,0.0001572251,0.000083955165,0.00024726702,0.00011102054,0.011863222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999253,0.00016426196,0.000061847466,0.00015479859,0.00023712422,0.0001289832],"domain_scores_gemma":[0.99899215,0.00035101824,0.0001308803,0.00021583824,0.00021998845,0.00009021578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063909456,0.00031009625,0.00038768043,0.0011177092,0.0007411452,0.0012323962,0.00070253154,0.0005000929,0.0046517397],"category_scores_gemma":[0.0021325964,0.00024344954,0.00045225918,0.00060823385,0.0015809528,0.0031058062,0.0008825185,0.0010558753,0.00070084666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003910087,0.000008354093,0.00035777522,0.000026581147,0.0000049145283,0.00015069489,0.0000925796,0.0013978636,0.0039180154,0.98102266,0.0003172704,0.012664152],"study_design_scores_gemma":[0.000017634366,0.00006701071,0.0006398358,0.000033890465,0.000014178423,0.001032271,0.0001466412,0.025541473,0.010405506,0.9459783,0.016082026,0.00004119628],"about_ca_topic_score_codex":0.000540201,"about_ca_topic_score_gemma":0.00060195156,"teacher_disagreement_score":0.0046517397,"about_ca_system_score_codex":0.0005727103,"about_ca_system_score_gemma":0.0005737744,"threshold_uncertainty_score":0.015561581},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26530004,0.007883705,0.55741084,0.0016047199,0.0017980463,0.0001512481,0.00068699254,0.0005771408,0.16458735],"genre_scores_gemma":[0.84313023,0.0037635386,0.12991944,0.00069379125,0.0007337039,0.0001068505,0.0006184673,0.00039408682,0.0206398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951875,0.00011837528,0.000033088996,0.00012834121,0.000109732726,0.00009172342],"domain_scores_gemma":[0.9992793,0.0001857267,0.0000991915,0.0001531326,0.00013757384,0.00014499809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820969,0.0006955761,0.00047427526,0.0011429198,0.0010880019,0.0011373975,0.000507737,0.00047815344,0.0040178522],"category_scores_gemma":[0.0013063195,0.0004175866,0.0010920434,0.0008000893,0.0019000762,0.0022798597,0.0016006968,0.0020823325,0.00089904974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006994114,0.00003250949,0.0006985432,0.00019868572,0.000030028656,0.0005960682,0.0006936103,0.005939749,0.0067439433,0.9617478,0.0065535977,0.016695512],"study_design_scores_gemma":[0.000009249204,0.00009865036,0.0011003716,0.00007403185,0.00003436018,0.0009038497,0.00028801075,0.030538995,0.0033243878,0.9388183,0.024763571,0.000046301404],"about_ca_topic_score_codex":0.0010871311,"about_ca_topic_score_gemma":0.0014763162,"teacher_disagreement_score":0.0040178522,"about_ca_system_score_codex":0.00058416696,"about_ca_system_score_gemma":0.00031892952,"threshold_uncertainty_score":0.013441086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6993107,0.0007192533,0.20713922,0.00071863795,0.00008938913,0.00017294177,0.001199258,0.00017016284,0.09048047],"genre_scores_gemma":[0.88500667,0.0009118261,0.092324995,0.00019725999,0.000091549744,0.00022271478,0.0015130363,0.00008767946,0.019644331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995116,0.000117063406,0.000021288295,0.00013217024,0.0001393538,0.00007843773],"domain_scores_gemma":[0.99882406,0.00047062302,0.0003033842,0.00008041083,0.0001234987,0.000198068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003142989,0.00049510534,0.0003614479,0.0016713508,0.0012462538,0.0020932236,0.000851906,0.00075347844,0.00828557],"category_scores_gemma":[0.0022083782,0.0004989488,0.00056037394,0.001209023,0.0016416664,0.0019218433,0.0014874487,0.0015462922,0.0008208374],"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.000073009636,0.0000417793,0.0014472253,0.000082419065,0.00002661648,0.00032218418,0.00026719112,0.04153231,0.002662124,0.9378953,0.0022079078,0.013441815],"study_design_scores_gemma":[0.00004560134,0.0001135478,0.0038154002,0.00006919386,0.000024467907,0.0006023009,0.0005299877,0.21366164,0.0019294706,0.75919706,0.019957837,0.00005347224],"about_ca_topic_score_codex":0.0028121995,"about_ca_topic_score_gemma":0.0016969143,"teacher_disagreement_score":0.00828557,"about_ca_system_score_codex":0.0011290788,"about_ca_system_score_gemma":0.00036714794,"threshold_uncertainty_score":0.027718008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71957004,0.0016900899,0.19563788,0.0033536223,0.0005627863,0.0009288688,0.010548425,0.0022406264,0.0654676],"genre_scores_gemma":[0.931,0.00063330866,0.055285152,0.0004704053,0.00024667615,0.00030705726,0.0077300207,0.0002375705,0.004089699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708337,0.00038329422,0.00029401446,0.0010652312,0.0003714356,0.00080256874],"domain_scores_gemma":[0.9857062,0.006613831,0.0018139326,0.00091620523,0.002518677,0.00243113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398375,0.0015393859,0.0016756753,0.0020546683,0.0026865478,0.0024753546,0.0014268537,0.0025422268,0.009830626],"category_scores_gemma":[0.016810108,0.0010557999,0.0022123598,0.0014561296,0.0026044336,0.004626981,0.0028529246,0.001912472,0.0019912801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005131149,0.00094689295,0.037981603,0.002098609,0.00043388442,0.0066604037,0.0031568678,0.052493256,0.04564001,0.7758138,0.0261064,0.043537136],"study_design_scores_gemma":[0.0007763291,0.0017929281,0.014566199,0.00077049184,0.00039546585,0.005753032,0.004873756,0.14218971,0.046123005,0.7388562,0.04341896,0.00048398582],"about_ca_topic_score_codex":0.0043008784,"about_ca_topic_score_gemma":0.0060650683,"teacher_disagreement_score":0.009830626,"about_ca_system_score_codex":0.0015149789,"about_ca_system_score_gemma":0.0023493818,"threshold_uncertainty_score":0.032886684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92870027,0.0006861827,0.056603484,0.0002895303,0.000027297976,0.000024453746,0.0003280087,0.0000756224,0.013265143],"genre_scores_gemma":[0.9823804,0.00035784664,0.014376243,0.000046819983,0.000041961717,0.000025527519,0.00039915822,0.000041415897,0.0023307109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905473,0.00028844987,0.000051487277,0.0001944971,0.00025817548,0.00015272544],"domain_scores_gemma":[0.9952762,0.0025050424,0.0007996303,0.00035387572,0.0004733001,0.000591933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012425539,0.0006013873,0.00093518407,0.0019129909,0.0007864985,0.0016394617,0.0011496308,0.0007126487,0.0027347484],"category_scores_gemma":[0.0074551795,0.00043469577,0.00046207276,0.0013177376,0.0019533704,0.0040721386,0.0014797322,0.00085569354,0.00032728838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008709908,0.000104561106,0.012536909,0.00026642974,0.000053316908,0.00059220503,0.0010025994,0.07061104,0.008404915,0.87753886,0.0025270295,0.025491176],"study_design_scores_gemma":[0.000077229655,0.00033373028,0.0075626196,0.000101420854,0.000054703425,0.0014028411,0.00092897116,0.28895554,0.0060482235,0.68782836,0.006647085,0.000059272676],"about_ca_topic_score_codex":0.0014833629,"about_ca_topic_score_gemma":0.00075420114,"teacher_disagreement_score":0.0027347484,"about_ca_system_score_codex":0.0012489597,"about_ca_system_score_gemma":0.00034393521,"threshold_uncertainty_score":0.009148657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19029468,0.009095194,0.6492444,0.036759533,0.0022792553,0.00023187576,0.0014119776,0.0013652188,0.10931778],"genre_scores_gemma":[0.66038775,0.00361198,0.29675186,0.0036097418,0.0017161944,0.00032792028,0.0015539889,0.0008298887,0.031210676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971522,0.000952789,0.00016965298,0.0009781651,0.00037393218,0.00037326379],"domain_scores_gemma":[0.9865562,0.009297546,0.00083588535,0.0019187585,0.0006829058,0.0007087315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020730894,0.001062363,0.0015278799,0.00063682906,0.0021949408,0.004176239,0.0027629882,0.0041488297,0.015865138],"category_scores_gemma":[0.016019689,0.0008252547,0.0009942752,0.0015268335,0.0038867132,0.016587693,0.004229239,0.005255707,0.0026237597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030452068,0.00027028713,0.0012902255,0.0008290434,0.00005950487,0.0002568624,0.0007960547,0.028680842,0.0036242947,0.8158383,0.027334422,0.12071571],"study_design_scores_gemma":[0.00006476168,0.00016133106,0.0002534879,0.00011378675,0.00002251548,0.0003401426,0.0006632108,0.042291734,0.002160085,0.922006,0.031884372,0.000038468144],"about_ca_topic_score_codex":0.0005143559,"about_ca_topic_score_gemma":0.0005034198,"teacher_disagreement_score":0.015865138,"about_ca_system_score_codex":0.0010610173,"about_ca_system_score_gemma":0.0008097112,"threshold_uncertainty_score":0.05307418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93857604,0.00058925414,0.04547091,0.0019393301,0.00004017186,0.00005401077,0.0008142995,0.000103342645,0.012412619],"genre_scores_gemma":[0.9870133,0.00038709404,0.008482003,0.00010096565,0.00014692644,0.00007962642,0.00061058946,0.000044538087,0.0031349119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.00038598923,0.00006926292,0.00032773308,0.0005638335,0.00026965298],"domain_scores_gemma":[0.9877038,0.009007031,0.0012285999,0.0007035865,0.000585976,0.0007709403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009839339,0.0005184648,0.00088362786,0.0022447351,0.0010519656,0.003941921,0.0016536076,0.0013537039,0.004762641],"category_scores_gemma":[0.008564479,0.00044929655,0.0006938752,0.0018601763,0.0034178167,0.007636509,0.0021531365,0.0017400515,0.000267152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044905473,0.00016368678,0.009623357,0.00034824468,0.00007839455,0.0004740293,0.0018441934,0.06494661,0.0058176047,0.89258647,0.003984685,0.019683694],"study_design_scores_gemma":[0.000036653804,0.000027592223,0.002652008,0.000022261698,0.000018435647,0.0002209761,0.00031561672,0.10209175,0.0013168254,0.89161444,0.0016541951,0.0000292299],"about_ca_topic_score_codex":0.0014010427,"about_ca_topic_score_gemma":0.0012089245,"teacher_disagreement_score":0.004762641,"about_ca_system_score_codex":0.002580753,"about_ca_system_score_gemma":0.00071063347,"threshold_uncertainty_score":0.01872474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2627471,0.0005679208,0.6998129,0.0004936791,0.000077800476,0.00017672933,0.0018756138,0.00029348713,0.03395481],"genre_scores_gemma":[0.724382,0.00057514734,0.25493532,0.00020685646,0.000082960934,0.00020323117,0.0031348553,0.00010871086,0.016370878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945575,0.00012659232,0.00003240205,0.00015854916,0.0001091979,0.00011744443],"domain_scores_gemma":[0.9990619,0.00025729492,0.00014959494,0.00014874878,0.00020488215,0.00017764975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047425786,0.00054284476,0.00038779448,0.0008402038,0.0005575776,0.0008780483,0.0003945128,0.0004292862,0.0034822444],"category_scores_gemma":[0.0013176367,0.0003256236,0.00057309936,0.0006348142,0.0007716196,0.0010935554,0.00094431493,0.0007967523,0.0006262649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052916113,0.00013796927,0.0025348205,0.0003334282,0.00009237993,0.00072359695,0.0004455353,0.0684894,0.032985006,0.83097845,0.010558667,0.05219152],"study_design_scores_gemma":[0.000102162965,0.00017899525,0.003082261,0.00010525117,0.000070024325,0.0013590821,0.00040279952,0.24488916,0.007576412,0.72293884,0.01924893,0.000046092966],"about_ca_topic_score_codex":0.0019106868,"about_ca_topic_score_gemma":0.0022745174,"teacher_disagreement_score":0.0034822444,"about_ca_system_score_codex":0.00069473765,"about_ca_system_score_gemma":0.0007624228,"threshold_uncertainty_score":0.011649311},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73547876,0.0004046938,0.23892699,0.0003913198,0.00006448135,0.00005856839,0.00037185964,0.00024245196,0.02406096],"genre_scores_gemma":[0.97183436,0.0001766556,0.024418684,0.00006586591,0.000056143996,0.00005939853,0.00025076736,0.000034643752,0.0031034313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996543,0.00007340528,0.000018871784,0.00008898911,0.000062581516,0.00010195299],"domain_scores_gemma":[0.9994598,0.00014981774,0.00012678518,0.00007923276,0.00005085508,0.00013350518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029295974,0.00033864434,0.0002879051,0.00058849994,0.00058098254,0.0013051821,0.00046685032,0.00050012727,0.003103868],"category_scores_gemma":[0.0009612862,0.0002804066,0.00052339316,0.00058287085,0.0008743598,0.0012967397,0.00087814534,0.00071377394,0.00031961408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015346533,0.00005586806,0.0014345335,0.00004480758,0.000019696214,0.000244227,0.00026110138,0.013972345,0.015667628,0.94934964,0.0013360238,0.017460681],"study_design_scores_gemma":[0.000049749626,0.000090754256,0.0025420603,0.000027741535,0.00002419127,0.00042963924,0.00018589555,0.10554119,0.006041318,0.87879133,0.006239606,0.00003659373],"about_ca_topic_score_codex":0.0006955055,"about_ca_topic_score_gemma":0.0007950758,"teacher_disagreement_score":0.003103868,"about_ca_system_score_codex":0.00065740704,"about_ca_system_score_gemma":0.00023530156,"threshold_uncertainty_score":0.010383546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80620784,0.0006514455,0.13263634,0.0006061511,0.00016449929,0.00012960848,0.00097386615,0.0003642636,0.058265876],"genre_scores_gemma":[0.9461421,0.00028368467,0.039093174,0.0001313062,0.00003247921,0.00008034735,0.0005261984,0.000054392185,0.013656366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995152,0.00011082715,0.000026174606,0.00010699215,0.00007007328,0.00017074062],"domain_scores_gemma":[0.999166,0.00038832656,0.00017008543,0.00009572791,0.000059758982,0.00012013018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023104956,0.00043086812,0.00031764532,0.0006776139,0.0011241726,0.0016131412,0.0006951973,0.0007588953,0.010182174],"category_scores_gemma":[0.0013698674,0.00035836265,0.0003776626,0.00083685707,0.0012826829,0.0016618551,0.0013533765,0.0006792866,0.0005930535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037003125,0.00010952184,0.0018195218,0.00020928848,0.000055737688,0.001036988,0.00063484,0.044888593,0.010244151,0.89946777,0.0059113214,0.035252273],"study_design_scores_gemma":[0.0002490678,0.000148431,0.0023028075,0.000072746356,0.000035456585,0.00040986907,0.0005807746,0.11311982,0.0061657187,0.85979635,0.01706404,0.00005498955],"about_ca_topic_score_codex":0.003094925,"about_ca_topic_score_gemma":0.0050267703,"teacher_disagreement_score":0.010182174,"about_ca_system_score_codex":0.0009179522,"about_ca_system_score_gemma":0.000493809,"threshold_uncertainty_score":0.034062743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6986201,0.0017212817,0.1654931,0.0014575028,0.00019575463,0.00005773432,0.00027184706,0.0002724921,0.13191019],"genre_scores_gemma":[0.9491347,0.0006058022,0.027702248,0.00025553833,0.0003388925,0.000056392677,0.00029456324,0.000112190566,0.021499757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902356,0.00018312066,0.000034657347,0.00021417368,0.00031399995,0.00023041732],"domain_scores_gemma":[0.9978532,0.0011682606,0.0002792853,0.00025314646,0.00024489954,0.00020113135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040024598,0.00034496648,0.0005607832,0.0014668397,0.002018596,0.0019775124,0.0004732745,0.00079368445,0.005228499],"category_scores_gemma":[0.002477912,0.00040873667,0.00051510805,0.0008934504,0.0028077543,0.0030233515,0.0011963943,0.0015956365,0.0007867118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007788358,0.000019474237,0.000790434,0.00003638287,0.000009193882,0.00012390867,0.00033382996,0.0028846017,0.004111506,0.9827539,0.000751034,0.008107831],"study_design_scores_gemma":[0.000019706618,0.00006891595,0.001165774,0.000029721165,0.0000118089665,0.0003647469,0.00026047777,0.016227541,0.005062225,0.96031195,0.016449802,0.000027307222],"about_ca_topic_score_codex":0.0011660502,"about_ca_topic_score_gemma":0.0010624956,"teacher_disagreement_score":0.005228499,"about_ca_system_score_codex":0.0008280744,"about_ca_system_score_gemma":0.00035032822,"threshold_uncertainty_score":0.017491043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4101059,0.0048308065,0.34533298,0.0012825803,0.00079910154,0.00022289467,0.0030762472,0.0004941721,0.23385529],"genre_scores_gemma":[0.8221726,0.005031527,0.09729274,0.0004823883,0.00078220014,0.00032766713,0.003996736,0.00043128038,0.0694829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990227,0.000118926175,0.000048928374,0.0002195253,0.00032315342,0.00026674385],"domain_scores_gemma":[0.99897456,0.00032161965,0.00019527395,0.00008211777,0.00022929162,0.000197138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042852247,0.0013269704,0.0006279558,0.0026931406,0.0012175239,0.002706448,0.00078621303,0.0007249622,0.011847051],"category_scores_gemma":[0.0020394546,0.0004158665,0.0006250434,0.0022112022,0.0024376183,0.0031518135,0.0011477607,0.003373982,0.0039653108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014416348,0.00009895567,0.0009353018,0.00014131312,0.000014891053,0.00019501544,0.0003597283,0.0076760086,0.0053867446,0.9174469,0.008044895,0.05955596],"study_design_scores_gemma":[0.00004278233,0.0002778246,0.0039869514,0.00020343922,0.000021619562,0.00074059225,0.00059178454,0.041784804,0.008421284,0.8564554,0.08725234,0.00022118932],"about_ca_topic_score_codex":0.0019238959,"about_ca_topic_score_gemma":0.0010969505,"teacher_disagreement_score":0.011847051,"about_ca_system_score_codex":0.0008103344,"about_ca_system_score_gemma":0.0006537598,"threshold_uncertainty_score":0.03963232},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39345512,0.0020757937,0.5169413,0.00069640536,0.0003079518,0.00024184813,0.0008955984,0.000540512,0.08484542],"genre_scores_gemma":[0.8654945,0.0011016488,0.10102778,0.00024164807,0.00020632171,0.00017535698,0.00095268094,0.00022711088,0.030572983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935216,0.00010264617,0.000034559416,0.00021391582,0.00011856625,0.00017823311],"domain_scores_gemma":[0.999297,0.00020604249,0.00013869311,0.00012581295,0.00012701271,0.000105411775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004134296,0.00074757263,0.0004236911,0.00074701785,0.0013666162,0.0012273565,0.00042009098,0.00054533145,0.010765681],"category_scores_gemma":[0.0019341266,0.00034191937,0.0009573135,0.0006050322,0.0012795719,0.0025779598,0.0009898056,0.00086959364,0.0012032734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011588795,0.000042708973,0.0008010458,0.00017608864,0.00002670285,0.00038519676,0.00058496767,0.007023817,0.006033236,0.95223635,0.0037337253,0.028840326],"study_design_scores_gemma":[0.000026328773,0.00006947101,0.00053083,0.000058958503,0.00002174664,0.0004833419,0.0003951115,0.012540307,0.0037559923,0.96380544,0.018278258,0.00003405968],"about_ca_topic_score_codex":0.0017124133,"about_ca_topic_score_gemma":0.0024443064,"teacher_disagreement_score":0.010765681,"about_ca_system_score_codex":0.00073019677,"about_ca_system_score_gemma":0.0004904734,"threshold_uncertainty_score":0.036014736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62690455,0.0028567447,0.27707377,0.0027803716,0.00029884116,0.000059460348,0.0007160819,0.00058032124,0.08872983],"genre_scores_gemma":[0.97745425,0.0010632839,0.013787579,0.00014029318,0.00037365232,0.000050975937,0.00025473195,0.00011065975,0.006764708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985555,0.0001949435,0.00004009588,0.0003234668,0.00043243836,0.00045356853],"domain_scores_gemma":[0.99224126,0.0046718153,0.00077585183,0.00067053764,0.00085261045,0.0007880061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012940766,0.00084478204,0.0008439204,0.0033778516,0.001074899,0.0028737057,0.001408578,0.00063306926,0.0053804344],"category_scores_gemma":[0.011968951,0.00044464183,0.0007181485,0.0020882634,0.0031085827,0.0053755376,0.002270878,0.0028565382,0.0007768284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013332734,0.00005736864,0.001486884,0.00009763808,0.00001735673,0.00010835188,0.000340709,0.010864263,0.0026151657,0.96329194,0.0022960494,0.018690785],"study_design_scores_gemma":[0.000017305556,0.00004941002,0.00079716626,0.000035278157,0.000020425143,0.00012309717,0.00010185842,0.057531346,0.0020220624,0.93597054,0.0033046335,0.000026845682],"about_ca_topic_score_codex":0.001720598,"about_ca_topic_score_gemma":0.00179357,"teacher_disagreement_score":0.0053804344,"about_ca_system_score_codex":0.0028364854,"about_ca_system_score_gemma":0.0008195341,"threshold_uncertainty_score":0.020580232},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45096204,0.0034842612,0.50335026,0.0019308868,0.0001855741,0.00013474384,0.0010456163,0.0010367356,0.037869826],"genre_scores_gemma":[0.8752255,0.001807571,0.11693027,0.00029884087,0.00014906042,0.00023141531,0.0009693883,0.00024708948,0.0041408753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972453,0.00081829325,0.000178724,0.0003257627,0.00081067724,0.0006213494],"domain_scores_gemma":[0.9776593,0.015864404,0.002152116,0.002223254,0.0014530026,0.00064790563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020469315,0.001154847,0.00085028895,0.0022118378,0.001436185,0.0016635339,0.001381464,0.00095714297,0.0035579046],"category_scores_gemma":[0.017484015,0.00041699604,0.00070695987,0.0023474556,0.0027621344,0.0060939565,0.00277596,0.0021475346,0.001224554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007583036,0.00019980327,0.0078666,0.0005380687,0.00008628291,0.00040278735,0.00097617105,0.36254513,0.022768568,0.50609374,0.0072960868,0.090468444],"study_design_scores_gemma":[0.000035946643,0.000396476,0.0023240105,0.00017442949,0.000050030103,0.0005997489,0.00056967814,0.5104729,0.0388719,0.432809,0.013537069,0.00015894834],"about_ca_topic_score_codex":0.001200763,"about_ca_topic_score_gemma":0.002544408,"teacher_disagreement_score":0.0035579046,"about_ca_system_score_codex":0.0014148167,"about_ca_system_score_gemma":0.0013157323,"threshold_uncertainty_score":0.011902332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38821533,0.0009774108,0.5449684,0.0007315161,0.00009992101,0.00029511846,0.0021063387,0.00039997877,0.062205963],"genre_scores_gemma":[0.8577306,0.00057299645,0.1269307,0.00035939467,0.00005662033,0.00024647772,0.0025666365,0.000113757254,0.011422808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995073,0.00011158647,0.00003224706,0.00012162069,0.000090726855,0.0001365112],"domain_scores_gemma":[0.9986355,0.00041384425,0.00019485447,0.00023351537,0.00029039904,0.00023195152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003313876,0.00052382785,0.0003449479,0.0011868237,0.0008587255,0.001323889,0.00064319436,0.00054950383,0.0053931167],"category_scores_gemma":[0.0020091743,0.0003794267,0.0005767681,0.0009997835,0.00086175627,0.0019295554,0.0011217833,0.0009036379,0.00065093406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031698847,0.00012959495,0.0022532342,0.0003222972,0.00007319315,0.00045550146,0.00059016637,0.039528355,0.013819817,0.8825195,0.007997971,0.05199332],"study_design_scores_gemma":[0.00005752541,0.000092330556,0.0017568906,0.00011513583,0.000072497,0.00058298354,0.0004571204,0.13980952,0.006934447,0.82979876,0.020273544,0.000049231687],"about_ca_topic_score_codex":0.00215128,"about_ca_topic_score_gemma":0.0039581414,"teacher_disagreement_score":0.0053931167,"about_ca_system_score_codex":0.0009784899,"about_ca_system_score_gemma":0.0008390988,"threshold_uncertainty_score":0.01804179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054095525,0.00046976187,0.8866285,0.002268825,0.00031378382,0.0002376951,0.00080888876,0.000479102,0.05469789],"genre_scores_gemma":[0.22870891,0.0008764827,0.73608077,0.0008071726,0.000258808,0.0004024279,0.0017195665,0.00040371373,0.03074209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988696,0.00030021102,0.00006029813,0.00027266727,0.000346113,0.00015114632],"domain_scores_gemma":[0.9985227,0.0007918467,0.00009945632,0.00027625044,0.00020546388,0.00010430988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082584244,0.0010960653,0.0008489717,0.00076829776,0.0013839107,0.0012939076,0.0010683419,0.0019156593,0.017785795],"category_scores_gemma":[0.0038557225,0.00059414003,0.0014650493,0.0008441922,0.0013320989,0.002677566,0.0018965887,0.0025236425,0.0033608612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019328647,0.00023820462,0.00072845997,0.00078602915,0.000075737196,0.00040915096,0.0005254196,0.05371412,0.011346991,0.71728164,0.033553224,0.18114777],"study_design_scores_gemma":[0.00009364475,0.00012191037,0.0002457041,0.000102028025,0.000032342334,0.00040402598,0.00030872296,0.054690175,0.0036774846,0.9049707,0.035321426,0.000031821968],"about_ca_topic_score_codex":0.0009882536,"about_ca_topic_score_gemma":0.001373087,"teacher_disagreement_score":0.017785795,"about_ca_system_score_codex":0.00077941286,"about_ca_system_score_gemma":0.0017095797,"threshold_uncertainty_score":0.059499383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9461247,0.00023278336,0.041537028,0.0002714729,0.000011190673,0.000070366616,0.0010815364,0.00017128017,0.01049974],"genre_scores_gemma":[0.96361035,0.00034569373,0.028755099,0.00009424576,0.00004824145,0.00022679474,0.0022123798,0.000110431894,0.00459668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.00014587,0.000058431713,0.00015381689,0.0002241002,0.00020471429],"domain_scores_gemma":[0.99599886,0.0015974452,0.0010383128,0.00032942032,0.00040130902,0.0006346461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051606685,0.0005718144,0.00072774594,0.0013749852,0.0011838215,0.0023084008,0.001238011,0.0006914275,0.0045460705],"category_scores_gemma":[0.0037432557,0.00053843705,0.0004066661,0.001554632,0.0010909521,0.0021289466,0.0010533349,0.0008374306,0.0007112588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030857073,0.00051682425,0.03738513,0.0006683434,0.00021507838,0.0010656107,0.0021238895,0.1685519,0.10509731,0.6019418,0.013953245,0.06539528],"study_design_scores_gemma":[0.00044097038,0.000797238,0.022603849,0.00017119515,0.00018442936,0.0020721422,0.0023888578,0.5236527,0.051765148,0.3697767,0.025989302,0.00015748075],"about_ca_topic_score_codex":0.0021720745,"about_ca_topic_score_gemma":0.0014478831,"teacher_disagreement_score":0.0045460705,"about_ca_system_score_codex":0.0012128766,"about_ca_system_score_gemma":0.0006372623,"threshold_uncertainty_score":0.015208125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4001261,0.0007221985,0.5028815,0.0012498593,0.00040652347,0.00036333685,0.0013163487,0.00054737896,0.092386745],"genre_scores_gemma":[0.8251924,0.00039347788,0.14615124,0.00050404784,0.00018401565,0.00023440938,0.0010660349,0.00020410793,0.026070198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998944,0.00013629302,0.000046505997,0.00035265082,0.00016286522,0.00035761273],"domain_scores_gemma":[0.99789494,0.00085835304,0.00022549712,0.00033538466,0.00036238562,0.00032342027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079601316,0.0007533406,0.00060843537,0.0005458148,0.002086389,0.001490825,0.00051932817,0.00077957223,0.016141344],"category_scores_gemma":[0.0027254117,0.00053149596,0.0014255315,0.0003204843,0.0017586824,0.0031384977,0.0014988704,0.001935659,0.002801797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008933395,0.00025498506,0.003782086,0.00037060573,0.00004674909,0.0010103473,0.00092912634,0.01696785,0.06519699,0.86997485,0.009751737,0.030821325],"study_design_scores_gemma":[0.00011021296,0.00048348296,0.0023542435,0.00012756648,0.00007880856,0.0015837668,0.000990975,0.06730258,0.036376227,0.84897095,0.04151215,0.00010902549],"about_ca_topic_score_codex":0.0023666057,"about_ca_topic_score_gemma":0.0038019815,"teacher_disagreement_score":0.016141344,"about_ca_system_score_codex":0.0011172673,"about_ca_system_score_gemma":0.0014795645,"threshold_uncertainty_score":0.053998232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017336328,0.0008204711,0.94207054,0.0019710131,0.00027712763,0.00023681298,0.00041169135,0.0017502957,0.035125643],"genre_scores_gemma":[0.34101033,0.0009883506,0.63792425,0.0009082628,0.00046822437,0.0005556665,0.0012250124,0.00042363384,0.01649624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966635,0.0011079941,0.00016947508,0.0005679437,0.0011338543,0.00035727865],"domain_scores_gemma":[0.9969047,0.0019544736,0.00014435378,0.0005987768,0.0003215093,0.00007619689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016480373,0.0008886966,0.0010657858,0.0012416473,0.0011238733,0.002495855,0.0014063328,0.00085023633,0.013831156],"category_scores_gemma":[0.006454974,0.0005692331,0.002473823,0.0019655575,0.0031108328,0.0043044495,0.0022515955,0.004733915,0.0026873131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016342968,0.00012183633,0.00041741985,0.00027420264,0.00006322692,0.00011072229,0.00017221016,0.05406481,0.003165734,0.8522211,0.010516732,0.078708574],"study_design_scores_gemma":[0.00006922131,0.00004362058,0.00009186263,0.00004218898,0.000026393183,0.00007119469,0.000055768433,0.19921066,0.004279613,0.784512,0.0115726935,0.000024877094],"about_ca_topic_score_codex":0.004025601,"about_ca_topic_score_gemma":0.006129778,"teacher_disagreement_score":0.013831156,"about_ca_system_score_codex":0.0027094444,"about_ca_system_score_gemma":0.0026700622,"threshold_uncertainty_score":0.046269894},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07600306,0.002491151,0.84360725,0.0031205846,0.00048097342,0.00011120204,0.00066892867,0.00057929166,0.07293746],"genre_scores_gemma":[0.82123876,0.0043497416,0.1462797,0.0012371995,0.0023347426,0.00043229476,0.0009142935,0.00091920386,0.022294242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698097,0.0010746843,0.000095394214,0.00063344155,0.0007719055,0.00044354796],"domain_scores_gemma":[0.9586687,0.03376668,0.0013928505,0.002822461,0.0017827186,0.001566641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006431328,0.0024089243,0.0026883078,0.0048036715,0.0025179486,0.005038668,0.005967158,0.0022780297,0.013204562],"category_scores_gemma":[0.033734176,0.0013782044,0.0020979214,0.006750691,0.0057725483,0.011582559,0.0056057763,0.008419118,0.0013812765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021497134,0.00018961243,0.0012092792,0.00020513844,0.00004899192,0.00012599319,0.00035015383,0.11921921,0.0031065638,0.84824854,0.0055211005,0.021560408],"study_design_scores_gemma":[0.000018409102,0.000035886904,0.0004781098,0.000057467994,0.000039440747,0.00008281549,0.00007166823,0.39805576,0.0012249665,0.59730834,0.0025853445,0.00004181013],"about_ca_topic_score_codex":0.0027844897,"about_ca_topic_score_gemma":0.004808575,"teacher_disagreement_score":0.013204562,"about_ca_system_score_codex":0.005184123,"about_ca_system_score_gemma":0.0017216,"threshold_uncertainty_score":0.044173717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3054308,0.0031332914,0.6632053,0.0006993099,0.0006519889,0.00043913323,0.0065561305,0.007658317,0.012225742],"genre_scores_gemma":[0.76456094,0.001394195,0.20799723,0.00061616575,0.00029829264,0.00020656254,0.01653994,0.00054198346,0.007844727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992354,0.00013722801,0.000017490747,0.00031223136,0.00017716283,0.00012049353],"domain_scores_gemma":[0.9995358,0.00011036861,0.00005640621,0.00014229397,0.00009769943,0.000057461373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054521847,0.0015337288,0.0008264549,0.0008977883,0.0004984546,0.0008853797,0.0010366342,0.0009469038,0.0027705992],"category_scores_gemma":[0.002140299,0.00034692136,0.0005299581,0.0006632291,0.00077532785,0.0007812309,0.0011780619,0.0010048815,0.0020091007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018071256,0.000721595,0.017265907,0.00077354297,0.0003206584,0.0006300139,0.0005162011,0.10613851,0.08845939,0.002734897,0.043048143,0.7375841],"study_design_scores_gemma":[0.00019983808,0.00065650104,0.059263397,0.00020165488,0.0001529836,0.0021358223,0.00073523785,0.8330627,0.059889805,0.014671966,0.02885007,0.0001801022],"about_ca_topic_score_codex":0.008495298,"about_ca_topic_score_gemma":0.022495676,"teacher_disagreement_score":0.008495298,"about_ca_system_score_codex":0.00036991164,"about_ca_system_score_gemma":0.0006383616,"threshold_uncertainty_score":0.016891718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58868885,0.0020185378,0.13216962,0.004956899,0.001545315,0.00024532265,0.0038908133,0.0017150979,0.2647695],"genre_scores_gemma":[0.950394,0.00057780655,0.013889058,0.00044655564,0.00074327947,0.00025960934,0.0016249238,0.0003591409,0.031705584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987049,0.0002154252,0.00008830196,0.0003161132,0.0003494701,0.0003257663],"domain_scores_gemma":[0.99720144,0.0009595686,0.00025125235,0.00045456673,0.0004502776,0.00068279495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012343887,0.0007274325,0.0011214612,0.001607916,0.0014569756,0.0040378687,0.0012954441,0.0010615112,0.032773595],"category_scores_gemma":[0.0040658507,0.0004080058,0.0006219056,0.0007176388,0.00198435,0.005159599,0.002508535,0.0016157789,0.005887699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045753663,0.000049214406,0.00056236493,0.00011039784,0.000021569454,0.00020726975,0.0005309071,0.0008392356,0.008793488,0.96063083,0.0064027053,0.021394422],"study_design_scores_gemma":[0.000095366595,0.00026017442,0.0011514591,0.00006762813,0.00003299539,0.00031266848,0.00048413043,0.0044046124,0.013133132,0.9498684,0.030137923,0.000051490395],"about_ca_topic_score_codex":0.00057861017,"about_ca_topic_score_gemma":0.00038355624,"teacher_disagreement_score":0.032773595,"about_ca_system_score_codex":0.0009852964,"about_ca_system_score_gemma":0.0008598059,"threshold_uncertainty_score":0.10963857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792594,0.00044162586,0.0058517135,0.00007917345,0.000019623247,0.000016006012,0.000101364494,0.0000579855,0.014173132],"genre_scores_gemma":[0.99730396,0.00011461273,0.001337022,0.00001619206,0.000016992111,0.000017469965,0.00012435911,0.0000068115974,0.0010626321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.000059663824,0.000025985026,0.00007023998,0.00015899206,0.0001855888],"domain_scores_gemma":[0.9989573,0.00043286514,0.00020671371,0.00008911979,0.00008917047,0.00022474433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776008,0.00035926574,0.0004007404,0.0028131453,0.0010018097,0.0017805734,0.00045419423,0.00035091484,0.0019462197],"category_scores_gemma":[0.0017264236,0.000184239,0.00020388835,0.00096566614,0.0009425356,0.0010875894,0.001515445,0.0003451209,0.0002459487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008809638,0.00016492924,0.023627348,0.00026491217,0.00007777589,0.0012590776,0.0022147277,0.020684466,0.06624312,0.83886904,0.0021103558,0.04360324],"study_design_scores_gemma":[0.0001070785,0.00033426998,0.01750301,0.000080724414,0.00007184928,0.0019684639,0.0018902336,0.09217356,0.04943764,0.81402105,0.022343347,0.00006883429],"about_ca_topic_score_codex":0.00051445275,"about_ca_topic_score_gemma":0.00051371625,"teacher_disagreement_score":0.0028131453,"about_ca_system_score_codex":0.0009397513,"about_ca_system_score_gemma":0.00034023874,"threshold_uncertainty_score":0.0068184137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08340396,0.0012355231,0.90848136,0.0008671331,0.000060800605,0.00005626757,0.00027944814,0.00015182179,0.0054637264],"genre_scores_gemma":[0.92095053,0.0015213364,0.070045725,0.00020062507,0.00019921175,0.00015500103,0.00048961194,0.00023015011,0.006207766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626225,0.0015795314,0.00016494496,0.0006078229,0.0009790162,0.0004064462],"domain_scores_gemma":[0.966781,0.026208347,0.0021844446,0.0016476224,0.0018991455,0.0012793574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00879376,0.0021550744,0.0021249843,0.0017425158,0.0005370409,0.0038572648,0.0024957804,0.002649282,0.0042226077],"category_scores_gemma":[0.045417886,0.00094748184,0.0010150031,0.0015306409,0.004314135,0.0068948474,0.0032965324,0.0032454976,0.00062986877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009281514,0.00010689581,0.0017340366,0.00031880313,0.00013381285,0.00043158705,0.00022690828,0.52444166,0.003689608,0.44011617,0.0020326984,0.025839705],"study_design_scores_gemma":[0.000025382691,0.00012392174,0.0006120599,0.000056583238,0.00004071028,0.00027228214,0.000073909454,0.78442025,0.001366683,0.21238741,0.0005815494,0.00003929279],"about_ca_topic_score_codex":0.0010673271,"about_ca_topic_score_gemma":0.00058972597,"teacher_disagreement_score":0.00879376,"about_ca_system_score_codex":0.0025364186,"about_ca_system_score_gemma":0.0010635661,"threshold_uncertainty_score":0.046506405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44237095,0.004209663,0.35714516,0.011689997,0.00065078493,0.00014349338,0.0016951819,0.0006382981,0.18145637],"genre_scores_gemma":[0.93667024,0.0015664909,0.02584226,0.000914641,0.0009097989,0.00012600127,0.0006236936,0.00022219123,0.033124674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816006,0.0006405582,0.00006539753,0.00031429302,0.00053163274,0.0002879473],"domain_scores_gemma":[0.98701197,0.007947561,0.0014021905,0.0012468137,0.0011942171,0.0011972167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019967204,0.00084280816,0.0016815317,0.005171179,0.0034853115,0.007176742,0.0012543937,0.0017577609,0.013154669],"category_scores_gemma":[0.010575931,0.0009136595,0.0007230999,0.004020116,0.0061944746,0.010828291,0.0026419996,0.0037280896,0.0011172428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022435983,0.000014919811,0.000096334086,0.000016398651,0.0000033219274,0.000012835778,0.0001086974,0.0011335548,0.000100448065,0.9953674,0.0011232932,0.0020003375],"study_design_scores_gemma":[0.0000075710655,0.0000064400006,0.00007595376,0.000007914012,0.0000038047676,0.000028125067,0.00005928952,0.0057937936,0.00011054885,0.99271023,0.0011882634,0.000008073681],"about_ca_topic_score_codex":0.0020789208,"about_ca_topic_score_gemma":0.0022166618,"teacher_disagreement_score":0.013154669,"about_ca_system_score_codex":0.00195937,"about_ca_system_score_gemma":0.0013953042,"threshold_uncertainty_score":0.044006705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009958321,0.0002503082,0.98452616,0.00009770897,0.000033182863,0.00008314896,0.000038485086,0.00032819723,0.0046844548],"genre_scores_gemma":[0.2164111,0.0004492331,0.77680486,0.00011826301,0.00004605076,0.0004742461,0.00017259561,0.0002572923,0.005266347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956185,0.00021515568,0.000016281456,0.000049856473,0.00011656708,0.000040267143],"domain_scores_gemma":[0.99905425,0.00068147987,0.000059995316,0.00010291153,0.000071515155,0.000029835646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091816956,0.0008977725,0.00084463117,0.0009935705,0.0007232739,0.0009873192,0.0009995593,0.0010348605,0.005045029],"category_scores_gemma":[0.003396007,0.0004191114,0.00070651836,0.0014977262,0.0009993236,0.000923947,0.00092493143,0.0013121177,0.0008690974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007096007,0.000093283794,0.00023110716,0.00012873838,0.000034387493,0.000045832745,0.00010650459,0.7774793,0.0033404953,0.07603041,0.0025674447,0.13987157],"study_design_scores_gemma":[0.000020247538,0.00004460276,0.00007123593,0.0000108713275,0.0000059252557,0.000020595144,0.000014132903,0.960181,0.00085587247,0.037193682,0.0015744156,0.000007343025],"about_ca_topic_score_codex":0.0010465104,"about_ca_topic_score_gemma":0.00165269,"teacher_disagreement_score":0.005045029,"about_ca_system_score_codex":0.00089138787,"about_ca_system_score_gemma":0.0007511392,"threshold_uncertainty_score":0.016877294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78609616,0.00036001255,0.16362889,0.00021324899,0.00005941306,0.0001052852,0.0007405412,0.00024152391,0.04855493],"genre_scores_gemma":[0.9670721,0.00017378484,0.02609971,0.00009197027,0.000019781233,0.000047083697,0.0006044808,0.00002710709,0.005863899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983406,0.000033734756,0.000009879417,0.00003858712,0.000037448528,0.00004632009],"domain_scores_gemma":[0.99952626,0.00008266298,0.00008403435,0.00009597619,0.00009430214,0.00011685788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014007094,0.00023067424,0.00020317109,0.00091038045,0.0005535115,0.0006077254,0.00033932927,0.00022685164,0.0038520466],"category_scores_gemma":[0.0005757962,0.00019806821,0.0003577718,0.0005107528,0.0005834411,0.00068849453,0.00050525664,0.00044726918,0.00033674872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003580126,0.000076257806,0.0034311172,0.00029257848,0.00005971598,0.00070848875,0.00097018306,0.02364102,0.045309987,0.8650065,0.004753895,0.0553922],"study_design_scores_gemma":[0.000056100598,0.00022162394,0.0116575025,0.00011259646,0.00009591426,0.002138789,0.0012222563,0.10882107,0.019366127,0.8265183,0.02973345,0.00005627115],"about_ca_topic_score_codex":0.0015846835,"about_ca_topic_score_gemma":0.0023756733,"teacher_disagreement_score":0.0038520466,"about_ca_system_score_codex":0.0005044583,"about_ca_system_score_gemma":0.00030119327,"threshold_uncertainty_score":0.012886345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792594,0.00044162586,0.0058517135,0.00007917345,0.000019623247,0.000016006012,0.000101364494,0.0000579855,0.014173132],"genre_scores_gemma":[0.99730396,0.00011461273,0.001337022,0.00001619206,0.000016992111,0.000017469965,0.00012435911,0.0000068115974,0.0010626321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.000059663824,0.000025985026,0.00007023998,0.00015899206,0.0001855888],"domain_scores_gemma":[0.9989573,0.00043286514,0.00020671371,0.00008911979,0.00008917047,0.00022474433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776008,0.00035926574,0.0004007404,0.0028131453,0.0010018097,0.0017805734,0.00045419423,0.00035091484,0.0019462197],"category_scores_gemma":[0.0017264236,0.000184239,0.00020388835,0.00096566614,0.0009425356,0.0010875894,0.001515445,0.0003451209,0.0002459487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008809638,0.00016492924,0.023627348,0.00026491217,0.00007777589,0.0012590776,0.0022147277,0.020684466,0.06624312,0.83886904,0.0021103558,0.04360324],"study_design_scores_gemma":[0.0001070785,0.00033426998,0.01750301,0.000080724414,0.00007184928,0.0019684639,0.0018902336,0.09217356,0.04943764,0.81402105,0.022343347,0.00006883429],"about_ca_topic_score_codex":0.00051445275,"about_ca_topic_score_gemma":0.00051371625,"teacher_disagreement_score":0.0028131453,"about_ca_system_score_codex":0.0009397513,"about_ca_system_score_gemma":0.00034023874,"threshold_uncertainty_score":0.0068184137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6513106,0.00032469188,0.29319817,0.00038421128,0.00011696619,0.00022236379,0.00059365557,0.00031015708,0.05353921],"genre_scores_gemma":[0.9027671,0.00040965297,0.07948963,0.00036646225,0.000087187465,0.0002833319,0.0013931982,0.00021962954,0.014983742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997297,0.00003880398,0.00001299783,0.00006799161,0.000051683088,0.00009881718],"domain_scores_gemma":[0.99932945,0.00016625153,0.00012255405,0.00012911923,0.00009811085,0.00015446122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023913514,0.00039585508,0.00026023333,0.0009936321,0.0007998316,0.0009167001,0.0004991845,0.00031843974,0.006617173],"category_scores_gemma":[0.0011067358,0.00028546868,0.00038179167,0.00054258277,0.00071259233,0.0016064545,0.0010207103,0.0007731417,0.00071889453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003854361,0.00017515838,0.0037944943,0.0002548729,0.000036778867,0.0005034559,0.00065228203,0.014608795,0.048538458,0.8532323,0.00559977,0.07221817],"study_design_scores_gemma":[0.00003869886,0.00012261535,0.00292602,0.0000902536,0.000037224178,0.0005387492,0.00075136306,0.052200455,0.015213015,0.9089731,0.01907493,0.000033577166],"about_ca_topic_score_codex":0.00061151484,"about_ca_topic_score_gemma":0.0010706832,"teacher_disagreement_score":0.006617173,"about_ca_system_score_codex":0.00042683317,"about_ca_system_score_gemma":0.00034067803,"threshold_uncertainty_score":0.022136629},"labels":[],"label_agreement":null},{"id":"W4403201646","doi":"10.1002/jcd.21957","title":"Nestings of BIBDs with block size four","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block (permutation group theory); Block size; Combinatorics; Biology; Ecology; Key (lock)","score_opus":0.013564207698928028,"score_gpt":0.20742279509058476,"score_spread":0.19385858739165673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403201646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5199055,0.00039258142,0.4280826,0.00028587764,0.000109307264,0.00015858373,0.00027731698,0.00062859023,0.05015954],"genre_scores_gemma":[0.88107884,0.00010676558,0.10988234,0.00008367317,0.000013528593,0.000088303525,0.00014016283,0.00006368993,0.008542721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915063,0.00022941142,0.00009258793,0.00010167157,0.00026002713,0.00016567105],"domain_scores_gemma":[0.9981426,0.00051715656,0.00036115706,0.00039205997,0.0003824279,0.00020463449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915772,0.00023534038,0.0003094324,0.0005052345,0.00064895774,0.00082831073,0.00040778978,0.0003609166,0.004561872],"category_scores_gemma":[0.0024944227,0.00043357298,0.00027425247,0.0003699785,0.00086112175,0.0011779065,0.0011725343,0.00042425806,0.0005150818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034521194,0.000105703075,0.0067506954,0.0003071686,0.000050280323,0.001112898,0.00092167285,0.04180595,0.06476133,0.8209398,0.0032668472,0.059632517],"study_design_scores_gemma":[0.00016218604,0.00072308443,0.003601437,0.00027005203,0.00008854542,0.0019161322,0.00085451,0.3167124,0.0537287,0.54026383,0.081591144,0.000088015775],"about_ca_topic_score_codex":0.0011703243,"about_ca_topic_score_gemma":0.0021164676,"teacher_disagreement_score":0.004561872,"about_ca_system_score_codex":0.0005856968,"about_ca_system_score_gemma":0.0005020359,"threshold_uncertainty_score":0.015260994},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04017887,0.0003817105,0.94310033,0.00084446004,0.00024926386,0.00023467257,0.000105973726,0.00064347615,0.014261249],"genre_scores_gemma":[0.497225,0.00048398407,0.4896382,0.00019178003,0.0001485099,0.00018287635,0.00011760937,0.00013207963,0.011880099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974094,0.0006273594,0.00014359925,0.0004333453,0.0011690151,0.0002172376],"domain_scores_gemma":[0.99711716,0.0011090563,0.0003718026,0.0009744616,0.0003273923,0.00010015791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018014652,0.0007282485,0.000681715,0.00097373297,0.0009391382,0.0015234374,0.0015310664,0.0016193991,0.0031357077],"category_scores_gemma":[0.006867924,0.00040680805,0.0006691426,0.0011421487,0.0021515756,0.0039298804,0.0017830085,0.002168348,0.0012478164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004116074,0.00014325813,0.0006813716,0.00018978836,0.00006694802,0.00038476134,0.00019391293,0.021493508,0.059378184,0.8274085,0.0023454651,0.08730267],"study_design_scores_gemma":[0.00024193503,0.0009871316,0.0006795021,0.0001547165,0.000082926475,0.0030326461,0.00009884344,0.37046862,0.3482835,0.2362743,0.03943201,0.0002639261],"about_ca_topic_score_codex":0.0003987466,"about_ca_topic_score_gemma":0.0004946664,"teacher_disagreement_score":0.0031357077,"about_ca_system_score_codex":0.0010018827,"about_ca_system_score_gemma":0.001327282,"threshold_uncertainty_score":0.01049},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.766335,0.0006655681,0.20261122,0.00089403364,0.00009000632,0.00019889783,0.0008155511,0.00030131626,0.028088411],"genre_scores_gemma":[0.92830193,0.00047706015,0.060846873,0.00020719584,0.000082798106,0.00011018411,0.0008421801,0.00009649184,0.009035214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992842,0.00017478521,0.000045061195,0.0001663785,0.00014473272,0.00018491974],"domain_scores_gemma":[0.9962993,0.0018106757,0.00067443226,0.0005231545,0.00029572903,0.00039660002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007069329,0.00066432287,0.00048180725,0.00095903844,0.0011114315,0.0018246182,0.0006930567,0.0007994263,0.0051288283],"category_scores_gemma":[0.003586568,0.00050927664,0.00061101763,0.00096420076,0.0015839783,0.004168342,0.0015295073,0.0015888475,0.00053767033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031234892,0.0002463378,0.009269132,0.00030671505,0.000057213038,0.0011428224,0.0010164357,0.061740812,0.0115369465,0.84596384,0.0043478673,0.064059496],"study_design_scores_gemma":[0.000047504833,0.00012638849,0.0026496158,0.00007321798,0.000031990137,0.00081940484,0.0007417727,0.092850044,0.005806695,0.88320965,0.01361296,0.000030801075],"about_ca_topic_score_codex":0.0013038322,"about_ca_topic_score_gemma":0.00128682,"teacher_disagreement_score":0.0051288283,"about_ca_system_score_codex":0.0012092672,"about_ca_system_score_gemma":0.00041791156,"threshold_uncertainty_score":0.017157674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21635702,0.0022965285,0.6279334,0.0014014788,0.00062771083,0.00013617535,0.00080734096,0.00053677434,0.1499036],"genre_scores_gemma":[0.9244872,0.001679441,0.046193726,0.0006852762,0.0007222782,0.00016412033,0.000679776,0.00028214263,0.025106024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989766,0.00016351049,0.00006641899,0.0002778072,0.00035441824,0.0001612819],"domain_scores_gemma":[0.9971449,0.0008725064,0.00048023107,0.00032144174,0.00087252684,0.00030837988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068474864,0.0008348126,0.0003562465,0.0031620266,0.00079066085,0.0030444723,0.0005915116,0.0008110327,0.008562114],"category_scores_gemma":[0.0037508581,0.0002977483,0.00037452276,0.0013744321,0.002127289,0.0030751694,0.0011410253,0.0016659208,0.0021241484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005401757,0.000023575247,0.0003587308,0.000054285443,0.0000063651078,0.00021552759,0.0002070563,0.002007221,0.008613753,0.97098124,0.0020104111,0.015467833],"study_design_scores_gemma":[0.000013784229,0.00007240357,0.00042892643,0.000037446873,0.0000063638226,0.0011414799,0.00025626,0.023778636,0.007937527,0.9463077,0.01997809,0.000041425097],"about_ca_topic_score_codex":0.00025469225,"about_ca_topic_score_gemma":0.0001670115,"teacher_disagreement_score":0.008562114,"about_ca_system_score_codex":0.0005467833,"about_ca_system_score_gemma":0.0003992919,"threshold_uncertainty_score":0.028643131},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012126899,0.83166814,0.12519906,0.0011242003,0.00054717745,0.00009269189,0.00013256028,0.00019341028,0.028915903],"genre_scores_gemma":[0.094634965,0.86385685,0.03367389,0.00048458128,0.0012233763,0.00012107465,0.00025938707,0.000061318795,0.005684485],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995573,0.00009507907,0.000050249197,0.0000688768,0.00018497522,0.000043518663],"domain_scores_gemma":[0.99932134,0.00043169232,0.000066759545,0.00004294253,0.00011822465,0.000019202213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077058206,0.0010186873,0.00085664965,0.0018348345,0.0004022238,0.001899154,0.0007085837,0.0011246433,0.0027380667],"category_scores_gemma":[0.0009997755,0.00056857016,0.00066600466,0.0017112886,0.0005690486,0.0027364865,0.00090438174,0.0012681694,0.0010326451],"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.000099939476,0.00016048789,0.0019108851,0.00811667,0.00013111602,0.0003847669,0.0003213355,0.025011113,0.013235456,0.11134954,0.013081165,0.8261975],"study_design_scores_gemma":[0.000029527078,0.0012648071,0.0042818775,0.004964323,0.0003679021,0.0040659914,0.00074546057,0.14460947,0.021302626,0.09526007,0.72281885,0.00028908227],"about_ca_topic_score_codex":0.00048038835,"about_ca_topic_score_gemma":0.00045792444,"teacher_disagreement_score":0.0027380667,"about_ca_system_score_codex":0.00050351984,"about_ca_system_score_gemma":0.00068019837,"threshold_uncertainty_score":0.009159744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7292185,0.0007054291,0.1978106,0.0034542223,0.0002418528,0.00008965424,0.00018821922,0.00036181597,0.067929804],"genre_scores_gemma":[0.97295094,0.00019684195,0.016423378,0.0003329585,0.000085333624,0.000092029055,0.00009694737,0.00007946659,0.009742177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995908,0.00012744372,0.000009724999,0.00005025222,0.00009860436,0.00012316003],"domain_scores_gemma":[0.99912006,0.00042921174,0.00011026979,0.00010856281,0.00007947057,0.0001523778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064451894,0.00048349472,0.0007205853,0.0007070006,0.0010356382,0.0015175735,0.000760339,0.0011341128,0.0069242516],"category_scores_gemma":[0.003970427,0.00034490446,0.000547437,0.0003716385,0.0021310193,0.0017763391,0.0016371562,0.0016925716,0.0005519421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054261767,0.000031965992,0.0003512243,0.000045575744,0.0000137595125,0.00019700245,0.00017818356,0.02715519,0.0021301075,0.964916,0.002389529,0.0025371513],"study_design_scores_gemma":[0.000041071056,0.00003237961,0.00029968802,0.000021005711,0.0000072049133,0.00014157272,0.00017180658,0.34922642,0.0011417163,0.6474111,0.0014787134,0.000027275622],"about_ca_topic_score_codex":0.0023078541,"about_ca_topic_score_gemma":0.001827142,"teacher_disagreement_score":0.0069242516,"about_ca_system_score_codex":0.001015433,"about_ca_system_score_gemma":0.0010871694,"threshold_uncertainty_score":0.023163915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3601682,0.00033932988,0.5677537,0.0012062353,0.00011358249,0.00035409722,0.002020249,0.00034004063,0.067704625],"genre_scores_gemma":[0.6952358,0.0004944273,0.27159455,0.0005221249,0.00008133975,0.0005234236,0.004753564,0.00020498814,0.026589843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994659,0.00011815699,0.00002189043,0.00014494703,0.00009067457,0.00015838529],"domain_scores_gemma":[0.99894553,0.00041459006,0.00012176198,0.00017439952,0.00017397625,0.00016981908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005240393,0.0008373943,0.0006127905,0.00063296646,0.0008882826,0.0012542754,0.0008354181,0.0009399314,0.0095648505],"category_scores_gemma":[0.0024717436,0.00044603573,0.0008316296,0.00052999804,0.0009413424,0.0014806223,0.0014451019,0.0019199866,0.001099176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051262125,0.00030170847,0.0015334751,0.0003551582,0.000108576096,0.00049404433,0.00055763504,0.13429874,0.021163996,0.7763494,0.01688878,0.04743579],"study_design_scores_gemma":[0.00014988208,0.00015095898,0.0009483605,0.00007969809,0.000046631572,0.00034121057,0.00061417813,0.25213102,0.008122947,0.72375613,0.013624433,0.000034515673],"about_ca_topic_score_codex":0.0018785051,"about_ca_topic_score_gemma":0.0028944334,"teacher_disagreement_score":0.0095648505,"about_ca_system_score_codex":0.0008579109,"about_ca_system_score_gemma":0.0013399515,"threshold_uncertainty_score":0.03199762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5872284,0.0010177713,0.19133092,0.0014052866,0.0005667363,0.00017254447,0.0018166347,0.001215133,0.21524654],"genre_scores_gemma":[0.8956351,0.0008190046,0.06001926,0.00043470363,0.00017512617,0.0001402048,0.0013177901,0.00032586095,0.041132938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994387,0.00007136231,0.000027074893,0.00011814409,0.00012093714,0.00022382934],"domain_scores_gemma":[0.99871933,0.00050519116,0.00019400043,0.00021945656,0.00021066541,0.00015146003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032390366,0.0008641161,0.00068860577,0.0015818238,0.0017943034,0.002878166,0.00074702635,0.00085131323,0.0118093295],"category_scores_gemma":[0.0011196443,0.0004994108,0.0006587859,0.0018369132,0.0011525222,0.002303689,0.0011312875,0.0016575862,0.0023690194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007911892,0.0001796695,0.0014241616,0.00033407626,0.000047868907,0.0010026174,0.0005787282,0.0046722516,0.052598566,0.8753906,0.009746394,0.053233773],"study_design_scores_gemma":[0.00016030582,0.0001591794,0.0028424063,0.000091018635,0.00006985632,0.0013408528,0.0004955431,0.011451958,0.031699985,0.90138257,0.05021409,0.0000923089],"about_ca_topic_score_codex":0.0022874821,"about_ca_topic_score_gemma":0.00306122,"teacher_disagreement_score":0.0118093295,"about_ca_system_score_codex":0.0009812411,"about_ca_system_score_gemma":0.0007757487,"threshold_uncertainty_score":0.039506137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42034066,0.0007086566,0.53056455,0.001098986,0.00006768843,0.00014322453,0.0012503513,0.00039230313,0.04543354],"genre_scores_gemma":[0.8848786,0.00048029068,0.100080706,0.00026436063,0.00010482038,0.00015349108,0.0018385325,0.00012454364,0.01207461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996593,0.00008959724,0.000013509845,0.00009800285,0.00007870704,0.00006100493],"domain_scores_gemma":[0.9988165,0.0004953339,0.0002419893,0.00019247198,0.00012192413,0.00013180428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032611942,0.0003326474,0.00030189042,0.0006645417,0.000593844,0.00096726656,0.00047585275,0.0004029019,0.0042545465],"category_scores_gemma":[0.0014935483,0.00031957173,0.0006454265,0.0007891874,0.0008412084,0.0014660172,0.00095080974,0.0010049839,0.0005259705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000733731,0.00006621346,0.0013391308,0.00010416542,0.00002463029,0.00028157377,0.00039094646,0.014100041,0.010194684,0.95303226,0.0035532655,0.016839745],"study_design_scores_gemma":[0.00002397819,0.000035733432,0.0012881049,0.000023746436,0.000018135452,0.00040521278,0.00015355636,0.064493544,0.0034094623,0.9191939,0.010943381,0.0000112038715],"about_ca_topic_score_codex":0.0009020594,"about_ca_topic_score_gemma":0.0012423114,"teacher_disagreement_score":0.0042545465,"about_ca_system_score_codex":0.000750664,"about_ca_system_score_gemma":0.00028257747,"threshold_uncertainty_score":0.014232874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19802083,0.0009715796,0.77992094,0.002351888,0.00009252871,0.00010500698,0.0005557794,0.000265288,0.01771617],"genre_scores_gemma":[0.8658889,0.0006277953,0.12196256,0.00030341974,0.00020781498,0.00022595953,0.00048798043,0.00018436968,0.01011119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983209,0.0006861656,0.000068303336,0.00035058876,0.00034762087,0.00022635842],"domain_scores_gemma":[0.9870545,0.009062758,0.0010327252,0.001299335,0.0009267218,0.0006238923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029753451,0.00079983275,0.0009006809,0.00086487515,0.00082092383,0.0012680419,0.001170763,0.001175364,0.0061830077],"category_scores_gemma":[0.019949455,0.00039610686,0.0005507462,0.0010820188,0.002945468,0.0037010724,0.0018122405,0.0026114911,0.0006743994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000435138,0.00016449344,0.0016402563,0.00023122663,0.000056872086,0.00019545613,0.00035640405,0.25643855,0.0073463554,0.68983454,0.0084522655,0.034848504],"study_design_scores_gemma":[0.00006448912,0.0001429893,0.0009425044,0.00005272386,0.000012614892,0.00013217489,0.00015876589,0.45632643,0.00528077,0.5340777,0.0027612275,0.00004762704],"about_ca_topic_score_codex":0.0021192157,"about_ca_topic_score_gemma":0.0016691478,"teacher_disagreement_score":0.0061830077,"about_ca_system_score_codex":0.0013414928,"about_ca_system_score_gemma":0.0012856342,"threshold_uncertainty_score":0.020684183},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29534236,0.051406,0.17348243,0.03019505,0.0036827642,0.000091463546,0.0004019362,0.00047135737,0.44492665],"genre_scores_gemma":[0.87390745,0.015306909,0.019530207,0.0008598316,0.001714263,0.00007234734,0.00030152,0.000068034846,0.08823953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997279,0.000088308574,0.000015522102,0.000053893116,0.00006807442,0.00004635662],"domain_scores_gemma":[0.999567,0.00019296262,0.00006418652,0.00004053126,0.000050227354,0.00008507356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042062375,0.000281883,0.0002406369,0.0010235631,0.00080191507,0.0023730374,0.0003114506,0.0005416963,0.007771964],"category_scores_gemma":[0.0013427263,0.00020268699,0.00016872496,0.0014912836,0.0017930347,0.0036660938,0.0010759368,0.0015421917,0.0008100832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019396659,0.000015800893,0.00022255616,0.000046567853,0.00000254356,0.00004222945,0.00019815975,0.0017714305,0.0006347813,0.9751399,0.004647642,0.017258953],"study_design_scores_gemma":[0.000009069441,0.000038315717,0.00047676198,0.000045940724,0.0000039969473,0.00014441264,0.0004451072,0.003209476,0.0004900082,0.93115956,0.06396572,0.000011654981],"about_ca_topic_score_codex":0.0008508519,"about_ca_topic_score_gemma":0.0011608109,"teacher_disagreement_score":0.007771964,"about_ca_system_score_codex":0.0012750317,"about_ca_system_score_gemma":0.00031037309,"threshold_uncertainty_score":0.025999844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13992763,0.007884688,0.7297475,0.0035210452,0.00044120965,0.00014497942,0.001684829,0.0011469638,0.11550118],"genre_scores_gemma":[0.8480646,0.005549514,0.1271259,0.0011017371,0.0008121063,0.0003406116,0.0015235062,0.00056777726,0.014914287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963193,0.00095417275,0.00020989978,0.00059259374,0.0011684309,0.0007555848],"domain_scores_gemma":[0.9728421,0.018809987,0.0020762878,0.0029006978,0.002441286,0.00092967076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442614,0.001795291,0.001170443,0.0025706957,0.0011442346,0.0029536462,0.0019186037,0.0012076136,0.011245134],"category_scores_gemma":[0.018565334,0.00055254187,0.00097107084,0.0025192066,0.0021366419,0.0056894775,0.0038493269,0.0044228463,0.0031042253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009290461,0.00025197506,0.0032457013,0.0009723528,0.00012459735,0.0004455081,0.00065935455,0.11820185,0.029164832,0.712101,0.009269729,0.12463409],"study_design_scores_gemma":[0.00005479565,0.0004568772,0.0017666884,0.00028010955,0.00009223133,0.0009777884,0.00035734012,0.20512365,0.034294743,0.73819774,0.018236516,0.0001615715],"about_ca_topic_score_codex":0.00063888356,"about_ca_topic_score_gemma":0.0013543817,"teacher_disagreement_score":0.011245134,"about_ca_system_score_codex":0.0016538531,"about_ca_system_score_gemma":0.001070338,"threshold_uncertainty_score":0.037618697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67119944,0.00058905134,0.27922526,0.0006300192,0.000120286226,0.00013687152,0.00072655425,0.0002602927,0.04711215],"genre_scores_gemma":[0.92978203,0.00046187485,0.054508258,0.00020587508,0.000097004704,0.000085147054,0.00094151095,0.00011073385,0.013807465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995227,0.00008322708,0.000028745699,0.0001437795,0.00011780881,0.000103714476],"domain_scores_gemma":[0.9984139,0.0005969647,0.00028595174,0.00025547642,0.00016247483,0.00028511218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004178769,0.00048031603,0.00040051158,0.0008995214,0.0006814435,0.0012280026,0.00089522405,0.0005012543,0.007701909],"category_scores_gemma":[0.0019553786,0.00053138455,0.0007107022,0.0006448753,0.00116642,0.00270717,0.0012799278,0.0014586637,0.0006260474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117488875,0.00007070362,0.0008671891,0.00016791606,0.00003470912,0.00067641336,0.0007189469,0.012368627,0.00778059,0.95597273,0.0020301137,0.019194694],"study_design_scores_gemma":[0.00003865364,0.00007106591,0.00060371123,0.000031801927,0.00002645085,0.00039676166,0.00029359918,0.04373884,0.004202381,0.94299096,0.007585701,0.000020219893],"about_ca_topic_score_codex":0.0006326884,"about_ca_topic_score_gemma":0.0009859899,"teacher_disagreement_score":0.007701909,"about_ca_system_score_codex":0.00052431994,"about_ca_system_score_gemma":0.00030912866,"threshold_uncertainty_score":0.025765419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9475621,0.000250208,0.029629668,0.00034745727,0.00005640791,0.000022834934,0.00018973436,0.00010428511,0.021837449],"genre_scores_gemma":[0.9924349,0.0001452262,0.004985628,0.000039052968,0.000038339094,0.000026504062,0.000105436084,0.000029677933,0.0021952176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997991,0.000035282697,0.000008261936,0.000045182245,0.00004507362,0.000067180634],"domain_scores_gemma":[0.99877673,0.00066598604,0.00015620848,0.000096389456,0.000121597404,0.00018306146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037124404,0.00030648755,0.0003156743,0.0015538958,0.0011405902,0.0012786052,0.00046685516,0.00046872464,0.0032760082],"category_scores_gemma":[0.0018427225,0.0001978319,0.00024766935,0.00060140446,0.0015754063,0.0010231584,0.00054785406,0.0007220842,0.00025176437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020870594,0.000050679035,0.002754313,0.00011464719,0.000015820324,0.00029307892,0.00042338046,0.011993681,0.027579574,0.9405958,0.0017741476,0.014196098],"study_design_scores_gemma":[0.000052176616,0.000101501064,0.0043271226,0.00006154444,0.000036669233,0.00047318754,0.00034458743,0.08631817,0.016979834,0.887072,0.004169868,0.000063246705],"about_ca_topic_score_codex":0.00085239287,"about_ca_topic_score_gemma":0.0013510456,"teacher_disagreement_score":0.0032760082,"about_ca_system_score_codex":0.0008449693,"about_ca_system_score_gemma":0.0006084707,"threshold_uncertainty_score":0.010959387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4676562,0.007835652,0.30929294,0.0013049584,0.00052788446,0.000277978,0.0024276932,0.0011568237,0.20951982],"genre_scores_gemma":[0.83217293,0.0050625545,0.11781971,0.00093912834,0.0004911114,0.00027024024,0.0048018047,0.00039587903,0.038046546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995497,0.00011071625,0.000040748804,0.00011141044,0.00011058044,0.000076775934],"domain_scores_gemma":[0.99891555,0.0004567074,0.00016691076,0.00017140458,0.000171665,0.00011772378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040291843,0.0005648144,0.0004004089,0.0029481482,0.001388588,0.0016683819,0.00067913125,0.00073164765,0.0077313553],"category_scores_gemma":[0.0015522875,0.00030291593,0.00054125505,0.0022362832,0.0008020687,0.0028818594,0.0011620816,0.0010724519,0.00078897225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010953983,0.00003960035,0.0023924846,0.00032736958,0.000036930174,0.00043094484,0.00039449235,0.002917617,0.006955194,0.9119203,0.0048493114,0.0696263],"study_design_scores_gemma":[0.00001931962,0.00007095395,0.0046296017,0.00016880251,0.000070863745,0.0015454598,0.00039895563,0.012963606,0.006044745,0.9003729,0.073665544,0.000049237366],"about_ca_topic_score_codex":0.00042865484,"about_ca_topic_score_gemma":0.0005408494,"teacher_disagreement_score":0.0077313553,"about_ca_system_score_codex":0.0006480536,"about_ca_system_score_gemma":0.00029035538,"threshold_uncertainty_score":0.025863945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3243326,0.0007581507,0.63528126,0.00074381655,0.00011882669,0.00016818792,0.00035652547,0.0007550294,0.03748557],"genre_scores_gemma":[0.8272476,0.0005567418,0.15817009,0.00022500753,0.00008082577,0.0001460012,0.0003978873,0.00019463514,0.012981166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921656,0.00031258658,0.00003291222,0.00014664562,0.00015985059,0.00013151272],"domain_scores_gemma":[0.9970276,0.0016607934,0.00017733165,0.00060747936,0.00027530358,0.00025155017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146354,0.00066374574,0.0004640898,0.000750472,0.00086331286,0.0015666949,0.0011816534,0.00034314295,0.0034187345],"category_scores_gemma":[0.0029494967,0.000332448,0.00056315016,0.0014118495,0.0010660625,0.0015632996,0.0015804982,0.0009097539,0.00036169108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017776788,0.0001281411,0.001286073,0.00021975933,0.00005476532,0.0001909854,0.0005990988,0.10661549,0.015986204,0.7984268,0.004773338,0.07154157],"study_design_scores_gemma":[0.000061337065,0.00008747245,0.00049719977,0.000026773218,0.000040701398,0.00020459158,0.0001372414,0.41680804,0.007986412,0.5625881,0.011541121,0.000021050464],"about_ca_topic_score_codex":0.002311611,"about_ca_topic_score_gemma":0.0057199216,"teacher_disagreement_score":0.0034187345,"about_ca_system_score_codex":0.0016796379,"about_ca_system_score_gemma":0.0010681734,"threshold_uncertainty_score":0.012186706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72669023,0.0012494347,0.21208626,0.001592071,0.00012512125,0.00011332616,0.00049344124,0.00025708298,0.0573931],"genre_scores_gemma":[0.9477834,0.00056537567,0.036728438,0.00022511407,0.00013559392,0.00008958109,0.00050465803,0.000054802134,0.0139131695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965143,0.00012077903,0.000012826775,0.00008221118,0.00006315168,0.00006955409],"domain_scores_gemma":[0.9990758,0.0004276585,0.000118099386,0.00012222663,0.00012570823,0.0001304729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036032664,0.00028816433,0.0002608424,0.0011495101,0.0007501774,0.0015655578,0.00044385687,0.00056547235,0.0034477846],"category_scores_gemma":[0.0013673408,0.00020148233,0.0004129435,0.0010489393,0.0015200308,0.0023417538,0.0009779163,0.00107697,0.0003752985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018651197,0.0000109392695,0.00058143033,0.00002981365,0.000004608001,0.00006213971,0.00032720744,0.0015043743,0.0017578535,0.9872508,0.0004905445,0.007961575],"study_design_scores_gemma":[0.00000964863,0.00001991059,0.00062073703,0.000020591322,0.000007774401,0.00013631239,0.00029760643,0.009244854,0.0021575661,0.97928077,0.0081926035,0.000011606061],"about_ca_topic_score_codex":0.00095456705,"about_ca_topic_score_gemma":0.0008441709,"teacher_disagreement_score":0.0034477846,"about_ca_system_score_codex":0.0010548905,"about_ca_system_score_gemma":0.00041018464,"threshold_uncertainty_score":0.011533916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41878533,0.00061655877,0.52984774,0.00060581724,0.00006846805,0.00019064576,0.0011171381,0.00044417745,0.04832414],"genre_scores_gemma":[0.8589707,0.00036277084,0.1307058,0.00021633247,0.000034409073,0.00010534007,0.001575547,0.00008980035,0.007939392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948514,0.000075848206,0.00003859426,0.00012347194,0.00010530963,0.00017156382],"domain_scores_gemma":[0.9985293,0.00045339103,0.00023851117,0.00017630021,0.00034503915,0.00025734422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046468055,0.00040852398,0.00028480045,0.0013654538,0.00085744297,0.0012150644,0.00048391547,0.00039101255,0.004435584],"category_scores_gemma":[0.0019390613,0.00043952902,0.00071969413,0.0008720991,0.0009452258,0.002040709,0.0011680747,0.0009874668,0.00060774974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025368447,0.0001011874,0.0045367437,0.00024229121,0.000043453143,0.0008709247,0.00079968874,0.022720069,0.016830735,0.9120275,0.0045220978,0.037051596],"study_design_scores_gemma":[0.000051037776,0.000103645885,0.00419184,0.00012657257,0.000054438395,0.0010061677,0.00065401127,0.12054348,0.0074009253,0.8503536,0.0154822115,0.000032093394],"about_ca_topic_score_codex":0.0020883658,"about_ca_topic_score_gemma":0.0056807306,"teacher_disagreement_score":0.004435584,"about_ca_system_score_codex":0.00087164924,"about_ca_system_score_gemma":0.0007196921,"threshold_uncertainty_score":0.014838457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5228852,0.0018929293,0.41960037,0.0010254609,0.00056094467,0.000055523516,0.00016347245,0.00013081949,0.05368535],"genre_scores_gemma":[0.9608608,0.0004142307,0.026795357,0.0001691901,0.00021993564,0.000025983582,0.000057902755,0.000054212003,0.01140236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.0001981148,0.000050467723,0.00016379946,0.0003690201,0.00008994321],"domain_scores_gemma":[0.9986355,0.00028658143,0.00022794877,0.0001963758,0.00041292177,0.0002406143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013791984,0.00036904216,0.00040909043,0.0020155993,0.000685854,0.0022687337,0.0007079958,0.00061933027,0.0025798168],"category_scores_gemma":[0.0026059947,0.00022410504,0.00061004324,0.0007474088,0.0038187234,0.0031365065,0.0014248576,0.0012525074,0.00030140125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012053161,0.0000084646135,0.00016999198,0.00000974128,0.000003307518,0.00008350809,0.0001539674,0.0014949826,0.0016608651,0.99261624,0.00011886745,0.0036678826],"study_design_scores_gemma":[0.000008832275,0.000061247716,0.00053539814,0.000012401739,0.000004157209,0.00028674747,0.00012264113,0.028315721,0.0018157157,0.9634811,0.005332709,0.000023196164],"about_ca_topic_score_codex":0.0004923391,"about_ca_topic_score_gemma":0.00037694216,"teacher_disagreement_score":0.0025798168,"about_ca_system_score_codex":0.0010225811,"about_ca_system_score_gemma":0.00036857298,"threshold_uncertainty_score":0.008630335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7060101,0.00026194565,0.13960251,0.00052834477,0.00021745932,0.000072093644,0.00026446037,0.00030900998,0.15273409],"genre_scores_gemma":[0.98018825,0.000120484736,0.0077858292,0.00010681321,0.00009921215,0.000028294962,0.00011112559,0.000055735884,0.011504389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938667,0.000089193476,0.000033814853,0.00014421763,0.00016207619,0.0001840672],"domain_scores_gemma":[0.999516,0.000110699,0.00008969553,0.00010381759,0.000071087896,0.000108607186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041941577,0.0003864025,0.00031475647,0.00074685586,0.0011499352,0.0015778826,0.0003922949,0.00042493685,0.0059884847],"category_scores_gemma":[0.0010387369,0.00020257995,0.00039316682,0.0005094131,0.0020309892,0.0020982786,0.0011430585,0.0009910092,0.00076720945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045163524,0.000012580775,0.00030475194,0.000019675615,0.0000034698771,0.00015966756,0.000099525394,0.0010181753,0.0030190854,0.9881798,0.00040064694,0.0067374697],"study_design_scores_gemma":[0.00002451523,0.00008052729,0.0013113406,0.00002072402,0.000011756178,0.0007256623,0.00015072222,0.020025171,0.013379401,0.95475626,0.0094659375,0.000047870537],"about_ca_topic_score_codex":0.0007304122,"about_ca_topic_score_gemma":0.0005524997,"teacher_disagreement_score":0.0059884847,"about_ca_system_score_codex":0.0010081544,"about_ca_system_score_gemma":0.00063735433,"threshold_uncertainty_score":0.020033479},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2632748,0.0012538048,0.28119078,0.0043972996,0.0034745026,0.00025609208,0.00074611825,0.0012056205,0.444201],"genre_scores_gemma":[0.8148722,0.00050614437,0.057630558,0.0018899774,0.00088250666,0.00021595061,0.0003844951,0.0005706698,0.123047546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919385,0.0002635034,0.000021321059,0.00017835824,0.00017681251,0.00016616019],"domain_scores_gemma":[0.9992324,0.00020761734,0.00007474987,0.00017758673,0.00018776674,0.00011987973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000616099,0.00091571757,0.0009654886,0.0019447088,0.002123737,0.0020821602,0.00093928946,0.0023761776,0.028647507],"category_scores_gemma":[0.00291386,0.00040173408,0.0007871246,0.0007838431,0.0016884812,0.0024270064,0.0017874219,0.0018893812,0.00451365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004987807,0.000023744004,0.0001389803,0.000021152217,0.0000136183735,0.00017043055,0.00006940017,0.0010942118,0.0015141596,0.9860859,0.004789889,0.006028695],"study_design_scores_gemma":[0.00002857821,0.00004033923,0.00026754694,0.00002408616,0.000012602042,0.00036211457,0.00007589581,0.017203143,0.001721596,0.9657547,0.014476099,0.00003336903],"about_ca_topic_score_codex":0.00091278023,"about_ca_topic_score_gemma":0.0010635827,"teacher_disagreement_score":0.028647507,"about_ca_system_score_codex":0.00083024043,"about_ca_system_score_gemma":0.00080603716,"threshold_uncertainty_score":0.09583545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8063683,0.00038944825,0.15486747,0.00031820976,0.00022639884,0.00010697078,0.00027489418,0.0004514563,0.036996868],"genre_scores_gemma":[0.96129805,0.0003056977,0.025320299,0.00022294982,0.00015134217,0.00007278623,0.0003860775,0.0001214798,0.012121324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995055,0.00010813343,0.000026813006,0.00014202259,0.00011061785,0.000106917876],"domain_scores_gemma":[0.99870694,0.00036212767,0.00025256883,0.00028291062,0.00018522015,0.00021026339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038764885,0.00035083754,0.0002739321,0.0008168946,0.0007580413,0.0011840628,0.00045399147,0.00047852207,0.0020446817],"category_scores_gemma":[0.0018752097,0.0003526786,0.0007374662,0.00050925696,0.0014780253,0.0012782783,0.0009026986,0.00087420526,0.0003917528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011535656,0.000058441696,0.0014216399,0.000056508958,0.000032915174,0.00039018874,0.0008428435,0.010179536,0.020258747,0.94472224,0.0016682884,0.020253247],"study_design_scores_gemma":[0.000055201657,0.00011182436,0.0015020936,0.000019982479,0.00002858021,0.00029725078,0.00017957685,0.030960614,0.010260581,0.9431467,0.013401741,0.000035735044],"about_ca_topic_score_codex":0.001847717,"about_ca_topic_score_gemma":0.001600076,"teacher_disagreement_score":0.0020446817,"about_ca_system_score_codex":0.0007055982,"about_ca_system_score_gemma":0.00044036168,"threshold_uncertainty_score":0.00684011},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5228852,0.0018929293,0.41960037,0.0010254609,0.00056094467,0.000055523516,0.00016347245,0.00013081949,0.05368535],"genre_scores_gemma":[0.9608608,0.0004142307,0.026795357,0.0001691901,0.00021993564,0.000025983582,0.000057902755,0.000054212003,0.01140236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.0001981148,0.000050467723,0.00016379946,0.0003690201,0.00008994321],"domain_scores_gemma":[0.9986355,0.00028658143,0.00022794877,0.0001963758,0.00041292177,0.0002406143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013791984,0.00036904216,0.00040909043,0.0020155993,0.000685854,0.0022687337,0.0007079958,0.00061933027,0.0025798168],"category_scores_gemma":[0.0026059947,0.00022410504,0.00061004324,0.0007474088,0.0038187234,0.0031365065,0.0014248576,0.0012525074,0.00030140125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012053161,0.0000084646135,0.00016999198,0.00000974128,0.000003307518,0.00008350809,0.0001539674,0.0014949826,0.0016608651,0.99261624,0.00011886745,0.0036678826],"study_design_scores_gemma":[0.000008832275,0.000061247716,0.00053539814,0.000012401739,0.000004157209,0.00028674747,0.00012264113,0.028315721,0.0018157157,0.9634811,0.005332709,0.000023196164],"about_ca_topic_score_codex":0.0004923391,"about_ca_topic_score_gemma":0.00037694216,"teacher_disagreement_score":0.0025798168,"about_ca_system_score_codex":0.0010225811,"about_ca_system_score_gemma":0.00036857298,"threshold_uncertainty_score":0.008630335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45800027,0.0002518226,0.5146305,0.00023369657,0.00017514186,0.00010061311,0.00019435344,0.0012420963,0.025171507],"genre_scores_gemma":[0.8399727,0.0001155523,0.1522831,0.000088051616,0.000017916927,0.00010045535,0.00019897864,0.00019122161,0.007032128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995951,0.00009615449,0.000028278455,0.00008335075,0.00009540621,0.00010169003],"domain_scores_gemma":[0.9992404,0.00018512321,0.00011652847,0.00026151483,0.00012068931,0.00007582204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002617994,0.0003618975,0.000349347,0.00036045047,0.00037095888,0.00073018356,0.00090144674,0.00031669045,0.0054982263],"category_scores_gemma":[0.0012539608,0.00030849362,0.0004758548,0.00052233087,0.0006120361,0.00083995995,0.0010503923,0.00048472363,0.0007467449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084703957,0.00019893238,0.003689453,0.00038222692,0.000111887035,0.0012438189,0.000722538,0.22288017,0.14428583,0.47420985,0.008774848,0.14265342],"study_design_scores_gemma":[0.00020279957,0.0003781791,0.0012998291,0.00005640538,0.000053757238,0.00061531295,0.00038565404,0.7285727,0.06291105,0.17944106,0.026002515,0.000080726815],"about_ca_topic_score_codex":0.0014769885,"about_ca_topic_score_gemma":0.0013848263,"teacher_disagreement_score":0.0054982263,"about_ca_system_score_codex":0.0005586495,"about_ca_system_score_gemma":0.00038705673,"threshold_uncertainty_score":0.018393397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8990223,0.0006867782,0.07076814,0.0004395498,0.00017903844,0.00006623203,0.00038953335,0.00028609362,0.028162276],"genre_scores_gemma":[0.9806482,0.00013856444,0.011063563,0.000092263675,0.00011800322,0.00006915557,0.00030855532,0.000047268248,0.0075144703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989668,0.00029143746,0.00007523392,0.00015010432,0.0003136215,0.00020267049],"domain_scores_gemma":[0.998302,0.00049302826,0.00025304593,0.00018478328,0.00026750055,0.000499641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095019204,0.00030690685,0.0006264712,0.001640654,0.0015362428,0.0025749234,0.0006722788,0.00045058245,0.0051680007],"category_scores_gemma":[0.0016983148,0.00030136015,0.00067197613,0.00067617046,0.0021032218,0.0022534335,0.0013440524,0.0005223702,0.0007988764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016861748,0.000044748267,0.0011364766,0.0000538902,0.000014289807,0.00033715038,0.00071366975,0.0010057415,0.011518876,0.97808594,0.0010831085,0.0058374214],"study_design_scores_gemma":[0.000105035,0.00024727912,0.003624029,0.00006345555,0.000043916494,0.0010380828,0.0012173494,0.022780756,0.016308978,0.9280984,0.02639658,0.00007606943],"about_ca_topic_score_codex":0.0016862971,"about_ca_topic_score_gemma":0.0010938216,"teacher_disagreement_score":0.0051680007,"about_ca_system_score_codex":0.0011137384,"about_ca_system_score_gemma":0.0005926173,"threshold_uncertainty_score":0.017288625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853165,0.0009819929,0.5823121,0.0010375198,0.00025208917,0.00020483341,0.00039337392,0.0013315501,0.028170114],"genre_scores_gemma":[0.7384179,0.00081764744,0.24924326,0.00046715708,0.00011501152,0.00030955582,0.0006197354,0.00033657768,0.009673061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991277,0.0002679246,0.0000772647,0.0001235967,0.00023933288,0.00016425876],"domain_scores_gemma":[0.9962807,0.0021729525,0.0005261339,0.00055329734,0.00026835466,0.00019842733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009050692,0.0011012948,0.00075622846,0.0010629279,0.0006807668,0.001286608,0.0008630357,0.0016010429,0.0034001248],"category_scores_gemma":[0.007037373,0.00066801376,0.00049852784,0.001206635,0.0010829546,0.0021275654,0.0018722453,0.0015058087,0.0013402624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001104282,0.0002601958,0.0021000623,0.0005917676,0.00008964167,0.00046885008,0.0007962945,0.10722615,0.09405209,0.596885,0.0059220605,0.19050354],"study_design_scores_gemma":[0.00030109964,0.00079958246,0.00093685073,0.00023636906,0.00008433803,0.0005338926,0.00039547432,0.32388404,0.06933365,0.58900535,0.014366289,0.00012299207],"about_ca_topic_score_codex":0.0004804234,"about_ca_topic_score_gemma":0.0009299487,"teacher_disagreement_score":0.0034001248,"about_ca_system_score_codex":0.0008794051,"about_ca_system_score_gemma":0.0010019157,"threshold_uncertainty_score":0.011374533},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008221652,0.00027774923,0.98825955,0.00029623404,0.00003114459,0.000044863915,0.00041637977,0.00083762174,0.0016148069],"genre_scores_gemma":[0.0973992,0.0008563078,0.8936073,0.00032140556,0.00016031711,0.00021727673,0.0023356865,0.00075638795,0.004346049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979589,0.000785004,0.000116059935,0.00047047372,0.0005020596,0.00016742622],"domain_scores_gemma":[0.9938292,0.003935257,0.0005337661,0.00086013327,0.000594836,0.0002468386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025394666,0.0012481285,0.0009512923,0.0025901021,0.0011367871,0.0027769133,0.0016062382,0.001083484,0.006675135],"category_scores_gemma":[0.017473992,0.0008058609,0.0012168126,0.0035082712,0.0020030634,0.00539867,0.0032568318,0.0032360926,0.003071491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016993372,0.000111420544,0.005200701,0.00026309185,0.000063432984,0.0003807631,0.0005461805,0.280759,0.0024224885,0.45855516,0.011135448,0.24039234],"study_design_scores_gemma":[0.000032014992,0.00003717752,0.0010976624,0.00007431126,0.000016119395,0.00023791239,0.00010091056,0.4341892,0.00082228205,0.5524542,0.010900989,0.00003710133],"about_ca_topic_score_codex":0.00991578,"about_ca_topic_score_gemma":0.014306073,"teacher_disagreement_score":0.00991578,"about_ca_system_score_codex":0.0017145575,"about_ca_system_score_gemma":0.0021601636,"threshold_uncertainty_score":0.022330523},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05785202,0.0079558315,0.42394027,0.012925804,0.0071598766,0.00010343076,0.0005724194,0.0007231909,0.4887672],"genre_scores_gemma":[0.82195425,0.0064957705,0.089067,0.005397328,0.005316027,0.00016279316,0.00045090017,0.0006101244,0.07054574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998572,0.0003278728,0.00008690233,0.00019881522,0.0006154085,0.00019894191],"domain_scores_gemma":[0.99746287,0.0011485253,0.00017984488,0.0004831047,0.000546888,0.00017888253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017273295,0.0009766849,0.0007296726,0.0016257038,0.0016862017,0.0037279213,0.0014231395,0.0015322894,0.01680215],"category_scores_gemma":[0.0060872254,0.00038777528,0.0011224695,0.0010394829,0.0033108785,0.0046903426,0.0035691878,0.00326801,0.0033674159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005871174,0.000008862013,0.000044321263,0.000045846726,0.0000026818432,0.000097617456,0.00010454084,0.00023048576,0.00040659436,0.9925331,0.003137844,0.0033821992],"study_design_scores_gemma":[0.000008382555,0.000009301234,0.000083135514,0.000034511417,0.0000042083543,0.00026638093,0.000055287048,0.001397667,0.0007757789,0.9805629,0.016786598,0.000015728],"about_ca_topic_score_codex":0.0005390178,"about_ca_topic_score_gemma":0.0004774122,"teacher_disagreement_score":0.01680215,"about_ca_system_score_codex":0.0012316445,"about_ca_system_score_gemma":0.0009840154,"threshold_uncertainty_score":0.05620885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5518129,0.000654732,0.4131665,0.00026933762,0.0000710756,0.000177363,0.0008427885,0.00031017247,0.032695223],"genre_scores_gemma":[0.79966915,0.0004616573,0.1850327,0.00013071772,0.000051690666,0.00017953507,0.0025757516,0.00011406699,0.011784752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994423,0.00011844471,0.00004251426,0.00017499585,0.0001201092,0.00010158977],"domain_scores_gemma":[0.998599,0.0003060148,0.00021643977,0.00018119678,0.00048294634,0.00021441735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006160825,0.0004481118,0.00035328514,0.00096341514,0.0006735088,0.0012455378,0.00042128123,0.0002736353,0.0035826017],"category_scores_gemma":[0.0012956002,0.00047099072,0.00055793935,0.00059201324,0.0012154857,0.0017206038,0.0011803759,0.0008151745,0.0005598067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036606824,0.00010408358,0.004363477,0.00028022012,0.00005265235,0.00082261814,0.0016377511,0.013894609,0.015877664,0.91822624,0.004584502,0.039790146],"study_design_scores_gemma":[0.00010423131,0.00046453057,0.007200859,0.00018808787,0.0001616694,0.0025844495,0.0013904402,0.097290315,0.018481724,0.81774044,0.054308932,0.00008434503],"about_ca_topic_score_codex":0.0012139191,"about_ca_topic_score_gemma":0.0019354977,"teacher_disagreement_score":0.0035826017,"about_ca_system_score_codex":0.0004043406,"about_ca_system_score_gemma":0.0005962029,"threshold_uncertainty_score":0.011985004},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06931247,0.00014585663,0.91713315,0.00013392104,0.00008192669,0.00005835092,0.0001742319,0.0007753723,0.012184618],"genre_scores_gemma":[0.5024798,0.00018225677,0.49020678,0.00009548966,0.000051066378,0.00015631558,0.00028338897,0.00039206282,0.0061528124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986609,0.00031397937,0.000110438814,0.00030528344,0.00045534578,0.00015390603],"domain_scores_gemma":[0.9969914,0.001448435,0.000303967,0.00067638955,0.00044728175,0.00013247725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009971547,0.00064317696,0.0006151511,0.0013462526,0.0006396488,0.0017808803,0.0013404601,0.00052334205,0.0062278877],"category_scores_gemma":[0.0066688964,0.00034817465,0.0004894644,0.0012092942,0.0017456264,0.0023574336,0.0015089982,0.00074191974,0.0011123266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037129023,0.00006181317,0.004748773,0.00038185145,0.000050600534,0.000371681,0.0005398904,0.0824679,0.039586388,0.64158016,0.005626984,0.22421269],"study_design_scores_gemma":[0.000033928667,0.00014282487,0.0017876033,0.000102534,0.00003206982,0.0007787818,0.00022543772,0.5194566,0.06479002,0.39653862,0.016026288,0.000085301705],"about_ca_topic_score_codex":0.001004445,"about_ca_topic_score_gemma":0.0018245608,"teacher_disagreement_score":0.0062278877,"about_ca_system_score_codex":0.0008887563,"about_ca_system_score_gemma":0.0007502635,"threshold_uncertainty_score":0.020834327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55703443,0.0008101626,0.3883006,0.0005896276,0.00011552701,0.00018690503,0.0006874223,0.0002464997,0.052028734],"genre_scores_gemma":[0.887931,0.00071941095,0.09583514,0.00021027857,0.00013693243,0.00014372446,0.0010389942,0.00015459934,0.01383001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993881,0.00011794402,0.00004155823,0.00020100415,0.00014208148,0.0001092379],"domain_scores_gemma":[0.99774736,0.00090263895,0.0004551111,0.0003834207,0.00022178165,0.00028972438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058843655,0.0004965239,0.00036815013,0.0012802472,0.0007646588,0.0012563433,0.0008745952,0.0005119814,0.007538706],"category_scores_gemma":[0.0027706495,0.00050866825,0.0007984324,0.0009810088,0.0014811122,0.0029482027,0.0011383449,0.0014685036,0.0005871111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000987498,0.00005239383,0.0011044076,0.00018392465,0.000038883096,0.0006548795,0.0007516405,0.0122784525,0.005723657,0.9531337,0.0018916146,0.024087725],"study_design_scores_gemma":[0.000031183594,0.000058595277,0.0006781706,0.000032926986,0.000030011312,0.000580546,0.0002958422,0.03820392,0.00414728,0.94718784,0.008735285,0.000018363084],"about_ca_topic_score_codex":0.00058842055,"about_ca_topic_score_gemma":0.00076768984,"teacher_disagreement_score":0.007538706,"about_ca_system_score_codex":0.0004904514,"about_ca_system_score_gemma":0.0002582875,"threshold_uncertainty_score":0.0252195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4879793,0.0028438151,0.41419348,0.002640782,0.00046476853,0.00006447484,0.00042792645,0.00024620997,0.09113923],"genre_scores_gemma":[0.9624084,0.0008258874,0.021353627,0.00037546796,0.00027436888,0.000051989773,0.00012418527,0.00003703309,0.014549091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993581,0.00021067838,0.00003112403,0.00009996152,0.00019160782,0.00010856176],"domain_scores_gemma":[0.99784124,0.0010876947,0.00036857344,0.00023144059,0.0003391338,0.0001318613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006320812,0.00039732936,0.00046981368,0.0020825625,0.0009090989,0.0022249487,0.00049180625,0.0011636922,0.0035067277],"category_scores_gemma":[0.0035942039,0.00035277914,0.00031717992,0.0013498224,0.0015891902,0.0019041372,0.0010483174,0.0010430128,0.00049537467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002758836,0.000011634416,0.00018690045,0.000017678047,0.00000345691,0.000062597835,0.00009433621,0.0035208098,0.0011808086,0.9905642,0.0004454281,0.0038845723],"study_design_scores_gemma":[0.0000071400295,0.00000823771,0.00015143327,0.000011233337,0.000002945448,0.00010587516,0.000044624725,0.018537411,0.0009517082,0.9790668,0.001099465,0.000013051183],"about_ca_topic_score_codex":0.00070885394,"about_ca_topic_score_gemma":0.00076663936,"teacher_disagreement_score":0.0035067277,"about_ca_system_score_codex":0.00074757833,"about_ca_system_score_gemma":0.00053927395,"threshold_uncertainty_score":0.011731148},"labels":[],"label_agreement":null},{"id":"W4408857251","doi":"10.1002/jcd.21967","title":"The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Variable (mathematics); Arithmetic; Discrete mathematics; Mathematical analysis","score_opus":0.0048401494233164385,"score_gpt":0.1939390366370824,"score_spread":0.18909888721376597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408857251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15218024,0.00016028639,0.8190862,0.0010666857,0.000051629464,0.00047007386,0.00030292186,0.00033541233,0.02634664],"genre_scores_gemma":[0.32522693,0.0001934517,0.6623119,0.00021511232,0.000039685212,0.0004352499,0.00053450314,0.000078338264,0.010964834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992329,0.00026815577,0.00003668799,0.00013028077,0.00016890997,0.00016309606],"domain_scores_gemma":[0.99889636,0.0006557156,0.000082999104,0.0001607507,0.00011653625,0.000087552224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935063,0.0003892664,0.00044617843,0.00084117823,0.00085643586,0.0010253687,0.0011995644,0.0009954248,0.00657769],"category_scores_gemma":[0.00340076,0.0003683004,0.00080106274,0.0008167373,0.0011800049,0.0018137178,0.0021013801,0.0014735374,0.00054095074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000880731,0.00021842335,0.0012815546,0.0002172983,0.00003493114,0.0002641179,0.00048207387,0.06177912,0.006600386,0.8046674,0.008127498,0.11623918],"study_design_scores_gemma":[0.000118743425,0.00012050057,0.0005423278,0.00009103706,0.000049448237,0.00031416948,0.00048056562,0.37916857,0.0073604803,0.5856991,0.0260105,0.00004452602],"about_ca_topic_score_codex":0.0021922959,"about_ca_topic_score_gemma":0.0044284198,"teacher_disagreement_score":0.00657769,"about_ca_system_score_codex":0.00080867176,"about_ca_system_score_gemma":0.0012602336,"threshold_uncertainty_score":0.022004604},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2322212,0.00059796474,0.7171607,0.00026557056,0.00010933506,0.00011411411,0.00015189314,0.00020874017,0.04917045],"genre_scores_gemma":[0.76982313,0.0006069818,0.2120695,0.00010774102,0.00007691244,0.00017649746,0.00015362908,0.000054197397,0.016931428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.000105092484,0.000027515962,0.000066954424,0.00013023794,0.00005773374],"domain_scores_gemma":[0.9993844,0.000188446,0.00012477407,0.00015776788,0.00009193974,0.00005268977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003906104,0.00030673077,0.00019384554,0.0006767117,0.0003854162,0.0008763207,0.00034828787,0.0003350025,0.004985796],"category_scores_gemma":[0.0012758748,0.00018554852,0.0002937151,0.0006236144,0.0008226905,0.00082891755,0.00060430664,0.0007526191,0.00068674615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085597145,0.0000306473,0.00027659518,0.000060404578,0.000011209702,0.000090402486,0.00018546767,0.008624493,0.015957383,0.92084044,0.00062562845,0.053211633],"study_design_scores_gemma":[0.00005994448,0.0002577584,0.00035976057,0.00005652559,0.000017920462,0.00045472052,0.00015566131,0.072708175,0.017658422,0.8912712,0.016966874,0.000032983633],"about_ca_topic_score_codex":0.00017591525,"about_ca_topic_score_gemma":0.0002800945,"teacher_disagreement_score":0.004985796,"about_ca_system_score_codex":0.00046635902,"about_ca_system_score_gemma":0.0003585554,"threshold_uncertainty_score":0.016679168},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0369229,0.00010882879,0.9575429,0.00010430212,0.000028644403,0.00003424757,0.000022844803,0.00017113304,0.0050642295],"genre_scores_gemma":[0.64037573,0.0002965563,0.3565106,0.000116174764,0.00004061487,0.000051308867,0.000052770287,0.000030443565,0.002525847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993098,0.00023928063,0.000022140532,0.00007039112,0.00029383475,0.00006454181],"domain_scores_gemma":[0.9993212,0.00026384907,0.000103485516,0.00017182008,0.000113167735,0.00002643408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005714968,0.0006484876,0.00032662658,0.0003664081,0.00034470562,0.00053071056,0.0004469962,0.00037887134,0.0005983636],"category_scores_gemma":[0.0013347658,0.0002339861,0.00028653262,0.0004746289,0.00083319977,0.00060303195,0.00083636004,0.0007113659,0.00024606715],"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.00027785535,0.0002557281,0.001389944,0.000163558,0.000119285876,0.00027063335,0.0003283271,0.32196122,0.22220932,0.23432091,0.0015709462,0.21713229],"study_design_scores_gemma":[0.00002451964,0.00018550249,0.0002163045,0.000012937626,0.000016743155,0.0002605945,0.0000222766,0.89128596,0.0848651,0.019397013,0.0036803447,0.00003278332],"about_ca_topic_score_codex":0.0003227388,"about_ca_topic_score_gemma":0.0006146377,"teacher_disagreement_score":0.0006484876,"about_ca_system_score_codex":0.00036329177,"about_ca_system_score_gemma":0.0005218944,"threshold_uncertainty_score":0.0030224323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6565048,0.00079835526,0.1251035,0.0014927372,0.000333603,0.0002097962,0.00087000406,0.00038905483,0.21429813],"genre_scores_gemma":[0.88209975,0.0008075668,0.036154147,0.00037742834,0.00018181042,0.00027948632,0.0011154298,0.0003717176,0.07861266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996871,0.00005488625,0.000012543158,0.00008369545,0.00008669475,0.00007519151],"domain_scores_gemma":[0.9981744,0.0009816588,0.00021066076,0.00011870988,0.00015076595,0.00036386837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021405546,0.00078677776,0.0011313041,0.0016110091,0.0021945816,0.0029826588,0.0009766002,0.0013516595,0.023846881],"category_scores_gemma":[0.0020940676,0.0007810884,0.0008843649,0.0009468853,0.0017968169,0.0021489584,0.0023302997,0.0029820562,0.0021000218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018177011,0.00010675639,0.00069836277,0.00021949343,0.000056889145,0.000543536,0.00040289442,0.013221397,0.0052956874,0.96120876,0.005996181,0.012068215],"study_design_scores_gemma":[0.000104904895,0.00014463766,0.0015196854,0.00008630213,0.00005353263,0.0008484556,0.0007247735,0.058683243,0.0027492528,0.91415876,0.02087968,0.00004675],"about_ca_topic_score_codex":0.00090774125,"about_ca_topic_score_gemma":0.0009746867,"teacher_disagreement_score":0.023846881,"about_ca_system_score_codex":0.0006578571,"about_ca_system_score_gemma":0.00039916916,"threshold_uncertainty_score":0.07977581},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57381487,0.0009780332,0.27041158,0.000557059,0.0008122506,0.000088528184,0.00022989941,0.0003777757,0.15273008],"genre_scores_gemma":[0.9422055,0.0002210774,0.04569567,0.00022780428,0.00011636025,0.00006871123,0.0002573262,0.00011544008,0.011092129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977535,0.0000277841,0.000014767147,0.000063083724,0.00006884991,0.000050073995],"domain_scores_gemma":[0.99979645,0.000054467422,0.000027474502,0.00005527342,0.000029111632,0.000037253492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019721886,0.00029312624,0.00028642014,0.00045190967,0.0005451764,0.0007078042,0.00033315772,0.0003561346,0.0071592387],"category_scores_gemma":[0.00054602296,0.00014219628,0.00041704674,0.00022764727,0.001201592,0.0007972688,0.00072047714,0.0008000973,0.0006534539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008858624,0.000038654834,0.0006812256,0.00010497588,0.00001220643,0.00022726943,0.00030369635,0.0119252615,0.0340111,0.9178052,0.0020757662,0.032726105],"study_design_scores_gemma":[0.000034735625,0.00012838445,0.00044876817,0.000042672327,0.00001292729,0.00029952335,0.00030695723,0.055301666,0.023061097,0.8973054,0.02303612,0.000021750642],"about_ca_topic_score_codex":0.00029488374,"about_ca_topic_score_gemma":0.0003742003,"teacher_disagreement_score":0.0071592387,"about_ca_system_score_codex":0.0005092706,"about_ca_system_score_gemma":0.00020880006,"threshold_uncertainty_score":0.02395004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030399809,0.00041835997,0.9486739,0.00059527834,0.00019257318,0.0001367709,0.00034077052,0.0005804535,0.01866215],"genre_scores_gemma":[0.2725861,0.00069750595,0.7034116,0.0006530777,0.00022801226,0.0004082594,0.0009089414,0.00042115184,0.020685328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986047,0.0003681754,0.00013993165,0.00023419688,0.00046769675,0.00018528158],"domain_scores_gemma":[0.9977324,0.0010380078,0.000097943324,0.0005874868,0.00042481496,0.00011936304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071377,0.0011260192,0.0010567644,0.0034334688,0.002229101,0.0032694424,0.0021510792,0.0015465822,0.0069701197],"category_scores_gemma":[0.0054647014,0.0005971865,0.0015178251,0.002838598,0.0019526343,0.0062818984,0.003460188,0.0026294473,0.0017822126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000724706,0.00008267282,0.0006687523,0.00016468948,0.000035155386,0.000101538426,0.00036480473,0.014589719,0.0041251327,0.8705634,0.0047476776,0.10448396],"study_design_scores_gemma":[0.000010552675,0.000024619825,0.000089079185,0.000049204562,0.000023563913,0.00008754939,0.000088318884,0.058385428,0.0021241012,0.9322537,0.006841842,0.000021899477],"about_ca_topic_score_codex":0.0017291501,"about_ca_topic_score_gemma":0.0046493183,"teacher_disagreement_score":0.0069701197,"about_ca_system_score_codex":0.0015136026,"about_ca_system_score_gemma":0.0016050204,"threshold_uncertainty_score":0.023317337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7276782,0.00071693334,0.154856,0.0017045629,0.000546788,0.000093221206,0.00028700932,0.0003591824,0.113758184],"genre_scores_gemma":[0.9594814,0.0003245088,0.014793479,0.000390196,0.0001637499,0.00008739826,0.00014152343,0.00012104228,0.024496585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990163,0.00028573922,0.0000586454,0.00012540116,0.00025966731,0.00025432935],"domain_scores_gemma":[0.99719185,0.0012075909,0.00033006503,0.00036822222,0.00044694438,0.00045532035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008985231,0.00049492536,0.000647501,0.002123247,0.0022902088,0.002995102,0.00080410205,0.0013637429,0.008822385],"category_scores_gemma":[0.0032565084,0.00054074015,0.0005334192,0.0012031032,0.0024053277,0.0031438058,0.0022818488,0.0023873183,0.0011507017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006607164,0.000013057188,0.00013020501,0.000019463989,0.0000047740104,0.00005733259,0.00019953812,0.0009970043,0.002244455,0.99180955,0.00071009493,0.0037485363],"study_design_scores_gemma":[0.000016070615,0.000028675156,0.00014372556,0.000015538875,0.0000054066954,0.00006188945,0.0001245428,0.006580607,0.0012017251,0.9896012,0.0022034138,0.000017057297],"about_ca_topic_score_codex":0.0009869237,"about_ca_topic_score_gemma":0.0011134195,"teacher_disagreement_score":0.008822385,"about_ca_system_score_codex":0.0010243059,"about_ca_system_score_gemma":0.0007193067,"threshold_uncertainty_score":0.029513836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8359873,0.0004993293,0.11449787,0.0033288903,0.00013627639,0.00013594655,0.00082019536,0.00090999773,0.043684296],"genre_scores_gemma":[0.9857917,0.00023969782,0.009703745,0.0005159551,0.000052140036,0.00007952416,0.00040826717,0.0000766822,0.0031323836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992416,0.00014191102,0.00003107849,0.00025162476,0.00017953973,0.00015430691],"domain_scores_gemma":[0.99674904,0.0014492841,0.0005664026,0.00073010306,0.00026938642,0.00023573264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775387,0.0003758352,0.00056023395,0.00048127567,0.0014425465,0.0012562512,0.00080894533,0.0007688411,0.005926488],"category_scores_gemma":[0.00561916,0.00043710874,0.0005787136,0.00062283716,0.0022139298,0.0020146442,0.0010965926,0.0012867894,0.0007943041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011609319,0.0003014183,0.02005888,0.00032702365,0.00012356704,0.00071752525,0.00075530884,0.02156975,0.029322285,0.8160675,0.012183976,0.09741174],"study_design_scores_gemma":[0.00017253705,0.0002873944,0.012637717,0.00007907214,0.0001291325,0.0014624365,0.00061812386,0.051070526,0.023914412,0.8823046,0.027256284,0.00006784918],"about_ca_topic_score_codex":0.0008248358,"about_ca_topic_score_gemma":0.0011717003,"teacher_disagreement_score":0.005926488,"about_ca_system_score_codex":0.0007253612,"about_ca_system_score_gemma":0.0005242357,"threshold_uncertainty_score":0.019826055},"labels":[],"label_agreement":null},{"id":"W4410382679","doi":"10.1002/jcd.21988","title":"How to Burn a Latin Square","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Mathematics; Square (algebra); Combinatorics; Statistics; Geometry; Food science","score_opus":0.014002726562170368,"score_gpt":0.22534505286964837,"score_spread":0.211342326307478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410382679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5807196,0.00040626523,0.39082846,0.0005671727,0.00012875079,0.000110133944,0.00007998734,0.00041434626,0.026745299],"genre_scores_gemma":[0.8913427,0.0001878422,0.09689588,0.00019034157,0.00003001196,0.000083177234,0.00009001411,0.0001524437,0.011027599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994266,0.00015734014,0.00003181905,0.00013093036,0.0001357563,0.00011761877],"domain_scores_gemma":[0.9980843,0.0007924217,0.00026381869,0.0004977535,0.0002131804,0.0001485185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070014846,0.00023465118,0.00033516507,0.00050615927,0.00095431873,0.0010722822,0.0007390111,0.0006928232,0.006545668],"category_scores_gemma":[0.003615369,0.00032556462,0.0003249432,0.0004640911,0.001606987,0.0030302845,0.0010226147,0.000738016,0.0008288682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057572674,0.00014802872,0.0062065683,0.00029146345,0.00007005197,0.00065660075,0.0011474742,0.11023187,0.08632108,0.68522614,0.0029595692,0.10616552],"study_design_scores_gemma":[0.000051497456,0.0003280425,0.0014208189,0.000100310936,0.00003748314,0.0007276986,0.0010881523,0.35946313,0.07034596,0.54476213,0.021617003,0.000057809273],"about_ca_topic_score_codex":0.00062804046,"about_ca_topic_score_gemma":0.0007840556,"teacher_disagreement_score":0.006545668,"about_ca_system_score_codex":0.0005215289,"about_ca_system_score_gemma":0.0003523694,"threshold_uncertainty_score":0.021897435},"labels":[],"label_agreement":null},{"id":"W4411391499","doi":"10.1002/jcd.21985","title":"Strong External Difference Families and Classification of α‐Valuations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bipartite graph; Affine transformation; Dihedral group; Combinatorics; Alpha (finance); Sequence (biology); Discrete mathematics; Pure mathematics; Group (periodic table); Statistics; Graph","score_opus":0.02747110979178699,"score_gpt":0.2607734652761141,"score_spread":0.23330235548432712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411391499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7378787,0.00014908427,0.22595468,0.00030993109,0.000059667414,0.000060027327,0.00030734006,0.00015416139,0.035126485],"genre_scores_gemma":[0.9789185,0.00006498144,0.016119383,0.00005390234,0.000024430352,0.00003406062,0.00019126138,0.000021814642,0.0045717317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993507,0.000153446,0.000048409755,0.000117305055,0.00015650857,0.00017363435],"domain_scores_gemma":[0.9982008,0.00082438305,0.00019190168,0.00027397124,0.00023070184,0.00027818006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011018887,0.00028493244,0.00033429387,0.0012808125,0.00095974415,0.0015204374,0.0005264527,0.00047880952,0.005801974],"category_scores_gemma":[0.0026135661,0.00021146395,0.0006112063,0.00073993846,0.001803811,0.0026736008,0.0011286384,0.0011697921,0.0003814397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006315471,0.000043848864,0.0023330848,0.000029739935,0.000007629569,0.00010505703,0.00021140293,0.0029947562,0.0033861294,0.9764948,0.00053450343,0.0137958685],"study_design_scores_gemma":[0.000023670169,0.00008343795,0.0017842288,0.00004051229,0.000011210325,0.00043952928,0.00033794562,0.021669446,0.006491784,0.9602461,0.008846048,0.000026056912],"about_ca_topic_score_codex":0.00021861444,"about_ca_topic_score_gemma":0.00020479334,"teacher_disagreement_score":0.005801974,"about_ca_system_score_codex":0.0008934409,"about_ca_system_score_gemma":0.00023083267,"threshold_uncertainty_score":0.019409537},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042371344,0.00024546683,0.94239634,0.0001097538,0.00006432243,0.00008874598,0.00009221937,0.00019978819,0.014432081],"genre_scores_gemma":[0.41978657,0.0004982653,0.569332,0.00012068133,0.000041139872,0.00026545362,0.0002494177,0.000081788865,0.009624754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993113,0.00025067013,0.00004975289,0.00010320203,0.00020724599,0.00007776826],"domain_scores_gemma":[0.9992125,0.00023776019,0.00013217305,0.00019475409,0.00015956437,0.00006310216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000592669,0.00042714624,0.00033442202,0.00060792116,0.0005395663,0.0006672735,0.00047368673,0.00038645978,0.0032297738],"category_scores_gemma":[0.0015548903,0.00031254577,0.00040989928,0.00067880255,0.0008531737,0.0010335944,0.0011750909,0.0007700976,0.00068007136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016786162,0.00003810928,0.0006387848,0.00022120112,0.00003424986,0.00021409124,0.00028290082,0.020118453,0.051273767,0.8044027,0.0014421429,0.121165775],"study_design_scores_gemma":[0.00017588954,0.0007550666,0.0010615921,0.00015222201,0.000083211366,0.0011570572,0.00026328236,0.1836791,0.12441389,0.5983377,0.08980858,0.00011234011],"about_ca_topic_score_codex":0.0002807153,"about_ca_topic_score_gemma":0.00047884535,"teacher_disagreement_score":0.0032297738,"about_ca_system_score_codex":0.00030744454,"about_ca_system_score_gemma":0.00053001975,"threshold_uncertainty_score":0.010804653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004184636,0.0020364854,0.06582381,0.0013775607,0.0013250259,0.000069002686,0.0018023994,0.0010500296,0.9223311],"genre_scores_gemma":[0.09293283,0.003247449,0.07003812,0.0013715725,0.0011483132,0.00018332613,0.0057667047,0.0013778391,0.8239339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995383,0.000050708404,0.000016166425,0.00012020279,0.00018501034,0.00008950313],"domain_scores_gemma":[0.9997341,0.00005576001,0.000015937529,0.00007695381,0.000087175555,0.00003010633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003141512,0.0010401797,0.000690812,0.0010904595,0.0011642749,0.0028916632,0.00076767633,0.0005240538,0.16629861],"category_scores_gemma":[0.0013155595,0.00039854407,0.00064932805,0.001416425,0.0008126248,0.003225506,0.0013782898,0.001998479,0.07872121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073754105,0.000058067362,0.000096818585,0.00015733848,0.000009125573,0.000058862042,0.00015500793,0.0010403336,0.0019847082,0.64367473,0.20094511,0.15174606],"study_design_scores_gemma":[0.000017062774,0.000025978252,0.00013358367,0.00007812559,0.000009946565,0.00016804386,0.00009905316,0.002256579,0.0015101198,0.4480666,0.5476187,0.000016327982],"about_ca_topic_score_codex":0.0010601792,"about_ca_topic_score_gemma":0.0015438742,"teacher_disagreement_score":0.16629861,"about_ca_system_score_codex":0.0008622417,"about_ca_system_score_gemma":0.00067267654,"threshold_uncertainty_score":0.55632424},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08025068,0.003920451,0.7493514,0.002749118,0.0016644399,0.00017818429,0.0004978686,0.0006243495,0.16076364],"genre_scores_gemma":[0.6060493,0.003377788,0.34874356,0.0011493529,0.000660331,0.00044249382,0.0007492395,0.0004614382,0.038366556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882776,0.00038957343,0.00008947849,0.00013999427,0.00038333877,0.00017000923],"domain_scores_gemma":[0.99880385,0.00041198963,0.00008807353,0.00036706388,0.00021858737,0.00011031725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012492256,0.0005963083,0.0010205461,0.0033398261,0.0020004753,0.0038539846,0.001471301,0.0015477489,0.010069218],"category_scores_gemma":[0.0027336539,0.000648397,0.0014607698,0.00196727,0.0026652985,0.0042735576,0.0025874686,0.0035275044,0.0024091732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009150392,0.0000055634428,0.000013973055,0.000019119221,0.0000029139974,0.000015181876,0.00004786362,0.00057331775,0.00040507308,0.9945839,0.0006110766,0.0037128073],"study_design_scores_gemma":[0.0000105945155,0.000015631242,0.0000365267,0.000019565043,0.000003773277,0.00009133091,0.000044124834,0.005030178,0.0011825718,0.9874993,0.0060459212,0.00002042076],"about_ca_topic_score_codex":0.00040804135,"about_ca_topic_score_gemma":0.00039304298,"teacher_disagreement_score":0.010069218,"about_ca_system_score_codex":0.0010117568,"about_ca_system_score_gemma":0.0006971472,"threshold_uncertainty_score":0.03368491},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7019669,0.0003699378,0.26867038,0.00025489938,0.0000403294,0.00008173666,0.000350118,0.00016560475,0.02810008],"genre_scores_gemma":[0.9150667,0.0003625418,0.07788424,0.00012693905,0.00007097137,0.0001368596,0.0003257522,0.000059915168,0.0059660757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985819,0.0005136169,0.0000766469,0.00028081553,0.00028476288,0.0002623426],"domain_scores_gemma":[0.9967308,0.0018264623,0.0005631386,0.0004902993,0.00019462552,0.00019472853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552806,0.00070375745,0.0004307359,0.0008592542,0.00078484847,0.0010346535,0.00057307235,0.000829477,0.0032827116],"category_scores_gemma":[0.0028030507,0.00049095496,0.0005002786,0.00069781725,0.0016492798,0.0014690029,0.00094022736,0.0009147906,0.00052127696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010366765,0.00015479379,0.0018713638,0.0002455502,0.000056078206,0.00044915624,0.00053945085,0.08939992,0.035604972,0.8200404,0.001680004,0.04892161],"study_design_scores_gemma":[0.00013490446,0.00034157644,0.0011052858,0.00013154936,0.000031099862,0.00042848266,0.00022429711,0.1390939,0.014845054,0.83923537,0.004359741,0.00006879844],"about_ca_topic_score_codex":0.00056188507,"about_ca_topic_score_gemma":0.0009532152,"teacher_disagreement_score":0.0032827116,"about_ca_system_score_codex":0.00078580255,"about_ca_system_score_gemma":0.0005832298,"threshold_uncertainty_score":0.010981798},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3398475,0.0013785909,0.5770204,0.00043492045,0.00026040396,0.00015942042,0.00071933895,0.00045137617,0.079728074],"genre_scores_gemma":[0.8609246,0.0010116915,0.11684161,0.00023600456,0.00019618585,0.00016176082,0.00082652015,0.00040394205,0.01939776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987878,0.00028673426,0.000058688936,0.00021811304,0.00051680923,0.00013176003],"domain_scores_gemma":[0.9989698,0.0001899265,0.0002482297,0.000089715104,0.00035245344,0.00014996009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379207,0.0007081432,0.00042008614,0.0026821818,0.0010698151,0.0019334458,0.0007988974,0.00062584813,0.005526602],"category_scores_gemma":[0.002464179,0.0003582037,0.00041040016,0.0020978905,0.0022495526,0.0030642555,0.0021091187,0.0016155243,0.0015064441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007801562,0.000017799113,0.0005065563,0.00003303301,0.000008060675,0.00011591205,0.0003102639,0.0060618916,0.0037500465,0.97261626,0.0009774169,0.015524577],"study_design_scores_gemma":[0.000031496842,0.00011202599,0.0010585946,0.00006398572,0.00001050939,0.00056348724,0.000631477,0.063307725,0.0040011336,0.8969178,0.033242125,0.000059607646],"about_ca_topic_score_codex":0.001593353,"about_ca_topic_score_gemma":0.0010345012,"teacher_disagreement_score":0.005526602,"about_ca_system_score_codex":0.00083821977,"about_ca_system_score_gemma":0.00029791385,"threshold_uncertainty_score":0.018488348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40361232,0.0002899282,0.581065,0.0002513922,0.000050191822,0.00012715405,0.0002864488,0.00052494236,0.0137926005],"genre_scores_gemma":[0.84147865,0.00015177845,0.15272419,0.00012619204,0.000030293484,0.00015539749,0.0003045537,0.00006118215,0.0049677757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886477,0.00036913677,0.000078235076,0.0002506554,0.00022899087,0.0002082571],"domain_scores_gemma":[0.9964958,0.0016694297,0.00048147,0.0008321972,0.0003648399,0.00015635061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008825597,0.0005680808,0.00049807277,0.00045415873,0.00053660054,0.00077800703,0.00069681247,0.0010102566,0.0034837686],"category_scores_gemma":[0.0036868474,0.0005320911,0.000636891,0.00030455698,0.00072573015,0.0011129837,0.000864733,0.0009236003,0.00067456457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001442408,0.00029839325,0.005455047,0.0006580981,0.00016870929,0.00072854094,0.00062813616,0.18746631,0.18077,0.44301057,0.0027485017,0.1766253],"study_design_scores_gemma":[0.00030603044,0.0019397055,0.0027507672,0.00020174515,0.00013016495,0.0017788528,0.00034778478,0.38211346,0.12797394,0.46461526,0.017716918,0.00012547325],"about_ca_topic_score_codex":0.0002794245,"about_ca_topic_score_gemma":0.0005648892,"teacher_disagreement_score":0.0034837686,"about_ca_system_score_codex":0.0004519437,"about_ca_system_score_gemma":0.00057293795,"threshold_uncertainty_score":0.011654377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8047266,0.0007147965,0.16442275,0.00043399588,0.00005514451,0.00006634326,0.00043523018,0.00018890479,0.028956195],"genre_scores_gemma":[0.9694443,0.00032846123,0.026340201,0.00012544043,0.00005718122,0.00012650518,0.00019834361,0.00003897985,0.003340559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900705,0.0003006942,0.000063333086,0.00019581105,0.00025144342,0.00018165934],"domain_scores_gemma":[0.9981547,0.0008556738,0.00033630963,0.0001976427,0.00023451254,0.00022118473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053138,0.00049199146,0.00041571562,0.0011424746,0.0008055553,0.0015087223,0.00047145694,0.0008293896,0.00375505],"category_scores_gemma":[0.003311461,0.00033361735,0.0003298381,0.00069704297,0.0010993959,0.0013903759,0.00085267925,0.0005425569,0.00039947577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050503394,0.000073848125,0.0020832336,0.00014318222,0.000036512458,0.0003202577,0.00032357825,0.018835435,0.023248555,0.91148895,0.0023270543,0.0406143],"study_design_scores_gemma":[0.00014627939,0.0002975821,0.0019785562,0.00010022953,0.000036864087,0.00071246264,0.0002639722,0.08457721,0.008040933,0.8957142,0.008096718,0.00003493265],"about_ca_topic_score_codex":0.00037230426,"about_ca_topic_score_gemma":0.0003327232,"teacher_disagreement_score":0.00375505,"about_ca_system_score_codex":0.000825407,"about_ca_system_score_gemma":0.00053459324,"threshold_uncertainty_score":0.012561917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7554786,0.00035032988,0.21862765,0.00030363855,0.00014065002,0.00009729887,0.00017632367,0.0002917757,0.024533657],"genre_scores_gemma":[0.9470144,0.00018971405,0.041893415,0.00016404063,0.000062109495,0.00005803442,0.0002846449,0.00008939375,0.010244369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976474,0.00004648228,0.000010570111,0.000051503583,0.000037300444,0.00008939305],"domain_scores_gemma":[0.999561,0.00011960302,0.000062235726,0.00010423517,0.000062320534,0.00009064879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030301503,0.00023655653,0.0002681352,0.0006376244,0.0010644387,0.0008117549,0.00038066562,0.00024176699,0.005288609],"category_scores_gemma":[0.0007765409,0.00019470227,0.00029090207,0.00053634285,0.0010871093,0.0013957681,0.0013364523,0.00068086275,0.00066795683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002107634,0.000060009912,0.0030274498,0.0001368849,0.000014665978,0.00027632213,0.0011055606,0.005008778,0.02223289,0.91262627,0.0025373315,0.05276294],"study_design_scores_gemma":[0.00008502946,0.00036045915,0.0038803432,0.000051322455,0.000037516562,0.00049361476,0.0009559445,0.030708954,0.020224808,0.9035067,0.039640386,0.00005484927],"about_ca_topic_score_codex":0.0006309334,"about_ca_topic_score_gemma":0.0010462501,"teacher_disagreement_score":0.005288609,"about_ca_system_score_codex":0.0004420657,"about_ca_system_score_gemma":0.0003521209,"threshold_uncertainty_score":0.017692149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8588292,0.0005351091,0.101747714,0.00045378337,0.00009693146,0.000043378303,0.00033116492,0.00013435261,0.037828315],"genre_scores_gemma":[0.98337656,0.00008926384,0.010201195,0.000041751588,0.000042237854,0.000040248295,0.00018115163,0.000012803617,0.0060147746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987495,0.0003544056,0.00008950409,0.0002827665,0.00031181774,0.00021199553],"domain_scores_gemma":[0.997945,0.0008424461,0.0003371335,0.00022899307,0.0002731282,0.000373286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057903,0.00036542345,0.00038247323,0.002145007,0.0014118099,0.0041155075,0.00072426646,0.0009745641,0.0039580194],"category_scores_gemma":[0.0028962812,0.00038470043,0.00041955008,0.0014358766,0.0026704662,0.0046695084,0.0020321868,0.001101969,0.0004214594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011818392,0.00002945564,0.0015908837,0.00004106331,0.00000926126,0.00026168412,0.0009954908,0.0015155642,0.0030171839,0.98331016,0.0004234509,0.008687638],"study_design_scores_gemma":[0.00004766196,0.00014408736,0.003022076,0.00007779092,0.000025861022,0.0013050303,0.0020272587,0.023849122,0.008912979,0.94828564,0.012229678,0.00007275917],"about_ca_topic_score_codex":0.0003792611,"about_ca_topic_score_gemma":0.0002709006,"teacher_disagreement_score":0.0041155075,"about_ca_system_score_codex":0.0015532315,"about_ca_system_score_gemma":0.00027228595,"threshold_uncertainty_score":0.013240874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6666496,0.0033126173,0.22961599,0.0010713255,0.00008388669,0.00006920947,0.0009066696,0.00044387084,0.09784678],"genre_scores_gemma":[0.96269596,0.0009877154,0.030998614,0.00005429234,0.000044756915,0.00005475428,0.00030409519,0.0000695884,0.0047902814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898714,0.00019416149,0.000060223727,0.00022023128,0.0002950074,0.00024322298],"domain_scores_gemma":[0.99521834,0.002921741,0.00046304832,0.000579382,0.0004644286,0.00035301349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000862778,0.0006504733,0.0006314625,0.0016833905,0.0010337313,0.0022284333,0.0008603701,0.0005751177,0.0047013457],"category_scores_gemma":[0.0053175795,0.00046448904,0.0004945118,0.0011502836,0.0016652364,0.0035588294,0.0015553278,0.0009815384,0.00052155973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011107388,0.000092379414,0.0064676898,0.0005484768,0.000118384145,0.00038412985,0.00063487416,0.09374103,0.06129454,0.7567892,0.0044287858,0.074389696],"study_design_scores_gemma":[0.00008009801,0.00026777163,0.0041098,0.00015106966,0.000098367236,0.0010793743,0.00043948667,0.12088738,0.047688793,0.810514,0.014591497,0.000092479226],"about_ca_topic_score_codex":0.0006801559,"about_ca_topic_score_gemma":0.0011811474,"teacher_disagreement_score":0.0047013457,"about_ca_system_score_codex":0.0015604567,"about_ca_system_score_gemma":0.00044770024,"threshold_uncertainty_score":0.01572758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7402986,0.0003891577,0.21643396,0.0002408885,0.00007703181,0.00009436505,0.0003887441,0.00032253138,0.04175476],"genre_scores_gemma":[0.9506262,0.00009994335,0.043650944,0.00009316117,0.000020454687,0.0000592034,0.00023052642,0.00004708822,0.005172488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.00021020773,0.00003610812,0.0001585178,0.00014811472,0.0002234355],"domain_scores_gemma":[0.99844754,0.0005705654,0.00028727995,0.00037042552,0.00018444116,0.00013967593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000662062,0.00049846794,0.00039775987,0.0006771707,0.00085537485,0.0011428408,0.0005794844,0.00072078203,0.0057205698],"category_scores_gemma":[0.0022661197,0.00034119256,0.00039656763,0.00048161825,0.000900986,0.0010204391,0.00076016993,0.00087800605,0.00090967934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074586,0.00009094115,0.002535978,0.00018272961,0.00006452317,0.0004846745,0.0005349684,0.022806382,0.049275443,0.8865425,0.0022302947,0.03450576],"study_design_scores_gemma":[0.00021994935,0.00042937606,0.0021221142,0.00011703344,0.00007411735,0.0011238045,0.0005165193,0.15891519,0.060137205,0.76066864,0.015563914,0.000112166344],"about_ca_topic_score_codex":0.00050937274,"about_ca_topic_score_gemma":0.00092583644,"teacher_disagreement_score":0.0057205698,"about_ca_system_score_codex":0.0006538673,"about_ca_system_score_gemma":0.0005545867,"threshold_uncertainty_score":0.019137144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2662741,0.0016628042,0.5016147,0.0005234444,0.00064689294,0.00015771462,0.00046559618,0.0005068218,0.22814806],"genre_scores_gemma":[0.9181045,0.0010012003,0.049591254,0.00030459784,0.00019364261,0.00009657568,0.00028638126,0.00022390175,0.030197924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997445,0.00004372285,0.000011215258,0.000049076527,0.00009429843,0.00005726268],"domain_scores_gemma":[0.99962044,0.000088796805,0.00005155757,0.00005297518,0.00012318321,0.00006297394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025040415,0.0006405361,0.000280012,0.0014207087,0.0006888581,0.0014166469,0.0004019488,0.0005080737,0.0115203],"category_scores_gemma":[0.0013967821,0.0002599789,0.00039230514,0.0006048662,0.0012114824,0.0010082604,0.00048130486,0.0007121205,0.00207518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043327935,0.000021935133,0.00022617502,0.000050153354,0.000005008985,0.00013669522,0.0001384842,0.004454179,0.010526941,0.97163016,0.001863945,0.010902972],"study_design_scores_gemma":[0.000014718486,0.00007495651,0.00059596717,0.000046458143,0.000008852311,0.0007267602,0.00019281686,0.07035185,0.009081531,0.8988506,0.019987661,0.00006778186],"about_ca_topic_score_codex":0.001037389,"about_ca_topic_score_gemma":0.0012138416,"teacher_disagreement_score":0.0115203,"about_ca_system_score_codex":0.00052631524,"about_ca_system_score_gemma":0.0004215309,"threshold_uncertainty_score":0.03853923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26122764,0.0074660564,0.39800605,0.007694178,0.0010615371,0.0002011931,0.0009617078,0.0006694915,0.32271215],"genre_scores_gemma":[0.8884444,0.006179618,0.0745614,0.0023992413,0.0012172968,0.00029654318,0.0015271426,0.0003382943,0.025035955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750525,0.0005555797,0.00018636274,0.0006410711,0.0006844819,0.00042736303],"domain_scores_gemma":[0.9866051,0.008755861,0.001067704,0.002160364,0.0008515008,0.0005594297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021802036,0.0011704926,0.0012994789,0.002291617,0.0029267499,0.003007441,0.0014188119,0.0016197083,0.010097996],"category_scores_gemma":[0.010304726,0.0007607768,0.0014504533,0.0033046063,0.0039825914,0.009277116,0.0035221914,0.004068047,0.0024351336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031445327,0.00012797015,0.0023027943,0.00037917504,0.00003744608,0.000368697,0.0004089024,0.005988125,0.004698693,0.94236284,0.0051956265,0.037815254],"study_design_scores_gemma":[0.000055187404,0.00014566023,0.00070931634,0.000068273876,0.000043644046,0.00069304596,0.00014719546,0.008754521,0.0052443785,0.96114826,0.022953553,0.000036899055],"about_ca_topic_score_codex":0.0006867023,"about_ca_topic_score_gemma":0.0004802322,"teacher_disagreement_score":0.010097996,"about_ca_system_score_codex":0.0016690205,"about_ca_system_score_gemma":0.0010711683,"threshold_uncertainty_score":0.03378123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11788077,0.006626808,0.4748286,0.006907077,0.0014618614,0.0001851729,0.00080141,0.000494747,0.39081353],"genre_scores_gemma":[0.74600434,0.0047177253,0.15063544,0.0018938165,0.0012599535,0.00032297763,0.00080815866,0.000300961,0.09405664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982851,0.00062002096,0.00011682915,0.00038761826,0.00034667682,0.00024372773],"domain_scores_gemma":[0.9987596,0.00057900505,0.00013198848,0.0002361106,0.00015719539,0.00013603337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009469353,0.0007282103,0.00066614844,0.0013074508,0.0023375056,0.0037590496,0.00085845304,0.0012646599,0.01487697],"category_scores_gemma":[0.0042447983,0.0004741835,0.0007030432,0.001863291,0.005489376,0.007369665,0.0026213387,0.0024592292,0.001987553],"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.000015164106,0.0000072174203,0.000081019934,0.000022673412,0.0000028946888,0.000021221435,0.00008322,0.0009152481,0.0001526414,0.98992807,0.0017693674,0.0070012813],"study_design_scores_gemma":[0.0000054789116,0.000010073783,0.000060932674,0.00001412132,0.000003826178,0.00004998924,0.000054108605,0.0022231196,0.00015240835,0.9846176,0.012802054,0.00000628542],"about_ca_topic_score_codex":0.0018380318,"about_ca_topic_score_gemma":0.0020253274,"teacher_disagreement_score":0.01487697,"about_ca_system_score_codex":0.0015409308,"about_ca_system_score_gemma":0.00096889905,"threshold_uncertainty_score":0.04976839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15195902,0.00065894163,0.802183,0.0052542174,0.00039991422,0.00038271752,0.0007573892,0.00066627236,0.03773855],"genre_scores_gemma":[0.817748,0.0007839591,0.16928032,0.0014686735,0.00058442255,0.0004176287,0.0010174267,0.00021964565,0.00847995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699247,0.0007188051,0.00016075232,0.0007583021,0.0008318413,0.00053776545],"domain_scores_gemma":[0.9779554,0.017348902,0.001242969,0.0017305467,0.0007468942,0.00097517663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018621092,0.00093167677,0.001312655,0.00093208614,0.002374609,0.0039413217,0.0030791028,0.0018379575,0.015631003],"category_scores_gemma":[0.012956707,0.00084175915,0.0026487203,0.0015794903,0.004214105,0.009803399,0.004720486,0.0075000674,0.0007490384],"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.00023152296,0.00026975776,0.0017406185,0.00046359666,0.00013806303,0.0005171311,0.0007441218,0.048986576,0.0066191615,0.9080156,0.007915469,0.024358466],"study_design_scores_gemma":[0.00014161802,0.0001354916,0.0007729254,0.000037425398,0.00008442602,0.00038145226,0.00016716545,0.08587166,0.0033733668,0.90116256,0.007812153,0.0000597844],"about_ca_topic_score_codex":0.002826271,"about_ca_topic_score_gemma":0.0024138475,"teacher_disagreement_score":0.015631003,"about_ca_system_score_codex":0.0029883662,"about_ca_system_score_gemma":0.0018733641,"threshold_uncertainty_score":0.052290857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04574583,0.00024598156,0.9478427,0.00013100287,0.00006204258,0.00021365176,0.00033947898,0.0014409205,0.0039784326],"genre_scores_gemma":[0.12000302,0.00032669937,0.8733167,0.0000557691,0.00006638876,0.00027395305,0.002840158,0.00033999438,0.00277727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844545,0.00025786523,0.00015425411,0.0005210139,0.00041398517,0.00020745581],"domain_scores_gemma":[0.9948725,0.0026233762,0.00032128778,0.0013831232,0.0006382497,0.00016138687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010935669,0.0008672382,0.0010771157,0.0026255683,0.0012909909,0.0027037275,0.0017295528,0.0010339377,0.0081426315],"category_scores_gemma":[0.0059564733,0.0005214638,0.001404827,0.0023155194,0.0013084207,0.0046070786,0.001770207,0.0017964859,0.0019533834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058420177,0.00036280332,0.0043292884,0.0008101701,0.00010832142,0.00015139961,0.00074308243,0.04725262,0.015184691,0.17661922,0.010263691,0.7435905],"study_design_scores_gemma":[0.00017141207,0.00038627224,0.0031351522,0.00014219989,0.00011140628,0.00070443243,0.0010280767,0.49778482,0.023243131,0.442478,0.030688468,0.0001266594],"about_ca_topic_score_codex":0.0013495261,"about_ca_topic_score_gemma":0.001575158,"teacher_disagreement_score":0.0081426315,"about_ca_system_score_codex":0.0009840871,"about_ca_system_score_gemma":0.0010760567,"threshold_uncertainty_score":0.0272398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8381692,0.00039667834,0.07477557,0.0004695962,0.00013325052,0.000089081834,0.00051483087,0.00037792212,0.08507378],"genre_scores_gemma":[0.974585,0.00016945577,0.012652259,0.00019100941,0.000051772597,0.00006895357,0.00029254795,0.000029000998,0.011959833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985695,0.00003112712,0.0000074139284,0.000028824008,0.00003077029,0.00004492285],"domain_scores_gemma":[0.99954337,0.00016712783,0.00008398387,0.00004462396,0.00006731331,0.000093576564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013030328,0.0002742692,0.00020193045,0.0007397425,0.00065273157,0.0009403895,0.00030190882,0.00040848448,0.0069013936],"category_scores_gemma":[0.00052230596,0.0001966051,0.0002716807,0.00047802515,0.00054038595,0.0009371414,0.00072037964,0.00045889278,0.00062185875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008515622,0.00006996321,0.0013310311,0.00008527536,0.000019924477,0.00063657557,0.000718372,0.005012585,0.010081642,0.95799625,0.0025615345,0.021401703],"study_design_scores_gemma":[0.00006012643,0.00008429294,0.0014326295,0.0000183988,0.000011961576,0.000445488,0.00030971764,0.01863454,0.0044718427,0.9626595,0.011843911,0.00002753949],"about_ca_topic_score_codex":0.0008243824,"about_ca_topic_score_gemma":0.0014165823,"teacher_disagreement_score":0.0069013936,"about_ca_system_score_codex":0.00044243122,"about_ca_system_score_gemma":0.00035163213,"threshold_uncertainty_score":0.023087442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9082815,0.00028486585,0.049726278,0.00025117848,0.00009863871,0.000039204424,0.00010768881,0.00014220754,0.04106845],"genre_scores_gemma":[0.96756816,0.00019388185,0.025632303,0.00008847408,0.000023261417,0.000020804739,0.00015045112,0.000030334584,0.0062922793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988055,0.00003491621,0.0000031800835,0.000022468435,0.000028702563,0.000030091363],"domain_scores_gemma":[0.99987555,0.000035055873,0.000023209373,0.000022111886,0.000012383445,0.000031636322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008945377,0.000250736,0.0002102324,0.00044738347,0.0008771293,0.00047239446,0.00028503436,0.0002447342,0.002841915],"category_scores_gemma":[0.00026527126,0.00014193049,0.00021995549,0.0003105513,0.0012426452,0.00082746946,0.00079123024,0.00050868065,0.0003842038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028609968,0.00007568434,0.0015269413,0.00013128713,0.000016887005,0.0007165659,0.0005219722,0.01845796,0.013505767,0.9362594,0.0016435866,0.026857907],"study_design_scores_gemma":[0.00009185128,0.0002925153,0.003734259,0.00008503909,0.000037288086,0.00086984574,0.0019286532,0.08180587,0.02192265,0.8617546,0.027402405,0.00007515302],"about_ca_topic_score_codex":0.0012903503,"about_ca_topic_score_gemma":0.0021619063,"teacher_disagreement_score":0.002841915,"about_ca_system_score_codex":0.0003266867,"about_ca_system_score_gemma":0.0002671614,"threshold_uncertainty_score":0.009507179},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096360765,0.0011103562,0.8241543,0.00053252693,0.0005887979,0.0002550576,0.0004526433,0.00093730143,0.0756083],"genre_scores_gemma":[0.65067405,0.0013008566,0.30805013,0.0006527585,0.00017473988,0.00059246033,0.0008700318,0.0004128918,0.03727205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990808,0.00032116927,0.000049247217,0.00016934393,0.00022087453,0.00015857813],"domain_scores_gemma":[0.9991365,0.00025935675,0.0001148413,0.00034965997,0.000077965975,0.0000616984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576797,0.00069468573,0.00036964178,0.0009006921,0.0010498216,0.00083785405,0.0017117155,0.0009003039,0.011436768],"category_scores_gemma":[0.001401862,0.00044351982,0.000723081,0.0006996475,0.0020410896,0.0018600206,0.0029510888,0.0016608578,0.0032519873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014300291,0.00005499006,0.0005615554,0.00022443576,0.00001871273,0.00052767387,0.0005144441,0.004034846,0.035626374,0.89726686,0.0042736004,0.056753557],"study_design_scores_gemma":[0.00010259977,0.0003034607,0.0009805644,0.00011819414,0.00005190239,0.0037828255,0.00048319073,0.021433447,0.11435875,0.7229234,0.13535126,0.000110335386],"about_ca_topic_score_codex":0.00012171738,"about_ca_topic_score_gemma":0.00017406236,"teacher_disagreement_score":0.011436768,"about_ca_system_score_codex":0.0004817585,"about_ca_system_score_gemma":0.00031786438,"threshold_uncertainty_score":0.038259804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6309794,0.00039236073,0.29934075,0.0019514837,0.0001513274,0.00021415867,0.0016195024,0.00063795206,0.06471304],"genre_scores_gemma":[0.8576274,0.00021175364,0.13248552,0.00020984282,0.000062231295,0.0001679404,0.0007007213,0.00015165191,0.008382794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987902,0.00022219837,0.00006812806,0.00026788874,0.00034596998,0.0003055904],"domain_scores_gemma":[0.9950362,0.0030998604,0.0006213877,0.00054314564,0.0003562647,0.00034308515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012205667,0.00063379016,0.00060065486,0.0010668495,0.001645759,0.0023009672,0.0017884593,0.0008380585,0.015602684],"category_scores_gemma":[0.006864191,0.00057642604,0.001482419,0.0009439268,0.0020074064,0.004290155,0.0014346119,0.0017685117,0.001098098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010421372,0.00035150655,0.009241044,0.00044138188,0.00017360259,0.00029845774,0.0004826414,0.09659872,0.018735617,0.77891237,0.010466571,0.08325597],"study_design_scores_gemma":[0.00012051347,0.00036347416,0.0037608545,0.000119446835,0.00009827697,0.00058239256,0.0003320435,0.22279347,0.03375424,0.7156645,0.0223272,0.00008359443],"about_ca_topic_score_codex":0.0013388098,"about_ca_topic_score_gemma":0.0020303417,"teacher_disagreement_score":0.015602684,"about_ca_system_score_codex":0.0020046236,"about_ca_system_score_gemma":0.0014147668,"threshold_uncertainty_score":0.052196145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06102556,0.00027306785,0.8959125,0.00060138415,0.00026194873,0.00039602554,0.0014002136,0.0065619526,0.03356733],"genre_scores_gemma":[0.2797681,0.00026353987,0.6811848,0.00061737094,0.00018027553,0.0006403271,0.004845299,0.0026687982,0.02983143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989593,0.00024102286,0.00006866059,0.00027058617,0.00028174478,0.00017860434],"domain_scores_gemma":[0.99817383,0.0009567409,0.00011559146,0.000434356,0.00021738854,0.000102095815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010905656,0.0013454856,0.0009925308,0.0009876522,0.0009820529,0.0016551055,0.0016630223,0.0008937517,0.027956873],"category_scores_gemma":[0.0033554125,0.0008744081,0.0022790714,0.0012086487,0.001337629,0.0029422783,0.0034679591,0.0028022353,0.008848087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006393868,0.00041505726,0.0013391231,0.0010424786,0.00014162577,0.00064031617,0.00080053724,0.072073646,0.02242495,0.56418085,0.042347148,0.29395482],"study_design_scores_gemma":[0.00029985508,0.00045999722,0.0002560876,0.00016209244,0.00013867478,0.00024992556,0.0003137308,0.2299568,0.034222927,0.68287396,0.050985932,0.00008005248],"about_ca_topic_score_codex":0.00070552726,"about_ca_topic_score_gemma":0.0019745445,"teacher_disagreement_score":0.027956873,"about_ca_system_score_codex":0.00081810897,"about_ca_system_score_gemma":0.0013674684,"threshold_uncertainty_score":0.09352505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18820807,0.0003240105,0.7549643,0.0010273491,0.00018324217,0.00027355237,0.00095570524,0.0016459029,0.05241793],"genre_scores_gemma":[0.7411445,0.00033364075,0.22331363,0.0007145303,0.00023095659,0.00049747044,0.0012865722,0.00062213733,0.03185656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969091,0.0013641146,0.0002601268,0.00042857893,0.00045582635,0.0005822262],"domain_scores_gemma":[0.99401134,0.003335174,0.00031023755,0.0013352743,0.00064485706,0.00036308327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018307293,0.0011121681,0.0014362069,0.0011328381,0.0015820798,0.0038399838,0.0019823604,0.0019345825,0.014848017],"category_scores_gemma":[0.008577298,0.00078773504,0.00135493,0.0019610978,0.0013452191,0.0048916037,0.0034166411,0.0018543792,0.004299253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008060339,0.00028442277,0.0010315644,0.00033738275,0.00007703323,0.0005634585,0.0006212435,0.022933748,0.013797863,0.8275416,0.009656863,0.12234875],"study_design_scores_gemma":[0.000061648636,0.000104256695,0.00021756996,0.00006211746,0.000045655535,0.0003632138,0.00016084318,0.07780883,0.0055212756,0.9101753,0.0054365164,0.00004266068],"about_ca_topic_score_codex":0.00042023635,"about_ca_topic_score_gemma":0.00065508636,"teacher_disagreement_score":0.014848017,"about_ca_system_score_codex":0.00078380096,"about_ca_system_score_gemma":0.0012346602,"threshold_uncertainty_score":0.04967159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6696938,0.00047492492,0.2422436,0.00014643632,0.00018797918,0.00015613894,0.0005311714,0.0008158516,0.08575014],"genre_scores_gemma":[0.93107784,0.00023355201,0.041554622,0.00008801817,0.00006453767,0.00009515245,0.00048455372,0.00020039291,0.026201388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954224,0.00009017089,0.000039667604,0.000107390755,0.00011726724,0.0001032894],"domain_scores_gemma":[0.9993893,0.00014613009,0.0001791103,0.00012754253,0.00009637529,0.000061542625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034295162,0.0004912396,0.00025877307,0.00043206394,0.0005107764,0.0008560887,0.00023814812,0.0002699657,0.008384599],"category_scores_gemma":[0.00078550045,0.00023884507,0.00047064133,0.00033820907,0.0008325906,0.00089570525,0.0006022741,0.0004444115,0.0015545164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006858759,0.000104472914,0.0036750226,0.00044371464,0.000052943597,0.00075421244,0.000784065,0.012649107,0.04934686,0.7862002,0.0047402605,0.14056322],"study_design_scores_gemma":[0.00022474681,0.002073291,0.0048969816,0.00022229497,0.00013659509,0.0022898563,0.000793831,0.03650265,0.08446909,0.6781154,0.19012086,0.00015435797],"about_ca_topic_score_codex":0.00046383086,"about_ca_topic_score_gemma":0.00092115137,"teacher_disagreement_score":0.008384599,"about_ca_system_score_codex":0.00048432112,"about_ca_system_score_gemma":0.00039366545,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7419425,0.00073154666,0.21576971,0.00044560593,0.00008996796,0.00016092623,0.0014260204,0.00044961637,0.03898408],"genre_scores_gemma":[0.91584736,0.00048893556,0.07349704,0.00011559398,0.00009916599,0.00009084341,0.001568977,0.00008836904,0.008203754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927515,0.00011318896,0.000049747105,0.00020467277,0.00020091934,0.00015624813],"domain_scores_gemma":[0.9976519,0.00062496704,0.00037895885,0.00045183825,0.00041411497,0.00047827946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190201,0.00040596447,0.00043583993,0.0021698342,0.0009862244,0.0018110342,0.0004515245,0.00050240185,0.0035363634],"category_scores_gemma":[0.0017166621,0.00043570675,0.00066166685,0.0013173486,0.0018120205,0.0020725676,0.0012778675,0.0010564342,0.000574402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018462846,0.000044529414,0.002281197,0.00013769498,0.000029208953,0.0002310646,0.00047017122,0.0061337478,0.014069026,0.95201707,0.0022341248,0.022167632],"study_design_scores_gemma":[0.00002996434,0.000090763715,0.0020654218,0.000048893264,0.000026077501,0.0005113375,0.00028582153,0.029237904,0.005718511,0.950289,0.011673914,0.000022295058],"about_ca_topic_score_codex":0.0005676334,"about_ca_topic_score_gemma":0.0009938986,"teacher_disagreement_score":0.0035363634,"about_ca_system_score_codex":0.00083478715,"about_ca_system_score_gemma":0.0005326147,"threshold_uncertainty_score":0.01183033},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1811254,0.0006896903,0.8008304,0.0003995549,0.000064573396,0.00009272905,0.0001423629,0.00028307652,0.016372256],"genre_scores_gemma":[0.76627207,0.0010701442,0.22677219,0.00017064094,0.00019549942,0.00009276755,0.00028780696,0.000103260376,0.0050357156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988079,0.00033052743,0.00007848491,0.00018974964,0.00043365007,0.00015971636],"domain_scores_gemma":[0.98900944,0.007514459,0.0011336415,0.0011239797,0.0009536518,0.0002648256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012796262,0.0005818351,0.00049074437,0.0015755525,0.0009178349,0.001448378,0.0007048421,0.00068612664,0.003095131],"category_scores_gemma":[0.0105256345,0.00032792395,0.0004770701,0.0013188036,0.0026432173,0.003933959,0.001165072,0.0010259574,0.0006808086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018263873,0.00010614332,0.003177926,0.00020461885,0.000018853632,0.00034787523,0.0004841686,0.034805037,0.012739993,0.86356986,0.0015753823,0.0827875],"study_design_scores_gemma":[0.00002308001,0.00015073398,0.0011521284,0.0000698585,0.000011077533,0.00063760084,0.00021184025,0.2430805,0.011899565,0.7372037,0.005518257,0.000041668096],"about_ca_topic_score_codex":0.0009853138,"about_ca_topic_score_gemma":0.0011204494,"teacher_disagreement_score":0.003095131,"about_ca_system_score_codex":0.0007596901,"about_ca_system_score_gemma":0.00084223895,"threshold_uncertainty_score":0.010354221},"labels":[],"label_agreement":null},{"id":"W4414774764","doi":"10.1002/jcd.22009","title":"New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Software; Electronic circuit; Digital electronics; Set (abstract data type); Difference set","score_opus":0.014142629376500527,"score_gpt":0.2521182587800359,"score_spread":0.2379756294035354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414774764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075559735,0.00057777285,0.89462185,0.00025324113,0.0001794427,0.00015342195,0.00022328216,0.0006158125,0.027815381],"genre_scores_gemma":[0.42999065,0.0003837149,0.5611517,0.00021770682,0.0000696087,0.00019476126,0.00047243133,0.00017092422,0.007348461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994418,0.00011407876,0.000042157975,0.000082446735,0.00026932577,0.000050094874],"domain_scores_gemma":[0.999006,0.00053320796,0.00005370894,0.00019293306,0.00016410426,0.000050111103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044904463,0.00034951823,0.00059930334,0.0012350314,0.0006037646,0.0008073016,0.001240132,0.00051397533,0.0062806546],"category_scores_gemma":[0.0024634427,0.00030610966,0.00060646865,0.001311054,0.00065870996,0.0017595842,0.0014381127,0.0009615124,0.0007348729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047667854,0.00021417114,0.0008473788,0.00036427987,0.00006042046,0.00025349765,0.00026182353,0.07022425,0.058983292,0.5017199,0.008462011,0.35813224],"study_design_scores_gemma":[0.00018246954,0.00046574973,0.00058255764,0.00006298791,0.00004601026,0.00082632323,0.00008172078,0.6988443,0.032790087,0.23680468,0.029241735,0.00007132817],"about_ca_topic_score_codex":0.00057517417,"about_ca_topic_score_gemma":0.0007478922,"teacher_disagreement_score":0.0062806546,"about_ca_system_score_codex":0.0005158861,"about_ca_system_score_gemma":0.0004068476,"threshold_uncertainty_score":0.021010876},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6239945,0.0011326715,0.30053762,0.00069515716,0.00030251013,0.000117177624,0.00027801844,0.00039996454,0.07254237],"genre_scores_gemma":[0.9671542,0.00030621665,0.02480291,0.00018899927,0.00016087283,0.000042773616,0.00013502287,0.000046897945,0.0071621127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996464,0.000059417278,0.000017067485,0.00007986644,0.00013481094,0.000062431405],"domain_scores_gemma":[0.99932766,0.00017700237,0.00011262658,0.00015012643,0.00012557441,0.000107125925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041624566,0.000330154,0.00036045615,0.0008775749,0.0007977696,0.0011630983,0.00041941833,0.0006335129,0.0026498868],"category_scores_gemma":[0.0012573076,0.00019125524,0.00030469056,0.00032662597,0.0011673138,0.0012016498,0.000628897,0.0007187709,0.0003988504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053075204,0.00002318779,0.00064016186,0.000042881667,0.000006410813,0.00029951666,0.00015179576,0.004746204,0.012418315,0.9729561,0.00078603276,0.007876256],"study_design_scores_gemma":[0.000051409672,0.00016799386,0.0009866524,0.000037020276,0.00001402427,0.0020243996,0.00018174674,0.10777937,0.01331358,0.8567002,0.01868504,0.00005863341],"about_ca_topic_score_codex":0.00019273367,"about_ca_topic_score_gemma":0.00019722413,"teacher_disagreement_score":0.0026498868,"about_ca_system_score_codex":0.00032819356,"about_ca_system_score_gemma":0.00033449917,"threshold_uncertainty_score":0.008864701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040854447,0.00013918072,0.95549303,0.000117118354,0.000028834913,0.000056447727,0.000078621284,0.00017395017,0.0030583893],"genre_scores_gemma":[0.48656154,0.0002551394,0.51103765,0.000097138756,0.00002884343,0.0001336007,0.00016147397,0.000052689116,0.0016719163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992392,0.00033413913,0.000043888744,0.00009073904,0.00020581768,0.00008620816],"domain_scores_gemma":[0.99850297,0.00076616113,0.00018400268,0.0001894603,0.00024413828,0.00011322031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084668555,0.00047175077,0.0004869194,0.00041242523,0.0003757272,0.0006865875,0.0006050423,0.00044661583,0.00084354775],"category_scores_gemma":[0.002653284,0.00026038868,0.00033738787,0.00043556685,0.0009880931,0.0006787048,0.0012630468,0.00074612716,0.0003907372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002948838,0.000073518786,0.0013531598,0.00021368432,0.000035307043,0.00030962084,0.00027758666,0.5356805,0.041960113,0.31986177,0.00193707,0.098002836],"study_design_scores_gemma":[0.00005240732,0.00016394845,0.00010335721,0.000020889755,0.0000066558882,0.00013697465,0.000042011907,0.93174267,0.014118139,0.05040178,0.0031823106,0.000028889974],"about_ca_topic_score_codex":0.0007032985,"about_ca_topic_score_gemma":0.0007751528,"teacher_disagreement_score":0.00084668555,"about_ca_system_score_codex":0.000531994,"about_ca_system_score_gemma":0.0011270983,"threshold_uncertainty_score":0.0044777393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018118793,0.00059882976,0.9247166,0.001181914,0.0004771638,0.00010256725,0.0001791121,0.0002083052,0.054416712],"genre_scores_gemma":[0.48315045,0.0015372281,0.47368076,0.0018932517,0.000854678,0.0008204736,0.00035682245,0.00039066773,0.03731564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925214,0.00016513544,0.000061843755,0.00012958761,0.00029316646,0.00009817225],"domain_scores_gemma":[0.999188,0.00036022477,0.00012010224,0.00011837551,0.00014504016,0.000068196154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142437,0.00057080813,0.00037565574,0.001082508,0.0012979172,0.0022372077,0.0010532005,0.0014526402,0.0063379304],"category_scores_gemma":[0.003309672,0.0003776201,0.0008824706,0.0008782905,0.0033842432,0.0035550657,0.0018063955,0.0034004305,0.0021059318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066003668,0.000006704666,0.000015649499,0.000015986916,0.0000010384829,0.0000297605,0.000059813337,0.0011301901,0.001034421,0.9939051,0.0005223654,0.0032722382],"study_design_scores_gemma":[0.000012815608,0.000046483565,0.000048081478,0.000033179458,0.0000052044606,0.00012830168,0.000023412893,0.03704227,0.00192965,0.94718933,0.013515503,0.000025765607],"about_ca_topic_score_codex":0.00057356275,"about_ca_topic_score_gemma":0.00069578557,"teacher_disagreement_score":0.0063379304,"about_ca_system_score_codex":0.0012736043,"about_ca_system_score_gemma":0.000977756,"threshold_uncertainty_score":0.021202505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47404033,0.002803578,0.35967386,0.0011766859,0.0002877402,0.00026207903,0.00070544746,0.00045975778,0.16059054],"genre_scores_gemma":[0.8384586,0.0019732246,0.12406206,0.0003076553,0.00018400326,0.00014712429,0.0007258125,0.00016590746,0.033975612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996444,0.000083480554,0.000019726838,0.00008981928,0.00008626171,0.00007618852],"domain_scores_gemma":[0.9986688,0.00065278186,0.00020603415,0.00020181395,0.00013917428,0.00013133562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042027546,0.00047310218,0.00032779112,0.00070326333,0.00085681333,0.0016697152,0.0005209235,0.0005703592,0.005061451],"category_scores_gemma":[0.0017735123,0.00042905036,0.00051518757,0.0008960403,0.0012484002,0.0035290197,0.0010566039,0.0015539534,0.0007201164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007708541,0.000059052047,0.0015174792,0.00019402459,0.0000143829,0.00038123905,0.000404424,0.017416013,0.0051827007,0.90955555,0.0036852087,0.061512835],"study_design_scores_gemma":[0.000015918393,0.00006332833,0.0012494264,0.00007502057,0.0000138689165,0.0006200956,0.0003306342,0.029678205,0.0031039286,0.92928654,0.0355457,0.000017245864],"about_ca_topic_score_codex":0.00084431324,"about_ca_topic_score_gemma":0.0008182805,"teacher_disagreement_score":0.005061451,"about_ca_system_score_codex":0.001040845,"about_ca_system_score_gemma":0.00030477307,"threshold_uncertainty_score":0.01693225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023028469,0.0015279576,0.94886136,0.0058893105,0.0004266198,0.000074136886,0.00041518768,0.0002800163,0.019496918],"genre_scores_gemma":[0.793214,0.0027741506,0.18088269,0.00158198,0.0026432103,0.0005801575,0.0007493411,0.0004447594,0.01712971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882063,0.0053924853,0.0004334926,0.0019840605,0.0028956446,0.0010879929],"domain_scores_gemma":[0.93049204,0.054977678,0.002017518,0.008018305,0.0032769921,0.0012174788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007403389,0.0015489992,0.002468159,0.0016688148,0.0013925497,0.0066140178,0.0029931918,0.0027497709,0.009334987],"category_scores_gemma":[0.050961733,0.0008284323,0.0012676374,0.0023487324,0.0057018697,0.014012228,0.004226738,0.007324793,0.0012209715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014815829,0.000064693035,0.00019480889,0.00011055189,0.000020490277,0.000026563264,0.000077736695,0.037705295,0.00053641543,0.9419446,0.003524959,0.015645716],"study_design_scores_gemma":[0.00002649142,0.000027200904,0.000107725384,0.000024829966,0.0000075482476,0.000029500941,0.000020409912,0.14965871,0.000393547,0.84820926,0.0014753483,0.000019374664],"about_ca_topic_score_codex":0.001787227,"about_ca_topic_score_gemma":0.0015390093,"teacher_disagreement_score":0.009334987,"about_ca_system_score_codex":0.0044791047,"about_ca_system_score_gemma":0.004463534,"threshold_uncertainty_score":0.039153337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49141088,0.0007579289,0.44214043,0.001062098,0.00021589674,0.00011576343,0.00018691915,0.0002718129,0.06383835],"genre_scores_gemma":[0.92175245,0.0003940562,0.06531182,0.00029428524,0.00014429918,0.00011377118,0.00009451799,0.00003405303,0.011860703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938905,0.00022152903,0.000029909954,0.000100538455,0.00015800062,0.00010098914],"domain_scores_gemma":[0.9974196,0.0013313125,0.00037006216,0.00035082822,0.00033862022,0.00018966399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075579184,0.00048934587,0.00051185256,0.0011156189,0.00093388703,0.0012244887,0.00057219795,0.0008672493,0.0038436134],"category_scores_gemma":[0.0026815773,0.0003642133,0.00042026018,0.0010047039,0.0014394925,0.0011577609,0.0010726379,0.0010288899,0.00047971797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011631266,0.000030112997,0.00041540462,0.00004525375,0.00001264669,0.00012442259,0.00016427465,0.005226491,0.006272722,0.9764563,0.00069592794,0.010440045],"study_design_scores_gemma":[0.00006058989,0.00009998209,0.00028598006,0.000038533777,0.000021258365,0.0003196042,0.00008126557,0.056356862,0.004483165,0.9332797,0.0049386634,0.000034297664],"about_ca_topic_score_codex":0.00068584026,"about_ca_topic_score_gemma":0.000991736,"teacher_disagreement_score":0.0038436134,"about_ca_system_score_codex":0.0009573049,"about_ca_system_score_gemma":0.0007988533,"threshold_uncertainty_score":0.012858152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18031411,0.00074106466,0.7848361,0.00023508586,0.00028937915,0.00019919744,0.00022775306,0.00041755667,0.032739703],"genre_scores_gemma":[0.57761157,0.0010000992,0.40183327,0.00033871108,0.00017683103,0.00026238893,0.00048072267,0.00021053807,0.01808582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992337,0.000243658,0.00004426636,0.00011392532,0.0002473136,0.000117148564],"domain_scores_gemma":[0.9989525,0.00040263246,0.00013791064,0.0002243274,0.00019819796,0.000084475716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057501683,0.0006311502,0.00038100666,0.0011979184,0.0008910024,0.0007072132,0.00038959176,0.0004984668,0.0031206002],"category_scores_gemma":[0.001763035,0.00035030782,0.0008483749,0.00063036656,0.001215506,0.0009774221,0.00137061,0.0010045647,0.0010115192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016770879,0.000087655135,0.00090960704,0.00020067081,0.00003962745,0.00028112094,0.0006369036,0.018609734,0.0303173,0.8657018,0.002048719,0.080999225],"study_design_scores_gemma":[0.000094804265,0.00071349635,0.0011182312,0.00013399246,0.000053771233,0.0010998667,0.00021702897,0.10996116,0.048672102,0.80155605,0.036208533,0.00017089148],"about_ca_topic_score_codex":0.00047955656,"about_ca_topic_score_gemma":0.00063202693,"teacher_disagreement_score":0.0031206002,"about_ca_system_score_codex":0.0003893753,"about_ca_system_score_gemma":0.0005694366,"threshold_uncertainty_score":0.0104394555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4564802,0.0019781496,0.27523327,0.00820575,0.00059980806,0.00048525044,0.002888877,0.0012424953,0.25288618],"genre_scores_gemma":[0.70670456,0.0009462799,0.25090024,0.0017166876,0.0002451692,0.00030820604,0.0028106982,0.00035663205,0.03601153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836344,0.0005662276,0.00007058502,0.0003608665,0.00042657848,0.00021230498],"domain_scores_gemma":[0.9921869,0.006256113,0.0003990071,0.0006257008,0.0004073101,0.00012493637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011241442,0.00065120554,0.0006010583,0.0005860315,0.0013373417,0.002174659,0.0012555616,0.0012107695,0.016494632],"category_scores_gemma":[0.008325127,0.00067608606,0.0015923983,0.0013191999,0.0023000762,0.0048253485,0.0016396171,0.0024534096,0.0018687067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034793146,0.0003521849,0.0045383237,0.0006353206,0.000084144995,0.0012429417,0.0005697536,0.042728323,0.004086519,0.87330407,0.020717537,0.05139296],"study_design_scores_gemma":[0.0003289246,0.0002742032,0.0022019078,0.00027497884,0.00012708716,0.0011193408,0.0009433721,0.25986534,0.01227836,0.64127016,0.08122333,0.00009304299],"about_ca_topic_score_codex":0.0037535643,"about_ca_topic_score_gemma":0.0074332263,"teacher_disagreement_score":0.016494632,"about_ca_system_score_codex":0.0013814823,"about_ca_system_score_gemma":0.0019503401,"threshold_uncertainty_score":0.055180013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16926792,0.004054917,0.67294705,0.003919403,0.0006049535,0.00012472883,0.00027662457,0.00035044036,0.148454],"genre_scores_gemma":[0.8536352,0.0024437353,0.11424136,0.00059213507,0.00047421252,0.00016539216,0.00018105438,0.00008675956,0.028180242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991518,0.00025495622,0.000042035514,0.00020249085,0.00025617803,0.00009251487],"domain_scores_gemma":[0.99621373,0.0020891353,0.00023012716,0.00045463437,0.00067600596,0.0003363475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020203125,0.00072819093,0.00050555245,0.0020938544,0.0013270134,0.0019258399,0.0008543346,0.0010252192,0.007025281],"category_scores_gemma":[0.005699624,0.00052871596,0.0009937941,0.001227588,0.0031030064,0.0045454428,0.004516738,0.002674715,0.00059386407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012586988,0.000017112443,0.00018647577,0.000049411963,0.00000755667,0.000079940684,0.000107195185,0.0012815418,0.0010779613,0.9894639,0.0006008227,0.0071154037],"study_design_scores_gemma":[0.0000097299435,0.00004396343,0.00028589834,0.000029701561,0.000008515632,0.00025920878,0.00014723047,0.0130711,0.0019334328,0.97410357,0.010092614,0.000015012437],"about_ca_topic_score_codex":0.00045041004,"about_ca_topic_score_gemma":0.0004258022,"teacher_disagreement_score":0.007025281,"about_ca_system_score_codex":0.0011651852,"about_ca_system_score_gemma":0.0007138593,"threshold_uncertainty_score":0.023501873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47921368,0.0010797777,0.3615232,0.00083333155,0.00035652873,0.00011749006,0.00058124727,0.00039733507,0.15589738],"genre_scores_gemma":[0.9417332,0.00046259395,0.029538812,0.00040486403,0.00015789524,0.00012424002,0.0005267473,0.00013112204,0.026920548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992379,0.00013165959,0.000041511696,0.00014658525,0.00024054325,0.00020194669],"domain_scores_gemma":[0.9987167,0.00055211596,0.00013429884,0.00020767233,0.0002391051,0.00015020833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071771885,0.00035955373,0.00034042526,0.000993866,0.0012041832,0.0010537519,0.0004587515,0.00066614564,0.0075351894],"category_scores_gemma":[0.0032608558,0.00017267377,0.0004896636,0.00075641373,0.0018685316,0.0021407134,0.0022429256,0.0011990407,0.00081450754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047601075,0.000014507307,0.0005558457,0.000025181218,0.000002649981,0.00011289304,0.00021951085,0.0021647762,0.0019097625,0.9816367,0.0009348836,0.012375692],"study_design_scores_gemma":[0.00003447321,0.0000924739,0.0007158629,0.000057679426,0.000012800896,0.00054683816,0.00026622185,0.031761013,0.0049831443,0.9276346,0.033859037,0.000035813526],"about_ca_topic_score_codex":0.0006576988,"about_ca_topic_score_gemma":0.00045170143,"teacher_disagreement_score":0.0075351894,"about_ca_system_score_codex":0.0010340209,"about_ca_system_score_gemma":0.00041807888,"threshold_uncertainty_score":0.025207698},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28397226,0.0013765641,0.50738937,0.0011299468,0.0005582163,0.00025258533,0.0013711908,0.0009930388,0.20295677],"genre_scores_gemma":[0.7862677,0.0011436727,0.13245916,0.00059068453,0.00026467227,0.00025342425,0.0014149571,0.00047276352,0.07713299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999164,0.00025914062,0.000038338167,0.00016778322,0.00015693813,0.00021374812],"domain_scores_gemma":[0.9984781,0.0006955104,0.0002799625,0.00019044158,0.00015811516,0.00019788179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054391817,0.00067211,0.0005858869,0.0013922919,0.0013477781,0.0016666102,0.0005829539,0.00095385796,0.022988286],"category_scores_gemma":[0.0024005054,0.00044563858,0.0005724039,0.0012672034,0.0014177643,0.002197758,0.0012673343,0.0008546831,0.00422119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024290309,0.00007351162,0.00084886723,0.00014121832,0.000023440376,0.00035078896,0.00031936727,0.011845617,0.004622382,0.9454108,0.009367437,0.026753675],"study_design_scores_gemma":[0.000053184787,0.00005557646,0.000520844,0.00008021157,0.000019820345,0.00043443296,0.00034582877,0.03472681,0.0027041114,0.935141,0.025888687,0.000029311797],"about_ca_topic_score_codex":0.0027829304,"about_ca_topic_score_gemma":0.004572872,"teacher_disagreement_score":0.022988286,"about_ca_system_score_codex":0.0007913886,"about_ca_system_score_gemma":0.00045177634,"threshold_uncertainty_score":0.07690346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1874674,0.0014764826,0.42707112,0.003950869,0.000648651,0.000075434546,0.0012173869,0.0013143471,0.37677822],"genre_scores_gemma":[0.85386837,0.00045356058,0.053872347,0.0008874384,0.00035226753,0.00009270985,0.0007599376,0.00017928416,0.08953409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985135,0.0005150012,0.000084179934,0.00028456608,0.00030128204,0.00030146108],"domain_scores_gemma":[0.99744993,0.0010831723,0.00026256306,0.000546431,0.00037397997,0.00028389372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051986973,0.00052684225,0.00039483936,0.0013774597,0.0015408488,0.003502806,0.00091771514,0.00087591365,0.025423538],"category_scores_gemma":[0.002796171,0.0003170747,0.00056939916,0.0014397558,0.0030979998,0.005012507,0.002615808,0.0020480033,0.0048658745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059549056,0.000023060174,0.00018945218,0.00003343223,0.000009930503,0.000083275096,0.0001471011,0.0008695971,0.0009814876,0.9834427,0.0027649144,0.011395432],"study_design_scores_gemma":[0.000019584555,0.00003877871,0.00020158109,0.00003110844,0.000011823625,0.0002416354,0.00025742294,0.005533097,0.0026312289,0.9569548,0.034053806,0.000025106378],"about_ca_topic_score_codex":0.0012166661,"about_ca_topic_score_gemma":0.0014772282,"teacher_disagreement_score":0.025423538,"about_ca_system_score_codex":0.0011778679,"about_ca_system_score_gemma":0.00062936376,"threshold_uncertainty_score":0.085050166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6576906,0.0015695257,0.14621103,0.002861754,0.0004991471,0.0001870251,0.0008593745,0.0003273552,0.18979423],"genre_scores_gemma":[0.9586779,0.0008560902,0.014545402,0.0005125712,0.0003852867,0.00013027762,0.000534425,0.00011765506,0.024240538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904317,0.0003211979,0.00004555946,0.00015283849,0.0001995617,0.00023760022],"domain_scores_gemma":[0.9966845,0.0016339247,0.00065740437,0.0004201932,0.00024599928,0.0003580842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008454827,0.00050784706,0.00062347535,0.0021948258,0.0018499637,0.0025995565,0.00092204043,0.0011000774,0.010832849],"category_scores_gemma":[0.00413439,0.00045649754,0.00060913886,0.0014488858,0.0029551168,0.005507383,0.0021769383,0.0015524138,0.0012880818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047294492,0.000024420853,0.00039304444,0.00002417608,0.000008069518,0.000083883744,0.00024978828,0.0012008095,0.00078756263,0.9896987,0.0016803083,0.0058020297],"study_design_scores_gemma":[0.000015680242,0.000015592363,0.00032994227,0.000016928014,0.0000059622566,0.000102164384,0.00016108666,0.0036667387,0.00039626655,0.992239,0.003040845,0.000009737623],"about_ca_topic_score_codex":0.0013359173,"about_ca_topic_score_gemma":0.0014436068,"teacher_disagreement_score":0.010832849,"about_ca_system_score_codex":0.0011449754,"about_ca_system_score_gemma":0.00069011946,"threshold_uncertainty_score":0.036239505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2727295,0.0009812576,0.57810104,0.00062355166,0.00048333683,0.0001598072,0.00049283647,0.0009630629,0.14546569],"genre_scores_gemma":[0.8320219,0.00081989187,0.12503047,0.00020927719,0.00015190807,0.00014962045,0.00051597174,0.00021401826,0.04088687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952865,0.00010547363,0.000019204108,0.00010110212,0.00013587455,0.00010979945],"domain_scores_gemma":[0.99922884,0.0002702068,0.000067744404,0.00024505434,0.00007959103,0.00010859597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031132056,0.00043870354,0.00036679092,0.0009800489,0.0009805214,0.0014114281,0.0004998966,0.00052747113,0.008783915],"category_scores_gemma":[0.0012238923,0.00037232097,0.0004967724,0.0006985349,0.0009170906,0.0016386836,0.0026534193,0.0012682804,0.0017229116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011594828,0.00005852836,0.00059539947,0.00010465249,0.000019061596,0.00030640358,0.00045018183,0.0017887539,0.015887091,0.9326007,0.003969167,0.044104174],"study_design_scores_gemma":[0.00007947956,0.00022162884,0.0008697135,0.000094535026,0.00006448364,0.0012557578,0.0003950179,0.014546888,0.02785142,0.888222,0.06635467,0.000044390745],"about_ca_topic_score_codex":0.00026360727,"about_ca_topic_score_gemma":0.00057976006,"teacher_disagreement_score":0.008783915,"about_ca_system_score_codex":0.0004609966,"about_ca_system_score_gemma":0.00030457205,"threshold_uncertainty_score":0.02938509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38335168,0.0017375458,0.47610784,0.002680135,0.00030011707,0.00009265749,0.00026051843,0.0006989159,0.13477059],"genre_scores_gemma":[0.9465283,0.0010383832,0.039417148,0.0006188577,0.0002678094,0.00008938877,0.0001904516,0.00022840378,0.011621319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872905,0.00038823983,0.000048439564,0.00025033968,0.00037890283,0.00020490336],"domain_scores_gemma":[0.9926416,0.00495153,0.0005219961,0.00082461734,0.00047920342,0.0005810601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108303,0.00069568516,0.00060837215,0.0019239071,0.0016699146,0.001875847,0.0012386492,0.0009703162,0.010997777],"category_scores_gemma":[0.007254919,0.0007278371,0.00074062875,0.00147018,0.0030357318,0.004627822,0.0023424893,0.0024064826,0.0008752404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053253687,0.000020106578,0.00037657956,0.00004807721,0.000008352129,0.000121582874,0.0002213153,0.0041026454,0.0016910966,0.9839512,0.0013998067,0.008006021],"study_design_scores_gemma":[0.000012782194,0.000023430233,0.00028453147,0.000021412987,0.000009872426,0.00017611163,0.000107473825,0.014727609,0.0016977291,0.97897685,0.003944815,0.000017309254],"about_ca_topic_score_codex":0.0014458487,"about_ca_topic_score_gemma":0.0019603055,"teacher_disagreement_score":0.010997777,"about_ca_system_score_codex":0.0017458942,"about_ca_system_score_gemma":0.0005728886,"threshold_uncertainty_score":0.036791205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79111755,0.0010638173,0.07790652,0.0033722678,0.00037716914,0.0001426492,0.0008380209,0.00021216027,0.124969855],"genre_scores_gemma":[0.9732011,0.00042340654,0.0114775365,0.0005586259,0.00025292285,0.00008860419,0.00056432566,0.000081866274,0.013351684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986125,0.00047111066,0.00006351629,0.00032706535,0.00017686897,0.00034879136],"domain_scores_gemma":[0.9920752,0.005027278,0.000949599,0.0006338538,0.0006863824,0.00062776153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013736017,0.00038265524,0.0006500581,0.0020290792,0.0029584006,0.0029802846,0.0011554615,0.0015824965,0.018582968],"category_scores_gemma":[0.009565396,0.00061024964,0.0006248325,0.0017483792,0.00375644,0.006719532,0.0028372868,0.0020671228,0.0010567326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006667286,0.00009844052,0.0028197672,0.00018955987,0.000044494816,0.0004565856,0.0011114347,0.0048311064,0.0045592575,0.9603022,0.006692576,0.018228032],"study_design_scores_gemma":[0.0001166984,0.00013622,0.003420282,0.00007184851,0.000056477213,0.0007399916,0.0018414104,0.021774441,0.0033206497,0.9575396,0.010912431,0.00006994347],"about_ca_topic_score_codex":0.0019040945,"about_ca_topic_score_gemma":0.0017133239,"teacher_disagreement_score":0.018582968,"about_ca_system_score_codex":0.0015757701,"about_ca_system_score_gemma":0.00061572593,"threshold_uncertainty_score":0.062166214},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28110063,0.0011018637,0.39667344,0.0014436693,0.00042163467,0.00031753245,0.0068447506,0.0011252249,0.3109713],"genre_scores_gemma":[0.66536355,0.0010119833,0.17158796,0.0006146928,0.00012962888,0.00034464273,0.008851074,0.00067113125,0.15142542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965,0.000057120866,0.000020875232,0.00008763726,0.00008132088,0.00010311077],"domain_scores_gemma":[0.9992449,0.0002218425,0.0000935051,0.00011109959,0.00021221985,0.000116344454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002821392,0.00044691117,0.00023129245,0.0016539863,0.0010587969,0.0018005479,0.0004977686,0.00050564687,0.019890208],"category_scores_gemma":[0.0013888003,0.00027313695,0.0003430767,0.0009923083,0.00064268766,0.0018343141,0.0010426522,0.0009475839,0.004220597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016372492,0.00009736629,0.00091370876,0.00016791682,0.000019010988,0.00033687853,0.0005726897,0.0031721643,0.0072395424,0.92061573,0.017948762,0.048752494],"study_design_scores_gemma":[0.000026338586,0.000029278091,0.001518283,0.000085362095,0.000022172462,0.00041518832,0.00053083774,0.012806367,0.0027529886,0.9281181,0.05367588,0.00001905507],"about_ca_topic_score_codex":0.0023921395,"about_ca_topic_score_gemma":0.005354944,"teacher_disagreement_score":0.019890208,"about_ca_system_score_codex":0.0010894155,"about_ca_system_score_gemma":0.0006808275,"threshold_uncertainty_score":0.06653941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76556313,0.0005013015,0.048878502,0.0017834867,0.00042223526,0.00006037752,0.0013322014,0.00037327717,0.18108542],"genre_scores_gemma":[0.9561897,0.00019152527,0.011993949,0.00022057988,0.00010318779,0.00003697304,0.00070534355,0.00006024093,0.030498654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995208,0.00009437098,0.000026450582,0.00009442933,0.00011259421,0.00015134542],"domain_scores_gemma":[0.99762887,0.0009701372,0.0004150021,0.00028344334,0.00028365504,0.00041887374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030174712,0.0002770247,0.00030179028,0.0013120034,0.0018539291,0.0019448809,0.00051331735,0.00093825243,0.0145945335],"category_scores_gemma":[0.0025331585,0.00041097665,0.0003829603,0.0006900536,0.001258106,0.0017522357,0.0017356194,0.00095568824,0.0015626402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029664682,0.00006879556,0.005387409,0.00012179713,0.000024393135,0.00045937888,0.0006168433,0.00080985,0.0071216687,0.9624663,0.007927132,0.014699697],"study_design_scores_gemma":[0.00007500697,0.0001011283,0.0069410177,0.00008324841,0.000042352676,0.0012814424,0.0015657824,0.007779486,0.01198863,0.9383915,0.031699315,0.00005118061],"about_ca_topic_score_codex":0.00068829185,"about_ca_topic_score_gemma":0.0014155626,"teacher_disagreement_score":0.0145945335,"about_ca_system_score_codex":0.00074997655,"about_ca_system_score_gemma":0.0005979745,"threshold_uncertainty_score":0.048823535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5008687,0.0021115178,0.32462755,0.010521688,0.0008451102,0.00013077787,0.00050946086,0.0003937794,0.15999147],"genre_scores_gemma":[0.9562348,0.0007463804,0.028933315,0.0011552611,0.00033662125,0.000100300866,0.00022531826,0.00010046046,0.012167634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978137,0.0008305919,0.000095589785,0.00041182427,0.000421474,0.00042674853],"domain_scores_gemma":[0.96518433,0.02826165,0.0018251835,0.001982921,0.0014739501,0.001272072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025296153,0.00041667954,0.00072798657,0.0014067513,0.0022955693,0.0029291124,0.0014343562,0.0021274164,0.007884973],"category_scores_gemma":[0.027343016,0.0007415115,0.0005184806,0.0008191488,0.0040412336,0.0072615263,0.00355734,0.0041757054,0.0010423696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013836719,0.00004165073,0.00078317715,0.00006721578,0.000015515532,0.00018828994,0.00024156047,0.0019081373,0.0018072232,0.9858283,0.0033050894,0.0056755734],"study_design_scores_gemma":[0.000043988537,0.000035050623,0.0004226844,0.00003248368,0.000012567963,0.0004109856,0.00013658154,0.016291475,0.001329082,0.9790206,0.0022432248,0.000021433249],"about_ca_topic_score_codex":0.0006483124,"about_ca_topic_score_gemma":0.0009529373,"teacher_disagreement_score":0.007884973,"about_ca_system_score_codex":0.0009547339,"about_ca_system_score_gemma":0.0007477746,"threshold_uncertainty_score":0.026377857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8991708,0.00023551138,0.080789,0.00021449325,0.000027626224,0.00002911373,0.00033417705,0.00017965678,0.019019574],"genre_scores_gemma":[0.9645515,0.00019207619,0.026960308,0.00009629456,0.000030581155,0.00004226845,0.0007181036,0.00009045701,0.0073184352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965405,0.00006708671,0.000014353006,0.00007723113,0.00008827932,0.00009897635],"domain_scores_gemma":[0.99864095,0.0006642663,0.00013523649,0.00023065947,0.00013883384,0.00019007361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029382686,0.0004899652,0.0005577113,0.0008091196,0.0009255939,0.0011821019,0.0006113368,0.0005148835,0.0046402467],"category_scores_gemma":[0.0015696812,0.00036052422,0.0006413174,0.00038958417,0.0012130805,0.0015630532,0.0012213505,0.0008456962,0.00067313627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010166974,0.00019953838,0.00856384,0.0003730003,0.00012787699,0.0012568888,0.0021448492,0.19327782,0.057623435,0.67394555,0.007316062,0.054154433],"study_design_scores_gemma":[0.000058764905,0.00012491221,0.0016910593,0.00004554553,0.000032767693,0.0004447153,0.000760305,0.2048286,0.025073737,0.76056224,0.00634755,0.000029872821],"about_ca_topic_score_codex":0.00089217647,"about_ca_topic_score_gemma":0.0018525948,"teacher_disagreement_score":0.0046402467,"about_ca_system_score_codex":0.00038894237,"about_ca_system_score_gemma":0.00029746827,"threshold_uncertainty_score":0.015523195},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48455766,0.0017973913,0.12721384,0.0014167129,0.0003987234,0.00015113693,0.0014528807,0.00043444266,0.38257718],"genre_scores_gemma":[0.9277383,0.0006649017,0.02293427,0.00034971125,0.00024916578,0.00017076754,0.00089726684,0.0001043693,0.046891235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940264,0.00012107737,0.000032614735,0.0001281546,0.0001452244,0.00017022081],"domain_scores_gemma":[0.99843377,0.0005698609,0.00026774537,0.00023607748,0.00022306733,0.00026945907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004500141,0.0003743152,0.0004400958,0.0021112242,0.0017436608,0.0030235758,0.0007975051,0.0009440198,0.017032037],"category_scores_gemma":[0.0021899524,0.00035247038,0.00060123706,0.0015637715,0.0018175185,0.003993831,0.001553346,0.0014592557,0.001734303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025314912,0.000010430965,0.00019541867,0.000018815961,0.000004416386,0.000057210393,0.00010435568,0.000384008,0.00039791325,0.993465,0.0013495384,0.0039876495],"study_design_scores_gemma":[0.000014440176,0.000015372485,0.0003397745,0.000021153399,0.000007580552,0.00016482905,0.00015124236,0.0032784063,0.0004942281,0.98578185,0.009718967,0.000012154955],"about_ca_topic_score_codex":0.0011644035,"about_ca_topic_score_gemma":0.001674511,"teacher_disagreement_score":0.017032037,"about_ca_system_score_codex":0.0013423656,"about_ca_system_score_gemma":0.00055468845,"threshold_uncertainty_score":0.05697781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15357089,0.0003361746,0.8289719,0.00049173256,0.00006211199,0.00008256879,0.0007145219,0.00019610657,0.015573973],"genre_scores_gemma":[0.8966551,0.001016425,0.08630906,0.00022736039,0.00018855563,0.00042856066,0.0020744372,0.00018316739,0.0129173985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827313,0.0005346895,0.00012185956,0.00039141614,0.00035711908,0.00032181342],"domain_scores_gemma":[0.9958954,0.0021878416,0.0007832474,0.00030529575,0.0005844404,0.0002438249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016757741,0.0010571848,0.00083246565,0.0021156622,0.00075994787,0.0032177123,0.0009885348,0.0010361884,0.0038316662],"category_scores_gemma":[0.006506584,0.00061151193,0.0008611144,0.0014541341,0.0024019433,0.0027244242,0.001141134,0.0014692274,0.00072887476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045659377,0.000035110636,0.0005801336,0.000058483834,0.000023534789,0.00013308213,0.00009306628,0.11989223,0.0016906752,0.86888576,0.0009825948,0.0075796978],"study_design_scores_gemma":[0.000014913875,0.000045543802,0.00029922425,0.000040365274,0.000010093551,0.00008821885,0.00011192385,0.38276553,0.0015869199,0.61301446,0.0019881716,0.00003464836],"about_ca_topic_score_codex":0.0017205356,"about_ca_topic_score_gemma":0.0013305405,"teacher_disagreement_score":0.0038316662,"about_ca_system_score_codex":0.0011109186,"about_ca_system_score_gemma":0.00155017,"threshold_uncertainty_score":0.012818158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43012992,0.0016873301,0.30947128,0.009817546,0.0006302485,0.00025331875,0.0008135948,0.00039535447,0.2468014],"genre_scores_gemma":[0.87432146,0.0010144233,0.06221865,0.0014411046,0.00057810685,0.00034639603,0.00086170004,0.00018159134,0.05903662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995407,0.0001345774,0.00001826078,0.000080784,0.000097007105,0.00012871053],"domain_scores_gemma":[0.99804676,0.0011937999,0.0001645146,0.00016366299,0.0001773339,0.00025389824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060188014,0.0005982989,0.0006579066,0.00091508956,0.0019633323,0.0018916449,0.0016447151,0.0029700496,0.014497875],"category_scores_gemma":[0.0054937354,0.00044956862,0.0007974861,0.0012896495,0.0017787201,0.0020284923,0.0017773786,0.0026285632,0.0006500153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048287126,0.000043952095,0.00020570375,0.00007966639,0.000019804602,0.00011654284,0.00015531275,0.0111154225,0.0008247996,0.9700631,0.008734544,0.008592913],"study_design_scores_gemma":[0.000049263595,0.000017507777,0.00013685077,0.000025450307,0.000009422713,0.000067128,0.00008991872,0.059611615,0.00032806836,0.9355957,0.004054197,0.000014934691],"about_ca_topic_score_codex":0.003939308,"about_ca_topic_score_gemma":0.0047637285,"teacher_disagreement_score":0.014497875,"about_ca_system_score_codex":0.0013662472,"about_ca_system_score_gemma":0.0017016967,"threshold_uncertainty_score":0.04850024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6867282,0.0015602306,0.093847245,0.0014933754,0.00041323114,0.00015435005,0.0016554581,0.00043330397,0.21371463],"genre_scores_gemma":[0.93344295,0.00037580865,0.018546235,0.000286565,0.000078933765,0.000062114734,0.0008572997,0.00008462495,0.046265457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996977,0.00006153744,0.000016542783,0.000063791274,0.00004865093,0.00011188534],"domain_scores_gemma":[0.9994547,0.00013341567,0.00013199846,0.00006971596,0.00010359839,0.00010655689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001890053,0.0003861028,0.0002903745,0.0011322772,0.0013197226,0.0013927214,0.0006133298,0.0006372225,0.015302151],"category_scores_gemma":[0.00093182013,0.00022002008,0.00023389174,0.0005851976,0.0009480516,0.0014456738,0.001224939,0.00074694806,0.0015870822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028639406,0.000054729055,0.0020102267,0.00019140886,0.000027293205,0.0004783613,0.00047918526,0.0033656233,0.010734448,0.9465231,0.009446396,0.0264028],"study_design_scores_gemma":[0.00004268665,0.000072117895,0.0026796404,0.00006710317,0.00003269692,0.0006880741,0.0004990625,0.013222076,0.0058741025,0.9408443,0.03593276,0.00004541371],"about_ca_topic_score_codex":0.00250074,"about_ca_topic_score_gemma":0.005076223,"teacher_disagreement_score":0.015302151,"about_ca_system_score_codex":0.0008588016,"about_ca_system_score_gemma":0.0004361315,"threshold_uncertainty_score":0.051190794},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2889309,0.0021667397,0.41250452,0.0015849486,0.0006375442,0.00020488753,0.0035007296,0.0005625208,0.28990725],"genre_scores_gemma":[0.82133895,0.0010661853,0.08880964,0.0012110439,0.0005978385,0.00044213544,0.0037525643,0.00029128624,0.082490385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997865,0.00061909785,0.00011137678,0.00038231828,0.00071255956,0.0003096512],"domain_scores_gemma":[0.9962573,0.0014770334,0.0005143836,0.000790547,0.0006569925,0.0003037313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078211667,0.0006892591,0.00097629084,0.002343645,0.0022761163,0.0032571477,0.0011380423,0.0010889325,0.012372149],"category_scores_gemma":[0.004899097,0.00068247976,0.0008126473,0.0017319435,0.002263973,0.0033427163,0.0034423054,0.0014374432,0.0028837658],"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.00007262676,0.000031320174,0.00025231243,0.00006370356,0.000028708844,0.00010182519,0.00014296647,0.0021854124,0.0016829318,0.9790829,0.004048807,0.012306592],"study_design_scores_gemma":[0.00002683199,0.000023061088,0.00031805536,0.000034121073,0.000013165161,0.0002482485,0.00011577009,0.006763528,0.0016559421,0.97979593,0.010984898,0.00002060123],"about_ca_topic_score_codex":0.00044678166,"about_ca_topic_score_gemma":0.00077044696,"teacher_disagreement_score":0.012372149,"about_ca_system_score_codex":0.00079638045,"about_ca_system_score_gemma":0.00079189474,"threshold_uncertainty_score":0.04138893},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34273943,0.005894959,0.38750932,0.003805803,0.0012336336,0.00012332518,0.0005504963,0.00035795348,0.25778508],"genre_scores_gemma":[0.9325984,0.0016424268,0.029161805,0.00059813977,0.0005690601,0.00007314765,0.0001886131,0.000048574333,0.035119846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906725,0.00035482043,0.00004422295,0.00013819628,0.00021748376,0.00017806578],"domain_scores_gemma":[0.998214,0.0007287226,0.00032121455,0.00033101803,0.00022142688,0.0001836954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007857191,0.00038335737,0.00037420282,0.00116544,0.0011375227,0.001962754,0.0004858222,0.0008361528,0.005595433],"category_scores_gemma":[0.0025908821,0.0003357868,0.00045995257,0.0008360477,0.0019694234,0.0028892073,0.0015894445,0.0013601617,0.00096456043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018743563,0.0000114645745,0.00008763147,0.000017819686,0.0000036806155,0.000036283403,0.00006657203,0.00054887054,0.0004368935,0.9943329,0.0008043924,0.0036347564],"study_design_scores_gemma":[0.000010691998,0.000021184878,0.00009775201,0.000016890815,0.000005331272,0.00016293424,0.00006719621,0.0034315938,0.0006953532,0.9897866,0.005694856,0.000009451397],"about_ca_topic_score_codex":0.000386004,"about_ca_topic_score_gemma":0.0006143803,"teacher_disagreement_score":0.005595433,"about_ca_system_score_codex":0.0008985517,"about_ca_system_score_gemma":0.0006371411,"threshold_uncertainty_score":0.01871866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4051345,0.0050797025,0.27039298,0.002247211,0.0009002975,0.00012212795,0.00048626933,0.00051684177,0.31512013],"genre_scores_gemma":[0.9318652,0.0012243652,0.031115344,0.00044252444,0.00039336405,0.0001280037,0.00029765695,0.00017250392,0.03436113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932563,0.00022652055,0.00003555119,0.0001357695,0.00016117985,0.000115451454],"domain_scores_gemma":[0.99705184,0.0016838434,0.0003683052,0.00025615378,0.00032340875,0.00031644866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005883354,0.00044811395,0.00055170094,0.0025210045,0.0019207251,0.002766872,0.00057847204,0.0008175323,0.011643782],"category_scores_gemma":[0.005004459,0.00053828466,0.00044590965,0.0010429716,0.0026719144,0.0032750226,0.0018152713,0.0012659717,0.0015004626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026485728,0.000008277738,0.00022626948,0.000030252266,0.0000054750926,0.00010106743,0.00015951412,0.0008275686,0.0007110646,0.99173903,0.0018012562,0.004363716],"study_design_scores_gemma":[0.000009773753,0.000013731442,0.00018833681,0.000027284335,0.0000068769627,0.00023025364,0.00013245779,0.0039605414,0.0009053324,0.9874297,0.0070871124,0.000008574032],"about_ca_topic_score_codex":0.00067500956,"about_ca_topic_score_gemma":0.0009798369,"teacher_disagreement_score":0.011643782,"about_ca_system_score_codex":0.0009479184,"about_ca_system_score_gemma":0.000491975,"threshold_uncertainty_score":0.03895241},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061140065,0.00020287649,0.97849965,0.00016982065,0.00018910402,0.000114583796,0.00017798918,0.00055398245,0.013977987],"genre_scores_gemma":[0.12619334,0.00045742444,0.8528502,0.00044325797,0.00019575848,0.00046772588,0.0006033694,0.0003285428,0.018460337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987734,0.00034139658,0.00006560542,0.00030419364,0.00040732362,0.000108032786],"domain_scores_gemma":[0.9987166,0.00042784712,0.00011363638,0.0004470572,0.00020096911,0.00009392797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008792425,0.0008246986,0.0005707184,0.0016341739,0.001053394,0.0010062328,0.0009261632,0.0006991143,0.011795766],"category_scores_gemma":[0.0035156072,0.0005337442,0.0006870928,0.0016506033,0.0009612701,0.0020901174,0.0023190912,0.0016423794,0.0044861757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025058351,0.0001634814,0.00043855075,0.00035603432,0.000061491664,0.0002008006,0.00043388564,0.0050270814,0.04612192,0.56845564,0.016434055,0.3620565],"study_design_scores_gemma":[0.00015354586,0.00040781224,0.0004268223,0.00015230419,0.00010462534,0.0009615534,0.00019881496,0.030052712,0.04123021,0.7699097,0.15633166,0.00007029615],"about_ca_topic_score_codex":0.000334749,"about_ca_topic_score_gemma":0.00073517516,"teacher_disagreement_score":0.011795766,"about_ca_system_score_codex":0.00041743054,"about_ca_system_score_gemma":0.000657727,"threshold_uncertainty_score":0.03946072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46869147,0.0008710171,0.37107044,0.0012227618,0.00012806033,0.00016502713,0.0017682957,0.00068200665,0.15540098],"genre_scores_gemma":[0.93594843,0.00027069933,0.04354239,0.00024133807,0.00008999132,0.00010920055,0.00085002097,0.00007948283,0.018868407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993906,0.00018891682,0.000037958638,0.00014016271,0.00013413696,0.00010812027],"domain_scores_gemma":[0.9972652,0.001202359,0.00052563625,0.00046355263,0.00032662408,0.00021676625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048506126,0.00032714297,0.00024778012,0.0012124659,0.0010810579,0.0026228963,0.00080568425,0.00089245016,0.01187936],"category_scores_gemma":[0.0025731446,0.0004119021,0.00036239848,0.0011350818,0.0013658655,0.0016088776,0.0009115057,0.00095126044,0.0017058866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015974982,0.000064848005,0.00089528534,0.00007138317,0.000017502578,0.00031752777,0.00021804371,0.005215748,0.008353063,0.956861,0.002809873,0.025015928],"study_design_scores_gemma":[0.00007710498,0.00018470771,0.0013729054,0.000049445687,0.000039251227,0.0010535032,0.00018663332,0.027632775,0.006596233,0.94851804,0.014243395,0.000045966728],"about_ca_topic_score_codex":0.0005475234,"about_ca_topic_score_gemma":0.00088725996,"teacher_disagreement_score":0.01187936,"about_ca_system_score_codex":0.00067640183,"about_ca_system_score_gemma":0.00048427403,"threshold_uncertainty_score":0.039740384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65400463,0.00064663915,0.118724845,0.0011502459,0.00020192841,0.00010806265,0.0025803945,0.00053236657,0.22205092],"genre_scores_gemma":[0.9437045,0.0003190605,0.03492014,0.00023563253,0.00006644691,0.00006985007,0.0017762093,0.00018471266,0.018723466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929714,0.00016776861,0.000038699327,0.000112530804,0.0001561607,0.000227615],"domain_scores_gemma":[0.9976373,0.0012054764,0.00025608554,0.00035106545,0.00026062285,0.0002895488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039339685,0.0005625139,0.0006042997,0.0011686382,0.0016942582,0.0026041921,0.00070179545,0.0011824421,0.019127544],"category_scores_gemma":[0.0041179135,0.0006447272,0.00050790375,0.0015021724,0.0012679972,0.0024069909,0.0018463361,0.0012391572,0.002953607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010232187,0.00021679934,0.0031047626,0.0004453895,0.00007208305,0.0010267833,0.00091001624,0.013858747,0.02150761,0.8698883,0.026251705,0.06169451],"study_design_scores_gemma":[0.00011598125,0.00013993186,0.004094026,0.00016174816,0.000070001464,0.0017134161,0.00094551116,0.059962716,0.020488178,0.88664603,0.025616428,0.000045954646],"about_ca_topic_score_codex":0.0012648857,"about_ca_topic_score_gemma":0.0017702956,"teacher_disagreement_score":0.019127544,"about_ca_system_score_codex":0.0008411486,"about_ca_system_score_gemma":0.0005509856,"threshold_uncertainty_score":0.06398803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4007093,0.0005614103,0.58020014,0.00035590844,0.00014750128,0.00013696351,0.0001103004,0.0012776678,0.016500706],"genre_scores_gemma":[0.91135937,0.00018370536,0.08436721,0.000094085306,0.000021250517,0.00005231689,0.000056679935,0.000013310287,0.0038520396],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999229,0.000010945944,0.0000042399897,0.00001818766,0.000030915216,0.000012809901],"domain_scores_gemma":[0.9999366,0.000012845995,0.000011212889,0.000007043443,0.000025617552,0.0000066476377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083841194,0.00015516144,0.00009378282,0.00021033984,0.00022898258,0.00034868787,0.00050365424,0.0002217481,0.0007504266],"category_scores_gemma":[0.00012486715,0.00007727872,0.00012144446,0.00016779428,0.00017471451,0.00028297244,0.00015945484,0.0002327057,0.00012925646],"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.00025125072,0.00017612927,0.0016350687,0.00016532911,0.0000562283,0.00049329305,0.00019043041,0.057786018,0.74891293,0.06909869,0.0023720206,0.118862644],"study_design_scores_gemma":[0.00008569464,0.001032488,0.0016099021,0.00003175126,0.00009833375,0.0007161295,0.0000781009,0.7567823,0.21069352,0.011487465,0.017330162,0.00005414552],"about_ca_topic_score_codex":0.0010203501,"about_ca_topic_score_gemma":0.0017073781,"teacher_disagreement_score":0.0010203501,"about_ca_system_score_codex":0.00045270234,"about_ca_system_score_gemma":0.00035772912,"threshold_uncertainty_score":0.0032845736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009099539,0.031095365,0.0034080166,0.0046715415,0.0048179366,0.00006873682,0.0010929095,0.0010287232,0.9529069],"genre_scores_gemma":[0.0026805387,0.010252772,0.001376482,0.0004889736,0.00078924047,0.000049743434,0.00072304934,0.00035285574,0.98328626],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943,0.0000668789,0.000028745802,0.00007875738,0.00034687735,0.00004885626],"domain_scores_gemma":[0.9995127,0.00011212962,0.00003587903,0.00006263588,0.00017636816,0.000100385034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055864366,0.0013682819,0.00048055343,0.0034045856,0.0014261024,0.0069248034,0.0008491158,0.0014086149,0.18435088],"category_scores_gemma":[0.0012686019,0.0007512158,0.0004137663,0.004868429,0.0011209896,0.006009255,0.001922748,0.0024296206,0.1251609],"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.000023918548,0.000023904908,0.00006572449,0.000212103,0.0000034025256,0.00003549566,0.00013766064,0.00044787847,0.0003839296,0.067197874,0.7819529,0.14951518],"study_design_scores_gemma":[0.0000016003496,0.000004941605,0.00008590548,0.00006249411,8.4850495e-7,0.000030941195,0.000026153484,0.00010480576,0.00008593277,0.0031053647,0.996488,0.000003126509],"about_ca_topic_score_codex":0.0068977736,"about_ca_topic_score_gemma":0.012710094,"teacher_disagreement_score":0.18435088,"about_ca_system_score_codex":0.0042326166,"about_ca_system_score_gemma":0.0019904238,"threshold_uncertainty_score":0.61671513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010880639,0.00012296905,0.000080993064,0.000055906672,0.000016987158,0.0000051460206,0.99822146,0.00014219077,0.00026623905],"genre_scores_gemma":[0.0021232367,0.00006163084,0.0002471208,0.00003173328,0.000004727607,0.000030553765,0.9972242,0.000018792098,0.0002580787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994641,0.000084613814,0.00006032562,0.00019987933,0.00011343915,0.00007768986],"domain_scores_gemma":[0.9988164,0.00040981502,0.00017682562,0.00022602608,0.0002623331,0.00010870187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086347986,0.0016277868,0.0010749743,0.0019088672,0.00050793495,0.0013273029,0.0018589868,0.0018264636,0.017725402],"category_scores_gemma":[0.0030733428,0.0004502454,0.0013708241,0.0034230505,0.00033535666,0.00074581214,0.0013436441,0.0009881101,0.02007881],"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.0002980584,0.00011561097,0.017773563,0.0027317621,0.00034672196,0.00015415023,0.00008468877,0.006221323,0.00085945585,0.0011349726,0.96051127,0.0097683985],"study_design_scores_gemma":[0.0008032906,0.00013253342,0.07973591,0.0011529862,0.00034933325,0.00032598493,0.00031482958,0.0075329226,0.0013117006,0.003129276,0.9050934,0.0001178663],"about_ca_topic_score_codex":0.03128859,"about_ca_topic_score_gemma":0.058670543,"teacher_disagreement_score":0.03128859,"about_ca_system_score_codex":0.0010494667,"about_ca_system_score_gemma":0.0012402206,"threshold_uncertainty_score":0.062212944},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016661756,0.00015811609,0.926688,0.00047883182,0.0002957479,0.00036582001,0.0020782354,0.017961258,0.03531221],"genre_scores_gemma":[0.51980424,0.00022609062,0.40675995,0.00088502315,0.00026294967,0.0010488858,0.005143527,0.006664673,0.059204686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892056,0.00019145964,0.00004435634,0.00017995284,0.0005079888,0.0001558099],"domain_scores_gemma":[0.9976356,0.000672223,0.0001754828,0.000473235,0.00096636015,0.000076981974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151267,0.00088915817,0.00051096483,0.0017662841,0.0010529336,0.0012971578,0.0009844758,0.0010025974,0.027948376],"category_scores_gemma":[0.003116574,0.00029890393,0.0005988366,0.0007274709,0.0008109988,0.001027915,0.0011711685,0.0010269255,0.010310627],"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.0011871897,0.00022984223,0.0019535574,0.00046408112,0.00013606562,0.00071249047,0.00033245678,0.07986685,0.07096713,0.4816304,0.11070387,0.25181606],"study_design_scores_gemma":[0.00014518133,0.00012128885,0.00091584685,0.00013290241,0.00005250078,0.00038871443,0.000050079965,0.7458437,0.086917035,0.11212849,0.05318862,0.00011562961],"about_ca_topic_score_codex":0.0036540749,"about_ca_topic_score_gemma":0.003827597,"teacher_disagreement_score":0.027948376,"about_ca_system_score_codex":0.0022148665,"about_ca_system_score_gemma":0.0032578877,"threshold_uncertainty_score":0.09349662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011473426,0.000011369649,0.000034427863,0.00003465585,0.000007777355,0.000011836486,0.9992644,0.000053089607,0.00046775452],"genre_scores_gemma":[0.0010526738,0.000027833927,0.00049769884,0.00006361693,0.0000075581233,0.00027253863,0.9966137,0.00005591759,0.0014084908],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987538,0.00030274756,0.00020981094,0.0002797499,0.00028633646,0.00016757779],"domain_scores_gemma":[0.986349,0.0072229914,0.0011661032,0.001285646,0.003358787,0.00061765674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021742987,0.0010543072,0.0008878291,0.003284731,0.0009879839,0.0019110106,0.001959576,0.0015246114,0.18697193],"category_scores_gemma":[0.017177885,0.0005406729,0.0010636973,0.00466913,0.00028199158,0.0010950676,0.0015560241,0.0015733675,0.063859],"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.0000677626,0.00004478971,0.0031003957,0.0008710089,0.000024638934,0.000012471338,0.00007570546,0.00018864384,0.00004220046,0.00046151437,0.99275804,0.0023528412],"study_design_scores_gemma":[0.0006073694,0.000050604922,0.037031043,0.0012433113,0.00009231706,0.00007095774,0.0006148672,0.00060468656,0.0003527412,0.002335311,0.95693946,0.0000573389],"about_ca_topic_score_codex":0.045249604,"about_ca_topic_score_gemma":0.12821719,"teacher_disagreement_score":0.18697193,"about_ca_system_score_codex":0.002085753,"about_ca_system_score_gemma":0.0029324815,"threshold_uncertainty_score":0.6254834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019822441,0.0008117223,0.0009052226,0.00039581337,0.0010101527,0.00018578321,0.005190494,0.0038094453,0.98749316],"genre_scores_gemma":[0.0006763847,0.0006728729,0.00066409085,0.0003233907,0.0002075387,0.00006545771,0.00372021,0.0015794028,0.9920907],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992281,0.000045790763,0.00003888243,0.0001405724,0.00047502856,0.00007169137],"domain_scores_gemma":[0.997759,0.00020438386,0.000057941732,0.00023394541,0.0012992253,0.0004455524],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00058204454,0.0017943026,0.0014587735,0.002782778,0.0017500669,0.008536005,0.0021679571,0.002056982,0.93072474],"category_scores_gemma":[0.0031974262,0.0008531595,0.00111934,0.0031441972,0.0005347818,0.0075373007,0.0026429459,0.0022874125,0.92287177],"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.000026316007,0.00003119645,0.000032924072,0.00016669928,0.0000019129743,0.000028684097,0.000022721671,0.000027486121,0.00039142047,0.00096380064,0.9639842,0.034322474],"study_design_scores_gemma":[0.000009915961,0.000015090186,0.0001680693,0.000059591956,0.0000029321754,0.000052533473,0.000031372823,0.00003223181,0.00016614543,0.00034333562,0.9991109,0.000007949482],"about_ca_topic_score_codex":0.0036590223,"about_ca_topic_score_gemma":0.0061682905,"teacher_disagreement_score":0.06927526,"about_ca_system_score_codex":0.0011776322,"about_ca_system_score_gemma":0.0013535738,"threshold_uncertainty_score":0.0988127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16534662,0.013141633,0.2721756,0.03294113,0.0033688408,0.00007678466,0.0018189104,0.0015049924,0.5096255],"genre_scores_gemma":[0.8952277,0.0042321584,0.037774004,0.0051460173,0.002973579,0.00010260653,0.0014228433,0.00038097473,0.052740134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713373,0.00060810405,0.00008573429,0.00061356876,0.0010355123,0.0005233842],"domain_scores_gemma":[0.99478614,0.0025527102,0.00028788927,0.0011675862,0.00076456444,0.000441111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017624451,0.0006611742,0.0008179769,0.0009226838,0.0023208715,0.004752752,0.0011899547,0.0022359288,0.015839087],"category_scores_gemma":[0.008725066,0.0006364887,0.0006126629,0.0012067857,0.0034796789,0.007212902,0.0026137214,0.003563359,0.003747809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010982157,0.000028202227,0.00041607156,0.000118726086,0.000012206773,0.000059346763,0.00013068727,0.003289337,0.0009629086,0.9537308,0.02108407,0.02005784],"study_design_scores_gemma":[0.000016791271,0.000022520433,0.00018971461,0.000041451054,0.000006668401,0.00012548748,0.000080493715,0.0056640725,0.0009298828,0.9666454,0.026261356,0.000016194987],"about_ca_topic_score_codex":0.0014360073,"about_ca_topic_score_gemma":0.0016480647,"teacher_disagreement_score":0.015839087,"about_ca_system_score_codex":0.0016307739,"about_ca_system_score_gemma":0.0010996918,"threshold_uncertainty_score":0.05298704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16534662,0.013141633,0.2721756,0.03294113,0.0033688408,0.00007678466,0.0018189104,0.0015049924,0.5096255],"genre_scores_gemma":[0.8952277,0.0042321584,0.037774004,0.0051460173,0.002973579,0.00010260653,0.0014228433,0.00038097473,0.052740134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713373,0.00060810405,0.00008573429,0.00061356876,0.0010355123,0.0005233842],"domain_scores_gemma":[0.99478614,0.0025527102,0.00028788927,0.0011675862,0.00076456444,0.000441111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017624451,0.0006611742,0.0008179769,0.0009226838,0.0023208715,0.004752752,0.0011899547,0.0022359288,0.015839087],"category_scores_gemma":[0.008725066,0.0006364887,0.0006126629,0.0012067857,0.0034796789,0.007212902,0.0026137214,0.003563359,0.003747809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010982157,0.000028202227,0.00041607156,0.000118726086,0.000012206773,0.000059346763,0.00013068727,0.003289337,0.0009629086,0.9537308,0.02108407,0.02005784],"study_design_scores_gemma":[0.000016791271,0.000022520433,0.00018971461,0.000041451054,0.000006668401,0.00012548748,0.000080493715,0.0056640725,0.0009298828,0.9666454,0.026261356,0.000016194987],"about_ca_topic_score_codex":0.0014360073,"about_ca_topic_score_gemma":0.0016480647,"teacher_disagreement_score":0.015839087,"about_ca_system_score_codex":0.0016307739,"about_ca_system_score_gemma":0.0010996918,"threshold_uncertainty_score":0.05298704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4007093,0.0005614103,0.58020014,0.00035590844,0.00014750128,0.00013696351,0.0001103004,0.0012776678,0.016500706],"genre_scores_gemma":[0.91135937,0.00018370536,0.08436721,0.000094085306,0.000021250517,0.00005231689,0.000056679935,0.000013310287,0.0038520396],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999229,0.000010945944,0.0000042399897,0.00001818766,0.000030915216,0.000012809901],"domain_scores_gemma":[0.9999366,0.000012845995,0.000011212889,0.000007043443,0.000025617552,0.0000066476377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083841194,0.00015516144,0.00009378282,0.00021033984,0.00022898258,0.00034868787,0.00050365424,0.0002217481,0.0007504266],"category_scores_gemma":[0.00012486715,0.00007727872,0.00012144446,0.00016779428,0.00017471451,0.00028297244,0.00015945484,0.0002327057,0.00012925646],"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.00025125072,0.00017612927,0.0016350687,0.00016532911,0.0000562283,0.00049329305,0.00019043041,0.057786018,0.74891293,0.06909869,0.0023720206,0.118862644],"study_design_scores_gemma":[0.00008569464,0.001032488,0.0016099021,0.00003175126,0.00009833375,0.0007161295,0.0000781009,0.7567823,0.21069352,0.011487465,0.017330162,0.00005414552],"about_ca_topic_score_codex":0.0010203501,"about_ca_topic_score_gemma":0.0017073781,"teacher_disagreement_score":0.0010203501,"about_ca_system_score_codex":0.00045270234,"about_ca_system_score_gemma":0.00035772912,"threshold_uncertainty_score":0.0032845736},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04025009,0.014980042,0.42713904,0.0033838828,0.0035017394,0.0003086947,0.0024010383,0.0007471919,0.5072883],"genre_scores_gemma":[0.5287807,0.019860424,0.27590263,0.0032360246,0.002448335,0.00080594514,0.0041143694,0.00064121914,0.1642103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987992,0.000260239,0.000083492894,0.00032906584,0.0003624823,0.00016561688],"domain_scores_gemma":[0.9987477,0.00046719442,0.00012752581,0.00012416983,0.00043589398,0.00009747968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008137713,0.0009304588,0.0006158319,0.0023135582,0.0018664799,0.0029204187,0.0005934796,0.0009024483,0.025332488],"category_scores_gemma":[0.0036968677,0.00037353646,0.0006525241,0.002455581,0.002548738,0.0035656963,0.0014693016,0.0016211477,0.006727117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029673996,0.000010339828,0.00010854887,0.000117956755,0.0000073365336,0.00008737291,0.00018119806,0.0004947152,0.0011629179,0.96065867,0.007014614,0.030126631],"study_design_scores_gemma":[0.000013362708,0.00004327181,0.00019407162,0.0001231933,0.000013663872,0.00044289712,0.00016956066,0.002016876,0.0030568675,0.77650535,0.21738899,0.000031890086],"about_ca_topic_score_codex":0.000865064,"about_ca_topic_score_gemma":0.00092224346,"teacher_disagreement_score":0.025332488,"about_ca_system_score_codex":0.0018552048,"about_ca_system_score_gemma":0.0011004212,"threshold_uncertainty_score":0.084745586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004637966,0.0016636222,0.0023149601,0.22545637,0.0148007395,0.00045757115,0.010155302,0.001368515,0.73914486],"genre_scores_gemma":[0.006953932,0.00047196515,0.00050635164,0.020161092,0.00021025597,0.00004143377,0.0011521303,0.00014019149,0.9703627],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793565,0.00006930933,0.000023725705,0.000120216595,0.0012831776,0.0005680691],"domain_scores_gemma":[0.99612576,0.00031800717,0.000038287842,0.00010647051,0.0024530126,0.00095859705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013067593,0.0007118084,0.00035381145,0.0011556041,0.007399293,0.004713081,0.0010784279,0.007999115,0.09881522],"category_scores_gemma":[0.003911831,0.00046785132,0.0006411169,0.00076565484,0.0013290371,0.0019473966,0.0012091565,0.0055844677,0.01510377],"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.000017360506,0.000018224513,0.00032265912,0.000014024684,0.0000032037356,0.000052179428,0.000024749006,0.00006164855,0.00016683235,0.0043830094,0.9898633,0.0050729103],"study_design_scores_gemma":[0.000016270993,0.000015030108,0.001260661,0.00003102785,0.0000060094208,0.000027349017,0.00034251116,0.00029929864,0.0004543093,0.0013087814,0.99622333,0.000015501064],"about_ca_topic_score_codex":0.7987742,"about_ca_topic_score_gemma":0.92065483,"teacher_disagreement_score":0.20122582,"about_ca_system_score_codex":0.012611528,"about_ca_system_score_gemma":0.058063034,"threshold_uncertainty_score":0.4048217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8346049,0.00090908055,0.1001723,0.0005673467,0.00014232595,0.00018336692,0.0006081026,0.0003234494,0.062489014],"genre_scores_gemma":[0.9760393,0.00019488015,0.01733458,0.0001033748,0.00005020626,0.000079395315,0.00037283043,0.00003293254,0.005792514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996099,0.00005599639,0.000026016065,0.00010107101,0.00008041854,0.00012663008],"domain_scores_gemma":[0.9988563,0.00039717922,0.000242581,0.00011250198,0.0001813512,0.00021007874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002457148,0.00033727498,0.00031452972,0.0010610688,0.0012532675,0.0010235528,0.0004857287,0.00064479635,0.008389846],"category_scores_gemma":[0.0019200068,0.0002932649,0.00033585582,0.00056843826,0.00094962236,0.0013137107,0.0010783615,0.00061385555,0.00064266863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000292303,0.00007055333,0.0045011137,0.0002352765,0.0000357843,0.0008129601,0.000841575,0.009695434,0.02002909,0.93588597,0.0037690941,0.023830825],"study_design_scores_gemma":[0.0001331952,0.00033426468,0.0031655633,0.00011778168,0.000045993293,0.0011963448,0.0010020282,0.061192043,0.022183567,0.8850776,0.025434315,0.00011728144],"about_ca_topic_score_codex":0.0018881758,"about_ca_topic_score_gemma":0.0028095853,"teacher_disagreement_score":0.008389846,"about_ca_system_score_codex":0.00072098745,"about_ca_system_score_gemma":0.0007917612,"threshold_uncertainty_score":0.028066874},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011861526,0.005420379,0.000372107,0.11723043,0.8584727,0.000049890405,0.00047919806,0.00019070235,0.017665999],"genre_scores_gemma":[0.002194473,0.0086490465,0.00078320893,0.1348362,0.59010583,0.00010090114,0.0006031771,0.0003275932,0.26239955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99671113,0.00028597578,0.0003352997,0.0007576144,0.0015813647,0.00032858652],"domain_scores_gemma":[0.9873083,0.002088577,0.00057851465,0.0006118453,0.0067883395,0.0026244451],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033556754,0.0014557227,0.0013623579,0.0014027255,0.0017875911,0.005730771,0.0026659425,0.0064494987,0.1466244],"category_scores_gemma":[0.02051118,0.0004850862,0.001280862,0.0011576749,0.00084095675,0.0046613556,0.0019972087,0.0073790303,0.08431534],"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.00001137539,0.000005207378,0.000024459276,0.000052773725,0.0000020816353,0.00003296847,0.000010429004,0.000008404959,0.000047809037,0.00039562484,0.99189514,0.0075136893],"study_design_scores_gemma":[0.00000615682,0.0000062195527,0.000072941024,0.000051829036,0.000002295054,0.00006185284,0.000019257915,0.000019302672,0.000048912127,0.0002778266,0.9994294,0.0000039764236],"about_ca_topic_score_codex":0.001382929,"about_ca_topic_score_gemma":0.0033100354,"teacher_disagreement_score":0.8533756,"about_ca_system_score_codex":0.0015990919,"about_ca_system_score_gemma":0.0039840406,"threshold_uncertainty_score":0.49050748},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22532515,0.0041626366,0.21534948,0.008833296,0.0015219736,0.00008109493,0.00058170257,0.0002998229,0.5438448],"genre_scores_gemma":[0.9036391,0.0017767237,0.03125617,0.0018333571,0.0008352174,0.00007816935,0.00032454013,0.00008503948,0.060171768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958843,0.00013407986,0.000021632708,0.00007742584,0.00010128941,0.000077062956],"domain_scores_gemma":[0.9995153,0.00017321022,0.000054583645,0.00007691972,0.000108552944,0.000071494476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626153,0.00030240143,0.00035863987,0.0010814113,0.0020835309,0.0027981927,0.00046735498,0.00077460083,0.005456368],"category_scores_gemma":[0.0013316377,0.00019748324,0.0006369514,0.0009673619,0.0037534821,0.004150936,0.0013250925,0.0015051285,0.0011303325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050883937,0.0000020215193,0.000027419173,0.0000061392257,7.9557617e-7,0.000023804025,0.00006830574,0.00009268775,0.00012079173,0.99846554,0.00034970316,0.0008376947],"study_design_scores_gemma":[0.0000059453023,0.0000066292578,0.000064122985,0.000008524622,0.0000018641331,0.000051863197,0.000039226874,0.00085000333,0.00016904132,0.9890553,0.009742256,0.0000052065607],"about_ca_topic_score_codex":0.0015144229,"about_ca_topic_score_gemma":0.0012841974,"teacher_disagreement_score":0.005456368,"about_ca_system_score_codex":0.00200472,"about_ca_system_score_gemma":0.0007527938,"threshold_uncertainty_score":0.018253326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005588543,0.0004313478,0.0021465798,0.003911457,0.0014819093,0.00007176362,0.0018920733,0.0041018585,0.9854043],"genre_scores_gemma":[0.0016957263,0.0002114314,0.00047628128,0.0006979902,0.0001119371,0.00001383797,0.0007051114,0.00031697293,0.99577075],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996352,0.000025870157,0.000006676361,0.000052202366,0.00022194989,0.000057974125],"domain_scores_gemma":[0.9989208,0.00015326272,0.00004272813,0.00007712614,0.00049564155,0.00031042378],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046336954,0.0006195132,0.00047304493,0.0008647763,0.0011203688,0.0025407402,0.00062720507,0.0016492923,0.7167396],"category_scores_gemma":[0.0015122441,0.00029938135,0.00026682846,0.00061858364,0.00027437095,0.0013313175,0.00078451977,0.0010894098,0.59984475],"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.000027747748,0.000026202284,0.0000811889,0.000024017936,0.0000010966077,0.000017784489,0.000011021872,0.00003202005,0.00039080458,0.0012882716,0.9710296,0.027070386],"study_design_scores_gemma":[0.000013791094,0.000024508778,0.00024904296,0.000019981557,0.0000034713569,0.000046311736,0.00005053485,0.0003887292,0.00040520963,0.00077292847,0.99802005,0.000005422143],"about_ca_topic_score_codex":0.0045782696,"about_ca_topic_score_gemma":0.01845054,"teacher_disagreement_score":0.7167396,"about_ca_system_score_codex":0.00056300446,"about_ca_system_score_gemma":0.00079966895,"threshold_uncertainty_score":0.40403658},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43532896,0.0033013404,0.001693392,0.013916786,0.0011472027,0.0008782543,0.0775481,0.00039665986,0.4657893],"genre_scores_gemma":[0.38688794,0.004829334,0.00086659705,0.0023000715,0.0002722467,0.00030396113,0.012974954,0.00009940403,0.59146553],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989635,0.000113408176,0.00004452621,0.00006517299,0.0006186393,0.00019475477],"domain_scores_gemma":[0.99383473,0.0013460648,0.00073064613,0.00020283605,0.0031611435,0.0007245638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007743635,0.0003268836,0.00013271466,0.003221809,0.0030180023,0.000990649,0.00045740156,0.00062007527,0.030234817],"category_scores_gemma":[0.0037675754,0.00021541926,0.000119594464,0.0043127686,0.0006297139,0.00034456517,0.00069679884,0.00044992106,0.0033834248],"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.00044148078,0.0002673534,0.16086662,0.0013788232,0.00006082423,0.005458731,0.060801834,0.0009368726,0.008629784,0.004234254,0.6802319,0.07669149],"study_design_scores_gemma":[0.000011930607,0.00013057808,0.30681944,0.00022222777,0.00003132224,0.0005389971,0.06572833,0.0002715699,0.002426048,0.0002651451,0.62350094,0.00005345214],"about_ca_topic_score_codex":0.47722915,"about_ca_topic_score_gemma":0.66347975,"teacher_disagreement_score":0.5227709,"about_ca_system_score_codex":0.0027423971,"about_ca_system_score_gemma":0.0040599043,"threshold_uncertainty_score":0.9489027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8475794,0.0010798522,0.09539677,0.00038535442,0.00020365689,0.000049146976,0.0004406633,0.00017808932,0.054687075],"genre_scores_gemma":[0.98274004,0.0003623283,0.013665942,0.000048483194,0.000060583312,0.000025550531,0.00018599251,0.000049551076,0.0028615145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958724,0.00007914241,0.000017093222,0.000072878065,0.00014496877,0.0000987125],"domain_scores_gemma":[0.99832875,0.0007626059,0.00024769123,0.00015465159,0.00029619838,0.00021007756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060521247,0.00046789434,0.0004549779,0.0026654569,0.001066577,0.0013961643,0.00062527665,0.0004940006,0.0047518522],"category_scores_gemma":[0.00298867,0.00024778084,0.00024717703,0.0015258532,0.001342998,0.0013017718,0.00073079235,0.000973304,0.00055868435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029473184,0.00009889175,0.0049283956,0.00016177673,0.00004527508,0.00022526845,0.0003784641,0.036257617,0.032597095,0.8865092,0.003906829,0.034596436],"study_design_scores_gemma":[0.00005243706,0.00016154464,0.006120989,0.000121103316,0.00004857638,0.0004722843,0.00029081473,0.2151041,0.024242727,0.7445678,0.008715869,0.00010173045],"about_ca_topic_score_codex":0.0018049197,"about_ca_topic_score_gemma":0.0030384848,"teacher_disagreement_score":0.0047518522,"about_ca_system_score_codex":0.0012907868,"about_ca_system_score_gemma":0.0006220188,"threshold_uncertainty_score":0.015896559},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07691769,0.0024660018,0.8876833,0.0031276334,0.00010113305,0.00009116783,0.00034050154,0.00019289373,0.029079711],"genre_scores_gemma":[0.90242946,0.0028691862,0.055445347,0.00033176568,0.0002754122,0.00027792377,0.00027284838,0.00015853798,0.03793958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993771,0.0002635625,0.00001916746,0.00008739002,0.00013542073,0.00011739566],"domain_scores_gemma":[0.99755484,0.0017100353,0.00033191562,0.00008427566,0.00016908157,0.00014984782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021068058,0.001024486,0.0011466127,0.00093010074,0.00041900313,0.0023919563,0.0014059949,0.0023878033,0.003914924],"category_scores_gemma":[0.0064477753,0.00084643584,0.00090428087,0.0010522221,0.0013518255,0.0023298108,0.001177598,0.0018181741,0.0005988346],"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.000020803524,0.000033690798,0.0007431876,0.000028497483,0.000021709247,0.00006643055,0.000033821532,0.9208275,0.00043952675,0.07271556,0.0010512404,0.004018008],"study_design_scores_gemma":[0.0000041807125,0.000005553862,0.0001227286,0.000004587141,0.000004349916,0.00001387697,0.0000046930436,0.982643,0.000040023362,0.01687763,0.00027510765,0.0000043266887],"about_ca_topic_score_codex":0.0060144523,"about_ca_topic_score_gemma":0.0034706776,"teacher_disagreement_score":0.0060144523,"about_ca_system_score_codex":0.0019990192,"about_ca_system_score_gemma":0.0012386952,"threshold_uncertainty_score":0.014503956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9248947,0.0015407531,0.04653064,0.000538593,0.0001026608,0.000040142055,0.0018245727,0.00090697466,0.023621034],"genre_scores_gemma":[0.99064636,0.00017666427,0.0061646984,0.000078765086,0.000012216636,0.000011360419,0.00021315145,0.000043474076,0.00265343],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973065,0.000049867747,0.0000048210677,0.0000779142,0.00009385242,0.000042902022],"domain_scores_gemma":[0.99957114,0.00016735657,0.000063699066,0.000047782527,0.00008922611,0.000060736067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040574372,0.00027815346,0.00020031864,0.0006413819,0.00038789486,0.0006555804,0.0004751352,0.0006468645,0.0024498506],"category_scores_gemma":[0.00067909696,0.00019116738,0.00016200733,0.000558808,0.0004395596,0.00040043966,0.00037811897,0.00034130385,0.00063602964],"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.0010734901,0.000085476626,0.022286963,0.00014712145,0.00009470888,0.00022814795,0.00039569737,0.0016034581,0.93838876,0.011424104,0.0018736316,0.022398455],"study_design_scores_gemma":[0.000034318324,0.00036715117,0.022675976,0.000022030394,0.00007670993,0.00053172046,0.0002107419,0.010207337,0.95471627,0.0017967648,0.009312977,0.00004801786],"about_ca_topic_score_codex":0.0012367718,"about_ca_topic_score_gemma":0.001696907,"teacher_disagreement_score":0.0024498506,"about_ca_system_score_codex":0.00068225345,"about_ca_system_score_gemma":0.0003681721,"threshold_uncertainty_score":0.008195519},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9739768,0.0005776135,0.016752187,0.00012651375,0.000035723257,0.00014272252,0.0001763637,0.00028104815,0.0079309875],"genre_scores_gemma":[0.98975533,0.0002488951,0.007751156,0.000027007973,0.000023502154,0.000030571722,0.00013789174,0.00001951979,0.0020061417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839646,0.0005557244,0.00005473442,0.00010921051,0.00062441913,0.00025953513],"domain_scores_gemma":[0.9942872,0.003208164,0.00021737946,0.00040628566,0.0016461648,0.00023482344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021613848,0.00051622064,0.00045030034,0.0010713796,0.00074966496,0.00075482845,0.0007089485,0.0004713644,0.0027612203],"category_scores_gemma":[0.0054779733,0.00014824628,0.00014780716,0.00123909,0.0005218566,0.0008193869,0.0005310661,0.0003294927,0.00026064625],"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.012973637,0.0028529938,0.018193448,0.0004089109,0.00020931686,0.00045966846,0.0002775964,0.6257376,0.037292123,0.0052168765,0.0042931978,0.2920846],"study_design_scores_gemma":[0.0002513244,0.0025334584,0.008995163,0.000015339896,0.0001417707,0.0002235025,0.00022605514,0.9655577,0.01986778,0.0010670664,0.0010797814,0.000040894844],"about_ca_topic_score_codex":0.032500405,"about_ca_topic_score_gemma":0.032162018,"teacher_disagreement_score":0.032500405,"about_ca_system_score_codex":0.0021667546,"about_ca_system_score_gemma":0.0019722953,"threshold_uncertainty_score":0.06462246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21037704,0.0034692243,0.56287235,0.01180861,0.0008273572,0.0007653744,0.0028831838,0.00063415954,0.20636271],"genre_scores_gemma":[0.6990963,0.0045902426,0.22800775,0.002494281,0.0011101445,0.00076244853,0.004071827,0.0004944848,0.05937248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983779,0.0005622874,0.00006987889,0.00034874186,0.00024951767,0.0003916019],"domain_scores_gemma":[0.99399155,0.0047621285,0.00029207897,0.00030349754,0.000313436,0.0003372965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016616161,0.001371409,0.001217912,0.0010115159,0.0021735148,0.0024615629,0.0018572834,0.0024991063,0.017404508],"category_scores_gemma":[0.010745915,0.000765075,0.00095817226,0.0017000093,0.002550118,0.007923494,0.0025854537,0.0029149044,0.0016525367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043637163,0.00017436389,0.0007037421,0.00039759057,0.000059271224,0.0003312342,0.00035346724,0.06777261,0.0017963137,0.84759337,0.03341983,0.04696181],"study_design_scores_gemma":[0.00014183293,0.00006531297,0.00022407279,0.00007049143,0.000027537659,0.00014669835,0.00022252803,0.085615315,0.0008540131,0.9032629,0.009326955,0.000042329135],"about_ca_topic_score_codex":0.00834036,"about_ca_topic_score_gemma":0.008646752,"teacher_disagreement_score":0.017404508,"about_ca_system_score_codex":0.0023715578,"about_ca_system_score_gemma":0.0021550201,"threshold_uncertainty_score":0.058223844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7633713,0.00047324627,0.16569157,0.00086346874,0.00017225555,0.00013971009,0.00087841944,0.00048098929,0.067929015],"genre_scores_gemma":[0.9602041,0.00027962629,0.025646264,0.00022731072,0.0000452347,0.00014345416,0.00082603435,0.000120807876,0.012507272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996124,0.0000690867,0.00001652456,0.000105248735,0.000100935154,0.00009581517],"domain_scores_gemma":[0.9984377,0.0005586369,0.0002982547,0.00018446732,0.00023668505,0.00028422475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027861394,0.00045943444,0.00025156644,0.0010573575,0.0009156234,0.0011437774,0.00047042803,0.0007403476,0.0040653623],"category_scores_gemma":[0.0017286119,0.00039539175,0.00042208497,0.0005592934,0.0011837493,0.0010883969,0.0009667465,0.0013406058,0.00052179047],"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.00017240517,0.000049957336,0.0012471518,0.00009495211,0.000013319116,0.00079238,0.0005625842,0.0035342148,0.012039438,0.9653658,0.0025193049,0.013608477],"study_design_scores_gemma":[0.00007440554,0.000104697116,0.0029263555,0.00007843501,0.000031729345,0.0023098744,0.0005163426,0.031461716,0.014103326,0.9297936,0.01852185,0.000077650555],"about_ca_topic_score_codex":0.0007028402,"about_ca_topic_score_gemma":0.0011476781,"teacher_disagreement_score":0.0040653623,"about_ca_system_score_codex":0.0005204151,"about_ca_system_score_gemma":0.00045399665,"threshold_uncertainty_score":0.013599992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84143484,0.0012000687,0.076805204,0.0020704474,0.0003009158,0.0001114689,0.00047637796,0.00041877344,0.07718188],"genre_scores_gemma":[0.9830904,0.00079478836,0.0061623035,0.00032977026,0.00048029676,0.00008559386,0.00045895847,0.00012108869,0.008476857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865425,0.0003874836,0.00006147772,0.00022006173,0.00032791888,0.00034886517],"domain_scores_gemma":[0.9901417,0.0053953743,0.0016468377,0.0010497553,0.0010074787,0.0007589879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015771923,0.0006889228,0.00086879893,0.0032264935,0.0022983502,0.002795105,0.0010359056,0.0016581267,0.007387347],"category_scores_gemma":[0.01589355,0.00050868257,0.00066963444,0.0019787333,0.0038695396,0.0058748745,0.0022508458,0.0018480169,0.0009707739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030788107,0.000059977043,0.0018995926,0.00006596946,0.000019121539,0.00047437943,0.0005045461,0.0074040974,0.0037650787,0.96968764,0.0029422352,0.012869362],"study_design_scores_gemma":[0.00004893161,0.00016447448,0.0014381999,0.00005434189,0.000019758943,0.0009338263,0.0003276843,0.037367757,0.0043075057,0.9520035,0.0032685848,0.00006565018],"about_ca_topic_score_codex":0.00064993877,"about_ca_topic_score_gemma":0.00034499046,"teacher_disagreement_score":0.007387347,"about_ca_system_score_codex":0.0010207137,"about_ca_system_score_gemma":0.0006894279,"threshold_uncertainty_score":0.024713099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25138164,0.0006380117,0.66356343,0.0014791428,0.0011614825,0.000087067754,0.0005117583,0.0007321062,0.08044528],"genre_scores_gemma":[0.87136644,0.00077878596,0.059175313,0.00079057534,0.0006393509,0.00012291457,0.0004624844,0.00049385993,0.06617027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914825,0.00023912902,0.000035933295,0.00012174814,0.00029503807,0.00015986925],"domain_scores_gemma":[0.99572986,0.0015714891,0.0007515119,0.00071589026,0.00080813054,0.0004231365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020092,0.0011296517,0.0006404616,0.0021416019,0.00085100625,0.0020635996,0.0008380038,0.002308366,0.008498544],"category_scores_gemma":[0.005426341,0.00047045696,0.00049398345,0.0019326325,0.0017519156,0.001454592,0.0019603837,0.0018585348,0.003089959],"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.00007731907,0.000016475922,0.00025960503,0.000046385445,0.000008846286,0.00015432572,0.00013292473,0.008838773,0.0072275205,0.967551,0.002265011,0.013421832],"study_design_scores_gemma":[0.00002535248,0.000066730834,0.0007581492,0.00005174101,0.000013158264,0.00047688722,0.00013016662,0.113922134,0.008451976,0.86514324,0.010876366,0.00008414574],"about_ca_topic_score_codex":0.001065395,"about_ca_topic_score_gemma":0.0009797273,"teacher_disagreement_score":0.008498544,"about_ca_system_score_codex":0.00083921116,"about_ca_system_score_gemma":0.0005624187,"threshold_uncertainty_score":0.028430462},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11236156,0.00063890463,0.84535927,0.0007958283,0.0002418282,0.00023112385,0.0030776132,0.0025493975,0.034744527],"genre_scores_gemma":[0.49824244,0.0009631293,0.47505695,0.00037880702,0.00019441379,0.00045963202,0.0068506957,0.0009754995,0.016878476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986695,0.0002701045,0.00012726725,0.00028327288,0.00040329978,0.0002464744],"domain_scores_gemma":[0.9972904,0.0012122757,0.00025653487,0.0005265883,0.0005556563,0.00015850982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067026616,0.0007661033,0.0004751522,0.0013125589,0.0007145491,0.0019546566,0.0011857384,0.0005694225,0.005923427],"category_scores_gemma":[0.0051355534,0.0005073729,0.0008184758,0.002138074,0.0011256293,0.0041455445,0.0016315761,0.0019512093,0.0010080588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001622601,0.00011422108,0.0011778096,0.00024072944,0.000017364848,0.00021468764,0.0004161114,0.021783942,0.0047838073,0.8084626,0.008363649,0.15426287],"study_design_scores_gemma":[0.00003066317,0.0000563754,0.00034556093,0.000085892156,0.00003123677,0.00019344747,0.00021862637,0.072005205,0.0068389266,0.8925557,0.027602257,0.000036111203],"about_ca_topic_score_codex":0.0028762699,"about_ca_topic_score_gemma":0.003712944,"teacher_disagreement_score":0.005923427,"about_ca_system_score_codex":0.0019298807,"about_ca_system_score_gemma":0.0011367293,"threshold_uncertainty_score":0.019815803},"labels":[],"label_agreement":null},{"id":"W7117447460","doi":"10.1002/jcd.70000","title":"Recursive and Cyclic Constructions for Double‐Change Covering Designs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Construct (python library); Block (permutation group theory); Block design; Block size; Order (exchange)","score_opus":0.03945158606277906,"score_gpt":0.2684919453883778,"score_spread":0.22904035932559874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117447460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31526116,0.00022774786,0.65614295,0.00013340746,0.000056489083,0.00015332864,0.00021084135,0.000488791,0.027325196],"genre_scores_gemma":[0.70286,0.00009644353,0.2912733,0.00009779054,0.000025908455,0.00021764044,0.00032057878,0.00007820663,0.0050301766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993585,0.00017342535,0.00004285972,0.00010311619,0.00020076045,0.000121371326],"domain_scores_gemma":[0.99873203,0.00053016935,0.00015790369,0.00027731573,0.00024001965,0.00006261466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055259216,0.0003055985,0.000238486,0.0007014541,0.00047922143,0.000517921,0.00050965033,0.0004036258,0.0031261737],"category_scores_gemma":[0.001638732,0.0002833404,0.00045376082,0.00046230337,0.00060617883,0.0005875167,0.00067165797,0.00051639555,0.000421107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029249708,0.00016478273,0.0030111223,0.0002761595,0.000036271358,0.0004635624,0.0006376649,0.051880598,0.13242157,0.6220459,0.003489795,0.1852802],"study_design_scores_gemma":[0.00019188365,0.0012178137,0.004211189,0.00018506017,0.00011768628,0.002031473,0.00035661078,0.35994923,0.20178598,0.33027253,0.09953652,0.00014415717],"about_ca_topic_score_codex":0.00052550115,"about_ca_topic_score_gemma":0.00091867836,"teacher_disagreement_score":0.0031261737,"about_ca_system_score_codex":0.00058584975,"about_ca_system_score_gemma":0.00036455184,"threshold_uncertainty_score":0.010458112},"labels":[],"label_agreement":null},{"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030095011,0.005197402,0.27570817,0.015200337,0.0070031323,0.00011123477,0.0005675064,0.0031082644,0.6630089],"genre_scores_gemma":[0.5683197,0.003584357,0.2065931,0.0076795365,0.0016955492,0.00027795183,0.0005352876,0.003946709,0.20736787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988488,0.00045917052,0.000030941326,0.0001870683,0.00032598982,0.00014798096],"domain_scores_gemma":[0.9983485,0.0006800347,0.000092210335,0.0004918825,0.00024185561,0.00014550505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089183945,0.00063244364,0.00051478506,0.0011135071,0.0020124633,0.0048161433,0.0007824121,0.0015014389,0.04823053],"category_scores_gemma":[0.00847934,0.0005577456,0.0005708258,0.0012567946,0.005517648,0.005446438,0.0021009413,0.0031536075,0.008999507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120439254,0.000012456643,0.00025930436,0.00006530295,0.000007828738,0.00012633955,0.00063681346,0.0013665365,0.0028386754,0.9123247,0.04504601,0.037195507],"study_design_scores_gemma":[0.0000343464,0.000045992572,0.00035649593,0.000109094246,0.00000771558,0.0005739542,0.00054355717,0.0051017185,0.0036392298,0.6667928,0.32274142,0.00005363392],"about_ca_topic_score_codex":0.0015645288,"about_ca_topic_score_gemma":0.0015174247,"teacher_disagreement_score":0.04823053,"about_ca_system_score_codex":0.0011691098,"about_ca_system_score_gemma":0.0005547521,"threshold_uncertainty_score":0.16134721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94843054,0.00030100378,0.034719672,0.00022994685,0.000023835271,0.000043620697,0.00017233855,0.00008967063,0.015989425],"genre_scores_gemma":[0.98561656,0.00010615759,0.01129021,0.00005153945,0.000024190103,0.000051771185,0.00019069518,0.000020617324,0.0026482916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995914,0.00007841079,0.00002750111,0.00010036222,0.00010066263,0.00010161752],"domain_scores_gemma":[0.9978052,0.0010752139,0.00044115374,0.00017219555,0.00021001685,0.000296191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034861354,0.00031407573,0.00037812334,0.0013587271,0.0013850987,0.0014407933,0.00046177796,0.0006608907,0.002525976],"category_scores_gemma":[0.003006506,0.00041827463,0.00031051485,0.0005407198,0.0017575584,0.0014846079,0.0012177118,0.0005541571,0.0002644478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010973279,0.00016468953,0.014063691,0.00034840062,0.00006943988,0.0023546396,0.0025830946,0.057359498,0.079206,0.80540246,0.004383959,0.032966774],"study_design_scores_gemma":[0.00018725696,0.00023243354,0.0066503645,0.00010942327,0.00005762276,0.0019959088,0.0021907561,0.1124747,0.03657589,0.82814413,0.011301658,0.00007992776],"about_ca_topic_score_codex":0.0011282756,"about_ca_topic_score_gemma":0.0012901593,"teacher_disagreement_score":0.002525976,"about_ca_system_score_codex":0.0007595996,"about_ca_system_score_gemma":0.0004218698,"threshold_uncertainty_score":0.00845027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66638404,0.001114045,0.24897602,0.0016735771,0.00020503216,0.00015477055,0.0025344861,0.00047100906,0.07848701],"genre_scores_gemma":[0.92717505,0.00062763016,0.05563495,0.00030301552,0.00006875108,0.00012671563,0.0013041805,0.00010862808,0.014651113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955183,0.00013740585,0.00002797347,0.00008739688,0.000102135025,0.00009326099],"domain_scores_gemma":[0.9968041,0.00183934,0.0004228011,0.0002659604,0.00035035601,0.00031744534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036748286,0.00037964288,0.00030796262,0.0016098215,0.00084643264,0.0012910186,0.0006441606,0.000710943,0.006847366],"category_scores_gemma":[0.0050169067,0.00042184163,0.00018906532,0.0011590668,0.0005883508,0.0017697429,0.0007945184,0.001009399,0.0008970739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029848493,0.0001119924,0.0022540893,0.0002512975,0.000027557537,0.00041815705,0.0004773835,0.03500482,0.013854275,0.8896243,0.009975259,0.04770243],"study_design_scores_gemma":[0.000047317382,0.00005798818,0.0020252531,0.00009734978,0.00001980032,0.00046289628,0.00031072483,0.09231753,0.0067578875,0.88489264,0.0129827745,0.00002790866],"about_ca_topic_score_codex":0.00064642844,"about_ca_topic_score_gemma":0.0017496838,"teacher_disagreement_score":0.006847366,"about_ca_system_score_codex":0.000982833,"about_ca_system_score_gemma":0.00040780474,"threshold_uncertainty_score":0.022906661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18853545,0.010646393,0.5420609,0.056180626,0.0014569161,0.0001772648,0.0009067198,0.001871016,0.19816472],"genre_scores_gemma":[0.852869,0.0033249836,0.10276048,0.004154058,0.0019723724,0.00038998635,0.00044064695,0.00037417127,0.033714276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956772,0.0013558593,0.00023047309,0.00090859004,0.0012302,0.00059768604],"domain_scores_gemma":[0.97931653,0.011587744,0.000977434,0.004378141,0.0025711758,0.0011691069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004152957,0.00055045966,0.0014521449,0.0018643813,0.0035359112,0.0050006206,0.002270391,0.004198303,0.010566091],"category_scores_gemma":[0.02518299,0.00064965175,0.0008328378,0.001437431,0.0068329093,0.012376432,0.00435188,0.004684485,0.0023070814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008243909,0.000036343263,0.0008881017,0.000097590484,0.0000068341174,0.00009285667,0.00034641617,0.003358713,0.00119412,0.9547903,0.004548455,0.034557834],"study_design_scores_gemma":[0.000017533805,0.00005027073,0.00034304243,0.000064051026,0.0000032959845,0.00032021024,0.00036628777,0.012154298,0.002182166,0.9612074,0.023257218,0.000034127854],"about_ca_topic_score_codex":0.00080243184,"about_ca_topic_score_gemma":0.0005349383,"teacher_disagreement_score":0.010566091,"about_ca_system_score_codex":0.0019242218,"about_ca_system_score_gemma":0.0010053861,"threshold_uncertainty_score":0.035347104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60178995,0.0043319305,0.09773979,0.0066169747,0.00073301996,0.00017032743,0.0012306639,0.0005139303,0.28687328],"genre_scores_gemma":[0.9583809,0.0011534267,0.021015344,0.0005671261,0.00042208703,0.00014823447,0.00045397592,0.000082569844,0.017776363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886924,0.00016482503,0.00006075805,0.00026806636,0.00034405646,0.0002931019],"domain_scores_gemma":[0.9971739,0.0014857624,0.00040243723,0.00034094218,0.00029018262,0.00030685365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013900198,0.0007906586,0.00056747114,0.0026639793,0.002587231,0.0026442562,0.0015585382,0.0014627562,0.009128233],"category_scores_gemma":[0.00901653,0.0004950032,0.0008406834,0.003171843,0.0032596022,0.007286546,0.0023162344,0.0023497283,0.0009831768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005067047,0.00002913359,0.0011445974,0.00005126184,0.000014377459,0.00010090894,0.0002723019,0.0016868684,0.0005879745,0.9831079,0.0034920506,0.0094619235],"study_design_scores_gemma":[0.000022862048,0.00002175572,0.0007587156,0.000025305357,0.000015641048,0.00027651756,0.00015073335,0.0053723594,0.0010423976,0.9772349,0.0150486445,0.000030118475],"about_ca_topic_score_codex":0.0030561308,"about_ca_topic_score_gemma":0.0020754249,"teacher_disagreement_score":0.009128233,"about_ca_system_score_codex":0.002896822,"about_ca_system_score_gemma":0.0012126247,"threshold_uncertainty_score":0.03053701},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18312544,0.002448933,0.2383803,0.0027588487,0.0012235214,0.00024270103,0.0018608312,0.0011883944,0.568771],"genre_scores_gemma":[0.7982927,0.0017363192,0.065517336,0.0015995724,0.00056694425,0.00020285278,0.0015314067,0.00030784978,0.13024496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937767,0.00015199688,0.000024143317,0.00011272634,0.00016534876,0.00016805262],"domain_scores_gemma":[0.99816954,0.0006478295,0.00031321612,0.0002788673,0.0003477361,0.00024289207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039794573,0.0005902236,0.00049454666,0.0020147036,0.0014458968,0.0022641777,0.00077468605,0.0011419142,0.021348853],"category_scores_gemma":[0.0027319605,0.00032917026,0.0004301909,0.0011257934,0.0010758548,0.0020125608,0.0010517021,0.0013508564,0.004571494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047423808,0.000040675768,0.00021776126,0.000056525296,0.000012797024,0.00020728099,0.0000890011,0.0014671393,0.0023842358,0.97204596,0.009497367,0.0139338095],"study_design_scores_gemma":[0.000020612253,0.000021884034,0.00040491825,0.000038434864,0.000016569298,0.00037108126,0.00009259557,0.011366728,0.0019137703,0.94707394,0.03865833,0.00002115869],"about_ca_topic_score_codex":0.0016091657,"about_ca_topic_score_gemma":0.0032732468,"teacher_disagreement_score":0.021348853,"about_ca_system_score_codex":0.0011020204,"about_ca_system_score_gemma":0.0007674456,"threshold_uncertainty_score":0.07141906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15597694,0.0011220041,0.5286989,0.0015185226,0.00068876357,0.00021475536,0.00090639765,0.0019140225,0.3089597],"genre_scores_gemma":[0.7292571,0.00072812184,0.13646314,0.0005738586,0.00027078934,0.0003323566,0.0005336991,0.00039649106,0.13144438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838173,0.0004973522,0.00008428698,0.00028160497,0.0004208401,0.00033421456],"domain_scores_gemma":[0.9983658,0.0005065062,0.00017623654,0.00041173294,0.00039216634,0.00014759447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021673,0.0006593798,0.0004978421,0.0013504191,0.0019997614,0.0026183235,0.000905837,0.0010198837,0.02302304],"category_scores_gemma":[0.002813742,0.00043974546,0.00056168804,0.0011731951,0.0014750803,0.0032918686,0.002391318,0.0013041178,0.0074447743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018252822,0.00004073905,0.00033536972,0.00010124581,0.000017976856,0.00013156922,0.0002476399,0.0017836979,0.004520776,0.9530396,0.00505182,0.034546945],"study_design_scores_gemma":[0.000066889814,0.000108925604,0.00033062542,0.000082684426,0.000028036664,0.00031856124,0.00021904941,0.009276954,0.010167653,0.9313784,0.047983326,0.00003889351],"about_ca_topic_score_codex":0.00060415803,"about_ca_topic_score_gemma":0.0012095141,"teacher_disagreement_score":0.02302304,"about_ca_system_score_codex":0.0013190743,"about_ca_system_score_gemma":0.00083660154,"threshold_uncertainty_score":0.07701975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028409828,0.037154917,0.5120599,0.0098461425,0.002347953,0.00015014964,0.00048895885,0.00043369248,0.40910843],"genre_scores_gemma":[0.60974705,0.035475973,0.258646,0.005171658,0.0072350125,0.00064099726,0.0006375411,0.0003639908,0.08208171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990596,0.00042784534,0.000043335516,0.000120805526,0.0002522052,0.000096118194],"domain_scores_gemma":[0.9976891,0.0015997464,0.00012080571,0.00027522075,0.00020349942,0.00011162817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012149949,0.0009407296,0.00072219985,0.0028435923,0.0017790231,0.0026484278,0.0011907637,0.0019656518,0.010951016],"category_scores_gemma":[0.004978406,0.0006679473,0.0010329024,0.0024358518,0.0037891564,0.0036283368,0.0017788581,0.0032418624,0.0015854479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052306386,0.000011930218,0.000053019376,0.000047287638,0.000007102206,0.000051518615,0.000043011558,0.0012524495,0.00012943715,0.9880211,0.0037586063,0.0066193817],"study_design_scores_gemma":[0.000003273488,0.0000059677927,0.000041118437,0.00001805162,0.0000037013651,0.000071274575,0.000018664878,0.0031434912,0.00007519048,0.98956394,0.007051136,0.0000042238685],"about_ca_topic_score_codex":0.0006708087,"about_ca_topic_score_gemma":0.0012422003,"teacher_disagreement_score":0.010951016,"about_ca_system_score_codex":0.0018848196,"about_ca_system_score_gemma":0.00048555486,"threshold_uncertainty_score":0.036634803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48268017,0.00068135664,0.28881428,0.0011840373,0.00079418055,0.00031098185,0.0010817291,0.0014987553,0.2229545],"genre_scores_gemma":[0.8901332,0.0002028521,0.06383373,0.00030225626,0.00010969266,0.00015454517,0.00035697527,0.00013350608,0.044773217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917114,0.00022442531,0.000047519243,0.00015788816,0.00016915327,0.00022991617],"domain_scores_gemma":[0.99842346,0.00042817192,0.00026573907,0.0004346298,0.0002602215,0.00018776758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000677424,0.0004150158,0.00036855976,0.0008560181,0.0012491001,0.0020830906,0.00063244003,0.0009935157,0.018022578],"category_scores_gemma":[0.002312216,0.00025204947,0.0003406977,0.0007015694,0.00089789403,0.0014696374,0.0012702141,0.0007779214,0.002800525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008644347,0.000110499364,0.0014877273,0.0001556329,0.000034211786,0.00047481514,0.00044713766,0.0021992195,0.016434308,0.9293878,0.006465407,0.041938793],"study_design_scores_gemma":[0.00023186098,0.0004456299,0.001381151,0.000141581,0.00006833279,0.0012407425,0.00054226746,0.014861204,0.025958126,0.893546,0.06150271,0.00008043288],"about_ca_topic_score_codex":0.00034538572,"about_ca_topic_score_gemma":0.00063560635,"teacher_disagreement_score":0.018022578,"about_ca_system_score_codex":0.0007836183,"about_ca_system_score_gemma":0.00059068366,"threshold_uncertainty_score":0.06029147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76031667,0.011048165,0.1484717,0.0036191507,0.00045251552,0.000102696526,0.0012809986,0.00031614213,0.074391946],"genre_scores_gemma":[0.97052956,0.0033388734,0.020783503,0.00022071888,0.0005448064,0.000137108,0.0003687885,0.00009634892,0.003980242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998855,0.00036537356,0.000050271865,0.0002942407,0.00017125857,0.0002638887],"domain_scores_gemma":[0.9924827,0.0053766323,0.0007192232,0.00042528138,0.00038094976,0.00061516394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001606,0.00065005315,0.00079666195,0.0018591195,0.0011186661,0.0023688753,0.0010697978,0.0006815487,0.002017127],"category_scores_gemma":[0.006449709,0.0006123891,0.00042028987,0.001146954,0.0022677795,0.0028010588,0.001525724,0.001235062,0.000371432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072528474,0.000096104,0.0076772496,0.00040242774,0.000117170064,0.0008087576,0.0017955475,0.07427292,0.018920997,0.83779705,0.012607155,0.044779323],"study_design_scores_gemma":[0.000085893415,0.00015217531,0.006983026,0.00016749761,0.00009785799,0.0014430257,0.00073132815,0.1937165,0.0077597126,0.75816303,0.030608503,0.00009146743],"about_ca_topic_score_codex":0.0014299075,"about_ca_topic_score_gemma":0.00085722166,"teacher_disagreement_score":0.0023688753,"about_ca_system_score_codex":0.0017617792,"about_ca_system_score_gemma":0.00043219517,"threshold_uncertainty_score":0.012782633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023397619,0.0013895755,0.725199,0.0024881777,0.0012265141,0.00014151011,0.00046256054,0.0026357002,0.24305932],"genre_scores_gemma":[0.4511778,0.0013303265,0.37146008,0.0029817487,0.00035773136,0.0003141989,0.0004970921,0.001113334,0.17076771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991836,0.00024091401,0.000030514317,0.00016943533,0.00023434962,0.00014128798],"domain_scores_gemma":[0.9993668,0.00019116524,0.000030026178,0.00023556752,0.000112398564,0.00006407613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005401403,0.00049732416,0.0004687785,0.0010140539,0.0019786167,0.0015087783,0.0012597974,0.0010932325,0.018676518],"category_scores_gemma":[0.0024917899,0.00039453557,0.00058371533,0.0013215195,0.0019021553,0.0030438632,0.0037404152,0.0020125704,0.00534408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008440406,0.000031979605,0.00018101206,0.00013416186,0.000016834609,0.0001242746,0.00038478326,0.0011496904,0.0045197224,0.9225851,0.019357752,0.051430248],"study_design_scores_gemma":[0.000035162295,0.00005247587,0.00026542993,0.000058959038,0.000033734526,0.0003829554,0.00019210407,0.005593843,0.010903861,0.84570515,0.13672748,0.000048780268],"about_ca_topic_score_codex":0.0012045123,"about_ca_topic_score_gemma":0.0025753337,"teacher_disagreement_score":0.018676518,"about_ca_system_score_codex":0.0008212888,"about_ca_system_score_gemma":0.0007338176,"threshold_uncertainty_score":0.062479198},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28173763,0.006787941,0.25154,0.0043423106,0.0010444518,0.00021470724,0.001264504,0.0008663675,0.45220202],"genre_scores_gemma":[0.7638767,0.009229281,0.08666801,0.0029122941,0.0019633207,0.00057832274,0.002537665,0.00085807126,0.13137648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.00020592894,0.0000601882,0.00017582165,0.00032676,0.00018015377],"domain_scores_gemma":[0.9965134,0.00216604,0.0003878092,0.00037140812,0.00023772953,0.0003235302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084473856,0.0017476053,0.0016711862,0.004464241,0.0032857428,0.0048468793,0.0020391636,0.0022348172,0.026148152],"category_scores_gemma":[0.0053109154,0.0012977726,0.001747517,0.009003913,0.002781101,0.006482911,0.003401633,0.0045442972,0.0031271738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010176011,0.00009282114,0.00048043623,0.00022885154,0.000034575904,0.00025629223,0.00056982465,0.009083479,0.0014391022,0.9553136,0.008299883,0.02409929],"study_design_scores_gemma":[0.00002079413,0.000020587926,0.00033464367,0.00004259084,0.000027664059,0.0001445764,0.00013310165,0.013715661,0.0006326493,0.9733183,0.011587499,0.000021942],"about_ca_topic_score_codex":0.0027804028,"about_ca_topic_score_gemma":0.0024746116,"teacher_disagreement_score":0.026148152,"about_ca_system_score_codex":0.0020404507,"about_ca_system_score_gemma":0.00091956684,"threshold_uncertainty_score":0.08747423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68727636,0.0061529195,0.12612934,0.013062,0.0012925798,0.0003026263,0.003705697,0.00043872962,0.16163974],"genre_scores_gemma":[0.93845785,0.0024807057,0.02005422,0.0017709811,0.00074256276,0.0002006975,0.0015469254,0.0001762591,0.03456985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990381,0.00028019378,0.000054074968,0.00028781468,0.00015836293,0.0001814053],"domain_scores_gemma":[0.99309075,0.004374389,0.0014179213,0.00035084938,0.0004277966,0.00033818363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084962,0.0004235473,0.00060056214,0.0019872908,0.003152837,0.002861545,0.0007763415,0.0012975644,0.01281547],"category_scores_gemma":[0.0065400647,0.00029985807,0.0008322571,0.0020926301,0.0018991288,0.0033236549,0.0011569903,0.0015393632,0.0015176748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005184059,0.00012951346,0.0031915167,0.0006717702,0.00012407506,0.0013080232,0.0028116447,0.009538191,0.005044498,0.9082635,0.018719437,0.049679436],"study_design_scores_gemma":[0.00005954393,0.00004784553,0.0020497127,0.00009851046,0.000053608575,0.0007694674,0.0005960481,0.008851673,0.0015932025,0.95785534,0.027976064,0.00004894546],"about_ca_topic_score_codex":0.002163316,"about_ca_topic_score_gemma":0.0030748157,"teacher_disagreement_score":0.01281547,"about_ca_system_score_codex":0.0016198794,"about_ca_system_score_gemma":0.00067690125,"threshold_uncertainty_score":0.04287201},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053080827,0.01122794,0.20633177,0.14296618,0.021891432,0.00014093333,0.0011468681,0.0009723704,0.5622416],"genre_scores_gemma":[0.7567903,0.014048249,0.071058325,0.030976726,0.014060042,0.0002409206,0.001442027,0.00067928474,0.11070413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758005,0.00076913583,0.00007336062,0.00048571074,0.0006612747,0.00043033535],"domain_scores_gemma":[0.98966426,0.00679648,0.00039048257,0.001408986,0.0010388156,0.000701004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036831063,0.00092518784,0.0012222863,0.001474614,0.004787402,0.0045707673,0.0025422014,0.004114827,0.021220146],"category_scores_gemma":[0.016942171,0.00055871846,0.0011370822,0.0035222718,0.006063129,0.012547792,0.0054143826,0.0071903146,0.0037352943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080227146,0.000037226353,0.00050017465,0.00009530527,0.000017466751,0.00016663593,0.000193662,0.0014000346,0.00024916136,0.92866904,0.056575045,0.012016149],"study_design_scores_gemma":[0.000015929083,0.000008303273,0.00017153083,0.000027706756,0.00000850833,0.00008004809,0.00007967611,0.0021230273,0.00012184708,0.9773637,0.019989673,0.000010079724],"about_ca_topic_score_codex":0.0048909746,"about_ca_topic_score_gemma":0.004879854,"teacher_disagreement_score":0.021220146,"about_ca_system_score_codex":0.002357392,"about_ca_system_score_gemma":0.0016981879,"threshold_uncertainty_score":0.07098848},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32458138,0.0016699977,0.57562673,0.0023784374,0.00039119358,0.000120031655,0.0003364853,0.0006841119,0.0942116],"genre_scores_gemma":[0.86458987,0.0011601868,0.089626536,0.0007932911,0.0002972573,0.00012983014,0.00030479507,0.00030609337,0.04279213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988298,0.00044793473,0.00004201984,0.00020640921,0.00031204897,0.00016180785],"domain_scores_gemma":[0.9935869,0.003667501,0.00038562407,0.0010850633,0.0006758155,0.00059895066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011876571,0.0005903204,0.00078704173,0.0016375872,0.0018545771,0.0021638174,0.0013146688,0.0013209154,0.0073092687],"category_scores_gemma":[0.009216508,0.00056721515,0.00075253984,0.00094296184,0.0028049508,0.004329185,0.0033259934,0.0030136253,0.0014582278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009735651,0.000031004834,0.0003194207,0.000056607005,0.000019639576,0.00016942027,0.00038922793,0.007847078,0.0022203827,0.97255105,0.0037438346,0.012555001],"study_design_scores_gemma":[0.000012541847,0.000027593682,0.00014512471,0.000028535816,0.000009026174,0.0001829923,0.00012849773,0.028903427,0.0010884639,0.96626264,0.0031973692,0.000013686791],"about_ca_topic_score_codex":0.0007705898,"about_ca_topic_score_gemma":0.0010319754,"teacher_disagreement_score":0.0073092687,"about_ca_system_score_codex":0.0007878371,"about_ca_system_score_gemma":0.00050345773,"threshold_uncertainty_score":0.024451911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41486752,0.0015150125,0.17864247,0.002607372,0.0005518011,0.00022136838,0.0047655646,0.0012060759,0.39562276],"genre_scores_gemma":[0.9001216,0.00051378383,0.04163807,0.000665054,0.00014681704,0.000314239,0.003153462,0.00019940722,0.053247534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987149,0.00029691745,0.00010532667,0.00031232124,0.00031177962,0.00025873826],"domain_scores_gemma":[0.995828,0.0019943225,0.0005132811,0.00079054426,0.00047248346,0.00040135227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075330614,0.0005221885,0.00065528497,0.0022440613,0.004396344,0.0032338123,0.0011592043,0.001395319,0.026788035],"category_scores_gemma":[0.0041958955,0.0006363486,0.0012052153,0.0015346542,0.0015303786,0.0038502577,0.0026953842,0.0014499576,0.0037716273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002683742,0.00007754761,0.0018040136,0.00013959235,0.00005815219,0.00066907133,0.0004434104,0.0012325951,0.0032898379,0.96697515,0.00811226,0.01692992],"study_design_scores_gemma":[0.000067399575,0.00005988482,0.0018529977,0.00012597807,0.00005988756,0.00191344,0.0007396887,0.0047773086,0.0050397525,0.93856764,0.046750367,0.000045614528],"about_ca_topic_score_codex":0.0011671976,"about_ca_topic_score_gemma":0.0011369084,"teacher_disagreement_score":0.026788035,"about_ca_system_score_codex":0.0011992302,"about_ca_system_score_gemma":0.00079818745,"threshold_uncertainty_score":0.08961487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7528751,0.00046074388,0.052797966,0.0017179844,0.0003445828,0.00011835498,0.0021640055,0.0006350629,0.18888623],"genre_scores_gemma":[0.9374264,0.00018354334,0.027339201,0.00035015665,0.00007611786,0.000073453295,0.002050028,0.00025081562,0.03225026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999466,0.00011960477,0.000026519047,0.00011043766,0.00008598482,0.00019132209],"domain_scores_gemma":[0.9983581,0.0006076305,0.00026491203,0.00032882576,0.00017046962,0.00027010115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002916972,0.00046838788,0.00043167063,0.000805429,0.0022150055,0.0018994858,0.00092748395,0.00068192097,0.017394774],"category_scores_gemma":[0.0016754238,0.00047210004,0.0005946845,0.0007414003,0.0010598995,0.0012787519,0.001252437,0.0010516489,0.0020293214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090179406,0.0002793449,0.0036351732,0.0003426484,0.00008840663,0.0011542903,0.0009251105,0.008489121,0.024470199,0.8951003,0.027533256,0.037080333],"study_design_scores_gemma":[0.00012341254,0.00005688626,0.0043668128,0.000078647136,0.0000632469,0.0009070114,0.00063291314,0.016182106,0.009328611,0.94404846,0.024163125,0.000048758848],"about_ca_topic_score_codex":0.0027424984,"about_ca_topic_score_gemma":0.006247606,"teacher_disagreement_score":0.017394774,"about_ca_system_score_codex":0.0014242851,"about_ca_system_score_gemma":0.00079148397,"threshold_uncertainty_score":0.05819136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91362035,0.00073790445,0.05701244,0.00015787235,0.00003689944,0.000063116706,0.0007126959,0.00032723128,0.027331514],"genre_scores_gemma":[0.97510004,0.00032253863,0.015602751,0.0000631018,0.000053084674,0.00014167285,0.0011163217,0.00008352889,0.007516919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990404,0.00011104359,0.00009483091,0.0003077548,0.00024251305,0.0002034143],"domain_scores_gemma":[0.9967849,0.0014953305,0.00047864925,0.00036781686,0.00050475466,0.0003685444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051599974,0.00047981925,0.00071685755,0.0018564739,0.001450588,0.002676671,0.00083572156,0.0005926475,0.0049888645],"category_scores_gemma":[0.004178627,0.0005015827,0.0008041239,0.0014905289,0.0014852476,0.0022728008,0.0014733888,0.000799869,0.00062359305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077039667,0.000086057014,0.01185269,0.00026973174,0.00008624886,0.0014044329,0.002603806,0.007458379,0.023742758,0.90814626,0.0015839158,0.041995276],"study_design_scores_gemma":[0.00018257735,0.00041985043,0.016949603,0.00018715925,0.00020088337,0.003928058,0.0021196993,0.047249954,0.0499701,0.83882135,0.03983154,0.0001392697],"about_ca_topic_score_codex":0.0013624325,"about_ca_topic_score_gemma":0.00074336136,"teacher_disagreement_score":0.0049888645,"about_ca_system_score_codex":0.001588262,"about_ca_system_score_gemma":0.0004816566,"threshold_uncertainty_score":0.01668948},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4162985,0.0016745275,0.1427725,0.005918239,0.00080842915,0.00028889842,0.0069062468,0.0022917367,0.42304084],"genre_scores_gemma":[0.90386635,0.00093069754,0.046134096,0.0010030782,0.0002313295,0.00018699665,0.0035209479,0.0002059678,0.04392059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907434,0.0001670878,0.000047550813,0.00021271365,0.00015782559,0.00034047768],"domain_scores_gemma":[0.9972541,0.0007443541,0.0005645056,0.0007036577,0.0003046848,0.00042879026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530387,0.00069042336,0.0007747008,0.0014208812,0.0021418524,0.0031509192,0.0013553688,0.001570093,0.015204207],"category_scores_gemma":[0.0038404088,0.0006666814,0.0006554452,0.0015112817,0.0016557233,0.0035024933,0.002726813,0.0017926064,0.0035237535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048616537,0.0001474788,0.003083971,0.00037068443,0.00007252825,0.00055045483,0.000549943,0.0054418948,0.009237026,0.90658957,0.031608887,0.041861363],"study_design_scores_gemma":[0.0000642732,0.00010253426,0.002198424,0.00013076578,0.00008013756,0.0013287072,0.00045523242,0.008224278,0.0062526744,0.941446,0.039667908,0.00004900449],"about_ca_topic_score_codex":0.0008807816,"about_ca_topic_score_gemma":0.0013676846,"teacher_disagreement_score":0.015204207,"about_ca_system_score_codex":0.001026812,"about_ca_system_score_gemma":0.0008692652,"threshold_uncertainty_score":0.050863206},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30261508,0.000650386,0.14662376,0.0011528186,0.0007827194,0.00015511113,0.00079973513,0.0009397274,0.5462807],"genre_scores_gemma":[0.909653,0.000254327,0.017875941,0.00044612287,0.0002539746,0.00006239385,0.000572903,0.00021344566,0.070667915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994429,0.00013582455,0.000033312546,0.00009953165,0.000161842,0.00012654711],"domain_scores_gemma":[0.9990606,0.0002428811,0.00013955976,0.0001383276,0.00024585825,0.00017278784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004401244,0.00042480888,0.00043868326,0.0016618083,0.0019453289,0.002375252,0.00056663476,0.0006495534,0.019191284],"category_scores_gemma":[0.0014986328,0.0003010038,0.00057796005,0.0008033407,0.0021945043,0.0027213139,0.0029174543,0.0015817296,0.0055229203],"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.00006893117,0.000024721068,0.00035167873,0.000045424364,0.0000122245665,0.00031893977,0.00024257365,0.00040320263,0.0021455253,0.9866585,0.0026042429,0.0071239946],"study_design_scores_gemma":[0.000025187466,0.000034697994,0.0004071915,0.00002188133,0.000012491266,0.00046700006,0.00028042874,0.0018682193,0.0030244163,0.9747977,0.019042857,0.000017876673],"about_ca_topic_score_codex":0.00042532105,"about_ca_topic_score_gemma":0.00089062087,"teacher_disagreement_score":0.019191284,"about_ca_system_score_codex":0.0006237803,"about_ca_system_score_gemma":0.00052151247,"threshold_uncertainty_score":0.064201295},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16568425,0.0018243322,0.09523487,0.002336505,0.0019759454,0.00036235378,0.0022967714,0.0011217209,0.7291633],"genre_scores_gemma":[0.61159766,0.0012566467,0.055784542,0.0017145416,0.00047559888,0.0003996935,0.0018564401,0.00037814587,0.32653677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934334,0.000117597425,0.00003397254,0.00015550123,0.0001179302,0.00023160447],"domain_scores_gemma":[0.99912363,0.0002161227,0.00014373717,0.00018376306,0.00019758906,0.00013513229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031350137,0.00069805107,0.00043809862,0.001997321,0.0019568764,0.0021851906,0.0009141045,0.0011246423,0.05233171],"category_scores_gemma":[0.0018148284,0.0003550011,0.00059204374,0.0012659084,0.0009811574,0.0021955674,0.0019568913,0.001264281,0.009831123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002217929,0.00010935978,0.0011940545,0.00021439108,0.00005024588,0.0007688935,0.0003340746,0.0014162218,0.007236925,0.886182,0.02793063,0.074341446],"study_design_scores_gemma":[0.000058285495,0.000078873585,0.0010465003,0.00012727408,0.00004542453,0.0012515137,0.0003702515,0.0036275396,0.0086506605,0.78639114,0.19830772,0.00004482627],"about_ca_topic_score_codex":0.0009849882,"about_ca_topic_score_gemma":0.0025558807,"teacher_disagreement_score":0.05233171,"about_ca_system_score_codex":0.0008666889,"about_ca_system_score_gemma":0.0007795908,"threshold_uncertainty_score":0.17506701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12794626,0.0025480222,0.54645395,0.0017362111,0.0018836304,0.0004816925,0.0043118494,0.0016115125,0.31302696],"genre_scores_gemma":[0.59589916,0.001959816,0.25362122,0.0013639791,0.0005064074,0.0008154858,0.0038796754,0.00069441367,0.14125985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993968,0.00013216943,0.000060106442,0.00015758774,0.00015407718,0.00009925691],"domain_scores_gemma":[0.9989611,0.0004740717,0.0000831888,0.00020583243,0.00016101921,0.000114746814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005493873,0.00058977574,0.0005121263,0.0022952962,0.0018235694,0.0019322064,0.0013272719,0.0008769404,0.028167631],"category_scores_gemma":[0.0026259492,0.0005429335,0.00089263514,0.0014276596,0.00094237435,0.0024836939,0.0016615591,0.0016030387,0.004187854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108706976,0.000055610268,0.00031547755,0.00026975194,0.000030787298,0.00018079692,0.00022631254,0.0044944338,0.003612654,0.9122551,0.013527441,0.064922936],"study_design_scores_gemma":[0.000056195717,0.00008001888,0.00039625465,0.0000938861,0.000025498515,0.00043720275,0.00010167833,0.016937526,0.0046596574,0.8891629,0.088009514,0.000039632396],"about_ca_topic_score_codex":0.00070627936,"about_ca_topic_score_gemma":0.0019229935,"teacher_disagreement_score":0.028167631,"about_ca_system_score_codex":0.001229016,"about_ca_system_score_gemma":0.0005034954,"threshold_uncertainty_score":0.094230115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37945297,0.001582745,0.46051425,0.0012873966,0.00050748716,0.00015461464,0.001805559,0.00039146407,0.15430361],"genre_scores_gemma":[0.8794759,0.00059249095,0.06848269,0.00028091657,0.00021188363,0.00012585371,0.00097422785,0.00021616157,0.04963989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964035,0.00010766271,0.00001808464,0.000059706555,0.0000913461,0.00008280056],"domain_scores_gemma":[0.99901414,0.0002572301,0.00018379971,0.00015293989,0.00016076461,0.00023114982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004422362,0.0003763034,0.00032765642,0.0015990927,0.00073000405,0.0012334354,0.00056744355,0.00052418496,0.014149893],"category_scores_gemma":[0.0012632976,0.00032405503,0.00052715396,0.0006722122,0.000932783,0.0019693952,0.000887769,0.000881248,0.0010650976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037326943,0.000022780478,0.00017185729,0.000037698428,0.000011396154,0.00008292884,0.00014220862,0.0030641053,0.001660468,0.98444206,0.003365396,0.0069616647],"study_design_scores_gemma":[0.000013639769,0.000019318328,0.00040141772,0.000021812593,0.000011661486,0.00013837247,0.00013356253,0.0327334,0.00065072236,0.96042365,0.0054391455,0.000013269786],"about_ca_topic_score_codex":0.001163966,"about_ca_topic_score_gemma":0.0023910382,"teacher_disagreement_score":0.014149893,"about_ca_system_score_codex":0.0006897522,"about_ca_system_score_gemma":0.00041566,"threshold_uncertainty_score":0.04733616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84535885,0.00037549878,0.016922176,0.00055363815,0.00014874944,0.00004596876,0.0005722998,0.00028287564,0.13573997],"genre_scores_gemma":[0.96121424,0.00014378486,0.00539647,0.00018384542,0.00004405537,0.00002602422,0.0007106747,0.000098255325,0.032182675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995449,0.00006175942,0.000021485215,0.00009027137,0.00009986023,0.00018169043],"domain_scores_gemma":[0.99932504,0.00018590639,0.00013621192,0.00011109684,0.00008818035,0.00015361409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001572898,0.00038755813,0.00032362988,0.0009986855,0.0015605994,0.0014066931,0.0005904495,0.00052506535,0.017418712],"category_scores_gemma":[0.0007087418,0.00030173908,0.00036256932,0.0006380277,0.00090701715,0.0013661947,0.0016383795,0.0008160465,0.002169353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007076461,0.0001652298,0.0023305546,0.00019292723,0.000048571863,0.0013766497,0.0010107064,0.0018358412,0.022126226,0.9273522,0.008769098,0.034084264],"study_design_scores_gemma":[0.0001282807,0.00012818103,0.0049937386,0.00008883575,0.00008097633,0.0018585715,0.0013764946,0.0061496454,0.020262947,0.9142525,0.05062582,0.00005403939],"about_ca_topic_score_codex":0.0015833579,"about_ca_topic_score_gemma":0.0025095767,"teacher_disagreement_score":0.017418712,"about_ca_system_score_codex":0.00071116496,"about_ca_system_score_gemma":0.00036747725,"threshold_uncertainty_score":0.058271408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5867246,0.0017854845,0.19662848,0.0016195263,0.0003999124,0.00019398659,0.0018343169,0.0005989637,0.21021476],"genre_scores_gemma":[0.9386916,0.0004386033,0.026176956,0.00028342972,0.000105296014,0.00009969435,0.0008363745,0.000095723284,0.033272363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965847,0.000088077875,0.000014431112,0.00008254211,0.000050363622,0.0001061043],"domain_scores_gemma":[0.9992586,0.00022209702,0.00014846653,0.000121611534,0.00012414322,0.00012517179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022063033,0.0003841329,0.0003065162,0.0010714674,0.0012152345,0.0014375321,0.0005685182,0.0007615736,0.014082086],"category_scores_gemma":[0.0013303966,0.00026241766,0.0003095026,0.000569267,0.00089718844,0.0016959962,0.000990935,0.0006806137,0.0015009479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012433356,0.000026715208,0.0009086909,0.00011049896,0.000026662674,0.0003221666,0.00023583948,0.0027631999,0.006644601,0.96636814,0.0057429746,0.016726118],"study_design_scores_gemma":[0.00003387974,0.000039437626,0.0011907571,0.000040109368,0.000029318064,0.00042235514,0.00021927968,0.012790466,0.0044218497,0.9590683,0.021716116,0.000028066566],"about_ca_topic_score_codex":0.001858801,"about_ca_topic_score_gemma":0.0033205291,"teacher_disagreement_score":0.014082086,"about_ca_system_score_codex":0.00076562306,"about_ca_system_score_gemma":0.0005500892,"threshold_uncertainty_score":0.047109246},"labels":[],"label_agreement":null}]}