{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140573,0.0001068413,0.0001638243,0.0002551901,0.00005590205,0.00005277001,0.0007042795,0.00004473087,0.00004219493],"category_scores_gemma":[0.0005473832,0.00009469312,0.0000551964,0.0005892314,0.00008442558,0.0003750184,0.0001949955,0.0001386483,0.0002055551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002948733,"about_ca_system_score_gemma":0.00001530044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001891347,"about_ca_topic_score_gemma":0.000003385562,"domain_scores_codex":[0.9986852,0.0001556464,0.000237484,0.000294168,0.000319712,0.0003077883],"domain_scores_gemma":[0.9986933,0.0004571011,0.00004590485,0.0006809235,0.00004761159,0.0000751814],"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.000003150241,0.00006783348,0.0001123784,0.00003486583,0.000002820508,0.000002634272,0.0006239332,0.00000650322,0.0003613743,0.9760622,0.00009756238,0.02262474],"study_design_scores_gemma":[0.000247489,0.0000415414,0.001056736,0.0000353446,0.000001070989,0.000008777828,0.00004624781,0.08163939,0.0007550671,0.9156553,0.0004095173,0.0001035178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1336606,0.00007382105,0.8159915,0.0006786887,0.0001276409,0.0003826391,0.000001365745,0.0002278171,0.04885596],"genre_scores_gemma":[0.9364215,0.000002491211,0.06326738,0.00004673665,0.00001064196,0.00003638797,8.205987e-7,0.000008291382,0.0002058249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8027608,"threshold_uncertainty_score":0.3861473,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008204692,0.0002370646,0.0004221678,0.00007244381,0.0001118994,0.00001750241,0.0004587713,0.00008377316,0.002771183],"category_scores_gemma":[0.001105519,0.0001493196,0.0002075828,0.0001454193,0.0001979854,0.00006716172,0.00008725786,0.0001696357,0.0002459392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002316839,"about_ca_system_score_gemma":0.00002633779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003552816,"about_ca_topic_score_gemma":0.000007583082,"domain_scores_codex":[0.9983507,0.0001025575,0.0005822205,0.0002524197,0.0003806394,0.0003314755],"domain_scores_gemma":[0.9975935,0.00108027,0.0002502119,0.0009250304,0.00007247704,0.00007854086],"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.00003067351,0.0003161399,0.00003492081,0.0002633362,0.00008627539,0.000003749509,0.006393375,3.6214e-7,0.0002931265,0.9887021,0.003555627,0.0003203785],"study_design_scores_gemma":[0.0002719811,0.00006387223,0.00009411348,0.0001940701,0.0000702044,0.000007712953,0.00121929,0.0002781855,0.008205342,0.9892445,0.0001850268,0.0001657131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.867795,0.0000582807,0.003650158,0.000167676,0.0001341306,0.0004718778,0.00001150024,0.0001276821,0.1275837],"genre_scores_gemma":[0.956526,0.000009561903,0.04234731,0.0001377173,0.00004459725,0.00004324438,0.000001358017,0.00005253062,0.0008376466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1267461,"threshold_uncertainty_score":0.9981404,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007796759,0.000172832,0.0003080182,0.00008606014,0.00005945069,0.0001510301,0.0007267585,0.00004545953,0.00002462921],"category_scores_gemma":[0.0002777492,0.0001464837,0.00004454399,0.0002548127,0.000219908,0.001334652,0.0004534431,0.00008382178,0.00003995322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002345253,"about_ca_system_score_gemma":0.00004814474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001554806,"about_ca_topic_score_gemma":0.000001218056,"domain_scores_codex":[0.9986219,0.00003876789,0.0003844581,0.0002484362,0.0003568512,0.0003495363],"domain_scores_gemma":[0.9987254,0.000183775,0.000150755,0.0006894232,0.0001242885,0.000126403],"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.00001048985,0.001040472,0.002398189,0.001877923,0.00006332539,0.000008681106,0.007734449,6.337575e-7,0.00520073,0.9040716,0.00347095,0.07412261],"study_design_scores_gemma":[0.000839192,0.0001838861,0.004404109,0.0008049515,0.00007345901,0.0003900223,0.0004826457,0.02368269,0.0490087,0.9144102,0.00467167,0.001048503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1379586,0.003287244,0.7644253,0.0004484354,0.0002049074,0.0005733529,0.00002904836,0.001040417,0.09203273],"genre_scores_gemma":[0.7640859,0.000006239585,0.2356432,0.00009530663,0.00001894698,0.00001951973,0.000001285378,0.00001167055,0.0001178543],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6261274,"threshold_uncertainty_score":0.5973433,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004460729,0.0001930838,0.0002400805,0.000122782,0.0001511318,0.000159804,0.0005333648,0.00006991775,0.0001548366],"category_scores_gemma":[0.0000925474,0.0001580632,0.0001197992,0.0003900146,0.0001009716,0.0002942052,0.0002135087,0.0001299185,0.0009272962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001571422,"about_ca_system_score_gemma":0.00003527552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004051101,"about_ca_topic_score_gemma":0.000001091311,"domain_scores_codex":[0.9983475,0.00003985139,0.0004067663,0.0004251831,0.0003710807,0.0004095872],"domain_scores_gemma":[0.9987291,0.0001700066,0.00006863751,0.0008208075,0.0001173353,0.00009414872],"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.000001500402,0.0002295398,0.0001210568,0.00005635963,0.00001277182,0.00001261212,0.0003399045,0.00002639332,0.002156455,0.9788763,0.01716287,0.00100425],"study_design_scores_gemma":[0.0003932804,0.00005411468,0.0003930995,0.00007202219,0.00001862848,0.00009204158,0.00003860122,0.04395038,0.00296271,0.9497702,0.001934958,0.0003200132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7018272,0.002142767,0.1664549,0.005892884,0.001063286,0.0007128761,0.00001452643,0.002172643,0.1197189],"genre_scores_gemma":[0.8795089,0.000002766743,0.1180863,0.000245405,0.00001782098,0.00001557435,0.000004282846,0.00001694052,0.00210206],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1776817,"threshold_uncertainty_score":0.9998506,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001716003,0.0002264995,0.0003670017,0.0001792684,0.0003708556,0.0003278386,0.00294399,0.00007208187,0.00004711804],"category_scores_gemma":[0.002410169,0.0001875635,0.00009815113,0.0002924793,0.0004183775,0.0006975057,0.0004560392,0.0002645306,0.0004178241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003623839,"about_ca_system_score_gemma":0.00005366322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007046294,"about_ca_topic_score_gemma":0.0003592813,"domain_scores_codex":[0.9976515,0.0002684982,0.0003443589,0.0006176611,0.0005418061,0.0005761464],"domain_scores_gemma":[0.9959753,0.001290063,0.0001982254,0.002260643,0.0001375183,0.0001382229],"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.00006640875,0.0003385095,0.0117487,0.0001108461,0.0000446854,0.0001031785,0.001580106,0.00003581781,0.00006445128,0.9676802,0.001480285,0.01674688],"study_design_scores_gemma":[0.00038218,0.0001458768,0.1329576,0.0002452803,0.000002277989,0.000003692795,0.00009174804,0.006511955,0.000529784,0.8584229,0.0004354303,0.0002712196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7150847,0.003231504,0.1325506,0.006655034,0.00153475,0.003685783,0.0001623015,0.0008832451,0.1362121],"genre_scores_gemma":[0.9801086,0.00008328412,0.01908867,0.0001329069,0.0000140518,0.00006434237,0.000002336694,0.00001672605,0.0004890715],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2650239,"threshold_uncertainty_score":0.764862,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005511567,0.000132869,0.0002188334,0.0001659093,0.0001031176,0.00003277529,0.000592531,0.00005434518,0.0001048923],"category_scores_gemma":[0.0002389827,0.0001049816,0.00008866676,0.0004374099,0.000176499,0.0001066889,0.0001515965,0.00008261659,0.0004512169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007077313,"about_ca_system_score_gemma":0.00002833565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006777535,"about_ca_topic_score_gemma":7.534009e-7,"domain_scores_codex":[0.9987161,0.00004514639,0.0003569484,0.000301891,0.000330835,0.0002490945],"domain_scores_gemma":[0.9984975,0.0002111536,0.0001165692,0.0009218274,0.0001670885,0.00008585784],"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.000004116774,0.000135931,0.00001271156,0.00003775478,0.00001710586,0.000001249014,0.0008576863,0.000001693076,0.003900897,0.9911827,0.00133612,0.002511995],"study_design_scores_gemma":[0.0002152209,0.0002692597,0.00003010618,0.0001622019,0.000009134636,0.000005650928,0.000027871,0.01430982,0.02139858,0.9632915,0.0001557629,0.0001248717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7911213,0.0006216058,0.120976,0.001461963,0.00105789,0.0006295248,0.00001059854,0.0009568955,0.08316419],"genre_scores_gemma":[0.8844193,0.000002898902,0.1151854,0.0002064236,0.00000469425,0.000005601878,5.134498e-7,0.000009075835,0.000166168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09329796,"threshold_uncertainty_score":0.579963,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689741,0.00007928729,0.0001447991,0.00006201152,0.00001888186,0.000004936462,0.00006460407,0.00004213572,0.0001102456],"category_scores_gemma":[0.00004079268,0.00006922004,0.00003173803,0.00009442003,0.00006338605,0.00004248475,0.000008444504,0.00004514157,0.00001791357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005402675,"about_ca_system_score_gemma":0.000002259422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004509523,"about_ca_topic_score_gemma":0.000004533136,"domain_scores_codex":[0.9994806,0.000009659773,0.0002253177,0.00006558387,0.0000797108,0.0001391277],"domain_scores_gemma":[0.9996128,0.0001393276,0.00002004371,0.0001678484,0.00001534014,0.00004465955],"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.000007953471,0.00006842783,0.001790643,0.002643618,0.0001216444,0.000009722384,0.005880249,0.00002326895,0.02120307,0.9629705,0.0006432705,0.004637622],"study_design_scores_gemma":[0.000694056,0.0001372405,0.00961818,0.0005480911,0.00008448988,0.00007170708,0.007236802,0.003580969,0.03799635,0.9376587,0.001785943,0.0005874887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9372612,0.000842728,0.006945438,0.000006381873,0.00008024838,0.0001140113,0.000004805179,0.0001180368,0.0546271],"genre_scores_gemma":[0.9979909,0.000006052419,0.001947222,0.000003988222,0.00001008659,0.000003333048,6.700791e-7,0.00001224089,0.00002550217],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06072965,"threshold_uncertainty_score":0.2822711,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009054936,0.0001009905,0.0001339002,0.00007515538,0.0001446239,0.00002507161,0.0007702759,0.0000348678,0.000663959],"category_scores_gemma":[0.00056161,0.00006225949,0.00007553974,0.000431195,0.000393833,0.0001573387,0.0002080503,0.0001002752,0.0006507533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001697514,"about_ca_system_score_gemma":0.00002747787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001452171,"about_ca_topic_score_gemma":6.417305e-7,"domain_scores_codex":[0.9986839,0.0001336638,0.0002208027,0.0002249268,0.0005181663,0.0002185881],"domain_scores_gemma":[0.9976518,0.001165067,0.00008246939,0.0008469118,0.0002029595,0.0000508088],"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.00001429609,0.0000876066,0.00001224732,0.00001314865,0.00001228694,9.359364e-7,0.0005192373,7.055158e-7,0.0004558928,0.9952356,0.001426615,0.002221439],"study_design_scores_gemma":[0.0001227905,0.00009115796,0.0001844582,0.00004218988,0.000002777128,0.000009863526,0.00004065078,0.008944732,0.006496626,0.983811,0.000187043,0.00006676267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7422171,0.00004771069,0.1484804,0.002610442,0.0003192541,0.0007577724,0.00001079518,0.000176426,0.1053801],"genre_scores_gemma":[0.9709716,7.745944e-7,0.02847675,0.0001445057,0.00001539019,0.00002213643,4.745742e-7,0.000007582986,0.0003608048],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2287545,"threshold_uncertainty_score":0.8364334,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013355,0.00008526848,0.0001735227,0.00002013469,0.0003868664,0.00008176384,0.0008928609,0.00003111396,0.000008583222],"category_scores_gemma":[0.0002919014,0.00004489358,0.00009420778,0.00005303738,0.0002063056,0.0002164117,0.0002002781,0.00003907325,0.000003336373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009241147,"about_ca_system_score_gemma":0.0000400473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000381508,"about_ca_topic_score_gemma":0.00004626765,"domain_scores_codex":[0.9992319,0.00003767938,0.0003289348,0.0001331976,0.0001428049,0.0001255322],"domain_scores_gemma":[0.9975986,0.0009875153,0.0003697105,0.0009312159,0.00008700438,0.00002589154],"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.000009321726,0.00005401784,0.00002091166,0.00009062998,0.00003733981,0.000001850755,0.002588476,0.00001862022,0.001607479,0.981338,0.0003496692,0.0138837],"study_design_scores_gemma":[0.0009979827,0.0002759552,0.003571491,0.0001464388,0.0001461598,0.0001075046,0.0004936042,0.295988,0.04770673,0.6482742,0.001994672,0.0002973202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1145716,0.0001228518,0.8764275,0.0031682,0.0004527597,0.0008688003,0.00003694209,0.00004626655,0.00430511],"genre_scores_gemma":[0.9952121,0.00000413953,0.004598352,0.00003970361,0.00005176375,0.00002237924,0.000001004937,0.000005152957,0.00006542781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8806405,"threshold_uncertainty_score":0.2975503,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081757,0.0001376225,0.0002769666,0.0004385429,0.00009191613,0.00004313211,0.0009472125,0.00005851536,0.0000488022],"category_scores_gemma":[0.0004181455,0.0001216463,0.0001197269,0.001080704,0.0001945345,0.0003362576,0.0004782979,0.0001610996,0.00003662748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005435458,"about_ca_system_score_gemma":0.00006425118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006594192,"about_ca_topic_score_gemma":0.000002406958,"domain_scores_codex":[0.9986368,0.0001086252,0.0003781292,0.0003323887,0.0002569532,0.000287053],"domain_scores_gemma":[0.998475,0.0004087793,0.0001054924,0.0007984088,0.0001474655,0.00006485466],"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.00002595478,0.0001045649,0.000060045,0.0002177366,0.00004067513,0.000006021657,0.0004875874,0.000001888274,0.002239589,0.9928355,0.0001959288,0.003784491],"study_design_scores_gemma":[0.0003277988,0.0000946643,0.0004037684,0.0001741719,0.0000110827,0.000009912356,0.0002624319,0.006118471,0.02316343,0.9688581,0.000470255,0.0001058598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1946899,0.0002023525,0.7114317,0.0008002387,0.0003030019,0.0007200043,0.000005751335,0.0002670541,0.09158007],"genre_scores_gemma":[0.9715607,0.000005501857,0.02750771,0.00004750321,0.000002593852,0.00005619887,4.907123e-7,0.000007062999,0.000812303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7768708,"threshold_uncertainty_score":0.4960592,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000626889,0.00005607456,0.0001079329,0.00006443036,0.0001280166,0.00004385875,0.000129249,0.00006102599,0.001224746],"category_scores_gemma":[0.0003097868,0.00005400128,0.00007032987,0.0002683412,0.00006627121,0.0001584806,0.00001564521,0.00009805007,0.0008886018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008171432,"about_ca_system_score_gemma":0.00004058132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004295479,"about_ca_topic_score_gemma":0.0002715149,"domain_scores_codex":[0.9992016,0.00008724353,0.0001936864,0.0001198633,0.0002211003,0.0001765114],"domain_scores_gemma":[0.9994901,0.0002195654,0.00005328875,0.0001485656,0.00004234173,0.00004611419],"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.000002391156,0.00009972554,0.00231059,0.00004483385,0.00000703695,7.203892e-7,0.06107448,0.000003059871,0.0001327072,0.9324551,0.002293669,0.001575668],"study_design_scores_gemma":[0.001015308,0.00008140227,0.01304679,0.0004240083,0.00002774664,0.000004196015,0.2676309,0.007817152,0.000173567,0.6397975,0.06943809,0.000543291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.581924,0.00003265988,0.00009765814,0.001476574,0.0001586903,0.0002623843,7.178126e-7,0.00005391525,0.4159935],"genre_scores_gemma":[0.9954543,0.00001915896,0.0009401815,0.0001430493,0.00001726506,0.00001819483,0.000001602965,0.000005581199,0.003400634],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4135304,"threshold_uncertainty_score":0.9998893,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004777965,0.00009116692,0.0001743021,0.00002269369,0.0003972911,0.00008815857,0.0009622534,0.00002591008,0.000009071294],"category_scores_gemma":[0.0002485106,0.00004857522,0.00009799809,0.00005630169,0.0002591786,0.00028742,0.0002427859,0.00004375897,0.000004083072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008863108,"about_ca_system_score_gemma":0.00004027272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001692773,"about_ca_topic_score_gemma":0.00001324415,"domain_scores_codex":[0.9992347,0.00003820695,0.0003180931,0.0001397683,0.0001396634,0.0001295777],"domain_scores_gemma":[0.9976256,0.0009248059,0.0003546044,0.0009743029,0.00009473788,0.00002588384],"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.00001279766,0.00008858524,0.00002546798,0.0001664867,0.00004962481,0.000004285945,0.002594841,0.00002238247,0.002527655,0.9739655,0.0007330915,0.01980924],"study_design_scores_gemma":[0.0007017698,0.0001930228,0.00154282,0.0001355749,0.0001069538,0.0001825147,0.0002649608,0.2583078,0.0336799,0.7027699,0.001891185,0.0002236198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04162834,0.0002823217,0.9492031,0.004655473,0.0004164496,0.0007681912,0.00003430145,0.00004033058,0.002971491],"genre_scores_gemma":[0.993563,0.000002470236,0.006226303,0.00006793665,0.00004757288,0.00002413434,0.000001240182,0.000005606397,0.00006175395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9519346,"threshold_uncertainty_score":0.3055682,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006129692,0.0001605237,0.0003277078,0.000113341,0.0002196324,0.00007590151,0.0006027973,0.00005763508,0.0000331596],"category_scores_gemma":[0.0002908934,0.0001176033,0.00004518736,0.0001021202,0.0003616274,0.0002883888,0.0003015663,0.00008619244,0.000001876609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000265909,"about_ca_system_score_gemma":0.00002257732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001204022,"about_ca_topic_score_gemma":0.000002562362,"domain_scores_codex":[0.9990562,0.00008322223,0.0002768809,0.0002810185,0.0001387997,0.0001639094],"domain_scores_gemma":[0.99811,0.0005858347,0.0002537575,0.0008957234,0.00007733639,0.00007737544],"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.0001468529,0.0007558378,0.003365378,0.0008913676,0.0001620147,0.00002129091,0.01375435,0.000006239769,0.005120701,0.9311555,0.0002069678,0.04441348],"study_design_scores_gemma":[0.001195319,0.001557552,0.01798227,0.001064289,0.00005518903,0.00009448014,0.001073186,0.08460987,0.006363917,0.8852994,0.0002372422,0.0004672243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987357,0.000302653,0.009436084,0.0002235016,0.00006342355,0.0001677555,0.00001718384,0.00006085298,0.002371583],"genre_scores_gemma":[0.9798934,0.00002209959,0.01998861,0.00003677604,0.00001148895,0.000005765878,0.000001189446,0.000008795559,0.00003185082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08460364,"threshold_uncertainty_score":0.4795723,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715464,0.0001106102,0.0001662407,0.00004026788,0.0001126252,0.0001246355,0.0003671094,0.00002073851,0.00002373416],"category_scores_gemma":[0.0001615249,0.0000629299,0.00004552602,0.0001885971,0.0001525463,0.0001591773,0.0001053554,0.00008846547,0.0001388669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004951428,"about_ca_system_score_gemma":0.00001431707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003369997,"about_ca_topic_score_gemma":1.791893e-7,"domain_scores_codex":[0.9990723,0.00004611222,0.0002039483,0.0002763885,0.0002028811,0.0001983496],"domain_scores_gemma":[0.9990556,0.000133211,0.00005393891,0.0006568115,0.00004212946,0.00005834592],"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.000005743871,0.00004497744,0.000005722633,0.00001761002,0.000007127566,0.000001972722,0.0013664,0.000002211904,0.000205746,0.987075,0.001838791,0.009428741],"study_design_scores_gemma":[0.0005062424,0.00004166837,0.0003008208,0.00003552691,0.00001096794,0.0000478317,0.00002792065,0.01741078,0.0003684293,0.9792269,0.001917147,0.0001057444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5120569,0.01543288,0.1590044,0.1444062,0.000880215,0.003153805,0.000006073249,0.001513547,0.1635459],"genre_scores_gemma":[0.9508843,0.00002538742,0.04757247,0.0009297434,0.000005489495,0.00000563729,2.803188e-7,0.000004123834,0.000572567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4388273,"threshold_uncertainty_score":0.2566207,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006477113,0.0003050175,0.0004165159,0.0001675411,0.0001174263,0.0001914737,0.0003508725,0.0001190139,0.00178062],"category_scores_gemma":[0.0006636876,0.0002410812,0.0002496079,0.0002596058,0.0001398648,0.0002267362,0.0001182752,0.0002437715,0.002340864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005735519,"about_ca_system_score_gemma":0.00004591151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004517636,"about_ca_topic_score_gemma":0.000004399151,"domain_scores_codex":[0.9980552,0.00005236582,0.0005372252,0.0004676534,0.0004214651,0.0004661514],"domain_scores_gemma":[0.9979848,0.0009954183,0.00005869846,0.0007678674,0.00004987738,0.0001433472],"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.000004093118,0.0001418803,0.000007091795,0.001538794,0.00009846778,0.00004397551,0.001882393,1.975629e-7,0.0002900185,0.9478243,0.04074188,0.007426886],"study_design_scores_gemma":[0.000116058,0.00003755045,0.00005361233,0.0005409757,0.0000931321,0.00006506972,0.0004032037,0.002310312,0.001711927,0.9666747,0.02770682,0.0002865934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6484898,0.005156852,0.03965701,0.00265267,0.001561696,0.001245475,0.00008565873,0.003693277,0.2974575],"genre_scores_gemma":[0.9402684,0.00004852714,0.05038442,0.0001147679,0.0003781022,0.00008112648,0.000007427019,0.0001237559,0.008593487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2917785,"threshold_uncertainty_score":0.9991319,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003923608,0.0001453927,0.0002956294,0.0001036132,0.0002886725,0.0001674708,0.0007330208,0.00005873298,0.0000362014],"category_scores_gemma":[0.000299552,0.0001132058,0.00005766994,0.0001134559,0.0003369326,0.000324965,0.000286348,0.0000711655,0.00001779841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003136083,"about_ca_system_score_gemma":0.00003409923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002901292,"about_ca_topic_score_gemma":0.000003574751,"domain_scores_codex":[0.9988182,0.00004581697,0.0003397471,0.0003218428,0.0002356208,0.0002387823],"domain_scores_gemma":[0.9980903,0.0002204758,0.0002756266,0.001173896,0.0001331954,0.0001064825],"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.000007535861,0.0001253809,0.0004702711,0.0001773156,0.00004863176,0.000006265269,0.001088482,1.850361e-7,0.001612713,0.9915863,0.0006844842,0.004192409],"study_design_scores_gemma":[0.0004333962,0.00009127776,0.002071983,0.00014415,0.00002017041,0.00001184078,0.00007295654,0.01068274,0.002198873,0.9839121,0.0002129203,0.0001475963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9617873,0.001333504,0.02054287,0.00172843,0.0004159808,0.0004169365,0.00002454666,0.0002940442,0.01345642],"genre_scores_gemma":[0.9184783,0.00004005311,0.08132833,0.00004665674,0.00000205118,0.000008739881,9.526644e-7,0.000007315901,0.00008766674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06078546,"threshold_uncertainty_score":0.4616399,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305556,0.0002379602,0.0005158404,0.00008800127,0.00009149574,0.00004257775,0.0006076579,0.00007339987,0.00004247751],"category_scores_gemma":[0.0007254944,0.0002061274,0.0001351399,0.0003438587,0.00009094569,0.0002346362,0.0001462139,0.0001424875,0.00008978765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005898209,"about_ca_system_score_gemma":0.00006034438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003456404,"about_ca_topic_score_gemma":1.634628e-7,"domain_scores_codex":[0.9978824,0.00008509084,0.000716511,0.0003540223,0.0004443875,0.0005175728],"domain_scores_gemma":[0.9980482,0.0004969595,0.0001668281,0.0009813211,0.0001168552,0.0001898588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001390153,0.0001317151,0.000004586099,0.000268855,0.00003744443,0.000002257642,0.0003061662,0.02407203,0.0005323712,0.9745299,0.00006842898,0.00004484516],"study_design_scores_gemma":[0.0002303933,0.00004840413,0.00001776597,0.0001281435,0.00002371111,0.00002666525,0.0001283657,0.9444271,0.0004360624,0.05408552,0.0002367299,0.0002111915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004870725,0.0004617955,0.9917942,0.00005480945,0.0003562396,0.0003674263,0.000006319245,0.0002398352,0.001848645],"genre_scores_gemma":[0.7565112,0.000005166427,0.2433112,0.000005978648,0.00001103298,0.00006364088,0.000001064367,0.0000192656,0.00007147037],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9204444,"threshold_uncertainty_score":0.840563,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296419,0.000167227,0.0003001903,0.0001005981,0.0001216719,0.00007089484,0.000558052,0.00007631178,0.00005774984],"category_scores_gemma":[0.0004106708,0.0001330477,0.0001299934,0.0001948175,0.0001068526,0.0002778735,0.0001392634,0.0001514485,0.00007259295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004491073,"about_ca_system_score_gemma":0.00005261658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009694844,"about_ca_topic_score_gemma":0.000004866153,"domain_scores_codex":[0.9986289,0.00002710078,0.0004537835,0.0003397945,0.0002456048,0.0003048714],"domain_scores_gemma":[0.9984147,0.0004627892,0.0001289313,0.0007135897,0.000185449,0.00009457313],"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.000004360898,0.0001904225,0.00005298228,0.0002196087,0.00003104548,0.000001363905,0.001880039,0.000008335254,0.06025881,0.9307215,0.001903368,0.004728197],"study_design_scores_gemma":[0.0005169294,0.0001564983,0.00004899706,0.0001273298,0.00003548962,0.00001551219,0.0001030203,0.1000453,0.01932163,0.877331,0.00202383,0.0002745517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9144641,0.00164907,0.07529418,0.00200697,0.001837494,0.001053663,0.00004019684,0.0005961224,0.003058257],"genre_scores_gemma":[0.7582064,0.0000052511,0.2412224,0.0001841518,0.00001800059,0.00002868373,0.000003172146,0.00001589507,0.0003160817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1659282,"threshold_uncertainty_score":0.5425526,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001252344,0.000326363,0.0006490934,0.0002553085,0.0003658661,0.0001433816,0.0001759754,0.000144624,0.0003650123],"category_scores_gemma":[0.006341036,0.0003007909,0.0001021913,0.000316222,0.0002757877,0.0004923777,0.0001397041,0.0002943614,0.0001218403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001005515,"about_ca_system_score_gemma":0.00004869795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005681938,"about_ca_topic_score_gemma":0.0006549215,"domain_scores_codex":[0.9973449,0.0002417703,0.001038459,0.0004876626,0.0003920286,0.0004952034],"domain_scores_gemma":[0.9947104,0.004137745,0.0002765438,0.0006084153,0.0001142875,0.00015261],"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.00001523406,0.0003599846,0.001487234,0.0008711279,0.00006305893,0.000006098712,0.001200374,0.00006210316,0.001094559,0.9907566,0.003126387,0.0009571926],"study_design_scores_gemma":[0.000442376,0.00008908351,0.0004876026,0.0004433688,0.00008348899,0.00005222897,0.001621505,0.01738229,0.0002725119,0.9780068,0.0007805088,0.000338223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.624359,0.0007136496,0.2911257,0.001519453,0.0005841107,0.001247531,0.00006401075,0.001108817,0.07927771],"genre_scores_gemma":[0.8312203,0.00003018128,0.1632112,0.00009925053,0.0001435627,0.0002862044,0.00001305331,0.00007136318,0.004924893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2068613,"threshold_uncertainty_score":0.9999444,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001707457,0.0002706851,0.0005301573,0.0003292835,0.0001722931,0.00006517024,0.001293255,0.0001043625,0.0001019645],"category_scores_gemma":[0.002283115,0.0002310547,0.0001875791,0.001030722,0.0008566164,0.0003557932,0.001100545,0.0002108017,0.00001936289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005141806,"about_ca_system_score_gemma":0.00007677687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005441305,"about_ca_topic_score_gemma":0.00003843315,"domain_scores_codex":[0.9969503,0.0004205016,0.0006634362,0.000929721,0.0005478761,0.0004881811],"domain_scores_gemma":[0.9945346,0.002281029,0.0001294529,0.002676529,0.0002082334,0.0001701471],"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.0000395923,0.0008975278,0.01351394,0.0004983808,0.00004415061,0.000003532346,0.0007126748,0.000009193338,0.0009602937,0.977319,0.0002881711,0.005713539],"study_design_scores_gemma":[0.0007503227,0.00008449305,0.01782379,0.000131362,0.00001683682,0.000004549419,0.0002811833,0.02395129,0.01313356,0.9434485,0.0001614229,0.000212628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7209649,0.0002235077,0.2705069,0.000869984,0.0001490225,0.001166184,0.00002674666,0.000229493,0.005863172],"genre_scores_gemma":[0.9562121,0.000009760367,0.04326519,0.00006837128,0.000003980152,0.00007530366,0.00000158088,0.00001133596,0.0003523961],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2352472,"threshold_uncertainty_score":0.9422139,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002248038,0.0001906257,0.0002660247,0.00008550664,0.00002684695,0.00002867877,0.0001990661,0.00008625429,0.001895061],"category_scores_gemma":[0.00003305254,0.000158568,0.0001053089,0.0001140655,0.00001814714,0.0001171124,0.00001725705,0.0001342543,0.008323791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002579404,"about_ca_system_score_gemma":0.00001064604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001786084,"about_ca_topic_score_gemma":3.750245e-7,"domain_scores_codex":[0.9990737,0.00003226855,0.0002526991,0.0001715997,0.0001904904,0.0002792704],"domain_scores_gemma":[0.9990797,0.0002072119,0.00002426376,0.0005548786,0.00001044575,0.0001234865],"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.00001226826,0.00005088227,0.00001535717,0.0004216763,0.00007432107,0.000003907763,0.00083111,0.000605352,0.004048954,0.9755818,0.01770101,0.000653352],"study_design_scores_gemma":[0.0008456704,0.0002132473,0.000124911,0.0004415008,0.00004118062,0.00001803879,0.0004731216,0.01458211,0.00562228,0.9653702,0.01170308,0.0005646597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8003413,0.0005035651,0.002500186,0.00009252121,0.0008391177,0.0006386914,0.00001143076,0.0008213918,0.1942518],"genre_scores_gemma":[0.9919595,0.000003687028,0.0004592389,0.00006760383,0.00005924438,0.00001576416,0.00000299157,0.0000487139,0.007383326],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1916181,"threshold_uncertainty_score":0.9990174,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007179999,0.0001910624,0.0002869356,0.0001503845,0.00005946234,0.00003455216,0.0005290436,0.00007307142,0.00009840568],"category_scores_gemma":[0.0004954439,0.0001126875,0.0001207774,0.0002613426,0.0001317271,0.0001924832,0.0001775582,0.0000783745,0.0005368227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000159825,"about_ca_system_score_gemma":0.00003701743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005945788,"about_ca_topic_score_gemma":0.000001424566,"domain_scores_codex":[0.998166,0.00007885593,0.0005487236,0.0004511474,0.0004210493,0.0003342695],"domain_scores_gemma":[0.9978731,0.0006115022,0.0001359227,0.001122346,0.0001457417,0.0001113734],"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.00008320309,0.0007860002,0.00004209311,0.0001150344,0.00008178343,0.00001443994,0.004106561,0.00002108789,0.05929186,0.901221,0.004704916,0.02953203],"study_design_scores_gemma":[0.002467137,0.0006374877,0.0006341611,0.001216862,0.0000331909,0.00003788069,0.0002205957,0.006462436,0.04641922,0.9406612,0.0006761079,0.0005337448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8729722,0.00103476,0.05214242,0.0137132,0.001102676,0.0009273247,0.00009302067,0.00107351,0.05694083],"genre_scores_gemma":[0.9541509,0.000009030221,0.04433049,0.0000996229,0.000009434095,0.000008342356,8.854612e-7,0.00001534641,0.001375919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08117867,"threshold_uncertainty_score":0.6899948,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006454519,0.0001665994,0.0002912537,0.00004733452,0.00004898151,0.00001811385,0.0002206419,0.0001208848,0.00006839521],"category_scores_gemma":[0.00002341339,0.0001325029,0.00008416295,0.0001385514,0.0001418091,0.00002365757,0.00007623383,0.000116472,0.000004014376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001510792,"about_ca_system_score_gemma":0.0000225425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215278,"about_ca_topic_score_gemma":0.000002277947,"domain_scores_codex":[0.9991997,0.000005171017,0.000304017,0.0002317904,0.0001001323,0.0001591328],"domain_scores_gemma":[0.9992116,0.0001223372,0.0000949534,0.0005112545,0.000003332724,0.00005651079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007675956,0.0002210703,0.0001673921,0.001384277,0.0003280106,0.000001681683,0.001506744,4.329548e-7,0.939388,0.04199535,0.0001737018,0.01475657],"study_design_scores_gemma":[0.0008521513,0.00001081433,0.0001024068,0.0003266549,0.000104482,0.00001424395,0.0005424876,0.005731209,0.3675956,0.6217875,0.002696912,0.000235522],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8598204,0.0009792354,0.0006933718,0.0001547017,0.00001016028,0.0001202665,0.00001349346,0.0000487356,0.1381597],"genre_scores_gemma":[0.9986809,0.00002347547,0.0007994164,0.00004491655,0.00001127128,0.00003843552,0.00001844435,0.00001487976,0.0003682809],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5797922,"threshold_uncertainty_score":0.5403311,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224938,0.0002123248,0.0002684546,0.0001306998,0.0001651519,0.00003358365,0.0003111167,0.00009270554,0.0003904481],"category_scores_gemma":[0.0009928541,0.0001713694,0.0001426887,0.0002716385,0.00008555045,0.00006711815,0.00004674689,0.0001649581,0.0006971703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000025852,"about_ca_system_score_gemma":0.00002487055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004632916,"about_ca_topic_score_gemma":0.00001792945,"domain_scores_codex":[0.9984457,0.0000368968,0.0005642019,0.0002967522,0.0002922431,0.0003642207],"domain_scores_gemma":[0.9965453,0.002240997,0.0001457485,0.0008396042,0.00004367713,0.000184695],"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.00009170471,0.0002149286,0.000005572277,0.00004449979,0.00003035271,0.000003944708,0.001476407,2.794543e-7,0.0003502,0.9606063,0.03351801,0.003657744],"study_design_scores_gemma":[0.0004503182,0.00008433403,0.0004077331,0.0000961695,0.00004145893,0.000008305716,0.0006794872,0.00002512637,0.007099372,0.9785617,0.01236636,0.0001796283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3404626,0.0001195239,0.05463816,0.002293097,0.0001874515,0.001154391,0.00008445253,0.0009397457,0.6001205],"genre_scores_gemma":[0.9161739,0.000004384108,0.07374539,0.0001367311,0.0001187156,0.00002278587,0.000007769189,0.000039341,0.009750948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5903696,"threshold_uncertainty_score":0.8960947,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001669433,0.00007721149,0.0001802365,0.000005439565,0.0001296233,0.000005119947,0.0001546747,0.00003899951,0.001352556],"category_scores_gemma":[0.0001203097,0.00002588027,0.00005248317,0.0001455484,0.0003671423,0.00004519154,0.00007513807,0.00002956486,0.0001477995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005172289,"about_ca_system_score_gemma":0.000002690114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001324306,"about_ca_topic_score_gemma":0.000263766,"domain_scores_codex":[0.9993937,0.00002265464,0.0001771724,0.0001306844,0.00009551817,0.000180285],"domain_scores_gemma":[0.9995375,0.0002266334,0.00006581545,0.00005794903,0.00007740634,0.0000347077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00047095,0.003519377,0.4344974,0.000559768,0.0007473005,0.00003713499,0.01490294,5.738856e-7,0.2610884,0.1484594,0.05472379,0.08099297],"study_design_scores_gemma":[0.000191629,0.001055674,0.8672383,0.00006745187,0.0000519595,0.00001196198,0.003660117,0.0003919091,0.006645628,0.1077407,0.01264612,0.0002984825],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9890804,0.00006450601,0.0000109941,0.000442976,0.00004749565,0.00009945523,0.0000201494,0.00003436282,0.01019966],"genre_scores_gemma":[0.9989886,0.000003628902,0.0006200149,0.00004777308,0.00007633266,0.000006268562,0.000002065284,4.497388e-7,0.0002548707],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4327409,"threshold_uncertainty_score":0.9995604,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108689,0.0001508531,0.0001796198,0.00003455055,0.0002614199,0.0001187693,0.0002927884,0.00006537221,0.000123264],"category_scores_gemma":[0.0002507339,0.000145501,0.00004599128,0.00001917199,0.00007749011,0.0001955895,0.00007521866,0.0001177412,0.0001816743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000361937,"about_ca_system_score_gemma":0.000006262501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004786487,"about_ca_topic_score_gemma":0.00000114543,"domain_scores_codex":[0.9992732,0.00000466873,0.0001872049,0.0001519495,0.0001259157,0.0002570005],"domain_scores_gemma":[0.999078,0.00005975797,0.0000533575,0.0007099421,0.00002577419,0.00007311109],"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.00001315971,0.00005176093,0.00002482368,0.0004690539,0.00005966913,0.00001736018,0.0005043343,0.9725838,0.0002597012,0.01354101,0.0114837,0.0009916616],"study_design_scores_gemma":[0.0008697244,0.00008426524,0.0009349334,0.0002411601,0.00008230012,0.00004055736,0.0001923209,0.886104,0.01821885,0.03542854,0.05691846,0.0008848647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06603029,0.0003668357,0.61839,0.0002268268,0.001200894,0.0005188396,0.00007274431,0.001698212,0.3114954],"genre_scores_gemma":[0.8933038,0.00004647062,0.1053792,0.00001257332,0.0001023408,0.00002065003,0.000007628476,0.00004244522,0.001084849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8272735,"threshold_uncertainty_score":0.5933359,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003686821,0.0001217851,0.0004164263,0.0002430942,0.00004970908,0.000003678392,0.00007471396,0.00004014541,0.00006830492],"category_scores_gemma":[0.001389172,0.0001003641,0.00004205001,0.0003901938,0.0001173199,0.0001427044,0.00007606672,0.00007639335,0.000002425927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001512135,"about_ca_system_score_gemma":0.00002891095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003458346,"about_ca_topic_score_gemma":0.00001722225,"domain_scores_codex":[0.9986957,0.00006922773,0.0006542967,0.0001499414,0.0002851581,0.0001456576],"domain_scores_gemma":[0.9982689,0.00116441,0.0002217896,0.0002179579,0.00009329362,0.00003367112],"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.0001100487,0.008311121,0.03182172,0.003496622,0.0003290511,0.00004246024,0.4255812,0.00001161911,0.000131265,0.5296171,0.0001690829,0.0003787329],"study_design_scores_gemma":[0.002971245,0.001252122,0.05750166,0.0005451029,0.0001743597,0.00007908909,0.1483741,0.001054515,0.000610763,0.7870907,0.000004749312,0.0003415979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9948945,0.0001175837,0.000829354,0.00001778462,0.00001285233,0.0004403114,0.00003084817,0.00001369051,0.003643087],"genre_scores_gemma":[0.995867,0.00001213312,0.003748389,0.000002161406,0.000004072113,0.00003823363,0.000001643525,0.00001125044,0.000315104],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.277207,"threshold_uncertainty_score":0.409273,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008321121,0.0001746123,0.0002076803,0.0002968143,0.0002379164,0.0001155709,0.0005025499,0.00007715314,0.0002521532],"category_scores_gemma":[0.0002346001,0.0001444327,0.00008345901,0.0009125564,0.0001834887,0.0001806508,0.0001747439,0.000129209,0.0003507939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001486945,"about_ca_system_score_gemma":0.00002547761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.963988e-7,"about_ca_topic_score_gemma":3.473605e-7,"domain_scores_codex":[0.9986593,0.0001326505,0.0002611098,0.000391725,0.0002625195,0.0002927661],"domain_scores_gemma":[0.9982269,0.0008786664,0.0000778593,0.0006186909,0.00006951029,0.0001284036],"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.000009611429,0.0001602764,0.0000408998,0.00003445121,0.00004467207,0.000006649407,0.001098242,1.978236e-7,0.00007095523,0.9919273,0.0008924792,0.005714258],"study_design_scores_gemma":[0.0002649239,0.0004932521,0.0007471353,0.00009424132,0.00002708716,0.00006002804,0.00003851452,0.01428937,0.0005525231,0.9826045,0.0006216857,0.0002067322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5514408,0.0005952937,0.2560978,0.0005658349,0.0004891967,0.0005788445,0.000009852341,0.001426444,0.188796],"genre_scores_gemma":[0.9547046,0.00001132542,0.04495617,0.0001506441,0.00002563098,0.00001216526,7.619494e-7,0.00001113197,0.0001275413],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4032638,"threshold_uncertainty_score":0.5889797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006635046,0.0001709729,0.0003673399,0.0001067736,0.00005558418,0.000005964439,0.0002469576,0.00009122789,0.005308264],"category_scores_gemma":[0.003374567,0.0001428736,0.000134189,0.0003057241,0.0001766727,0.0001063135,0.00007384645,0.0001119706,0.0004074818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004672688,"about_ca_system_score_gemma":0.0000771308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003487035,"about_ca_topic_score_gemma":0.00002636055,"domain_scores_codex":[0.9984017,0.00007664924,0.0006641315,0.0002361145,0.0003944754,0.0002269101],"domain_scores_gemma":[0.9977633,0.0008518329,0.0001836476,0.0007895695,0.0003285503,0.00008304611],"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.0001399733,0.001141533,0.0002751935,0.0008349984,0.000166957,0.000002844645,0.01223732,0.000001105324,0.0006988991,0.9788533,0.00498185,0.0006659543],"study_design_scores_gemma":[0.0003159346,0.0001536238,0.0008575679,0.0001099222,0.0001156063,0.00001162679,0.0009683457,0.0007268821,0.003314515,0.9927483,0.0004998952,0.0001777765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4076608,0.000189445,0.01537001,0.0002276961,0.0004067543,0.001079291,0.00008431161,0.0003501202,0.5746316],"genre_scores_gemma":[0.877828,0.000004428465,0.1204063,0.00002341403,0.00002517233,0.0000263079,0.000004457406,0.00003462729,0.001647352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5729843,"threshold_uncertainty_score":0.995601,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004148943,0.0002503053,0.0005222717,0.0007384221,0.0001403315,0.0000824797,0.0002049797,0.0001080068,0.0007933413],"category_scores_gemma":[0.0008424139,0.0002032891,0.0003157991,0.001402249,0.0001509456,0.0003549516,0.00005999312,0.0002435861,0.00007109522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001616517,"about_ca_system_score_gemma":0.0002047226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001685875,"about_ca_topic_score_gemma":0.00009632889,"domain_scores_codex":[0.9979182,0.00006065562,0.0006889101,0.0004053223,0.0006576653,0.0002692609],"domain_scores_gemma":[0.9970418,0.001814367,0.0001913187,0.0006155353,0.0002403103,0.00009667798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000403085,0.000668343,0.00001634226,0.0007642586,0.003711703,0.000005380281,0.001154218,0.01957188,0.001405929,0.9710701,0.001185462,0.0004061051],"study_design_scores_gemma":[0.0001086857,0.00002676033,0.0002202567,0.0002111962,0.002334792,0.000007303994,0.0001914856,0.7601979,0.00005646673,0.2364266,0.00006088791,0.0001576459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09584969,0.0001299381,0.8916697,0.0004054114,0.00007291799,0.0003930122,0.0003222068,0.0003215659,0.0108356],"genre_scores_gemma":[0.8813089,0.000004721534,0.1151948,0.00001732111,0.00001303334,0.000112618,0.00008595357,0.00004824355,0.003214479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7854592,"threshold_uncertainty_score":0.8686531,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004192602,0.000213874,0.0003200294,0.0001071256,0.0001150336,0.00007326981,0.0001808309,0.0001028907,0.0001252171],"category_scores_gemma":[0.00005221175,0.0001701987,0.00008106585,0.0002142255,0.0001005676,0.0001351556,0.00006388073,0.0001451304,0.00004603221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002099305,"about_ca_system_score_gemma":0.000007327694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001003916,"about_ca_topic_score_gemma":0.000001194775,"domain_scores_codex":[0.9990649,0.00003984969,0.0002876167,0.000210795,0.00009333756,0.0003034989],"domain_scores_gemma":[0.9991444,0.0002963527,0.00001887657,0.0004387068,0.00001686018,0.00008474287],"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.00001397842,0.00009995528,0.0003574447,0.001235322,0.0002190318,0.000004453753,0.0005962067,0.00004626092,0.009623677,0.9827039,0.003276297,0.00182343],"study_design_scores_gemma":[0.0005710335,0.00006384317,0.0003146086,0.0006723689,0.00008230776,0.00002818306,0.001436192,0.07827644,0.02585446,0.8737745,0.01846105,0.0004649622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7016639,0.007310474,0.1731268,0.0001961548,0.0004299269,0.0007921521,0.00001949399,0.001043102,0.1154181],"genre_scores_gemma":[0.9957557,0.0000271226,0.003725785,0.00003177999,0.00001931368,0.00005343533,0.00000325136,0.00002533026,0.0003582267],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2940919,"threshold_uncertainty_score":0.6940502,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003058865,0.0002976607,0.0004701362,0.0002839791,0.0001479385,0.0001096604,0.0007038747,0.0001319311,0.003139204],"category_scores_gemma":[0.004390345,0.0001831665,0.0003351338,0.0007569717,0.0004489417,0.0001362291,0.0002133855,0.0004734623,0.001015639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000481391,"about_ca_system_score_gemma":0.00006799898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003715269,"about_ca_topic_score_gemma":0.000001961097,"domain_scores_codex":[0.9972365,0.0002810252,0.0006892313,0.0004014093,0.000867032,0.0005247343],"domain_scores_gemma":[0.9841669,0.01417061,0.0001005742,0.001355389,0.0001062733,0.0001002214],"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.00004309001,0.000247175,0.000001758036,0.001410599,0.000157473,0.00003892359,0.002082135,0.000002328549,0.0007265968,0.9764284,0.01866498,0.0001965457],"study_design_scores_gemma":[0.0001401822,0.0002046957,0.000004091541,0.0007213606,0.00006855359,0.00002679512,0.0008854302,0.004961825,0.003365899,0.9887616,0.0006793937,0.0001801479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7903543,0.001331076,0.01616737,0.002715475,0.000437765,0.002088613,0.000196834,0.0007758483,0.1859328],"genre_scores_gemma":[0.9913566,0.00001125243,0.004772928,0.00005140673,0.00006139495,0.0001193956,0.000006276226,0.00009576879,0.003525054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2010023,"threshold_uncertainty_score":0.9997622,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001308518,0.0001107418,0.000298586,0.0001068993,0.00004333687,0.00000218827,0.0001308298,0.00004862528,0.0001485814],"category_scores_gemma":[0.00005687346,0.0001047149,0.0001057501,0.000226932,0.0001177824,0.00005260845,0.00001588996,0.0000562952,0.00002901997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005799169,"about_ca_system_score_gemma":0.000008941551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002563052,"about_ca_topic_score_gemma":7.052226e-7,"domain_scores_codex":[0.999172,0.00002865481,0.0004249075,0.00008258835,0.0001479824,0.0001439075],"domain_scores_gemma":[0.9994106,0.0001660725,0.00006796562,0.0002682657,0.00004343647,0.00004371504],"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.00001720861,0.0002080715,0.004457319,0.002580529,0.0003006741,0.000007664555,0.01425686,0.0005633548,0.02564994,0.9502369,0.001381322,0.0003401536],"study_design_scores_gemma":[0.003767732,0.0008682918,0.06811505,0.003120892,0.0005786518,0.0005858181,0.01037645,0.1194434,0.0789757,0.7071775,0.004438386,0.002552114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9756554,0.0003288635,0.001817075,0.000003607425,0.0001053582,0.00013086,0.0001072863,0.0001070911,0.0217445],"genre_scores_gemma":[0.9970431,0.00001075826,0.002881628,0.000001880717,0.000003194303,0.000009579816,0.000009939906,0.00001878602,0.00002109282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2430594,"threshold_uncertainty_score":0.4270148,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002975024,0.0002034782,0.0003729219,0.0001829846,0.0001805813,0.0001483394,0.0003769206,0.00009014997,0.001305205],"category_scores_gemma":[0.003307461,0.0001464438,0.0001003296,0.000430817,0.0004458199,0.0004576795,0.0001264776,0.0001194905,0.0005006975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892378,"about_ca_system_score_gemma":0.00007149652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005840252,"about_ca_topic_score_gemma":0.000001292813,"domain_scores_codex":[0.9968187,0.0003296905,0.0009512085,0.0005869663,0.0009898513,0.0003235935],"domain_scores_gemma":[0.9975711,0.001128559,0.0002485574,0.0006703274,0.0001892277,0.0001922619],"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.001170813,0.001218732,0.003415954,0.00006698035,0.0002443698,0.0001652703,0.009348447,0.0001071197,0.1113154,0.7217475,0.05508851,0.09611101],"study_design_scores_gemma":[0.001238907,0.0002197436,0.005600998,0.00004704376,0.00002892781,0.0004574203,0.002411554,0.01193984,0.003959237,0.9638196,0.00987901,0.0003977001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7637416,0.001362588,0.1211624,0.006105036,0.0008883308,0.001937129,0.0002591953,0.0004027064,0.104141],"genre_scores_gemma":[0.4088445,0.00002964715,0.5817741,0.0003210587,0.0001193627,0.00006765678,0.000005427528,0.00002510197,0.008813196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4606117,"threshold_uncertainty_score":0.9996077,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157706,0.0002413174,0.0004340846,0.0003578838,0.00009937185,0.00008166046,0.0004593646,0.00007390414,0.00003166483],"category_scores_gemma":[0.0001275093,0.0001959801,0.0001441075,0.0005365789,0.0004356558,0.0002662242,0.000301805,0.0001550425,0.000007857047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006509195,"about_ca_system_score_gemma":0.00002100662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001454631,"about_ca_topic_score_gemma":0.000002749646,"domain_scores_codex":[0.998347,0.0000987342,0.0004930664,0.0004669727,0.0003083047,0.0002858879],"domain_scores_gemma":[0.9981723,0.0009037125,0.0001280308,0.0006304743,0.00006250361,0.0001029799],"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.00001483461,0.00008136932,0.00004799071,0.001304533,0.00008877225,0.00002476684,0.002394435,0.000004958402,0.001553749,0.9610886,0.0001890916,0.03320688],"study_design_scores_gemma":[0.0002284315,0.0002063435,0.0006132985,0.0007604391,0.00004432095,0.00005671382,0.0004080682,0.01025697,0.001825224,0.9853159,0.00009026266,0.0001940525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7692976,0.005244193,0.2115787,0.000672473,0.0004375655,0.0006397134,0.0001345513,0.0003779093,0.01161726],"genre_scores_gemma":[0.9287506,0.00007346771,0.07102299,0.00005204552,0.00001232146,0.00001131967,0.000001953132,0.00001726456,0.00005802944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.159453,"threshold_uncertainty_score":0.7991837,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001910286,0.0001336901,0.0003826309,0.0001716677,0.0001387875,0.00001368889,0.0003899924,0.00007885365,0.003877987],"category_scores_gemma":[0.008284216,0.00008862346,0.0001427301,0.000422324,0.0003174483,0.0001026923,0.0001003833,0.0001150916,0.003575668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001379563,"about_ca_system_score_gemma":0.00008514347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002758829,"about_ca_topic_score_gemma":4.494716e-7,"domain_scores_codex":[0.9973378,0.0001799258,0.0006231589,0.0002977529,0.001353075,0.0002083425],"domain_scores_gemma":[0.9938832,0.00485426,0.0001524421,0.0007536799,0.0002514255,0.0001050217],"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.0003781731,0.001037861,0.0005889215,0.00004630655,0.00007610821,0.00009609626,0.004173995,0.00007772446,0.003585417,0.8798432,0.1078293,0.00226696],"study_design_scores_gemma":[0.0003205342,0.0003136258,0.002385371,0.00004150176,0.00001029806,0.0001030058,0.0003369365,0.0004578869,0.002915582,0.9906054,0.002355176,0.0001546481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9508381,0.0001319962,0.00009941862,0.000222293,0.00020681,0.0001174143,0.00002759598,0.00003467913,0.04832164],"genre_scores_gemma":[0.9937103,0.000002958167,0.002660252,0.0002413323,0.00002881807,0.000002244158,0.000002452939,0.00001124256,0.003340385],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1107623,"threshold_uncertainty_score":0.9972002,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002353547,0.0001502114,0.0002758415,0.000115986,0.00007469429,0.00001856463,0.0001600929,0.00006638238,0.0001616192],"category_scores_gemma":[0.00001577662,0.0001425118,0.0001364249,0.0002012624,0.000076535,0.0001636294,0.0000211805,0.00007798143,0.000157047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001768104,"about_ca_system_score_gemma":0.000005731462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001761474,"about_ca_topic_score_gemma":0.000006950072,"domain_scores_codex":[0.9989758,0.00003365388,0.0004299696,0.0001235963,0.0001444508,0.0002925672],"domain_scores_gemma":[0.9993986,0.0001224805,0.00004885189,0.000343044,0.00003138788,0.00005563259],"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.000007719143,0.0002270064,0.0001604685,0.0007204036,0.0000814433,0.000004659555,0.0004482853,0.004345187,0.03870212,0.9526471,0.002490142,0.0001654963],"study_design_scores_gemma":[0.0003950334,0.00004300698,0.0008557604,0.0001996986,0.00006190345,0.00001830373,0.0002751295,0.03608708,0.02296542,0.9382336,0.0005934623,0.0002716103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9669526,0.001156632,0.001093706,0.00002346381,0.0001956038,0.0002817159,0.00005425094,0.0003520204,0.02988999],"genre_scores_gemma":[0.9978025,0.000007420945,0.001880382,0.000006790964,0.00002560874,0.00005435527,0.000009883809,0.00002815519,0.0001849276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03174189,"threshold_uncertainty_score":0.5811461,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008740556,0.0001712558,0.0001973628,0.0000502143,0.0002415076,0.0001112648,0.0007279625,0.00005687834,0.00004771192],"category_scores_gemma":[0.00007607992,0.0001132286,0.0001100172,0.0002065962,0.0002270866,0.0005586448,0.0003302579,0.0001426017,0.00005122378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007656451,"about_ca_system_score_gemma":0.000008029838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008915735,"about_ca_topic_score_gemma":0.000001034708,"domain_scores_codex":[0.9987748,0.0001460895,0.0002173138,0.0002571834,0.0002367183,0.0003679184],"domain_scores_gemma":[0.998217,0.000728372,0.00006868519,0.0008294274,0.00002172359,0.0001347642],"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.000007049832,0.00009783535,0.0004341646,0.00001564879,0.0000447679,0.000001044549,0.002420814,9.766485e-7,0.0002019554,0.9944763,0.0004786366,0.001820809],"study_design_scores_gemma":[0.0003101719,0.0001077877,0.005132352,0.00007748043,0.00006226705,0.00001834617,0.0008342252,0.01015246,0.0005701,0.9780917,0.004345563,0.0002976174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.784839,0.006094781,0.2056759,0.001012606,0.0003468019,0.0003575416,0.00003243301,0.0003545534,0.001286397],"genre_scores_gemma":[0.905369,0.00003023896,0.09422468,0.0001647597,0.0001497734,0.00002081389,0.00000367363,0.00001093306,0.00002615821],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.12053,"threshold_uncertainty_score":0.4617329,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905767,0.0001591507,0.0002710233,0.0001314189,0.0001581208,0.0001892211,0.0006918037,0.00009464342,0.00005129096],"category_scores_gemma":[0.0006277969,0.0001400631,0.0001154131,0.0005696507,0.00006903995,0.0003232913,0.0001506531,0.000120303,0.0001899091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004695248,"about_ca_system_score_gemma":0.00005893642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006410976,"about_ca_topic_score_gemma":0.000002340627,"domain_scores_codex":[0.9984606,0.00008640262,0.0004308623,0.0003977371,0.0003082499,0.0003161584],"domain_scores_gemma":[0.9984871,0.0004339703,0.00005126034,0.0007974373,0.0001469676,0.00008323541],"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.000005923237,0.0001326978,0.000005360507,0.0001776446,0.00001631578,0.00001715821,0.0002678967,0.000001376333,0.0002981075,0.9780371,0.008113458,0.01292701],"study_design_scores_gemma":[0.0005097688,0.0000488953,0.0005936775,0.0004334748,0.00002749548,0.00005334928,0.0001260641,0.2061251,0.0008721783,0.7580156,0.0329134,0.0002809383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007042302,0.00040129,0.8947629,0.004868401,0.0009235011,0.0003283923,0.00001339812,0.0003413215,0.09131849],"genre_scores_gemma":[0.9766406,0.000003334231,0.02201752,0.000268981,0.00001330905,0.0000402503,0.000004644834,0.000006572434,0.001004734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9695984,"threshold_uncertainty_score":0.5711607,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000681604,0.0001402459,0.0001947025,0.00005398205,0.0001364714,0.00004990549,0.0006584657,0.00004428524,0.001385269],"category_scores_gemma":[0.0001178427,0.00008576291,0.0001142417,0.0004625446,0.0001214474,0.0001095127,0.00006695255,0.0001164865,0.001162495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005182675,"about_ca_system_score_gemma":0.00001877393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008619209,"about_ca_topic_score_gemma":4.156652e-7,"domain_scores_codex":[0.9986645,0.00008046173,0.0003721736,0.0002636249,0.0003609444,0.0002582867],"domain_scores_gemma":[0.9983619,0.000452584,0.00008072296,0.0009724604,0.00006296629,0.00006936703],"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.000003965792,0.0001458388,0.00002744826,0.00002811618,0.00002173462,0.00000158694,0.0007741532,0.00002558731,0.0001920502,0.9906933,0.00302238,0.005063829],"study_design_scores_gemma":[0.0001580825,0.00004360816,0.00003816287,0.0001359074,0.00001084737,0.00001189291,0.00002841742,0.02251484,0.001277622,0.9750718,0.0005958456,0.0001128967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9191398,0.0002796862,0.003257717,0.002804756,0.0001645561,0.0003632579,0.000005875759,0.0003063396,0.07367803],"genre_scores_gemma":[0.9771813,0.00001834806,0.02152801,0.0005411799,0.000002477125,0.00001892416,6.014148e-7,0.00001048018,0.0006986569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07297938,"threshold_uncertainty_score":0.9996152,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976081,0.0001129433,0.000208979,0.0001034707,0.00008480592,0.00002685937,0.0002850594,0.00003358704,0.00005454031],"category_scores_gemma":[0.00005104344,0.00007439606,0.00004842498,0.0002187568,0.0001069072,0.0001574986,0.0001817313,0.00002728251,0.00001713134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001127299,"about_ca_system_score_gemma":0.000020361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001712138,"about_ca_topic_score_gemma":0.000005101466,"domain_scores_codex":[0.9989263,0.00006571,0.0003477332,0.0002620703,0.0002101731,0.0001880273],"domain_scores_gemma":[0.9990597,0.0001807826,0.0001226117,0.0004527034,0.0001042573,0.00007989565],"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.000002760539,0.0001089872,0.0007025848,0.00008440066,0.00002842762,6.910214e-7,0.0007718011,3.332627e-7,0.01013729,0.9858919,0.001202379,0.001068449],"study_design_scores_gemma":[0.0007035321,0.0001242307,0.001715552,0.0001007555,0.00002182455,0.00001098384,0.00002845311,0.01061612,0.003507549,0.982208,0.0008127678,0.0001502666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8013887,0.0003332403,0.1934701,0.001796237,0.0001715177,0.0005463607,0.00004163881,0.0004516042,0.001800636],"genre_scores_gemma":[0.8494349,0.00001882509,0.1503899,0.00009841173,0.000001349257,0.00001289303,0.000002032975,0.000005944906,0.00003574323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04804617,"threshold_uncertainty_score":0.3033783,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008060904,0.0003601166,0.0007895746,0.0007937147,0.0002371132,0.0002521514,0.0006815864,0.0001907994,0.001494236],"category_scores_gemma":[0.01508371,0.0002457485,0.0003087262,0.001880905,0.0006370094,0.0003607692,0.0003351257,0.0003128693,0.0002642881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002494221,"about_ca_system_score_gemma":0.00009627457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001227754,"about_ca_topic_score_gemma":0.000008000692,"domain_scores_codex":[0.9953119,0.0009094244,0.001153003,0.0009622384,0.001207358,0.0004560681],"domain_scores_gemma":[0.9834869,0.01468338,0.0001882221,0.001150094,0.000285713,0.0002057009],"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.0007143028,0.0005911686,0.001005032,0.001425287,0.0005430958,0.00009822127,0.03883569,0.00002759045,0.02271438,0.7022977,0.02956413,0.2021834],"study_design_scores_gemma":[0.000272491,0.0001153467,0.001051156,0.0004890762,0.000119512,0.00006397608,0.00330649,0.01044098,0.001439803,0.9783309,0.004038976,0.0003312887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9625825,0.009626202,0.007047561,0.0007221393,0.0008887301,0.0006480097,0.0001879256,0.001273317,0.01702361],"genre_scores_gemma":[0.9941252,0.00008171052,0.003828093,0.00009599753,0.00008232686,0.00002894537,0.00001174374,0.0000465837,0.001699434],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2760332,"threshold_uncertainty_score":0.9999995,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000132784,0.0001570739,0.0002213437,0.00004211014,0.0002230278,0.00004599115,0.0001779508,0.00002949147,0.0004794099],"category_scores_gemma":[0.00001219198,0.0001144465,0.00006723772,0.000220159,0.0001619955,0.00007999059,0.0001142525,0.00009243325,0.00008683559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009275336,"about_ca_system_score_gemma":0.00002238604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004012587,"about_ca_topic_score_gemma":2.715047e-7,"domain_scores_codex":[0.999217,0.0000168623,0.0002655508,0.0002479211,0.00006452257,0.0001880823],"domain_scores_gemma":[0.998961,0.000464206,0.0000634952,0.0004021124,0.00004344172,0.00006573245],"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.000001149988,0.00009095298,0.00006059594,0.00006806474,0.00002503739,2.788694e-8,0.0002145871,0.000001951014,0.000244223,0.9701949,0.0001787633,0.02891972],"study_design_scores_gemma":[0.0001047142,0.000007784293,0.00004553104,0.00005980332,0.00001773187,3.514037e-7,0.001391956,0.0008706239,0.001633495,0.9713732,0.02438796,0.0001068566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006618035,0.0002163898,0.7948344,0.0005903498,0.0000165497,0.0005611114,0.00005415185,0.00007532702,0.1970337],"genre_scores_gemma":[0.9820381,0.000005857041,0.01549167,0.00006433843,0.0000350102,0.0004005759,0.00001554017,0.00001108311,0.001937835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9754201,"threshold_uncertainty_score":0.5249202,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002357726,0.0004524703,0.001057492,0.0001923267,0.0004093291,0.00008415234,0.0006677997,0.0002214483,0.0009138001],"category_scores_gemma":[0.001092399,0.0003084242,0.0004370408,0.0006897828,0.002426433,0.00009714306,0.000225031,0.0004199993,0.00007014633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003257762,"about_ca_system_score_gemma":0.00009852883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006898096,"about_ca_topic_score_gemma":0.000003377342,"domain_scores_codex":[0.9969048,0.0004027885,0.001363842,0.0004865013,0.0003484751,0.0004936183],"domain_scores_gemma":[0.9926911,0.004862125,0.0004471713,0.001742153,0.000146865,0.0001105584],"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.0001814463,0.00063851,0.0000199179,0.001581998,0.0003888754,0.000001608932,0.01430968,5.305998e-7,0.0002138949,0.9797615,0.002197389,0.0007046255],"study_design_scores_gemma":[0.002008096,0.00006844638,0.000182074,0.0007520167,0.0007870035,0.00001686012,0.00480309,0.001639975,0.002165625,0.9845847,0.002751919,0.0002401583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7083976,0.0083344,0.0133729,0.004821671,0.0004391474,0.004440258,0.0001933998,0.0001526006,0.259848],"genre_scores_gemma":[0.9886407,0.0003481288,0.006451283,0.0001696517,0.0000250403,0.0001665309,0.000002601042,0.00003599445,0.004160125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2802431,"threshold_uncertainty_score":0.9999995,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005500058,0.000300558,0.0004041676,0.00008513636,0.0003221411,0.00007698149,0.0006030843,0.00007750161,0.0006539988],"category_scores_gemma":[0.0004784927,0.0001796583,0.0001478628,0.0007959528,0.0001831962,0.0001166054,0.0001266793,0.0002628299,0.0004250965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001567039,"about_ca_system_score_gemma":0.00004548569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003870426,"about_ca_topic_score_gemma":0.000006591539,"domain_scores_codex":[0.9981346,0.0001411376,0.0004469771,0.0004292825,0.0004309348,0.0004170276],"domain_scores_gemma":[0.998004,0.0006280867,0.0001272234,0.0008895545,0.00008810794,0.0002630917],"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.0001407478,0.000147925,0.00005492423,0.0001269802,0.00009266145,0.000008430507,0.003893195,0.00001427101,0.00028479,0.9836901,0.01136313,0.0001828721],"study_design_scores_gemma":[0.0006680692,0.0001587755,0.0001712596,0.00006528829,0.0001126892,0.00003755649,0.0007989066,0.001169479,0.0005759976,0.9901466,0.005805716,0.0002896253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8740162,0.0003814362,0.06488654,0.03129857,0.0001012762,0.004207881,0.0001040953,0.000765672,0.02423837],"genre_scores_gemma":[0.9693589,0.000005499998,0.02750988,0.001645755,0.0002019237,0.00044359,0.000005197527,0.00007153947,0.0007576629],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09534279,"threshold_uncertainty_score":0.7326252,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002083784,0.0001474821,0.0001884786,0.000134948,0.00006189555,0.00003996013,0.00007047883,0.00005849115,0.00002971081],"category_scores_gemma":[0.0001334606,0.0001378525,0.00005221866,0.00009698662,0.00002877379,0.00009834141,0.00001658077,0.00006035631,0.000003734557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003283338,"about_ca_system_score_gemma":0.000007089119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001601214,"about_ca_topic_score_gemma":9.26515e-7,"domain_scores_codex":[0.9993235,0.000006727207,0.0002211827,0.0001430639,0.0001154456,0.0001900655],"domain_scores_gemma":[0.9996452,0.0000883235,0.00001860443,0.0001712211,0.0000378303,0.00003886466],"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.00004023816,0.00009587654,0.00008121651,0.006419199,0.0004088414,0.00000155324,0.001835227,0.004661125,0.02311555,0.8662679,0.01106012,0.08601319],"study_design_scores_gemma":[0.001861294,0.00006311473,0.009957572,0.0003386819,0.000199346,0.00001008266,0.0003666961,0.4620449,0.01764047,0.5032647,0.003732076,0.0005209871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8496589,0.001732327,0.1362657,0.0003735393,0.001012544,0.001253883,0.0000440048,0.0005629386,0.009096211],"genre_scores_gemma":[0.9897701,0.0000166128,0.009707761,0.00001833519,0.00002415359,0.0001156525,0.00001087544,0.00001902915,0.0003174884],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4573838,"threshold_uncertainty_score":0.5621464,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009665937,0.0002216546,0.0004203075,0.0003520202,0.0001409002,0.0000589568,0.0002377149,0.0001212676,0.00005183803],"category_scores_gemma":[0.0003470588,0.0001948822,0.0001046816,0.0007767297,0.0002079413,0.00009636758,0.00008989174,0.000170123,0.00002884427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001810142,"about_ca_system_score_gemma":0.00002342992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001224193,"about_ca_topic_score_gemma":0.000010923,"domain_scores_codex":[0.9984174,0.0001352064,0.0005973589,0.0003555248,0.0001725018,0.0003220547],"domain_scores_gemma":[0.9983242,0.0006803023,0.0001085869,0.0007533415,0.00005120472,0.00008234254],"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.00000942402,0.000215353,0.0004920495,0.0007304839,0.00004005035,0.000003347503,0.0006384153,4.001072e-7,0.0004470348,0.9944629,0.002522329,0.0004381985],"study_design_scores_gemma":[0.0003494025,0.00001792458,0.0006256165,0.0004314935,0.0000593307,0.000007956311,0.000926285,0.000724703,0.0002126191,0.994208,0.002269004,0.0001676433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9683186,0.001695797,0.001328261,0.0006575033,0.0001172776,0.001219769,0.00003194808,0.0002705721,0.02636029],"genre_scores_gemma":[0.9937584,0.00005685327,0.00455708,0.0000650252,0.000005547639,0.0003626036,0.000004255298,0.00002263606,0.001167573],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02543984,"threshold_uncertainty_score":0.7947064,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002085248,0.0006238841,0.0008491946,0.0007152692,0.0007852545,0.0002896762,0.001126583,0.000443209,0.002606745],"category_scores_gemma":[0.001387318,0.0006330934,0.0005781868,0.002132276,0.0006747429,0.000278866,0.0003010628,0.0005533335,0.001552668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009726494,"about_ca_system_score_gemma":0.0001728534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007128978,"about_ca_topic_score_gemma":0.000006609985,"domain_scores_codex":[0.9954823,0.0003252139,0.001998306,0.0009156711,0.0005334062,0.0007450993],"domain_scores_gemma":[0.9942368,0.001880579,0.0005894648,0.002744887,0.0003435933,0.000204666],"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.00003568613,0.001408874,0.0001031302,0.002218967,0.0003788692,0.000002093254,0.001497894,0.000002840981,0.0007541723,0.9736199,0.01611394,0.003863645],"study_design_scores_gemma":[0.0005628328,0.00002898257,0.0008635101,0.0008078899,0.0006799201,0.000008163362,0.002109553,0.002744276,0.002460762,0.9807895,0.008485753,0.00045888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1356562,0.003254624,0.4391257,0.007325244,0.001662287,0.006102977,0.000336226,0.001044619,0.4054922],"genre_scores_gemma":[0.9748262,0.0001224871,0.004687479,0.0002433396,0.00006351143,0.0005330972,0.00002476722,0.00006553876,0.01943362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.83917,"threshold_uncertainty_score":0.999612,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000232715,0.0001848201,0.0003652361,0.0001141901,0.00005335727,0.00002179419,0.0002121099,0.00007262313,0.001234508],"category_scores_gemma":[0.00002678356,0.0001681405,0.0001392728,0.0002492964,0.00009033169,0.0001267833,0.00002364005,0.0001042492,0.0005099621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001340592,"about_ca_system_score_gemma":0.000001439384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003456244,"about_ca_topic_score_gemma":0.000001240346,"domain_scores_codex":[0.9988864,0.0000379947,0.0004424974,0.0001486702,0.0001755007,0.000308926],"domain_scores_gemma":[0.9993477,0.00009141357,0.0000573545,0.0003904922,0.00002860199,0.0000844096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005042071,0.0007285253,0.001128578,0.008063466,0.0009491725,0.00003782755,0.04251768,0.005732084,0.08402389,0.815607,0.03843103,0.002730333],"study_design_scores_gemma":[0.001210187,0.0002539651,0.0005529951,0.0008518312,0.0001622381,0.00009322244,0.002540942,0.7515318,0.01843081,0.2018349,0.02137917,0.001157931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9399393,0.0009142557,0.002042854,0.00003868321,0.000260288,0.0003587861,0.00005882448,0.0004386112,0.05594837],"genre_scores_gemma":[0.9984499,0.00001637841,0.0007742124,0.00001268589,0.00001202178,0.00002911818,0.000002807714,0.00003140507,0.0006715176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7457997,"threshold_uncertainty_score":0.9996785,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003127785,0.0002110854,0.000358617,0.00001783061,0.0005981617,0.0001752606,0.0003378072,0.00004467623,0.00163492],"category_scores_gemma":[0.00007736658,0.0001710001,0.0001035797,0.00003910185,0.0002633122,0.0001750932,0.0001819413,0.0001160201,0.00009981493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001002755,"about_ca_system_score_gemma":0.00001213854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004047258,"about_ca_topic_score_gemma":5.692095e-7,"domain_scores_codex":[0.9989251,0.00004317117,0.0003149482,0.0002965333,0.0001183431,0.0003018767],"domain_scores_gemma":[0.9984077,0.0002800175,0.0002060484,0.000904192,0.0000304098,0.0001716909],"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.000004639225,0.00008780557,0.00008431097,0.00005069243,0.0000483969,2.407628e-7,0.0002524002,2.858253e-7,0.0008803236,0.9818749,0.002249114,0.01446685],"study_design_scores_gemma":[0.0003525,0.00001185407,0.00005950786,0.00003576957,0.00005321069,0.000001888201,0.0004110658,0.0008350246,0.002642315,0.9610331,0.03434221,0.0002215489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05725238,0.000329831,0.7140974,0.002036484,0.0001014789,0.0008388963,0.000233736,0.0001355165,0.2249743],"genre_scores_gemma":[0.5269295,0.00001359219,0.4649076,0.00004299932,0.0001134937,0.0001943714,0.00002879751,0.0000462165,0.007723491],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4696771,"threshold_uncertainty_score":0.9992777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}