{"meta":{"query_hash":"e60ba4bbaf9c","filters":{"venue":"Utilitas Mathematica"},"cohort_total":121,"direct_labels_cover":0,"predictions_cover":121,"exported":121,"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/e60ba4bbaf9c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Utilitas+Mathematica"},"results":[{"id":"W1949222424","doi":"","title":"Enumerating super edge-magic labelings for some types of path-like trees","year":2010,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Mathematics; Combinatorics; Corollary; MAGIC (telescope); Kronecker product; Path (computing); Enhanced Data Rates for GSM Evolution; Type (biology); Discrete mathematics; Kronecker delta; Artificial intelligence; Computer science","score_opus":0.01528467967349586,"score_gpt":0.24755962807965387,"score_spread":0.232274948406158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949222424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67566097,0.0004834474,0.29949912,0.00064533093,0.00006272521,0.00008301439,0.0007429683,0.00034315733,0.022479214],"genre_scores_gemma":[0.84662145,0.0005490631,0.1424273,0.00019116241,0.00010858969,0.00014229998,0.0014887567,0.0001390979,0.0083322385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989366,0.0002426086,0.00010341343,0.0002409119,0.00029062628,0.00018581109],"domain_scores_gemma":[0.9921239,0.0052674063,0.0007455677,0.00096232956,0.00044130353,0.0004595115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009096568,0.00041136175,0.0006762149,0.0019304621,0.0012512327,0.0019869371,0.0012495262,0.0009202785,0.0066161077],"category_scores_gemma":[0.005030399,0.0005970698,0.0008700171,0.0018365469,0.0014582903,0.0046274774,0.0016091818,0.0019357216,0.00051344675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035385962,0.00012211695,0.007700624,0.00037068786,0.000060462535,0.00029742377,0.00063214154,0.018909106,0.015607473,0.899581,0.0034421817,0.05292296],"study_design_scores_gemma":[0.000033058233,0.00008259071,0.0020104293,0.000041737152,0.000060385188,0.0005905203,0.00024048531,0.06653503,0.007372327,0.91823196,0.0047597983,0.00004162823],"about_ca_topic_score_codex":0.00055028003,"about_ca_topic_score_gemma":0.0012497111,"teacher_disagreement_score":0.0066161077,"about_ca_system_score_codex":0.00096126465,"about_ca_system_score_gemma":0.00055356347,"threshold_uncertainty_score":0.022133112},"labels":[],"label_agreement":null},{"id":"W219581828","doi":"","title":"A study of total relative Displacements of permutations in paths and cycles","year":2008,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Point processes and geometric inequalities","field":"Mathematics","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; Statistics","score_opus":0.09138336481651767,"score_gpt":0.3513250673472211,"score_spread":0.2599417025307034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W219581828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5187621,0.002448273,0.4303179,0.0015866618,0.00018549398,0.00005899004,0.00022873556,0.00008958182,0.04632221],"genre_scores_gemma":[0.92233163,0.0018860593,0.050820794,0.00019135681,0.00021485606,0.0001229892,0.00021061217,0.000111184294,0.024110546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990194,0.0003577598,0.00005354294,0.00019822181,0.0002341974,0.00013680653],"domain_scores_gemma":[0.9938426,0.0043003573,0.0006150031,0.00045928388,0.00042068114,0.00036208407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025534835,0.0009809143,0.0011295489,0.002553238,0.0017661412,0.0025496206,0.0024030965,0.0012868409,0.010473405],"category_scores_gemma":[0.010599603,0.0006178419,0.0013284892,0.0037347493,0.004773625,0.0071473154,0.002616755,0.002777217,0.00041522947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001401134,0.000005044866,0.0001520971,0.00002172981,0.000005239401,0.00001610923,0.00014212489,0.004430734,0.00027797394,0.9924436,0.00012724924,0.002363971],"study_design_scores_gemma":[0.00000776765,0.000042408694,0.00023887072,0.000015670237,0.000012205785,0.0000402467,0.00016237762,0.019880392,0.00034862576,0.9775378,0.0017046819,0.000008897911],"about_ca_topic_score_codex":0.0021926172,"about_ca_topic_score_gemma":0.0019048244,"teacher_disagreement_score":0.010473405,"about_ca_system_score_codex":0.0017727055,"about_ca_system_score_gemma":0.00096533593,"threshold_uncertainty_score":0.03503704},"labels":[],"label_agreement":null},{"id":"W2274606173","doi":"","title":"Semitotal domination in graphs","year":2014,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"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":"Dominating set; Domination analysis; Mathematics; Combinatorics; Vertex (graph theory); Graph; Connectivity; Discrete mathematics","score_opus":0.014436776905547077,"score_gpt":0.28307398270227024,"score_spread":0.2686372057967232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274606173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5451786,0.0029334233,0.39560267,0.0010009638,0.00010872746,0.0001007004,0.00063456857,0.00054174254,0.053898644],"genre_scores_gemma":[0.9663783,0.0007942158,0.028120633,0.00019461854,0.00010918245,0.00010918817,0.00027381087,0.00009045166,0.0039295508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982723,0.00045029263,0.00010503189,0.00041923302,0.0005274653,0.00022567707],"domain_scores_gemma":[0.9945346,0.0028861372,0.0006831969,0.00088050764,0.00047619702,0.00053923106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925054,0.00057077577,0.0007159011,0.0019397581,0.0013609469,0.0022964135,0.0008882229,0.00059405825,0.0025337576],"category_scores_gemma":[0.005004706,0.0003565382,0.00053974916,0.0016708792,0.0027123864,0.00427512,0.0024463676,0.0009900833,0.0002860705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020693809,0.00003998386,0.0033555704,0.0002601518,0.000057186582,0.00027217017,0.00094230263,0.041974083,0.013474661,0.9048203,0.0019704034,0.032626197],"study_design_scores_gemma":[0.000023350718,0.00006219089,0.0018041421,0.000045769048,0.000034134166,0.0006318888,0.00025647032,0.07411361,0.0037390166,0.90535575,0.013896961,0.000036770252],"about_ca_topic_score_codex":0.0006028966,"about_ca_topic_score_gemma":0.0008588961,"teacher_disagreement_score":0.0025337576,"about_ca_system_score_codex":0.0013434285,"about_ca_system_score_gemma":0.00045996223,"threshold_uncertainty_score":0.009747326},"labels":[],"label_agreement":null},{"id":"W2321717160","doi":"","title":"Magic coverings and the Kronecker product","year":2009,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"MAGIC (telescope); Mathematics; Kronecker product; Arithmetic; Product (mathematics); Kronecker delta; Geometry","score_opus":0.008426062970966961,"score_gpt":0.21415170340233255,"score_spread":0.2057256404313656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321717160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5834597,0.0037325106,0.30803886,0.0024320628,0.0003307665,0.000033460303,0.0002635589,0.00019040567,0.101518735],"genre_scores_gemma":[0.95967704,0.0014127048,0.029913176,0.00026568223,0.00021347131,0.00003616472,0.00014624507,0.00004739748,0.008288094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.00017937117,0.000034383407,0.000098543416,0.00017377477,0.00009488494],"domain_scores_gemma":[0.9977919,0.0012263639,0.00027573016,0.00028177298,0.00021251233,0.00021172824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009337167,0.00029955237,0.00042914733,0.0014044304,0.001233066,0.001815173,0.0006246072,0.0007693545,0.004059162],"category_scores_gemma":[0.002706766,0.0003182106,0.0004955539,0.0012637374,0.002343332,0.004814055,0.0014566787,0.0012740945,0.00036170814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010381976,0.0000040964337,0.00014085697,0.000015758998,0.0000023407406,0.000027148106,0.000057063637,0.00070774736,0.00028248833,0.99619055,0.0002609037,0.0023007058],"study_design_scores_gemma":[0.0000047755125,0.000013259457,0.00019288377,0.000010958698,0.000004582245,0.000114962604,0.00005988404,0.0050426815,0.00026190022,0.9916487,0.0026374147,0.000008148365],"about_ca_topic_score_codex":0.00066941336,"about_ca_topic_score_gemma":0.00073250895,"teacher_disagreement_score":0.004059162,"about_ca_system_score_codex":0.0006968712,"about_ca_system_score_gemma":0.00040123196,"threshold_uncertainty_score":0.013579249},"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":"W2611890383","doi":"","title":"On the alpha-labeling number of bipartite graphs","year":2000,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":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; Alpha (finance); Graph; Statistics","score_opus":0.018893353001895607,"score_gpt":0.25394341498076656,"score_spread":0.23505006197887096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611890383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4818406,0.005645005,0.28385207,0.023522876,0.0011743996,0.0001050453,0.0012406677,0.0006507971,0.2019685],"genre_scores_gemma":[0.9017805,0.0035092314,0.062248457,0.0017461032,0.0019436488,0.0003536198,0.00085859984,0.00042393844,0.027135937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978204,0.0010566511,0.000081510414,0.000372404,0.0003808859,0.0002881987],"domain_scores_gemma":[0.96725243,0.026062747,0.0018673823,0.0016219163,0.0011640087,0.0020315198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005222511,0.001368229,0.0018445951,0.0037907986,0.0031939854,0.005902347,0.0036608134,0.0031652462,0.008605421],"category_scores_gemma":[0.027474519,0.0013156309,0.0011575685,0.0038966434,0.0070629725,0.01402719,0.0034802528,0.006452286,0.001127428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014323575,0.00004310099,0.0007924028,0.00010447649,0.000014069155,0.000028431345,0.00021067708,0.0066387644,0.0005142503,0.98022753,0.0041570426,0.007126071],"study_design_scores_gemma":[0.000026538388,0.000011231692,0.00032107942,0.000027811806,0.000010885725,0.000040290994,0.000049513656,0.0224131,0.00022034241,0.9755293,0.0013362869,0.000013595041],"about_ca_topic_score_codex":0.0018824609,"about_ca_topic_score_gemma":0.0016853685,"teacher_disagreement_score":0.008605421,"about_ca_system_score_codex":0.004480142,"about_ca_system_score_gemma":0.0014967966,"threshold_uncertainty_score":0.03250581},"labels":[],"label_agreement":null},{"id":"W2625741854","doi":"","title":"Law of inertia for the factorization of cubic polynomials - the real case","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","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; Discriminant; Monic polynomial; Factorization; Prime factor; Integer (computer science); Class (philosophy); Polynomial; Cubic function; Combinatorics; Prime (order theory); Unique factorization domain; Square (algebra); Difference polynomials; Orthogonal polynomials; Mathematical analysis; Algorithm","score_opus":0.040004265954640725,"score_gpt":0.2999675448691068,"score_spread":0.2599632789144661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625741854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5062396,0.0029553086,0.16623859,0.005542491,0.0011175594,0.00010218519,0.00059059006,0.0004073743,0.31680632],"genre_scores_gemma":[0.97596914,0.0006010279,0.008042044,0.0003587831,0.0008517827,0.000055767345,0.0001618779,0.000058520814,0.013901053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.000100475154,0.00003282018,0.0002091649,0.00023775788,0.00027313933],"domain_scores_gemma":[0.99814653,0.00072595157,0.00025296863,0.00023653141,0.00029401627,0.00034396333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012688054,0.00046047135,0.0007005802,0.001870263,0.0018675216,0.002943973,0.0005230889,0.0006915,0.00763897],"category_scores_gemma":[0.003589183,0.00024856094,0.0009953543,0.0006929808,0.006167066,0.0029308342,0.0018972515,0.0025584775,0.0010615846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003261377,0.000013555308,0.0003090958,0.000019386664,0.0000034495088,0.000077106335,0.00023447881,0.0002457469,0.0004846671,0.99492455,0.0011308605,0.002524573],"study_design_scores_gemma":[0.000044427194,0.000056204473,0.0010212866,0.000026672551,0.000009898583,0.0003090241,0.00009991306,0.0047437004,0.0007327618,0.9841098,0.00881937,0.000026971804],"about_ca_topic_score_codex":0.002214407,"about_ca_topic_score_gemma":0.0011355354,"teacher_disagreement_score":0.00763897,"about_ca_system_score_codex":0.0017035049,"about_ca_system_score_gemma":0.0007861842,"threshold_uncertainty_score":0.025554895},"labels":[],"label_agreement":null},{"id":"W2734852884","doi":"","title":"Law of inertia for the factorization of cubic polynomials - the imaginary case","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Polynomial and algebraic computation","field":"Computer Science","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; Discriminant; Factorization; Integer (computer science); Polynomial; Combinatorics; Prime (order theory); Field (mathematics); Prime factor; The Imaginary; Square (algebra); Galois group; Cubic function; Discrete mathematics; Pure mathematics; Mathematical analysis; Algorithm","score_opus":0.034183816002079245,"score_gpt":0.29601214528267045,"score_spread":0.2618283292805912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734852884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48843783,0.0019963696,0.11324668,0.0052820444,0.0009924464,0.0001008392,0.00028582482,0.00031838086,0.3893395],"genre_scores_gemma":[0.9792802,0.00038060138,0.0058330614,0.000256191,0.0005270452,0.000041759584,0.000081190585,0.000050226663,0.013549721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999348,0.00007886289,0.000025016334,0.00014803951,0.00018903564,0.0002110406],"domain_scores_gemma":[0.99857664,0.0005247145,0.00019574031,0.00020470278,0.00019467712,0.0003036486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008859707,0.0004712289,0.00055617926,0.001508588,0.0020674535,0.003094544,0.0004955697,0.00081266003,0.008657713],"category_scores_gemma":[0.0031114004,0.00023741333,0.00078524643,0.00052511034,0.0067897327,0.0026995135,0.001991015,0.0026233904,0.0011878439],"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.0000376025,0.000014429634,0.00031379482,0.000020329764,0.0000024788342,0.0001257918,0.00027809243,0.00028441095,0.00086516317,0.99390596,0.0010660912,0.003085705],"study_design_scores_gemma":[0.000048666683,0.0000633113,0.0009555159,0.000028479979,0.000008367966,0.0003811077,0.00012484277,0.0043413555,0.0012298565,0.9820166,0.01077784,0.000024005476],"about_ca_topic_score_codex":0.0019044661,"about_ca_topic_score_gemma":0.0010532943,"teacher_disagreement_score":0.008657713,"about_ca_system_score_codex":0.0017785557,"about_ca_system_score_gemma":0.0007449126,"threshold_uncertainty_score":0.02896297},"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":"W2769119271","doi":"","title":"On triplanes of order twelve admitting an automorphism of order six and their binary and ternary codes","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","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":"Mathematics; Ternary operation; Isomorphism (crystallography); Combinatorics; Automorphism; Order (exchange); Automorphism group; Binary number; Dimension (graph theory); Binary code; Residual; Discrete mathematics; Arithmetic; Algorithm; Computer science","score_opus":0.021984553661439928,"score_gpt":0.2662980361193844,"score_spread":0.2443134824579445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769119271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415908,0.00068236055,0.039572332,0.00009626162,0.00004070182,0.000026990403,0.0003140207,0.00007303746,0.017603492],"genre_scores_gemma":[0.97446764,0.0007016875,0.016723385,0.00005307403,0.000048731432,0.00003426468,0.000770373,0.000038407536,0.007162494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971324,0.000037156333,0.000022141337,0.000064094245,0.00009826307,0.00006503731],"domain_scores_gemma":[0.99949384,0.000114627925,0.00018123294,0.00008273932,0.00007028159,0.000057313497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014587815,0.00026188104,0.00021973831,0.0011143936,0.00048775898,0.00068428967,0.00018020952,0.0002846832,0.0030342138],"category_scores_gemma":[0.0006939899,0.00015007892,0.00037188962,0.00072749244,0.00090254296,0.00060940423,0.0006487441,0.0004729865,0.00062878523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038748578,0.000059336733,0.0066971527,0.0002721637,0.000042491145,0.0007298818,0.0013890811,0.017040368,0.039794408,0.83675355,0.0018851792,0.094948955],"study_design_scores_gemma":[0.0000708224,0.00074293645,0.012100955,0.00017176091,0.000074911375,0.003369887,0.0013468298,0.036424585,0.03669771,0.8395208,0.06932452,0.00015420928],"about_ca_topic_score_codex":0.00048650577,"about_ca_topic_score_gemma":0.00036874533,"teacher_disagreement_score":0.0030342138,"about_ca_system_score_codex":0.00030686354,"about_ca_system_score_gemma":0.0003055245,"threshold_uncertainty_score":0.010150433},"labels":[],"label_agreement":null},{"id":"W2783047605","doi":"","title":"Further results on super edge-magic total labeling of extended w-trees","year":2016,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Horticulture; Artificial intelligence; Biology; Computer science; Physics; Astrophysics","score_opus":0.020760320195132215,"score_gpt":0.24768611536398438,"score_spread":0.22692579516885217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783047605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27204224,0.002125643,0.59037906,0.0038763515,0.00036400108,0.00008257114,0.0009181153,0.0006224305,0.12958956],"genre_scores_gemma":[0.74339163,0.0027769082,0.2076492,0.0021414647,0.0006371017,0.00025494117,0.0020445918,0.0006957293,0.040408365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933004,0.0001848434,0.000035387362,0.00019884093,0.00012967795,0.00012124339],"domain_scores_gemma":[0.99641234,0.0020126929,0.00027411254,0.00061991427,0.00031852786,0.0003623517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407599,0.00091112324,0.001086306,0.0016784215,0.0020031265,0.00269511,0.0021158413,0.0013024664,0.011753138],"category_scores_gemma":[0.0047367713,0.00069775013,0.0017103652,0.0033737589,0.0023165266,0.008307894,0.0030559697,0.0051346836,0.0010045632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073055926,0.000039827697,0.00047885466,0.00018568299,0.000021485717,0.000049212824,0.00029826307,0.0041960836,0.0017424508,0.9771063,0.0033159298,0.012492897],"study_design_scores_gemma":[0.000014046437,0.000013093368,0.0003053148,0.000024940717,0.000027038988,0.000049680402,0.00010267448,0.013693216,0.00066937617,0.9807179,0.004369975,0.000012786159],"about_ca_topic_score_codex":0.0017160911,"about_ca_topic_score_gemma":0.0026317078,"teacher_disagreement_score":0.011753138,"about_ca_system_score_codex":0.0014254574,"about_ca_system_score_gemma":0.0008474543,"threshold_uncertainty_score":0.039318204},"labels":[],"label_agreement":null},{"id":"W2890365631","doi":"","title":"Maximum variances and minimum statuses of connected Weighted Graphs","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Statistics; Combinatorics","score_opus":0.022719638800605856,"score_gpt":0.2596377089601727,"score_spread":0.23691807015956684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890365631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5195539,0.0011856506,0.4425248,0.0046977764,0.00016558691,0.00006017912,0.0009224663,0.0003083221,0.030581417],"genre_scores_gemma":[0.9346839,0.0010269482,0.0481978,0.00041652354,0.00052252103,0.00025306616,0.00095785526,0.00034643756,0.013594816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966628,0.0015209991,0.00015349545,0.000760641,0.00048845273,0.00041364486],"domain_scores_gemma":[0.96866983,0.024540601,0.0020553225,0.0015515395,0.0015238447,0.0016588635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046209544,0.0012812335,0.0016672054,0.0038174195,0.0029088033,0.006463263,0.0033632321,0.0026850621,0.0069058756],"category_scores_gemma":[0.03663364,0.0017911232,0.0012273273,0.0030380185,0.0048231804,0.010584382,0.0035701103,0.003948759,0.00076393306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009974604,0.00003666884,0.000784566,0.00008076363,0.000023388026,0.000032855634,0.00038612238,0.010450694,0.0008173935,0.9783546,0.0015682337,0.007364962],"study_design_scores_gemma":[0.000014136516,0.00000907543,0.0004277614,0.000017300745,0.000010856937,0.00002446385,0.00007073848,0.02764551,0.00029795992,0.97091866,0.0005489206,0.00001466206],"about_ca_topic_score_codex":0.0013159836,"about_ca_topic_score_gemma":0.0016035807,"teacher_disagreement_score":0.0069058756,"about_ca_system_score_codex":0.002652044,"about_ca_system_score_gemma":0.0011117286,"threshold_uncertainty_score":0.024438262},"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":"W2899438014","doi":"","title":"Mixed k-rainbow domination numbers in graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.03345431103223346,"score_gpt":0.3086433519217288,"score_spread":0.27518904088949536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899438014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806063,0.0008435002,0.13353601,0.0018882602,0.00018011144,0.00007813987,0.00057395385,0.0004432814,0.081850305],"genre_scores_gemma":[0.9599866,0.00033648068,0.02526357,0.00018865766,0.000103228,0.00012047452,0.00021980239,0.00011612237,0.0136650335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988236,0.0003178119,0.00007898865,0.00027755284,0.00029699365,0.0002051717],"domain_scores_gemma":[0.9950598,0.003034675,0.00049360597,0.00043741096,0.00042603127,0.000548376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015837868,0.00063419197,0.0006786127,0.0031304236,0.0024724372,0.0050114635,0.001641686,0.0012470816,0.009174429],"category_scores_gemma":[0.0066432143,0.0006829056,0.00068855786,0.0026550703,0.003421255,0.0062123896,0.0023352592,0.0019499664,0.0007505543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012195606,0.000018522034,0.0010883164,0.00008757039,0.00001818224,0.0000785674,0.00033857205,0.0020679825,0.0015902489,0.9859995,0.0011740413,0.0074164625],"study_design_scores_gemma":[0.000028658194,0.000014336198,0.0005566202,0.000026016258,0.000024883575,0.00013346487,0.00014252248,0.008463938,0.0009964067,0.98796195,0.001633064,0.00001821122],"about_ca_topic_score_codex":0.0007302169,"about_ca_topic_score_gemma":0.0014662831,"teacher_disagreement_score":0.009174429,"about_ca_system_score_codex":0.0016076028,"about_ca_system_score_gemma":0.00073622155,"threshold_uncertainty_score":0.030691564},"labels":[],"label_agreement":null},{"id":"W2902428849","doi":"","title":"Generalized Gaussian Fibonacci numbers and sums by matrix methods","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Gaussian; Pisano period; Fibonacci polynomials; Matrix (chemical analysis); Combinatorics; Arithmetic; Pure mathematics; Algebra over a field; Orthogonal polynomials","score_opus":0.018865978142840776,"score_gpt":0.38675275802436254,"score_spread":0.36788677988152174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902428849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044901457,0.0068141194,0.8467409,0.0029512232,0.0020473585,0.00008741217,0.0002441812,0.00031256967,0.095900774],"genre_scores_gemma":[0.55837995,0.0067071375,0.3251832,0.0018559301,0.0041855653,0.00044079093,0.0003405408,0.0006562425,0.102250636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987324,0.00056918344,0.000057616493,0.00014568293,0.00038564144,0.00010948046],"domain_scores_gemma":[0.9981201,0.0010103171,0.00015967869,0.00019949352,0.00036202846,0.00014832341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023345484,0.0017100322,0.0015628337,0.0042260378,0.001863212,0.0041756225,0.0021695038,0.0023120432,0.00892003],"category_scores_gemma":[0.006830735,0.00079200877,0.0016015368,0.0030278955,0.004779156,0.0053723617,0.0023826768,0.003695024,0.0018643892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045744437,0.0000037825657,0.000019471789,0.000017305014,0.0000037000204,0.000013065549,0.000045477907,0.0008541701,0.000110192705,0.9960705,0.0005688012,0.0022889057],"study_design_scores_gemma":[0.000003212416,0.000003248529,0.000026240903,0.000009078668,0.0000039294687,0.000039363604,0.0000133023,0.0091040945,0.00009438418,0.9885268,0.0021669744,0.000009304951],"about_ca_topic_score_codex":0.0014275945,"about_ca_topic_score_gemma":0.001890135,"teacher_disagreement_score":0.00892003,"about_ca_system_score_codex":0.0016923436,"about_ca_system_score_gemma":0.0012877004,"threshold_uncertainty_score":0.029840529},"labels":[],"label_agreement":null},{"id":"W2956368669","doi":"","title":"On the domination number of 2-dimensional torus graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Torus; Combinatorics; Geometry","score_opus":0.02505767166059,"score_gpt":0.31828497504855485,"score_spread":0.2932273033879649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956368669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8674492,0.0022730157,0.03318889,0.0032287664,0.00024731742,0.000044086548,0.0007198682,0.000213675,0.09263522],"genre_scores_gemma":[0.9858326,0.001163331,0.0039552785,0.00016828,0.00034894657,0.00008383135,0.00033157397,0.00009174345,0.008024459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991731,0.000277489,0.000032745764,0.000137145,0.0001723792,0.00020717821],"domain_scores_gemma":[0.9897078,0.0076139118,0.00092462456,0.0004150267,0.00039015448,0.00094849785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014227376,0.0008295746,0.001169888,0.004064457,0.002041383,0.003152449,0.0019264934,0.0013741885,0.009376427],"category_scores_gemma":[0.009027349,0.0005426141,0.0006151051,0.002789084,0.0028819346,0.0045268224,0.0019476848,0.0020724465,0.00067139295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005359136,0.00010323107,0.0042960825,0.00033086122,0.00007616553,0.0002847826,0.0012326578,0.0388572,0.0065597612,0.92029274,0.008903239,0.018527372],"study_design_scores_gemma":[0.00008222256,0.00005359363,0.003197687,0.00008272925,0.0000613313,0.00032608394,0.00034088187,0.11436291,0.0016236351,0.87547183,0.00434383,0.000053212425],"about_ca_topic_score_codex":0.0018066526,"about_ca_topic_score_gemma":0.0018720191,"teacher_disagreement_score":0.009376427,"about_ca_system_score_codex":0.0020994432,"about_ca_system_score_gemma":0.0007214253,"threshold_uncertainty_score":0.031367302},"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":"W2972117245","doi":"","title":"Super edge-antimagic total labelings","year":2006,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Arithmetic; Combinatorics; Telecommunications; Computer science","score_opus":0.009141523871078985,"score_gpt":0.213803388938798,"score_spread":0.204661865067719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972117245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3063457,0.0014748615,0.4986527,0.0045020003,0.00029476234,0.0000785302,0.0011820623,0.0006122811,0.18685707],"genre_scores_gemma":[0.8019798,0.0018393332,0.13906671,0.0016784664,0.0004943233,0.00026852157,0.0017356932,0.00053352944,0.05240358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988588,0.0003795295,0.000064604734,0.0002840592,0.00024330887,0.00016971382],"domain_scores_gemma":[0.9955634,0.0025044465,0.00029786184,0.00073194003,0.000445644,0.00045667202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016704751,0.00079761114,0.0010942192,0.0022150518,0.0029049432,0.0040473645,0.0018671715,0.001853205,0.010182587],"category_scores_gemma":[0.0053990846,0.0007897591,0.0013117822,0.0032488543,0.0029932673,0.007861295,0.003619812,0.004041266,0.000966251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001798554,0.000008335354,0.00009720592,0.000036588644,0.000005077691,0.000011549947,0.00009100093,0.000907439,0.00022400355,0.99439776,0.0012405077,0.0029626717],"study_design_scores_gemma":[0.0000060644293,0.00000387698,0.00007103711,0.0000065597064,0.0000074723907,0.000024665416,0.00003219635,0.0036569058,0.00017162289,0.9942801,0.0017354893,0.0000039762617],"about_ca_topic_score_codex":0.0012583421,"about_ca_topic_score_gemma":0.002228185,"teacher_disagreement_score":0.010182587,"about_ca_system_score_codex":0.0020112195,"about_ca_system_score_gemma":0.00080667494,"threshold_uncertainty_score":0.034064174},"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":"W2982664983","doi":"","title":"Optimal resolvable 2 x c grid-block Coverings","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Manufacturing and Logistics Optimization","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; Block (permutation group theory); Grid; Combinatorics; Arithmetic; Geometry","score_opus":0.016181279110236178,"score_gpt":0.2435606960975104,"score_spread":0.22737941698727424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982664983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24215078,0.00083915034,0.6861692,0.0007023841,0.00014491842,0.00012291926,0.0014884901,0.0007750184,0.067607164],"genre_scores_gemma":[0.75128835,0.0008103203,0.21845745,0.00019892516,0.000056126963,0.00026951288,0.001332441,0.00037112192,0.027215663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949455,0.00016377511,0.00002043468,0.000068581845,0.00011418961,0.00013845526],"domain_scores_gemma":[0.9987778,0.00067643187,0.00010132027,0.00020779301,0.000098596734,0.00013799584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005035563,0.0008369013,0.0011650787,0.0007078103,0.0006998712,0.0016113244,0.0013754482,0.001319661,0.010920571],"category_scores_gemma":[0.0029144776,0.0006475877,0.0006758696,0.0012798645,0.0007665941,0.0013298684,0.0018757649,0.0013792325,0.0013439565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000445703,0.000090597394,0.00059209415,0.00029460393,0.000050938055,0.00018025881,0.00018302818,0.47697657,0.0075449646,0.45095894,0.010557573,0.05212476],"study_design_scores_gemma":[0.00006804211,0.00007194989,0.00035933906,0.000027594988,0.000014748728,0.000109847955,0.00006978573,0.7866887,0.0024111727,0.20409031,0.0060691726,0.000019276977],"about_ca_topic_score_codex":0.0030791555,"about_ca_topic_score_gemma":0.003176496,"teacher_disagreement_score":0.010920571,"about_ca_system_score_codex":0.0010644601,"about_ca_system_score_gemma":0.0007346048,"threshold_uncertainty_score":0.036532998},"labels":[],"label_agreement":null},{"id":"W3002621974","doi":"","title":"Locating Roman Domination in Graphs","year":2019,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Religion and Society Interactions","field":"Social Sciences","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","score_opus":0.015714449987959466,"score_gpt":0.32640178529449965,"score_spread":0.3106873353065402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002621974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81747884,0.0008891092,0.11537052,0.0014455884,0.00004025961,0.00007128531,0.0007710275,0.00035446044,0.06357906],"genre_scores_gemma":[0.97820264,0.00017594467,0.018050037,0.000029036091,0.000010700592,0.000017546134,0.0003180561,0.000055041786,0.0031410386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929035,0.0003456448,0.000022689013,0.00014187045,0.000106535306,0.00009298885],"domain_scores_gemma":[0.9939381,0.004250499,0.00053140585,0.0006252451,0.00043187087,0.00022285256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079135917,0.00035602463,0.0005728806,0.0034243537,0.0018702041,0.003187437,0.0010301047,0.0009985485,0.01045624],"category_scores_gemma":[0.01132621,0.00043048218,0.0004162909,0.004405907,0.00234738,0.005020414,0.002236927,0.0008379215,0.0008559386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005408312,0.000080048136,0.025068797,0.00031426112,0.000074736556,0.0006503409,0.0091169495,0.02911139,0.0036611017,0.84591895,0.0052822605,0.08018028],"study_design_scores_gemma":[0.000048369246,0.000046003963,0.0067097745,0.0001301794,0.000061913954,0.0004910181,0.008618188,0.08681684,0.0024673326,0.8760562,0.018523606,0.000030485333],"about_ca_topic_score_codex":0.004511728,"about_ca_topic_score_gemma":0.005483863,"teacher_disagreement_score":0.01045624,"about_ca_system_score_codex":0.0012027245,"about_ca_system_score_gemma":0.00048393253,"threshold_uncertainty_score":0.03497958},"labels":[],"label_agreement":null},{"id":"W3106187897","doi":"","title":"Antimagicness of star forests","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"African Botany and Ecology Studies","field":"Agricultural and Biological Sciences","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; Star (game theory); Mathematical analysis","score_opus":0.027686560960958534,"score_gpt":0.24601147773530999,"score_spread":0.21832491677435145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106187897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821278,0.00011737143,0.0075791427,0.00015852149,0.0000055056307,0.0000030053961,0.000037407488,0.000016058777,0.009955173],"genre_scores_gemma":[0.9980862,0.00006773357,0.0008162565,0.0000082403285,0.000008015675,0.0000026922041,0.00002501424,0.0000039018405,0.0009819096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972385,0.00010030766,0.000016482176,0.000052159918,0.00004550267,0.00006165066],"domain_scores_gemma":[0.99661934,0.0019562857,0.00045808818,0.00022056268,0.00027119118,0.00047437657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087758835,0.00013188935,0.00035717982,0.0010093859,0.0011734589,0.0016951511,0.00045248555,0.0002882168,0.0032014363],"category_scores_gemma":[0.0053505367,0.0001465865,0.0003141461,0.0007842376,0.0014047086,0.0014984459,0.0012949593,0.0004703536,0.00016677979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022854116,0.000042613654,0.026398603,0.00007868047,0.000048258134,0.0002404802,0.001451899,0.011594237,0.004045684,0.937925,0.0005905055,0.017355444],"study_design_scores_gemma":[0.000036483387,0.00010223338,0.022851668,0.000021475476,0.000049955892,0.00056423515,0.0011658424,0.0633011,0.0013741474,0.90809375,0.002416163,0.000023020582],"about_ca_topic_score_codex":0.0012571837,"about_ca_topic_score_gemma":0.0015365002,"teacher_disagreement_score":0.0032014363,"about_ca_system_score_codex":0.00060818694,"about_ca_system_score_gemma":0.0003851435,"threshold_uncertainty_score":0.010709822},"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":"W3136843670","doi":"","title":"On symmetric (78, 22, 6) designs and related self-orthogonal codes","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","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; Orthogonal array; Combinatorics; Arithmetic; Discrete mathematics; Statistics","score_opus":0.01960781965211929,"score_gpt":0.24961681807749406,"score_spread":0.23000899842537476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136843670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5203271,0.0017502736,0.24312504,0.004015041,0.0008610392,0.00018062482,0.00062264537,0.0002468066,0.2288715],"genre_scores_gemma":[0.8962194,0.0015112937,0.0459436,0.0010299785,0.00085879525,0.00026618066,0.0003357588,0.00015661838,0.05367844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984604,0.0006110672,0.00006548785,0.00016713026,0.0004055609,0.00029040076],"domain_scores_gemma":[0.9969099,0.0014610325,0.0006138512,0.00044379602,0.00035998973,0.00021153665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016864585,0.001008835,0.00067534164,0.0021244152,0.0022353374,0.002469371,0.0009775274,0.0020207807,0.0072608767],"category_scores_gemma":[0.005694233,0.0005497917,0.00074020895,0.0021077301,0.0036354063,0.0036017871,0.002819199,0.0022383013,0.0016990781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000217166,0.0000069448956,0.00005440405,0.000012295168,0.0000020392288,0.000027587883,0.000085322434,0.0007494785,0.00022052498,0.9960224,0.00043812065,0.0023592554],"study_design_scores_gemma":[0.0000121133,0.000011471256,0.000043285218,0.00001119653,0.0000030296683,0.00005483999,0.00003078228,0.0026992713,0.00022939757,0.9955701,0.0013244713,0.000010021212],"about_ca_topic_score_codex":0.00067035883,"about_ca_topic_score_gemma":0.0007362111,"teacher_disagreement_score":0.0072608767,"about_ca_system_score_codex":0.0016170947,"about_ca_system_score_gemma":0.0014532759,"threshold_uncertainty_score":0.024290085},"labels":[],"label_agreement":null},{"id":"W3142143633","doi":"","title":"Edge colored complete graphs and a generalization of self-complementarity","year":2016,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Colored; Generalization; Combinatorics; Discrete mathematics; Sociology","score_opus":0.02533350222738299,"score_gpt":0.24251408926330978,"score_spread":0.2171805870359268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142143633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26098153,0.0016906465,0.5973394,0.0045246333,0.0003336909,0.0000793303,0.00041595372,0.00022283728,0.13441205],"genre_scores_gemma":[0.87769973,0.001202722,0.09132648,0.0010694405,0.00039107335,0.0001418373,0.00032372537,0.00015412012,0.027690839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925464,0.0003256719,0.00002371634,0.00015791552,0.00012477238,0.00011329549],"domain_scores_gemma":[0.9975139,0.0014839364,0.00022289986,0.0002993559,0.00022648994,0.0002534891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012745745,0.000528457,0.0008229696,0.0014831172,0.002287259,0.0025396876,0.0017993443,0.0016533894,0.0065247337],"category_scores_gemma":[0.0037644408,0.0006263876,0.0011060148,0.0016608349,0.0035304101,0.0048462353,0.0024087285,0.0030423542,0.00033419605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051951724,0.000006189905,0.000054315882,0.000013157951,0.000003308431,0.000012754778,0.00003812881,0.0017507408,0.000111700814,0.99664223,0.00049305585,0.0008693247],"study_design_scores_gemma":[0.000004712555,0.0000022054592,0.000054455162,0.0000057850716,0.0000031928764,0.000020233923,0.000023516866,0.010144024,0.00007500642,0.9883831,0.0012796085,0.0000040470863],"about_ca_topic_score_codex":0.0029743707,"about_ca_topic_score_gemma":0.0033444276,"teacher_disagreement_score":0.0065247337,"about_ca_system_score_codex":0.001755271,"about_ca_system_score_gemma":0.0010815555,"threshold_uncertainty_score":0.02182746},"labels":[],"label_agreement":null},{"id":"W3154933793","doi":"","title":"Frequency magic squares","year":2002,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Color perception and design","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Magic square; MAGIC (telescope); Statistics; Arithmetic; Combinatorics; Astronomy; Physics","score_opus":0.08357442070465114,"score_gpt":0.32169706169193973,"score_spread":0.23812264098728858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154933793","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.062668934,0.00054660346,0.70852625,0.00047833566,0.00073689705,0.000083271356,0.00025542857,0.0018586573,0.22484568],"genre_scores_gemma":[0.5783762,0.00039124637,0.31594583,0.00030949013,0.0002133606,0.00014161899,0.00038734855,0.00091673195,0.103318214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996377,0.000068147,0.000015017811,0.00010429329,0.00014252878,0.00003226702],"domain_scores_gemma":[0.9994661,0.00013718785,0.000036205747,0.00018297706,0.00013234143,0.000045166467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023661021,0.0004982803,0.00042465987,0.0008090039,0.00074948935,0.0013204771,0.00060878857,0.00065384706,0.052409146],"category_scores_gemma":[0.001991048,0.00039581794,0.0003395414,0.0007716777,0.00053093594,0.0014276053,0.00085087697,0.0008865483,0.0061952765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043215955,0.000056575198,0.0005255709,0.00015437216,0.000027730723,0.0000962854,0.00017453698,0.0057036066,0.038598467,0.6176222,0.011298937,0.32530954],"study_design_scores_gemma":[0.00017077112,0.00030788122,0.0020646732,0.00007918363,0.00006450176,0.0012403899,0.00022821453,0.08852993,0.052309517,0.62985116,0.22506425,0.00008954139],"about_ca_topic_score_codex":0.00024450215,"about_ca_topic_score_gemma":0.00036751124,"teacher_disagreement_score":0.052409146,"about_ca_system_score_codex":0.00027546947,"about_ca_system_score_gemma":0.0002205317,"threshold_uncertainty_score":0.17532605},"labels":[],"label_agreement":null},{"id":"W3158636128","doi":"","title":"Refining overlined parts in overpartitions via residue classes: Bijections, generating functions, and congruences","year":2014,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"Bijection, injection and surjection; Congruence relation; Mathematics; Residue (chemistry); Arithmetic; Bijection; Chemistry; Combinatorics; Organic chemistry","score_opus":0.03974363941254656,"score_gpt":0.31546716743910386,"score_spread":0.2757235280265573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158636128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3711521,0.0010701865,0.45525703,0.001931573,0.0005988793,0.000105968786,0.00019812478,0.0007830746,0.16890304],"genre_scores_gemma":[0.9224653,0.00052965217,0.045060758,0.000509759,0.00036347995,0.00008555264,0.00018715253,0.00097152416,0.029826809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996894,0.0011058106,0.00018847345,0.0006046876,0.0007082032,0.0004988364],"domain_scores_gemma":[0.99606293,0.0016922711,0.00029140787,0.0010970151,0.00044107105,0.0004152823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036203763,0.0011107821,0.0012565718,0.0029342906,0.003866084,0.0065325834,0.0015257216,0.0016771405,0.009801557],"category_scores_gemma":[0.008915385,0.001005073,0.0018261637,0.0018745521,0.007194445,0.012193173,0.004992859,0.005172102,0.0017380088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013574832,0.000012813755,0.00006462499,0.000009080137,0.000002844886,0.00004061049,0.000307373,0.00037615525,0.00037541235,0.99597365,0.00028444355,0.0025393872],"study_design_scores_gemma":[0.0000048025254,0.0000050577637,0.000032873624,0.000006216945,0.000003437353,0.0000313429,0.000050384806,0.0011404594,0.000360021,0.9971372,0.001222346,0.0000057903053],"about_ca_topic_score_codex":0.0008642837,"about_ca_topic_score_gemma":0.0007975891,"teacher_disagreement_score":0.009801557,"about_ca_system_score_codex":0.0016119665,"about_ca_system_score_gemma":0.0006378818,"threshold_uncertainty_score":0.03278953},"labels":[],"label_agreement":null},{"id":"W3167302999","doi":"","title":"Convergent discrete numerical solutions of strongly coupled mixed parabolic systems","year":2003,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","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":"Mathematics; Applied mathematics; Mathematical analysis","score_opus":0.027698339752124792,"score_gpt":0.2588214933353558,"score_spread":0.23112315358323102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167302999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27833596,0.0009926396,0.6786338,0.0025028116,0.00043814236,0.00015159811,0.00018401438,0.0003603033,0.038400687],"genre_scores_gemma":[0.937092,0.0002831716,0.04738744,0.00013747232,0.00007737251,0.00014613268,0.00009603285,0.00008360301,0.014696662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995389,0.00017320093,0.000025169089,0.000046469126,0.00016747393,0.00004881594],"domain_scores_gemma":[0.99853396,0.00068510283,0.00016370167,0.0001240306,0.00031684345,0.0001763402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013979552,0.0007372536,0.0007269945,0.0006318393,0.0005007729,0.0017612299,0.00095042883,0.001387298,0.0022769265],"category_scores_gemma":[0.0054029473,0.00043456236,0.0005175166,0.00029524128,0.0020731774,0.0010992723,0.003452273,0.0014406107,0.00028173925],"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.00025751855,0.00009696148,0.0014312414,0.00019715543,0.000081618455,0.00021685794,0.00036701886,0.7712992,0.009398676,0.20259355,0.0012977682,0.012762411],"study_design_scores_gemma":[0.000014115129,0.000015959156,0.00005825727,0.000006961024,0.0000026103046,0.000008873617,0.000020046076,0.9896958,0.00045611893,0.009379075,0.00033761718,0.0000046174573],"about_ca_topic_score_codex":0.0035787039,"about_ca_topic_score_gemma":0.002107974,"teacher_disagreement_score":0.0035787039,"about_ca_system_score_codex":0.0011491993,"about_ca_system_score_gemma":0.00094670936,"threshold_uncertainty_score":0.008338034},"labels":[],"label_agreement":null},{"id":"W3172701151","doi":"","title":"NP-completeness of two pencil puzzles: Yajilin and Country Road","year":2012,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Completeness (order theory); Pencil (optics); Mathematics; Mathematics education; Statistics; Mathematical analysis; Engineering","score_opus":0.032001315473700685,"score_gpt":0.29582403047800204,"score_spread":0.2638227150043014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172701151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5435999,0.0034608664,0.16077274,0.030769974,0.0008037325,0.00024018761,0.0024980684,0.0014314158,0.2564231],"genre_scores_gemma":[0.92863554,0.0009300906,0.036047846,0.0012810848,0.00015680371,0.00015729378,0.0019356943,0.0003892375,0.030466493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866915,0.00043121167,0.00008806871,0.0003846151,0.00018875668,0.00023813431],"domain_scores_gemma":[0.99291974,0.0054944498,0.00028883884,0.00058001437,0.0004228997,0.00029409275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010706903,0.0007640327,0.0015634521,0.0008439219,0.004532503,0.004837022,0.0018633966,0.0033647285,0.017034471],"category_scores_gemma":[0.011502699,0.0008587087,0.0020274625,0.0016944637,0.0036202387,0.011706954,0.0034032562,0.005425832,0.0017101689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050990476,0.00015530216,0.0013361659,0.00044635747,0.00006870316,0.00063869474,0.0017333407,0.022310635,0.0011505103,0.91404694,0.027734097,0.029869346],"study_design_scores_gemma":[0.00008715264,0.00002984574,0.0004225411,0.000054593478,0.000036091584,0.00019393316,0.00063090795,0.020671925,0.00071748253,0.96326524,0.013858297,0.000031902942],"about_ca_topic_score_codex":0.0058172345,"about_ca_topic_score_gemma":0.004844214,"teacher_disagreement_score":0.017034471,"about_ca_system_score_codex":0.0020251963,"about_ca_system_score_gemma":0.002411363,"threshold_uncertainty_score":0.056985974},"labels":[],"label_agreement":null},{"id":"W3176886010","doi":"","title":"On the maximum of generalized stirling numbers","year":2011,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stirling engine; Stirling numbers of the second kind; Stirling numbers of the first kind; Stirling number; Arithmetic; Mathematical economics; Combinatorics; Thermodynamics; Physics","score_opus":0.09004733400857808,"score_gpt":0.2883204379227752,"score_spread":0.1982731039141971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176886010","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.45819873,0.011955069,0.22828047,0.0058495337,0.001306464,0.000049866747,0.00026272767,0.00063709385,0.2934601],"genre_scores_gemma":[0.94566333,0.00304076,0.025393415,0.0005230637,0.0014183163,0.000073349576,0.00012159183,0.0001646806,0.023601476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990243,0.00032811015,0.000046652243,0.00018197388,0.00023596425,0.0001830047],"domain_scores_gemma":[0.9960913,0.0024489146,0.000349055,0.00033791648,0.00035297728,0.00041975893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027117196,0.0009420342,0.0014728577,0.0034745156,0.0019297943,0.004218145,0.0014173277,0.0012158325,0.006717772],"category_scores_gemma":[0.009391738,0.00064504374,0.00094972143,0.002227284,0.005388037,0.00742159,0.0026398934,0.0028928858,0.0010009453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025325531,0.0000049099153,0.0000651571,0.00002639478,0.00000398146,0.000017764645,0.00006728467,0.00070638553,0.00028307922,0.9953596,0.00039433062,0.0030457836],"study_design_scores_gemma":[0.0000064985884,0.000008585036,0.00009196632,0.000014440535,0.000005013934,0.00003906761,0.000024691335,0.0024398507,0.00019477682,0.99581957,0.001345558,0.000009971112],"about_ca_topic_score_codex":0.0006004969,"about_ca_topic_score_gemma":0.00086437963,"teacher_disagreement_score":0.006717772,"about_ca_system_score_codex":0.0019490599,"about_ca_system_score_gemma":0.000947036,"threshold_uncertainty_score":0.022473156},"labels":[],"label_agreement":null},{"id":"W3181262263","doi":"","title":"18. Uncrossed Chords of Cycles in Chordal Graphs","year":2020,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Chordal graph; Mathematics; Combinatorics; Indifference graph; Interval graph; Pathwidth; Maximal independent set; Treewidth; Discrete mathematics; Graph; 1-planar graph; Line graph","score_opus":0.052886635506897595,"score_gpt":0.3239464415025009,"score_spread":0.2710598059956033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181262263","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.35798123,0.006453349,0.21009028,0.0026149412,0.001000976,0.00022045606,0.0023597286,0.00054083695,0.41873816],"genre_scores_gemma":[0.91005176,0.002224701,0.049566034,0.00059942866,0.00046216807,0.000119855256,0.001067184,0.00012433,0.035784505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929786,0.00009466774,0.0000607395,0.00021680947,0.00020120885,0.00012872246],"domain_scores_gemma":[0.99865925,0.00031307974,0.0002766827,0.00014205236,0.00040382522,0.00020507496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038304465,0.00048435805,0.000310604,0.0014144077,0.0011650444,0.0022816947,0.00060245086,0.0005108051,0.008076308],"category_scores_gemma":[0.0019867641,0.00022978632,0.00046186047,0.0015693696,0.0020281186,0.0028872944,0.0012430098,0.001095915,0.0012980087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050481227,0.000011808761,0.0006429307,0.000090848785,0.000008993978,0.0001308407,0.00028162342,0.0008973554,0.0018108209,0.975828,0.002642289,0.017603934],"study_design_scores_gemma":[0.00001619892,0.000033336622,0.00092745764,0.000036934573,0.000013765148,0.00040415698,0.00024718608,0.0023404066,0.0017008394,0.9494296,0.044833705,0.000016457216],"about_ca_topic_score_codex":0.0018444143,"about_ca_topic_score_gemma":0.0015462148,"teacher_disagreement_score":0.008076308,"about_ca_system_score_codex":0.0011492196,"about_ca_system_score_gemma":0.0005645238,"threshold_uncertainty_score":0.027017951},"labels":[],"label_agreement":null},{"id":"W3181951514","doi":"","title":"On 2-dimensional dual hyperovals of polar type","year":2008,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","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":"Dual (grammatical number); Mathematics; Polar; Type (biology); Arithmetic; Combinatorics; Biology; Physics","score_opus":0.12654262837484248,"score_gpt":0.3571488056256548,"score_spread":0.23060617725081234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181951514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54989856,0.0023244342,0.23606054,0.0027624816,0.0009156134,0.00014634005,0.0010218536,0.00021758614,0.20665257],"genre_scores_gemma":[0.921728,0.0012674937,0.040857278,0.0004444169,0.00045201182,0.00011665674,0.00081648177,0.00014088865,0.034176733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944276,0.00020280687,0.00002963673,0.000073204224,0.0001254991,0.00012614368],"domain_scores_gemma":[0.998727,0.00046384646,0.00023985507,0.00006715643,0.00019625993,0.000305813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012105965,0.0009400115,0.0011485805,0.003856752,0.0025612253,0.0057257065,0.00090298976,0.0015354259,0.0075813727],"category_scores_gemma":[0.00328638,0.0006376046,0.0010621945,0.0017367468,0.0031635466,0.0035388225,0.0029642363,0.0026592137,0.0008828695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007184944,0.000014069685,0.00021479266,0.000032564647,0.000010136178,0.00013785038,0.00012682656,0.0018687716,0.0003367419,0.99440974,0.0007336639,0.0020429613],"study_design_scores_gemma":[0.000025162046,0.000016054059,0.00021973462,0.000036231,0.000012124897,0.00021461745,0.0002193155,0.011940039,0.00027563417,0.98432,0.0027064835,0.000014574722],"about_ca_topic_score_codex":0.0012307498,"about_ca_topic_score_gemma":0.0008603291,"teacher_disagreement_score":0.0075813727,"about_ca_system_score_codex":0.0012928526,"about_ca_system_score_gemma":0.0004698094,"threshold_uncertainty_score":0.025362253},"labels":[],"label_agreement":null},{"id":"W3184463101","doi":"","title":"5. SOME EXTREMAL GRAPHS WITH RESPECT TO THE ZEROTH-ORDER GENERAL RANDIC INDEX","year":2020,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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; Independence number; Graph; Upper and lower bounds; Invariant (physics); Matching (statistics); Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.04478669488987825,"score_gpt":0.2903861804508267,"score_spread":0.24559948556094846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184463101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82526934,0.0012585142,0.10509577,0.0005303145,0.000041921558,0.000038694492,0.00040631767,0.0003054718,0.06705364],"genre_scores_gemma":[0.98139507,0.0002923696,0.01474602,0.000068276284,0.000033109336,0.000019832765,0.0001893215,0.000040053663,0.003215882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994665,0.00012083963,0.000022461616,0.00016452112,0.00010093505,0.00012471055],"domain_scores_gemma":[0.99830484,0.0006834827,0.00040492424,0.0002204903,0.00020488726,0.00018124087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649011,0.0003954634,0.00056984054,0.0022837645,0.0012286929,0.0016180043,0.0008257948,0.00052727107,0.003448384],"category_scores_gemma":[0.0026432916,0.00029619702,0.000655991,0.0009363952,0.001533192,0.001729543,0.0006531298,0.0011119636,0.0002971185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013039826,0.000029208159,0.002056328,0.00010567236,0.000033871493,0.00018031844,0.00021303313,0.015792796,0.006933945,0.9642681,0.0009007869,0.009355507],"study_design_scores_gemma":[0.000027730337,0.000059911068,0.0043213936,0.000041183106,0.000046347548,0.0005079265,0.00026975427,0.072978914,0.0063476376,0.9112204,0.0041295984,0.000049188904],"about_ca_topic_score_codex":0.0009889596,"about_ca_topic_score_gemma":0.0012916845,"teacher_disagreement_score":0.003448384,"about_ca_system_score_codex":0.0011217032,"about_ca_system_score_gemma":0.0003340247,"threshold_uncertainty_score":0.011536062},"labels":[],"label_agreement":null},{"id":"W3189065149","doi":"","title":"Some optimal codes and strongly regular graphs from the linear group L(4, 3)","year":2012,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","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; Group (periodic table); Discrete mathematics","score_opus":0.018421924291718222,"score_gpt":0.23843827640479506,"score_spread":0.22001635211307685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189065149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74160475,0.0013807598,0.14802982,0.005282368,0.00030586144,0.00012453816,0.00096470467,0.00035794583,0.10194919],"genre_scores_gemma":[0.9547862,0.00063302164,0.02643754,0.00053364824,0.00033052187,0.00012632778,0.0005445039,0.00014065813,0.016467594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.00022762654,0.000036354766,0.00012402308,0.0001951168,0.00017392785],"domain_scores_gemma":[0.997664,0.00119741,0.00040392825,0.00023843111,0.00023814522,0.00025824967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007062097,0.00068312534,0.0006141291,0.0014828404,0.0015161862,0.0019647933,0.00096844503,0.0014769926,0.0039025818],"category_scores_gemma":[0.0038982246,0.00051143096,0.0007932096,0.0010155671,0.002559854,0.0024434612,0.0014762236,0.002192272,0.00051029073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005509473,0.000019517462,0.00020900425,0.000038436287,0.000007193232,0.000068753376,0.00015657295,0.0028421746,0.00076042436,0.99085546,0.0012581794,0.0037291688],"study_design_scores_gemma":[0.000021301981,0.000015870999,0.00015521284,0.0000097405355,0.0000052534324,0.000051882063,0.000054599266,0.0076647843,0.0005593564,0.990275,0.0011768887,0.000010228536],"about_ca_topic_score_codex":0.0012381043,"about_ca_topic_score_gemma":0.0014923235,"teacher_disagreement_score":0.0039025818,"about_ca_system_score_codex":0.0015567747,"about_ca_system_score_gemma":0.0013837874,"threshold_uncertainty_score":0.013055444},"labels":[],"label_agreement":null},{"id":"W3197765233","doi":"","title":"On SD-prime labeling of graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics; Arithmetic","score_opus":0.018390166044543903,"score_gpt":0.25669841888597994,"score_spread":0.23830825284143603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197765233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32729545,0.0025472415,0.5251175,0.012790558,0.00052833103,0.00008682578,0.0009693633,0.0005169809,0.13014778],"genre_scores_gemma":[0.8577595,0.002254523,0.09951796,0.0016283117,0.0009094604,0.00025296904,0.0012257225,0.00042183365,0.036029864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998705,0.00057597196,0.00004974746,0.0002895277,0.00020121706,0.00017843443],"domain_scores_gemma":[0.9932928,0.004600204,0.00043818998,0.00072668487,0.00041483017,0.00052727223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023290706,0.0010257341,0.0013494934,0.0021752827,0.0027518298,0.0041145147,0.0018953606,0.0019525989,0.008613821],"category_scores_gemma":[0.009270781,0.0007858284,0.0013065216,0.0031189362,0.00528668,0.009393295,0.004240753,0.0054154866,0.0009528533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027829115,0.000014691117,0.00020867996,0.000039461065,0.0000035938876,0.000014542854,0.0001482097,0.0015524062,0.00015997133,0.9930906,0.0013151306,0.00342486],"study_design_scores_gemma":[0.000007333914,0.0000033762378,0.00006841702,0.000006955726,0.0000035992482,0.000014295979,0.00003295319,0.0044307397,0.00008487663,0.99438226,0.0009610196,0.0000040734994],"about_ca_topic_score_codex":0.0026001043,"about_ca_topic_score_gemma":0.0024759928,"teacher_disagreement_score":0.008613821,"about_ca_system_score_codex":0.0029973611,"about_ca_system_score_gemma":0.0013372622,"threshold_uncertainty_score":0.028816104},"labels":[],"label_agreement":null},{"id":"W3202928722","doi":"","title":"A survey on alliances in graphs: Defensive alliances","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"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; Alliance; Realizability; Vertex (graph theory); Graph; Mathematics; Combinatorics; Computer science; Geography; Algorithm","score_opus":0.08717187670400472,"score_gpt":0.3625151750718749,"score_spread":0.2753432983678702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202928722","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.06549171,0.38186604,0.36309913,0.013523072,0.00180216,0.0001827917,0.0021578074,0.00053289987,0.17134447],"genre_scores_gemma":[0.38781163,0.44692323,0.1293094,0.0035287195,0.005973436,0.00043623164,0.0039480454,0.00042954364,0.02163979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982533,0.0004657203,0.00013922495,0.0005282119,0.0004252966,0.00018818624],"domain_scores_gemma":[0.9962119,0.0026520537,0.00025446873,0.0004202608,0.00028571344,0.00017562973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978425,0.0012321167,0.0015454722,0.003421678,0.0017144865,0.004779015,0.0019355835,0.0020165988,0.007360709],"category_scores_gemma":[0.004791434,0.00094636035,0.0015077716,0.009748046,0.0028942053,0.013852441,0.002155777,0.0032153288,0.0018157682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060192637,0.000091103815,0.0022189834,0.0022604822,0.00007083003,0.00018162305,0.0006310556,0.0073195007,0.0006395815,0.8533604,0.019732477,0.11343374],"study_design_scores_gemma":[0.000015060317,0.00007122086,0.002086513,0.0006874277,0.00007223874,0.0015066438,0.0005304481,0.010723122,0.00052915415,0.8140213,0.1697046,0.00005224856],"about_ca_topic_score_codex":0.0015492315,"about_ca_topic_score_gemma":0.0012904236,"teacher_disagreement_score":0.007360709,"about_ca_system_score_codex":0.0022627003,"about_ca_system_score_gemma":0.0011966081,"threshold_uncertainty_score":0.02462399},"labels":[],"label_agreement":null},{"id":"W3209736999","doi":"","title":"Cauchy’s means of Mercer Type","year":2011,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Functional Equations Stability Results","field":"Mathematics","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; Type (biology); Cauchy distribution; Statistics; Geology","score_opus":0.1988763507986497,"score_gpt":0.32838094365223186,"score_spread":0.12950459285358215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209736999","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.0816495,0.006790799,0.558746,0.0098406505,0.0019007054,0.00005586441,0.0003607925,0.00036680282,0.3402889],"genre_scores_gemma":[0.70480037,0.005420795,0.13221034,0.00170325,0.0030273213,0.00019668623,0.00026894076,0.0005776725,0.15179461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.0002508842,0.000043719083,0.00016360538,0.00024240561,0.00006901618],"domain_scores_gemma":[0.9983432,0.00072782126,0.00013249654,0.00023673219,0.00042441092,0.00013539217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021766257,0.0011399225,0.0012854524,0.003336834,0.0020007694,0.0022236365,0.0012054478,0.0020094756,0.007549867],"category_scores_gemma":[0.005155728,0.0005216905,0.0018245678,0.0016199696,0.0038476854,0.00618268,0.0032237268,0.005297255,0.0013286739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061239652,0.0000037266102,0.000025807874,0.000017059527,0.0000075121534,0.000015750482,0.000071067196,0.00017905129,0.00027473166,0.9963522,0.00075909286,0.0022877753],"study_design_scores_gemma":[0.000005284126,0.000007989902,0.00011969998,0.000009039026,0.000009820288,0.00009558817,0.00002920102,0.002636913,0.00046308618,0.99073654,0.005875458,0.0000114409895],"about_ca_topic_score_codex":0.0007212204,"about_ca_topic_score_gemma":0.00072307745,"teacher_disagreement_score":0.007549867,"about_ca_system_score_codex":0.0017984007,"about_ca_system_score_gemma":0.0006960436,"threshold_uncertainty_score":0.025256753},"labels":[],"label_agreement":null},{"id":"W341212695","doi":"","title":"New results on harmonies trees","year":2007,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Harmony (Music); Mathematics; Art","score_opus":0.06585452461742525,"score_gpt":0.33920892608600683,"score_spread":0.2733544014685816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W341212695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1267323,0.009040008,0.43630737,0.009852619,0.0027499953,0.000104772225,0.00087520736,0.0007850285,0.4135527],"genre_scores_gemma":[0.63016367,0.012312239,0.14004073,0.0045132586,0.0059938026,0.00029164084,0.0015637119,0.0014752651,0.20364568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905974,0.00020208964,0.00005158082,0.00025565023,0.00031458653,0.00011639446],"domain_scores_gemma":[0.9972127,0.0015855696,0.00023278987,0.00036712064,0.00030644157,0.00029544937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062794,0.0008034521,0.0012571046,0.0036494078,0.0029447875,0.003344819,0.0019094723,0.0014433889,0.01896854],"category_scores_gemma":[0.0045207962,0.00090155366,0.0012657348,0.0050251656,0.003059432,0.010642274,0.0042011067,0.005175572,0.0024565612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016313143,0.00001778774,0.00012600404,0.00006526184,0.000012880991,0.000049198843,0.00022525828,0.0007412703,0.00036178573,0.9816886,0.004227294,0.012468331],"study_design_scores_gemma":[0.0000065134927,0.0000061117335,0.00014076103,0.000011660628,0.000014339151,0.00007716813,0.000080061756,0.0017086156,0.00016929753,0.98507917,0.012700327,0.0000061180667],"about_ca_topic_score_codex":0.00081355113,"about_ca_topic_score_gemma":0.0011926447,"teacher_disagreement_score":0.01896854,"about_ca_system_score_codex":0.0012067793,"about_ca_system_score_gemma":0.00050940603,"threshold_uncertainty_score":0.06345612},"labels":[],"label_agreement":null},{"id":"W34343354","doi":"10.1002/cncr.33796","title":"Proportionally balanced designs: Some further results and general constructions","year":2001,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","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":"MorphoSys","keywords":"Mathematics; Property (philosophy); Arithmetic; Gray (unit); Core (optical fiber); Unit (ring theory); Test (biology); Mathematics education; Computer science; Epistemology","score_opus":0.1728849121065833,"score_gpt":0.4317869108608392,"score_spread":0.2589019987542559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34343354","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.002032694,0.001319007,0.99109787,0.0010631704,0.0003062471,0.0008311966,0.00031822556,0.0001541078,0.002877577],"genre_scores_gemma":[0.065141276,0.003408299,0.9120239,0.0015986896,0.0009418008,0.010884091,0.00067728385,0.00020853228,0.0051160236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.88545763,0.09742196,0.0044243564,0.0054052784,0.005833977,0.0014567454],"domain_scores_gemma":[0.64609045,0.32313648,0.005661912,0.016943112,0.007334021,0.0008341111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.16115019,0.004990361,0.007443862,0.0036675397,0.0016110383,0.003413924,0.0036839128,0.0031816005,0.01845721],"category_scores_gemma":[0.25783688,0.0020314897,0.008293312,0.0056230966,0.0054495465,0.007990217,0.005063307,0.006847522,0.0017595934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012095993,0.00025186868,0.0009877528,0.0018047331,0.0007866038,0.00023977617,0.0005188353,0.025821993,0.0004221979,0.86436164,0.0067090783,0.09688601],"study_design_scores_gemma":[0.00072345533,0.00047322383,0.00036199664,0.00022864454,0.00030914106,0.00011194532,0.00006705886,0.06541246,0.00046056305,0.921548,0.010241028,0.00006246122],"about_ca_topic_score_codex":0.0028724927,"about_ca_topic_score_gemma":0.0015446161,"teacher_disagreement_score":0.16115019,"about_ca_system_score_codex":0.003887555,"about_ca_system_score_gemma":0.0048372243,"threshold_uncertainty_score":0.85225385},"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":"W4299855045","doi":"10.61091/um120-08","title":"The Irredundance-related Ramsey Numbers \\(s(3,8)=21\\) and \\(w(3,8)=21\\)","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","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.012034791693647398,"score_gpt":0.2532623746589746,"score_spread":0.2412275829653272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299855045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7493145,0.0013398142,0.10539312,0.00198644,0.0003860726,0.00013239415,0.00075303763,0.00028170203,0.14041297],"genre_scores_gemma":[0.970991,0.00044584993,0.019605564,0.0002318798,0.0000990208,0.000101608755,0.00040186962,0.00004893991,0.008074231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999361,0.00012800621,0.00004887269,0.00018534482,0.00012780276,0.00014902664],"domain_scores_gemma":[0.9983335,0.000479751,0.0003579191,0.0001930663,0.0002770111,0.00035877313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084875745,0.0005014333,0.00037961535,0.0010648952,0.0015665874,0.0015242558,0.00054484827,0.0007152587,0.006036076],"category_scores_gemma":[0.0029144806,0.0003286676,0.000559832,0.00061905873,0.0022744029,0.0027787967,0.0013605348,0.0018277394,0.00068931485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013691164,0.000035734956,0.0010134892,0.000081167134,0.000011477209,0.000095820666,0.00038146286,0.0013113382,0.004220275,0.97607577,0.0019025155,0.014734058],"study_design_scores_gemma":[0.000025703095,0.000051732233,0.0013149584,0.00002893964,0.000017211603,0.00026831866,0.00026726877,0.006510575,0.0038532973,0.9801301,0.0075044,0.000027481803],"about_ca_topic_score_codex":0.00080079486,"about_ca_topic_score_gemma":0.0014154648,"teacher_disagreement_score":0.006036076,"about_ca_system_score_codex":0.0007838551,"about_ca_system_score_gemma":0.0005798518,"threshold_uncertainty_score":0.020192683},"labels":[],"label_agreement":null},{"id":"W4391126962","doi":"10.61091/um","title":"Utilitas Mathematica","year":2024,"lang":"fr","type":"paratext","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Theories","field":"Mathematics","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; Arithmetic; Mathematics education","score_opus":0.05293314064757659,"score_gpt":0.3505857914091955,"score_spread":0.2976526507616189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391126962","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.0011178956,0.0061893133,0.014321787,0.0115843965,0.0038312473,0.00006754946,0.0067788535,0.004934666,0.9511742],"genre_scores_gemma":[0.035482854,0.01113652,0.015182905,0.0031407352,0.0028681385,0.00043977684,0.006896553,0.0065620774,0.91829044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985876,0.0002997567,0.000084200714,0.00030217803,0.0006150585,0.00011124665],"domain_scores_gemma":[0.99814415,0.0004383494,0.0001719688,0.0005326077,0.0005142225,0.00019874632],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010839825,0.0014883144,0.0010979803,0.0030606133,0.0016809329,0.008483695,0.0011060655,0.0019427162,0.4248959],"category_scores_gemma":[0.006618176,0.00064868166,0.00088259333,0.003894275,0.0013640695,0.007812392,0.0027337878,0.0050911205,0.42222703],"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.0000520651,0.000032891458,0.00016687946,0.0002800521,0.000015156694,0.00007971588,0.00013232295,0.00026361455,0.0004275745,0.3012945,0.60438764,0.09286751],"study_design_scores_gemma":[0.000011470667,0.000009390415,0.00017857004,0.0000863589,0.0000041428084,0.000100681005,0.000026174217,0.00041497126,0.0003385676,0.078712165,0.9201069,0.000010601938],"about_ca_topic_score_codex":0.0013118453,"about_ca_topic_score_gemma":0.0010174109,"teacher_disagreement_score":0.4248959,"about_ca_system_score_codex":0.001989702,"about_ca_system_score_gemma":0.0014434913,"threshold_uncertainty_score":0.8203162},"labels":[],"label_agreement":null},{"id":"W4391127074","doi":"10.61091/um118-05","title":"Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Disjoint sets; Combinatorics; Disjoint union (topology); Tree (set theory); Discrete mathematics","score_opus":0.018872323194234163,"score_gpt":0.2500113839871136,"score_spread":0.23113906079287944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7156685,0.00064972247,0.24657805,0.0009365872,0.000098952856,0.000049582828,0.0004843542,0.00024430617,0.03528999],"genre_scores_gemma":[0.9122472,0.00057193247,0.07230911,0.00019835099,0.00010029598,0.000095889554,0.00060367736,0.000108288106,0.013765215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966145,0.00006918583,0.000020872387,0.00009779617,0.00006115581,0.00008961025],"domain_scores_gemma":[0.9992231,0.00025909612,0.00018317558,0.00010235648,0.000074170865,0.00015802699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000400146,0.00026434546,0.00036875377,0.00092932564,0.0011424593,0.0011150987,0.00056211994,0.0004896692,0.0024106794],"category_scores_gemma":[0.0013610861,0.00022185278,0.00050967827,0.00083514,0.0012483073,0.0021811062,0.0010954745,0.00084680936,0.00030823078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008156023,0.000025782703,0.0010581311,0.000052990883,0.000012437844,0.00023878839,0.00045270254,0.004472285,0.003870972,0.9759529,0.0017605003,0.012021024],"study_design_scores_gemma":[0.000013750788,0.000033239656,0.00080343033,0.000017374554,0.000015424743,0.00034703538,0.00020534417,0.03301627,0.0021655825,0.9529324,0.01043285,0.00001719888],"about_ca_topic_score_codex":0.0012727027,"about_ca_topic_score_gemma":0.0011299019,"teacher_disagreement_score":0.0024106794,"about_ca_system_score_codex":0.00076579384,"about_ca_system_score_gemma":0.00041505098,"threshold_uncertainty_score":0.008064508},"labels":[],"label_agreement":null},{"id":"W4391127078","doi":"10.61091/um118-03","title":"EKFN-Modules","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Rings, Modules, and Algebras","field":"Mathematics","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":"Mathematics; Arithmetic; Mathematics education","score_opus":0.04456738038922997,"score_gpt":0.3077072600747684,"score_spread":0.2631398796855384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127078","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.33384272,0.006253468,0.2890353,0.0008587554,0.00077610987,0.0001200909,0.00085644616,0.0008222196,0.36743495],"genre_scores_gemma":[0.910942,0.00143453,0.04012686,0.00035181837,0.00024730907,0.00007403807,0.00051590457,0.000079015634,0.046228547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993691,0.00011537437,0.0000457698,0.00015683268,0.00019095249,0.000122044665],"domain_scores_gemma":[0.9996138,0.000064934466,0.00004596427,0.000059909442,0.00014378877,0.00007152956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074190384,0.00038849568,0.0003085845,0.0012313225,0.00073381164,0.0014428673,0.0005097905,0.00029398993,0.0059265667],"category_scores_gemma":[0.00075277797,0.00012169254,0.0003094017,0.0005576366,0.0010900202,0.0029346505,0.0015520797,0.0006277885,0.00086426554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015655214,0.000013094901,0.00085157185,0.000065146945,0.000007631751,0.00013925186,0.0002906252,0.0004339416,0.001674738,0.9685425,0.0012028258,0.026763076],"study_design_scores_gemma":[0.000009505547,0.000045561315,0.004472282,0.00006854458,0.00002413196,0.0014012296,0.0004673924,0.0052478397,0.005425468,0.7941551,0.18864742,0.000035578167],"about_ca_topic_score_codex":0.00069814426,"about_ca_topic_score_gemma":0.0005431703,"teacher_disagreement_score":0.0059265667,"about_ca_system_score_codex":0.0007708869,"about_ca_system_score_gemma":0.00041238792,"threshold_uncertainty_score":0.019826412},"labels":[],"label_agreement":null},{"id":"W4391127079","doi":"10.61091/um118-02","title":"On the Orbital Regular Graph of Finite Solvable Groups","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Finite Group Theory Research","field":"Mathematics","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; Graph; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.0680899099910209,"score_gpt":0.32575893547466495,"score_spread":0.25766902548364407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86733687,0.0003243675,0.09382427,0.0007108515,0.000054328902,0.000049406914,0.00035325057,0.00018180981,0.03716488],"genre_scores_gemma":[0.97633207,0.0002612296,0.017415117,0.00009493866,0.000056718687,0.000053267544,0.0003698629,0.000031790943,0.005385085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997216,0.00008105408,0.000012544667,0.000064948465,0.00006938968,0.00005047321],"domain_scores_gemma":[0.9993912,0.00021898556,0.00014439071,0.00007736509,0.000064254236,0.00010381364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024060617,0.00024943126,0.0002942566,0.0010855952,0.0007955013,0.00085312413,0.0004633547,0.00040768328,0.0027124782],"category_scores_gemma":[0.00094325066,0.00015074683,0.00035337624,0.00057585136,0.0017138615,0.0010384317,0.0006325687,0.0005343887,0.0002539212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006711767,0.00002979942,0.00077195955,0.0000673526,0.000012878495,0.00023302744,0.00039620313,0.006209851,0.0039740596,0.97685826,0.0010132367,0.010366242],"study_design_scores_gemma":[0.000016749958,0.000026492138,0.0010229342,0.000015477211,0.000011147093,0.00020549592,0.00023038565,0.026786955,0.0011622835,0.9668103,0.0036988405,0.000012855554],"about_ca_topic_score_codex":0.0011849739,"about_ca_topic_score_gemma":0.0011334582,"teacher_disagreement_score":0.0027124782,"about_ca_system_score_codex":0.000622517,"about_ca_system_score_gemma":0.00031863837,"threshold_uncertainty_score":0.0090741515},"labels":[],"label_agreement":null},{"id":"W4391127082","doi":"10.61091/um118-04","title":"Caputo Fractional Derivative Inequalities for Refined Modified ( h , m ) -Convex Functions","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Mathematical Inequalities and Applications","field":"Mathematics","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; Fractional calculus; Inequality; Regular polygon; Derivative (finance); Convex function; Applied mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.16873117864176843,"score_gpt":0.38858513143634504,"score_spread":0.21985395279457662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01916156,0.0012803958,0.96259165,0.0006371142,0.0001994922,0.000034733992,0.00015059151,0.00005814752,0.015886342],"genre_scores_gemma":[0.7373559,0.0035616502,0.24052027,0.00095846795,0.00070314074,0.00018008909,0.00033591368,0.00023159846,0.016153077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985089,0.0004659946,0.00008426171,0.00028839594,0.0004696824,0.00018279797],"domain_scores_gemma":[0.9962442,0.002137962,0.00032760046,0.00034654213,0.0008059325,0.00013787794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036066042,0.0013243594,0.0009491023,0.002253783,0.0007992054,0.0023818496,0.0013448558,0.0012944156,0.0033522998],"category_scores_gemma":[0.010592574,0.00038322582,0.0018053674,0.0012183685,0.0031756535,0.004145356,0.0016128164,0.0032421858,0.00054423325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008869974,0.000024422177,0.0006985377,0.00016370299,0.00004513521,0.00029511985,0.00021741918,0.058661465,0.0077593136,0.90639865,0.0018652139,0.023782345],"study_design_scores_gemma":[0.000015293728,0.00006456474,0.0010784537,0.00008973933,0.00003526366,0.0003042477,0.0001049041,0.5638316,0.0054020076,0.4164664,0.012546794,0.000060719398],"about_ca_topic_score_codex":0.0028917086,"about_ca_topic_score_gemma":0.0019102896,"teacher_disagreement_score":0.0036066042,"about_ca_system_score_codex":0.0026366024,"about_ca_system_score_gemma":0.0010405618,"threshold_uncertainty_score":0.019129932},"labels":[],"label_agreement":null},{"id":"W4391127083","doi":"10.61091/um118-01","title":"Arctangent Series on Pell and Pell-Lucas Polynomials via Cassini-Like Formulae","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","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; Series (stratigraphy); Combinatorics; Algebra over a field; Pure mathematics; Geology","score_opus":0.012437993938601143,"score_gpt":0.2794209955495861,"score_spread":0.266983001610985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38821343,0.0022963583,0.4271074,0.00089661474,0.00064736744,0.00009157208,0.00022595632,0.00067382236,0.17984758],"genre_scores_gemma":[0.9142549,0.0017413466,0.05370136,0.00018909197,0.0005445893,0.00011347633,0.00015853273,0.00029571302,0.029000988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993754,0.00012369246,0.000040630493,0.00009057874,0.00028049405,0.00008929205],"domain_scores_gemma":[0.9991399,0.0003340836,0.00015285125,0.00007063359,0.00019407972,0.000108459106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475483,0.0011771786,0.00079850317,0.0050314874,0.001295256,0.0035037315,0.0010677141,0.0006786418,0.0065269168],"category_scores_gemma":[0.004675716,0.0003382023,0.0010918977,0.002487043,0.003196932,0.0044627218,0.0013304822,0.0016958218,0.0011807678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001845936,0.000010112135,0.00021507384,0.000042085987,0.000007783395,0.00015640615,0.00022282432,0.0011390505,0.0013484667,0.9882889,0.00045146787,0.008099415],"study_design_scores_gemma":[0.000013048583,0.000029145289,0.0004380961,0.000039003236,0.000027720731,0.000480309,0.00013872309,0.015088219,0.0030316308,0.9740434,0.006641359,0.00002942311],"about_ca_topic_score_codex":0.0006942843,"about_ca_topic_score_gemma":0.0007101105,"teacher_disagreement_score":0.0065269168,"about_ca_system_score_codex":0.0017157936,"about_ca_system_score_gemma":0.000711957,"threshold_uncertainty_score":0.021834731},"labels":[],"label_agreement":null},{"id":"W4391127094","doi":"10.61091/um118-06","title":"On S C D F -Modules","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Rings, Modules, and Algebras","field":"Mathematics","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; Humanities; Philosophy","score_opus":0.04223410586763643,"score_gpt":0.30625517952856157,"score_spread":0.26402107366092514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127094","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.35617325,0.0038920916,0.16725564,0.002099688,0.0005927372,0.00016001036,0.0010150233,0.000464267,0.46834725],"genre_scores_gemma":[0.9095155,0.0018734896,0.03220188,0.0005076751,0.00040116993,0.0001244682,0.00049551483,0.00006002318,0.054820307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995641,0.00009684457,0.000025662895,0.00010043061,0.00010788039,0.0001051975],"domain_scores_gemma":[0.9994295,0.00012064389,0.00007884008,0.00006526885,0.00017750729,0.00012819642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064676243,0.00054436445,0.0002573166,0.0020656597,0.0011446025,0.0014646603,0.0003084042,0.0004527807,0.009522962],"category_scores_gemma":[0.00073276064,0.0001784155,0.00045368858,0.00092656317,0.002131737,0.0019588377,0.0017307831,0.00070211315,0.0012958026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020682422,0.000013872086,0.00057619764,0.000028562843,0.000006362016,0.0001151937,0.00027662457,0.0004396922,0.0015594071,0.9847424,0.0013711388,0.0108499685],"study_design_scores_gemma":[0.000018809364,0.00007758705,0.0017530877,0.000032426295,0.000009461759,0.0005048573,0.00029865283,0.004200967,0.0023360965,0.93972254,0.05102678,0.000018634391],"about_ca_topic_score_codex":0.0009565572,"about_ca_topic_score_gemma":0.00078477437,"teacher_disagreement_score":0.009522962,"about_ca_system_score_codex":0.0009417851,"about_ca_system_score_gemma":0.0004613342,"threshold_uncertainty_score":0.03185755},"labels":[],"label_agreement":null},{"id":"W4394792901","doi":"10.61091/um119-01","title":"Generalized 3-Rainbow Domination in Graphs and Honeycomb System (HC(n))","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Rainbow; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.018841296281883378,"score_gpt":0.2930727004844571,"score_spread":0.27423140420257375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6213322,0.00064224633,0.35956433,0.00028848852,0.00007269257,0.00010599598,0.00023210977,0.00020292727,0.017559083],"genre_scores_gemma":[0.9153184,0.00025726514,0.07955992,0.00007613989,0.000020619531,0.00008212077,0.00014251826,0.000021309519,0.004521731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998599,0.000031573916,0.0000065133536,0.00004045188,0.000034098935,0.000027378577],"domain_scores_gemma":[0.99978644,0.00008507812,0.000039722698,0.000028944662,0.000025867284,0.000033962267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018500882,0.00020092867,0.00022602691,0.00038434647,0.0005627552,0.00047996745,0.00030852214,0.0003131232,0.0015709394],"category_scores_gemma":[0.00059137744,0.00013231106,0.00031490356,0.00036264453,0.0006172298,0.0008403939,0.0006686453,0.0002719562,0.0001368076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021489663,0.00005412879,0.004691863,0.00032348454,0.00009645334,0.0007755351,0.0004454673,0.13849486,0.032899603,0.73950034,0.0040855873,0.07841775],"study_design_scores_gemma":[0.00004374246,0.00011994392,0.0038560915,0.000025999927,0.000032374035,0.0009102051,0.00021018396,0.47332075,0.0078840265,0.50194144,0.011615815,0.000039277027],"about_ca_topic_score_codex":0.0010174743,"about_ca_topic_score_gemma":0.0013986776,"teacher_disagreement_score":0.0015709394,"about_ca_system_score_codex":0.00041150532,"about_ca_system_score_gemma":0.0002964301,"threshold_uncertainty_score":0.0052553415},"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":"W4394793009","doi":"10.61091/um119-07","title":"The Index Weighted Hermitian Adjacency Matrices for Mixed Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Spectral radius; Mathematics; Hermitian matrix; Adjacency list; Adjacency matrix; Combinatorics; Two-graph; Chordal graph; Indifference graph; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Pure mathematics; Line graph; Physics","score_opus":0.029961414154297015,"score_gpt":0.31756857005514416,"score_spread":0.2876071559008471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3123059,0.00073104235,0.66193223,0.000321676,0.000114820774,0.00007063232,0.00037675223,0.00024055067,0.023906352],"genre_scores_gemma":[0.923007,0.0004184854,0.07197688,0.00016307202,0.00017698415,0.000101027144,0.0002399231,0.00007362881,0.0038430407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956125,0.00012386692,0.000021113205,0.000107339154,0.00013430236,0.000052183077],"domain_scores_gemma":[0.9987105,0.00045853527,0.00033766188,0.00012918381,0.00021448545,0.00014960124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003983277,0.00057627354,0.00039040786,0.0020208019,0.00058272283,0.0011736086,0.00074839237,0.00063451356,0.002512026],"category_scores_gemma":[0.002203347,0.00023387435,0.00027002877,0.0010660412,0.0010994368,0.0020003372,0.00078853,0.00094996486,0.0003895764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051728734,0.0000229017,0.0006787734,0.000069932255,0.000016483556,0.000113262766,0.00014863226,0.008209244,0.011656322,0.9650773,0.000905744,0.013049793],"study_design_scores_gemma":[0.000009573049,0.000056864043,0.0011528232,0.000016406764,0.000012454357,0.00046942735,0.00009469992,0.09917005,0.0043621934,0.89134413,0.0032774394,0.000033987213],"about_ca_topic_score_codex":0.00018396271,"about_ca_topic_score_gemma":0.00021860257,"teacher_disagreement_score":0.002512026,"about_ca_system_score_codex":0.00038679133,"about_ca_system_score_gemma":0.00015954807,"threshold_uncertainty_score":0.008403599},"labels":[],"label_agreement":null},{"id":"W4394793011","doi":"10.61091/um119-10","title":"A Discrete-Time Modified Leslie-Gower Model with Double Allee Effect and Its Stability and Bifurcation Analysis","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","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":"Allee effect; Mathematics; Center manifold; Stability (learning theory); Discrete time and continuous time; Applied mathematics; Consistency (knowledge bases); Bifurcation; Statistical physics; Continuous modelling; Nonlinear system; Mathematical economics; Mathematical analysis; Statistics; Hopf bifurcation; Computer science; Discrete mathematics","score_opus":0.02823887074617918,"score_gpt":0.3017143611297668,"score_spread":0.2734754903835876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.603359,0.0019511475,0.32842723,0.002617783,0.00031999714,0.00017905186,0.00076810375,0.0003484739,0.062029164],"genre_scores_gemma":[0.98571974,0.00033811372,0.00468284,0.000049156864,0.00003546723,0.00007476843,0.00008033708,0.00001140903,0.009008239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.000056504086,0.000011664816,0.00004907194,0.000051219915,0.000040268817],"domain_scores_gemma":[0.99966896,0.00009283806,0.00009921239,0.000025201954,0.00005526563,0.0000584202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033142773,0.00054747774,0.00095239765,0.00068505935,0.0007446387,0.0013590915,0.0011011421,0.001600075,0.002987974],"category_scores_gemma":[0.0010319095,0.00024984946,0.0007654184,0.000521689,0.0010831135,0.0009726325,0.0010173847,0.0008979141,0.00026345576],"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.00017891394,0.00011805332,0.0040963404,0.00016278266,0.00010497457,0.001644016,0.0005054999,0.73061603,0.010244675,0.244232,0.0019827222,0.006113972],"study_design_scores_gemma":[0.000025562356,0.000040106304,0.00056330906,0.0000074633226,0.000023219034,0.000095302676,0.000052078773,0.9824123,0.00019808757,0.015787287,0.00077563035,0.000019585234],"about_ca_topic_score_codex":0.0117215,"about_ca_topic_score_gemma":0.005059199,"teacher_disagreement_score":0.0117215,"about_ca_system_score_codex":0.0010726664,"about_ca_system_score_gemma":0.00072441384,"threshold_uncertainty_score":0.023306549},"labels":[],"label_agreement":null},{"id":"W4394793020","doi":"10.61091/um119-03","title":"On Exploring the Topological Aspects of the Chemical Structure of the Nanotube \\(HAC_{5}C_{7}[w,t]\\)","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Cognitive Computing and Networks","field":"Computer Science","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":"Graph theory; Combinatorial analysis; Coding (social sciences); Graph; Mathematics; Computer science; Theoretical computer science; Topology (electrical circuits); Combinatorics","score_opus":0.030942599475984416,"score_gpt":0.25064684077137744,"score_spread":0.21970424129539304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793020","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.31314975,0.019382723,0.3155049,0.010192903,0.0019917798,0.00008642751,0.00059178803,0.00025125264,0.33884844],"genre_scores_gemma":[0.79879516,0.036241043,0.12533806,0.0021761316,0.0017052176,0.00017932398,0.00058423734,0.00023686347,0.034743905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999155,0.000028803244,0.0000027467752,0.000018610237,0.000020157537,0.0000142586805],"domain_scores_gemma":[0.99975234,0.00014840496,0.000033680313,0.000023998102,0.0000228766,0.000018610292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024000817,0.0003271224,0.00028626205,0.0006746928,0.0007607333,0.0013280641,0.00047091127,0.0008988082,0.002663836],"category_scores_gemma":[0.0007415338,0.00014102327,0.0002718175,0.00059437176,0.0020917202,0.0019100496,0.00060858444,0.0009193394,0.0005998542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009769224,0.00001183125,0.00013030849,0.00009993854,0.0000045432844,0.000061137005,0.000073463205,0.004519575,0.0048456574,0.9740011,0.0018063573,0.014436189],"study_design_scores_gemma":[0.0000025969434,0.00003585011,0.00041084207,0.0000562033,0.000005005864,0.00014541563,0.000094195544,0.0219038,0.0014858444,0.9598052,0.016032802,0.000022218863],"about_ca_topic_score_codex":0.0004249654,"about_ca_topic_score_gemma":0.0007165154,"teacher_disagreement_score":0.002663836,"about_ca_system_score_codex":0.00029367843,"about_ca_system_score_gemma":0.00024286464,"threshold_uncertainty_score":0.00891149},"labels":[],"label_agreement":null},{"id":"W4394793043","doi":"10.61091/um119-02","title":"On the Laplacian Energy of an Orbit Graph of Finite Groups","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Dihedral group; Mathematics; Combinatorics; Graph; Orbit (dynamics); Discrete mathematics; Group (periodic table); Physics","score_opus":0.03470644109703165,"score_gpt":0.293295437107868,"score_spread":0.25858899601083635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8304106,0.0016351346,0.099131584,0.0022391754,0.000222382,0.00002872631,0.0002659595,0.00012960422,0.06593688],"genre_scores_gemma":[0.983238,0.00070898794,0.00782595,0.0002014151,0.00024382479,0.000030024255,0.00015272346,0.00006868055,0.007530439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997508,0.000075704804,0.000008164704,0.000041948468,0.00007797092,0.000045390952],"domain_scores_gemma":[0.9989704,0.0005328644,0.00013310935,0.00007357183,0.00011418557,0.00017580744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004495569,0.00041008377,0.00039799162,0.0022924207,0.0009049558,0.0012670121,0.0005753052,0.0008393339,0.0043605003],"category_scores_gemma":[0.0019028698,0.00019518034,0.00030496577,0.0009727682,0.002447485,0.002070553,0.0010425915,0.00073293416,0.00033136518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026453492,0.000025205536,0.0005897421,0.000037805887,0.000009777931,0.00012987095,0.00024382617,0.0061077033,0.0020357205,0.9847563,0.00096803653,0.0050695543],"study_design_scores_gemma":[0.000005764654,0.000016311678,0.00081360154,0.000014942881,0.000004148479,0.000112761605,0.00013291696,0.026539009,0.0002853186,0.9708829,0.0011782773,0.000014138234],"about_ca_topic_score_codex":0.0007170103,"about_ca_topic_score_gemma":0.0006735034,"teacher_disagreement_score":0.0043605003,"about_ca_system_score_codex":0.0008110007,"about_ca_system_score_gemma":0.00024557146,"threshold_uncertainty_score":0.014587343},"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":"W4394793054","doi":"10.61091/um119-04","title":"On Ve-Degree and Ev-Degree Based Topological Invariants of Chemical Structures","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Computational Drug Discovery Methods","field":"Computer Science","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":"Degree (music); Topological index; Mathematics; Index (typography); Graph theory; Degree distribution; Graph; Molecular graph; Topology (electrical circuits); Discrete mathematics; Combinatorics; Computer science; Physics; Complex network","score_opus":0.07317304973763233,"score_gpt":0.3290684994029734,"score_spread":0.25589544966534106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4290649,0.002296644,0.53763527,0.00060126354,0.00010251103,0.000066928595,0.00033839027,0.00021974836,0.029674398],"genre_scores_gemma":[0.96346617,0.00097107206,0.03336871,0.000044705153,0.00007857598,0.000030241088,0.00018253128,0.000030505198,0.0018275797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977237,0.00007426141,0.000008821793,0.000036700025,0.000076777884,0.00003107795],"domain_scores_gemma":[0.99914646,0.0004688334,0.00012293893,0.000092592054,0.000093913215,0.00007533441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000614585,0.0003519796,0.00025464248,0.0027968106,0.00038390813,0.0010227511,0.00040893292,0.00028972438,0.0013151692],"category_scores_gemma":[0.0029024843,0.000093289585,0.00031572362,0.0011591022,0.0016763452,0.0016800043,0.00095611945,0.000645428,0.0001775622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093149145,0.000047821708,0.0049738567,0.00013202915,0.00003173762,0.00009441674,0.00026546328,0.14215645,0.005459414,0.772731,0.0009244758,0.07309012],"study_design_scores_gemma":[0.000011275894,0.00015520993,0.0050632698,0.00006403259,0.000025116688,0.00022919408,0.00020441778,0.39572874,0.0029978675,0.5896125,0.0058668447,0.000041589617],"about_ca_topic_score_codex":0.0007881615,"about_ca_topic_score_gemma":0.00090378046,"teacher_disagreement_score":0.0027968106,"about_ca_system_score_codex":0.000512971,"about_ca_system_score_gemma":0.00032238025,"threshold_uncertainty_score":0.004399717},"labels":[],"label_agreement":null},{"id":"W4394793064","doi":"10.61091/um119-08","title":"On Maximum Degree and Maximum Reverse Degree Energies of Splitting and Shadow graph of Complete graph","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Theory and Algorithms","field":"Computer Science","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; Degree (music); Windmill graph; Graph; Vertex (graph theory); Regular graph; Butterfly graph; Discrete mathematics; Line graph; Voltage graph; Physics","score_opus":0.038940150735022126,"score_gpt":0.25089549136809297,"score_spread":0.21195534063307084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63232183,0.0016831434,0.32978982,0.00063111325,0.000087957786,0.000032371718,0.00026858106,0.00015158819,0.03503357],"genre_scores_gemma":[0.9780759,0.000744708,0.017169613,0.00005211715,0.00005584218,0.000029776646,0.00013630434,0.000061389204,0.003674268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968445,0.00007127122,0.000010848505,0.000078098514,0.00009441138,0.000060954528],"domain_scores_gemma":[0.99791414,0.0012802794,0.00021824815,0.00022110865,0.00022924095,0.00013692571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237143,0.0003249435,0.00030506903,0.0013686058,0.00058220536,0.0006587458,0.0006527646,0.0003710678,0.0035645966],"category_scores_gemma":[0.0036886483,0.00016183627,0.0003713102,0.00093556714,0.0011625389,0.0024453145,0.00069803005,0.00068582135,0.00025389314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000191067,0.000059186637,0.0047776117,0.00030983274,0.000046284276,0.00038594776,0.0006431537,0.103913635,0.015775966,0.8152901,0.002200114,0.056407094],"study_design_scores_gemma":[0.000016253412,0.000093180875,0.0062133763,0.000045769826,0.000034394037,0.0008392439,0.00040851583,0.207684,0.0068773744,0.77321833,0.0045276973,0.000041827512],"about_ca_topic_score_codex":0.000497364,"about_ca_topic_score_gemma":0.00054045336,"teacher_disagreement_score":0.0035645966,"about_ca_system_score_codex":0.00052635744,"about_ca_system_score_gemma":0.0002002856,"threshold_uncertainty_score":0.011924744},"labels":[],"label_agreement":null},{"id":"W4394793071","doi":"10.61091/um119-09","title":"Decoding Nonsteroidal Anti-inflammatory Drugs with Sombor Invariants: A Quantum Leap in QSPR Modeling","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Computational Drug Discovery Methods","field":"Computer Science","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":"Quantitative structure–activity relationship; Nonsteroidal; Pharmacodynamics; Quantum chemical; Drug; Molecular descriptor; Pharmacology; Computational biology; Chemistry; Mathematics; Medicine; Stereochemistry; Biology; Molecule; Pharmacokinetics; Organic chemistry","score_opus":0.023016471756718934,"score_gpt":0.28472503620852146,"score_spread":0.2617085644518025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03625684,0.0004859807,0.96051514,0.00045927512,0.00003669913,0.000024948704,0.0000596581,0.00011523596,0.0020462454],"genre_scores_gemma":[0.76478446,0.001274598,0.22982863,0.00032565495,0.000113591654,0.0001505801,0.00019215714,0.0001342922,0.0031960378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.00016750918,0.000019005629,0.000047139663,0.00008083908,0.00003467878],"domain_scores_gemma":[0.9983651,0.0011841165,0.00016125714,0.00012617264,0.00011617153,0.000047219815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012340735,0.00059487956,0.0010320329,0.0007079115,0.00038902916,0.0010106772,0.0007304884,0.0008321092,0.0013321609],"category_scores_gemma":[0.004285188,0.00033418267,0.0008933494,0.00076577853,0.0011983834,0.0016207186,0.0009949812,0.0008419642,0.00025884958],"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.00006406784,0.00003498005,0.0006061478,0.00008937786,0.000044906454,0.0000759358,0.00007004806,0.8554058,0.003510074,0.11400444,0.00056438654,0.025529813],"study_design_scores_gemma":[0.0000031112593,0.00001635008,0.000038474598,0.0000033869221,0.0000039901647,0.0000049125006,0.0000049296114,0.9719331,0.00032644573,0.02747374,0.0001869969,0.000004622646],"about_ca_topic_score_codex":0.0023397217,"about_ca_topic_score_gemma":0.002674467,"teacher_disagreement_score":0.0023397217,"about_ca_system_score_codex":0.0007562775,"about_ca_system_score_gemma":0.0010436872,"threshold_uncertainty_score":0.00652647},"labels":[],"label_agreement":null},{"id":"W4403165969","doi":"10.61091/um120-01","title":"Metric Dimension of Corona Product and Join Graph of Zero Divisor Graphs of Direct Product of Finite Fields","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Join (topology); Direct product; Divisor (algebraic geometry); Graph; Product (mathematics); Combinatorics; Dimension (graph theory); Discrete mathematics; Geometry","score_opus":0.020264912095511223,"score_gpt":0.2462064005829108,"score_spread":0.22594148848739956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9719944,0.00036559397,0.019518185,0.00029366915,0.000026153486,0.000014069338,0.00031494052,0.00004324772,0.0074297693],"genre_scores_gemma":[0.9926634,0.00020899021,0.005670883,0.00003149424,0.000043401244,0.000017322733,0.000270456,0.000013511894,0.001080494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966073,0.000071375915,0.000017144372,0.00011560555,0.000070824244,0.000064367625],"domain_scores_gemma":[0.9982133,0.00074801897,0.00039629926,0.00012326887,0.00015538762,0.00036374858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036149716,0.00030968824,0.00044646347,0.0022551066,0.0009483927,0.0014511903,0.00059320783,0.0005460292,0.0020336243],"category_scores_gemma":[0.0021284828,0.00022040264,0.00037709522,0.0011214397,0.0015749548,0.0026406455,0.00092308427,0.0006261593,0.00011942774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026463027,0.00007358981,0.018692382,0.00018019081,0.000048867303,0.00025484143,0.0009496742,0.011543936,0.006592599,0.9340211,0.0026215096,0.024756612],"study_design_scores_gemma":[0.00004098052,0.00012800777,0.017093772,0.00003918452,0.000049336526,0.0010005421,0.00064998755,0.054039277,0.0045030713,0.9151918,0.0072066933,0.000057260742],"about_ca_topic_score_codex":0.0009465989,"about_ca_topic_score_gemma":0.00072150986,"teacher_disagreement_score":0.0022551066,"about_ca_system_score_codex":0.0011985359,"about_ca_system_score_gemma":0.00033658423,"threshold_uncertainty_score":0.00869596},"labels":[],"label_agreement":null},{"id":"W4403165970","doi":"10.61091/um120-07","title":"On Some Classes of Cycles-Related Γ -Harmonious Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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.03520961918562015,"score_gpt":0.32322611184287087,"score_spread":0.2880164926572507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87632036,0.0005148421,0.056659244,0.0005167903,0.000047512298,0.00008978958,0.00027512084,0.00013920736,0.0654372],"genre_scores_gemma":[0.97666454,0.00044055542,0.011665927,0.00017098576,0.00007797006,0.000094600546,0.0003280529,0.00005398284,0.010503297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995938,0.000072329945,0.000019118266,0.00014279052,0.00008689773,0.00008521096],"domain_scores_gemma":[0.9992011,0.00024519244,0.00022349568,0.000100028396,0.00008830422,0.00014200655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030439236,0.00030016014,0.00024984468,0.0017303753,0.0013693188,0.0012973382,0.0006697024,0.0006310759,0.0050098496],"category_scores_gemma":[0.0012532179,0.00033979642,0.00049503765,0.0012435,0.0015911206,0.0020059492,0.0011005364,0.0007441034,0.00034961186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002920565,0.000025519043,0.0012654794,0.00003776026,0.000012563997,0.00022446639,0.0006183426,0.0033664713,0.0020979275,0.98409516,0.0007672466,0.007459895],"study_design_scores_gemma":[0.000020410382,0.000041299758,0.0021977376,0.000032682452,0.000020087702,0.00042666483,0.0006652222,0.019199608,0.0014011572,0.9655745,0.010399872,0.000020732054],"about_ca_topic_score_codex":0.0015624416,"about_ca_topic_score_gemma":0.0012564283,"teacher_disagreement_score":0.0050098496,"about_ca_system_score_codex":0.0009199879,"about_ca_system_score_gemma":0.0002740089,"threshold_uncertainty_score":0.016759634},"labels":[],"label_agreement":null},{"id":"W4403165978","doi":"10.61091/um120-03","title":"Key Pre-distribution Schemes via Certain Resolvable Block Designs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","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; Key (lock); Block (permutation group theory); Distribution (mathematics); Arithmetic; Combinatorics; Computer science; Computer security","score_opus":0.013002431934745361,"score_gpt":0.26081065519952856,"score_spread":0.2478082232647832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05693391,0.0003213494,0.93097395,0.00018696852,0.000062835694,0.00013723072,0.00025236598,0.00029951514,0.010831791],"genre_scores_gemma":[0.7014551,0.000544898,0.29137012,0.00020745878,0.00006844599,0.00037389458,0.00034335308,0.00006747828,0.0055690478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840987,0.00057959877,0.00012667675,0.0002840334,0.00037834674,0.00022144751],"domain_scores_gemma":[0.9971528,0.00092500186,0.0005958931,0.00074221153,0.000462946,0.00012109975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015571602,0.00073399174,0.00056253374,0.0006370379,0.00053947966,0.001213778,0.00093811867,0.00074817985,0.0031597938],"category_scores_gemma":[0.0034440984,0.00037007476,0.00046321785,0.0008839904,0.00090356683,0.0016210527,0.0009716529,0.0010265498,0.0008371741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006572807,0.0000960497,0.0005305539,0.00019787518,0.000059835496,0.00010074008,0.00020588716,0.10228934,0.037048694,0.7622704,0.0018863068,0.094657],"study_design_scores_gemma":[0.00022746254,0.00094503356,0.00034157114,0.00009147602,0.000063669424,0.0003196855,0.00008739556,0.5318421,0.052679546,0.3964439,0.016855916,0.00010223951],"about_ca_topic_score_codex":0.00029027872,"about_ca_topic_score_gemma":0.00043041288,"teacher_disagreement_score":0.0031597938,"about_ca_system_score_codex":0.00076997903,"about_ca_system_score_gemma":0.00093277154,"threshold_uncertainty_score":0.010570526},"labels":[],"label_agreement":null},{"id":"W4403166031","doi":"10.61091/um120-04","title":"Multiplicative Distance-Location Number of Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Multiplicative function; Statistics; Combinatorics","score_opus":0.016798825184237122,"score_gpt":0.28155603051923794,"score_spread":0.2647572053350008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36411473,0.0014494002,0.55826044,0.0011673584,0.00032963933,0.0001869156,0.0015286431,0.0010640882,0.07189876],"genre_scores_gemma":[0.80254436,0.00080801407,0.17422122,0.00037403798,0.00036511352,0.00038056116,0.001385489,0.0002559,0.019665312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978143,0.0003903494,0.00019557876,0.0007794657,0.0005983887,0.00022186844],"domain_scores_gemma":[0.9958413,0.0016505219,0.0006154124,0.0007551244,0.0006557238,0.00048178562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080943265,0.0007857475,0.0008712079,0.0019157131,0.0014345351,0.0023846861,0.0016967771,0.00097500015,0.005508736],"category_scores_gemma":[0.005463854,0.00047544306,0.00081927486,0.0017635856,0.0020679277,0.004978451,0.0023186896,0.0015838742,0.0014760857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029085172,0.00007087622,0.0021215528,0.0003644822,0.000052396084,0.00022431165,0.00041789486,0.014525794,0.010446475,0.90346557,0.0046113883,0.063408405],"study_design_scores_gemma":[0.0000912392,0.00021902806,0.0017905036,0.00007282803,0.0000788041,0.0012691208,0.00021125162,0.051918447,0.009807395,0.8998193,0.0346393,0.00008280009],"about_ca_topic_score_codex":0.00041010114,"about_ca_topic_score_gemma":0.00040251,"teacher_disagreement_score":0.005508736,"about_ca_system_score_codex":0.0012174185,"about_ca_system_score_gemma":0.0005933396,"threshold_uncertainty_score":0.018428624},"labels":[],"label_agreement":null},{"id":"W4403166068","doi":"10.61091/um120-02","title":"A note on Frobenius-Zorn’s Theorem","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Mathematics and Applications","field":"Mathematics","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; Mathematical economics; Pure mathematics","score_opus":0.04800092537761384,"score_gpt":0.34962073906850494,"score_spread":0.3016198136908911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166068","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.29613242,0.011576641,0.24424663,0.012581921,0.0019240822,0.000069684604,0.00043783739,0.00032099886,0.4327097],"genre_scores_gemma":[0.9125977,0.003969356,0.044704918,0.0010979234,0.0009936388,0.00004642318,0.00018756777,0.00009808003,0.036304347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959034,0.00011365176,0.000014559069,0.00008680284,0.000116337396,0.00007840517],"domain_scores_gemma":[0.9996158,0.00017381329,0.00003594819,0.000046900706,0.00008095366,0.000046621495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014657896,0.00043523047,0.00042597007,0.001262125,0.00110392,0.00088894175,0.00067334744,0.0005091473,0.00476244],"category_scores_gemma":[0.0015094703,0.00016774276,0.00061999256,0.000859855,0.0030590072,0.0029830206,0.0016572776,0.0014428364,0.0006203602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009212235,0.00000517043,0.00017350465,0.000026368076,0.000004221455,0.000038820745,0.00013410622,0.00029639935,0.00041921248,0.99409086,0.0013294965,0.0034724334],"study_design_scores_gemma":[0.000011644382,0.000024878567,0.00063962885,0.00001998927,0.000008347037,0.00013537476,0.0000831706,0.002520986,0.0008320594,0.97268856,0.023021497,0.000013885118],"about_ca_topic_score_codex":0.0026263352,"about_ca_topic_score_gemma":0.0014469706,"teacher_disagreement_score":0.00476244,"about_ca_system_score_codex":0.0011363362,"about_ca_system_score_gemma":0.00053613255,"threshold_uncertainty_score":0.015931964},"labels":[],"label_agreement":null},{"id":"W4403166094","doi":"10.61091/um120-05","title":"Dynamic Analysis of a Fractional-Modified Leslie-Gower Model with Predator Harvesting","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Fractional Differential Equations Solutions","field":"Mathematics","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; Predator; Mathematical economics; Applied mathematics; Econometrics; Statistics; Ecology; Predation; Biology","score_opus":0.06544005299555608,"score_gpt":0.35066845934201957,"score_spread":0.2852284063464635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7909973,0.0006958223,0.17701156,0.0011045085,0.00010660508,0.000058988124,0.0001500943,0.00014362228,0.0297314],"genre_scores_gemma":[0.98999864,0.00019390995,0.0039216992,0.000045886747,0.000019557294,0.000031870386,0.000028735356,0.0000114757795,0.00574831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991894,0.000021909775,0.000004384864,0.000017714166,0.000018634668,0.000018398065],"domain_scores_gemma":[0.99983823,0.000044031847,0.000055517747,0.0000121624225,0.000020341206,0.00002963452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020109271,0.0004626942,0.0007759886,0.0005353089,0.0006702723,0.0010889875,0.00083678856,0.001312157,0.001682309],"category_scores_gemma":[0.0006408106,0.0002358957,0.00071671687,0.0003475747,0.0009615678,0.0008787874,0.00088844466,0.000536741,0.00012825243],"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.00011056991,0.00007489958,0.0022192025,0.00008653771,0.0000903507,0.001237076,0.0002766583,0.8631223,0.016839225,0.11146566,0.0006176087,0.0038598508],"study_design_scores_gemma":[0.000007582371,0.00001711953,0.00027403582,0.0000032986757,0.000010527602,0.000050519862,0.000028717404,0.9940959,0.00020244035,0.005000244,0.00030034612,0.0000092689825],"about_ca_topic_score_codex":0.0109069515,"about_ca_topic_score_gemma":0.005258248,"teacher_disagreement_score":0.0109069515,"about_ca_system_score_codex":0.0010052157,"about_ca_system_score_gemma":0.00062111154,"threshold_uncertainty_score":0.021686971},"labels":[],"label_agreement":null},{"id":"W4403166107","doi":"10.61091/um120-06","title":"Using Schur Rings to Produce GRRs for Dihedral Groups","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Dihedral angle; Mathematics; Dihedral group; Pure mathematics; Group (periodic table); Chemistry; Organic chemistry","score_opus":0.050954123238017617,"score_gpt":0.3216894948108748,"score_spread":0.27073537157285715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2908524,0.0013795837,0.57924145,0.0017186553,0.00037528411,0.0002097204,0.00021394163,0.00090638705,0.12510264],"genre_scores_gemma":[0.8179862,0.0007083195,0.16901252,0.0003166212,0.00016848404,0.00009512669,0.00015884406,0.00016182801,0.011392066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989963,0.0003790675,0.00006290647,0.00019810387,0.00022357989,0.00014011114],"domain_scores_gemma":[0.9984933,0.0007349497,0.0002220243,0.0002939398,0.00010840339,0.00014738459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014661652,0.00055620633,0.00041131274,0.0016408189,0.001043811,0.0019648925,0.000768839,0.0006203254,0.004183897],"category_scores_gemma":[0.0029388992,0.00038599755,0.0010511221,0.00072998635,0.0036145533,0.0033872875,0.0026284305,0.0018203591,0.0010438046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016334554,0.000013507717,0.00016522773,0.000038926963,0.000005096833,0.000115201445,0.0004729423,0.0013192818,0.002380925,0.9881352,0.0004139715,0.006923329],"study_design_scores_gemma":[0.000026192467,0.00010677515,0.00029843624,0.000035232708,0.000018141021,0.00033096474,0.00033204234,0.008484629,0.0085431365,0.9652066,0.016577657,0.000040131934],"about_ca_topic_score_codex":0.00035884677,"about_ca_topic_score_gemma":0.00056993775,"teacher_disagreement_score":0.004183897,"about_ca_system_score_codex":0.000879623,"about_ca_system_score_gemma":0.00034299854,"threshold_uncertainty_score":0.013996482},"labels":[],"label_agreement":null},{"id":"W4406163648","doi":"10.61091/um121-03","title":"Disproof of a Conjecture on the Edge Mostar Index","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","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":"Conjecture; Index (typography); Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Statistics; Computer science; Artificial intelligence","score_opus":0.016446326568152852,"score_gpt":0.24469439071936436,"score_spread":0.22824806415121152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70225495,0.0024015785,0.18509842,0.014504491,0.00073054986,0.00012238516,0.0023898066,0.001505962,0.09099186],"genre_scores_gemma":[0.9774802,0.00037147247,0.017077675,0.0018005762,0.00029185362,0.00006167441,0.00073349394,0.00014548971,0.0020374998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957426,0.0009781355,0.00019141998,0.0012292003,0.0010169821,0.0008415097],"domain_scores_gemma":[0.96070564,0.02713086,0.0022054804,0.0063546733,0.0022802409,0.001323123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025461146,0.0007471314,0.0019460716,0.002319207,0.002871019,0.0033102273,0.0029775426,0.0030051987,0.0056564207],"category_scores_gemma":[0.034075383,0.0009088321,0.0014141896,0.0020940944,0.00451094,0.006327108,0.0033226947,0.006402553,0.0012986177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014427043,0.0002085155,0.013189838,0.0005046944,0.00017002202,0.00068836275,0.0014912458,0.022013888,0.015865006,0.8769021,0.03139383,0.036129728],"study_design_scores_gemma":[0.00008985758,0.00015767776,0.0034278084,0.000106720116,0.00008155,0.0010345529,0.00036800522,0.06007775,0.011071667,0.912932,0.010571274,0.00008108423],"about_ca_topic_score_codex":0.00124629,"about_ca_topic_score_gemma":0.0009288162,"teacher_disagreement_score":0.0056564207,"about_ca_system_score_codex":0.001597237,"about_ca_system_score_gemma":0.0009214894,"threshold_uncertainty_score":0.018922627},"labels":[],"label_agreement":null},{"id":"W4406171630","doi":"10.61091/um121-09","title":"Radio Number of Cartesian Products of Complete Bipartite Graphs and Odd Cycles","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Qinghai Normal University; Natural Science Foundation of Qinghai; National Natural Science Foundation of China","keywords":"Mathematics; Cartesian product; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.03965243051451393,"score_gpt":0.3146020168826811,"score_spread":0.27494958636816713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71623075,0.0015630068,0.22435504,0.0008288972,0.000089077796,0.00006871808,0.00026082803,0.00014952561,0.05645421],"genre_scores_gemma":[0.9461671,0.0007250464,0.04398778,0.00012919329,0.00007981806,0.00010026659,0.00019971776,0.000053280495,0.0085578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993937,0.00025826602,0.000023518944,0.00014409532,0.00009329258,0.00008713657],"domain_scores_gemma":[0.9979159,0.0012090193,0.0003224997,0.00012466013,0.0002120769,0.00021577335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740688,0.00040003844,0.00040101763,0.001146818,0.00070091285,0.0011132987,0.0006713178,0.00045122675,0.0035820736],"category_scores_gemma":[0.0036491025,0.00037791935,0.00044805947,0.0006434798,0.0018418763,0.0018194112,0.0008956186,0.00082337233,0.00034134387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008371884,0.000019479354,0.0012594996,0.00009979589,0.000015543126,0.00010037086,0.000319597,0.0154927,0.0022564563,0.97096497,0.0018641776,0.0075237816],"study_design_scores_gemma":[0.00003535652,0.000101504935,0.0012931855,0.00003938291,0.000030102794,0.0004563562,0.00019691192,0.11742694,0.0018061032,0.87022066,0.008365542,0.000027963228],"about_ca_topic_score_codex":0.0010371282,"about_ca_topic_score_gemma":0.0009383087,"teacher_disagreement_score":0.0035820736,"about_ca_system_score_codex":0.00063342875,"about_ca_system_score_gemma":0.0004580013,"threshold_uncertainty_score":0.011983156},"labels":[],"label_agreement":null},{"id":"W4406171810","doi":"10.61091/um121-07","title":"Total Dominator Total Chromatic Numbers of Some Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Chromatic scale; Combinatorics","score_opus":0.009871341134890105,"score_gpt":0.2397783326500956,"score_spread":0.2299069915152055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6197375,0.0016651311,0.21695806,0.0015912516,0.00016307052,0.0001092405,0.002281297,0.00031036377,0.15718415],"genre_scores_gemma":[0.9367581,0.0010905092,0.040834766,0.00022094799,0.00010254478,0.00015586219,0.0007580113,0.000119434975,0.01995988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999534,0.00008640004,0.000020641266,0.0001268484,0.000121779114,0.0001103862],"domain_scores_gemma":[0.9985116,0.00081630575,0.0001275071,0.00012219978,0.0002791824,0.00014326168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135558,0.00036369724,0.000336681,0.0019861988,0.0011732102,0.0017869557,0.0006152921,0.00035056993,0.005135999],"category_scores_gemma":[0.0022817934,0.00028290474,0.00039243346,0.0016997884,0.0015917683,0.001856983,0.00070462923,0.0008282512,0.0003085292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005519471,0.000015886693,0.0015077218,0.00008352525,0.000021936334,0.00003845187,0.00027035765,0.010236446,0.0030634603,0.9695201,0.0032650211,0.011921921],"study_design_scores_gemma":[0.000017797038,0.000019090485,0.0017800299,0.000029209681,0.00001802378,0.00012027622,0.00018350835,0.028586032,0.0019422505,0.95385474,0.013425912,0.000023088587],"about_ca_topic_score_codex":0.002471017,"about_ca_topic_score_gemma":0.003582169,"teacher_disagreement_score":0.005135999,"about_ca_system_score_codex":0.0022337204,"about_ca_system_score_gemma":0.0007575719,"threshold_uncertainty_score":0.017181695},"labels":[],"label_agreement":null},{"id":"W4406171814","doi":"10.61091/um121-08","title":"Employing Machine Learning to Analyze NSAIDs Drug Similarity via Sombor Invariants","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Computational Drug Discovery Methods","field":"Computer Science","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":"Similarity (geometry); Mathematics; Drug; Artificial intelligence; Machine learning; Pharmacology; Computer science; Medicine","score_opus":0.025973321263143525,"score_gpt":0.3164360245347459,"score_spread":0.2904627032716024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14852886,0.0006684168,0.84522694,0.00017387891,0.00005745281,0.00009942674,0.00030768834,0.0012758692,0.0036614137],"genre_scores_gemma":[0.80983794,0.00046643673,0.18797599,0.00004622068,0.000042577805,0.000076939636,0.0005153588,0.00008944165,0.0009491324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.0000650464,0.000025851079,0.000051101193,0.00013043734,0.000036640733],"domain_scores_gemma":[0.9990201,0.00045186802,0.00023027725,0.000110573514,0.00014314611,0.000043919936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506755,0.0005729623,0.0006316139,0.0026269597,0.00026793408,0.0010271379,0.00055365026,0.00040722106,0.0013436921],"category_scores_gemma":[0.0036013452,0.00021207353,0.0008148735,0.0016165383,0.00055356475,0.0014409402,0.0006458767,0.00057654415,0.0004640113],"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.00055132166,0.00032774828,0.022922296,0.00037191666,0.00027936196,0.00022805623,0.00017505148,0.5667125,0.03213882,0.020509942,0.001656756,0.35412624],"study_design_scores_gemma":[0.000007721013,0.00009967859,0.002550069,0.000013143058,0.000022542006,0.000068252855,0.000027932647,0.98637843,0.0055338433,0.0045377533,0.000742049,0.000018631035],"about_ca_topic_score_codex":0.0017130882,"about_ca_topic_score_gemma":0.001312162,"teacher_disagreement_score":0.0026269597,"about_ca_system_score_codex":0.0004813303,"about_ca_system_score_gemma":0.0007993265,"threshold_uncertainty_score":0.0055565834},"labels":[],"label_agreement":null},{"id":"W4406171816","doi":"10.61091/um121-02","title":"Monophonic Cover Pebbling Number \\((MCPN)\\) of Network Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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; Cover (algebra); Combinatorics; Discrete mathematics","score_opus":0.01254283087564875,"score_gpt":0.28314370605872896,"score_spread":0.27060087518308024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79705584,0.0009246202,0.17313752,0.0003894445,0.00003874734,0.000067806126,0.00071590877,0.00020349241,0.02746655],"genre_scores_gemma":[0.9622212,0.0006045134,0.033321816,0.000043713986,0.000060169248,0.00007371246,0.00039070335,0.000051358893,0.0032326456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969375,0.000058543963,0.000016564549,0.00008147458,0.0000883091,0.000061342784],"domain_scores_gemma":[0.9971425,0.0018499759,0.0003726866,0.0001919657,0.00018038375,0.0002624796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038695618,0.00039753964,0.00030958315,0.0024328495,0.00072755734,0.00096260494,0.0005912179,0.00063195254,0.0032574618],"category_scores_gemma":[0.003936538,0.00027471568,0.00032854918,0.0010838489,0.0011267713,0.0022265448,0.0006769058,0.0006740007,0.0002576038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003786352,0.00009237383,0.012711419,0.00040572844,0.000071177376,0.00058827555,0.00084513094,0.14554588,0.017482636,0.71691394,0.005372146,0.09959271],"study_design_scores_gemma":[0.000030498471,0.00013939914,0.010405506,0.00007554379,0.00004172401,0.001258695,0.0003417581,0.393448,0.0078833,0.57342803,0.012896732,0.000050880473],"about_ca_topic_score_codex":0.0010105247,"about_ca_topic_score_gemma":0.0016445208,"teacher_disagreement_score":0.0032574618,"about_ca_system_score_codex":0.0010183025,"about_ca_system_score_gemma":0.00040813413,"threshold_uncertainty_score":0.010897279},"labels":[],"label_agreement":null},{"id":"W4406171946","doi":"10.61091/um121-01","title":"Convolution Identities of Stirling Numbers","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Mathematical Inequalities and Applications","field":"Mathematics","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; Stirling numbers of the first kind; Stirling numbers of the second kind; Convolution (computer science); Stirling engine; Stirling number; Arithmetic; Algebra over a field; Pure mathematics; Artificial intelligence; Computer science","score_opus":0.10493359628817728,"score_gpt":0.3924444709610855,"score_spread":0.2875108746729082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087851785,0.0048343115,0.70179296,0.0010945182,0.0013301232,0.00010582032,0.00035090343,0.00038668813,0.20225295],"genre_scores_gemma":[0.7337694,0.0044435677,0.18890166,0.00089634006,0.0017378508,0.00030060575,0.00039552827,0.00053643994,0.06901863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986979,0.00029144183,0.000104129176,0.00020703385,0.00047700715,0.00022244157],"domain_scores_gemma":[0.99869233,0.0005287804,0.0001542865,0.0001682745,0.00034206756,0.00011431448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001798863,0.00096739,0.000983812,0.002630484,0.001245498,0.00279765,0.0011888269,0.0012052504,0.0078072813],"category_scores_gemma":[0.0057256296,0.00051079737,0.0016034143,0.0018278377,0.0021128152,0.0041870167,0.0016941879,0.0023575379,0.0023008708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072239495,0.000006861462,0.00007584477,0.000035570105,0.0000039832435,0.0000702053,0.00007891467,0.0007328105,0.0009771422,0.9916488,0.0005990812,0.0057635587],"study_design_scores_gemma":[0.0000063775415,0.000016059947,0.00020332806,0.000027883067,0.000010451006,0.00029750474,0.000027092598,0.025149986,0.0019073035,0.9659931,0.0063363146,0.000024558565],"about_ca_topic_score_codex":0.0009093744,"about_ca_topic_score_gemma":0.00096549967,"teacher_disagreement_score":0.0078072813,"about_ca_system_score_codex":0.0015016255,"about_ca_system_score_gemma":0.0012290388,"threshold_uncertainty_score":0.02611798},"labels":[],"label_agreement":null},{"id":"W4406171990","doi":"10.61091/um121-04","title":"Introducing Soft Directed Hypergraphs: A Fusion of Soft Set Theory and Directed Hypergraphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","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":"Soft set; Mathematics; Set (abstract data type); Artificial intelligence; Computer science","score_opus":0.033706796774149415,"score_gpt":0.32333665763438585,"score_spread":0.28962986086023645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00525312,0.0010418574,0.97722423,0.00068750686,0.00012789553,0.000054031705,0.00008942259,0.00013712804,0.01538479],"genre_scores_gemma":[0.23281665,0.0035252608,0.75197,0.0010788315,0.00049387326,0.0002611147,0.0002888385,0.0001947753,0.009370597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761933,0.0010216861,0.00016470844,0.00047491773,0.0006102326,0.0001091151],"domain_scores_gemma":[0.9962113,0.0019520534,0.00033980323,0.0006695868,0.00055304804,0.00027432264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028598637,0.00083237083,0.00075715117,0.004588237,0.0012490882,0.004017757,0.0013786528,0.0014763824,0.0039217263],"category_scores_gemma":[0.0050534275,0.00059781264,0.0013050919,0.0044173026,0.0051879333,0.009458936,0.0036440385,0.0031094518,0.0007439811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009885647,0.0000126404275,0.00013915235,0.00008114123,0.000018235332,0.000119557786,0.00028678178,0.003984889,0.0012074304,0.97763556,0.0005190179,0.015985668],"study_design_scores_gemma":[0.0000061454525,0.000018098888,0.0001188892,0.00007407944,0.000019460153,0.00015257772,0.00012740347,0.01815527,0.00089619076,0.96189946,0.018504437,0.000027898412],"about_ca_topic_score_codex":0.0015038921,"about_ca_topic_score_gemma":0.0019799732,"teacher_disagreement_score":0.004588237,"about_ca_system_score_codex":0.0018246782,"about_ca_system_score_gemma":0.0012707738,"threshold_uncertainty_score":0.015124559},"labels":[],"label_agreement":null},{"id":"W4406172191","doi":"10.61091/um121-06","title":"D-irregularity Strength of a Graph","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Direktorat Jenderal Pendidikan Tinggi; Kementerian Pendidikan, Kebudayaan, Riset, dan Teknologi; Institut Teknologi Bandung","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.026275882808709693,"score_gpt":0.31175349837280947,"score_spread":0.2854776155640998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406172191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9146335,0.00027949794,0.062897764,0.00075858424,0.000052844327,0.000043750446,0.0003555989,0.00014698015,0.020831486],"genre_scores_gemma":[0.9840514,0.00020346134,0.013548292,0.00012613917,0.000055165587,0.000046025016,0.00019952415,0.00003974444,0.0017303445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992574,0.00016998456,0.000050140305,0.00023277116,0.00017225649,0.000117434116],"domain_scores_gemma":[0.9935867,0.002833653,0.001161381,0.0007095566,0.0005779028,0.0011308688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010477838,0.00039439907,0.00053222344,0.0019110363,0.0011384326,0.0013984751,0.0007718678,0.00069074554,0.0023337742],"category_scores_gemma":[0.0054291105,0.000402141,0.00048367336,0.0009567154,0.0018497584,0.002044058,0.0015804366,0.0013008869,0.0003126209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003332142,0.000109302535,0.01734839,0.00023776553,0.00009806425,0.0005018711,0.0007764601,0.031622432,0.039040614,0.87805885,0.0022186914,0.029654274],"study_design_scores_gemma":[0.000062328654,0.00023402166,0.012849532,0.00007485147,0.00008310808,0.0014785652,0.00053991674,0.17371859,0.015948517,0.7815299,0.013396154,0.00008458067],"about_ca_topic_score_codex":0.00045051437,"about_ca_topic_score_gemma":0.0003833157,"teacher_disagreement_score":0.0023337742,"about_ca_system_score_codex":0.00089209474,"about_ca_system_score_gemma":0.00029711568,"threshold_uncertainty_score":0.007807195},"labels":[],"label_agreement":null},{"id":"W4406172387","doi":"10.61091/um121-05","title":"Further Results on Equitable Near Proper Coloring of Derived Graph Families","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Graph coloring; Graph; Combinatorics; List coloring; Line graph; Graph power","score_opus":0.030270239475184084,"score_gpt":0.25860646530897496,"score_spread":0.22833622583379087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406172387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31803232,0.0013539991,0.5201187,0.0018947028,0.00013856239,0.000082729435,0.0005974605,0.00033091428,0.15745063],"genre_scores_gemma":[0.86754704,0.0014829045,0.10500192,0.0005538343,0.00021755905,0.00013596722,0.0009773297,0.00023103229,0.023852365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989674,0.00031238917,0.000054570894,0.00027861918,0.00023621673,0.00015077367],"domain_scores_gemma":[0.9962134,0.0019365026,0.00035026946,0.00072952313,0.00048638636,0.00028393546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014356668,0.00045520504,0.00060482725,0.0013012716,0.0019351626,0.0014726776,0.000924493,0.0006388406,0.007833362],"category_scores_gemma":[0.004342588,0.000381223,0.0008407772,0.0016239354,0.0019201263,0.004435559,0.001803167,0.0022565704,0.0005961748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028951794,0.000027265034,0.00065316533,0.000057388886,0.000008306307,0.00005483428,0.00029224303,0.006458812,0.0011975873,0.98154193,0.0011301722,0.008549243],"study_design_scores_gemma":[0.000009672948,0.00001960612,0.0005594836,0.000021824284,0.000011710978,0.0001217702,0.00017239233,0.017643465,0.00096714904,0.968695,0.011766786,0.000011198132],"about_ca_topic_score_codex":0.0012744197,"about_ca_topic_score_gemma":0.0017282013,"teacher_disagreement_score":0.007833362,"about_ca_system_score_codex":0.001843611,"about_ca_system_score_gemma":0.00053273456,"threshold_uncertainty_score":0.026205182},"labels":[],"label_agreement":null},{"id":"W4408731410","doi":"10.61091/um122-01","title":"Double bond indices and their application: QSAR of polycyclic aromatic hydrocarbons","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Chemical Thermodynamics and Molecular Structure","field":"Chemistry","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":"Quantitative structure–activity relationship; Double bond; Chemistry; Mathematics; Computational chemistry; Organic chemistry; Stereochemistry","score_opus":0.005513974749563501,"score_gpt":0.2326740027248319,"score_spread":0.2271600279752684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21699847,0.0052419994,0.766711,0.00032326896,0.00015930433,0.00017680245,0.00040435686,0.00037420585,0.009610625],"genre_scores_gemma":[0.8701801,0.0016685543,0.1265754,0.0000469161,0.00006572742,0.00011569003,0.0002721659,0.000038209873,0.0010371841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994338,0.00021321046,0.000040990864,0.000073504525,0.0002152024,0.000023238623],"domain_scores_gemma":[0.9984053,0.00094529614,0.0003049987,0.00011938659,0.0001791629,0.000045827906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132199,0.00074844185,0.0006814214,0.0021649904,0.00021763507,0.0008550533,0.00038479705,0.00036232558,0.0009912396],"category_scores_gemma":[0.004612472,0.00014043646,0.0004957932,0.00186211,0.0006496215,0.0010774703,0.00069035887,0.0006476624,0.0002302662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030069804,0.00024431918,0.012285392,0.00087662064,0.00025751986,0.0001977114,0.00014284899,0.486885,0.040787574,0.087041914,0.0011551755,0.36982518],"study_design_scores_gemma":[0.0000160023,0.00043907354,0.0037021916,0.00005122299,0.00006114152,0.0001774026,0.000056624056,0.94766355,0.01303821,0.03160335,0.0031407194,0.000050533752],"about_ca_topic_score_codex":0.00046654997,"about_ca_topic_score_gemma":0.0004950565,"teacher_disagreement_score":0.0021649904,"about_ca_system_score_codex":0.00035882607,"about_ca_system_score_gemma":0.00040641267,"threshold_uncertainty_score":0.0059877634},"labels":[],"label_agreement":null},{"id":"W4408731435","doi":"10.61091/um122-05","title":"Characterization of the geodesic distance on infinite graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Geodesic; Characterization (materials science); Combinatorics; Geometry","score_opus":0.011455554969760818,"score_gpt":0.22842676021681368,"score_spread":0.21697120524705288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74797076,0.0018409343,0.18125117,0.0020382572,0.00011754981,0.000040621922,0.00048127628,0.00019014426,0.066069305],"genre_scores_gemma":[0.96785027,0.00075329567,0.023120888,0.00017074001,0.00017274603,0.00005491698,0.0005558271,0.000086746266,0.0072346143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992561,0.0001804922,0.000048181017,0.00019385107,0.00021938737,0.00010206012],"domain_scores_gemma":[0.9975364,0.0011111682,0.0003968744,0.00022231684,0.0003135385,0.0004197466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005979152,0.0004997503,0.0005632924,0.002339124,0.0010897787,0.0019596207,0.00134508,0.00116393,0.003181995],"category_scores_gemma":[0.004093243,0.00032550626,0.00043233074,0.0014872022,0.002523057,0.004154764,0.0024314874,0.0018628982,0.00036235372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031541076,0.000014984732,0.00073111634,0.000040606246,0.0000058446813,0.00006145913,0.000235898,0.0033360403,0.0018651496,0.98724735,0.00071427674,0.0057157404],"study_design_scores_gemma":[0.000008158797,0.000028935872,0.0008522715,0.000024173783,0.00000830752,0.00021489161,0.00015562146,0.024661189,0.001037289,0.966923,0.006065818,0.000020465528],"about_ca_topic_score_codex":0.0008458457,"about_ca_topic_score_gemma":0.00060240924,"teacher_disagreement_score":0.003181995,"about_ca_system_score_codex":0.0015034354,"about_ca_system_score_gemma":0.00038351072,"threshold_uncertainty_score":0.010908246},"labels":[],"label_agreement":null},{"id":"W4408731436","doi":"10.61091/um122-06","title":"Dominator colorings of \\(n\\)-inordinate invariant intersection graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Invariant (physics); Combinatorics; Intersection (aeronautics); Discrete mathematics; Geography; Cartography","score_opus":0.015360826354190924,"score_gpt":0.291601772188336,"score_spread":0.27624094583414505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84569144,0.00011008666,0.09664621,0.00009838467,0.000037917576,0.000042732252,0.00019166266,0.00021954607,0.05696212],"genre_scores_gemma":[0.9823142,0.00009893426,0.013422903,0.000028303974,0.000013249976,0.00003392369,0.00024517404,0.00005052335,0.0037927625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959534,0.00007565068,0.00002006456,0.000085832406,0.000099085286,0.00012399122],"domain_scores_gemma":[0.9992316,0.00021589657,0.00013319062,0.0001636769,0.00015565653,0.00010002515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029695057,0.00022489789,0.00025863445,0.001193257,0.0011395089,0.0011104377,0.0006845656,0.0002757656,0.0035070647],"category_scores_gemma":[0.00096592563,0.00015944906,0.00041913477,0.0008539956,0.0011603406,0.0011312417,0.0007899029,0.0005452714,0.00024818393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014883892,0.00005032873,0.0034324145,0.000064697066,0.000016865104,0.00034043164,0.000630028,0.004220329,0.014638991,0.94912887,0.0007537724,0.026574306],"study_design_scores_gemma":[0.000054262382,0.00014188065,0.008616936,0.000050881295,0.00007043724,0.0011297847,0.0013260364,0.062395334,0.03978559,0.8671098,0.019242348,0.00007669633],"about_ca_topic_score_codex":0.0010001485,"about_ca_topic_score_gemma":0.0012407753,"teacher_disagreement_score":0.0035070647,"about_ca_system_score_codex":0.00061073696,"about_ca_system_score_gemma":0.0004473084,"threshold_uncertainty_score":0.01173234},"labels":[],"label_agreement":null},{"id":"W4408731440","doi":"10.61091/um122-03","title":"The covering cover pebbling number for some acyclic graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Cover (algebra); Combinatorics; Discrete mathematics","score_opus":0.01571595655761153,"score_gpt":0.2777455070045702,"score_spread":0.26202955044695864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9501232,0.00041882432,0.035227574,0.0004693192,0.000013409281,0.00001849191,0.000333746,0.000111640955,0.013283852],"genre_scores_gemma":[0.9833778,0.000297143,0.013792299,0.000053316988,0.000020179128,0.000030514617,0.0003058336,0.000032677766,0.0020901558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964595,0.00006872529,0.000016903614,0.00011024002,0.000069873095,0.00008836047],"domain_scores_gemma":[0.9960526,0.0028667084,0.00037267126,0.0002341948,0.00016096373,0.00031272866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515317,0.00030374792,0.00036198774,0.0017825713,0.0010980258,0.0011241052,0.00056210737,0.0007099153,0.0029180965],"category_scores_gemma":[0.0045870263,0.00025016576,0.0003599845,0.0010881968,0.0012166621,0.0022358787,0.0006229265,0.0008025289,0.00022803222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057926454,0.000166165,0.02878871,0.00028244886,0.000072795316,0.00071818515,0.00132625,0.11211466,0.027143782,0.745674,0.00717542,0.07595845],"study_design_scores_gemma":[0.000041675878,0.0001123516,0.012561509,0.000058021476,0.000056249643,0.0015135661,0.00045014327,0.3218164,0.014383364,0.6388941,0.010042958,0.00006973728],"about_ca_topic_score_codex":0.0011463478,"about_ca_topic_score_gemma":0.0011827975,"teacher_disagreement_score":0.0029180965,"about_ca_system_score_codex":0.0016491824,"about_ca_system_score_gemma":0.0003887637,"threshold_uncertainty_score":0.011965752},"labels":[],"label_agreement":null},{"id":"W4408731465","doi":"10.61091/um122-04","title":"Conjugating cyclic \\(n\\)-color compositions","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Color Science and Applications","field":"Physics and Astronomy","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; Food science; Chemistry","score_opus":0.007920833715129102,"score_gpt":0.2956058835690597,"score_spread":0.2876850498539306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6170717,0.00042328943,0.28756335,0.00022373162,0.00023785896,0.00014340422,0.00016061566,0.00032337266,0.09385262],"genre_scores_gemma":[0.8481655,0.00046664986,0.12252789,0.00025185925,0.00016272935,0.00014693243,0.00025035057,0.00029394013,0.027734187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929607,0.00013662312,0.00005768212,0.00019355511,0.00018538068,0.00013066467],"domain_scores_gemma":[0.99922645,0.00024252468,0.000116163465,0.00015920938,0.00016841957,0.00008719115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967544,0.00032465646,0.0003853203,0.00092625286,0.0014807428,0.0012862809,0.0004293341,0.00045634806,0.0045285327],"category_scores_gemma":[0.0019805518,0.00026283154,0.00067435665,0.0006175652,0.001524173,0.0020304883,0.0015152098,0.00067867053,0.00081551366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000868269,0.00005815378,0.001832818,0.000059345115,0.000014266128,0.00028501358,0.00040999084,0.0020739126,0.015696336,0.94867074,0.0008265425,0.029986111],"study_design_scores_gemma":[0.00003549904,0.00012555724,0.0017299565,0.00004858849,0.000051085677,0.0014287743,0.00038812417,0.02964788,0.04655972,0.8747974,0.045126833,0.000060536513],"about_ca_topic_score_codex":0.00051719137,"about_ca_topic_score_gemma":0.000776563,"teacher_disagreement_score":0.0045285327,"about_ca_system_score_codex":0.00071488257,"about_ca_system_score_gemma":0.00049963314,"threshold_uncertainty_score":0.015149415},"labels":[],"label_agreement":null},{"id":"W4408731602","doi":"10.61091/um122-07","title":"Type \\((a,b,c)\\) face-magic labelings of prism graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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 (telescope); Mathematics; Combinatorics; Prism; Discrete mathematics; Physics; Optics; Astronomy","score_opus":0.01466898852695081,"score_gpt":0.259617444768245,"score_spread":0.2449484562412942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61851865,0.00029962574,0.29940492,0.00058839784,0.00026505705,0.00015983956,0.0015722027,0.0016813839,0.077509895],"genre_scores_gemma":[0.8550549,0.00020166018,0.13127296,0.00025342722,0.00006952786,0.00022107163,0.0015830082,0.00020953229,0.011133835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992298,0.00012912284,0.00006417938,0.00019037296,0.00020108408,0.00018544246],"domain_scores_gemma":[0.9980876,0.0006271343,0.00030864732,0.00027587422,0.00038543402,0.00031540458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102939,0.0003887272,0.00026869462,0.000722834,0.0008283349,0.0011935704,0.00078755524,0.0006239164,0.005451381],"category_scores_gemma":[0.002562706,0.0004974239,0.0005345675,0.0006416518,0.0008796603,0.0013281431,0.00085556146,0.001056853,0.00084733684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000831024,0.00014100871,0.005482861,0.0003389391,0.000039149647,0.00069786236,0.0005597707,0.022288946,0.05511037,0.82710296,0.012907218,0.07449987],"study_design_scores_gemma":[0.00020001299,0.00042732753,0.0040348535,0.00011982178,0.0000754863,0.0016932931,0.0006847972,0.123697095,0.054307837,0.7794567,0.035139855,0.00016296165],"about_ca_topic_score_codex":0.0015116401,"about_ca_topic_score_gemma":0.0026394038,"teacher_disagreement_score":0.005451381,"about_ca_system_score_codex":0.0007354316,"about_ca_system_score_gemma":0.00080383767,"threshold_uncertainty_score":0.018236697},"labels":[],"label_agreement":null},{"id":"W4408731651","doi":"10.61091/um122-02","title":"On 1-11-representability and multi-1-11-representability of graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","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","score_opus":0.030053615606383734,"score_gpt":0.3417294456927507,"score_spread":0.31167583008636696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22668374,0.0034398423,0.66430056,0.0061258315,0.0007503124,0.00017782976,0.0016758258,0.0014732577,0.0953728],"genre_scores_gemma":[0.8403752,0.0036348994,0.12784761,0.0024236129,0.001117837,0.0003248246,0.0020121278,0.0007618313,0.021502113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767977,0.0005723253,0.000113516464,0.00078918773,0.00040468035,0.0004405509],"domain_scores_gemma":[0.98848814,0.007778795,0.0010478612,0.0012695856,0.00085314835,0.0005625447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015047386,0.0015926893,0.0010615285,0.0016575507,0.002300051,0.0029589534,0.0019499209,0.0019467477,0.0116061],"category_scores_gemma":[0.010681068,0.00069898897,0.0019810533,0.0025807826,0.005083345,0.010319062,0.003411631,0.005949884,0.002932306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015072721,0.0000933389,0.0006638398,0.00023311116,0.000029861907,0.00036427478,0.00077944074,0.009441304,0.0041136206,0.9557736,0.0044068275,0.023950186],"study_design_scores_gemma":[0.00002310556,0.00007195463,0.00027462395,0.000059163092,0.000026825855,0.00025408834,0.00014234889,0.011393842,0.0016894703,0.97440636,0.011623663,0.000034565055],"about_ca_topic_score_codex":0.0016162498,"about_ca_topic_score_gemma":0.0013382075,"teacher_disagreement_score":0.0116061,"about_ca_system_score_codex":0.0021841626,"about_ca_system_score_gemma":0.0008166638,"threshold_uncertainty_score":0.038826287},"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":"W4411687182","doi":"10.61091/um123-14","title":"Certified domination critical graphs upon vertex removal","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Distributed systems and fault tolerance","field":"Computer Science","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; Vertex (graph theory); Certification; Combinatorics; Graph; Discrete mathematics; Political science","score_opus":0.01611058620925376,"score_gpt":0.290874895316638,"score_spread":0.27476430910738425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3268442,0.00085845886,0.53331864,0.002141443,0.00071722234,0.0011227969,0.0043167667,0.0053683133,0.12531213],"genre_scores_gemma":[0.77662015,0.00066362263,0.1439526,0.0011781292,0.00035990842,0.0007138288,0.007108102,0.0011135539,0.068290085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987914,0.00016399907,0.000061688865,0.000351427,0.00042808714,0.0002035444],"domain_scores_gemma":[0.9950631,0.0018547359,0.00045471836,0.0011095791,0.001072076,0.00044578788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096522743,0.0008605316,0.0006460934,0.0022015404,0.0010343244,0.0017190212,0.0012644943,0.00077464915,0.009495822],"category_scores_gemma":[0.0077503244,0.0005022156,0.00063624216,0.0016791624,0.0012585777,0.0024017068,0.0021714806,0.00155464,0.0021412026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013535733,0.000298862,0.005752706,0.00093214586,0.000121280886,0.0016293138,0.0012925756,0.08097097,0.046723,0.4949384,0.05806561,0.30792165],"study_design_scores_gemma":[0.0002665304,0.0002759854,0.0035932364,0.00016447733,0.00011983647,0.001423823,0.0006174936,0.18640347,0.036996905,0.6745298,0.09552125,0.00008725408],"about_ca_topic_score_codex":0.0031909843,"about_ca_topic_score_gemma":0.003745157,"teacher_disagreement_score":0.009495822,"about_ca_system_score_codex":0.0017756511,"about_ca_system_score_gemma":0.0019704734,"threshold_uncertainty_score":0.031766713},"labels":[],"label_agreement":null},{"id":"W4411687184","doi":"10.61091/um123-10","title":"Dynamical of Kirchhoff type BBM equations on unbounded domains","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","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":"Natural Science Foundation of Qinghai; National Natural Science Foundation of China","keywords":"Mathematics; Type (biology); Pure mathematics; Mathematical analysis; Biology","score_opus":0.021286714888935465,"score_gpt":0.2949933235737732,"score_spread":0.27370660868483776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64066243,0.0015103944,0.3150709,0.0013477452,0.00030198426,0.00009855078,0.00025630658,0.00021843144,0.040533233],"genre_scores_gemma":[0.9696443,0.0005381657,0.0131843295,0.0001233141,0.00009136743,0.00008740519,0.00015580442,0.000050008388,0.016125511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997726,0.00007041701,0.0000138113455,0.00003299384,0.00007240431,0.000037753387],"domain_scores_gemma":[0.99955255,0.00013130676,0.00008011181,0.00003623406,0.000101199854,0.0000986958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106513,0.00047778463,0.00048460005,0.000966147,0.00056177075,0.0011197195,0.0006579787,0.0008032489,0.0019555655],"category_scores_gemma":[0.001993939,0.00024327946,0.00056576,0.00034406575,0.0013358956,0.0017850812,0.002006794,0.0009546298,0.0002523746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008248558,0.000050356975,0.0019141444,0.00012394486,0.000037821526,0.0006743494,0.00033414215,0.06248716,0.022370221,0.9028377,0.0009817458,0.008105937],"study_design_scores_gemma":[0.000032573676,0.00005709481,0.0017149736,0.00003314532,0.0000124509215,0.00029153464,0.00016023545,0.7227367,0.0025670833,0.27045676,0.0019006049,0.000036811052],"about_ca_topic_score_codex":0.001833148,"about_ca_topic_score_gemma":0.0008225306,"teacher_disagreement_score":0.0019555655,"about_ca_system_score_codex":0.0007173725,"about_ca_system_score_gemma":0.0005262155,"threshold_uncertainty_score":0.006542027},"labels":[],"label_agreement":null},{"id":"W4411687185","doi":"10.61091/um123-11","title":"Asymptotic average shadowable points for homeomorphisms","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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; Statistics; Applied mathematics","score_opus":0.035478993943974906,"score_gpt":0.3279318892912924,"score_spread":0.2924528953473175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665716,0.0008653362,0.3560088,0.00051359273,0.00010395394,0.000055114513,0.00039569964,0.00037423937,0.075111695],"genre_scores_gemma":[0.9695439,0.00050889485,0.015615846,0.00009639455,0.00017540788,0.00007805376,0.00049780693,0.000087453,0.013396211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935037,0.00009589928,0.00003480284,0.00020597136,0.0002045625,0.00010842269],"domain_scores_gemma":[0.9983229,0.00070072175,0.00021641997,0.0002175162,0.0003130949,0.00022919777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005616428,0.00052319886,0.0006358581,0.0016171648,0.0010011585,0.0012841478,0.00056718354,0.00036376674,0.0059644966],"category_scores_gemma":[0.0032288039,0.00024272063,0.00074615906,0.0007901972,0.001951016,0.0025793063,0.0018550395,0.0012711526,0.0004336943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055944416,0.000027072672,0.0019827986,0.00006240235,0.000022913913,0.00030448104,0.00048721727,0.0070344,0.004031932,0.9697114,0.0013913455,0.01488806],"study_design_scores_gemma":[0.00002521835,0.00008915429,0.004847718,0.000025579257,0.000027349653,0.0005439313,0.000480897,0.077302456,0.004336551,0.9020471,0.010242202,0.000031869014],"about_ca_topic_score_codex":0.0018388936,"about_ca_topic_score_gemma":0.0009185436,"teacher_disagreement_score":0.0059644966,"about_ca_system_score_codex":0.001217829,"about_ca_system_score_gemma":0.00035002973,"threshold_uncertainty_score":0.019953191},"labels":[],"label_agreement":null},{"id":"W4411687186","doi":"10.61091/um123-13","title":"Ramsey theory for a generalized fan versus triangles","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Topology and Set Theory","field":"Mathematics","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; Mathematical economics; Arithmetic; Combinatorics","score_opus":0.07570500566056446,"score_gpt":0.4012964797719996,"score_spread":0.3255914741114352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52668655,0.0033168476,0.24547477,0.0024519744,0.00023850825,0.00006320996,0.000516846,0.0003629637,0.2208883],"genre_scores_gemma":[0.9567057,0.0009834078,0.017386328,0.00032129465,0.0001761521,0.00005342106,0.00026978363,0.000078945486,0.024024786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966,0.000095677475,0.000011552605,0.00008815314,0.000083419625,0.000061190905],"domain_scores_gemma":[0.9992536,0.00032515856,0.00007627459,0.00006967802,0.000121729274,0.00015362522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007145188,0.00050617737,0.00040762636,0.001070897,0.00088131725,0.0011920865,0.0005530374,0.0004729642,0.013417173],"category_scores_gemma":[0.0018098096,0.00019714236,0.00046016794,0.00078159064,0.0014493412,0.0041671842,0.0012093794,0.0010769453,0.0007034504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025015976,0.000006183751,0.0001720439,0.000029614228,0.0000040731043,0.00003467098,0.00009005078,0.0022507466,0.0004921416,0.99146605,0.001281677,0.0041477964],"study_design_scores_gemma":[0.000014594387,0.000026981139,0.00046521294,0.000021351592,0.000011026869,0.00013587328,0.00013691506,0.029277466,0.0005105561,0.961332,0.008057993,0.000010066982],"about_ca_topic_score_codex":0.0022792849,"about_ca_topic_score_gemma":0.0019177229,"teacher_disagreement_score":0.013417173,"about_ca_system_score_codex":0.0009898946,"about_ca_system_score_gemma":0.00028255483,"threshold_uncertainty_score":0.04488498},"labels":[],"label_agreement":null},{"id":"W4411687188","doi":"10.61091/um123-04","title":"Facial entire coloring of 4-minor-free graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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; Minor (academic); Humanities; Art","score_opus":0.014731676806994018,"score_gpt":0.2484096821178653,"score_spread":0.23367800531087127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7517852,0.00023093139,0.152655,0.00066038297,0.00016388783,0.00016830766,0.00214967,0.0011842889,0.091002315],"genre_scores_gemma":[0.9012142,0.0002509867,0.04627085,0.00026370698,0.00006685295,0.00015997441,0.0035523472,0.0003295575,0.04789167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976784,0.00003060638,0.000009807114,0.0000658103,0.000045426495,0.00008062424],"domain_scores_gemma":[0.999481,0.000106030435,0.00007900198,0.00010416562,0.00009867565,0.000131212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016242852,0.000581023,0.00028174702,0.0006428604,0.0008802854,0.0008959182,0.00060549803,0.0003104036,0.008892389],"category_scores_gemma":[0.0006572517,0.00031501436,0.00037924497,0.0006069798,0.00068992743,0.00087924005,0.00086944405,0.00061602,0.0015041478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074586587,0.00024127403,0.0050797635,0.00030594954,0.00004998196,0.0010030853,0.0013029667,0.048078097,0.053919423,0.7112812,0.039531674,0.1384607],"study_design_scores_gemma":[0.00013811655,0.00022778865,0.007593789,0.000060520997,0.0000690838,0.0011020809,0.00056808715,0.13121276,0.024447897,0.738335,0.096165314,0.00007955949],"about_ca_topic_score_codex":0.0050392733,"about_ca_topic_score_gemma":0.005823081,"teacher_disagreement_score":0.008892389,"about_ca_system_score_codex":0.0011227588,"about_ca_system_score_gemma":0.00064069853,"threshold_uncertainty_score":0.029748023},"labels":[],"label_agreement":null},{"id":"W4411687189","doi":"10.61091/um123-12","title":"A note on the second neighborhood problem","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Banach Space Theory","field":"Mathematics","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; Mathematics education; Mathematical economics","score_opus":0.023750758747147133,"score_gpt":0.3121598329901351,"score_spread":0.288409074242988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687189","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.20199595,0.0049170773,0.33974192,0.028933203,0.0038929607,0.00013218203,0.0011244036,0.0010914321,0.4181709],"genre_scores_gemma":[0.8369264,0.0021598057,0.06668606,0.0040588803,0.001965708,0.0002721787,0.0014939677,0.00074308214,0.08569385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984756,0.00039845234,0.00004901036,0.00045250962,0.00037570862,0.00024877104],"domain_scores_gemma":[0.99702114,0.0014080605,0.00017004402,0.0006682727,0.00039940214,0.00033311456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012539828,0.0005929704,0.00097129657,0.00079248095,0.0028651091,0.0020157595,0.001786307,0.0018534113,0.013470177],"category_scores_gemma":[0.0060181795,0.00041682355,0.0014745039,0.0010670607,0.0025602388,0.006471254,0.0035646237,0.0039872755,0.0018630861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004530589,0.000020784806,0.00045461205,0.000046788693,0.000006932197,0.00011558512,0.0001813603,0.0015271939,0.0004984496,0.9757697,0.013239041,0.008094218],"study_design_scores_gemma":[0.00003638252,0.000050108098,0.00055623514,0.0000454465,0.000013591304,0.00026912874,0.0002664089,0.015811438,0.0011530276,0.9318351,0.049932394,0.000030710842],"about_ca_topic_score_codex":0.005122067,"about_ca_topic_score_gemma":0.0037365912,"teacher_disagreement_score":0.013470177,"about_ca_system_score_codex":0.0018614243,"about_ca_system_score_gemma":0.00086069724,"threshold_uncertainty_score":0.045062244},"labels":[],"label_agreement":null},{"id":"W4411687192","doi":"10.61091/um123-01","title":"Crosscap two characterization of dot product graphs of commutative rings","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Rings, Modules, and Algebras","field":"Mathematics","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":"University Grants Commission","keywords":"Mathematics; Characterization (materials science); Commutative property; Product (mathematics); Dot product; Combinatorics; Discrete mathematics; Nanotechnology; Geometry; Materials science","score_opus":0.02943024324399919,"score_gpt":0.314846752315016,"score_spread":0.28541650907101684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6279185,0.000763652,0.25861594,0.0006743725,0.00020964292,0.00011217066,0.0011172546,0.0006115739,0.10997691],"genre_scores_gemma":[0.9530171,0.00047470233,0.020482387,0.00026447687,0.00013173136,0.00008527811,0.00086853775,0.00015538483,0.02452032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952984,0.0000794389,0.000024928426,0.00017912488,0.000109828376,0.00007689385],"domain_scores_gemma":[0.9986124,0.00033362966,0.0003030039,0.00014024736,0.00031495618,0.00029575065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000391185,0.00044165525,0.00032125457,0.00213754,0.0010738719,0.0015866085,0.0005635757,0.0004254042,0.012845462],"category_scores_gemma":[0.0011405922,0.0003053597,0.00050614984,0.0014914299,0.001113305,0.0028480212,0.0010212702,0.0007717116,0.00085650483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005908691,0.00003144232,0.0011858692,0.00005934301,0.00001259148,0.00024013093,0.00041551175,0.0013598877,0.0042159245,0.9752746,0.0018307274,0.015315057],"study_design_scores_gemma":[0.000030226633,0.000121441706,0.0045198463,0.000053481428,0.00005629947,0.0012863968,0.0007913535,0.023984881,0.011700875,0.9204536,0.03694397,0.000057550427],"about_ca_topic_score_codex":0.0009404743,"about_ca_topic_score_gemma":0.0007556853,"teacher_disagreement_score":0.012845462,"about_ca_system_score_codex":0.0008338411,"about_ca_system_score_gemma":0.00032873687,"threshold_uncertainty_score":0.042972326},"labels":[],"label_agreement":null},{"id":"W4411687193","doi":"10.61091/um123-15","title":"Alpha-trees over paths and caterpillars","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Data Management and Algorithms","field":"Computer Science","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; Alpha (finance); Statistics","score_opus":0.009181463388676548,"score_gpt":0.25228080326702074,"score_spread":0.2430993398783442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25107396,0.0016795681,0.43552017,0.001812869,0.0004834903,0.00015353,0.0036242704,0.00307948,0.30257267],"genre_scores_gemma":[0.7882662,0.0013625012,0.10218983,0.0005347378,0.00023880038,0.00014839378,0.0022786483,0.0005087324,0.104472175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960583,0.000055424967,0.00002024962,0.000116430994,0.00008920588,0.00011277864],"domain_scores_gemma":[0.99928445,0.00022168229,0.00009672601,0.00011863354,0.00012775934,0.00015080873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031004747,0.00043488268,0.0003855849,0.0009549964,0.0011983886,0.0018311553,0.0006665171,0.000625796,0.018355755],"category_scores_gemma":[0.0012343046,0.00042047,0.0005847664,0.0018031338,0.0010378126,0.0029291653,0.0012848164,0.0013550266,0.0033227894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088688044,0.000018611629,0.00044081293,0.0000716107,0.000008627909,0.0001725901,0.00029904308,0.003950551,0.0018277505,0.95705533,0.0063052075,0.02976126],"study_design_scores_gemma":[0.000020704592,0.00003579009,0.0006470938,0.000041251227,0.000013818813,0.00029249617,0.00021231527,0.009275937,0.0014416896,0.9186054,0.069397606,0.000015911379],"about_ca_topic_score_codex":0.0022626875,"about_ca_topic_score_gemma":0.0028271757,"teacher_disagreement_score":0.018355755,"about_ca_system_score_codex":0.0013549648,"about_ca_system_score_gemma":0.00046478442,"threshold_uncertainty_score":0.061406136},"labels":[],"label_agreement":null},{"id":"W4411687194","doi":"10.61091/um123-03","title":"Maps of combinatorial trees with weakly connected Markov graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Data Management and Algorithms","field":"Computer Science","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; Markov chain; Combinatorics; Discrete mathematics; Statistics","score_opus":0.008671139799528452,"score_gpt":0.23015525979199436,"score_spread":0.22148411999246592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66332847,0.00020262277,0.3237751,0.0002966841,0.000035016572,0.0000574042,0.00031776878,0.00027050907,0.011716438],"genre_scores_gemma":[0.96305645,0.00017249967,0.031140924,0.00006797045,0.000048541104,0.000088435714,0.0002838094,0.000080020676,0.0050613442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996613,0.00009712889,0.000020283525,0.000084324456,0.000088084686,0.000048863047],"domain_scores_gemma":[0.9976174,0.0012450592,0.00034643206,0.00023364203,0.00024193333,0.00031554536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003811242,0.00023883232,0.00029687866,0.0013677237,0.0007990165,0.0013220764,0.0005524784,0.0005068125,0.002590818],"category_scores_gemma":[0.0032433541,0.00035659733,0.0006340276,0.0006877692,0.0011888365,0.0021858478,0.0011909719,0.000706884,0.000261422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006495204,0.000030654086,0.0017903661,0.00004040085,0.000016470032,0.0002734121,0.0004914641,0.020699602,0.0049201464,0.9624241,0.00049346546,0.008754946],"study_design_scores_gemma":[0.000012295808,0.000025204734,0.0009735639,0.000014872524,0.000011753763,0.00019326071,0.00014776776,0.12846366,0.0021717306,0.86556935,0.0023999054,0.000016750835],"about_ca_topic_score_codex":0.00111668,"about_ca_topic_score_gemma":0.0012760989,"teacher_disagreement_score":0.002590818,"about_ca_system_score_codex":0.0007777932,"about_ca_system_score_gemma":0.00041960488,"threshold_uncertainty_score":0.008667111},"labels":[],"label_agreement":null},{"id":"W4411687195","doi":"10.61091/um123-06","title":"k-division Fibonacci-Pell sequences and their applications","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","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":"Fibonacci number; Division (mathematics); Mathematics; Arithmetic; Genealogy; Combinatorics; History","score_opus":0.007387932025214829,"score_gpt":0.278133841525737,"score_spread":0.2707459095005222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11779695,0.0014817679,0.77185804,0.00054768246,0.00041233667,0.00013531459,0.00019417223,0.00043011623,0.10714369],"genre_scores_gemma":[0.69112873,0.0022440732,0.26320413,0.00041976056,0.00052570296,0.00031646775,0.00033306837,0.00030486638,0.041523237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996371,0.00007511464,0.000028676428,0.00009665843,0.00011195787,0.000050411996],"domain_scores_gemma":[0.9994869,0.00017750377,0.00006509989,0.00006176644,0.00012765222,0.00008107424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004896461,0.00061601883,0.0003347847,0.0014411598,0.0010274427,0.0008682449,0.0005042989,0.00053112983,0.0082164835],"category_scores_gemma":[0.0024159176,0.00024628144,0.0004997632,0.0009407462,0.0013124244,0.0019105523,0.0010799005,0.00096072035,0.0017664782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024838328,0.000013328794,0.00030055572,0.00004999683,0.0000043576265,0.000117687734,0.0002325948,0.003039088,0.00249759,0.9514953,0.000876984,0.04134757],"study_design_scores_gemma":[0.000012261052,0.00007421008,0.00051338685,0.000040825296,0.000009542427,0.00054618594,0.00015499046,0.036334127,0.0069901464,0.92092454,0.034365173,0.00003465485],"about_ca_topic_score_codex":0.00088720286,"about_ca_topic_score_gemma":0.0006865541,"teacher_disagreement_score":0.0082164835,"about_ca_system_score_codex":0.00085027685,"about_ca_system_score_gemma":0.000529536,"threshold_uncertainty_score":0.02748686},"labels":[],"label_agreement":null},{"id":"W4411687196","doi":"10.61091/um123-07","title":"Characterizing s-strongly chordal bipartite graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Chordal graph; Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.03318212892953164,"score_gpt":0.3200311036284845,"score_spread":0.2868489746989529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20778093,0.00038384603,0.7034032,0.001271786,0.00009975231,0.00028757294,0.001569039,0.00058034324,0.08462357],"genre_scores_gemma":[0.8619532,0.0006270833,0.1112091,0.0007290552,0.00027735645,0.00028812548,0.0025712447,0.00029540493,0.022049436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902594,0.00021921807,0.000052305557,0.0003149346,0.00023762356,0.00015004248],"domain_scores_gemma":[0.99619776,0.0015774415,0.00051851204,0.0005097159,0.0007600034,0.000436479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008714089,0.00067638577,0.00038511248,0.0014090576,0.0009233082,0.0020899891,0.0011772672,0.000806746,0.0079467865],"category_scores_gemma":[0.0053520873,0.00035398555,0.00072493113,0.0013473025,0.0016335563,0.0033713884,0.0022348205,0.0013110085,0.0013526202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005358604,0.000044047913,0.0018508239,0.00012466627,0.000016850472,0.00012826128,0.0003615806,0.01089016,0.0060923668,0.9478325,0.005343341,0.027261859],"study_design_scores_gemma":[0.000011738854,0.000033056956,0.0007469074,0.000026357791,0.000010679687,0.00020002283,0.00027434537,0.05975658,0.00244234,0.92467546,0.011805479,0.000016949309],"about_ca_topic_score_codex":0.001640904,"about_ca_topic_score_gemma":0.0017589343,"teacher_disagreement_score":0.0079467865,"about_ca_system_score_codex":0.0012936988,"about_ca_system_score_gemma":0.0007370583,"threshold_uncertainty_score":0.026584685},"labels":[],"label_agreement":null},{"id":"W4411687198","doi":"10.61091/um123-08","title":"Inverse Italian domination in graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Italy: Economic History and Contemporary Issues","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Combinatorics; Geometry","score_opus":0.024986247399886093,"score_gpt":0.22801391357235598,"score_spread":0.2030276661724699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31333125,0.0014082869,0.388921,0.0019697978,0.00027626124,0.00017582235,0.0014284363,0.0012552809,0.2912339],"genre_scores_gemma":[0.84684855,0.0008609439,0.06367767,0.00091647956,0.00029759156,0.00020368301,0.00176898,0.00043791128,0.084988266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917454,0.0001480268,0.000032376476,0.0002526035,0.00022215184,0.00017024756],"domain_scores_gemma":[0.99898404,0.00044952045,0.00011158987,0.00013460191,0.0002026991,0.00011749417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069320697,0.00060224073,0.00045281518,0.0016840302,0.0013273029,0.0017305111,0.00051199575,0.0005341496,0.007620993],"category_scores_gemma":[0.0026959134,0.00036546268,0.00081895327,0.0012574346,0.0016096047,0.0019421948,0.001133819,0.0010297312,0.001246404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014774984,0.00005034703,0.0017321648,0.00017660168,0.00003161846,0.00031508232,0.0008971859,0.012757536,0.005444111,0.8832743,0.016055563,0.07911776],"study_design_scores_gemma":[0.00004195298,0.000057796085,0.002303353,0.000051372754,0.000042215135,0.0007013635,0.0002416291,0.057939366,0.005034622,0.8514789,0.08206529,0.000042159132],"about_ca_topic_score_codex":0.0038964585,"about_ca_topic_score_gemma":0.004415321,"teacher_disagreement_score":0.007620993,"about_ca_system_score_codex":0.0023700048,"about_ca_system_score_gemma":0.0007012636,"threshold_uncertainty_score":0.025494754},"labels":[],"label_agreement":null},{"id":"W4411687200","doi":"10.61091/um123-02","title":"On some metric properties of supertoken graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Agència de Gestió d'Ajuts Universitaris i de Recerca; Universitat Politècnica de Catalunya; Ministerio de Ciencia e Innovación","keywords":"Mathematics; Metric (unit); Marketing; Business","score_opus":0.02037943116567932,"score_gpt":0.23720330431239264,"score_spread":0.2168238731467133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6700706,0.0012599224,0.26732752,0.0021437448,0.00012227733,0.0000758525,0.0013257131,0.00047437934,0.057199936],"genre_scores_gemma":[0.9398823,0.00084317045,0.045680005,0.00051769963,0.00014603607,0.00013594466,0.0013054453,0.00023427633,0.011255241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.0002562966,0.000044759683,0.00029335328,0.00025953198,0.00017602328],"domain_scores_gemma":[0.9964469,0.0012952136,0.00063294196,0.00046106614,0.000476802,0.00068718696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967089,0.00060921645,0.0006552743,0.0019165886,0.0017978786,0.001798726,0.0012304309,0.0008851915,0.0068554976],"category_scores_gemma":[0.0039402046,0.00046067705,0.0007367353,0.0019449847,0.0017645496,0.0056261662,0.0019852982,0.0020976018,0.00067510735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007484745,0.00002735839,0.0013000324,0.00009005624,0.000016363447,0.00011684089,0.00031324982,0.007698471,0.0024712938,0.97490454,0.0025507696,0.010436271],"study_design_scores_gemma":[0.000018347557,0.000050804083,0.0018283095,0.000035623612,0.000024367326,0.0003989971,0.00028160165,0.05685767,0.0019177053,0.9257766,0.012771653,0.000038415626],"about_ca_topic_score_codex":0.0018067377,"about_ca_topic_score_gemma":0.0017729409,"teacher_disagreement_score":0.0068554976,"about_ca_system_score_codex":0.0020303966,"about_ca_system_score_gemma":0.00055225147,"threshold_uncertainty_score":0.0229339},"labels":[],"label_agreement":null},{"id":"W4411687202","doi":"10.61091/um123-05","title":"Weighted domination models and randomized heuristics","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Heuristics; Statistics; Mathematical optimization","score_opus":0.025733011013319405,"score_gpt":0.23997054963815645,"score_spread":0.21423753862483705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025937261,0.0009247642,0.9598404,0.00091678696,0.00017467166,0.00025813052,0.00019521597,0.00032691524,0.01142591],"genre_scores_gemma":[0.74261606,0.001365116,0.23721328,0.00082014746,0.00028479868,0.0009415137,0.00041393487,0.00025272078,0.016092466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537414,0.002636014,0.00012958806,0.0007335547,0.00056050776,0.0005661972],"domain_scores_gemma":[0.98675644,0.010295026,0.0011098284,0.00094231317,0.00051250396,0.0003838697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048738495,0.0018248379,0.0021976263,0.001693816,0.00096029387,0.0024993096,0.0039975527,0.0019608608,0.0062044547],"category_scores_gemma":[0.015448548,0.0008656036,0.0015933051,0.002796433,0.002467037,0.0038426204,0.0016429394,0.002315754,0.0007160467],"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.00011178904,0.000116558695,0.00034564556,0.00013761346,0.00010589304,0.00010602491,0.000077742705,0.7674516,0.00055129227,0.2102119,0.0026381135,0.018145883],"study_design_scores_gemma":[0.000052456944,0.00003689484,0.000060889495,0.000011623511,0.000018475563,0.000025012361,0.000017989134,0.88853383,0.00016320658,0.10984323,0.0012244796,0.000011852957],"about_ca_topic_score_codex":0.0038232137,"about_ca_topic_score_gemma":0.004821215,"teacher_disagreement_score":0.0062044547,"about_ca_system_score_codex":0.0031575896,"about_ca_system_score_gemma":0.0020793413,"threshold_uncertainty_score":0.02577573},"labels":[],"label_agreement":null},{"id":"W4411687204","doi":"10.61091/um123-09","title":"Path-systems in regular graphs and bipartite graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Bipartite graph; Mathematics; Combinatorics; Path (computing); Chordal graph; Longest path problem; Discrete mathematics; Graph; Computer science; Computer network","score_opus":0.025653382567953017,"score_gpt":0.29861877485096544,"score_spread":0.2729653922830124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36497658,0.0008195473,0.55944616,0.0015972176,0.0003054182,0.0003989947,0.0038888382,0.0017813265,0.066785984],"genre_scores_gemma":[0.82488155,0.00077116187,0.13610148,0.0007001682,0.0002931037,0.0006648858,0.005223344,0.00039333114,0.030971017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983962,0.0003566182,0.000118964315,0.0006266994,0.00023490618,0.00026654],"domain_scores_gemma":[0.9972549,0.0011794211,0.00054454984,0.00032736757,0.00031723533,0.00037659373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011160966,0.0010047978,0.0007971522,0.0019802246,0.0023941726,0.0025986517,0.0014276134,0.0013421898,0.015519028],"category_scores_gemma":[0.0030615283,0.000823478,0.0011454697,0.0039151525,0.0026175678,0.0055281688,0.0025033713,0.002070948,0.0017041805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001364646,0.0000712048,0.0007667242,0.00016469786,0.000027822864,0.00024672068,0.0005353353,0.007481421,0.002119008,0.97111267,0.003825504,0.013512542],"study_design_scores_gemma":[0.000047964128,0.00005338761,0.0005160304,0.000029157598,0.000025253394,0.00021365902,0.00021615282,0.021855801,0.0011185759,0.96752644,0.008371693,0.00002590226],"about_ca_topic_score_codex":0.0020668781,"about_ca_topic_score_gemma":0.0018567999,"teacher_disagreement_score":0.015519028,"about_ca_system_score_codex":0.0011861331,"about_ca_system_score_gemma":0.0008698749,"threshold_uncertainty_score":0.0519163},"labels":[],"label_agreement":null},{"id":"W4411798774","doi":"10.61091/um123-16","title":"The edge surviving rate of Halin graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Theory and Algorithms","field":"Computer Science","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; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer science","score_opus":0.010248360433344643,"score_gpt":0.2485449282576334,"score_spread":0.23829656782428876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411798774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7463667,0.0014962791,0.1699715,0.003166587,0.00026864777,0.0002692093,0.0034630478,0.0015746418,0.07342338],"genre_scores_gemma":[0.9600589,0.0010841641,0.0142294355,0.00028841192,0.00016460539,0.00025771768,0.0018460307,0.000401114,0.021669537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990061,0.00027101798,0.000042273226,0.00019070916,0.00021141817,0.0002785346],"domain_scores_gemma":[0.9865296,0.007801731,0.0012382846,0.0013897939,0.0014833604,0.0015572868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068546,0.0009433509,0.00088918826,0.0027386553,0.0022212742,0.002304544,0.0024049124,0.0012427742,0.012107729],"category_scores_gemma":[0.017758276,0.0005084157,0.00065609516,0.0013020458,0.001899605,0.0039311107,0.0016235164,0.001532374,0.0017579844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009035633,0.00019603895,0.010939598,0.00042456464,0.0001247895,0.0005230084,0.0014663392,0.183334,0.007949606,0.68637097,0.038226474,0.069541],"study_design_scores_gemma":[0.00007856841,0.00022707028,0.003609688,0.00012086853,0.00009679539,0.0006781232,0.00082739064,0.58527756,0.00896658,0.3810637,0.018987041,0.00006662942],"about_ca_topic_score_codex":0.003026855,"about_ca_topic_score_gemma":0.0019894398,"teacher_disagreement_score":0.012107729,"about_ca_system_score_codex":0.00230802,"about_ca_system_score_gemma":0.0009164538,"threshold_uncertainty_score":0.040504396},"labels":[],"label_agreement":null},{"id":"W7083575399","doi":"10.61091/um124-05","title":"Zonal and cozonal labelings using arbitrary abelian groups","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Strong","keywords":"Abelian group; Edge-graceful labeling; Connection (principal bundle); Graph; Graph labeling; Boundary (topology)","score_opus":0.0418691602689066,"score_gpt":0.2364571509736062,"score_spread":0.1945879907046996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083575399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20142953,0.00047741923,0.5922393,0.0014318815,0.0007171116,0.00016172377,0.0009824542,0.002509931,0.20005055],"genre_scores_gemma":[0.69298273,0.00056054106,0.20563021,0.00065188156,0.0003372144,0.00031754072,0.0015368018,0.0009885277,0.09699451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992792,0.00012395119,0.000045586392,0.00021589223,0.00014103156,0.00019428642],"domain_scores_gemma":[0.9991435,0.00017970605,0.00011923196,0.0002272278,0.00021267461,0.00011759712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051420176,0.0004918466,0.0002592759,0.0011886344,0.0012054616,0.0018807736,0.0007864217,0.0005885257,0.012886327],"category_scores_gemma":[0.0013421312,0.00035639308,0.00067974086,0.0010654975,0.0014754618,0.003543652,0.0018865113,0.0011662563,0.003264095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056560406,0.000026476711,0.00021177926,0.000030039404,0.00000445087,0.00005401718,0.00024493533,0.001465897,0.0030385377,0.971365,0.0033762155,0.020126194],"study_design_scores_gemma":[0.00003833161,0.00004640125,0.00045906805,0.000022304046,0.000017421857,0.0001654946,0.00031173413,0.01564922,0.00476107,0.9078032,0.070688866,0.00003690388],"about_ca_topic_score_codex":0.002981319,"about_ca_topic_score_gemma":0.0040051886,"teacher_disagreement_score":0.012886327,"about_ca_system_score_codex":0.0013132767,"about_ca_system_score_gemma":0.0005693793,"threshold_uncertainty_score":0.043109},"labels":[],"label_agreement":null},{"id":"W7083575723","doi":"10.61091/um124-12","title":"On local antimagic chromatic number of the join of two special families of graphs | II","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","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":"Chromatic scale; Bipartite graph; Graph; Windmill graph; Complete bipartite graph; Join (topology)","score_opus":0.00954239799476867,"score_gpt":0.25212521116458914,"score_spread":0.24258281316982047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083575723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.918095,0.00041321223,0.05323466,0.00038709602,0.00004461024,0.00003065432,0.00019483073,0.00010044218,0.027499456],"genre_scores_gemma":[0.9891474,0.00020760729,0.0077517573,0.000048078076,0.000051880594,0.00004178271,0.00018743775,0.000036178102,0.0025278702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994266,0.00013851492,0.000020657735,0.00020171955,0.00010632611,0.000106345266],"domain_scores_gemma":[0.9975431,0.001240536,0.0003779469,0.00018780987,0.0002944248,0.00035621753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077670626,0.00028516754,0.00037041114,0.0019528563,0.0020837996,0.0014343652,0.0007369045,0.0006153924,0.003926145],"category_scores_gemma":[0.0027173194,0.0002608106,0.0006479612,0.0010331465,0.002084586,0.0025479659,0.0012808809,0.0011016479,0.00023653082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002516688,0.000050698785,0.009410658,0.00018430631,0.000058952963,0.0004752382,0.0017413738,0.011313816,0.015772345,0.94744384,0.00199205,0.011305053],"study_design_scores_gemma":[0.00006311815,0.00021342962,0.012193842,0.00006163197,0.0001523369,0.0013161069,0.0016137463,0.09171315,0.012254585,0.8674535,0.012864054,0.000100487865],"about_ca_topic_score_codex":0.0019720653,"about_ca_topic_score_gemma":0.0018417404,"teacher_disagreement_score":0.003926145,"about_ca_system_score_codex":0.0015183201,"about_ca_system_score_gemma":0.00046842,"threshold_uncertainty_score":0.013134301},"labels":[],"label_agreement":null},{"id":"W7083577073","doi":"10.61091/um124-01","title":"Line digraphs of polytrees","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Protein Kinase Regulation and GTPase Signaling","field":"Biochemistry, Genetics and Molecular Biology","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":"Line (geometry); Digraph; Real line; Undirected graph; Line graph; Line segment","score_opus":0.009811450788175916,"score_gpt":0.2694468598698004,"score_spread":0.25963540908162447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083577073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31830707,0.0006986656,0.646269,0.0005100596,0.00008062206,0.00024647187,0.0030352648,0.00065421907,0.03019857],"genre_scores_gemma":[0.82769454,0.0008420369,0.1554075,0.00023619598,0.00008347392,0.00033457283,0.0030751345,0.000109259825,0.012217305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997142,0.000047552687,0.000024782372,0.000085609456,0.00006410543,0.000063695734],"domain_scores_gemma":[0.9987373,0.00042542003,0.00030539095,0.00012643063,0.00021676453,0.00018869522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020410484,0.00039209353,0.00038078972,0.0018845595,0.00087401824,0.0014246737,0.00045823056,0.0004194519,0.007566162],"category_scores_gemma":[0.0014740411,0.00024014025,0.00038808645,0.0019753417,0.00061971345,0.0020787981,0.00061311794,0.000772871,0.0008534945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017367724,0.00013794287,0.006595683,0.00029004554,0.000044435747,0.00042932088,0.00049178756,0.024073612,0.014287712,0.88355887,0.0068331757,0.06308372],"study_design_scores_gemma":[0.000036179223,0.000096023825,0.004045917,0.00006388178,0.000034847017,0.00071406004,0.0004899766,0.12491118,0.0037659137,0.8333012,0.032499317,0.00004160547],"about_ca_topic_score_codex":0.001172613,"about_ca_topic_score_gemma":0.0019734907,"teacher_disagreement_score":0.007566162,"about_ca_system_score_codex":0.0008539521,"about_ca_system_score_gemma":0.00029719216,"threshold_uncertainty_score":0.025311291},"labels":[],"label_agreement":null},{"id":"W7083585688","doi":"10.61091/um124-10","title":"A catalog of facially complete graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Economics of Agriculture and Food Markets","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intersection graph; Diagonal; Graph; Plane (geometry); Intersection (aeronautics); Upper and lower bounds","score_opus":0.02547892718403603,"score_gpt":0.21852128284842592,"score_spread":0.1930423556643899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083585688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26396486,0.008603989,0.37194064,0.003998919,0.00040839225,0.0005706456,0.04110181,0.004186208,0.30522445],"genre_scores_gemma":[0.63242173,0.015206117,0.19555064,0.0020226021,0.0007261115,0.001146882,0.04933773,0.0014855434,0.10210274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914813,0.00008931448,0.00006494118,0.00020988997,0.0003671482,0.000120603494],"domain_scores_gemma":[0.9977968,0.0005189038,0.00019760648,0.00063070987,0.0006292295,0.00022684105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065518566,0.000818502,0.0007298242,0.0034052848,0.0016863693,0.0021156098,0.0013137595,0.00091943983,0.015457508],"category_scores_gemma":[0.0029300652,0.0006473958,0.00087907165,0.0052714334,0.00085377804,0.0041512456,0.0016034821,0.001307236,0.0023030995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013740055,0.000068555404,0.0029037485,0.0004978053,0.00004419023,0.00041044957,0.0005143639,0.0070077423,0.0030211941,0.7298779,0.06497899,0.1905377],"study_design_scores_gemma":[0.000051022893,0.00008074615,0.0040487647,0.00016063312,0.000059825736,0.0017231652,0.0003866904,0.011689749,0.0029069553,0.70959854,0.269234,0.000059819118],"about_ca_topic_score_codex":0.0035256962,"about_ca_topic_score_gemma":0.00400916,"teacher_disagreement_score":0.015457508,"about_ca_system_score_codex":0.0015533911,"about_ca_system_score_gemma":0.0012823255,"threshold_uncertainty_score":0.051710546},"labels":[],"label_agreement":null},{"id":"W7083585982","doi":"10.61091/um124-04","title":"\\(k\\)-domination and \\(k\\)-tuple total domination for some chessboard graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Geodetic Measurements and Engineering Structures","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":"Square (algebra); Dimension (graph theory); Domination analysis; Graph; Metric dimension","score_opus":0.007561251675427035,"score_gpt":0.22060238245293862,"score_spread":0.21304113077751158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083585982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7730308,0.000715636,0.1393619,0.0010784573,0.000075048556,0.00005824983,0.00093492796,0.00018544165,0.084559575],"genre_scores_gemma":[0.9715424,0.00046244517,0.011635187,0.0002020674,0.00007445024,0.00004353135,0.0008044811,0.00008007082,0.015155303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995522,0.00008654123,0.000019230733,0.00012630125,0.00009811251,0.000117724354],"domain_scores_gemma":[0.9987888,0.00055791053,0.0001638506,0.00014174814,0.00018313402,0.00016464978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036822402,0.000430561,0.00039067742,0.0007510737,0.0013146983,0.0012025584,0.00058163574,0.00038243536,0.005377241],"category_scores_gemma":[0.0016685606,0.000147462,0.00059100945,0.00095013506,0.0010775472,0.0019891576,0.0009512628,0.001063599,0.00038060753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012239847,0.000040547573,0.0034170542,0.00015540925,0.000051160336,0.00034009892,0.0007829742,0.020781374,0.0043982845,0.9368442,0.00656681,0.026499772],"study_design_scores_gemma":[0.000046683737,0.000059772192,0.0036191938,0.00003931071,0.000074029034,0.00067264884,0.0005493907,0.078533284,0.0040690685,0.8915091,0.020793606,0.000033948018],"about_ca_topic_score_codex":0.0031788235,"about_ca_topic_score_gemma":0.0034152516,"teacher_disagreement_score":0.005377241,"about_ca_system_score_codex":0.0010139085,"about_ca_system_score_gemma":0.00036104495,"threshold_uncertainty_score":0.017988622},"labels":[],"label_agreement":null},{"id":"W7083586738","doi":"10.61091/um124-13","title":"On path eigenvalues of some graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Wireless Sensor Networks for Data Analysis","field":"Computer Science","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":"Eigenvalues and eigenvectors; Vertex (graph theory); Induced path; Path graph; Path (computing); Graph; Block graph; Wheel graph; Adjacency matrix; Spectrum of a matrix","score_opus":0.010387186654481639,"score_gpt":0.25224979869591824,"score_spread":0.2418626120414366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083586738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45921916,0.0007678809,0.35212022,0.0025710475,0.00050138566,0.0001655159,0.001045128,0.0012469417,0.18236274],"genre_scores_gemma":[0.9336804,0.00063945237,0.03314865,0.0004168373,0.00038443433,0.00023507464,0.0006148509,0.0004237554,0.03045654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.00013922673,0.000021343496,0.00012928761,0.00017869599,0.00012139947],"domain_scores_gemma":[0.9983588,0.00076105696,0.00022236221,0.000139516,0.0002982422,0.00022003819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047710718,0.00094209873,0.0004139399,0.002191688,0.0010512148,0.0013095245,0.0005574745,0.0007860456,0.02135216],"category_scores_gemma":[0.0040048286,0.00033133925,0.0004971974,0.0011816313,0.0014643492,0.0021166399,0.0012484804,0.0013816423,0.0021046053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057438425,0.00004015443,0.0005229332,0.000072674506,0.000012085487,0.00024101716,0.0004048448,0.006014724,0.0028692877,0.96598345,0.008253451,0.015527858],"study_design_scores_gemma":[0.000013447287,0.000022176875,0.000542782,0.000022546745,0.0000043279797,0.00015973611,0.00016374761,0.032505848,0.0007690086,0.9615924,0.0041873297,0.000016712005],"about_ca_topic_score_codex":0.0011247735,"about_ca_topic_score_gemma":0.000814643,"teacher_disagreement_score":0.02135216,"about_ca_system_score_codex":0.0008724212,"about_ca_system_score_gemma":0.00038948853,"threshold_uncertainty_score":0.07143015},"labels":[],"label_agreement":null},{"id":"W7083587252","doi":"10.61091/um124-09","title":"Homogeneous mixed Bowtie systems","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Economic and Technological Innovation","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mixed graph; Disjoint union (topology); Graph; Homogeneous","score_opus":0.03828559775174429,"score_gpt":0.2259970739595099,"score_spread":0.18771147620776563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083587252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4598067,0.001311704,0.38299406,0.00065775967,0.00041043057,0.00018836847,0.00074922555,0.0007465395,0.15313523],"genre_scores_gemma":[0.868592,0.00053142186,0.07554499,0.00030016687,0.00024282072,0.00022953788,0.0010150704,0.00030563414,0.053238336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917907,0.00014027234,0.000037696587,0.00025442275,0.00017191887,0.00021673988],"domain_scores_gemma":[0.99914086,0.00014890674,0.000114882656,0.00018212623,0.0002049908,0.00020812087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042805052,0.00053260307,0.0007481224,0.0020424752,0.0018169145,0.0024761846,0.0011554726,0.0013272656,0.018653609],"category_scores_gemma":[0.0020047105,0.00058129634,0.0009294314,0.001138044,0.0014303125,0.0034039565,0.0026704725,0.0011849423,0.0021240574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063884705,0.00002896721,0.00062804326,0.00008321067,0.000043476513,0.00020502499,0.00022334026,0.0074384697,0.004947949,0.9707092,0.002517536,0.01311088],"study_design_scores_gemma":[0.000053488806,0.00007240321,0.0009415682,0.000043465363,0.00004177855,0.0003557746,0.00034870586,0.060255274,0.003123254,0.91295415,0.02176986,0.000040331906],"about_ca_topic_score_codex":0.0013634397,"about_ca_topic_score_gemma":0.0021130806,"teacher_disagreement_score":0.018653609,"about_ca_system_score_codex":0.00078763854,"about_ca_system_score_gemma":0.00045232105,"threshold_uncertainty_score":0.062402487},"labels":[],"label_agreement":null},{"id":"W7083589183","doi":"10.61091/um124-08","title":"On signless and normalized Laplacian spectra of a subgraph of the total graph of Zn","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Data Visualization and Analytics","field":"Computer Science","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":"Modulo; Graph; Eigenvalues and eigenvectors; Laplacian matrix; Laplace operator; Spectrum (functional analysis); Algebraic connectivity","score_opus":0.011047955771920666,"score_gpt":0.2681738448474695,"score_spread":0.2571258890755488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083589183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7763804,0.00069305603,0.1451632,0.0013093661,0.0001977756,0.000032414264,0.0003384155,0.00033808177,0.07554719],"genre_scores_gemma":[0.97749203,0.00042543586,0.009613535,0.0001902011,0.00017061342,0.00004479383,0.00018471369,0.00016711571,0.011711576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997844,0.000051873165,0.0000050657295,0.000052329546,0.00006353967,0.000042739142],"domain_scores_gemma":[0.9992894,0.0002599162,0.00011607799,0.000059675403,0.00011282748,0.00016209301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043522756,0.00056667416,0.0003335337,0.0018571148,0.0006370971,0.0009795793,0.0007663845,0.00044295596,0.007615539],"category_scores_gemma":[0.0017175719,0.00019183877,0.00037466094,0.00061412214,0.0016790143,0.0015957572,0.0007367515,0.0007712414,0.00061633653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035622892,0.000025856807,0.0003793149,0.000050964456,0.000009280166,0.00013243704,0.00018424416,0.0055245105,0.0043255817,0.9815735,0.0017275502,0.006031045],"study_design_scores_gemma":[0.000018255843,0.000032855532,0.001474936,0.000027310425,0.00000875747,0.00022085138,0.0001907671,0.08108819,0.0012813214,0.9134533,0.0021769765,0.000026398955],"about_ca_topic_score_codex":0.001141589,"about_ca_topic_score_gemma":0.00105714,"teacher_disagreement_score":0.007615539,"about_ca_system_score_codex":0.0008248813,"about_ca_system_score_gemma":0.0003203065,"threshold_uncertainty_score":0.025476515},"labels":[],"label_agreement":null},{"id":"W7083591807","doi":"10.61091/um124-03","title":"Mixed extensions of generic finite games embedded into products of real projective spaces","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","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":"Codimension; Complement (music); Argument (complex analysis); Projective test; Space (punctuation); Product (mathematics)","score_opus":0.029516930377138862,"score_gpt":0.2655910898626345,"score_spread":0.23607415948549565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083591807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6109776,0.0009187104,0.3314553,0.0006752557,0.000068424924,0.00013402215,0.00026144445,0.0001570703,0.055352252],"genre_scores_gemma":[0.97146577,0.00025644992,0.021077864,0.00007359798,0.000042491298,0.00012120584,0.00013996016,0.000034668945,0.0067879115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980665,0.0007063153,0.00013097245,0.00036479908,0.00045963796,0.00027181534],"domain_scores_gemma":[0.9984446,0.00056291465,0.00030441265,0.00016166833,0.00019863692,0.00032772872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476776,0.0009132765,0.00068057544,0.0017276165,0.0011513468,0.0036998158,0.00081113674,0.0005691148,0.0034329908],"category_scores_gemma":[0.002970486,0.0005542059,0.001222397,0.0009794071,0.003870746,0.005758717,0.0034463461,0.0022752394,0.00023488754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021996964,0.000015387404,0.0002456497,0.000019000781,0.00001348747,0.000087489076,0.00025093943,0.0020349203,0.00079232664,0.99469876,0.00007857959,0.0017414013],"study_design_scores_gemma":[0.00002085615,0.00006616766,0.00051540695,0.000018722934,0.000018945606,0.0001370933,0.00026597452,0.020356746,0.0008698202,0.9753541,0.002358308,0.000017924138],"about_ca_topic_score_codex":0.0010756437,"about_ca_topic_score_gemma":0.0007752972,"teacher_disagreement_score":0.0036998158,"about_ca_system_score_codex":0.001606749,"about_ca_system_score_gemma":0.0005555768,"threshold_uncertainty_score":0.011657834},"labels":[],"label_agreement":null},{"id":"W7083593393","doi":"10.61091/um124-06","title":"Directed graphs of integers with arcs determined by an arithmetic function","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Musculoskeletal pain and rehabilitation","field":"Medicine","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":"Arithmetic progression; Divisor function; Function (biology); Greatest common divisor; Divisor (algebraic geometry); Arithmetic function; Arc (geometry); Multiple","score_opus":0.007413835035284326,"score_gpt":0.2661904475052357,"score_spread":0.2587766124699514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083593393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1094087,0.001310042,0.8160694,0.0012503972,0.0005152987,0.00016279389,0.0015006941,0.0007181694,0.0690645],"genre_scores_gemma":[0.5174921,0.0023606603,0.43155804,0.00075969286,0.0002864325,0.00037300418,0.0017948033,0.000388569,0.04498677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993542,0.00016527425,0.000041380117,0.00022198295,0.00011463093,0.0001026448],"domain_scores_gemma":[0.9979797,0.000848177,0.00029413032,0.00021680821,0.00040648092,0.00025467487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050417514,0.00062481913,0.00035978397,0.0017158287,0.0011395258,0.0017437497,0.00097503216,0.0006316963,0.007816917],"category_scores_gemma":[0.0027515457,0.00036228067,0.00060006557,0.0020066146,0.0014165639,0.0030268952,0.000956113,0.0014660025,0.0011941725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006173938,0.000032734955,0.0007945455,0.00013444929,0.000015324506,0.00023107085,0.00027795194,0.00507356,0.0028197656,0.96005803,0.0026498556,0.027850956],"study_design_scores_gemma":[0.000030156847,0.000058075762,0.0011201279,0.00009860881,0.00006374799,0.0005070564,0.00036952924,0.03324671,0.006016998,0.8598872,0.098541185,0.000060567687],"about_ca_topic_score_codex":0.002066006,"about_ca_topic_score_gemma":0.002403651,"teacher_disagreement_score":0.007816917,"about_ca_system_score_codex":0.0012823879,"about_ca_system_score_gemma":0.00055242964,"threshold_uncertainty_score":0.026150167},"labels":[],"label_agreement":null},{"id":"W7083593915","doi":"10.61091/um124-11","title":"1,2-efficiency in grid graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Sociopolitical Dynamics in Nepal","field":"Social Sciences","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":"Vertex (graph theory); Dominating set; Neighbourhood (mathematics); Maximal independent set; Grid; Independent set; Feedback vertex set","score_opus":0.01847478542912691,"score_gpt":0.3514542373124948,"score_spread":0.3329794518833679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083593915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20052406,0.0014778351,0.69501436,0.002870515,0.00030203979,0.00043684992,0.0039574476,0.0024410572,0.09297588],"genre_scores_gemma":[0.77658546,0.0011137144,0.15453774,0.0009978783,0.00017431162,0.00067569973,0.0041575823,0.0007552913,0.061002225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980971,0.00054042967,0.00011712796,0.00054868276,0.00030820962,0.00038857522],"domain_scores_gemma":[0.9952868,0.002171932,0.00053094636,0.0011385749,0.000508991,0.00036264275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015033867,0.0010914479,0.0014412496,0.0013104379,0.0013172231,0.0032500683,0.0020005277,0.00130334,0.013085926],"category_scores_gemma":[0.008831288,0.000707034,0.0010429497,0.002744325,0.0015336125,0.004919088,0.00269482,0.0016274569,0.0029766355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005308578,0.00017641166,0.0025016773,0.0005619283,0.0000926514,0.00039534032,0.0005047215,0.16685534,0.004269246,0.6999474,0.033922795,0.090241686],"study_design_scores_gemma":[0.00012335279,0.00012595135,0.0008685548,0.00006282921,0.000042198837,0.0004073374,0.00023841835,0.20652393,0.002732509,0.765228,0.02362186,0.000025110256],"about_ca_topic_score_codex":0.00294902,"about_ca_topic_score_gemma":0.0029393504,"teacher_disagreement_score":0.013085926,"about_ca_system_score_codex":0.0019937598,"about_ca_system_score_gemma":0.0014478493,"threshold_uncertainty_score":0.04377681},"labels":[],"label_agreement":null},{"id":"W7083594070","doi":"10.61091/um124-02","title":"A connection between locating colorings of certain join graphs with cycles in Kautz digraphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","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":"Chromatic scale; Partition (number theory); Vertex (graph theory); Connection (principal bundle); Tuple; Graph; Simple graph","score_opus":0.01631748850348936,"score_gpt":0.24580949590068948,"score_spread":0.22949200739720013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083594070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54831004,0.00033252127,0.38905373,0.0006007176,0.00014294159,0.00017388251,0.0006805958,0.0008511034,0.059854407],"genre_scores_gemma":[0.9029983,0.00033445508,0.069499604,0.00035268374,0.000116794574,0.00021053762,0.00087279826,0.00036686318,0.025248006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992655,0.00012575836,0.000045447643,0.00025826687,0.000150241,0.00015479581],"domain_scores_gemma":[0.9979426,0.0007577967,0.00030285877,0.00032043707,0.00029851988,0.00037779694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053530047,0.00045342598,0.0004159646,0.001715374,0.0018562885,0.0026246882,0.0011116682,0.0009827815,0.010317645],"category_scores_gemma":[0.002551518,0.0006067924,0.00078980235,0.0019868787,0.0020593696,0.0035315962,0.0015490996,0.0016345247,0.0013425121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047832436,0.00004273506,0.0007315383,0.000052841664,0.000009665777,0.000119472395,0.00051982934,0.0025523128,0.0024161113,0.98203665,0.001032122,0.01043885],"study_design_scores_gemma":[0.000035180696,0.000059395657,0.0010572323,0.00003200765,0.000028918905,0.00028222168,0.00048312193,0.017588036,0.004065688,0.9649497,0.011378579,0.000039985807],"about_ca_topic_score_codex":0.001852541,"about_ca_topic_score_gemma":0.0025034214,"teacher_disagreement_score":0.010317645,"about_ca_system_score_codex":0.0015378937,"about_ca_system_score_gemma":0.000790198,"threshold_uncertainty_score":0.034515977},"labels":[],"label_agreement":null},{"id":"W7083594547","doi":"10.61091/um124-07","title":"GDDs with two groups of unequal sizes and block size four","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Housing Market and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Block size; Block (permutation group theory); Group (periodic table); Block structure","score_opus":0.020704122885116232,"score_gpt":0.22233399287417654,"score_spread":0.20162986998906032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083594547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20021471,0.0003081877,0.6786827,0.0015224125,0.0004932158,0.00020632616,0.0012028789,0.0011087788,0.11626083],"genre_scores_gemma":[0.7376987,0.00020723112,0.18680775,0.00060491246,0.00018112325,0.0005774083,0.0010869199,0.00042169265,0.07241428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998536,0.0003972524,0.00010682537,0.00032991378,0.00028333816,0.00034679947],"domain_scores_gemma":[0.99715376,0.0009309827,0.00026758327,0.0008992622,0.00037197195,0.0003764541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166153,0.0004307691,0.0008307219,0.00082481216,0.00094861776,0.0011315391,0.0011398635,0.0006483056,0.01879039],"category_scores_gemma":[0.0050458927,0.00040355232,0.001032001,0.00067387446,0.0023032979,0.002199532,0.0027232803,0.0019038881,0.0028520029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012055459,0.000030490655,0.00058863324,0.000053034284,0.000013593949,0.00014313441,0.00018740275,0.0016067034,0.0016392602,0.9794303,0.003981181,0.012205781],"study_design_scores_gemma":[0.00023978198,0.00010282628,0.00086150004,0.000030853855,0.000030031018,0.00032847974,0.00018767007,0.024165872,0.00543008,0.9158059,0.05278263,0.000034322286],"about_ca_topic_score_codex":0.0013078407,"about_ca_topic_score_gemma":0.0012047826,"teacher_disagreement_score":0.01879039,"about_ca_system_score_codex":0.0011289653,"about_ca_system_score_gemma":0.00070753146,"threshold_uncertainty_score":0.06286013},"labels":[],"label_agreement":null},{"id":"W7117409323","doi":"10.61091/um125-04","title":"Minimum strong diameter of the strong product of complete multipartite graph and path","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Graph; Multipartite; Vertex (graph theory); Digraph; Product (mathematics); Path graph; Complete graph; Path (computing)","score_opus":0.0280274464935247,"score_gpt":0.25673987124641534,"score_spread":0.22871242475289064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117409323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62518686,0.0012582985,0.29985666,0.002781214,0.00027636564,0.00022658975,0.007968247,0.0009961239,0.0614497],"genre_scores_gemma":[0.91414124,0.0008499545,0.063704774,0.00041908043,0.00023426705,0.00032885125,0.005182734,0.00025751372,0.014881623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928576,0.00015594077,0.000039327577,0.0002906785,0.00011771789,0.00011069811],"domain_scores_gemma":[0.9964664,0.0014434669,0.00045987015,0.00034486625,0.0005006809,0.0007847162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008567105,0.00088094734,0.0010022632,0.001022721,0.0013675373,0.001958354,0.0013028211,0.00096224964,0.010583483],"category_scores_gemma":[0.00465181,0.0007488304,0.0007358533,0.0012938387,0.0010691717,0.0042484603,0.0016778584,0.0010787299,0.0012476393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010586503,0.00020851845,0.007818694,0.0015480806,0.00019741396,0.00074813224,0.00096660235,0.09615527,0.02076488,0.77922356,0.041421913,0.04988829],"study_design_scores_gemma":[0.00014966572,0.00031977502,0.004676637,0.00009570788,0.00012225242,0.0013710378,0.00040830128,0.23148438,0.007711699,0.7269556,0.02664053,0.000064405416],"about_ca_topic_score_codex":0.0008035149,"about_ca_topic_score_gemma":0.00090075517,"teacher_disagreement_score":0.010583483,"about_ca_system_score_codex":0.0010555947,"about_ca_system_score_gemma":0.0008469203,"threshold_uncertainty_score":0.03540528},"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":"W7117414515","doi":"10.61091/um125-05","title":"The Gutman-Milovanović index and some Hamiltonian properties of a graph","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Graph; Hamiltonian (control theory); Graph property; Quartic graph; Topological index; Upper and lower bounds; Hamiltonian path; Hamiltonian path problem","score_opus":0.02484511190113544,"score_gpt":0.2751132101049362,"score_spread":0.2502680982038008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117414515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6766422,0.0017382329,0.10338415,0.0025465982,0.00048385037,0.00010698209,0.0021048211,0.0003924012,0.21260078],"genre_scores_gemma":[0.9685676,0.0006590043,0.01258687,0.00034396478,0.00023046174,0.000104977495,0.00073109317,0.00011987285,0.016656123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975175,0.00004491525,0.000010998195,0.00004946081,0.00005922468,0.00008362435],"domain_scores_gemma":[0.9992387,0.00027341887,0.00016649695,0.000056162105,0.000100026824,0.00016509401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027462898,0.0003903232,0.00040066548,0.0024271114,0.0010722771,0.0012317349,0.00065454753,0.0004486125,0.0112958895],"category_scores_gemma":[0.001488785,0.00017608576,0.0003826051,0.001799518,0.0012602359,0.0017574966,0.000767905,0.0008386644,0.0009021819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030296642,0.000021386031,0.0005418758,0.000050894927,0.000008631635,0.00007920438,0.00013576953,0.0023913833,0.0014680492,0.9795074,0.0038836917,0.0118814055],"study_design_scores_gemma":[0.000016951775,0.000026868262,0.001118957,0.000022900429,0.000010338681,0.0001036129,0.00011348179,0.010787368,0.00066209916,0.9794133,0.0077059036,0.000018333818],"about_ca_topic_score_codex":0.0017978417,"about_ca_topic_score_gemma":0.0022550581,"teacher_disagreement_score":0.0112958895,"about_ca_system_score_codex":0.0010583941,"about_ca_system_score_gemma":0.00045759804,"threshold_uncertainty_score":0.03778851},"labels":[],"label_agreement":null},{"id":"W7117415493","doi":"10.61091/um125-08","title":"Graph identification index","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Vertex (graph theory); Multipartite; Graph; Upper and lower bounds; Simple graph; String (physics)","score_opus":0.022351429636656997,"score_gpt":0.3182714606993722,"score_spread":0.2959200310627152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117415493","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.0047915727,0.0020264294,0.2884344,0.0028613042,0.004844149,0.0006899706,0.081123695,0.035621725,0.57960683],"genre_scores_gemma":[0.0741337,0.004071524,0.24322057,0.0031363496,0.0020623868,0.0013675411,0.19420582,0.028891671,0.44891044],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988733,0.00011181942,0.000076544056,0.00036838505,0.00043843914,0.00013142644],"domain_scores_gemma":[0.99819356,0.0002787203,0.00009340137,0.0005385684,0.0006991388,0.00019669103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776676,0.0015841555,0.0009714794,0.0037859362,0.0018117505,0.0037637365,0.0018300549,0.0011012711,0.22229324],"category_scores_gemma":[0.00383258,0.0007046124,0.0009630421,0.005158544,0.00073872384,0.0058560977,0.0029747228,0.0023991559,0.14374761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006994547,0.00007632743,0.00035781707,0.0004206168,0.000016847856,0.00012886466,0.0001392246,0.0017483708,0.0023598268,0.19999245,0.627245,0.16744477],"study_design_scores_gemma":[0.0000126428995,0.000021807984,0.00026521768,0.00006756749,0.000010767808,0.00023731327,0.00006525642,0.0030763003,0.0018209467,0.10732598,0.8870703,0.000025877624],"about_ca_topic_score_codex":0.0027803301,"about_ca_topic_score_gemma":0.0034946166,"teacher_disagreement_score":0.22229324,"about_ca_system_score_codex":0.0019940217,"about_ca_system_score_gemma":0.0016134115,"threshold_uncertainty_score":0.74364495},"labels":[],"label_agreement":null},{"id":"W7117417567","doi":"10.61091/um125-09","title":"Spectral radius and the 2-power of Hamilton paths","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Shanghai University of Electric Power; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Spectral radius; Graph; Hamiltonian path; RADIUS; Spectral properties","score_opus":0.01389608018051692,"score_gpt":0.2770265766330506,"score_spread":0.26313049645253367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117417567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77355176,0.0009409015,0.18342066,0.0005944917,0.00009494778,0.00006277647,0.00036827245,0.0002423102,0.04072376],"genre_scores_gemma":[0.9766332,0.000318011,0.020060241,0.00006491313,0.00007163171,0.000057573834,0.00013873103,0.000057192625,0.0025985406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953246,0.0001475581,0.000019911437,0.00011282609,0.00008932226,0.000097898504],"domain_scores_gemma":[0.99720407,0.0014908463,0.000492841,0.00017242203,0.00030787656,0.00033194164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042997568,0.0005378172,0.0004660064,0.0020140603,0.0005976324,0.00084847363,0.0007391537,0.00061613886,0.004811823],"category_scores_gemma":[0.004301552,0.00023663728,0.00033566647,0.00077797286,0.0015650808,0.0016496008,0.0009042137,0.00060947164,0.0007571854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002576035,0.0000684105,0.0024850606,0.00024845984,0.00004298296,0.00041689113,0.0004994213,0.04330841,0.027379723,0.8972776,0.0028862404,0.025129179],"study_design_scores_gemma":[0.000034673758,0.000097438045,0.0018729795,0.000054858636,0.000026483945,0.0004701816,0.0002918263,0.12218,0.007907981,0.86283535,0.0041828547,0.000045338493],"about_ca_topic_score_codex":0.00040994596,"about_ca_topic_score_gemma":0.00034106133,"teacher_disagreement_score":0.004811823,"about_ca_system_score_codex":0.00044495153,"about_ca_system_score_gemma":0.00022825236,"threshold_uncertainty_score":0.016097128},"labels":[],"label_agreement":null},{"id":"W7117418662","doi":"10.61091/um125-01","title":"Almost neo balancing numbers","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","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":"Square (algebra); Real number; Multiple; Natural number","score_opus":0.005656648834842634,"score_gpt":0.2841109483423156,"score_spread":0.27845429950747297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117418662","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.27533922,0.0032530774,0.3235302,0.001429925,0.0012297146,0.00011379223,0.0003017737,0.00034789665,0.39445445],"genre_scores_gemma":[0.8847476,0.0012821791,0.0548605,0.0007037209,0.00050257664,0.00013133696,0.00024082314,0.00012155177,0.05740967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938583,0.00009352203,0.000045513192,0.00013754138,0.00023067153,0.00010695463],"domain_scores_gemma":[0.9994184,0.000108727356,0.00011068354,0.00006524907,0.00021382743,0.00008309214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005970161,0.0004953015,0.00033933445,0.0016461303,0.001270392,0.0016300885,0.00048677248,0.0005534922,0.006471299],"category_scores_gemma":[0.0016827416,0.00016416995,0.00034971104,0.0010125566,0.00179326,0.0030569215,0.001263611,0.00092990755,0.0012113214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018446059,0.0000061752385,0.00025743307,0.000026437478,0.0000027972544,0.000039706738,0.00009052449,0.0010075885,0.0024376528,0.98253214,0.0006960375,0.012884999],"study_design_scores_gemma":[0.000008657076,0.000046994715,0.0006577427,0.000034097106,0.000009137202,0.00035363866,0.00016552098,0.00898816,0.0030411554,0.9470851,0.039584015,0.000025857658],"about_ca_topic_score_codex":0.0006483365,"about_ca_topic_score_gemma":0.0007421754,"teacher_disagreement_score":0.006471299,"about_ca_system_score_codex":0.0010724753,"about_ca_system_score_gemma":0.00057500124,"threshold_uncertainty_score":0.021648705},"labels":[],"label_agreement":null},{"id":"W7117418772","doi":"10.61091/um125-03","title":"Multifactorisations and divisor functions","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Rings, Modules, and Algebras","field":"Mathematics","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","keywords":"Integer (computer science); Enumeration; Divisor (algebraic geometry); Greatest common divisor; Set (abstract data type); Algebraic number; Divisor function; Function (biology)","score_opus":0.04244584510682154,"score_gpt":0.30336081924623903,"score_spread":0.2609149741394175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117418772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24376643,0.0014788937,0.6019624,0.0012526825,0.00045907716,0.00015761224,0.00080560404,0.00062096847,0.14949638],"genre_scores_gemma":[0.76330763,0.00094047847,0.1744558,0.00039126576,0.00041202945,0.00021823695,0.0010505181,0.00032258255,0.05890148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985569,0.00028354497,0.00009028834,0.00035676543,0.00038881984,0.00032377406],"domain_scores_gemma":[0.9985569,0.00054120616,0.00017254188,0.00023259976,0.00028836192,0.00020843928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017827521,0.0010443671,0.0007174969,0.0036294144,0.001782702,0.0027494559,0.0010074759,0.00080517697,0.015690293],"category_scores_gemma":[0.004351049,0.00037037177,0.0015515367,0.0026601814,0.0036937809,0.004596398,0.0025374312,0.0026882768,0.0026534367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023408735,0.00001329118,0.00033197054,0.000032827073,0.0000052157034,0.00006810008,0.00017463374,0.0012160513,0.00094313547,0.9797029,0.0010549581,0.016433602],"study_design_scores_gemma":[0.000011406902,0.00003709236,0.0004967288,0.0000350664,0.000010122767,0.00019488702,0.00019582208,0.007948683,0.0016481061,0.97224325,0.017153174,0.000025630328],"about_ca_topic_score_codex":0.0015759463,"about_ca_topic_score_gemma":0.0014301635,"teacher_disagreement_score":0.015690293,"about_ca_system_score_codex":0.002763983,"about_ca_system_score_gemma":0.0006814503,"threshold_uncertainty_score":0.05248928},"labels":[],"label_agreement":null},{"id":"W7117418922","doi":"10.61091/um125-07","title":"Unique paired vs edge-vertex minimum dominating sets in trees","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Dominating set; Class (philosophy); Tree (set theory); Set (abstract data type)","score_opus":0.026180822681456047,"score_gpt":0.32281665872862075,"score_spread":0.2966358360471647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117418922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60196084,0.0011929808,0.3601904,0.00088025606,0.00021786327,0.00007344108,0.0006538545,0.00023868137,0.03459165],"genre_scores_gemma":[0.9655812,0.0004744625,0.031039784,0.00014123529,0.00013965444,0.000051612897,0.00031477134,0.000054261276,0.0022030703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988949,0.0002291345,0.00005580488,0.00032562576,0.00029765515,0.0001968296],"domain_scores_gemma":[0.9971047,0.0018654437,0.00034728862,0.00021813124,0.0002357812,0.00022851783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007800084,0.00048629782,0.000999936,0.0015074852,0.0014392622,0.0031143127,0.00094996166,0.0008642022,0.0032244637],"category_scores_gemma":[0.0052709677,0.00041940133,0.00076816994,0.0013901369,0.0011601858,0.003751669,0.002281763,0.0015658671,0.00033356738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023905716,0.00012781625,0.0035402114,0.00044813435,0.00011073142,0.0004854188,0.0006087093,0.04028994,0.0084830485,0.88558376,0.004123235,0.05595995],"study_design_scores_gemma":[0.000037078116,0.00013275475,0.0023367736,0.0000704097,0.00007589559,0.0012044118,0.00040256747,0.09818531,0.0055001844,0.88548523,0.006541623,0.000027676582],"about_ca_topic_score_codex":0.00026445082,"about_ca_topic_score_gemma":0.0003098291,"teacher_disagreement_score":0.0032244637,"about_ca_system_score_codex":0.00080888136,"about_ca_system_score_gemma":0.0003551619,"threshold_uncertainty_score":0.010786891},"labels":[],"label_agreement":null},{"id":"W7117420770","doi":"10.61091/um125-10","title":"A normal distribution of Raab direction in binomial coefficients triangle","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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":"Gaussian binomial coefficient; Binomial coefficient; Binomial distribution; Binomial (polynomial); Distribution (mathematics); Sequence (biology)","score_opus":0.017485148483150484,"score_gpt":0.2972859598466086,"score_spread":0.27980081136345814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117420770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6204995,0.0008751566,0.3369551,0.0012427735,0.00026447812,0.00011793901,0.00062969135,0.00040127512,0.039014123],"genre_scores_gemma":[0.96313566,0.00062453124,0.019333947,0.00023689977,0.00023122184,0.00017623274,0.0007080944,0.00013374719,0.015419561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885297,0.0002667242,0.000028428072,0.00029282054,0.00031775367,0.00024124072],"domain_scores_gemma":[0.9941346,0.0027618967,0.0006305077,0.00048013293,0.0012720199,0.00072099175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014599931,0.00038823445,0.00066047924,0.0018828256,0.0011518982,0.0017597543,0.0013475945,0.00074284547,0.010033657],"category_scores_gemma":[0.011105353,0.00034088615,0.00050042674,0.0009085923,0.002428875,0.0023456283,0.0013867273,0.001953719,0.0013833743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022457726,0.000052682135,0.010249781,0.000097112825,0.000017686267,0.00043824577,0.0006006845,0.009973196,0.013938432,0.9436137,0.003467241,0.017326672],"study_design_scores_gemma":[0.000097086595,0.00023918184,0.014563379,0.00010800879,0.000029533478,0.0019584033,0.00067051296,0.31687522,0.01026197,0.6428267,0.01220838,0.00016172453],"about_ca_topic_score_codex":0.0023802854,"about_ca_topic_score_gemma":0.0012363973,"teacher_disagreement_score":0.010033657,"about_ca_system_score_codex":0.00090053637,"about_ca_system_score_gemma":0.00065832277,"threshold_uncertainty_score":0.03356594},"labels":[],"label_agreement":null},{"id":"W7117428386","doi":"10.61091/um125-06","title":"Zero divisor graph of endomorphism ring of direct product of groups","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Rings, Modules, and Algebras","field":"Mathematics","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":"Zero divisor; Endomorphism; Direct product; Divisor (algebraic geometry); Graph; Endomorphism ring; Prime (order theory)","score_opus":0.027131967433806088,"score_gpt":0.27091101892770847,"score_spread":0.2437790514939024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117428386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.896871,0.00052015897,0.05814695,0.00041762216,0.00008797586,0.000043086413,0.00046558538,0.00017218826,0.04327552],"genre_scores_gemma":[0.9824203,0.0002753059,0.0070587383,0.000055310113,0.000083915445,0.000026953785,0.00035665033,0.00004138824,0.009681337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999627,0.00005550395,0.000016367709,0.00014154291,0.00007443303,0.000085098465],"domain_scores_gemma":[0.9993487,0.00017828724,0.00016654149,0.000049989518,0.00009453271,0.00016182661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026291402,0.00033436847,0.00038420013,0.001392528,0.0010030861,0.0011846523,0.0005263933,0.0003015303,0.0077448217],"category_scores_gemma":[0.000738658,0.00022159907,0.00038949226,0.000661911,0.0010810049,0.0022279976,0.00091637264,0.0006668523,0.0006803903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020540891,0.00005322861,0.0036851086,0.00013709071,0.000022151627,0.0004015097,0.000618303,0.001456,0.010317002,0.957769,0.0018106082,0.023524622],"study_design_scores_gemma":[0.00008795467,0.00029662123,0.010296555,0.00004275749,0.000072568735,0.0020873882,0.00079687405,0.014092894,0.019047083,0.928868,0.024250396,0.00006087924],"about_ca_topic_score_codex":0.00053024763,"about_ca_topic_score_gemma":0.00036042163,"teacher_disagreement_score":0.0077448217,"about_ca_system_score_codex":0.0006372322,"about_ca_system_score_gemma":0.00023465298,"threshold_uncertainty_score":0.025909007},"labels":[],"label_agreement":null}]}