{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":151,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":151,"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":"a2cf84b40bc3","filters":{"venue":"Fundamenta Informaticae"}},"results":[{"id":"W2130367040","doi":"10.3233/fun-2002-533-409","title":"Approximate Entropy Reducts","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":272,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Computer science; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.02826701014478259,"gpt":0.2163878629629516,"spread":0.188120852818169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001408138,0.0001455698,0.0001526154,0.00008455255,0.0001583184,0.0004032436,0.000836494,0.00004432682,0.0007425977],"category_scores_gemma":[0.00002066388,0.0001157667,0.00005843586,0.000287622,0.00005201172,0.00125753,0.0002814303,0.0001151576,0.002627925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003910928,"about_ca_system_score_gemma":0.000009603928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003916905,"about_ca_topic_score_gemma":1.292156e-7,"domain_scores_codex":[0.9987608,0.00001904973,0.0003475642,0.0001615894,0.0003111913,0.0003997696],"domain_scores_gemma":[0.9990789,0.00002808156,0.0001077605,0.0006229582,0.00002652265,0.0001357292],"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.000007081865,0.0003692442,0.0005182143,0.000149418,0.00007681097,0.00003362238,0.01337219,0.0001208899,0.0002307652,0.5760646,0.2095775,0.1994797],"study_design_scores_gemma":[0.001069846,0.0002438931,0.0006098047,0.00004017544,0.00001136665,0.0001211616,0.0004279347,0.7477345,0.0006831319,0.00817348,0.2402941,0.0005906119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02735689,0.000410105,0.2457773,0.00651187,0.001876201,0.0008857534,0.00001601622,0.00117276,0.7159931],"genre_scores_gemma":[0.7119772,0.0001291896,0.281839,0.004580976,0.0001021468,0.00004658893,0.00001097492,0.00001300965,0.00130089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7476136,"threshold_uncertainty_score":0.9981486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1704544815","doi":"10.3233/fi-2011-423","title":"Game-Theoretic Rough Sets","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":235,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Mathematics; Game theory; Computer science; Mathematical economics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04029298648701973,"gpt":0.2332644442882116,"spread":0.1929714578011919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002605114,0.0001749889,0.0001762911,0.00009161278,0.0001081148,0.0002122223,0.001133509,0.00006195287,0.0005053796],"category_scores_gemma":[0.00001796733,0.0001372325,0.00007823249,0.0002669409,0.0001026213,0.001337283,0.0003983199,0.0001362839,0.002315731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004529462,"about_ca_system_score_gemma":0.00003865031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002008246,"about_ca_topic_score_gemma":0.000001055971,"domain_scores_codex":[0.9986648,0.00003056189,0.0004055272,0.0001792567,0.0002948206,0.0004250336],"domain_scores_gemma":[0.9988942,0.00003747402,0.0001260197,0.0007533292,0.00003464282,0.0001544013],"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.00001455722,0.0001644448,0.001363038,0.00009201776,0.00004545942,0.00002657417,0.02681634,0.00001213882,0.000005559862,0.8731214,0.006093516,0.092245],"study_design_scores_gemma":[0.003497273,0.001898583,0.03248711,0.0002468996,0.00007325505,0.0004406634,0.002114411,0.1991068,0.002026149,0.5396056,0.2160062,0.002497128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03472272,0.00006890165,0.1855368,0.0003790029,0.0008274177,0.0004194007,0.00000857381,0.0005199699,0.7775172],"genre_scores_gemma":[0.8931658,0.00002537809,0.1039182,0.002657213,0.00002775702,0.00002749534,0.000008157731,0.000008869874,0.0001611612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8584431,"threshold_uncertainty_score":0.9984611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162033093","doi":"","title":"Near Sets. Special Theory about Nearness of Objects","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Closeness; Rough set; Extension (predicate logic); Mathematics; Relation (database); Context (archaeology); Set (abstract data type); Term (time); Object (grammar); Theoretical computer science; Algorithm; Computer science; Artificial intelligence; Data mining; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0126339547471086,"gpt":0.2519032803148338,"spread":0.2392693255677252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074934,0.000156922,0.0002315368,0.0001018122,0.0001660171,0.0002371473,0.0008827582,0.00007560677,0.0002572638],"category_scores_gemma":[0.000050042,0.0001269944,0.00008980266,0.0003865556,0.0001711614,0.0008921673,0.0003360281,0.000149958,0.0004055639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005037705,"about_ca_system_score_gemma":0.00008748773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001317011,"about_ca_topic_score_gemma":0.000005955064,"domain_scores_codex":[0.9983798,0.00003367102,0.0005806156,0.0001478449,0.0004244878,0.0004336238],"domain_scores_gemma":[0.9988427,0.0001694097,0.000223138,0.0005715789,0.00005800818,0.0001352211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009005222,0.0002059717,0.002176976,0.0001806726,0.00007374401,0.00002894173,0.03085257,0.0001471088,0.00003779149,0.4291016,0.006620551,0.530484],"study_design_scores_gemma":[0.007562048,0.002520389,0.1837617,0.0005293649,0.0001109455,0.0003114484,0.01313293,0.09442805,0.009109762,0.155161,0.53019,0.003182414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.194852,0.0001066054,0.1948454,0.0001863929,0.00175123,0.0005009288,0.0000152258,0.0002030158,0.6075392],"genre_scores_gemma":[0.9185066,0.00001651403,0.07948768,0.001497718,0.000299415,0.0000059343,0.00001111217,0.00001053635,0.0001645558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7236545,"threshold_uncertainty_score":0.5212838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1567021454","doi":"10.3233/fi-2012-647","title":"Modelling Multi-agent Three-way Decisions with Decision-theoretic Rough Sets","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Natural Sciences and Engineering Research Council of Canada","funders":"University of Regina","keywords":"Rough set; Computer science; Management science; Data mining; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05780612909384455,"gpt":0.273292827846829,"spread":0.2154866987529844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006248871,0.0003157593,0.0003029185,0.0001654634,0.0004109402,0.0004659497,0.001183566,0.00009576776,0.000141721],"category_scores_gemma":[0.00005287189,0.0002102426,0.0001074452,0.0004756554,0.0001119267,0.002545046,0.0005633847,0.0002424354,0.001355174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001195237,"about_ca_system_score_gemma":0.00007026147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002178727,"about_ca_topic_score_gemma":0.000007538802,"domain_scores_codex":[0.9974666,0.00003441155,0.0006441593,0.0002619861,0.000748929,0.0008438643],"domain_scores_gemma":[0.9977899,0.0004023909,0.0001966496,0.001100391,0.00008112002,0.00042954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001225139,0.001190243,0.008603184,0.00008959818,0.0002129531,0.00003320059,0.0229806,0.176358,0.000006488506,0.384737,0.005619074,0.4000472],"study_design_scores_gemma":[0.0009252253,0.0001653551,0.001266744,0.0001265343,0.00002229479,0.00007853642,0.0002454453,0.9764056,0.00002947959,0.009901117,0.01040763,0.0004260079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04411538,0.0001839525,0.9473106,0.0002126321,0.0004866988,0.0004217939,0.00001001739,0.0001796023,0.007079386],"genre_scores_gemma":[0.5015795,0.0000395834,0.4976664,0.000601238,0.00003538895,0.00003235964,0.000008027585,0.00001214957,0.00002531475],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8000476,"threshold_uncertainty_score":0.9994224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1701036113","doi":"10.3233/fi-2011-422","title":"Two Semantic Issues in a Probabilistic Rough Set Model","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Probabilistic logic; Equivalence (formal languages); Set (abstract data type); Dominance-based rough set approach; Mathematics; Probabilistic relevance model; Theoretical computer science; Computer science; Algorithm; Discrete mathematics; Data mining; Artificial intelligence; Probabilistic analysis of algorithms","retraction":null,"screen_n_in":null,"score":{"opus":0.06935996552841586,"gpt":0.2858082205213743,"spread":0.2164482549929584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003524843,0.0001962027,0.0002490142,0.0001473182,0.00008298106,0.0001961581,0.0009725285,0.00005208626,0.00008333027],"category_scores_gemma":[0.00003572046,0.0001596791,0.00005774092,0.0003637201,0.00006842462,0.00154836,0.0004098654,0.0001626093,0.0005062937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007926146,"about_ca_system_score_gemma":0.0000663617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000211561,"about_ca_topic_score_gemma":0.00004686019,"domain_scores_codex":[0.9984367,0.00003338668,0.0005476712,0.0002239871,0.0002955618,0.0004627205],"domain_scores_gemma":[0.9990183,0.00003451704,0.0001178177,0.0006875307,0.00003383081,0.0001080687],"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.00004962858,0.0006766635,0.006056702,0.0004624942,0.00006324761,0.00007542401,0.1324014,0.01085952,0.00002152901,0.8158267,0.007508579,0.02599811],"study_design_scores_gemma":[0.0005791236,0.0001197422,0.001297683,0.00005475837,0.000006056975,0.0000195872,0.0003211665,0.9262887,0.00004193247,0.07000636,0.0009947408,0.0002701749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2449874,0.0002439474,0.3535629,0.001811281,0.0008046753,0.002200046,0.00003256521,0.0008521299,0.3955051],"genre_scores_gemma":[0.8392276,0.00001885932,0.1593852,0.001101138,0.00001958728,0.00005973692,0.000007375264,0.000008213794,0.0001722762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9154292,"threshold_uncertainty_score":0.6511526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1553071595","doi":"10.3233/fi-2011-565","title":"Self-Indexed Grammar-Based Compression","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science; Grammar; Compression (physics); Natural language processing; Linguistics; Materials science; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.03041967066636761,"gpt":0.2243386128071558,"spread":0.1939189421407882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002324742,0.0001961682,0.0001890641,0.0001323948,0.0002411446,0.0002148307,0.001278912,0.00007616918,0.0002801978],"category_scores_gemma":[0.00001243138,0.0001537369,0.00007350944,0.0002586793,0.00004283225,0.001788214,0.0005862907,0.0001655174,0.0006550656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005593705,"about_ca_system_score_gemma":0.00007597244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003556385,"about_ca_topic_score_gemma":0.000001263792,"domain_scores_codex":[0.9984992,0.00004155832,0.0004317111,0.0002178613,0.0004295523,0.0003800727],"domain_scores_gemma":[0.9985622,0.00005382331,0.0001808813,0.0009390097,0.00005907525,0.0002049788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002755629,0.003778557,0.01356913,0.001098509,0.0003011696,0.0001425446,0.03502806,0.0001851889,0.0008825703,0.2831717,0.09996286,0.5616041],"study_design_scores_gemma":[0.001889502,0.0003714121,0.006435939,0.0001430915,0.0000187604,0.00002277692,0.0001925459,0.7938842,0.007321088,0.002962858,0.1861156,0.0006422822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006266039,0.00003504575,0.9552984,0.0001292536,0.0006627993,0.0003868763,0.00001402024,0.0007784965,0.03642904],"genre_scores_gemma":[0.2961221,0.000009427145,0.7020909,0.001517623,0.00004818085,0.00004577403,0.00005023573,0.00001329463,0.0001024484],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.793699,"threshold_uncertainty_score":0.8419761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1552423790","doi":"10.3233/fi-2009-0015","title":"A Doctrine of Cognitive Informatics (CI)","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Manitoba; University of Alberta; University of Calgary","funders":"","keywords":"Doctrine; Informatics; Cognition; Computer science; Cognitive science; Psychology; Political science; Law; Neuroscience","retraction":null,"screen_n_in":null,"score":{"opus":0.01394603826728902,"gpt":0.2597971230642052,"spread":0.2458510847969161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330373,0.0001667141,0.000252974,0.0001814307,0.00009858449,0.0001304333,0.000575576,0.00005330749,0.00004204632],"category_scores_gemma":[0.000117831,0.0001484829,0.00009007354,0.0005415427,0.00005931713,0.0008617809,0.0002303001,0.0001761173,0.0002006238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003094666,"about_ca_system_score_gemma":0.00005984074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000239818,"about_ca_topic_score_gemma":4.052957e-7,"domain_scores_codex":[0.9984755,0.00002552833,0.000721023,0.00009416144,0.0003493628,0.0003344515],"domain_scores_gemma":[0.99878,0.0002700725,0.0003212341,0.0003193787,0.0001935579,0.0001157812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004374376,0.0002377326,0.0005740385,0.00007983173,0.00006959508,0.000004869186,0.01174572,0.000118609,0.00002772699,0.03744935,0.004174541,0.9454742],"study_design_scores_gemma":[0.008380412,0.004538985,0.03358058,0.002599061,0.0001336377,0.0002508355,0.004779498,0.8865932,0.009775269,0.01868115,0.02870699,0.001980431],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1158761,0.00007479497,0.7920412,0.0003756502,0.0002340765,0.0003856215,0.00001428586,0.0002566325,0.09074161],"genre_scores_gemma":[0.9790637,0.00002315549,0.01836433,0.00239692,0.00004281296,0.000004712942,0.00001728773,0.00000322305,0.00008383999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9434938,"threshold_uncertainty_score":0.6054957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1664278360","doi":"10.3233/fi-2014-1055","title":"On Axiomatization of Inconsistency Indicators for Pairwise Comparisons","year":2014,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Pairwise comparison; Mathematics; Calculus (dental); Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1393540215052028,"gpt":0.4196155115520413,"spread":0.2802614900468385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003463108,0.0001910771,0.0005025942,0.001017374,0.0002014194,0.0002724686,0.0008709554,0.00009562595,0.0008455443],"category_scores_gemma":[0.007363046,0.0001432388,0.0001775547,0.0008717532,0.00009847905,0.000600205,0.0001868206,0.00009473405,0.0005867881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000106317,"about_ca_system_score_gemma":0.00005705853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006564052,"about_ca_topic_score_gemma":0.000008803281,"domain_scores_codex":[0.9959168,0.0001318185,0.001897448,0.0002546047,0.001513781,0.0002855615],"domain_scores_gemma":[0.9934559,0.004162516,0.001064413,0.000889412,0.0002719081,0.0001558073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004674455,0.0006674924,0.04665196,0.0002556363,0.0001104951,6.786973e-7,0.008564514,0.00196515,0.0005515922,0.2374486,0.2647782,0.4385382],"study_design_scores_gemma":[0.005507991,0.001405865,0.05219604,0.0004202684,0.00007467344,0.000009385131,0.004827847,0.5159513,0.003985887,0.1008848,0.3138285,0.0009075127],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5095377,0.000009238911,0.4703796,0.0006525079,0.0007355964,0.000949805,0.00009928495,0.00007805626,0.01755823],"genre_scores_gemma":[0.9695258,8.989831e-7,0.02932705,0.0007509604,0.00003383046,0.00004991598,0.00002696137,0.00001334651,0.0002712147],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5139862,"threshold_uncertainty_score":0.9258117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1493458121","doi":"10.3233/fi-2009-0019","title":"Paradigms of Denotational Mathematics for Cognitive Informatics and Cognitive Computing","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Denotational semantics of the Actor model; Denotational semantics; Computer science; Cognition; Normalisation by evaluation; Cognitive computing; Cognitive science; Informatics; Algebra over a field; Theoretical computer science; Cognitive psychology; Psychology; Programming language; Mathematics; Semantics (computer science); Pure mathematics; Operational semantics","retraction":null,"screen_n_in":null,"score":{"opus":0.02039636708748247,"gpt":0.2827322265737545,"spread":0.262335859486272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004798645,0.0002088441,0.0003315129,0.0001622613,0.0002183012,0.0001914286,0.0002932222,0.00006786553,0.000005781489],"category_scores_gemma":[0.0002349964,0.0001981757,0.00008311873,0.0002850103,0.0001210356,0.0007070464,0.0001661251,0.0001394465,0.00001476287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002229895,"about_ca_system_score_gemma":0.00006955503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.495993e-7,"about_ca_topic_score_gemma":4.166521e-7,"domain_scores_codex":[0.9983515,0.00002323849,0.000832814,0.0001349352,0.0003114843,0.0003460605],"domain_scores_gemma":[0.9972539,0.001605795,0.0005020238,0.0001463681,0.000374084,0.0001178269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000067587,0.0003001376,0.0007009234,0.0004527197,0.0001908144,0.000001672631,0.03771236,0.0001789119,0.00002000406,0.1007372,0.0005317351,0.8591059],"study_design_scores_gemma":[0.002582379,0.0008210897,0.006703449,0.0009979839,0.00009293385,0.00006269432,0.004598484,0.9711574,0.0008916307,0.01143943,0.0002278172,0.0004246444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1598993,0.00007590298,0.8348328,0.00008625364,0.00008820849,0.000560455,0.00003169633,0.00008088823,0.004344498],"genre_scores_gemma":[0.8545311,0.00001060945,0.1443526,0.0009854325,0.00004231774,0.000009872851,0.00004321373,0.000005774146,0.0000190347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9709786,"threshold_uncertainty_score":0.8081372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1531714509","doi":"10.5555/1366071.1366089","title":"Nearness of Objects: Extension of Approximation Space Model","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Disjoint sets; Rough set; Extension (predicate logic); Relation (database); Mathematics; Space (punctuation); Focus (optics); Set (abstract data type); Feature (linguistics); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.02202444320491736,"gpt":0.2556086373883603,"spread":0.2335841941834429,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000632284,0.0001000539,0.0001953555,0.0001338668,0.00004889745,0.00003774435,0.0004263541,0.00005434396,0.000009528227],"category_scores_gemma":[0.00003903823,0.00008105531,0.00005650056,0.0003258755,0.00006359007,0.0008540694,0.0001970805,0.00007177715,0.00002009999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003111089,"about_ca_system_score_gemma":0.00004411707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001624622,"about_ca_topic_score_gemma":0.000001822855,"domain_scores_codex":[0.9987534,0.00001171641,0.0005511818,0.0001064007,0.0003646974,0.0002126246],"domain_scores_gemma":[0.99897,0.00006282988,0.0003209685,0.0004809332,0.0001040268,0.00006118572],"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.0001433483,0.0007025369,0.001438955,0.001356546,0.00008282477,0.000006124498,0.04745864,0.03071627,0.009447738,0.6867129,0.002072483,0.2198616],"study_design_scores_gemma":[0.0004188503,0.000147177,0.001808187,0.00006446792,0.00000685945,0.000007253631,0.0008143044,0.9785441,0.01154102,0.006258149,0.0002535423,0.0001361482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1027692,0.00002488689,0.8644661,0.00008845705,0.0001050916,0.0001994344,0.000003117484,0.00004488768,0.03229882],"genre_scores_gemma":[0.7810226,0.000008001644,0.2187792,0.0001420721,0.000008188077,0.000002273686,0.00000467054,0.000003156342,0.0000298356],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9478278,"threshold_uncertainty_score":0.330534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1808687169","doi":"10.3233/fi-2014-1045","title":"A Multifaceted Analysis of Probabilistic Three-way Decisions","year":2014,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Probabilistic logic; Computer science; Heuristic; Rough set; Set (abstract data type); Decision analysis; Dominance-based rough set approach; Decision theory; Decision rule; Optimal decision; Machine learning; Artificial intelligence; Decision tree; Mathematics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.02745331881619353,"gpt":0.2538505143509123,"spread":0.2263971955347187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000478252,0.0001435738,0.0003734226,0.0003675227,0.0001130961,0.0001505843,0.0009252573,0.00005469611,0.0001155007],"category_scores_gemma":[0.000321591,0.0001065479,0.0001798059,0.001481538,0.00008262201,0.0005169599,0.0003317845,0.00009102367,0.0001581403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003889707,"about_ca_system_score_gemma":0.0000282464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003851926,"about_ca_topic_score_gemma":0.00004544728,"domain_scores_codex":[0.9984665,0.00003863356,0.0006287876,0.0001821027,0.0004056514,0.00027832],"domain_scores_gemma":[0.9982004,0.0004143704,0.0002324488,0.000937561,0.00009086837,0.0001243954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003116291,0.0005546278,0.01369724,0.0001240429,0.001535842,0.00000287578,0.009319263,0.02394444,0.0001742855,0.386107,0.002412932,0.5620963],"study_design_scores_gemma":[0.0003203873,0.0001347003,0.03304117,0.00002059821,0.0001456184,0.000001548201,0.00006741845,0.9577866,0.00003787897,0.004734675,0.003553466,0.0001559577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1188045,0.00001325657,0.8628132,0.000253373,0.0001531679,0.0002901199,0.00001596489,0.0001133072,0.01754311],"genre_scores_gemma":[0.8869891,0.000003701763,0.112565,0.0003659124,0.00001021895,0.00001984129,0.00001915166,0.000003750271,0.00002339691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9338421,"threshold_uncertainty_score":0.4344898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127563728","doi":"","title":"Calculi of Approximation Spaces","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Context (archaeology); Approximation algorithm; Space (punctuation); Approximation theory; Calculus (dental); Computer science; Mathematical optimization; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01021672557051059,"gpt":0.214894098888062,"spread":0.2046773733175514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001512808,0.00008149177,0.0001217905,0.00007424654,0.00005875056,0.000135717,0.0003893926,0.00003256252,0.00003504432],"category_scores_gemma":[0.000008274887,0.00006383466,0.00004379007,0.0002179505,0.00004455012,0.0008385464,0.0001220478,0.0000455874,0.0001182335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002432921,"about_ca_system_score_gemma":0.00002111461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008374583,"about_ca_topic_score_gemma":0.000003622778,"domain_scores_codex":[0.9991601,0.00001203684,0.0003394909,0.00007994951,0.0002429123,0.0001655526],"domain_scores_gemma":[0.9994489,0.00002858685,0.0001556452,0.0003028794,0.00003235286,0.00003166476],"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.000007279072,0.0002021611,0.002665087,0.0002142499,0.00002398018,0.000002560821,0.003903587,0.0008243818,0.0003529306,0.9233332,0.01723098,0.05123959],"study_design_scores_gemma":[0.002380265,0.0006595096,0.05347639,0.0001446691,0.00003257528,0.00005671853,0.001209953,0.707377,0.01231937,0.08139241,0.1399231,0.001028102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09654742,0.00007429445,0.6783863,0.000924987,0.0002991054,0.0003395565,0.000008818181,0.0001795346,0.2232399],"genre_scores_gemma":[0.8784811,0.000003857498,0.1211132,0.0002228893,0.00003189989,0.00001008922,0.0000141941,0.000002734572,0.0001200916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8419408,"threshold_uncertainty_score":0.2603102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098103684","doi":"10.3233/fun-2006-712-305","title":"Complexity of Searching for a Black Hole","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Theoretical computer science; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04110850759150856,"gpt":0.2683393531769816,"spread":0.227230845585473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004795482,0.0001265959,0.0001899193,0.0001229932,0.0001076885,0.0001556936,0.0007972267,0.00002509406,0.00004969047],"category_scores_gemma":[0.0000126685,0.0001195363,0.00009704872,0.0002601914,0.0001570858,0.0006160355,0.0004120934,0.00007110414,0.0000945658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009818524,"about_ca_system_score_gemma":0.00004228064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008111809,"about_ca_topic_score_gemma":0.00001599348,"domain_scores_codex":[0.9985931,0.00002883161,0.0005117005,0.0001538765,0.0003513714,0.0003611395],"domain_scores_gemma":[0.9989862,0.0001131087,0.0002035425,0.0005801491,0.00005477844,0.00006214907],"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.00002333959,0.0001815872,0.0004529838,0.000608234,0.00005580292,0.000001980867,0.001147598,0.02726246,0.0001549691,0.8906105,0.05774087,0.02175971],"study_design_scores_gemma":[0.0009746838,0.0002000025,0.001587333,0.00006038488,0.00001208536,9.251847e-7,0.0001484062,0.9221851,0.001752977,0.01723376,0.05562979,0.0002145999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04774429,0.00001519378,0.928903,0.0005128399,0.0001400682,0.0009402679,0.00001994304,0.0001161251,0.02160826],"genre_scores_gemma":[0.8348953,0.00000267316,0.1638646,0.0006680789,0.00006345144,0.00008525488,0.00004123864,0.000008816412,0.0003706108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8949226,"threshold_uncertainty_score":0.487455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1546124752","doi":"","title":"The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Catenation; Star (game theory); Combined operations; State (computer science); Automaton; Computer science; Regular language; Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03127157510158429,"gpt":0.2525004377000977,"spread":0.2212288625985134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004492489,0.00008170673,0.0001836889,0.0000637494,0.0001495776,0.00003180852,0.0003930732,0.0000158024,0.00001299848],"category_scores_gemma":[0.00003964096,0.00005807372,0.00003224246,0.0001788106,0.0004478066,0.0007096348,0.000196279,0.00005525527,0.000003554623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002191779,"about_ca_system_score_gemma":0.00006913815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002239333,"about_ca_topic_score_gemma":0.00002667451,"domain_scores_codex":[0.9988824,0.00005212764,0.0005883736,0.00007171229,0.0002780157,0.0001274473],"domain_scores_gemma":[0.9990932,0.0001452292,0.0002382442,0.0003512658,0.0001341238,0.00003789667],"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.000172832,0.0004313369,0.003817347,0.0005623153,0.0002531187,0.000002957087,0.06031155,0.0009582615,0.012711,0.9075485,0.001987646,0.01124309],"study_design_scores_gemma":[0.004246203,0.001119229,0.04779093,0.0001984909,0.0000304578,0.00003200144,0.00313122,0.8376162,0.05613612,0.04844951,0.0008591126,0.0003905008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.985636,0.00006154774,0.0133954,0.0002265145,0.00006952976,0.0002346941,0.00004484908,0.0000219997,0.0003094931],"genre_scores_gemma":[0.9818788,0.00009427071,0.01786666,0.00009622404,0.000003345962,0.000005211058,0.00001238298,0.00000284803,0.00004029097],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.859099,"threshold_uncertainty_score":0.2368178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1499453370","doi":"10.5555/1227505.1227515","title":"Reinforcement Learning with Approximation Spaces","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Statistical and Computational Modeling","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Reinforcement learning; Computer science; Context (archaeology); Reinforcement; Testbed; Artificial intelligence; Set (abstract data type); Space (punctuation); Machine learning; Engineering; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01069958637320511,"gpt":0.2160029224423044,"spread":0.2053033360690993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001186792,0.0001089081,0.00009905733,0.00007482338,0.0001775659,0.000361797,0.0002409159,0.00002064318,0.00003971625],"category_scores_gemma":[0.0000113329,0.00008335957,0.00002197158,0.0002032559,0.00003044101,0.0009048261,0.00009586842,0.00009360667,0.0001770176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000498889,"about_ca_system_score_gemma":0.00003477076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004809687,"about_ca_topic_score_gemma":0.000002125806,"domain_scores_codex":[0.9989572,0.00001418133,0.0002914304,0.0001194924,0.0004052864,0.0002124234],"domain_scores_gemma":[0.9995446,0.00007899568,0.000113402,0.0001462104,0.00006693719,0.00004990974],"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.000008853525,0.00002447188,0.0003894252,0.00003663277,0.00001149997,0.000002119034,0.0007049811,0.3287224,0.00001601967,0.6585971,0.0004197365,0.01106674],"study_design_scores_gemma":[0.00032831,0.0001324511,0.00116893,0.00002799145,0.00000439618,0.00001228043,0.0001130791,0.9818024,0.0001453415,0.01337532,0.002743651,0.000145862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01157141,0.000008740927,0.9632296,0.0003490461,0.0000467169,0.0001387389,5.0039e-7,0.0001554888,0.02449979],"genre_scores_gemma":[0.8013678,8.346701e-7,0.1979209,0.0002561613,0.00003137602,0.00002410984,0.00002904472,0.000003821547,0.0003660047],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7897964,"threshold_uncertainty_score":0.3488817,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1851724702","doi":"","title":"State Complexity: Recent Results and Open Problems","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Open research; Theoretical computer science; Algorithm; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0496346177391194,"gpt":0.2940333217176931,"spread":0.2443987039785737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005465134,0.0001381347,0.0001788376,0.00007000443,0.000235081,0.001072616,0.0009904748,0.00002468537,0.00002476335],"category_scores_gemma":[0.00004737534,0.0001141647,0.0000190775,0.0002432407,0.00007823233,0.00135321,0.001163367,0.0001836199,0.0002030695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000646387,"about_ca_system_score_gemma":0.00007607306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002910932,"about_ca_topic_score_gemma":0.0000262158,"domain_scores_codex":[0.9987881,0.00003185542,0.0004219529,0.000204824,0.0002527517,0.000300525],"domain_scores_gemma":[0.9991613,0.00003458619,0.0001611016,0.0004446804,0.00004240852,0.0001559427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006912709,0.0003045177,0.0005008641,0.0002139094,0.00009598708,0.0000201027,0.03612648,0.004645227,0.00003940596,0.1629842,0.006620643,0.7883795],"study_design_scores_gemma":[0.008221929,0.0009534177,0.006313493,0.0002979528,0.00001049905,0.0001423325,0.000441357,0.1028723,0.0004089465,0.1074747,0.7720472,0.0008158509],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0756402,0.0002173797,0.632714,0.05790695,0.001259111,0.00313128,0.000129637,0.001109238,0.2278922],"genre_scores_gemma":[0.2858123,0.0004217979,0.7016532,0.008890871,0.0001023009,0.0001093074,0.0001313429,0.00003242212,0.002846498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7875637,"threshold_uncertainty_score":0.9999644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1874539085","doi":"10.3233/fi-2009-0023","title":"A Formal Syntax of Natural Languages and the Deductive Grammar","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cognitive Computing and Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Programming language; Syntax; Formal grammar; Linguistics; Affix grammar; Abstract syntax; Grammar; Abstract syntax tree; Natural language processing; Generative grammar; Artificial intelligence; Rule-based machine translation; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.004837685138154746,"gpt":0.2442605870385754,"spread":0.2394229019004206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003693127,0.00009850386,0.0001561953,0.00005230132,0.0001374885,0.0001144443,0.0003680211,0.00002388252,0.000004574192],"category_scores_gemma":[0.00005966342,0.00006115285,0.00005277857,0.0001772945,0.0001474458,0.0006224156,0.0002195968,0.0001451728,0.000008593924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001411059,"about_ca_system_score_gemma":0.0000187435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001062665,"about_ca_topic_score_gemma":0.000001662047,"domain_scores_codex":[0.9992354,0.00003975546,0.0002396907,0.00008833414,0.0001728917,0.0002239386],"domain_scores_gemma":[0.9993356,0.0002273655,0.0001222022,0.000217052,0.00005611176,0.00004169435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008572044,0.00003837747,0.0001501583,0.00002813015,0.0000493374,0.000002562162,0.01224476,0.00001979196,0.00003261184,0.1968651,0.001030503,0.789453],"study_design_scores_gemma":[0.012886,0.001552527,0.08160299,0.0007109123,0.0001504181,0.0006262808,0.01327248,0.8206567,0.005630537,0.05299626,0.008523943,0.001390921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6792971,0.001798982,0.278705,0.004779703,0.0005711459,0.0008493148,0.000006945716,0.0002481467,0.03374372],"genre_scores_gemma":[0.9923198,0.00002244067,0.006397405,0.001153783,0.0000409559,0.00000386888,0.000002238539,0.000001708508,0.00005778725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8206369,"threshold_uncertainty_score":0.2493741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1634497061","doi":"10.5555/2366376.2366398","title":"Approaches to Conflict Dynamics Based on Rough Sets","year":2007,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; University of Winnipeg","funders":"","keywords":"Negotiation; Scope (computer science); Conflict resolution; Computer science; Conflict analysis; Rough set; Set (abstract data type); Conflict management; Conflict resolution research; Operations research; Management science; Knowledge management; Risk analysis (engineering); Artificial intelligence; Mathematics; Engineering; Sociology; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.1109979900249538,"gpt":0.2673421789281553,"spread":0.1563441889032014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006750149,0.0002040903,0.0001931156,0.0001976888,0.0001622125,0.0003402906,0.0009101815,0.00007567579,0.00003933913],"category_scores_gemma":[0.00003176927,0.0001670302,0.00007335705,0.0004545445,0.00003970064,0.0005581118,0.0002251177,0.0001622154,0.0007463682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001972678,"about_ca_system_score_gemma":0.0000458147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000126305,"about_ca_topic_score_gemma":0.000007589099,"domain_scores_codex":[0.9983164,0.00001920365,0.0004454259,0.0002242335,0.0004722179,0.0005225137],"domain_scores_gemma":[0.9987161,0.0001457709,0.0001052246,0.0007538996,0.00002418391,0.0002548289],"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.00009752421,0.0004245657,0.002217534,0.0001247993,0.00004729834,0.0000368942,0.006952237,0.009018663,0.000004660637,0.5676674,0.01118361,0.4022248],"study_design_scores_gemma":[0.0005641361,0.0004728008,0.007164771,0.00003576089,0.000005113569,0.000009858358,0.000300682,0.9347502,0.0001229175,0.0006976916,0.05551329,0.0003627925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006993474,0.000005782245,0.7264317,0.002194719,0.0003438103,0.0004578949,0.00001545273,0.0002134017,0.2633437],"genre_scores_gemma":[0.7969553,0.000001301146,0.1878006,0.01497301,0.00004419488,0.00002420427,0.00004232314,0.00001156413,0.0001474424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9257315,"threshold_uncertainty_score":0.9593303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1596798185","doi":"10.3233/fi-2000-43123414","title":"An Application of Rough Set Methods in Control Design","year":2000,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Rough set; Set (abstract data type); Computer science; Control (management); Data mining; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03282598919826751,"gpt":0.3414536577833389,"spread":0.3086276685850714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009113431,0.0001071628,0.0002030366,0.00008783091,0.00004462699,0.00008985889,0.0007015443,0.00005380484,0.000119163],"category_scores_gemma":[0.00001136702,0.00009005457,0.00003511926,0.0003370584,0.0000395686,0.001148714,0.00003267287,0.0000851757,0.0001097973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004027935,"about_ca_system_score_gemma":0.0000323113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005796968,"about_ca_topic_score_gemma":0.000001950286,"domain_scores_codex":[0.9988014,0.0001618027,0.0004983586,0.0001378092,0.0001790756,0.0002215903],"domain_scores_gemma":[0.9990804,0.0001348048,0.0001184765,0.0005736423,0.0000231277,0.00006953297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003041976,0.0001271917,0.0006568247,0.00002839833,0.00001281605,9.808024e-7,0.004087063,0.01178236,0.0002721324,0.01387863,0.0002768887,0.9688463],"study_design_scores_gemma":[0.0007992778,0.0002465533,0.003749509,0.00001047766,0.00000489922,0.00000622452,0.0001040643,0.9801564,0.000561117,0.006073496,0.00814049,0.0001475232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00436182,0.00002228569,0.9862835,0.0001660457,0.00003596681,0.000414254,0.000005500286,0.00005808812,0.00865248],"genre_scores_gemma":[0.454117,0.000009431737,0.545077,0.0007152457,0.00001027452,0.00004913114,0.000006561764,0.000003173618,0.00001225536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9686988,"threshold_uncertainty_score":0.3672319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109787457","doi":"10.3233/fi-2009-0008","title":"Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Prefix; Computer science; Regular language; State (computer science); Theoretical computer science; Programming language; Arithmetic; Mathematics; Automaton; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02818208505514126,"gpt":0.2811274377430031,"spread":0.2529453526878619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980712,0.0001314561,0.0002133987,0.00009159611,0.0001336529,0.0001689307,0.000989921,0.00003043162,0.00003913009],"category_scores_gemma":[0.00008517945,0.0001139091,0.00007766076,0.0001537086,0.0001051404,0.0008229652,0.0001729615,0.00005874732,0.00002665941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003267955,"about_ca_system_score_gemma":0.00005255685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008405586,"about_ca_topic_score_gemma":0.00000618307,"domain_scores_codex":[0.9989097,0.0000246283,0.0004584875,0.0001362935,0.0002207922,0.0002501615],"domain_scores_gemma":[0.998798,0.00009415905,0.000116216,0.0008507189,0.00006572893,0.00007522966],"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.00003475525,0.0002726824,0.00006462984,0.0002604882,0.00005773559,0.000004136144,0.008692528,0.0003885331,0.003382192,0.9101135,0.007599236,0.06912958],"study_design_scores_gemma":[0.003727711,0.001931881,0.009297051,0.0002635829,0.000055951,0.00005845057,0.001675171,0.6812302,0.03065414,0.2614016,0.008819663,0.0008845738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.261778,0.00006835662,0.7284241,0.001720133,0.0002017676,0.0008937324,0.0002751848,0.0002739495,0.006364768],"genre_scores_gemma":[0.8680195,0.000004728909,0.130161,0.001399384,0.00002754708,0.00003136407,0.00004537237,0.000006000887,0.0003051525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6808417,"threshold_uncertainty_score":0.4645078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135119492","doi":"","title":"Rough sets and infomorphisms: towards approximation of relations in distributed environments","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Rough set; Set (abstract data type); Information system; Computer science; Mathematics; Theoretical computer science; Algebra over a field; Discrete mathematics; Data mining; Pure mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02374613452979048,"gpt":0.2173961277440722,"spread":0.1936499932142817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001634064,0.0001061559,0.0001553474,0.0001074292,0.00006251398,0.00007766395,0.0002639597,0.00005657419,0.00009652143],"category_scores_gemma":[0.00003171814,0.00009478338,0.00002561511,0.0002738159,0.00006788813,0.001275655,0.0001893228,0.00009501017,0.00008814876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007039656,"about_ca_system_score_gemma":0.000008694345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001882565,"about_ca_topic_score_gemma":0.000001719769,"domain_scores_codex":[0.9989624,0.00002428155,0.0004746883,0.0001126882,0.0002421362,0.0001838057],"domain_scores_gemma":[0.9994377,0.00003849062,0.0001636371,0.0002915211,0.000009074782,0.00005950812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003777862,0.001739584,0.05843928,0.0005556449,0.000185492,0.00003328173,0.07741479,0.007607352,0.0002615513,0.1684441,0.01704493,0.6682363],"study_design_scores_gemma":[0.001428098,0.0001937793,0.1058074,0.00006881529,0.00001082313,0.00002547338,0.0003641603,0.8709123,0.0001642561,0.004978803,0.01574411,0.000301947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4351327,0.0003078038,0.510561,0.00354322,0.0002872135,0.001288612,0.0001632136,0.0001461893,0.04857004],"genre_scores_gemma":[0.9668088,0.00006279815,0.03276391,0.0002409932,0.000004606056,0.00002176536,0.00004851853,0.000003183404,0.00004542424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.863305,"threshold_uncertainty_score":0.3865154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1488252274","doi":"10.3233/fun-2004-59402","title":"Leader Election in Rings with Nonunique Labels","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.006780213110684829,"gpt":0.2129740249290568,"spread":0.206193811818372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001806002,0.0001214073,0.0001483724,0.0001046686,0.00007215319,0.0002131712,0.0003663403,0.0000480495,0.00001063549],"category_scores_gemma":[0.000007270281,0.00009776781,0.00002886375,0.0005153503,0.00003137597,0.001519749,0.00006031019,0.0001517827,0.0001847412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001802387,"about_ca_system_score_gemma":0.00008023649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001767527,"about_ca_topic_score_gemma":0.00009519568,"domain_scores_codex":[0.9990012,0.0000122032,0.0003155746,0.0001388268,0.0002373812,0.0002948052],"domain_scores_gemma":[0.9994774,0.00001297637,0.00009635968,0.000304033,0.00004103591,0.00006815013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001298752,0.001378823,0.01707491,0.0007803857,0.0001989972,0.0001481427,0.04920606,0.01620017,0.001637942,0.8436782,0.00483481,0.06473172],"study_design_scores_gemma":[0.04859844,0.005646357,0.1456201,0.005717262,0.00006848077,0.002032781,0.009230351,0.1325173,0.06011264,0.02610204,0.557775,0.006579251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2151507,0.00003208334,0.762154,0.001441701,0.0001870222,0.0004553827,0.00000583165,0.0002144921,0.02035879],"genre_scores_gemma":[0.9849878,0.000003920359,0.01391296,0.0008479269,0.00001780507,0.00004779543,0.000006674371,0.000005300089,0.0001698433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8175761,"threshold_uncertainty_score":0.3986855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1484840002","doi":"","title":"Membrane systems with coupled transport: universality and normal forms","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Universality (dynamical systems); Membrane; Membrane computing; Turing; Symporter; Molecule; Antiporter; Turing machine; Membrane transport; Computation; Chemistry; Computer science; Theoretical computer science; Physics; Algorithm; Quantum mechanics; Biochemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.0116261369136358,"gpt":0.1937117161132927,"spread":0.182085579199657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120299,0.0001344654,0.0001448731,0.00002113385,0.0001065272,0.0000384617,0.0001113317,0.00008518752,0.00007145782],"category_scores_gemma":[0.000006462093,0.00008874739,0.00003322084,0.00006073543,0.0001040187,0.00001722974,0.00004767944,0.00007065538,0.00001574676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001032198,"about_ca_system_score_gemma":0.000008025393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001884703,"about_ca_topic_score_gemma":0.000008189538,"domain_scores_codex":[0.9992824,0.00001339678,0.0002220238,0.0001348019,0.0001139407,0.0002334034],"domain_scores_gemma":[0.9996223,0.000009520144,0.00007798362,0.0001614563,0.00002890879,0.00009987064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.005487174,0.002792829,0.4930348,0.007165361,0.004117574,0.0002935428,0.01249301,0.007662293,0.328791,0.02466301,0.01004285,0.1034565],"study_design_scores_gemma":[0.02134603,0.01350077,0.07665423,0.0005748845,0.0004897682,0.001187216,0.01300112,0.1844564,0.04192637,0.00007152424,0.6421242,0.00466746],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9857865,0.0001383493,0.001419593,0.00006173769,0.00004452348,0.0002113441,0.00001644638,0.00002491883,0.01229658],"genre_scores_gemma":[0.9987836,0.000091371,0.0002949686,0.0002597851,0.00004181663,0.000006207826,0.00008833317,0.000006027863,0.0004278463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6320814,"threshold_uncertainty_score":0.3619013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1800174300","doi":"10.3233/fun-2006-70405","title":"Indexing Schemes for Similarity Search: an Illustrated Paradigm","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Search engine indexing; Computer science; Nearest neighbor search; Similarity (geometry); Information retrieval; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04322817500190237,"gpt":0.27945411912867,"spread":0.2362259441267676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000525703,0.0001629364,0.000157213,0.000142816,0.0002650973,0.0009783991,0.001040945,0.00005127487,0.00005129286],"category_scores_gemma":[0.00001393194,0.0001511034,0.00005531637,0.0003279709,0.00006346872,0.004528009,0.0003280863,0.0001161438,0.00008536272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004217243,"about_ca_system_score_gemma":0.00005095407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005442416,"about_ca_topic_score_gemma":0.00001527353,"domain_scores_codex":[0.9985173,0.00002205453,0.0003923773,0.0002191571,0.0003326782,0.0005164291],"domain_scores_gemma":[0.9990982,0.00005273693,0.00009389729,0.0005965217,0.00004482315,0.0001138452],"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.00001519513,0.0002288102,0.001103734,0.0001638333,0.0000491931,0.000005531939,0.0006829863,0.0003193167,0.00004908087,0.9107477,0.01534495,0.07128964],"study_design_scores_gemma":[0.001099069,0.0002146332,0.001882675,0.00002767479,0.00001292345,0.00000489505,0.0002819437,0.6223895,0.001136223,0.01031714,0.3622212,0.0004121295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01992304,0.0000153929,0.9638697,0.0008675503,0.0002477894,0.0006651546,0.00006504401,0.0003689071,0.01397744],"genre_scores_gemma":[0.6250567,0.000008557012,0.3697688,0.002115723,0.0003198433,0.0001279477,0.001139266,0.00002561059,0.001437563],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9004306,"threshold_uncertainty_score":0.9434724,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1952406403","doi":"10.5555/2371116.2371126","title":"Towards an Ontology of Approximate Reason","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Assertion; Ontology; Context (archaeology); Object (grammar); Computer science; A priori and a posteriori; Mathematics; Epistemology; Artificial intelligence; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.03307718618616286,"gpt":0.2549486071848239,"spread":0.2218714209986611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002784424,0.0001577965,0.000271248,0.0001119796,0.00009514408,0.000114793,0.0009800225,0.00008406168,0.000454315],"category_scores_gemma":[0.00005737553,0.0001290929,0.00007360546,0.0002522731,0.0001015436,0.001314616,0.0002650225,0.000115091,0.0003768556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005328739,"about_ca_system_score_gemma":0.00002902621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003677226,"about_ca_topic_score_gemma":0.00001203214,"domain_scores_codex":[0.9987,0.0000483158,0.0004476106,0.0001754382,0.000263132,0.0003655476],"domain_scores_gemma":[0.9988312,0.00003910033,0.0002049138,0.0006943866,0.00007510668,0.0001553617],"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.00001263753,0.0005062484,0.002266546,0.0002087884,0.00006035887,0.000009136968,0.02902073,0.00001559925,0.0001222876,0.6771304,0.007734655,0.2829126],"study_design_scores_gemma":[0.002859999,0.002150778,0.009832297,0.0001354715,0.00004966612,0.0002821399,0.001584439,0.8337727,0.006275035,0.02147164,0.1204462,0.00113956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09536953,0.000370813,0.1944543,0.000593045,0.0007829227,0.0004611009,0.00001142727,0.0004278042,0.7075291],"genre_scores_gemma":[0.9528385,0.00004697719,0.04588951,0.000497568,0.00004881477,0.00002258008,0.000008510716,0.00000766111,0.0006398616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.857469,"threshold_uncertainty_score":0.5264255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1559666492","doi":"10.3233/fi-2013-895","title":"Duality in Rough Set Theory Based on the Square of Opposition","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Opposition (politics); Mathematics; Square (algebra); Combinatorics; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Political science; Politics","retraction":null,"screen_n_in":null,"score":{"opus":0.02803641882716702,"gpt":0.2443629797502223,"spread":0.2163265609230553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006964707,0.0001043725,0.0001306823,0.00007349707,0.00007480699,0.0001542815,0.0005856852,0.00004149519,0.0003447448],"category_scores_gemma":[0.00004624333,0.00006265267,0.00005165837,0.000257748,0.00006265369,0.0007375617,0.0001252244,0.0001197584,0.0002759133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004811264,"about_ca_system_score_gemma":0.0000316823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006449465,"about_ca_topic_score_gemma":0.000002340073,"domain_scores_codex":[0.9988921,0.0001391565,0.0003803342,0.0001005147,0.0002884041,0.0001995398],"domain_scores_gemma":[0.9989123,0.0003050206,0.0001339893,0.0005702912,0.0000362172,0.00004220262],"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.00003940917,0.0003545475,0.00320599,0.0001978878,0.00002422358,0.000003033166,0.0116953,0.002429462,0.00005733161,0.9150577,0.01275455,0.05418056],"study_design_scores_gemma":[0.001300434,0.0007034009,0.07862516,0.0002263163,0.000008773843,0.00000558959,0.002355866,0.8088416,0.001076312,0.1021493,0.004273542,0.0004336606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5773094,0.0000283615,0.1814404,0.01617577,0.000437777,0.002420205,0.00006325977,0.0001992381,0.2219256],"genre_scores_gemma":[0.9902735,0.000001804754,0.004909373,0.004702824,0.00001014215,0.00006146237,0.00001532202,0.000002885177,0.00002270214],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8129084,"threshold_uncertainty_score":0.3774714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1497606539","doi":"10.3233/fi-2015-1184","title":"Fast Convergence of Distance-based Inconsistency in Pairwise Comparisons","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Pairwise comparison; Convergence (economics); Mathematics; Algorithm; Computer science; Statistics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.3388397757513775,"gpt":0.4350465838041886,"spread":0.09620680805281112,"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.003804125,0.0002232929,0.0006354733,0.0006354201,0.00007116909,0.0002475912,0.001240067,0.00008576146,0.001189834],"category_scores_gemma":[0.003821288,0.0001758362,0.0001338342,0.001317715,0.0003081326,0.001004935,0.0003255983,0.0001917898,0.001058984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001827321,"about_ca_system_score_gemma":0.0003561307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009550637,"about_ca_topic_score_gemma":0.0002041825,"domain_scores_codex":[0.9944174,0.0002261593,0.002417697,0.0002975751,0.002244997,0.0003961644],"domain_scores_gemma":[0.9959885,0.001375686,0.000772172,0.001069992,0.0004827729,0.0003108728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005428549,0.0006247649,0.8558449,0.00009052348,0.00002796758,0.00002683738,0.0122069,0.005244776,0.0001945473,0.007441715,0.07907032,0.03868388],"study_design_scores_gemma":[0.007888927,0.0004709974,0.1085776,0.0005561812,0.00002846165,0.00001691799,0.04296709,0.6254588,0.001484759,0.01276144,0.1987888,0.0009999422],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.771664,0.0001338684,0.1971852,0.0008156474,0.001465088,0.0008293171,0.0001887396,0.00008242892,0.02763574],"genre_scores_gemma":[0.9789959,0.00000174433,0.02027744,0.0004776242,0.00001712541,0.00002508434,0.00001158938,0.0000096997,0.0001838496],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7472672,"threshold_uncertainty_score":0.9997232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405644932","doi":"10.3233/fun-2006-712-310","title":"Reinforcement Learning with Approximation Spaces","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Artificial intelligence; Mathematics; Psychology; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.008276264063803971,"gpt":0.2087067039831487,"spread":0.2004304399193447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009789869,0.0001011742,0.00008630443,0.00005278411,0.0002156684,0.0003755696,0.000298026,0.00002127461,0.00003276028],"category_scores_gemma":[0.000002242903,0.00007594528,0.00002320884,0.000273914,0.00003056936,0.0009862207,0.00009911841,0.00009861193,0.0001621458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003638777,"about_ca_system_score_gemma":0.00001763272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003599498,"about_ca_topic_score_gemma":0.000005243744,"domain_scores_codex":[0.9991802,0.000009662685,0.0002421808,0.0001092592,0.0002461458,0.0002125537],"domain_scores_gemma":[0.9994957,0.00002853606,0.000139408,0.0002597607,0.00003233471,0.00004428566],"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.0000109417,0.00007663742,0.00198246,0.00006950934,0.000024213,0.000002335555,0.001440609,0.1945301,0.0002692868,0.7649245,0.01043786,0.02623154],"study_design_scores_gemma":[0.0005785234,0.0002201944,0.002359518,0.00004682375,0.000009060373,0.00002241311,0.0002158553,0.8652281,0.001551619,0.002488938,0.1269645,0.000314487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02702228,0.00001185375,0.9261186,0.0009601215,0.00004073188,0.0002989869,3.407889e-7,0.0002285951,0.04531856],"genre_scores_gemma":[0.9612536,0.000004193728,0.03698462,0.000320762,0.00004974787,0.00007265987,0.00002744547,0.000004859728,0.001282101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9342313,"threshold_uncertainty_score":0.3621626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1762037976","doi":"10.3233/fi-2009-126","title":"Pairwise Comparisons Based Non-Numerical Ranking","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise comparison; Ranking (information retrieval); Computer science; Mathematics; Data mining; Statistics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1813216940829353,"gpt":0.4377018973775182,"spread":0.2563802032945829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003257727,0.0003338822,0.0006776073,0.000652892,0.0004196588,0.001406313,0.001615245,0.0001221742,0.004560727],"category_scores_gemma":[0.002128198,0.0002529701,0.0002913431,0.001253056,0.0001100475,0.001353179,0.0002286038,0.0003369949,0.005728303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001367196,"about_ca_system_score_gemma":0.0001255815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001033467,"about_ca_topic_score_gemma":0.000002521802,"domain_scores_codex":[0.9937717,0.0001778643,0.002049954,0.0004331213,0.002890684,0.0006766219],"domain_scores_gemma":[0.9956359,0.001793314,0.000580396,0.001353662,0.0002630831,0.0003735914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000424852,0.0006807661,0.02098455,0.00002648781,0.00004632775,0.00005113928,0.004399928,0.005594976,0.0009990413,0.002826408,0.4342,0.5297655],"study_design_scores_gemma":[0.002167078,0.0002574176,0.050631,0.00009785956,0.00002095535,0.00001922805,0.001325122,0.6790147,0.0004573438,0.002896068,0.262592,0.0005211749],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1231293,0.00003789574,0.8245091,0.00382271,0.001059765,0.000790576,0.0000429744,0.0002699097,0.0463377],"genre_scores_gemma":[0.9248821,9.761739e-7,0.06679486,0.007847934,0.00009231184,0.00001502239,0.00001610653,0.00001309695,0.0003375956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8017527,"threshold_uncertainty_score":0.9999923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562193608","doi":"10.3233/fun-2006-71405","title":"A Formal Language Analysis of DNA Hairpin Structures","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Formal language; Computer science; Programming language; Computational biology; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.006143947400711379,"gpt":0.2426447297500487,"spread":0.2365007823493373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116196,0.0001028492,0.00017842,0.000086731,0.00005282871,0.00002402595,0.0001618576,0.00007810565,0.0001023534],"category_scores_gemma":[0.00002150943,0.00007614493,0.0001542045,0.0002131825,0.00006163119,0.000008389458,0.0001375849,0.00004344357,0.000005912719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007684574,"about_ca_system_score_gemma":0.00001293401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005879279,"about_ca_topic_score_gemma":0.00004013759,"domain_scores_codex":[0.9992377,0.0000163865,0.0003261961,0.00009879408,0.0001106584,0.0002103308],"domain_scores_gemma":[0.9995989,0.00001084587,0.0001314787,0.0001990071,0.00002644397,0.00003338849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002617014,0.0002035634,0.07838067,0.0001489007,0.001649458,0.000004668207,0.0006433186,0.002687386,0.8823339,0.007129843,0.004533539,0.02202302],"study_design_scores_gemma":[0.001685904,0.001082468,0.4136734,0.00002672869,0.0007891424,0.00001529651,0.00201847,0.008534556,0.5349525,0.0005095715,0.03588553,0.000826507],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9882411,0.00008671354,0.002296727,0.00001674296,0.00003860639,0.00008095083,0.00004372548,0.00001294407,0.009182481],"genre_scores_gemma":[0.9974275,0.000003214967,0.001526996,0.0002281592,0.00006591959,0.000003268281,0.0005570884,0.000003567034,0.000184313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3473815,"threshold_uncertainty_score":0.31051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1542422837","doi":"10.3233/fi-2011-536","title":"Minimum Unique Substrings and Maximum Repeats","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; Western University","funders":"","keywords":"Substring; Computer science; Mathematics; Programming language; Data structure","retraction":null,"screen_n_in":null,"score":{"opus":0.02942245181713476,"gpt":0.2242724471165491,"spread":0.1948499952994143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002002262,0.0001317982,0.000133403,0.0000876097,0.0001321948,0.0001756646,0.0005881523,0.00005179878,0.0001058911],"category_scores_gemma":[0.00001169577,0.0001082671,0.0000280988,0.0001447754,0.00005863389,0.001828538,0.0006947026,0.0001090195,0.0001705876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002251261,"about_ca_system_score_gemma":0.00002692963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003546882,"about_ca_topic_score_gemma":0.00000127521,"domain_scores_codex":[0.9990521,0.0000170534,0.000307567,0.0001750422,0.0001929462,0.0002552734],"domain_scores_gemma":[0.9991,0.00003151542,0.0001085196,0.0005764837,0.00003234599,0.0001511616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008987086,0.0004216173,0.01497971,0.0003691515,0.0001184699,0.0001139808,0.05177537,0.000003040607,0.0008404548,0.297991,0.03634293,0.5969544],"study_design_scores_gemma":[0.007036255,0.002344778,0.1497464,0.0008699483,0.00009005928,0.00109403,0.004167387,0.2033428,0.04267928,0.127982,0.4567623,0.003884856],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2867459,0.0001756447,0.6337175,0.0003584358,0.0006558463,0.0005397563,0.00002321708,0.0005142406,0.07726941],"genre_scores_gemma":[0.6590199,0.00009482821,0.3387782,0.001566576,0.00004708303,0.00003326493,0.00002333303,0.00001373956,0.0004230359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5930696,"threshold_uncertainty_score":0.4415004,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1724114674","doi":"10.5555/1226781.1226792","title":"On Fuzzy Reasoning Using Matrix Representation of Extended Fuzzy Petri Nets","year":2003,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Petri net; Computer science; Fuzzy logic; Representation (politics); Knowledge representation and reasoning; Theoretical computer science; Matrix representation; Fuzzy set operations; MATLAB; Neuro-fuzzy; Artificial intelligence; Programming language; Algebra over a field; Fuzzy set; Mathematics; Fuzzy control system","retraction":null,"screen_n_in":null,"score":{"opus":0.03820724143386406,"gpt":0.3166172499363737,"spread":0.2784100085025096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008408148,0.0002367706,0.000375017,0.0004290323,0.0001947781,0.0002546062,0.0007402176,0.00009365704,0.00003970593],"category_scores_gemma":[0.000440538,0.0002306744,0.0001221017,0.001082963,0.00005298936,0.001602097,0.0002036758,0.0001914054,0.0001160473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000243517,"about_ca_system_score_gemma":0.0001356933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003584394,"about_ca_topic_score_gemma":0.000001134626,"domain_scores_codex":[0.9972034,0.0001596169,0.001026108,0.0003073086,0.0008463335,0.0004572259],"domain_scores_gemma":[0.9977902,0.000269877,0.0006026176,0.00106087,0.0001375062,0.0001389162],"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.00008449722,0.0003435441,0.002388464,0.0004652799,0.0002004668,0.0000326256,0.01699044,0.07949197,0.003820347,0.875148,0.002021166,0.01901323],"study_design_scores_gemma":[0.003195577,0.0005339936,0.0009770645,0.001124382,0.00006077093,0.0003858955,0.002416544,0.9456124,0.02087332,0.02006464,0.003635187,0.001120283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4629759,0.0001455396,0.4524672,0.00006924602,0.001110652,0.00059209,0.000008416609,0.0002219431,0.08240902],"genre_scores_gemma":[0.8347075,0.000009350517,0.1649041,0.000188741,0.00002449103,0.00001234739,0.000005401094,0.00001412625,0.0001339146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8661204,"threshold_uncertainty_score":0.940663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1548747954","doi":"10.3233/fun-2005-67402","title":"Tabular Expressions and Their Relational Semantics","year":2005,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Semantics (computer science); Computer science; Programming language; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02463984822771006,"gpt":0.2386764449150869,"spread":0.2140365966873768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813876,0.000110635,0.0001170771,0.00006180076,0.000197206,0.0002167968,0.0002947459,0.00005152619,0.00005396348],"category_scores_gemma":[0.00002933803,0.00007790409,0.00003463033,0.0001124839,0.00004857796,0.001046313,0.0002397204,0.00009748134,0.0002664327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003727726,"about_ca_system_score_gemma":0.00003565168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004989333,"about_ca_topic_score_gemma":0.000003763462,"domain_scores_codex":[0.9991367,0.00002064183,0.0002855086,0.0001142132,0.0002334421,0.0002094491],"domain_scores_gemma":[0.999376,0.00006466388,0.00009888909,0.0003114671,0.0000471093,0.0001018617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001968711,0.00005385701,0.001770953,0.00004137574,0.00002890585,0.000001201762,0.00853741,0.00006589603,0.0001061822,0.9349294,0.005659759,0.04880306],"study_design_scores_gemma":[0.0004393907,0.00006756771,0.001305656,0.00001384727,0.000004970226,0.00004148934,0.0007415172,0.07727617,0.0005536609,0.009817199,0.9095099,0.000228654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01434746,0.0002547599,0.9547266,0.001722444,0.0002958195,0.0003023972,0.000002846486,0.0002187272,0.02812894],"genre_scores_gemma":[0.9729052,0.00001544344,0.02587605,0.0005882421,0.00008801746,0.00001627235,0.000007059225,0.00000429224,0.000499427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9585577,"threshold_uncertainty_score":0.3424542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169200909","doi":"10.3233/fi-2011-390","title":"K-Comma Codes and Their Generalizations","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03360137299899364,"gpt":0.2060011669753833,"spread":0.1723997939763897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001753328,0.00009300535,0.00009055729,0.00009462576,0.000183026,0.000138472,0.0003996722,0.00002485816,0.0001079169],"category_scores_gemma":[0.000007965215,0.00007160861,0.00003663472,0.0002077005,0.000076442,0.0007452458,0.0002254338,0.00005183042,0.00004953882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006886849,"about_ca_system_score_gemma":0.00001117203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009064336,"about_ca_topic_score_gemma":0.00000340013,"domain_scores_codex":[0.9994857,0.00002609487,0.0001775178,0.00008671424,0.00006740112,0.0001565558],"domain_scores_gemma":[0.9994785,0.00003856119,0.00005178126,0.0003337165,0.00002164469,0.00007580306],"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.000003015291,0.00003005396,0.001880886,0.00001359393,0.00002328508,4.605435e-7,0.01452075,0.000001526294,0.00005127444,0.9609292,0.0008015827,0.02174444],"study_design_scores_gemma":[0.001791689,0.0008088769,0.03256312,0.0001443685,0.000043029,0.000176104,0.005773008,0.07993834,0.01473541,0.674983,0.1875568,0.001486271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1107949,0.00007504017,0.8180546,0.0001840526,0.0001928292,0.0001527177,0.000009402088,0.0002598554,0.07027654],"genre_scores_gemma":[0.9629142,0.0000229102,0.03583268,0.001135738,0.00001411443,0.0000157107,0.000004513311,0.000003688197,0.00005648899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8521192,"threshold_uncertainty_score":0.2920114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1572529124","doi":"10.3233/fi-2011-533","title":"Transition Complexity of Incomplete DFAs","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Transition (genetics); Computer science; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.08387304573960493,"gpt":0.235713823735115,"spread":0.15184077799551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026828,0.0001071413,0.0001757575,0.00009520011,0.00007298167,0.00004121562,0.0006648705,0.00003362181,0.0003560319],"category_scores_gemma":[0.000007189779,0.00009434686,0.00007067362,0.0001976256,0.000173231,0.001055051,0.0001544805,0.00007249408,0.00018432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002369947,"about_ca_system_score_gemma":0.00002259306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004832643,"about_ca_topic_score_gemma":0.000002721139,"domain_scores_codex":[0.9990312,0.00003187096,0.0004166717,0.0001018337,0.0002182556,0.0002001747],"domain_scores_gemma":[0.9992481,0.0000313745,0.0001495358,0.000461547,0.00003788898,0.00007152784],"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.00001718173,0.0001368491,0.0001624295,0.0001158488,0.00003498853,0.000002572379,0.02143325,0.000004336946,0.0007330709,0.9614336,0.0006122714,0.01531359],"study_design_scores_gemma":[0.003118725,0.001240575,0.04878751,0.0003326486,0.00005616285,0.0001483073,0.004198181,0.3269005,0.05960467,0.5462902,0.008063998,0.001258492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2269834,0.00001941224,0.7168291,0.0002910085,0.0002630449,0.0002568243,0.00002722956,0.0002535706,0.05507641],"genre_scores_gemma":[0.9279596,0.000002848534,0.07128171,0.000708993,0.00001176497,0.000007354517,0.000009769099,0.000003906473,0.00001405611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7009762,"threshold_uncertainty_score":0.3898299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1529665683","doi":"","title":"Sensor, Filter, and Fusion Models with Rough Petri Nets","year":2001,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Petri net; Context (archaeology); Rough set; Relevance (law); Sensor fusion; Filter (signal processing); Process architecture; Stochastic Petri net; Computer science; Fusion rules; Wireless sensor network; Theoretical computer science; Artificial intelligence; Algorithm; Data mining; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.03795754249442898,"gpt":0.2407896860156395,"spread":0.2028321435212106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003190434,0.000224529,0.0002454006,0.0001876857,0.0002153822,0.0004826458,0.000603644,0.00006793391,0.00003037388],"category_scores_gemma":[0.00001462654,0.0001767422,0.00003469118,0.0004795802,0.00005572482,0.002864208,0.0004613161,0.0001556981,0.000107819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008594075,"about_ca_system_score_gemma":0.00004802157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003978712,"about_ca_topic_score_gemma":0.000005749607,"domain_scores_codex":[0.9982305,0.0000366517,0.0004737959,0.0002671481,0.0005507552,0.0004411504],"domain_scores_gemma":[0.9987732,0.00009133188,0.0001711312,0.0007100866,0.0000750619,0.0001792153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005274991,0.0007575084,0.01444974,0.001159481,0.0005066221,0.0006155114,0.1256261,0.1788413,0.0008490559,0.1562166,0.01901379,0.5014367],"study_design_scores_gemma":[0.0009154625,0.0001781303,0.0001969352,0.0001463988,0.000007946913,0.0005686867,0.0002992575,0.970592,0.00008027349,0.0008114141,0.02589046,0.0003130523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2202207,0.0001536779,0.7470119,0.0005561155,0.0002235432,0.0003331067,0.000004867087,0.0002566577,0.03123946],"genre_scores_gemma":[0.8520858,0.0001434317,0.1455874,0.001403587,0.00004993636,0.000025316,0.000007824065,0.00001520108,0.0006815672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7917507,"threshold_uncertainty_score":0.7207336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1682128552","doi":"10.3233/fi-2000-42101","title":"A Proof System for Dependencies for Information Relations","year":2000,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science; Dependency theory (database theory); Theoretical computer science; Data mining; Functional dependency; Relational database","retraction":null,"screen_n_in":null,"score":{"opus":0.01231327066235364,"gpt":0.2367225078909976,"spread":0.2244092372286439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003136983,0.0001376295,0.0001746949,0.000104413,0.0003937137,0.0002039198,0.0003096345,0.00005211059,0.00003647031],"category_scores_gemma":[0.00005740468,0.0001187375,0.00008488946,0.0001821105,0.0000290948,0.006861811,0.00005779695,0.00004429308,0.0002073322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001217468,"about_ca_system_score_gemma":0.00008506666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009889062,"about_ca_topic_score_gemma":0.000007521784,"domain_scores_codex":[0.9987558,0.00001105241,0.0006123981,0.0001091438,0.0002177525,0.0002938108],"domain_scores_gemma":[0.9990391,0.0001362024,0.0001817728,0.0004311652,0.0001326386,0.0000791622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004090384,0.00002036171,0.00003518824,0.0007433087,0.0000328136,1.817934e-7,0.00418345,0.000862414,0.00001372597,0.8834784,0.01050193,0.1000873],"study_design_scores_gemma":[0.0007845751,0.0001423366,0.00004631603,0.00009553077,0.000009991347,0.00002179631,0.001193464,0.09427769,0.0005814616,0.0005644669,0.9020877,0.0001946506],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001098017,0.00002102969,0.9834355,0.0002264841,0.00024874,0.001690428,0.0003083844,0.0002342774,0.01273722],"genre_scores_gemma":[0.1431698,0.000005663849,0.8501955,0.0006817762,0.0001219528,0.002757892,0.0005672713,0.00001530414,0.002484802],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8915858,"threshold_uncertainty_score":0.4974647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1725028495","doi":"10.3233/fi-2012-652","title":"Correlating Fuzzy and Rough Clustering","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cluster analysis; Fuzzy clustering; Data mining; Fuzzy logic; Popularity; Computer science; Soft computing; Artificial intelligence; Mathematics; Pattern recognition (psychology); Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.0219366625496707,"gpt":0.2398409912662674,"spread":0.2179043287165967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003067172,0.0001216495,0.0001285457,0.00005548394,0.0001910691,0.0002802596,0.0003062777,0.00004433393,0.00002841372],"category_scores_gemma":[0.00002479757,0.00009998604,0.0000289496,0.00014535,0.00003587223,0.002442525,0.0005169472,0.0001188348,0.0002456626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000355509,"about_ca_system_score_gemma":0.00001065452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001179167,"about_ca_topic_score_gemma":9.246693e-7,"domain_scores_codex":[0.9989994,0.00001758875,0.0002916867,0.00009536568,0.0001870269,0.0004090024],"domain_scores_gemma":[0.9993675,0.0000677881,0.00009808577,0.0002953184,0.00001310756,0.0001581787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001146336,0.0001411593,0.05383182,0.0002531571,0.0000699071,0.00000546919,0.04952469,0.0003339097,0.00005840759,0.213683,0.005977498,0.6761096],"study_design_scores_gemma":[0.001928372,0.000380708,0.07832482,0.0001949769,0.00003576443,0.0004893795,0.002950908,0.7308579,0.0001397923,0.006086755,0.1772619,0.001348738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1368441,0.000716873,0.4837621,0.0009864629,0.001986519,0.0005112808,0.000005551613,0.0004913182,0.3746957],"genre_scores_gemma":[0.887077,0.00002188128,0.111447,0.001268117,0.00008755543,0.00001052161,0.000003050517,0.000005220671,0.00007968049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7502329,"threshold_uncertainty_score":0.4077313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2559976948","doi":"10.3233/fi-2017-1500","title":"Non-differentiable Solutions for Local Fractional Nonlinear Riccati Differential Equations","year":2017,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Nonlinear Differential Equations Analysis","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Nonlinear system; Riccati equation; Constant coefficients; Linear differential equation; Differential equation; Constant (computer programming); Ordinary differential equation; Differential (mechanical device)","retraction":null,"screen_n_in":null,"score":{"opus":0.08714268118305024,"gpt":0.3547994686096496,"spread":0.2676567874265993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003901754,0.0003617239,0.0005314854,0.0002845094,0.002998538,0.0007894404,0.0008138785,0.0001796982,0.002441724],"category_scores_gemma":[0.0008498614,0.000336866,0.0004403739,0.0001382814,0.0003109506,0.001150279,0.0004073174,0.000281043,0.0004452522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002294677,"about_ca_system_score_gemma":0.0001813534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000116296,"about_ca_topic_score_gemma":0.0002010951,"domain_scores_codex":[0.9972641,0.00003023788,0.001025934,0.0003077937,0.0006241608,0.0007476975],"domain_scores_gemma":[0.996624,0.0006041804,0.0008195419,0.001357172,0.0003627216,0.0002323698],"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.0004670252,0.007177634,0.004792315,0.002042648,0.00522103,0.000004802011,0.004049486,0.002015878,0.002649988,0.8475071,0.08753515,0.03653696],"study_design_scores_gemma":[0.002546405,0.0001437902,0.003206397,0.0001028172,0.0008069332,0.000004711681,0.0007479027,0.9373584,0.000607001,0.04617856,0.007663578,0.0006334563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03117306,0.000007546257,0.9627468,0.0005834536,0.0004736994,0.0009356582,0.0004783321,0.0001175647,0.003483886],"genre_scores_gemma":[0.9394584,0.000009952979,0.05456708,0.000096232,0.0005270474,0.0004621744,0.0009131131,0.00006097599,0.00390505],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9353426,"threshold_uncertainty_score":0.9999083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3006592704","doi":"10.3233/fi-2020-1910","title":"On Orthogonal Projections on the Space of Consistent Pairwise Comparisons Matrices","year":2020,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Advanced Scientific Research Methods","field":"Agricultural and Biological Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Orthogonalization; Pairwise comparison; Mathematics; Product (mathematics); Matrix (chemical analysis); Inner product space; Vector space; Space (punctuation); Applied mathematics; Algorithm; Discrete mathematics; Computer science; Pure mathematics; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1567055371080996,"gpt":0.3262030201397347,"spread":0.1694974830316351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005273307,0.0001109008,0.0001621939,0.00001662152,0.0003089842,0.00008761718,0.0003440605,0.00003152565,0.0009793178],"category_scores_gemma":[0.0004980016,0.00003387783,0.0001003096,0.0005626036,0.0002046686,0.0001452696,0.0001116873,0.000206943,0.0002462676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000281102,"about_ca_system_score_gemma":0.00001974521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001384632,"about_ca_topic_score_gemma":0.00001518862,"domain_scores_codex":[0.9986091,0.0001513789,0.0003207796,0.0001452399,0.0005340843,0.0002394347],"domain_scores_gemma":[0.9982283,0.001304652,0.00016674,0.0000956816,0.00006365815,0.0001409843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009198299,0.001247052,0.007079664,0.000239282,0.0002481341,0.00000854455,0.007123168,0.002115065,0.07557333,0.2793071,0.5017279,0.1244109],"study_design_scores_gemma":[0.00102911,0.006555939,0.05202888,0.0002995871,0.00006316747,0.00001313874,0.03943437,0.01781009,0.0327492,0.004789126,0.8443301,0.0008973249],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9447287,0.00002077799,0.0003920074,0.02570482,0.0001826155,0.0008845925,0.0001990527,0.00007598831,0.02781142],"genre_scores_gemma":[0.9961902,0.00001273574,0.001797884,0.001598604,0.00005620025,0.00004488062,0.00002724809,8.233461e-7,0.0002714446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3426021,"threshold_uncertainty_score":0.9999339,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1509287145","doi":"10.3233/fi-2009-202","title":"Combinatorics of Unique Maximal Factorization Families (UMFFs)","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Centre International de Recherche sur le Cancer","keywords":"Lexicographical order; Combinatorics; Factorization; Mathematics; Alphabet; String (physics); Set (abstract data type); Word (group theory); Discrete mathematics; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01001303374925273,"gpt":0.23239784096643,"spread":0.2223848072171773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001395247,0.0001193464,0.0001643765,0.0001209418,0.00009339966,0.0001182632,0.0006466795,0.00005542938,0.00002453129],"category_scores_gemma":[0.0000234698,0.0001011676,0.00004047988,0.000340791,0.0000299541,0.001693219,0.0001978899,0.00009328814,0.00003559038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004571534,"about_ca_system_score_gemma":0.00004674249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001374668,"about_ca_topic_score_gemma":3.13291e-7,"domain_scores_codex":[0.9989489,0.00002039428,0.0003913605,0.0001122748,0.0003368133,0.0001901998],"domain_scores_gemma":[0.9991534,0.0000381922,0.0001800139,0.000471287,0.00008175945,0.0000753588],"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.00001406454,0.0002614666,0.001415857,0.00007659846,0.00001898965,0.00000302204,0.0038292,0.0001042556,0.0008650884,0.8492966,0.004511991,0.1396029],"study_design_scores_gemma":[0.004038208,0.003047701,0.09090699,0.0004376288,0.0000412474,0.00005559332,0.001817477,0.4874293,0.04541993,0.186329,0.178781,0.00169596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01996706,0.00002845315,0.9677182,0.0002293601,0.0003383017,0.0001871121,0.00001739839,0.0001335425,0.01138052],"genre_scores_gemma":[0.9621478,0.00004971291,0.03726471,0.0003788916,0.00001953741,0.000003714422,0.00005008014,0.000003469331,0.00008210722],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9421807,"threshold_uncertainty_score":0.4125495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1497284170","doi":"","title":"Spatio-Temporal Approximate Reasoning over Complex Objects","year":2005,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Domain (mathematical analysis); Context (archaeology); Artificial intelligence; Theoretical computer science; Data mining; Mathematics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.02291557565412861,"gpt":0.2590175512023282,"spread":0.2361019755481996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003380842,0.0001931197,0.0001873035,0.0001518548,0.0002026116,0.000834118,0.001066726,0.00003532772,0.0004437158],"category_scores_gemma":[0.0000189086,0.0001767548,0.00006219386,0.0003299365,0.00004750876,0.004518323,0.0007673455,0.0001184238,0.001084053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008881593,"about_ca_system_score_gemma":0.00002868982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002862967,"about_ca_topic_score_gemma":0.00001839163,"domain_scores_codex":[0.9984261,0.00002223227,0.00044208,0.0002160559,0.0004539654,0.0004395164],"domain_scores_gemma":[0.9989303,0.00002866669,0.0001857636,0.000698482,0.00002937332,0.000127392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002815457,0.0003497026,0.009235772,0.0002836419,0.0001775013,0.00002155981,0.00903388,0.0004691288,0.00004091441,0.3224774,0.2146666,0.4432157],"study_design_scores_gemma":[0.0006681256,0.00005501318,0.003547772,0.00003555403,0.00000789856,0.000007817239,0.0001770528,0.6471873,0.0001220308,0.0004265314,0.3474691,0.0002958522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03780037,0.00005173125,0.7404715,0.002158095,0.0007282084,0.001004538,0.00005516884,0.001153799,0.2165766],"genre_scores_gemma":[0.5548413,0.00001168406,0.4395959,0.003623974,0.0001934844,0.000036305,0.0003306544,0.00001447576,0.001352256],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6467181,"threshold_uncertainty_score":0.9996937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1604618930","doi":"10.3233/fi-2009-128","title":"Semi-supervised Rough Cost/Benefit Decisions","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Rough set; Computer science; Business; Operations research; Risk analysis (engineering); Mathematics; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.03345543096663277,"gpt":0.266800736715795,"spread":0.2333453057491622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002500523,0.0002195,0.0002449919,0.0001305878,0.0002819392,0.0005963932,0.001356121,0.00008557597,0.0001945],"category_scores_gemma":[0.00005823675,0.0001750767,0.0001156117,0.0005034762,0.00003597112,0.001827076,0.0002697857,0.0001812632,0.001374288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009107385,"about_ca_system_score_gemma":0.00005067483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008996675,"about_ca_topic_score_gemma":0.000002058239,"domain_scores_codex":[0.9981783,0.00001767409,0.0005580483,0.0002320348,0.0004895284,0.0005243861],"domain_scores_gemma":[0.9985048,0.0001296067,0.0001162559,0.0009454464,0.00006228382,0.0002415919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000141023,0.0001954688,0.0002677996,0.00001027105,0.00002489389,0.00001723349,0.003527809,0.0006611851,0.00004667506,0.1697835,0.02770341,0.7977476],"study_design_scores_gemma":[0.00281386,0.00100543,0.02055448,0.0001762488,0.0000293512,0.0001503146,0.0006065046,0.441995,0.000421688,0.08624139,0.4447497,0.001256005],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04219209,0.0002197393,0.5708058,0.00869406,0.001058075,0.001253615,0.00003427994,0.0009134671,0.3748288],"genre_scores_gemma":[0.8178307,0.0001188608,0.1633285,0.01800284,0.0001088816,0.00003816179,0.00003848822,0.00001041023,0.0005231422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7964916,"threshold_uncertainty_score":0.9994032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519279188","doi":"10.3233/fi-2013-894","title":"Discrete Duality for Rough Relation Algebras","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Relation (database); Duality (order theory); Mathematics; Rough set; Pure mathematics; Algebra over a field; Computer science; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.02120769802400935,"gpt":0.2559839443181559,"spread":0.2347762462941466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002708536,0.0001356623,0.0001523355,0.00005334407,0.0002035647,0.0005172253,0.0005409778,0.00006175056,0.000154902],"category_scores_gemma":[0.00005114531,0.0001048272,0.00008279484,0.0001712261,0.00004013876,0.00292691,0.0002042539,0.00008565025,0.0009462538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005785176,"about_ca_system_score_gemma":0.00002814096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003915395,"about_ca_topic_score_gemma":0.00000155434,"domain_scores_codex":[0.9988039,0.00002316491,0.0004430113,0.0001619588,0.0002398451,0.0003281875],"domain_scores_gemma":[0.9990558,0.0001124066,0.0001534697,0.0005090341,0.00006207039,0.0001072234],"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.00001174963,0.00009501776,0.002798218,0.0001707577,0.00006992143,8.32281e-7,0.007050531,0.0001934585,0.00004888284,0.7582268,0.06883744,0.1624965],"study_design_scores_gemma":[0.001784285,0.0005262711,0.08936781,0.0000578355,0.00002374328,0.00001900139,0.0004814787,0.5476246,0.0003216222,0.1969276,0.1620475,0.000818232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03300814,0.00003054833,0.9067758,0.004485997,0.00055612,0.001340008,0.00001655374,0.0002875066,0.05349928],"genre_scores_gemma":[0.7557779,0.000008256251,0.2401237,0.00318035,0.00008715662,0.0002854162,0.00006174006,0.000009263656,0.0004661775],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7227698,"threshold_uncertainty_score":0.9998316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040106564","doi":"10.3233/fi-2011-519","title":"Transformations Between Different Models of Unranked Bottom-Up Tree Automata","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; Queen's University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Nondeterministic algorithm; Automaton; Tree (set theory); Tree automaton; Computer science; Theoretical computer science; Nondeterministic finite automaton; Computation; State (computer science); Deterministic automaton; Mathematics; Combinatorics; Automata theory; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0559662170445804,"gpt":0.2406667216710299,"spread":0.1847005046264495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003317461,0.0002460668,0.0003921507,0.0002339323,0.0001391095,0.0001058368,0.001432593,0.00009110749,0.0001472676],"category_scores_gemma":[0.00001067638,0.0001984145,0.0001607999,0.0003194828,0.0001114497,0.002941374,0.0002487264,0.0001745979,0.000128008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005302585,"about_ca_system_score_gemma":0.0000519127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003306154,"about_ca_topic_score_gemma":0.000004196952,"domain_scores_codex":[0.9979833,0.00005096048,0.0009271143,0.0001735287,0.0004587474,0.0004064018],"domain_scores_gemma":[0.9984801,0.0001134478,0.0002652579,0.0009140334,0.00005567982,0.0001714362],"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.00003224048,0.0003836391,0.001155503,0.0003988331,0.0002708128,0.000002458842,0.0698547,0.00003689127,0.0003652754,0.7702101,0.002220052,0.1550695],"study_design_scores_gemma":[0.004348758,0.0007747734,0.02938652,0.0003590679,0.000168838,0.00003285094,0.002618736,0.7322903,0.0296408,0.1973185,0.001818859,0.001241999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.248707,0.00002842792,0.7087032,0.0001770007,0.0002861414,0.0004186519,0.00007487225,0.0004289982,0.0411758],"genre_scores_gemma":[0.9792048,0.00002218843,0.02034502,0.0002190708,0.00002016841,0.00003685747,0.00003859048,0.00001146265,0.0001018652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7322534,"threshold_uncertainty_score":0.8091108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1491079601","doi":"10.3233/fi-2013-917","title":"From Numeric to Granular Description and Interpretation of Information Granules","year":2013,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Research Centre","keywords":"Interpretation (philosophy); Granular computing; Computer science; Theoretical computer science; Programming language; Data mining; Rough set","retraction":null,"screen_n_in":null,"score":{"opus":0.008469286528252585,"gpt":0.2065602314926753,"spread":0.1980909449644228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001123842,0.0001061002,0.000149035,0.0001598355,0.00006176021,0.0003931661,0.000308198,0.00003845513,0.00005456687],"category_scores_gemma":[0.00003319308,0.00008809491,0.0000310691,0.0002274274,0.00003285951,0.005151473,0.0001659838,0.00005436868,0.0004245997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000292082,"about_ca_system_score_gemma":0.00001285054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004116036,"about_ca_topic_score_gemma":0.000002884643,"domain_scores_codex":[0.9990658,0.00002073521,0.0004566432,0.0000836439,0.0002204717,0.0001526674],"domain_scores_gemma":[0.9993678,0.00003922512,0.0001597314,0.0002648459,0.00007303318,0.00009533783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002229486,0.00005741559,0.00242992,0.0001262083,0.0000320501,2.837482e-7,0.04393191,0.0002541683,0.0005406551,0.01925043,0.004579788,0.9287749],"study_design_scores_gemma":[0.001023197,0.0006519904,0.1015029,0.0001708633,0.00002353806,0.000009798444,0.004044927,0.8291169,0.001024502,0.05423092,0.007689394,0.0005110226],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3218025,0.00001736829,0.6748054,0.0003572544,0.0001667715,0.0003458337,0.000009246901,0.00005332676,0.002442314],"genre_scores_gemma":[0.8812908,0.00001036761,0.1176509,0.0009566629,0.00001237523,0.00004054762,0.00003168624,0.000002225326,0.000004470155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9282638,"threshold_uncertainty_score":0.5457512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1498104397","doi":"10.3233/fi-2015-1224","title":"Characterising Concurrent Histories","year":2015,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Semaphore; Interleaving; Partially ordered set; Invariant (physics); Causality (physics); Set (abstract data type); Computer science; Mathematics; Sequence (biology); Intersection (aeronautics); Theoretical computer science; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04913518201304213,"gpt":0.2570320131207491,"spread":0.207896831107707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002860315,0.0001240748,0.0001763857,0.00005104965,0.00008879836,0.0003853036,0.0005662583,0.00003609228,0.00001561199],"category_scores_gemma":[0.00003544479,0.0001083255,0.00004142269,0.0001908828,0.0000401848,0.001692481,0.0001847372,0.00009058757,0.000479392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001934739,"about_ca_system_score_gemma":0.00009646817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001411873,"about_ca_topic_score_gemma":0.000001113173,"domain_scores_codex":[0.9988416,0.00002112197,0.0003945784,0.0001243659,0.0003552704,0.0002630782],"domain_scores_gemma":[0.9991204,0.00001814225,0.0001567868,0.0003950196,0.0001015924,0.0002080924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001921325,0.0003451995,0.004838539,0.0002834508,0.00009299298,0.00003244542,0.05356468,0.00005439737,0.0001548133,0.5554182,0.1404605,0.2447355],"study_design_scores_gemma":[0.0007176847,0.00009146143,0.0008659576,0.00004866399,0.00000336176,0.0000351441,0.0006033127,0.01643738,0.0001532553,0.0002920322,0.9805158,0.0002359861],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03590477,0.0003701333,0.8890097,0.001579679,0.006297456,0.0004245644,0.00004740376,0.0005632106,0.06580309],"genre_scores_gemma":[0.9942415,0.000003127681,0.004440231,0.0006678251,0.00008843864,0.00002347858,0.00002770102,0.000005049068,0.0005026229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9583368,"threshold_uncertainty_score":0.6161775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1812036194","doi":"10.3233/fun-2008-892-304","title":"Preferential Regular Path Queries","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Concordia University","funders":"","keywords":"Path (computing); Computer science; Theoretical computer science; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0213143840493547,"gpt":0.2062504235243008,"spread":0.1849360394749461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001371563,0.0001383048,0.0001386916,0.00009669363,0.0002461855,0.0002762364,0.0009769344,0.00003068203,0.0001767342],"category_scores_gemma":[0.00001379095,0.0001195281,0.0000542057,0.0002245577,0.00008400081,0.003279066,0.0006680859,0.00008527993,0.0008439628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003036361,"about_ca_system_score_gemma":0.00003418219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001177297,"about_ca_topic_score_gemma":0.000001047885,"domain_scores_codex":[0.998828,0.00001772515,0.0003131193,0.0001588017,0.0003834577,0.0002988999],"domain_scores_gemma":[0.9990941,0.00001709379,0.00009591764,0.0006741068,0.00002868674,0.0000900657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002274489,0.0003040479,0.002754122,0.0002109103,0.0001872083,0.00006195681,0.0103832,0.0000308314,0.0001189669,0.5573291,0.3136556,0.1149413],"study_design_scores_gemma":[0.001180615,0.0002497479,0.007308305,0.00004989544,0.0000166858,0.00007530245,0.0004091726,0.03746018,0.001491288,0.003423489,0.9477103,0.0006250611],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05839472,0.00006378323,0.8403194,0.0009394924,0.0012271,0.0005509979,0.00003291637,0.0007678476,0.09770378],"genre_scores_gemma":[0.7581169,0.0001959867,0.2283757,0.002634735,0.0002614931,0.00009010753,0.0002314768,0.00002223092,0.01007135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6997222,"threshold_uncertainty_score":0.999934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1640105340","doi":"10.3233/fi-2011-394","title":"Analysis of Recognition of a Musical Instrument in Sound Mixes Using Support Vector Machines","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Music and Audio Processing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Universidade Federal do ABC; McGill University; University of North Carolina at Pembroke; Louisiana State University","keywords":"Musical; Speech recognition; Sound (geography); Support vector machine; Musical instrument; Computer science; Acoustics; Artificial intelligence; Physics; Art","retraction":null,"screen_n_in":null,"score":{"opus":0.08471044716938086,"gpt":0.2763964503090252,"spread":0.1916860031396443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923855,0.0001019975,0.0003070823,0.0004767985,0.00003511615,0.00003696034,0.0003068218,0.00003895954,0.0003403627],"category_scores_gemma":[0.00002559083,0.00008951954,0.00009512321,0.0009343622,0.00007515748,0.0008655102,0.0001604853,0.00006589901,0.00000799707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004229854,"about_ca_system_score_gemma":0.0000628792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001988114,"about_ca_topic_score_gemma":0.00005008074,"domain_scores_codex":[0.9987764,0.00002483711,0.0006588859,0.000116333,0.0002500517,0.000173449],"domain_scores_gemma":[0.9992737,0.00003372295,0.0003479889,0.0002420543,0.00005461311,0.00004788012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001620353,0.001538159,0.3704737,0.001569147,0.001686679,0.00001709458,0.1620494,0.0002554441,0.005358818,0.009358222,0.0001663126,0.4473649],"study_design_scores_gemma":[0.002032251,0.0006288528,0.3070896,0.0004878163,0.0008039555,0.00002702701,0.002385194,0.6501173,0.02759467,0.007755734,0.0002467578,0.0008308911],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9376699,0.000005670978,0.05919347,0.00002177939,0.00008476993,0.00009403122,0.00001243132,0.00001574796,0.002902233],"genre_scores_gemma":[0.946433,0.000001932918,0.05333988,0.0001946486,0.000005696491,0.000004403107,0.00001287946,0.000002821877,0.000004755018],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6498618,"threshold_uncertainty_score":0.3726733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1577577485","doi":"","title":"Radial View of Continuous Cellular Automata","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Continuous spatial automaton; Cellular automaton; Mobile automaton; Asynchronous cellular automaton; Stochastic cellular automaton; Continuous automaton; Mathematics; Quantum cellular automaton; Boolean function; Diagram; Elementary cellular automaton; Discrete mathematics; Quantum finite automata; Theoretical computer science; Computer science; Algorithm; Automaton; Automata theory","retraction":null,"screen_n_in":null,"score":{"opus":0.01694470913993485,"gpt":0.2236618398855401,"spread":0.2067171307456053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001656726,0.0001327461,0.0002468696,0.00009396623,0.0001605864,0.00006064706,0.0009493083,0.00004660628,0.0001205697],"category_scores_gemma":[0.00001490634,0.0001227082,0.00009507722,0.0003474224,0.0001228306,0.0007110233,0.0002829815,0.00008705287,0.0006217335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003010084,"about_ca_system_score_gemma":0.00008645575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002051855,"about_ca_topic_score_gemma":6.210191e-7,"domain_scores_codex":[0.9987138,0.00002156315,0.0005433296,0.0001440143,0.0003265762,0.0002507532],"domain_scores_gemma":[0.9987423,0.00005593464,0.0001937738,0.0008506923,0.000048407,0.0001088252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002272879,0.001338973,0.003088299,0.0007268337,0.0002651306,0.00008569322,0.02327577,0.0001177666,0.02516149,0.6143495,0.07605322,0.2555146],"study_design_scores_gemma":[0.002297318,0.0003126914,0.005600038,0.0001012218,0.00003575666,0.0003294597,0.0002607884,0.1505183,0.05448702,0.001950964,0.7833418,0.0007646497],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2966987,0.0003217484,0.6536034,0.0007859014,0.0004072017,0.0008225007,0.00003653609,0.0006503831,0.0466736],"genre_scores_gemma":[0.9637936,0.00007156943,0.03518894,0.0004137264,0.00003409269,0.00004076862,0.00003549691,0.000008485119,0.0004133002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7072886,"threshold_uncertainty_score":0.7991334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}