{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91446406,0.0016490697,0.07529418,0.00200697,0.0018374942,0.0010536625,0.000040196835,0.0005961224,0.0030582573],"genre_scores_gemma":[0.7582064,0.0000052511004,0.24122235,0.00018415175,0.000018000592,0.000028683733,0.0000031721463,0.000015895068,0.00031608169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862885,0.000027100781,0.00045378355,0.0003397945,0.0002456048,0.00030487138],"domain_scores_gemma":[0.9984147,0.00046278923,0.00012893131,0.0007135897,0.00018544895,0.00009457313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072964194,0.00016722699,0.00030019032,0.00010059806,0.00012167193,0.00007089484,0.000558052,0.00007631178,0.00005774984],"category_scores_gemma":[0.00041067082,0.00013304768,0.00012999336,0.00019481749,0.00010685255,0.00027787348,0.00013926344,0.00015144849,0.00007259295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043608984,0.00019042249,0.000052982283,0.00021960874,0.00003104548,0.0000013639047,0.0018800391,0.000008335254,0.060258813,0.93072146,0.0019033684,0.004728197],"study_design_scores_gemma":[0.00051692943,0.00015649825,0.000048997055,0.0001273298,0.00003548962,0.000015512192,0.000103020284,0.100045264,0.019321634,0.87733096,0.00202383,0.0002745517],"about_ca_topic_score_codex":0.000009694844,"about_ca_topic_score_gemma":0.000004866153,"teacher_disagreement_score":0.16592817,"about_ca_system_score_codex":0.0000044910735,"about_ca_system_score_gemma":0.00005261658,"threshold_uncertainty_score":0.54255265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948945,0.000117583746,0.000829354,0.000017784618,0.000012852326,0.00044031144,0.00003084817,0.000013690511,0.0036430869],"genre_scores_gemma":[0.995867,0.000012133116,0.0037483887,0.000002161406,0.0000040721134,0.000038233626,0.0000016435249,0.000011250437,0.00031510403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869573,0.00006922773,0.00065429666,0.00014994142,0.00028515805,0.00014565763],"domain_scores_gemma":[0.9982689,0.0011644096,0.00022178964,0.00021795792,0.000093293624,0.000033671116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036868206,0.000121785095,0.00041642628,0.00024309424,0.000049709084,0.000003678392,0.00007471396,0.000040145405,0.00006830492],"category_scores_gemma":[0.0013891722,0.00010036411,0.000042050007,0.0003901938,0.00011731992,0.00014270445,0.000076066724,0.00007639335,0.000002425927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011004867,0.008311121,0.031821724,0.0034966224,0.0003290511,0.00004246024,0.42558116,0.00001161911,0.00013126501,0.52961713,0.00016908288,0.00037873286],"study_design_scores_gemma":[0.0029712447,0.001252122,0.057501663,0.00054510287,0.00017435972,0.00007908909,0.14837413,0.001054515,0.00061076303,0.78709066,0.0000047493118,0.0003415979],"about_ca_topic_score_codex":0.00003458346,"about_ca_topic_score_gemma":0.000017222252,"teacher_disagreement_score":0.27720705,"about_ca_system_score_codex":0.0000151213535,"about_ca_system_score_gemma":0.00002891095,"threshold_uncertainty_score":0.40927297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13366058,0.00007382105,0.81599146,0.0006786887,0.0001276409,0.00038263915,0.0000013657448,0.00022781712,0.048855964],"genre_scores_gemma":[0.93642145,0.0000024912108,0.06326738,0.000046736648,0.000010641961,0.000036387966,8.205987e-7,0.000008291382,0.00020582486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986852,0.00015564638,0.00023748398,0.00029416798,0.00031971198,0.00030778832],"domain_scores_gemma":[0.9986933,0.00045710112,0.00004590485,0.0006809235,0.00004761159,0.0000751814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140573,0.00010684125,0.00016382431,0.00025519013,0.000055902052,0.000052770014,0.0007042795,0.00004473087,0.000042194933],"category_scores_gemma":[0.0005473832,0.00009469312,0.0000551964,0.00058923144,0.00008442558,0.0003750184,0.00019499555,0.00013864835,0.0002055551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031502407,0.000067833476,0.00011237836,0.000034865832,0.0000028205077,0.000002634272,0.00062393316,0.00000650322,0.0003613743,0.9760622,0.00009756238,0.022624739],"study_design_scores_gemma":[0.00024748896,0.0000415414,0.0010567365,0.000035344605,0.0000010709888,0.000008777828,0.00004624781,0.081639394,0.0007550671,0.9156553,0.00040951735,0.00010351776],"about_ca_topic_score_codex":0.0000018913474,"about_ca_topic_score_gemma":0.0000033855622,"teacher_disagreement_score":0.80276084,"about_ca_system_score_codex":0.000029487326,"about_ca_system_score_gemma":0.000015300437,"threshold_uncertainty_score":0.38614732},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51205695,0.015432878,0.15900443,0.1444062,0.000880215,0.0031538047,0.000006073249,0.0015135474,0.16354589],"genre_scores_gemma":[0.9508843,0.000025387424,0.047572467,0.0009297434,0.000005489495,0.00000563729,2.8031883e-7,0.0000041238336,0.000572567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990723,0.000046112218,0.00020394834,0.00027638848,0.00020288106,0.00019834962],"domain_scores_gemma":[0.99905556,0.000133211,0.000053938915,0.0006568115,0.000042129464,0.000058345915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715464,0.000110610155,0.0001662407,0.000040267878,0.00011262522,0.00012463554,0.00036710937,0.000020738515,0.000023734156],"category_scores_gemma":[0.00016152492,0.000062929896,0.000045526023,0.00018859714,0.00015254627,0.0001591773,0.00010535538,0.00008846547,0.00013886695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005743871,0.00004497744,0.0000057226325,0.00001761002,0.0000071275663,0.0000019727222,0.0013664,0.0000022119036,0.00020574604,0.987075,0.0018387906,0.009428741],"study_design_scores_gemma":[0.0005062424,0.00004166837,0.00030082083,0.000035526915,0.000010967939,0.0000478317,0.000027920649,0.017410785,0.00036842926,0.9792269,0.0019171473,0.00010574443],"about_ca_topic_score_codex":0.0000033699969,"about_ca_topic_score_gemma":1.7918929e-7,"teacher_disagreement_score":0.43882734,"about_ca_system_score_codex":0.0000049514283,"about_ca_system_score_gemma":0.000014317074,"threshold_uncertainty_score":0.25662068},"labels":[],"label_agreement":null},{"id":"W245591216","doi":"","title":"Packing the Cartesian product of two complete graphs with hexagons","year":2005,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Product (mathematics); Cartesian coordinate system; Arithmetic; Geometry","score_opus":0.014407930322415816,"score_gpt":0.21542326645749538,"score_spread":0.20101533613507955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W245591216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93750036,0.0012810118,0.003526719,0.0003677591,0.00013454311,0.00079905696,0.000036350844,0.0003885099,0.055965703],"genre_scores_gemma":[0.9977986,0.0000033122926,0.001999971,0.000016062328,0.00004679965,0.00003732164,0.0000023066855,0.000029942423,0.00006567871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910367,0.000054225766,0.0002886482,0.00013410744,0.00017987422,0.00023947381],"domain_scores_gemma":[0.99915034,0.00014464294,0.000049956667,0.0005727919,0.00003420115,0.000048098398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037544774,0.00016085034,0.00025106544,0.000060128736,0.000082507904,0.000018609197,0.00022455346,0.000020820502,0.00010113775],"category_scores_gemma":[0.000020188741,0.00009799108,0.00007949362,0.00023558417,0.00014235685,0.00007734714,0.00001659911,0.00011538247,0.000049003695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026820877,0.00019251091,0.0009801249,0.0015638823,0.0005267001,0.000006812058,0.017771006,0.0035924606,0.012253249,0.9547749,0.002217695,0.0060938224],"study_design_scores_gemma":[0.0052277683,0.0007536363,0.009059439,0.0041819667,0.0012969185,0.0011286687,0.02126393,0.14230509,0.097136,0.646395,0.06760337,0.0036482087],"about_ca_topic_score_codex":0.000005209178,"about_ca_topic_score_gemma":0.000028585016,"teacher_disagreement_score":0.30837992,"about_ca_system_score_codex":0.00001213977,"about_ca_system_score_gemma":0.000007934691,"threshold_uncertainty_score":0.39959604},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9191398,0.0002796862,0.0032577168,0.0028047564,0.0001645561,0.00036325792,0.0000058757587,0.00030633964,0.07367803],"genre_scores_gemma":[0.9771813,0.000018348057,0.021528006,0.0005411799,0.0000024771252,0.000018924164,6.014148e-7,0.000010480184,0.00069865695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986645,0.00008046173,0.00037217364,0.00026362488,0.0003609444,0.00025828675],"domain_scores_gemma":[0.9983619,0.00045258403,0.00008072296,0.0009724604,0.00006296629,0.00006936703],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000681604,0.0001402459,0.00019470252,0.000053982047,0.00013647141,0.00004990549,0.00065846567,0.000044285236,0.0013852689],"category_scores_gemma":[0.000117842705,0.00008576291,0.00011424173,0.00046254462,0.00012144741,0.00010951274,0.00006695255,0.000116486546,0.0011624949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003965792,0.00014583883,0.00002744826,0.000028116177,0.000021734617,0.0000015869399,0.00077415316,0.000025587315,0.00019205024,0.99069333,0.0030223797,0.005063829],"study_design_scores_gemma":[0.0001580825,0.000043608165,0.000038162867,0.00013590744,0.0000108473705,0.000011892913,0.000028417424,0.022514842,0.0012776224,0.97507185,0.0005958456,0.00011289669],"about_ca_topic_score_codex":0.0000086192085,"about_ca_topic_score_gemma":4.156652e-7,"teacher_disagreement_score":0.072979376,"about_ca_system_score_codex":0.0000051826746,"about_ca_system_score_gemma":0.000018773926,"threshold_uncertainty_score":0.9996152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11457159,0.0001228518,0.8764275,0.0031681997,0.00045275968,0.0008688003,0.000036942092,0.00004626655,0.0043051103],"genre_scores_gemma":[0.9952121,0.0000041395297,0.0045983517,0.00003970361,0.00005176375,0.000022379236,0.0000010049374,0.0000051529573,0.00006542781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992319,0.000037679383,0.0003289348,0.00013319755,0.00014280491,0.00012553218],"domain_scores_gemma":[0.99759865,0.0009875153,0.00036971047,0.0009312159,0.00008700438,0.000025891537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050133554,0.00008526848,0.00017352274,0.000020134688,0.0003868664,0.00008176384,0.0008928609,0.000031113956,0.000008583222],"category_scores_gemma":[0.0002919014,0.000044893583,0.00009420778,0.000053037384,0.00020630557,0.00021641172,0.00020027808,0.00003907325,0.0000033363726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009321726,0.00005401784,0.000020911657,0.00009062998,0.000037339807,0.0000018507554,0.002588476,0.000018620223,0.0016074787,0.98133796,0.0003496692,0.013883704],"study_design_scores_gemma":[0.0009979827,0.00027595522,0.0035714915,0.00014643882,0.00014615977,0.00010750459,0.00049360417,0.295988,0.047706727,0.6482742,0.0019946725,0.0002973202],"about_ca_topic_score_codex":0.000381508,"about_ca_topic_score_gemma":0.00004626765,"teacher_disagreement_score":0.8806405,"about_ca_system_score_codex":0.000009241147,"about_ca_system_score_gemma":0.000040047296,"threshold_uncertainty_score":0.29755026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04162834,0.00028232174,0.9492031,0.0046554734,0.00041644962,0.00076819124,0.000034301447,0.00004033058,0.002971491],"genre_scores_gemma":[0.993563,0.0000024702358,0.0062263026,0.00006793665,0.000047572878,0.00002413434,0.0000012401819,0.0000056063973,0.00006175395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992347,0.00003820695,0.00031809305,0.00013976831,0.00013966342,0.00012957766],"domain_scores_gemma":[0.99762565,0.0009248059,0.0003546044,0.0009743029,0.00009473788,0.000025883837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004777965,0.00009116692,0.00017430211,0.000022693692,0.00039729112,0.000088158566,0.0009622534,0.000025910083,0.000009071294],"category_scores_gemma":[0.0002485106,0.000048575224,0.00009799809,0.000056301695,0.00025917857,0.00028742,0.00024278589,0.000043758966,0.000004083072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012797665,0.00008858524,0.000025467978,0.00016648675,0.000049624814,0.0000042859447,0.0025948412,0.000022382466,0.0025276549,0.9739655,0.0007330915,0.019809237],"study_design_scores_gemma":[0.00070176984,0.00019302283,0.0015428197,0.00013557494,0.0001069538,0.00018251466,0.0002649608,0.25830775,0.033679895,0.70276994,0.0018911854,0.00022361983],"about_ca_topic_score_codex":0.00016927726,"about_ca_topic_score_gemma":0.00001324415,"teacher_disagreement_score":0.95193464,"about_ca_system_score_codex":0.000008863108,"about_ca_system_score_gemma":0.000040272716,"threshold_uncertainty_score":0.30556825},"labels":[],"label_agreement":null},{"id":"W2744404471","doi":"","title":"Frequency squares of orders 7 and 8","year":2007,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Least-squares function approximation; Arithmetic; Statistics; Algorithm","score_opus":0.006160675756720137,"score_gpt":0.2037454237497888,"score_spread":0.19758474799306866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744404471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372612,0.00084272795,0.006945438,0.000006381873,0.00008024838,0.00011401132,0.0000048051793,0.00011803683,0.0546271],"genre_scores_gemma":[0.9979909,0.0000060524194,0.0019472224,0.000003988222,0.000010086586,0.0000033330477,6.700791e-7,0.00001224089,0.000025502168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994806,0.000009659773,0.0002253177,0.000065583874,0.0000797108,0.00013912772],"domain_scores_gemma":[0.9996128,0.00013932765,0.000020043712,0.00016784837,0.00001534014,0.000044659555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689741,0.00007928729,0.00014479905,0.00006201152,0.000018881858,0.0000049364617,0.00006460407,0.00004213572,0.00011024561],"category_scores_gemma":[0.00004079268,0.00006922004,0.000031738025,0.00009442003,0.000063386055,0.00004248475,0.000008444504,0.000045141565,0.000017913573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007953471,0.00006842783,0.0017906429,0.0026436176,0.00012164438,0.000009722384,0.005880249,0.000023268945,0.021203069,0.9629705,0.0006432705,0.0046376223],"study_design_scores_gemma":[0.00069405604,0.00013724047,0.00961818,0.00054809113,0.00008448988,0.00007170708,0.0072368025,0.0035809688,0.037996348,0.93765867,0.0017859428,0.0005874887],"about_ca_topic_score_codex":0.0000045095235,"about_ca_topic_score_gemma":0.000004533136,"teacher_disagreement_score":0.060729653,"about_ca_system_score_codex":0.000005402675,"about_ca_system_score_gemma":0.000002259422,"threshold_uncertainty_score":0.28227115},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98735696,0.000302653,0.009436084,0.0002235016,0.00006342355,0.00016775551,0.000017183836,0.00006085298,0.0023715834],"genre_scores_gemma":[0.97989345,0.000022099586,0.01998861,0.000036776037,0.0000114889535,0.000005765878,0.0000011894463,0.000008795559,0.00003185082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905616,0.00008322223,0.00027688086,0.00028101847,0.00013879973,0.00016390937],"domain_scores_gemma":[0.99811,0.0005858347,0.00025375755,0.0008957234,0.00007733639,0.00007737544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061296916,0.0001605237,0.0003277078,0.00011334103,0.00021963243,0.00007590151,0.0006027973,0.000057635076,0.000033159602],"category_scores_gemma":[0.0002908934,0.0001176033,0.000045187364,0.00010212023,0.00036162743,0.00028838875,0.0003015663,0.00008619244,0.0000018766091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014685286,0.0007558378,0.003365378,0.0008913676,0.00016201466,0.000021290913,0.013754354,0.000006239769,0.0051207007,0.9311555,0.00020696783,0.044413477],"study_design_scores_gemma":[0.0011953189,0.0015575518,0.017982274,0.0010642889,0.00005518903,0.00009448014,0.0010731864,0.08460987,0.006363917,0.88529944,0.00023724217,0.00046722428],"about_ca_topic_score_codex":0.000012040218,"about_ca_topic_score_gemma":0.000002562362,"teacher_disagreement_score":0.08460364,"about_ca_system_score_codex":0.0000026590901,"about_ca_system_score_gemma":0.000022577318,"threshold_uncertainty_score":0.47957233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87297225,0.0010347598,0.052142423,0.013713203,0.0011026756,0.0009273247,0.00009302067,0.0010735099,0.056940828],"genre_scores_gemma":[0.9541509,0.000009030221,0.044330493,0.0000996229,0.000009434095,0.000008342356,8.854612e-7,0.00001534641,0.0013759187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816597,0.000078855934,0.00054872356,0.00045114735,0.0004210493,0.00033426948],"domain_scores_gemma":[0.9978731,0.00061150215,0.0001359227,0.0011223457,0.00014574172,0.000111373396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071799994,0.00019106241,0.00028693557,0.0001503845,0.00005946234,0.00003455216,0.00052904355,0.00007307142,0.00009840568],"category_scores_gemma":[0.0004954439,0.00011268754,0.00012077738,0.0002613426,0.00013172705,0.00019248319,0.00017755824,0.0000783745,0.00053682266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008320309,0.0007860002,0.00004209311,0.00011503445,0.00008178343,0.000014439937,0.0041065607,0.000021087893,0.059291862,0.901221,0.004704916,0.029532032],"study_design_scores_gemma":[0.0024671373,0.0006374877,0.00063416106,0.0012168618,0.0000331909,0.000037880694,0.00022059567,0.0064624357,0.04641922,0.9406612,0.0006761079,0.00053374475],"about_ca_topic_score_codex":0.0000059457884,"about_ca_topic_score_gemma":0.0000014245663,"teacher_disagreement_score":0.08117867,"about_ca_system_score_codex":0.000015982501,"about_ca_system_score_gemma":0.00003701743,"threshold_uncertainty_score":0.6899948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617873,0.0013335038,0.020542873,0.0017284298,0.00041598076,0.0004169365,0.00002454666,0.00029404418,0.013456423],"genre_scores_gemma":[0.91847825,0.000040053106,0.08132833,0.000046656736,0.0000020511804,0.000008739881,9.526644e-7,0.000007315901,0.00008766674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988182,0.000045816967,0.00033974706,0.00032184276,0.00023562076,0.00023878235],"domain_scores_gemma":[0.9980903,0.00022047583,0.0002756266,0.0011738961,0.00013319541,0.000106482505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039236085,0.00014539271,0.00029562943,0.0001036132,0.00028867248,0.00016747083,0.0007330208,0.00005873298,0.0000362014],"category_scores_gemma":[0.000299552,0.0001132058,0.00005766994,0.000113455906,0.00033693257,0.00032496505,0.00028634802,0.0000711655,0.000017798406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075358607,0.00012538095,0.0004702711,0.00017731564,0.000048631762,0.000006265269,0.0010884819,1.8503611e-7,0.0016127125,0.9915863,0.0006844842,0.0041924086],"study_design_scores_gemma":[0.00043339623,0.00009127776,0.0020719827,0.00014415005,0.00002017041,0.0000118407825,0.000072956536,0.010682745,0.0021988729,0.9839121,0.00021292029,0.00014759626],"about_ca_topic_score_codex":0.000029012925,"about_ca_topic_score_gemma":0.0000035747505,"teacher_disagreement_score":0.060785457,"about_ca_system_score_codex":0.0000031360833,"about_ca_system_score_gemma":0.00003409923,"threshold_uncertainty_score":0.46163988},"labels":[],"label_agreement":null},{"id":"W28972128","doi":"10.1523/jneurosci.1188-17.2017","title":"Some equitably 2-colourable cycle decompositions of multipartite graphs","year":2006,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Quantum; Physics","score_opus":0.006941888503866154,"score_gpt":0.20829668525068254,"score_spread":0.2013547967468164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28972128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9669526,0.0011566317,0.0010937057,0.000023463806,0.00019560382,0.00028171594,0.000054250937,0.00035202043,0.029889992],"genre_scores_gemma":[0.9978025,0.0000074209447,0.0018803818,0.0000067909637,0.000025608742,0.00005435527,0.000009883809,0.000028155191,0.0001849276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897575,0.00003365388,0.00042996957,0.00012359628,0.00014445077,0.00029256725],"domain_scores_gemma":[0.9993986,0.00012248052,0.000048851885,0.00034304397,0.000031387877,0.000055632594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023535473,0.00015021143,0.00027584148,0.000115986026,0.00007469429,0.000018564626,0.00016009291,0.00006638238,0.00016161916],"category_scores_gemma":[0.000015776624,0.00014251177,0.00013642489,0.00020126237,0.000076535,0.00016362942,0.000021180504,0.00007798143,0.00015704703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077191435,0.00022700637,0.00016046847,0.00072040356,0.0000814433,0.0000046595546,0.00044828528,0.0043451875,0.038702115,0.9526471,0.002490142,0.00016549633],"study_design_scores_gemma":[0.00039503342,0.000043006985,0.0008557604,0.00019969864,0.00006190345,0.000018303726,0.0002751295,0.036087077,0.022965418,0.9382336,0.0005934623,0.00027161033],"about_ca_topic_score_codex":0.000017614737,"about_ca_topic_score_gemma":0.0000069500716,"teacher_disagreement_score":0.031741887,"about_ca_system_score_codex":0.000017681044,"about_ca_system_score_gemma":0.0000057314624,"threshold_uncertainty_score":0.5811461},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35808116,0.00013503357,0.5494008,0.001712004,0.000501786,0.0010618863,0.0000061400156,0.00050551526,0.08859566],"genre_scores_gemma":[0.89294136,0.0000032764246,0.106545,0.00007029036,0.00001961968,0.000045225916,0.0000011083441,0.0000119752785,0.0003621683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983133,0.00016169099,0.0003024887,0.000391158,0.00040058588,0.00043076187],"domain_scores_gemma":[0.9985067,0.00035837945,0.00006568333,0.00084688887,0.00012084231,0.00010147525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677139,0.0001414151,0.00019415934,0.00032808687,0.00010483739,0.00006905149,0.0009450015,0.000060766528,0.00014564671],"category_scores_gemma":[0.00051820604,0.00012799434,0.000068296395,0.0010396553,0.00030784577,0.000488773,0.00025294017,0.00014371672,0.0005474457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010984291,0.00010486755,0.00011537507,0.00003553745,0.000007984269,0.000008758404,0.0023201634,7.985644e-7,0.00043282477,0.97972924,0.0005600226,0.016673423],"study_design_scores_gemma":[0.00036372707,0.00008382144,0.0011498459,0.000053307864,0.0000020738405,0.000012754718,0.0002359256,0.020207759,0.0021158264,0.97489315,0.00072646816,0.00015535434],"about_ca_topic_score_codex":0.000005829181,"about_ca_topic_score_gemma":0.000025524187,"teacher_disagreement_score":0.5348602,"about_ca_system_score_codex":0.000054305077,"about_ca_system_score_gemma":0.000036867903,"threshold_uncertainty_score":0.703649},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057252385,0.00032983097,0.7140974,0.0020364837,0.000101478894,0.00083889626,0.00023373603,0.00013551654,0.2249743],"genre_scores_gemma":[0.5269295,0.000013592187,0.46490756,0.000042999323,0.00011349373,0.00019437145,0.000028797514,0.000046216497,0.0077234907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892515,0.000043171167,0.00031494824,0.0002965333,0.00011834314,0.0003018767],"domain_scores_gemma":[0.99840766,0.0002800175,0.0002060484,0.000904192,0.000030409805,0.00017169093],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031277846,0.00021108543,0.00035861705,0.000017830609,0.0005981617,0.0001752606,0.00033780723,0.000044676228,0.0016349205],"category_scores_gemma":[0.00007736658,0.0001710001,0.00010357966,0.00003910185,0.00026331222,0.00017509317,0.00018194126,0.0001160201,0.00009981493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046392247,0.000087805565,0.00008431097,0.000050692433,0.000048396898,2.4076277e-7,0.00025240018,2.8582534e-7,0.00088032364,0.98187494,0.0022491144,0.01446685],"study_design_scores_gemma":[0.0003525,0.000011854073,0.00005950786,0.00003576957,0.000053210686,0.0000018882008,0.0004110658,0.00083502464,0.0026423149,0.9610331,0.03434221,0.0002215489],"about_ca_topic_score_codex":0.000040472583,"about_ca_topic_score_gemma":5.692095e-7,"teacher_disagreement_score":0.46967712,"about_ca_system_score_codex":0.000010027546,"about_ca_system_score_gemma":0.000012138543,"threshold_uncertainty_score":0.9992777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7422171,0.000047710688,0.14848045,0.0026104415,0.0003192541,0.0007577724,0.0000107951755,0.00017642604,0.10538005],"genre_scores_gemma":[0.9709716,7.745944e-7,0.028476754,0.00014450566,0.000015390195,0.000022136426,4.745742e-7,0.000007582986,0.0003608048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868387,0.00013366377,0.00022080267,0.00022492681,0.00051816634,0.0002185881],"domain_scores_gemma":[0.99765176,0.0011650666,0.00008246939,0.0008469118,0.00020295946,0.000050808798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009054936,0.00010099054,0.00013390019,0.00007515538,0.00014462395,0.000025071606,0.0007702759,0.000034867804,0.00066395896],"category_scores_gemma":[0.00056161,0.00006225949,0.00007553974,0.000431195,0.00039383303,0.00015733865,0.00020805029,0.00010027515,0.0006507533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001429609,0.0000876066,0.0000122473175,0.000013148655,0.000012286942,9.3593644e-7,0.0005192373,7.0551584e-7,0.00045589276,0.99523556,0.0014266154,0.002221439],"study_design_scores_gemma":[0.00012279053,0.000091157955,0.00018445824,0.000042189877,0.0000027771277,0.000009863526,0.00004065078,0.008944732,0.006496626,0.98381096,0.00018704301,0.00006676267],"about_ca_topic_score_codex":0.0000014521707,"about_ca_topic_score_gemma":6.4173054e-7,"teacher_disagreement_score":0.22875446,"about_ca_system_score_codex":0.00001697514,"about_ca_system_score_gemma":0.000027477872,"threshold_uncertainty_score":0.8364334},"labels":[],"label_agreement":null},{"id":"W2964128008","doi":"","title":"Edge-colorings of Km,n which forbid multicolored cycles","year":2013,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer science","score_opus":0.010782240573600754,"score_gpt":0.20565779790229413,"score_spread":0.19487555732869338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964128008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92665684,0.00021102531,0.0005810126,0.000036728863,0.00015060091,0.0005248727,0.00001152661,0.0002916147,0.071535796],"genre_scores_gemma":[0.997485,0.0000065207123,0.00206615,0.0000074632794,0.000020582625,0.00017410406,0.000003254544,0.0000356864,0.00020128262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989557,0.000030176097,0.00043038087,0.00014056033,0.0001591187,0.00028405464],"domain_scores_gemma":[0.9991624,0.0002162372,0.00005338483,0.00039901678,0.0000794754,0.000089503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022744646,0.00017643347,0.00033599284,0.000090228816,0.000039892693,0.000023506956,0.00022912445,0.00009668818,0.0008158181],"category_scores_gemma":[0.00011599615,0.00015274466,0.00009589758,0.0002063241,0.00006371132,0.00015926152,0.000034928373,0.00010154233,0.00060056156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005387304,0.00087114685,0.0018509113,0.01160926,0.0010189277,0.000008589605,0.0194248,0.0012826568,0.17625038,0.7616766,0.01788627,0.008066591],"study_design_scores_gemma":[0.0023762172,0.0004012097,0.021250669,0.0015136508,0.00028156198,0.00006874159,0.010408672,0.16946886,0.16809478,0.61593324,0.008382035,0.0018203811],"about_ca_topic_score_codex":0.000014047949,"about_ca_topic_score_gemma":0.000004141966,"teacher_disagreement_score":0.1681862,"about_ca_system_score_codex":0.000019269635,"about_ca_system_score_gemma":0.0000070525252,"threshold_uncertainty_score":0.8932636},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70182717,0.0021427674,0.16645494,0.0058928835,0.001063286,0.0007128761,0.000014526429,0.0021726433,0.119718924],"genre_scores_gemma":[0.87950885,0.0000027667427,0.11808627,0.000245405,0.000017820985,0.000015574351,0.0000042828456,0.000016940523,0.0021020595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983475,0.000039851395,0.00040676634,0.00042518313,0.0003710807,0.00040958723],"domain_scores_gemma":[0.99872905,0.0001700066,0.000068637506,0.00082080753,0.000117335345,0.000094148716],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044607287,0.00019308385,0.00024008051,0.000122782,0.00015113181,0.000159804,0.00053336483,0.000069917754,0.00015483658],"category_scores_gemma":[0.0000925474,0.00015806321,0.0001197992,0.00039001458,0.000100971585,0.00029420515,0.00021350874,0.00012991848,0.00092729623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001500402,0.00022953977,0.00012105676,0.000056359626,0.0000127718195,0.000012612123,0.00033990445,0.00002639332,0.0021564548,0.9788763,0.017162872,0.0010042497],"study_design_scores_gemma":[0.00039328044,0.000054114684,0.0003930995,0.000072022194,0.000018628476,0.00009204158,0.000038601218,0.043950375,0.0029627099,0.94977015,0.0019349582,0.00032001323],"about_ca_topic_score_codex":0.000040511008,"about_ca_topic_score_gemma":0.0000010913105,"teacher_disagreement_score":0.17768173,"about_ca_system_score_codex":0.000015714219,"about_ca_system_score_gemma":0.00003527552,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W297797070","doi":"","title":"Face 2-colorable quadrilateral embeddings of complete bipartite graphs","year":2002,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Quadrilateral; Mathematics; Combinatorics; Face (sociological concept); Complete bipartite graph; Discrete mathematics; Graph; Linguistics; Engineering","score_opus":0.024208800536516955,"score_gpt":0.2066045955571672,"score_spread":0.18239579502065026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W297797070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9399393,0.0009142557,0.0020428535,0.000038683207,0.00026028795,0.00035878614,0.00005882448,0.00043861117,0.05594837],"genre_scores_gemma":[0.99844986,0.00001637841,0.0007742124,0.000012685887,0.000012021784,0.000029118177,0.0000028077136,0.000031405067,0.0006715176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988864,0.0000379947,0.00044249737,0.00014867021,0.00017550073,0.000308926],"domain_scores_gemma":[0.99934775,0.00009141357,0.000057354497,0.00039049218,0.00002860199,0.0000844096],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023271501,0.00018482006,0.0003652361,0.00011419011,0.000053357275,0.00002179419,0.00021210988,0.00007262313,0.0012345084],"category_scores_gemma":[0.000026783557,0.00016814047,0.00013927279,0.00024929637,0.00009033169,0.0001267833,0.00002364005,0.000104249164,0.0005099621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005042071,0.00072852534,0.0011285776,0.008063466,0.0009491725,0.000037827554,0.042517677,0.0057320837,0.084023885,0.815607,0.03843103,0.002730333],"study_design_scores_gemma":[0.0012101874,0.00025396506,0.00055299513,0.0008518312,0.0001622381,0.000093222436,0.002540942,0.7515318,0.018430809,0.20183493,0.021379171,0.0011579313],"about_ca_topic_score_codex":0.000003456244,"about_ca_topic_score_gemma":0.000001240346,"teacher_disagreement_score":0.7457997,"about_ca_system_score_codex":0.000013405917,"about_ca_system_score_gemma":0.0000014393839,"threshold_uncertainty_score":0.9996785},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066030286,0.00036683574,0.61839,0.00022682681,0.0012008937,0.0005188396,0.00007274431,0.0016982118,0.31149536],"genre_scores_gemma":[0.8933038,0.00004647062,0.105379246,0.000012573318,0.00010234081,0.000020650032,0.000007628476,0.000042445216,0.0010848489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927324,0.0000046687296,0.0001872049,0.00015194947,0.00012591574,0.0002570005],"domain_scores_gemma":[0.99907804,0.000059757967,0.0000533575,0.0007099421,0.00002577419,0.00007311109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010868903,0.0001508531,0.00017961982,0.000034550547,0.00026141995,0.0001187693,0.0002927884,0.00006537221,0.00012326396],"category_scores_gemma":[0.00025073386,0.000145501,0.000045991277,0.000019171986,0.00007749011,0.00019558945,0.00007521866,0.00011774117,0.00018167427],"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.000013159707,0.00005176093,0.000024823681,0.00046905395,0.000059669128,0.000017360177,0.0005043343,0.9725838,0.0002597012,0.0135410065,0.0114837,0.0009916616],"study_design_scores_gemma":[0.00086972443,0.00008426524,0.0009349334,0.00024116013,0.000082300125,0.00004055736,0.00019232093,0.88610405,0.018218849,0.03542854,0.056918457,0.0008848647],"about_ca_topic_score_codex":0.000004786487,"about_ca_topic_score_gemma":0.00000114543,"teacher_disagreement_score":0.8272735,"about_ca_system_score_codex":0.000036193698,"about_ca_system_score_gemma":0.000006262501,"threshold_uncertainty_score":0.59333587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58192396,0.000032659882,0.00009765814,0.0014765739,0.0001586903,0.00026238427,7.1781255e-7,0.000053915246,0.41599345],"genre_scores_gemma":[0.9954543,0.000019158959,0.0009401815,0.0001430493,0.000017265058,0.000018194834,0.0000016029651,0.000005581199,0.0034006338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992016,0.00008724353,0.00019368643,0.000119863274,0.00022110027,0.00017651138],"domain_scores_gemma":[0.99949014,0.00021956541,0.000053288753,0.0001485656,0.000042341733,0.000046114186],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000626889,0.000056074565,0.00010793291,0.00006443036,0.00012801657,0.000043858752,0.00012924902,0.000061025992,0.0012247463],"category_scores_gemma":[0.00030978676,0.000054001284,0.00007032987,0.00026834122,0.00006627121,0.0001584806,0.000015645213,0.00009805007,0.00088860176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023911564,0.00009972554,0.0023105901,0.00004483385,0.00000703695,7.2038915e-7,0.06107448,0.000003059871,0.00013270724,0.9324551,0.0022936692,0.0015756683],"study_design_scores_gemma":[0.0010153084,0.00008140227,0.013046789,0.00042400826,0.000027746635,0.0000041960147,0.2676309,0.007817152,0.00017356696,0.6397975,0.06943809,0.000543291],"about_ca_topic_score_codex":0.0004295479,"about_ca_topic_score_gemma":0.0002715149,"teacher_disagreement_score":0.41353038,"about_ca_system_score_codex":0.00008171432,"about_ca_system_score_gemma":0.00004058132,"threshold_uncertainty_score":0.9998893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98908037,0.00006450601,0.000010994099,0.00044297602,0.00004749565,0.00009945523,0.000020149397,0.000034362816,0.010199664],"genre_scores_gemma":[0.99898857,0.000003628902,0.0006200149,0.000047773083,0.00007633266,0.0000062685617,0.000002065284,4.497388e-7,0.0002548707],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993937,0.000022654636,0.00017717245,0.00013068444,0.00009551817,0.00018028499],"domain_scores_gemma":[0.99953747,0.00022663342,0.00006581545,0.000057949033,0.00007740634,0.000034707704],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016694328,0.000077211494,0.00018023646,0.0000054395646,0.00012962334,0.000005119947,0.00015467474,0.00003899951,0.0013525563],"category_scores_gemma":[0.00012030969,0.000025880274,0.000052483174,0.00014554837,0.0003671423,0.000045191544,0.00007513807,0.000029564862,0.00014779952],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047095004,0.0035193774,0.43449742,0.000559768,0.00074730045,0.00003713499,0.014902944,5.738856e-7,0.2610884,0.14845939,0.05472379,0.08099297],"study_design_scores_gemma":[0.00019162903,0.0010556739,0.86723834,0.000067451874,0.000051959498,0.00001196198,0.003660117,0.00039190913,0.0066456283,0.10774072,0.01264612,0.0002984825],"about_ca_topic_score_codex":0.0000132430605,"about_ca_topic_score_gemma":0.00026376598,"teacher_disagreement_score":0.43274093,"about_ca_system_score_codex":0.000005172289,"about_ca_system_score_gemma":0.0000026901137,"threshold_uncertainty_score":0.99956036},"labels":[],"label_agreement":null},{"id":"W3118754754","doi":"","title":"On some new Steiner 2-designs S(2, 5, 45)","year":2019,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner tree problem; Arithmetic; Combinatorics","score_opus":0.015088643819815504,"score_gpt":0.21160597189090913,"score_spread":0.19651732807109362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118754754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8003413,0.00050356507,0.0025001864,0.00009252121,0.00083911774,0.00063869136,0.000011430763,0.0008213918,0.19425179],"genre_scores_gemma":[0.99195945,0.0000036870283,0.0004592389,0.00006760383,0.000059244376,0.000015764163,0.0000029915702,0.000048713904,0.0073833256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990737,0.000032268552,0.0002526991,0.00017159969,0.00019049042,0.0002792704],"domain_scores_gemma":[0.9990797,0.00020721188,0.000024263763,0.00055487856,0.000010445746,0.00012348653],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022480378,0.00019062568,0.00026602467,0.00008550664,0.00002684695,0.000028678769,0.00019906613,0.000086254295,0.0018950611],"category_scores_gemma":[0.000033052544,0.00015856804,0.00010530893,0.0001140655,0.00001814714,0.000117112395,0.000017257049,0.00013425428,0.0083237905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012268264,0.000050882274,0.000015357175,0.00042167632,0.00007432107,0.000003907763,0.00083111,0.00060535205,0.0040489538,0.9755818,0.017701011,0.000653352],"study_design_scores_gemma":[0.00084567035,0.00021324735,0.00012491098,0.0004415008,0.000041180625,0.00001803879,0.00047312165,0.014582111,0.0056222803,0.9653702,0.011703077,0.00056465965],"about_ca_topic_score_codex":0.0000017860838,"about_ca_topic_score_gemma":3.750245e-7,"teacher_disagreement_score":0.19161813,"about_ca_system_score_codex":0.000025794043,"about_ca_system_score_gemma":0.000010646042,"threshold_uncertainty_score":0.99901736},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5514408,0.0005952937,0.25609776,0.0005658349,0.0004891967,0.00057884445,0.0000098523415,0.0014264442,0.18879598],"genre_scores_gemma":[0.95470464,0.00001132542,0.044956166,0.00015064406,0.00002563098,0.000012165263,7.619494e-7,0.000011131966,0.00012754134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865925,0.00013265053,0.00026110976,0.00039172496,0.00026251955,0.00029276605],"domain_scores_gemma":[0.9982269,0.0008786664,0.0000778593,0.0006186909,0.00006951029,0.00012840361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008321121,0.00017461226,0.00020768034,0.00029681428,0.0002379164,0.000115570874,0.00050254987,0.00007715314,0.0002521532],"category_scores_gemma":[0.00023460014,0.00014443275,0.00008345901,0.0009125564,0.00018348868,0.0001806508,0.00017474391,0.00012920905,0.00035079385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009611429,0.00016027638,0.000040899802,0.000034451212,0.000044672073,0.000006649407,0.0010982421,1.9782364e-7,0.00007095523,0.9919273,0.0008924792,0.005714258],"study_design_scores_gemma":[0.00026492387,0.00049325207,0.0007471353,0.000094241324,0.000027087155,0.00006002804,0.00003851452,0.014289366,0.0005525231,0.9826045,0.0006216857,0.00020673219],"about_ca_topic_score_codex":5.9639876e-7,"about_ca_topic_score_gemma":3.4736047e-7,"teacher_disagreement_score":0.40326384,"about_ca_system_score_codex":0.000014869449,"about_ca_system_score_gemma":0.000025477611,"threshold_uncertainty_score":0.58897966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8013887,0.0003332403,0.19347008,0.0017962367,0.00017151766,0.00054636074,0.000041638814,0.00045160417,0.0018006358],"genre_scores_gemma":[0.84943485,0.00001882509,0.15038994,0.00009841173,0.0000013492566,0.000012893026,0.000002032975,0.0000059449058,0.00003574323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989263,0.00006571,0.00034773318,0.0002620703,0.00021017306,0.00018802733],"domain_scores_gemma":[0.99905974,0.0001807826,0.00012261172,0.0004527034,0.00010425726,0.00007989565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976081,0.00011294327,0.00020897899,0.000103470746,0.00008480592,0.000026859369,0.0002850594,0.00003358704,0.00005454031],"category_scores_gemma":[0.000051043437,0.000074396055,0.000048424983,0.00021875676,0.00010690723,0.0001574986,0.00018173133,0.000027282515,0.000017131344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027605392,0.000108987224,0.0007025848,0.000084400664,0.000028427625,6.910214e-7,0.0007718011,3.332627e-7,0.010137288,0.9858919,0.0012023787,0.0010684488],"study_design_scores_gemma":[0.0007035321,0.00012423075,0.0017155516,0.00010075549,0.000021824551,0.000010983842,0.000028453112,0.010616116,0.0035075492,0.98220795,0.0008127678,0.00015026664],"about_ca_topic_score_codex":0.000017121376,"about_ca_topic_score_gemma":0.0000051014663,"teacher_disagreement_score":0.048046168,"about_ca_system_score_codex":0.000011272994,"about_ca_system_score_gemma":0.000020361,"threshold_uncertainty_score":0.3033783},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06882193,0.0005955506,0.0019398074,0.00085491454,0.0003164961,0.00028284924,0.000014706502,0.00028607727,0.9268877],"genre_scores_gemma":[0.96069217,0.0000070818433,0.0031503867,0.0004818432,0.00007728061,0.000051680854,0.0000028727702,0.00002303147,0.03551367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892604,0.00009027649,0.00027884598,0.00025200908,0.00016552913,0.00028731074],"domain_scores_gemma":[0.999085,0.00017146296,0.000048017526,0.00055664603,0.00003624226,0.0001026118],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017731564,0.00013802068,0.00018399637,0.00009008482,0.0000633516,0.000028938615,0.00019037617,0.000088573455,0.3303726],"category_scores_gemma":[0.0000925527,0.000119317745,0.00010092825,0.00015543055,0.0000913772,0.000060891387,0.000022399974,0.000116892224,0.065347545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012408202,0.0009663703,0.00040553504,0.00008289613,0.00006645476,0.00006266368,0.018934757,2.0886038e-7,0.0009316594,0.49642172,0.4684945,0.0136208115],"study_design_scores_gemma":[0.0033184416,0.0009378246,0.038795292,0.00018383964,0.00022954453,0.0005480268,0.013094635,0.0036114329,0.00017795326,0.77735496,0.1600046,0.0017434711],"about_ca_topic_score_codex":0.000013571729,"about_ca_topic_score_gemma":0.000003149418,"teacher_disagreement_score":0.8918702,"about_ca_system_score_codex":0.000025003226,"about_ca_system_score_gemma":0.0000038141288,"threshold_uncertainty_score":0.9353802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.624359,0.00071364956,0.2911257,0.0015194531,0.0005841107,0.0012475312,0.00006401075,0.0011088173,0.07927771],"genre_scores_gemma":[0.8312203,0.00003018128,0.16321115,0.00009925053,0.00014356272,0.0002862044,0.000013053305,0.00007136318,0.004924893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734485,0.00024177026,0.0010384588,0.00048766256,0.0003920286,0.00049520336],"domain_scores_gemma":[0.9947104,0.004137745,0.00027654375,0.00060841534,0.00011428752,0.00015260997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012523442,0.000326363,0.0006490934,0.00025530846,0.00036586614,0.00014338158,0.00017597535,0.000144624,0.00036501233],"category_scores_gemma":[0.006341036,0.0003007909,0.00010219134,0.00031622202,0.0002757877,0.00049237773,0.00013970406,0.00029436135,0.00012184034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015234061,0.0003599846,0.0014872337,0.00087112794,0.000063058935,0.0000060987118,0.0012003742,0.000062103165,0.0010945594,0.99075663,0.0031263868,0.00095719256],"study_design_scores_gemma":[0.00044237598,0.00008908351,0.00048760264,0.00044336877,0.00008348899,0.000052228967,0.0016215051,0.017382286,0.00027251194,0.97800684,0.0007805088,0.000338223],"about_ca_topic_score_codex":0.00005681938,"about_ca_topic_score_gemma":0.0006549215,"teacher_disagreement_score":0.20686132,"about_ca_system_score_codex":0.000100551486,"about_ca_system_score_gemma":0.00004869795,"threshold_uncertainty_score":0.99994445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004870725,0.00046179554,0.9917942,0.000054809447,0.00035623956,0.00036742626,0.0000063192447,0.0002398352,0.0018486446],"genre_scores_gemma":[0.7565112,0.000005166427,0.24331118,0.0000059786485,0.000011032984,0.00006364088,0.0000010643668,0.0000192656,0.00007147037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978824,0.00008509084,0.00071651104,0.00035402225,0.0004443875,0.0005175728],"domain_scores_gemma":[0.9980482,0.0004969595,0.00016682812,0.0009813211,0.00011685523,0.00018985875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305556,0.00023796021,0.0005158404,0.00008800127,0.00009149574,0.000042577754,0.0006076579,0.000073399875,0.000042477513],"category_scores_gemma":[0.0007254944,0.00020612737,0.00013513987,0.00034385873,0.00009094569,0.00023463625,0.00014621395,0.00014248754,0.00008978765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013901531,0.00013171509,0.0000045860993,0.00026885502,0.000037444428,0.000002257642,0.00030616616,0.024072032,0.00053237117,0.9745299,0.00006842898,0.000044845157],"study_design_scores_gemma":[0.00023039327,0.00004840413,0.000017765968,0.00012814348,0.000023711105,0.00002666525,0.0001283657,0.9444271,0.0004360624,0.05408552,0.00023672989,0.0002111915],"about_ca_topic_score_codex":0.0000034564036,"about_ca_topic_score_gemma":1.6346281e-7,"teacher_disagreement_score":0.92044437,"about_ca_system_score_codex":0.000058982092,"about_ca_system_score_gemma":0.000060344377,"threshold_uncertainty_score":0.840563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1379586,0.0032872437,0.7644253,0.00044843537,0.00020490738,0.00057335285,0.000029048362,0.0010404167,0.09203273],"genre_scores_gemma":[0.76408595,0.0000062395848,0.23564322,0.00009530663,0.00001894698,0.000019519726,0.0000012853777,0.000011670553,0.000117854346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862194,0.000038767892,0.0003844581,0.0002484362,0.00035685117,0.00034953633],"domain_scores_gemma":[0.99872535,0.00018377505,0.00015075505,0.00068942324,0.00012428853,0.00012640303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007796759,0.00017283199,0.00030801818,0.000086060136,0.00005945069,0.0001510301,0.0007267585,0.00004545953,0.000024629215],"category_scores_gemma":[0.00027774923,0.00014648373,0.000044543995,0.00025481265,0.000219908,0.0013346522,0.00045344312,0.00008382178,0.00003995322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010489854,0.0010404724,0.0023981892,0.0018779227,0.00006332539,0.000008681106,0.007734449,6.3375745e-7,0.0052007297,0.90407157,0.0034709503,0.07412261],"study_design_scores_gemma":[0.00083919195,0.00018388614,0.0044041085,0.0008049515,0.00007345901,0.00039002227,0.00048264573,0.023682687,0.0490087,0.9144102,0.0046716705,0.0010485029],"about_ca_topic_score_codex":0.000015548057,"about_ca_topic_score_gemma":0.0000012180559,"teacher_disagreement_score":0.62612736,"about_ca_system_score_codex":0.000023452534,"about_ca_system_score_gemma":0.00004814474,"threshold_uncertainty_score":0.5973433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.867795,0.0000582807,0.0036501582,0.00016767601,0.00013413063,0.00047187778,0.000011500236,0.00012768205,0.12758371],"genre_scores_gemma":[0.95652604,0.000009561903,0.04234731,0.00013771735,0.000044597247,0.000043244378,0.0000013580174,0.00005253062,0.0008376466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983507,0.00010255749,0.0005822205,0.00025241973,0.0003806394,0.00033147546],"domain_scores_gemma":[0.99759346,0.0010802699,0.00025021192,0.00092503044,0.00007247704,0.00007854086],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008204692,0.00023706461,0.00042216777,0.000072443814,0.00011189942,0.000017502409,0.00045877128,0.000083773164,0.002771183],"category_scores_gemma":[0.0011055187,0.0001493196,0.00020758275,0.00014541931,0.0001979854,0.000067161716,0.00008725786,0.00016963568,0.0002459392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030673506,0.00031613986,0.000034920813,0.00026333623,0.00008627539,0.0000037495086,0.0063933753,3.6213996e-7,0.00029312653,0.98870206,0.0035556268,0.00032037846],"study_design_scores_gemma":[0.00027198106,0.00006387223,0.00009411348,0.0001940701,0.0000702044,0.000007712953,0.0012192898,0.00027818547,0.008205342,0.98924446,0.00018502685,0.0001657131],"about_ca_topic_score_codex":0.000035528163,"about_ca_topic_score_gemma":0.0000075830817,"teacher_disagreement_score":0.12674607,"about_ca_system_score_codex":0.00002316839,"about_ca_system_score_gemma":0.000026337788,"threshold_uncertainty_score":0.9981404},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59503376,0.0006599057,0.37433815,0.0033307015,0.00011560067,0.0010958505,0.000028980172,0.00041545997,0.024981584],"genre_scores_gemma":[0.94284093,0.000010663732,0.05694324,0.00012142708,0.000010489636,0.000025806812,0.000001074506,0.000013724374,0.000032659354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819666,0.0001209743,0.00044540572,0.00039629248,0.00045607972,0.00038457836],"domain_scores_gemma":[0.9986498,0.00033989517,0.00009178317,0.00068359723,0.00006948172,0.00016545688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057612924,0.00015801202,0.00034443126,0.00017156795,0.000047000103,0.00004233808,0.0012774515,0.00005543264,0.00015391364],"category_scores_gemma":[0.00059444684,0.00014092661,0.00011106395,0.0011909149,0.00023870738,0.00032510306,0.0003831042,0.00020883825,0.00007415681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004815546,0.00022186554,0.0011444846,0.00035502214,0.000025878346,0.000026440543,0.005304584,0.00003744251,0.005891919,0.9780025,0.00040561482,0.00853612],"study_design_scores_gemma":[0.00071012194,0.00020614888,0.0028683548,0.00009532827,0.0000048063644,0.0000067110054,0.00036573803,0.040888276,0.009013656,0.9451866,0.00040727825,0.0002469869],"about_ca_topic_score_codex":0.000005127015,"about_ca_topic_score_gemma":0.0000025569366,"teacher_disagreement_score":0.34780714,"about_ca_system_score_codex":0.000018676315,"about_ca_system_score_gemma":0.000056524066,"threshold_uncertainty_score":0.57468206},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95083815,0.00013199619,0.00009941862,0.000222293,0.00020680996,0.000117414325,0.00002759598,0.00003467913,0.04832164],"genre_scores_gemma":[0.99371034,0.0000029581668,0.002660252,0.00024133232,0.000028818073,0.0000022441577,0.0000024529386,0.00001124256,0.0033403852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733776,0.00017992585,0.0006231589,0.0002977529,0.001353075,0.00020834249],"domain_scores_gemma":[0.9938832,0.0048542595,0.00015244214,0.0007536799,0.0002514255,0.00010502175],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019102864,0.00013369009,0.00038263085,0.00017166769,0.00013878754,0.000013688894,0.0003899924,0.00007885365,0.0038779872],"category_scores_gemma":[0.008284216,0.000088623456,0.00014273006,0.000422324,0.00031744826,0.00010269229,0.00010038326,0.00011509163,0.0035756684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037817314,0.0010378605,0.00058892154,0.000046306548,0.00007610821,0.00009609626,0.004173995,0.00007772446,0.0035854166,0.8798432,0.10782927,0.0022669602],"study_design_scores_gemma":[0.0003205342,0.0003136258,0.0023853711,0.00004150176,0.000010298062,0.00010300578,0.00033693653,0.00045788687,0.0029155817,0.9906054,0.0023551765,0.00015464814],"about_ca_topic_score_codex":0.0000027588294,"about_ca_topic_score_gemma":4.4947157e-7,"teacher_disagreement_score":0.11076227,"about_ca_system_score_codex":0.000013795626,"about_ca_system_score_gemma":0.000085143474,"threshold_uncertainty_score":0.9972002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87401617,0.00038143623,0.06488654,0.031298567,0.000101276244,0.004207881,0.000104095336,0.000765672,0.024238368],"genre_scores_gemma":[0.9693589,0.000005499998,0.027509885,0.0016457548,0.00020192366,0.00044359002,0.0000051975267,0.00007153947,0.00075766287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981346,0.00014113763,0.0004469771,0.00042928255,0.0004309348,0.00041702762],"domain_scores_gemma":[0.99800396,0.00062808674,0.00012722336,0.0008895545,0.00008810794,0.0002630917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055000576,0.00030055796,0.0004041676,0.00008513636,0.00032214107,0.00007698149,0.00060308434,0.00007750161,0.0006539988],"category_scores_gemma":[0.00047849273,0.00017965828,0.00014786283,0.0007959528,0.00018319617,0.0001166054,0.00012667933,0.0002628299,0.00042509646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014074783,0.00014792496,0.000054924232,0.00012698025,0.00009266145,0.000008430507,0.0038931947,0.000014271013,0.00028479,0.9836901,0.011363134,0.0001828721],"study_design_scores_gemma":[0.0006680692,0.00015877547,0.00017125958,0.00006528829,0.0001126892,0.000037556485,0.0007989066,0.0011694793,0.00057599763,0.99014664,0.0058057164,0.00028962526],"about_ca_topic_score_codex":0.0000038704256,"about_ca_topic_score_gemma":0.000006591539,"teacher_disagreement_score":0.095342785,"about_ca_system_score_codex":0.00001567039,"about_ca_system_score_gemma":0.00004548569,"threshold_uncertainty_score":0.7326252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.784839,0.0060947808,0.2056759,0.0010126056,0.00034680188,0.0003575416,0.000032433014,0.0003545534,0.0012863969],"genre_scores_gemma":[0.905369,0.000030238964,0.094224684,0.0001647597,0.00014977336,0.000020813886,0.00000367363,0.000010933056,0.000026158212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877477,0.00014608953,0.00021731382,0.00025718336,0.00023671835,0.00036791843],"domain_scores_gemma":[0.99821705,0.000728372,0.000068685185,0.0008294274,0.00002172359,0.00013476424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008740556,0.00017125584,0.00019736278,0.0000502143,0.00024150765,0.000111264824,0.0007279625,0.00005687834,0.00004771192],"category_scores_gemma":[0.00007607992,0.00011322861,0.00011001721,0.0002065962,0.00022708655,0.00055864477,0.0003302579,0.0001426017,0.00005122378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007049832,0.00009783535,0.00043416457,0.00001564879,0.0000447679,0.0000010445489,0.002420814,9.766485e-7,0.0002019554,0.9944763,0.00047863665,0.0018208087],"study_design_scores_gemma":[0.00031017195,0.00010778772,0.0051323525,0.00007748043,0.00006226705,0.00001834617,0.00083422515,0.010152459,0.00057010003,0.97809166,0.0043455632,0.00029761737],"about_ca_topic_score_codex":0.000008915735,"about_ca_topic_score_gemma":0.000001034708,"teacher_disagreement_score":0.12052997,"about_ca_system_score_codex":0.000007656451,"about_ca_system_score_gemma":0.000008029838,"threshold_uncertainty_score":0.4617329},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7911213,0.0006216058,0.12097603,0.0014619632,0.0010578904,0.0006295248,0.000010598544,0.0009568955,0.08316419],"genre_scores_gemma":[0.88441926,0.0000028989016,0.115185365,0.00020642356,0.00000469425,0.000005601878,5.134498e-7,0.000009075835,0.00016616799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871606,0.00004514639,0.00035694844,0.000301891,0.00033083503,0.0002490945],"domain_scores_gemma":[0.9984975,0.00021115356,0.00011656915,0.00092182745,0.00016708845,0.000085857835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005511567,0.00013286903,0.00021883337,0.00016590933,0.0001031176,0.00003277529,0.000592531,0.00005434518,0.000104892264],"category_scores_gemma":[0.00023898265,0.00010498164,0.00008866676,0.00043740988,0.000176499,0.000106688894,0.00015159645,0.000082616585,0.00045121688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041167737,0.00013593103,0.00001271156,0.000037754784,0.000017105864,0.0000012490142,0.0008576863,0.000001693076,0.003900897,0.99118274,0.0013361203,0.0025119947],"study_design_scores_gemma":[0.00021522086,0.00026925968,0.000030106183,0.00016220193,0.0000091346365,0.000005650928,0.000027870998,0.014309816,0.021398582,0.9632915,0.00015576289,0.00012487166],"about_ca_topic_score_codex":0.000006777535,"about_ca_topic_score_gemma":7.5340085e-7,"teacher_disagreement_score":0.09329796,"about_ca_system_score_codex":0.000007077313,"about_ca_system_score_gemma":0.000028335653,"threshold_uncertainty_score":0.579963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71508473,0.0032315035,0.13255055,0.0066550337,0.0015347496,0.0036857831,0.00016230154,0.00088324514,0.13621213],"genre_scores_gemma":[0.9801086,0.00008328412,0.019088672,0.00013290688,0.0000140518,0.00006434237,0.000002336694,0.00001672605,0.00048907154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976515,0.00026849817,0.0003443589,0.0006176611,0.0005418061,0.00057614635],"domain_scores_gemma":[0.9959753,0.0012900627,0.00019822543,0.0022606428,0.00013751828,0.00013822291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017160028,0.0002264995,0.00036700175,0.00017926842,0.0003708556,0.00032783856,0.00294399,0.00007208187,0.00004711804],"category_scores_gemma":[0.0024101695,0.00018756355,0.000098151126,0.00029247926,0.00041837746,0.00069750566,0.00045603918,0.0002645306,0.00041782408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006640875,0.00033850953,0.011748699,0.00011084614,0.000044685396,0.000103178456,0.0015801061,0.00003581781,0.00006445128,0.96768016,0.0014802854,0.016746882],"study_design_scores_gemma":[0.00038218003,0.00014587681,0.1329576,0.00024528027,0.0000022779889,0.0000036927945,0.00009174804,0.006511955,0.000529784,0.85842294,0.00043543027,0.00027121956],"about_ca_topic_score_codex":0.00007046294,"about_ca_topic_score_gemma":0.00035928134,"teacher_disagreement_score":0.2650239,"about_ca_system_score_codex":0.000036238394,"about_ca_system_score_gemma":0.00005366322,"threshold_uncertainty_score":0.764862},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40766075,0.00018944495,0.01537001,0.00022769612,0.00040675426,0.001079291,0.00008431161,0.0003501202,0.57463163],"genre_scores_gemma":[0.877828,0.000004428465,0.12040627,0.000023414033,0.000025172334,0.000026307902,0.0000044574062,0.000034627286,0.0016473515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984017,0.00007664924,0.00066413154,0.0002361145,0.00039447544,0.00022691014],"domain_scores_gemma":[0.99776334,0.0008518329,0.00018364763,0.0007895695,0.0003285503,0.000083046114],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066350464,0.00017097294,0.00036733988,0.000106773565,0.000055584176,0.0000059644394,0.00024695764,0.00009122789,0.005308264],"category_scores_gemma":[0.0033745666,0.00014287356,0.00013418899,0.0003057241,0.0001766727,0.000106313484,0.00007384645,0.000111970585,0.00040748183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013997333,0.0011415329,0.0002751935,0.00083499844,0.000166957,0.0000028446445,0.012237317,0.0000011053237,0.0006988991,0.97885334,0.0049818503,0.00066595426],"study_design_scores_gemma":[0.00031593457,0.00015362381,0.00085756794,0.000109922206,0.00011560634,0.000011626792,0.00096834573,0.00072688214,0.0033145146,0.9927483,0.0004998952,0.00017777654],"about_ca_topic_score_codex":0.000034870347,"about_ca_topic_score_gemma":0.000026360553,"teacher_disagreement_score":0.5729843,"about_ca_system_score_codex":0.00004672688,"about_ca_system_score_gemma":0.000077130804,"threshold_uncertainty_score":0.995601},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34046263,0.00011952394,0.05463816,0.002293097,0.00018745154,0.0011543912,0.00008445253,0.0009397457,0.60012054],"genre_scores_gemma":[0.91617393,0.0000043841083,0.07374539,0.00013673113,0.000118715594,0.000022785865,0.000007769189,0.000039341,0.009750948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984457,0.0000368968,0.00056420185,0.00029675223,0.0002922431,0.0003642207],"domain_scores_gemma":[0.99654526,0.0022409968,0.0001457485,0.0008396042,0.00004367713,0.00018469503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012249378,0.00021232475,0.0002684546,0.00013069985,0.00016515185,0.00003358365,0.0003111167,0.00009270554,0.0003904481],"category_scores_gemma":[0.0009928541,0.00017136938,0.00014268866,0.00027163848,0.000085550455,0.00006711815,0.000046746893,0.00016495807,0.0006971703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009170471,0.0002149286,0.0000055722767,0.000044499786,0.000030352707,0.000003944708,0.001476407,2.7945427e-7,0.00035020005,0.96060634,0.033518013,0.0036577438],"study_design_scores_gemma":[0.0004503182,0.00008433403,0.00040773308,0.0000961695,0.000041458934,0.000008305716,0.0006794872,0.000025126368,0.007099372,0.9785617,0.012366362,0.00017962835],"about_ca_topic_score_codex":0.000004632916,"about_ca_topic_score_gemma":0.00001792945,"teacher_disagreement_score":0.5903696,"about_ca_system_score_codex":0.000025851996,"about_ca_system_score_gemma":0.000024870547,"threshold_uncertainty_score":0.8960947},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7637416,0.0013625884,0.12116243,0.0061050365,0.0008883308,0.001937129,0.0002591953,0.00040270638,0.104140975],"genre_scores_gemma":[0.40884447,0.00002964715,0.5817741,0.00032105873,0.00011936269,0.00006765678,0.000005427528,0.000025101968,0.008813196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681866,0.00032969055,0.00095120847,0.0005869663,0.0009898513,0.0003235935],"domain_scores_gemma":[0.99757105,0.0011285591,0.0002485574,0.0006703274,0.00018922769,0.00019226193],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029750243,0.00020347816,0.0003729219,0.00018298463,0.00018058126,0.00014833942,0.0003769206,0.000090149966,0.0013052046],"category_scores_gemma":[0.0033074606,0.00014644382,0.00010032958,0.00043081702,0.0004458199,0.00045767947,0.00012647756,0.00011949053,0.0005006975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011708126,0.0012187317,0.003415954,0.00006698035,0.00024436976,0.00016527032,0.0093484465,0.00010711968,0.11131537,0.72174746,0.05508851,0.09611101],"study_design_scores_gemma":[0.0012389065,0.00021974361,0.0056009977,0.00004704376,0.000028927812,0.00045742028,0.0024115543,0.011939836,0.003959237,0.9638196,0.00987901,0.00039770006],"about_ca_topic_score_codex":0.0000058402525,"about_ca_topic_score_gemma":0.000001292813,"teacher_disagreement_score":0.46061167,"about_ca_system_score_codex":0.00003892378,"about_ca_system_score_gemma":0.00007149652,"threshold_uncertainty_score":0.99960774},"labels":[],"label_agreement":null},{"id":"W36932259","doi":"10.1007/s00247-023-05643-4","title":"Minimal Defining Sets of 1-Factorizations of Complete Graphs","year":2008,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Equivalence (formal languages); Combinatorics; Set (abstract data type); Graph; Unipotent; Discrete mathematics; Computer science; Algorithm","score_opus":0.02718840041487686,"score_gpt":0.22031214190550283,"score_spread":0.19312374149062597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36932259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756554,0.00032886353,0.0018170751,0.000003607425,0.00010535817,0.00013086005,0.00010728627,0.00010709106,0.021744497],"genre_scores_gemma":[0.99704313,0.000010758265,0.0028816275,0.0000018807169,0.000003194303,0.000009579816,0.000009939906,0.000018786019,0.000021092816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.000028654815,0.00042490748,0.00008258835,0.00014798237,0.0001439075],"domain_scores_gemma":[0.99941057,0.0001660725,0.000067965615,0.00026826572,0.00004343647,0.000043715037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013085181,0.00011074179,0.00029858598,0.00010689931,0.000043336873,0.0000021882704,0.00013082978,0.000048625276,0.00014858143],"category_scores_gemma":[0.000056873465,0.000104714854,0.00010575007,0.00022693197,0.00011778235,0.00005260845,0.000015889957,0.000056295197,0.000029019971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001720861,0.00020807149,0.0044573187,0.002580529,0.00030067406,0.000007664555,0.014256861,0.00056335476,0.025649944,0.9502369,0.001381322,0.00034015364],"study_design_scores_gemma":[0.0037677323,0.00086829177,0.06811505,0.0031208922,0.0005786518,0.0005858181,0.010376451,0.11944344,0.0789757,0.70717746,0.0044383863,0.0025521142],"about_ca_topic_score_codex":0.000002563052,"about_ca_topic_score_gemma":7.052226e-7,"teacher_disagreement_score":0.24305943,"about_ca_system_score_codex":0.000005799169,"about_ca_system_score_gemma":0.000008941551,"threshold_uncertainty_score":0.4270148},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0845988,0.032957178,0.68344855,0.039854523,0.008522773,0.003730648,0.000047605303,0.006828856,0.14001109],"genre_scores_gemma":[0.9255791,0.00017875533,0.06917726,0.00020745613,0.00014743494,0.00011736935,0.0000038171997,0.00006602816,0.0045228032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969666,0.00018990718,0.00069229974,0.0009023529,0.00056992116,0.00067893264],"domain_scores_gemma":[0.99596095,0.0021562944,0.00009080162,0.0014700837,0.00009303879,0.00022884537],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001593686,0.0003681653,0.0003847065,0.0001117515,0.0004464515,0.0011116188,0.001411808,0.00014097463,0.00012105013],"category_scores_gemma":[0.00038709497,0.00024942856,0.00019359759,0.0008197943,0.0005152988,0.0005026827,0.00088668417,0.0004334619,0.00071008917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006020021,0.00013603183,0.00005346414,0.0003549024,0.00016187676,0.00006783074,0.006065312,0.000014745603,0.000057703703,0.820039,0.009497765,0.16354537],"study_design_scores_gemma":[0.00020106787,0.000087133216,0.00067831227,0.00016444658,0.00003461484,0.00024363362,0.00028233058,0.34648508,0.00007760052,0.6212481,0.030135233,0.00036240608],"about_ca_topic_score_codex":0.00002359224,"about_ca_topic_score_gemma":0.000009706795,"teacher_disagreement_score":0.8409803,"about_ca_system_score_codex":0.0001096788,"about_ca_system_score_gemma":0.00013857381,"threshold_uncertainty_score":0.99999577},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013506161,0.034143813,0.09849676,0.0041625574,0.008565831,0.0076900744,0.0037821874,0.002401161,0.839407],"genre_scores_gemma":[0.006308442,0.0013064777,0.27953768,0.00042076566,0.0023113335,0.0019234163,0.000387381,0.0021511663,0.70565337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9780338,0.0012330144,0.0077180113,0.0042452915,0.0038805015,0.0048894202],"domain_scores_gemma":[0.969049,0.018160094,0.0021259896,0.007751029,0.001024056,0.0018898331],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0047589373,0.0053283144,0.008100356,0.0012933599,0.0010039539,0.0013070711,0.0041679656,0.0034398758,0.1428105],"category_scores_gemma":[0.012731964,0.0047090943,0.003474144,0.0024870697,0.004137793,0.0010708306,0.003116819,0.0050656954,0.45519927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008754478,0.001915896,4.480359e-7,0.060511425,0.0018192044,0.00029016784,0.0070021763,0.00000872198,0.00011981067,0.6255147,0.30052868,0.002201234],"study_design_scores_gemma":[0.00076398347,0.00038739253,8.391855e-7,0.016976794,0.0033256703,0.0007460975,0.0037618282,0.004865561,0.00095488713,0.69867057,0.2665656,0.0029807594],"about_ca_topic_score_codex":0.000018080362,"about_ca_topic_score_gemma":0.000013944107,"teacher_disagreement_score":0.31238878,"about_ca_system_score_codex":0.0016498753,"about_ca_system_score_gemma":0.0011034724,"threshold_uncertainty_score":0.9997297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6703819,0.06253773,0.23265845,0.009889438,0.001591612,0.0011359089,0.000033129585,0.002175701,0.01959615],"genre_scores_gemma":[0.94766945,0.00007996503,0.051891997,0.00003922219,0.0000046211426,0.00000820399,0.000001150061,0.000011525162,0.0002938686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885124,0.00005158203,0.000334181,0.00032240528,0.0002442012,0.00019641817],"domain_scores_gemma":[0.9991403,0.00025942296,0.00004877118,0.00039640046,0.00006920766,0.0000858763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007426503,0.00012889074,0.00020139242,0.00015002362,0.00006061031,0.00009220199,0.00026489768,0.000049788163,0.00002422278],"category_scores_gemma":[0.00012832164,0.00009927476,0.00006181087,0.00038281808,0.000052342224,0.00022476181,0.00022519396,0.00010397609,0.00007646931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010174753,0.000052114112,0.000008858757,0.0005864379,0.000024465582,0.000007041084,0.0014635059,0.000007731359,0.006979966,0.9802292,0.0004467125,0.01019297],"study_design_scores_gemma":[0.00014468699,0.000086661035,0.000048246155,0.0007560353,0.000027209206,0.000033737157,0.00009036327,0.25814673,0.008128527,0.7316497,0.00071945315,0.00016866592],"about_ca_topic_score_codex":0.000004605785,"about_ca_topic_score_gemma":0.0000012417651,"teacher_disagreement_score":0.27728757,"about_ca_system_score_codex":0.000008324954,"about_ca_system_score_gemma":0.000030070521,"threshold_uncertainty_score":0.4048307},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64848983,0.0051568523,0.039657008,0.0026526698,0.001561696,0.0012454754,0.00008565873,0.0036932772,0.29745752],"genre_scores_gemma":[0.9402684,0.000048527138,0.05038442,0.00011476786,0.00037810215,0.00008112648,0.0000074270188,0.00012375586,0.008593487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805516,0.00005236582,0.00053722516,0.00046765342,0.0004214651,0.00046615137],"domain_scores_gemma":[0.99798477,0.0009954183,0.000058698457,0.0007678674,0.00004987738,0.0001433472],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006477113,0.0003050175,0.00041651595,0.00016754113,0.000117426316,0.0001914737,0.00035087255,0.0001190139,0.0017806198],"category_scores_gemma":[0.0006636876,0.00024108119,0.00024960793,0.00025960576,0.00013986485,0.00022673616,0.00011827521,0.00024377149,0.0023408642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004093118,0.00014188027,0.0000070917954,0.0015387945,0.00009846778,0.000043975513,0.0018823935,1.9756293e-7,0.00029001854,0.9478243,0.040741883,0.007426886],"study_design_scores_gemma":[0.00011605796,0.00003755045,0.000053612333,0.0005409757,0.0000931321,0.00006506972,0.0004032037,0.0023103121,0.0017119268,0.96667475,0.027706822,0.00028659336],"about_ca_topic_score_codex":0.0000045176357,"about_ca_topic_score_gemma":0.000004399151,"teacher_disagreement_score":0.29177853,"about_ca_system_score_codex":0.000057355188,"about_ca_system_score_gemma":0.000045911507,"threshold_uncertainty_score":0.99913186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79035425,0.0013310764,0.01616737,0.002715475,0.00043776497,0.0020886129,0.000196834,0.0007758483,0.18593279],"genre_scores_gemma":[0.99135655,0.000011252435,0.004772928,0.00005140673,0.00006139495,0.00011939561,0.0000062762256,0.00009576879,0.003525054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723655,0.0002810252,0.00068923127,0.0004014093,0.00086703204,0.00052473426],"domain_scores_gemma":[0.9841669,0.01417061,0.00010057417,0.0013553887,0.000106273335,0.00010022138],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0030588652,0.00029766074,0.00047013623,0.0002839791,0.0001479385,0.000109660374,0.0007038747,0.00013193107,0.0031392036],"category_scores_gemma":[0.0043903454,0.00018316654,0.00033513384,0.00075697165,0.00044894166,0.0001362291,0.00021338549,0.00047346234,0.0010156387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043090007,0.000247175,0.0000017580362,0.0014105986,0.00015747304,0.000038923594,0.0020821348,0.000002328549,0.0007265968,0.9764284,0.018664978,0.00019654569],"study_design_scores_gemma":[0.00014018215,0.00020469572,0.000004091541,0.0007213606,0.000068553585,0.000026795124,0.0008854302,0.0049618245,0.0033658987,0.9887616,0.0006793937,0.00018014785],"about_ca_topic_score_codex":0.0000037152695,"about_ca_topic_score_gemma":0.000001961097,"teacher_disagreement_score":0.2010023,"about_ca_system_score_codex":0.0000481391,"about_ca_system_score_gemma":0.000067998975,"threshold_uncertainty_score":0.9997622},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010475269,0.0002923889,0.9279754,0.0046651294,0.00035697708,0.0016221475,0.0008269468,0.0010708838,0.05271484],"genre_scores_gemma":[0.7722418,0.000018469469,0.16175793,0.0005232307,0.0007771656,0.005204309,0.00025850497,0.00023751684,0.058981106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974044,0.0000796161,0.0010254638,0.0005349919,0.00044476413,0.00051078247],"domain_scores_gemma":[0.9916722,0.0070623127,0.00014613525,0.0007031546,0.00024371548,0.00017246751],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009283639,0.00038121155,0.0006024125,0.00018871717,0.00034127024,0.00020587353,0.00028286743,0.00017981665,0.0025043427],"category_scores_gemma":[0.0018712006,0.0003124686,0.00037026047,0.00037067293,0.00018446101,0.00026373417,0.0000887966,0.0002628463,0.00040337082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000190689,0.0002355034,5.084988e-7,0.0022775019,0.00018302434,0.0000016159253,0.0020419755,0.0000037663642,0.0001826522,0.9314613,0.063049495,0.0005436293],"study_design_scores_gemma":[0.00024870026,0.00007341409,0.0000041458447,0.00030468407,0.00016845092,0.00001962289,0.0029541904,0.027195219,0.00034265514,0.9168209,0.051532872,0.00033518148],"about_ca_topic_score_codex":0.000011739091,"about_ca_topic_score_gemma":0.000007657919,"teacher_disagreement_score":0.76621747,"about_ca_system_score_codex":0.00011889988,"about_ca_system_score_gemma":0.00013049332,"threshold_uncertainty_score":0.99993277},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.128866,0.0019451648,0.40629902,0.0043587517,0.00061995693,0.0026430916,0.00065557513,0.0007495973,0.45386285],"genre_scores_gemma":[0.9828393,0.000013650165,0.011411912,0.00007017569,0.00022245094,0.00014333465,0.00002231454,0.000050320745,0.0052265814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987677,0.000021956279,0.00036110744,0.00035544936,0.0001681955,0.00032560097],"domain_scores_gemma":[0.99890625,0.00042521127,0.000057759633,0.0004307144,0.000027558994,0.00015250227],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017433787,0.00025736826,0.00031970383,0.000052908075,0.00017284299,0.00012895398,0.00013619768,0.00004348961,0.0015305778],"category_scores_gemma":[0.000017572269,0.0001982045,0.00012673567,0.00014526225,0.00016558985,0.00016332725,0.00009493293,0.00015473708,0.00063877204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011925894,0.00014307706,0.00000626568,0.00025690967,0.0000716555,0.0000029384307,0.0013720562,0.0000024809135,0.00045330785,0.982586,0.0013281372,0.013765246],"study_design_scores_gemma":[0.0001306112,0.00008107962,0.000012970714,0.00018462194,0.00007528724,0.000013931376,0.001182709,0.0020465038,0.0019940769,0.9451712,0.048852768,0.00025425522],"about_ca_topic_score_codex":0.00000663933,"about_ca_topic_score_gemma":5.804818e-7,"teacher_disagreement_score":0.85397327,"about_ca_system_score_codex":0.00002532039,"about_ca_system_score_gemma":0.000026205636,"threshold_uncertainty_score":0.99938214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68648046,0.0014622102,0.016691716,0.0017376507,0.0010417582,0.00082995807,0.000054288867,0.0022165626,0.2894854],"genre_scores_gemma":[0.9728837,0.000020973936,0.019769154,0.00015107986,0.00022736867,0.00006287008,0.0000050958697,0.00009860374,0.006781137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826777,0.000047951777,0.00043474048,0.00043856222,0.0004165767,0.00039442262],"domain_scores_gemma":[0.9975543,0.0015180187,0.000048552713,0.0007245053,0.00003452855,0.000120080804],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053212815,0.00028264936,0.00035709288,0.00017156395,0.000104279825,0.00015123942,0.0002907525,0.00010290383,0.0016502618],"category_scores_gemma":[0.0008074103,0.00021561822,0.00021578687,0.00020748329,0.00010577584,0.00013918789,0.00007324378,0.00024329254,0.003154124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065133586,0.00016619822,0.0000018667068,0.0009103726,0.00006801927,0.000035361052,0.001074269,4.9428104e-7,0.00012854084,0.9434867,0.049968433,0.0041532475],"study_design_scores_gemma":[0.000114965274,0.000073623705,0.00003013758,0.000669299,0.00005871752,0.0000314349,0.00018957745,0.0020297312,0.0012125219,0.9855715,0.009778352,0.00024014173],"about_ca_topic_score_codex":0.00000227083,"about_ca_topic_score_gemma":0.0000022153756,"teacher_disagreement_score":0.28640327,"about_ca_system_score_codex":0.000057032652,"about_ca_system_score_gemma":0.000032155865,"threshold_uncertainty_score":0.9992624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.446424,0.008515953,0.52100354,0.0024462303,0.00086717535,0.0018927313,0.000016605116,0.0019480891,0.016885644],"genre_scores_gemma":[0.9470415,0.000032224143,0.052362815,0.00002460743,0.000011172503,0.00009777397,0.0000017594148,0.000017727272,0.00041041014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983605,0.00017709832,0.00032206665,0.0004607198,0.00034404936,0.00033556164],"domain_scores_gemma":[0.9987134,0.0005520608,0.000032326447,0.00055869546,0.00004314394,0.00010040834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012308953,0.00015888958,0.00024337086,0.00047563686,0.000073812764,0.00022436638,0.00048366122,0.00006249332,0.00002010929],"category_scores_gemma":[0.00013088479,0.00013228862,0.00006540203,0.00088662154,0.000112376685,0.00048328814,0.00023907874,0.00017132946,0.00009468976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000557547,0.000028462535,0.000022789936,0.00059050147,0.00001385689,0.000054401105,0.0015635509,0.000004093165,0.00051913154,0.9896469,0.00018447175,0.007366266],"study_design_scores_gemma":[0.00028750437,0.00003746222,0.00015993249,0.0003584603,0.0000056551517,0.000070507485,0.00024325808,0.25960693,0.0004438211,0.7381956,0.0004390758,0.00015183484],"about_ca_topic_score_codex":0.0000060932402,"about_ca_topic_score_gemma":0.000002892202,"teacher_disagreement_score":0.5006175,"about_ca_system_score_codex":0.000073330775,"about_ca_system_score_gemma":0.000036463764,"threshold_uncertainty_score":0.5394574},"labels":[],"label_agreement":null},{"id":"W4394793007","doi":"10.61091/um119-06","title":"On Constructions of GMGDs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Generalization; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.006881211977921021,"score_gpt":0.21034888816295408,"score_spread":0.20346767618503306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5683057,0.0014339035,0.009801941,0.00004098223,0.0012053382,0.0002381009,0.00006377796,0.0009566188,0.41795367],"genre_scores_gemma":[0.99935746,0.0000044100498,0.0003568834,0.0000029123955,0.000018350866,0.000013796701,0.0000011936027,0.000015299687,0.00022966287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995687,0.000012485665,0.00017643279,0.0000709394,0.00008030258,0.00009113979],"domain_scores_gemma":[0.9995779,0.00019055455,0.000006968312,0.00018791562,0.00000860842,0.000028098135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120453034,0.00007409374,0.000121480676,0.00008358731,0.00001682247,0.000012288669,0.00006205755,0.00003518587,0.00052534626],"category_scores_gemma":[0.000023332059,0.00006162591,0.00006954605,0.00014239087,0.00005747648,0.00003388274,0.000005695145,0.000069120804,0.00031669944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011451893,0.000012060354,0.0000017839417,0.0007989637,0.0000543067,0.000002501754,0.0006061025,0.00009728283,0.0010080766,0.99404216,0.0023471157,0.0010285228],"study_design_scores_gemma":[0.00010032414,0.000058331963,0.00002987665,0.0009000142,0.000051841424,0.000065403634,0.0009134724,0.03612823,0.008479278,0.9458939,0.007197103,0.00018226162],"about_ca_topic_score_codex":3.7921444e-7,"about_ca_topic_score_gemma":2.0206774e-7,"teacher_disagreement_score":0.43105182,"about_ca_system_score_codex":0.000009425171,"about_ca_system_score_gemma":0.000005027606,"threshold_uncertainty_score":0.5752173},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58004904,0.026647246,0.16941024,0.021259475,0.0034754723,0.016469507,0.0011916293,0.007050595,0.1744468],"genre_scores_gemma":[0.9813428,0.00011126284,0.01333386,0.000051305713,0.0001030803,0.0013426455,0.000015708036,0.0000887752,0.0036105842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983018,0.00008702387,0.0005532854,0.0003587798,0.00026418673,0.00043489283],"domain_scores_gemma":[0.99511796,0.0038164984,0.00009998865,0.00076774566,0.00009093412,0.00010690019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010949651,0.00025658926,0.000277643,0.00013208612,0.00057042943,0.00021519471,0.0005085342,0.000114910996,0.00021615787],"category_scores_gemma":[0.00038027103,0.00016309878,0.00033022123,0.00056689786,0.00021135903,0.00012676355,0.000065683525,0.00019067738,0.0001899773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013553271,0.000107159096,0.0000057304424,0.00068051275,0.00011784126,0.0000020407272,0.00060314656,5.3931736e-8,0.00007647737,0.9657595,0.024862492,0.007771486],"study_design_scores_gemma":[0.00014898187,0.00003370764,0.000026423348,0.00018409075,0.00013891827,0.000017193901,0.00077801256,0.0031465467,0.00034564838,0.9406897,0.054301724,0.00018906394],"about_ca_topic_score_codex":0.000001591002,"about_ca_topic_score_gemma":0.000010843436,"teacher_disagreement_score":0.40129372,"about_ca_system_score_codex":0.000024826666,"about_ca_system_score_gemma":0.000049399365,"threshold_uncertainty_score":0.66509753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8798652,0.00096060504,0.09688151,0.003523974,0.000013685407,0.0008857752,0.000020957776,0.0001802801,0.017668007],"genre_scores_gemma":[0.99654233,0.000033888522,0.0023166724,0.00015312036,0.000014580896,0.00011366107,0.000021876946,0.000019389565,0.0007844617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984773,0.000109625784,0.00041014445,0.00052425894,0.00016393329,0.00031474282],"domain_scores_gemma":[0.9979435,0.0013785759,0.000043273976,0.00033999016,0.000051534156,0.00024312618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014267813,0.0002526979,0.0008697185,0.00013778912,0.000101291866,0.000028879156,0.000060623213,0.0002000632,0.00080148986],"category_scores_gemma":[0.0003472385,0.00014508849,0.00013589291,0.0002632955,0.00039018053,0.00010631851,0.00007237725,0.0002459738,0.00007476698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010143621,0.0002596651,0.00021267554,0.0032757134,0.0016660087,0.000020302175,0.0012863091,0.00014081961,0.00047707683,0.9912464,0.0001115807,0.00028911035],"study_design_scores_gemma":[0.0006186038,0.00032911974,0.00019406121,0.00015460873,0.0020642725,0.000039119503,0.000035574438,0.83843815,0.0003025344,0.15767321,0.000010446819,0.00014030498],"about_ca_topic_score_codex":0.0000022512663,"about_ca_topic_score_gemma":0.0000019862582,"teacher_disagreement_score":0.8382973,"about_ca_system_score_codex":0.000022389235,"about_ca_system_score_gemma":0.000033977107,"threshold_uncertainty_score":0.87757516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768834,0.00046429358,0.008561624,0.0029364103,0.0012120082,0.0003621032,0.0000097198135,0.00012087121,0.009449549],"genre_scores_gemma":[0.9989134,0.0000034227087,0.00075206254,0.00015533406,0.0000824479,0.000007924568,1.9257088e-7,0.000009164839,0.000076053715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985622,0.00015439739,0.00031293146,0.0003006641,0.0004322729,0.00023749721],"domain_scores_gemma":[0.9971314,0.0017349279,0.00008579803,0.00095260964,0.000062412735,0.000032863227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032809982,0.00016063149,0.00021532031,0.000028159702,0.00013400735,0.0000563964,0.0015126098,0.00006178174,0.000051091327],"category_scores_gemma":[0.00046481448,0.00006467068,0.00023623247,0.0005569086,0.0003229238,0.000059395134,0.0008104764,0.00039575336,0.000008971451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005911017,0.00006843309,0.000016063583,0.00013783854,0.000047364167,0.0000025772918,0.0031524021,0.000042247997,0.0039419504,0.9791269,0.001030309,0.012428026],"study_design_scores_gemma":[0.00014167147,0.00008640934,0.0016164297,0.0012465658,0.000050715025,0.000051541803,0.00023575597,0.042495046,0.12027247,0.833045,0.0005731158,0.00018526519],"about_ca_topic_score_codex":0.000002006868,"about_ca_topic_score_gemma":0.0000013983644,"teacher_disagreement_score":0.14608186,"about_ca_system_score_codex":0.000025466741,"about_ca_system_score_gemma":0.000055970213,"threshold_uncertainty_score":0.28108305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90786195,0.00030453986,0.02020992,0.0008494705,0.00012087014,0.00057222205,0.00018929079,0.00027412883,0.069617614],"genre_scores_gemma":[0.9963379,0.000008480558,0.0030721873,0.000055625063,0.00001953351,0.000081866994,0.0000070061096,0.000030524916,0.00038690702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987564,0.00012435977,0.00047928302,0.00020926513,0.00025830683,0.00017235868],"domain_scores_gemma":[0.99500895,0.0039037205,0.00011900722,0.0008593702,0.000053912423,0.000055054574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549256,0.00016341795,0.00028884417,0.00014429573,0.00007753017,0.000020016427,0.00037176415,0.00007282564,0.0007109006],"category_scores_gemma":[0.00041427964,0.00010332604,0.00019687317,0.000461067,0.00024108269,0.000065566455,0.000045502697,0.00012438884,0.00003924309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001301112,0.00032817127,8.369062e-7,0.0004468957,0.00007516121,0.0000017028077,0.0017456434,0.0000016837822,0.000698643,0.99486387,0.0012705339,0.00055382797],"study_design_scores_gemma":[0.00006617301,0.000109244174,0.000007665516,0.00029544978,0.00008048229,0.000005003386,0.0007108414,0.0015580044,0.008509546,0.9879495,0.0006120738,0.00009602802],"about_ca_topic_score_codex":0.000004535433,"about_ca_topic_score_gemma":0.000005968603,"teacher_disagreement_score":0.08847593,"about_ca_system_score_codex":0.0000074201175,"about_ca_system_score_gemma":0.000022737062,"threshold_uncertainty_score":0.77838624},"labels":[],"label_agreement":null},{"id":"W4394793044","doi":"10.61091/um119-05","title":"On Decompositions of \\(\\mathbf{K_{18k}}\\) and \\(\\mathbf{K_{18k+1}}\\) into Certain Connected Bicyclic Graphs with Nine Edges","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bicyclic molecule; Combinatorics; Pancyclic graph; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Stereochemistry; Chemistry","score_opus":0.006593700966318909,"score_gpt":0.21395876840731143,"score_spread":0.2073650674409925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976663,0.004048586,0.0031664514,0.00023331489,0.0003043398,0.0007022704,0.000108613654,0.0009701161,0.013803309],"genre_scores_gemma":[0.99748784,0.0000762014,0.0018725655,0.00002898931,0.000035608988,0.00013178338,0.000030416775,0.00009920943,0.0002373979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981375,0.00010494125,0.00063467765,0.0004119853,0.00029931762,0.0004116117],"domain_scores_gemma":[0.99813473,0.00093910104,0.00006692491,0.0006054883,0.00006662931,0.00018712314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040163533,0.0004400905,0.0006330115,0.00050014694,0.00017575448,0.000120028155,0.0002383438,0.00015411893,0.00029976523],"category_scores_gemma":[0.00008924943,0.00034499462,0.0001584721,0.00076354557,0.0003160001,0.00018045247,0.000046529254,0.00027466824,0.000133721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009343443,0.00030844187,0.00010034159,0.007061965,0.0009296883,0.00007299596,0.009451407,0.00029817742,0.020196937,0.9538092,0.0050339294,0.0026434916],"study_design_scores_gemma":[0.002435219,0.0017557527,0.0014948958,0.011250904,0.000981922,0.00064441236,0.005134688,0.07730926,0.035819344,0.8525711,0.008145253,0.002457202],"about_ca_topic_score_codex":0.000026625952,"about_ca_topic_score_gemma":0.000030726438,"teacher_disagreement_score":0.10123804,"about_ca_system_score_codex":0.000042785912,"about_ca_system_score_gemma":0.000029402474,"threshold_uncertainty_score":0.9999002},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31556997,0.00045644992,0.6708143,0.001578902,0.00031750384,0.00031802905,0.000029194542,0.00026353088,0.010652142],"genre_scores_gemma":[0.8086793,9.829247e-7,0.19112404,0.00013206432,0.000023447787,0.000009145188,0.0000020300986,0.000008897492,0.000020101972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846655,0.00014799015,0.00033039637,0.00043921906,0.00041130773,0.0002045406],"domain_scores_gemma":[0.99645686,0.0028868327,0.000050233117,0.00047097052,0.0000429502,0.000092141374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057917676,0.00017465392,0.00027495844,0.00013091955,0.000035040743,0.00010818218,0.00051859376,0.000083685096,0.00017480794],"category_scores_gemma":[0.0008073489,0.00013023432,0.00008938299,0.00028774154,0.00017358312,0.00016172558,0.00020260559,0.00017936615,0.000032103064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013627639,0.000074115655,0.000005720317,0.00024213314,0.0000246964,0.000021179625,0.00041996755,0.000085231426,0.0010655194,0.9782449,0.00050632376,0.01929656],"study_design_scores_gemma":[0.00012964054,0.00008188366,0.0007989662,0.00011712657,0.000011174307,0.000022391947,0.000014821513,0.29594263,0.0048757973,0.69784343,0.000049815706,0.00011228858],"about_ca_topic_score_codex":0.0000029254502,"about_ca_topic_score_gemma":2.4359787e-7,"teacher_disagreement_score":0.49310935,"about_ca_system_score_codex":0.000030385141,"about_ca_system_score_gemma":0.000103031205,"threshold_uncertainty_score":0.5310801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7692976,0.0052441927,0.21157873,0.000672473,0.0004375655,0.0006397134,0.0001345513,0.00037790934,0.011617263],"genre_scores_gemma":[0.92875063,0.00007346771,0.071022995,0.00005204552,0.000012321459,0.000011319671,0.0000019531321,0.000017264563,0.000058029436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834704,0.0000987342,0.00049306644,0.00046697274,0.00030830473,0.00028588795],"domain_scores_gemma":[0.9981723,0.00090371247,0.00012803084,0.0006304743,0.00006250361,0.000102979924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157706,0.0002413174,0.00043408462,0.00035788378,0.00009937185,0.00008166046,0.0004593646,0.00007390414,0.000031664833],"category_scores_gemma":[0.0001275093,0.0001959801,0.00014410747,0.00053657894,0.00043565585,0.00026622417,0.00030180503,0.00015504252,0.0000078570465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014834614,0.00008136932,0.000047990707,0.0013045334,0.00008877225,0.000024766845,0.0023944355,0.000004958402,0.0015537489,0.9610886,0.00018909162,0.033206884],"study_design_scores_gemma":[0.00022843151,0.00020634352,0.0006132985,0.00076043914,0.000044320946,0.000056713823,0.00040806824,0.010256972,0.0018252236,0.98531586,0.00009026266,0.00019405247],"about_ca_topic_score_codex":0.000014546306,"about_ca_topic_score_gemma":0.000002749646,"teacher_disagreement_score":0.159453,"about_ca_system_score_codex":0.000006509195,"about_ca_system_score_gemma":0.00002100662,"threshold_uncertainty_score":0.79918367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30550957,0.00031265133,0.6910496,0.0006111945,0.00019349287,0.00026170886,0.000004142265,0.00027117794,0.0017864563],"genre_scores_gemma":[0.82040733,0.000006642719,0.17934002,0.00009883133,0.000039683287,0.000040823434,0.0000021278252,0.000030589516,0.000033939075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974752,0.0002032253,0.0006040852,0.0006872363,0.00056116004,0.00046907022],"domain_scores_gemma":[0.99809426,0.0010159145,0.000066168046,0.00063969445,0.00006684015,0.00011714905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015011698,0.00028400373,0.0003765752,0.00043493774,0.00009939206,0.0004922326,0.0007894815,0.00007253238,0.000034676475],"category_scores_gemma":[0.00016956496,0.00023778657,0.00009976339,0.0007658936,0.000071981005,0.0012335674,0.00037388416,0.00030843122,0.00017588846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001837096,0.00018260947,0.000120266915,0.00088965864,0.00008678693,0.00025845895,0.012731688,0.053271186,0.00028224214,0.92331755,0.00016865575,0.008672547],"study_design_scores_gemma":[0.00022801624,0.000029403645,0.00010499519,0.00079660246,0.000012330236,0.00006291223,0.00039942953,0.8712409,0.00011771882,0.12670997,0.000050172926,0.00024751446],"about_ca_topic_score_codex":0.0000141014725,"about_ca_topic_score_gemma":0.000008666147,"teacher_disagreement_score":0.81796974,"about_ca_system_score_codex":0.00010811182,"about_ca_system_score_gemma":0.00036918168,"threshold_uncertainty_score":0.96966547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96191394,0.022301534,0.012566266,0.00035086085,0.00037653474,0.000752002,0.000041231746,0.00013782163,0.0015597896],"genre_scores_gemma":[0.9751891,0.00015268529,0.024552455,0.000007791804,0.0000020299506,0.000009292506,0.0000018954256,0.000011887568,0.00007284685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794793,0.000096672185,0.0008331022,0.00046051168,0.00046564915,0.0001961189],"domain_scores_gemma":[0.9977567,0.0007689164,0.00028512086,0.000885045,0.0002439415,0.0000602668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011054155,0.00018317865,0.00060240075,0.000674899,0.000031316184,0.000014271868,0.000351813,0.000053024312,0.000013915889],"category_scores_gemma":[0.00066109607,0.00013729277,0.00017252455,0.0017321607,0.00027241994,0.00015548123,0.00023898414,0.00010757064,0.0000019910708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007869583,0.002009398,0.0025590733,0.02069744,0.0007133058,0.0000121484245,0.011484812,0.00028245983,0.11644414,0.8009914,0.003620883,0.04110625],"study_design_scores_gemma":[0.00038906408,0.0007428752,0.0015485589,0.001766254,0.00017663813,0.000015385544,0.000079627695,0.018351294,0.33212203,0.644469,0.000060061942,0.00027919494],"about_ca_topic_score_codex":0.00003902069,"about_ca_topic_score_gemma":0.0000011218319,"teacher_disagreement_score":0.21567789,"about_ca_system_score_codex":0.0000038372996,"about_ca_system_score_gemma":0.000052277082,"threshold_uncertainty_score":0.5598637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95730764,0.00079890713,0.00052910694,0.0006164974,0.00017773431,0.00066734897,0.00009430241,0.0006754333,0.039133016],"genre_scores_gemma":[0.9959415,0.000029651968,0.002956727,0.000040767674,0.000012241909,0.000089941175,0.0000076049755,0.000051911167,0.000869661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845636,0.000078742094,0.00059944135,0.00031664842,0.0002856203,0.00026321068],"domain_scores_gemma":[0.9972632,0.0018166634,0.00010470237,0.00068603334,0.000043813743,0.0000856085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054704526,0.00022745566,0.00036937496,0.00024097085,0.000090998394,0.00003678087,0.0002895006,0.00011779882,0.00070178916],"category_scores_gemma":[0.00036324607,0.00018073835,0.00028125563,0.0004676945,0.00020812039,0.00011055486,0.000049935345,0.00023255983,0.0005000573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009107297,0.00035405712,0.0000030037952,0.00076344446,0.00014325984,0.0000068915383,0.00088217383,0.000001008777,0.00096635945,0.9904632,0.005433964,0.0009735087],"study_design_scores_gemma":[0.00014265293,0.00007582767,0.000032137134,0.0004484392,0.00013245251,0.000017352535,0.0002225545,0.0007879641,0.0028676267,0.99464846,0.00045686655,0.00016765702],"about_ca_topic_score_codex":0.0000014141119,"about_ca_topic_score_gemma":4.7011724e-7,"teacher_disagreement_score":0.038633842,"about_ca_system_score_codex":0.000021045795,"about_ca_system_score_gemma":0.000033073273,"threshold_uncertainty_score":0.7684099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55433077,0.0018736003,0.39919382,0.0016680108,0.00017506526,0.000529367,0.00017648838,0.0006230827,0.041429788],"genre_scores_gemma":[0.99175346,0.000002144736,0.0031772265,0.00001297352,0.00013969485,0.000055974477,0.000089930545,0.000023220487,0.004745398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998842,0.000043858214,0.00027916295,0.00030617556,0.00018444017,0.00034437428],"domain_scores_gemma":[0.99932456,0.00016451118,0.000037463178,0.00035151467,0.00003678711,0.00008515873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025188978,0.00017953999,0.00022104055,0.000055794135,0.00011900364,0.00013555949,0.00016351145,0.000039685354,0.0019106059],"category_scores_gemma":[0.000017790684,0.00015399982,0.00017656574,0.0002973358,0.000049226932,0.000080775666,0.000045022123,0.00014590612,0.00043511458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006809137,0.0016254237,0.0023892866,0.0020987266,0.002688195,0.000043007174,0.005991324,0.0001970296,0.09604081,0.6643559,0.13628332,0.088218935],"study_design_scores_gemma":[0.0006665392,0.0004857798,0.00040867433,0.0011536959,0.0011982884,0.000039606675,0.0010355718,0.29246294,0.06369546,0.54970175,0.08774265,0.001409031],"about_ca_topic_score_codex":0.00006317209,"about_ca_topic_score_gemma":8.177111e-7,"teacher_disagreement_score":0.43742266,"about_ca_system_score_codex":0.000030215555,"about_ca_system_score_gemma":0.000042040236,"threshold_uncertainty_score":0.9990018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058398284,0.002480059,0.9119156,0.001359454,0.00045220737,0.00048261485,0.000015509488,0.00091199944,0.023984285],"genre_scores_gemma":[0.9227862,0.000011492454,0.076902695,0.000030183293,0.000002171988,0.000030863772,0.0000019412223,0.000008317543,0.00022615338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989613,0.00003397988,0.0003114266,0.0003027141,0.00023412515,0.00015645257],"domain_scores_gemma":[0.99895483,0.00020756545,0.000057107474,0.0005987368,0.00012471611,0.000057017907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033227567,0.00010858519,0.00015855712,0.00008037991,0.00004694508,0.000058164132,0.00036243704,0.000040690546,0.000049461607],"category_scores_gemma":[0.000092009286,0.000084775864,0.000080579484,0.0007232261,0.0001016288,0.00020603166,0.00008786215,0.000078084755,0.00032064167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010941992,0.000066154316,0.000044039076,0.0002643428,0.000021916603,0.0000015006475,0.0017479454,0.000003424321,0.00037620967,0.9919946,0.0008173795,0.0046613975],"study_design_scores_gemma":[0.00007455765,0.000017033373,0.00010985653,0.00029078874,0.000011883279,0.000010917903,0.00006891502,0.08708286,0.0014619959,0.9098144,0.00095597847,0.00010081867],"about_ca_topic_score_codex":0.000008483427,"about_ca_topic_score_gemma":6.4968964e-7,"teacher_disagreement_score":0.86438787,"about_ca_system_score_codex":0.000017443735,"about_ca_system_score_gemma":0.000037517864,"threshold_uncertainty_score":0.41213068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030874306,0.000636493,0.1745197,0.0057319175,0.0005796718,0.0024618197,0.00023064093,0.002830833,0.7821346],"genre_scores_gemma":[0.8577776,0.000026500908,0.12998883,0.00025574918,0.00028294587,0.00045432965,0.0000147020155,0.00018381487,0.011015516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784386,0.000057056517,0.00064961275,0.0005096698,0.0005016282,0.00043815086],"domain_scores_gemma":[0.9959588,0.002564283,0.00009279297,0.0011597248,0.00006260472,0.00016181904],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00083762273,0.00035919284,0.00044975174,0.0001839695,0.00016099613,0.00019283134,0.00043817284,0.00014144382,0.0025570067],"category_scores_gemma":[0.0006891753,0.00026778903,0.0002852599,0.00037120213,0.000117975906,0.00009531104,0.00010727174,0.00032241584,0.0037077344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053019917,0.00032224777,3.9913468e-7,0.000898996,0.000056627177,0.000011858904,0.0017522507,6.404761e-7,0.00025501277,0.8990498,0.095187545,0.0024592977],"study_design_scores_gemma":[0.0001264464,0.00006546793,0.0000030239455,0.00063738826,0.00010248593,0.000030829007,0.0002000245,0.013068567,0.0010714579,0.9296461,0.05476274,0.00028551152],"about_ca_topic_score_codex":0.0000019945128,"about_ca_topic_score_gemma":0.0000029460737,"teacher_disagreement_score":0.8269033,"about_ca_system_score_codex":0.000079356134,"about_ca_system_score_gemma":0.000065753695,"threshold_uncertainty_score":0.9999774},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095849685,0.00012993811,0.8916697,0.0004054114,0.00007291799,0.00039301216,0.00032220676,0.0003215659,0.0108356],"genre_scores_gemma":[0.88130885,0.000004721534,0.11519478,0.000017321114,0.000013033337,0.00011261801,0.00008595357,0.000048243546,0.003214479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979182,0.000060655624,0.00068891014,0.00040532227,0.00065766525,0.00026926087],"domain_scores_gemma":[0.99704176,0.0018143672,0.00019131872,0.0006155353,0.0002403103,0.00009667798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041489434,0.00025030525,0.00052227173,0.0007384221,0.00014033148,0.0000824797,0.00020497973,0.00010800685,0.0007933413],"category_scores_gemma":[0.0008424139,0.00020328914,0.00031579912,0.0014022493,0.00015094562,0.00035495157,0.00005999312,0.0002435861,0.00007109522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040308503,0.00066834304,0.000016342265,0.0007642586,0.0037117025,0.000005380281,0.0011542175,0.019571884,0.0014059294,0.97107005,0.0011854615,0.00040610507],"study_design_scores_gemma":[0.00010868565,0.000026760326,0.00022025674,0.00021119621,0.002334792,0.000007303994,0.00019148564,0.76019794,0.00005646673,0.23642656,0.000060887913,0.00015764587],"about_ca_topic_score_codex":0.000016858752,"about_ca_topic_score_gemma":0.00009632889,"teacher_disagreement_score":0.78545916,"about_ca_system_score_codex":0.00016165168,"about_ca_system_score_gemma":0.00020472262,"threshold_uncertainty_score":0.8686531},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07273318,0.00022744318,0.92323714,0.0009841623,0.0005773359,0.0006166411,0.000010417263,0.0004349083,0.0011787561],"genre_scores_gemma":[0.5747568,6.568704e-7,0.4244687,0.00014626708,0.0001150869,0.000076567616,0.0000010120593,0.000021249642,0.00041366473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860483,0.000032590946,0.00025701724,0.0005182912,0.00020857423,0.00037869497],"domain_scores_gemma":[0.99894124,0.00025499452,0.000027116024,0.00059675094,0.00005192233,0.00012799687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075542566,0.00016988115,0.00019549092,0.00016439197,0.0001532478,0.00030818532,0.000663357,0.00004161508,0.000027204289],"category_scores_gemma":[0.00018494202,0.0001411829,0.00013296894,0.0005289206,0.00004569046,0.0004520358,0.00022799826,0.000095124786,0.00017791391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004130707,0.000054419736,0.0000028784539,0.00045164395,0.000027092598,0.000009567838,0.0031537332,0.000016078127,0.0017070889,0.9849406,0.0005974732,0.009035289],"study_design_scores_gemma":[0.00009427365,0.00009190836,0.00002922658,0.00028038118,0.000026859621,0.000046552846,0.00012250092,0.22409709,0.003729892,0.76818466,0.003056605,0.00024003893],"about_ca_topic_score_codex":0.0000014663873,"about_ca_topic_score_gemma":3.0804105e-7,"teacher_disagreement_score":0.50202364,"about_ca_system_score_codex":0.00003060692,"about_ca_system_score_gemma":0.000043034936,"threshold_uncertainty_score":0.57572716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15816571,0.0019541977,0.6982049,0.015483589,0.0008654602,0.00076771405,0.000039234754,0.00095333334,0.123565875],"genre_scores_gemma":[0.9978344,0.0000024603903,0.0017750425,0.00016919777,0.000022271404,0.000019345982,4.312609e-7,0.0000078350495,0.00016903126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912953,0.00007223579,0.00018604047,0.00022512388,0.00022605293,0.00016103669],"domain_scores_gemma":[0.9983407,0.000828167,0.00003344781,0.0007385354,0.00002162622,0.00003751326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305001,0.000117527525,0.00014229723,0.00011848503,0.000069545495,0.00009047164,0.0007021903,0.000041376275,0.0002463717],"category_scores_gemma":[0.00008545822,0.00006581995,0.0001427696,0.00062351354,0.00012054248,0.000091110676,0.00014083648,0.00015635708,0.000082640174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004324186,0.000050424056,0.0000070687192,0.0001132355,0.000033567892,0.000004792198,0.002157975,0.0000027119074,0.000078036624,0.982412,0.0025125844,0.012623283],"study_design_scores_gemma":[0.000054220352,0.00011482514,0.00014056591,0.00025809254,0.000013360186,0.000010416259,0.00010728117,0.027296908,0.0013376251,0.9641279,0.006436927,0.00010190666],"about_ca_topic_score_codex":0.0000011591105,"about_ca_topic_score_gemma":5.6247956e-7,"teacher_disagreement_score":0.8396687,"about_ca_system_score_codex":0.000007971003,"about_ca_system_score_gemma":0.000024335503,"threshold_uncertainty_score":0.2697597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98363984,0.0019210139,0.00032445267,0.00018827105,0.00020647701,0.00045127486,0.00012002758,0.00014290806,0.0130057465],"genre_scores_gemma":[0.9752628,0.00004780927,0.024364477,0.0000101299875,0.000027441774,0.000013849913,0.0000032166233,0.000039382972,0.00023084787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984401,0.0000871435,0.0006284596,0.00030199176,0.00029944666,0.00024285246],"domain_scores_gemma":[0.99822265,0.0008618852,0.00013669045,0.0006131937,0.00009288115,0.00007270032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899411,0.00021953507,0.0005551564,0.00014088074,0.000075614174,0.000023241197,0.00020498964,0.00008360636,0.00025700405],"category_scores_gemma":[0.00043336613,0.00016255376,0.00014692062,0.0003221163,0.00050916005,0.000096739685,0.000119841076,0.00013518141,0.000009486942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013919827,0.00007385673,0.0003401094,0.005118852,0.00018212704,0.000005858028,0.005758372,1.4019595e-7,0.0016297431,0.98451346,0.0015450729,0.0008184603],"study_design_scores_gemma":[0.00014804986,0.000043331995,0.00058272446,0.00054548174,0.0001694583,0.000076637916,0.00038082383,0.00040386853,0.003960029,0.9928104,0.0007190213,0.00016012756],"about_ca_topic_score_codex":0.0000060808056,"about_ca_topic_score_gemma":0.0000017265808,"teacher_disagreement_score":0.024040025,"about_ca_system_score_codex":0.000009144965,"about_ca_system_score_gemma":0.000027518427,"threshold_uncertainty_score":0.662875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97328585,0.0038309707,0.011711503,0.00094545656,0.001177251,0.0004709429,0.000017636223,0.0009018045,0.007658553],"genre_scores_gemma":[0.9673197,0.0000074516815,0.032087076,0.000041836334,0.000006818389,0.000023805716,0.0000016241574,0.000017571358,0.000494095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829346,0.00005023518,0.0005155272,0.00039694627,0.00042819174,0.00031565758],"domain_scores_gemma":[0.9987351,0.0002728583,0.00007594641,0.00073251466,0.000054975066,0.0001286341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005230093,0.00019530114,0.00032796073,0.00022660813,0.000067981906,0.00012227896,0.00043382027,0.000073657044,0.00012506597],"category_scores_gemma":[0.00010429002,0.00015547691,0.00022322529,0.0005753223,0.00015063479,0.00042637085,0.00020049566,0.00013088719,0.00036163058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001873164,0.00011427658,0.000004081033,0.00074365403,0.00006371014,0.000020143674,0.0018320462,0.000006835733,0.002434315,0.9903913,0.0020357105,0.0023520512],"study_design_scores_gemma":[0.00020103774,0.00010121341,0.00006592884,0.0005300276,0.000036790505,0.00013846956,0.00011993292,0.08542157,0.002708071,0.9103947,0.000069150265,0.00021305474],"about_ca_topic_score_codex":0.000011426624,"about_ca_topic_score_gemma":2.7754518e-7,"teacher_disagreement_score":0.08541473,"about_ca_system_score_codex":0.00001976485,"about_ca_system_score_gemma":0.00007215405,"threshold_uncertainty_score":0.63401645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03136504,0.0004890511,0.96064717,0.002695551,0.00040679448,0.0003218671,0.000013549869,0.00070960686,0.0033513673],"genre_scores_gemma":[0.6209829,0.0000037211869,0.3779606,0.0003135618,0.00006708078,0.000032417596,0.0000069498637,0.000031996708,0.000600774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723613,0.00040369702,0.000521778,0.00074820535,0.0006370085,0.00045318203],"domain_scores_gemma":[0.9970459,0.0018670318,0.000061626735,0.0006974567,0.000090069,0.00023791309],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021876507,0.00028248967,0.0003788597,0.00038370263,0.00021478125,0.00057570165,0.0010152892,0.00005648547,0.00022486481],"category_scores_gemma":[0.00089788076,0.00025569764,0.00017887968,0.0013122951,0.000045454173,0.0007178956,0.00082873116,0.00040177157,0.0007809173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029363066,0.00054893666,0.0006031437,0.001573885,0.0004935621,0.0003326296,0.031092936,0.027076392,0.0016553792,0.7572405,0.006192664,0.17316061],"study_design_scores_gemma":[0.00008138149,0.000036106536,0.0005616078,0.0001616464,0.000025245841,0.000030545434,0.000055192122,0.7994391,0.0003886637,0.19588828,0.0030824621,0.00024981282],"about_ca_topic_score_codex":0.000044869004,"about_ca_topic_score_gemma":0.000011773908,"teacher_disagreement_score":0.77236265,"about_ca_system_score_codex":0.000115316776,"about_ca_system_score_gemma":0.00014250388,"threshold_uncertainty_score":0.9999971},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45643598,0.0044094673,0.15642722,0.0003668234,0.0005515432,0.001117565,0.00012131324,0.0011363864,0.37943372],"genre_scores_gemma":[0.98789746,0.000009280166,0.010980431,0.000017883503,0.00021719112,0.000034876128,0.000021839409,0.000035435114,0.0007856249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866813,0.000046987516,0.00046979837,0.0002829089,0.0002169379,0.00031523404],"domain_scores_gemma":[0.9989972,0.00030834152,0.00008572852,0.0004928299,0.000052245723,0.00006362477],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037389697,0.00019626538,0.00038596246,0.00005517783,0.0000643672,0.00006654954,0.00023808856,0.000039911767,0.008006276],"category_scores_gemma":[0.000009972771,0.0001716102,0.0003656499,0.0005920202,0.000072942545,0.00010202303,0.00011626311,0.00017241522,0.00046706296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007793728,0.00014975418,0.0094217,0.0002117689,0.0005381409,0.0000025121412,0.00059515226,0.00014289157,0.000097411335,0.90497005,0.07497208,0.008890759],"study_design_scores_gemma":[0.000106504216,0.000022405093,0.00035185757,0.00056017214,0.0002393143,0.0000021431308,0.00014771102,0.04513179,0.0004008111,0.93860525,0.014165926,0.00026610063],"about_ca_topic_score_codex":0.000039244926,"about_ca_topic_score_gemma":0.0000012728287,"teacher_disagreement_score":0.5314615,"about_ca_system_score_codex":0.000018130144,"about_ca_system_score_gemma":0.000042424243,"threshold_uncertainty_score":0.99290055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30201334,0.0020411545,0.39021987,0.0011919157,0.0005600236,0.0015909369,0.00027023233,0.0014918773,0.30062068],"genre_scores_gemma":[0.94707644,0.000029909761,0.045666654,0.000021952237,0.00008697373,0.0001137308,0.000009285964,0.000050712613,0.006944334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982768,0.00004834374,0.000785816,0.0002455628,0.00037579177,0.00026763373],"domain_scores_gemma":[0.9973779,0.0018377732,0.00011092143,0.0005011595,0.00009202002,0.00008023071],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007210976,0.00018822555,0.0003970331,0.0001144014,0.000076071694,0.000071919036,0.00022502059,0.00008706076,0.0022429205],"category_scores_gemma":[0.00063222455,0.00015581137,0.0002072874,0.00027449307,0.00019393628,0.0001608373,0.000078218465,0.00014006117,0.00027097546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024327226,0.000111508845,0.0000038065907,0.0039497223,0.000072088296,0.0000024414069,0.0024059664,6.398493e-7,0.0004504816,0.9848472,0.007843805,0.00030994683],"study_design_scores_gemma":[0.00007861402,0.000024063218,0.000005766521,0.00067155855,0.000114105685,0.000019684494,0.0024915782,0.0072193067,0.0012948792,0.98606414,0.001859047,0.00015727544],"about_ca_topic_score_codex":0.000013101487,"about_ca_topic_score_gemma":0.0000034379536,"teacher_disagreement_score":0.6450631,"about_ca_system_score_codex":0.00004239637,"about_ca_system_score_gemma":0.00004490368,"threshold_uncertainty_score":0.99866915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9625825,0.009626202,0.0070475615,0.00072213926,0.0008887301,0.0006480097,0.00018792565,0.0012733175,0.017023608],"genre_scores_gemma":[0.9941252,0.000081710525,0.0038280934,0.00009599753,0.00008232686,0.000028945371,0.000011743736,0.000046583704,0.001699434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953119,0.0009094244,0.0011530031,0.0009622384,0.001207358,0.0004560681],"domain_scores_gemma":[0.9834869,0.01468338,0.00018822211,0.0011500937,0.00028571297,0.00020570093],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008060904,0.0003601166,0.0007895746,0.0007937147,0.0002371132,0.0002521514,0.0006815864,0.00019079937,0.0014942364],"category_scores_gemma":[0.015083709,0.0002457485,0.00030872622,0.0018809054,0.0006370094,0.00036076922,0.00033512572,0.00031286932,0.0002642881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007143028,0.00059116865,0.0010050315,0.0014252871,0.0005430958,0.000098221266,0.038835693,0.000027590455,0.022714376,0.7022977,0.02956413,0.20218343],"study_design_scores_gemma":[0.00027249104,0.000115346724,0.0010511556,0.0004890762,0.00011951202,0.000063976084,0.0033064904,0.010440975,0.0014398033,0.9783309,0.004038976,0.00033128873],"about_ca_topic_score_codex":0.000012277544,"about_ca_topic_score_gemma":0.000008000692,"teacher_disagreement_score":0.27603322,"about_ca_system_score_codex":0.000024942214,"about_ca_system_score_gemma":0.00009627457,"threshold_uncertainty_score":0.99999946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020955259,0.0019135238,0.955734,0.0006014833,0.00019449121,0.0003144742,0.000018635219,0.00052370265,0.019744439],"genre_scores_gemma":[0.88075596,0.000014255249,0.11873126,0.000014295874,0.000013815883,0.000022119222,0.0000010925484,0.000012802507,0.00043438395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986035,0.00008158029,0.00027911455,0.00033744005,0.00041525296,0.00028309654],"domain_scores_gemma":[0.99831444,0.00059008895,0.000032447486,0.00090570777,0.00006600524,0.000091302354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006978462,0.0001232576,0.00020560858,0.00024299754,0.000047884812,0.00007767617,0.00088600564,0.000045660512,0.00013581858],"category_scores_gemma":[0.0001884034,0.00009956784,0.00014017186,0.00088037434,0.00018809698,0.00034120408,0.00029651495,0.00016679593,0.00013363665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024346696,0.00007822064,0.000007730375,0.00035631168,0.000032126543,0.0000150856085,0.0007873335,0.0000015887707,0.0005577911,0.98284,0.0004185638,0.014902826],"study_design_scores_gemma":[0.00006364833,0.000056056964,0.0000654987,0.00014434666,0.0000069466414,0.000017898801,0.0000635036,0.029087897,0.004247728,0.96492213,0.0012263333,0.00009803357],"about_ca_topic_score_codex":0.0000021218668,"about_ca_topic_score_gemma":8.603116e-7,"teacher_disagreement_score":0.8598007,"about_ca_system_score_codex":0.000017587154,"about_ca_system_score_gemma":0.000061433966,"threshold_uncertainty_score":0.4060259},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8604911,0.0036940656,0.03732068,0.0038786675,0.0012760384,0.0011713493,0.00004442108,0.0017917024,0.09033198],"genre_scores_gemma":[0.95251507,0.000020780259,0.046753075,0.00007359835,0.0000050950725,0.000027370843,0.0000014929553,0.000017174114,0.0005863551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983839,0.000053331667,0.00043861507,0.00042142288,0.00036070825,0.00034206704],"domain_scores_gemma":[0.998726,0.00032125757,0.000061986444,0.00073030096,0.00008568887,0.0000747813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087447,0.00016625281,0.00024325225,0.00016644233,0.00011012864,0.0001650819,0.00046191193,0.000059390855,0.000030470756],"category_scores_gemma":[0.00017022454,0.00011787402,0.000110652494,0.0005671424,0.00014342494,0.00021155378,0.00021600044,0.00012824812,0.00028179193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000446146,0.0002902705,0.000008787501,0.0008491817,0.000117199066,0.0000276265,0.015269339,0.0002991213,0.015216438,0.9552362,0.0044880006,0.008153225],"study_design_scores_gemma":[0.0008592822,0.0008157841,0.00010042316,0.0023546459,0.0000597986,0.000026312367,0.0009550522,0.15991102,0.047054462,0.7819858,0.005311541,0.000565845],"about_ca_topic_score_codex":0.000017783777,"about_ca_topic_score_gemma":0.0000013794192,"teacher_disagreement_score":0.17325036,"about_ca_system_score_codex":0.000014305199,"about_ca_system_score_gemma":0.00006788935,"threshold_uncertainty_score":0.48067632},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85982037,0.0009792354,0.0006933718,0.00015470169,0.000010160276,0.000120266544,0.00001349346,0.000048735605,0.13815968],"genre_scores_gemma":[0.9986809,0.000023475473,0.0007994164,0.000044916545,0.000011271277,0.000038435515,0.000018444345,0.000014879758,0.00036828086],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919975,0.000005171017,0.00030401695,0.0002317904,0.00010013235,0.00015913285],"domain_scores_gemma":[0.9992116,0.00012233724,0.0000949534,0.0005112545,0.000003332724,0.000056510795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006454519,0.00016659945,0.00029125373,0.00004733452,0.00004898151,0.000018113851,0.00022064187,0.0001208848,0.00006839521],"category_scores_gemma":[0.000023413391,0.00013250287,0.00008416295,0.00013855142,0.00014180911,0.000023657569,0.00007623383,0.00011647202,0.000004014376],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076759556,0.00022107034,0.00016739214,0.0013842767,0.00032801056,0.0000016816828,0.0015067442,4.3295483e-7,0.93938804,0.041995347,0.00017370176,0.014756572],"study_design_scores_gemma":[0.00085215125,0.000010814334,0.00010240683,0.00032665487,0.000104482046,0.000014243948,0.0005424876,0.005731209,0.36759555,0.62178755,0.0026969118,0.00023552205],"about_ca_topic_score_codex":0.0000121527755,"about_ca_topic_score_gemma":0.000002277947,"teacher_disagreement_score":0.5797922,"about_ca_system_score_codex":0.000015107917,"about_ca_system_score_gemma":0.0000225425,"threshold_uncertainty_score":0.54033107},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8156937,0.00011370871,0.15864928,0.0032398086,0.00064346817,0.0005460363,0.000014210844,0.00022268886,0.020877143],"genre_scores_gemma":[0.99625134,0.0000053222234,0.0027251274,0.00043714137,8.867049e-7,0.000014403939,0.0000012955581,0.0000036039394,0.0005608925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00005376861,0.00027401317,0.00019010605,0.00019928454,0.00013065498],"domain_scores_gemma":[0.9988757,0.00011392308,0.000111163514,0.00080858875,0.00006782152,0.000022844904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025928294,0.00009229217,0.00013804843,0.00009480403,0.000098838886,0.00003294804,0.0005520058,0.000034529054,0.000009567597],"category_scores_gemma":[0.00011166625,0.000059362468,0.00007809,0.0006812015,0.00008645332,0.00008535792,0.00012374857,0.00007391495,0.000018750696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024446415,0.00007425051,0.00012728115,0.0000772173,0.000009918945,1.6783977e-7,0.0002890536,0.000004281694,0.006918391,0.9906143,0.0001465797,0.0017360951],"study_design_scores_gemma":[0.00018336672,0.000030170373,0.0051791063,0.00045707863,0.000012651089,8.4711087e-7,0.000014298777,0.013492858,0.0151328305,0.9645124,0.00089072913,0.00009363439],"about_ca_topic_score_codex":0.0000017902258,"about_ca_topic_score_gemma":6.107525e-7,"teacher_disagreement_score":0.18055767,"about_ca_system_score_codex":0.000008106729,"about_ca_system_score_gemma":0.000032473505,"threshold_uncertainty_score":0.24207312},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19468985,0.00020235249,0.7114317,0.00080023875,0.0003030019,0.00072000426,0.0000057513353,0.00026705413,0.09158007],"genre_scores_gemma":[0.97156066,0.000005501857,0.027507706,0.000047503214,0.0000025938516,0.00005619887,4.907123e-7,0.0000070629985,0.000812303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863684,0.00010862518,0.00037812925,0.0003323887,0.00025695324,0.000287053],"domain_scores_gemma":[0.998475,0.00040877928,0.00010549239,0.00079840876,0.0001474655,0.000064854656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081757,0.00013762247,0.00027696657,0.0004385429,0.00009191613,0.000043132113,0.0009472125,0.000058515365,0.000048802198],"category_scores_gemma":[0.0004181455,0.00012164629,0.00011972691,0.0010807044,0.00019453453,0.00033625762,0.0004782979,0.00016109963,0.000036627476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025954778,0.00010456495,0.000060044997,0.00021773657,0.000040675128,0.0000060216566,0.0004875874,0.0000018882738,0.0022395886,0.9928355,0.0001959288,0.0037844905],"study_design_scores_gemma":[0.00032779877,0.0000946643,0.00040376835,0.00017417187,0.000011082697,0.000009912356,0.00026243195,0.0061184713,0.023163434,0.9688581,0.000470255,0.0001058598],"about_ca_topic_score_codex":0.000006594192,"about_ca_topic_score_gemma":0.0000024069582,"teacher_disagreement_score":0.7768708,"about_ca_system_score_codex":0.000054354576,"about_ca_system_score_gemma":0.00006425118,"threshold_uncertainty_score":0.49605918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19693947,0.0041946946,0.71743715,0.013897332,0.0036887128,0.0027442833,0.000022510545,0.0016394076,0.05943643],"genre_scores_gemma":[0.9503269,0.000054856384,0.04500677,0.0009885837,0.000009488193,0.00016417644,0.0000017370907,0.000016605562,0.0034308506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867857,0.000037435133,0.00036261283,0.00032764958,0.00021494995,0.00037878088],"domain_scores_gemma":[0.99806774,0.00087439973,0.00008262963,0.0008288509,0.000085926804,0.00006043893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080214324,0.00015314022,0.00019431897,0.00007338653,0.00054710644,0.00027963656,0.000773301,0.00004716113,0.0000130089475],"category_scores_gemma":[0.0003704731,0.00010416279,0.00016269393,0.0003836447,0.00009327988,0.00025825895,0.0002524018,0.00010512244,0.00014673077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047419294,0.00004118096,0.00004702541,0.00008648371,0.000037771515,5.147771e-7,0.00020753311,0.000017768167,0.00017915916,0.9893189,0.0069940537,0.0030648604],"study_design_scores_gemma":[0.0002969926,0.000014763294,0.00004286653,0.000105591396,0.000017401911,0.0000042390757,0.00004753648,0.04564106,0.0007829727,0.9404524,0.012478832,0.00011535282],"about_ca_topic_score_codex":0.000004083931,"about_ca_topic_score_gemma":7.398415e-7,"teacher_disagreement_score":0.75338745,"about_ca_system_score_codex":0.000019105442,"about_ca_system_score_gemma":0.000055507782,"threshold_uncertainty_score":0.42476353},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39525098,0.000023422434,0.045033637,0.0024140645,0.00006360812,0.0004282078,0.000035853227,0.00009560798,0.55665463],"genre_scores_gemma":[0.9926729,2.0791603e-7,0.005339996,0.00013567916,0.0000270946,0.00016499417,0.000011280353,0.000003949021,0.0016438655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938107,0.000013838777,0.00019672365,0.00016314596,0.00007680606,0.00016844613],"domain_scores_gemma":[0.99940455,0.00019783794,0.000043002612,0.00027708866,0.000036137542,0.000041385894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010846399,0.000081210346,0.00012409114,0.00004855176,0.00027450552,0.000048635975,0.00018855663,0.000015628955,0.0008971626],"category_scores_gemma":[0.0000117156305,0.00007326201,0.00006938647,0.00029918944,0.00008578555,0.000065642205,0.00006324188,0.00007115034,0.0003360209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.562837e-7,0.00014046869,0.00081367436,0.000013788081,0.000020327527,9.607122e-8,0.00022671287,0.0000082236065,0.0021916628,0.990619,0.00261815,0.003347026],"study_design_scores_gemma":[0.00038290318,0.000025231475,0.003771496,0.00013737638,0.0000837355,8.480264e-7,0.002695469,0.015570251,0.007135837,0.9515999,0.018355455,0.00024148001],"about_ca_topic_score_codex":0.000016504197,"about_ca_topic_score_gemma":0.0000012639649,"teacher_disagreement_score":0.59742194,"about_ca_system_score_codex":0.00001229813,"about_ca_system_score_gemma":0.000040190556,"threshold_uncertainty_score":0.9823301},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5065447,0.009168834,0.33231676,0.00785072,0.0022805159,0.0016453298,0.000010241627,0.0016697665,0.1385131],"genre_scores_gemma":[0.9066651,0.000029508028,0.09128384,0.00031964513,0.0000012967296,0.000007858353,0.0000014909698,0.000008377429,0.0016828858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864113,0.000048458834,0.00046046832,0.000329281,0.00026368024,0.00025695513],"domain_scores_gemma":[0.9985804,0.0001795177,0.00011728865,0.00089989265,0.00015642615,0.0000664875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052575016,0.00015391609,0.0002923453,0.00025220064,0.00007387178,0.000044206503,0.0007313016,0.0000785275,0.000036109177],"category_scores_gemma":[0.00026736225,0.00012725666,0.00010128393,0.0010458379,0.00011614482,0.00013224733,0.0001831249,0.00012275964,0.00013778813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037524212,0.00014480019,0.00007813944,0.00017727194,0.00004033753,0.0000017920898,0.0007658202,0.0000050917565,0.003206292,0.98728627,0.0045813713,0.0037090892],"study_design_scores_gemma":[0.00026617176,0.00006330937,0.000100304664,0.000218161,0.00002456774,0.0000036558763,0.00006884785,0.017843923,0.0064695533,0.9735588,0.0012490837,0.00013363888],"about_ca_topic_score_codex":0.000010929795,"about_ca_topic_score_gemma":4.8306634e-7,"teacher_disagreement_score":0.40012038,"about_ca_system_score_codex":0.000010118118,"about_ca_system_score_gemma":0.00007879011,"threshold_uncertainty_score":0.5189376},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7209649,0.0002235077,0.27050695,0.00086998404,0.00014902251,0.0011661839,0.000026746658,0.00022949305,0.0058631715],"genre_scores_gemma":[0.9562121,0.000009760367,0.04326519,0.00006837128,0.0000039801516,0.00007530366,0.0000015808804,0.000011335956,0.00035239608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695027,0.0004205016,0.0006634362,0.00092972105,0.0005478761,0.00048818107],"domain_scores_gemma":[0.9945346,0.0022810292,0.00012945294,0.002676529,0.00020823338,0.00017014709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017074572,0.00027068506,0.0005301573,0.0003292835,0.00017229308,0.00006517024,0.0012932548,0.000104362516,0.00010196454],"category_scores_gemma":[0.002283115,0.00023105474,0.00018757906,0.0010307224,0.0008566164,0.00035579316,0.0011005448,0.00021080168,0.000019362895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000395923,0.00089752785,0.013513942,0.0004983808,0.00004415061,0.000003532346,0.0007126748,0.000009193338,0.0009602937,0.977319,0.00028817105,0.005713539],"study_design_scores_gemma":[0.00075032265,0.000084493055,0.017823793,0.00013136205,0.000016836819,0.000004549419,0.0002811833,0.023951288,0.013133562,0.94344854,0.00016142291,0.00021262796],"about_ca_topic_score_codex":0.000054413053,"about_ca_topic_score_gemma":0.00003843315,"teacher_disagreement_score":0.23524715,"about_ca_system_score_codex":0.000051418065,"about_ca_system_score_gemma":0.00007677687,"threshold_uncertainty_score":0.9422139},"labels":[],"label_agreement":null},{"id":"W4408928583","doi":"10.61091/um122-08","title":"Tactical decomposable regular group divisible designs and their threshold schemes","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Arithmetic; Discrete mathematics","score_opus":0.013757782278056983,"score_gpt":0.22742380261366799,"score_spread":0.213666020335611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408928583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70166385,0.007310474,0.17312677,0.0001961548,0.00042992688,0.00079215213,0.000019493993,0.0010431021,0.1154181],"genre_scores_gemma":[0.99575573,0.000027122598,0.003725785,0.00003177999,0.000019313682,0.00005343533,0.00000325136,0.000025330259,0.0003582267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990649,0.000039849692,0.00028761674,0.00021079498,0.000093337556,0.00030349893],"domain_scores_gemma":[0.99914443,0.00029635266,0.000018876573,0.00043870677,0.00001686018,0.00008474287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041926024,0.00021387398,0.00032002936,0.0001071256,0.00011503364,0.00007326981,0.00018083089,0.00010289072,0.0001252171],"category_scores_gemma":[0.000052211748,0.0001701987,0.000081065846,0.00021422547,0.00010056759,0.00013515564,0.000063880725,0.00014513037,0.000046032208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013978415,0.00009995528,0.00035744475,0.0012353215,0.00021903182,0.0000044537533,0.0005962067,0.000046260924,0.009623677,0.9827039,0.0032762974,0.0018234296],"study_design_scores_gemma":[0.00057103345,0.000063843174,0.00031460862,0.0006723689,0.00008230776,0.00002818306,0.0014361921,0.07827644,0.025854457,0.8737745,0.01846105,0.00046496216],"about_ca_topic_score_codex":0.0000010039156,"about_ca_topic_score_gemma":0.0000011947747,"teacher_disagreement_score":0.29409194,"about_ca_system_score_codex":0.000020993053,"about_ca_system_score_gemma":0.0000073276938,"threshold_uncertainty_score":0.6940502},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070423023,0.00040129002,0.89476293,0.004868401,0.0009235011,0.0003283923,0.000013398123,0.00034132155,0.09131849],"genre_scores_gemma":[0.97664064,0.0000033342305,0.022017522,0.000268981,0.000013309045,0.000040250303,0.0000046448336,0.000006572434,0.001004734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984606,0.000086402615,0.00043086227,0.00039773714,0.00030824987,0.00031615837],"domain_scores_gemma":[0.9984871,0.0004339703,0.000051260336,0.0007974373,0.0001469676,0.000083235405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905767,0.0001591507,0.0002710233,0.00013141886,0.00015812083,0.00018922107,0.0006918037,0.00009464342,0.000051290957],"category_scores_gemma":[0.0006277969,0.00014006309,0.000115413095,0.0005696507,0.000069039954,0.00032329126,0.00015065314,0.000120303,0.00018990909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059232375,0.00013269775,0.0000053605067,0.00017764456,0.000016315782,0.000017158212,0.00026789668,0.0000013763332,0.00029810748,0.97803706,0.008113458,0.01292701],"study_design_scores_gemma":[0.00050976884,0.000048895297,0.00059367745,0.00043347475,0.000027495484,0.00005334928,0.0001260641,0.20612513,0.0008721783,0.75801563,0.032913398,0.00028093831],"about_ca_topic_score_codex":0.000006410976,"about_ca_topic_score_gemma":0.0000023406274,"teacher_disagreement_score":0.96959835,"about_ca_system_score_codex":0.000046952482,"about_ca_system_score_gemma":0.000058936424,"threshold_uncertainty_score":0.5711607},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004744681,0.000041735835,0.9721216,0.00042816155,0.00018704054,0.0002258061,0.0000027978017,0.00023760668,0.02201058],"genre_scores_gemma":[0.6409093,0.0000017557928,0.35869354,0.00006623008,0.000007027523,0.000017010329,0.0000012083932,0.000009638714,0.00029428708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864936,0.000031602445,0.00046461404,0.00029305337,0.00029741527,0.0002639535],"domain_scores_gemma":[0.99738795,0.0013790757,0.000073186755,0.0009777591,0.000114423456,0.00006762913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029328585,0.00016537233,0.00030507377,0.00018107562,0.00007058221,0.000033948538,0.00072110596,0.00007293696,0.00002789139],"category_scores_gemma":[0.0015451256,0.00014599245,0.000085207925,0.00062534405,0.00008967745,0.0001394928,0.0002191297,0.0001591489,0.00009131488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003853194,0.00016629172,0.0000012221744,0.00018835206,0.000025330835,0.0000012641455,0.00023479907,0.0034154926,0.0006631208,0.99421847,0.000075168704,0.0010066289],"study_design_scores_gemma":[0.00011418943,0.000040136085,0.000014444364,0.00017809258,0.000010222169,0.0000011263356,0.000019408448,0.5109722,0.00057899294,0.48790908,0.00008215838,0.00007992213],"about_ca_topic_score_codex":9.156382e-7,"about_ca_topic_score_gemma":5.3144043e-7,"teacher_disagreement_score":0.6361646,"about_ca_system_score_codex":0.000079163714,"about_ca_system_score_gemma":0.00006850798,"threshold_uncertainty_score":0.59533995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023381306,0.00018005844,0.79476386,0.0024629452,0.00040332085,0.0028388484,0.00016220279,0.00048230085,0.17532513],"genre_scores_gemma":[0.6630572,0.00001795393,0.305206,0.0008459314,0.00009173386,0.0007570585,0.000039887036,0.00013458848,0.029849648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973682,0.000066788554,0.0009866973,0.00052015,0.00037217804,0.0006859481],"domain_scores_gemma":[0.99472386,0.0036459067,0.00021599163,0.0010511089,0.00019455576,0.00016855204],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013124305,0.0004071155,0.00087670283,0.00023346236,0.00024455733,0.000121730714,0.00055322447,0.00021415084,0.0013322062],"category_scores_gemma":[0.003715277,0.00034420847,0.0003844153,0.00037259352,0.00014961578,0.00014546305,0.00018521246,0.00020207312,0.0002391034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028936323,0.00054811797,0.000015418775,0.002347097,0.00015052808,0.00000406678,0.000293577,0.0000018096808,0.0001638493,0.9771742,0.018474486,0.0007978921],"study_design_scores_gemma":[0.0008119849,0.00007194006,0.000027568878,0.00047406487,0.00016093306,0.000009508304,0.00014802311,0.037348814,0.00042281215,0.9553105,0.004897674,0.00031616553],"about_ca_topic_score_codex":0.0000029936486,"about_ca_topic_score_gemma":0.000004178984,"teacher_disagreement_score":0.6396759,"about_ca_system_score_codex":0.00010316208,"about_ca_system_score_gemma":0.000087673136,"threshold_uncertainty_score":0.999901},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04879087,0.0011635276,0.8266101,0.0013985649,0.0012335217,0.0023267209,0.000104233965,0.00065073796,0.117721744],"genre_scores_gemma":[0.45909506,0.000048042177,0.4896276,0.00093724875,0.00027185524,0.0013492352,0.000054033997,0.00014194932,0.048474967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983474,0.00023523445,0.00052109704,0.00034415923,0.00012857173,0.0004235424],"domain_scores_gemma":[0.9914609,0.007540077,0.00013319473,0.00070873834,0.000086851156,0.00007019401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012904728,0.00026466514,0.00055963657,0.00014413134,0.00024648142,0.000022015412,0.0003568758,0.0002019254,0.0006055177],"category_scores_gemma":[0.0051847287,0.00021912216,0.0002765218,0.00018498038,0.00027282443,0.000083675244,0.000091701855,0.00015584486,0.00005886072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013405721,0.000195102,0.0000017918219,0.000438869,0.00023737796,0.0000023968541,0.0007414517,6.0621227e-7,0.00014797121,0.98683196,0.0063788346,0.0036830874],"study_design_scores_gemma":[0.0034687845,0.00009489387,0.0000042164916,0.0000891912,0.00029653267,0.000002951908,0.0010671391,0.00026236,0.0017355839,0.98546404,0.007316929,0.0001973585],"about_ca_topic_score_codex":5.912716e-7,"about_ca_topic_score_gemma":0.000004205055,"teacher_disagreement_score":0.4103042,"about_ca_system_score_codex":0.00005464511,"about_ca_system_score_gemma":0.00007130234,"threshold_uncertainty_score":0.8935542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232675,0.0018833979,0.11258657,0.0027319633,0.001725226,0.0009772547,0.000025171717,0.00095416396,0.15584877],"genre_scores_gemma":[0.9491394,0.0000066436883,0.04996872,0.00009376553,0.0000017793412,0.000018767623,7.73961e-7,0.0000050062304,0.0007651106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880445,0.000037963073,0.00039689755,0.00027729548,0.00025221484,0.00023116177],"domain_scores_gemma":[0.9985867,0.00014801371,0.000092162336,0.001018571,0.00009939492,0.000055151424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039980866,0.00012585954,0.00025065275,0.00022082968,0.00010056006,0.000042264313,0.000967707,0.00005886125,0.000035250516],"category_scores_gemma":[0.00025549778,0.000109504894,0.00012100215,0.000603158,0.0001100274,0.00012856106,0.00044587336,0.0000857677,0.000031393374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003165951,0.00010706279,0.00020919526,0.00018001937,0.000030668187,0.0000019538463,0.0005752293,0.0000031316706,0.00095613935,0.98968136,0.0026825834,0.0055694906],"study_design_scores_gemma":[0.0003649787,0.000044878987,0.00035686896,0.00018593797,0.00002013482,0.0000024657209,0.00008577045,0.0060087545,0.00494428,0.98702395,0.00085168856,0.000110286375],"about_ca_topic_score_codex":0.000011641952,"about_ca_topic_score_gemma":0.0000021540475,"teacher_disagreement_score":0.22587195,"about_ca_system_score_codex":0.000010127082,"about_ca_system_score_gemma":0.00005318679,"threshold_uncertainty_score":0.446548},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020302968,0.00014636584,0.07324667,0.008981932,0.00017779828,0.0019911523,0.000042582007,0.0005445736,0.89456594],"genre_scores_gemma":[0.8837127,0.0000047766584,0.05810704,0.0020506873,0.00007369238,0.00039048662,0.0000027705391,0.00009177088,0.055566065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981808,0.00016756069,0.00049001764,0.00037023498,0.0003274358,0.00046393462],"domain_scores_gemma":[0.99358267,0.0047385856,0.0001639452,0.0013656459,0.000079262136,0.000069918286],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010050399,0.0003232742,0.0004266918,0.00012639286,0.00023600699,0.000048536196,0.00058014254,0.0001148759,0.0025269648],"category_scores_gemma":[0.0017860064,0.00020325996,0.00017515865,0.00038832676,0.00019844838,0.000094901436,0.00017695736,0.00039208838,0.00051920547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028996912,0.00023771226,0.0000037074924,0.0004662991,0.00007066427,0.0000036944016,0.0011392315,9.150983e-7,0.00026603966,0.9759243,0.020832615,0.0010258175],"study_design_scores_gemma":[0.0003094279,0.000058002777,0.000013754712,0.0003549899,0.000059704864,0.000005054335,0.00069705886,0.0005967987,0.0028745418,0.98396885,0.010874996,0.00018682893],"about_ca_topic_score_codex":6.2403325e-7,"about_ca_topic_score_gemma":0.000014068103,"teacher_disagreement_score":0.86340976,"about_ca_system_score_codex":0.00010480976,"about_ca_system_score_gemma":0.00007912887,"threshold_uncertainty_score":0.99838483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98355347,0.00008633733,0.0039991974,0.00019049898,0.000111322115,0.0006611133,0.000053977743,0.00008696212,0.011257109],"genre_scores_gemma":[0.98654926,0.000014260774,0.012347523,0.00003127513,0.00001797383,0.00004284385,0.000016928576,0.000027768514,0.00095215626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815315,0.000093387556,0.0009096151,0.00029051487,0.00030262122,0.00025068226],"domain_scores_gemma":[0.99787706,0.00053208217,0.0004963901,0.0007674401,0.00028227697,0.000044764816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672677,0.00023139603,0.00066645956,0.0002383279,0.000086655346,0.0000222873,0.00035308098,0.000057751062,0.00015712625],"category_scores_gemma":[0.0009057156,0.00020222191,0.00017322131,0.0004499396,0.00035024848,0.00016418855,0.0001360748,0.00013823755,0.000013894319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047592803,0.0007364462,0.000786235,0.0038172826,0.0002021395,0.0000011983923,0.006913138,5.895994e-7,0.09463452,0.8911062,0.0004246422,0.0013300086],"study_design_scores_gemma":[0.00052947266,0.000051566403,0.004129392,0.0007701423,0.00011950818,0.0000032411851,0.00047283203,0.0002065403,0.2100356,0.78337264,0.00014701426,0.00016205401],"about_ca_topic_score_codex":0.000015088833,"about_ca_topic_score_gemma":0.0000041792428,"teacher_disagreement_score":0.1154011,"about_ca_system_score_codex":0.000025961708,"about_ca_system_score_gemma":0.00006368187,"threshold_uncertainty_score":0.82463706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05174454,0.0016077932,0.7845587,0.005266071,0.00074770156,0.00078053836,0.000029791292,0.0007126186,0.15455224],"genre_scores_gemma":[0.86171895,0.0001116965,0.12659524,0.001288541,0.000039529874,0.000046741046,0.000010673774,0.000014727877,0.010173869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991617,0.000021549591,0.00017735657,0.00029058522,0.00015117988,0.00019762239],"domain_scores_gemma":[0.9991768,0.00010297855,0.000033201948,0.0006241908,0.000018358065,0.000044496235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023926562,0.000115441646,0.00014773825,0.00010416443,0.00008199816,0.00022091427,0.00056670845,0.000027854645,0.000048752692],"category_scores_gemma":[0.00005388044,0.000094508694,0.000033427958,0.00022807787,0.000054698106,0.0004017554,0.0006322528,0.000048929316,0.00007127207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013541362,0.00007639259,0.0003739597,0.00014193477,0.000043249234,0.00001273535,0.0004408163,2.4425097e-7,0.000044700213,0.91531724,0.023785623,0.05976175],"study_design_scores_gemma":[0.00069114356,0.000070039365,0.017363656,0.0002520855,0.000058903046,0.00000835431,0.0002569695,0.09894165,0.0005315151,0.7758316,0.105549775,0.00044434846],"about_ca_topic_score_codex":0.000007047303,"about_ca_topic_score_gemma":0.0000029059945,"teacher_disagreement_score":0.80997443,"about_ca_system_score_codex":0.000011069233,"about_ca_system_score_gemma":0.000013797959,"threshold_uncertainty_score":0.38539526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026734915,0.00044738382,0.61324143,0.0035748214,0.0021593748,0.0019549066,0.00015840172,0.0010601098,0.35066867],"genre_scores_gemma":[0.8352619,0.000012889243,0.1620371,0.00014081706,0.000023773548,0.00005305744,0.000039375333,0.000015573372,0.0024155166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988396,0.000049327784,0.000302675,0.00030105692,0.0002857712,0.00022153712],"domain_scores_gemma":[0.9987088,0.00019214906,0.00010116064,0.0008703411,0.00008330147,0.000044247307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031858482,0.0001518129,0.0002863082,0.00019820742,0.000066713816,0.000092122864,0.001009653,0.000037871705,0.000052284926],"category_scores_gemma":[0.0000862521,0.00011549531,0.00006329209,0.00073365314,0.000115254996,0.00032699024,0.00034291518,0.000074006624,0.000024138388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015471158,0.00019815956,0.00007978685,0.00016476352,0.00008885093,0.0000058717546,0.00017000508,3.3332992e-7,0.000035273777,0.9809248,0.011468852,0.006847853],"study_design_scores_gemma":[0.0018609578,0.00030520817,0.0019577607,0.00043507808,0.00010350464,0.0000044071508,0.00033490843,0.017717866,0.0014665266,0.9641316,0.011324636,0.00035755604],"about_ca_topic_score_codex":0.000009822433,"about_ca_topic_score_gemma":0.0000037314232,"teacher_disagreement_score":0.808527,"about_ca_system_score_codex":0.000011939542,"about_ca_system_score_gemma":0.00004118914,"threshold_uncertainty_score":0.47097623},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006618035,0.00021638976,0.7948344,0.0005903498,0.000016549702,0.0005611114,0.000054151846,0.00007532702,0.1970337],"genre_scores_gemma":[0.9820381,0.0000058570413,0.015491666,0.00006433843,0.000035010202,0.00040057587,0.000015540169,0.000011083107,0.0019378345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921703,0.000016862303,0.00026555083,0.00024792113,0.000064522574,0.00018808231],"domain_scores_gemma":[0.99896103,0.000464206,0.0000634952,0.00040211243,0.000043441723,0.00006573245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013278401,0.00015707394,0.00022134374,0.00004211014,0.00022302782,0.000045991153,0.00017795083,0.00002949147,0.00047940988],"category_scores_gemma":[0.000012191976,0.00011444647,0.00006723772,0.000220159,0.00016199546,0.00007999059,0.000114252514,0.00009243325,0.000086835586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011499881,0.00009095298,0.000060595936,0.00006806474,0.000025037392,2.7886943e-8,0.00021458714,0.0000019510144,0.00024422296,0.97019494,0.00017876325,0.02891972],"study_design_scores_gemma":[0.00010471423,0.000007784293,0.000045531036,0.000059803322,0.000017731867,3.514037e-7,0.0013919562,0.0008706239,0.0016334946,0.9713732,0.024387956,0.000106856605],"about_ca_topic_score_codex":0.000004012587,"about_ca_topic_score_gemma":2.715047e-7,"teacher_disagreement_score":0.97542006,"about_ca_system_score_codex":0.000009275336,"about_ca_system_score_gemma":0.000022386037,"threshold_uncertainty_score":0.5249202},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86039096,0.00010972306,0.0048462716,0.0014016932,0.00014506522,0.00081262976,0.000037505728,0.0005358579,0.13172029],"genre_scores_gemma":[0.9857278,0.000008243934,0.010299282,0.00019325913,0.000028474431,0.0002558853,0.000010465409,0.00002783953,0.0034487615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985009,0.00007729499,0.0005251424,0.00032911473,0.00018501413,0.00038257745],"domain_scores_gemma":[0.9983342,0.0005365089,0.00012740491,0.0008421531,0.00006778313,0.00009193802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058666064,0.00023384509,0.00035810686,0.00020566833,0.00025390432,0.00006204632,0.00037769452,0.00009665466,0.0004980485],"category_scores_gemma":[0.00041244822,0.0002083526,0.000201758,0.0005342082,0.00016260461,0.00012910634,0.00010626893,0.00019595759,0.00024225964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012419689,0.00024483647,0.0001401016,0.00025673403,0.000072987146,0.0000012936245,0.00044629993,1.003934e-7,0.0015552237,0.9923776,0.0037856812,0.00110676],"study_design_scores_gemma":[0.0003038157,0.00002250039,0.00057431654,0.00017749729,0.0000980647,0.0000050849003,0.00030140666,0.0002322461,0.0023075317,0.9864795,0.009319571,0.0001784432],"about_ca_topic_score_codex":0.0000016560629,"about_ca_topic_score_gemma":0.0000023033397,"teacher_disagreement_score":0.12827154,"about_ca_system_score_codex":0.000024816256,"about_ca_system_score_gemma":0.00003530441,"threshold_uncertainty_score":0.84963727},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34456658,0.0012798356,0.00044860135,0.0008108231,0.000335155,0.00028165034,0.000032061133,0.000050897703,0.6521944],"genre_scores_gemma":[0.98458385,0.000017144679,0.0006720488,0.00025927834,0.000010495389,0.000051474573,0.000010510012,0.000010541641,0.014384648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878174,0.000017098346,0.0006666018,0.00032323468,0.000018051476,0.00019327078],"domain_scores_gemma":[0.99936825,0.00005743146,0.00014496948,0.0003794659,0.0000121681,0.0000377344],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006208997,0.00012942804,0.00036525677,0.00047714595,0.000061312436,0.00003094648,0.0002077556,0.00008563189,0.00093582046],"category_scores_gemma":[0.00016838098,0.0001584863,0.000104508756,0.00027812412,0.00007555572,0.00028349616,0.00003823251,0.00009618655,0.0014116499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010518866,0.00011631623,0.0055212607,0.000100794765,0.000025212577,0.000003904573,0.0019015775,0.0000019879542,0.000005374509,0.9862362,0.005533846,0.0005430208],"study_design_scores_gemma":[0.00059940584,0.000022414439,0.0039275903,0.00007905924,0.0000052335317,9.981334e-7,0.0008820452,0.00273834,0.00004621797,0.9090796,0.08240532,0.00021378006],"about_ca_topic_score_codex":0.000062477746,"about_ca_topic_score_gemma":0.000060459122,"teacher_disagreement_score":0.6400173,"about_ca_system_score_codex":0.00012895561,"about_ca_system_score_gemma":0.000020507005,"threshold_uncertainty_score":0.99997747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9336552,0.0072445287,0.016295644,0.0048470437,0.0007850324,0.00091622694,0.0000063274188,0.00074571534,0.035504296],"genre_scores_gemma":[0.98976433,0.000016337006,0.009216379,0.0003488479,7.579048e-7,0.000020771007,3.3614177e-7,0.00000533175,0.00062689267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988269,0.00005373379,0.00035923015,0.00026896413,0.00028264723,0.00020850232],"domain_scores_gemma":[0.99886286,0.00016168857,0.00006014573,0.0007694477,0.000097241245,0.000048630318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041282104,0.00013077504,0.00025619927,0.0005238956,0.00007897918,0.00004003867,0.0006170913,0.00005012888,0.000016677048],"category_scores_gemma":[0.00033818447,0.000091185524,0.00010853708,0.0009980196,0.00009895274,0.00016620256,0.00017259573,0.000096789816,0.000065205466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004492998,0.00018702181,0.000012556013,0.00020188939,0.000031380107,8.7839584e-7,0.00035126336,0.000008195349,0.0020233486,0.9936112,0.0018933248,0.0016744614],"study_design_scores_gemma":[0.00021566504,0.000078951474,0.000045655615,0.00032845495,0.000014414647,0.0000014932367,0.000041718882,0.009746094,0.023836747,0.9654783,0.00011530817,0.000097172226],"about_ca_topic_score_codex":0.000010198857,"about_ca_topic_score_gemma":3.1212002e-7,"teacher_disagreement_score":0.05610916,"about_ca_system_score_codex":0.000010918584,"about_ca_system_score_gemma":0.000054010525,"threshold_uncertainty_score":0.37184379},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10481278,0.0040834565,0.412777,0.0008861897,0.00043469074,0.0010033859,0.000060352977,0.00014018104,0.47580197],"genre_scores_gemma":[0.9906066,0.000052362666,0.0040423083,0.000080899445,0.000019313806,0.000051167855,0.000004784095,0.000010547017,0.0051320316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998848,0.0000633489,0.00066887774,0.00023709358,0.000026105785,0.00015652365],"domain_scores_gemma":[0.99877983,0.0006903922,0.000195362,0.00026772963,0.000029399656,0.00003728131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020295414,0.00012134481,0.00063148636,0.00017990463,0.00008615865,0.00005562281,0.00011380526,0.00007726443,0.00013344434],"category_scores_gemma":[0.00066439784,0.00011603972,0.000091719725,0.00014196022,0.00012543944,0.00010220998,0.00004529446,0.0000767443,0.00014537339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003271193,0.000044287328,0.00003616144,0.00021373107,0.000056389646,4.7168302e-7,0.0007092647,0.000004228526,0.0000023739842,0.99804217,0.00033124993,0.00023255398],"study_design_scores_gemma":[0.008692489,0.000006996914,0.00002728378,0.00007665037,0.000019515554,0.0000018194237,0.000089862195,0.12781058,0.000023982706,0.86237067,0.000787684,0.000092475864],"about_ca_topic_score_codex":0.000012130465,"about_ca_topic_score_gemma":6.033871e-7,"teacher_disagreement_score":0.8857938,"about_ca_system_score_codex":0.000025171385,"about_ca_system_score_gemma":0.000007635946,"threshold_uncertainty_score":0.47319627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9683186,0.0016957967,0.0013282606,0.00065750326,0.00011727757,0.0012197695,0.00003194808,0.0002705721,0.026360288],"genre_scores_gemma":[0.99375844,0.00005685327,0.0045570796,0.0000650252,0.000005547639,0.0003626036,0.0000042552983,0.000022636059,0.0011675726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984174,0.00013520644,0.0005973589,0.00035552477,0.00017250178,0.00032205472],"domain_scores_gemma":[0.9983242,0.00068030227,0.00010858689,0.00075334153,0.000051204715,0.00008234254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096659374,0.0002216546,0.00042030748,0.00035202023,0.00014090023,0.000058956804,0.00023771486,0.00012126764,0.000051838033],"category_scores_gemma":[0.00034705884,0.00019488217,0.000104681596,0.00077672966,0.00020794134,0.000096367585,0.00008989174,0.00017012304,0.000028844273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000942402,0.000215353,0.0004920495,0.00073048385,0.000040050352,0.000003347503,0.0006384153,4.0010718e-7,0.00044703484,0.9944629,0.002522329,0.00043819848],"study_design_scores_gemma":[0.00034940251,0.000017924576,0.0006256165,0.00043149354,0.0000593307,0.000007956311,0.000926285,0.00072470296,0.00021261911,0.99420804,0.0022690038,0.00016764327],"about_ca_topic_score_codex":0.000012241934,"about_ca_topic_score_gemma":0.000010923005,"teacher_disagreement_score":0.025439842,"about_ca_system_score_codex":0.000018101418,"about_ca_system_score_gemma":0.000023429919,"threshold_uncertainty_score":0.7947064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06505646,0.0015141572,0.8635384,0.0026827494,0.0010875945,0.00051153154,0.000008084889,0.0002739857,0.06532706],"genre_scores_gemma":[0.9872628,0.00001954707,0.011374575,0.00010870693,0.000006834152,0.000019099176,3.9202718e-7,0.0000048964416,0.0012031374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989643,0.0001952296,0.00031444707,0.00019336175,0.00011448449,0.0002181945],"domain_scores_gemma":[0.9978191,0.0011733773,0.00008360878,0.0008167889,0.00007310075,0.000033991717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018143615,0.0001055175,0.00017651619,0.000086135165,0.0002273085,0.00007590432,0.0010307602,0.00003355804,0.00001484451],"category_scores_gemma":[0.0003283371,0.00006802985,0.00011649712,0.0005731959,0.00017239257,0.00012303545,0.00024304132,0.00009001708,0.000026104282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022169236,0.000041752195,0.000030839434,0.000058342324,0.000028255463,9.746938e-7,0.00050192006,0.0000011197915,0.00017864983,0.9877398,0.00044889757,0.0109672425],"study_design_scores_gemma":[0.00010109167,0.000016329006,0.0005612457,0.00009106707,0.000009372459,0.0000016187281,0.0001715646,0.014521515,0.0025486636,0.9808382,0.001070708,0.00006865867],"about_ca_topic_score_codex":0.0000037951081,"about_ca_topic_score_gemma":0.0000024379074,"teacher_disagreement_score":0.92220634,"about_ca_system_score_codex":0.0000060840775,"about_ca_system_score_gemma":0.00003709333,"threshold_uncertainty_score":0.27741766},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3620114,0.0051228036,0.0024723932,0.00069764076,0.0011775295,0.00026572085,0.00040299844,0.00007504702,0.6277745],"genre_scores_gemma":[0.8936749,0.0002172321,0.025655434,0.0012046456,0.000093774426,0.000027747215,0.000012347854,0.000030495194,0.07908341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998838,0.0000063268058,0.0004830447,0.00038818864,0.000027856328,0.00025659284],"domain_scores_gemma":[0.9994592,0.00011015554,0.00012271438,0.00023033527,0.000018923498,0.00005868868],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005755286,0.00013707408,0.0003943159,0.00019706394,0.00019046731,0.00008635694,0.00015233728,0.000058521993,0.0027774894],"category_scores_gemma":[0.00013952647,0.00014916004,0.00008293343,0.00016964358,0.00020128803,0.00015557339,0.00015790571,0.00008488219,0.0016787295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006766591,0.000068172965,0.0027402653,0.00012967909,0.00012213559,0.0000017579887,0.00069542346,0.0000022926522,0.000012004376,0.97383946,0.022146719,0.00023532771],"study_design_scores_gemma":[0.0007105065,0.000023682209,0.0031932024,0.00013617528,0.000042479718,0.000008551545,0.001514448,0.02146506,0.00003822342,0.8867702,0.08572698,0.00037051787],"about_ca_topic_score_codex":0.000031155516,"about_ca_topic_score_gemma":0.0000018336792,"teacher_disagreement_score":0.54869103,"about_ca_system_score_codex":0.000049558806,"about_ca_system_score_gemma":0.00001881539,"threshold_uncertainty_score":0.9990986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5885732,0.00004763025,0.027103629,0.0010092586,0.00021728211,0.00028420764,0.000009005231,0.000033701082,0.38272208],"genre_scores_gemma":[0.9926168,0.0000021608487,0.0065873857,0.000044458684,0.000010181731,0.0000045258403,4.6133437e-7,0.0000015175482,0.0007325602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883735,0.000060066624,0.00048966677,0.00018787719,0.0002680598,0.0001569946],"domain_scores_gemma":[0.99850947,0.00034207499,0.00021745804,0.00080275076,0.00010793749,0.000020335863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003296435,0.00012255019,0.0003482059,0.000054764852,0.00006546116,0.000006132822,0.0007988092,0.00004545188,0.00023022425],"category_scores_gemma":[0.0003440789,0.00008208031,0.00015899872,0.00051338266,0.00041524033,0.000050065722,0.00041187205,0.000092235794,0.000009152345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062287,0.00031500735,0.00040671788,0.0010357221,0.000045392033,9.287076e-7,0.0014781193,0.00006071975,0.0018083524,0.99149585,0.0020885358,0.0012584474],"study_design_scores_gemma":[0.00030811966,0.00004300767,0.0015887073,0.00062862656,0.000025094505,0.000006534129,0.0002907395,0.011570457,0.061105907,0.92415446,0.00019560171,0.00008272727],"about_ca_topic_score_codex":0.000011512435,"about_ca_topic_score_gemma":0.0000017130993,"teacher_disagreement_score":0.40404356,"about_ca_system_score_codex":0.000010230257,"about_ca_system_score_gemma":0.000060745217,"threshold_uncertainty_score":0.3347138},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88700086,0.0058116913,0.05761595,0.0005752829,0.00010425429,0.0004954384,0.00003843763,0.000045571538,0.04831252],"genre_scores_gemma":[0.9945994,0.000021983693,0.0039380905,0.00008630619,0.00002020822,0.000012137174,0.000020121463,0.000006073393,0.0012956541],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994501,0.000021989494,0.00021193882,0.00013837879,0.00007474553,0.00010284097],"domain_scores_gemma":[0.999551,0.000017404996,0.000052061838,0.00029923973,0.00005283174,0.000027451813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014068818,0.000080712125,0.00012515363,0.000059504877,0.000029985651,0.000005497573,0.00010501649,0.00006476674,0.00007201701],"category_scores_gemma":[0.00014767787,0.00007048435,0.00008936061,0.000114608076,0.00007334166,0.000001342226,0.00005908916,0.000028902725,0.000005482701],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630598,0.00024222599,0.0004938433,0.00042831118,0.0001360629,0.0000012397201,0.00009327761,0.000022133972,0.906235,0.08203205,0.0023348355,0.00790476],"study_design_scores_gemma":[0.00036939123,0.000089873305,0.0006615575,0.00014801868,0.00003364163,0.0000024629314,0.00009758093,0.0004966536,0.9638073,0.0233368,0.0108426185,0.000114138544],"about_ca_topic_score_codex":0.0000028282745,"about_ca_topic_score_gemma":0.000002515602,"teacher_disagreement_score":0.10759857,"about_ca_system_score_codex":0.0000028198551,"about_ca_system_score_gemma":0.00003504523,"threshold_uncertainty_score":0.28742683},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15946105,0.0028957815,0.0015916278,0.0010192632,0.00029855946,0.00041210596,0.00053593935,0.00006204496,0.8337236],"genre_scores_gemma":[0.99547553,0.00006286375,0.0025820548,0.00018677533,0.000011111764,0.000021828264,0.000024754128,0.000008679657,0.0016263857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987707,0.00000782809,0.0007297264,0.0002683967,0.000021242588,0.00020209145],"domain_scores_gemma":[0.99917734,0.00009784668,0.0002414865,0.0004063898,0.000032479205,0.00004443622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003751372,0.00013586541,0.0005059271,0.00020215513,0.000055051507,0.000024143403,0.00030959555,0.00008357073,0.00035424746],"category_scores_gemma":[0.00014626716,0.0001351473,0.00018219934,0.0002097911,0.00009277987,0.000099558245,0.000088759625,0.00008383906,0.0003604568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009230842,0.000110067645,0.0015364727,0.00017908755,0.00010858072,5.5783073e-7,0.00027275653,6.0352136e-7,0.00006715609,0.9916656,0.0057929005,0.0002569925],"study_design_scores_gemma":[0.00032696355,0.00004274279,0.011819758,0.00005327287,0.00001522074,0.0000016940528,0.00012260814,0.00018629587,0.00011470867,0.9535294,0.033619408,0.00016792952],"about_ca_topic_score_codex":0.000033853285,"about_ca_topic_score_gemma":0.000017448154,"teacher_disagreement_score":0.8360145,"about_ca_system_score_codex":0.000025816486,"about_ca_system_score_gemma":0.000016238033,"threshold_uncertainty_score":0.55111474},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8496589,0.0017323268,0.13626567,0.00037353934,0.0010125444,0.0012538834,0.000044004802,0.00056293857,0.009096211],"genre_scores_gemma":[0.9897701,0.000016612803,0.009707761,0.00001833519,0.000024153593,0.00011565255,0.000010875436,0.00001902915,0.0003174884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993235,0.000006727207,0.00022118268,0.00014306387,0.000115445626,0.00019006549],"domain_scores_gemma":[0.9996452,0.000088323504,0.00001860443,0.00017122107,0.000037830305,0.00003886466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020837843,0.00014748215,0.00018847857,0.00013494803,0.00006189555,0.00003996013,0.00007047883,0.00005849115,0.000029710813],"category_scores_gemma":[0.00013346058,0.00013785255,0.00005221866,0.000096986616,0.00002877379,0.00009834141,0.000016580769,0.000060356306,0.000003734557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040238163,0.00009587654,0.00008121651,0.006419199,0.00040884138,0.0000015532396,0.0018352265,0.0046611247,0.02311555,0.86626786,0.011060121,0.08601319],"study_design_scores_gemma":[0.0018612937,0.00006311473,0.009957572,0.00033868192,0.00019934599,0.000010082663,0.0003666961,0.46204492,0.017640473,0.5032647,0.0037320757,0.00052098715],"about_ca_topic_score_codex":0.0000016012141,"about_ca_topic_score_gemma":9.2651504e-7,"teacher_disagreement_score":0.4573838,"about_ca_system_score_codex":0.000032833377,"about_ca_system_score_gemma":0.0000070891188,"threshold_uncertainty_score":0.5621464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29168797,0.0017703422,0.6346659,0.0021831961,0.0007303121,0.0008481617,0.000080576516,0.0007896186,0.06724393],"genre_scores_gemma":[0.9743978,0.000032330732,0.024912426,0.0002153495,0.000009709051,0.000012922636,0.000005864631,0.000008129238,0.0004055095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858123,0.00007073335,0.0004142513,0.00035100276,0.00033085997,0.00025191074],"domain_scores_gemma":[0.997934,0.00038589074,0.0001197435,0.0014423437,0.00006317866,0.000054877502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034691842,0.00015733548,0.00035833466,0.00028617916,0.00007513589,0.000047743135,0.0010980638,0.00005998471,0.00006113085],"category_scores_gemma":[0.00017177826,0.00013059723,0.00019001949,0.0007652625,0.00009658103,0.00023210332,0.00025850456,0.0001001985,0.000091637965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034687432,0.00014951687,0.000034990815,0.0001023739,0.00008857203,0.0000033538784,0.00020460712,0.000054121356,0.00009075704,0.98936987,0.004658402,0.005239983],"study_design_scores_gemma":[0.00015032933,0.000053879452,0.00033420042,0.00020820598,0.00004992954,0.0000013032202,0.000051680257,0.100927114,0.0014221908,0.89637554,0.0002949452,0.00013069093],"about_ca_topic_score_codex":0.00000844009,"about_ca_topic_score_gemma":0.0000012584452,"teacher_disagreement_score":0.68270975,"about_ca_system_score_codex":0.000022824344,"about_ca_system_score_gemma":0.000034490597,"threshold_uncertainty_score":0.53256005},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38047817,0.0039178245,0.03430852,0.0012151487,0.0008025284,0.00048053553,0.00008818187,0.00034482285,0.57836425],"genre_scores_gemma":[0.9906634,0.000018741443,0.002067621,0.00014727254,0.000022726277,0.000073893476,0.000008904824,0.000010950936,0.006986461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873954,0.0000069821876,0.00070822,0.00030472135,0.000017687045,0.00022287441],"domain_scores_gemma":[0.99920547,0.00009357104,0.00018579983,0.0004603165,0.00002613942,0.000028704464],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042131054,0.00012610298,0.00037845378,0.00023054265,0.00008328971,0.00007918866,0.00025690126,0.00014680083,0.00042139075],"category_scores_gemma":[0.00025652852,0.00013046355,0.000079752615,0.00030511853,0.000074621246,0.0000762525,0.000076177,0.000102808815,0.0017304673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022352942,0.0000692521,0.0008078069,0.00009380122,0.000044056018,0.0000013680253,0.000028886687,0.00000483585,0.000010114272,0.9936662,0.004713793,0.00055769744],"study_design_scores_gemma":[0.00019931026,0.000023901855,0.000784027,0.000040002848,0.0000060692005,0.000003667891,0.00016806515,0.005323874,0.00012374805,0.93819314,0.054982364,0.00015184666],"about_ca_topic_score_codex":0.000020727246,"about_ca_topic_score_gemma":0.0000011876059,"teacher_disagreement_score":0.61018527,"about_ca_system_score_codex":0.0000831332,"about_ca_system_score_gemma":0.000010652018,"threshold_uncertainty_score":0.9990468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54828477,0.00023656634,0.4190165,0.0007297333,0.00017447429,0.00054631894,0.000100674224,0.000058559497,0.030852417],"genre_scores_gemma":[0.99548215,0.00000878093,0.004268806,0.000048910664,0.0000015085124,0.0000019056828,0.0000011544442,0.0000027578933,0.00018405756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991738,0.000052475618,0.0003421293,0.0001301095,0.00020916377,0.00009232305],"domain_scores_gemma":[0.99901706,0.0002114048,0.00015506711,0.0005263783,0.000066031665,0.00002406807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025295457,0.00007961881,0.00023533008,0.00013468676,0.000030250585,0.000013654683,0.0004324031,0.000029468145,0.000022293567],"category_scores_gemma":[0.00013925167,0.000054179043,0.00008763123,0.00062758895,0.00016775745,0.00006956513,0.00015607609,0.00004254223,8.701691e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006927092,0.00015986961,0.0001798756,0.0003184995,0.000032750024,2.350869e-7,0.0006975611,0.0000062350487,0.001002231,0.99694943,0.00035268778,0.00029368023],"study_design_scores_gemma":[0.0016082862,0.00030552136,0.013391066,0.0013693688,0.00014312264,0.000008140165,0.00083574787,0.081902854,0.1176588,0.78229946,0.00018592435,0.00029170795],"about_ca_topic_score_codex":0.000005993942,"about_ca_topic_score_gemma":0.000002208085,"teacher_disagreement_score":0.44719738,"about_ca_system_score_codex":0.0000036892825,"about_ca_system_score_gemma":0.000036916972,"threshold_uncertainty_score":0.22093573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6250153,0.0010238793,0.15883991,0.008919879,0.0005355538,0.001613089,0.000015820888,0.00037426423,0.20366229],"genre_scores_gemma":[0.87504756,0.000013523861,0.12303427,0.000020181327,0.000009460864,0.000029058634,0.0000019101124,0.0000019259185,0.0018421158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881977,0.00007368588,0.0003867372,0.00034768006,0.0001829937,0.00018911096],"domain_scores_gemma":[0.9981383,0.00041472912,0.00019671726,0.00082605786,0.00039203523,0.000032151085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039947382,0.00013631278,0.00034246987,0.00010961116,0.000058648875,0.000015528538,0.0005274152,0.00006326518,0.000021519663],"category_scores_gemma":[0.0018430381,0.00010968977,0.00007088227,0.000723047,0.00017205784,0.00009369921,0.0003577453,0.000079758705,0.0000059032977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055843804,0.0013083477,0.0004922157,0.0072323713,0.00034033414,0.000017808987,0.036173943,0.00035355764,0.13547276,0.7928887,0.011211558,0.014452558],"study_design_scores_gemma":[0.00042023667,0.00017563731,0.0027383775,0.00077048934,0.00007203407,0.000010690376,0.0036868195,0.056366168,0.4356328,0.49791807,0.0018967249,0.00031195197],"about_ca_topic_score_codex":0.000022733104,"about_ca_topic_score_gemma":0.000002469662,"teacher_disagreement_score":0.30016005,"about_ca_system_score_codex":0.000012791086,"about_ca_system_score_gemma":0.00015654019,"threshold_uncertainty_score":0.4473019},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9706256,0.00018719453,0.013067811,0.00042032916,0.00006942707,0.0007875957,0.000007448588,0.00017467313,0.014659947],"genre_scores_gemma":[0.9911948,0.000004738518,0.007593829,0.00010628349,0.0000062833137,0.00004485396,0.000038504277,0.000013862405,0.0009968578],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9989977,0.00007936646,0.00034040422,0.00022024932,0.00021326769,0.00014900653],"domain_scores_gemma":[0.99901724,0.00027562014,0.00007670118,0.00040225653,0.00014613062,0.00008204587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003060476,0.00013976847,0.00033907476,0.00019435985,0.00003817664,0.0000074012382,0.00006209427,0.00007524234,0.00014606908],"category_scores_gemma":[0.00037827122,0.00009407097,0.00009628094,0.0004180695,0.00020642782,0.00006465365,0.000012839515,0.000106147134,0.000007211127],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073171845,0.01384049,0.033437304,0.060597673,0.0029379232,0.000017474218,0.010271321,0.00001736209,0.5611391,0.12602308,0.022673942,0.16172712],"study_design_scores_gemma":[0.01771101,0.021026311,0.49890244,0.014397194,0.00407886,0.000053330812,0.015784863,0.0729591,0.04925717,0.2992902,0.0047179647,0.001821541],"about_ca_topic_score_codex":0.0000164108,"about_ca_topic_score_gemma":0.0000067523606,"teacher_disagreement_score":0.51188195,"about_ca_system_score_codex":0.000028638979,"about_ca_system_score_gemma":0.00005150909,"threshold_uncertainty_score":0.38361028},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16073209,0.00015319146,0.0007160063,0.0026264037,0.00076818425,0.00038498366,0.000008428467,0.00014879675,0.8344619],"genre_scores_gemma":[0.9952523,0.000022710927,0.001729177,0.00031091642,0.000058895544,0.00004377863,0.0000015587691,0.000007610902,0.0025730117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984605,0.00016270088,0.00031523066,0.0002328052,0.0003304836,0.00049831456],"domain_scores_gemma":[0.9987586,0.00077440136,0.00003126857,0.00029247112,0.000053178792,0.00009003891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010740053,0.00010432616,0.00020210288,0.00018561198,0.00024860143,0.000046612662,0.0004122385,0.00012407065,0.00050032174],"category_scores_gemma":[0.002217685,0.00010258159,0.00008926896,0.0007957322,0.0006974565,0.00008123142,0.000076226584,0.00018256552,0.00014711474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002068329,0.00014400856,0.0012849348,0.000040597926,0.0000059179456,0.000003195088,0.005920668,6.696822e-7,0.0000031707696,0.99080825,0.0011992056,0.00058731774],"study_design_scores_gemma":[0.00016462343,0.000009500025,0.0020847553,0.00009179179,0.000010699882,2.58483e-7,0.009663328,0.0009581954,0.000006652799,0.9796609,0.0072374935,0.000111782494],"about_ca_topic_score_codex":0.00033082595,"about_ca_topic_score_gemma":0.0003871314,"teacher_disagreement_score":0.8345203,"about_ca_system_score_codex":0.00018753031,"about_ca_system_score_gemma":0.00018956522,"threshold_uncertainty_score":0.54781723},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83975273,0.000108845314,0.08297926,0.0021048398,0.0000323569,0.00039277165,0.0000027024905,0.00015560164,0.07447088],"genre_scores_gemma":[0.98574924,0.0000019981571,0.013890784,0.000030344154,0.0000031073516,0.00003674351,0.000001812855,0.000002074965,0.00028388316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885106,0.000053378426,0.00039099116,0.00030374748,0.00015700934,0.00024382837],"domain_scores_gemma":[0.9987877,0.00051962223,0.00013788733,0.0004362802,0.000081160535,0.000037339058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005236487,0.00013718313,0.00030271767,0.00018922237,0.000070087866,0.000030264293,0.0004256416,0.00006976315,0.000014681127],"category_scores_gemma":[0.00033027108,0.00011412224,0.000054060936,0.0009372293,0.00010725875,0.00012948169,0.0001428032,0.00013142997,0.0000031635032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020175314,0.00022246328,0.06384731,0.001490049,0.000095462,0.000010286994,0.0030330443,0.00014823263,0.0017944935,0.92321724,0.00014823672,0.0059729875],"study_design_scores_gemma":[0.0008187673,0.00016967836,0.04758735,0.0014851122,0.00003893251,0.000011903229,0.002171446,0.014771257,0.028223665,0.90372074,0.0006627509,0.000338387],"about_ca_topic_score_codex":0.000060745333,"about_ca_topic_score_gemma":0.000016725075,"teacher_disagreement_score":0.14599651,"about_ca_system_score_codex":0.00002031293,"about_ca_system_score_gemma":0.000051074447,"threshold_uncertainty_score":0.465377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75930727,0.00030950434,0.0012737827,0.00036456055,0.00009058082,0.0001768633,0.000034779263,0.000034718138,0.23840794],"genre_scores_gemma":[0.9922349,0.00007462937,0.0065837614,0.00007887065,0.000020659227,0.000013271898,0.0000013045094,0.000018047731,0.00097458897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988889,0.0000114519935,0.00056931534,0.0002839815,0.000023808556,0.00022255759],"domain_scores_gemma":[0.99889815,0.00045756382,0.00020847336,0.00036027102,0.000022815206,0.00005270166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005304505,0.00015178106,0.00052625214,0.00012285689,0.00006584829,0.000042445958,0.00015220151,0.000062222585,0.00024122107],"category_scores_gemma":[0.00028907493,0.00014906317,0.00006563525,0.00016477951,0.00013767423,0.00010205214,0.000080040685,0.00008455702,0.000058496167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086216925,0.0001839329,0.021707403,0.0006335026,0.00019056373,0.0000033124577,0.0010938281,0.000031947686,0.000025563118,0.9734704,0.00070302346,0.0018703248],"study_design_scores_gemma":[0.0025486392,0.0002296832,0.015728876,0.00029305753,0.000077465,0.000014479191,0.0008019598,0.014958248,0.00025737923,0.9569978,0.0075167455,0.00057565694],"about_ca_topic_score_codex":0.00004030537,"about_ca_topic_score_gemma":0.000030152265,"teacher_disagreement_score":0.23743336,"about_ca_system_score_codex":0.000032621072,"about_ca_system_score_gemma":0.00002338289,"threshold_uncertainty_score":0.607862},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85941666,0.013305615,0.113056,0.0032040433,0.0018506902,0.0034030566,0.0002639074,0.00010728872,0.005392741],"genre_scores_gemma":[0.96942055,0.000041845473,0.030082976,0.0000608947,0.0000049051923,0.000022621512,0.0000011941329,0.000015158884,0.00034985016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964356,0.00033081218,0.0013755681,0.00075758,0.0005756325,0.00052484043],"domain_scores_gemma":[0.99620503,0.0006693549,0.00061537564,0.0020545702,0.00033986234,0.00011580831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012581393,0.00038132948,0.0008188749,0.00026025707,0.00023004583,0.00007741017,0.0010404581,0.00009764821,0.000041908126],"category_scores_gemma":[0.0005381674,0.0002672562,0.0003213114,0.00105227,0.0012041937,0.00019849812,0.0010153269,0.0002637457,0.000005807106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006900686,0.0015934301,0.006306413,0.006456758,0.00066948606,0.0000026488333,0.01004951,0.00017171772,0.042161964,0.92089707,0.0019813483,0.009640631],"study_design_scores_gemma":[0.003283506,0.00068532926,0.02126049,0.009194748,0.0009334196,0.000018867267,0.0016312702,0.32256353,0.05223664,0.58675545,0.0004194191,0.0010173378],"about_ca_topic_score_codex":0.00004074672,"about_ca_topic_score_gemma":0.0000057092357,"teacher_disagreement_score":0.33414164,"about_ca_system_score_codex":0.000014621055,"about_ca_system_score_gemma":0.00015112033,"threshold_uncertainty_score":0.99997795},"labels":[],"label_agreement":null},{"id":"W7117414058","doi":"10.61091/um125-02","title":"Encoding and enumerating acyclic orientations of graphs","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación","keywords":"Directed acyclic graph; Multipartite; Permutation (music); Vertex (graph theory); Graph; Directed graph; Upper and lower bounds","score_opus":0.010036451430266479,"score_gpt":0.2500600423868139,"score_spread":0.2400235909565474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117414058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8573894,0.008694134,0.012868599,0.00011103173,0.0009711014,0.0008405829,0.000058519076,0.0001617056,0.11890495],"genre_scores_gemma":[0.9970112,0.00015098935,0.002315128,0.000014820018,0.00001757214,0.00004933996,0.0000034467923,0.000025051895,0.0004124894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980703,0.00012845088,0.00097565964,0.00029712828,0.00018319333,0.0003452635],"domain_scores_gemma":[0.99853736,0.00066438277,0.0001450955,0.0004904486,0.00007116329,0.00009155231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069378846,0.00029368172,0.00057161035,0.000355891,0.0002423547,0.000067504996,0.0002010868,0.00014271887,0.00023266616],"category_scores_gemma":[0.00035380633,0.00030415147,0.00016486381,0.0007393664,0.00021564629,0.00017876977,0.000088337714,0.00021318997,0.00001944384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000906757,0.00009704141,0.0006151742,0.0052166893,0.00034264385,0.0000022292543,0.011304626,0.000057910045,0.0071850903,0.97005343,0.00016843266,0.0049476335],"study_design_scores_gemma":[0.001300794,0.00013379286,0.001834466,0.0069348845,0.00086023327,0.000031917818,0.028395776,0.055604044,0.016970834,0.8859454,0.0011836293,0.00080424483],"about_ca_topic_score_codex":0.000009615296,"about_ca_topic_score_gemma":0.0000032315716,"teacher_disagreement_score":0.13962178,"about_ca_system_score_codex":0.000025976602,"about_ca_system_score_gemma":0.0000327505,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91477275,0.033349145,0.004258154,0.008384123,0.00045840323,0.005051199,0.0001317008,0.0002500858,0.03334447],"genre_scores_gemma":[0.9918991,0.0009180374,0.0015773934,0.00015037974,0.00003139215,0.0003244579,0.0000014440091,0.000048207803,0.005049612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964868,0.0002872282,0.0015647523,0.0005654029,0.000443752,0.0006520679],"domain_scores_gemma":[0.9952649,0.0019169046,0.00050465093,0.0019111825,0.00026012532,0.00014227815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001760809,0.00053995295,0.00087984913,0.00030684168,0.0010805489,0.0001821128,0.00088222884,0.00026904859,0.000092683425],"category_scores_gemma":[0.0012362386,0.0003643399,0.00034573165,0.0008546292,0.0024167008,0.00021348917,0.0004841526,0.0004398857,0.00004799533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010598224,0.00064566697,0.00007926888,0.0038485432,0.000496701,9.694235e-7,0.0036711884,7.0206534e-7,0.0020405708,0.985022,0.0012801739,0.0028082272],"study_design_scores_gemma":[0.0005992887,0.000078118894,0.00028260952,0.00186126,0.0004788112,0.000010551378,0.0050844126,0.0012753773,0.00555885,0.9809207,0.0035362316,0.00031382177],"about_ca_topic_score_codex":0.000012457594,"about_ca_topic_score_gemma":0.000021010053,"teacher_disagreement_score":0.077126354,"about_ca_system_score_codex":0.000035367473,"about_ca_system_score_gemma":0.00018819488,"threshold_uncertainty_score":0.99988085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1356562,0.0032546239,0.43912566,0.007325244,0.0016622872,0.0061029773,0.000336226,0.0010446188,0.4054922],"genre_scores_gemma":[0.97482616,0.00012248708,0.0046874788,0.00024333957,0.000063511434,0.0005330972,0.000024767223,0.00006553876,0.019433621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954823,0.00032521388,0.0019983065,0.00091567106,0.00053340616,0.0007450993],"domain_scores_gemma":[0.9942368,0.001880579,0.0005894648,0.0027448868,0.00034359327,0.00020466601],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020852485,0.0006238841,0.0008491946,0.00071526924,0.00078525447,0.00028967616,0.0011265831,0.00044320905,0.0026067453],"category_scores_gemma":[0.0013873184,0.00063309335,0.0005781868,0.0021322763,0.0006747429,0.000278866,0.0003010628,0.0005533335,0.0015526682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035686127,0.0014088743,0.00010313017,0.0022189673,0.00037886924,0.0000020932537,0.0014978941,0.0000028409809,0.0007541723,0.9736199,0.016113944,0.003863645],"study_design_scores_gemma":[0.0005628328,0.00002898257,0.0008635101,0.0008078899,0.00067992014,0.000008163362,0.0021095527,0.0027442763,0.0024607617,0.9807895,0.008485753,0.00045888],"about_ca_topic_score_codex":0.000007128978,"about_ca_topic_score_gemma":0.0000066099847,"teacher_disagreement_score":0.83917,"about_ca_system_score_codex":0.000097264936,"about_ca_system_score_gemma":0.00017285343,"threshold_uncertainty_score":0.99961203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70839757,0.0083344,0.013372897,0.0048216707,0.0004391474,0.004440258,0.00019339981,0.00015260057,0.25984803],"genre_scores_gemma":[0.98864067,0.00034812884,0.0064512827,0.00016965171,0.000025040295,0.0001665309,0.0000026010416,0.00003599445,0.0041601253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969048,0.00040278854,0.0013638422,0.00048650135,0.0003484751,0.00049361825],"domain_scores_gemma":[0.9926911,0.004862125,0.00044717127,0.0017421526,0.00014686499,0.0001105584],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002357726,0.0004524703,0.0010574925,0.00019232674,0.00040932908,0.00008415234,0.0006677997,0.00022144827,0.00091380015],"category_scores_gemma":[0.0010923994,0.00030842423,0.00043704078,0.0006897828,0.002426433,0.00009714306,0.000225031,0.00041999933,0.00007014633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018144627,0.00063851,0.000019917903,0.0015819983,0.00038887543,0.0000016089317,0.014309679,5.3059983e-7,0.00021389492,0.97976154,0.0021973893,0.0007046255],"study_design_scores_gemma":[0.0020080963,0.00006844638,0.00018207404,0.0007520167,0.00078700355,0.000016860122,0.00480309,0.0016399748,0.0021656246,0.98458475,0.0027519192,0.00024015828],"about_ca_topic_score_codex":0.000006898096,"about_ca_topic_score_gemma":0.0000033773422,"teacher_disagreement_score":0.28024307,"about_ca_system_score_codex":0.000032577624,"about_ca_system_score_gemma":0.00009852883,"threshold_uncertainty_score":0.9999995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013722623,0.00003977478,0.39314392,0.00058921834,0.000066444765,0.0003097901,0.00002579171,0.000099727855,0.5920027],"genre_scores_gemma":[0.9641449,9.954803e-7,0.029846461,0.00012916137,0.000061554165,0.00013616642,0.000012641812,0.000015901225,0.0056522368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991218,0.000015170909,0.00029448138,0.00021098818,0.000100988065,0.00025656054],"domain_scores_gemma":[0.99904305,0.0003355529,0.0000604009,0.00045222335,0.0000416357,0.000067133195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001306941,0.00014888145,0.00023483229,0.00003319056,0.00017161849,0.00003573498,0.00019878524,0.000027117962,0.0019572433],"category_scores_gemma":[0.00004126071,0.0001272086,0.00010559211,0.00024916357,0.00009187852,0.000073131014,0.00008800574,0.00010868311,0.00035920076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022282695,0.00010321337,0.00016077961,0.000058200716,0.000038948405,1.9090037e-7,0.00021411906,0.000004851738,0.00012603932,0.9927661,0.0012805474,0.005244779],"study_design_scores_gemma":[0.00015785881,0.000005309368,0.000049271468,0.000089781046,0.000035079753,4.7600992e-7,0.0013344387,0.0009409835,0.0009561088,0.9619806,0.034329087,0.00012101133],"about_ca_topic_score_codex":0.000013621362,"about_ca_topic_score_gemma":4.2180775e-7,"teacher_disagreement_score":0.9504223,"about_ca_system_score_codex":0.00002640188,"about_ca_system_score_gemma":0.0000287507,"threshold_uncertainty_score":0.99895513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7869361,0.0005055212,0.08775096,0.0019230848,0.0005442648,0.0009552849,0.000054454344,0.0006299838,0.12070033],"genre_scores_gemma":[0.96218354,0.000017305694,0.02293112,0.0000981777,0.000053659984,0.0000878025,0.0000059906165,0.000024837904,0.0145975575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989078,0.000040681552,0.00037131956,0.0002750379,0.00016048654,0.00024469208],"domain_scores_gemma":[0.9982675,0.0010153636,0.000072017945,0.0005004125,0.00006580085,0.00007894228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002750763,0.00018160042,0.0002831441,0.00014653512,0.00025994788,0.00006528723,0.00013925595,0.00008092461,0.00037610932],"category_scores_gemma":[0.0012009257,0.00015564117,0.00008694976,0.00020277586,0.00014012976,0.00012308329,0.00010268309,0.00013808606,0.00013408484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063532875,0.00032760642,0.0008254613,0.0005442696,0.000117514086,0.0000013777225,0.0016951775,3.6568233e-7,0.00025333586,0.9708898,0.020818975,0.0045197555],"study_design_scores_gemma":[0.00036656793,0.000022478845,0.0032610337,0.00016735752,0.00013226789,0.0000051635952,0.0012174208,0.0008559467,0.0003480546,0.98331064,0.010127851,0.00018521675],"about_ca_topic_score_codex":0.000008624111,"about_ca_topic_score_gemma":0.0000130988865,"teacher_disagreement_score":0.17524743,"about_ca_system_score_codex":0.000034941928,"about_ca_system_score_gemma":0.00003740195,"threshold_uncertainty_score":0.6346863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21371098,0.005640791,0.62527245,0.012075073,0.0019700548,0.0061507816,0.00008245879,0.00079978135,0.13429764],"genre_scores_gemma":[0.939638,0.00008913643,0.054252077,0.00031255122,0.000023255801,0.00022663751,0.0000042540323,0.000051546594,0.0054025385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926922,0.0013552445,0.00173055,0.0015712952,0.0009435025,0.0017072646],"domain_scores_gemma":[0.99111867,0.0052059023,0.00031646687,0.002700397,0.0003322691,0.00032628345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004242048,0.00073783414,0.0012361844,0.0013345964,0.00044575724,0.00038729084,0.0032209002,0.00037274175,0.00041175983],"category_scores_gemma":[0.0041429466,0.0007371621,0.0003706009,0.0038516938,0.0008702836,0.0009015421,0.0020076544,0.0009866478,0.00031698405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024415785,0.0014107118,0.0005455193,0.002061115,0.00015981677,0.00019911499,0.012005106,0.00005364017,0.0010573037,0.8200662,0.0023006313,0.15989666],"study_design_scores_gemma":[0.0013015782,0.0002108337,0.0014830715,0.0024795872,0.000031878284,0.000017027045,0.0012528473,0.3299372,0.0022904926,0.6599028,0.0005745613,0.00051814795],"about_ca_topic_score_codex":0.000022615452,"about_ca_topic_score_gemma":0.00008202517,"teacher_disagreement_score":0.72592705,"about_ca_system_score_codex":0.00038827676,"about_ca_system_score_gemma":0.0006512941,"threshold_uncertainty_score":0.99950796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6389105,0.0007555233,0.27142984,0.0006869973,0.0013892971,0.0039334553,0.0009195594,0.00016058196,0.081814274],"genre_scores_gemma":[0.99223894,0.000066443325,0.0040308908,0.000029963272,0.000051723204,0.00012750851,0.00009095679,0.000054147204,0.0033094136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938688,0.00040323444,0.0033242407,0.0007280457,0.000761301,0.0009143311],"domain_scores_gemma":[0.9944992,0.002897503,0.00087439775,0.0012270331,0.00031147595,0.00019036299],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029543312,0.0006575271,0.0020136659,0.00058329303,0.00018044449,0.00010711206,0.0006196555,0.00058291777,0.0010969698],"category_scores_gemma":[0.005978058,0.0006313868,0.000634482,0.001803,0.000437162,0.00023460353,0.00038298185,0.0005588145,0.00014182858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050716195,0.008735809,0.00044408225,0.01156547,0.00035705953,0.000016668355,0.0019982213,0.000048333142,0.0005727115,0.96385014,0.00237709,0.009527226],"study_design_scores_gemma":[0.0060014995,0.0003719315,0.004110818,0.0070139845,0.0008850357,0.000017690101,0.0016011429,0.35582903,0.0017687768,0.6190519,0.0023850077,0.0009632187],"about_ca_topic_score_codex":0.00006431862,"about_ca_topic_score_gemma":0.00002752464,"teacher_disagreement_score":0.3557807,"about_ca_system_score_codex":0.0004437867,"about_ca_system_score_gemma":0.00030105814,"threshold_uncertainty_score":0.9998162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89849484,0.008941986,0.011995727,0.00025759707,0.00081039127,0.002847732,0.00029907594,0.00013141484,0.07622122],"genre_scores_gemma":[0.9794229,0.0004132637,0.018144598,0.000015667285,0.00005698612,0.00007208272,0.000007284639,0.00009559798,0.0017715653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930956,0.0003291623,0.0038043458,0.0009143053,0.0010431212,0.0008134624],"domain_scores_gemma":[0.99150825,0.0030393887,0.0020469378,0.0026289779,0.0006163287,0.00016012178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002402448,0.0007966198,0.003100642,0.0008544347,0.00014780906,0.000030644096,0.0011407278,0.0002661817,0.0005808077],"category_scores_gemma":[0.004918428,0.0007398357,0.0010369305,0.0012862147,0.0013213055,0.00024694594,0.00062023336,0.00041594927,0.000026467646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002488152,0.00595992,0.00091064605,0.064863205,0.0021973143,0.000009550163,0.012875767,0.000012593925,0.029718805,0.8750966,0.0029023893,0.005204347],"study_design_scores_gemma":[0.0015030485,0.000300743,0.00086842646,0.007751317,0.0013316373,0.000009833353,0.0011900923,0.0006076257,0.27941775,0.70631486,0.00020860934,0.0004960746],"about_ca_topic_score_codex":0.00005121015,"about_ca_topic_score_gemma":0.000009592385,"teacher_disagreement_score":0.24969895,"about_ca_system_score_codex":0.00006798696,"about_ca_system_score_gemma":0.00025123736,"threshold_uncertainty_score":0.9995053},"labels":[],"label_agreement":null}]}