{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":121,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":121,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"e60ba4bbaf9c","filters":{"venue":"Utilitas Mathematica"}},"results":[{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Mathematics; Combinatorics; Vertex (graph theory); Graph; Connectivity; Discrete mathematics","authors":[{"name":"Wayne Goddard","is_ca":false},{"name":"Michael A. Henning","is_ca":false},{"name":"Charles A. McPillan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01443677690554708,"gpt":0.2830739827022702,"spread":0.2686372057967232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001292505,0.0005707758,0.0007159011,0.001939758,0.001360947,0.002296414,0.0008882229,0.0005940582,0.002533758],"category_scores_gemma":[0.005004706,0.0003565382,0.0005397492,0.001670879,0.002712386,0.00427512,0.002446368,0.0009900833,0.0002860705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001343429,"about_ca_system_score_gemma":0.0004599622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006028966,"about_ca_topic_score_gemma":0.0008588961,"domain_scores_codex":[0.9982723,0.0004502926,0.0001050319,0.000419233,0.0005274653,0.0002256771],"domain_scores_gemma":[0.9945346,0.002886137,0.0006831969,0.0008805076,0.000476197,0.0005392311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002069381,0.00003998386,0.00335557,0.0002601518,0.00005718658,0.0002721702,0.0009423026,0.04197408,0.01347466,0.9048203,0.001970403,0.0326262],"study_design_scores_gemma":[0.00002335072,0.00006219089,0.001804142,0.00004576905,0.00003413417,0.0006318888,0.0002564703,0.07411361,0.003739017,0.9053558,0.01389696,0.00003677025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5451786,0.002933423,0.3956027,0.001000964,0.0001087275,0.0001007004,0.0006345686,0.0005417425,0.05389864],"genre_scores_gemma":[0.9663783,0.0007942158,0.02812063,0.0001946185,0.0001091825,0.0001091882,0.0002738109,0.00009045166,0.003929551],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002533758,"threshold_uncertainty_score":0.009747326,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Roberto B. Corcino","is_ca":false},{"name":"Cristina B. Corcino","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09004733400857808,"gpt":0.2883204379227752,"spread":0.1982731039141971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00271172,0.0009420342,0.001472858,0.003474516,0.001929794,0.004218145,0.001417328,0.001215833,0.006717772],"category_scores_gemma":[0.009391738,0.0006450437,0.0009497214,0.002227284,0.005388037,0.00742159,0.002639893,0.002892886,0.001000945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00194906,"about_ca_system_score_gemma":0.000947036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006004969,"about_ca_topic_score_gemma":0.0008643796,"domain_scores_codex":[0.9990243,0.0003281102,0.00004665224,0.0001819739,0.0002359643,0.0001830047],"domain_scores_gemma":[0.9960913,0.002448915,0.000349055,0.0003379165,0.0003529773,0.0004197589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002532553,0.000004909915,0.0000651571,0.00002639478,0.00000398146,0.00001776465,0.00006728467,0.0007063855,0.0002830792,0.9953596,0.0003943306,0.003045784],"study_design_scores_gemma":[0.000006498588,0.000008585036,0.00009196632,0.00001444053,0.000005013934,0.00003906761,0.00002469134,0.002439851,0.0001947768,0.9958196,0.001345558,0.000009971112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.4581987,0.01195507,0.2282805,0.005849534,0.001306464,0.00004986675,0.0002627277,0.0006370938,0.2934601],"genre_scores_gemma":[0.9456633,0.00304076,0.02539342,0.0005230637,0.001418316,0.00007334958,0.0001215918,0.0001646806,0.02360148],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.006717772,"threshold_uncertainty_score":0.02247316,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Completeness (order theory); Pencil (optics); Mathematics; Mathematics education; Statistics; Mathematical analysis; Engineering","authors":[{"name":"Ayaka Ishibashi","is_ca":false},{"name":"Yuichi Sato","is_ca":false},{"name":"Shigeki Iwata","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03200131547370069,"gpt":0.295824030478002,"spread":0.2638227150043014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107069,0.0007640327,0.001563452,0.0008439219,0.004532503,0.004837022,0.001863397,0.003364729,0.01703447],"category_scores_gemma":[0.0115027,0.0008587087,0.002027462,0.001694464,0.003620239,0.01170695,0.003403256,0.005425832,0.001710169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002025196,"about_ca_system_score_gemma":0.002411363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005817235,"about_ca_topic_score_gemma":0.004844214,"domain_scores_codex":[0.9986691,0.0004312117,0.00008806871,0.0003846151,0.0001887567,0.0002381343],"domain_scores_gemma":[0.9929197,0.00549445,0.0002888388,0.0005800144,0.0004228997,0.0002940928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005099048,0.0001553022,0.001336166,0.0004463575,0.00006870316,0.0006386947,0.001733341,0.02231064,0.00115051,0.9140469,0.0277341,0.02986935],"study_design_scores_gemma":[0.00008715264,0.00002984574,0.0004225411,0.00005459348,0.00003609158,0.0001939332,0.0006309079,0.02067192,0.0007174825,0.9632652,0.0138583,0.00003190294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5435999,0.003460866,0.1607727,0.03076997,0.0008037325,0.0002401876,0.002498068,0.001431416,0.2564231],"genre_scores_gemma":[0.9286355,0.0009300906,0.03604785,0.001281085,0.0001568037,0.0001572938,0.001935694,0.0003892375,0.03046649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01703447,"threshold_uncertainty_score":0.05698597,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Arithmetic; Combinatorics; Telecommunications; Computer science","authors":[{"name":"Kiki Ariyanti","is_ca":true},{"name":"Mirka Miller","is_ca":false},{"name":"Martin Bača","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009141523871078985,"gpt":0.213803388938798,"spread":0.204661865067719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670475,0.0007976111,0.001094219,0.002215052,0.002904943,0.004047364,0.001867171,0.001853205,0.01018259],"category_scores_gemma":[0.005399085,0.0007897591,0.001311782,0.003248854,0.002993267,0.007861295,0.003619812,0.004041266,0.000966251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00201122,"about_ca_system_score_gemma":0.0008066749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001258342,"about_ca_topic_score_gemma":0.002228185,"domain_scores_codex":[0.9988588,0.0003795295,0.00006460473,0.0002840592,0.0002433089,0.0001697138],"domain_scores_gemma":[0.9955634,0.002504447,0.0002978618,0.00073194,0.000445644,0.000456672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001798554,0.000008335354,0.00009720592,0.00003658864,0.000005077691,0.00001154995,0.00009100093,0.000907439,0.0002240036,0.9943978,0.001240508,0.002962672],"study_design_scores_gemma":[0.000006064429,0.00000387698,0.00007103711,0.000006559706,0.000007472391,0.00002466542,0.00003219635,0.003656906,0.0001716229,0.9942801,0.001735489,0.000003976262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3063457,0.001474862,0.4986527,0.004502,0.0002947623,0.0000785302,0.001182062,0.0006122811,0.1868571],"genre_scores_gemma":[0.8019798,0.001839333,0.1390667,0.001678466,0.0004943233,0.0002685216,0.001735693,0.0005335294,0.05240358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01018259,"threshold_uncertainty_score":0.03406417,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Cartesian product; Alliance; Realizability; Vertex (graph theory); Graph; Mathematics; Combinatorics; Computer science; Geography; Algorithm","authors":[{"name":"Ismael G. Yero","is_ca":false},{"name":"Juan A. Rodríguez‐Velázquez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08717187670400472,"gpt":0.3625151750718749,"spread":0.2753432983678702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297842,0.001232117,0.001545472,0.003421678,0.001714487,0.004779015,0.001935584,0.002016599,0.007360709],"category_scores_gemma":[0.004791434,0.0009463603,0.001507772,0.009748046,0.002894205,0.01385244,0.002155777,0.003215329,0.001815768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0022627,"about_ca_system_score_gemma":0.001196608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001549231,"about_ca_topic_score_gemma":0.001290424,"domain_scores_codex":[0.9982533,0.0004657203,0.000139225,0.0005282119,0.0004252966,0.0001881862],"domain_scores_gemma":[0.9962119,0.002652054,0.0002544687,0.0004202608,0.0002857134,0.0001756297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006019264,0.00009110382,0.002218983,0.002260482,0.00007083003,0.0001816231,0.0006310556,0.007319501,0.0006395815,0.8533604,0.01973248,0.1134337],"study_design_scores_gemma":[0.00001506032,0.00007122086,0.002086513,0.0006874277,0.00007223874,0.001506644,0.0005304481,0.01072312,0.0005291541,0.8140213,0.1697046,0.00005224856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.06549171,0.381866,0.3630991,0.01352307,0.00180216,0.0001827917,0.002157807,0.0005328999,0.1713445],"genre_scores_gemma":[0.3878116,0.4469232,0.1293094,0.00352872,0.005973436,0.0004362316,0.003948045,0.0004295436,0.02163979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007360709,"threshold_uncertainty_score":0.02462399,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics; Arithmetic","authors":[{"name":"Gee-Choon Lau","is_ca":false},{"name":"Wai Chee Shiu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0183901660445439,"gpt":0.2566984188859799,"spread":0.238308252841436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329071,0.001025734,0.001349493,0.002175283,0.00275183,0.004114515,0.001895361,0.001952599,0.008613821],"category_scores_gemma":[0.009270781,0.0007858284,0.001306522,0.003118936,0.00528668,0.009393295,0.004240753,0.005415487,0.0009528533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002997361,"about_ca_system_score_gemma":0.001337262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002600104,"about_ca_topic_score_gemma":0.002475993,"domain_scores_codex":[0.998705,0.000575972,0.00004974746,0.0002895277,0.0002012171,0.0001784344],"domain_scores_gemma":[0.9932928,0.004600204,0.00043819,0.0007266849,0.0004148302,0.0005272722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002782912,0.00001469112,0.00020868,0.00003946107,0.000003593888,0.00001454285,0.0001482097,0.001552406,0.0001599713,0.9930906,0.001315131,0.00342486],"study_design_scores_gemma":[0.000007333914,0.000003376238,0.00006841702,0.000006955726,0.000003599248,0.00001429598,0.00003295319,0.00443074,0.00008487663,0.9943823,0.0009610196,0.000004073499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3272955,0.002547242,0.5251175,0.01279056,0.000528331,0.00008682578,0.0009693633,0.0005169809,0.1301478],"genre_scores_gemma":[0.8577595,0.002254523,0.09951796,0.001628312,0.0009094604,0.000252969,0.001225722,0.0004218337,0.03602986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008613821,"threshold_uncertainty_score":0.0288161,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Least-squares function approximation; Arithmetic; Statistics; Algorithm","authors":[{"name":"Vedran Krčadinac","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006160675756720137,"gpt":0.2037454237497888,"spread":0.1975847479930687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002001712,0.0003891235,0.0003079327,0.00182053,0.0009460075,0.001084507,0.0004058066,0.0005953761,0.01542891],"category_scores_gemma":[0.001188161,0.0001662787,0.0003177195,0.0008437086,0.0009256683,0.001351389,0.0006804214,0.0009837792,0.002661667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003856435,"about_ca_system_score_gemma":0.0003426683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007459789,"about_ca_topic_score_gemma":0.001048055,"domain_scores_codex":[0.9995641,0.000040328,0.00002348733,0.00007459776,0.000159652,0.0001378349],"domain_scores_gemma":[0.999095,0.0002777805,0.0001284967,0.0001524168,0.0002491194,0.00009722228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003256128,0.00008397757,0.008856106,0.0002263659,0.00002369647,0.0006679755,0.0009307405,0.003105029,0.03249702,0.8246011,0.01171214,0.1169702],"study_design_scores_gemma":[0.00002664782,0.0002089017,0.01122451,0.0001015221,0.00004257822,0.002045173,0.0009841217,0.01343468,0.03457015,0.8376036,0.09964375,0.0001144477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7385262,0.0007326876,0.06056337,0.0008651682,0.000563477,0.00006435238,0.001083842,0.0005878824,0.197013],"genre_scores_gemma":[0.9539616,0.0003279041,0.01985197,0.0001621205,0.0001531937,0.00005190072,0.0006858099,0.0001410159,0.02466452],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01542891,"threshold_uncertainty_score":0.05161482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Torus; Combinatorics; Geometry","authors":[{"name":"Simon Crevals","is_ca":false},{"name":"Patric R. J. Östergård","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02505767166059,"gpt":0.3182849750485549,"spread":0.2932273033879649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001422738,0.0008295746,0.001169888,0.004064457,0.002041383,0.003152449,0.001926493,0.001374188,0.009376427],"category_scores_gemma":[0.009027349,0.0005426141,0.0006151051,0.002789084,0.002881935,0.004526822,0.001947685,0.002072447,0.0006713929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002099443,"about_ca_system_score_gemma":0.0007214253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001806653,"about_ca_topic_score_gemma":0.001872019,"domain_scores_codex":[0.9991731,0.000277489,0.00003274576,0.000137145,0.0001723792,0.0002071782],"domain_scores_gemma":[0.9897078,0.007613912,0.0009246246,0.0004150267,0.0003901545,0.0009484979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005359136,0.0001032311,0.004296083,0.0003308612,0.00007616553,0.0002847826,0.001232658,0.0388572,0.006559761,0.9202927,0.008903239,0.01852737],"study_design_scores_gemma":[0.00008222256,0.00005359363,0.003197687,0.00008272925,0.0000613313,0.0003260839,0.0003408819,0.1143629,0.001623635,0.8754718,0.00434383,0.00005321242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8674492,0.002273016,0.03318889,0.003228766,0.0002473174,0.00004408655,0.0007198682,0.000213675,0.09263522],"genre_scores_gemma":[0.9858326,0.001163331,0.003955279,0.00016828,0.0003489466,0.00008383135,0.000331574,0.00009174345,0.008024459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009376427,"threshold_uncertainty_score":0.0313673,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Ladislav Skula","is_ca":false},{"name":"Jiří Klaška","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04000426595464072,"gpt":0.2999675448691068,"spread":0.2599632789144661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001268805,0.0004604713,0.0007005802,0.001870263,0.001867522,0.002943973,0.0005230889,0.0006915,0.00763897],"category_scores_gemma":[0.003589183,0.0002485609,0.0009953543,0.0006929808,0.006167066,0.002930834,0.001897251,0.002558477,0.001061585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001703505,"about_ca_system_score_gemma":0.0007861842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002214407,"about_ca_topic_score_gemma":0.001135535,"domain_scores_codex":[0.9991466,0.0001004752,0.00003282018,0.0002091649,0.0002377579,0.0002731393],"domain_scores_gemma":[0.9981465,0.0007259516,0.0002529686,0.0002365314,0.0002940163,0.0003439633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003261377,0.00001355531,0.0003090958,0.00001938666,0.000003449509,0.00007710634,0.0002344788,0.0002457469,0.0004846671,0.9949245,0.001130861,0.002524573],"study_design_scores_gemma":[0.00004442719,0.00005620447,0.001021287,0.00002667255,0.000009898583,0.0003090241,0.00009991306,0.0047437,0.0007327618,0.9841098,0.00881937,0.0000269718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5062396,0.002955309,0.1662386,0.005542491,0.001117559,0.0001021852,0.0005905901,0.0004073743,0.3168063],"genre_scores_gemma":[0.9759691,0.0006010279,0.008042044,0.0003587831,0.0008517827,0.00005576734,0.0001618779,0.00005852081,0.01390105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00763897,"threshold_uncertainty_score":0.0255549,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Combinatorics; Intersection (aeronautics); Discrete mathematics; Geography; Cartography","authors":[{"name":"S. Madhumitha","is_ca":false},{"name":"Sudev Naduvath","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01536082635419092,"gpt":0.291601772188336,"spread":0.276240945834145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969506,0.0002248979,0.0002586344,0.001193257,0.001139509,0.001110438,0.0006845656,0.0002757656,0.003507065],"category_scores_gemma":[0.0009659256,0.0001594491,0.0004191348,0.0008539956,0.001160341,0.001131242,0.0007899029,0.0005452714,0.0002481839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000610737,"about_ca_system_score_gemma":0.0004473084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001000148,"about_ca_topic_score_gemma":0.001240775,"domain_scores_codex":[0.9995953,0.00007565068,0.00002006456,0.00008583241,0.00009908529,0.0001239912],"domain_scores_gemma":[0.9992316,0.0002158966,0.0001331906,0.0001636769,0.0001556565,0.0001000252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001488389,0.00005032873,0.003432414,0.00006469707,0.0000168651,0.0003404316,0.000630028,0.004220329,0.01463899,0.9491289,0.0007537724,0.02657431],"study_design_scores_gemma":[0.00005426238,0.0001418806,0.008616936,0.0000508813,0.00007043724,0.001129785,0.001326036,0.06239533,0.03978559,0.8671098,0.01924235,0.00007669633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8456914,0.0001100867,0.09664621,0.00009838467,0.00003791758,0.00004273225,0.0001916627,0.0002195461,0.05696212],"genre_scores_gemma":[0.9823142,0.00009893426,0.0134229,0.00002830397,0.00001324998,0.00003392369,0.000245174,0.00005052335,0.003792763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003507065,"threshold_uncertainty_score":0.01173234,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","authors":[{"name":"Nader Jafari Rad","is_ca":false},{"name":"Hadi Rahbani","is_ca":false},{"name":"Lutz Volkmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01571444998795947,"gpt":0.3264017852944996,"spread":0.3106873353065402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007913592,0.0003560246,0.0005728806,0.003424354,0.001870204,0.003187437,0.001030105,0.0009985485,0.01045624],"category_scores_gemma":[0.01132621,0.0004304822,0.0004162909,0.004405907,0.00234738,0.005020414,0.002236927,0.0008379215,0.0008559386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001202725,"about_ca_system_score_gemma":0.0004839325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004511728,"about_ca_topic_score_gemma":0.005483863,"domain_scores_codex":[0.9992903,0.0003456448,0.00002268901,0.0001418704,0.0001065353,0.00009298885],"domain_scores_gemma":[0.9939381,0.004250499,0.0005314059,0.0006252451,0.0004318709,0.0002228526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005408312,0.00008004814,0.0250688,0.0003142611,0.00007473656,0.0006503409,0.00911695,0.02911139,0.003661102,0.845919,0.00528226,0.08018028],"study_design_scores_gemma":[0.00004836925,0.00004600396,0.006709774,0.0001301794,0.00006191395,0.0004910181,0.008618188,0.08681684,0.002467333,0.8760562,0.01852361,0.00003048533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8174788,0.0008891092,0.1153705,0.001445588,0.00004025961,0.00007128531,0.0007710275,0.0003544604,0.06357906],"genre_scores_gemma":[0.9782026,0.0001759447,0.01805004,0.00002903609,0.00001070059,0.00001754613,0.0003180561,0.00005504179,0.003141039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01045624,"threshold_uncertainty_score":0.03497958,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Jiří Klaška","is_ca":false},{"name":"Ladislav Skula","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03418381600207925,"gpt":0.2960121452826704,"spread":0.2618283292805912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008859707,0.0004712289,0.0005561793,0.001508588,0.002067453,0.003094544,0.0004955697,0.00081266,0.008657713],"category_scores_gemma":[0.0031114,0.0002374133,0.0007852464,0.0005251103,0.006789733,0.002699513,0.001991015,0.00262339,0.001187844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778556,"about_ca_system_score_gemma":0.0007449126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001904466,"about_ca_topic_score_gemma":0.001053294,"domain_scores_codex":[0.999348,0.00007886289,0.00002501633,0.0001480395,0.0001890356,0.0002110406],"domain_scores_gemma":[0.9985766,0.0005247145,0.0001957403,0.0002047028,0.0001946771,0.0003036486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000376025,0.00001442963,0.0003137948,0.00002032976,0.000002478834,0.0001257918,0.0002780924,0.000284411,0.0008651632,0.993906,0.001066091,0.003085705],"study_design_scores_gemma":[0.00004866668,0.0000633113,0.0009555159,0.00002847998,0.000008367966,0.0003811077,0.0001248428,0.004341356,0.001229857,0.9820166,0.01077784,0.00002400548],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4884378,0.00199637,0.1132467,0.005282044,0.0009924464,0.0001008392,0.0002858248,0.0003183809,0.3893395],"genre_scores_gemma":[0.9792802,0.0003806014,0.005833061,0.000256191,0.0005270452,0.00004175958,0.00008119058,0.00005022666,0.01354972],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008657713,"threshold_uncertainty_score":0.02896297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Dean Crnković","is_ca":false},{"name":"Sanja Rukavina","is_ca":false},{"name":"Loredana Simčić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02198455366143993,"gpt":0.2662980361193844,"spread":0.2443134824579445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001458781,0.000261881,0.0002197383,0.001114394,0.000487759,0.0006842897,0.0001802095,0.0002846832,0.003034214],"category_scores_gemma":[0.0006939899,0.0001500789,0.0003718896,0.0007274924,0.000902543,0.0006094042,0.0006487441,0.0004729865,0.0006287852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003068635,"about_ca_system_score_gemma":0.0003055245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004865058,"about_ca_topic_score_gemma":0.0003687453,"domain_scores_codex":[0.9997132,0.00003715633,0.00002214134,0.00006409425,0.00009826307,0.00006503731],"domain_scores_gemma":[0.9994938,0.0001146279,0.0001812329,0.00008273932,0.00007028159,0.0000573135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003874858,0.00005933673,0.006697153,0.0002721637,0.00004249114,0.0007298818,0.001389081,0.01704037,0.03979441,0.8367535,0.001885179,0.09494895],"study_design_scores_gemma":[0.0000708224,0.0007429364,0.01210095,0.0001717609,0.00007491138,0.003369887,0.00134683,0.03642458,0.03669771,0.8395208,0.06932452,0.0001542093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9415908,0.0006823606,0.03957233,0.00009626162,0.00004070182,0.0000269904,0.0003140207,0.00007303746,0.01760349],"genre_scores_gemma":[0.9744676,0.0007016875,0.01672339,0.00005307403,0.00004873143,0.00003426468,0.000770373,0.00003840754,0.007162494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003034214,"threshold_uncertainty_score":0.01015043,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Kronecker product; Arithmetic; Product (mathematics); Kronecker delta; Geometry","authors":[{"name":"Susana-Clara López","is_ca":false},{"name":"Francesc Antoni Muntaner Batle","is_ca":false},{"name":"Miquel Rius Font","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008426062970966961,"gpt":0.2141517034023326,"spread":0.2057256404313656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009337167,0.0002995524,0.0004291473,0.00140443,0.001233066,0.001815173,0.0006246072,0.0007693545,0.004059162],"category_scores_gemma":[0.002706766,0.0003182106,0.0004955539,0.001263737,0.002343332,0.004814055,0.001456679,0.001274094,0.0003617081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006968712,"about_ca_system_score_gemma":0.000401232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006694134,"about_ca_topic_score_gemma":0.000732509,"domain_scores_codex":[0.999419,0.0001793712,0.00003438341,0.00009854342,0.0001737748,0.00009488494],"domain_scores_gemma":[0.9977919,0.001226364,0.0002757302,0.000281773,0.0002125123,0.0002117282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001038198,0.000004096434,0.000140857,0.000015759,0.000002340741,0.00002714811,0.00005706364,0.0007077474,0.0002824883,0.9961905,0.0002609037,0.002300706],"study_design_scores_gemma":[0.000004775512,0.00001325946,0.0001928838,0.0000109587,0.000004582245,0.0001149626,0.00005988404,0.005042681,0.0002619002,0.9916487,0.002637415,0.000008148365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5834597,0.003732511,0.3080389,0.002432063,0.0003307665,0.0000334603,0.0002635589,0.0001904057,0.1015187],"genre_scores_gemma":[0.959677,0.001412705,0.02991318,0.0002656822,0.0002134713,0.00003616472,0.0001462451,0.00004739748,0.008288094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004059162,"threshold_uncertainty_score":0.01357925,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Mathematics education","authors":[{"name":"Mankagna Albert Diompy","is_ca":false},{"name":"Ousseynou BOUSSO","is_ca":false},{"name":"Remy Diaga DIOUF","is_ca":false},{"name":"Oumar Diankha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04456738038922997,"gpt":0.3077072600747684,"spread":0.2631398796855384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419038,0.0003884957,0.0003085845,0.001231323,0.0007338116,0.001442867,0.0005097905,0.0002939899,0.005926567],"category_scores_gemma":[0.000752778,0.0001216925,0.0003094017,0.0005576366,0.00109002,0.002934651,0.00155208,0.0006277885,0.0008642655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007708869,"about_ca_system_score_gemma":0.0004123879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006981443,"about_ca_topic_score_gemma":0.0005431703,"domain_scores_codex":[0.9993691,0.0001153744,0.0000457698,0.0001568327,0.0001909525,0.0001220447],"domain_scores_gemma":[0.9996138,0.00006493447,0.00004596427,0.00005990944,0.0001437888,0.00007152956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001565521,0.0000130949,0.0008515719,0.00006514695,0.000007631751,0.0001392519,0.0002906252,0.0004339416,0.001674738,0.9685425,0.001202826,0.02676308],"study_design_scores_gemma":[0.000009505547,0.00004556132,0.004472282,0.00006854458,0.00002413196,0.00140123,0.0004673924,0.00524784,0.005425468,0.7941551,0.1886474,0.00003557817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3338427,0.006253468,0.2890353,0.0008587554,0.0007761099,0.0001200909,0.0008564462,0.0008222196,0.3674349],"genre_scores_gemma":[0.910942,0.00143453,0.04012686,0.0003518184,0.0002473091,0.00007403807,0.0005159046,0.00007901563,0.04622855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005926567,"threshold_uncertainty_score":0.01982641,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics; Combinatorics","authors":[{"name":"Chiang Lin","is_ca":false},{"name":"Wei-Han Tsai","is_ca":false},{"name":"Jen-Ling Shang","is_ca":false},{"name":"Ming-Ju Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02271963880060586,"gpt":0.2596377089601727,"spread":0.2369180701595668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004620954,0.001281234,0.001667205,0.00381742,0.002908803,0.006463263,0.003363232,0.002685062,0.006905876],"category_scores_gemma":[0.03663364,0.001791123,0.001227327,0.003038018,0.00482318,0.01058438,0.00357011,0.003948759,0.0007639331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002652044,"about_ca_system_score_gemma":0.001111729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001315984,"about_ca_topic_score_gemma":0.001603581,"domain_scores_codex":[0.9966628,0.001520999,0.0001534954,0.000760641,0.0004884527,0.0004136449],"domain_scores_gemma":[0.9686698,0.0245406,0.002055323,0.00155154,0.001523845,0.001658864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009974604,0.00003666884,0.000784566,0.00008076363,0.00002338803,0.00003285563,0.0003861224,0.01045069,0.0008173935,0.9783546,0.001568234,0.007364962],"study_design_scores_gemma":[0.00001413652,0.00000907543,0.0004277614,0.00001730074,0.00001085694,0.00002446385,0.00007073848,0.02764551,0.0002979599,0.9709187,0.0005489206,0.00001466206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5195539,0.001185651,0.4425248,0.004697776,0.0001655869,0.00006017912,0.0009224663,0.0003083221,0.03058142],"genre_scores_gemma":[0.9346839,0.001026948,0.0481978,0.0004165235,0.000522521,0.0002530662,0.0009578553,0.0003464376,0.01359482],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006905876,"threshold_uncertainty_score":0.02443826,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical analysis","authors":[{"name":"L. Jódar","is_ca":false},{"name":"M.‐C. Casabán","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02769833975212479,"gpt":0.2588214933353558,"spread":0.231123153583231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397955,0.0007372536,0.0007269945,0.0006318393,0.0005007729,0.00176123,0.0009504288,0.001387298,0.002276927],"category_scores_gemma":[0.005402947,0.0004345624,0.0005175166,0.0002952413,0.002073177,0.001099272,0.003452273,0.001440611,0.0002817393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001149199,"about_ca_system_score_gemma":0.0009467094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003578704,"about_ca_topic_score_gemma":0.002107974,"domain_scores_codex":[0.9995389,0.0001732009,0.00002516909,0.00004646913,0.0001674739,0.00004881594],"domain_scores_gemma":[0.998534,0.0006851028,0.0001637017,0.0001240306,0.0003168434,0.0001763402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002575185,0.00009696148,0.001431241,0.0001971554,0.00008161845,0.0002168579,0.0003670189,0.7712992,0.009398676,0.2025936,0.001297768,0.01276241],"study_design_scores_gemma":[0.00001411513,0.00001595916,0.00005825727,0.000006961024,0.000002610305,0.000008873617,0.00002004608,0.9896958,0.0004561189,0.009379075,0.0003376172,0.000004617457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.278336,0.0009926396,0.6786338,0.002502812,0.0004381424,0.0001515981,0.0001840144,0.0003603033,0.03840069],"genre_scores_gemma":[0.937092,0.0002831716,0.04738744,0.0001374723,0.00007737251,0.0001461327,0.00009603285,0.00008360301,0.01469666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003578704,"threshold_uncertainty_score":0.008338034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Susana-Clara López","is_ca":false},{"name":"Francesc Antoni Muntaner Batle","is_ca":false},{"name":"Miquel Rius Font","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01528467967349586,"gpt":0.2475596280796539,"spread":0.232274948406158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009096568,0.0004113617,0.0006762149,0.001930462,0.001251233,0.001986937,0.001249526,0.0009202785,0.006616108],"category_scores_gemma":[0.005030399,0.0005970698,0.0008700171,0.001836547,0.00145829,0.004627477,0.001609182,0.001935722,0.0005134468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009612647,"about_ca_system_score_gemma":0.0005535635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00055028,"about_ca_topic_score_gemma":0.001249711,"domain_scores_codex":[0.9989366,0.0002426086,0.0001034134,0.0002409119,0.0002906263,0.0001858111],"domain_scores_gemma":[0.9921239,0.005267406,0.0007455677,0.0009623296,0.0004413035,0.0004595115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003538596,0.000122117,0.007700624,0.0003706879,0.00006046253,0.0002974238,0.0006321415,0.01890911,0.01560747,0.899581,0.003442182,0.05292296],"study_design_scores_gemma":[0.00003305823,0.00008259071,0.002010429,0.00004173715,0.00006038519,0.0005905203,0.0002404853,0.06653503,0.007372327,0.918232,0.004759798,0.00004162823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.675661,0.0004834474,0.2994991,0.0006453309,0.00006272521,0.00008301439,0.0007429683,0.0003431573,0.02247921],"genre_scores_gemma":[0.8466215,0.0005490631,0.1424273,0.0001911624,0.0001085897,0.0001423,0.001488757,0.0001390979,0.008332239],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006616108,"threshold_uncertainty_score":0.02213311,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Bijection, injection and surjection; Congruence relation; Mathematics; Residue (chemistry); Arithmetic; Bijection; Chemistry; Combinatorics; Organic chemistry","authors":[{"name":"Augustine O. Munagi","is_ca":false},{"name":"James A. Sellers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03974363941254656,"gpt":0.3154671674391039,"spread":0.2757235280265573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003620376,0.001110782,0.001256572,0.002934291,0.003866084,0.006532583,0.001525722,0.00167714,0.009801557],"category_scores_gemma":[0.008915385,0.001005073,0.001826164,0.001874552,0.007194445,0.01219317,0.004992859,0.005172102,0.001738009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001611967,"about_ca_system_score_gemma":0.0006378818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008642837,"about_ca_topic_score_gemma":0.0007975891,"domain_scores_codex":[0.996894,0.001105811,0.0001884735,0.0006046876,0.0007082032,0.0004988364],"domain_scores_gemma":[0.9960629,0.001692271,0.0002914079,0.001097015,0.0004410711,0.0004152823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001357483,0.00001281376,0.00006462499,0.000009080137,0.000002844886,0.00004061049,0.000307373,0.0003761553,0.0003754123,0.9959736,0.0002844436,0.002539387],"study_design_scores_gemma":[0.000004802525,0.000005057764,0.00003287362,0.000006216945,0.000003437353,0.0000313429,0.00005038481,0.001140459,0.000360021,0.9971372,0.001222346,0.000005790305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3711521,0.001070186,0.455257,0.001931573,0.0005988793,0.0001059688,0.0001981248,0.0007830746,0.168903],"genre_scores_gemma":[0.9224653,0.0005296522,0.04506076,0.000509759,0.00036348,0.00008555264,0.0001871525,0.0009715242,0.02982681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009801557,"threshold_uncertainty_score":0.03278953,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics","authors":[{"name":"Mohammed B. Alshammari","is_ca":false},{"name":"Sergey Kitaev","is_ca":false},{"name":"Chaoliang Tang","is_ca":false},{"name":"Tianyi Tao","is_ca":false},{"name":"Junchi Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03005361560638373,"gpt":0.3417294456927507,"spread":0.311675830086367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001504739,0.001592689,0.001061528,0.001657551,0.002300051,0.002958953,0.001949921,0.001946748,0.0116061],"category_scores_gemma":[0.01068107,0.000698989,0.001981053,0.002580783,0.005083345,0.01031906,0.003411631,0.005949884,0.002932306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002184163,"about_ca_system_score_gemma":0.0008166638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00161625,"about_ca_topic_score_gemma":0.001338208,"domain_scores_codex":[0.9976798,0.0005723253,0.0001135165,0.0007891877,0.0004046804,0.0004405509],"domain_scores_gemma":[0.9884881,0.007778795,0.001047861,0.001269586,0.0008531483,0.0005625447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001507272,0.0000933389,0.0006638398,0.0002331112,0.00002986191,0.0003642748,0.0007794407,0.009441304,0.004113621,0.9557736,0.004406828,0.02395019],"study_design_scores_gemma":[0.00002310556,0.00007195463,0.0002746239,0.00005916309,0.00002682586,0.0002540883,0.0001423489,0.01139384,0.00168947,0.9744064,0.01162366,0.00003456506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2266837,0.003439842,0.6643006,0.006125832,0.0007503124,0.0001778298,0.001675826,0.001473258,0.0953728],"genre_scores_gemma":[0.8403752,0.003634899,0.1278476,0.002423613,0.001117837,0.0003248246,0.002012128,0.0007618313,0.02150211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0116061,"threshold_uncertainty_score":0.03882629,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Steiner tree problem; Arithmetic; Combinatorics","authors":[{"name":"Dean Crnković","is_ca":false},{"name":"Doris Dumičić Danilović","is_ca":false},{"name":"Sanja Rukavina","is_ca":false},{"name":"Marina Šimac","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0150886438198155,"gpt":0.2116059718909091,"spread":0.1965173280710936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007648585,0.0008271923,0.000548979,0.001387393,0.001464155,0.001591746,0.0005649535,0.00149398,0.009345974],"category_scores_gemma":[0.001926836,0.0005347145,0.0008473618,0.001310584,0.001122882,0.001277679,0.001032264,0.001269461,0.001180599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008299086,"about_ca_system_score_gemma":0.0006824333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003124358,"about_ca_topic_score_gemma":0.0006769932,"domain_scores_codex":[0.9993485,0.0002647778,0.00004172249,0.00009809747,0.0001536296,0.00009328961],"domain_scores_gemma":[0.9990735,0.0003710709,0.0001620861,0.00011834,0.0001510375,0.0001239008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002183557,0.00003941211,0.0005784971,0.0001214725,0.00002846675,0.0003094638,0.0003134825,0.004737102,0.006759621,0.9645455,0.003490305,0.0188584],"study_design_scores_gemma":[0.0001404365,0.0002127178,0.000860479,0.00006827959,0.00004899349,0.0007874962,0.0002733297,0.03117202,0.004875173,0.9432367,0.01827236,0.00005188397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5885864,0.0009822166,0.2707523,0.001575193,0.0005742018,0.0002027875,0.0006470082,0.0004638043,0.136216],"genre_scores_gemma":[0.7812465,0.0008030964,0.1599233,0.0008117261,0.0002167606,0.0003119971,0.0006238201,0.000231171,0.05583173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009345974,"threshold_uncertainty_score":0.03126544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Muhammad Javaid","is_ca":false},{"name":"Akhlaq Ahmad Bhatti","is_ca":false},{"name":"Muhammad Hussain","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02076032019513221,"gpt":0.2476861153639844,"spread":0.2269257951688522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124076,0.0009111232,0.001086306,0.001678422,0.002003127,0.00269511,0.002115841,0.001302466,0.01175314],"category_scores_gemma":[0.004736771,0.0006977501,0.001710365,0.003373759,0.002316527,0.008307894,0.00305597,0.005134684,0.001004563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001425457,"about_ca_system_score_gemma":0.0008474543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001716091,"about_ca_topic_score_gemma":0.002631708,"domain_scores_codex":[0.99933,0.0001848434,0.00003538736,0.0001988409,0.000129678,0.0001212434],"domain_scores_gemma":[0.9964123,0.002012693,0.0002741125,0.0006199143,0.0003185279,0.0003623517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007305593,0.0000398277,0.0004788547,0.000185683,0.00002148572,0.00004921282,0.0002982631,0.004196084,0.001742451,0.9771063,0.00331593,0.0124929],"study_design_scores_gemma":[0.00001404644,0.00001309337,0.0003053148,0.00002494072,0.00002703899,0.0000496804,0.0001026745,0.01369322,0.0006693762,0.9807179,0.004369975,0.00001278616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2720422,0.002125643,0.5903791,0.003876352,0.0003640011,0.00008257114,0.0009181153,0.0006224305,0.1295896],"genre_scores_gemma":[0.7433916,0.002776908,0.2076492,0.002141465,0.0006371017,0.0002549412,0.002044592,0.0006957293,0.04040837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01175314,"threshold_uncertainty_score":0.0393182,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Quantitative structure–activity relationship; Double bond; Chemistry; Mathematics; Computational chemistry; Organic chemistry; Stereochemistry","authors":[{"name":"Harsha Vardhan K S","is_ca":false},{"name":"Dandela Anuradha","is_ca":false},{"name":"B. Jaganathan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005513974749563501,"gpt":0.2326740027248319,"spread":0.2271600279752684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132199,0.0007484418,0.0006814214,0.00216499,0.0002176351,0.0008550533,0.0003847971,0.0003623256,0.0009912396],"category_scores_gemma":[0.004612472,0.0001404365,0.0004957932,0.00186211,0.0006496215,0.00107747,0.0006903589,0.0006476624,0.0002302662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003588261,"about_ca_system_score_gemma":0.0004064127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00046655,"about_ca_topic_score_gemma":0.0004950565,"domain_scores_codex":[0.9994338,0.0002132105,0.00004099086,0.00007350453,0.0002152024,0.00002323862],"domain_scores_gemma":[0.9984053,0.0009452961,0.0003049987,0.0001193866,0.0001791629,0.00004582791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000300698,0.0002443192,0.01228539,0.0008766206,0.0002575199,0.0001977114,0.000142849,0.486885,0.04078757,0.08704191,0.001155176,0.3698252],"study_design_scores_gemma":[0.0000160023,0.0004390735,0.003702192,0.00005122299,0.00006114152,0.0001774026,0.00005662406,0.9476635,0.01303821,0.03160335,0.003140719,0.00005053375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2169985,0.005241999,0.766711,0.000323269,0.0001593043,0.0001768025,0.0004043569,0.0003742058,0.009610625],"genre_scores_gemma":[0.8701801,0.001668554,0.1265754,0.0000469161,0.00006572742,0.00011569,0.0002721659,0.00003820987,0.001037184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00216499,"threshold_uncertainty_score":0.005987763,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Harmony (Music); Mathematics; Art","authors":[{"name":"Hui Chuan Lu","is_ca":false},{"name":"Hung‐Lin Fu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06585452461742525,"gpt":0.3392089260860068,"spread":0.2733544014685816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062794,0.0008034521,0.001257105,0.003649408,0.002944787,0.003344819,0.001909472,0.001443389,0.01896854],"category_scores_gemma":[0.004520796,0.0009015537,0.001265735,0.005025166,0.003059432,0.01064227,0.004201107,0.005175572,0.002456561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001206779,"about_ca_system_score_gemma":0.000509406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008135511,"about_ca_topic_score_gemma":0.001192645,"domain_scores_codex":[0.9990597,0.0002020896,0.00005158082,0.0002556502,0.0003145865,0.0001163945],"domain_scores_gemma":[0.9972127,0.00158557,0.0002327899,0.0003671206,0.0003064416,0.0002954494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001631314,0.00001778774,0.000126004,0.00006526184,0.00001288099,0.00004919884,0.0002252583,0.0007412703,0.0003617857,0.9816886,0.004227294,0.01246833],"study_design_scores_gemma":[0.000006513493,0.000006111733,0.000140761,0.00001166063,0.00001433915,0.00007716813,0.00008006176,0.001708616,0.0001692975,0.9850792,0.01270033,0.000006118067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1267323,0.009040008,0.4363074,0.009852619,0.002749995,0.0001047722,0.0008752074,0.0007850285,0.4135527],"genre_scores_gemma":[0.6301637,0.01231224,0.1400407,0.004513259,0.005993803,0.0002916408,0.001563712,0.001475265,0.2036457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01896854,"threshold_uncertainty_score":0.06345612,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Mathematical analysis","authors":[{"name":"Zhen-Chun Chen","is_ca":false},{"name":"Kuo‐Ching Huang","is_ca":false},{"name":"Chiang Lin","is_ca":false},{"name":"Jen-Ling Shang","is_ca":false},{"name":"Ming-Ju Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02768656096095853,"gpt":0.24601147773531,"spread":0.2183249167743515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008775883,0.0001318893,0.0003571798,0.001009386,0.001173459,0.001695151,0.0004524855,0.0002882168,0.003201436],"category_scores_gemma":[0.005350537,0.0001465865,0.0003141461,0.0007842376,0.001404709,0.001498446,0.001294959,0.0004703536,0.0001667798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006081869,"about_ca_system_score_gemma":0.0003851435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001257184,"about_ca_topic_score_gemma":0.0015365,"domain_scores_codex":[0.9997239,0.0001003077,0.00001648218,0.00005215992,0.00004550267,0.00006165066],"domain_scores_gemma":[0.9966193,0.001956286,0.0004580882,0.0002205627,0.0002711912,0.0004743766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002285412,0.00004261365,0.0263986,0.00007868047,0.00004825813,0.0002404802,0.001451899,0.01159424,0.004045684,0.937925,0.0005905055,0.01735544],"study_design_scores_gemma":[0.00003648339,0.0001022334,0.02285167,0.00002147548,0.00004995589,0.0005642351,0.001165842,0.0633011,0.001374147,0.9080938,0.002416163,0.00002302058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9821278,0.0001173714,0.007579143,0.0001585215,0.000005505631,0.000003005396,0.00003740749,0.00001605878,0.009955173],"genre_scores_gemma":[0.9980862,0.00006773357,0.0008162565,0.000008240328,0.000008015675,0.000002692204,0.00002501424,0.000003901841,0.0009819096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003201436,"threshold_uncertainty_score":0.01070982,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Grid; Combinatorics; Arithmetic; Geometry","authors":[{"name":"Xiao‐Nan Lu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01618127911023618,"gpt":0.2435606960975104,"spread":0.2273794169872742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005035563,0.0008369013,0.001165079,0.0007078103,0.0006998712,0.001611324,0.001375448,0.001319661,0.01092057],"category_scores_gemma":[0.002914478,0.0006475877,0.0006758696,0.001279864,0.0007665941,0.001329868,0.001875765,0.001379233,0.001343956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106446,"about_ca_system_score_gemma":0.0007346048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003079155,"about_ca_topic_score_gemma":0.003176496,"domain_scores_codex":[0.9994946,0.0001637751,0.00002043468,0.00006858184,0.0001141896,0.0001384553],"domain_scores_gemma":[0.9987778,0.0006764319,0.0001013203,0.000207793,0.00009859673,0.0001379958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000445703,0.00009059739,0.0005920941,0.0002946039,0.00005093806,0.0001802588,0.0001830282,0.4769766,0.007544965,0.4509589,0.01055757,0.05212476],"study_design_scores_gemma":[0.00006804211,0.00007194989,0.0003593391,0.00002759499,0.00001474873,0.000109848,0.00006978573,0.7866887,0.002411173,0.2040903,0.006069173,0.00001927698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2421508,0.0008391503,0.6861692,0.0007023841,0.0001449184,0.0001229193,0.00148849,0.0007750184,0.06760716],"genre_scores_gemma":[0.7512884,0.0008103203,0.2184574,0.0001989252,0.00005612696,0.0002695129,0.001332441,0.0003711219,0.02721566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01092057,"threshold_uncertainty_score":0.036533,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","authors":[{"name":"Kai Chung Cheng","is_ca":false},{"name":"Hung‐Lin Fu","is_ca":false},{"name":"Nam Po Chiang","is_ca":false},{"name":"Chien Kuo Tzeng","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09138336481651767,"gpt":0.3513250673472211,"spread":0.2599417025307034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002553483,0.0009809143,0.001129549,0.002553238,0.001766141,0.002549621,0.002403097,0.001286841,0.01047341],"category_scores_gemma":[0.0105996,0.0006178419,0.001328489,0.003734749,0.004773625,0.007147315,0.002616755,0.002777217,0.0004152295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001772705,"about_ca_system_score_gemma":0.0009653359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002192617,"about_ca_topic_score_gemma":0.001904824,"domain_scores_codex":[0.9990194,0.0003577598,0.00005354294,0.0001982218,0.0002341974,0.0001368065],"domain_scores_gemma":[0.9938426,0.004300357,0.0006150031,0.0004592839,0.0004206811,0.0003620841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001401134,0.000005044866,0.0001520971,0.00002172981,0.000005239401,0.00001610923,0.0001421249,0.004430734,0.0002779739,0.9924436,0.0001272492,0.002363971],"study_design_scores_gemma":[0.00000776765,0.00004240869,0.0002388707,0.00001567024,0.00001220579,0.0000402467,0.0001623776,0.01988039,0.0003486258,0.9775378,0.001704682,0.000008897911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5187621,0.002448273,0.4303179,0.001586662,0.000185494,0.00005899004,0.0002287356,0.00008958182,0.04632221],"genre_scores_gemma":[0.9223316,0.001886059,0.05082079,0.0001913568,0.0002148561,0.0001229892,0.0002106122,0.0001111843,0.02411055],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01047341,"threshold_uncertainty_score":0.03503704,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal array; Combinatorics; Arithmetic; Discrete mathematics; Statistics","authors":[{"name":"Dean Crnković","is_ca":false},{"name":"Doris Dumičić Danilović","is_ca":false},{"name":"Sanja Rukavina","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01960781965211929,"gpt":0.2496168180774941,"spread":0.2300089984253748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001686458,0.001008835,0.0006753416,0.002124415,0.002235337,0.002469371,0.0009775274,0.002020781,0.007260877],"category_scores_gemma":[0.005694233,0.0005497917,0.000740209,0.00210773,0.003635406,0.003601787,0.002819199,0.002238301,0.001699078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001617095,"about_ca_system_score_gemma":0.001453276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006703588,"about_ca_topic_score_gemma":0.0007362111,"domain_scores_codex":[0.9984604,0.0006110672,0.00006548785,0.0001671303,0.0004055609,0.0002904008],"domain_scores_gemma":[0.9969099,0.001461033,0.0006138512,0.000443796,0.0003599897,0.0002115367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000217166,0.000006944896,0.00005440405,0.00001229517,0.000002039229,0.00002758788,0.00008532243,0.0007494785,0.000220525,0.9960224,0.0004381207,0.002359255],"study_design_scores_gemma":[0.0000121133,0.00001147126,0.00004328522,0.00001119653,0.000003029668,0.00005483999,0.00003078228,0.002699271,0.0002293976,0.9955701,0.001324471,0.00001002121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5203271,0.001750274,0.243125,0.004015041,0.0008610392,0.0001806248,0.0006226454,0.0002468066,0.2288715],"genre_scores_gemma":[0.8962194,0.001511294,0.0459436,0.001029979,0.0008587952,0.0002661807,0.0003357588,0.0001566184,0.05367844],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007260877,"threshold_uncertainty_score":0.02429008,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Cauchy distribution; Statistics; Geology","authors":[{"name":"Matloob Anwar","is_ca":false},{"name":"‎Josip Pečarić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1988763507986497,"gpt":0.3283809436522319,"spread":0.1295045928535822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002176626,0.001139923,0.001285452,0.003336834,0.002000769,0.002223636,0.001205448,0.002009476,0.007549867],"category_scores_gemma":[0.005155728,0.0005216905,0.001824568,0.00161997,0.003847685,0.00618268,0.003223727,0.005297255,0.001328674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001798401,"about_ca_system_score_gemma":0.0006960436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007212204,"about_ca_topic_score_gemma":0.0007230774,"domain_scores_codex":[0.9992304,0.0002508842,0.00004371908,0.0001636054,0.0002424056,0.00006901618],"domain_scores_gemma":[0.9983432,0.0007278213,0.0001324965,0.0002367322,0.0004244109,0.0001353922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006123965,0.00000372661,0.00002580787,0.00001705953,0.000007512153,0.00001575048,0.0000710672,0.0001790513,0.0002747317,0.9963522,0.0007590929,0.002287775],"study_design_scores_gemma":[0.000005284126,0.000007989902,0.0001197,0.000009039026,0.000009820288,0.00009558817,0.00002920102,0.002636913,0.0004630862,0.9907365,0.005875458,0.00001144099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0816495,0.006790799,0.558746,0.00984065,0.001900705,0.00005586441,0.0003607925,0.0003668028,0.3402889],"genre_scores_gemma":[0.7048004,0.005420795,0.1322103,0.00170325,0.003027321,0.0001966862,0.0002689408,0.0005776725,0.1517946],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.007549867,"threshold_uncertainty_score":0.02525675,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Predator; Mathematical economics; Applied mathematics; Econometrics; Statistics; Ecology; Predation; Biology","authors":[{"name":"M. Saqib Khan","is_ca":false},{"name":"Absar Ul Haq","is_ca":false},{"name":"Waqas Nazeer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06544005299555608,"gpt":0.3506684593420196,"spread":0.2852284063464635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002010927,0.0004626942,0.0007759886,0.0005353089,0.0006702723,0.001088987,0.0008367886,0.001312157,0.001682309],"category_scores_gemma":[0.0006408106,0.0002358957,0.0007167169,0.0003475747,0.0009615678,0.0008787874,0.0008884447,0.000536741,0.0001282524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005216,"about_ca_system_score_gemma":0.0006211115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01090695,"about_ca_topic_score_gemma":0.005258248,"domain_scores_codex":[0.9999189,0.00002190977,0.000004384864,0.00001771417,0.00001863467,0.00001839806],"domain_scores_gemma":[0.9998382,0.00004403185,0.00005551775,0.00001216242,0.00002034121,0.00002963452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001105699,0.00007489958,0.002219202,0.00008653771,0.0000903507,0.001237076,0.0002766583,0.8631223,0.01683922,0.1114657,0.0006176087,0.003859851],"study_design_scores_gemma":[0.000007582371,0.00001711953,0.0002740358,0.000003298676,0.0000105276,0.00005051986,0.0000287174,0.9940959,0.0002024404,0.005000244,0.0003003461,0.000009268982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7909973,0.0006958223,0.1770116,0.001104509,0.0001066051,0.00005898812,0.0001500943,0.0001436223,0.0297314],"genre_scores_gemma":[0.9899986,0.0001939099,0.003921699,0.00004588675,0.00001955729,0.00003187039,0.00002873536,0.00001147578,0.00574831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01090695,"threshold_uncertainty_score":0.02168697,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Arithmetic; Discrete mathematics","authors":[{"name":"Shyam Saurabh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01375778227805698,"gpt":0.227423802613668,"spread":0.213666020335611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003906104,0.0003067308,0.0001938455,0.0006767117,0.0003854162,0.0008763207,0.0003482879,0.0003350025,0.004985796],"category_scores_gemma":[0.001275875,0.0001855485,0.0002937151,0.0006236144,0.0008226905,0.0008289175,0.0006043066,0.0007526191,0.0006867461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000466359,"about_ca_system_score_gemma":0.0003585554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001759153,"about_ca_topic_score_gemma":0.0002800945,"domain_scores_codex":[0.9996125,0.0001050925,0.00002751596,0.00006695442,0.0001302379,0.00005773374],"domain_scores_gemma":[0.9993844,0.000188446,0.0001247741,0.0001577679,0.00009193974,0.00005268977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008559714,0.0000306473,0.0002765952,0.00006040458,0.0000112097,0.00009040249,0.0001854677,0.008624493,0.01595738,0.9208404,0.0006256285,0.05321163],"study_design_scores_gemma":[0.00005994448,0.0002577584,0.0003597606,0.00005652559,0.00001792046,0.0004547205,0.0001556613,0.07270817,0.01765842,0.8912712,0.01696687,0.00003298363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2322212,0.0005979647,0.7171607,0.0002655706,0.0001093351,0.0001141141,0.0001518931,0.0002087402,0.04917045],"genre_scores_gemma":[0.7698231,0.0006069818,0.2120695,0.000107741,0.00007691244,0.0001764975,0.0001536291,0.0000541974,0.01693143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004985796,"threshold_uncertainty_score":0.01667917,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Pure mathematics; Discrete mathematics","authors":[{"name":"Karnika Sharma","is_ca":false},{"name":"Vijay Kumar Bhat","is_ca":false},{"name":"Pradeep Singh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0680899099910209,"gpt":0.3257589354746649,"spread":0.2576690254836441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002406062,0.0002494313,0.0002942566,0.001085595,0.0007955013,0.0008531241,0.0004633547,0.0004076833,0.002712478],"category_scores_gemma":[0.0009432507,0.0001507468,0.0003533762,0.0005758514,0.001713861,0.001038432,0.0006325687,0.0005343887,0.0002539212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000622517,"about_ca_system_score_gemma":0.0003186384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184974,"about_ca_topic_score_gemma":0.001133458,"domain_scores_codex":[0.9997216,0.00008105408,0.00001254467,0.00006494846,0.00006938968,0.00005047321],"domain_scores_gemma":[0.9993912,0.0002189856,0.0001443907,0.00007736509,0.00006425424,0.0001038136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006711767,0.00002979942,0.0007719595,0.0000673526,0.00001287849,0.0002330274,0.0003962031,0.006209851,0.00397406,0.9768583,0.001013237,0.01036624],"study_design_scores_gemma":[0.00001674996,0.00002649214,0.001022934,0.00001547721,0.00001114709,0.0002054959,0.0002303856,0.02678696,0.001162283,0.9668103,0.003698841,0.00001285555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8673369,0.0003243675,0.09382427,0.0007108515,0.0000543289,0.00004940691,0.0003532506,0.0001818098,0.03716488],"genre_scores_gemma":[0.9763321,0.0002612296,0.01741512,0.00009493866,0.00005671869,0.00005326754,0.0003698629,0.00003179094,0.005385085],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002712478,"threshold_uncertainty_score":0.009074152,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Equivalence (formal languages); Combinatorics; Set (abstract data type); Graph; Unipotent; Discrete mathematics; Computer science; Algorithm","authors":[{"name":"Nicholas J. Cavenagh","is_ca":false},{"name":"Diane Donovan","is_ca":false},{"name":"Abdollah Khodkar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02718840041487686,"gpt":0.2203121419055028,"spread":0.193123741490626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008683661,0.0004559252,0.0005798529,0.001154136,0.001474516,0.00167028,0.0007986291,0.0004321843,0.002706277],"category_scores_gemma":[0.002377616,0.0005451633,0.0008097447,0.0005040992,0.002035781,0.002271564,0.001603823,0.001388849,0.0004050844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008018833,"about_ca_system_score_gemma":0.0004445634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003836587,"about_ca_topic_score_gemma":0.000658405,"domain_scores_codex":[0.9990157,0.0002442308,0.00007068707,0.0002549101,0.0002508439,0.0001635732],"domain_scores_gemma":[0.9979468,0.0009404938,0.000314517,0.0002683032,0.0002597505,0.0002701825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005814384,0.00004320785,0.0008067805,0.00005759401,0.000008988862,0.00008326489,0.0004008579,0.002141139,0.005342171,0.9804223,0.0008843099,0.00975116],"study_design_scores_gemma":[0.00004171616,0.00008049808,0.001083546,0.00002874225,0.00002104521,0.0003899085,0.0002542308,0.009852557,0.009288447,0.9680669,0.01084972,0.00004255943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7228079,0.0004138931,0.2363745,0.0003237858,0.00007258499,0.0001322424,0.0007893771,0.000237132,0.03884866],"genre_scores_gemma":[0.8805949,0.0002661152,0.1077298,0.0001752037,0.0001261124,0.0002492349,0.001308881,0.0001054773,0.009444304],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002706277,"threshold_uncertainty_score":0.009053469,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"K. B. Gray","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1728849121065833,"gpt":0.4317869108608392,"spread":0.2589019987542559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.1611502,0.004990361,0.007443862,0.00366754,0.001611038,0.003413924,0.003683913,0.0031816,0.01845721],"category_scores_gemma":[0.2578369,0.00203149,0.008293312,0.005623097,0.005449547,0.007990217,0.005063307,0.006847522,0.001759593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003887555,"about_ca_system_score_gemma":0.004837224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002872493,"about_ca_topic_score_gemma":0.001544616,"domain_scores_codex":[0.8854576,0.09742196,0.004424356,0.005405278,0.005833977,0.001456745],"domain_scores_gemma":[0.6460904,0.3231365,0.005661912,0.01694311,0.007334021,0.0008341111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001209599,0.0002518687,0.0009877528,0.001804733,0.0007866038,0.0002397762,0.0005188353,0.02582199,0.0004221979,0.8643616,0.006709078,0.09688601],"study_design_scores_gemma":[0.0007234553,0.0004732238,0.0003619966,0.0002286445,0.0003091411,0.0001119453,0.00006705886,0.06541246,0.0004605631,0.921548,0.01024103,0.00006246122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002032694,0.001319007,0.9910979,0.00106317,0.0003062471,0.0008311966,0.0003182256,0.0001541078,0.002877577],"genre_scores_gemma":[0.06514128,0.003408299,0.9120239,0.00159869,0.0009418008,0.01088409,0.0006772839,0.0002085323,0.005116024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1611502,"threshold_uncertainty_score":0.8522539,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Arooj Ibrahim","is_ca":false},{"name":"Saima Nazeer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03894015073502213,"gpt":0.250895491368093,"spread":0.2119553406330708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237143,0.0003249435,0.000305069,0.001368606,0.0005822054,0.0006587458,0.0006527646,0.0003710678,0.003564597],"category_scores_gemma":[0.003688648,0.0001618363,0.0003713102,0.0009355671,0.001162539,0.002445315,0.0006980301,0.0006858213,0.0002538931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005263574,"about_ca_system_score_gemma":0.0002002856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000497364,"about_ca_topic_score_gemma":0.0005404534,"domain_scores_codex":[0.9996845,0.00007127122,0.0000108485,0.00007809851,0.00009441138,0.00006095453],"domain_scores_gemma":[0.9979141,0.001280279,0.0002182482,0.0002211087,0.0002292409,0.0001369257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000191067,0.00005918664,0.004777612,0.0003098327,0.00004628428,0.0003859478,0.0006431537,0.1039136,0.01577597,0.8152901,0.002200114,0.05640709],"study_design_scores_gemma":[0.00001625341,0.00009318088,0.006213376,0.00004576983,0.00003439404,0.0008392439,0.0004085158,0.207684,0.006877374,0.7732183,0.004527697,0.00004182751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6323218,0.001683143,0.3297898,0.0006311132,0.00008795779,0.00003237172,0.0002685811,0.0001515882,0.03503357],"genre_scores_gemma":[0.9780759,0.000744708,0.01716961,0.00005211715,0.00005584218,0.00002977665,0.0001363043,0.0000613892,0.003674268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003564597,"threshold_uncertainty_score":0.01192474,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Dual (grammatical number); Mathematics; Polar; Type (biology); Arithmetic; Combinatorics; Biology; Physics","authors":[{"name":"Nobuo Nakagawa","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1265426283748425,"gpt":0.3571488056256548,"spread":0.2306061772508123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210597,0.0009400115,0.00114858,0.003856752,0.002561225,0.005725706,0.0009029898,0.001535426,0.007581373],"category_scores_gemma":[0.00328638,0.0006376046,0.001062194,0.001736747,0.003163547,0.003538823,0.002964236,0.002659214,0.0008828695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001292853,"about_ca_system_score_gemma":0.0004698094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00123075,"about_ca_topic_score_gemma":0.0008603291,"domain_scores_codex":[0.9994428,0.0002028069,0.00002963673,0.00007320422,0.0001254991,0.0001261437],"domain_scores_gemma":[0.998727,0.0004638465,0.0002398551,0.00006715643,0.0001962599,0.000305813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007184944,0.00001406968,0.0002147927,0.00003256465,0.00001013618,0.0001378504,0.0001268266,0.001868772,0.0003367419,0.9944097,0.0007336639,0.002042961],"study_design_scores_gemma":[0.00002516205,0.00001605406,0.0002197346,0.000036231,0.0000121249,0.0002146175,0.0002193155,0.01194004,0.0002756342,0.98432,0.002706483,0.00001457472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5498986,0.002324434,0.2360605,0.002762482,0.0009156134,0.0001463401,0.001021854,0.0002175861,0.2066526],"genre_scores_gemma":[0.921728,0.001267494,0.04085728,0.0004444169,0.0004520118,0.0001166567,0.0008164818,0.0001408886,0.03417673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007581373,"threshold_uncertainty_score":0.02536225,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Multipartite; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Quantum; Physics","authors":[{"name":"Mary Waterhouse","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006941888503866154,"gpt":0.2082966852506825,"spread":0.2013547967468164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004013196,0.0005171534,0.0004289171,0.001517977,0.0008768038,0.001360824,0.0006025138,0.0007792792,0.007239533],"category_scores_gemma":[0.00189407,0.0004787324,0.0008057518,0.0008244939,0.00095218,0.00132323,0.0009107964,0.0009713082,0.0006030526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105631,"about_ca_system_score_gemma":0.0004355573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002151448,"about_ca_topic_score_gemma":0.002795441,"domain_scores_codex":[0.9996141,0.00009201447,0.00002214117,0.00009676502,0.00007917904,0.00009595505],"domain_scores_gemma":[0.9989761,0.0004065478,0.0001926478,0.0001115154,0.0001486274,0.0001645777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001413207,0.00005500889,0.001559202,0.000165076,0.00004630645,0.0002691816,0.0004757743,0.06010029,0.008274222,0.898068,0.004931228,0.02591441],"study_design_scores_gemma":[0.00002867502,0.00003550252,0.001492931,0.00003383967,0.00001500899,0.0001931606,0.0001180327,0.2182006,0.001140817,0.7739127,0.004799681,0.00002910065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5896378,0.0007261304,0.3597922,0.000703776,0.0001004828,0.0001716141,0.001336466,0.0002932919,0.04723818],"genre_scores_gemma":[0.9360191,0.0004668211,0.04792015,0.0002035605,0.00008207037,0.0001665515,0.00114501,0.0001635443,0.01383316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007239533,"threshold_uncertainty_score":0.02421862,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Discrete mathematics","authors":[{"name":"Dean Crnković","is_ca":false},{"name":"Vedrana Mikulić Crnković","is_ca":false},{"name":"B. G. Rodrigues","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01842192429171822,"gpt":0.2384382764047951,"spread":0.2200163521130769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007062097,0.0006831253,0.0006141291,0.00148284,0.001516186,0.001964793,0.000968445,0.001476993,0.003902582],"category_scores_gemma":[0.003898225,0.000511431,0.0007932096,0.001015567,0.002559854,0.002443461,0.001476224,0.002192272,0.0005102907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001556775,"about_ca_system_score_gemma":0.001383787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001238104,"about_ca_topic_score_gemma":0.001492323,"domain_scores_codex":[0.999243,0.0002276265,0.00003635477,0.0001240231,0.0001951168,0.0001739279],"domain_scores_gemma":[0.997664,0.00119741,0.0004039283,0.0002384311,0.0002381452,0.0002582497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005509473,0.00001951746,0.0002090043,0.00003843629,0.000007193232,0.00006875338,0.0001565729,0.002842175,0.0007604244,0.9908555,0.001258179,0.003729169],"study_design_scores_gemma":[0.00002130198,0.000015871,0.0001552128,0.000009740535,0.000005253432,0.00005188206,0.00005459927,0.007664784,0.0005593564,0.990275,0.001176889,0.00001022854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7416047,0.00138076,0.1480298,0.005282368,0.0003058614,0.0001245382,0.0009647047,0.0003579458,0.1019492],"genre_scores_gemma":[0.9547862,0.0006330216,0.02643754,0.0005336482,0.0003305219,0.0001263278,0.0005445039,0.0001406581,0.01646759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003902582,"threshold_uncertainty_score":0.01305544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Certification; Combinatorics; Graph; Discrete mathematics; Political science","authors":[{"name":"Mateusz Miotk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01611058620925376,"gpt":0.290874895316638,"spread":0.2747643091073843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009652274,0.0008605316,0.0006460934,0.00220154,0.001034324,0.001719021,0.001264494,0.0007746491,0.009495822],"category_scores_gemma":[0.007750324,0.0005022156,0.0006362422,0.001679162,0.001258578,0.002401707,0.002171481,0.00155464,0.002141203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001775651,"about_ca_system_score_gemma":0.001970473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003190984,"about_ca_topic_score_gemma":0.003745157,"domain_scores_codex":[0.9987914,0.0001639991,0.00006168886,0.000351427,0.0004280871,0.0002035444],"domain_scores_gemma":[0.9950631,0.001854736,0.0004547184,0.001109579,0.001072076,0.0004457879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001353573,0.000298862,0.005752706,0.0009321459,0.0001212809,0.001629314,0.001292576,0.08097097,0.046723,0.4949384,0.05806561,0.3079216],"study_design_scores_gemma":[0.0002665304,0.0002759854,0.003593236,0.0001644773,0.0001198365,0.001423823,0.0006174936,0.1864035,0.0369969,0.6745298,0.09552125,0.00008725408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3268442,0.0008584589,0.5333186,0.002141443,0.0007172223,0.001122797,0.004316767,0.005368313,0.1253121],"genre_scores_gemma":[0.7766201,0.0006636226,0.1439526,0.001178129,0.0003599084,0.0007138288,0.007108102,0.001113554,0.06829008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009495822,"threshold_uncertainty_score":0.03176671,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Alpha (finance); Graph; Statistics","authors":[{"name":"Saad I. El‐Zanati","is_ca":false},{"name":"Charles Vanden Eynden","is_ca":false},{"name":"Hung‐Lin Fu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01889335300189561,"gpt":0.2539434149807666,"spread":0.235050061978871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005222511,0.001368229,0.001844595,0.003790799,0.003193985,0.005902347,0.003660813,0.003165246,0.008605421],"category_scores_gemma":[0.02747452,0.001315631,0.001157569,0.003896643,0.007062973,0.01402719,0.003480253,0.006452286,0.001127428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004480142,"about_ca_system_score_gemma":0.001496797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001882461,"about_ca_topic_score_gemma":0.001685368,"domain_scores_codex":[0.9978204,0.001056651,0.00008151041,0.000372404,0.0003808859,0.0002881987],"domain_scores_gemma":[0.9672524,0.02606275,0.001867382,0.001621916,0.001164009,0.00203152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001432358,0.00004310099,0.0007924028,0.0001044765,0.00001406916,0.00002843134,0.0002106771,0.006638764,0.0005142503,0.9802275,0.004157043,0.007126071],"study_design_scores_gemma":[0.00002653839,0.00001123169,0.0003210794,0.00002781181,0.00001088572,0.00004029099,0.00004951366,0.0224131,0.0002203424,0.9755293,0.001336287,0.00001359504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4818406,0.005645005,0.2838521,0.02352288,0.0011744,0.0001050453,0.001240668,0.0006507971,0.2019685],"genre_scores_gemma":[0.9017805,0.003509231,0.06224846,0.001746103,0.001943649,0.0003536198,0.0008585998,0.0004239384,0.02713594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008605421,"threshold_uncertainty_score":0.03250581,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Colored; Generalization; Combinatorics; Discrete mathematics; Sociology","authors":[{"name":"Kumi Kobata","is_ca":false},{"name":"Yasuo Ohno","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02533350222738299,"gpt":0.2425140892633098,"spread":0.2171805870359268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274575,0.000528457,0.0008229696,0.001483117,0.002287259,0.002539688,0.001799344,0.001653389,0.006524734],"category_scores_gemma":[0.003764441,0.0006263876,0.001106015,0.001660835,0.00353041,0.004846235,0.002408728,0.003042354,0.0003341961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001755271,"about_ca_system_score_gemma":0.001081555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002974371,"about_ca_topic_score_gemma":0.003344428,"domain_scores_codex":[0.9992546,0.0003256719,0.00002371634,0.0001579155,0.0001247724,0.0001132955],"domain_scores_gemma":[0.9975139,0.001483936,0.0002228999,0.0002993559,0.0002264899,0.0002534891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005195172,0.000006189905,0.00005431588,0.00001315795,0.000003308431,0.00001275478,0.00003812881,0.001750741,0.0001117008,0.9966422,0.0004930558,0.0008693247],"study_design_scores_gemma":[0.000004712555,0.000002205459,0.00005445516,0.000005785072,0.000003192876,0.00002023392,0.00002351687,0.01014402,0.00007500642,0.9883831,0.001279608,0.000004047086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2609815,0.001690647,0.5973394,0.004524633,0.0003336909,0.0000793303,0.0004159537,0.0002228373,0.1344121],"genre_scores_gemma":[0.8776997,0.001202722,0.09132648,0.001069441,0.0003910734,0.0001418373,0.0003237254,0.0001541201,0.02769084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006524734,"threshold_uncertainty_score":0.02182746,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Soft set; Mathematics; Set (abstract data type); Artificial intelligence; Computer science","authors":[{"name":"Bobin George","is_ca":false},{"name":"Jinta Jose","is_ca":false},{"name":"Rajesh K. Thumbakara","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03370679677414942,"gpt":0.3233366576343858,"spread":0.2896298608602365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859864,0.0008323708,0.0007571512,0.004588237,0.001249088,0.004017757,0.001378653,0.001476382,0.003921726],"category_scores_gemma":[0.005053428,0.0005978126,0.001305092,0.004417303,0.005187933,0.009458936,0.003644038,0.003109452,0.0007439811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001824678,"about_ca_system_score_gemma":0.001270774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001503892,"about_ca_topic_score_gemma":0.001979973,"domain_scores_codex":[0.9976193,0.001021686,0.0001647084,0.0004749177,0.0006102326,0.0001091151],"domain_scores_gemma":[0.9962113,0.001952053,0.0003398032,0.0006695868,0.000553048,0.0002743226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009885647,0.00001264043,0.0001391524,0.00008114123,0.00001823533,0.0001195578,0.0002867818,0.003984889,0.00120743,0.9776356,0.0005190179,0.01598567],"study_design_scores_gemma":[0.000006145453,0.00001809889,0.0001188892,0.00007407944,0.00001946015,0.0001525777,0.0001274035,0.01815527,0.0008961908,0.9618995,0.01850444,0.00002789841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00525312,0.001041857,0.9772242,0.0006875069,0.0001278955,0.00005403171,0.00008942259,0.000137128,0.01538479],"genre_scores_gemma":[0.2328167,0.003525261,0.75197,0.001078831,0.0004938733,0.0002611147,0.0002888385,0.0001947753,0.009370597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004588237,"threshold_uncertainty_score":0.01512456,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Fibonacci number; Division (mathematics); Mathematics; Arithmetic; Genealogy; Combinatorics; History","authors":[{"name":"Elahe Mehraban","is_ca":false},{"name":"Ömür Deveci","is_ca":false},{"name":"Evren Hınçal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007387932025214829,"gpt":0.278133841525737,"spread":0.2707459095005222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004896461,0.0006160188,0.0003347847,0.00144116,0.001027443,0.0008682449,0.0005042989,0.0005311298,0.008216484],"category_scores_gemma":[0.002415918,0.0002462814,0.0004997632,0.0009407462,0.001312424,0.001910552,0.001079901,0.0009607204,0.001766478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008502768,"about_ca_system_score_gemma":0.000529536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008872029,"about_ca_topic_score_gemma":0.0006865541,"domain_scores_codex":[0.9996371,0.00007511464,0.00002867643,0.00009665843,0.0001119579,0.000050412],"domain_scores_gemma":[0.9994869,0.0001775038,0.00006509989,0.00006176644,0.0001276522,0.00008107424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002483833,0.00001332879,0.0003005557,0.00004999683,0.000004357626,0.0001176877,0.0002325948,0.003039088,0.00249759,0.9514953,0.000876984,0.04134757],"study_design_scores_gemma":[0.00001226105,0.00007421008,0.0005133869,0.0000408253,0.000009542427,0.0005461859,0.0001549905,0.03633413,0.006990146,0.9209245,0.03436517,0.00003465485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.117797,0.001481768,0.771858,0.0005476825,0.0004123367,0.0001353146,0.0001941722,0.0004301162,0.1071437],"genre_scores_gemma":[0.6911287,0.002244073,0.2632041,0.0004197606,0.000525703,0.0003164677,0.0003330684,0.0003048664,0.04152324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008216484,"threshold_uncertainty_score":0.02748686,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Zia Ullah Khan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01389608018051692,"gpt":0.2770265766330506,"spread":0.2631304964525337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299757,0.0005378172,0.0004660064,0.00201406,0.0005976324,0.0008484736,0.0007391537,0.0006161389,0.004811823],"category_scores_gemma":[0.004301552,0.0002366373,0.0003356665,0.0007779729,0.001565081,0.001649601,0.0009042137,0.0006094716,0.0007571854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004449515,"about_ca_system_score_gemma":0.0002282524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000409946,"about_ca_topic_score_gemma":0.0003410613,"domain_scores_codex":[0.9995325,0.0001475581,0.00001991144,0.0001128261,0.00008932226,0.0000978985],"domain_scores_gemma":[0.9972041,0.001490846,0.000492841,0.000172422,0.0003078766,0.0003319416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002576035,0.0000684105,0.002485061,0.0002484598,0.00004298296,0.0004168911,0.0004994213,0.04330841,0.02737972,0.8972776,0.00288624,0.02512918],"study_design_scores_gemma":[0.00003467376,0.00009743805,0.001872979,0.00005485864,0.00002648395,0.0004701816,0.0002918263,0.12218,0.007907981,0.8628353,0.004182855,0.00004533849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7735518,0.0009409015,0.1834207,0.0005944917,0.00009494778,0.00006277647,0.0003682724,0.0002423102,0.04072376],"genre_scores_gemma":[0.9766332,0.000318011,0.02006024,0.00006491313,0.00007163171,0.00005757383,0.000138731,0.00005719262,0.002598541],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004811823,"threshold_uncertainty_score":0.01609713,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Guifu Su","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04478669488987825,"gpt":0.2903861804508267,"spread":0.2455994855609485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649011,0.0003954634,0.0005698405,0.002283765,0.001228693,0.001618004,0.0008257948,0.0005272711,0.003448384],"category_scores_gemma":[0.002643292,0.000296197,0.000655991,0.0009363952,0.001533192,0.001729543,0.0006531298,0.001111964,0.0002971185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001121703,"about_ca_system_score_gemma":0.0003340247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009889596,"about_ca_topic_score_gemma":0.001291684,"domain_scores_codex":[0.9994665,0.0001208396,0.00002246162,0.0001645211,0.0001009351,0.0001247106],"domain_scores_gemma":[0.9983048,0.0006834827,0.0004049242,0.0002204903,0.0002048873,0.0001812409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001303983,0.00002920816,0.002056328,0.0001056724,0.00003387149,0.0001803184,0.0002130331,0.0157928,0.006933945,0.9642681,0.0009007869,0.009355507],"study_design_scores_gemma":[0.00002773034,0.00005991107,0.004321394,0.00004118311,0.00004634755,0.0005079265,0.0002697543,0.07297891,0.006347638,0.9112204,0.004129598,0.0000491889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8252693,0.001258514,0.1050958,0.0005303145,0.00004192156,0.00003869449,0.0004063177,0.0003054718,0.06705364],"genre_scores_gemma":[0.9813951,0.0002923696,0.01474602,0.00006827628,0.00003310934,0.00001983277,0.0001893215,0.00004005366,0.003215882],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003448384,"threshold_uncertainty_score":0.01153606,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Square (algebra); Dimension (graph theory); Domination analysis; Graph; Metric dimension","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.007561251675427035,"gpt":0.2206023824529386,"spread":0.2130411307775116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000368224,0.000430561,0.0003906774,0.0007510737,0.001314698,0.001202558,0.0005816357,0.0003824354,0.005377241],"category_scores_gemma":[0.001668561,0.000147462,0.0005910094,0.0009501351,0.001077547,0.001989158,0.0009512628,0.001063599,0.0003806075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013909,"about_ca_system_score_gemma":0.0003610449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003178824,"about_ca_topic_score_gemma":0.003415252,"domain_scores_codex":[0.9995522,0.00008654123,0.00001923073,0.0001263013,0.00009811251,0.0001177244],"domain_scores_gemma":[0.9987888,0.0005579105,0.0001638506,0.0001417481,0.000183134,0.0001646498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001223985,0.00004054757,0.003417054,0.0001554092,0.00005116034,0.0003400989,0.0007829742,0.02078137,0.004398284,0.9368442,0.00656681,0.02649977],"study_design_scores_gemma":[0.00004668374,0.00005977219,0.003619194,0.00003931071,0.00007402903,0.0006726488,0.0005493907,0.07853328,0.004069068,0.8915091,0.02079361,0.00003394802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7730308,0.000715636,0.1393619,0.001078457,0.00007504856,0.00005824983,0.000934928,0.0001854416,0.08455957],"genre_scores_gemma":[0.9715424,0.0004624452,0.01163519,0.0002020674,0.00007445024,0.00004353135,0.0008044811,0.00008007082,0.0151553],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005377241,"threshold_uncertainty_score":0.01798862,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Mikio Kano","is_ca":false},{"name":"Haruhide Matsuda","is_ca":false},{"name":"Hajime Matsumura","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02565338256795302,"gpt":0.2986187748509654,"spread":0.2729653922830124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116097,0.001004798,0.0007971522,0.001980225,0.002394173,0.002598652,0.001427613,0.00134219,0.01551903],"category_scores_gemma":[0.003061528,0.000823478,0.00114547,0.003915153,0.002617568,0.005528169,0.002503371,0.002070948,0.00170418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186133,"about_ca_system_score_gemma":0.0008698749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066878,"about_ca_topic_score_gemma":0.0018568,"domain_scores_codex":[0.9983962,0.0003566182,0.0001189643,0.0006266994,0.0002349062,0.00026654],"domain_scores_gemma":[0.9972549,0.001179421,0.0005445498,0.0003273676,0.0003172353,0.0003765937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001364646,0.0000712048,0.0007667242,0.0001646979,0.00002782286,0.0002467207,0.0005353353,0.007481421,0.002119008,0.9711127,0.003825504,0.01351254],"study_design_scores_gemma":[0.00004796413,0.00005338761,0.0005160304,0.0000291576,0.00002525339,0.000213659,0.0002161528,0.0218558,0.001118576,0.9675264,0.008371693,0.00002590226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3649766,0.0008195473,0.5594462,0.001597218,0.0003054182,0.0003989947,0.003888838,0.001781326,0.06678598],"genre_scores_gemma":[0.8248816,0.0007711619,0.1361015,0.0007001682,0.0002931037,0.0006648858,0.005223344,0.0003933311,0.03097102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01551903,"threshold_uncertainty_score":0.0519163,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Multipartite; Graph; Upper and lower bounds; Simple graph; String (physics)","authors":[{"name":"Runze Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.022351429636657,"gpt":0.3182714606993722,"spread":0.2959200310627152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776676,0.001584155,0.0009714794,0.003785936,0.00181175,0.003763736,0.001830055,0.001101271,0.2222932],"category_scores_gemma":[0.00383258,0.0007046124,0.0009630421,0.005158544,0.0007387238,0.005856098,0.002974723,0.002399156,0.1437476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001994022,"about_ca_system_score_gemma":0.001613411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00278033,"about_ca_topic_score_gemma":0.003494617,"domain_scores_codex":[0.9988733,0.0001118194,0.00007654406,0.0003683851,0.0004384391,0.0001314264],"domain_scores_gemma":[0.9981936,0.0002787203,0.00009340137,0.0005385684,0.0006991388,0.000196691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006994547,0.00007632743,0.0003578171,0.0004206168,0.00001684786,0.0001288647,0.0001392246,0.001748371,0.002359827,0.1999924,0.627245,0.1674448],"study_design_scores_gemma":[0.0000126429,0.00002180798,0.0002652177,0.00006756749,0.00001076781,0.0002373133,0.00006525642,0.0030763,0.001820947,0.107326,0.8870703,0.00002587762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004791573,0.002026429,0.2884344,0.002861304,0.004844149,0.0006899706,0.08112369,0.03562173,0.5796068],"genre_scores_gemma":[0.0741337,0.004071524,0.2432206,0.00313635,0.002062387,0.001367541,0.1942058,0.02889167,0.4489104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2222932,"threshold_uncertainty_score":0.743645,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Bipartite graph; Quadrilateral; Mathematics; Combinatorics; Face (sociological concept); Complete bipartite graph; Discrete mathematics; Graph; Linguistics; Engineering","authors":[{"name":"Hung‐Lin Fu","is_ca":false},{"name":"I-Fan Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02420880053651695,"gpt":0.2066045955571672,"spread":0.1823957950206503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000291722,0.00060065,0.000505806,0.0008010319,0.001046584,0.00227091,0.001160128,0.001125948,0.01455392],"category_scores_gemma":[0.00168404,0.0005747125,0.0004232357,0.0007746883,0.001024307,0.002222733,0.001442775,0.001821525,0.001528124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008105465,"about_ca_system_score_gemma":0.0003241499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001336726,"about_ca_topic_score_gemma":0.001960774,"domain_scores_codex":[0.9995922,0.0001196848,0.00001956217,0.000086548,0.00008810741,0.00009399069],"domain_scores_gemma":[0.9989937,0.0003909599,0.0001594952,0.000151138,0.0001258831,0.0001789197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003238362,0.0001501309,0.0008091684,0.000147694,0.00002319869,0.000267725,0.0005699045,0.02044902,0.007955241,0.9272524,0.005323637,0.03672811],"study_design_scores_gemma":[0.0000680549,0.00007674917,0.0008469856,0.00004025952,0.00002163433,0.0002961466,0.0005113016,0.0815492,0.00362668,0.8995739,0.01336197,0.00002700063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6299839,0.0003860315,0.2318526,0.0008614599,0.0002470996,0.00013455,0.0008607652,0.0004625103,0.1352111],"genre_scores_gemma":[0.8720506,0.000412983,0.07887036,0.0003589246,0.00009210003,0.0001663397,0.001038246,0.0002531542,0.04675725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01455392,"threshold_uncertainty_score":0.04868776,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"Mustafa Aşçı","is_ca":false},{"name":"Gwang Yeon Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01886597814284078,"gpt":0.3867527580243625,"spread":0.3678867798815217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002334548,0.001710032,0.001562834,0.004226038,0.001863212,0.004175622,0.002169504,0.002312043,0.00892003],"category_scores_gemma":[0.006830735,0.0007920088,0.001601537,0.003027895,0.004779156,0.005372362,0.002382677,0.003695024,0.001864389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001692344,"about_ca_system_score_gemma":0.0012877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001427594,"about_ca_topic_score_gemma":0.001890135,"domain_scores_codex":[0.9987324,0.0005691834,0.00005761649,0.0001456829,0.0003856414,0.0001094805],"domain_scores_gemma":[0.9981201,0.001010317,0.0001596787,0.0001994935,0.0003620285,0.0001483234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004574444,0.000003782566,0.00001947179,0.00001730501,0.00000370002,0.00001306555,0.00004547791,0.0008541701,0.0001101927,0.9960705,0.0005688012,0.002288906],"study_design_scores_gemma":[0.000003212416,0.000003248529,0.0000262409,0.000009078668,0.000003929469,0.0000393636,0.0000133023,0.009104094,0.00009438418,0.9885268,0.002166974,0.000009304951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04490146,0.006814119,0.8467409,0.002951223,0.002047359,0.00008741217,0.0002441812,0.0003125697,0.09590077],"genre_scores_gemma":[0.5583799,0.006707137,0.3251832,0.00185593,0.004185565,0.0004407909,0.0003405408,0.0006562425,0.1022506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00892003,"threshold_uncertainty_score":0.02984053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}