{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Dominik Ślȩzak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003519196,0.0009217747,0.002058756,0.002978947,0.000956047,0.002985929,0.001368464,0.000925548,0.00204133],"category_scores_gemma":[0.01405227,0.0005132674,0.002872357,0.002014872,0.002835914,0.004711397,0.003433751,0.003198825,0.000314662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001542868,"about_ca_system_score_gemma":0.0008502695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006653972,"about_ca_topic_score_gemma":0.0005660669,"domain_scores_codex":[0.9946069,0.001411157,0.0003389245,0.0008003552,0.002568789,0.0002738425],"domain_scores_gemma":[0.992466,0.004414515,0.0005309337,0.001780648,0.0006327334,0.0001751311],"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.00009308819,0.00007331032,0.00103561,0.0002470383,0.0001767966,0.0002521727,0.0003301623,0.1479553,0.001932646,0.7861272,0.002977394,0.05879929],"study_design_scores_gemma":[0.00001447525,0.00004581995,0.0003890393,0.00002771617,0.00003920145,0.0001531516,0.00004052097,0.1933397,0.001310145,0.8007628,0.003856705,0.00002072259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02887983,0.001119021,0.9588315,0.0008068242,0.0001454537,0.000118364,0.0003779979,0.0002460568,0.009474889],"genre_scores_gemma":[0.660763,0.001348452,0.3303546,0.0004155325,0.0004675661,0.0004391445,0.0009886846,0.0001956337,0.00502738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003519196,"threshold_uncertainty_score":0.01861149,"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","authors":[{"name":"Joseph P. Herbert","is_ca":true},{"name":"JingTao Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004078742,0.0009461611,0.001319906,0.001322794,0.00115605,0.004891907,0.001844306,0.001452727,0.00325485],"category_scores_gemma":[0.008917471,0.0004429336,0.001683478,0.001309045,0.0038991,0.004940561,0.002235809,0.002493663,0.0006042525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002262629,"about_ca_system_score_gemma":0.001318773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0018387,"about_ca_topic_score_gemma":0.001432666,"domain_scores_codex":[0.995891,0.002094106,0.000214105,0.0004486317,0.001094297,0.0002578197],"domain_scores_gemma":[0.9959818,0.002466871,0.0003242256,0.0005963276,0.0003898203,0.0002409505],"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.000004591335,0.000005498863,0.00003967262,0.00001557031,0.00001062505,0.00001404624,0.00004555651,0.007655204,0.00005885435,0.9901557,0.0003459958,0.001648665],"study_design_scores_gemma":[0.00000719921,0.00001221475,0.00004211786,0.000009298753,0.000006760556,0.00001850439,0.00002928764,0.03223677,0.0000421289,0.9648142,0.002775172,0.00000642757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01826818,0.001291282,0.9179044,0.003698789,0.0002096814,0.0001423994,0.0003170409,0.0001190699,0.05804925],"genre_scores_gemma":[0.7412224,0.002445066,0.2413498,0.0006560309,0.0003749662,0.0004431973,0.0003468691,0.00005015896,0.0131114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004891907,"threshold_uncertainty_score":0.02157074,"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","authors":[{"name":"James F. Peters","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144716,0.001229783,0.001862805,0.005520459,0.001910694,0.006331543,0.00255224,0.002967547,0.00278384],"category_scores_gemma":[0.01087205,0.0009597889,0.003459091,0.00365109,0.0101656,0.01254041,0.004668516,0.004350324,0.001016478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002899832,"about_ca_system_score_gemma":0.001052893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002379378,"about_ca_topic_score_gemma":0.0009496518,"domain_scores_codex":[0.9930146,0.001915198,0.0007703222,0.001932712,0.002023896,0.0003433106],"domain_scores_gemma":[0.9934072,0.003724277,0.0007829752,0.001024299,0.0007645204,0.0002965712],"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.00001374649,0.000009274943,0.0002232441,0.0001665864,0.00003235301,0.0001042379,0.0003602708,0.005555694,0.0004125262,0.982954,0.0008854172,0.009282594],"study_design_scores_gemma":[0.00000973531,0.00004771494,0.0002511503,0.0001129502,0.00003402452,0.0002963128,0.0002045158,0.0242618,0.0005062813,0.9490737,0.02517024,0.00003155077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01357828,0.008802138,0.9478461,0.00156273,0.0005122179,0.0001261559,0.0004684588,0.000215197,0.0268888],"genre_scores_gemma":[0.4320928,0.01105624,0.5331118,0.001777948,0.002075706,0.0008526477,0.00171999,0.0002676871,0.01704507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006331543,"threshold_uncertainty_score":0.02191961,"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","authors":[{"name":"Xiaoping Yang","is_ca":false},{"name":"JingTao Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328522,0.001008251,0.001558076,0.001163266,0.0005942157,0.003953386,0.002019717,0.001699857,0.002304352],"category_scores_gemma":[0.007138137,0.000719108,0.002180434,0.001693033,0.001913644,0.003356901,0.001831971,0.001917902,0.0004149743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001777879,"about_ca_system_score_gemma":0.001526225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005434588,"about_ca_topic_score_gemma":0.004190153,"domain_scores_codex":[0.9975349,0.001333418,0.0001629332,0.0002687642,0.0004857173,0.0002142589],"domain_scores_gemma":[0.9957083,0.002880339,0.0007003361,0.0002749889,0.0002609593,0.0001749173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005630879,0.00003580017,0.000469323,0.00008658674,0.0000974446,0.0001933548,0.0001529498,0.8148134,0.0004216724,0.1753038,0.0003406885,0.008028672],"study_design_scores_gemma":[0.0000214717,0.00003524182,0.0001369062,0.0000194402,0.00002740256,0.00002655103,0.00003839806,0.8782737,0.0001804381,0.1200273,0.001193251,0.00001985649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02360987,0.0006534534,0.9680996,0.0006714151,0.00009153289,0.00008441458,0.0001308525,0.000102016,0.006556926],"genre_scores_gemma":[0.7373278,0.001614863,0.2555878,0.0001200266,0.0001277388,0.0002963578,0.00023042,0.00003335929,0.004661763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005434588,"threshold_uncertainty_score":0.0173741,"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","authors":[{"name":"Yiyu Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01134371,0.0009472381,0.001876122,0.002988262,0.001566428,0.006660604,0.00241091,0.003727486,0.002097913],"category_scores_gemma":[0.02226279,0.000994719,0.002413137,0.002400431,0.007083328,0.01219932,0.003795815,0.004358376,0.0004516095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002122148,"about_ca_system_score_gemma":0.001823203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009642252,"about_ca_topic_score_gemma":0.0006573836,"domain_scores_codex":[0.9870257,0.005669846,0.001102683,0.001390094,0.004206701,0.0006049101],"domain_scores_gemma":[0.9894416,0.00669838,0.001079965,0.001247935,0.001077205,0.0004548792],"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.00001872781,0.00001626512,0.0001102568,0.00005452278,0.0000160621,0.00007030082,0.000327152,0.0091267,0.0002164575,0.9848701,0.0002916142,0.004881806],"study_design_scores_gemma":[0.00001423536,0.00002086725,0.0001018874,0.00003351871,0.0000166992,0.00009827346,0.00008298089,0.03107619,0.0002472513,0.965776,0.002507481,0.00002447011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01450716,0.001009966,0.9682823,0.004920452,0.0001594163,0.000114591,0.0001898457,0.0001041091,0.01071217],"genre_scores_gemma":[0.5112437,0.001237606,0.4817962,0.0009073731,0.0004229156,0.000589272,0.0003282468,0.00007876661,0.00339597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01134371,"threshold_uncertainty_score":0.05999196,"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","authors":[{"name":"Francisco Claude","is_ca":true},{"name":"Gonzalo Navarro","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004187757,0.0005699726,0.0006180342,0.001625562,0.000423991,0.001085575,0.001373502,0.0006184369,0.006291499],"category_scores_gemma":[0.002892423,0.0003041316,0.0005496937,0.002300026,0.000762684,0.002134655,0.001665428,0.000781142,0.002705408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006801352,"about_ca_system_score_gemma":0.001138777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147186,"about_ca_topic_score_gemma":0.001225374,"domain_scores_codex":[0.9991122,0.00009194478,0.00009025502,0.0001632292,0.0004428479,0.0000995213],"domain_scores_gemma":[0.9981657,0.0004146512,0.00009111989,0.0007299236,0.0005523136,0.00004625753],"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.0004629686,0.0002168871,0.001354172,0.0004436396,0.00006001705,0.000821639,0.000515415,0.03289752,0.1028585,0.08769705,0.0424288,0.7302435],"study_design_scores_gemma":[0.0002009336,0.0004009992,0.00168356,0.0001243395,0.00010211,0.002068917,0.0002384813,0.4844668,0.2705157,0.1228513,0.117229,0.0001178717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06724194,0.001109832,0.8819641,0.0006033234,0.0003955403,0.0004105859,0.002888451,0.02283825,0.02254804],"genre_scores_gemma":[0.3359875,0.0009934411,0.6262264,0.0007206728,0.0002605786,0.0005700882,0.008795657,0.00297082,0.0234748],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006291499,"threshold_uncertainty_score":0.02104717,"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","authors":[{"name":"Yingxu Wang","is_ca":true},{"name":"Witold Kinsner","is_ca":true},{"name":"James A. Anderson","is_ca":false},{"name":"Du Zhang","is_ca":false},{"name":"Yiyu Yao","is_ca":true},{"name":"Phillip C.‐Y. Sheu","is_ca":false},{"name":"Jeffrey J. P. Tsai","is_ca":false},{"name":"Witold Pedrycz","is_ca":true},{"name":"Jean‐Claude Latombe","is_ca":false},{"name":"Lotfi A. Zadeh","is_ca":false},{"name":"Dilip Patel","is_ca":false},{"name":"Christine W. Chan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003404096,0.0008832289,0.00107117,0.002698209,0.003649349,0.008308818,0.001884503,0.004389218,0.005476435],"category_scores_gemma":[0.008320223,0.0003815299,0.001111411,0.002398249,0.0329917,0.01149488,0.005771356,0.006108889,0.001989811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003442462,"about_ca_system_score_gemma":0.004837362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002089698,"about_ca_topic_score_gemma":0.0009584133,"domain_scores_codex":[0.9954872,0.001445951,0.0003239778,0.0008278539,0.00148453,0.0004304202],"domain_scores_gemma":[0.9944053,0.003017131,0.0004453542,0.00106036,0.0007436696,0.0003282831],"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.000001866309,0.000002333146,0.00003589654,0.00002269806,0.000002604228,0.00001239792,0.0001559548,0.00007920224,0.00003393878,0.9954228,0.001358676,0.002871644],"study_design_scores_gemma":[0.000005767649,0.000007812877,0.00007668221,0.00005317187,0.000003971672,0.0001088004,0.0000943023,0.0004118485,0.00009037863,0.9590125,0.04012587,0.00000879366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01454566,0.02578139,0.3483048,0.04223693,0.003454904,0.0002068738,0.0004183659,0.0005833532,0.5644677],"genre_scores_gemma":[0.778022,0.02106141,0.1398657,0.01342264,0.007052958,0.00111429,0.0004671618,0.0002402941,0.03875354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008308818,"threshold_uncertainty_score":0.02497697,"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","authors":[{"name":"Waldemar W. Koczkodaj","is_ca":true},{"name":"Ryszard Szwarc","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05032289,0.002057125,0.002185719,0.005933114,0.00317268,0.005525498,0.004380273,0.002837535,0.00559041],"category_scores_gemma":[0.08904573,0.00114581,0.004975067,0.006862198,0.01233096,0.01591354,0.007193096,0.01184897,0.001249422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003774683,"about_ca_system_score_gemma":0.003216215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666932,"about_ca_topic_score_gemma":0.001115619,"domain_scores_codex":[0.9227293,0.04352272,0.006870711,0.008961472,0.01637054,0.001545206],"domain_scores_gemma":[0.886811,0.08486463,0.006442482,0.009471732,0.01131654,0.001093717],"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.00003145395,0.00002879564,0.0003211815,0.0002060362,0.00007033962,0.00008999965,0.0003342791,0.004465508,0.0004625315,0.9797997,0.0007465336,0.01344347],"study_design_scores_gemma":[0.00002573214,0.00006057024,0.000243991,0.000107409,0.00005611387,0.0001691997,0.00009007459,0.01662895,0.0008468596,0.9761705,0.005546041,0.00005445375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002900426,0.0004939936,0.9882236,0.0007037838,0.0001830356,0.0001181773,0.0001496912,0.00009933797,0.007127932],"genre_scores_gemma":[0.1401562,0.001035094,0.8534564,0.0009744773,0.0006163954,0.001268968,0.0007328259,0.000145231,0.00161437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05032289,"threshold_uncertainty_score":0.2661361,"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","authors":[{"name":"Yingxu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004590605,0.001351142,0.001188803,0.003379094,0.002125996,0.006010093,0.00175554,0.002345715,0.005762077],"category_scores_gemma":[0.008457771,0.0005092179,0.001779568,0.002955861,0.01403354,0.01420723,0.003954354,0.00576652,0.001479891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002778591,"about_ca_system_score_gemma":0.001848073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008424271,"about_ca_topic_score_gemma":0.0007790746,"domain_scores_codex":[0.9963322,0.001607492,0.0004019426,0.0004915764,0.0009609666,0.0002058681],"domain_scores_gemma":[0.9954488,0.002767871,0.0004514977,0.0007163765,0.0004501782,0.0001652818],"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.000002648184,0.000002704136,0.00002641381,0.00002658358,0.000003747025,0.00001975871,0.000156242,0.0001465626,0.0001067062,0.9966054,0.0003491108,0.002554166],"study_design_scores_gemma":[0.000005274989,0.000007890645,0.00005392705,0.00002960388,0.000005190569,0.00007681555,0.00006669754,0.001234352,0.0001555418,0.9772605,0.02109541,0.000008799026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006321967,0.01828099,0.8803456,0.008143095,0.001278851,0.0001132082,0.0001616873,0.0003792779,0.08497528],"genre_scores_gemma":[0.3278107,0.01751952,0.6290587,0.003587174,0.003968962,0.001283592,0.0003987167,0.0002667531,0.01610588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006010093,"threshold_uncertainty_score":0.02427769,"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","authors":[{"name":"James F. Peters","is_ca":true},{"name":"Andrzej Skowron","is_ca":false},{"name":"Jarosław Stepaniuk","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003327989,0.0007040969,0.00153467,0.002439678,0.0009836935,0.003772111,0.002788682,0.002106372,0.00310367],"category_scores_gemma":[0.01086133,0.0004423932,0.002230803,0.002474909,0.003783662,0.01015765,0.00440506,0.003086122,0.0004910883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001804173,"about_ca_system_score_gemma":0.0007224607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606709,"about_ca_topic_score_gemma":0.0009035032,"domain_scores_codex":[0.9956398,0.001300268,0.0002847653,0.001156677,0.001337272,0.000281262],"domain_scores_gemma":[0.99542,0.00210988,0.0006245497,0.0009604027,0.0005885694,0.0002966525],"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.00006643868,0.00003166408,0.0008675922,0.0001236555,0.0000501985,0.0002328893,0.0005727925,0.05569125,0.000913983,0.9181184,0.0006341939,0.02269699],"study_design_scores_gemma":[0.00001823206,0.0001080813,0.0004355227,0.00005555716,0.00003992126,0.0003758883,0.0001883291,0.3676404,0.0004953248,0.6241733,0.006435178,0.0000341853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03661879,0.001333258,0.952136,0.0008504037,0.00009318197,0.00004877539,0.0001597608,0.0001474163,0.008612329],"genre_scores_gemma":[0.7493503,0.002045984,0.2389404,0.0002803709,0.000286315,0.0001781914,0.000382529,0.00007449857,0.008461474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003772111,"threshold_uncertainty_score":0.01760036,"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","authors":[{"name":"Xiaofei Deng","is_ca":true},{"name":"Yiyu Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01311285,0.001202783,0.001627364,0.005182633,0.001456735,0.00590495,0.002447113,0.001953955,0.008615148],"category_scores_gemma":[0.03009242,0.0007663662,0.003173858,0.003654198,0.003886084,0.01027511,0.002991291,0.003294977,0.0006985572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002434546,"about_ca_system_score_gemma":0.001854848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002802374,"about_ca_topic_score_gemma":0.002275686,"domain_scores_codex":[0.9917096,0.003461177,0.0004613703,0.001099998,0.002580575,0.0006871953],"domain_scores_gemma":[0.9744071,0.01980154,0.00243806,0.001169903,0.001519752,0.00066373],"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.00009499396,0.00005233263,0.002101605,0.0001961446,0.0001953122,0.0002693569,0.0004779055,0.1497817,0.0008045309,0.8121749,0.0007315504,0.03311964],"study_design_scores_gemma":[0.000009998686,0.00004494414,0.0009448784,0.00007224087,0.00006582733,0.0001093825,0.000120333,0.3812584,0.0002670893,0.6157749,0.001286844,0.00004523694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03126797,0.00112008,0.9568617,0.001459351,0.0001042814,0.00009995226,0.0002071644,0.00008105041,0.008798552],"genre_scores_gemma":[0.7073655,0.001742483,0.2829448,0.0003143774,0.0003117242,0.0003183118,0.0002115907,0.00005096964,0.006740287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01311285,"threshold_uncertainty_score":0.06934828,"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","authors":[{"name":"Andrzej Skowron","is_ca":false},{"name":"Jarosław Stepaniuk","is_ca":false},{"name":"James F. Peters","is_ca":true},{"name":"Roman W. Świniarski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01393938,0.001221203,0.001966469,0.005243349,0.005091372,0.009241391,0.003850312,0.002879691,0.005683772],"category_scores_gemma":[0.03021407,0.001257108,0.0049914,0.00398974,0.01549014,0.01713826,0.00902401,0.008076289,0.001280111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004762081,"about_ca_system_score_gemma":0.003048541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003253182,"about_ca_topic_score_gemma":0.002455547,"domain_scores_codex":[0.9868873,0.003570361,0.001181933,0.002241719,0.005350849,0.0007677416],"domain_scores_gemma":[0.9807203,0.01198354,0.001194892,0.002835968,0.00260374,0.0006614759],"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.000001998673,0.00000441478,0.00002718479,0.00002147272,0.000005933002,0.00002120483,0.0001170808,0.001039286,0.00008556099,0.996636,0.0001574033,0.001882651],"study_design_scores_gemma":[0.000006146933,0.000005038177,0.00001513198,0.00002546421,0.000005597374,0.00003722273,0.00003986889,0.006357036,0.0002432867,0.9867272,0.006525632,0.0000123624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006708886,0.002049446,0.9691046,0.001636397,0.0004039118,0.0001200221,0.0001102395,0.0003287408,0.01953789],"genre_scores_gemma":[0.2233465,0.003018904,0.7584243,0.000865688,0.0008953528,0.000626598,0.0003393572,0.0004654151,0.01201798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01393938,"threshold_uncertainty_score":0.07371938,"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","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Ευριπίδης Μάρκου","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031397,0.001031033,0.002298392,0.0007763965,0.001654961,0.003981143,0.002891626,0.002878794,0.01237235],"category_scores_gemma":[0.01654912,0.0008501132,0.001884058,0.001513698,0.001532102,0.005482622,0.003318989,0.002276263,0.001070371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002252966,"about_ca_system_score_gemma":0.002661435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007975309,"about_ca_topic_score_gemma":0.005345383,"domain_scores_codex":[0.9976031,0.00071153,0.0001644288,0.0005534682,0.00041282,0.0005546371],"domain_scores_gemma":[0.9766402,0.02019486,0.0009034146,0.0009554042,0.0005558726,0.0007501214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001934197,0.0004873217,0.006875382,0.001503492,0.0004256353,0.0009621541,0.001000352,0.821115,0.006664199,0.07353232,0.01899524,0.06650461],"study_design_scores_gemma":[0.0002800856,0.0001176609,0.001054246,0.00005128923,0.0001184592,0.00032805,0.0003531041,0.8647078,0.001337509,0.1294527,0.002167561,0.00003156374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6033738,0.002031067,0.3293863,0.01357969,0.0002477202,0.0006140762,0.004574558,0.002087397,0.04410536],"genre_scores_gemma":[0.8626636,0.00111523,0.1216793,0.0008228911,0.0001735566,0.0004305769,0.003185841,0.0003794242,0.009549538],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01237235,"threshold_uncertainty_score":0.04138964,"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","authors":[{"name":"Yuan Gao","is_ca":true},{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764768,0.0007114764,0.001034591,0.001504419,0.0012569,0.004792007,0.001314366,0.001151546,0.007220926],"category_scores_gemma":[0.01573914,0.0005032758,0.001499151,0.001205168,0.002907128,0.009193416,0.002868444,0.002601041,0.0005212615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002065208,"about_ca_system_score_gemma":0.001488786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219875,"about_ca_topic_score_gemma":0.001344206,"domain_scores_codex":[0.9973481,0.00054674,0.0001800337,0.0005750495,0.0007312897,0.000618826],"domain_scores_gemma":[0.9704279,0.02357109,0.001792229,0.002102897,0.001288797,0.0008170827],"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.001092769,0.0001852204,0.004525646,0.0003959134,0.0001042159,0.0003889073,0.0007759368,0.08077283,0.01320287,0.8543055,0.002042552,0.04220755],"study_design_scores_gemma":[0.00004370589,0.0002938729,0.001757622,0.00005042987,0.000128408,0.0003988694,0.0003416472,0.308711,0.01366359,0.6717713,0.002739167,0.0001003463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6852477,0.0009968358,0.2845443,0.001104775,0.000144939,0.0001536757,0.0005546031,0.0005328119,0.02672042],"genre_scores_gemma":[0.9692367,0.0004554435,0.0258992,0.0000657425,0.00008764075,0.0001351717,0.0003886023,0.0001335091,0.003597996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007220926,"threshold_uncertainty_score":0.02415639,"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","authors":[{"name":"James F. Peters","is_ca":true},{"name":"Christopher J. Henry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00347372,0.001097341,0.001563672,0.0007138331,0.0004527862,0.0017416,0.001586973,0.001322585,0.002560107],"category_scores_gemma":[0.01138416,0.0004125837,0.0009963157,0.0007097175,0.002128966,0.002026923,0.001859924,0.002297722,0.0003737552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001649715,"about_ca_system_score_gemma":0.001131648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248949,"about_ca_topic_score_gemma":0.001518278,"domain_scores_codex":[0.9975448,0.001368486,0.0001224617,0.0002770075,0.0005440769,0.0001431354],"domain_scores_gemma":[0.994167,0.004376765,0.0003942453,0.0004290561,0.0004363779,0.0001964757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008900702,0.00006358,0.0006003079,0.0001462335,0.0000950628,0.00006462874,0.0001410841,0.7359882,0.0005218188,0.2207823,0.000683161,0.04082457],"study_design_scores_gemma":[0.00002286829,0.00006013207,0.00005641214,0.00001459541,0.000009636107,0.00001527832,0.00001188323,0.9227118,0.0001858763,0.07567888,0.001224332,0.000008339865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006514841,0.0005327298,0.9897016,0.0002932374,0.00005458607,0.00004017416,0.00002076023,0.0001072521,0.002734869],"genre_scores_gemma":[0.70667,0.00121202,0.2858256,0.0002409224,0.0002137688,0.000394965,0.0001232328,0.00006494181,0.005254473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00347372,"threshold_uncertainty_score":0.01837099,"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","authors":[{"name":"Sheng Yü","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005516952,0.001687893,0.002614212,0.004842647,0.002559816,0.007068794,0.003464709,0.003561526,0.009507283],"category_scores_gemma":[0.02362765,0.001000205,0.002080203,0.009255154,0.007123077,0.02658066,0.004361659,0.01024716,0.002043616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004570231,"about_ca_system_score_gemma":0.002109942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001956024,"about_ca_topic_score_gemma":0.001060181,"domain_scores_codex":[0.9956448,0.0009056387,0.0003210206,0.0010288,0.001603679,0.0004961414],"domain_scores_gemma":[0.9624454,0.03133046,0.001144666,0.0017569,0.002479371,0.0008432051],"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.0001345795,0.0001472919,0.000872334,0.001772893,0.00008644808,0.0001115839,0.0003105363,0.01053376,0.0003253326,0.8408335,0.01457762,0.1302942],"study_design_scores_gemma":[0.00001307012,0.00002821493,0.0003166246,0.0001647118,0.00003054636,0.0001100179,0.0001299289,0.01365058,0.0002974436,0.9631647,0.02206943,0.0000246171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.03825095,0.3876646,0.371443,0.06039393,0.00349721,0.0001511382,0.001155271,0.0009325596,0.1365115],"genre_scores_gemma":[0.4711224,0.3732416,0.100089,0.006462294,0.02755096,0.0004788937,0.0026574,0.0006830101,0.01771437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009507283,"threshold_uncertainty_score":0.03315949,"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","authors":[{"name":"Yingxu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004323023,0.0009213366,0.000835039,0.002372406,0.001988358,0.003985131,0.001610869,0.001769921,0.003719031],"category_scores_gemma":[0.008445123,0.0006612104,0.001996851,0.001541905,0.01346966,0.01166422,0.002802282,0.003966019,0.0008315357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002054552,"about_ca_system_score_gemma":0.002815352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00213157,"about_ca_topic_score_gemma":0.00110458,"domain_scores_codex":[0.9970822,0.001228025,0.0002872148,0.0004826298,0.0007445551,0.0001754843],"domain_scores_gemma":[0.9954425,0.003033421,0.0003562644,0.0004911917,0.0005364104,0.0001402193],"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.000002594657,0.000002821619,0.00002365106,0.00002825078,0.000002563595,0.00002973282,0.0001989516,0.0005557855,0.0001358177,0.9958209,0.00037737,0.002821527],"study_design_scores_gemma":[0.000006683927,0.000007339045,0.00003171379,0.00004040827,0.000005315183,0.00007957092,0.00004896325,0.001717026,0.0001437423,0.9802806,0.01762967,0.000009007194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00540407,0.007928671,0.9524243,0.007376903,0.0005241222,0.0001008193,0.0003709108,0.0003898115,0.02548034],"genre_scores_gemma":[0.3058834,0.008121106,0.6713095,0.002878504,0.001534324,0.0006032895,0.0009194773,0.0003647513,0.008385596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004323023,"threshold_uncertainty_score":0.02286261,"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","authors":[{"name":"Sheela Ramanna","is_ca":true},{"name":"James F. Peters","is_ca":true},{"name":"Andrzej Skowron","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006296041,0.001285382,0.001935083,0.004752231,0.001720629,0.006519101,0.003699951,0.002015284,0.004426337],"category_scores_gemma":[0.01240566,0.001065788,0.003505625,0.003738843,0.006670195,0.007706903,0.004432035,0.003758414,0.0006269343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005027901,"about_ca_system_score_gemma":0.002028538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004315929,"about_ca_topic_score_gemma":0.0032218,"domain_scores_codex":[0.9935486,0.003305965,0.0004073132,0.0006836732,0.001678515,0.0003759431],"domain_scores_gemma":[0.9926667,0.004732546,0.0009031171,0.0007126997,0.0006860525,0.0002988687],"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.000009207431,0.0000140606,0.000137478,0.00008926792,0.00005315886,0.00008218069,0.0004318615,0.05855817,0.0001129166,0.931846,0.0004925577,0.008173163],"study_design_scores_gemma":[0.00001192978,0.00001383524,0.00009769203,0.00004522357,0.00001897406,0.00004008474,0.0002318346,0.1149687,0.00008704917,0.8795073,0.004952935,0.00002450621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004431408,0.001635529,0.9789791,0.001333601,0.00008821559,0.00009583688,0.00007656669,0.00008156196,0.01327823],"genre_scores_gemma":[0.3942703,0.004218731,0.5930004,0.0003207586,0.0003673303,0.0007002998,0.0002529192,0.00008216686,0.006787057],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006519101,"threshold_uncertainty_score":0.03648019,"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","authors":[{"name":"James F. Peters","is_ca":true},{"name":"Andrzej Skowron","is_ca":false},{"name":"Zbigniew Suraj","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006860061,0.001050196,0.001700699,0.00213819,0.0007976457,0.00271364,0.001425308,0.001260424,0.002100427],"category_scores_gemma":[0.01114242,0.0008189112,0.002668361,0.001740457,0.002340555,0.002227422,0.001465756,0.002335862,0.0004455464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001381255,"about_ca_system_score_gemma":0.001410378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001704656,"about_ca_topic_score_gemma":0.001351062,"domain_scores_codex":[0.9944779,0.002318657,0.0004314118,0.0005076682,0.00213431,0.000130122],"domain_scores_gemma":[0.9939256,0.004419249,0.0003574106,0.0006305017,0.0006010107,0.00006615807],"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.00006129074,0.0000634158,0.0004387993,0.0005443511,0.0003112508,0.0002129592,0.0004118432,0.2514895,0.00243251,0.6079609,0.00164185,0.1344313],"study_design_scores_gemma":[0.00006193812,0.0001466644,0.0002270357,0.000143693,0.0001065723,0.0001376303,0.00006964781,0.3899046,0.002204443,0.5896774,0.01725181,0.00006854912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006122855,0.0003749704,0.9974396,0.0001758702,0.0000372787,0.00003618734,0.00001348436,0.00004965473,0.001260636],"genre_scores_gemma":[0.09192211,0.001385782,0.9043838,0.0002061504,0.0001758419,0.0003234399,0.00006454555,0.00004045688,0.001497785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006860061,"threshold_uncertainty_score":0.03627992,"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","authors":[{"name":"Yo-Sub Han","is_ca":false},{"name":"Kai Salomaa","is_ca":true},{"name":"Derick Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481428,0.0006410449,0.001000504,0.001382607,0.001622578,0.004690788,0.001584997,0.001109392,0.004652574],"category_scores_gemma":[0.01821035,0.0005637318,0.001826994,0.00114443,0.003979903,0.009116131,0.002458619,0.002926717,0.0004194905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002336304,"about_ca_system_score_gemma":0.002067626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001234411,"about_ca_topic_score_gemma":0.001226856,"domain_scores_codex":[0.9960608,0.0007293798,0.0004345238,0.0008101932,0.001280552,0.0006845609],"domain_scores_gemma":[0.9563838,0.0345425,0.002634906,0.003420726,0.002065012,0.0009529662],"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.0008735902,0.0002796858,0.006844654,0.0003581643,0.00009338783,0.0004846706,0.001616183,0.1364782,0.02242806,0.8051473,0.001035707,0.02436044],"study_design_scores_gemma":[0.00004680455,0.000159968,0.001119329,0.00002045363,0.00006023524,0.0002450739,0.0002028311,0.2787619,0.01621176,0.7018655,0.001233651,0.0000725046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7848661,0.0003478136,0.2039018,0.0006500295,0.00004384798,0.0001589841,0.0005974952,0.0003803475,0.00905352],"genre_scores_gemma":[0.968072,0.0001759356,0.02938898,0.00004211106,0.00004458184,0.0001669176,0.0004620747,0.0000936594,0.001553762],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004690788,"threshold_uncertainty_score":0.0169512,"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","authors":[{"name":"Andrzej Skowron","is_ca":false},{"name":"Jarosław Stepaniuk","is_ca":false},{"name":"James F. Peters","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003806561,0.001138449,0.001447163,0.002661418,0.0009029692,0.004879209,0.002173245,0.001437402,0.001246774],"category_scores_gemma":[0.01151766,0.0007872532,0.002098517,0.003564929,0.004777908,0.01098115,0.003744184,0.003945693,0.0004364806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00189883,"about_ca_system_score_gemma":0.0008483338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001732,"about_ca_topic_score_gemma":0.00143817,"domain_scores_codex":[0.9964748,0.001370041,0.0002326524,0.0004649209,0.001264491,0.0001930087],"domain_scores_gemma":[0.9948903,0.002879383,0.0006220774,0.001014286,0.0004111759,0.0001827853],"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.00005020902,0.00002993429,0.0005636569,0.0001397588,0.0000636455,0.0002023053,0.0007853585,0.06241195,0.0009290264,0.8984791,0.0009890044,0.035356],"study_design_scores_gemma":[0.00001310506,0.00003120821,0.0002084884,0.00004418677,0.00002407806,0.00009381202,0.0001563595,0.1411944,0.0004764822,0.8531499,0.004588741,0.00001926842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01286275,0.001643038,0.9810005,0.000653733,0.00007204933,0.0000260474,0.00005412341,0.0001144043,0.003573312],"genre_scores_gemma":[0.3415128,0.004147943,0.6501408,0.0002570314,0.0003987632,0.000198355,0.0002292431,0.00006522043,0.003049756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004879209,"threshold_uncertainty_score":0.02013129,"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","authors":[{"name":"Stefan Dobrev","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026936,0.0004227067,0.001003156,0.0004497995,0.001504184,0.001532483,0.001731099,0.001284586,0.001741206],"category_scores_gemma":[0.006198428,0.00043282,0.0005436857,0.0008237228,0.001266636,0.004231945,0.001812208,0.001032904,0.0006557966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005649256,"about_ca_system_score_gemma":0.0004418868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004449622,"about_ca_topic_score_gemma":0.0004937231,"domain_scores_codex":[0.9978854,0.0009360547,0.00008448435,0.0004175558,0.0003187482,0.0003577608],"domain_scores_gemma":[0.9939471,0.004107091,0.0007908118,0.0006076122,0.0002760508,0.0002712729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001487799,0.000303092,0.002655448,0.0005057535,0.00008161342,0.0009979989,0.001030798,0.5628001,0.02020252,0.3146874,0.004306514,0.09094088],"study_design_scores_gemma":[0.0002306976,0.0002677678,0.0004504778,0.00001662376,0.00004007826,0.0002151187,0.0002295294,0.8252045,0.008023503,0.1597006,0.005584781,0.0000363492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1558294,0.0009177585,0.8351229,0.0009325522,0.000111422,0.0001103313,0.00007746018,0.0004633007,0.006434779],"genre_scores_gemma":[0.7186291,0.0007579077,0.2725177,0.0001148698,0.0002009597,0.0002334392,0.0001445346,0.00008022835,0.007321387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0026936,"threshold_uncertainty_score":0.01424527,"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","authors":[{"name":"Carlos Martı́n-Vide","is_ca":false},{"name":"Andrei Păun","is_ca":true},{"name":"Gheorghe Pǎun","is_ca":false},{"name":"Grzegorz Rozenberg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001573648,0.0006483591,0.000872257,0.001952446,0.001336382,0.003034768,0.0009614071,0.001513278,0.003578418],"category_scores_gemma":[0.007495468,0.0005655837,0.001288905,0.0009713596,0.00674746,0.007080286,0.004525806,0.002327678,0.0004629803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002032576,"about_ca_system_score_gemma":0.0007887396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103009,"about_ca_topic_score_gemma":0.0005084079,"domain_scores_codex":[0.9978777,0.0005850299,0.0001526983,0.0004558939,0.0005687224,0.0003599453],"domain_scores_gemma":[0.9964876,0.001838512,0.0003647155,0.0004162438,0.000507039,0.0003859702],"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.000004573589,0.000005903572,0.0001188714,0.00002141793,0.00000469424,0.0000527574,0.0002221286,0.001717952,0.0003803844,0.9958301,0.0001543057,0.001486888],"study_design_scores_gemma":[0.000005532265,0.00000747745,0.00006293922,0.000007833057,0.000002817602,0.00008102314,0.00004574831,0.01233787,0.0002354287,0.986482,0.000722624,0.000008703334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5442711,0.002421387,0.3648739,0.003157289,0.000257349,0.0001623875,0.0002513308,0.0006410174,0.08396439],"genre_scores_gemma":[0.9748975,0.0006828,0.01823173,0.0001641423,0.0001851929,0.00009113443,0.00008136682,0.00008631693,0.005579645],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003578418,"threshold_uncertainty_score":0.01474744,"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","authors":[{"name":"Vladimir Pestov","is_ca":true},{"name":"Aleksandar Stojmirović","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008271027,0.0007039902,0.00137135,0.004366636,0.001886365,0.006316543,0.003609002,0.002762588,0.004232819],"category_scores_gemma":[0.02428553,0.0006403191,0.001673916,0.0080155,0.00609353,0.01793854,0.007531328,0.003384012,0.001795946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002125629,"about_ca_system_score_gemma":0.001339478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009102052,"about_ca_topic_score_gemma":0.0004768056,"domain_scores_codex":[0.9926547,0.003021898,0.0009187161,0.0008780357,0.002203302,0.0003234194],"domain_scores_gemma":[0.9875974,0.004911228,0.0006919561,0.005247691,0.001125535,0.0004262948],"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.00002825979,0.00001936472,0.0001508671,0.00006261852,0.000009112839,0.00004163292,0.0001671342,0.003119667,0.00087108,0.9767411,0.0009711415,0.017818],"study_design_scores_gemma":[0.00002484996,0.00007192872,0.0001147963,0.0000334211,0.000009489726,0.0002264023,0.00008187207,0.04380319,0.001106126,0.9419493,0.01255158,0.00002695427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005549161,0.0008044371,0.9884934,0.001358747,0.00009601165,0.000135859,0.0001587676,0.0001404382,0.003263279],"genre_scores_gemma":[0.165596,0.002180829,0.82688,0.0005377496,0.0004837369,0.0006162525,0.0004626384,0.0001231587,0.003119703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008271027,"threshold_uncertainty_score":0.04374188,"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","authors":[{"name":"James F. Peters","is_ca":true},{"name":"Andrzej Skowron","is_ca":false},{"name":"Jarosław Stepaniuk","is_ca":false},{"name":"Sheela Ramanna","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006399471,0.0006449946,0.0009908029,0.002705407,0.003070698,0.006947275,0.002439123,0.002989308,0.004210871],"category_scores_gemma":[0.007562318,0.0008447104,0.002389726,0.002245201,0.0144599,0.0177568,0.00544868,0.006978091,0.001020506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004773016,"about_ca_system_score_gemma":0.003234024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005168704,"about_ca_topic_score_gemma":0.002840059,"domain_scores_codex":[0.9942275,0.002478765,0.0003995384,0.000670931,0.001850339,0.0003729055],"domain_scores_gemma":[0.9960471,0.001625459,0.0002709814,0.0009914471,0.0008146016,0.0002505074],"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.000002302656,0.000004035722,0.00002937514,0.00001255319,0.000002240354,0.00001286165,0.0002714466,0.0004800228,0.00005824831,0.9972819,0.0002929648,0.001552014],"study_design_scores_gemma":[0.000004875756,0.000005287442,0.0000598492,0.00002788675,0.000004442908,0.00003619408,0.0002200129,0.004880843,0.0001054142,0.9582229,0.03642515,0.000007102475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005919097,0.001701168,0.9059964,0.006529739,0.0004219617,0.00009435185,0.0001924935,0.000275673,0.07886919],"genre_scores_gemma":[0.3385433,0.003551403,0.6304702,0.002851381,0.0008995708,0.0006107372,0.0006965073,0.0004432737,0.02193365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006947275,"threshold_uncertainty_score":0.03463084,"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","authors":[{"name":"Yiyu Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005427571,0.0005826261,0.001199174,0.002387852,0.001164769,0.004626737,0.0009037873,0.001152921,0.001876177],"category_scores_gemma":[0.009030891,0.000410707,0.001467041,0.002399023,0.01059924,0.006745354,0.003250977,0.003136984,0.0004076687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001487053,"about_ca_system_score_gemma":0.0007353766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005325325,"about_ca_topic_score_gemma":0.0002914028,"domain_scores_codex":[0.9936128,0.003405136,0.0003338515,0.000749676,0.001637301,0.0002611783],"domain_scores_gemma":[0.9957063,0.002974587,0.0003644146,0.0003915661,0.0004081083,0.0001550778],"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.000007128485,0.00000291223,0.0000480252,0.00002541065,0.000006752333,0.00003186951,0.0001772252,0.001560626,0.0001239801,0.9944015,0.000222895,0.003391707],"study_design_scores_gemma":[0.000004986216,0.00001517969,0.0000598775,0.0000174043,0.000004669078,0.00006099998,0.0000656809,0.005957561,0.0001174922,0.988667,0.005020247,0.000008795368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02337516,0.00746713,0.900131,0.002828611,0.0006988568,0.00008784805,0.0001246676,0.000108235,0.06517839],"genre_scores_gemma":[0.7304915,0.005196931,0.2556496,0.0009500229,0.001394048,0.0003209999,0.0001479628,0.00007663387,0.005772353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005427571,"threshold_uncertainty_score":0.02870405,"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","authors":[{"name":"Waldemar W. Koczkodaj","is_ca":true},{"name":"Marek Kosiek","is_ca":true},{"name":"Jacek Szybowski","is_ca":true},{"name":"Xu Ding","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05503623,0.001532959,0.003099123,0.003824543,0.001528822,0.003170507,0.004537932,0.001929433,0.002979293],"category_scores_gemma":[0.3057324,0.001226079,0.003289276,0.002182304,0.004612643,0.006703517,0.005814216,0.007078205,0.000746486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00229083,"about_ca_system_score_gemma":0.002599037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001447192,"about_ca_topic_score_gemma":0.0008384779,"domain_scores_codex":[0.9271894,0.04945045,0.002691087,0.00646732,0.01310554,0.001096243],"domain_scores_gemma":[0.6270665,0.3260686,0.00998113,0.0204775,0.0151177,0.001288626],"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.001036981,0.0003269383,0.01164575,0.001650066,0.001098649,0.000369921,0.002764605,0.3418836,0.006116688,0.3640958,0.002910042,0.2661009],"study_design_scores_gemma":[0.0001057439,0.0004783018,0.002218148,0.000177331,0.0001315557,0.0004958359,0.0003048888,0.5910509,0.006109281,0.3958212,0.002988896,0.0001178826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01211195,0.0003077617,0.9856017,0.0002174313,0.00004214033,0.0001709997,0.00003408936,0.0001478139,0.001366162],"genre_scores_gemma":[0.2653607,0.0002396064,0.7319077,0.0002331034,0.00008017064,0.0007910296,0.0002110427,0.0002154748,0.000961166],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05503623,"threshold_uncertainty_score":0.2910629,"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","authors":[{"name":"James F. Peters","is_ca":true},{"name":"Christopher J. Henry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003365096,0.001109556,0.001534832,0.000683462,0.0004477375,0.001713375,0.001584162,0.001323917,0.00260134],"category_scores_gemma":[0.0108511,0.0004022813,0.0009909661,0.0006734062,0.002084007,0.001970162,0.001867015,0.002282951,0.0003739345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001611748,"about_ca_system_score_gemma":0.001095765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002351146,"about_ca_topic_score_gemma":0.001451193,"domain_scores_codex":[0.9976164,0.00132013,0.0001209457,0.0002651652,0.0005367345,0.0001407098],"domain_scores_gemma":[0.9946082,0.00400992,0.0003714943,0.0004038583,0.0004175708,0.0001889484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009449006,0.00006826509,0.0005869644,0.0001547589,0.00009829104,0.00006860343,0.0001532294,0.7401604,0.0006032428,0.2140011,0.0006918901,0.04331873],"study_design_scores_gemma":[0.00002487826,0.00006507002,0.00005871353,0.00001545193,0.00001016523,0.00001627915,0.00001279931,0.9232623,0.0002109039,0.0750137,0.001301017,0.000008798825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006850131,0.0005333083,0.9891722,0.0002925394,0.00005644238,0.00004223712,0.0000201269,0.0001117698,0.002921218],"genre_scores_gemma":[0.707848,0.001144207,0.2847809,0.0002358625,0.0002034771,0.0003927652,0.0001151476,0.00006528118,0.005214273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003365096,"threshold_uncertainty_score":0.01779658,"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","authors":[{"name":"Ryszard Janicki","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01488973,0.001382246,0.00201168,0.004912436,0.001503285,0.003879861,0.002545316,0.0009143541,0.005499679],"category_scores_gemma":[0.04993251,0.0006005567,0.002247052,0.004951316,0.00291097,0.004928384,0.003770071,0.003367193,0.001892863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001570106,"about_ca_system_score_gemma":0.003172007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007043593,"about_ca_topic_score_gemma":0.001216424,"domain_scores_codex":[0.9652352,0.0218829,0.001683763,0.002270533,0.008369464,0.0005581609],"domain_scores_gemma":[0.9673762,0.02209328,0.001581872,0.003417388,0.005000472,0.0005306785],"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.0002396938,0.000158957,0.001601726,0.001110531,0.0002526418,0.0002257677,0.0007714238,0.0408708,0.006179597,0.5918558,0.004023791,0.3527093],"study_design_scores_gemma":[0.00004028188,0.0005234341,0.00162279,0.0001690471,0.00008039051,0.0002997073,0.0003018918,0.2061874,0.005226966,0.7719028,0.01352895,0.0001163017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002876866,0.0001582773,0.9947009,0.0001024767,0.00005576339,0.0001400919,0.0001093128,0.0001146261,0.001741736],"genre_scores_gemma":[0.08421701,0.0002921208,0.9119893,0.00008331041,0.00008608557,0.0006420626,0.0006339588,0.00008396158,0.001972212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01488973,"threshold_uncertainty_score":0.07874537,"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","authors":[{"name":"Lila Kari","is_ca":true},{"name":"Elena Losseva","is_ca":true},{"name":"Stavros Konstantinidis","is_ca":true},{"name":"Petr Sosı́k","is_ca":false},{"name":"G. Thierrin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371516,0.0005149973,0.0004901413,0.001956253,0.001221833,0.002489157,0.001281667,0.0006562912,0.004302226],"category_scores_gemma":[0.005427391,0.0004213282,0.002072233,0.001609436,0.002895772,0.004724105,0.001666065,0.001758752,0.0005766944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001845317,"about_ca_system_score_gemma":0.001399671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562062,"about_ca_topic_score_gemma":0.0009726153,"domain_scores_codex":[0.9981616,0.0004460579,0.0001425177,0.0004588793,0.0005519591,0.000238961],"domain_scores_gemma":[0.9956995,0.002816155,0.0003285527,0.0004075433,0.0006131278,0.0001350688],"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.00005984749,0.00005880613,0.0005463327,0.0001889859,0.00002427681,0.0002143025,0.0006704387,0.01274035,0.00634775,0.9434101,0.001574293,0.03416456],"study_design_scores_gemma":[0.00002058332,0.00005506671,0.0002363968,0.00005665164,0.00003108715,0.0002778092,0.0002182116,0.06538416,0.005486469,0.9166525,0.01154861,0.00003246192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05098189,0.0009239321,0.9365433,0.001368303,0.0001008746,0.0001117009,0.0004895622,0.0006320042,0.008848432],"genre_scores_gemma":[0.6316996,0.0008173653,0.3581747,0.0004733998,0.0002709411,0.0002086708,0.001209856,0.000198975,0.006946505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004302226,"threshold_uncertainty_score":0.01439238,"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","authors":[{"name":"Lucian Ilie","is_ca":true},{"name":"William F. Smyth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313125,0.0004035546,0.001125853,0.001859572,0.0008863376,0.001624263,0.00131054,0.001058155,0.002823926],"category_scores_gemma":[0.01302399,0.0004616996,0.0006690415,0.002318421,0.001635463,0.005284712,0.001597066,0.001742025,0.0006608092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006109314,"about_ca_system_score_gemma":0.0005589427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002234021,"about_ca_topic_score_gemma":0.0002469822,"domain_scores_codex":[0.9983962,0.0004362924,0.0001422478,0.0005456797,0.0003642666,0.0001152488],"domain_scores_gemma":[0.9907346,0.006300347,0.0009315573,0.001246573,0.0005406629,0.0002461825],"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.0002872954,0.00009493139,0.003406707,0.00067669,0.00006091563,0.0003192596,0.0004423302,0.03307083,0.01165638,0.6910986,0.003916816,0.2549694],"study_design_scores_gemma":[0.00001655324,0.00006016192,0.0007697631,0.00005929838,0.00002118006,0.0006329946,0.0001122548,0.06099059,0.008313335,0.9227368,0.006259569,0.00002738718],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1193038,0.002732041,0.8671653,0.0006760309,0.0001122154,0.00005474637,0.000451399,0.000379562,0.009124887],"genre_scores_gemma":[0.5356182,0.001657033,0.4573568,0.0002451814,0.0002661819,0.0001206802,0.0008528887,0.0002284339,0.00365456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002823926,"threshold_uncertainty_score":0.009446979,"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","authors":[{"name":"Barbara Fryc","is_ca":false},{"name":"Krzysztof Pancerz","is_ca":false},{"name":"James F. Peters","is_ca":true},{"name":"Zbigniew Suraj","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055318,0.001287594,0.001093679,0.001885169,0.001034174,0.002611959,0.001466669,0.001220719,0.004112184],"category_scores_gemma":[0.005075841,0.0004949433,0.002071759,0.002418018,0.002478624,0.004679556,0.00159669,0.002310165,0.001071141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001946552,"about_ca_system_score_gemma":0.001127091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006168825,"about_ca_topic_score_gemma":0.00453016,"domain_scores_codex":[0.9981042,0.0006103444,0.0001978805,0.0002930118,0.0006945746,0.00009989915],"domain_scores_gemma":[0.9983291,0.001048842,0.00013323,0.0001158055,0.0003235937,0.00004943845],"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.0001067376,0.00005339153,0.0001750386,0.0003008343,0.00008469108,0.0003303502,0.0004984483,0.1225474,0.004067568,0.7925141,0.001401896,0.07791945],"study_design_scores_gemma":[0.0000319343,0.00005780758,0.00007254332,0.00007624301,0.00003816077,0.0001508877,0.00006272858,0.4184559,0.002761601,0.5661968,0.01204361,0.00005174494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001828557,0.0005305752,0.9939463,0.0001670005,0.00008537225,0.00004165436,0.00003001759,0.00009806458,0.003272553],"genre_scores_gemma":[0.1336618,0.002312144,0.8588326,0.0002297824,0.0002436199,0.0002090226,0.0001816043,0.00007396294,0.004255439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006168825,"threshold_uncertainty_score":0.01615828,"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","authors":[{"name":"Ryszard Janicki","is_ca":true},{"name":"Alan Wassyng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004806695,0.0009714262,0.0008610504,0.003482382,0.002177569,0.007826112,0.002052954,0.001789174,0.01059403],"category_scores_gemma":[0.008609201,0.0007845026,0.001617468,0.005056854,0.005180103,0.01565675,0.003038924,0.003026577,0.003521316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002086675,"about_ca_system_score_gemma":0.0015473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002388225,"about_ca_topic_score_gemma":0.001085286,"domain_scores_codex":[0.9951056,0.001407611,0.0006642177,0.0009767349,0.001439003,0.0004067494],"domain_scores_gemma":[0.9957939,0.001524334,0.0005713236,0.0008009745,0.001143001,0.0001664277],"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.000008521048,0.000004588119,0.00003253639,0.0000410276,0.00000408087,0.00002681447,0.0002221757,0.0003481191,0.0001996823,0.9911743,0.001419997,0.006518101],"study_design_scores_gemma":[0.00001230242,0.00001246552,0.00005750933,0.0000700379,0.00001175821,0.0001762505,0.000162721,0.003732889,0.0006701038,0.9311385,0.06393677,0.00001875872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007275622,0.005412737,0.9321905,0.002753301,0.0006072092,0.0001771635,0.001619726,0.001159944,0.04880381],"genre_scores_gemma":[0.2615665,0.01011003,0.6930079,0.002678986,0.001756228,0.001104174,0.003606434,0.001047662,0.02512207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01059403,"threshold_uncertainty_score":0.03544062,"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","authors":[{"name":"Bo Cui","is_ca":true},{"name":"Lila Kari","is_ca":true},{"name":"Shinnosuke Seki","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161762,0.0005390109,0.0005493022,0.002749906,0.002067785,0.001593284,0.000723549,0.001054691,0.002756342],"category_scores_gemma":[0.006638446,0.0003735092,0.0007888396,0.002575733,0.002620744,0.004010832,0.002057314,0.002128977,0.0009030225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512561,"about_ca_system_score_gemma":0.001242872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002149401,"about_ca_topic_score_gemma":0.00114442,"domain_scores_codex":[0.9981427,0.000246551,0.0001430204,0.0005105552,0.0006493659,0.0003077825],"domain_scores_gemma":[0.9940091,0.002310696,0.001023809,0.001009987,0.001227531,0.0004189157],"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.00003835015,0.00001558894,0.0007344791,0.00008090462,0.000008835334,0.0001603519,0.0004669636,0.00399021,0.001659697,0.9739642,0.001119077,0.01776154],"study_design_scores_gemma":[0.000008544954,0.00003952349,0.0007075303,0.00006284311,0.00001053661,0.0007146375,0.0002136752,0.02025121,0.001811493,0.9532792,0.02285949,0.00004131627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2683558,0.00770148,0.6147416,0.001799755,0.0005642968,0.0001507267,0.001383164,0.0006699836,0.1046331],"genre_scores_gemma":[0.8538901,0.004427296,0.1201664,0.000932976,0.00104372,0.0002942016,0.0009232993,0.0002699277,0.01805221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002756342,"threshold_uncertainty_score":0.01097441,"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","authors":[{"name":"Yuan Gao","is_ca":true},{"name":"Kai Salomaa","is_ca":true},{"name":"Sheng Yü","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001772932,0.0005219099,0.001080861,0.001858612,0.001078549,0.003650979,0.001590972,0.0008993615,0.003609441],"category_scores_gemma":[0.01556091,0.0004288157,0.001998301,0.001473834,0.002143595,0.007904277,0.00219047,0.002704683,0.0003068498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003295552,"about_ca_system_score_gemma":0.001461275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003076832,"about_ca_topic_score_gemma":0.00206663,"domain_scores_codex":[0.997155,0.0005049483,0.000275354,0.0006450575,0.0009380369,0.00048174],"domain_scores_gemma":[0.9796095,0.01492937,0.00151849,0.00183446,0.001463484,0.0006447191],"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.0002488105,0.00007896665,0.003100567,0.0002424273,0.00008766958,0.0002208606,0.0007159072,0.2238046,0.005511481,0.7444695,0.0007339091,0.02078525],"study_design_scores_gemma":[0.00001515474,0.00003905312,0.0007043053,0.00002416301,0.00003960533,0.00007299097,0.00007731766,0.3963008,0.003117377,0.5982487,0.001331337,0.00002925406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5069995,0.0005769541,0.4814143,0.0007331057,0.00005187128,0.00008934774,0.001150092,0.0005082419,0.008476642],"genre_scores_gemma":[0.96965,0.0002973131,0.027241,0.00004798375,0.00003819525,0.0001113415,0.0006783691,0.00008495527,0.001851008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003650979,"threshold_uncertainty_score":0.02391106,"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","authors":[{"name":"James F. Peters","is_ca":true},{"name":"Sheela Ramanna","is_ca":true},{"name":"Maciej Borkowski","is_ca":true},{"name":"Andrzej Skowron","is_ca":false},{"name":"Zbigniew Suraj","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064602,0.001057005,0.001012629,0.001031018,0.0008092773,0.00265433,0.001807528,0.001372411,0.001857407],"category_scores_gemma":[0.002938993,0.0006132507,0.002271318,0.000946768,0.002309544,0.003983301,0.001380063,0.001708032,0.0004426991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001864882,"about_ca_system_score_gemma":0.001429746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007658405,"about_ca_topic_score_gemma":0.004970839,"domain_scores_codex":[0.9985746,0.0004384374,0.0001037235,0.0002903678,0.0004316181,0.0001612588],"domain_scores_gemma":[0.9985104,0.0008194396,0.0002182401,0.0001780731,0.000175753,0.0000980758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009511892,0.00003558869,0.0004111934,0.00007254466,0.00004964168,0.000191028,0.0002160759,0.5949934,0.001752941,0.3931925,0.0003399706,0.008650078],"study_design_scores_gemma":[0.0000198809,0.00003871146,0.0001024526,0.00001547274,0.00002901543,0.00004059136,0.00003074452,0.8504816,0.0009527575,0.1460586,0.002209081,0.00002110339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008435871,0.0002640717,0.9879158,0.0001592287,0.00003986085,0.00003602185,0.0000786308,0.0001897159,0.002880841],"genre_scores_gemma":[0.579042,0.001128469,0.4111581,0.0001596546,0.0001144008,0.0003409975,0.0003504003,0.00008556599,0.00762042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007658405,"threshold_uncertainty_score":0.01522762,"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","authors":[{"name":"Wendy MacCaull","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005870749,0.0009556131,0.0009449364,0.002459834,0.002716659,0.004557424,0.002156648,0.001815059,0.01503],"category_scores_gemma":[0.01230219,0.00124485,0.002429775,0.001770563,0.002758605,0.008897413,0.005442637,0.004700631,0.004051341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002421627,"about_ca_system_score_gemma":0.003927587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00258111,"about_ca_topic_score_gemma":0.002736682,"domain_scores_codex":[0.995812,0.001102474,0.000500523,0.0007989552,0.001482343,0.0003036726],"domain_scores_gemma":[0.989665,0.007042762,0.0003985478,0.00103713,0.001605531,0.0002510433],"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.00004025575,0.00003986253,0.0001716325,0.0003399977,0.00003884265,0.0003562813,0.0004363572,0.003702295,0.003285836,0.9303625,0.01138763,0.0498386],"study_design_scores_gemma":[0.00009595595,0.00004788498,0.0001387896,0.0001380138,0.00008993319,0.0003594653,0.00008612846,0.03618415,0.006720068,0.8673382,0.08873936,0.00006205688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002652671,0.0005630456,0.9835686,0.001414218,0.0003152132,0.0002024663,0.0006701011,0.002014462,0.008599229],"genre_scores_gemma":[0.09887301,0.001100434,0.885735,0.001167188,0.0005065593,0.0004847725,0.001734204,0.0006630214,0.009735723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01503,"threshold_uncertainty_score":0.05028033,"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","authors":[{"name":"Manish Joshi","is_ca":false},{"name":"Pawan Lingras","is_ca":true},{"name":"C. Raghavendra Rao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007892869,0.0007329048,0.001168546,0.007311843,0.001295075,0.005890379,0.0008208734,0.001272183,0.003204848],"category_scores_gemma":[0.07463644,0.0005052562,0.0006896697,0.008041551,0.003285688,0.003473873,0.003296097,0.001416288,0.001169203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001436283,"about_ca_system_score_gemma":0.001272116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002466276,"about_ca_topic_score_gemma":0.002048273,"domain_scores_codex":[0.9889868,0.004952782,0.0004385407,0.001247361,0.003970394,0.0004040111],"domain_scores_gemma":[0.9674127,0.02026607,0.002737499,0.004260183,0.004867384,0.0004561963],"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.0003932804,0.0001106898,0.03857959,0.0008592627,0.0005686783,0.0004564019,0.003395065,0.08607597,0.003314669,0.6520604,0.008066201,0.2061198],"study_design_scores_gemma":[0.00002190415,0.0001176989,0.03299918,0.0002771722,0.0001283307,0.0006394576,0.002483878,0.1286469,0.002531164,0.8110255,0.02095759,0.000171214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1637185,0.008221031,0.7725074,0.004132018,0.0005272608,0.0003040789,0.0009763307,0.0006357681,0.04897752],"genre_scores_gemma":[0.8196768,0.002349968,0.1734005,0.0004003021,0.0003827257,0.0001450672,0.0006340404,0.0001113345,0.002899228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007892869,"threshold_uncertainty_score":0.04174197,"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)","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170506,0.0006715831,0.0006497168,0.0006260513,0.0005632518,0.001259248,0.0006005358,0.001205258,0.001991803],"category_scores_gemma":[0.001551063,0.0002236129,0.000681566,0.0004691714,0.001468739,0.001215893,0.001050001,0.001114174,0.0002402282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007890268,"about_ca_system_score_gemma":0.000489081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00219187,"about_ca_topic_score_gemma":0.001695525,"domain_scores_codex":[0.9998237,0.00005802588,0.000008489709,0.00003136216,0.00004278817,0.00003565848],"domain_scores_gemma":[0.9996921,0.0001126134,0.00006994612,0.00002394193,0.00006497679,0.00003643908],"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.00006662833,0.00005594671,0.001134817,0.0002260819,0.00005714818,0.001146102,0.0004434526,0.1555087,0.01914993,0.8102527,0.001435705,0.01052277],"study_design_scores_gemma":[0.00002108536,0.00003626761,0.0004397952,0.00002220693,0.00001629826,0.0002382446,0.0001935598,0.8426412,0.002158291,0.1520548,0.00215125,0.00002699852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3709483,0.003246061,0.5809398,0.002117321,0.0003397112,0.0000612131,0.0001396357,0.0001701414,0.04203781],"genre_scores_gemma":[0.9721819,0.0009133255,0.01522311,0.0001380484,0.00009866591,0.00004544554,0.00005946931,0.00003321679,0.01130684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00219187,"threshold_uncertainty_score":0.006663263,"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","authors":[{"name":"Waldemar W. Koczkodaj","is_ca":true},{"name":"Ryszard Smarzewski","is_ca":false},{"name":"Jacek Szybowski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02120677,0.001949229,0.001745226,0.003085814,0.001282238,0.003885766,0.002611652,0.001269785,0.004547141],"category_scores_gemma":[0.07836735,0.001062477,0.002027476,0.003983079,0.006094834,0.007540137,0.006470312,0.00377778,0.001184776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001690009,"about_ca_system_score_gemma":0.00288968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001922675,"about_ca_topic_score_gemma":0.001170369,"domain_scores_codex":[0.9709943,0.01934388,0.001134427,0.003384663,0.004467936,0.0006748113],"domain_scores_gemma":[0.9347693,0.04933077,0.004640115,0.004620524,0.005708396,0.0009309006],"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.0001786057,0.00007461799,0.001108682,0.000391803,0.0001532299,0.0001732476,0.0006884152,0.06749173,0.001556363,0.8539834,0.0013964,0.07280351],"study_design_scores_gemma":[0.00002608788,0.0001924789,0.0006188259,0.0001354965,0.00002970146,0.0001494598,0.0001458864,0.2100849,0.0008924457,0.784223,0.003440685,0.00006096163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007255085,0.0002728366,0.9911389,0.0001250978,0.00002823571,0.00006716006,0.0001010084,0.00004476923,0.0009668946],"genre_scores_gemma":[0.1195843,0.00143291,0.8737242,0.0003009271,0.0002324107,0.0009749857,0.001105458,0.000176584,0.002468335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02120677,"threshold_uncertainty_score":0.1121534,"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","authors":[{"name":"D. E. Daykin","is_ca":false},{"name":"Jacqueline W. Daykin","is_ca":false},{"name":"W.F. Smyth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170118,0.0007389244,0.001170847,0.003417971,0.003641571,0.003494391,0.001316788,0.001184267,0.01445376],"category_scores_gemma":[0.008210031,0.0008936849,0.001733035,0.00334159,0.00365359,0.006303821,0.003088047,0.001433441,0.001886881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002012397,"about_ca_system_score_gemma":0.0008201204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001175807,"about_ca_topic_score_gemma":0.001153241,"domain_scores_codex":[0.9974484,0.0004755683,0.0002572569,0.0007063722,0.0005821242,0.0005301286],"domain_scores_gemma":[0.9946398,0.003008626,0.0006794309,0.0006752161,0.0006349829,0.0003619777],"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.00006244556,0.00002600816,0.0009255228,0.00012103,0.00001617544,0.0003218823,0.0004482351,0.001716893,0.0008586872,0.9668828,0.002928094,0.02569211],"study_design_scores_gemma":[0.0000203265,0.00002741126,0.0003683525,0.00006666424,0.00001613926,0.0008111355,0.0001829244,0.004700867,0.001088992,0.9771966,0.01548561,0.00003501082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2751786,0.004262846,0.6305194,0.001621339,0.0003888644,0.0002452804,0.002211615,0.001036577,0.08453548],"genre_scores_gemma":[0.7430667,0.002220731,0.2196566,0.0007675355,0.0005867342,0.0007339349,0.002865558,0.0004342442,0.02966802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01445376,"threshold_uncertainty_score":0.04835266,"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","authors":[{"name":"Piotr Synak","is_ca":false},{"name":"Jan G. Bazan","is_ca":false},{"name":"Andrzej Skowron","is_ca":false},{"name":"James F. Peters","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002205756,0.0008577556,0.0009242459,0.001407556,0.0007001491,0.003155869,0.002062433,0.001147761,0.00257059],"category_scores_gemma":[0.01108398,0.0004177926,0.00125311,0.002690841,0.001595039,0.007658203,0.002147433,0.001335729,0.0004253744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231693,"about_ca_system_score_gemma":0.0006332555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004706594,"about_ca_topic_score_gemma":0.003771391,"domain_scores_codex":[0.9983492,0.0003993723,0.0001826907,0.0003772447,0.0005712316,0.0001202555],"domain_scores_gemma":[0.9953712,0.002655139,0.0005690597,0.0009396096,0.0003519127,0.0001130467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002372504,0.00008260574,0.002004642,0.0005149553,0.0002067005,0.0006803075,0.0007110162,0.513319,0.003714557,0.3139472,0.003079712,0.1615021],"study_design_scores_gemma":[0.0000101761,0.00003298001,0.0004022362,0.00003212166,0.00004228442,0.0001771539,0.0001185378,0.7015349,0.001769451,0.2914338,0.004428539,0.00001779403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01155479,0.000830583,0.9851231,0.0002751848,0.00003982311,0.00002194849,0.0001643346,0.0002455513,0.001744721],"genre_scores_gemma":[0.4650509,0.002824068,0.5277828,0.0001585281,0.0001664739,0.0001152402,0.0009178821,0.00008022437,0.002903856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004706594,"threshold_uncertainty_score":0.01166528,"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","authors":[{"name":"Pawan Lingras","is_ca":true},{"name":"Min Chen","is_ca":false},{"name":"Duoqian Miao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00413077,0.0007852886,0.001841856,0.001392159,0.0005420074,0.002556304,0.001531069,0.001073133,0.00307658],"category_scores_gemma":[0.01111382,0.0005461403,0.001230815,0.001055027,0.00110306,0.002916019,0.000940605,0.001163501,0.0005549751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001454638,"about_ca_system_score_gemma":0.001323026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001468734,"about_ca_topic_score_gemma":0.002178611,"domain_scores_codex":[0.996111,0.001748028,0.0002761051,0.000513638,0.001116676,0.0002346373],"domain_scores_gemma":[0.9924388,0.004535498,0.001002689,0.0007474874,0.001058784,0.0002168318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003327386,0.0002092038,0.003088236,0.0004341654,0.0002334064,0.0004526919,0.0003416674,0.736938,0.001964919,0.1428028,0.005095311,0.1081069],"study_design_scores_gemma":[0.0000229256,0.00008426917,0.000854807,0.00004180842,0.00003552525,0.00008256119,0.00007797601,0.8609029,0.0008629079,0.1355017,0.001500026,0.00003250927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0742783,0.0004549221,0.9157019,0.001053809,0.00006320333,0.0002044689,0.0007141648,0.0002272127,0.007302052],"genre_scores_gemma":[0.8016043,0.0004036114,0.1942383,0.0001058552,0.00009832442,0.0002546647,0.000696852,0.00003797308,0.002560034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00413077,"threshold_uncertainty_score":0.02184582,"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","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Ewa Orłowska","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002660732,0.0004336267,0.0007453336,0.001711128,0.001326365,0.003496085,0.0007396925,0.000882497,0.003666352],"category_scores_gemma":[0.004883672,0.0003618776,0.001630265,0.00111257,0.003904694,0.005808796,0.002991549,0.003312407,0.0006956371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001531101,"about_ca_system_score_gemma":0.0007330481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006413226,"about_ca_topic_score_gemma":0.0004114461,"domain_scores_codex":[0.9973338,0.0007414491,0.0001728765,0.0004581939,0.001026012,0.0002677615],"domain_scores_gemma":[0.9972923,0.001214261,0.0002711319,0.0003685796,0.0005770296,0.0002765478],"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.000007325442,0.0000118528,0.00005063678,0.00001570335,0.000005048771,0.00003269755,0.00007961249,0.0004127735,0.0003691275,0.997042,0.0002417975,0.00173138],"study_design_scores_gemma":[0.000009508174,0.00001713562,0.00007158461,0.000009082408,0.000005412951,0.00007971802,0.00004390661,0.005767318,0.0005301309,0.9898246,0.003634131,0.000007368089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1028565,0.00190417,0.8046052,0.002209147,0.0004746009,0.0001170296,0.0003063126,0.0002407946,0.0872862],"genre_scores_gemma":[0.8627825,0.001118071,0.1225288,0.0007569826,0.0006477168,0.0001433843,0.0004023704,0.0000790984,0.01154111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003666352,"threshold_uncertainty_score":0.01407146,"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","authors":[{"name":"Xiaoxue Piao","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009127363,0.0005653783,0.0005678377,0.0008796305,0.0009209539,0.003235671,0.001271956,0.001052324,0.007859406],"category_scores_gemma":[0.005079811,0.0004140926,0.001864186,0.0008096529,0.002191433,0.006449325,0.002022353,0.002043029,0.0009703868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093043,"about_ca_system_score_gemma":0.0005921969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008583795,"about_ca_topic_score_gemma":0.0009596038,"domain_scores_codex":[0.9980081,0.0004474587,0.0001883425,0.0003863301,0.0006674737,0.0003023623],"domain_scores_gemma":[0.9968404,0.001430188,0.0002863103,0.0008795603,0.0003726797,0.0001909571],"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.00007092432,0.00005498406,0.0002704506,0.00005759165,0.00002120057,0.0003792359,0.0004081354,0.02349182,0.004829659,0.9608497,0.0006208898,0.008945449],"study_design_scores_gemma":[0.00001955551,0.00003787657,0.0001282274,0.00001421251,0.00001861725,0.0001013607,0.00008485741,0.08878688,0.005017692,0.9036835,0.002083731,0.0000234751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2642093,0.0003317308,0.7028442,0.0005290448,0.0002695849,0.0001508544,0.0004877093,0.001515289,0.02966233],"genre_scores_gemma":[0.9272954,0.0001470332,0.06472909,0.0001284041,0.00007225268,0.000128275,0.0004436705,0.0002747304,0.00678121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007859406,"threshold_uncertainty_score":0.02629232,"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","authors":[{"name":"Witold Pedrycz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003953097,0.0008242002,0.001136835,0.003288402,0.0008022116,0.008010482,0.001416773,0.001239291,0.002666144],"category_scores_gemma":[0.01164208,0.0005801186,0.001170374,0.002977909,0.005721242,0.00818935,0.002769528,0.002661012,0.0004392507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001865791,"about_ca_system_score_gemma":0.001113907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001467851,"about_ca_topic_score_gemma":0.0009367304,"domain_scores_codex":[0.9967242,0.001242088,0.0003976389,0.0005398927,0.0009209258,0.0001752254],"domain_scores_gemma":[0.9959394,0.0019295,0.0004646574,0.000982668,0.0005193091,0.0001645128],"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.00004124864,0.00001321762,0.0003072596,0.0002023222,0.00003255421,0.0001462924,0.0005194079,0.01063309,0.001256459,0.962226,0.001517774,0.02310441],"study_design_scores_gemma":[0.00001270144,0.00001832829,0.0004241218,0.0001299181,0.00003096144,0.00009899217,0.0003080148,0.02756935,0.0008041125,0.9574013,0.01317024,0.0000319084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01110798,0.003424729,0.9674562,0.003282109,0.0002886175,0.0001115184,0.0003700512,0.0002739438,0.01368472],"genre_scores_gemma":[0.3820864,0.005978882,0.6052474,0.0008113888,0.0006750936,0.0004419441,0.0004780098,0.0001652557,0.004115701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008010482,"threshold_uncertainty_score":0.02090621,"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","authors":[{"name":"Ryszard Janicki","is_ca":true},{"name":"Jetty Kleijn","is_ca":false},{"name":"Maciej Koutny","is_ca":false},{"name":"Łukasz Mikulski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001560694,0.0007186702,0.0004528698,0.002669617,0.00103057,0.002465358,0.0008704694,0.000902573,0.003174098],"category_scores_gemma":[0.008410121,0.0005543304,0.0008613917,0.001712702,0.002992021,0.005111313,0.002310282,0.001133105,0.0003770981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000887309,"about_ca_system_score_gemma":0.0007866248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001471601,"about_ca_topic_score_gemma":0.00111373,"domain_scores_codex":[0.9974313,0.0006994015,0.0002815239,0.0004582756,0.000848173,0.0002813471],"domain_scores_gemma":[0.9939142,0.00315864,0.0009630869,0.0009527103,0.0007319215,0.0002795991],"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.00008215725,0.00003653488,0.002491652,0.0001374097,0.00003152124,0.0007395736,0.001689109,0.02721529,0.004623937,0.9347091,0.0004246673,0.02781912],"study_design_scores_gemma":[0.00002004132,0.0000870123,0.001010872,0.00008810003,0.00003009001,0.0005969247,0.0004813795,0.0545412,0.004534193,0.9210785,0.01749681,0.00003493692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1233708,0.001319633,0.8571363,0.0002504447,0.00007400703,0.0002896086,0.0005861245,0.0006403239,0.01633274],"genre_scores_gemma":[0.8209342,0.0008523397,0.1700421,0.0001141843,0.0001923169,0.0004169747,0.0008156404,0.0001592596,0.006473039],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003174098,"threshold_uncertainty_score":0.01061839,"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","authors":[{"name":"Gösta Grahne","is_ca":true},{"name":"Alex Thomo","is_ca":true},{"name":"William W. Wadge","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008802709,0.0008634038,0.001261357,0.001966679,0.001460697,0.003862444,0.002728246,0.001505936,0.005668126],"category_scores_gemma":[0.03033112,0.0006345575,0.001358714,0.004211531,0.002783849,0.01781515,0.004108735,0.002428568,0.001250715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001407509,"about_ca_system_score_gemma":0.001838634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002482734,"about_ca_topic_score_gemma":0.002144223,"domain_scores_codex":[0.9849597,0.004911719,0.001696022,0.002835277,0.004645127,0.0009521791],"domain_scores_gemma":[0.9770122,0.01167754,0.001356595,0.005538059,0.003788224,0.0006273487],"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.0003055755,0.00009092991,0.001500284,0.0003378485,0.00005862501,0.0004588162,0.001297991,0.01177834,0.004391636,0.8807048,0.006641774,0.09243347],"study_design_scores_gemma":[0.00004328638,0.000139547,0.0002799067,0.00005789917,0.0000723218,0.0007514618,0.0005455532,0.07194947,0.006011433,0.876397,0.0436737,0.00007839512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0220536,0.0004215851,0.9670463,0.0008878092,0.0001043377,0.0002733768,0.0009895598,0.001093142,0.007130343],"genre_scores_gemma":[0.3591511,0.0009139389,0.6253287,0.001305393,0.0003033324,0.0006057512,0.002921184,0.0005853525,0.008885223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008802709,"threshold_uncertainty_score":0.04655373,"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","authors":[{"name":"Alicja Wieczorkowska","is_ca":false},{"name":"Elżbieta Kubera","is_ca":false},{"name":"Agnieszka Kubik-Komar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611619,0.0007538343,0.001235826,0.0009408802,0.0003029029,0.0006891526,0.0003978162,0.0008008525,0.001270899],"category_scores_gemma":[0.006403752,0.0002126044,0.0004716581,0.0007475907,0.0004171211,0.001092937,0.0004869101,0.0004967466,0.0004744471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002442445,"about_ca_system_score_gemma":0.0001662439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008195805,"about_ca_topic_score_gemma":0.0006574413,"domain_scores_codex":[0.9988025,0.0003427988,0.0001518955,0.0002104735,0.0003835203,0.0001087972],"domain_scores_gemma":[0.9932095,0.005534455,0.0003188449,0.0002735276,0.0004906147,0.0001730116],"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.004043676,0.0005858347,0.008177086,0.0008060407,0.0003120187,0.0004269462,0.0007367182,0.03367114,0.4948705,0.0005420684,0.000902758,0.4549252],"study_design_scores_gemma":[0.0001281062,0.002825119,0.03336037,0.00003292982,0.0002212409,0.0004927393,0.0006915274,0.7070208,0.2529968,0.001124837,0.001025985,0.00007953995],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9339767,0.0004270003,0.0641394,0.0001104585,0.0000486112,0.00006683913,0.0001351751,0.0003911598,0.0007044981],"genre_scores_gemma":[0.9486877,0.000161138,0.04989718,0.00003467427,0.0000244207,0.00006341949,0.0002841949,0.00005208407,0.0007951062],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001611619,"threshold_uncertainty_score":0.008523166,"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","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Vladimir Cezar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002908042,0.0005178729,0.0003690775,0.000854554,0.0004008823,0.002051141,0.0007189192,0.0008029561,0.004888689],"category_scores_gemma":[0.001311876,0.0002308492,0.0005292908,0.0004759852,0.001193686,0.00129038,0.0006637312,0.0009486037,0.0008648583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006970668,"about_ca_system_score_gemma":0.0003206019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002491273,"about_ca_topic_score_gemma":0.001070368,"domain_scores_codex":[0.9996983,0.000101073,0.00001304501,0.00007863635,0.00007699179,0.00003201419],"domain_scores_gemma":[0.9995307,0.0001763377,0.00005871287,0.0000813211,0.0001047601,0.00004824931],"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.00005348025,0.000011881,0.0003840872,0.00008622179,0.00001485145,0.0001902986,0.0003176118,0.05299857,0.01443467,0.9144687,0.001374822,0.01566475],"study_design_scores_gemma":[0.00002489485,0.00007240831,0.0006835439,0.00004351555,0.00001984703,0.0003997705,0.0002119579,0.5570508,0.005658511,0.4049961,0.03078672,0.00005191372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0446441,0.002514764,0.8922534,0.0007183576,0.0002239427,0.00004959459,0.0003782441,0.00105922,0.05815841],"genre_scores_gemma":[0.761081,0.001964503,0.224907,0.0002070522,0.0001991847,0.0001431933,0.0002246362,0.0001458987,0.01112758],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004888689,"threshold_uncertainty_score":0.01635426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}